3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
13 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
14 * youngest of the Old Took's daughters); and Mr. Drogo was his second
15 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
16 * either way, as the saying is, if you follow me." --the Gaffer
19 /* This file contains the functions that create, manipulate and optimize
20 * the OP structures that hold a compiled perl program.
22 * A Perl program is compiled into a tree of OPs. Each op contains
23 * structural pointers (eg to its siblings and the next op in the
24 * execution sequence), a pointer to the function that would execute the
25 * op, plus any data specific to that op. For example, an OP_CONST op
26 * points to the pp_const() function and to an SV containing the constant
27 * value. When pp_const() is executed, its job is to push that SV onto the
30 * OPs are mainly created by the newFOO() functions, which are mainly
31 * called from the parser (in perly.y) as the code is parsed. For example
32 * the Perl code $a + $b * $c would cause the equivalent of the following
33 * to be called (oversimplifying a bit):
35 * newBINOP(OP_ADD, flags,
37 * newBINOP(OP_MULTIPLY, flags, newSVREF($b), newSVREF($c))
40 * Note that during the build of miniperl, a temporary copy of this file
41 * is made, called opmini.c.
45 Perl's compiler is essentially a 3-pass compiler with interleaved phases:
49 An execution-order pass
51 The bottom-up pass is represented by all the "newOP" routines and
52 the ck_ routines. The bottom-upness is actually driven by yacc.
53 So at the point that a ck_ routine fires, we have no idea what the
54 context is, either upward in the syntax tree, or either forward or
55 backward in the execution order. (The bottom-up parser builds that
56 part of the execution order it knows about, but if you follow the "next"
57 links around, you'll find it's actually a closed loop through the
60 Whenever the bottom-up parser gets to a node that supplies context to
61 its components, it invokes that portion of the top-down pass that applies
62 to that part of the subtree (and marks the top node as processed, so
63 if a node further up supplies context, it doesn't have to take the
64 plunge again). As a particular subcase of this, as the new node is
65 built, it takes all the closed execution loops of its subcomponents
66 and links them into a new closed loop for the higher level node. But
67 it's still not the real execution order.
69 The actual execution order is not known till we get a grammar reduction
70 to a top-level unit like a subroutine or file that will be called by
71 "name" rather than via a "next" pointer. At that point, we can call
72 into peep() to do that code's portion of the 3rd pass. It has to be
73 recursive, but it's recursive on basic blocks, not on tree nodes.
76 /* To implement user lexical pragmas, there needs to be a way at run time to
77 get the compile time state of %^H for that block. Storing %^H in every
78 block (or even COP) would be very expensive, so a different approach is
79 taken. The (running) state of %^H is serialised into a tree of HE-like
80 structs. Stores into %^H are chained onto the current leaf as a struct
81 refcounted_he * with the key and the value. Deletes from %^H are saved
82 with a value of PL_sv_placeholder. The state of %^H at any point can be
83 turned back into a regular HV by walking back up the tree from that point's
84 leaf, ignoring any key you've already seen (placeholder or not), storing
85 the rest into the HV structure, then removing the placeholders. Hence
86 memory is only used to store the %^H deltas from the enclosing COP, rather
87 than the entire %^H on each COP.
89 To cause actions on %^H to write out the serialisation records, it has
90 magic type 'H'. This magic (itself) does nothing, but its presence causes
91 the values to gain magic type 'h', which has entries for set and clear.
92 C<Perl_magic_sethint> updates C<PL_compiling.cop_hints_hash> with a store
93 record, with deletes written by C<Perl_magic_clearhint>. C<SAVE_HINTS>
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 #ifndef PERL_SLAB_SIZE
108 #define PERL_SLAB_SIZE 2048
112 Perl_Slab_Alloc(pTHX_ int m, size_t sz)
115 * To make incrementing use count easy PL_OpSlab is an I32 *
116 * To make inserting the link to slab PL_OpPtr is I32 **
117 * So compute size in units of sizeof(I32 *) as that is how Pl_OpPtr increments
118 * Add an overhead for pointer to slab and round up as a number of pointers
120 sz = (sz + 2*sizeof(I32 *) -1)/sizeof(I32 *);
121 if ((PL_OpSpace -= sz) < 0) {
122 PL_OpPtr = (I32 **) PerlMemShared_malloc(PERL_SLAB_SIZE*sizeof(I32*));
126 Zero(PL_OpPtr,PERL_SLAB_SIZE,I32 **);
127 /* We reserve the 0'th I32 sized chunk as a use count */
128 PL_OpSlab = (I32 *) PL_OpPtr;
129 /* Reduce size by the use count word, and by the size we need.
130 * Latter is to mimic the '-=' in the if() above
132 PL_OpSpace = PERL_SLAB_SIZE - (sizeof(I32)+sizeof(I32 **)-1)/sizeof(I32 **) - sz;
133 /* Allocation pointer starts at the top.
134 Theory: because we build leaves before trunk allocating at end
135 means that at run time access is cache friendly upward
137 PL_OpPtr += PERL_SLAB_SIZE;
139 assert( PL_OpSpace >= 0 );
140 /* Move the allocation pointer down */
142 assert( PL_OpPtr > (I32 **) PL_OpSlab );
143 *PL_OpPtr = PL_OpSlab; /* Note which slab it belongs to */
144 (*PL_OpSlab)++; /* Increment use count of slab */
145 assert( PL_OpPtr+sz <= ((I32 **) PL_OpSlab + PERL_SLAB_SIZE) );
146 assert( *PL_OpSlab > 0 );
147 return (void *)(PL_OpPtr + 1);
151 Perl_Slab_Free(pTHX_ void *op)
153 I32 * const * const ptr = (I32 **) op;
154 I32 * const slab = ptr[-1];
155 assert( ptr-1 > (I32 **) slab );
156 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
158 if (--(*slab) == 0) {
160 # define PerlMemShared PerlMem
163 PerlMemShared_free(slab);
164 if (slab == PL_OpSlab) {
171 * In the following definition, the ", (OP*)0" is just to make the compiler
172 * think the expression is of the right type: croak actually does a Siglongjmp.
174 #define CHECKOP(type,o) \
175 ((PL_op_mask && PL_op_mask[type]) \
176 ? ( op_free((OP*)o), \
177 Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \
179 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
181 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
184 S_gv_ename(pTHX_ GV *gv)
186 SV* const tmpsv = sv_newmortal();
187 gv_efullname3(tmpsv, gv, NULL);
188 return SvPV_nolen_const(tmpsv);
192 S_no_fh_allowed(pTHX_ OP *o)
194 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
200 S_too_few_arguments(pTHX_ OP *o, const char *name)
202 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
207 S_too_many_arguments(pTHX_ OP *o, const char *name)
209 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
214 S_bad_type(pTHX_ I32 n, const char *t, const char *name, const OP *kid)
216 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
217 (int)n, name, t, OP_DESC(kid)));
221 S_no_bareword_allowed(pTHX_ const OP *o)
224 return; /* various ok barewords are hidden in extra OP_NULL */
225 qerror(Perl_mess(aTHX_
226 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
230 /* "register" allocation */
233 Perl_allocmy(pTHX_ const char *const name)
237 const bool is_our = (PL_in_my == KEY_our);
239 /* complain about "my $<special_var>" etc etc */
243 (USE_UTF8_IN_NAMES && UTF8_IS_START(name[1])) ||
244 (name[1] == '_' && (*name == '$' || name[2]))))
246 /* name[2] is true if strlen(name) > 2 */
247 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
248 yyerror(Perl_form(aTHX_ "Can't use global %c^%c%s in \"my\"",
249 name[0], toCTRL(name[1]), name + 2));
251 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
255 /* check for duplicate declaration */
256 pad_check_dup(name, is_our, (PL_curstash ? PL_curstash : PL_defstash));
258 if (PL_in_my_stash && *name != '$') {
259 yyerror(Perl_form(aTHX_
260 "Can't declare class for non-scalar %s in \"%s\"",
262 is_our ? "our" : PL_in_my == KEY_state ? "state" : "my"));
265 /* allocate a spare slot and store the name in that slot */
267 off = pad_add_name(name,
270 /* $_ is always in main::, even with our */
271 ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash)
275 PL_in_my == KEY_state
280 /* free the body of an op without examining its contents.
281 * Always use this rather than FreeOp directly */
284 S_op_destroy(pTHX_ OP *o)
286 if (o->op_latefree) {
297 Perl_op_free(pTHX_ OP *o)
302 if (!o || o->op_static)
304 if (o->op_latefreed) {
311 if (o->op_private & OPpREFCOUNTED) {
322 refcnt = OpREFCNT_dec(o);
333 if (o->op_flags & OPf_KIDS) {
334 register OP *kid, *nextkid;
335 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
336 nextkid = kid->op_sibling; /* Get before next freeing kid */
341 type = (OPCODE)o->op_targ;
343 /* COP* is not cleared by op_clear() so that we may track line
344 * numbers etc even after null() */
345 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
349 if (o->op_latefree) {
355 #ifdef DEBUG_LEAKING_SCALARS
362 Perl_op_clear(pTHX_ OP *o)
367 /* if (o->op_madprop && o->op_madprop->mad_next)
369 /* FIXME for MAD - if I uncomment these two lines t/op/pack.t fails with
370 "modification of a read only value" for a reason I can't fathom why.
371 It's the "" stringification of $_, where $_ was set to '' in a foreach
372 loop, but it defies simplification into a small test case.
373 However, commenting them out has caused ext/List/Util/t/weak.t to fail
376 mad_free(o->op_madprop);
382 switch (o->op_type) {
383 case OP_NULL: /* Was holding old type, if any. */
384 if (PL_madskills && o->op_targ != OP_NULL) {
385 o->op_type = o->op_targ;
389 case OP_ENTEREVAL: /* Was holding hints. */
393 if (!(o->op_flags & OPf_REF)
394 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
400 if (! (o->op_type == OP_AELEMFAST && o->op_flags & OPf_SPECIAL)) {
401 /* not an OP_PADAV replacement */
403 if (cPADOPo->op_padix > 0) {
404 /* No GvIN_PAD_off(cGVOPo_gv) here, because other references
405 * may still exist on the pad */
406 pad_swipe(cPADOPo->op_padix, TRUE);
407 cPADOPo->op_padix = 0;
410 SvREFCNT_dec(cSVOPo->op_sv);
411 cSVOPo->op_sv = NULL;
415 case OP_METHOD_NAMED:
417 SvREFCNT_dec(cSVOPo->op_sv);
418 cSVOPo->op_sv = NULL;
421 Even if op_clear does a pad_free for the target of the op,
422 pad_free doesn't actually remove the sv that exists in the pad;
423 instead it lives on. This results in that it could be reused as
424 a target later on when the pad was reallocated.
427 pad_swipe(o->op_targ,1);
436 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
440 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
442 if (cPADOPo->op_padix > 0) {
443 pad_swipe(cPADOPo->op_padix, TRUE);
444 cPADOPo->op_padix = 0;
447 SvREFCNT_dec(cSVOPo->op_sv);
448 cSVOPo->op_sv = NULL;
452 PerlMemShared_free(cPVOPo->op_pv);
453 cPVOPo->op_pv = NULL;
457 op_free(cPMOPo->op_pmreplroot);
461 if (INT2PTR(PADOFFSET, cPMOPo->op_pmreplroot)) {
462 /* No GvIN_PAD_off here, because other references may still
463 * exist on the pad */
464 pad_swipe(INT2PTR(PADOFFSET, cPMOPo->op_pmreplroot), TRUE);
467 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
474 HV * const pmstash = PmopSTASH(cPMOPo);
475 if (pmstash && !SvIS_FREED(pmstash)) {
476 MAGIC * const mg = mg_find((SV*)pmstash, PERL_MAGIC_symtab);
478 PMOP *pmop = (PMOP*) mg->mg_obj;
479 PMOP *lastpmop = NULL;
481 if (cPMOPo == pmop) {
483 lastpmop->op_pmnext = pmop->op_pmnext;
485 mg->mg_obj = (SV*) pmop->op_pmnext;
489 pmop = pmop->op_pmnext;
493 PmopSTASH_free(cPMOPo);
495 cPMOPo->op_pmreplroot = NULL;
496 /* we use the "SAFE" version of the PM_ macros here
497 * since sv_clean_all might release some PMOPs
498 * after PL_regex_padav has been cleared
499 * and the clearing of PL_regex_padav needs to
500 * happen before sv_clean_all
502 ReREFCNT_dec(PM_GETRE_SAFE(cPMOPo));
503 PM_SETRE_SAFE(cPMOPo, NULL);
505 if(PL_regex_pad) { /* We could be in destruction */
506 av_push((AV*) PL_regex_pad[0],(SV*) PL_regex_pad[(cPMOPo)->op_pmoffset]);
507 SvREPADTMP_on(PL_regex_pad[(cPMOPo)->op_pmoffset]);
508 PM_SETRE(cPMOPo, (cPMOPo)->op_pmoffset);
515 if (o->op_targ > 0) {
516 pad_free(o->op_targ);
522 S_cop_free(pTHX_ COP* cop)
527 if (! specialWARN(cop->cop_warnings))
528 PerlMemShared_free(cop->cop_warnings);
529 Perl_refcounted_he_free(aTHX_ cop->cop_hints_hash);
533 Perl_op_null(pTHX_ OP *o)
536 if (o->op_type == OP_NULL)
540 o->op_targ = o->op_type;
541 o->op_type = OP_NULL;
542 o->op_ppaddr = PL_ppaddr[OP_NULL];
546 Perl_op_refcnt_lock(pTHX)
554 Perl_op_refcnt_unlock(pTHX)
561 /* Contextualizers */
563 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
566 Perl_linklist(pTHX_ OP *o)
573 /* establish postfix order */
574 first = cUNOPo->op_first;
577 o->op_next = LINKLIST(first);
580 if (kid->op_sibling) {
581 kid->op_next = LINKLIST(kid->op_sibling);
582 kid = kid->op_sibling;
596 Perl_scalarkids(pTHX_ OP *o)
598 if (o && o->op_flags & OPf_KIDS) {
600 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
607 S_scalarboolean(pTHX_ OP *o)
610 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
611 if (ckWARN(WARN_SYNTAX)) {
612 const line_t oldline = CopLINE(PL_curcop);
614 if (PL_copline != NOLINE)
615 CopLINE_set(PL_curcop, PL_copline);
616 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
617 CopLINE_set(PL_curcop, oldline);
624 Perl_scalar(pTHX_ OP *o)
629 /* assumes no premature commitment */
630 if (!o || PL_error_count || (o->op_flags & OPf_WANT)
631 || o->op_type == OP_RETURN)
636 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
638 switch (o->op_type) {
640 scalar(cBINOPo->op_first);
645 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
649 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
650 if (!kPMOP->op_pmreplroot)
651 deprecate_old("implicit split to @_");
659 if (o->op_flags & OPf_KIDS) {
660 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
666 kid = cLISTOPo->op_first;
668 while ((kid = kid->op_sibling)) {
674 PL_curcop = &PL_compiling;
679 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
685 PL_curcop = &PL_compiling;
688 if (ckWARN(WARN_VOID))
689 Perl_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
695 Perl_scalarvoid(pTHX_ OP *o)
699 const char* useless = NULL;
703 /* trailing mad null ops don't count as "there" for void processing */
705 o->op_type != OP_NULL &&
707 o->op_sibling->op_type == OP_NULL)
710 for (sib = o->op_sibling;
711 sib && sib->op_type == OP_NULL;
712 sib = sib->op_sibling) ;
718 if (o->op_type == OP_NEXTSTATE
719 || o->op_type == OP_SETSTATE
720 || o->op_type == OP_DBSTATE
721 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
722 || o->op_targ == OP_SETSTATE
723 || o->op_targ == OP_DBSTATE)))
724 PL_curcop = (COP*)o; /* for warning below */
726 /* assumes no premature commitment */
727 want = o->op_flags & OPf_WANT;
728 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
729 || o->op_type == OP_RETURN)
734 if ((o->op_private & OPpTARGET_MY)
735 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
737 return scalar(o); /* As if inside SASSIGN */
740 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
742 switch (o->op_type) {
744 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
748 if (o->op_flags & OPf_STACKED)
752 if (o->op_private == 4)
824 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
825 useless = OP_DESC(o);
829 kid = cUNOPo->op_first;
830 if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST &&
831 kid->op_type != OP_TRANS) {
834 useless = "negative pattern binding (!~)";
841 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
842 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
843 useless = "a variable";
848 if (cSVOPo->op_private & OPpCONST_STRICT)
849 no_bareword_allowed(o);
851 if (ckWARN(WARN_VOID)) {
852 useless = "a constant";
853 if (o->op_private & OPpCONST_ARYBASE)
855 /* don't warn on optimised away booleans, eg
856 * use constant Foo, 5; Foo || print; */
857 if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT)
859 /* the constants 0 and 1 are permitted as they are
860 conventionally used as dummies in constructs like
861 1 while some_condition_with_side_effects; */
862 else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
864 else if (SvPOK(sv)) {
865 /* perl4's way of mixing documentation and code
866 (before the invention of POD) was based on a
867 trick to mix nroff and perl code. The trick was
868 built upon these three nroff macros being used in
869 void context. The pink camel has the details in
870 the script wrapman near page 319. */
871 const char * const maybe_macro = SvPVX_const(sv);
872 if (strnEQ(maybe_macro, "di", 2) ||
873 strnEQ(maybe_macro, "ds", 2) ||
874 strnEQ(maybe_macro, "ig", 2))
879 op_null(o); /* don't execute or even remember it */
883 o->op_type = OP_PREINC; /* pre-increment is faster */
884 o->op_ppaddr = PL_ppaddr[OP_PREINC];
888 o->op_type = OP_PREDEC; /* pre-decrement is faster */
889 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
893 o->op_type = OP_I_PREINC; /* pre-increment is faster */
894 o->op_ppaddr = PL_ppaddr[OP_I_PREINC];
898 o->op_type = OP_I_PREDEC; /* pre-decrement is faster */
899 o->op_ppaddr = PL_ppaddr[OP_I_PREDEC];
908 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
913 if (o->op_flags & OPf_STACKED)
920 if (!(o->op_flags & OPf_KIDS))
931 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
938 /* all requires must return a boolean value */
939 o->op_flags &= ~OPf_WANT;
944 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
945 if (!kPMOP->op_pmreplroot)
946 deprecate_old("implicit split to @_");
950 if (useless && ckWARN(WARN_VOID))
951 Perl_warner(aTHX_ packWARN(WARN_VOID), "Useless use of %s in void context", useless);
956 Perl_listkids(pTHX_ OP *o)
958 if (o && o->op_flags & OPf_KIDS) {
960 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
967 Perl_list(pTHX_ OP *o)
972 /* assumes no premature commitment */
973 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
974 || o->op_type == OP_RETURN)
979 if ((o->op_private & OPpTARGET_MY)
980 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
982 return o; /* As if inside SASSIGN */
985 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
987 switch (o->op_type) {
990 list(cBINOPo->op_first);
995 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1003 if (!(o->op_flags & OPf_KIDS))
1005 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1006 list(cBINOPo->op_first);
1007 return gen_constant_list(o);
1014 kid = cLISTOPo->op_first;
1016 while ((kid = kid->op_sibling)) {
1017 if (kid->op_sibling)
1022 PL_curcop = &PL_compiling;
1026 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1027 if (kid->op_sibling)
1032 PL_curcop = &PL_compiling;
1035 /* all requires must return a boolean value */
1036 o->op_flags &= ~OPf_WANT;
1043 Perl_scalarseq(pTHX_ OP *o)
1047 const OPCODE type = o->op_type;
1049 if (type == OP_LINESEQ || type == OP_SCOPE ||
1050 type == OP_LEAVE || type == OP_LEAVETRY)
1053 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1054 if (kid->op_sibling) {
1058 PL_curcop = &PL_compiling;
1060 o->op_flags &= ~OPf_PARENS;
1061 if (PL_hints & HINT_BLOCK_SCOPE)
1062 o->op_flags |= OPf_PARENS;
1065 o = newOP(OP_STUB, 0);
1070 S_modkids(pTHX_ OP *o, I32 type)
1072 if (o && o->op_flags & OPf_KIDS) {
1074 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1080 /* Propagate lvalue ("modifiable") context to an op and its children.
1081 * 'type' represents the context type, roughly based on the type of op that
1082 * would do the modifying, although local() is represented by OP_NULL.
1083 * It's responsible for detecting things that can't be modified, flag
1084 * things that need to behave specially in an lvalue context (e.g., "$$x = 5"
1085 * might have to vivify a reference in $x), and so on.
1087 * For example, "$a+1 = 2" would cause mod() to be called with o being
1088 * OP_ADD and type being OP_SASSIGN, and would output an error.
1092 Perl_mod(pTHX_ OP *o, I32 type)
1096 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
1099 if (!o || PL_error_count)
1102 if ((o->op_private & OPpTARGET_MY)
1103 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1108 switch (o->op_type) {
1114 if (!(o->op_private & OPpCONST_ARYBASE))
1117 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1118 CopARYBASE_set(&PL_compiling,
1119 (I32)SvIV(cSVOPx(PL_eval_start)->op_sv));
1123 SAVECOPARYBASE(&PL_compiling);
1124 CopARYBASE_set(&PL_compiling, 0);
1126 else if (type == OP_REFGEN)
1129 Perl_croak(aTHX_ "That use of $[ is unsupported");
1132 if (o->op_flags & OPf_PARENS || PL_madskills)
1136 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1137 !(o->op_flags & OPf_STACKED)) {
1138 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1139 /* The default is to set op_private to the number of children,
1140 which for a UNOP such as RV2CV is always 1. And w're using
1141 the bit for a flag in RV2CV, so we need it clear. */
1142 o->op_private &= ~1;
1143 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1144 assert(cUNOPo->op_first->op_type == OP_NULL);
1145 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1148 else if (o->op_private & OPpENTERSUB_NOMOD)
1150 else { /* lvalue subroutine call */
1151 o->op_private |= OPpLVAL_INTRO;
1152 PL_modcount = RETURN_UNLIMITED_NUMBER;
1153 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1154 /* Backward compatibility mode: */
1155 o->op_private |= OPpENTERSUB_INARGS;
1158 else { /* Compile-time error message: */
1159 OP *kid = cUNOPo->op_first;
1163 if (kid->op_type != OP_PUSHMARK) {
1164 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1166 "panic: unexpected lvalue entersub "
1167 "args: type/targ %ld:%"UVuf,
1168 (long)kid->op_type, (UV)kid->op_targ);
1169 kid = kLISTOP->op_first;
1171 while (kid->op_sibling)
1172 kid = kid->op_sibling;
1173 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1175 if (kid->op_type == OP_METHOD_NAMED
1176 || kid->op_type == OP_METHOD)
1180 NewOp(1101, newop, 1, UNOP);
1181 newop->op_type = OP_RV2CV;
1182 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1183 newop->op_first = NULL;
1184 newop->op_next = (OP*)newop;
1185 kid->op_sibling = (OP*)newop;
1186 newop->op_private |= OPpLVAL_INTRO;
1187 newop->op_private &= ~1;
1191 if (kid->op_type != OP_RV2CV)
1193 "panic: unexpected lvalue entersub "
1194 "entry via type/targ %ld:%"UVuf,
1195 (long)kid->op_type, (UV)kid->op_targ);
1196 kid->op_private |= OPpLVAL_INTRO;
1197 break; /* Postpone until runtime */
1201 kid = kUNOP->op_first;
1202 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1203 kid = kUNOP->op_first;
1204 if (kid->op_type == OP_NULL)
1206 "Unexpected constant lvalue entersub "
1207 "entry via type/targ %ld:%"UVuf,
1208 (long)kid->op_type, (UV)kid->op_targ);
1209 if (kid->op_type != OP_GV) {
1210 /* Restore RV2CV to check lvalueness */
1212 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1213 okid->op_next = kid->op_next;
1214 kid->op_next = okid;
1217 okid->op_next = NULL;
1218 okid->op_type = OP_RV2CV;
1220 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1221 okid->op_private |= OPpLVAL_INTRO;
1222 okid->op_private &= ~1;
1226 cv = GvCV(kGVOP_gv);
1236 /* grep, foreach, subcalls, refgen */
1237 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1239 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1240 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1242 : (o->op_type == OP_ENTERSUB
1243 ? "non-lvalue subroutine call"
1245 type ? PL_op_desc[type] : "local"));
1259 case OP_RIGHT_SHIFT:
1268 if (!(o->op_flags & OPf_STACKED))
1275 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1281 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1282 PL_modcount = RETURN_UNLIMITED_NUMBER;
1283 return o; /* Treat \(@foo) like ordinary list. */
1287 if (scalar_mod_type(o, type))
1289 ref(cUNOPo->op_first, o->op_type);
1293 if (type == OP_LEAVESUBLV)
1294 o->op_private |= OPpMAYBE_LVSUB;
1300 PL_modcount = RETURN_UNLIMITED_NUMBER;
1303 ref(cUNOPo->op_first, o->op_type);
1308 PL_hints |= HINT_BLOCK_SCOPE;
1323 PL_modcount = RETURN_UNLIMITED_NUMBER;
1324 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1325 return o; /* Treat \(@foo) like ordinary list. */
1326 if (scalar_mod_type(o, type))
1328 if (type == OP_LEAVESUBLV)
1329 o->op_private |= OPpMAYBE_LVSUB;
1333 if (!type) /* local() */
1334 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1335 PAD_COMPNAME_PV(o->op_targ));
1343 if (type != OP_SASSIGN)
1347 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1352 if (type == OP_LEAVESUBLV)
1353 o->op_private |= OPpMAYBE_LVSUB;
1355 pad_free(o->op_targ);
1356 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1357 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1358 if (o->op_flags & OPf_KIDS)
1359 mod(cBINOPo->op_first->op_sibling, type);
1364 ref(cBINOPo->op_first, o->op_type);
1365 if (type == OP_ENTERSUB &&
1366 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1367 o->op_private |= OPpLVAL_DEFER;
1368 if (type == OP_LEAVESUBLV)
1369 o->op_private |= OPpMAYBE_LVSUB;
1379 if (o->op_flags & OPf_KIDS)
1380 mod(cLISTOPo->op_last, type);
1385 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1387 else if (!(o->op_flags & OPf_KIDS))
1389 if (o->op_targ != OP_LIST) {
1390 mod(cBINOPo->op_first, type);
1396 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1401 if (type != OP_LEAVESUBLV)
1403 break; /* mod()ing was handled by ck_return() */
1406 /* [20011101.069] File test operators interpret OPf_REF to mean that
1407 their argument is a filehandle; thus \stat(".") should not set
1409 if (type == OP_REFGEN &&
1410 PL_check[o->op_type] == MEMBER_TO_FPTR(Perl_ck_ftst))
1413 if (type != OP_LEAVESUBLV)
1414 o->op_flags |= OPf_MOD;
1416 if (type == OP_AASSIGN || type == OP_SASSIGN)
1417 o->op_flags |= OPf_SPECIAL|OPf_REF;
1418 else if (!type) { /* local() */
1421 o->op_private |= OPpLVAL_INTRO;
1422 o->op_flags &= ~OPf_SPECIAL;
1423 PL_hints |= HINT_BLOCK_SCOPE;
1428 if (ckWARN(WARN_SYNTAX)) {
1429 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
1430 "Useless localization of %s", OP_DESC(o));
1434 else if (type != OP_GREPSTART && type != OP_ENTERSUB
1435 && type != OP_LEAVESUBLV)
1436 o->op_flags |= OPf_REF;
1441 S_scalar_mod_type(const OP *o, I32 type)
1445 if (o->op_type == OP_RV2GV)
1469 case OP_RIGHT_SHIFT:
1488 S_is_handle_constructor(const OP *o, I32 numargs)
1490 switch (o->op_type) {
1498 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1511 Perl_refkids(pTHX_ OP *o, I32 type)
1513 if (o && o->op_flags & OPf_KIDS) {
1515 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1522 Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
1527 if (!o || PL_error_count)
1530 switch (o->op_type) {
1532 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1533 !(o->op_flags & OPf_STACKED)) {
1534 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1535 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1536 assert(cUNOPo->op_first->op_type == OP_NULL);
1537 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1538 o->op_flags |= OPf_SPECIAL;
1539 o->op_private &= ~1;
1544 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1545 doref(kid, type, set_op_ref);
1548 if (type == OP_DEFINED)
1549 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1550 doref(cUNOPo->op_first, o->op_type, set_op_ref);
1553 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1554 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1555 : type == OP_RV2HV ? OPpDEREF_HV
1557 o->op_flags |= OPf_MOD;
1564 o->op_flags |= OPf_REF;
1567 if (type == OP_DEFINED)
1568 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1569 doref(cUNOPo->op_first, o->op_type, set_op_ref);
1575 o->op_flags |= OPf_REF;
1580 if (!(o->op_flags & OPf_KIDS))
1582 doref(cBINOPo->op_first, type, set_op_ref);
1586 doref(cBINOPo->op_first, o->op_type, set_op_ref);
1587 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1588 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1589 : type == OP_RV2HV ? OPpDEREF_HV
1591 o->op_flags |= OPf_MOD;
1601 if (!(o->op_flags & OPf_KIDS))
1603 doref(cLISTOPo->op_last, type, set_op_ref);
1613 S_dup_attrlist(pTHX_ OP *o)
1618 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1619 * where the first kid is OP_PUSHMARK and the remaining ones
1620 * are OP_CONST. We need to push the OP_CONST values.
1622 if (o->op_type == OP_CONST)
1623 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
1625 else if (o->op_type == OP_NULL)
1629 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1631 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1632 if (o->op_type == OP_CONST)
1633 rop = append_elem(OP_LIST, rop,
1634 newSVOP(OP_CONST, o->op_flags,
1635 SvREFCNT_inc_NN(cSVOPo->op_sv)));
1642 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
1647 /* fake up C<use attributes $pkg,$rv,@attrs> */
1648 ENTER; /* need to protect against side-effects of 'use' */
1650 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
1652 #define ATTRSMODULE "attributes"
1653 #define ATTRSMODULE_PM "attributes.pm"
1656 /* Don't force the C<use> if we don't need it. */
1657 SV * const * const svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
1658 if (svp && *svp != &PL_sv_undef)
1659 NOOP; /* already in %INC */
1661 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
1662 newSVpvs(ATTRSMODULE), NULL);
1665 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1666 newSVpvs(ATTRSMODULE),
1668 prepend_elem(OP_LIST,
1669 newSVOP(OP_CONST, 0, stashsv),
1670 prepend_elem(OP_LIST,
1671 newSVOP(OP_CONST, 0,
1673 dup_attrlist(attrs))));
1679 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
1682 OP *pack, *imop, *arg;
1688 assert(target->op_type == OP_PADSV ||
1689 target->op_type == OP_PADHV ||
1690 target->op_type == OP_PADAV);
1692 /* Ensure that attributes.pm is loaded. */
1693 apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE);
1695 /* Need package name for method call. */
1696 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
1698 /* Build up the real arg-list. */
1699 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
1701 arg = newOP(OP_PADSV, 0);
1702 arg->op_targ = target->op_targ;
1703 arg = prepend_elem(OP_LIST,
1704 newSVOP(OP_CONST, 0, stashsv),
1705 prepend_elem(OP_LIST,
1706 newUNOP(OP_REFGEN, 0,
1707 mod(arg, OP_REFGEN)),
1708 dup_attrlist(attrs)));
1710 /* Fake up a method call to import */
1711 meth = newSVpvs_share("import");
1712 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
1713 append_elem(OP_LIST,
1714 prepend_elem(OP_LIST, pack, list(arg)),
1715 newSVOP(OP_METHOD_NAMED, 0, meth)));
1716 imop->op_private |= OPpENTERSUB_NOMOD;
1718 /* Combine the ops. */
1719 *imopsp = append_elem(OP_LIST, *imopsp, imop);
1723 =notfor apidoc apply_attrs_string
1725 Attempts to apply a list of attributes specified by the C<attrstr> and
1726 C<len> arguments to the subroutine identified by the C<cv> argument which
1727 is expected to be associated with the package identified by the C<stashpv>
1728 argument (see L<attributes>). It gets this wrong, though, in that it
1729 does not correctly identify the boundaries of the individual attribute
1730 specifications within C<attrstr>. This is not really intended for the
1731 public API, but has to be listed here for systems such as AIX which
1732 need an explicit export list for symbols. (It's called from XS code
1733 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
1734 to respect attribute syntax properly would be welcome.
1740 Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
1741 const char *attrstr, STRLEN len)
1746 len = strlen(attrstr);
1750 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
1752 const char * const sstr = attrstr;
1753 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
1754 attrs = append_elem(OP_LIST, attrs,
1755 newSVOP(OP_CONST, 0,
1756 newSVpvn(sstr, attrstr-sstr)));
1760 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1761 newSVpvs(ATTRSMODULE),
1762 NULL, prepend_elem(OP_LIST,
1763 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
1764 prepend_elem(OP_LIST,
1765 newSVOP(OP_CONST, 0,
1771 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
1776 if (!o || PL_error_count)
1780 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
1781 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
1785 if (type == OP_LIST) {
1787 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1788 my_kid(kid, attrs, imopsp);
1789 } else if (type == OP_UNDEF
1795 } else if (type == OP_RV2SV || /* "our" declaration */
1797 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1798 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
1799 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
1801 PL_in_my == KEY_our ? "our" : PL_in_my == KEY_state ? "state" : "my"));
1803 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
1805 PL_in_my_stash = NULL;
1806 apply_attrs(GvSTASH(gv),
1807 (type == OP_RV2SV ? GvSV(gv) :
1808 type == OP_RV2AV ? (SV*)GvAV(gv) :
1809 type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)gv),
1812 o->op_private |= OPpOUR_INTRO;
1815 else if (type != OP_PADSV &&
1818 type != OP_PUSHMARK)
1820 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
1822 PL_in_my == KEY_our ? "our" : PL_in_my == KEY_state ? "state" : "my"));
1825 else if (attrs && type != OP_PUSHMARK) {
1829 PL_in_my_stash = NULL;
1831 /* check for C<my Dog $spot> when deciding package */
1832 stash = PAD_COMPNAME_TYPE(o->op_targ);
1834 stash = PL_curstash;
1835 apply_attrs_my(stash, o, attrs, imopsp);
1837 o->op_flags |= OPf_MOD;
1838 o->op_private |= OPpLVAL_INTRO;
1839 if (PL_in_my == KEY_state)
1840 o->op_private |= OPpPAD_STATE;
1845 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1849 int maybe_scalar = 0;
1851 /* [perl #17376]: this appears to be premature, and results in code such as
1852 C< our(%x); > executing in list mode rather than void mode */
1854 if (o->op_flags & OPf_PARENS)
1864 o = my_kid(o, attrs, &rops);
1866 if (maybe_scalar && o->op_type == OP_PADSV) {
1867 o = scalar(append_list(OP_LIST, (LISTOP*)rops, (LISTOP*)o));
1868 o->op_private |= OPpLVAL_INTRO;
1871 o = append_list(OP_LIST, (LISTOP*)o, (LISTOP*)rops);
1874 PL_in_my_stash = NULL;
1879 Perl_my(pTHX_ OP *o)
1881 return my_attrs(o, NULL);
1885 Perl_sawparens(pTHX_ OP *o)
1887 PERL_UNUSED_CONTEXT;
1889 o->op_flags |= OPf_PARENS;
1894 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1898 const OPCODE ltype = left->op_type;
1899 const OPCODE rtype = right->op_type;
1901 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
1902 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
1904 const char * const desc
1905 = PL_op_desc[(rtype == OP_SUBST || rtype == OP_TRANS)
1906 ? (int)rtype : OP_MATCH];
1907 const char * const sample = ((ltype == OP_RV2AV || ltype == OP_PADAV)
1908 ? "@array" : "%hash");
1909 Perl_warner(aTHX_ packWARN(WARN_MISC),
1910 "Applying %s to %s will act on scalar(%s)",
1911 desc, sample, sample);
1914 if (rtype == OP_CONST &&
1915 cSVOPx(right)->op_private & OPpCONST_BARE &&
1916 cSVOPx(right)->op_private & OPpCONST_STRICT)
1918 no_bareword_allowed(right);
1921 ismatchop = rtype == OP_MATCH ||
1922 rtype == OP_SUBST ||
1924 if (ismatchop && right->op_private & OPpTARGET_MY) {
1926 right->op_private &= ~OPpTARGET_MY;
1928 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
1931 right->op_flags |= OPf_STACKED;
1932 if (rtype != OP_MATCH &&
1933 ! (rtype == OP_TRANS &&
1934 right->op_private & OPpTRANS_IDENTICAL))
1935 newleft = mod(left, rtype);
1938 if (right->op_type == OP_TRANS)
1939 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
1941 o = prepend_elem(rtype, scalar(newleft), right);
1943 return newUNOP(OP_NOT, 0, scalar(o));
1947 return bind_match(type, left,
1948 pmruntime(newPMOP(OP_MATCH, 0), right, 0));
1952 Perl_invert(pTHX_ OP *o)
1956 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1960 Perl_scope(pTHX_ OP *o)
1964 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1965 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1966 o->op_type = OP_LEAVE;
1967 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1969 else if (o->op_type == OP_LINESEQ) {
1971 o->op_type = OP_SCOPE;
1972 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1973 kid = ((LISTOP*)o)->op_first;
1974 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
1977 /* The following deals with things like 'do {1 for 1}' */
1978 kid = kid->op_sibling;
1980 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
1985 o = newLISTOP(OP_SCOPE, 0, o, NULL);
1991 Perl_block_start(pTHX_ int full)
1994 const int retval = PL_savestack_ix;
1995 pad_block_start(full);
1997 PL_hints &= ~HINT_BLOCK_SCOPE;
1998 SAVECOMPILEWARNINGS();
1999 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
2004 Perl_block_end(pTHX_ I32 floor, OP *seq)
2007 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2008 OP* const retval = scalarseq(seq);
2010 CopHINTS_set(&PL_compiling, PL_hints);
2012 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2021 const PADOFFSET offset = pad_findmy("$_");
2022 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
2023 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2026 OP * const o = newOP(OP_PADSV, 0);
2027 o->op_targ = offset;
2033 Perl_newPROG(pTHX_ OP *o)
2039 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2040 ((PL_in_eval & EVAL_KEEPERR)
2041 ? OPf_SPECIAL : 0), o);
2042 PL_eval_start = linklist(PL_eval_root);
2043 PL_eval_root->op_private |= OPpREFCOUNTED;
2044 OpREFCNT_set(PL_eval_root, 1);
2045 PL_eval_root->op_next = 0;
2046 CALL_PEEP(PL_eval_start);
2049 if (o->op_type == OP_STUB) {
2050 PL_comppad_name = 0;
2052 S_op_destroy(aTHX_ o);
2055 PL_main_root = scope(sawparens(scalarvoid(o)));
2056 PL_curcop = &PL_compiling;
2057 PL_main_start = LINKLIST(PL_main_root);
2058 PL_main_root->op_private |= OPpREFCOUNTED;
2059 OpREFCNT_set(PL_main_root, 1);
2060 PL_main_root->op_next = 0;
2061 CALL_PEEP(PL_main_start);
2064 /* Register with debugger */
2067 = Perl_get_cvn_flags(aTHX_ STR_WITH_LEN("DB::postponed"), 0);
2071 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2073 call_sv((SV*)cv, G_DISCARD);
2080 Perl_localize(pTHX_ OP *o, I32 lex)
2083 if (o->op_flags & OPf_PARENS)
2084 /* [perl #17376]: this appears to be premature, and results in code such as
2085 C< our(%x); > executing in list mode rather than void mode */
2092 if ( PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ','
2093 && ckWARN(WARN_PARENTHESIS))
2095 char *s = PL_bufptr;
2098 /* some heuristics to detect a potential error */
2099 while (*s && (strchr(", \t\n", *s)))
2103 if (*s && strchr("@$%*", *s) && *++s
2104 && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) {
2107 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)))
2109 while (*s && (strchr(", \t\n", *s)))
2115 if (sigil && (*s == ';' || *s == '=')) {
2116 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
2117 "Parentheses missing around \"%s\" list",
2118 lex ? (PL_in_my == KEY_our ? "our" : PL_in_my == KEY_state ? "state" : "my")
2126 o = mod(o, OP_NULL); /* a bit kludgey */
2128 PL_in_my_stash = NULL;
2133 Perl_jmaybe(pTHX_ OP *o)
2135 if (o->op_type == OP_LIST) {
2137 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
2138 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2144 Perl_fold_constants(pTHX_ register OP *o)
2149 VOL I32 type = o->op_type;
2154 SV * const oldwarnhook = PL_warnhook;
2155 SV * const olddiehook = PL_diehook;
2158 if (PL_opargs[type] & OA_RETSCALAR)
2160 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2161 o->op_targ = pad_alloc(type, SVs_PADTMP);
2163 /* integerize op, unless it happens to be C<-foo>.
2164 * XXX should pp_i_negate() do magic string negation instead? */
2165 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2166 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2167 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2169 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2172 if (!(PL_opargs[type] & OA_FOLDCONST))
2177 /* XXX might want a ck_negate() for this */
2178 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2189 /* XXX what about the numeric ops? */
2190 if (PL_hints & HINT_LOCALE)
2195 goto nope; /* Don't try to run w/ errors */
2197 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2198 const OPCODE type = curop->op_type;
2199 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
2201 type != OP_SCALAR &&
2203 type != OP_PUSHMARK)
2209 curop = LINKLIST(o);
2210 old_next = o->op_next;
2214 oldscope = PL_scopestack_ix;
2215 create_eval_scope(G_FAKINGEVAL);
2217 PL_warnhook = PERL_WARNHOOK_FATAL;
2224 sv = *(PL_stack_sp--);
2225 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2226 pad_swipe(o->op_targ, FALSE);
2227 else if (SvTEMP(sv)) { /* grab mortal temp? */
2228 SvREFCNT_inc_simple_void(sv);
2233 /* Something tried to die. Abandon constant folding. */
2234 /* Pretend the error never happened. */
2235 sv_setpvn(ERRSV,"",0);
2236 o->op_next = old_next;
2240 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
2241 PL_warnhook = oldwarnhook;
2242 PL_diehook = olddiehook;
2243 /* XXX note that this croak may fail as we've already blown away
2244 * the stack - eg any nested evals */
2245 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
2248 PL_warnhook = oldwarnhook;
2249 PL_diehook = olddiehook;
2251 if (PL_scopestack_ix > oldscope)
2252 delete_eval_scope();
2261 if (type == OP_RV2GV)
2262 newop = newGVOP(OP_GV, 0, (GV*)sv);
2264 newop = newSVOP(OP_CONST, 0, (SV*)sv);
2265 op_getmad(o,newop,'f');
2273 Perl_gen_constant_list(pTHX_ register OP *o)
2277 const I32 oldtmps_floor = PL_tmps_floor;
2281 return o; /* Don't attempt to run with errors */
2283 PL_op = curop = LINKLIST(o);
2289 assert (!(curop->op_flags & OPf_SPECIAL));
2290 assert(curop->op_type == OP_RANGE);
2292 PL_tmps_floor = oldtmps_floor;
2294 o->op_type = OP_RV2AV;
2295 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2296 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
2297 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
2298 o->op_opt = 0; /* needs to be revisited in peep() */
2299 curop = ((UNOP*)o)->op_first;
2300 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
2302 op_getmad(curop,o,'O');
2311 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2314 if (!o || o->op_type != OP_LIST)
2315 o = newLISTOP(OP_LIST, 0, o, NULL);
2317 o->op_flags &= ~OPf_WANT;
2319 if (!(PL_opargs[type] & OA_MARK))
2320 op_null(cLISTOPo->op_first);
2322 o->op_type = (OPCODE)type;
2323 o->op_ppaddr = PL_ppaddr[type];
2324 o->op_flags |= flags;
2326 o = CHECKOP(type, o);
2327 if (o->op_type != (unsigned)type)
2330 return fold_constants(o);
2333 /* List constructors */
2336 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2344 if (first->op_type != (unsigned)type
2345 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2347 return newLISTOP(type, 0, first, last);
2350 if (first->op_flags & OPf_KIDS)
2351 ((LISTOP*)first)->op_last->op_sibling = last;
2353 first->op_flags |= OPf_KIDS;
2354 ((LISTOP*)first)->op_first = last;
2356 ((LISTOP*)first)->op_last = last;
2361 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2369 if (first->op_type != (unsigned)type)
2370 return prepend_elem(type, (OP*)first, (OP*)last);
2372 if (last->op_type != (unsigned)type)
2373 return append_elem(type, (OP*)first, (OP*)last);
2375 first->op_last->op_sibling = last->op_first;
2376 first->op_last = last->op_last;
2377 first->op_flags |= (last->op_flags & OPf_KIDS);
2380 if (last->op_first && first->op_madprop) {
2381 MADPROP *mp = last->op_first->op_madprop;
2383 while (mp->mad_next)
2385 mp->mad_next = first->op_madprop;
2388 last->op_first->op_madprop = first->op_madprop;
2391 first->op_madprop = last->op_madprop;
2392 last->op_madprop = 0;
2395 S_op_destroy(aTHX_ (OP*)last);
2401 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2409 if (last->op_type == (unsigned)type) {
2410 if (type == OP_LIST) { /* already a PUSHMARK there */
2411 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2412 ((LISTOP*)last)->op_first->op_sibling = first;
2413 if (!(first->op_flags & OPf_PARENS))
2414 last->op_flags &= ~OPf_PARENS;
2417 if (!(last->op_flags & OPf_KIDS)) {
2418 ((LISTOP*)last)->op_last = first;
2419 last->op_flags |= OPf_KIDS;
2421 first->op_sibling = ((LISTOP*)last)->op_first;
2422 ((LISTOP*)last)->op_first = first;
2424 last->op_flags |= OPf_KIDS;
2428 return newLISTOP(type, 0, first, last);
2436 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
2439 Newxz(tk, 1, TOKEN);
2440 tk->tk_type = (OPCODE)optype;
2441 tk->tk_type = 12345;
2443 tk->tk_mad = madprop;
2448 Perl_token_free(pTHX_ TOKEN* tk)
2450 if (tk->tk_type != 12345)
2452 mad_free(tk->tk_mad);
2457 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
2461 if (tk->tk_type != 12345) {
2462 Perl_warner(aTHX_ packWARN(WARN_MISC),
2463 "Invalid TOKEN object ignored");
2470 /* faked up qw list? */
2472 tm->mad_type == MAD_SV &&
2473 SvPVX((SV*)tm->mad_val)[0] == 'q')
2480 /* pretend constant fold didn't happen? */
2481 if (mp->mad_key == 'f' &&
2482 (o->op_type == OP_CONST ||
2483 o->op_type == OP_GV) )
2485 token_getmad(tk,(OP*)mp->mad_val,slot);
2499 if (mp->mad_key == 'X')
2500 mp->mad_key = slot; /* just change the first one */
2510 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
2519 /* pretend constant fold didn't happen? */
2520 if (mp->mad_key == 'f' &&
2521 (o->op_type == OP_CONST ||
2522 o->op_type == OP_GV) )
2524 op_getmad(from,(OP*)mp->mad_val,slot);
2531 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
2534 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
2540 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
2549 /* pretend constant fold didn't happen? */
2550 if (mp->mad_key == 'f' &&
2551 (o->op_type == OP_CONST ||
2552 o->op_type == OP_GV) )
2554 op_getmad(from,(OP*)mp->mad_val,slot);
2561 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
2564 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
2568 PerlIO_printf(PerlIO_stderr(),
2569 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
2575 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
2593 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
2597 addmad(tm, &(o->op_madprop), slot);
2601 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
2622 Perl_newMADsv(pTHX_ char key, SV* sv)
2624 return newMADPROP(key, MAD_SV, sv, 0);
2628 Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
2631 Newxz(mp, 1, MADPROP);
2634 mp->mad_vlen = vlen;
2635 mp->mad_type = type;
2637 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
2642 Perl_mad_free(pTHX_ MADPROP* mp)
2644 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
2648 mad_free(mp->mad_next);
2649 /* if (PL_lex_state != LEX_NOTPARSING && mp->mad_vlen)
2650 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
2651 switch (mp->mad_type) {
2655 Safefree((char*)mp->mad_val);
2658 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
2659 op_free((OP*)mp->mad_val);
2662 sv_free((SV*)mp->mad_val);
2665 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
2674 Perl_newNULLLIST(pTHX)
2676 return newOP(OP_STUB, 0);
2680 Perl_force_list(pTHX_ OP *o)
2682 if (!o || o->op_type != OP_LIST)
2683 o = newLISTOP(OP_LIST, 0, o, NULL);
2689 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2694 NewOp(1101, listop, 1, LISTOP);
2696 listop->op_type = (OPCODE)type;
2697 listop->op_ppaddr = PL_ppaddr[type];
2700 listop->op_flags = (U8)flags;
2704 else if (!first && last)
2707 first->op_sibling = last;
2708 listop->op_first = first;
2709 listop->op_last = last;
2710 if (type == OP_LIST) {
2711 OP* const pushop = newOP(OP_PUSHMARK, 0);
2712 pushop->op_sibling = first;
2713 listop->op_first = pushop;
2714 listop->op_flags |= OPf_KIDS;
2716 listop->op_last = pushop;
2719 return CHECKOP(type, listop);
2723 Perl_newOP(pTHX_ I32 type, I32 flags)
2727 NewOp(1101, o, 1, OP);
2728 o->op_type = (OPCODE)type;
2729 o->op_ppaddr = PL_ppaddr[type];
2730 o->op_flags = (U8)flags;
2732 o->op_latefreed = 0;
2736 o->op_private = (U8)(0 | (flags >> 8));
2737 if (PL_opargs[type] & OA_RETSCALAR)
2739 if (PL_opargs[type] & OA_TARGET)
2740 o->op_targ = pad_alloc(type, SVs_PADTMP);
2741 return CHECKOP(type, o);
2745 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2751 first = newOP(OP_STUB, 0);
2752 if (PL_opargs[type] & OA_MARK)
2753 first = force_list(first);
2755 NewOp(1101, unop, 1, UNOP);
2756 unop->op_type = (OPCODE)type;
2757 unop->op_ppaddr = PL_ppaddr[type];
2758 unop->op_first = first;
2759 unop->op_flags = (U8)(flags | OPf_KIDS);
2760 unop->op_private = (U8)(1 | (flags >> 8));
2761 unop = (UNOP*) CHECKOP(type, unop);
2765 return fold_constants((OP *) unop);
2769 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2773 NewOp(1101, binop, 1, BINOP);
2776 first = newOP(OP_NULL, 0);
2778 binop->op_type = (OPCODE)type;
2779 binop->op_ppaddr = PL_ppaddr[type];
2780 binop->op_first = first;
2781 binop->op_flags = (U8)(flags | OPf_KIDS);
2784 binop->op_private = (U8)(1 | (flags >> 8));
2787 binop->op_private = (U8)(2 | (flags >> 8));
2788 first->op_sibling = last;
2791 binop = (BINOP*)CHECKOP(type, binop);
2792 if (binop->op_next || binop->op_type != (OPCODE)type)
2795 binop->op_last = binop->op_first->op_sibling;
2797 return fold_constants((OP *)binop);
2800 static int uvcompare(const void *a, const void *b)
2801 __attribute__nonnull__(1)
2802 __attribute__nonnull__(2)
2803 __attribute__pure__;
2804 static int uvcompare(const void *a, const void *b)
2806 if (*((const UV *)a) < (*(const UV *)b))
2808 if (*((const UV *)a) > (*(const UV *)b))
2810 if (*((const UV *)a+1) < (*(const UV *)b+1))
2812 if (*((const UV *)a+1) > (*(const UV *)b+1))
2818 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2821 SV * const tstr = ((SVOP*)expr)->op_sv;
2824 (repl->op_type == OP_NULL)
2825 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
2827 ((SVOP*)repl)->op_sv;
2830 const U8 *t = (U8*)SvPV_const(tstr, tlen);
2831 const U8 *r = (U8*)SvPV_const(rstr, rlen);
2835 register short *tbl;
2837 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
2838 const I32 squash = o->op_private & OPpTRANS_SQUASH;
2839 I32 del = o->op_private & OPpTRANS_DELETE;
2841 PL_hints |= HINT_BLOCK_SCOPE;
2844 o->op_private |= OPpTRANS_FROM_UTF;
2847 o->op_private |= OPpTRANS_TO_UTF;
2849 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2850 SV* const listsv = newSVpvs("# comment\n");
2852 const U8* tend = t + tlen;
2853 const U8* rend = r + rlen;
2867 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2868 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2871 const U32 flags = UTF8_ALLOW_DEFAULT;
2875 t = tsave = bytes_to_utf8(t, &len);
2878 if (!to_utf && rlen) {
2880 r = rsave = bytes_to_utf8(r, &len);
2884 /* There are several snags with this code on EBCDIC:
2885 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
2886 2. scan_const() in toke.c has encoded chars in native encoding which makes
2887 ranges at least in EBCDIC 0..255 range the bottom odd.
2891 U8 tmpbuf[UTF8_MAXBYTES+1];
2894 Newx(cp, 2*tlen, UV);
2896 transv = newSVpvs("");
2898 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
2900 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
2902 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
2906 cp[2*i+1] = cp[2*i];
2910 qsort(cp, i, 2*sizeof(UV), uvcompare);
2911 for (j = 0; j < i; j++) {
2913 diff = val - nextmin;
2915 t = uvuni_to_utf8(tmpbuf,nextmin);
2916 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2918 U8 range_mark = UTF_TO_NATIVE(0xff);
2919 t = uvuni_to_utf8(tmpbuf, val - 1);
2920 sv_catpvn(transv, (char *)&range_mark, 1);
2921 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2928 t = uvuni_to_utf8(tmpbuf,nextmin);
2929 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2931 U8 range_mark = UTF_TO_NATIVE(0xff);
2932 sv_catpvn(transv, (char *)&range_mark, 1);
2934 t = uvuni_to_utf8_flags(tmpbuf, 0x7fffffff,
2935 UNICODE_ALLOW_SUPER);
2936 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2937 t = (const U8*)SvPVX_const(transv);
2938 tlen = SvCUR(transv);
2942 else if (!rlen && !del) {
2943 r = t; rlen = tlen; rend = tend;
2946 if ((!rlen && !del) || t == r ||
2947 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
2949 o->op_private |= OPpTRANS_IDENTICAL;
2953 while (t < tend || tfirst <= tlast) {
2954 /* see if we need more "t" chars */
2955 if (tfirst > tlast) {
2956 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
2958 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
2960 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
2967 /* now see if we need more "r" chars */
2968 if (rfirst > rlast) {
2970 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
2972 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
2974 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
2983 rfirst = rlast = 0xffffffff;
2987 /* now see which range will peter our first, if either. */
2988 tdiff = tlast - tfirst;
2989 rdiff = rlast - rfirst;
2996 if (rfirst == 0xffffffff) {
2997 diff = tdiff; /* oops, pretend rdiff is infinite */
2999 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
3000 (long)tfirst, (long)tlast);
3002 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
3006 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
3007 (long)tfirst, (long)(tfirst + diff),
3010 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
3011 (long)tfirst, (long)rfirst);
3013 if (rfirst + diff > max)
3014 max = rfirst + diff;
3016 grows = (tfirst < rfirst &&
3017 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
3029 else if (max > 0xff)
3034 PerlMemShared_free(cPVOPo->op_pv);
3035 cPVOPo->op_pv = NULL;
3037 swash = (SV*)swash_init("utf8", "", listsv, bits, none);
3039 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP);
3040 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
3041 PAD_SETSV(cPADOPo->op_padix, swash);
3044 cSVOPo->op_sv = swash;
3046 SvREFCNT_dec(listsv);
3047 SvREFCNT_dec(transv);
3049 if (!del && havefinal && rlen)
3050 (void)hv_store((HV*)SvRV(swash), "FINAL", 5,
3051 newSVuv((UV)final), 0);
3054 o->op_private |= OPpTRANS_GROWS;
3060 op_getmad(expr,o,'e');
3061 op_getmad(repl,o,'r');
3069 tbl = (short*)cPVOPo->op_pv;
3071 Zero(tbl, 256, short);
3072 for (i = 0; i < (I32)tlen; i++)
3074 for (i = 0, j = 0; i < 256; i++) {
3076 if (j >= (I32)rlen) {
3085 if (i < 128 && r[j] >= 128)
3095 o->op_private |= OPpTRANS_IDENTICAL;
3097 else if (j >= (I32)rlen)
3102 PerlMemShared_realloc(tbl,
3103 (0x101+rlen-j) * sizeof(short));
3104 cPVOPo->op_pv = (char*)tbl;
3106 tbl[0x100] = (short)(rlen - j);
3107 for (i=0; i < (I32)rlen - j; i++)
3108 tbl[0x101+i] = r[j+i];
3112 if (!rlen && !del) {
3115 o->op_private |= OPpTRANS_IDENTICAL;
3117 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
3118 o->op_private |= OPpTRANS_IDENTICAL;
3120 for (i = 0; i < 256; i++)
3122 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
3123 if (j >= (I32)rlen) {
3125 if (tbl[t[i]] == -1)
3131 if (tbl[t[i]] == -1) {
3132 if (t[i] < 128 && r[j] >= 128)
3139 o->op_private |= OPpTRANS_GROWS;
3141 op_getmad(expr,o,'e');
3142 op_getmad(repl,o,'r');
3152 Perl_newPMOP(pTHX_ I32 type, I32 flags)
3157 NewOp(1101, pmop, 1, PMOP);
3158 pmop->op_type = (OPCODE)type;
3159 pmop->op_ppaddr = PL_ppaddr[type];
3160 pmop->op_flags = (U8)flags;
3161 pmop->op_private = (U8)(0 | (flags >> 8));
3163 if (PL_hints & HINT_RE_TAINT)
3164 pmop->op_pmpermflags |= PMf_RETAINT;
3165 if (PL_hints & HINT_LOCALE)
3166 pmop->op_pmpermflags |= PMf_LOCALE;
3167 pmop->op_pmflags = pmop->op_pmpermflags;
3170 if (av_len((AV*) PL_regex_pad[0]) > -1) {
3171 SV * const repointer = av_pop((AV*)PL_regex_pad[0]);
3172 pmop->op_pmoffset = SvIV(repointer);
3173 SvREPADTMP_off(repointer);
3174 sv_setiv(repointer,0);
3176 SV * const repointer = newSViv(0);
3177 av_push(PL_regex_padav, SvREFCNT_inc_simple_NN(repointer));
3178 pmop->op_pmoffset = av_len(PL_regex_padav);
3179 PL_regex_pad = AvARRAY(PL_regex_padav);
3183 /* link into pm list */
3184 if (type != OP_TRANS && PL_curstash) {
3185 MAGIC *mg = mg_find((SV*)PL_curstash, PERL_MAGIC_symtab);
3188 mg = sv_magicext((SV*)PL_curstash, 0, PERL_MAGIC_symtab, 0, 0, 0);
3190 pmop->op_pmnext = (PMOP*)mg->mg_obj;
3191 mg->mg_obj = (SV*)pmop;
3192 PmopSTASH_set(pmop,PL_curstash);
3195 return CHECKOP(type, pmop);
3198 /* Given some sort of match op o, and an expression expr containing a
3199 * pattern, either compile expr into a regex and attach it to o (if it's
3200 * constant), or convert expr into a runtime regcomp op sequence (if it's
3203 * isreg indicates that the pattern is part of a regex construct, eg
3204 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
3205 * split "pattern", which aren't. In the former case, expr will be a list
3206 * if the pattern contains more than one term (eg /a$b/) or if it contains
3207 * a replacement, ie s/// or tr///.
3211 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg)
3216 I32 repl_has_vars = 0;
3220 if (o->op_type == OP_SUBST || o->op_type == OP_TRANS) {
3221 /* last element in list is the replacement; pop it */
3223 repl = cLISTOPx(expr)->op_last;
3224 kid = cLISTOPx(expr)->op_first;
3225 while (kid->op_sibling != repl)
3226 kid = kid->op_sibling;
3227 kid->op_sibling = NULL;
3228 cLISTOPx(expr)->op_last = kid;
3231 if (isreg && expr->op_type == OP_LIST &&
3232 cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last)
3234 /* convert single element list to element */
3235 OP* const oe = expr;
3236 expr = cLISTOPx(oe)->op_first->op_sibling;
3237 cLISTOPx(oe)->op_first->op_sibling = NULL;
3238 cLISTOPx(oe)->op_last = NULL;
3242 if (o->op_type == OP_TRANS) {
3243 return pmtrans(o, expr, repl);
3246 reglist = isreg && expr->op_type == OP_LIST;
3250 PL_hints |= HINT_BLOCK_SCOPE;
3253 if (expr->op_type == OP_CONST) {
3255 SV * const pat = ((SVOP*)expr)->op_sv;
3256 const char *p = SvPV_const(pat, plen);
3257 if ((o->op_flags & OPf_SPECIAL) && (plen == 1 && *p == ' ')) {
3258 U32 was_readonly = SvREADONLY(pat);
3262 sv_force_normal_flags(pat, 0);
3263 assert(!SvREADONLY(pat));
3266 SvREADONLY_off(pat);
3270 sv_setpvn(pat, "\\s+", 3);
3272 SvFLAGS(pat) |= was_readonly;
3274 p = SvPV_const(pat, plen);
3275 pm->op_pmflags |= PMf_SKIPWHITE;
3278 pm->op_pmdynflags |= PMdf_UTF8;
3279 /* FIXME - can we make this function take const char * args? */
3280 PM_SETRE(pm, CALLREGCOMP((char*)p, (char*)p + plen, pm));
3281 if (PM_GETRE(pm)->extflags & RXf_WHITE)
3282 pm->op_pmflags |= PMf_WHITE;
3284 pm->op_pmflags &= ~PMf_WHITE;
3286 op_getmad(expr,(OP*)pm,'e');
3292 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
3293 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
3295 : OP_REGCMAYBE),0,expr);
3297 NewOp(1101, rcop, 1, LOGOP);
3298 rcop->op_type = OP_REGCOMP;
3299 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
3300 rcop->op_first = scalar(expr);
3301 rcop->op_flags |= OPf_KIDS
3302 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
3303 | (reglist ? OPf_STACKED : 0);
3304 rcop->op_private = 1;
3307 rcop->op_targ = pad_alloc(rcop->op_type, SVs_PADTMP);
3309 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
3312 /* establish postfix order */
3313 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
3315 rcop->op_next = expr;
3316 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
3319 rcop->op_next = LINKLIST(expr);
3320 expr->op_next = (OP*)rcop;
3323 prepend_elem(o->op_type, scalar((OP*)rcop), o);
3328 if (pm->op_pmflags & PMf_EVAL) {
3330 if (CopLINE(PL_curcop) < (line_t)PL_multi_end)
3331 CopLINE_set(PL_curcop, (line_t)PL_multi_end);
3333 else if (repl->op_type == OP_CONST)
3337 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
3338 if (curop->op_type == OP_SCOPE
3339 || curop->op_type == OP_LEAVE
3340 || (PL_opargs[curop->op_type] & OA_DANGEROUS)) {
3341 if (curop->op_type == OP_GV) {
3342 GV * const gv = cGVOPx_gv(curop);
3344 if (strchr("&`'123456789+-\016\022", *GvENAME(gv)))
3347 else if (curop->op_type == OP_RV2CV)
3349 else if (curop->op_type == OP_RV2SV ||
3350 curop->op_type == OP_RV2AV ||
3351 curop->op_type == OP_RV2HV ||
3352 curop->op_type == OP_RV2GV) {
3353 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
3356 else if (curop->op_type == OP_PADSV ||
3357 curop->op_type == OP_PADAV ||
3358 curop->op_type == OP_PADHV ||
3359 curop->op_type == OP_PADANY)
3363 else if (curop->op_type == OP_PUSHRE)
3364 NOOP; /* Okay here, dangerous in newASSIGNOP */
3374 || PM_GETRE(pm)->extflags & RXf_EVAL_SEEN)))
3376 pm->op_pmflags |= PMf_CONST; /* const for long enough */
3377 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
3378 prepend_elem(o->op_type, scalar(repl), o);
3381 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
3382 pm->op_pmflags |= PMf_MAYBE_CONST;
3383 pm->op_pmpermflags |= PMf_MAYBE_CONST;
3385 NewOp(1101, rcop, 1, LOGOP);
3386 rcop->op_type = OP_SUBSTCONT;
3387 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
3388 rcop->op_first = scalar(repl);
3389 rcop->op_flags |= OPf_KIDS;
3390 rcop->op_private = 1;
3393 /* establish postfix order */
3394 rcop->op_next = LINKLIST(repl);
3395 repl->op_next = (OP*)rcop;
3397 pm->op_pmreplroot = scalar((OP*)rcop);
3398 pm->op_pmreplstart = LINKLIST(rcop);
3407 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3411 NewOp(1101, svop, 1, SVOP);
3412 svop->op_type = (OPCODE)type;
3413 svop->op_ppaddr = PL_ppaddr[type];
3415 svop->op_next = (OP*)svop;
3416 svop->op_flags = (U8)flags;
3417 if (PL_opargs[type] & OA_RETSCALAR)
3419 if (PL_opargs[type] & OA_TARGET)
3420 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3421 return CHECKOP(type, svop);
3426 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3430 NewOp(1101, padop, 1, PADOP);
3431 padop->op_type = (OPCODE)type;
3432 padop->op_ppaddr = PL_ppaddr[type];
3433 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3434 SvREFCNT_dec(PAD_SVl(padop->op_padix));
3435 PAD_SETSV(padop->op_padix, sv);
3438 padop->op_next = (OP*)padop;
3439 padop->op_flags = (U8)flags;
3440 if (PL_opargs[type] & OA_RETSCALAR)
3442 if (PL_opargs[type] & OA_TARGET)
3443 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3444 return CHECKOP(type, padop);
3449 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3455 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
3457 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
3462 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3466 NewOp(1101, pvop, 1, PVOP);
3467 pvop->op_type = (OPCODE)type;
3468 pvop->op_ppaddr = PL_ppaddr[type];
3470 pvop->op_next = (OP*)pvop;
3471 pvop->op_flags = (U8)flags;
3472 if (PL_opargs[type] & OA_RETSCALAR)
3474 if (PL_opargs[type] & OA_TARGET)
3475 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3476 return CHECKOP(type, pvop);
3484 Perl_package(pTHX_ OP *o)
3487 SV *const sv = cSVOPo->op_sv;
3492 save_hptr(&PL_curstash);
3493 save_item(PL_curstname);
3495 PL_curstash = gv_stashsv(sv, GV_ADD);
3496 sv_setsv(PL_curstname, sv);
3498 PL_hints |= HINT_BLOCK_SCOPE;
3499 PL_copline = NOLINE;
3505 if (!PL_madskills) {
3510 pegop = newOP(OP_NULL,0);
3511 op_getmad(o,pegop,'P');
3521 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
3528 OP *pegop = newOP(OP_NULL,0);
3531 if (idop->op_type != OP_CONST)
3532 Perl_croak(aTHX_ "Module name must be constant");
3535 op_getmad(idop,pegop,'U');
3540 SV * const vesv = ((SVOP*)version)->op_sv;
3543 op_getmad(version,pegop,'V');
3544 if (!arg && !SvNIOKp(vesv)) {
3551 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3552 Perl_croak(aTHX_ "Version number must be constant number");
3554 /* Make copy of idop so we don't free it twice */
3555 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
3557 /* Fake up a method call to VERSION */
3558 meth = newSVpvs_share("VERSION");
3559 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3560 append_elem(OP_LIST,
3561 prepend_elem(OP_LIST, pack, list(version)),
3562 newSVOP(OP_METHOD_NAMED, 0, meth)));
3566 /* Fake up an import/unimport */
3567 if (arg && arg->op_type == OP_STUB) {
3569 op_getmad(arg,pegop,'S');
3570 imop = arg; /* no import on explicit () */
3572 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
3573 imop = NULL; /* use 5.0; */
3575 idop->op_private |= OPpCONST_NOVER;
3581 op_getmad(arg,pegop,'A');
3583 /* Make copy of idop so we don't free it twice */
3584 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
3586 /* Fake up a method call to import/unimport */
3588 ? newSVpvs_share("import") : newSVpvs_share("unimport");
3589 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3590 append_elem(OP_LIST,
3591 prepend_elem(OP_LIST, pack, list(arg)),
3592 newSVOP(OP_METHOD_NAMED, 0, meth)));
3595 /* Fake up the BEGIN {}, which does its thing immediately. */
3597 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
3600 append_elem(OP_LINESEQ,
3601 append_elem(OP_LINESEQ,
3602 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
3603 newSTATEOP(0, NULL, veop)),
3604 newSTATEOP(0, NULL, imop) ));
3606 /* The "did you use incorrect case?" warning used to be here.
3607 * The problem is that on case-insensitive filesystems one
3608 * might get false positives for "use" (and "require"):
3609 * "use Strict" or "require CARP" will work. This causes
3610 * portability problems for the script: in case-strict
3611 * filesystems the script will stop working.
3613 * The "incorrect case" warning checked whether "use Foo"
3614 * imported "Foo" to your namespace, but that is wrong, too:
3615 * there is no requirement nor promise in the language that
3616 * a Foo.pm should or would contain anything in package "Foo".
3618 * There is very little Configure-wise that can be done, either:
3619 * the case-sensitivity of the build filesystem of Perl does not
3620 * help in guessing the case-sensitivity of the runtime environment.
3623 PL_hints |= HINT_BLOCK_SCOPE;
3624 PL_copline = NOLINE;
3626 PL_cop_seqmax++; /* Purely for B::*'s benefit */
3629 if (!PL_madskills) {
3630 /* FIXME - don't allocate pegop if !PL_madskills */
3639 =head1 Embedding Functions
3641 =for apidoc load_module
3643 Loads the module whose name is pointed to by the string part of name.
3644 Note that the actual module name, not its filename, should be given.
3645 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
3646 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
3647 (or 0 for no flags). ver, if specified, provides version semantics
3648 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
3649 arguments can be used to specify arguments to the module's import()
3650 method, similar to C<use Foo::Bar VERSION LIST>.
3655 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3658 va_start(args, ver);
3659 vload_module(flags, name, ver, &args);
3663 #ifdef PERL_IMPLICIT_CONTEXT
3665 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3669 va_start(args, ver);
3670 vload_module(flags, name, ver, &args);
3676 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3681 OP * const modname = newSVOP(OP_CONST, 0, name);
3682 modname->op_private |= OPpCONST_BARE;
3684 veop = newSVOP(OP_CONST, 0, ver);
3688 if (flags & PERL_LOADMOD_NOIMPORT) {
3689 imop = sawparens(newNULLLIST());
3691 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
3692 imop = va_arg(*args, OP*);
3697 sv = va_arg(*args, SV*);
3699 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
3700 sv = va_arg(*args, SV*);
3704 const line_t ocopline = PL_copline;
3705 COP * const ocurcop = PL_curcop;
3706 const int oexpect = PL_expect;
3708 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3709 veop, modname, imop);
3710 PL_expect = oexpect;
3711 PL_copline = ocopline;
3712 PL_curcop = ocurcop;
3717 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
3723 if (!force_builtin) {
3724 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
3725 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
3726 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
3727 gv = gvp ? *gvp : NULL;
3731 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
3732 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3733 append_elem(OP_LIST, term,
3734 scalar(newUNOP(OP_RV2CV, 0,
3735 newGVOP(OP_GV, 0, gv))))));
3738 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3744 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3746 return newBINOP(OP_LSLICE, flags,
3747 list(force_list(subscript)),
3748 list(force_list(listval)) );
3752 S_is_list_assignment(pTHX_ register const OP *o)
3760 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
3761 o = cUNOPo->op_first;
3763 flags = o->op_flags;
3765 if (type == OP_COND_EXPR) {
3766 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
3767 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3772 yyerror("Assignment to both a list and a scalar");
3776 if (type == OP_LIST &&
3777 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
3778 o->op_private & OPpLVAL_INTRO)
3781 if (type == OP_LIST || flags & OPf_PARENS ||
3782 type == OP_RV2AV || type == OP_RV2HV ||
3783 type == OP_ASLICE || type == OP_HSLICE)
3786 if (type == OP_PADAV || type == OP_PADHV)
3789 if (type == OP_RV2SV)
3796 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3802 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
3803 return newLOGOP(optype, 0,
3804 mod(scalar(left), optype),
3805 newUNOP(OP_SASSIGN, 0, scalar(right)));
3808 return newBINOP(optype, OPf_STACKED,
3809 mod(scalar(left), optype), scalar(right));
3813 if (is_list_assignment(left)) {
3817 /* Grandfathering $[ assignment here. Bletch.*/
3818 /* Only simple assignments like C<< ($[) = 1 >> are allowed */
3819 PL_eval_start = (left->op_type == OP_CONST) ? right : 0;
3820 left = mod(left, OP_AASSIGN);
3823 else if (left->op_type == OP_CONST) {
3825 /* Result of assignment is always 1 (or we'd be dead already) */
3826 return newSVOP(OP_CONST, 0, newSViv(1));
3828 curop = list(force_list(left));
3829 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3830 o->op_private = (U8)(0 | (flags >> 8));
3832 /* PL_generation sorcery:
3833 * an assignment like ($a,$b) = ($c,$d) is easier than
3834 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
3835 * To detect whether there are common vars, the global var
3836 * PL_generation is incremented for each assign op we compile.
3837 * Then, while compiling the assign op, we run through all the
3838 * variables on both sides of the assignment, setting a spare slot
3839 * in each of them to PL_generation. If any of them already have
3840 * that value, we know we've got commonality. We could use a
3841 * single bit marker, but then we'd have to make 2 passes, first
3842 * to clear the flag, then to test and set it. To find somewhere
3843 * to store these values, evil chicanery is done with SvUVX().
3849 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3850 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3851 if (curop->op_type == OP_GV) {
3852 GV *gv = cGVOPx_gv(curop);
3854 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
3856 GvASSIGN_GENERATION_set(gv, PL_generation);
3858 else if (curop->op_type == OP_PADSV ||
3859 curop->op_type == OP_PADAV ||
3860 curop->op_type == OP_PADHV ||
3861 curop->op_type == OP_PADANY)
3863 if (PAD_COMPNAME_GEN(curop->op_targ)
3864 == (STRLEN)PL_generation)
3866 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
3869 else if (curop->op_type == OP_RV2CV)
3871 else if (curop->op_type == OP_RV2SV ||
3872 curop->op_type == OP_RV2AV ||
3873 curop->op_type == OP_RV2HV ||
3874 curop->op_type == OP_RV2GV) {
3875 if (lastop->op_type != OP_GV) /* funny deref? */
3878 else if (curop->op_type == OP_PUSHRE) {
3879 if (((PMOP*)curop)->op_pmreplroot) {
3881 GV *gv = (GV*)PAD_SVl(INT2PTR(PADOFFSET,
3882 ((PMOP*)curop)->op_pmreplroot));
3884 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3887 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
3889 GvASSIGN_GENERATION_set(gv, PL_generation);
3890 GvASSIGN_GENERATION_set(gv, PL_generation);
3899 o->op_private |= OPpASSIGN_COMMON;
3902 if ( ((left->op_private & OPpLVAL_INTRO) || ckWARN(WARN_MISC))
3903 && (left->op_type == OP_LIST
3904 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
3906 OP* lop = ((LISTOP*)left)->op_first;
3908 if (lop->op_type == OP_PADSV ||
3909 lop->op_type == OP_PADAV ||
3910 lop->op_type == OP_PADHV ||
3911 lop->op_type == OP_PADANY)
3913 if (lop->op_private & OPpPAD_STATE) {
3914 if (left->op_private & OPpLVAL_INTRO) {
3915 o->op_private |= OPpASSIGN_STATE;
3916 /* hijacking PADSTALE for uninitialized state variables */
3917 SvPADSTALE_on(PAD_SVl(lop->op_targ));
3919 else { /* we already checked for WARN_MISC before */
3920 Perl_warner(aTHX_ packWARN(WARN_MISC), "State variable %s will be reinitialized",
3921 PAD_COMPNAME_PV(lop->op_targ));
3925 lop = lop->op_sibling;
3928 else if (((left->op_private & (OPpLVAL_INTRO | OPpPAD_STATE))
3929 == (OPpLVAL_INTRO | OPpPAD_STATE))
3930 && ( left->op_type == OP_PADSV
3931 || left->op_type == OP_PADAV
3932 || left->op_type == OP_PADHV
3933 || left->op_type == OP_PADANY))
3935 o->op_private |= OPpASSIGN_STATE;
3936 /* hijacking PADSTALE for uninitialized state variables */
3937 SvPADSTALE_on(PAD_SVl(left->op_targ));
3940 if (right && right->op_type == OP_SPLIT) {
3941 OP* tmpop = ((LISTOP*)right)->op_first;
3942 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
3943 PMOP * const pm = (PMOP*)tmpop;
3944 if (left->op_type == OP_RV2AV &&
3945 !(left->op_private & OPpLVAL_INTRO) &&
3946 !(o->op_private & OPpASSIGN_COMMON) )
3948 tmpop = ((UNOP*)left)->op_first;
3949 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3951 pm->op_pmreplroot = INT2PTR(OP*, cPADOPx(tmpop)->op_padix);
3952 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3954 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3955 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
3957 pm->op_pmflags |= PMf_ONCE;
3958 tmpop = cUNOPo->op_first; /* to list (nulled) */
3959 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3960 tmpop->op_sibling = NULL; /* don't free split */
3961 right->op_next = tmpop->op_next; /* fix starting loc */
3963 op_getmad(o,right,'R'); /* blow off assign */
3965 op_free(o); /* blow off assign */
3967 right->op_flags &= ~OPf_WANT;
3968 /* "I don't know and I don't care." */
3973 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
3974 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3976 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3978 sv_setiv(sv, PL_modcount+1);
3986 right = newOP(OP_UNDEF, 0);
3987 if (right->op_type == OP_READLINE) {
3988 right->op_flags |= OPf_STACKED;
3989 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3992 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3993 o = newBINOP(OP_SASSIGN, flags,
3994 scalar(right), mod(scalar(left), OP_SASSIGN) );
4000 o = newSVOP(OP_CONST, 0, newSViv(CopARYBASE_get(&PL_compiling)));
4001 o->op_private |= OPpCONST_ARYBASE;
4008 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
4011 const U32 seq = intro_my();
4014 NewOp(1101, cop, 1, COP);
4015 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
4016 cop->op_type = OP_DBSTATE;
4017 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
4020 cop->op_type = OP_NEXTSTATE;
4021 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
4023 cop->op_flags = (U8)flags;
4024 CopHINTS_set(cop, PL_hints);
4026 cop->op_private |= NATIVE_HINTS;
4028 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
4029 cop->op_next = (OP*)cop;
4032 CopLABEL_set(cop, label);
4033 PL_hints |= HINT_BLOCK_SCOPE;
4036 /* CopARYBASE is now "virtual", in that it's stored as a flag bit in
4037 CopHINTS and a possible value in cop_hints_hash, so no need to copy it.
4039 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
4040 cop->cop_hints_hash = PL_curcop->cop_hints_hash;
4041 if (cop->cop_hints_hash) {
4043 cop->cop_hints_hash->refcounted_he_refcnt++;
4044 HINTS_REFCNT_UNLOCK;
4047 if (PL_copline == NOLINE)
4048 CopLINE_set(cop, CopLINE(PL_curcop));
4050 CopLINE_set(cop, PL_copline);
4051 PL_copline = NOLINE;
4054 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
4056 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
4058 CopSTASH_set(cop, PL_curstash);
4060 if (PERLDB_LINE && PL_curstash != PL_debstash) {
4061 AV *av = CopFILEAVx(PL_curcop);
4063 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
4064 if (svp && *svp != &PL_sv_undef ) {
4065 (void)SvIOK_on(*svp);
4066 SvIV_set(*svp, PTR2IV(cop));
4071 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
4076 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
4079 return new_logop(type, flags, &first, &other);
4083 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
4088 OP *first = *firstp;
4089 OP * const other = *otherp;
4091 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
4092 return newBINOP(type, flags, scalar(first), scalar(other));
4094 scalarboolean(first);
4095 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
4096 if (first->op_type == OP_NOT
4097 && (first->op_flags & OPf_SPECIAL)
4098 && (first->op_flags & OPf_KIDS)) {
4099 if (type == OP_AND || type == OP_OR) {
4105 first = *firstp = cUNOPo->op_first;
4107 first->op_next = o->op_next;
4108 cUNOPo->op_first = NULL;
4110 op_getmad(o,first,'O');
4116 if (first->op_type == OP_CONST) {
4117 if (first->op_private & OPpCONST_STRICT)
4118 no_bareword_allowed(first);
4119 else if ((first->op_private & OPpCONST_BARE) && ckWARN(WARN_BAREWORD))
4120 Perl_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
4121 if ((type == OP_AND && SvTRUE(((SVOP*)first)->op_sv)) ||
4122 (type == OP_OR && !SvTRUE(((SVOP*)first)->op_sv)) ||
4123 (type == OP_DOR && !SvOK(((SVOP*)first)->op_sv))) {
4125 if (other->op_type == OP_CONST)
4126 other->op_private |= OPpCONST_SHORTCIRCUIT;
4128 OP *newop = newUNOP(OP_NULL, 0, other);
4129 op_getmad(first, newop, '1');
4130 newop->op_targ = type; /* set "was" field */
4137 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
4138 const OP *o2 = other;
4139 if ( ! (o2->op_type == OP_LIST
4140 && (( o2 = cUNOPx(o2)->op_first))
4141 && o2->op_type == OP_PUSHMARK
4142 && (( o2 = o2->op_sibling)) )
4145 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
4146 || o2->op_type == OP_PADHV)
4147 && o2->op_private & OPpLVAL_INTRO
4148 && ckWARN(WARN_DEPRECATED))
4150 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
4151 "Deprecated use of my() in false conditional");
4155 if (first->op_type == OP_CONST)
4156 first->op_private |= OPpCONST_SHORTCIRCUIT;
4158 first = newUNOP(OP_NULL, 0, first);
4159 op_getmad(other, first, '2');
4160 first->op_targ = type; /* set "was" field */
4167 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
4168 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
4170 const OP * const k1 = ((UNOP*)first)->op_first;
4171 const OP * const k2 = k1->op_sibling;
4173 switch (first->op_type)
4176 if (k2 && k2->op_type == OP_READLINE
4177 && (k2->op_flags & OPf_STACKED)
4178 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4180 warnop = k2->op_type;
4185 if (k1->op_type == OP_READDIR
4186 || k1->op_type == OP_GLOB
4187 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4188 || k1->op_type == OP_EACH)
4190 warnop = ((k1->op_type == OP_NULL)
4191 ? (OPCODE)k1->op_targ : k1->op_type);
4196 const line_t oldline = CopLINE(PL_curcop);
4197 CopLINE_set(PL_curcop, PL_copline);
4198 Perl_warner(aTHX_ packWARN(WARN_MISC),
4199 "Value of %s%s can be \"0\"; test with defined()",
4201 ((warnop == OP_READLINE || warnop == OP_GLOB)
4202 ? " construct" : "() operator"));
4203 CopLINE_set(PL_curcop, oldline);
4210 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
4211 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
4213 NewOp(1101, logop, 1, LOGOP);
4215 logop->op_type = (OPCODE)type;
4216 logop->op_ppaddr = PL_ppaddr[type];
4217 logop->op_first = first;
4218 logop->op_flags = (U8)(flags | OPf_KIDS);
4219 logop->op_other = LINKLIST(other);
4220 logop->op_private = (U8)(1 | (flags >> 8));
4222 /* establish postfix order */
4223 logop->op_next = LINKLIST(first);
4224 first->op_next = (OP*)logop;
4225 first->op_sibling = other;
4227 CHECKOP(type,logop);
4229 o = newUNOP(OP_NULL, 0, (OP*)logop);
4236 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
4244 return newLOGOP(OP_AND, 0, first, trueop);
4246 return newLOGOP(OP_OR, 0, first, falseop);
4248 scalarboolean(first);
4249 if (first->op_type == OP_CONST) {
4250 /* Left or right arm of the conditional? */
4251 const bool left = SvTRUE(((SVOP*)first)->op_sv);
4252 OP *live = left ? trueop : falseop;
4253 OP *const dead = left ? falseop : trueop;
4254 if (first->op_private & OPpCONST_BARE &&
4255 first->op_private & OPpCONST_STRICT) {
4256 no_bareword_allowed(first);
4259 /* This is all dead code when PERL_MAD is not defined. */
4260 live = newUNOP(OP_NULL, 0, live);
4261 op_getmad(first, live, 'C');
4262 op_getmad(dead, live, left ? 'e' : 't');
4269 NewOp(1101, logop, 1, LOGOP);
4270 logop->op_type = OP_COND_EXPR;
4271 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
4272 logop->op_first = first;
4273 logop->op_flags = (U8)(flags | OPf_KIDS);
4274 logop->op_private = (U8)(1 | (flags >> 8));
4275 logop->op_other = LINKLIST(trueop);
4276 logop->op_next = LINKLIST(falseop);
4278 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
4281 /* establish postfix order */
4282 start = LINKLIST(first);
4283 first->op_next = (OP*)logop;
4285 first->op_sibling = trueop;
4286 trueop->op_sibling = falseop;
4287 o = newUNOP(OP_NULL, 0, (OP*)logop);
4289 trueop->op_next = falseop->op_next = o;
4296 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
4305 NewOp(1101, range, 1, LOGOP);
4307 range->op_type = OP_RANGE;
4308 range->op_ppaddr = PL_ppaddr[OP_RANGE];
4309 range->op_first = left;
4310 range->op_flags = OPf_KIDS;
4311 leftstart = LINKLIST(left);
4312 range->op_other = LINKLIST(right);
4313 range->op_private = (U8)(1 | (flags >> 8));
4315 left->op_sibling = right;
4317 range->op_next = (OP*)range;
4318 flip = newUNOP(OP_FLIP, flags, (OP*)range);
4319 flop = newUNOP(OP_FLOP, 0, flip);
4320 o = newUNOP(OP_NULL, 0, flop);
4322 range->op_next = leftstart;
4324 left->op_next = flip;
4325 right->op_next = flop;
4327 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4328 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
4329 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4330 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
4332 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4333 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4336 if (!flip->op_private || !flop->op_private)
4337 linklist(o); /* blow off optimizer unless constant */
4343 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
4348 const bool once = block && block->op_flags & OPf_SPECIAL &&
4349 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
4351 PERL_UNUSED_ARG(debuggable);
4354 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
4355 return block; /* do {} while 0 does once */
4356 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
4357 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4358 expr = newUNOP(OP_DEFINED, 0,
4359 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4360 } else if (expr->op_flags & OPf_KIDS) {
4361 const OP * const k1 = ((UNOP*)expr)->op_first;
4362 const OP * const k2 = k1 ? k1->op_sibling : NULL;
4363 switch (expr->op_type) {
4365 if (k2 && k2->op_type == OP_READLINE
4366 && (k2->op_flags & OPf_STACKED)
4367 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4368 expr = newUNOP(OP_DEFINED, 0, expr);
4372 if (k1 && (k1->op_type == OP_READDIR
4373 || k1->op_type == OP_GLOB
4374 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4375 || k1->op_type == OP_EACH))
4376 expr = newUNOP(OP_DEFINED, 0, expr);
4382 /* if block is null, the next append_elem() would put UNSTACK, a scalar
4383 * op, in listop. This is wrong. [perl #27024] */
4385 block = newOP(OP_NULL, 0);
4386 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
4387 o = new_logop(OP_AND, 0, &expr, &listop);
4390 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
4392 if (once && o != listop)
4393 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
4396 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
4398 o->op_flags |= flags;
4400 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
4405 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32
4406 whileline, OP *expr, OP *block, OP *cont, I32 has_my)
4415 PERL_UNUSED_ARG(debuggable);
4418 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
4419 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4420 expr = newUNOP(OP_DEFINED, 0,
4421 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4422 } else if (expr->op_flags & OPf_KIDS) {
4423 const OP * const k1 = ((UNOP*)expr)->op_first;
4424 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
4425 switch (expr->op_type) {
4427 if (k2 && k2->op_type == OP_READLINE
4428 && (k2->op_flags & OPf_STACKED)
4429 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4430 expr = newUNOP(OP_DEFINED, 0, expr);
4434 if (k1 && (k1->op_type == OP_READDIR
4435 || k1->op_type == OP_GLOB
4436 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4437 || k1->op_type == OP_EACH))
4438 expr = newUNOP(OP_DEFINED, 0, expr);
4445 block = newOP(OP_NULL, 0);
4446 else if (cont || has_my) {
4447 block = scope(block);
4451 next = LINKLIST(cont);
4454 OP * const unstack = newOP(OP_UNSTACK, 0);
4457 cont = append_elem(OP_LINESEQ, cont, unstack);
4461 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
4463 redo = LINKLIST(listop);
4466 PL_copline = (line_t)whileline;
4468 o = new_logop(OP_AND, 0, &expr, &listop);
4469 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
4470 op_free(expr); /* oops, it's a while (0) */
4472 return NULL; /* listop already freed by new_logop */
4475 ((LISTOP*)listop)->op_last->op_next =
4476 (o == listop ? redo : LINKLIST(o));
4482 NewOp(1101,loop,1,LOOP);
4483 loop->op_type = OP_ENTERLOOP;
4484 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
4485 loop->op_private = 0;
4486 loop->op_next = (OP*)loop;
4489 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
4491 loop->op_redoop = redo;
4492 loop->op_lastop = o;
4493 o->op_private |= loopflags;
4496 loop->op_nextop = next;
4498 loop->op_nextop = o;
4500 o->op_flags |= flags;
4501 o->op_private |= (flags >> 8);
4506 Perl_newFOROP(pTHX_ I32 flags, char *label, line_t forline, OP *sv, OP *expr, OP *block, OP *cont)
4511 PADOFFSET padoff = 0;
4517 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
4518 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
4519 sv->op_type = OP_RV2GV;
4520 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
4522 /* The op_type check is needed to prevent a possible segfault
4523 * if the loop variable is undeclared and 'strict vars' is in
4524 * effect. This is illegal but is nonetheless parsed, so we
4525 * may reach this point with an OP_CONST where we're expecting
4528 if (cUNOPx(sv)->op_first->op_type == OP_GV
4529 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
4530 iterpflags |= OPpITER_DEF;
4532 else if (sv->op_type == OP_PADSV) { /* private variable */
4533 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
4534 padoff = sv->op_targ;
4544 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
4546 SV *const namesv = PAD_COMPNAME_SV(padoff);
4548 const char *const name = SvPV_const(namesv, len);
4550 if (len == 2 && name[0] == '$' && name[1] == '_')
4551 iterpflags |= OPpITER_DEF;
4555 const PADOFFSET offset = pad_findmy("$_");
4556 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
4557 sv = newGVOP(OP_GV, 0, PL_defgv);
4562 iterpflags |= OPpITER_DEF;
4564 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
4565 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
4566 iterflags |= OPf_STACKED;
4568 else if (expr->op_type == OP_NULL &&
4569 (expr->op_flags & OPf_KIDS) &&
4570 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
4572 /* Basically turn for($x..$y) into the same as for($x,$y), but we
4573 * set the STACKED flag to indicate that these values are to be
4574 * treated as min/max values by 'pp_iterinit'.
4576 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
4577 LOGOP* const range = (LOGOP*) flip->op_first;
4578 OP* const left = range->op_first;
4579 OP* const right = left->op_sibling;
4582 range->op_flags &= ~OPf_KIDS;
4583 range->op_first = NULL;
4585 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
4586 listop->op_first->op_next = range->op_next;
4587 left->op_next = range->op_other;
4588 right->op_next = (OP*)listop;
4589 listop->op_next = listop->op_first;
4592 op_getmad(expr,(OP*)listop,'O');
4596 expr = (OP*)(listop);
4598 iterflags |= OPf_STACKED;
4601 expr = mod(force_list(expr), OP_GREPSTART);
4604 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
4605 append_elem(OP_LIST, expr, scalar(sv))));
4606 assert(!loop->op_next);
4607 /* for my $x () sets OPpLVAL_INTRO;
4608 * for our $x () sets OPpOUR_INTRO */
4609 loop->op_private = (U8)iterpflags;
4610 #ifdef PL_OP_SLAB_ALLOC
4613 NewOp(1234,tmp,1,LOOP);
4614 Copy(loop,tmp,1,LISTOP);
4615 S_op_destroy(aTHX_ (OP*)loop);
4619 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
4621 loop->op_targ = padoff;
4622 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont, 0);
4624 op_getmad(madsv, (OP*)loop, 'v');
4625 PL_copline = forline;
4626 return newSTATEOP(0, label, wop);
4630 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
4635 if (type != OP_GOTO || label->op_type == OP_CONST) {
4636 /* "last()" means "last" */
4637 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
4638 o = newOP(type, OPf_SPECIAL);
4640 o = newPVOP(type, 0, savesharedpv(label->op_type == OP_CONST
4641 ? SvPVx_nolen_const(((SVOP*)label)->op_sv)
4645 op_getmad(label,o,'L');
4651 /* Check whether it's going to be a goto &function */
4652 if (label->op_type == OP_ENTERSUB
4653 && !(label->op_flags & OPf_STACKED))
4654 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
4655 o = newUNOP(type, OPf_STACKED, label);
4657 PL_hints |= HINT_BLOCK_SCOPE;
4661 /* if the condition is a literal array or hash
4662 (or @{ ... } etc), make a reference to it.
4665 S_ref_array_or_hash(pTHX_ OP *cond)
4668 && (cond->op_type == OP_RV2AV
4669 || cond->op_type == OP_PADAV
4670 || cond->op_type == OP_RV2HV
4671 || cond->op_type == OP_PADHV))
4673 return newUNOP(OP_REFGEN,
4674 0, mod(cond, OP_REFGEN));
4680 /* These construct the optree fragments representing given()
4683 entergiven and enterwhen are LOGOPs; the op_other pointer
4684 points up to the associated leave op. We need this so we
4685 can put it in the context and make break/continue work.
4686 (Also, of course, pp_enterwhen will jump straight to
4687 op_other if the match fails.)
4692 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
4693 I32 enter_opcode, I32 leave_opcode,
4694 PADOFFSET entertarg)
4700 NewOp(1101, enterop, 1, LOGOP);
4701 enterop->op_type = enter_opcode;
4702 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
4703 enterop->op_flags = (U8) OPf_KIDS;
4704 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
4705 enterop->op_private = 0;
4707 o = newUNOP(leave_opcode, 0, (OP *) enterop);
4710 enterop->op_first = scalar(cond);
4711 cond->op_sibling = block;
4713 o->op_next = LINKLIST(cond);
4714 cond->op_next = (OP *) enterop;
4717 /* This is a default {} block */
4718 enterop->op_first = block;
4719 enterop->op_flags |= OPf_SPECIAL;
4721 o->op_next = (OP *) enterop;
4724 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
4725 entergiven and enterwhen both
4728 enterop->op_next = LINKLIST(block);
4729 block->op_next = enterop->op_other = o;
4734 /* Does this look like a boolean operation? For these purposes
4735 a boolean operation is:
4736 - a subroutine call [*]
4737 - a logical connective
4738 - a comparison operator
4739 - a filetest operator, with the exception of -s -M -A -C
4740 - defined(), exists() or eof()
4741 - /$re/ or $foo =~ /$re/
4743 [*] possibly surprising
4747 S_looks_like_bool(pTHX_ const OP *o)
4750 switch(o->op_type) {
4752 return looks_like_bool(cLOGOPo->op_first);
4756 looks_like_bool(cLOGOPo->op_first)
4757 && looks_like_bool(cLOGOPo->op_first->op_sibling));
4761 case OP_NOT: case OP_XOR:
4762 /* Note that OP_DOR is not here */
4764 case OP_EQ: case OP_NE: case OP_LT:
4765 case OP_GT: case OP_LE: case OP_GE:
4767 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
4768 case OP_I_GT: case OP_I_LE: case OP_I_GE:
4770 case OP_SEQ: case OP_SNE: case OP_SLT:
4771 case OP_SGT: case OP_SLE: case OP_SGE:
4775 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
4776 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
4777 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
4778 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
4779 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
4780 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
4781 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
4782 case OP_FTTEXT: case OP_FTBINARY:
4784 case OP_DEFINED: case OP_EXISTS:
4785 case OP_MATCH: case OP_EOF:
4790 /* Detect comparisons that have been optimized away */
4791 if (cSVOPo->op_sv == &PL_sv_yes
4792 || cSVOPo->op_sv == &PL_sv_no)
4803 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
4807 return newGIVWHENOP(
4808 ref_array_or_hash(cond),
4810 OP_ENTERGIVEN, OP_LEAVEGIVEN,
4814 /* If cond is null, this is a default {} block */
4816 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
4818 const bool cond_llb = (!cond || looks_like_bool(cond));
4824 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
4826 scalar(ref_array_or_hash(cond)));
4829 return newGIVWHENOP(
4831 append_elem(block->op_type, block, newOP(OP_BREAK, OPf_SPECIAL)),
4832 OP_ENTERWHEN, OP_LEAVEWHEN, 0);
4836 =for apidoc cv_undef
4838 Clear out all the active components of a CV. This can happen either
4839 by an explicit C<undef &foo>, or by the reference count going to zero.
4840 In the former case, we keep the CvOUTSIDE pointer, so that any anonymous
4841 children can still follow the full lexical scope chain.
4847 Perl_cv_undef(pTHX_ CV *cv)
4851 if (CvFILE(cv) && !CvISXSUB(cv)) {
4852 /* for XSUBs CvFILE point directly to static memory; __FILE__ */
4853 Safefree(CvFILE(cv));
4858 if (!CvISXSUB(cv) && CvROOT(cv)) {
4859 if (SvTYPE(cv) == SVt_PVCV && CvDEPTH(cv))
4860 Perl_croak(aTHX_ "Can't undef active subroutine");
4863 PAD_SAVE_SETNULLPAD();
4865 op_free(CvROOT(cv));
4870 SvPOK_off((SV*)cv); /* forget prototype */
4875 /* remove CvOUTSIDE unless this is an undef rather than a free */
4876 if (!SvREFCNT(cv) && CvOUTSIDE(cv)) {
4877 if (!CvWEAKOUTSIDE(cv))
4878 SvREFCNT_dec(CvOUTSIDE(cv));
4879 CvOUTSIDE(cv) = NULL;
4882 SvREFCNT_dec((SV*)CvXSUBANY(cv).any_ptr);
4885 if (CvISXSUB(cv) && CvXSUB(cv)) {
4888 /* delete all flags except WEAKOUTSIDE */
4889 CvFLAGS(cv) &= CVf_WEAKOUTSIDE;
4893 Perl_cv_ckproto_len(pTHX_ const CV *cv, const GV *gv, const char *p,
4896 /* Can't just use a strcmp on the prototype, as CONSTSUBs "cheat" by
4897 relying on SvCUR, and doubling up the buffer to hold CvFILE(). */
4898 if (((!p != !SvPOK(cv)) /* One has prototype, one has not. */
4899 || (p && (len != SvCUR(cv) /* Not the same length. */
4900 || memNE(p, SvPVX_const(cv), len))))
4901 && ckWARN_d(WARN_PROTOTYPE)) {
4902 SV* const msg = sv_newmortal();
4906 gv_efullname3(name = sv_newmortal(), gv, NULL);
4907 sv_setpvs(msg, "Prototype mismatch:");
4909 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
4911 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")", SVfARG(cv));
4913 sv_catpvs(msg, ": none");
4914 sv_catpvs(msg, " vs ");
4916 Perl_sv_catpvf(aTHX_ msg, "(%.*s)", (int) len, p);
4918 sv_catpvs(msg, "none");
4919 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
4923 static void const_sv_xsub(pTHX_ CV* cv);
4927 =head1 Optree Manipulation Functions
4929 =for apidoc cv_const_sv
4931 If C<cv> is a constant sub eligible for inlining. returns the constant
4932 value returned by the sub. Otherwise, returns NULL.
4934 Constant subs can be created with C<newCONSTSUB> or as described in
4935 L<perlsub/"Constant Functions">.
4940 Perl_cv_const_sv(pTHX_ CV *cv)
4942 PERL_UNUSED_CONTEXT;
4945 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
4947 return CvCONST(cv) ? (SV*)CvXSUBANY(cv).any_ptr : NULL;
4950 /* op_const_sv: examine an optree to determine whether it's in-lineable.
4951 * Can be called in 3 ways:
4954 * look for a single OP_CONST with attached value: return the value
4956 * cv && CvCLONE(cv) && !CvCONST(cv)
4958 * examine the clone prototype, and if contains only a single
4959 * OP_CONST referencing a pad const, or a single PADSV referencing
4960 * an outer lexical, return a non-zero value to indicate the CV is
4961 * a candidate for "constizing" at clone time
4965 * We have just cloned an anon prototype that was marked as a const
4966 * candidiate. Try to grab the current value, and in the case of
4967 * PADSV, ignore it if it has multiple references. Return the value.
4971 Perl_op_const_sv(pTHX_ const OP *o, CV *cv)
4979 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4980 o = cLISTOPo->op_first->op_sibling;
4982 for (; o; o = o->op_next) {
4983 const OPCODE type = o->op_type;
4985 if (sv && o->op_next == o)
4987 if (o->op_next != o) {
4988 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4990 if (type == OP_DBSTATE)
4993 if (type == OP_LEAVESUB || type == OP_RETURN)
4997 if (type == OP_CONST && cSVOPo->op_sv)
4999 else if (cv && type == OP_CONST) {
5000 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
5004 else if (cv && type == OP_PADSV) {
5005 if (CvCONST(cv)) { /* newly cloned anon */
5006 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
5007 /* the candidate should have 1 ref from this pad and 1 ref
5008 * from the parent */
5009 if (!sv || SvREFCNT(sv) != 2)
5016 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
5017 sv = &PL_sv_undef; /* an arbitrary non-null value */
5032 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
5035 /* This would be the return value, but the return cannot be reached. */
5036 OP* pegop = newOP(OP_NULL, 0);
5039 PERL_UNUSED_ARG(floor);
5049 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
5051 NORETURN_FUNCTION_END;
5056 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
5058 return Perl_newATTRSUB(aTHX_ floor, o, proto, NULL, block);
5062 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
5069 register CV *cv = NULL;
5071 /* If the subroutine has no body, no attributes, and no builtin attributes
5072 then it's just a sub declaration, and we may be able to get away with
5073 storing with a placeholder scalar in the symbol table, rather than a
5074 full GV and CV. If anything is present then it will take a full CV to
5076 const I32 gv_fetch_flags
5077 = (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
5079 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
5080 const char * const name = o ? SvPVx_nolen_const(cSVOPo->op_sv) : NULL;
5083 assert(proto->op_type == OP_CONST);
5084 ps = SvPVx_const(((SVOP*)proto)->op_sv, ps_len);
5089 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
5090 SV * const sv = sv_newmortal();
5091 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
5092 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
5093 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
5094 aname = SvPVX_const(sv);
5099 gv = name ? gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV)
5100 : gv_fetchpv(aname ? aname
5101 : (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
5102 gv_fetch_flags, SVt_PVCV);
5104 if (!PL_madskills) {
5113 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
5114 maximum a prototype before. */
5115 if (SvTYPE(gv) > SVt_NULL) {
5116 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
5117 && ckWARN_d(WARN_PROTOTYPE))
5119 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype");
5121 cv_ckproto_len((CV*)gv, NULL, ps, ps_len);
5124 sv_setpvn((SV*)gv, ps, ps_len);
5126 sv_setiv((SV*)gv, -1);
5127 SvREFCNT_dec(PL_compcv);
5128 cv = PL_compcv = NULL;
5129 PL_sub_generation++;
5133 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
5135 #ifdef GV_UNIQUE_CHECK
5136 if (cv && GvUNIQUE(gv) && SvREADONLY(cv)) {
5137 Perl_croak(aTHX_ "Can't define subroutine %s (GV is unique)", name);
5141 if (!block || !ps || *ps || attrs
5142 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
5144 || block->op_type == OP_NULL
5149 const_sv = op_const_sv(block, NULL);
5152 const bool exists = CvROOT(cv) || CvXSUB(cv);
5154 #ifdef GV_UNIQUE_CHECK
5155 if (exists && GvUNIQUE(gv)) {
5156 Perl_croak(aTHX_ "Can't redefine unique subroutine %s", name);
5160 /* if the subroutine doesn't exist and wasn't pre-declared
5161 * with a prototype, assume it will be AUTOLOADed,
5162 * skipping the prototype check
5164 if (exists || SvPOK(cv))
5165 cv_ckproto_len(cv, gv, ps, ps_len);
5166 /* already defined (or promised)? */
5167 if (exists || GvASSUMECV(gv)) {
5170 || block->op_type == OP_NULL
5173 if (CvFLAGS(PL_compcv)) {
5174 /* might have had built-in attrs applied */
5175 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
5177 /* just a "sub foo;" when &foo is already defined */
5178 SAVEFREESV(PL_compcv);
5183 && block->op_type != OP_NULL
5186 if (ckWARN(WARN_REDEFINE)
5188 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
5190 const line_t oldline = CopLINE(PL_curcop);
5191 if (PL_copline != NOLINE)
5192 CopLINE_set(PL_curcop, PL_copline);
5193 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
5194 CvCONST(cv) ? "Constant subroutine %s redefined"
5195 : "Subroutine %s redefined", name);
5196 CopLINE_set(PL_curcop, oldline);
5199 if (!PL_minus_c) /* keep old one around for madskills */
5202 /* (PL_madskills unset in used file.) */
5210 SvREFCNT_inc_simple_void_NN(const_sv);
5212 assert(!CvROOT(cv) && !CvCONST(cv));
5213 sv_setpvn((SV*)cv, "", 0); /* prototype is "" */
5214 CvXSUBANY(cv).any_ptr = const_sv;
5215 CvXSUB(cv) = const_sv_xsub;
5221 cv = newCONSTSUB(NULL, name, const_sv);
5223 PL_sub_generation++;
5227 SvREFCNT_dec(PL_compcv);
5235 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
5236 * before we clobber PL_compcv.
5240 || block->op_type == OP_NULL
5244 /* Might have had built-in attributes applied -- propagate them. */
5245 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
5246 if (CvGV(cv) && GvSTASH(CvGV(cv)))
5247 stash = GvSTASH(CvGV(cv));
5248 else if (CvSTASH(cv))
5249 stash = CvSTASH(cv);
5251 stash = PL_curstash;
5254 /* possibly about to re-define existing subr -- ignore old cv */
5255 rcv = (SV*)PL_compcv;
5256 if (name && GvSTASH(gv))
5257 stash = GvSTASH(gv);
5259 stash = PL_curstash;
5261 apply_attrs(stash, rcv, attrs, FALSE);
5263 if (cv) { /* must reuse cv if autoloaded */
5270 || block->op_type == OP_NULL) && !PL_madskills
5273 /* got here with just attrs -- work done, so bug out */
5274 SAVEFREESV(PL_compcv);
5277 /* transfer PL_compcv to cv */
5279 CvFLAGS(cv) = CvFLAGS(PL_compcv);
5280 if (!CvWEAKOUTSIDE(cv))
5281 SvREFCNT_dec(CvOUTSIDE(cv));
5282 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
5283 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
5284 CvOUTSIDE(PL_compcv) = 0;
5285 CvPADLIST(cv) = CvPADLIST(PL_compcv);
5286 CvPADLIST(PL_compcv) = 0;
5287 /* inner references to PL_compcv must be fixed up ... */
5288 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
5289 /* ... before we throw it away */
5290 SvREFCNT_dec(PL_compcv);
5292 if (PERLDB_INTER)/* Advice debugger on the new sub. */
5293 ++PL_sub_generation;
5300 if (strEQ(name, "import")) {
5301 PL_formfeed = (SV*)cv;
5302 Perl_warner(aTHX_ packWARN(WARN_VOID), "%lx\n", (long)cv);
5306 PL_sub_generation++;
5310 CvFILE_set_from_cop(cv, PL_curcop);
5311 CvSTASH(cv) = PL_curstash;
5314 sv_setpvn((SV*)cv, ps, ps_len);
5316 if (PL_error_count) {
5320 const char *s = strrchr(name, ':');
5322 if (strEQ(s, "BEGIN")) {
5323 const char not_safe[] =
5324 "BEGIN not safe after errors--compilation aborted";
5325 if (PL_in_eval & EVAL_KEEPERR)
5326 Perl_croak(aTHX_ not_safe);
5328 /* force display of errors found but not reported */
5329 sv_catpv(ERRSV, not_safe);
5330 Perl_croak(aTHX_ "%"SVf, SVfARG(ERRSV));
5340 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0,
5341 mod(scalarseq(block), OP_LEAVESUBLV));
5342 block->op_attached = 1;
5345 /* This makes sub {}; work as expected. */
5346 if (block->op_type == OP_STUB) {
5347 OP* const newblock = newSTATEOP(0, NULL, 0);
5349 op_getmad(block,newblock,'B');
5356 block->op_attached = 1;
5357 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
5359 CvROOT(cv)->op_private |= OPpREFCOUNTED;
5360 OpREFCNT_set(CvROOT(cv), 1);
5361 CvSTART(cv) = LINKLIST(CvROOT(cv));
5362 CvROOT(cv)->op_next = 0;
5363 CALL_PEEP(CvSTART(cv));
5365 /* now that optimizer has done its work, adjust pad values */
5367 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
5370 assert(!CvCONST(cv));
5371 if (ps && !*ps && op_const_sv(block, cv))
5375 if (name || aname) {
5376 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
5377 SV * const sv = newSV(0);
5378 SV * const tmpstr = sv_newmortal();
5379 GV * const db_postponed = gv_fetchpvs("DB::postponed",
5380 GV_ADDMULTI, SVt_PVHV);
5383 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
5385 (long)PL_subline, (long)CopLINE(PL_curcop));
5386 gv_efullname3(tmpstr, gv, NULL);
5387 hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr), SvCUR(tmpstr), sv, 0);
5388 hv = GvHVn(db_postponed);
5389 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvCUR(tmpstr))) {
5390 CV * const pcv = GvCV(db_postponed);
5396 call_sv((SV*)pcv, G_DISCARD);
5401 if (name && !PL_error_count)
5402 process_special_blocks(name, gv, cv);
5406 PL_copline = NOLINE;
5412 S_process_special_blocks(pTHX_ const char *const fullname, GV *const gv,
5415 const char *const colon = strrchr(fullname,':');
5416 const char *const name = colon ? colon + 1 : fullname;
5419 if (strEQ(name, "BEGIN")) {
5420 const I32 oldscope = PL_scopestack_ix;
5422 SAVECOPFILE(&PL_compiling);
5423 SAVECOPLINE(&PL_compiling);
5425 DEBUG_x( dump_sub(gv) );
5426 Perl_av_create_and_push(aTHX_ &PL_beginav, (SV*)cv);
5427 GvCV(gv) = 0; /* cv has been hijacked */
5428 call_list(oldscope, PL_beginav);
5430 PL_curcop = &PL_compiling;
5431 CopHINTS_set(&PL_compiling, PL_hints);
5438 if strEQ(name, "END") {
5439 DEBUG_x( dump_sub(gv) );
5440 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, (SV*)cv);
5443 } else if (*name == 'U') {
5444 if (strEQ(name, "UNITCHECK")) {
5445 /* It's never too late to run a unitcheck block */
5446 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, (SV*)cv);
5450 } else if (*name == 'C') {
5451 if (strEQ(name, "CHECK")) {
5452 if (PL_main_start && ckWARN(WARN_VOID))
5453 Perl_warner(aTHX_ packWARN(WARN_VOID),
5454 "Too late to run CHECK block");
5455 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, (SV*)cv);
5459 } else if (*name == 'I') {
5460 if (strEQ(name, "INIT")) {
5461 if (PL_main_start && ckWARN(WARN_VOID))
5462 Perl_warner(aTHX_ packWARN(WARN_VOID),
5463 "Too late to run INIT block");
5464 Perl_av_create_and_push(aTHX_ &PL_initav, (SV*)cv);
5470 DEBUG_x( dump_sub(gv) );
5471 GvCV(gv) = 0; /* cv has been hijacked */
5476 =for apidoc newCONSTSUB
5478 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
5479 eligible for inlining at compile-time.
5485 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
5490 const char *const temp_p = CopFILE(PL_curcop);
5491 const STRLEN len = temp_p ? strlen(temp_p) : 0;
5493 SV *const temp_sv = CopFILESV(PL_curcop);
5495 const char *const temp_p = temp_sv ? SvPV_const(temp_sv, len) : NULL;
5497 char *const file = savepvn(temp_p, temp_p ? len : 0);
5501 SAVECOPLINE(PL_curcop);
5502 CopLINE_set(PL_curcop, PL_copline);
5505 PL_hints &= ~HINT_BLOCK_SCOPE;
5508 SAVESPTR(PL_curstash);
5509 SAVECOPSTASH(PL_curcop);
5510 PL_curstash = stash;
5511 CopSTASH_set(PL_curcop,stash);
5514 /* file becomes the CvFILE. For an XS, it's supposed to be static storage,
5515 and so doesn't get free()d. (It's expected to be from the C pre-
5516 processor __FILE__ directive). But we need a dynamically allocated one,
5517 and we need it to get freed. */
5518 cv = newXS_flags(name, const_sv_xsub, file, "", XS_DYNAMIC_FILENAME);
5519 CvXSUBANY(cv).any_ptr = sv;
5525 CopSTASH_free(PL_curcop);
5533 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
5534 const char *const filename, const char *const proto,
5537 CV *cv = newXS(name, subaddr, filename);
5539 if (flags & XS_DYNAMIC_FILENAME) {
5540 /* We need to "make arrangements" (ie cheat) to ensure that the
5541 filename lasts as long as the PVCV we just created, but also doesn't
5543 STRLEN filename_len = strlen(filename);
5544 STRLEN proto_and_file_len = filename_len;
5545 char *proto_and_file;
5549 proto_len = strlen(proto);
5550 proto_and_file_len += proto_len;
5552 Newx(proto_and_file, proto_and_file_len + 1, char);
5553 Copy(proto, proto_and_file, proto_len, char);
5554 Copy(filename, proto_and_file + proto_len, filename_len + 1, char);
5557 proto_and_file = savepvn(filename, filename_len);
5560 /* This gets free()d. :-) */
5561 sv_usepvn_flags((SV*)cv, proto_and_file, proto_and_file_len,
5562 SV_HAS_TRAILING_NUL);
5564 /* This gives us the correct prototype, rather than one with the
5565 file name appended. */
5566 SvCUR_set(cv, proto_len);
5570 CvFILE(cv) = proto_and_file + proto_len;
5572 sv_setpv((SV *)cv, proto);
5578 =for apidoc U||newXS
5580 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
5581 static storage, as it is used directly as CvFILE(), without a copy being made.
5587 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
5590 GV * const gv = gv_fetchpv(name ? name :
5591 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
5592 GV_ADDMULTI, SVt_PVCV);
5596 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
5598 if ((cv = (name ? GvCV(gv) : NULL))) {
5600 /* just a cached method */
5604 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
5605 /* already defined (or promised) */
5606 /* XXX It's possible for this HvNAME_get to return null, and get passed into strEQ */
5607 if (ckWARN(WARN_REDEFINE)) {
5608 GV * const gvcv = CvGV(cv);
5610 HV * const stash = GvSTASH(gvcv);
5612 const char *redefined_name = HvNAME_get(stash);
5613 if ( strEQ(redefined_name,"autouse") ) {
5614 const line_t oldline = CopLINE(PL_curcop);
5615 if (PL_copline != NOLINE)
5616 CopLINE_set(PL_curcop, PL_copline);
5617 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
5618 CvCONST(cv) ? "Constant subroutine %s redefined"
5619 : "Subroutine %s redefined"
5621 CopLINE_set(PL_curcop, oldline);
5631 if (cv) /* must reuse cv if autoloaded */
5634 cv = (CV*)newSV_type(SVt_PVCV);
5638 PL_sub_generation++;
5642 (void)gv_fetchfile(filename);
5643 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
5644 an external constant string */
5646 CvXSUB(cv) = subaddr;
5649 process_special_blocks(name, gv, cv);
5661 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
5666 OP* pegop = newOP(OP_NULL, 0);
5670 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
5671 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
5673 #ifdef GV_UNIQUE_CHECK
5675 Perl_croak(aTHX_ "Bad symbol for form (GV is unique)");
5679 if ((cv = GvFORM(gv))) {
5680 if (ckWARN(WARN_REDEFINE)) {
5681 const line_t oldline = CopLINE(PL_curcop);
5682 if (PL_copline != NOLINE)
5683 CopLINE_set(PL_curcop, PL_copline);
5684 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
5685 o ? "Format %"SVf" redefined"
5686 : "Format STDOUT redefined", SVfARG(cSVOPo->op_sv));
5687 CopLINE_set(PL_curcop, oldline);
5694 CvFILE_set_from_cop(cv, PL_curcop);
5697 pad_tidy(padtidy_FORMAT);
5698 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
5699 CvROOT(cv)->op_private |= OPpREFCOUNTED;
5700 OpREFCNT_set(CvROOT(cv), 1);
5701 CvSTART(cv) = LINKLIST(CvROOT(cv));
5702 CvROOT(cv)->op_next = 0;
5703 CALL_PEEP(CvSTART(cv));
5705 op_getmad(o,pegop,'n');
5706 op_getmad_weak(block, pegop, 'b');
5710 PL_copline = NOLINE;
5718 Perl_newANONLIST(pTHX_ OP *o)
5720 return convert(OP_ANONLIST, OPf_SPECIAL, o);
5724 Perl_newANONHASH(pTHX_ OP *o)
5726 return convert(OP_ANONHASH, OPf_SPECIAL, o);
5730 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
5732 return newANONATTRSUB(floor, proto, NULL, block);
5736 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
5738 return newUNOP(OP_REFGEN, 0,
5739 newSVOP(OP_ANONCODE, 0,
5740 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
5744 Perl_oopsAV(pTHX_ OP *o)
5747 switch (o->op_type) {
5749 o->op_type = OP_PADAV;
5750 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5751 return ref(o, OP_RV2AV);
5754 o->op_type = OP_RV2AV;
5755 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
5760 if (ckWARN_d(WARN_INTERNAL))
5761 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
5768 Perl_oopsHV(pTHX_ OP *o)
5771 switch (o->op_type) {
5774 o->op_type = OP_PADHV;
5775 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5776 return ref(o, OP_RV2HV);
5780 o->op_type = OP_RV2HV;
5781 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
5786 if (ckWARN_d(WARN_INTERNAL))
5787 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
5794 Perl_newAVREF(pTHX_ OP *o)
5797 if (o->op_type == OP_PADANY) {
5798 o->op_type = OP_PADAV;
5799 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5802 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)
5803 && ckWARN(WARN_DEPRECATED)) {
5804 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
5805 "Using an array as a reference is deprecated");
5807 return newUNOP(OP_RV2AV, 0, scalar(o));
5811 Perl_newGVREF(pTHX_ I32 type, OP *o)
5813 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
5814 return newUNOP(OP_NULL, 0, o);
5815 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
5819 Perl_newHVREF(pTHX_ OP *o)
5822 if (o->op_type == OP_PADANY) {
5823 o->op_type = OP_PADHV;
5824 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5827 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)
5828 && ckWARN(WARN_DEPRECATED)) {
5829 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
5830 "Using a hash as a reference is deprecated");
5832 return newUNOP(OP_RV2HV, 0, scalar(o));
5836 Perl_newCVREF(pTHX_ I32 flags, OP *o)
5838 return newUNOP(OP_RV2CV, flags, scalar(o));
5842 Perl_newSVREF(pTHX_ OP *o)
5845 if (o->op_type == OP_PADANY) {
5846 o->op_type = OP_PADSV;
5847 o->op_ppaddr = PL_ppaddr[OP_PADSV];
5850 return newUNOP(OP_RV2SV, 0, scalar(o));
5853 /* Check routines. See the comments at the top of this file for details
5854 * on when these are called */
5857 Perl_ck_anoncode(pTHX_ OP *o)
5859 cSVOPo->op_targ = pad_add_anon(cSVOPo->op_sv, o->op_type);
5861 cSVOPo->op_sv = NULL;
5866 Perl_ck_bitop(pTHX_ OP *o)
5869 #define OP_IS_NUMCOMPARE(op) \
5870 ((op) == OP_LT || (op) == OP_I_LT || \
5871 (op) == OP_GT || (op) == OP_I_GT || \
5872 (op) == OP_LE || (op) == OP_I_LE || \
5873 (op) == OP_GE || (op) == OP_I_GE || \
5874 (op) == OP_EQ || (op) == OP_I_EQ || \
5875 (op) == OP_NE || (op) == OP_I_NE || \
5876 (op) == OP_NCMP || (op) == OP_I_NCMP)
5877 o->op_private = (U8)(PL_hints & HINT_INTEGER);
5878 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
5879 && (o->op_type == OP_BIT_OR
5880 || o->op_type == OP_BIT_AND
5881 || o->op_type == OP_BIT_XOR))
5883 const OP * const left = cBINOPo->op_first;
5884 const OP * const right = left->op_sibling;
5885 if ((OP_IS_NUMCOMPARE(left->op_type) &&
5886 (left->op_flags & OPf_PARENS) == 0) ||
5887 (OP_IS_NUMCOMPARE(right->op_type) &&
5888 (right->op_flags & OPf_PARENS) == 0))
5889 if (ckWARN(WARN_PRECEDENCE))
5890 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
5891 "Possible precedence problem on bitwise %c operator",
5892 o->op_type == OP_BIT_OR ? '|'
5893 : o->op_type == OP_BIT_AND ? '&' : '^'
5900 Perl_ck_concat(pTHX_ OP *o)
5902 const OP * const kid = cUNOPo->op_first;
5903 PERL_UNUSED_CONTEXT;
5904 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
5905 !(kUNOP->op_first->op_flags & OPf_MOD))
5906 o->op_flags |= OPf_STACKED;
5911 Perl_ck_spair(pTHX_ OP *o)
5914 if (o->op_flags & OPf_KIDS) {
5917 const OPCODE type = o->op_type;
5918 o = modkids(ck_fun(o), type);
5919 kid = cUNOPo->op_first;
5920 newop = kUNOP->op_first->op_sibling;
5922 const OPCODE type = newop->op_type;
5923 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
5924 type == OP_PADAV || type == OP_PADHV ||
5925 type == OP_RV2AV || type == OP_RV2HV)
5929 op_getmad(kUNOP->op_first,newop,'K');
5931 op_free(kUNOP->op_first);
5933 kUNOP->op_first = newop;
5935 o->op_ppaddr = PL_ppaddr[++o->op_type];
5940 Perl_ck_delete(pTHX_ OP *o)
5944 if (o->op_flags & OPf_KIDS) {
5945 OP * const kid = cUNOPo->op_first;
5946 switch (kid->op_type) {
5948 o->op_flags |= OPf_SPECIAL;
5951 o->op_private |= OPpSLICE;
5954 o->op_flags |= OPf_SPECIAL;
5959 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5968 Perl_ck_die(pTHX_ OP *o)
5971 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
5977 Perl_ck_eof(pTHX_ OP *o)
5981 if (o->op_flags & OPf_KIDS) {
5982 if (cLISTOPo->op_first->op_type == OP_STUB) {
5984 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
5986 op_getmad(o,newop,'O');
5998 Perl_ck_eval(pTHX_ OP *o)
6001 PL_hints |= HINT_BLOCK_SCOPE;
6002 if (o->op_flags & OPf_KIDS) {
6003 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6006 o->op_flags &= ~OPf_KIDS;
6009 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
6015 cUNOPo->op_first = 0;
6020 NewOp(1101, enter, 1, LOGOP);
6021 enter->op_type = OP_ENTERTRY;
6022 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
6023 enter->op_private = 0;
6025 /* establish postfix order */
6026 enter->op_next = (OP*)enter;
6028 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
6029 o->op_type = OP_LEAVETRY;
6030 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
6031 enter->op_other = o;
6032 op_getmad(oldo,o,'O');
6046 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
6047 op_getmad(oldo,o,'O');
6049 o->op_targ = (PADOFFSET)PL_hints;
6050 if ((PL_hints & HINT_LOCALIZE_HH) != 0 && GvHV(PL_hintgv)) {
6051 /* Store a copy of %^H that pp_entereval can pick up.
6052 OPf_SPECIAL flags the opcode as being for this purpose,
6053 so that it in turn will return a copy at every
6055 OP *hhop = newSVOP(OP_CONST, OPf_SPECIAL,
6056 (SV*)Perl_hv_copy_hints_hv(aTHX_ GvHV(PL_hintgv)));
6057 cUNOPo->op_first->op_sibling = hhop;
6058 o->op_private |= OPpEVAL_HAS_HH;
6064 Perl_ck_exit(pTHX_ OP *o)
6067 HV * const table = GvHV(PL_hintgv);
6069 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
6070 if (svp && *svp && SvTRUE(*svp))
6071 o->op_private |= OPpEXIT_VMSISH;
6073 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
6079 Perl_ck_exec(pTHX_ OP *o)
6081 if (o->op_flags & OPf_STACKED) {
6084 kid = cUNOPo->op_first->op_sibling;
6085 if (kid->op_type == OP_RV2GV)
6094 Perl_ck_exists(pTHX_ OP *o)
6098 if (o->op_flags & OPf_KIDS) {
6099 OP * const kid = cUNOPo->op_first;
6100 if (kid->op_type == OP_ENTERSUB) {
6101 (void) ref(kid, o->op_type);
6102 if (kid->op_type != OP_RV2CV && !PL_error_count)
6103 Perl_croak(aTHX_ "%s argument is not a subroutine name",
6105 o->op_private |= OPpEXISTS_SUB;
6107 else if (kid->op_type == OP_AELEM)
6108 o->op_flags |= OPf_SPECIAL;
6109 else if (kid->op_type != OP_HELEM)
6110 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
6118 Perl_ck_rvconst(pTHX_ register OP *o)
6121 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6123 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6124 if (o->op_type == OP_RV2CV)
6125 o->op_private &= ~1;
6127 if (kid->op_type == OP_CONST) {
6130 SV * const kidsv = kid->op_sv;
6132 /* Is it a constant from cv_const_sv()? */
6133 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
6134 SV * const rsv = SvRV(kidsv);
6135 const svtype type = SvTYPE(rsv);
6136 const char *badtype = NULL;
6138 switch (o->op_type) {
6140 if (type > SVt_PVMG)
6141 badtype = "a SCALAR";
6144 if (type != SVt_PVAV)
6145 badtype = "an ARRAY";
6148 if (type != SVt_PVHV)
6152 if (type != SVt_PVCV)
6157 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
6160 else if ((o->op_type == OP_RV2HV || o->op_type == OP_RV2SV) &&
6161 (PL_hints & HINT_STRICT_REFS) && SvPOK(kidsv)) {
6162 /* If this is an access to a stash, disable "strict refs", because
6163 * stashes aren't auto-vivified at compile-time (unless we store
6164 * symbols in them), and we don't want to produce a run-time
6165 * stricture error when auto-vivifying the stash. */
6166 const char *s = SvPV_nolen(kidsv);
6167 const STRLEN l = SvCUR(kidsv);
6168 if (l > 1 && s[l-1] == ':' && s[l-2] == ':')
6169 o->op_private &= ~HINT_STRICT_REFS;
6171 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
6172 const char *badthing;
6173 switch (o->op_type) {
6175 badthing = "a SCALAR";
6178 badthing = "an ARRAY";
6181 badthing = "a HASH";
6189 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
6190 SVfARG(kidsv), badthing);
6193 * This is a little tricky. We only want to add the symbol if we
6194 * didn't add it in the lexer. Otherwise we get duplicate strict
6195 * warnings. But if we didn't add it in the lexer, we must at
6196 * least pretend like we wanted to add it even if it existed before,
6197 * or we get possible typo warnings. OPpCONST_ENTERED says
6198 * whether the lexer already added THIS instance of this symbol.
6200 iscv = (o->op_type == OP_RV2CV) * 2;
6202 gv = gv_fetchsv(kidsv,
6203 iscv | !(kid->op_private & OPpCONST_ENTERED),
6206 : o->op_type == OP_RV2SV
6208 : o->op_type == OP_RV2AV
6210 : o->op_type == OP_RV2HV
6213 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
6215 kid->op_type = OP_GV;
6216 SvREFCNT_dec(kid->op_sv);
6218 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
6219 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
6220 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
6222 PAD_SETSV(kPADOP->op_padix, (SV*) SvREFCNT_inc_simple_NN(gv));
6224 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
6226 kid->op_private = 0;
6227 kid->op_ppaddr = PL_ppaddr[OP_GV];
6234 Perl_ck_ftst(pTHX_ OP *o)
6237 const I32 type = o->op_type;
6239 if (o->op_flags & OPf_REF) {
6242 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
6243 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6244 const OPCODE kidtype = kid->op_type;
6246 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
6247 OP * const newop = newGVOP(type, OPf_REF,
6248 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
6250 op_getmad(o,newop,'O');
6256 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o))
6257 o->op_private |= OPpFT_ACCESS;
6258 if (PL_check[kidtype] == MEMBER_TO_FPTR(Perl_ck_ftst)
6259 && kidtype != OP_STAT && kidtype != OP_LSTAT)
6260 o->op_private |= OPpFT_STACKED;
6268 if (type == OP_FTTTY)
6269 o = newGVOP(type, OPf_REF, PL_stdingv);
6271 o = newUNOP(type, 0, newDEFSVOP());
6272 op_getmad(oldo,o,'O');
6278 Perl_ck_fun(pTHX_ OP *o)
6281 const int type = o->op_type;
6282 register I32 oa = PL_opargs[type] >> OASHIFT;
6284 if (o->op_flags & OPf_STACKED) {
6285 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
6288 return no_fh_allowed(o);
6291 if (o->op_flags & OPf_KIDS) {
6292 OP **tokid = &cLISTOPo->op_first;
6293 register OP *kid = cLISTOPo->op_first;
6297 if (kid->op_type == OP_PUSHMARK ||
6298 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
6300 tokid = &kid->op_sibling;
6301 kid = kid->op_sibling;
6303 if (!kid && PL_opargs[type] & OA_DEFGV)
6304 *tokid = kid = newDEFSVOP();
6308 sibl = kid->op_sibling;
6310 if (!sibl && kid->op_type == OP_STUB) {
6317 /* list seen where single (scalar) arg expected? */
6318 if (numargs == 1 && !(oa >> 4)
6319 && kid->op_type == OP_LIST && type != OP_SCALAR)
6321 return too_many_arguments(o,PL_op_desc[type]);
6334 if ((type == OP_PUSH || type == OP_UNSHIFT)
6335 && !kid->op_sibling && ckWARN(WARN_SYNTAX))
6336 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6337 "Useless use of %s with no values",
6340 if (kid->op_type == OP_CONST &&
6341 (kid->op_private & OPpCONST_BARE))
6343 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
6344 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
6345 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
6346 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6347 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
6348 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
6350 op_getmad(kid,newop,'K');
6355 kid->op_sibling = sibl;
6358 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
6359 bad_type(numargs, "array", PL_op_desc[type], kid);
6363 if (kid->op_type == OP_CONST &&
6364 (kid->op_private & OPpCONST_BARE))
6366 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
6367 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
6368 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
6369 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6370 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
6371 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
6373 op_getmad(kid,newop,'K');
6378 kid->op_sibling = sibl;
6381 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
6382 bad_type(numargs, "hash", PL_op_desc[type], kid);
6387 OP * const newop = newUNOP(OP_NULL, 0, kid);
6388 kid->op_sibling = 0;
6390 newop->op_next = newop;
6392 kid->op_sibling = sibl;
6397 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
6398 if (kid->op_type == OP_CONST &&
6399 (kid->op_private & OPpCONST_BARE))
6401 OP * const newop = newGVOP(OP_GV, 0,
6402 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
6403 if (!(o->op_private & 1) && /* if not unop */
6404 kid == cLISTOPo->op_last)
6405 cLISTOPo->op_last = newop;
6407 op_getmad(kid,newop,'K');
6413 else if (kid->op_type == OP_READLINE) {
6414 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
6415 bad_type(numargs, "HANDLE", OP_DESC(o), kid);
6418 I32 flags = OPf_SPECIAL;
6422 /* is this op a FH constructor? */
6423 if (is_handle_constructor(o,numargs)) {
6424 const char *name = NULL;
6428 /* Set a flag to tell rv2gv to vivify
6429 * need to "prove" flag does not mean something
6430 * else already - NI-S 1999/05/07
6433 if (kid->op_type == OP_PADSV) {
6435 = PAD_COMPNAME_SV(kid->op_targ);
6436 name = SvPV_const(namesv, len);
6438 else if (kid->op_type == OP_RV2SV
6439 && kUNOP->op_first->op_type == OP_GV)
6441 GV * const gv = cGVOPx_gv(kUNOP->op_first);
6443 len = GvNAMELEN(gv);
6445 else if (kid->op_type == OP_AELEM
6446 || kid->op_type == OP_HELEM)
6449 OP *op = ((BINOP*)kid)->op_first;
6453 const char * const a =
6454 kid->op_type == OP_AELEM ?
6456 if (((op->op_type == OP_RV2AV) ||
6457 (op->op_type == OP_RV2HV)) &&
6458 (firstop = ((UNOP*)op)->op_first) &&
6459 (firstop->op_type == OP_GV)) {
6460 /* packagevar $a[] or $h{} */
6461 GV * const gv = cGVOPx_gv(firstop);
6469 else if (op->op_type == OP_PADAV
6470 || op->op_type == OP_PADHV) {
6471 /* lexicalvar $a[] or $h{} */
6472 const char * const padname =
6473 PAD_COMPNAME_PV(op->op_targ);
6482 name = SvPV_const(tmpstr, len);
6487 name = "__ANONIO__";
6494 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
6495 namesv = PAD_SVl(targ);
6496 SvUPGRADE(namesv, SVt_PV);
6498 sv_setpvn(namesv, "$", 1);
6499 sv_catpvn(namesv, name, len);
6502 kid->op_sibling = 0;
6503 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
6504 kid->op_targ = targ;
6505 kid->op_private |= priv;
6507 kid->op_sibling = sibl;
6513 mod(scalar(kid), type);
6517 tokid = &kid->op_sibling;
6518 kid = kid->op_sibling;
6521 if (kid && kid->op_type != OP_STUB)
6522 return too_many_arguments(o,OP_DESC(o));
6523 o->op_private |= numargs;
6525 /* FIXME - should the numargs move as for the PERL_MAD case? */
6526 o->op_private |= numargs;
6528 return too_many_arguments(o,OP_DESC(o));
6532 else if (PL_opargs[type] & OA_DEFGV) {
6534 OP *newop = newUNOP(type, 0, newDEFSVOP());
6535 op_getmad(o,newop,'O');
6538 /* Ordering of these two is important to keep f_map.t passing. */
6540 return newUNOP(type, 0, newDEFSVOP());
6545 while (oa & OA_OPTIONAL)
6547 if (oa && oa != OA_LIST)
6548 return too_few_arguments(o,OP_DESC(o));
6554 Perl_ck_glob(pTHX_ OP *o)
6560 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
6561 append_elem(OP_GLOB, o, newDEFSVOP());
6563 if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
6564 && GvCVu(gv) && GvIMPORTED_CV(gv)))
6566 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
6569 #if !defined(PERL_EXTERNAL_GLOB)
6570 /* XXX this can be tightened up and made more failsafe. */
6571 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
6574 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
6575 newSVpvs("File::Glob"), NULL, NULL, NULL);
6576 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
6577 glob_gv = gv_fetchpvs("File::Glob::csh_glob", 0, SVt_PVCV);
6578 GvCV(gv) = GvCV(glob_gv);
6579 SvREFCNT_inc_void((SV*)GvCV(gv));
6580 GvIMPORTED_CV_on(gv);
6583 #endif /* PERL_EXTERNAL_GLOB */
6585 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
6586 append_elem(OP_GLOB, o,
6587 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
6588 o->op_type = OP_LIST;
6589 o->op_ppaddr = PL_ppaddr[OP_LIST];
6590 cLISTOPo->op_first->op_type = OP_PUSHMARK;
6591 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
6592 cLISTOPo->op_first->op_targ = 0;
6593 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
6594 append_elem(OP_LIST, o,
6595 scalar(newUNOP(OP_RV2CV, 0,
6596 newGVOP(OP_GV, 0, gv)))));
6597 o = newUNOP(OP_NULL, 0, ck_subr(o));
6598 o->op_targ = OP_GLOB; /* hint at what it used to be */
6601 gv = newGVgen("main");
6603 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
6609 Perl_ck_grep(pTHX_ OP *o)
6614 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
6617 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
6618 /* don't allocate gwop here, as we may leak it if PL_error_count > 0 */
6620 if (o->op_flags & OPf_STACKED) {
6623 kid = cLISTOPo->op_first->op_sibling;
6624 if (!cUNOPx(kid)->op_next)
6625 Perl_croak(aTHX_ "panic: ck_grep");
6626 for (k = cUNOPx(kid)->op_first; k; k = k->op_next) {
6629 NewOp(1101, gwop, 1, LOGOP);
6630 kid->op_next = (OP*)gwop;
6631 o->op_flags &= ~OPf_STACKED;
6633 kid = cLISTOPo->op_first->op_sibling;
6634 if (type == OP_MAPWHILE)
6641 kid = cLISTOPo->op_first->op_sibling;
6642 if (kid->op_type != OP_NULL)
6643 Perl_croak(aTHX_ "panic: ck_grep");
6644 kid = kUNOP->op_first;
6647 NewOp(1101, gwop, 1, LOGOP);
6648 gwop->op_type = type;
6649 gwop->op_ppaddr = PL_ppaddr[type];
6650 gwop->op_first = listkids(o);
6651 gwop->op_flags |= OPf_KIDS;
6652 gwop->op_other = LINKLIST(kid);
6653 kid->op_next = (OP*)gwop;
6654 offset = pad_findmy("$_");
6655 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
6656 o->op_private = gwop->op_private = 0;
6657 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
6660 o->op_private = gwop->op_private = OPpGREP_LEX;
6661 gwop->op_targ = o->op_targ = offset;
6664 kid = cLISTOPo->op_first->op_sibling;
6665 if (!kid || !kid->op_sibling)
6666 return too_few_arguments(o,OP_DESC(o));
6667 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
6668 mod(kid, OP_GREPSTART);
6674 Perl_ck_index(pTHX_ OP *o)
6676 if (o->op_flags & OPf_KIDS) {
6677 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6679 kid = kid->op_sibling; /* get past "big" */
6680 if (kid && kid->op_type == OP_CONST)
6681 fbm_compile(((SVOP*)kid)->op_sv, 0);
6687 Perl_ck_lengthconst(pTHX_ OP *o)
6689 /* XXX length optimization goes here */
6694 Perl_ck_lfun(pTHX_ OP *o)
6696 const OPCODE type = o->op_type;
6697 return modkids(ck_fun(o), type);
6701 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
6703 if ((o->op_flags & OPf_KIDS) && ckWARN2(WARN_DEPRECATED, WARN_SYNTAX)) {
6704 switch (cUNOPo->op_first->op_type) {
6706 /* This is needed for
6707 if (defined %stash::)
6708 to work. Do not break Tk.
6710 break; /* Globals via GV can be undef */
6712 case OP_AASSIGN: /* Is this a good idea? */
6713 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6714 "defined(@array) is deprecated");
6715 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6716 "\t(Maybe you should just omit the defined()?)\n");
6719 /* This is needed for
6720 if (defined %stash::)
6721 to work. Do not break Tk.
6723 break; /* Globals via GV can be undef */
6725 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6726 "defined(%%hash) is deprecated");
6727 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6728 "\t(Maybe you should just omit the defined()?)\n");
6739 Perl_ck_readline(pTHX_ OP *o)
6741 if (!(o->op_flags & OPf_KIDS)) {
6743 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
6745 op_getmad(o,newop,'O');
6755 Perl_ck_rfun(pTHX_ OP *o)
6757 const OPCODE type = o->op_type;
6758 return refkids(ck_fun(o), type);
6762 Perl_ck_listiob(pTHX_ OP *o)
6766 kid = cLISTOPo->op_first;
6769 kid = cLISTOPo->op_first;
6771 if (kid->op_type == OP_PUSHMARK)
6772 kid = kid->op_sibling;
6773 if (kid && o->op_flags & OPf_STACKED)
6774 kid = kid->op_sibling;
6775 else if (kid && !kid->op_sibling) { /* print HANDLE; */
6776 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
6777 o->op_flags |= OPf_STACKED; /* make it a filehandle */
6778 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
6779 cLISTOPo->op_first->op_sibling = kid;
6780 cLISTOPo->op_last = kid;
6781 kid = kid->op_sibling;
6786 append_elem(o->op_type, o, newDEFSVOP());
6792 Perl_ck_smartmatch(pTHX_ OP *o)
6795 if (0 == (o->op_flags & OPf_SPECIAL)) {
6796 OP *first = cBINOPo->op_first;
6797 OP *second = first->op_sibling;
6799 /* Implicitly take a reference to an array or hash */
6800 first->op_sibling = NULL;
6801 first = cBINOPo->op_first = ref_array_or_hash(first);
6802 second = first->op_sibling = ref_array_or_hash(second);
6804 /* Implicitly take a reference to a regular expression */
6805 if (first->op_type == OP_MATCH) {
6806 first->op_type = OP_QR;
6807 first->op_ppaddr = PL_ppaddr[OP_QR];
6809 if (second->op_type == OP_MATCH) {
6810 second->op_type = OP_QR;
6811 second->op_ppaddr = PL_ppaddr[OP_QR];
6820 Perl_ck_sassign(pTHX_ OP *o)
6822 OP * const kid = cLISTOPo->op_first;
6823 /* has a disposable target? */
6824 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
6825 && !(kid->op_flags & OPf_STACKED)
6826 /* Cannot steal the second time! */
6827 && !(kid->op_private & OPpTARGET_MY))
6829 OP * const kkid = kid->op_sibling;
6831 /* Can just relocate the target. */
6832 if (kkid && kkid->op_type == OP_PADSV
6833 && !(kkid->op_private & OPpLVAL_INTRO))
6835 kid->op_targ = kkid->op_targ;
6837 /* Now we do not need PADSV and SASSIGN. */
6838 kid->op_sibling = o->op_sibling; /* NULL */
6839 cLISTOPo->op_first = NULL;
6841 op_getmad(o,kid,'O');
6842 op_getmad(kkid,kid,'M');
6847 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
6851 if (kid->op_sibling) {
6852 OP *kkid = kid->op_sibling;
6853 if (kkid->op_type == OP_PADSV
6854 && (kkid->op_private & OPpLVAL_INTRO)
6855 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
6856 o->op_private |= OPpASSIGN_STATE;
6857 /* hijacking PADSTALE for uninitialized state variables */
6858 SvPADSTALE_on(PAD_SVl(kkid->op_targ));
6865 Perl_ck_match(pTHX_ OP *o)
6868 if (o->op_type != OP_QR && PL_compcv) {
6869 const PADOFFSET offset = pad_findmy("$_");
6870 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
6871 o->op_targ = offset;
6872 o->op_private |= OPpTARGET_MY;
6875 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
6876 o->op_private |= OPpRUNTIME;
6881 Perl_ck_method(pTHX_ OP *o)
6883 OP * const kid = cUNOPo->op_first;
6884 if (kid->op_type == OP_CONST) {
6885 SV* sv = kSVOP->op_sv;
6886 const char * const method = SvPVX_const(sv);
6887 if (!(strchr(method, ':') || strchr(method, '\''))) {
6889 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
6890 sv = newSVpvn_share(method, SvCUR(sv), 0);
6893 kSVOP->op_sv = NULL;
6895 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
6897 op_getmad(o,cmop,'O');
6908 Perl_ck_null(pTHX_ OP *o)
6910 PERL_UNUSED_CONTEXT;
6915 Perl_ck_open(pTHX_ OP *o)
6918 HV * const table = GvHV(PL_hintgv);
6920 SV **svp = hv_fetchs(table, "open_IN", FALSE);
6922 const I32 mode = mode_from_discipline(*svp);
6923 if (mode & O_BINARY)
6924 o->op_private |= OPpOPEN_IN_RAW;
6925 else if (mode & O_TEXT)
6926 o->op_private |= OPpOPEN_IN_CRLF;
6929 svp = hv_fetchs(table, "open_OUT", FALSE);
6931 const I32 mode = mode_from_discipline(*svp);
6932 if (mode & O_BINARY)
6933 o->op_private |= OPpOPEN_OUT_RAW;
6934 else if (mode & O_TEXT)
6935 o->op_private |= OPpOPEN_OUT_CRLF;
6938 if (o->op_type == OP_BACKTICK) {
6939 if (!(o->op_flags & OPf_KIDS)) {
6940 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
6942 op_getmad(o,newop,'O');
6951 /* In case of three-arg dup open remove strictness
6952 * from the last arg if it is a bareword. */
6953 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
6954 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
6958 if ((last->op_type == OP_CONST) && /* The bareword. */
6959 (last->op_private & OPpCONST_BARE) &&
6960 (last->op_private & OPpCONST_STRICT) &&
6961 (oa = first->op_sibling) && /* The fh. */
6962 (oa = oa->op_sibling) && /* The mode. */
6963 (oa->op_type == OP_CONST) &&
6964 SvPOK(((SVOP*)oa)->op_sv) &&
6965 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
6966 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
6967 (last == oa->op_sibling)) /* The bareword. */
6968 last->op_private &= ~OPpCONST_STRICT;
6974 Perl_ck_repeat(pTHX_ OP *o)
6976 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
6977 o->op_private |= OPpREPEAT_DOLIST;
6978 cBINOPo->op_first = force_list(cBINOPo->op_first);
6986 Perl_ck_require(pTHX_ OP *o)
6991 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
6992 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6994 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
6995 SV * const sv = kid->op_sv;
6996 U32 was_readonly = SvREADONLY(sv);
7001 sv_force_normal_flags(sv, 0);
7002 assert(!SvREADONLY(sv));
7009 for (s = SvPVX(sv); *s; s++) {
7010 if (*s == ':' && s[1] == ':') {
7011 const STRLEN len = strlen(s+2)+1;
7013 Move(s+2, s+1, len, char);
7014 SvCUR_set(sv, SvCUR(sv) - 1);
7017 sv_catpvs(sv, ".pm");
7018 SvFLAGS(sv) |= was_readonly;
7022 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
7023 /* handle override, if any */
7024 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
7025 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
7026 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
7027 gv = gvp ? *gvp : NULL;
7031 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
7032 OP * const kid = cUNOPo->op_first;
7035 cUNOPo->op_first = 0;
7039 newop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
7040 append_elem(OP_LIST, kid,
7041 scalar(newUNOP(OP_RV2CV, 0,
7044 op_getmad(o,newop,'O');
7052 Perl_ck_return(pTHX_ OP *o)
7055 if (CvLVALUE(PL_compcv)) {
7057 for (kid = cLISTOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
7058 mod(kid, OP_LEAVESUBLV);
7064 Perl_ck_select(pTHX_ OP *o)
7068 if (o->op_flags & OPf_KIDS) {
7069 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7070 if (kid && kid->op_sibling) {
7071 o->op_type = OP_SSELECT;
7072 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
7074 return fold_constants(o);
7078 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7079 if (kid && kid->op_type == OP_RV2GV)
7080 kid->op_private &= ~HINT_STRICT_REFS;
7085 Perl_ck_shift(pTHX_ OP *o)
7088 const I32 type = o->op_type;
7090 if (!(o->op_flags & OPf_KIDS)) {
7092 /* FIXME - this can be refactored to reduce code in #ifdefs */
7094 OP * const oldo = o;
7098 argop = newUNOP(OP_RV2AV, 0,
7099 scalar(newGVOP(OP_GV, 0, CvUNIQUE(PL_compcv) ? PL_argvgv : PL_defgv)));
7101 o = newUNOP(type, 0, scalar(argop));
7102 op_getmad(oldo,o,'O');
7105 return newUNOP(type, 0, scalar(argop));
7108 return scalar(modkids(ck_fun(o), type));
7112 Perl_ck_sort(pTHX_ OP *o)
7117 if (o->op_type == OP_SORT && (PL_hints & HINT_LOCALIZE_HH) != 0) {
7118 HV * const hinthv = GvHV(PL_hintgv);
7120 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
7122 const I32 sorthints = (I32)SvIV(*svp);
7123 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
7124 o->op_private |= OPpSORT_QSORT;
7125 if ((sorthints & HINT_SORT_STABLE) != 0)
7126 o->op_private |= OPpSORT_STABLE;
7131 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
7133 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7134 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
7136 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
7138 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
7140 if (kid->op_type == OP_SCOPE) {
7144 else if (kid->op_type == OP_LEAVE) {
7145 if (o->op_type == OP_SORT) {
7146 op_null(kid); /* wipe out leave */
7149 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
7150 if (k->op_next == kid)
7152 /* don't descend into loops */
7153 else if (k->op_type == OP_ENTERLOOP
7154 || k->op_type == OP_ENTERITER)
7156 k = cLOOPx(k)->op_lastop;
7161 kid->op_next = 0; /* just disconnect the leave */
7162 k = kLISTOP->op_first;
7167 if (o->op_type == OP_SORT) {
7168 /* provide scalar context for comparison function/block */
7174 o->op_flags |= OPf_SPECIAL;
7176 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
7179 firstkid = firstkid->op_sibling;
7182 /* provide list context for arguments */
7183 if (o->op_type == OP_SORT)
7190 S_simplify_sort(pTHX_ OP *o)
7193 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7198 if (!(o->op_flags & OPf_STACKED))
7200 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
7201 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
7202 kid = kUNOP->op_first; /* get past null */
7203 if (kid->op_type != OP_SCOPE)
7205 kid = kLISTOP->op_last; /* get past scope */
7206 switch(kid->op_type) {
7214 k = kid; /* remember this node*/
7215 if (kBINOP->op_first->op_type != OP_RV2SV)
7217 kid = kBINOP->op_first; /* get past cmp */
7218 if (kUNOP->op_first->op_type != OP_GV)
7220 kid = kUNOP->op_first; /* get past rv2sv */
7222 if (GvSTASH(gv) != PL_curstash)
7224 gvname = GvNAME(gv);
7225 if (*gvname == 'a' && gvname[1] == '\0')
7227 else if (*gvname == 'b' && gvname[1] == '\0')
7232 kid = k; /* back to cmp */
7233 if (kBINOP->op_last->op_type != OP_RV2SV)
7235 kid = kBINOP->op_last; /* down to 2nd arg */
7236 if (kUNOP->op_first->op_type != OP_GV)
7238 kid = kUNOP->op_first; /* get past rv2sv */
7240 if (GvSTASH(gv) != PL_curstash)
7242 gvname = GvNAME(gv);
7244 ? !(*gvname == 'a' && gvname[1] == '\0')
7245 : !(*gvname == 'b' && gvname[1] == '\0'))
7247 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
7249 o->op_private |= OPpSORT_DESCEND;
7250 if (k->op_type == OP_NCMP)
7251 o->op_private |= OPpSORT_NUMERIC;
7252 if (k->op_type == OP_I_NCMP)
7253 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
7254 kid = cLISTOPo->op_first->op_sibling;
7255 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
7257 op_getmad(kid,o,'S'); /* then delete it */
7259 op_free(kid); /* then delete it */
7264 Perl_ck_split(pTHX_ OP *o)
7269 if (o->op_flags & OPf_STACKED)
7270 return no_fh_allowed(o);
7272 kid = cLISTOPo->op_first;
7273 if (kid->op_type != OP_NULL)
7274 Perl_croak(aTHX_ "panic: ck_split");
7275 kid = kid->op_sibling;
7276 op_free(cLISTOPo->op_first);
7277 cLISTOPo->op_first = kid;
7279 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
7280 cLISTOPo->op_last = kid; /* There was only one element previously */
7283 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
7284 OP * const sibl = kid->op_sibling;
7285 kid->op_sibling = 0;
7286 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0);
7287 if (cLISTOPo->op_first == cLISTOPo->op_last)
7288 cLISTOPo->op_last = kid;
7289 cLISTOPo->op_first = kid;
7290 kid->op_sibling = sibl;
7293 kid->op_type = OP_PUSHRE;
7294 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
7296 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL && ckWARN(WARN_REGEXP)) {
7297 Perl_warner(aTHX_ packWARN(WARN_REGEXP),
7298 "Use of /g modifier is meaningless in split");
7301 if (!kid->op_sibling)
7302 append_elem(OP_SPLIT, o, newDEFSVOP());
7304 kid = kid->op_sibling;
7307 if (!kid->op_sibling)
7308 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
7309 assert(kid->op_sibling);
7311 kid = kid->op_sibling;
7314 if (kid->op_sibling)
7315 return too_many_arguments(o,OP_DESC(o));
7321 Perl_ck_join(pTHX_ OP *o)
7323 const OP * const kid = cLISTOPo->op_first->op_sibling;
7324 if (kid && kid->op_type == OP_MATCH) {
7325 if (ckWARN(WARN_SYNTAX)) {
7326 const REGEXP *re = PM_GETRE(kPMOP);
7327 const char *pmstr = re ? re->precomp : "STRING";
7328 const STRLEN len = re ? re->prelen : 6;
7329 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7330 "/%.*s/ should probably be written as \"%.*s\"",
7331 (int)len, pmstr, (int)len, pmstr);
7338 Perl_ck_subr(pTHX_ OP *o)
7341 OP *prev = ((cUNOPo->op_first->op_sibling)
7342 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
7343 OP *o2 = prev->op_sibling;
7345 const char *proto = NULL;
7346 const char *proto_end = NULL;
7351 I32 contextclass = 0;
7352 const char *e = NULL;
7355 o->op_private |= OPpENTERSUB_HASTARG;
7356 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
7357 if (cvop->op_type == OP_RV2CV) {
7359 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
7360 op_null(cvop); /* disable rv2cv */
7361 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
7362 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
7363 GV *gv = cGVOPx_gv(tmpop);
7366 tmpop->op_private |= OPpEARLY_CV;
7370 namegv = CvANON(cv) ? gv : CvGV(cv);
7371 proto = SvPV((SV*)cv, len);
7372 proto_end = proto + len;
7374 if (CvASSERTION(cv)) {
7375 U32 asserthints = 0;
7376 HV *const hinthv = GvHV(PL_hintgv);
7378 SV **svp = hv_fetchs(hinthv, "assertions", FALSE);
7380 asserthints = SvUV(*svp);
7382 if (asserthints & HINT_ASSERTING) {
7383 if (PERLDB_ASSERTION && PL_curstash != PL_debstash)
7384 o->op_private |= OPpENTERSUB_DB;
7388 if (!(asserthints & HINT_ASSERTIONSSEEN) && ckWARN(WARN_ASSERTIONS)) {
7389 Perl_warner(aTHX_ packWARN(WARN_ASSERTIONS),
7390 "Impossible to activate assertion call");
7397 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
7398 if (o2->op_type == OP_CONST)
7399 o2->op_private &= ~OPpCONST_STRICT;
7400 else if (o2->op_type == OP_LIST) {
7401 OP * const sib = ((UNOP*)o2)->op_first->op_sibling;
7402 if (sib && sib->op_type == OP_CONST)
7403 sib->op_private &= ~OPpCONST_STRICT;
7406 o->op_private |= (PL_hints & HINT_STRICT_REFS);
7407 if (PERLDB_SUB && PL_curstash != PL_debstash)
7408 o->op_private |= OPpENTERSUB_DB;
7409 while (o2 != cvop) {
7411 if (PL_madskills && o2->op_type == OP_NULL)
7412 o3 = ((UNOP*)o2)->op_first;
7416 if (proto >= proto_end)
7417 return too_many_arguments(o, gv_ename(namegv));
7425 /* _ must be at the end */
7426 if (proto[1] && proto[1] != ';')
7441 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
7443 arg == 1 ? "block or sub {}" : "sub {}",
7444 gv_ename(namegv), o3);
7447 /* '*' allows any scalar type, including bareword */
7450 if (o3->op_type == OP_RV2GV)
7451 goto wrapref; /* autoconvert GLOB -> GLOBref */
7452 else if (o3->op_type == OP_CONST)
7453 o3->op_private &= ~OPpCONST_STRICT;
7454 else if (o3->op_type == OP_ENTERSUB) {
7455 /* accidental subroutine, revert to bareword */
7456 OP *gvop = ((UNOP*)o3)->op_first;
7457 if (gvop && gvop->op_type == OP_NULL) {
7458 gvop = ((UNOP*)gvop)->op_first;
7460 for (; gvop->op_sibling; gvop = gvop->op_sibling)
7463 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
7464 (gvop = ((UNOP*)gvop)->op_first) &&
7465 gvop->op_type == OP_GV)
7467 GV * const gv = cGVOPx_gv(gvop);
7468 OP * const sibling = o2->op_sibling;
7469 SV * const n = newSVpvs("");
7471 OP * const oldo2 = o2;
7475 gv_fullname4(n, gv, "", FALSE);
7476 o2 = newSVOP(OP_CONST, 0, n);
7477 op_getmad(oldo2,o2,'O');
7478 prev->op_sibling = o2;
7479 o2->op_sibling = sibling;
7495 if (contextclass++ == 0) {
7496 e = strchr(proto, ']');
7497 if (!e || e == proto)
7506 const char *p = proto;
7507 const char *const end = proto;
7509 while (*--p != '[');
7510 bad_type(arg, Perl_form(aTHX_ "one of %.*s",
7512 gv_ename(namegv), o3);
7517 if (o3->op_type == OP_RV2GV)
7520 bad_type(arg, "symbol", gv_ename(namegv), o3);
7523 if (o3->op_type == OP_ENTERSUB)
7526 bad_type(arg, "subroutine entry", gv_ename(namegv),
7530 if (o3->op_type == OP_RV2SV ||
7531 o3->op_type == OP_PADSV ||
7532 o3->op_type == OP_HELEM ||
7533 o3->op_type == OP_AELEM)
7536 bad_type(arg, "scalar", gv_ename(namegv), o3);
7539 if (o3->op_type == OP_RV2AV ||
7540 o3->op_type == OP_PADAV)
7543 bad_type(arg, "array", gv_ename(namegv), o3);
7546 if (o3->op_type == OP_RV2HV ||
7547 o3->op_type == OP_PADHV)
7550 bad_type(arg, "hash", gv_ename(namegv), o3);
7555 OP* const sib = kid->op_sibling;
7556 kid->op_sibling = 0;
7557 o2 = newUNOP(OP_REFGEN, 0, kid);
7558 o2->op_sibling = sib;
7559 prev->op_sibling = o2;
7561 if (contextclass && e) {
7576 Perl_croak(aTHX_ "Malformed prototype for %s: %"SVf,
7577 gv_ename(namegv), SVfARG(cv));
7582 mod(o2, OP_ENTERSUB);
7584 o2 = o2->op_sibling;
7586 if (o2 == cvop && proto && *proto == '_') {
7587 /* generate an access to $_ */
7589 o2->op_sibling = prev->op_sibling;
7590 prev->op_sibling = o2; /* instead of cvop */
7592 if (proto && !optional && proto_end > proto &&
7593 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
7594 return too_few_arguments(o, gv_ename(namegv));
7597 OP * const oldo = o;
7601 o=newSVOP(OP_CONST, 0, newSViv(0));
7602 op_getmad(oldo,o,'O');
7608 Perl_ck_svconst(pTHX_ OP *o)
7610 PERL_UNUSED_CONTEXT;
7611 SvREADONLY_on(cSVOPo->op_sv);
7616 Perl_ck_chdir(pTHX_ OP *o)
7618 if (o->op_flags & OPf_KIDS) {
7619 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7621 if (kid && kid->op_type == OP_CONST &&
7622 (kid->op_private & OPpCONST_BARE))
7624 o->op_flags |= OPf_SPECIAL;
7625 kid->op_private &= ~OPpCONST_STRICT;
7632 Perl_ck_trunc(pTHX_ OP *o)
7634 if (o->op_flags & OPf_KIDS) {
7635 SVOP *kid = (SVOP*)cUNOPo->op_first;
7637 if (kid->op_type == OP_NULL)
7638 kid = (SVOP*)kid->op_sibling;
7639 if (kid && kid->op_type == OP_CONST &&
7640 (kid->op_private & OPpCONST_BARE))
7642 o->op_flags |= OPf_SPECIAL;
7643 kid->op_private &= ~OPpCONST_STRICT;
7650 Perl_ck_unpack(pTHX_ OP *o)
7652 OP *kid = cLISTOPo->op_first;
7653 if (kid->op_sibling) {
7654 kid = kid->op_sibling;
7655 if (!kid->op_sibling)
7656 kid->op_sibling = newDEFSVOP();
7662 Perl_ck_substr(pTHX_ OP *o)
7665 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
7666 OP *kid = cLISTOPo->op_first;
7668 if (kid->op_type == OP_NULL)
7669 kid = kid->op_sibling;
7671 kid->op_flags |= OPf_MOD;
7677 /* A peephole optimizer. We visit the ops in the order they're to execute.
7678 * See the comments at the top of this file for more details about when
7679 * peep() is called */
7682 Perl_peep(pTHX_ register OP *o)
7685 register OP* oldop = NULL;
7687 if (!o || o->op_opt)
7691 SAVEVPTR(PL_curcop);
7692 for (; o; o = o->op_next) {
7696 switch (o->op_type) {
7700 PL_curcop = ((COP*)o); /* for warnings */
7705 if (cSVOPo->op_private & OPpCONST_STRICT)
7706 no_bareword_allowed(o);
7708 case OP_METHOD_NAMED:
7709 /* Relocate sv to the pad for thread safety.
7710 * Despite being a "constant", the SV is written to,
7711 * for reference counts, sv_upgrade() etc. */
7713 const PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
7714 if (o->op_type == OP_CONST && SvPADTMP(cSVOPo->op_sv)) {
7715 /* If op_sv is already a PADTMP then it is being used by
7716 * some pad, so make a copy. */
7717 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
7718 SvREADONLY_on(PAD_SVl(ix));
7719 SvREFCNT_dec(cSVOPo->op_sv);
7721 else if (o->op_type == OP_CONST
7722 && cSVOPo->op_sv == &PL_sv_undef) {
7723 /* PL_sv_undef is hack - it's unsafe to store it in the
7724 AV that is the pad, because av_fetch treats values of
7725 PL_sv_undef as a "free" AV entry and will merrily
7726 replace them with a new SV, causing pad_alloc to think
7727 that this pad slot is free. (When, clearly, it is not)
7729 SvOK_off(PAD_SVl(ix));
7730 SvPADTMP_on(PAD_SVl(ix));
7731 SvREADONLY_on(PAD_SVl(ix));
7734 SvREFCNT_dec(PAD_SVl(ix));
7735 SvPADTMP_on(cSVOPo->op_sv);
7736 PAD_SETSV(ix, cSVOPo->op_sv);
7737 /* XXX I don't know how this isn't readonly already. */
7738 SvREADONLY_on(PAD_SVl(ix));
7740 cSVOPo->op_sv = NULL;
7748 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
7749 if (o->op_next->op_private & OPpTARGET_MY) {
7750 if (o->op_flags & OPf_STACKED) /* chained concats */
7751 goto ignore_optimization;
7753 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
7754 o->op_targ = o->op_next->op_targ;
7755 o->op_next->op_targ = 0;
7756 o->op_private |= OPpTARGET_MY;
7759 op_null(o->op_next);
7761 ignore_optimization:
7765 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
7767 break; /* Scalar stub must produce undef. List stub is noop */
7771 if (o->op_targ == OP_NEXTSTATE
7772 || o->op_targ == OP_DBSTATE
7773 || o->op_targ == OP_SETSTATE)
7775 PL_curcop = ((COP*)o);
7777 /* XXX: We avoid setting op_seq here to prevent later calls
7778 to peep() from mistakenly concluding that optimisation
7779 has already occurred. This doesn't fix the real problem,
7780 though (See 20010220.007). AMS 20010719 */
7781 /* op_seq functionality is now replaced by op_opt */
7782 if (oldop && o->op_next) {
7783 oldop->op_next = o->op_next;
7791 if (oldop && o->op_next) {
7792 oldop->op_next = o->op_next;
7800 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
7801 OP* const pop = (o->op_type == OP_PADAV) ?
7802 o->op_next : o->op_next->op_next;
7804 if (pop && pop->op_type == OP_CONST &&
7805 ((PL_op = pop->op_next)) &&
7806 pop->op_next->op_type == OP_AELEM &&
7807 !(pop->op_next->op_private &
7808 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
7809 (i = SvIV(((SVOP*)pop)->op_sv) - CopARYBASE_get(PL_curcop))
7814 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
7815 no_bareword_allowed(pop);
7816 if (o->op_type == OP_GV)
7817 op_null(o->op_next);
7818 op_null(pop->op_next);
7820 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
7821 o->op_next = pop->op_next->op_next;
7822 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
7823 o->op_private = (U8)i;
7824 if (o->op_type == OP_GV) {
7829 o->op_flags |= OPf_SPECIAL;
7830 o->op_type = OP_AELEMFAST;
7836 if (o->op_next->op_type == OP_RV2SV) {
7837 if (!(o->op_next->op_private & OPpDEREF)) {
7838 op_null(o->op_next);
7839 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
7841 o->op_next = o->op_next->op_next;
7842 o->op_type = OP_GVSV;
7843 o->op_ppaddr = PL_ppaddr[OP_GVSV];
7846 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
7847 GV * const gv = cGVOPo_gv;
7848 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
7849 /* XXX could check prototype here instead of just carping */
7850 SV * const sv = sv_newmortal();
7851 gv_efullname3(sv, gv, NULL);
7852 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
7853 "%"SVf"() called too early to check prototype",
7857 else if (o->op_next->op_type == OP_READLINE
7858 && o->op_next->op_next->op_type == OP_CONCAT
7859 && (o->op_next->op_next->op_flags & OPf_STACKED))
7861 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
7862 o->op_type = OP_RCATLINE;
7863 o->op_flags |= OPf_STACKED;
7864 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
7865 op_null(o->op_next->op_next);
7866 op_null(o->op_next);
7883 while (cLOGOP->op_other->op_type == OP_NULL)
7884 cLOGOP->op_other = cLOGOP->op_other->op_next;
7885 peep(cLOGOP->op_other); /* Recursive calls are not replaced by fptr calls */
7891 while (cLOOP->op_redoop->op_type == OP_NULL)
7892 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
7893 peep(cLOOP->op_redoop);
7894 while (cLOOP->op_nextop->op_type == OP_NULL)
7895 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
7896 peep(cLOOP->op_nextop);
7897 while (cLOOP->op_lastop->op_type == OP_NULL)
7898 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
7899 peep(cLOOP->op_lastop);
7906 while (cPMOP->op_pmreplstart &&
7907 cPMOP->op_pmreplstart->op_type == OP_NULL)
7908 cPMOP->op_pmreplstart = cPMOP->op_pmreplstart->op_next;
7909 peep(cPMOP->op_pmreplstart);
7914 if (o->op_next && o->op_next->op_type == OP_NEXTSTATE
7915 && ckWARN(WARN_SYNTAX))
7917 if (o->op_next->op_sibling) {
7918 const OPCODE type = o->op_next->op_sibling->op_type;
7919 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
7920 const line_t oldline = CopLINE(PL_curcop);
7921 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
7922 Perl_warner(aTHX_ packWARN(WARN_EXEC),
7923 "Statement unlikely to be reached");
7924 Perl_warner(aTHX_ packWARN(WARN_EXEC),
7925 "\t(Maybe you meant system() when you said exec()?)\n");
7926 CopLINE_set(PL_curcop, oldline);
7937 const char *key = NULL;
7942 if (((BINOP*)o)->op_last->op_type != OP_CONST)
7945 /* Make the CONST have a shared SV */
7946 svp = cSVOPx_svp(((BINOP*)o)->op_last);
7947 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv)) && !IS_PADCONST(sv)) {
7948 key = SvPV_const(sv, keylen);
7949 lexname = newSVpvn_share(key,
7950 SvUTF8(sv) ? -(I32)keylen : (I32)keylen,
7956 if ((o->op_private & (OPpLVAL_INTRO)))
7959 rop = (UNOP*)((BINOP*)o)->op_first;
7960 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
7962 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
7963 if (!SvPAD_TYPED(lexname))
7965 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
7966 if (!fields || !GvHV(*fields))
7968 key = SvPV_const(*svp, keylen);
7969 if (!hv_fetch(GvHV(*fields), key,
7970 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE))
7972 Perl_croak(aTHX_ "No such class field \"%s\" "
7973 "in variable %s of type %s",
7974 key, SvPV_nolen_const(lexname), HvNAME_get(SvSTASH(lexname)));
7987 SVOP *first_key_op, *key_op;
7989 if ((o->op_private & (OPpLVAL_INTRO))
7990 /* I bet there's always a pushmark... */
7991 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
7992 /* hmmm, no optimization if list contains only one key. */
7994 rop = (UNOP*)((LISTOP*)o)->op_last;
7995 if (rop->op_type != OP_RV2HV)
7997 if (rop->op_first->op_type == OP_PADSV)
7998 /* @$hash{qw(keys here)} */
7999 rop = (UNOP*)rop->op_first;
8001 /* @{$hash}{qw(keys here)} */
8002 if (rop->op_first->op_type == OP_SCOPE
8003 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
8005 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
8011 lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE);
8012 if (!SvPAD_TYPED(lexname))
8014 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
8015 if (!fields || !GvHV(*fields))
8017 /* Again guessing that the pushmark can be jumped over.... */
8018 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
8019 ->op_first->op_sibling;
8020 for (key_op = first_key_op; key_op;
8021 key_op = (SVOP*)key_op->op_sibling) {
8022 if (key_op->op_type != OP_CONST)
8024 svp = cSVOPx_svp(key_op);
8025 key = SvPV_const(*svp, keylen);
8026 if (!hv_fetch(GvHV(*fields), key,
8027 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE))
8029 Perl_croak(aTHX_ "No such class field \"%s\" "
8030 "in variable %s of type %s",
8031 key, SvPV_nolen(lexname), HvNAME_get(SvSTASH(lexname)));
8038 /* will point to RV2AV or PADAV op on LHS/RHS of assign */
8042 /* check that RHS of sort is a single plain array */
8043 OP *oright = cUNOPo->op_first;
8044 if (!oright || oright->op_type != OP_PUSHMARK)
8047 /* reverse sort ... can be optimised. */
8048 if (!cUNOPo->op_sibling) {
8049 /* Nothing follows us on the list. */
8050 OP * const reverse = o->op_next;
8052 if (reverse->op_type == OP_REVERSE &&
8053 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
8054 OP * const pushmark = cUNOPx(reverse)->op_first;
8055 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
8056 && (cUNOPx(pushmark)->op_sibling == o)) {
8057 /* reverse -> pushmark -> sort */
8058 o->op_private |= OPpSORT_REVERSE;
8060 pushmark->op_next = oright->op_next;
8066 /* make @a = sort @a act in-place */
8070 oright = cUNOPx(oright)->op_sibling;
8073 if (oright->op_type == OP_NULL) { /* skip sort block/sub */
8074 oright = cUNOPx(oright)->op_sibling;
8078 (oright->op_type != OP_RV2AV && oright->op_type != OP_PADAV)
8079 || oright->op_next != o
8080 || (oright->op_private & OPpLVAL_INTRO)
8084 /* o2 follows the chain of op_nexts through the LHS of the
8085 * assign (if any) to the aassign op itself */
8087 if (!o2 || o2->op_type != OP_NULL)
8090 if (!o2 || o2->op_type != OP_PUSHMARK)
8093 if (o2 && o2->op_type == OP_GV)
8096 || (o2->op_type != OP_PADAV && o2->op_type != OP_RV2AV)
8097 || (o2->op_private & OPpLVAL_INTRO)
8102 if (!o2 || o2->op_type != OP_NULL)
8105 if (!o2 || o2->op_type != OP_AASSIGN
8106 || (o2->op_flags & OPf_WANT) != OPf_WANT_VOID)
8109 /* check that the sort is the first arg on RHS of assign */
8111 o2 = cUNOPx(o2)->op_first;
8112 if (!o2 || o2->op_type != OP_NULL)
8114 o2 = cUNOPx(o2)->op_first;
8115 if (!o2 || o2->op_type != OP_PUSHMARK)
8117 if (o2->op_sibling != o)
8120 /* check the array is the same on both sides */
8121 if (oleft->op_type == OP_RV2AV) {
8122 if (oright->op_type != OP_RV2AV
8123 || !cUNOPx(oright)->op_first
8124 || cUNOPx(oright)->op_first->op_type != OP_GV
8125 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
8126 cGVOPx_gv(cUNOPx(oright)->op_first)
8130 else if (oright->op_type != OP_PADAV
8131 || oright->op_targ != oleft->op_targ
8135 /* transfer MODishness etc from LHS arg to RHS arg */
8136 oright->op_flags = oleft->op_flags;
8137 o->op_private |= OPpSORT_INPLACE;
8139 /* excise push->gv->rv2av->null->aassign */
8140 o2 = o->op_next->op_next;
8141 op_null(o2); /* PUSHMARK */
8143 if (o2->op_type == OP_GV) {
8144 op_null(o2); /* GV */
8147 op_null(o2); /* RV2AV or PADAV */
8148 o2 = o2->op_next->op_next;
8149 op_null(o2); /* AASSIGN */
8151 o->op_next = o2->op_next;
8157 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
8159 LISTOP *enter, *exlist;
8162 enter = (LISTOP *) o->op_next;
8165 if (enter->op_type == OP_NULL) {
8166 enter = (LISTOP *) enter->op_next;
8170 /* for $a (...) will have OP_GV then OP_RV2GV here.
8171 for (...) just has an OP_GV. */
8172 if (enter->op_type == OP_GV) {
8173 gvop = (OP *) enter;
8174 enter = (LISTOP *) enter->op_next;
8177 if (enter->op_type == OP_RV2GV) {
8178 enter = (LISTOP *) enter->op_next;
8184 if (enter->op_type != OP_ENTERITER)
8187 iter = enter->op_next;
8188 if (!iter || iter->op_type != OP_ITER)
8191 expushmark = enter->op_first;
8192 if (!expushmark || expushmark->op_type != OP_NULL
8193 || expushmark->op_targ != OP_PUSHMARK)
8196 exlist = (LISTOP *) expushmark->op_sibling;
8197 if (!exlist || exlist->op_type != OP_NULL
8198 || exlist->op_targ != OP_LIST)
8201 if (exlist->op_last != o) {
8202 /* Mmm. Was expecting to point back to this op. */
8205 theirmark = exlist->op_first;
8206 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
8209 if (theirmark->op_sibling != o) {
8210 /* There's something between the mark and the reverse, eg
8211 for (1, reverse (...))
8216 ourmark = ((LISTOP *)o)->op_first;
8217 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
8220 ourlast = ((LISTOP *)o)->op_last;
8221 if (!ourlast || ourlast->op_next != o)
8224 rv2av = ourmark->op_sibling;
8225 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
8226 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
8227 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
8228 /* We're just reversing a single array. */
8229 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
8230 enter->op_flags |= OPf_STACKED;
8233 /* We don't have control over who points to theirmark, so sacrifice
8235 theirmark->op_next = ourmark->op_next;
8236 theirmark->op_flags = ourmark->op_flags;
8237 ourlast->op_next = gvop ? gvop : (OP *) enter;
8240 enter->op_private |= OPpITER_REVERSED;
8241 iter->op_private |= OPpITER_REVERSED;
8248 UNOP *refgen, *rv2cv;
8251 /* I do not understand this, but if o->op_opt isn't set to 1,
8252 various tests in ext/B/t/bytecode.t fail with no readily
8258 if ((o->op_flags && OPf_WANT) != OPf_WANT_VOID)
8261 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
8264 rv2gv = ((BINOP *)o)->op_last;
8265 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
8268 refgen = (UNOP *)((BINOP *)o)->op_first;
8270 if (!refgen || refgen->op_type != OP_REFGEN)
8273 exlist = (LISTOP *)refgen->op_first;
8274 if (!exlist || exlist->op_type != OP_NULL
8275 || exlist->op_targ != OP_LIST)
8278 if (exlist->op_first->op_type != OP_PUSHMARK)
8281 rv2cv = (UNOP*)exlist->op_last;
8283 if (rv2cv->op_type != OP_RV2CV)
8286 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
8287 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
8288 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
8290 o->op_private |= OPpASSIGN_CV_TO_GV;
8291 rv2gv->op_private |= OPpDONT_INIT_GV;
8292 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
8308 Perl_custom_op_name(pTHX_ const OP* o)
8311 const IV index = PTR2IV(o->op_ppaddr);
8315 if (!PL_custom_op_names) /* This probably shouldn't happen */
8316 return (char *)PL_op_name[OP_CUSTOM];
8318 keysv = sv_2mortal(newSViv(index));
8320 he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0);
8322 return (char *)PL_op_name[OP_CUSTOM]; /* Don't know who you are */
8324 return SvPV_nolen(HeVAL(he));
8328 Perl_custom_op_desc(pTHX_ const OP* o)
8331 const IV index = PTR2IV(o->op_ppaddr);
8335 if (!PL_custom_op_descs)
8336 return (char *)PL_op_desc[OP_CUSTOM];
8338 keysv = sv_2mortal(newSViv(index));
8340 he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0);
8342 return (char *)PL_op_desc[OP_CUSTOM];
8344 return SvPV_nolen(HeVAL(he));
8349 /* Efficient sub that returns a constant scalar value. */
8351 const_sv_xsub(pTHX_ CV* cv)
8358 Perl_croak(aTHX_ "usage: %s::%s()",
8359 HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
8363 ST(0) = (SV*)XSANY.any_ptr;
8369 * c-indentation-style: bsd
8371 * indent-tabs-mode: t
8374 * ex: set ts=8 sts=4 sw=4 noet: