3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
13 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
14 * youngest of the Old Took's daughters); and Mr. Drogo was his second
15 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
16 * either way, as the saying is, if you follow me." --the Gaffer
19 /* This file contains the functions that create, manipulate and optimize
20 * the OP structures that hold a compiled perl program.
22 * A Perl program is compiled into a tree of OPs. Each op contains
23 * structural pointers (eg to its siblings and the next op in the
24 * execution sequence), a pointer to the function that would execute the
25 * op, plus any data specific to that op. For example, an OP_CONST op
26 * points to the pp_const() function and to an SV containing the constant
27 * value. When pp_const() is executed, its job is to push that SV onto the
30 * OPs are mainly created by the newFOO() functions, which are mainly
31 * called from the parser (in perly.y) as the code is parsed. For example
32 * the Perl code $a + $b * $c would cause the equivalent of the following
33 * to be called (oversimplifying a bit):
35 * newBINOP(OP_ADD, flags,
37 * newBINOP(OP_MULTIPLY, flags, newSVREF($b), newSVREF($c))
40 * Note that during the build of miniperl, a temporary copy of this file
41 * is made, called opmini.c.
45 Perl's compiler is essentially a 3-pass compiler with interleaved phases:
49 An execution-order pass
51 The bottom-up pass is represented by all the "newOP" routines and
52 the ck_ routines. The bottom-upness is actually driven by yacc.
53 So at the point that a ck_ routine fires, we have no idea what the
54 context is, either upward in the syntax tree, or either forward or
55 backward in the execution order. (The bottom-up parser builds that
56 part of the execution order it knows about, but if you follow the "next"
57 links around, you'll find it's actually a closed loop through the
60 Whenever the bottom-up parser gets to a node that supplies context to
61 its components, it invokes that portion of the top-down pass that applies
62 to that part of the subtree (and marks the top node as processed, so
63 if a node further up supplies context, it doesn't have to take the
64 plunge again). As a particular subcase of this, as the new node is
65 built, it takes all the closed execution loops of its subcomponents
66 and links them into a new closed loop for the higher level node. But
67 it's still not the real execution order.
69 The actual execution order is not known till we get a grammar reduction
70 to a top-level unit like a subroutine or file that will be called by
71 "name" rather than via a "next" pointer. At that point, we can call
72 into peep() to do that code's portion of the 3rd pass. It has to be
73 recursive, but it's recursive on basic blocks, not on tree nodes.
76 /* To implement user lexical pragmas, there needs to be a way at run time to
77 get the compile time state of %^H for that block. Storing %^H in every
78 block (or even COP) would be very expensive, so a different approach is
79 taken. The (running) state of %^H is serialised into a tree of HE-like
80 structs. Stores into %^H are chained onto the current leaf as a struct
81 refcounted_he * with the key and the value. Deletes from %^H are saved
82 with a value of PL_sv_placeholder. The state of %^H at any point can be
83 turned back into a regular HV by walking back up the tree from that point's
84 leaf, ignoring any key you've already seen (placeholder or not), storing
85 the rest into the HV structure, then removing the placeholders. Hence
86 memory is only used to store the %^H deltas from the enclosing COP, rather
87 than the entire %^H on each COP.
89 To cause actions on %^H to write out the serialisation records, it has
90 magic type 'H'. This magic (itself) does nothing, but its presence causes
91 the values to gain magic type 'h', which has entries for set and clear.
92 C<Perl_magic_sethint> updates C<PL_compiling.cop_hints_hash> with a store
93 record, with deletes written by C<Perl_magic_clearhint>. C<SAVEHINTS>
94 saves the current C<PL_compiling.cop_hints_hash> on the save stack, so that
95 it will be correctly restored when any inner compiling scope is exited.
101 #include "keywords.h"
103 #define CALL_PEEP(o) CALL_FPTR(PL_peepp)(aTHX_ o)
105 #if defined(PL_OP_SLAB_ALLOC)
107 #ifdef PERL_DEBUG_READONLY_OPS
108 # define PERL_SLAB_SIZE 4096
109 # include <sys/mman.h>
112 #ifndef PERL_SLAB_SIZE
113 #define PERL_SLAB_SIZE 2048
117 Perl_Slab_Alloc(pTHX_ size_t sz)
121 * To make incrementing use count easy PL_OpSlab is an I32 *
122 * To make inserting the link to slab PL_OpPtr is I32 **
123 * So compute size in units of sizeof(I32 *) as that is how Pl_OpPtr increments
124 * Add an overhead for pointer to slab and round up as a number of pointers
126 sz = (sz + 2*sizeof(I32 *) -1)/sizeof(I32 *);
127 if ((PL_OpSpace -= sz) < 0) {
128 #ifdef PERL_DEBUG_READONLY_OPS
129 /* We need to allocate chunk by chunk so that we can control the VM
131 PL_OpPtr = (I32**) mmap(0, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE,
132 MAP_ANON|MAP_PRIVATE, -1, 0);
134 DEBUG_m(PerlIO_printf(Perl_debug_log, "mapped %lu at %p\n",
135 (unsigned long) PERL_SLAB_SIZE*sizeof(I32*),
137 if(PL_OpPtr == MAP_FAILED) {
138 perror("mmap failed");
143 PL_OpPtr = (I32 **) PerlMemShared_calloc(PERL_SLAB_SIZE,sizeof(I32*));
148 /* We reserve the 0'th I32 sized chunk as a use count */
149 PL_OpSlab = (I32 *) PL_OpPtr;
150 /* Reduce size by the use count word, and by the size we need.
151 * Latter is to mimic the '-=' in the if() above
153 PL_OpSpace = PERL_SLAB_SIZE - (sizeof(I32)+sizeof(I32 **)-1)/sizeof(I32 **) - sz;
154 /* Allocation pointer starts at the top.
155 Theory: because we build leaves before trunk allocating at end
156 means that at run time access is cache friendly upward
158 PL_OpPtr += PERL_SLAB_SIZE;
160 #ifdef PERL_DEBUG_READONLY_OPS
161 /* We remember this slab. */
162 /* This implementation isn't efficient, but it is simple. */
163 PL_slabs = (I32**) realloc(PL_slabs, sizeof(I32**) * (PL_slab_count + 1));
164 PL_slabs[PL_slab_count++] = PL_OpSlab;
165 DEBUG_m(PerlIO_printf(Perl_debug_log, "Allocate %p\n", PL_OpSlab));
168 assert( PL_OpSpace >= 0 );
169 /* Move the allocation pointer down */
171 assert( PL_OpPtr > (I32 **) PL_OpSlab );
172 *PL_OpPtr = PL_OpSlab; /* Note which slab it belongs to */
173 (*PL_OpSlab)++; /* Increment use count of slab */
174 assert( PL_OpPtr+sz <= ((I32 **) PL_OpSlab + PERL_SLAB_SIZE) );
175 assert( *PL_OpSlab > 0 );
176 return (void *)(PL_OpPtr + 1);
179 #ifdef PERL_DEBUG_READONLY_OPS
181 Perl_pending_Slabs_to_ro(pTHX) {
182 /* Turn all the allocated op slabs read only. */
183 U32 count = PL_slab_count;
184 I32 **const slabs = PL_slabs;
186 /* Reset the array of pending OP slabs, as we're about to turn this lot
187 read only. Also, do it ahead of the loop in case the warn triggers,
188 and a warn handler has an eval */
193 /* Force a new slab for any further allocation. */
197 void *const start = slabs[count];
198 const size_t size = PERL_SLAB_SIZE* sizeof(I32*);
199 if(mprotect(start, size, PROT_READ)) {
200 Perl_warn(aTHX_ "mprotect for %p %lu failed with %d",
201 start, (unsigned long) size, errno);
209 S_Slab_to_rw(pTHX_ void *op)
211 I32 * const * const ptr = (I32 **) op;
212 I32 * const slab = ptr[-1];
214 PERL_ARGS_ASSERT_SLAB_TO_RW;
216 assert( ptr-1 > (I32 **) slab );
217 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
219 if(mprotect(slab, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE)) {
220 Perl_warn(aTHX_ "mprotect RW for %p %lu failed with %d",
221 slab, (unsigned long) PERL_SLAB_SIZE*sizeof(I32*), errno);
226 Perl_op_refcnt_inc(pTHX_ OP *o)
237 Perl_op_refcnt_dec(pTHX_ OP *o)
239 PERL_ARGS_ASSERT_OP_REFCNT_DEC;
244 # define Slab_to_rw(op)
248 Perl_Slab_Free(pTHX_ void *op)
250 I32 * const * const ptr = (I32 **) op;
251 I32 * const slab = ptr[-1];
252 PERL_ARGS_ASSERT_SLAB_FREE;
253 assert( ptr-1 > (I32 **) slab );
254 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
257 if (--(*slab) == 0) {
259 # define PerlMemShared PerlMem
262 #ifdef PERL_DEBUG_READONLY_OPS
263 U32 count = PL_slab_count;
264 /* Need to remove this slab from our list of slabs */
267 if (PL_slabs[count] == slab) {
269 /* Found it. Move the entry at the end to overwrite it. */
270 DEBUG_m(PerlIO_printf(Perl_debug_log,
271 "Deallocate %p by moving %p from %lu to %lu\n",
273 PL_slabs[PL_slab_count - 1],
274 PL_slab_count, count));
275 PL_slabs[count] = PL_slabs[--PL_slab_count];
276 /* Could realloc smaller at this point, but probably not
278 if(munmap(slab, PERL_SLAB_SIZE*sizeof(I32*))) {
279 perror("munmap failed");
287 PerlMemShared_free(slab);
289 if (slab == PL_OpSlab) {
296 * In the following definition, the ", (OP*)0" is just to make the compiler
297 * think the expression is of the right type: croak actually does a Siglongjmp.
299 #define CHECKOP(type,o) \
300 ((PL_op_mask && PL_op_mask[type]) \
301 ? ( op_free((OP*)o), \
302 Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \
304 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
306 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
309 S_gv_ename(pTHX_ GV *gv)
311 SV* const tmpsv = sv_newmortal();
313 PERL_ARGS_ASSERT_GV_ENAME;
315 gv_efullname3(tmpsv, gv, NULL);
316 return SvPV_nolen_const(tmpsv);
320 S_no_fh_allowed(pTHX_ OP *o)
322 PERL_ARGS_ASSERT_NO_FH_ALLOWED;
324 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
330 S_too_few_arguments(pTHX_ OP *o, const char *name)
332 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS;
334 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
339 S_too_many_arguments(pTHX_ OP *o, const char *name)
341 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS;
343 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
348 S_bad_type(pTHX_ I32 n, const char *t, const char *name, const OP *kid)
350 PERL_ARGS_ASSERT_BAD_TYPE;
352 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
353 (int)n, name, t, OP_DESC(kid)));
357 S_no_bareword_allowed(pTHX_ const OP *o)
359 PERL_ARGS_ASSERT_NO_BAREWORD_ALLOWED;
362 return; /* various ok barewords are hidden in extra OP_NULL */
363 qerror(Perl_mess(aTHX_
364 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
368 /* "register" allocation */
371 Perl_allocmy(pTHX_ const char *const name)
375 const bool is_our = (PL_parser->in_my == KEY_our);
377 PERL_ARGS_ASSERT_ALLOCMY;
379 /* complain about "my $<special_var>" etc etc */
383 (USE_UTF8_IN_NAMES && UTF8_IS_START(name[1])) ||
384 (name[1] == '_' && (*name == '$' || name[2]))))
386 /* name[2] is true if strlen(name) > 2 */
387 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
388 yyerror(Perl_form(aTHX_ "Can't use global %c^%c%s in \"%s\"",
389 name[0], toCTRL(name[1]), name + 2,
390 PL_parser->in_my == KEY_state ? "state" : "my"));
392 yyerror(Perl_form(aTHX_ "Can't use global %s in \"%s\"",name,
393 PL_parser->in_my == KEY_state ? "state" : "my"));
397 /* check for duplicate declaration */
398 pad_check_dup(name, is_our, (PL_curstash ? PL_curstash : PL_defstash));
400 if (PL_parser->in_my_stash && *name != '$') {
401 yyerror(Perl_form(aTHX_
402 "Can't declare class for non-scalar %s in \"%s\"",
405 : PL_parser->in_my == KEY_state ? "state" : "my"));
408 /* allocate a spare slot and store the name in that slot */
410 off = pad_add_name(name,
411 PL_parser->in_my_stash,
413 /* $_ is always in main::, even with our */
414 ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash)
418 PL_parser->in_my == KEY_state
420 /* anon sub prototypes contains state vars should always be cloned,
421 * otherwise the state var would be shared between anon subs */
423 if (PL_parser->in_my == KEY_state && CvANON(PL_compcv))
424 CvCLONE_on(PL_compcv);
429 /* free the body of an op without examining its contents.
430 * Always use this rather than FreeOp directly */
433 S_op_destroy(pTHX_ OP *o)
435 if (o->op_latefree) {
443 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a,b)
445 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a)
451 Perl_op_free(pTHX_ OP *o)
458 if (o->op_latefreed) {
465 if (o->op_private & OPpREFCOUNTED) {
476 refcnt = OpREFCNT_dec(o);
479 /* Need to find and remove any pattern match ops from the list
480 we maintain for reset(). */
481 find_and_forget_pmops(o);
491 if (o->op_flags & OPf_KIDS) {
492 register OP *kid, *nextkid;
493 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
494 nextkid = kid->op_sibling; /* Get before next freeing kid */
499 #ifdef PERL_DEBUG_READONLY_OPS
503 /* COP* is not cleared by op_clear() so that we may track line
504 * numbers etc even after null() */
505 if (type == OP_NEXTSTATE || type == OP_DBSTATE
506 || (type == OP_NULL /* the COP might have been null'ed */
507 && ((OPCODE)o->op_targ == OP_NEXTSTATE
508 || (OPCODE)o->op_targ == OP_DBSTATE))) {
513 type = (OPCODE)o->op_targ;
516 if (o->op_latefree) {
522 #ifdef DEBUG_LEAKING_SCALARS
529 Perl_op_clear(pTHX_ OP *o)
534 PERL_ARGS_ASSERT_OP_CLEAR;
537 /* if (o->op_madprop && o->op_madprop->mad_next)
539 /* FIXME for MAD - if I uncomment these two lines t/op/pack.t fails with
540 "modification of a read only value" for a reason I can't fathom why.
541 It's the "" stringification of $_, where $_ was set to '' in a foreach
542 loop, but it defies simplification into a small test case.
543 However, commenting them out has caused ext/List/Util/t/weak.t to fail
546 mad_free(o->op_madprop);
552 switch (o->op_type) {
553 case OP_NULL: /* Was holding old type, if any. */
554 if (PL_madskills && o->op_targ != OP_NULL) {
555 o->op_type = (Optype)o->op_targ;
559 case OP_ENTEREVAL: /* Was holding hints. */
563 if (!(o->op_flags & OPf_REF)
564 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
570 if (! (o->op_type == OP_AELEMFAST && o->op_flags & OPf_SPECIAL)) {
571 /* not an OP_PADAV replacement */
573 if (cPADOPo->op_padix > 0) {
574 /* No GvIN_PAD_off(cGVOPo_gv) here, because other references
575 * may still exist on the pad */
576 pad_swipe(cPADOPo->op_padix, TRUE);
577 cPADOPo->op_padix = 0;
580 SvREFCNT_dec(cSVOPo->op_sv);
581 cSVOPo->op_sv = NULL;
585 case OP_METHOD_NAMED:
588 SvREFCNT_dec(cSVOPo->op_sv);
589 cSVOPo->op_sv = NULL;
592 Even if op_clear does a pad_free for the target of the op,
593 pad_free doesn't actually remove the sv that exists in the pad;
594 instead it lives on. This results in that it could be reused as
595 a target later on when the pad was reallocated.
598 pad_swipe(o->op_targ,1);
607 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
611 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
613 if (cPADOPo->op_padix > 0) {
614 pad_swipe(cPADOPo->op_padix, TRUE);
615 cPADOPo->op_padix = 0;
618 SvREFCNT_dec(cSVOPo->op_sv);
619 cSVOPo->op_sv = NULL;
623 PerlMemShared_free(cPVOPo->op_pv);
624 cPVOPo->op_pv = NULL;
628 op_free(cPMOPo->op_pmreplrootu.op_pmreplroot);
632 if (cPMOPo->op_pmreplrootu.op_pmtargetoff) {
633 /* No GvIN_PAD_off here, because other references may still
634 * exist on the pad */
635 pad_swipe(cPMOPo->op_pmreplrootu.op_pmtargetoff, TRUE);
638 SvREFCNT_dec((SV*)cPMOPo->op_pmreplrootu.op_pmtargetgv);
644 forget_pmop(cPMOPo, 1);
645 cPMOPo->op_pmreplrootu.op_pmreplroot = NULL;
646 /* we use the same protection as the "SAFE" version of the PM_ macros
647 * here since sv_clean_all might release some PMOPs
648 * after PL_regex_padav has been cleared
649 * and the clearing of PL_regex_padav needs to
650 * happen before sv_clean_all
653 if(PL_regex_pad) { /* We could be in destruction */
654 const IV offset = (cPMOPo)->op_pmoffset;
655 ReREFCNT_dec(PM_GETRE(cPMOPo));
656 PL_regex_pad[offset] = &PL_sv_undef;
657 sv_catpvn_nomg(PL_regex_pad[0], (const char *)&offset,
661 ReREFCNT_dec(PM_GETRE(cPMOPo));
662 PM_SETRE(cPMOPo, NULL);
668 if (o->op_targ > 0) {
669 pad_free(o->op_targ);
675 S_cop_free(pTHX_ COP* cop)
677 PERL_ARGS_ASSERT_COP_FREE;
681 if (! specialWARN(cop->cop_warnings))
682 PerlMemShared_free(cop->cop_warnings);
683 Perl_refcounted_he_free(aTHX_ cop->cop_hints_hash);
687 S_forget_pmop(pTHX_ PMOP *const o
693 HV * const pmstash = PmopSTASH(o);
695 PERL_ARGS_ASSERT_FORGET_PMOP;
697 if (pmstash && !SvIS_FREED(pmstash)) {
698 MAGIC * const mg = mg_find((SV*)pmstash, PERL_MAGIC_symtab);
700 PMOP **const array = (PMOP**) mg->mg_ptr;
701 U32 count = mg->mg_len / sizeof(PMOP**);
706 /* Found it. Move the entry at the end to overwrite it. */
707 array[i] = array[--count];
708 mg->mg_len = count * sizeof(PMOP**);
709 /* Could realloc smaller at this point always, but probably
710 not worth it. Probably worth free()ing if we're the
713 Safefree(mg->mg_ptr);
730 S_find_and_forget_pmops(pTHX_ OP *o)
732 PERL_ARGS_ASSERT_FIND_AND_FORGET_PMOPS;
734 if (o->op_flags & OPf_KIDS) {
735 OP *kid = cUNOPo->op_first;
737 switch (kid->op_type) {
742 forget_pmop((PMOP*)kid, 0);
744 find_and_forget_pmops(kid);
745 kid = kid->op_sibling;
751 Perl_op_null(pTHX_ OP *o)
755 PERL_ARGS_ASSERT_OP_NULL;
757 if (o->op_type == OP_NULL)
761 o->op_targ = o->op_type;
762 o->op_type = OP_NULL;
763 o->op_ppaddr = PL_ppaddr[OP_NULL];
767 Perl_op_refcnt_lock(pTHX)
775 Perl_op_refcnt_unlock(pTHX)
782 /* Contextualizers */
784 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
787 Perl_linklist(pTHX_ OP *o)
791 PERL_ARGS_ASSERT_LINKLIST;
796 /* establish postfix order */
797 first = cUNOPo->op_first;
800 o->op_next = LINKLIST(first);
803 if (kid->op_sibling) {
804 kid->op_next = LINKLIST(kid->op_sibling);
805 kid = kid->op_sibling;
819 Perl_scalarkids(pTHX_ OP *o)
821 if (o && o->op_flags & OPf_KIDS) {
823 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
830 S_scalarboolean(pTHX_ OP *o)
834 PERL_ARGS_ASSERT_SCALARBOOLEAN;
836 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
837 if (ckWARN(WARN_SYNTAX)) {
838 const line_t oldline = CopLINE(PL_curcop);
840 if (PL_parser && PL_parser->copline != NOLINE)
841 CopLINE_set(PL_curcop, PL_parser->copline);
842 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
843 CopLINE_set(PL_curcop, oldline);
850 Perl_scalar(pTHX_ OP *o)
855 /* assumes no premature commitment */
856 if (!o || (PL_parser && PL_parser->error_count)
857 || (o->op_flags & OPf_WANT)
858 || o->op_type == OP_RETURN)
863 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
865 switch (o->op_type) {
867 scalar(cBINOPo->op_first);
872 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
876 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
877 if (!kPMOP->op_pmreplrootu.op_pmreplroot)
878 deprecate_old("implicit split to @_");
886 if (o->op_flags & OPf_KIDS) {
887 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
893 kid = cLISTOPo->op_first;
895 while ((kid = kid->op_sibling)) {
901 PL_curcop = &PL_compiling;
906 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
912 PL_curcop = &PL_compiling;
915 if (ckWARN(WARN_VOID))
916 Perl_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
923 Perl_scalarvoid(pTHX_ OP *o)
927 const char* useless = NULL;
931 PERL_ARGS_ASSERT_SCALARVOID;
933 /* trailing mad null ops don't count as "there" for void processing */
935 o->op_type != OP_NULL &&
937 o->op_sibling->op_type == OP_NULL)
940 for (sib = o->op_sibling;
941 sib && sib->op_type == OP_NULL;
942 sib = sib->op_sibling) ;
948 if (o->op_type == OP_NEXTSTATE
949 || o->op_type == OP_DBSTATE
950 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
951 || o->op_targ == OP_DBSTATE)))
952 PL_curcop = (COP*)o; /* for warning below */
954 /* assumes no premature commitment */
955 want = o->op_flags & OPf_WANT;
956 if ((want && want != OPf_WANT_SCALAR)
957 || (PL_parser && PL_parser->error_count)
958 || o->op_type == OP_RETURN)
963 if ((o->op_private & OPpTARGET_MY)
964 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
966 return scalar(o); /* As if inside SASSIGN */
969 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
971 switch (o->op_type) {
973 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
977 if (o->op_flags & OPf_STACKED)
981 if (o->op_private == 4)
1024 case OP_GETSOCKNAME:
1025 case OP_GETPEERNAME:
1030 case OP_GETPRIORITY:
1054 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1055 /* Otherwise it's "Useless use of grep iterator" */
1056 useless = OP_DESC(o);
1060 kid = cUNOPo->op_first;
1061 if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST &&
1062 kid->op_type != OP_TRANS) {
1065 useless = "negative pattern binding (!~)";
1072 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1073 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1074 useless = "a variable";
1079 if (cSVOPo->op_private & OPpCONST_STRICT)
1080 no_bareword_allowed(o);
1082 if (ckWARN(WARN_VOID)) {
1084 SV* msv = sv_2mortal(Perl_newSVpvf(aTHX_
1085 "a constant (%"SVf")", sv));
1086 useless = SvPV_nolen(msv);
1089 useless = "a constant (undef)";
1090 if (o->op_private & OPpCONST_ARYBASE)
1092 /* don't warn on optimised away booleans, eg
1093 * use constant Foo, 5; Foo || print; */
1094 if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT)
1096 /* the constants 0 and 1 are permitted as they are
1097 conventionally used as dummies in constructs like
1098 1 while some_condition_with_side_effects; */
1099 else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1101 else if (SvPOK(sv)) {
1102 /* perl4's way of mixing documentation and code
1103 (before the invention of POD) was based on a
1104 trick to mix nroff and perl code. The trick was
1105 built upon these three nroff macros being used in
1106 void context. The pink camel has the details in
1107 the script wrapman near page 319. */
1108 const char * const maybe_macro = SvPVX_const(sv);
1109 if (strnEQ(maybe_macro, "di", 2) ||
1110 strnEQ(maybe_macro, "ds", 2) ||
1111 strnEQ(maybe_macro, "ig", 2))
1116 op_null(o); /* don't execute or even remember it */
1120 o->op_type = OP_PREINC; /* pre-increment is faster */
1121 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1125 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1126 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1130 o->op_type = OP_I_PREINC; /* pre-increment is faster */
1131 o->op_ppaddr = PL_ppaddr[OP_I_PREINC];
1135 o->op_type = OP_I_PREDEC; /* pre-decrement is faster */
1136 o->op_ppaddr = PL_ppaddr[OP_I_PREDEC];
1141 kid = cLOGOPo->op_first;
1142 if (kid->op_type == OP_NOT
1143 && (kid->op_flags & OPf_KIDS)
1145 if (o->op_type == OP_AND) {
1147 o->op_ppaddr = PL_ppaddr[OP_OR];
1149 o->op_type = OP_AND;
1150 o->op_ppaddr = PL_ppaddr[OP_AND];
1159 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1164 if (o->op_flags & OPf_STACKED)
1171 if (!(o->op_flags & OPf_KIDS))
1182 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1189 /* all requires must return a boolean value */
1190 o->op_flags &= ~OPf_WANT;
1195 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1196 if (!kPMOP->op_pmreplrootu.op_pmreplroot)
1197 deprecate_old("implicit split to @_");
1201 if (useless && ckWARN(WARN_VOID))
1202 Perl_warner(aTHX_ packWARN(WARN_VOID), "Useless use of %s in void context", useless);
1207 Perl_listkids(pTHX_ OP *o)
1209 if (o && o->op_flags & OPf_KIDS) {
1211 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1218 Perl_list(pTHX_ OP *o)
1223 /* assumes no premature commitment */
1224 if (!o || (o->op_flags & OPf_WANT)
1225 || (PL_parser && PL_parser->error_count)
1226 || o->op_type == OP_RETURN)
1231 if ((o->op_private & OPpTARGET_MY)
1232 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1234 return o; /* As if inside SASSIGN */
1237 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1239 switch (o->op_type) {
1242 list(cBINOPo->op_first);
1247 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1255 if (!(o->op_flags & OPf_KIDS))
1257 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1258 list(cBINOPo->op_first);
1259 return gen_constant_list(o);
1266 kid = cLISTOPo->op_first;
1268 while ((kid = kid->op_sibling)) {
1269 if (kid->op_sibling)
1274 PL_curcop = &PL_compiling;
1278 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1279 if (kid->op_sibling)
1284 PL_curcop = &PL_compiling;
1287 /* all requires must return a boolean value */
1288 o->op_flags &= ~OPf_WANT;
1295 Perl_scalarseq(pTHX_ OP *o)
1299 const OPCODE type = o->op_type;
1301 if (type == OP_LINESEQ || type == OP_SCOPE ||
1302 type == OP_LEAVE || type == OP_LEAVETRY)
1305 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1306 if (kid->op_sibling) {
1310 PL_curcop = &PL_compiling;
1312 o->op_flags &= ~OPf_PARENS;
1313 if (PL_hints & HINT_BLOCK_SCOPE)
1314 o->op_flags |= OPf_PARENS;
1317 o = newOP(OP_STUB, 0);
1322 S_modkids(pTHX_ OP *o, I32 type)
1324 if (o && o->op_flags & OPf_KIDS) {
1326 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1332 /* Propagate lvalue ("modifiable") context to an op and its children.
1333 * 'type' represents the context type, roughly based on the type of op that
1334 * would do the modifying, although local() is represented by OP_NULL.
1335 * It's responsible for detecting things that can't be modified, flag
1336 * things that need to behave specially in an lvalue context (e.g., "$$x = 5"
1337 * might have to vivify a reference in $x), and so on.
1339 * For example, "$a+1 = 2" would cause mod() to be called with o being
1340 * OP_ADD and type being OP_SASSIGN, and would output an error.
1344 Perl_mod(pTHX_ OP *o, I32 type)
1348 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
1351 if (!o || (PL_parser && PL_parser->error_count))
1354 if ((o->op_private & OPpTARGET_MY)
1355 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1360 switch (o->op_type) {
1366 if (!(o->op_private & OPpCONST_ARYBASE))
1369 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1370 CopARYBASE_set(&PL_compiling,
1371 (I32)SvIV(cSVOPx(PL_eval_start)->op_sv));
1375 SAVECOPARYBASE(&PL_compiling);
1376 CopARYBASE_set(&PL_compiling, 0);
1378 else if (type == OP_REFGEN)
1381 Perl_croak(aTHX_ "That use of $[ is unsupported");
1384 if ((o->op_flags & OPf_PARENS) || PL_madskills)
1388 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1389 !(o->op_flags & OPf_STACKED)) {
1390 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1391 /* The default is to set op_private to the number of children,
1392 which for a UNOP such as RV2CV is always 1. And w're using
1393 the bit for a flag in RV2CV, so we need it clear. */
1394 o->op_private &= ~1;
1395 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1396 assert(cUNOPo->op_first->op_type == OP_NULL);
1397 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1400 else if (o->op_private & OPpENTERSUB_NOMOD)
1402 else { /* lvalue subroutine call */
1403 o->op_private |= OPpLVAL_INTRO;
1404 PL_modcount = RETURN_UNLIMITED_NUMBER;
1405 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1406 /* Backward compatibility mode: */
1407 o->op_private |= OPpENTERSUB_INARGS;
1410 else { /* Compile-time error message: */
1411 OP *kid = cUNOPo->op_first;
1415 if (kid->op_type != OP_PUSHMARK) {
1416 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1418 "panic: unexpected lvalue entersub "
1419 "args: type/targ %ld:%"UVuf,
1420 (long)kid->op_type, (UV)kid->op_targ);
1421 kid = kLISTOP->op_first;
1423 while (kid->op_sibling)
1424 kid = kid->op_sibling;
1425 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1427 if (kid->op_type == OP_METHOD_NAMED
1428 || kid->op_type == OP_METHOD)
1432 NewOp(1101, newop, 1, UNOP);
1433 newop->op_type = OP_RV2CV;
1434 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1435 newop->op_first = NULL;
1436 newop->op_next = (OP*)newop;
1437 kid->op_sibling = (OP*)newop;
1438 newop->op_private |= OPpLVAL_INTRO;
1439 newop->op_private &= ~1;
1443 if (kid->op_type != OP_RV2CV)
1445 "panic: unexpected lvalue entersub "
1446 "entry via type/targ %ld:%"UVuf,
1447 (long)kid->op_type, (UV)kid->op_targ);
1448 kid->op_private |= OPpLVAL_INTRO;
1449 break; /* Postpone until runtime */
1453 kid = kUNOP->op_first;
1454 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1455 kid = kUNOP->op_first;
1456 if (kid->op_type == OP_NULL)
1458 "Unexpected constant lvalue entersub "
1459 "entry via type/targ %ld:%"UVuf,
1460 (long)kid->op_type, (UV)kid->op_targ);
1461 if (kid->op_type != OP_GV) {
1462 /* Restore RV2CV to check lvalueness */
1464 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1465 okid->op_next = kid->op_next;
1466 kid->op_next = okid;
1469 okid->op_next = NULL;
1470 okid->op_type = OP_RV2CV;
1472 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1473 okid->op_private |= OPpLVAL_INTRO;
1474 okid->op_private &= ~1;
1478 cv = GvCV(kGVOP_gv);
1488 /* grep, foreach, subcalls, refgen */
1489 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1491 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1492 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1494 : (o->op_type == OP_ENTERSUB
1495 ? "non-lvalue subroutine call"
1497 type ? PL_op_desc[type] : "local"));
1511 case OP_RIGHT_SHIFT:
1520 if (!(o->op_flags & OPf_STACKED))
1527 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1533 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1534 PL_modcount = RETURN_UNLIMITED_NUMBER;
1535 return o; /* Treat \(@foo) like ordinary list. */
1539 if (scalar_mod_type(o, type))
1541 ref(cUNOPo->op_first, o->op_type);
1545 if (type == OP_LEAVESUBLV)
1546 o->op_private |= OPpMAYBE_LVSUB;
1552 PL_modcount = RETURN_UNLIMITED_NUMBER;
1555 ref(cUNOPo->op_first, o->op_type);
1560 PL_hints |= HINT_BLOCK_SCOPE;
1575 PL_modcount = RETURN_UNLIMITED_NUMBER;
1576 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1577 return o; /* Treat \(@foo) like ordinary list. */
1578 if (scalar_mod_type(o, type))
1580 if (type == OP_LEAVESUBLV)
1581 o->op_private |= OPpMAYBE_LVSUB;
1585 if (!type) /* local() */
1586 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1587 PAD_COMPNAME_PV(o->op_targ));
1595 if (type != OP_SASSIGN)
1599 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1604 if (type == OP_LEAVESUBLV)
1605 o->op_private |= OPpMAYBE_LVSUB;
1607 pad_free(o->op_targ);
1608 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1609 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1610 if (o->op_flags & OPf_KIDS)
1611 mod(cBINOPo->op_first->op_sibling, type);
1616 ref(cBINOPo->op_first, o->op_type);
1617 if (type == OP_ENTERSUB &&
1618 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1619 o->op_private |= OPpLVAL_DEFER;
1620 if (type == OP_LEAVESUBLV)
1621 o->op_private |= OPpMAYBE_LVSUB;
1631 if (o->op_flags & OPf_KIDS)
1632 mod(cLISTOPo->op_last, type);
1637 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1639 else if (!(o->op_flags & OPf_KIDS))
1641 if (o->op_targ != OP_LIST) {
1642 mod(cBINOPo->op_first, type);
1648 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1653 if (type != OP_LEAVESUBLV)
1655 break; /* mod()ing was handled by ck_return() */
1658 /* [20011101.069] File test operators interpret OPf_REF to mean that
1659 their argument is a filehandle; thus \stat(".") should not set
1661 if (type == OP_REFGEN &&
1662 PL_check[o->op_type] == MEMBER_TO_FPTR(Perl_ck_ftst))
1665 if (type != OP_LEAVESUBLV)
1666 o->op_flags |= OPf_MOD;
1668 if (type == OP_AASSIGN || type == OP_SASSIGN)
1669 o->op_flags |= OPf_SPECIAL|OPf_REF;
1670 else if (!type) { /* local() */
1673 o->op_private |= OPpLVAL_INTRO;
1674 o->op_flags &= ~OPf_SPECIAL;
1675 PL_hints |= HINT_BLOCK_SCOPE;
1680 if (ckWARN(WARN_SYNTAX)) {
1681 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
1682 "Useless localization of %s", OP_DESC(o));
1686 else if (type != OP_GREPSTART && type != OP_ENTERSUB
1687 && type != OP_LEAVESUBLV)
1688 o->op_flags |= OPf_REF;
1693 S_scalar_mod_type(const OP *o, I32 type)
1695 PERL_ARGS_ASSERT_SCALAR_MOD_TYPE;
1699 if (o->op_type == OP_RV2GV)
1723 case OP_RIGHT_SHIFT:
1743 S_is_handle_constructor(const OP *o, I32 numargs)
1745 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
1747 switch (o->op_type) {
1755 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1768 Perl_refkids(pTHX_ OP *o, I32 type)
1770 if (o && o->op_flags & OPf_KIDS) {
1772 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1779 Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
1784 PERL_ARGS_ASSERT_DOREF;
1786 if (!o || (PL_parser && PL_parser->error_count))
1789 switch (o->op_type) {
1791 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1792 !(o->op_flags & OPf_STACKED)) {
1793 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1794 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1795 assert(cUNOPo->op_first->op_type == OP_NULL);
1796 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1797 o->op_flags |= OPf_SPECIAL;
1798 o->op_private &= ~1;
1803 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1804 doref(kid, type, set_op_ref);
1807 if (type == OP_DEFINED)
1808 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1809 doref(cUNOPo->op_first, o->op_type, set_op_ref);
1812 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1813 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1814 : type == OP_RV2HV ? OPpDEREF_HV
1816 o->op_flags |= OPf_MOD;
1823 o->op_flags |= OPf_REF;
1826 if (type == OP_DEFINED)
1827 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1828 doref(cUNOPo->op_first, o->op_type, set_op_ref);
1834 o->op_flags |= OPf_REF;
1839 if (!(o->op_flags & OPf_KIDS))
1841 doref(cBINOPo->op_first, type, set_op_ref);
1845 doref(cBINOPo->op_first, o->op_type, set_op_ref);
1846 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1847 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1848 : type == OP_RV2HV ? OPpDEREF_HV
1850 o->op_flags |= OPf_MOD;
1860 if (!(o->op_flags & OPf_KIDS))
1862 doref(cLISTOPo->op_last, type, set_op_ref);
1872 S_dup_attrlist(pTHX_ OP *o)
1877 PERL_ARGS_ASSERT_DUP_ATTRLIST;
1879 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1880 * where the first kid is OP_PUSHMARK and the remaining ones
1881 * are OP_CONST. We need to push the OP_CONST values.
1883 if (o->op_type == OP_CONST)
1884 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
1886 else if (o->op_type == OP_NULL)
1890 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1892 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1893 if (o->op_type == OP_CONST)
1894 rop = append_elem(OP_LIST, rop,
1895 newSVOP(OP_CONST, o->op_flags,
1896 SvREFCNT_inc_NN(cSVOPo->op_sv)));
1903 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
1908 PERL_ARGS_ASSERT_APPLY_ATTRS;
1910 /* fake up C<use attributes $pkg,$rv,@attrs> */
1911 ENTER; /* need to protect against side-effects of 'use' */
1912 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
1914 #define ATTRSMODULE "attributes"
1915 #define ATTRSMODULE_PM "attributes.pm"
1918 /* Don't force the C<use> if we don't need it. */
1919 SV * const * const svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
1920 if (svp && *svp != &PL_sv_undef)
1921 NOOP; /* already in %INC */
1923 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
1924 newSVpvs(ATTRSMODULE), NULL);
1927 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1928 newSVpvs(ATTRSMODULE),
1930 prepend_elem(OP_LIST,
1931 newSVOP(OP_CONST, 0, stashsv),
1932 prepend_elem(OP_LIST,
1933 newSVOP(OP_CONST, 0,
1935 dup_attrlist(attrs))));
1941 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
1944 OP *pack, *imop, *arg;
1947 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
1952 assert(target->op_type == OP_PADSV ||
1953 target->op_type == OP_PADHV ||
1954 target->op_type == OP_PADAV);
1956 /* Ensure that attributes.pm is loaded. */
1957 apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE);
1959 /* Need package name for method call. */
1960 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
1962 /* Build up the real arg-list. */
1963 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
1965 arg = newOP(OP_PADSV, 0);
1966 arg->op_targ = target->op_targ;
1967 arg = prepend_elem(OP_LIST,
1968 newSVOP(OP_CONST, 0, stashsv),
1969 prepend_elem(OP_LIST,
1970 newUNOP(OP_REFGEN, 0,
1971 mod(arg, OP_REFGEN)),
1972 dup_attrlist(attrs)));
1974 /* Fake up a method call to import */
1975 meth = newSVpvs_share("import");
1976 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
1977 append_elem(OP_LIST,
1978 prepend_elem(OP_LIST, pack, list(arg)),
1979 newSVOP(OP_METHOD_NAMED, 0, meth)));
1980 imop->op_private |= OPpENTERSUB_NOMOD;
1982 /* Combine the ops. */
1983 *imopsp = append_elem(OP_LIST, *imopsp, imop);
1987 =notfor apidoc apply_attrs_string
1989 Attempts to apply a list of attributes specified by the C<attrstr> and
1990 C<len> arguments to the subroutine identified by the C<cv> argument which
1991 is expected to be associated with the package identified by the C<stashpv>
1992 argument (see L<attributes>). It gets this wrong, though, in that it
1993 does not correctly identify the boundaries of the individual attribute
1994 specifications within C<attrstr>. This is not really intended for the
1995 public API, but has to be listed here for systems such as AIX which
1996 need an explicit export list for symbols. (It's called from XS code
1997 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
1998 to respect attribute syntax properly would be welcome.
2004 Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
2005 const char *attrstr, STRLEN len)
2009 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2012 len = strlen(attrstr);
2016 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2018 const char * const sstr = attrstr;
2019 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2020 attrs = append_elem(OP_LIST, attrs,
2021 newSVOP(OP_CONST, 0,
2022 newSVpvn(sstr, attrstr-sstr)));
2026 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2027 newSVpvs(ATTRSMODULE),
2028 NULL, prepend_elem(OP_LIST,
2029 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2030 prepend_elem(OP_LIST,
2031 newSVOP(OP_CONST, 0,
2037 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
2042 PERL_ARGS_ASSERT_MY_KID;
2044 if (!o || (PL_parser && PL_parser->error_count))
2048 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2049 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2053 if (type == OP_LIST) {
2055 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2056 my_kid(kid, attrs, imopsp);
2057 } else if (type == OP_UNDEF
2063 } else if (type == OP_RV2SV || /* "our" declaration */
2065 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
2066 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
2067 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2069 PL_parser->in_my == KEY_our
2071 : PL_parser->in_my == KEY_state ? "state" : "my"));
2073 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
2074 PL_parser->in_my = FALSE;
2075 PL_parser->in_my_stash = NULL;
2076 apply_attrs(GvSTASH(gv),
2077 (type == OP_RV2SV ? GvSV(gv) :
2078 type == OP_RV2AV ? (SV*)GvAV(gv) :
2079 type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)gv),
2082 o->op_private |= OPpOUR_INTRO;
2085 else if (type != OP_PADSV &&
2088 type != OP_PUSHMARK)
2090 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2092 PL_parser->in_my == KEY_our
2094 : PL_parser->in_my == KEY_state ? "state" : "my"));
2097 else if (attrs && type != OP_PUSHMARK) {
2100 PL_parser->in_my = FALSE;
2101 PL_parser->in_my_stash = NULL;
2103 /* check for C<my Dog $spot> when deciding package */
2104 stash = PAD_COMPNAME_TYPE(o->op_targ);
2106 stash = PL_curstash;
2107 apply_attrs_my(stash, o, attrs, imopsp);
2109 o->op_flags |= OPf_MOD;
2110 o->op_private |= OPpLVAL_INTRO;
2111 if (PL_parser->in_my == KEY_state)
2112 o->op_private |= OPpPAD_STATE;
2117 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2121 int maybe_scalar = 0;
2123 PERL_ARGS_ASSERT_MY_ATTRS;
2125 /* [perl #17376]: this appears to be premature, and results in code such as
2126 C< our(%x); > executing in list mode rather than void mode */
2128 if (o->op_flags & OPf_PARENS)
2138 o = my_kid(o, attrs, &rops);
2140 if (maybe_scalar && o->op_type == OP_PADSV) {
2141 o = scalar(append_list(OP_LIST, (LISTOP*)rops, (LISTOP*)o));
2142 o->op_private |= OPpLVAL_INTRO;
2145 o = append_list(OP_LIST, (LISTOP*)o, (LISTOP*)rops);
2147 PL_parser->in_my = FALSE;
2148 PL_parser->in_my_stash = NULL;
2153 Perl_my(pTHX_ OP *o)
2155 PERL_ARGS_ASSERT_MY;
2157 return my_attrs(o, NULL);
2161 Perl_sawparens(pTHX_ OP *o)
2163 PERL_UNUSED_CONTEXT;
2165 o->op_flags |= OPf_PARENS;
2170 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2174 const OPCODE ltype = left->op_type;
2175 const OPCODE rtype = right->op_type;
2177 PERL_ARGS_ASSERT_BIND_MATCH;
2179 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2180 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
2182 const char * const desc
2183 = PL_op_desc[(rtype == OP_SUBST || rtype == OP_TRANS)
2184 ? (int)rtype : OP_MATCH];
2185 const char * const sample = ((ltype == OP_RV2AV || ltype == OP_PADAV)
2186 ? "@array" : "%hash");
2187 Perl_warner(aTHX_ packWARN(WARN_MISC),
2188 "Applying %s to %s will act on scalar(%s)",
2189 desc, sample, sample);
2192 if (rtype == OP_CONST &&
2193 cSVOPx(right)->op_private & OPpCONST_BARE &&
2194 cSVOPx(right)->op_private & OPpCONST_STRICT)
2196 no_bareword_allowed(right);
2199 ismatchop = rtype == OP_MATCH ||
2200 rtype == OP_SUBST ||
2202 if (ismatchop && right->op_private & OPpTARGET_MY) {
2204 right->op_private &= ~OPpTARGET_MY;
2206 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
2209 right->op_flags |= OPf_STACKED;
2210 if (rtype != OP_MATCH &&
2211 ! (rtype == OP_TRANS &&
2212 right->op_private & OPpTRANS_IDENTICAL))
2213 newleft = mod(left, rtype);
2216 if (right->op_type == OP_TRANS)
2217 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
2219 o = prepend_elem(rtype, scalar(newleft), right);
2221 return newUNOP(OP_NOT, 0, scalar(o));
2225 return bind_match(type, left,
2226 pmruntime(newPMOP(OP_MATCH, 0), right, 0));
2230 Perl_invert(pTHX_ OP *o)
2234 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2238 Perl_scope(pTHX_ OP *o)
2242 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2243 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2244 o->op_type = OP_LEAVE;
2245 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2247 else if (o->op_type == OP_LINESEQ) {
2249 o->op_type = OP_SCOPE;
2250 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2251 kid = ((LISTOP*)o)->op_first;
2252 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2255 /* The following deals with things like 'do {1 for 1}' */
2256 kid = kid->op_sibling;
2258 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
2263 o = newLISTOP(OP_SCOPE, 0, o, NULL);
2269 Perl_block_start(pTHX_ int full)
2272 const int retval = PL_savestack_ix;
2273 pad_block_start(full);
2275 PL_hints &= ~HINT_BLOCK_SCOPE;
2276 SAVECOMPILEWARNINGS();
2277 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
2282 Perl_block_end(pTHX_ I32 floor, OP *seq)
2285 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2286 OP* const retval = scalarseq(seq);
2288 CopHINTS_set(&PL_compiling, PL_hints);
2290 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2299 const PADOFFSET offset = pad_findmy("$_");
2300 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
2301 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2304 OP * const o = newOP(OP_PADSV, 0);
2305 o->op_targ = offset;
2311 Perl_newPROG(pTHX_ OP *o)
2315 PERL_ARGS_ASSERT_NEWPROG;
2320 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2321 ((PL_in_eval & EVAL_KEEPERR)
2322 ? OPf_SPECIAL : 0), o);
2323 PL_eval_start = linklist(PL_eval_root);
2324 PL_eval_root->op_private |= OPpREFCOUNTED;
2325 OpREFCNT_set(PL_eval_root, 1);
2326 PL_eval_root->op_next = 0;
2327 CALL_PEEP(PL_eval_start);
2330 if (o->op_type == OP_STUB) {
2331 PL_comppad_name = 0;
2333 S_op_destroy(aTHX_ o);
2336 PL_main_root = scope(sawparens(scalarvoid(o)));
2337 PL_curcop = &PL_compiling;
2338 PL_main_start = LINKLIST(PL_main_root);
2339 PL_main_root->op_private |= OPpREFCOUNTED;
2340 OpREFCNT_set(PL_main_root, 1);
2341 PL_main_root->op_next = 0;
2342 CALL_PEEP(PL_main_start);
2345 /* Register with debugger */
2348 = Perl_get_cvn_flags(aTHX_ STR_WITH_LEN("DB::postponed"), 0);
2352 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2354 call_sv((SV*)cv, G_DISCARD);
2361 Perl_localize(pTHX_ OP *o, I32 lex)
2365 PERL_ARGS_ASSERT_LOCALIZE;
2367 if (o->op_flags & OPf_PARENS)
2368 /* [perl #17376]: this appears to be premature, and results in code such as
2369 C< our(%x); > executing in list mode rather than void mode */
2376 if ( PL_parser->bufptr > PL_parser->oldbufptr
2377 && PL_parser->bufptr[-1] == ','
2378 && ckWARN(WARN_PARENTHESIS))
2380 char *s = PL_parser->bufptr;
2383 /* some heuristics to detect a potential error */
2384 while (*s && (strchr(", \t\n", *s)))
2388 if (*s && strchr("@$%*", *s) && *++s
2389 && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) {
2392 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)))
2394 while (*s && (strchr(", \t\n", *s)))
2400 if (sigil && (*s == ';' || *s == '=')) {
2401 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
2402 "Parentheses missing around \"%s\" list",
2404 ? (PL_parser->in_my == KEY_our
2406 : PL_parser->in_my == KEY_state
2416 o = mod(o, OP_NULL); /* a bit kludgey */
2417 PL_parser->in_my = FALSE;
2418 PL_parser->in_my_stash = NULL;
2423 Perl_jmaybe(pTHX_ OP *o)
2425 PERL_ARGS_ASSERT_JMAYBE;
2427 if (o->op_type == OP_LIST) {
2429 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
2430 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2436 Perl_fold_constants(pTHX_ register OP *o)
2439 register OP * VOL curop;
2441 VOL I32 type = o->op_type;
2446 SV * const oldwarnhook = PL_warnhook;
2447 SV * const olddiehook = PL_diehook;
2451 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
2453 if (PL_opargs[type] & OA_RETSCALAR)
2455 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2456 o->op_targ = pad_alloc(type, SVs_PADTMP);
2458 /* integerize op, unless it happens to be C<-foo>.
2459 * XXX should pp_i_negate() do magic string negation instead? */
2460 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2461 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2462 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2464 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2467 if (!(PL_opargs[type] & OA_FOLDCONST))
2472 /* XXX might want a ck_negate() for this */
2473 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2484 /* XXX what about the numeric ops? */
2485 if (PL_hints & HINT_LOCALE)
2490 if (PL_parser && PL_parser->error_count)
2491 goto nope; /* Don't try to run w/ errors */
2493 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2494 const OPCODE type = curop->op_type;
2495 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
2497 type != OP_SCALAR &&
2499 type != OP_PUSHMARK)
2505 curop = LINKLIST(o);
2506 old_next = o->op_next;
2510 oldscope = PL_scopestack_ix;
2511 create_eval_scope(G_FAKINGEVAL);
2513 /* Verify that we don't need to save it: */
2514 assert(PL_curcop == &PL_compiling);
2515 StructCopy(&PL_compiling, ¬_compiling, COP);
2516 PL_curcop = ¬_compiling;
2517 /* The above ensures that we run with all the correct hints of the
2518 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
2519 assert(IN_PERL_RUNTIME);
2520 PL_warnhook = PERL_WARNHOOK_FATAL;
2527 sv = *(PL_stack_sp--);
2528 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2529 pad_swipe(o->op_targ, FALSE);
2530 else if (SvTEMP(sv)) { /* grab mortal temp? */
2531 SvREFCNT_inc_simple_void(sv);
2536 /* Something tried to die. Abandon constant folding. */
2537 /* Pretend the error never happened. */
2539 o->op_next = old_next;
2543 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
2544 PL_warnhook = oldwarnhook;
2545 PL_diehook = olddiehook;
2546 /* XXX note that this croak may fail as we've already blown away
2547 * the stack - eg any nested evals */
2548 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
2551 PL_warnhook = oldwarnhook;
2552 PL_diehook = olddiehook;
2553 PL_curcop = &PL_compiling;
2555 if (PL_scopestack_ix > oldscope)
2556 delete_eval_scope();
2565 if (type == OP_RV2GV)
2566 newop = newGVOP(OP_GV, 0, (GV*)sv);
2568 newop = newSVOP(OP_CONST, 0, (SV*)sv);
2569 op_getmad(o,newop,'f');
2577 Perl_gen_constant_list(pTHX_ register OP *o)
2581 const I32 oldtmps_floor = PL_tmps_floor;
2584 if (PL_parser && PL_parser->error_count)
2585 return o; /* Don't attempt to run with errors */
2587 PL_op = curop = LINKLIST(o);
2593 assert (!(curop->op_flags & OPf_SPECIAL));
2594 assert(curop->op_type == OP_RANGE);
2596 PL_tmps_floor = oldtmps_floor;
2598 o->op_type = OP_RV2AV;
2599 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2600 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
2601 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
2602 o->op_opt = 0; /* needs to be revisited in peep() */
2603 curop = ((UNOP*)o)->op_first;
2604 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
2606 op_getmad(curop,o,'O');
2615 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2618 if (!o || o->op_type != OP_LIST)
2619 o = newLISTOP(OP_LIST, 0, o, NULL);
2621 o->op_flags &= ~OPf_WANT;
2623 if (!(PL_opargs[type] & OA_MARK))
2624 op_null(cLISTOPo->op_first);
2626 o->op_type = (OPCODE)type;
2627 o->op_ppaddr = PL_ppaddr[type];
2628 o->op_flags |= flags;
2630 o = CHECKOP(type, o);
2631 if (o->op_type != (unsigned)type)
2634 return fold_constants(o);
2637 /* List constructors */
2640 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2648 if (first->op_type != (unsigned)type
2649 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2651 return newLISTOP(type, 0, first, last);
2654 if (first->op_flags & OPf_KIDS)
2655 ((LISTOP*)first)->op_last->op_sibling = last;
2657 first->op_flags |= OPf_KIDS;
2658 ((LISTOP*)first)->op_first = last;
2660 ((LISTOP*)first)->op_last = last;
2665 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2673 if (first->op_type != (unsigned)type)
2674 return prepend_elem(type, (OP*)first, (OP*)last);
2676 if (last->op_type != (unsigned)type)
2677 return append_elem(type, (OP*)first, (OP*)last);
2679 first->op_last->op_sibling = last->op_first;
2680 first->op_last = last->op_last;
2681 first->op_flags |= (last->op_flags & OPf_KIDS);
2684 if (last->op_first && first->op_madprop) {
2685 MADPROP *mp = last->op_first->op_madprop;
2687 while (mp->mad_next)
2689 mp->mad_next = first->op_madprop;
2692 last->op_first->op_madprop = first->op_madprop;
2695 first->op_madprop = last->op_madprop;
2696 last->op_madprop = 0;
2699 S_op_destroy(aTHX_ (OP*)last);
2705 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2713 if (last->op_type == (unsigned)type) {
2714 if (type == OP_LIST) { /* already a PUSHMARK there */
2715 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2716 ((LISTOP*)last)->op_first->op_sibling = first;
2717 if (!(first->op_flags & OPf_PARENS))
2718 last->op_flags &= ~OPf_PARENS;
2721 if (!(last->op_flags & OPf_KIDS)) {
2722 ((LISTOP*)last)->op_last = first;
2723 last->op_flags |= OPf_KIDS;
2725 first->op_sibling = ((LISTOP*)last)->op_first;
2726 ((LISTOP*)last)->op_first = first;
2728 last->op_flags |= OPf_KIDS;
2732 return newLISTOP(type, 0, first, last);
2740 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
2743 Newxz(tk, 1, TOKEN);
2744 tk->tk_type = (OPCODE)optype;
2745 tk->tk_type = 12345;
2747 tk->tk_mad = madprop;
2752 Perl_token_free(pTHX_ TOKEN* tk)
2754 PERL_ARGS_ASSERT_TOKEN_FREE;
2756 if (tk->tk_type != 12345)
2758 mad_free(tk->tk_mad);
2763 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
2768 PERL_ARGS_ASSERT_TOKEN_GETMAD;
2770 if (tk->tk_type != 12345) {
2771 Perl_warner(aTHX_ packWARN(WARN_MISC),
2772 "Invalid TOKEN object ignored");
2779 /* faked up qw list? */
2781 tm->mad_type == MAD_SV &&
2782 SvPVX((SV*)tm->mad_val)[0] == 'q')
2789 /* pretend constant fold didn't happen? */
2790 if (mp->mad_key == 'f' &&
2791 (o->op_type == OP_CONST ||
2792 o->op_type == OP_GV) )
2794 token_getmad(tk,(OP*)mp->mad_val,slot);
2808 if (mp->mad_key == 'X')
2809 mp->mad_key = slot; /* just change the first one */
2819 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
2828 /* pretend constant fold didn't happen? */
2829 if (mp->mad_key == 'f' &&
2830 (o->op_type == OP_CONST ||
2831 o->op_type == OP_GV) )
2833 op_getmad(from,(OP*)mp->mad_val,slot);
2840 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
2843 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
2849 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
2858 /* pretend constant fold didn't happen? */
2859 if (mp->mad_key == 'f' &&
2860 (o->op_type == OP_CONST ||
2861 o->op_type == OP_GV) )
2863 op_getmad(from,(OP*)mp->mad_val,slot);
2870 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
2873 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
2877 PerlIO_printf(PerlIO_stderr(),
2878 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
2884 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
2902 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
2906 addmad(tm, &(o->op_madprop), slot);
2910 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
2931 Perl_newMADsv(pTHX_ char key, SV* sv)
2933 PERL_ARGS_ASSERT_NEWMADSV;
2935 return newMADPROP(key, MAD_SV, sv, 0);
2939 Perl_newMADPROP(pTHX_ char key, char type, const void* val, I32 vlen)
2942 Newxz(mp, 1, MADPROP);
2945 mp->mad_vlen = vlen;
2946 mp->mad_type = type;
2948 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
2953 Perl_mad_free(pTHX_ MADPROP* mp)
2955 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
2959 mad_free(mp->mad_next);
2960 /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
2961 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
2962 switch (mp->mad_type) {
2966 Safefree((char*)mp->mad_val);
2969 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
2970 op_free((OP*)mp->mad_val);
2973 sv_free((SV*)mp->mad_val);
2976 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
2985 Perl_newNULLLIST(pTHX)
2987 return newOP(OP_STUB, 0);
2991 Perl_force_list(pTHX_ OP *o)
2993 if (!o || o->op_type != OP_LIST)
2994 o = newLISTOP(OP_LIST, 0, o, NULL);
3000 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3005 NewOp(1101, listop, 1, LISTOP);
3007 listop->op_type = (OPCODE)type;
3008 listop->op_ppaddr = PL_ppaddr[type];
3011 listop->op_flags = (U8)flags;
3015 else if (!first && last)
3018 first->op_sibling = last;
3019 listop->op_first = first;
3020 listop->op_last = last;
3021 if (type == OP_LIST) {
3022 OP* const pushop = newOP(OP_PUSHMARK, 0);
3023 pushop->op_sibling = first;
3024 listop->op_first = pushop;
3025 listop->op_flags |= OPf_KIDS;
3027 listop->op_last = pushop;
3030 return CHECKOP(type, listop);
3034 Perl_newOP(pTHX_ I32 type, I32 flags)
3038 NewOp(1101, o, 1, OP);
3039 o->op_type = (OPCODE)type;
3040 o->op_ppaddr = PL_ppaddr[type];
3041 o->op_flags = (U8)flags;
3043 o->op_latefreed = 0;
3047 o->op_private = (U8)(0 | (flags >> 8));
3048 if (PL_opargs[type] & OA_RETSCALAR)
3050 if (PL_opargs[type] & OA_TARGET)
3051 o->op_targ = pad_alloc(type, SVs_PADTMP);
3052 return CHECKOP(type, o);
3056 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
3062 first = newOP(OP_STUB, 0);
3063 if (PL_opargs[type] & OA_MARK)
3064 first = force_list(first);
3066 NewOp(1101, unop, 1, UNOP);
3067 unop->op_type = (OPCODE)type;
3068 unop->op_ppaddr = PL_ppaddr[type];
3069 unop->op_first = first;
3070 unop->op_flags = (U8)(flags | OPf_KIDS);
3071 unop->op_private = (U8)(1 | (flags >> 8));
3072 unop = (UNOP*) CHECKOP(type, unop);
3076 return fold_constants((OP *) unop);
3080 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3084 NewOp(1101, binop, 1, BINOP);
3087 first = newOP(OP_NULL, 0);
3089 binop->op_type = (OPCODE)type;
3090 binop->op_ppaddr = PL_ppaddr[type];
3091 binop->op_first = first;
3092 binop->op_flags = (U8)(flags | OPf_KIDS);
3095 binop->op_private = (U8)(1 | (flags >> 8));
3098 binop->op_private = (U8)(2 | (flags >> 8));
3099 first->op_sibling = last;
3102 binop = (BINOP*)CHECKOP(type, binop);
3103 if (binop->op_next || binop->op_type != (OPCODE)type)
3106 binop->op_last = binop->op_first->op_sibling;
3108 return fold_constants((OP *)binop);
3111 static int uvcompare(const void *a, const void *b)
3112 __attribute__nonnull__(1)
3113 __attribute__nonnull__(2)
3114 __attribute__pure__;
3115 static int uvcompare(const void *a, const void *b)
3117 if (*((const UV *)a) < (*(const UV *)b))
3119 if (*((const UV *)a) > (*(const UV *)b))
3121 if (*((const UV *)a+1) < (*(const UV *)b+1))
3123 if (*((const UV *)a+1) > (*(const UV *)b+1))
3129 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
3132 SV * const tstr = ((SVOP*)expr)->op_sv;
3135 (repl->op_type == OP_NULL)
3136 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
3138 ((SVOP*)repl)->op_sv;
3141 const U8 *t = (U8*)SvPV_const(tstr, tlen);
3142 const U8 *r = (U8*)SvPV_const(rstr, rlen);
3146 register short *tbl;
3148 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
3149 const I32 squash = o->op_private & OPpTRANS_SQUASH;
3150 I32 del = o->op_private & OPpTRANS_DELETE;
3153 PERL_ARGS_ASSERT_PMTRANS;
3155 PL_hints |= HINT_BLOCK_SCOPE;
3158 o->op_private |= OPpTRANS_FROM_UTF;
3161 o->op_private |= OPpTRANS_TO_UTF;
3163 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
3164 SV* const listsv = newSVpvs("# comment\n");
3166 const U8* tend = t + tlen;
3167 const U8* rend = r + rlen;
3181 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
3182 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
3185 const U32 flags = UTF8_ALLOW_DEFAULT;
3189 t = tsave = bytes_to_utf8(t, &len);
3192 if (!to_utf && rlen) {
3194 r = rsave = bytes_to_utf8(r, &len);
3198 /* There are several snags with this code on EBCDIC:
3199 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
3200 2. scan_const() in toke.c has encoded chars in native encoding which makes
3201 ranges at least in EBCDIC 0..255 range the bottom odd.
3205 U8 tmpbuf[UTF8_MAXBYTES+1];
3208 Newx(cp, 2*tlen, UV);
3210 transv = newSVpvs("");
3212 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3214 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
3216 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3220 cp[2*i+1] = cp[2*i];
3224 qsort(cp, i, 2*sizeof(UV), uvcompare);
3225 for (j = 0; j < i; j++) {
3227 diff = val - nextmin;
3229 t = uvuni_to_utf8(tmpbuf,nextmin);
3230 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3232 U8 range_mark = UTF_TO_NATIVE(0xff);
3233 t = uvuni_to_utf8(tmpbuf, val - 1);
3234 sv_catpvn(transv, (char *)&range_mark, 1);
3235 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3242 t = uvuni_to_utf8(tmpbuf,nextmin);
3243 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3245 U8 range_mark = UTF_TO_NATIVE(0xff);
3246 sv_catpvn(transv, (char *)&range_mark, 1);
3248 t = uvuni_to_utf8_flags(tmpbuf, 0x7fffffff,
3249 UNICODE_ALLOW_SUPER);
3250 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3251 t = (const U8*)SvPVX_const(transv);
3252 tlen = SvCUR(transv);
3256 else if (!rlen && !del) {
3257 r = t; rlen = tlen; rend = tend;
3260 if ((!rlen && !del) || t == r ||
3261 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
3263 o->op_private |= OPpTRANS_IDENTICAL;
3267 while (t < tend || tfirst <= tlast) {
3268 /* see if we need more "t" chars */
3269 if (tfirst > tlast) {
3270 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3272 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
3274 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3281 /* now see if we need more "r" chars */
3282 if (rfirst > rlast) {
3284 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3286 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
3288 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3297 rfirst = rlast = 0xffffffff;
3301 /* now see which range will peter our first, if either. */
3302 tdiff = tlast - tfirst;
3303 rdiff = rlast - rfirst;
3310 if (rfirst == 0xffffffff) {
3311 diff = tdiff; /* oops, pretend rdiff is infinite */
3313 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
3314 (long)tfirst, (long)tlast);
3316 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
3320 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
3321 (long)tfirst, (long)(tfirst + diff),
3324 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
3325 (long)tfirst, (long)rfirst);
3327 if (rfirst + diff > max)
3328 max = rfirst + diff;
3330 grows = (tfirst < rfirst &&
3331 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
3343 else if (max > 0xff)
3348 PerlMemShared_free(cPVOPo->op_pv);
3349 cPVOPo->op_pv = NULL;
3351 swash = (SV*)swash_init("utf8", "", listsv, bits, none);
3353 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP);
3354 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
3355 PAD_SETSV(cPADOPo->op_padix, swash);
3358 cSVOPo->op_sv = swash;
3360 SvREFCNT_dec(listsv);
3361 SvREFCNT_dec(transv);
3363 if (!del && havefinal && rlen)
3364 (void)hv_store((HV*)SvRV(swash), "FINAL", 5,
3365 newSVuv((UV)final), 0);
3368 o->op_private |= OPpTRANS_GROWS;
3374 op_getmad(expr,o,'e');
3375 op_getmad(repl,o,'r');
3383 tbl = (short*)cPVOPo->op_pv;
3385 Zero(tbl, 256, short);
3386 for (i = 0; i < (I32)tlen; i++)
3388 for (i = 0, j = 0; i < 256; i++) {
3390 if (j >= (I32)rlen) {
3399 if (i < 128 && r[j] >= 128)
3409 o->op_private |= OPpTRANS_IDENTICAL;
3411 else if (j >= (I32)rlen)
3416 PerlMemShared_realloc(tbl,
3417 (0x101+rlen-j) * sizeof(short));
3418 cPVOPo->op_pv = (char*)tbl;
3420 tbl[0x100] = (short)(rlen - j);
3421 for (i=0; i < (I32)rlen - j; i++)
3422 tbl[0x101+i] = r[j+i];
3426 if (!rlen && !del) {
3429 o->op_private |= OPpTRANS_IDENTICAL;
3431 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
3432 o->op_private |= OPpTRANS_IDENTICAL;
3434 for (i = 0; i < 256; i++)
3436 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
3437 if (j >= (I32)rlen) {
3439 if (tbl[t[i]] == -1)
3445 if (tbl[t[i]] == -1) {
3446 if (t[i] < 128 && r[j] >= 128)
3453 o->op_private |= OPpTRANS_GROWS;
3455 op_getmad(expr,o,'e');
3456 op_getmad(repl,o,'r');
3466 Perl_newPMOP(pTHX_ I32 type, I32 flags)
3471 NewOp(1101, pmop, 1, PMOP);
3472 pmop->op_type = (OPCODE)type;
3473 pmop->op_ppaddr = PL_ppaddr[type];
3474 pmop->op_flags = (U8)flags;
3475 pmop->op_private = (U8)(0 | (flags >> 8));
3477 if (PL_hints & HINT_RE_TAINT)
3478 pmop->op_pmflags |= PMf_RETAINT;
3479 if (PL_hints & HINT_LOCALE)
3480 pmop->op_pmflags |= PMf_LOCALE;
3484 assert(SvPOK(PL_regex_pad[0]));
3485 if (SvCUR(PL_regex_pad[0])) {
3486 /* Pop off the "packed" IV from the end. */
3487 SV *const repointer_list = PL_regex_pad[0];
3488 const char *p = SvEND(repointer_list) - sizeof(IV);
3489 const IV offset = *((IV*)p);
3491 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
3493 SvEND_set(repointer_list, p);
3495 pmop->op_pmoffset = offset;
3496 /* This slot should be free, so assert this: */
3497 assert(PL_regex_pad[offset] == &PL_sv_undef);
3499 SV * const repointer = &PL_sv_undef;
3500 av_push(PL_regex_padav, repointer);
3501 pmop->op_pmoffset = av_len(PL_regex_padav);
3502 PL_regex_pad = AvARRAY(PL_regex_padav);
3506 return CHECKOP(type, pmop);
3509 /* Given some sort of match op o, and an expression expr containing a
3510 * pattern, either compile expr into a regex and attach it to o (if it's
3511 * constant), or convert expr into a runtime regcomp op sequence (if it's
3514 * isreg indicates that the pattern is part of a regex construct, eg
3515 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
3516 * split "pattern", which aren't. In the former case, expr will be a list
3517 * if the pattern contains more than one term (eg /a$b/) or if it contains
3518 * a replacement, ie s/// or tr///.
3522 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg)
3527 I32 repl_has_vars = 0;
3531 PERL_ARGS_ASSERT_PMRUNTIME;
3533 if (o->op_type == OP_SUBST || o->op_type == OP_TRANS) {
3534 /* last element in list is the replacement; pop it */
3536 repl = cLISTOPx(expr)->op_last;
3537 kid = cLISTOPx(expr)->op_first;
3538 while (kid->op_sibling != repl)
3539 kid = kid->op_sibling;
3540 kid->op_sibling = NULL;
3541 cLISTOPx(expr)->op_last = kid;
3544 if (isreg && expr->op_type == OP_LIST &&
3545 cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last)
3547 /* convert single element list to element */
3548 OP* const oe = expr;
3549 expr = cLISTOPx(oe)->op_first->op_sibling;
3550 cLISTOPx(oe)->op_first->op_sibling = NULL;
3551 cLISTOPx(oe)->op_last = NULL;
3555 if (o->op_type == OP_TRANS) {
3556 return pmtrans(o, expr, repl);
3559 reglist = isreg && expr->op_type == OP_LIST;
3563 PL_hints |= HINT_BLOCK_SCOPE;
3566 if (expr->op_type == OP_CONST) {
3567 SV *pat = ((SVOP*)expr)->op_sv;
3568 U32 pm_flags = pm->op_pmflags & PMf_COMPILETIME;
3570 if (o->op_flags & OPf_SPECIAL)
3571 pm_flags |= RXf_SPLIT;
3574 assert (SvUTF8(pat));
3575 } else if (SvUTF8(pat)) {
3576 /* Not doing UTF-8, despite what the SV says. Is this only if we're
3577 trapped in use 'bytes'? */
3578 /* Make a copy of the octet sequence, but without the flag on, as
3579 the compiler now honours the SvUTF8 flag on pat. */
3581 const char *const p = SvPV(pat, len);
3582 pat = newSVpvn_flags(p, len, SVs_TEMP);
3585 PM_SETRE(pm, CALLREGCOMP(pat, pm_flags));
3588 op_getmad(expr,(OP*)pm,'e');
3594 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
3595 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
3597 : OP_REGCMAYBE),0,expr);
3599 NewOp(1101, rcop, 1, LOGOP);
3600 rcop->op_type = OP_REGCOMP;
3601 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
3602 rcop->op_first = scalar(expr);
3603 rcop->op_flags |= OPf_KIDS
3604 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
3605 | (reglist ? OPf_STACKED : 0);
3606 rcop->op_private = 1;
3609 rcop->op_targ = pad_alloc(rcop->op_type, SVs_PADTMP);
3611 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
3614 /* establish postfix order */
3615 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
3617 rcop->op_next = expr;
3618 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
3621 rcop->op_next = LINKLIST(expr);
3622 expr->op_next = (OP*)rcop;
3625 prepend_elem(o->op_type, scalar((OP*)rcop), o);
3630 if (pm->op_pmflags & PMf_EVAL) {
3632 if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end)
3633 CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end);
3635 else if (repl->op_type == OP_CONST)
3639 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
3640 if (curop->op_type == OP_SCOPE
3641 || curop->op_type == OP_LEAVE
3642 || (PL_opargs[curop->op_type] & OA_DANGEROUS)) {
3643 if (curop->op_type == OP_GV) {
3644 GV * const gv = cGVOPx_gv(curop);
3646 if (strchr("&`'123456789+-\016\022", *GvENAME(gv)))
3649 else if (curop->op_type == OP_RV2CV)
3651 else if (curop->op_type == OP_RV2SV ||
3652 curop->op_type == OP_RV2AV ||
3653 curop->op_type == OP_RV2HV ||
3654 curop->op_type == OP_RV2GV) {
3655 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
3658 else if (curop->op_type == OP_PADSV ||
3659 curop->op_type == OP_PADAV ||
3660 curop->op_type == OP_PADHV ||
3661 curop->op_type == OP_PADANY)
3665 else if (curop->op_type == OP_PUSHRE)
3666 NOOP; /* Okay here, dangerous in newASSIGNOP */
3676 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
3678 pm->op_pmflags |= PMf_CONST; /* const for long enough */
3679 prepend_elem(o->op_type, scalar(repl), o);
3682 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
3683 pm->op_pmflags |= PMf_MAYBE_CONST;
3685 NewOp(1101, rcop, 1, LOGOP);
3686 rcop->op_type = OP_SUBSTCONT;
3687 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
3688 rcop->op_first = scalar(repl);
3689 rcop->op_flags |= OPf_KIDS;
3690 rcop->op_private = 1;
3693 /* establish postfix order */
3694 rcop->op_next = LINKLIST(repl);
3695 repl->op_next = (OP*)rcop;
3697 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
3698 assert(!(pm->op_pmflags & PMf_ONCE));
3699 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
3708 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3713 PERL_ARGS_ASSERT_NEWSVOP;
3715 NewOp(1101, svop, 1, SVOP);
3716 svop->op_type = (OPCODE)type;
3717 svop->op_ppaddr = PL_ppaddr[type];
3719 svop->op_next = (OP*)svop;
3720 svop->op_flags = (U8)flags;
3721 if (PL_opargs[type] & OA_RETSCALAR)
3723 if (PL_opargs[type] & OA_TARGET)
3724 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3725 return CHECKOP(type, svop);
3730 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3735 PERL_ARGS_ASSERT_NEWPADOP;
3737 NewOp(1101, padop, 1, PADOP);
3738 padop->op_type = (OPCODE)type;
3739 padop->op_ppaddr = PL_ppaddr[type];
3740 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3741 SvREFCNT_dec(PAD_SVl(padop->op_padix));
3742 PAD_SETSV(padop->op_padix, sv);
3745 padop->op_next = (OP*)padop;
3746 padop->op_flags = (U8)flags;
3747 if (PL_opargs[type] & OA_RETSCALAR)
3749 if (PL_opargs[type] & OA_TARGET)
3750 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3751 return CHECKOP(type, padop);
3756 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3760 PERL_ARGS_ASSERT_NEWGVOP;
3764 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
3766 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
3771 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3775 NewOp(1101, pvop, 1, PVOP);
3776 pvop->op_type = (OPCODE)type;
3777 pvop->op_ppaddr = PL_ppaddr[type];
3779 pvop->op_next = (OP*)pvop;
3780 pvop->op_flags = (U8)flags;
3781 if (PL_opargs[type] & OA_RETSCALAR)
3783 if (PL_opargs[type] & OA_TARGET)
3784 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3785 return CHECKOP(type, pvop);
3793 Perl_package(pTHX_ OP *o)
3796 SV *const sv = cSVOPo->op_sv;
3801 PERL_ARGS_ASSERT_PACKAGE;
3803 save_hptr(&PL_curstash);
3804 save_item(PL_curstname);
3806 PL_curstash = gv_stashsv(sv, GV_ADD);
3808 sv_setsv(PL_curstname, sv);
3810 PL_hints |= HINT_BLOCK_SCOPE;
3811 PL_parser->copline = NOLINE;
3812 PL_parser->expect = XSTATE;
3817 if (!PL_madskills) {
3822 pegop = newOP(OP_NULL,0);
3823 op_getmad(o,pegop,'P');
3833 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
3840 OP *pegop = newOP(OP_NULL,0);
3843 PERL_ARGS_ASSERT_UTILIZE;
3845 if (idop->op_type != OP_CONST)
3846 Perl_croak(aTHX_ "Module name must be constant");
3849 op_getmad(idop,pegop,'U');
3854 SV * const vesv = ((SVOP*)version)->op_sv;
3857 op_getmad(version,pegop,'V');
3858 if (!arg && !SvNIOKp(vesv)) {
3865 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3866 Perl_croak(aTHX_ "Version number must be constant number");
3868 /* Make copy of idop so we don't free it twice */
3869 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
3871 /* Fake up a method call to VERSION */
3872 meth = newSVpvs_share("VERSION");
3873 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3874 append_elem(OP_LIST,
3875 prepend_elem(OP_LIST, pack, list(version)),
3876 newSVOP(OP_METHOD_NAMED, 0, meth)));
3880 /* Fake up an import/unimport */
3881 if (arg && arg->op_type == OP_STUB) {
3883 op_getmad(arg,pegop,'S');
3884 imop = arg; /* no import on explicit () */
3886 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
3887 imop = NULL; /* use 5.0; */
3889 idop->op_private |= OPpCONST_NOVER;
3895 op_getmad(arg,pegop,'A');
3897 /* Make copy of idop so we don't free it twice */
3898 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
3900 /* Fake up a method call to import/unimport */
3902 ? newSVpvs_share("import") : newSVpvs_share("unimport");
3903 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3904 append_elem(OP_LIST,
3905 prepend_elem(OP_LIST, pack, list(arg)),
3906 newSVOP(OP_METHOD_NAMED, 0, meth)));
3909 /* Fake up the BEGIN {}, which does its thing immediately. */
3911 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
3914 append_elem(OP_LINESEQ,
3915 append_elem(OP_LINESEQ,
3916 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
3917 newSTATEOP(0, NULL, veop)),
3918 newSTATEOP(0, NULL, imop) ));
3920 /* The "did you use incorrect case?" warning used to be here.
3921 * The problem is that on case-insensitive filesystems one
3922 * might get false positives for "use" (and "require"):
3923 * "use Strict" or "require CARP" will work. This causes
3924 * portability problems for the script: in case-strict
3925 * filesystems the script will stop working.
3927 * The "incorrect case" warning checked whether "use Foo"
3928 * imported "Foo" to your namespace, but that is wrong, too:
3929 * there is no requirement nor promise in the language that
3930 * a Foo.pm should or would contain anything in package "Foo".
3932 * There is very little Configure-wise that can be done, either:
3933 * the case-sensitivity of the build filesystem of Perl does not
3934 * help in guessing the case-sensitivity of the runtime environment.
3937 PL_hints |= HINT_BLOCK_SCOPE;
3938 PL_parser->copline = NOLINE;
3939 PL_parser->expect = XSTATE;
3940 PL_cop_seqmax++; /* Purely for B::*'s benefit */
3943 if (!PL_madskills) {
3944 /* FIXME - don't allocate pegop if !PL_madskills */
3953 =head1 Embedding Functions
3955 =for apidoc load_module
3957 Loads the module whose name is pointed to by the string part of name.
3958 Note that the actual module name, not its filename, should be given.
3959 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
3960 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
3961 (or 0 for no flags). ver, if specified, provides version semantics
3962 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
3963 arguments can be used to specify arguments to the module's import()
3964 method, similar to C<use Foo::Bar VERSION LIST>.
3969 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3973 PERL_ARGS_ASSERT_LOAD_MODULE;
3975 va_start(args, ver);
3976 vload_module(flags, name, ver, &args);
3980 #ifdef PERL_IMPLICIT_CONTEXT
3982 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3986 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
3987 va_start(args, ver);
3988 vload_module(flags, name, ver, &args);
3994 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3998 OP * const modname = newSVOP(OP_CONST, 0, name);
4000 PERL_ARGS_ASSERT_VLOAD_MODULE;
4002 modname->op_private |= OPpCONST_BARE;
4004 veop = newSVOP(OP_CONST, 0, ver);
4008 if (flags & PERL_LOADMOD_NOIMPORT) {
4009 imop = sawparens(newNULLLIST());
4011 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
4012 imop = va_arg(*args, OP*);
4017 sv = va_arg(*args, SV*);
4019 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
4020 sv = va_arg(*args, SV*);
4024 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
4025 * that it has a PL_parser to play with while doing that, and also
4026 * that it doesn't mess with any existing parser, by creating a tmp
4027 * new parser with lex_start(). This won't actually be used for much,
4028 * since pp_require() will create another parser for the real work. */
4031 SAVEVPTR(PL_curcop);
4032 lex_start(NULL, NULL, FALSE);
4033 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
4034 veop, modname, imop);
4039 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
4045 PERL_ARGS_ASSERT_DOFILE;
4047 if (!force_builtin) {
4048 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
4049 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
4050 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
4051 gv = gvp ? *gvp : NULL;
4055 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
4056 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
4057 append_elem(OP_LIST, term,
4058 scalar(newUNOP(OP_RV2CV, 0,
4059 newGVOP(OP_GV, 0, gv))))));
4062 doop = newUNOP(OP_DOFILE, 0, scalar(term));
4068 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
4070 return newBINOP(OP_LSLICE, flags,
4071 list(force_list(subscript)),
4072 list(force_list(listval)) );
4076 S_is_list_assignment(pTHX_ register const OP *o)
4084 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
4085 o = cUNOPo->op_first;
4087 flags = o->op_flags;
4089 if (type == OP_COND_EXPR) {
4090 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
4091 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
4096 yyerror("Assignment to both a list and a scalar");
4100 if (type == OP_LIST &&
4101 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
4102 o->op_private & OPpLVAL_INTRO)
4105 if (type == OP_LIST || flags & OPf_PARENS ||
4106 type == OP_RV2AV || type == OP_RV2HV ||
4107 type == OP_ASLICE || type == OP_HSLICE)
4110 if (type == OP_PADAV || type == OP_PADHV)
4113 if (type == OP_RV2SV)
4120 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
4126 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
4127 return newLOGOP(optype, 0,
4128 mod(scalar(left), optype),
4129 newUNOP(OP_SASSIGN, 0, scalar(right)));
4132 return newBINOP(optype, OPf_STACKED,
4133 mod(scalar(left), optype), scalar(right));
4137 if (is_list_assignment(left)) {
4138 static const char no_list_state[] = "Initialization of state variables"
4139 " in list context currently forbidden";
4141 bool maybe_common_vars = TRUE;
4144 /* Grandfathering $[ assignment here. Bletch.*/
4145 /* Only simple assignments like C<< ($[) = 1 >> are allowed */
4146 PL_eval_start = (left->op_type == OP_CONST) ? right : NULL;
4147 left = mod(left, OP_AASSIGN);
4150 else if (left->op_type == OP_CONST) {
4152 /* Result of assignment is always 1 (or we'd be dead already) */
4153 return newSVOP(OP_CONST, 0, newSViv(1));
4155 curop = list(force_list(left));
4156 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
4157 o->op_private = (U8)(0 | (flags >> 8));
4159 if ((left->op_type == OP_LIST
4160 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
4162 OP* lop = ((LISTOP*)left)->op_first;
4163 maybe_common_vars = FALSE;
4165 if (lop->op_type == OP_PADSV ||
4166 lop->op_type == OP_PADAV ||
4167 lop->op_type == OP_PADHV ||
4168 lop->op_type == OP_PADANY) {
4169 if (!(lop->op_private & OPpLVAL_INTRO))
4170 maybe_common_vars = TRUE;
4172 if (lop->op_private & OPpPAD_STATE) {
4173 if (left->op_private & OPpLVAL_INTRO) {
4174 /* Each variable in state($a, $b, $c) = ... */
4177 /* Each state variable in
4178 (state $a, my $b, our $c, $d, undef) = ... */
4180 yyerror(no_list_state);
4182 /* Each my variable in
4183 (state $a, my $b, our $c, $d, undef) = ... */
4185 } else if (lop->op_type == OP_UNDEF ||
4186 lop->op_type == OP_PUSHMARK) {
4187 /* undef may be interesting in
4188 (state $a, undef, state $c) */
4190 /* Other ops in the list. */
4191 maybe_common_vars = TRUE;
4193 lop = lop->op_sibling;
4196 else if ((left->op_private & OPpLVAL_INTRO)
4197 && ( left->op_type == OP_PADSV
4198 || left->op_type == OP_PADAV
4199 || left->op_type == OP_PADHV
4200 || left->op_type == OP_PADANY))
4202 maybe_common_vars = FALSE;
4203 if (left->op_private & OPpPAD_STATE) {
4204 /* All single variable list context state assignments, hence
4214 yyerror(no_list_state);
4218 /* PL_generation sorcery:
4219 * an assignment like ($a,$b) = ($c,$d) is easier than
4220 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
4221 * To detect whether there are common vars, the global var
4222 * PL_generation is incremented for each assign op we compile.
4223 * Then, while compiling the assign op, we run through all the
4224 * variables on both sides of the assignment, setting a spare slot
4225 * in each of them to PL_generation. If any of them already have
4226 * that value, we know we've got commonality. We could use a
4227 * single bit marker, but then we'd have to make 2 passes, first
4228 * to clear the flag, then to test and set it. To find somewhere
4229 * to store these values, evil chicanery is done with SvUVX().
4232 if (maybe_common_vars) {
4235 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
4236 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
4237 if (curop->op_type == OP_GV) {
4238 GV *gv = cGVOPx_gv(curop);
4240 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4242 GvASSIGN_GENERATION_set(gv, PL_generation);
4244 else if (curop->op_type == OP_PADSV ||
4245 curop->op_type == OP_PADAV ||
4246 curop->op_type == OP_PADHV ||
4247 curop->op_type == OP_PADANY)
4249 if (PAD_COMPNAME_GEN(curop->op_targ)
4250 == (STRLEN)PL_generation)
4252 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
4255 else if (curop->op_type == OP_RV2CV)
4257 else if (curop->op_type == OP_RV2SV ||
4258 curop->op_type == OP_RV2AV ||
4259 curop->op_type == OP_RV2HV ||
4260 curop->op_type == OP_RV2GV) {
4261 if (lastop->op_type != OP_GV) /* funny deref? */
4264 else if (curop->op_type == OP_PUSHRE) {
4266 if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) {
4267 GV *const gv = (GV*)PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff);
4269 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4271 GvASSIGN_GENERATION_set(gv, PL_generation);
4275 = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
4278 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4280 GvASSIGN_GENERATION_set(gv, PL_generation);
4290 o->op_private |= OPpASSIGN_COMMON;
4293 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
4294 OP* tmpop = ((LISTOP*)right)->op_first;
4295 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
4296 PMOP * const pm = (PMOP*)tmpop;
4297 if (left->op_type == OP_RV2AV &&
4298 !(left->op_private & OPpLVAL_INTRO) &&
4299 !(o->op_private & OPpASSIGN_COMMON) )
4301 tmpop = ((UNOP*)left)->op_first;
4302 if (tmpop->op_type == OP_GV
4304 && !pm->op_pmreplrootu.op_pmtargetoff
4306 && !pm->op_pmreplrootu.op_pmtargetgv
4310 pm->op_pmreplrootu.op_pmtargetoff
4311 = cPADOPx(tmpop)->op_padix;
4312 cPADOPx(tmpop)->op_padix = 0; /* steal it */
4314 pm->op_pmreplrootu.op_pmtargetgv
4315 = (GV*)cSVOPx(tmpop)->op_sv;
4316 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
4318 pm->op_pmflags |= PMf_ONCE;
4319 tmpop = cUNOPo->op_first; /* to list (nulled) */
4320 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
4321 tmpop->op_sibling = NULL; /* don't free split */
4322 right->op_next = tmpop->op_next; /* fix starting loc */
4323 op_free(o); /* blow off assign */
4324 right->op_flags &= ~OPf_WANT;
4325 /* "I don't know and I don't care." */
4330 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
4331 ((LISTOP*)right)->op_last->op_type == OP_CONST)
4333 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
4335 sv_setiv(sv, PL_modcount+1);
4343 right = newOP(OP_UNDEF, 0);
4344 if (right->op_type == OP_READLINE) {
4345 right->op_flags |= OPf_STACKED;
4346 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
4349 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
4350 o = newBINOP(OP_SASSIGN, flags,
4351 scalar(right), mod(scalar(left), OP_SASSIGN) );
4355 if (!PL_madskills) { /* assignment to $[ is ignored when making a mad dump */
4357 o = newSVOP(OP_CONST, 0, newSViv(CopARYBASE_get(&PL_compiling)));
4358 o->op_private |= OPpCONST_ARYBASE;
4366 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
4369 const U32 seq = intro_my();
4372 NewOp(1101, cop, 1, COP);
4373 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
4374 cop->op_type = OP_DBSTATE;
4375 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
4378 cop->op_type = OP_NEXTSTATE;
4379 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
4381 cop->op_flags = (U8)flags;
4382 CopHINTS_set(cop, PL_hints);
4384 cop->op_private |= NATIVE_HINTS;
4386 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
4387 cop->op_next = (OP*)cop;
4390 /* CopARYBASE is now "virtual", in that it's stored as a flag bit in
4391 CopHINTS and a possible value in cop_hints_hash, so no need to copy it.
4393 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
4394 cop->cop_hints_hash = PL_curcop->cop_hints_hash;
4395 if (cop->cop_hints_hash) {
4397 cop->cop_hints_hash->refcounted_he_refcnt++;
4398 HINTS_REFCNT_UNLOCK;
4402 = Perl_store_cop_label(aTHX_ cop->cop_hints_hash, label);
4404 PL_hints |= HINT_BLOCK_SCOPE;
4405 /* It seems that we need to defer freeing this pointer, as other parts
4406 of the grammar end up wanting to copy it after this op has been
4411 if (PL_parser && PL_parser->copline == NOLINE)
4412 CopLINE_set(cop, CopLINE(PL_curcop));
4414 CopLINE_set(cop, PL_parser->copline);
4416 PL_parser->copline = NOLINE;
4419 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
4421 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
4423 CopSTASH_set(cop, PL_curstash);
4425 if (PERLDB_LINE && PL_curstash != PL_debstash) {
4426 AV *av = CopFILEAVx(PL_curcop);
4428 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
4429 if (svp && *svp != &PL_sv_undef ) {
4430 (void)SvIOK_on(*svp);
4431 SvIV_set(*svp, PTR2IV(cop));
4436 if (flags & OPf_SPECIAL)
4438 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
4443 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
4447 PERL_ARGS_ASSERT_NEWLOGOP;
4449 return new_logop(type, flags, &first, &other);
4453 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
4458 OP *first = *firstp;
4459 OP *other = *otherp;
4460 int prepend_not = 0;
4462 PERL_ARGS_ASSERT_NEW_LOGOP;
4464 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
4465 return newBINOP(type, flags, scalar(first), scalar(other));
4467 scalarboolean(first);
4468 /* optimize AND and OR ops that have NOTs as children */
4469 if (first->op_type == OP_NOT
4470 && (first->op_flags & OPf_KIDS)
4471 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
4472 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
4474 if (type == OP_AND || type == OP_OR) {
4480 first = *firstp = cUNOPo->op_first;
4482 first->op_next = o->op_next;
4483 cUNOPo->op_first = NULL;
4485 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
4487 other = *otherp = cUNOPo->op_first;
4489 other->op_next = o->op_next;
4490 cUNOPo->op_first = NULL;
4492 prepend_not = 1; /* prepend a NOT op later */
4496 if (first->op_type == OP_CONST) {
4497 if (first->op_private & OPpCONST_STRICT)
4498 no_bareword_allowed(first);
4499 else if ((first->op_private & OPpCONST_BARE) && ckWARN(WARN_BAREWORD))
4500 Perl_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
4501 if ((type == OP_AND && SvTRUE(((SVOP*)first)->op_sv)) ||
4502 (type == OP_OR && !SvTRUE(((SVOP*)first)->op_sv)) ||
4503 (type == OP_DOR && !SvOK(((SVOP*)first)->op_sv))) {
4505 if (other->op_type == OP_CONST)
4506 other->op_private |= OPpCONST_SHORTCIRCUIT;
4508 OP *newop = newUNOP(OP_NULL, 0, other);
4509 op_getmad(first, newop, '1');
4510 newop->op_targ = type; /* set "was" field */
4517 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
4518 const OP *o2 = other;
4519 if ( ! (o2->op_type == OP_LIST
4520 && (( o2 = cUNOPx(o2)->op_first))
4521 && o2->op_type == OP_PUSHMARK
4522 && (( o2 = o2->op_sibling)) )
4525 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
4526 || o2->op_type == OP_PADHV)
4527 && o2->op_private & OPpLVAL_INTRO
4528 && !(o2->op_private & OPpPAD_STATE)
4529 && ckWARN(WARN_DEPRECATED))
4531 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
4532 "Deprecated use of my() in false conditional");
4536 if (first->op_type == OP_CONST)
4537 first->op_private |= OPpCONST_SHORTCIRCUIT;
4539 first = newUNOP(OP_NULL, 0, first);
4540 op_getmad(other, first, '2');
4541 first->op_targ = type; /* set "was" field */
4548 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
4549 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
4551 const OP * const k1 = ((UNOP*)first)->op_first;
4552 const OP * const k2 = k1->op_sibling;
4554 switch (first->op_type)
4557 if (k2 && k2->op_type == OP_READLINE
4558 && (k2->op_flags & OPf_STACKED)
4559 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4561 warnop = k2->op_type;
4566 if (k1->op_type == OP_READDIR
4567 || k1->op_type == OP_GLOB
4568 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4569 || k1->op_type == OP_EACH)
4571 warnop = ((k1->op_type == OP_NULL)
4572 ? (OPCODE)k1->op_targ : k1->op_type);
4577 const line_t oldline = CopLINE(PL_curcop);
4578 CopLINE_set(PL_curcop, PL_parser->copline);
4579 Perl_warner(aTHX_ packWARN(WARN_MISC),
4580 "Value of %s%s can be \"0\"; test with defined()",
4582 ((warnop == OP_READLINE || warnop == OP_GLOB)
4583 ? " construct" : "() operator"));
4584 CopLINE_set(PL_curcop, oldline);
4591 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
4592 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
4594 NewOp(1101, logop, 1, LOGOP);
4596 logop->op_type = (OPCODE)type;
4597 logop->op_ppaddr = PL_ppaddr[type];
4598 logop->op_first = first;
4599 logop->op_flags = (U8)(flags | OPf_KIDS);
4600 logop->op_other = LINKLIST(other);
4601 logop->op_private = (U8)(1 | (flags >> 8));
4603 /* establish postfix order */
4604 logop->op_next = LINKLIST(first);
4605 first->op_next = (OP*)logop;
4606 first->op_sibling = other;
4608 CHECKOP(type,logop);
4610 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
4617 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
4624 PERL_ARGS_ASSERT_NEWCONDOP;
4627 return newLOGOP(OP_AND, 0, first, trueop);
4629 return newLOGOP(OP_OR, 0, first, falseop);
4631 scalarboolean(first);
4632 if (first->op_type == OP_CONST) {
4633 /* Left or right arm of the conditional? */
4634 const bool left = SvTRUE(((SVOP*)first)->op_sv);
4635 OP *live = left ? trueop : falseop;
4636 OP *const dead = left ? falseop : trueop;
4637 if (first->op_private & OPpCONST_BARE &&
4638 first->op_private & OPpCONST_STRICT) {
4639 no_bareword_allowed(first);
4642 /* This is all dead code when PERL_MAD is not defined. */
4643 live = newUNOP(OP_NULL, 0, live);
4644 op_getmad(first, live, 'C');
4645 op_getmad(dead, live, left ? 'e' : 't');
4652 NewOp(1101, logop, 1, LOGOP);
4653 logop->op_type = OP_COND_EXPR;
4654 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
4655 logop->op_first = first;
4656 logop->op_flags = (U8)(flags | OPf_KIDS);
4657 logop->op_private = (U8)(1 | (flags >> 8));
4658 logop->op_other = LINKLIST(trueop);
4659 logop->op_next = LINKLIST(falseop);
4661 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
4664 /* establish postfix order */
4665 start = LINKLIST(first);
4666 first->op_next = (OP*)logop;
4668 first->op_sibling = trueop;
4669 trueop->op_sibling = falseop;
4670 o = newUNOP(OP_NULL, 0, (OP*)logop);
4672 trueop->op_next = falseop->op_next = o;
4679 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
4688 PERL_ARGS_ASSERT_NEWRANGE;
4690 NewOp(1101, range, 1, LOGOP);
4692 range->op_type = OP_RANGE;
4693 range->op_ppaddr = PL_ppaddr[OP_RANGE];
4694 range->op_first = left;
4695 range->op_flags = OPf_KIDS;
4696 leftstart = LINKLIST(left);
4697 range->op_other = LINKLIST(right);
4698 range->op_private = (U8)(1 | (flags >> 8));
4700 left->op_sibling = right;
4702 range->op_next = (OP*)range;
4703 flip = newUNOP(OP_FLIP, flags, (OP*)range);
4704 flop = newUNOP(OP_FLOP, 0, flip);
4705 o = newUNOP(OP_NULL, 0, flop);
4707 range->op_next = leftstart;
4709 left->op_next = flip;
4710 right->op_next = flop;
4712 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4713 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
4714 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4715 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
4717 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4718 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4721 if (!flip->op_private || !flop->op_private)
4722 linklist(o); /* blow off optimizer unless constant */
4728 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
4733 const bool once = block && block->op_flags & OPf_SPECIAL &&
4734 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
4736 PERL_UNUSED_ARG(debuggable);
4739 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
4740 return block; /* do {} while 0 does once */
4741 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
4742 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4743 expr = newUNOP(OP_DEFINED, 0,
4744 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4745 } else if (expr->op_flags & OPf_KIDS) {
4746 const OP * const k1 = ((UNOP*)expr)->op_first;
4747 const OP * const k2 = k1 ? k1->op_sibling : NULL;
4748 switch (expr->op_type) {
4750 if (k2 && k2->op_type == OP_READLINE
4751 && (k2->op_flags & OPf_STACKED)
4752 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4753 expr = newUNOP(OP_DEFINED, 0, expr);
4757 if (k1 && (k1->op_type == OP_READDIR
4758 || k1->op_type == OP_GLOB
4759 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4760 || k1->op_type == OP_EACH))
4761 expr = newUNOP(OP_DEFINED, 0, expr);
4767 /* if block is null, the next append_elem() would put UNSTACK, a scalar
4768 * op, in listop. This is wrong. [perl #27024] */
4770 block = newOP(OP_NULL, 0);
4771 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
4772 o = new_logop(OP_AND, 0, &expr, &listop);
4775 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
4777 if (once && o != listop)
4778 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
4781 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
4783 o->op_flags |= flags;
4785 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
4790 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32
4791 whileline, OP *expr, OP *block, OP *cont, I32 has_my)
4800 PERL_UNUSED_ARG(debuggable);
4803 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
4804 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4805 expr = newUNOP(OP_DEFINED, 0,
4806 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4807 } else if (expr->op_flags & OPf_KIDS) {
4808 const OP * const k1 = ((UNOP*)expr)->op_first;
4809 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
4810 switch (expr->op_type) {
4812 if (k2 && k2->op_type == OP_READLINE
4813 && (k2->op_flags & OPf_STACKED)
4814 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4815 expr = newUNOP(OP_DEFINED, 0, expr);
4819 if (k1 && (k1->op_type == OP_READDIR
4820 || k1->op_type == OP_GLOB
4821 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4822 || k1->op_type == OP_EACH))
4823 expr = newUNOP(OP_DEFINED, 0, expr);
4830 block = newOP(OP_NULL, 0);
4831 else if (cont || has_my) {
4832 block = scope(block);
4836 next = LINKLIST(cont);
4839 OP * const unstack = newOP(OP_UNSTACK, 0);
4842 cont = append_elem(OP_LINESEQ, cont, unstack);
4846 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
4848 redo = LINKLIST(listop);
4851 PL_parser->copline = (line_t)whileline;
4853 o = new_logop(OP_AND, 0, &expr, &listop);
4854 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
4855 op_free(expr); /* oops, it's a while (0) */
4857 return NULL; /* listop already freed by new_logop */
4860 ((LISTOP*)listop)->op_last->op_next =
4861 (o == listop ? redo : LINKLIST(o));
4867 NewOp(1101,loop,1,LOOP);
4868 loop->op_type = OP_ENTERLOOP;
4869 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
4870 loop->op_private = 0;
4871 loop->op_next = (OP*)loop;
4874 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
4876 loop->op_redoop = redo;
4877 loop->op_lastop = o;
4878 o->op_private |= loopflags;
4881 loop->op_nextop = next;
4883 loop->op_nextop = o;
4885 o->op_flags |= flags;
4886 o->op_private |= (flags >> 8);
4891 Perl_newFOROP(pTHX_ I32 flags, char *label, line_t forline, OP *sv, OP *expr, OP *block, OP *cont)
4896 PADOFFSET padoff = 0;
4901 PERL_ARGS_ASSERT_NEWFOROP;
4904 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
4905 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
4906 sv->op_type = OP_RV2GV;
4907 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
4909 /* The op_type check is needed to prevent a possible segfault
4910 * if the loop variable is undeclared and 'strict vars' is in
4911 * effect. This is illegal but is nonetheless parsed, so we
4912 * may reach this point with an OP_CONST where we're expecting
4915 if (cUNOPx(sv)->op_first->op_type == OP_GV
4916 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
4917 iterpflags |= OPpITER_DEF;
4919 else if (sv->op_type == OP_PADSV) { /* private variable */
4920 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
4921 padoff = sv->op_targ;
4931 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
4933 SV *const namesv = PAD_COMPNAME_SV(padoff);
4935 const char *const name = SvPV_const(namesv, len);
4937 if (len == 2 && name[0] == '$' && name[1] == '_')
4938 iterpflags |= OPpITER_DEF;
4942 const PADOFFSET offset = pad_findmy("$_");
4943 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
4944 sv = newGVOP(OP_GV, 0, PL_defgv);
4949 iterpflags |= OPpITER_DEF;
4951 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
4952 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
4953 iterflags |= OPf_STACKED;
4955 else if (expr->op_type == OP_NULL &&
4956 (expr->op_flags & OPf_KIDS) &&
4957 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
4959 /* Basically turn for($x..$y) into the same as for($x,$y), but we
4960 * set the STACKED flag to indicate that these values are to be
4961 * treated as min/max values by 'pp_iterinit'.
4963 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
4964 LOGOP* const range = (LOGOP*) flip->op_first;
4965 OP* const left = range->op_first;
4966 OP* const right = left->op_sibling;
4969 range->op_flags &= ~OPf_KIDS;
4970 range->op_first = NULL;
4972 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
4973 listop->op_first->op_next = range->op_next;
4974 left->op_next = range->op_other;
4975 right->op_next = (OP*)listop;
4976 listop->op_next = listop->op_first;
4979 op_getmad(expr,(OP*)listop,'O');
4983 expr = (OP*)(listop);
4985 iterflags |= OPf_STACKED;
4988 expr = mod(force_list(expr), OP_GREPSTART);
4991 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
4992 append_elem(OP_LIST, expr, scalar(sv))));
4993 assert(!loop->op_next);
4994 /* for my $x () sets OPpLVAL_INTRO;
4995 * for our $x () sets OPpOUR_INTRO */
4996 loop->op_private = (U8)iterpflags;
4997 #ifdef PL_OP_SLAB_ALLOC
5000 NewOp(1234,tmp,1,LOOP);
5001 Copy(loop,tmp,1,LISTOP);
5002 S_op_destroy(aTHX_ (OP*)loop);
5006 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
5008 loop->op_targ = padoff;
5009 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont, 0);
5011 op_getmad(madsv, (OP*)loop, 'v');
5012 PL_parser->copline = forline;
5013 return newSTATEOP(0, label, wop);
5017 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
5022 PERL_ARGS_ASSERT_NEWLOOPEX;
5024 if (type != OP_GOTO || label->op_type == OP_CONST) {
5025 /* "last()" means "last" */
5026 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
5027 o = newOP(type, OPf_SPECIAL);
5029 o = newPVOP(type, 0, savesharedpv(label->op_type == OP_CONST
5030 ? SvPV_nolen_const(((SVOP*)label)->op_sv)
5034 op_getmad(label,o,'L');
5040 /* Check whether it's going to be a goto &function */
5041 if (label->op_type == OP_ENTERSUB
5042 && !(label->op_flags & OPf_STACKED))
5043 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
5044 o = newUNOP(type, OPf_STACKED, label);
5046 PL_hints |= HINT_BLOCK_SCOPE;
5050 /* if the condition is a literal array or hash
5051 (or @{ ... } etc), make a reference to it.
5054 S_ref_array_or_hash(pTHX_ OP *cond)
5057 && (cond->op_type == OP_RV2AV
5058 || cond->op_type == OP_PADAV
5059 || cond->op_type == OP_RV2HV
5060 || cond->op_type == OP_PADHV))
5062 return newUNOP(OP_REFGEN,
5063 0, mod(cond, OP_REFGEN));
5069 /* These construct the optree fragments representing given()
5072 entergiven and enterwhen are LOGOPs; the op_other pointer
5073 points up to the associated leave op. We need this so we
5074 can put it in the context and make break/continue work.
5075 (Also, of course, pp_enterwhen will jump straight to
5076 op_other if the match fails.)
5080 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
5081 I32 enter_opcode, I32 leave_opcode,
5082 PADOFFSET entertarg)
5088 PERL_ARGS_ASSERT_NEWGIVWHENOP;
5090 NewOp(1101, enterop, 1, LOGOP);
5091 enterop->op_type = (Optype)enter_opcode;
5092 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
5093 enterop->op_flags = (U8) OPf_KIDS;
5094 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
5095 enterop->op_private = 0;
5097 o = newUNOP(leave_opcode, 0, (OP *) enterop);
5100 enterop->op_first = scalar(cond);
5101 cond->op_sibling = block;
5103 o->op_next = LINKLIST(cond);
5104 cond->op_next = (OP *) enterop;
5107 /* This is a default {} block */
5108 enterop->op_first = block;
5109 enterop->op_flags |= OPf_SPECIAL;
5111 o->op_next = (OP *) enterop;
5114 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
5115 entergiven and enterwhen both
5118 enterop->op_next = LINKLIST(block);
5119 block->op_next = enterop->op_other = o;
5124 /* Does this look like a boolean operation? For these purposes
5125 a boolean operation is:
5126 - a subroutine call [*]
5127 - a logical connective
5128 - a comparison operator
5129 - a filetest operator, with the exception of -s -M -A -C
5130 - defined(), exists() or eof()
5131 - /$re/ or $foo =~ /$re/
5133 [*] possibly surprising
5136 S_looks_like_bool(pTHX_ const OP *o)
5140 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
5142 switch(o->op_type) {
5144 return looks_like_bool(cLOGOPo->op_first);
5148 looks_like_bool(cLOGOPo->op_first)
5149 && looks_like_bool(cLOGOPo->op_first->op_sibling));
5153 o->op_flags & OPf_KIDS
5154 && looks_like_bool(cUNOPo->op_first));
5158 case OP_NOT: case OP_XOR:
5159 /* Note that OP_DOR is not here */
5161 case OP_EQ: case OP_NE: case OP_LT:
5162 case OP_GT: case OP_LE: case OP_GE:
5164 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
5165 case OP_I_GT: case OP_I_LE: case OP_I_GE:
5167 case OP_SEQ: case OP_SNE: case OP_SLT:
5168 case OP_SGT: case OP_SLE: case OP_SGE:
5172 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
5173 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
5174 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
5175 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
5176 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
5177 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
5178 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
5179 case OP_FTTEXT: case OP_FTBINARY:
5181 case OP_DEFINED: case OP_EXISTS:
5182 case OP_MATCH: case OP_EOF:
5187 /* Detect comparisons that have been optimized away */
5188 if (cSVOPo->op_sv == &PL_sv_yes
5189 || cSVOPo->op_sv == &PL_sv_no)
5200 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
5203 PERL_ARGS_ASSERT_NEWGIVENOP;
5204 return newGIVWHENOP(
5205 ref_array_or_hash(cond),
5207 OP_ENTERGIVEN, OP_LEAVEGIVEN,
5211 /* If cond is null, this is a default {} block */
5213 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
5215 const bool cond_llb = (!cond || looks_like_bool(cond));
5218 PERL_ARGS_ASSERT_NEWWHENOP;
5223 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
5225 scalar(ref_array_or_hash(cond)));
5228 return newGIVWHENOP(
5230 append_elem(block->op_type, block, newOP(OP_BREAK, OPf_SPECIAL)),
5231 OP_ENTERWHEN, OP_LEAVEWHEN, 0);
5235 =for apidoc cv_undef
5237 Clear out all the active components of a CV. This can happen either
5238 by an explicit C<undef &foo>, or by the reference count going to zero.
5239 In the former case, we keep the CvOUTSIDE pointer, so that any anonymous
5240 children can still follow the full lexical scope chain.
5246 Perl_cv_undef(pTHX_ CV *cv)
5250 PERL_ARGS_ASSERT_CV_UNDEF;
5252 DEBUG_X(PerlIO_printf(Perl_debug_log,
5253 "CV undef: cv=0x%"UVxf" comppad=0x%"UVxf"\n",
5254 PTR2UV(cv), PTR2UV(PL_comppad))
5258 if (CvFILE(cv) && !CvISXSUB(cv)) {
5259 /* for XSUBs CvFILE point directly to static memory; __FILE__ */
5260 Safefree(CvFILE(cv));
5265 if (!CvISXSUB(cv) && CvROOT(cv)) {
5266 if (SvTYPE(cv) == SVt_PVCV && CvDEPTH(cv))
5267 Perl_croak(aTHX_ "Can't undef active subroutine");
5270 PAD_SAVE_SETNULLPAD();
5272 op_free(CvROOT(cv));
5277 SvPOK_off((SV*)cv); /* forget prototype */
5282 /* remove CvOUTSIDE unless this is an undef rather than a free */
5283 if (!SvREFCNT(cv) && CvOUTSIDE(cv)) {
5284 if (!CvWEAKOUTSIDE(cv))
5285 SvREFCNT_dec(CvOUTSIDE(cv));
5286 CvOUTSIDE(cv) = NULL;
5289 SvREFCNT_dec((SV*)CvXSUBANY(cv).any_ptr);
5292 if (CvISXSUB(cv) && CvXSUB(cv)) {
5295 /* delete all flags except WEAKOUTSIDE */
5296 CvFLAGS(cv) &= CVf_WEAKOUTSIDE;
5300 Perl_cv_ckproto_len(pTHX_ const CV *cv, const GV *gv, const char *p,
5303 PERL_ARGS_ASSERT_CV_CKPROTO_LEN;
5305 /* Can't just use a strcmp on the prototype, as CONSTSUBs "cheat" by
5306 relying on SvCUR, and doubling up the buffer to hold CvFILE(). */
5307 if (((!p != !SvPOK(cv)) /* One has prototype, one has not. */
5308 || (p && (len != SvCUR(cv) /* Not the same length. */
5309 || memNE(p, SvPVX_const(cv), len))))
5310 && ckWARN_d(WARN_PROTOTYPE)) {
5311 SV* const msg = sv_newmortal();
5315 gv_efullname3(name = sv_newmortal(), gv, NULL);
5316 sv_setpvs(msg, "Prototype mismatch:");
5318 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
5320 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")", SVfARG(cv));
5322 sv_catpvs(msg, ": none");
5323 sv_catpvs(msg, " vs ");
5325 Perl_sv_catpvf(aTHX_ msg, "(%.*s)", (int) len, p);
5327 sv_catpvs(msg, "none");
5328 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
5332 static void const_sv_xsub(pTHX_ CV* cv);
5336 =head1 Optree Manipulation Functions
5338 =for apidoc cv_const_sv
5340 If C<cv> is a constant sub eligible for inlining. returns the constant
5341 value returned by the sub. Otherwise, returns NULL.
5343 Constant subs can be created with C<newCONSTSUB> or as described in
5344 L<perlsub/"Constant Functions">.
5349 Perl_cv_const_sv(pTHX_ CV *cv)
5351 PERL_UNUSED_CONTEXT;
5354 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
5356 return CvCONST(cv) ? (SV*)CvXSUBANY(cv).any_ptr : NULL;
5359 /* op_const_sv: examine an optree to determine whether it's in-lineable.
5360 * Can be called in 3 ways:
5363 * look for a single OP_CONST with attached value: return the value
5365 * cv && CvCLONE(cv) && !CvCONST(cv)
5367 * examine the clone prototype, and if contains only a single
5368 * OP_CONST referencing a pad const, or a single PADSV referencing
5369 * an outer lexical, return a non-zero value to indicate the CV is
5370 * a candidate for "constizing" at clone time
5374 * We have just cloned an anon prototype that was marked as a const
5375 * candidiate. Try to grab the current value, and in the case of
5376 * PADSV, ignore it if it has multiple references. Return the value.
5380 Perl_op_const_sv(pTHX_ const OP *o, CV *cv)
5391 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
5392 o = cLISTOPo->op_first->op_sibling;
5394 for (; o; o = o->op_next) {
5395 const OPCODE type = o->op_type;
5397 if (sv && o->op_next == o)
5399 if (o->op_next != o) {
5400 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
5402 if (type == OP_DBSTATE)
5405 if (type == OP_LEAVESUB || type == OP_RETURN)
5409 if (type == OP_CONST && cSVOPo->op_sv)
5411 else if (cv && type == OP_CONST) {
5412 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
5416 else if (cv && type == OP_PADSV) {
5417 if (CvCONST(cv)) { /* newly cloned anon */
5418 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
5419 /* the candidate should have 1 ref from this pad and 1 ref
5420 * from the parent */
5421 if (!sv || SvREFCNT(sv) != 2)
5428 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
5429 sv = &PL_sv_undef; /* an arbitrary non-null value */
5444 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
5447 /* This would be the return value, but the return cannot be reached. */
5448 OP* pegop = newOP(OP_NULL, 0);
5451 PERL_UNUSED_ARG(floor);
5461 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
5463 NORETURN_FUNCTION_END;
5468 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
5470 return Perl_newATTRSUB(aTHX_ floor, o, proto, NULL, block);
5474 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
5481 register CV *cv = NULL;
5483 /* If the subroutine has no body, no attributes, and no builtin attributes
5484 then it's just a sub declaration, and we may be able to get away with
5485 storing with a placeholder scalar in the symbol table, rather than a
5486 full GV and CV. If anything is present then it will take a full CV to
5488 const I32 gv_fetch_flags
5489 = (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
5491 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
5492 const char * const name = o ? SvPV_nolen_const(cSVOPo->op_sv) : NULL;
5495 assert(proto->op_type == OP_CONST);
5496 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
5501 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
5502 SV * const sv = sv_newmortal();
5503 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
5504 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
5505 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
5506 aname = SvPVX_const(sv);
5511 gv = name ? gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV)
5512 : gv_fetchpv(aname ? aname
5513 : (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
5514 gv_fetch_flags, SVt_PVCV);
5516 if (!PL_madskills) {
5525 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
5526 maximum a prototype before. */
5527 if (SvTYPE(gv) > SVt_NULL) {
5528 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
5529 && ckWARN_d(WARN_PROTOTYPE))
5531 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype");
5533 cv_ckproto_len((CV*)gv, NULL, ps, ps_len);
5536 sv_setpvn((SV*)gv, ps, ps_len);
5538 sv_setiv((SV*)gv, -1);
5540 SvREFCNT_dec(PL_compcv);
5541 cv = PL_compcv = NULL;
5545 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
5547 #ifdef GV_UNIQUE_CHECK
5548 if (cv && GvUNIQUE(gv) && SvREADONLY(cv)) {
5549 Perl_croak(aTHX_ "Can't define subroutine %s (GV is unique)", name);
5553 if (!block || !ps || *ps || attrs
5554 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
5556 || block->op_type == OP_NULL
5561 const_sv = op_const_sv(block, NULL);
5564 const bool exists = CvROOT(cv) || CvXSUB(cv);
5566 #ifdef GV_UNIQUE_CHECK
5567 if (exists && GvUNIQUE(gv)) {
5568 Perl_croak(aTHX_ "Can't redefine unique subroutine %s", name);
5572 /* if the subroutine doesn't exist and wasn't pre-declared
5573 * with a prototype, assume it will be AUTOLOADed,
5574 * skipping the prototype check
5576 if (exists || SvPOK(cv))
5577 cv_ckproto_len(cv, gv, ps, ps_len);
5578 /* already defined (or promised)? */
5579 if (exists || GvASSUMECV(gv)) {
5582 || block->op_type == OP_NULL
5585 if (CvFLAGS(PL_compcv)) {
5586 /* might have had built-in attrs applied */
5587 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
5589 /* just a "sub foo;" when &foo is already defined */
5590 SAVEFREESV(PL_compcv);
5595 && block->op_type != OP_NULL
5598 if (ckWARN(WARN_REDEFINE)
5600 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
5602 const line_t oldline = CopLINE(PL_curcop);
5603 if (PL_parser && PL_parser->copline != NOLINE)
5604 CopLINE_set(PL_curcop, PL_parser->copline);
5605 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
5606 CvCONST(cv) ? "Constant subroutine %s redefined"
5607 : "Subroutine %s redefined", name);
5608 CopLINE_set(PL_curcop, oldline);
5611 if (!PL_minus_c) /* keep old one around for madskills */
5614 /* (PL_madskills unset in used file.) */
5622 SvREFCNT_inc_simple_void_NN(const_sv);
5624 assert(!CvROOT(cv) && !CvCONST(cv));
5625 sv_setpvn((SV*)cv, "", 0); /* prototype is "" */
5626 CvXSUBANY(cv).any_ptr = const_sv;
5627 CvXSUB(cv) = const_sv_xsub;
5633 cv = newCONSTSUB(NULL, name, const_sv);
5635 mro_method_changed_in( /* sub Foo::Bar () { 123 } */
5636 (CvGV(cv) && GvSTASH(CvGV(cv)))
5645 SvREFCNT_dec(PL_compcv);
5653 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
5654 * before we clobber PL_compcv.
5658 || block->op_type == OP_NULL
5662 /* Might have had built-in attributes applied -- propagate them. */
5663 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
5664 if (CvGV(cv) && GvSTASH(CvGV(cv)))
5665 stash = GvSTASH(CvGV(cv));
5666 else if (CvSTASH(cv))
5667 stash = CvSTASH(cv);
5669 stash = PL_curstash;
5672 /* possibly about to re-define existing subr -- ignore old cv */
5673 rcv = (SV*)PL_compcv;
5674 if (name && GvSTASH(gv))
5675 stash = GvSTASH(gv);
5677 stash = PL_curstash;
5679 apply_attrs(stash, rcv, attrs, FALSE);
5681 if (cv) { /* must reuse cv if autoloaded */
5688 || block->op_type == OP_NULL) && !PL_madskills
5691 /* got here with just attrs -- work done, so bug out */
5692 SAVEFREESV(PL_compcv);
5695 /* transfer PL_compcv to cv */
5697 CvFLAGS(cv) = CvFLAGS(PL_compcv);
5698 if (!CvWEAKOUTSIDE(cv))
5699 SvREFCNT_dec(CvOUTSIDE(cv));
5700 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
5701 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
5702 CvOUTSIDE(PL_compcv) = 0;
5703 CvPADLIST(cv) = CvPADLIST(PL_compcv);
5704 CvPADLIST(PL_compcv) = 0;
5705 /* inner references to PL_compcv must be fixed up ... */
5706 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
5707 /* ... before we throw it away */
5708 SvREFCNT_dec(PL_compcv);
5710 if (PERLDB_INTER)/* Advice debugger on the new sub. */
5711 ++PL_sub_generation;
5718 if (strEQ(name, "import")) {
5719 PL_formfeed = (SV*)cv;
5720 Perl_warner(aTHX_ packWARN(WARN_VOID), "%lx\n", (long)cv);
5724 mro_method_changed_in(GvSTASH(gv)); /* sub Foo::bar { (shift)+1 } */
5728 CvFILE_set_from_cop(cv, PL_curcop);
5729 CvSTASH(cv) = PL_curstash;
5732 sv_setpvn((SV*)cv, ps, ps_len);
5734 if (PL_parser && PL_parser->error_count) {
5738 const char *s = strrchr(name, ':');
5740 if (strEQ(s, "BEGIN")) {
5741 const char not_safe[] =
5742 "BEGIN not safe after errors--compilation aborted";
5743 if (PL_in_eval & EVAL_KEEPERR)
5744 Perl_croak(aTHX_ not_safe);
5746 /* force display of errors found but not reported */
5747 sv_catpv(ERRSV, not_safe);
5748 Perl_croak(aTHX_ "%"SVf, SVfARG(ERRSV));
5758 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0,
5759 mod(scalarseq(block), OP_LEAVESUBLV));
5760 block->op_attached = 1;
5763 /* This makes sub {}; work as expected. */
5764 if (block->op_type == OP_STUB) {
5765 OP* const newblock = newSTATEOP(0, NULL, 0);
5767 op_getmad(block,newblock,'B');
5774 block->op_attached = 1;
5775 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
5777 CvROOT(cv)->op_private |= OPpREFCOUNTED;
5778 OpREFCNT_set(CvROOT(cv), 1);
5779 CvSTART(cv) = LINKLIST(CvROOT(cv));
5780 CvROOT(cv)->op_next = 0;
5781 CALL_PEEP(CvSTART(cv));
5783 /* now that optimizer has done its work, adjust pad values */
5785 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
5788 assert(!CvCONST(cv));
5789 if (ps && !*ps && op_const_sv(block, cv))
5793 if (name || aname) {
5794 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
5795 SV * const sv = newSV(0);
5796 SV * const tmpstr = sv_newmortal();
5797 GV * const db_postponed = gv_fetchpvs("DB::postponed",
5798 GV_ADDMULTI, SVt_PVHV);
5801 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
5803 (long)PL_subline, (long)CopLINE(PL_curcop));
5804 gv_efullname3(tmpstr, gv, NULL);
5805 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
5806 SvCUR(tmpstr), sv, 0);
5807 hv = GvHVn(db_postponed);
5808 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvCUR(tmpstr))) {
5809 CV * const pcv = GvCV(db_postponed);
5815 call_sv((SV*)pcv, G_DISCARD);
5820 if (name && ! (PL_parser && PL_parser->error_count))
5821 process_special_blocks(name, gv, cv);
5826 PL_parser->copline = NOLINE;
5832 S_process_special_blocks(pTHX_ const char *const fullname, GV *const gv,
5835 const char *const colon = strrchr(fullname,':');
5836 const char *const name = colon ? colon + 1 : fullname;
5838 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
5841 if (strEQ(name, "BEGIN")) {
5842 const I32 oldscope = PL_scopestack_ix;
5844 SAVECOPFILE(&PL_compiling);
5845 SAVECOPLINE(&PL_compiling);
5847 DEBUG_x( dump_sub(gv) );
5848 Perl_av_create_and_push(aTHX_ &PL_beginav, (SV*)cv);
5849 GvCV(gv) = 0; /* cv has been hijacked */
5850 call_list(oldscope, PL_beginav);
5852 PL_curcop = &PL_compiling;
5853 CopHINTS_set(&PL_compiling, PL_hints);
5860 if strEQ(name, "END") {
5861 DEBUG_x( dump_sub(gv) );
5862 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, (SV*)cv);
5865 } else if (*name == 'U') {
5866 if (strEQ(name, "UNITCHECK")) {
5867 /* It's never too late to run a unitcheck block */
5868 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, (SV*)cv);
5872 } else if (*name == 'C') {
5873 if (strEQ(name, "CHECK")) {
5874 if (PL_main_start && ckWARN(WARN_VOID))
5875 Perl_warner(aTHX_ packWARN(WARN_VOID),
5876 "Too late to run CHECK block");
5877 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, (SV*)cv);
5881 } else if (*name == 'I') {
5882 if (strEQ(name, "INIT")) {
5883 if (PL_main_start && ckWARN(WARN_VOID))
5884 Perl_warner(aTHX_ packWARN(WARN_VOID),
5885 "Too late to run INIT block");
5886 Perl_av_create_and_push(aTHX_ &PL_initav, (SV*)cv);
5892 DEBUG_x( dump_sub(gv) );
5893 GvCV(gv) = 0; /* cv has been hijacked */
5898 =for apidoc newCONSTSUB
5900 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
5901 eligible for inlining at compile-time.
5907 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
5912 const char *const temp_p = CopFILE(PL_curcop);
5913 const STRLEN len = temp_p ? strlen(temp_p) : 0;
5915 SV *const temp_sv = CopFILESV(PL_curcop);
5917 const char *const temp_p = temp_sv ? SvPV_const(temp_sv, len) : NULL;
5919 char *const file = savepvn(temp_p, temp_p ? len : 0);
5923 if (IN_PERL_RUNTIME) {
5924 /* at runtime, it's not safe to manipulate PL_curcop: it may be
5925 * an op shared between threads. Use a non-shared COP for our
5927 SAVEVPTR(PL_curcop);
5928 PL_curcop = &PL_compiling;
5930 SAVECOPLINE(PL_curcop);
5931 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
5934 PL_hints &= ~HINT_BLOCK_SCOPE;
5937 SAVESPTR(PL_curstash);
5938 SAVECOPSTASH(PL_curcop);
5939 PL_curstash = stash;
5940 CopSTASH_set(PL_curcop,stash);
5943 /* file becomes the CvFILE. For an XS, it's supposed to be static storage,
5944 and so doesn't get free()d. (It's expected to be from the C pre-
5945 processor __FILE__ directive). But we need a dynamically allocated one,
5946 and we need it to get freed. */
5947 cv = newXS_flags(name, const_sv_xsub, file, "", XS_DYNAMIC_FILENAME);
5948 CvXSUBANY(cv).any_ptr = sv;
5954 CopSTASH_free(PL_curcop);
5962 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
5963 const char *const filename, const char *const proto,
5966 CV *cv = newXS(name, subaddr, filename);
5968 PERL_ARGS_ASSERT_NEWXS_FLAGS;
5970 if (flags & XS_DYNAMIC_FILENAME) {
5971 /* We need to "make arrangements" (ie cheat) to ensure that the
5972 filename lasts as long as the PVCV we just created, but also doesn't
5974 STRLEN filename_len = strlen(filename);
5975 STRLEN proto_and_file_len = filename_len;
5976 char *proto_and_file;
5980 proto_len = strlen(proto);
5981 proto_and_file_len += proto_len;
5983 Newx(proto_and_file, proto_and_file_len + 1, char);
5984 Copy(proto, proto_and_file, proto_len, char);
5985 Copy(filename, proto_and_file + proto_len, filename_len + 1, char);
5988 proto_and_file = savepvn(filename, filename_len);
5991 /* This gets free()d. :-) */
5992 sv_usepvn_flags((SV*)cv, proto_and_file, proto_and_file_len,
5993 SV_HAS_TRAILING_NUL);
5995 /* This gives us the correct prototype, rather than one with the
5996 file name appended. */
5997 SvCUR_set(cv, proto_len);
6001 CvFILE(cv) = proto_and_file + proto_len;
6003 sv_setpv((SV *)cv, proto);
6009 =for apidoc U||newXS
6011 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
6012 static storage, as it is used directly as CvFILE(), without a copy being made.
6018 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
6021 GV * const gv = gv_fetchpv(name ? name :
6022 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
6023 GV_ADDMULTI, SVt_PVCV);
6026 PERL_ARGS_ASSERT_NEWXS;
6029 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
6031 if ((cv = (name ? GvCV(gv) : NULL))) {
6033 /* just a cached method */
6037 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
6038 /* already defined (or promised) */
6039 /* XXX It's possible for this HvNAME_get to return null, and get passed into strEQ */
6040 if (ckWARN(WARN_REDEFINE)) {
6041 GV * const gvcv = CvGV(cv);
6043 HV * const stash = GvSTASH(gvcv);
6045 const char *redefined_name = HvNAME_get(stash);
6046 if ( strEQ(redefined_name,"autouse") ) {
6047 const line_t oldline = CopLINE(PL_curcop);
6048 if (PL_parser && PL_parser->copline != NOLINE)
6049 CopLINE_set(PL_curcop, PL_parser->copline);
6050 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6051 CvCONST(cv) ? "Constant subroutine %s redefined"
6052 : "Subroutine %s redefined"
6054 CopLINE_set(PL_curcop, oldline);
6064 if (cv) /* must reuse cv if autoloaded */
6067 cv = (CV*)newSV_type(SVt_PVCV);
6071 mro_method_changed_in(GvSTASH(gv)); /* newXS */
6075 (void)gv_fetchfile(filename);
6076 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
6077 an external constant string */
6079 CvXSUB(cv) = subaddr;
6082 process_special_blocks(name, gv, cv);
6094 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
6099 OP* pegop = newOP(OP_NULL, 0);
6103 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
6104 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
6106 #ifdef GV_UNIQUE_CHECK
6108 Perl_croak(aTHX_ "Bad symbol for form (GV is unique)");
6112 if ((cv = GvFORM(gv))) {
6113 if (ckWARN(WARN_REDEFINE)) {
6114 const line_t oldline = CopLINE(PL_curcop);
6115 if (PL_parser && PL_parser->copline != NOLINE)
6116 CopLINE_set(PL_curcop, PL_parser->copline);
6117 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6118 o ? "Format %"SVf" redefined"
6119 : "Format STDOUT redefined", SVfARG(cSVOPo->op_sv));
6120 CopLINE_set(PL_curcop, oldline);
6127 CvFILE_set_from_cop(cv, PL_curcop);
6130 pad_tidy(padtidy_FORMAT);
6131 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
6132 CvROOT(cv)->op_private |= OPpREFCOUNTED;
6133 OpREFCNT_set(CvROOT(cv), 1);
6134 CvSTART(cv) = LINKLIST(CvROOT(cv));
6135 CvROOT(cv)->op_next = 0;
6136 CALL_PEEP(CvSTART(cv));
6138 op_getmad(o,pegop,'n');
6139 op_getmad_weak(block, pegop, 'b');
6144 PL_parser->copline = NOLINE;
6152 Perl_newANONLIST(pTHX_ OP *o)
6154 return convert(OP_ANONLIST, OPf_SPECIAL, o);
6158 Perl_newANONHASH(pTHX_ OP *o)
6160 return convert(OP_ANONHASH, OPf_SPECIAL, o);
6164 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
6166 return newANONATTRSUB(floor, proto, NULL, block);
6170 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
6172 return newUNOP(OP_REFGEN, 0,
6173 newSVOP(OP_ANONCODE, 0,
6174 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
6178 Perl_oopsAV(pTHX_ OP *o)
6182 PERL_ARGS_ASSERT_OOPSAV;
6184 switch (o->op_type) {
6186 o->op_type = OP_PADAV;
6187 o->op_ppaddr = PL_ppaddr[OP_PADAV];
6188 return ref(o, OP_RV2AV);
6191 o->op_type = OP_RV2AV;
6192 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
6197 if (ckWARN_d(WARN_INTERNAL))
6198 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
6205 Perl_oopsHV(pTHX_ OP *o)
6209 PERL_ARGS_ASSERT_OOPSHV;
6211 switch (o->op_type) {
6214 o->op_type = OP_PADHV;
6215 o->op_ppaddr = PL_ppaddr[OP_PADHV];
6216 return ref(o, OP_RV2HV);
6220 o->op_type = OP_RV2HV;
6221 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
6226 if (ckWARN_d(WARN_INTERNAL))
6227 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
6234 Perl_newAVREF(pTHX_ OP *o)
6238 PERL_ARGS_ASSERT_NEWAVREF;
6240 if (o->op_type == OP_PADANY) {
6241 o->op_type = OP_PADAV;
6242 o->op_ppaddr = PL_ppaddr[OP_PADAV];
6245 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)
6246 && ckWARN(WARN_DEPRECATED)) {
6247 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
6248 "Using an array as a reference is deprecated");
6250 return newUNOP(OP_RV2AV, 0, scalar(o));
6254 Perl_newGVREF(pTHX_ I32 type, OP *o)
6256 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
6257 return newUNOP(OP_NULL, 0, o);
6258 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
6262 Perl_newHVREF(pTHX_ OP *o)
6266 PERL_ARGS_ASSERT_NEWHVREF;
6268 if (o->op_type == OP_PADANY) {
6269 o->op_type = OP_PADHV;
6270 o->op_ppaddr = PL_ppaddr[OP_PADHV];
6273 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)
6274 && ckWARN(WARN_DEPRECATED)) {
6275 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
6276 "Using a hash as a reference is deprecated");
6278 return newUNOP(OP_RV2HV, 0, scalar(o));
6282 Perl_newCVREF(pTHX_ I32 flags, OP *o)
6284 return newUNOP(OP_RV2CV, flags, scalar(o));
6288 Perl_newSVREF(pTHX_ OP *o)
6292 PERL_ARGS_ASSERT_NEWSVREF;
6294 if (o->op_type == OP_PADANY) {
6295 o->op_type = OP_PADSV;
6296 o->op_ppaddr = PL_ppaddr[OP_PADSV];
6299 return newUNOP(OP_RV2SV, 0, scalar(o));
6302 /* Check routines. See the comments at the top of this file for details
6303 * on when these are called */
6306 Perl_ck_anoncode(pTHX_ OP *o)
6308 PERL_ARGS_ASSERT_CK_ANONCODE;
6310 cSVOPo->op_targ = pad_add_anon(cSVOPo->op_sv, o->op_type);
6312 cSVOPo->op_sv = NULL;
6317 Perl_ck_bitop(pTHX_ OP *o)
6321 PERL_ARGS_ASSERT_CK_BITOP;
6323 #define OP_IS_NUMCOMPARE(op) \
6324 ((op) == OP_LT || (op) == OP_I_LT || \
6325 (op) == OP_GT || (op) == OP_I_GT || \
6326 (op) == OP_LE || (op) == OP_I_LE || \
6327 (op) == OP_GE || (op) == OP_I_GE || \
6328 (op) == OP_EQ || (op) == OP_I_EQ || \
6329 (op) == OP_NE || (op) == OP_I_NE || \
6330 (op) == OP_NCMP || (op) == OP_I_NCMP)
6331 o->op_private = (U8)(PL_hints & HINT_INTEGER);
6332 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
6333 && (o->op_type == OP_BIT_OR
6334 || o->op_type == OP_BIT_AND
6335 || o->op_type == OP_BIT_XOR))
6337 const OP * const left = cBINOPo->op_first;
6338 const OP * const right = left->op_sibling;
6339 if ((OP_IS_NUMCOMPARE(left->op_type) &&
6340 (left->op_flags & OPf_PARENS) == 0) ||
6341 (OP_IS_NUMCOMPARE(right->op_type) &&
6342 (right->op_flags & OPf_PARENS) == 0))
6343 if (ckWARN(WARN_PRECEDENCE))
6344 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
6345 "Possible precedence problem on bitwise %c operator",
6346 o->op_type == OP_BIT_OR ? '|'
6347 : o->op_type == OP_BIT_AND ? '&' : '^'
6354 Perl_ck_concat(pTHX_ OP *o)
6356 const OP * const kid = cUNOPo->op_first;
6358 PERL_ARGS_ASSERT_CK_CONCAT;
6359 PERL_UNUSED_CONTEXT;
6361 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
6362 !(kUNOP->op_first->op_flags & OPf_MOD))
6363 o->op_flags |= OPf_STACKED;
6368 Perl_ck_spair(pTHX_ OP *o)
6372 PERL_ARGS_ASSERT_CK_SPAIR;
6374 if (o->op_flags & OPf_KIDS) {
6377 const OPCODE type = o->op_type;
6378 o = modkids(ck_fun(o), type);
6379 kid = cUNOPo->op_first;
6380 newop = kUNOP->op_first->op_sibling;
6382 const OPCODE type = newop->op_type;
6383 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
6384 type == OP_PADAV || type == OP_PADHV ||
6385 type == OP_RV2AV || type == OP_RV2HV)
6389 op_getmad(kUNOP->op_first,newop,'K');
6391 op_free(kUNOP->op_first);
6393 kUNOP->op_first = newop;
6395 o->op_ppaddr = PL_ppaddr[++o->op_type];
6400 Perl_ck_delete(pTHX_ OP *o)
6402 PERL_ARGS_ASSERT_CK_DELETE;
6406 if (o->op_flags & OPf_KIDS) {
6407 OP * const kid = cUNOPo->op_first;
6408 switch (kid->op_type) {
6410 o->op_flags |= OPf_SPECIAL;
6413 o->op_private |= OPpSLICE;
6416 o->op_flags |= OPf_SPECIAL;
6421 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
6430 Perl_ck_die(pTHX_ OP *o)
6432 PERL_ARGS_ASSERT_CK_DIE;
6435 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
6441 Perl_ck_eof(pTHX_ OP *o)
6445 PERL_ARGS_ASSERT_CK_EOF;
6447 if (o->op_flags & OPf_KIDS) {
6448 if (cLISTOPo->op_first->op_type == OP_STUB) {
6450 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
6452 op_getmad(o,newop,'O');
6464 Perl_ck_eval(pTHX_ OP *o)
6468 PERL_ARGS_ASSERT_CK_EVAL;
6470 PL_hints |= HINT_BLOCK_SCOPE;
6471 if (o->op_flags & OPf_KIDS) {
6472 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6475 o->op_flags &= ~OPf_KIDS;
6478 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
6484 cUNOPo->op_first = 0;
6489 NewOp(1101, enter, 1, LOGOP);
6490 enter->op_type = OP_ENTERTRY;
6491 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
6492 enter->op_private = 0;
6494 /* establish postfix order */
6495 enter->op_next = (OP*)enter;
6497 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
6498 o->op_type = OP_LEAVETRY;
6499 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
6500 enter->op_other = o;
6501 op_getmad(oldo,o,'O');
6515 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
6516 op_getmad(oldo,o,'O');
6518 o->op_targ = (PADOFFSET)PL_hints;
6519 if ((PL_hints & HINT_LOCALIZE_HH) != 0 && GvHV(PL_hintgv)) {
6520 /* Store a copy of %^H that pp_entereval can pick up. */
6521 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
6522 (SV*)Perl_hv_copy_hints_hv(aTHX_ GvHV(PL_hintgv)));
6523 cUNOPo->op_first->op_sibling = hhop;
6524 o->op_private |= OPpEVAL_HAS_HH;
6530 Perl_ck_exit(pTHX_ OP *o)
6532 PERL_ARGS_ASSERT_CK_EXIT;
6535 HV * const table = GvHV(PL_hintgv);
6537 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
6538 if (svp && *svp && SvTRUE(*svp))
6539 o->op_private |= OPpEXIT_VMSISH;
6541 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
6547 Perl_ck_exec(pTHX_ OP *o)
6549 PERL_ARGS_ASSERT_CK_EXEC;
6551 if (o->op_flags & OPf_STACKED) {
6554 kid = cUNOPo->op_first->op_sibling;
6555 if (kid->op_type == OP_RV2GV)
6564 Perl_ck_exists(pTHX_ OP *o)
6568 PERL_ARGS_ASSERT_CK_EXISTS;
6571 if (o->op_flags & OPf_KIDS) {
6572 OP * const kid = cUNOPo->op_first;
6573 if (kid->op_type == OP_ENTERSUB) {
6574 (void) ref(kid, o->op_type);
6575 if (kid->op_type != OP_RV2CV
6576 && !(PL_parser && PL_parser->error_count))
6577 Perl_croak(aTHX_ "%s argument is not a subroutine name",
6579 o->op_private |= OPpEXISTS_SUB;
6581 else if (kid->op_type == OP_AELEM)
6582 o->op_flags |= OPf_SPECIAL;
6583 else if (kid->op_type != OP_HELEM)
6584 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine",
6592 Perl_ck_rvconst(pTHX_ register OP *o)
6595 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6597 PERL_ARGS_ASSERT_CK_RVCONST;
6599 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6600 if (o->op_type == OP_RV2CV)
6601 o->op_private &= ~1;
6603 if (kid->op_type == OP_CONST) {
6606 SV * const kidsv = kid->op_sv;
6608 /* Is it a constant from cv_const_sv()? */
6609 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
6610 SV * const rsv = SvRV(kidsv);
6611 const svtype type = SvTYPE(rsv);
6612 const char *badtype = NULL;
6614 switch (o->op_type) {
6616 if (type > SVt_PVMG)
6617 badtype = "a SCALAR";
6620 if (type != SVt_PVAV)
6621 badtype = "an ARRAY";
6624 if (type != SVt_PVHV)
6628 if (type != SVt_PVCV)
6633 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
6636 else if ((o->op_type == OP_RV2HV || o->op_type == OP_RV2SV) &&
6637 (PL_hints & HINT_STRICT_REFS) && SvPOK(kidsv)) {
6638 /* If this is an access to a stash, disable "strict refs", because
6639 * stashes aren't auto-vivified at compile-time (unless we store
6640 * symbols in them), and we don't want to produce a run-time
6641 * stricture error when auto-vivifying the stash. */
6642 const char *s = SvPV_nolen(kidsv);
6643 const STRLEN l = SvCUR(kidsv);
6644 if (l > 1 && s[l-1] == ':' && s[l-2] == ':')
6645 o->op_private &= ~HINT_STRICT_REFS;
6647 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
6648 const char *badthing;
6649 switch (o->op_type) {
6651 badthing = "a SCALAR";
6654 badthing = "an ARRAY";
6657 badthing = "a HASH";
6665 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
6666 SVfARG(kidsv), badthing);
6669 * This is a little tricky. We only want to add the symbol if we
6670 * didn't add it in the lexer. Otherwise we get duplicate strict
6671 * warnings. But if we didn't add it in the lexer, we must at
6672 * least pretend like we wanted to add it even if it existed before,
6673 * or we get possible typo warnings. OPpCONST_ENTERED says
6674 * whether the lexer already added THIS instance of this symbol.
6676 iscv = (o->op_type == OP_RV2CV) * 2;
6678 gv = gv_fetchsv(kidsv,
6679 iscv | !(kid->op_private & OPpCONST_ENTERED),
6682 : o->op_type == OP_RV2SV
6684 : o->op_type == OP_RV2AV
6686 : o->op_type == OP_RV2HV
6689 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
6691 kid->op_type = OP_GV;
6692 SvREFCNT_dec(kid->op_sv);
6694 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
6695 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
6696 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
6698 PAD_SETSV(kPADOP->op_padix, (SV*) SvREFCNT_inc_simple_NN(gv));
6700 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
6702 kid->op_private = 0;
6703 kid->op_ppaddr = PL_ppaddr[OP_GV];
6710 Perl_ck_ftst(pTHX_ OP *o)
6713 const I32 type = o->op_type;
6715 PERL_ARGS_ASSERT_CK_FTST;
6717 if (o->op_flags & OPf_REF) {
6720 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
6721 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6722 const OPCODE kidtype = kid->op_type;
6724 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
6725 OP * const newop = newGVOP(type, OPf_REF,
6726 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
6728 op_getmad(o,newop,'O');
6734 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
6735 o->op_private |= OPpFT_ACCESS;
6736 if (PL_check[kidtype] == MEMBER_TO_FPTR(Perl_ck_ftst)
6737 && kidtype != OP_STAT && kidtype != OP_LSTAT)
6738 o->op_private |= OPpFT_STACKED;
6746 if (type == OP_FTTTY)
6747 o = newGVOP(type, OPf_REF, PL_stdingv);
6749 o = newUNOP(type, 0, newDEFSVOP());
6750 op_getmad(oldo,o,'O');
6756 Perl_ck_fun(pTHX_ OP *o)
6759 const int type = o->op_type;
6760 register I32 oa = PL_opargs[type] >> OASHIFT;
6762 PERL_ARGS_ASSERT_CK_FUN;
6764 if (o->op_flags & OPf_STACKED) {
6765 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
6768 return no_fh_allowed(o);
6771 if (o->op_flags & OPf_KIDS) {
6772 OP **tokid = &cLISTOPo->op_first;
6773 register OP *kid = cLISTOPo->op_first;
6777 if (kid->op_type == OP_PUSHMARK ||
6778 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
6780 tokid = &kid->op_sibling;
6781 kid = kid->op_sibling;
6783 if (!kid && PL_opargs[type] & OA_DEFGV)
6784 *tokid = kid = newDEFSVOP();
6788 sibl = kid->op_sibling;
6790 if (!sibl && kid->op_type == OP_STUB) {
6797 /* list seen where single (scalar) arg expected? */
6798 if (numargs == 1 && !(oa >> 4)
6799 && kid->op_type == OP_LIST && type != OP_SCALAR)
6801 return too_many_arguments(o,PL_op_desc[type]);
6814 if ((type == OP_PUSH || type == OP_UNSHIFT)
6815 && !kid->op_sibling && ckWARN(WARN_SYNTAX))
6816 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6817 "Useless use of %s with no values",
6820 if (kid->op_type == OP_CONST &&
6821 (kid->op_private & OPpCONST_BARE))
6823 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
6824 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
6825 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
6826 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6827 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
6828 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
6830 op_getmad(kid,newop,'K');
6835 kid->op_sibling = sibl;
6838 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
6839 bad_type(numargs, "array", PL_op_desc[type], kid);
6843 if (kid->op_type == OP_CONST &&
6844 (kid->op_private & OPpCONST_BARE))
6846 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
6847 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
6848 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
6849 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6850 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
6851 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
6853 op_getmad(kid,newop,'K');
6858 kid->op_sibling = sibl;
6861 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
6862 bad_type(numargs, "hash", PL_op_desc[type], kid);
6867 OP * const newop = newUNOP(OP_NULL, 0, kid);
6868 kid->op_sibling = 0;
6870 newop->op_next = newop;
6872 kid->op_sibling = sibl;
6877 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
6878 if (kid->op_type == OP_CONST &&
6879 (kid->op_private & OPpCONST_BARE))
6881 OP * const newop = newGVOP(OP_GV, 0,
6882 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
6883 if (!(o->op_private & 1) && /* if not unop */
6884 kid == cLISTOPo->op_last)
6885 cLISTOPo->op_last = newop;
6887 op_getmad(kid,newop,'K');
6893 else if (kid->op_type == OP_READLINE) {
6894 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
6895 bad_type(numargs, "HANDLE", OP_DESC(o), kid);
6898 I32 flags = OPf_SPECIAL;
6902 /* is this op a FH constructor? */
6903 if (is_handle_constructor(o,numargs)) {
6904 const char *name = NULL;
6908 /* Set a flag to tell rv2gv to vivify
6909 * need to "prove" flag does not mean something
6910 * else already - NI-S 1999/05/07
6913 if (kid->op_type == OP_PADSV) {
6915 = PAD_COMPNAME_SV(kid->op_targ);
6916 name = SvPV_const(namesv, len);
6918 else if (kid->op_type == OP_RV2SV
6919 && kUNOP->op_first->op_type == OP_GV)
6921 GV * const gv = cGVOPx_gv(kUNOP->op_first);
6923 len = GvNAMELEN(gv);
6925 else if (kid->op_type == OP_AELEM
6926 || kid->op_type == OP_HELEM)
6929 OP *op = ((BINOP*)kid)->op_first;
6933 const char * const a =
6934 kid->op_type == OP_AELEM ?
6936 if (((op->op_type == OP_RV2AV) ||
6937 (op->op_type == OP_RV2HV)) &&
6938 (firstop = ((UNOP*)op)->op_first) &&
6939 (firstop->op_type == OP_GV)) {
6940 /* packagevar $a[] or $h{} */
6941 GV * const gv = cGVOPx_gv(firstop);
6949 else if (op->op_type == OP_PADAV
6950 || op->op_type == OP_PADHV) {
6951 /* lexicalvar $a[] or $h{} */
6952 const char * const padname =
6953 PAD_COMPNAME_PV(op->op_targ);
6962 name = SvPV_const(tmpstr, len);
6967 name = "__ANONIO__";
6974 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
6975 namesv = PAD_SVl(targ);
6976 SvUPGRADE(namesv, SVt_PV);
6978 sv_setpvn(namesv, "$", 1);
6979 sv_catpvn(namesv, name, len);
6982 kid->op_sibling = 0;
6983 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
6984 kid->op_targ = targ;
6985 kid->op_private |= priv;
6987 kid->op_sibling = sibl;
6993 mod(scalar(kid), type);
6997 tokid = &kid->op_sibling;
6998 kid = kid->op_sibling;
7001 if (kid && kid->op_type != OP_STUB)
7002 return too_many_arguments(o,OP_DESC(o));
7003 o->op_private |= numargs;
7005 /* FIXME - should the numargs move as for the PERL_MAD case? */
7006 o->op_private |= numargs;
7008 return too_many_arguments(o,OP_DESC(o));
7012 else if (PL_opargs[type] & OA_DEFGV) {
7014 OP *newop = newUNOP(type, 0, newDEFSVOP());
7015 op_getmad(o,newop,'O');
7018 /* Ordering of these two is important to keep f_map.t passing. */
7020 return newUNOP(type, 0, newDEFSVOP());
7025 while (oa & OA_OPTIONAL)
7027 if (oa && oa != OA_LIST)
7028 return too_few_arguments(o,OP_DESC(o));
7034 Perl_ck_glob(pTHX_ OP *o)
7039 PERL_ARGS_ASSERT_CK_GLOB;
7042 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
7043 append_elem(OP_GLOB, o, newDEFSVOP());
7045 if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
7046 && GvCVu(gv) && GvIMPORTED_CV(gv)))
7048 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
7051 #if !defined(PERL_EXTERNAL_GLOB)
7052 /* XXX this can be tightened up and made more failsafe. */
7053 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
7056 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
7057 newSVpvs("File::Glob"), NULL, NULL, NULL);
7058 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
7059 glob_gv = gv_fetchpvs("File::Glob::csh_glob", 0, SVt_PVCV);
7060 GvCV(gv) = GvCV(glob_gv);
7061 SvREFCNT_inc_void((SV*)GvCV(gv));
7062 GvIMPORTED_CV_on(gv);
7065 #endif /* PERL_EXTERNAL_GLOB */
7067 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
7068 append_elem(OP_GLOB, o,
7069 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
7070 o->op_type = OP_LIST;
7071 o->op_ppaddr = PL_ppaddr[OP_LIST];
7072 cLISTOPo->op_first->op_type = OP_PUSHMARK;
7073 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
7074 cLISTOPo->op_first->op_targ = 0;
7075 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
7076 append_elem(OP_LIST, o,
7077 scalar(newUNOP(OP_RV2CV, 0,
7078 newGVOP(OP_GV, 0, gv)))));
7079 o = newUNOP(OP_NULL, 0, ck_subr(o));
7080 o->op_targ = OP_GLOB; /* hint at what it used to be */
7083 gv = newGVgen("main");
7085 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
7091 Perl_ck_grep(pTHX_ OP *o)
7096 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
7099 PERL_ARGS_ASSERT_CK_GREP;
7101 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
7102 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
7104 if (o->op_flags & OPf_STACKED) {
7107 kid = cLISTOPo->op_first->op_sibling;
7108 if (!cUNOPx(kid)->op_next)
7109 Perl_croak(aTHX_ "panic: ck_grep");
7110 for (k = cUNOPx(kid)->op_first; k; k = k->op_next) {
7113 NewOp(1101, gwop, 1, LOGOP);
7114 kid->op_next = (OP*)gwop;
7115 o->op_flags &= ~OPf_STACKED;
7117 kid = cLISTOPo->op_first->op_sibling;
7118 if (type == OP_MAPWHILE)
7123 if (PL_parser && PL_parser->error_count)
7125 kid = cLISTOPo->op_first->op_sibling;
7126 if (kid->op_type != OP_NULL)
7127 Perl_croak(aTHX_ "panic: ck_grep");
7128 kid = kUNOP->op_first;
7131 NewOp(1101, gwop, 1, LOGOP);
7132 gwop->op_type = type;
7133 gwop->op_ppaddr = PL_ppaddr[type];
7134 gwop->op_first = listkids(o);
7135 gwop->op_flags |= OPf_KIDS;
7136 gwop->op_other = LINKLIST(kid);
7137 kid->op_next = (OP*)gwop;
7138 offset = pad_findmy("$_");
7139 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
7140 o->op_private = gwop->op_private = 0;
7141 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
7144 o->op_private = gwop->op_private = OPpGREP_LEX;
7145 gwop->op_targ = o->op_targ = offset;
7148 kid = cLISTOPo->op_first->op_sibling;
7149 if (!kid || !kid->op_sibling)
7150 return too_few_arguments(o,OP_DESC(o));
7151 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
7152 mod(kid, OP_GREPSTART);
7158 Perl_ck_index(pTHX_ OP *o)
7160 PERL_ARGS_ASSERT_CK_INDEX;
7162 if (o->op_flags & OPf_KIDS) {
7163 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7165 kid = kid->op_sibling; /* get past "big" */
7166 if (kid && kid->op_type == OP_CONST)
7167 fbm_compile(((SVOP*)kid)->op_sv, 0);
7173 Perl_ck_lfun(pTHX_ OP *o)
7175 const OPCODE type = o->op_type;
7177 PERL_ARGS_ASSERT_CK_LFUN;
7179 return modkids(ck_fun(o), type);
7183 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
7185 PERL_ARGS_ASSERT_CK_DEFINED;
7187 if ((o->op_flags & OPf_KIDS) && ckWARN2(WARN_DEPRECATED, WARN_SYNTAX)) {
7188 switch (cUNOPo->op_first->op_type) {
7190 /* This is needed for
7191 if (defined %stash::)
7192 to work. Do not break Tk.
7194 break; /* Globals via GV can be undef */
7196 case OP_AASSIGN: /* Is this a good idea? */
7197 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
7198 "defined(@array) is deprecated");
7199 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
7200 "\t(Maybe you should just omit the defined()?)\n");
7203 /* This is needed for
7204 if (defined %stash::)
7205 to work. Do not break Tk.
7207 break; /* Globals via GV can be undef */
7209 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
7210 "defined(%%hash) is deprecated");
7211 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
7212 "\t(Maybe you should just omit the defined()?)\n");
7223 Perl_ck_readline(pTHX_ OP *o)
7225 PERL_ARGS_ASSERT_CK_READLINE;
7227 if (!(o->op_flags & OPf_KIDS)) {
7229 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
7231 op_getmad(o,newop,'O');
7241 Perl_ck_rfun(pTHX_ OP *o)
7243 const OPCODE type = o->op_type;
7245 PERL_ARGS_ASSERT_CK_RFUN;
7247 return refkids(ck_fun(o), type);
7251 Perl_ck_listiob(pTHX_ OP *o)
7255 PERL_ARGS_ASSERT_CK_LISTIOB;
7257 kid = cLISTOPo->op_first;
7260 kid = cLISTOPo->op_first;
7262 if (kid->op_type == OP_PUSHMARK)
7263 kid = kid->op_sibling;
7264 if (kid && o->op_flags & OPf_STACKED)
7265 kid = kid->op_sibling;
7266 else if (kid && !kid->op_sibling) { /* print HANDLE; */
7267 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
7268 o->op_flags |= OPf_STACKED; /* make it a filehandle */
7269 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
7270 cLISTOPo->op_first->op_sibling = kid;
7271 cLISTOPo->op_last = kid;
7272 kid = kid->op_sibling;
7277 append_elem(o->op_type, o, newDEFSVOP());
7283 Perl_ck_smartmatch(pTHX_ OP *o)
7286 if (0 == (o->op_flags & OPf_SPECIAL)) {
7287 OP *first = cBINOPo->op_first;
7288 OP *second = first->op_sibling;
7290 /* Implicitly take a reference to an array or hash */
7291 first->op_sibling = NULL;
7292 first = cBINOPo->op_first = ref_array_or_hash(first);
7293 second = first->op_sibling = ref_array_or_hash(second);
7295 /* Implicitly take a reference to a regular expression */
7296 if (first->op_type == OP_MATCH) {
7297 first->op_type = OP_QR;
7298 first->op_ppaddr = PL_ppaddr[OP_QR];
7300 if (second->op_type == OP_MATCH) {
7301 second->op_type = OP_QR;
7302 second->op_ppaddr = PL_ppaddr[OP_QR];
7311 Perl_ck_sassign(pTHX_ OP *o)
7314 OP * const kid = cLISTOPo->op_first;
7316 PERL_ARGS_ASSERT_CK_SASSIGN;
7318 /* has a disposable target? */
7319 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
7320 && !(kid->op_flags & OPf_STACKED)
7321 /* Cannot steal the second time! */
7322 && !(kid->op_private & OPpTARGET_MY)
7323 /* Keep the full thing for madskills */
7327 OP * const kkid = kid->op_sibling;
7329 /* Can just relocate the target. */
7330 if (kkid && kkid->op_type == OP_PADSV
7331 && !(kkid->op_private & OPpLVAL_INTRO))
7333 kid->op_targ = kkid->op_targ;
7335 /* Now we do not need PADSV and SASSIGN. */
7336 kid->op_sibling = o->op_sibling; /* NULL */
7337 cLISTOPo->op_first = NULL;
7340 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
7344 if (kid->op_sibling) {
7345 OP *kkid = kid->op_sibling;
7346 if (kkid->op_type == OP_PADSV
7347 && (kkid->op_private & OPpLVAL_INTRO)
7348 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
7349 const PADOFFSET target = kkid->op_targ;
7350 OP *const other = newOP(OP_PADSV,
7352 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
7353 OP *const first = newOP(OP_NULL, 0);
7354 OP *const nullop = newCONDOP(0, first, o, other);
7355 OP *const condop = first->op_next;
7356 /* hijacking PADSTALE for uninitialized state variables */
7357 SvPADSTALE_on(PAD_SVl(target));
7359 condop->op_type = OP_ONCE;
7360 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
7361 condop->op_targ = target;
7362 other->op_targ = target;
7364 /* Because we change the type of the op here, we will skip the
7365 assinment binop->op_last = binop->op_first->op_sibling; at the
7366 end of Perl_newBINOP(). So need to do it here. */
7367 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
7376 Perl_ck_match(pTHX_ OP *o)
7380 PERL_ARGS_ASSERT_CK_MATCH;
7382 if (o->op_type != OP_QR && PL_compcv) {
7383 const PADOFFSET offset = pad_findmy("$_");
7384 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
7385 o->op_targ = offset;
7386 o->op_private |= OPpTARGET_MY;
7389 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
7390 o->op_private |= OPpRUNTIME;
7395 Perl_ck_method(pTHX_ OP *o)
7397 OP * const kid = cUNOPo->op_first;
7399 PERL_ARGS_ASSERT_CK_METHOD;
7401 if (kid->op_type == OP_CONST) {
7402 SV* sv = kSVOP->op_sv;
7403 const char * const method = SvPVX_const(sv);
7404 if (!(strchr(method, ':') || strchr(method, '\''))) {
7406 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
7407 sv = newSVpvn_share(method, SvCUR(sv), 0);
7410 kSVOP->op_sv = NULL;
7412 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
7414 op_getmad(o,cmop,'O');
7425 Perl_ck_null(pTHX_ OP *o)
7427 PERL_ARGS_ASSERT_CK_NULL;
7428 PERL_UNUSED_CONTEXT;
7433 Perl_ck_open(pTHX_ OP *o)
7436 HV * const table = GvHV(PL_hintgv);
7438 PERL_ARGS_ASSERT_CK_OPEN;
7441 SV **svp = hv_fetchs(table, "open_IN", FALSE);
7444 const char *d = SvPV_const(*svp, len);
7445 const I32 mode = mode_from_discipline(d, len);
7446 if (mode & O_BINARY)
7447 o->op_private |= OPpOPEN_IN_RAW;
7448 else if (mode & O_TEXT)
7449 o->op_private |= OPpOPEN_IN_CRLF;
7452 svp = hv_fetchs(table, "open_OUT", FALSE);
7455 const char *d = SvPV_const(*svp, len);
7456 const I32 mode = mode_from_discipline(d, len);
7457 if (mode & O_BINARY)
7458 o->op_private |= OPpOPEN_OUT_RAW;
7459 else if (mode & O_TEXT)
7460 o->op_private |= OPpOPEN_OUT_CRLF;
7463 if (o->op_type == OP_BACKTICK) {
7464 if (!(o->op_flags & OPf_KIDS)) {
7465 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
7467 op_getmad(o,newop,'O');
7476 /* In case of three-arg dup open remove strictness
7477 * from the last arg if it is a bareword. */
7478 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
7479 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
7483 if ((last->op_type == OP_CONST) && /* The bareword. */
7484 (last->op_private & OPpCONST_BARE) &&
7485 (last->op_private & OPpCONST_STRICT) &&
7486 (oa = first->op_sibling) && /* The fh. */
7487 (oa = oa->op_sibling) && /* The mode. */
7488 (oa->op_type == OP_CONST) &&
7489 SvPOK(((SVOP*)oa)->op_sv) &&
7490 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
7491 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
7492 (last == oa->op_sibling)) /* The bareword. */
7493 last->op_private &= ~OPpCONST_STRICT;
7499 Perl_ck_repeat(pTHX_ OP *o)
7501 PERL_ARGS_ASSERT_CK_REPEAT;
7503 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
7504 o->op_private |= OPpREPEAT_DOLIST;
7505 cBINOPo->op_first = force_list(cBINOPo->op_first);
7513 Perl_ck_require(pTHX_ OP *o)
7518 PERL_ARGS_ASSERT_CK_REQUIRE;
7520 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
7521 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7523 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
7524 SV * const sv = kid->op_sv;
7525 U32 was_readonly = SvREADONLY(sv);
7532 sv_force_normal_flags(sv, 0);
7533 assert(!SvREADONLY(sv));
7543 for (; s < end; s++) {
7544 if (*s == ':' && s[1] == ':') {
7546 Move(s+2, s+1, end - s - 1, char);
7551 sv_catpvs(sv, ".pm");
7552 SvFLAGS(sv) |= was_readonly;
7556 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
7557 /* handle override, if any */
7558 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
7559 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
7560 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
7561 gv = gvp ? *gvp : NULL;
7565 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
7566 OP * const kid = cUNOPo->op_first;
7569 cUNOPo->op_first = 0;
7573 newop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
7574 append_elem(OP_LIST, kid,
7575 scalar(newUNOP(OP_RV2CV, 0,
7578 op_getmad(o,newop,'O');
7586 Perl_ck_return(pTHX_ OP *o)
7590 PERL_ARGS_ASSERT_CK_RETURN;
7592 if (CvLVALUE(PL_compcv)) {
7594 for (kid = cLISTOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
7595 mod(kid, OP_LEAVESUBLV);
7601 Perl_ck_select(pTHX_ OP *o)
7606 PERL_ARGS_ASSERT_CK_SELECT;
7608 if (o->op_flags & OPf_KIDS) {
7609 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7610 if (kid && kid->op_sibling) {
7611 o->op_type = OP_SSELECT;
7612 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
7614 return fold_constants(o);
7618 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7619 if (kid && kid->op_type == OP_RV2GV)
7620 kid->op_private &= ~HINT_STRICT_REFS;
7625 Perl_ck_shift(pTHX_ OP *o)
7628 const I32 type = o->op_type;
7630 PERL_ARGS_ASSERT_CK_SHIFT;
7632 if (!(o->op_flags & OPf_KIDS)) {
7634 /* FIXME - this can be refactored to reduce code in #ifdefs */
7636 OP * const oldo = o;
7640 argop = newUNOP(OP_RV2AV, 0,
7641 scalar(newGVOP(OP_GV, 0, CvUNIQUE(PL_compcv) ? PL_argvgv : PL_defgv)));
7643 o = newUNOP(type, 0, scalar(argop));
7644 op_getmad(oldo,o,'O');
7647 return newUNOP(type, 0, scalar(argop));
7650 return scalar(modkids(ck_fun(o), type));
7654 Perl_ck_sort(pTHX_ OP *o)
7659 PERL_ARGS_ASSERT_CK_SORT;
7661 if (o->op_type == OP_SORT && (PL_hints & HINT_LOCALIZE_HH) != 0) {
7662 HV * const hinthv = GvHV(PL_hintgv);
7664 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
7666 const I32 sorthints = (I32)SvIV(*svp);
7667 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
7668 o->op_private |= OPpSORT_QSORT;
7669 if ((sorthints & HINT_SORT_STABLE) != 0)
7670 o->op_private |= OPpSORT_STABLE;
7675 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
7677 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7678 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
7680 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
7682 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
7684 if (kid->op_type == OP_SCOPE) {
7688 else if (kid->op_type == OP_LEAVE) {
7689 if (o->op_type == OP_SORT) {
7690 op_null(kid); /* wipe out leave */
7693 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
7694 if (k->op_next == kid)
7696 /* don't descend into loops */
7697 else if (k->op_type == OP_ENTERLOOP
7698 || k->op_type == OP_ENTERITER)
7700 k = cLOOPx(k)->op_lastop;
7705 kid->op_next = 0; /* just disconnect the leave */
7706 k = kLISTOP->op_first;
7711 if (o->op_type == OP_SORT) {
7712 /* provide scalar context for comparison function/block */
7718 o->op_flags |= OPf_SPECIAL;
7720 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
7723 firstkid = firstkid->op_sibling;
7726 /* provide list context for arguments */
7727 if (o->op_type == OP_SORT)
7734 S_simplify_sort(pTHX_ OP *o)
7737 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7743 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
7745 if (!(o->op_flags & OPf_STACKED))
7747 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
7748 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
7749 kid = kUNOP->op_first; /* get past null */
7750 if (kid->op_type != OP_SCOPE)
7752 kid = kLISTOP->op_last; /* get past scope */
7753 switch(kid->op_type) {
7761 k = kid; /* remember this node*/
7762 if (kBINOP->op_first->op_type != OP_RV2SV)
7764 kid = kBINOP->op_first; /* get past cmp */
7765 if (kUNOP->op_first->op_type != OP_GV)
7767 kid = kUNOP->op_first; /* get past rv2sv */
7769 if (GvSTASH(gv) != PL_curstash)
7771 gvname = GvNAME(gv);
7772 if (*gvname == 'a' && gvname[1] == '\0')
7774 else if (*gvname == 'b' && gvname[1] == '\0')
7779 kid = k; /* back to cmp */
7780 if (kBINOP->op_last->op_type != OP_RV2SV)
7782 kid = kBINOP->op_last; /* down to 2nd arg */
7783 if (kUNOP->op_first->op_type != OP_GV)
7785 kid = kUNOP->op_first; /* get past rv2sv */
7787 if (GvSTASH(gv) != PL_curstash)
7789 gvname = GvNAME(gv);
7791 ? !(*gvname == 'a' && gvname[1] == '\0')
7792 : !(*gvname == 'b' && gvname[1] == '\0'))
7794 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
7796 o->op_private |= OPpSORT_DESCEND;
7797 if (k->op_type == OP_NCMP)
7798 o->op_private |= OPpSORT_NUMERIC;
7799 if (k->op_type == OP_I_NCMP)
7800 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
7801 kid = cLISTOPo->op_first->op_sibling;
7802 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
7804 op_getmad(kid,o,'S'); /* then delete it */
7806 op_free(kid); /* then delete it */
7811 Perl_ck_split(pTHX_ OP *o)
7816 PERL_ARGS_ASSERT_CK_SPLIT;
7818 if (o->op_flags & OPf_STACKED)
7819 return no_fh_allowed(o);
7821 kid = cLISTOPo->op_first;
7822 if (kid->op_type != OP_NULL)
7823 Perl_croak(aTHX_ "panic: ck_split");
7824 kid = kid->op_sibling;
7825 op_free(cLISTOPo->op_first);
7826 cLISTOPo->op_first = kid;
7828 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
7829 cLISTOPo->op_last = kid; /* There was only one element previously */
7832 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
7833 OP * const sibl = kid->op_sibling;
7834 kid->op_sibling = 0;
7835 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0);
7836 if (cLISTOPo->op_first == cLISTOPo->op_last)
7837 cLISTOPo->op_last = kid;
7838 cLISTOPo->op_first = kid;
7839 kid->op_sibling = sibl;
7842 kid->op_type = OP_PUSHRE;
7843 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
7845 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL && ckWARN(WARN_REGEXP)) {
7846 Perl_warner(aTHX_ packWARN(WARN_REGEXP),
7847 "Use of /g modifier is meaningless in split");
7850 if (!kid->op_sibling)
7851 append_elem(OP_SPLIT, o, newDEFSVOP());
7853 kid = kid->op_sibling;
7856 if (!kid->op_sibling)
7857 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
7858 assert(kid->op_sibling);
7860 kid = kid->op_sibling;
7863 if (kid->op_sibling)
7864 return too_many_arguments(o,OP_DESC(o));
7870 Perl_ck_join(pTHX_ OP *o)
7872 const OP * const kid = cLISTOPo->op_first->op_sibling;
7874 PERL_ARGS_ASSERT_CK_JOIN;
7876 if (kid && kid->op_type == OP_MATCH) {
7877 if (ckWARN(WARN_SYNTAX)) {
7878 const REGEXP *re = PM_GETRE(kPMOP);
7879 const char *pmstr = re ? RX_PRECOMP(re) : "STRING";
7880 const STRLEN len = re ? RX_PRELEN(re) : 6;
7881 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7882 "/%.*s/ should probably be written as \"%.*s\"",
7883 (int)len, pmstr, (int)len, pmstr);
7890 Perl_ck_subr(pTHX_ OP *o)
7893 OP *prev = ((cUNOPo->op_first->op_sibling)
7894 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
7895 OP *o2 = prev->op_sibling;
7897 const char *proto = NULL;
7898 const char *proto_end = NULL;
7903 I32 contextclass = 0;
7904 const char *e = NULL;
7907 PERL_ARGS_ASSERT_CK_SUBR;
7909 o->op_private |= OPpENTERSUB_HASTARG;
7910 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
7911 if (cvop->op_type == OP_RV2CV) {
7913 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
7914 op_null(cvop); /* disable rv2cv */
7915 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
7916 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
7917 GV *gv = cGVOPx_gv(tmpop);
7920 tmpop->op_private |= OPpEARLY_CV;
7924 namegv = CvANON(cv) ? gv : CvGV(cv);
7925 proto = SvPV((SV*)cv, len);
7926 proto_end = proto + len;
7931 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
7932 if (o2->op_type == OP_CONST)
7933 o2->op_private &= ~OPpCONST_STRICT;
7934 else if (o2->op_type == OP_LIST) {
7935 OP * const sib = ((UNOP*)o2)->op_first->op_sibling;
7936 if (sib && sib->op_type == OP_CONST)
7937 sib->op_private &= ~OPpCONST_STRICT;
7940 o->op_private |= (PL_hints & HINT_STRICT_REFS);
7941 if (PERLDB_SUB && PL_curstash != PL_debstash)
7942 o->op_private |= OPpENTERSUB_DB;
7943 while (o2 != cvop) {
7945 if (PL_madskills && o2->op_type == OP_STUB) {
7946 o2 = o2->op_sibling;
7949 if (PL_madskills && o2->op_type == OP_NULL)
7950 o3 = ((UNOP*)o2)->op_first;
7954 if (proto >= proto_end)
7955 return too_many_arguments(o, gv_ename(namegv));
7963 /* _ must be at the end */
7964 if (proto[1] && proto[1] != ';')
7979 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
7981 arg == 1 ? "block or sub {}" : "sub {}",
7982 gv_ename(namegv), o3);
7985 /* '*' allows any scalar type, including bareword */
7988 if (o3->op_type == OP_RV2GV)
7989 goto wrapref; /* autoconvert GLOB -> GLOBref */
7990 else if (o3->op_type == OP_CONST)
7991 o3->op_private &= ~OPpCONST_STRICT;
7992 else if (o3->op_type == OP_ENTERSUB) {
7993 /* accidental subroutine, revert to bareword */
7994 OP *gvop = ((UNOP*)o3)->op_first;
7995 if (gvop && gvop->op_type == OP_NULL) {
7996 gvop = ((UNOP*)gvop)->op_first;
7998 for (; gvop->op_sibling; gvop = gvop->op_sibling)
8001 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
8002 (gvop = ((UNOP*)gvop)->op_first) &&
8003 gvop->op_type == OP_GV)
8005 GV * const gv = cGVOPx_gv(gvop);
8006 OP * const sibling = o2->op_sibling;
8007 SV * const n = newSVpvs("");
8009 OP * const oldo2 = o2;
8013 gv_fullname4(n, gv, "", FALSE);
8014 o2 = newSVOP(OP_CONST, 0, n);
8015 op_getmad(oldo2,o2,'O');
8016 prev->op_sibling = o2;
8017 o2->op_sibling = sibling;
8033 if (contextclass++ == 0) {
8034 e = strchr(proto, ']');
8035 if (!e || e == proto)
8044 const char *p = proto;
8045 const char *const end = proto;
8047 while (*--p != '[');
8048 bad_type(arg, Perl_form(aTHX_ "one of %.*s",
8050 gv_ename(namegv), o3);
8055 if (o3->op_type == OP_RV2GV)
8058 bad_type(arg, "symbol", gv_ename(namegv), o3);
8061 if (o3->op_type == OP_ENTERSUB)
8064 bad_type(arg, "subroutine entry", gv_ename(namegv),
8068 if (o3->op_type == OP_RV2SV ||
8069 o3->op_type == OP_PADSV ||
8070 o3->op_type == OP_HELEM ||
8071 o3->op_type == OP_AELEM)
8074 bad_type(arg, "scalar", gv_ename(namegv), o3);
8077 if (o3->op_type == OP_RV2AV ||
8078 o3->op_type == OP_PADAV)
8081 bad_type(arg, "array", gv_ename(namegv), o3);
8084 if (o3->op_type == OP_RV2HV ||
8085 o3->op_type == OP_PADHV)
8088 bad_type(arg, "hash", gv_ename(namegv), o3);
8093 OP* const sib = kid->op_sibling;
8094 kid->op_sibling = 0;
8095 o2 = newUNOP(OP_REFGEN, 0, kid);
8096 o2->op_sibling = sib;
8097 prev->op_sibling = o2;
8099 if (contextclass && e) {
8114 Perl_croak(aTHX_ "Malformed prototype for %s: %"SVf,
8115 gv_ename(namegv), SVfARG(cv));
8120 mod(o2, OP_ENTERSUB);
8122 o2 = o2->op_sibling;
8124 if (o2 == cvop && proto && *proto == '_') {
8125 /* generate an access to $_ */
8127 o2->op_sibling = prev->op_sibling;
8128 prev->op_sibling = o2; /* instead of cvop */
8130 if (proto && !optional && proto_end > proto &&
8131 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
8132 return too_few_arguments(o, gv_ename(namegv));
8135 OP * const oldo = o;
8139 o=newSVOP(OP_CONST, 0, newSViv(0));
8140 op_getmad(oldo,o,'O');
8146 Perl_ck_svconst(pTHX_ OP *o)
8148 PERL_ARGS_ASSERT_CK_SVCONST;
8149 PERL_UNUSED_CONTEXT;
8150 SvREADONLY_on(cSVOPo->op_sv);
8155 Perl_ck_chdir(pTHX_ OP *o)
8157 if (o->op_flags & OPf_KIDS) {
8158 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8160 if (kid && kid->op_type == OP_CONST &&
8161 (kid->op_private & OPpCONST_BARE))
8163 o->op_flags |= OPf_SPECIAL;
8164 kid->op_private &= ~OPpCONST_STRICT;
8171 Perl_ck_trunc(pTHX_ OP *o)
8173 PERL_ARGS_ASSERT_CK_TRUNC;
8175 if (o->op_flags & OPf_KIDS) {
8176 SVOP *kid = (SVOP*)cUNOPo->op_first;
8178 if (kid->op_type == OP_NULL)
8179 kid = (SVOP*)kid->op_sibling;
8180 if (kid && kid->op_type == OP_CONST &&
8181 (kid->op_private & OPpCONST_BARE))
8183 o->op_flags |= OPf_SPECIAL;
8184 kid->op_private &= ~OPpCONST_STRICT;
8191 Perl_ck_unpack(pTHX_ OP *o)
8193 OP *kid = cLISTOPo->op_first;
8195 PERL_ARGS_ASSERT_CK_UNPACK;
8197 if (kid->op_sibling) {
8198 kid = kid->op_sibling;
8199 if (!kid->op_sibling)
8200 kid->op_sibling = newDEFSVOP();
8206 Perl_ck_substr(pTHX_ OP *o)
8208 PERL_ARGS_ASSERT_CK_SUBSTR;
8211 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
8212 OP *kid = cLISTOPo->op_first;
8214 if (kid->op_type == OP_NULL)
8215 kid = kid->op_sibling;
8217 kid->op_flags |= OPf_MOD;
8224 Perl_ck_each(pTHX_ OP *o)
8227 OP *kid = cLISTOPo->op_first;
8229 PERL_ARGS_ASSERT_CK_EACH;
8231 if (kid->op_type == OP_PADAV || kid->op_type == OP_RV2AV) {
8232 const unsigned new_type = o->op_type == OP_EACH ? OP_AEACH
8233 : o->op_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
8234 o->op_type = new_type;
8235 o->op_ppaddr = PL_ppaddr[new_type];
8237 else if (!(kid->op_type == OP_PADHV || kid->op_type == OP_RV2HV
8238 || (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE)
8240 bad_type(1, "hash or array", PL_op_desc[o->op_type], kid);
8246 /* A peephole optimizer. We visit the ops in the order they're to execute.
8247 * See the comments at the top of this file for more details about when
8248 * peep() is called */
8251 Perl_peep(pTHX_ register OP *o)
8254 register OP* oldop = NULL;
8256 if (!o || o->op_opt)
8260 SAVEVPTR(PL_curcop);
8261 for (; o; o = o->op_next) {
8264 /* By default, this op has now been optimised. A couple of cases below
8265 clear this again. */
8268 switch (o->op_type) {
8271 PL_curcop = ((COP*)o); /* for warnings */
8275 if (cSVOPo->op_private & OPpCONST_STRICT)
8276 no_bareword_allowed(o);
8279 case OP_METHOD_NAMED:
8280 /* Relocate sv to the pad for thread safety.
8281 * Despite being a "constant", the SV is written to,
8282 * for reference counts, sv_upgrade() etc. */
8284 const PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
8285 if (o->op_type != OP_METHOD_NAMED && SvPADTMP(cSVOPo->op_sv)) {
8286 /* If op_sv is already a PADTMP then it is being used by
8287 * some pad, so make a copy. */
8288 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
8289 SvREADONLY_on(PAD_SVl(ix));
8290 SvREFCNT_dec(cSVOPo->op_sv);
8292 else if (o->op_type != OP_METHOD_NAMED
8293 && cSVOPo->op_sv == &PL_sv_undef) {
8294 /* PL_sv_undef is hack - it's unsafe to store it in the
8295 AV that is the pad, because av_fetch treats values of
8296 PL_sv_undef as a "free" AV entry and will merrily
8297 replace them with a new SV, causing pad_alloc to think
8298 that this pad slot is free. (When, clearly, it is not)
8300 SvOK_off(PAD_SVl(ix));
8301 SvPADTMP_on(PAD_SVl(ix));
8302 SvREADONLY_on(PAD_SVl(ix));
8305 SvREFCNT_dec(PAD_SVl(ix));
8306 SvPADTMP_on(cSVOPo->op_sv);
8307 PAD_SETSV(ix, cSVOPo->op_sv);
8308 /* XXX I don't know how this isn't readonly already. */
8309 SvREADONLY_on(PAD_SVl(ix));
8311 cSVOPo->op_sv = NULL;
8318 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
8319 if (o->op_next->op_private & OPpTARGET_MY) {
8320 if (o->op_flags & OPf_STACKED) /* chained concats */
8321 break; /* ignore_optimization */
8323 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
8324 o->op_targ = o->op_next->op_targ;
8325 o->op_next->op_targ = 0;
8326 o->op_private |= OPpTARGET_MY;
8329 op_null(o->op_next);
8333 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
8334 break; /* Scalar stub must produce undef. List stub is noop */
8338 if (o->op_targ == OP_NEXTSTATE
8339 || o->op_targ == OP_DBSTATE)
8341 PL_curcop = ((COP*)o);
8343 /* XXX: We avoid setting op_seq here to prevent later calls
8344 to peep() from mistakenly concluding that optimisation
8345 has already occurred. This doesn't fix the real problem,
8346 though (See 20010220.007). AMS 20010719 */
8347 /* op_seq functionality is now replaced by op_opt */
8354 if (oldop && o->op_next) {
8355 oldop->op_next = o->op_next;
8363 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
8364 OP* const pop = (o->op_type == OP_PADAV) ?
8365 o->op_next : o->op_next->op_next;
8367 if (pop && pop->op_type == OP_CONST &&
8368 ((PL_op = pop->op_next)) &&
8369 pop->op_next->op_type == OP_AELEM &&
8370 !(pop->op_next->op_private &
8371 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
8372 (i = SvIV(((SVOP*)pop)->op_sv) - CopARYBASE_get(PL_curcop))
8377 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
8378 no_bareword_allowed(pop);
8379 if (o->op_type == OP_GV)
8380 op_null(o->op_next);
8381 op_null(pop->op_next);
8383 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
8384 o->op_next = pop->op_next->op_next;
8385 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
8386 o->op_private = (U8)i;
8387 if (o->op_type == OP_GV) {
8392 o->op_flags |= OPf_SPECIAL;
8393 o->op_type = OP_AELEMFAST;
8398 if (o->op_next->op_type == OP_RV2SV) {
8399 if (!(o->op_next->op_private & OPpDEREF)) {
8400 op_null(o->op_next);
8401 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
8403 o->op_next = o->op_next->op_next;
8404 o->op_type = OP_GVSV;
8405 o->op_ppaddr = PL_ppaddr[OP_GVSV];
8408 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
8409 GV * const gv = cGVOPo_gv;
8410 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
8411 /* XXX could check prototype here instead of just carping */
8412 SV * const sv = sv_newmortal();
8413 gv_efullname3(sv, gv, NULL);
8414 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
8415 "%"SVf"() called too early to check prototype",
8419 else if (o->op_next->op_type == OP_READLINE
8420 && o->op_next->op_next->op_type == OP_CONCAT
8421 && (o->op_next->op_next->op_flags & OPf_STACKED))
8423 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
8424 o->op_type = OP_RCATLINE;
8425 o->op_flags |= OPf_STACKED;
8426 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
8427 op_null(o->op_next->op_next);
8428 op_null(o->op_next);
8444 while (cLOGOP->op_other->op_type == OP_NULL)
8445 cLOGOP->op_other = cLOGOP->op_other->op_next;
8446 peep(cLOGOP->op_other); /* Recursive calls are not replaced by fptr calls */
8451 while (cLOOP->op_redoop->op_type == OP_NULL)
8452 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
8453 peep(cLOOP->op_redoop);
8454 while (cLOOP->op_nextop->op_type == OP_NULL)
8455 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
8456 peep(cLOOP->op_nextop);
8457 while (cLOOP->op_lastop->op_type == OP_NULL)
8458 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
8459 peep(cLOOP->op_lastop);
8463 assert(!(cPMOP->op_pmflags & PMf_ONCE));
8464 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
8465 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
8466 cPMOP->op_pmstashstartu.op_pmreplstart
8467 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
8468 peep(cPMOP->op_pmstashstartu.op_pmreplstart);
8472 if (o->op_next && o->op_next->op_type == OP_NEXTSTATE
8473 && ckWARN(WARN_SYNTAX))
8475 if (o->op_next->op_sibling) {
8476 const OPCODE type = o->op_next->op_sibling->op_type;
8477 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
8478 const line_t oldline = CopLINE(PL_curcop);
8479 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
8480 Perl_warner(aTHX_ packWARN(WARN_EXEC),
8481 "Statement unlikely to be reached");
8482 Perl_warner(aTHX_ packWARN(WARN_EXEC),
8483 "\t(Maybe you meant system() when you said exec()?)\n");
8484 CopLINE_set(PL_curcop, oldline);
8495 const char *key = NULL;
8498 if (((BINOP*)o)->op_last->op_type != OP_CONST)
8501 /* Make the CONST have a shared SV */
8502 svp = cSVOPx_svp(((BINOP*)o)->op_last);
8503 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv)) && !IS_PADCONST(sv)) {
8504 key = SvPV_const(sv, keylen);
8505 lexname = newSVpvn_share(key,
8506 SvUTF8(sv) ? -(I32)keylen : (I32)keylen,
8512 if ((o->op_private & (OPpLVAL_INTRO)))
8515 rop = (UNOP*)((BINOP*)o)->op_first;
8516 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
8518 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
8519 if (!SvPAD_TYPED(lexname))
8521 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
8522 if (!fields || !GvHV(*fields))
8524 key = SvPV_const(*svp, keylen);
8525 if (!hv_fetch(GvHV(*fields), key,
8526 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE))
8528 Perl_croak(aTHX_ "No such class field \"%s\" "
8529 "in variable %s of type %s",
8530 key, SvPV_nolen_const(lexname), HvNAME_get(SvSTASH(lexname)));
8543 SVOP *first_key_op, *key_op;
8545 if ((o->op_private & (OPpLVAL_INTRO))
8546 /* I bet there's always a pushmark... */
8547 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
8548 /* hmmm, no optimization if list contains only one key. */
8550 rop = (UNOP*)((LISTOP*)o)->op_last;
8551 if (rop->op_type != OP_RV2HV)
8553 if (rop->op_first->op_type == OP_PADSV)
8554 /* @$hash{qw(keys here)} */
8555 rop = (UNOP*)rop->op_first;
8557 /* @{$hash}{qw(keys here)} */
8558 if (rop->op_first->op_type == OP_SCOPE
8559 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
8561 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
8567 lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE);
8568 if (!SvPAD_TYPED(lexname))
8570 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
8571 if (!fields || !GvHV(*fields))
8573 /* Again guessing that the pushmark can be jumped over.... */
8574 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
8575 ->op_first->op_sibling;
8576 for (key_op = first_key_op; key_op;
8577 key_op = (SVOP*)key_op->op_sibling) {
8578 if (key_op->op_type != OP_CONST)
8580 svp = cSVOPx_svp(key_op);
8581 key = SvPV_const(*svp, keylen);
8582 if (!hv_fetch(GvHV(*fields), key,
8583 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE))
8585 Perl_croak(aTHX_ "No such class field \"%s\" "
8586 "in variable %s of type %s",
8587 key, SvPV_nolen(lexname), HvNAME_get(SvSTASH(lexname)));
8594 /* will point to RV2AV or PADAV op on LHS/RHS of assign */
8598 /* check that RHS of sort is a single plain array */
8599 OP *oright = cUNOPo->op_first;
8600 if (!oright || oright->op_type != OP_PUSHMARK)
8603 /* reverse sort ... can be optimised. */
8604 if (!cUNOPo->op_sibling) {
8605 /* Nothing follows us on the list. */
8606 OP * const reverse = o->op_next;
8608 if (reverse->op_type == OP_REVERSE &&
8609 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
8610 OP * const pushmark = cUNOPx(reverse)->op_first;
8611 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
8612 && (cUNOPx(pushmark)->op_sibling == o)) {
8613 /* reverse -> pushmark -> sort */
8614 o->op_private |= OPpSORT_REVERSE;
8616 pushmark->op_next = oright->op_next;
8622 /* make @a = sort @a act in-place */
8624 oright = cUNOPx(oright)->op_sibling;
8627 if (oright->op_type == OP_NULL) { /* skip sort block/sub */
8628 oright = cUNOPx(oright)->op_sibling;
8632 (oright->op_type != OP_RV2AV && oright->op_type != OP_PADAV)
8633 || oright->op_next != o
8634 || (oright->op_private & OPpLVAL_INTRO)
8638 /* o2 follows the chain of op_nexts through the LHS of the
8639 * assign (if any) to the aassign op itself */
8641 if (!o2 || o2->op_type != OP_NULL)
8644 if (!o2 || o2->op_type != OP_PUSHMARK)
8647 if (o2 && o2->op_type == OP_GV)
8650 || (o2->op_type != OP_PADAV && o2->op_type != OP_RV2AV)
8651 || (o2->op_private & OPpLVAL_INTRO)
8656 if (!o2 || o2->op_type != OP_NULL)
8659 if (!o2 || o2->op_type != OP_AASSIGN
8660 || (o2->op_flags & OPf_WANT) != OPf_WANT_VOID)
8663 /* check that the sort is the first arg on RHS of assign */
8665 o2 = cUNOPx(o2)->op_first;
8666 if (!o2 || o2->op_type != OP_NULL)
8668 o2 = cUNOPx(o2)->op_first;
8669 if (!o2 || o2->op_type != OP_PUSHMARK)
8671 if (o2->op_sibling != o)
8674 /* check the array is the same on both sides */
8675 if (oleft->op_type == OP_RV2AV) {
8676 if (oright->op_type != OP_RV2AV
8677 || !cUNOPx(oright)->op_first
8678 || cUNOPx(oright)->op_first->op_type != OP_GV
8679 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
8680 cGVOPx_gv(cUNOPx(oright)->op_first)
8684 else if (oright->op_type != OP_PADAV
8685 || oright->op_targ != oleft->op_targ
8689 /* transfer MODishness etc from LHS arg to RHS arg */
8690 oright->op_flags = oleft->op_flags;
8691 o->op_private |= OPpSORT_INPLACE;
8693 /* excise push->gv->rv2av->null->aassign */
8694 o2 = o->op_next->op_next;
8695 op_null(o2); /* PUSHMARK */
8697 if (o2->op_type == OP_GV) {
8698 op_null(o2); /* GV */
8701 op_null(o2); /* RV2AV or PADAV */
8702 o2 = o2->op_next->op_next;
8703 op_null(o2); /* AASSIGN */
8705 o->op_next = o2->op_next;
8711 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
8713 LISTOP *enter, *exlist;
8715 enter = (LISTOP *) o->op_next;
8718 if (enter->op_type == OP_NULL) {
8719 enter = (LISTOP *) enter->op_next;
8723 /* for $a (...) will have OP_GV then OP_RV2GV here.
8724 for (...) just has an OP_GV. */
8725 if (enter->op_type == OP_GV) {
8726 gvop = (OP *) enter;
8727 enter = (LISTOP *) enter->op_next;
8730 if (enter->op_type == OP_RV2GV) {
8731 enter = (LISTOP *) enter->op_next;
8737 if (enter->op_type != OP_ENTERITER)
8740 iter = enter->op_next;
8741 if (!iter || iter->op_type != OP_ITER)
8744 expushmark = enter->op_first;
8745 if (!expushmark || expushmark->op_type != OP_NULL
8746 || expushmark->op_targ != OP_PUSHMARK)
8749 exlist = (LISTOP *) expushmark->op_sibling;
8750 if (!exlist || exlist->op_type != OP_NULL
8751 || exlist->op_targ != OP_LIST)
8754 if (exlist->op_last != o) {
8755 /* Mmm. Was expecting to point back to this op. */
8758 theirmark = exlist->op_first;
8759 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
8762 if (theirmark->op_sibling != o) {
8763 /* There's something between the mark and the reverse, eg
8764 for (1, reverse (...))
8769 ourmark = ((LISTOP *)o)->op_first;
8770 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
8773 ourlast = ((LISTOP *)o)->op_last;
8774 if (!ourlast || ourlast->op_next != o)
8777 rv2av = ourmark->op_sibling;
8778 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
8779 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
8780 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
8781 /* We're just reversing a single array. */
8782 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
8783 enter->op_flags |= OPf_STACKED;
8786 /* We don't have control over who points to theirmark, so sacrifice
8788 theirmark->op_next = ourmark->op_next;
8789 theirmark->op_flags = ourmark->op_flags;
8790 ourlast->op_next = gvop ? gvop : (OP *) enter;
8793 enter->op_private |= OPpITER_REVERSED;
8794 iter->op_private |= OPpITER_REVERSED;
8801 UNOP *refgen, *rv2cv;
8804 if ((o->op_flags & OPf_WANT) != OPf_WANT_VOID)
8807 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
8810 rv2gv = ((BINOP *)o)->op_last;
8811 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
8814 refgen = (UNOP *)((BINOP *)o)->op_first;
8816 if (!refgen || refgen->op_type != OP_REFGEN)
8819 exlist = (LISTOP *)refgen->op_first;
8820 if (!exlist || exlist->op_type != OP_NULL
8821 || exlist->op_targ != OP_LIST)
8824 if (exlist->op_first->op_type != OP_PUSHMARK)
8827 rv2cv = (UNOP*)exlist->op_last;
8829 if (rv2cv->op_type != OP_RV2CV)
8832 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
8833 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
8834 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
8836 o->op_private |= OPpASSIGN_CV_TO_GV;
8837 rv2gv->op_private |= OPpDONT_INIT_GV;
8838 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
8846 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
8847 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
8857 Perl_custom_op_name(pTHX_ const OP* o)
8860 const IV index = PTR2IV(o->op_ppaddr);
8864 PERL_ARGS_ASSERT_CUSTOM_OP_NAME;
8866 if (!PL_custom_op_names) /* This probably shouldn't happen */
8867 return (char *)PL_op_name[OP_CUSTOM];
8869 keysv = sv_2mortal(newSViv(index));
8871 he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0);
8873 return (char *)PL_op_name[OP_CUSTOM]; /* Don't know who you are */
8875 return SvPV_nolen(HeVAL(he));
8879 Perl_custom_op_desc(pTHX_ const OP* o)
8882 const IV index = PTR2IV(o->op_ppaddr);
8886 PERL_ARGS_ASSERT_CUSTOM_OP_DESC;
8888 if (!PL_custom_op_descs)
8889 return (char *)PL_op_desc[OP_CUSTOM];
8891 keysv = sv_2mortal(newSViv(index));
8893 he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0);
8895 return (char *)PL_op_desc[OP_CUSTOM];
8897 return SvPV_nolen(HeVAL(he));
8902 /* Efficient sub that returns a constant scalar value. */
8904 const_sv_xsub(pTHX_ CV* cv)
8911 Perl_croak(aTHX_ "usage: %s::%s()",
8912 HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
8916 ST(0) = (SV*)XSANY.any_ptr;
8922 * c-indentation-style: bsd
8924 * indent-tabs-mode: t
8927 * ex: set ts=8 sts=4 sw=4 noet: