3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
4 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
13 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
14 * youngest of the Old Took's daughters); and Mr. Drogo was his second
15 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
16 * either way, as the saying is, if you follow me." --the Gaffer
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(MUTABLE_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_search_const(pTHX_ OP *o)
4455 PERL_ARGS_ASSERT_SEARCH_CONST;
4457 switch (o->op_type) {
4461 if (o->op_flags & OPf_KIDS)
4462 return search_const(cUNOPo->op_first);
4469 if (!(o->op_flags & OPf_KIDS))
4471 kid = cLISTOPo->op_first;
4473 switch (kid->op_type) {
4477 kid = kid->op_sibling;
4480 if (kid != cLISTOPo->op_last)
4486 kid = cLISTOPo->op_last;
4488 return search_const(kid);
4496 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
4504 int prepend_not = 0;
4506 PERL_ARGS_ASSERT_NEW_LOGOP;
4511 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
4512 return newBINOP(type, flags, scalar(first), scalar(other));
4514 scalarboolean(first);
4515 /* optimize AND and OR ops that have NOTs as children */
4516 if (first->op_type == OP_NOT
4517 && (first->op_flags & OPf_KIDS)
4518 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
4519 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
4521 if (type == OP_AND || type == OP_OR) {
4527 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
4529 prepend_not = 1; /* prepend a NOT op later */
4533 /* search for a constant op that could let us fold the test */
4534 if ((cstop = search_const(first))) {
4535 if (cstop->op_private & OPpCONST_STRICT)
4536 no_bareword_allowed(cstop);
4537 else if ((cstop->op_private & OPpCONST_BARE) && ckWARN(WARN_BAREWORD))
4538 Perl_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
4539 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
4540 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
4541 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
4543 if (other->op_type == OP_CONST)
4544 other->op_private |= OPpCONST_SHORTCIRCUIT;
4546 OP *newop = newUNOP(OP_NULL, 0, other);
4547 op_getmad(first, newop, '1');
4548 newop->op_targ = type; /* set "was" field */
4555 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
4556 const OP *o2 = other;
4557 if ( ! (o2->op_type == OP_LIST
4558 && (( o2 = cUNOPx(o2)->op_first))
4559 && o2->op_type == OP_PUSHMARK
4560 && (( o2 = o2->op_sibling)) )
4563 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
4564 || o2->op_type == OP_PADHV)
4565 && o2->op_private & OPpLVAL_INTRO
4566 && !(o2->op_private & OPpPAD_STATE)
4567 && ckWARN(WARN_DEPRECATED))
4569 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
4570 "Deprecated use of my() in false conditional");
4574 if (first->op_type == OP_CONST)
4575 first->op_private |= OPpCONST_SHORTCIRCUIT;
4577 first = newUNOP(OP_NULL, 0, first);
4578 op_getmad(other, first, '2');
4579 first->op_targ = type; /* set "was" field */
4586 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
4587 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
4589 const OP * const k1 = ((UNOP*)first)->op_first;
4590 const OP * const k2 = k1->op_sibling;
4592 switch (first->op_type)
4595 if (k2 && k2->op_type == OP_READLINE
4596 && (k2->op_flags & OPf_STACKED)
4597 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4599 warnop = k2->op_type;
4604 if (k1->op_type == OP_READDIR
4605 || k1->op_type == OP_GLOB
4606 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4607 || k1->op_type == OP_EACH)
4609 warnop = ((k1->op_type == OP_NULL)
4610 ? (OPCODE)k1->op_targ : k1->op_type);
4615 const line_t oldline = CopLINE(PL_curcop);
4616 CopLINE_set(PL_curcop, PL_parser->copline);
4617 Perl_warner(aTHX_ packWARN(WARN_MISC),
4618 "Value of %s%s can be \"0\"; test with defined()",
4620 ((warnop == OP_READLINE || warnop == OP_GLOB)
4621 ? " construct" : "() operator"));
4622 CopLINE_set(PL_curcop, oldline);
4629 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
4630 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
4632 NewOp(1101, logop, 1, LOGOP);
4634 logop->op_type = (OPCODE)type;
4635 logop->op_ppaddr = PL_ppaddr[type];
4636 logop->op_first = first;
4637 logop->op_flags = (U8)(flags | OPf_KIDS);
4638 logop->op_other = LINKLIST(other);
4639 logop->op_private = (U8)(1 | (flags >> 8));
4641 /* establish postfix order */
4642 logop->op_next = LINKLIST(first);
4643 first->op_next = (OP*)logop;
4644 first->op_sibling = other;
4646 CHECKOP(type,logop);
4648 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
4655 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
4663 PERL_ARGS_ASSERT_NEWCONDOP;
4666 return newLOGOP(OP_AND, 0, first, trueop);
4668 return newLOGOP(OP_OR, 0, first, falseop);
4670 scalarboolean(first);
4671 if ((cstop = search_const(first))) {
4672 /* Left or right arm of the conditional? */
4673 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
4674 OP *live = left ? trueop : falseop;
4675 OP *const dead = left ? falseop : trueop;
4676 if (cstop->op_private & OPpCONST_BARE &&
4677 cstop->op_private & OPpCONST_STRICT) {
4678 no_bareword_allowed(cstop);
4681 /* This is all dead code when PERL_MAD is not defined. */
4682 live = newUNOP(OP_NULL, 0, live);
4683 op_getmad(first, live, 'C');
4684 op_getmad(dead, live, left ? 'e' : 't');
4691 NewOp(1101, logop, 1, LOGOP);
4692 logop->op_type = OP_COND_EXPR;
4693 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
4694 logop->op_first = first;
4695 logop->op_flags = (U8)(flags | OPf_KIDS);
4696 logop->op_private = (U8)(1 | (flags >> 8));
4697 logop->op_other = LINKLIST(trueop);
4698 logop->op_next = LINKLIST(falseop);
4700 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
4703 /* establish postfix order */
4704 start = LINKLIST(first);
4705 first->op_next = (OP*)logop;
4707 first->op_sibling = trueop;
4708 trueop->op_sibling = falseop;
4709 o = newUNOP(OP_NULL, 0, (OP*)logop);
4711 trueop->op_next = falseop->op_next = o;
4718 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
4727 PERL_ARGS_ASSERT_NEWRANGE;
4729 NewOp(1101, range, 1, LOGOP);
4731 range->op_type = OP_RANGE;
4732 range->op_ppaddr = PL_ppaddr[OP_RANGE];
4733 range->op_first = left;
4734 range->op_flags = OPf_KIDS;
4735 leftstart = LINKLIST(left);
4736 range->op_other = LINKLIST(right);
4737 range->op_private = (U8)(1 | (flags >> 8));
4739 left->op_sibling = right;
4741 range->op_next = (OP*)range;
4742 flip = newUNOP(OP_FLIP, flags, (OP*)range);
4743 flop = newUNOP(OP_FLOP, 0, flip);
4744 o = newUNOP(OP_NULL, 0, flop);
4746 range->op_next = leftstart;
4748 left->op_next = flip;
4749 right->op_next = flop;
4751 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4752 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
4753 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4754 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
4756 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4757 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4760 if (!flip->op_private || !flop->op_private)
4761 linklist(o); /* blow off optimizer unless constant */
4767 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
4772 const bool once = block && block->op_flags & OPf_SPECIAL &&
4773 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
4775 PERL_UNUSED_ARG(debuggable);
4778 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
4779 return block; /* do {} while 0 does once */
4780 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
4781 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4782 expr = newUNOP(OP_DEFINED, 0,
4783 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4784 } else if (expr->op_flags & OPf_KIDS) {
4785 const OP * const k1 = ((UNOP*)expr)->op_first;
4786 const OP * const k2 = k1 ? k1->op_sibling : NULL;
4787 switch (expr->op_type) {
4789 if (k2 && k2->op_type == OP_READLINE
4790 && (k2->op_flags & OPf_STACKED)
4791 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4792 expr = newUNOP(OP_DEFINED, 0, expr);
4796 if (k1 && (k1->op_type == OP_READDIR
4797 || k1->op_type == OP_GLOB
4798 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4799 || k1->op_type == OP_EACH))
4800 expr = newUNOP(OP_DEFINED, 0, expr);
4806 /* if block is null, the next append_elem() would put UNSTACK, a scalar
4807 * op, in listop. This is wrong. [perl #27024] */
4809 block = newOP(OP_NULL, 0);
4810 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
4811 o = new_logop(OP_AND, 0, &expr, &listop);
4814 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
4816 if (once && o != listop)
4817 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
4820 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
4822 o->op_flags |= flags;
4824 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
4829 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32
4830 whileline, OP *expr, OP *block, OP *cont, I32 has_my)