4 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
5 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others
7 * You may distribute under the terms of either the GNU General Public
8 * License or the Artistic License, as specified in the README file.
13 * 'You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
14 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
15 * youngest of the Old Took's daughters); and Mr. Drogo was his second
16 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
17 * either way, as the saying is, if you follow me.' --the Gaffer
19 * [p.23 of _The Lord of the Rings_, I/i: "A Long-Expected Party"]
22 /* This file contains the functions that create, manipulate and optimize
23 * the OP structures that hold a compiled perl program.
25 * A Perl program is compiled into a tree of OPs. Each op contains
26 * structural pointers (eg to its siblings and the next op in the
27 * execution sequence), a pointer to the function that would execute the
28 * op, plus any data specific to that op. For example, an OP_CONST op
29 * points to the pp_const() function and to an SV containing the constant
30 * value. When pp_const() is executed, its job is to push that SV onto the
33 * OPs are mainly created by the newFOO() functions, which are mainly
34 * called from the parser (in perly.y) as the code is parsed. For example
35 * the Perl code $a + $b * $c would cause the equivalent of the following
36 * to be called (oversimplifying a bit):
38 * newBINOP(OP_ADD, flags,
40 * newBINOP(OP_MULTIPLY, flags, newSVREF($b), newSVREF($c))
43 * Note that during the build of miniperl, a temporary copy of this file
44 * is made, called opmini.c.
48 Perl's compiler is essentially a 3-pass compiler with interleaved phases:
52 An execution-order pass
54 The bottom-up pass is represented by all the "newOP" routines and
55 the ck_ routines. The bottom-upness is actually driven by yacc.
56 So at the point that a ck_ routine fires, we have no idea what the
57 context is, either upward in the syntax tree, or either forward or
58 backward in the execution order. (The bottom-up parser builds that
59 part of the execution order it knows about, but if you follow the "next"
60 links around, you'll find it's actually a closed loop through the
63 Whenever the bottom-up parser gets to a node that supplies context to
64 its components, it invokes that portion of the top-down pass that applies
65 to that part of the subtree (and marks the top node as processed, so
66 if a node further up supplies context, it doesn't have to take the
67 plunge again). As a particular subcase of this, as the new node is
68 built, it takes all the closed execution loops of its subcomponents
69 and links them into a new closed loop for the higher level node. But
70 it's still not the real execution order.
72 The actual execution order is not known till we get a grammar reduction
73 to a top-level unit like a subroutine or file that will be called by
74 "name" rather than via a "next" pointer. At that point, we can call
75 into peep() to do that code's portion of the 3rd pass. It has to be
76 recursive, but it's recursive on basic blocks, not on tree nodes.
79 /* To implement user lexical pragmas, there needs to be a way at run time to
80 get the compile time state of %^H for that block. Storing %^H in every
81 block (or even COP) would be very expensive, so a different approach is
82 taken. The (running) state of %^H is serialised into a tree of HE-like
83 structs. Stores into %^H are chained onto the current leaf as a struct
84 refcounted_he * with the key and the value. Deletes from %^H are saved
85 with a value of PL_sv_placeholder. The state of %^H at any point can be
86 turned back into a regular HV by walking back up the tree from that point's
87 leaf, ignoring any key you've already seen (placeholder or not), storing
88 the rest into the HV structure, then removing the placeholders. Hence
89 memory is only used to store the %^H deltas from the enclosing COP, rather
90 than the entire %^H on each COP.
92 To cause actions on %^H to write out the serialisation records, it has
93 magic type 'H'. This magic (itself) does nothing, but its presence causes
94 the values to gain magic type 'h', which has entries for set and clear.
95 C<Perl_magic_sethint> updates C<PL_compiling.cop_hints_hash> with a store
96 record, with deletes written by C<Perl_magic_clearhint>. C<SAVEHINTS>
97 saves the current C<PL_compiling.cop_hints_hash> on the save stack, so that
98 it will be correctly restored when any inner compiling scope is exited.
104 #include "keywords.h"
108 #define CALL_PEEP(o) PL_peepp(aTHX_ o)
109 #define CALL_RPEEP(o) PL_rpeepp(aTHX_ o)
110 #define CALL_OPFREEHOOK(o) if (PL_opfreehook) PL_opfreehook(aTHX_ o)
112 /* See the explanatory comments above struct opslab in op.h. */
114 #ifdef PERL_DEBUG_READONLY_OPS
115 # define PERL_SLAB_SIZE 128
116 # define PERL_MAX_SLAB_SIZE 4096
117 # include <sys/mman.h>
120 #ifndef PERL_SLAB_SIZE
121 # define PERL_SLAB_SIZE 64
123 #ifndef PERL_MAX_SLAB_SIZE
124 # define PERL_MAX_SLAB_SIZE 2048
127 /* rounds up to nearest pointer */
128 #define SIZE_TO_PSIZE(x) (((x) + sizeof(I32 *) - 1)/sizeof(I32 *))
129 #define DIFF(o,p) ((size_t)((I32 **)(p) - (I32**)(o)))
132 S_new_slab(pTHX_ size_t sz)
134 #ifdef PERL_DEBUG_READONLY_OPS
135 OPSLAB *slab = (OPSLAB *) mmap(0, sz * sizeof(I32 *),
136 PROT_READ|PROT_WRITE,
137 MAP_ANON|MAP_PRIVATE, -1, 0);
138 DEBUG_m(PerlIO_printf(Perl_debug_log, "mapped %lu at %p\n",
139 (unsigned long) sz, slab));
140 if (slab == MAP_FAILED) {
141 perror("mmap failed");
144 slab->opslab_size = (U16)sz;
146 OPSLAB *slab = (OPSLAB *)PerlMemShared_calloc(sz, sizeof(I32 *));
148 slab->opslab_first = (OPSLOT *)((I32 **)slab + sz - 1);
152 /* requires double parens and aTHX_ */
153 #define DEBUG_S_warn(args) \
155 PerlIO_printf(Perl_debug_log, "%s", SvPVx_nolen(Perl_mess args)) \
159 Perl_Slab_Alloc(pTHX_ size_t sz)
168 if (!PL_compcv || CvROOT(PL_compcv)
169 || (CvSTART(PL_compcv) && !CvSLABBED(PL_compcv)))
170 return PerlMemShared_calloc(1, sz);
172 if (!CvSTART(PL_compcv)) { /* sneak it in here */
174 (OP *)(slab = S_new_slab(aTHX_ PERL_SLAB_SIZE));
175 CvSLABBED_on(PL_compcv);
176 slab->opslab_refcnt = 2; /* one for the CV; one for the new OP */
178 else ++(slab = (OPSLAB *)CvSTART(PL_compcv))->opslab_refcnt;
180 opsz = SIZE_TO_PSIZE(sz);
181 sz = opsz + OPSLOT_HEADER_P;
183 if (slab->opslab_freed) {
184 OP **too = &slab->opslab_freed;
186 DEBUG_S_warn((aTHX_ "found free op at %p, slab %p", o, slab));
187 while (o && DIFF(OpSLOT(o), OpSLOT(o)->opslot_next) < sz) {
188 DEBUG_S_warn((aTHX_ "Alas! too small"));
189 o = *(too = &o->op_next);
190 if (o) { DEBUG_S_warn((aTHX_ "found another free op at %p", o)); }
194 Zero(o, opsz, I32 *);
200 #define INIT_OPSLOT \
201 slot->opslot_slab = slab; \
202 slot->opslot_next = slab2->opslab_first; \
203 slab2->opslab_first = slot; \
204 o = &slot->opslot_op; \
207 /* The partially-filled slab is next in the chain. */
208 slab2 = slab->opslab_next ? slab->opslab_next : slab;
209 if ((space = DIFF(&slab2->opslab_slots, slab2->opslab_first)) < sz) {
210 /* Remaining space is too small. */
212 /* If we can fit a BASEOP, add it to the free chain, so as not
214 if (space >= SIZE_TO_PSIZE(sizeof(OP)) + OPSLOT_HEADER_P) {
215 slot = &slab2->opslab_slots;
217 o->op_type = OP_FREED;
218 o->op_next = slab->opslab_freed;
219 slab->opslab_freed = o;
222 /* Create a new slab. Make this one twice as big. */
223 slot = slab2->opslab_first;
224 while (slot->opslot_next) slot = slot->opslot_next;
225 slab2 = S_new_slab(aTHX_
226 (DIFF(slab2, slot)+1)*2 > PERL_MAX_SLAB_SIZE
228 : (DIFF(slab2, slot)+1)*2);
229 slab2->opslab_next = slab->opslab_next;
230 slab->opslab_next = slab2;
232 assert(DIFF(&slab2->opslab_slots, slab2->opslab_first) >= sz);
234 /* Create a new op slot */
235 slot = (OPSLOT *)((I32 **)slab2->opslab_first - sz);
236 assert(slot >= &slab2->opslab_slots);
237 if (DIFF(&slab2->opslab_slots, slot)
238 < SIZE_TO_PSIZE(sizeof(OP)) + OPSLOT_HEADER_P)
239 slot = &slab2->opslab_slots;
241 DEBUG_S_warn((aTHX_ "allocating op at %p, slab %p", o, slab));
247 #ifdef PERL_DEBUG_READONLY_OPS
249 Perl_Slab_to_ro(pTHX_ OPSLAB *slab)
251 PERL_ARGS_ASSERT_SLAB_TO_RO;
253 if (slab->opslab_readonly) return;
254 slab->opslab_readonly = 1;
255 for (; slab; slab = slab->opslab_next) {
256 /*DEBUG_U(PerlIO_printf(Perl_debug_log,"mprotect ->ro %lu at %p\n",
257 (unsigned long) slab->opslab_size, slab));*/
258 if (mprotect(slab, slab->opslab_size * sizeof(I32 *), PROT_READ))
259 Perl_warn(aTHX_ "mprotect for %p %lu failed with %d", slab,
260 (unsigned long)slab->opslab_size, errno);
265 Perl_Slab_to_rw(pTHX_ OPSLAB *const slab)
269 PERL_ARGS_ASSERT_SLAB_TO_RW;
271 if (!slab->opslab_readonly) return;
273 for (; slab2; slab2 = slab2->opslab_next) {
274 /*DEBUG_U(PerlIO_printf(Perl_debug_log,"mprotect ->rw %lu at %p\n",
275 (unsigned long) size, slab2));*/
276 if (mprotect((void *)slab2, slab2->opslab_size * sizeof(I32 *),
277 PROT_READ|PROT_WRITE)) {
278 Perl_warn(aTHX_ "mprotect RW for %p %lu failed with %d", slab,
279 (unsigned long)slab2->opslab_size, errno);
282 slab->opslab_readonly = 0;
286 # define Slab_to_rw(op)
289 /* This cannot possibly be right, but it was copied from the old slab
290 allocator, to which it was originally added, without explanation, in
293 # define PerlMemShared PerlMem
297 Perl_Slab_Free(pTHX_ void *op)
300 OP * const o = (OP *)op;
303 PERL_ARGS_ASSERT_SLAB_FREE;
305 if (!o->op_slabbed) {
306 PerlMemShared_free(op);
311 /* If this op is already freed, our refcount will get screwy. */
312 assert(o->op_type != OP_FREED);
313 o->op_type = OP_FREED;
314 o->op_next = slab->opslab_freed;
315 slab->opslab_freed = o;
316 DEBUG_S_warn((aTHX_ "free op at %p, recorded in slab %p", o, slab));
317 OpslabREFCNT_dec_padok(slab);
321 Perl_opslab_free_nopad(pTHX_ OPSLAB *slab)
324 const bool havepad = !!PL_comppad;
325 PERL_ARGS_ASSERT_OPSLAB_FREE_NOPAD;
328 PAD_SAVE_SETNULLPAD();
335 Perl_opslab_free(pTHX_ OPSLAB *slab)
339 PERL_ARGS_ASSERT_OPSLAB_FREE;
340 DEBUG_S_warn((aTHX_ "freeing slab %p", slab));
341 assert(slab->opslab_refcnt == 1);
342 for (; slab; slab = slab2) {
343 slab2 = slab->opslab_next;
345 slab->opslab_refcnt = ~(size_t)0;
347 #ifdef PERL_DEBUG_READONLY_OPS
348 DEBUG_m(PerlIO_printf(Perl_debug_log, "Deallocate slab at %p\n",
350 if (munmap(slab, slab->opslab_size * sizeof(I32 *))) {
351 perror("munmap failed");
355 PerlMemShared_free(slab);
361 Perl_opslab_force_free(pTHX_ OPSLAB *slab)
366 size_t savestack_count = 0;
368 PERL_ARGS_ASSERT_OPSLAB_FORCE_FREE;
371 for (slot = slab2->opslab_first;
373 slot = slot->opslot_next) {
374 if (slot->opslot_op.op_type != OP_FREED
375 && !(slot->opslot_op.op_savefree
381 assert(slot->opslot_op.op_slabbed);
382 slab->opslab_refcnt++; /* op_free may free slab */
383 op_free(&slot->opslot_op);
384 if (!--slab->opslab_refcnt) goto free;
387 } while ((slab2 = slab2->opslab_next));
388 /* > 1 because the CV still holds a reference count. */
389 if (slab->opslab_refcnt > 1) { /* still referenced by the savestack */
391 assert(savestack_count == slab->opslab_refcnt-1);
399 #ifdef PERL_DEBUG_READONLY_OPS
401 Perl_op_refcnt_inc(pTHX_ OP *o)
404 OPSLAB *const slab = o->op_slabbed ? OpSLAB(o) : NULL;
405 if (slab && slab->opslab_readonly) {
418 Perl_op_refcnt_dec(pTHX_ OP *o)
421 OPSLAB *const slab = o->op_slabbed ? OpSLAB(o) : NULL;
423 PERL_ARGS_ASSERT_OP_REFCNT_DEC;
425 if (slab && slab->opslab_readonly) {
427 result = --o->op_targ;
430 result = --o->op_targ;
436 * In the following definition, the ", (OP*)0" is just to make the compiler
437 * think the expression is of the right type: croak actually does a Siglongjmp.
439 #define CHECKOP(type,o) \
440 ((PL_op_mask && PL_op_mask[type]) \
441 ? ( op_free((OP*)o), \
442 Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \
444 : PL_check[type](aTHX_ (OP*)o))
446 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
448 #define CHANGE_TYPE(o,type) \
450 o->op_type = (OPCODE)type; \
451 o->op_ppaddr = PL_ppaddr[type]; \
455 S_gv_ename(pTHX_ GV *gv)
457 SV* const tmpsv = sv_newmortal();
459 PERL_ARGS_ASSERT_GV_ENAME;
461 gv_efullname3(tmpsv, gv, NULL);
466 S_no_fh_allowed(pTHX_ OP *o)
468 PERL_ARGS_ASSERT_NO_FH_ALLOWED;
470 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
476 S_too_few_arguments_sv(pTHX_ OP *o, SV *namesv, U32 flags)
478 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS_SV;
479 yyerror_pv(Perl_form(aTHX_ "Not enough arguments for %"SVf, namesv),
480 SvUTF8(namesv) | flags);
485 S_too_few_arguments_pv(pTHX_ OP *o, const char* name, U32 flags)
487 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS_PV;
488 yyerror_pv(Perl_form(aTHX_ "Not enough arguments for %s", name), flags);
493 S_too_many_arguments_pv(pTHX_ OP *o, const char *name, U32 flags)
495 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS_PV;
497 yyerror_pv(Perl_form(aTHX_ "Too many arguments for %s", name), flags);
502 S_too_many_arguments_sv(pTHX_ OP *o, SV *namesv, U32 flags)
504 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS_SV;
506 yyerror_pv(Perl_form(aTHX_ "Too many arguments for %"SVf, SVfARG(namesv)),
507 SvUTF8(namesv) | flags);
512 S_bad_type_pv(pTHX_ I32 n, const char *t, const char *name, U32 flags, const OP *kid)
514 PERL_ARGS_ASSERT_BAD_TYPE_PV;
516 yyerror_pv(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
517 (int)n, name, t, OP_DESC(kid)), flags);
521 S_bad_type_sv(pTHX_ I32 n, const char *t, SV *namesv, U32 flags, const OP *kid)
523 PERL_ARGS_ASSERT_BAD_TYPE_SV;
525 yyerror_pv(Perl_form(aTHX_ "Type of arg %d to %"SVf" must be %s (not %s)",
526 (int)n, SVfARG(namesv), t, OP_DESC(kid)), SvUTF8(namesv) | flags);
530 S_no_bareword_allowed(pTHX_ OP *o)
532 PERL_ARGS_ASSERT_NO_BAREWORD_ALLOWED;
535 return; /* various ok barewords are hidden in extra OP_NULL */
536 qerror(Perl_mess(aTHX_
537 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
539 o->op_private &= ~OPpCONST_STRICT; /* prevent warning twice about the same OP */
542 /* "register" allocation */
545 Perl_allocmy(pTHX_ const char *const name, const STRLEN len, const U32 flags)
549 const bool is_our = (PL_parser->in_my == KEY_our);
551 PERL_ARGS_ASSERT_ALLOCMY;
553 if (flags & ~SVf_UTF8)
554 Perl_croak(aTHX_ "panic: allocmy illegal flag bits 0x%" UVxf,
557 /* Until we're using the length for real, cross check that we're being
559 assert(strlen(name) == len);
561 /* complain about "my $<special_var>" etc etc */
565 ((flags & SVf_UTF8) && isIDFIRST_utf8((U8 *)name+1)) ||
566 (name[1] == '_' && (*name == '$' || len > 2))))
568 /* name[2] is true if strlen(name) > 2 */
569 if (!(flags & SVf_UTF8 && UTF8_IS_START(name[1]))
570 && (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1]))) {
571 yyerror(Perl_form(aTHX_ "Can't use global %c^%c%.*s in \"%s\"",
572 name[0], toCTRL(name[1]), (int)(len - 2), name + 2,
573 PL_parser->in_my == KEY_state ? "state" : "my"));
575 yyerror_pv(Perl_form(aTHX_ "Can't use global %.*s in \"%s\"", (int) len, name,
576 PL_parser->in_my == KEY_state ? "state" : "my"), flags & SVf_UTF8);
580 /* allocate a spare slot and store the name in that slot */
582 off = pad_add_name_pvn(name, len,
583 (is_our ? padadd_OUR :
584 PL_parser->in_my == KEY_state ? padadd_STATE : 0)
585 | ( flags & SVf_UTF8 ? SVf_UTF8 : 0 ),
586 PL_parser->in_my_stash,
588 /* $_ is always in main::, even with our */
589 ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash)
593 /* anon sub prototypes contains state vars should always be cloned,
594 * otherwise the state var would be shared between anon subs */
596 if (PL_parser->in_my == KEY_state && CvANON(PL_compcv))
597 CvCLONE_on(PL_compcv);
603 =for apidoc alloccopstash
605 Available only under threaded builds, this function allocates an entry in
606 C<PL_stashpad> for the stash passed to it.
613 Perl_alloccopstash(pTHX_ HV *hv)
615 PADOFFSET off = 0, o = 1;
616 bool found_slot = FALSE;
618 PERL_ARGS_ASSERT_ALLOCCOPSTASH;
620 if (PL_stashpad[PL_stashpadix] == hv) return PL_stashpadix;
622 for (; o < PL_stashpadmax; ++o) {
623 if (PL_stashpad[o] == hv) return PL_stashpadix = o;
624 if (!PL_stashpad[o] || SvTYPE(PL_stashpad[o]) != SVt_PVHV)
625 found_slot = TRUE, off = o;
628 Renew(PL_stashpad, PL_stashpadmax + 10, HV *);
629 Zero(PL_stashpad + PL_stashpadmax, 10, HV *);
630 off = PL_stashpadmax;
631 PL_stashpadmax += 10;
634 PL_stashpad[PL_stashpadix = off] = hv;
639 /* free the body of an op without examining its contents.
640 * Always use this rather than FreeOp directly */
643 S_op_destroy(pTHX_ OP *o)
649 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a,b)
651 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a)
657 Perl_op_free(pTHX_ OP *o)
662 /* Though ops may be freed twice, freeing the op after its slab is a
664 assert(!o || !o->op_slabbed || OpSLAB(o)->opslab_refcnt != ~(size_t)0);
665 /* During the forced freeing of ops after compilation failure, kidops
666 may be freed before their parents. */
667 if (!o || o->op_type == OP_FREED)
671 if (o->op_private & OPpREFCOUNTED) {
682 refcnt = OpREFCNT_dec(o);
685 /* Need to find and remove any pattern match ops from the list
686 we maintain for reset(). */
687 find_and_forget_pmops(o);
697 /* Call the op_free hook if it has been set. Do it now so that it's called
698 * at the right time for refcounted ops, but still before all of the kids
702 if (o->op_flags & OPf_KIDS) {
704 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
705 nextkid = kid->op_sibling; /* Get before next freeing kid */
710 type = (OPCODE)o->op_targ;
713 Slab_to_rw(OpSLAB(o));
716 /* COP* is not cleared by op_clear() so that we may track line
717 * numbers etc even after null() */
718 if (type == OP_NEXTSTATE || type == OP_DBSTATE) {
724 #ifdef DEBUG_LEAKING_SCALARS
731 Perl_op_clear(pTHX_ OP *o)
736 PERL_ARGS_ASSERT_OP_CLEAR;
739 mad_free(o->op_madprop);
744 switch (o->op_type) {
745 case OP_NULL: /* Was holding old type, if any. */
746 if (PL_madskills && o->op_targ != OP_NULL) {
747 o->op_type = (Optype)o->op_targ;
752 case OP_ENTEREVAL: /* Was holding hints. */
756 if (!(o->op_flags & OPf_REF)
757 || (PL_check[o->op_type] != Perl_ck_ftst))
764 GV *gv = (o->op_type == OP_GV || o->op_type == OP_GVSV)
769 /* It's possible during global destruction that the GV is freed
770 before the optree. Whilst the SvREFCNT_inc is happy to bump from
771 0 to 1 on a freed SV, the corresponding SvREFCNT_dec from 1 to 0
772 will trigger an assertion failure, because the entry to sv_clear
773 checks that the scalar is not already freed. A check of for
774 !SvIS_FREED(gv) turns out to be invalid, because during global
775 destruction the reference count can be forced down to zero
776 (with SVf_BREAK set). In which case raising to 1 and then
777 dropping to 0 triggers cleanup before it should happen. I
778 *think* that this might actually be a general, systematic,
779 weakness of the whole idea of SVf_BREAK, in that code *is*
780 allowed to raise and lower references during global destruction,
781 so any *valid* code that happens to do this during global
782 destruction might well trigger premature cleanup. */
783 bool still_valid = gv && SvREFCNT(gv);
786 SvREFCNT_inc_simple_void(gv);
788 if (cPADOPo->op_padix > 0) {
789 /* No GvIN_PAD_off(cGVOPo_gv) here, because other references
790 * may still exist on the pad */
791 pad_swipe(cPADOPo->op_padix, TRUE);
792 cPADOPo->op_padix = 0;
795 SvREFCNT_dec(cSVOPo->op_sv);
796 cSVOPo->op_sv = NULL;
799 int try_downgrade = SvREFCNT(gv) == 2;
802 gv_try_downgrade(gv);
806 case OP_METHOD_NAMED:
809 SvREFCNT_dec(cSVOPo->op_sv);
810 cSVOPo->op_sv = NULL;
813 Even if op_clear does a pad_free for the target of the op,
814 pad_free doesn't actually remove the sv that exists in the pad;
815 instead it lives on. This results in that it could be reused as
816 a target later on when the pad was reallocated.
819 pad_swipe(o->op_targ,1);
829 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
834 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
835 assert(o->op_type == OP_TRANS || o->op_type == OP_TRANSR);
837 if (cPADOPo->op_padix > 0) {
838 pad_swipe(cPADOPo->op_padix, TRUE);
839 cPADOPo->op_padix = 0;
842 SvREFCNT_dec(cSVOPo->op_sv);
843 cSVOPo->op_sv = NULL;
847 PerlMemShared_free(cPVOPo->op_pv);
848 cPVOPo->op_pv = NULL;
852 op_free(cPMOPo->op_pmreplrootu.op_pmreplroot);
856 if (cPMOPo->op_pmreplrootu.op_pmtargetoff) {
857 /* No GvIN_PAD_off here, because other references may still
858 * exist on the pad */
859 pad_swipe(cPMOPo->op_pmreplrootu.op_pmtargetoff, TRUE);
862 SvREFCNT_dec(MUTABLE_SV(cPMOPo->op_pmreplrootu.op_pmtargetgv));
868 if (!(cPMOPo->op_pmflags & PMf_CODELIST_PRIVATE))
869 op_free(cPMOPo->op_code_list);
870 cPMOPo->op_code_list = NULL;
871 forget_pmop(cPMOPo, 1);
872 cPMOPo->op_pmreplrootu.op_pmreplroot = NULL;
873 /* we use the same protection as the "SAFE" version of the PM_ macros
874 * here since sv_clean_all might release some PMOPs
875 * after PL_regex_padav has been cleared
876 * and the clearing of PL_regex_padav needs to
877 * happen before sv_clean_all
880 if(PL_regex_pad) { /* We could be in destruction */
881 const IV offset = (cPMOPo)->op_pmoffset;
882 ReREFCNT_dec(PM_GETRE(cPMOPo));
883 PL_regex_pad[offset] = &PL_sv_undef;
884 sv_catpvn_nomg(PL_regex_pad[0], (const char *)&offset,
888 ReREFCNT_dec(PM_GETRE(cPMOPo));
889 PM_SETRE(cPMOPo, NULL);
895 if (o->op_targ > 0) {
896 pad_free(o->op_targ);
902 S_cop_free(pTHX_ COP* cop)
904 PERL_ARGS_ASSERT_COP_FREE;
907 if (! specialWARN(cop->cop_warnings))
908 PerlMemShared_free(cop->cop_warnings);
909 cophh_free(CopHINTHASH_get(cop));
913 S_forget_pmop(pTHX_ PMOP *const o
919 HV * const pmstash = PmopSTASH(o);
921 PERL_ARGS_ASSERT_FORGET_PMOP;
923 if (pmstash && !SvIS_FREED(pmstash) && SvMAGICAL(pmstash)) {
924 MAGIC * const mg = mg_find((const SV *)pmstash, PERL_MAGIC_symtab);
926 PMOP **const array = (PMOP**) mg->mg_ptr;
927 U32 count = mg->mg_len / sizeof(PMOP**);
932 /* Found it. Move the entry at the end to overwrite it. */
933 array[i] = array[--count];
934 mg->mg_len = count * sizeof(PMOP**);
935 /* Could realloc smaller at this point always, but probably
936 not worth it. Probably worth free()ing if we're the
939 Safefree(mg->mg_ptr);
956 S_find_and_forget_pmops(pTHX_ OP *o)
958 PERL_ARGS_ASSERT_FIND_AND_FORGET_PMOPS;
960 if (o->op_flags & OPf_KIDS) {
961 OP *kid = cUNOPo->op_first;
963 switch (kid->op_type) {
968 forget_pmop((PMOP*)kid, 0);
970 find_and_forget_pmops(kid);
971 kid = kid->op_sibling;
977 Perl_op_null(pTHX_ OP *o)
981 PERL_ARGS_ASSERT_OP_NULL;
983 if (o->op_type == OP_NULL)
987 o->op_targ = o->op_type;
988 o->op_type = OP_NULL;
989 o->op_ppaddr = PL_ppaddr[OP_NULL];
993 Perl_op_refcnt_lock(pTHX)
1001 Perl_op_refcnt_unlock(pTHX)
1004 PERL_UNUSED_CONTEXT;
1008 /* Contextualizers */
1011 =for apidoc Am|OP *|op_contextualize|OP *o|I32 context
1013 Applies a syntactic context to an op tree representing an expression.
1014 I<o> is the op tree, and I<context> must be C<G_SCALAR>, C<G_ARRAY>,
1015 or C<G_VOID> to specify the context to apply. The modified op tree
1022 Perl_op_contextualize(pTHX_ OP *o, I32 context)
1024 PERL_ARGS_ASSERT_OP_CONTEXTUALIZE;
1026 case G_SCALAR: return scalar(o);
1027 case G_ARRAY: return list(o);
1028 case G_VOID: return scalarvoid(o);
1030 Perl_croak(aTHX_ "panic: op_contextualize bad context %ld",
1037 =head1 Optree Manipulation Functions
1039 =for apidoc Am|OP*|op_linklist|OP *o
1040 This function is the implementation of the L</LINKLIST> macro. It should
1041 not be called directly.
1047 Perl_op_linklist(pTHX_ OP *o)
1051 PERL_ARGS_ASSERT_OP_LINKLIST;
1056 /* establish postfix order */
1057 first = cUNOPo->op_first;
1060 o->op_next = LINKLIST(first);
1063 if (kid->op_sibling) {
1064 kid->op_next = LINKLIST(kid->op_sibling);
1065 kid = kid->op_sibling;
1079 S_scalarkids(pTHX_ OP *o)
1081 if (o && o->op_flags & OPf_KIDS) {
1083 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1090 S_scalarboolean(pTHX_ OP *o)
1094 PERL_ARGS_ASSERT_SCALARBOOLEAN;
1096 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST
1097 && !(cBINOPo->op_first->op_flags & OPf_SPECIAL)) {
1098 if (ckWARN(WARN_SYNTAX)) {
1099 const line_t oldline = CopLINE(PL_curcop);
1101 if (PL_parser && PL_parser->copline != NOLINE) {
1102 /* This ensures that warnings are reported at the first line
1103 of the conditional, not the last. */
1104 CopLINE_set(PL_curcop, PL_parser->copline);
1106 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
1107 CopLINE_set(PL_curcop, oldline);
1114 Perl_scalar(pTHX_ OP *o)
1119 /* assumes no premature commitment */
1120 if (!o || (PL_parser && PL_parser->error_count)
1121 || (o->op_flags & OPf_WANT)
1122 || o->op_type == OP_RETURN)
1127 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
1129 switch (o->op_type) {
1131 scalar(cBINOPo->op_first);
1136 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1146 if (o->op_flags & OPf_KIDS) {
1147 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1153 kid = cLISTOPo->op_first;
1155 kid = kid->op_sibling;
1158 OP *sib = kid->op_sibling;
1159 if (sib && kid->op_type != OP_LEAVEWHEN)
1165 PL_curcop = &PL_compiling;
1170 kid = cLISTOPo->op_first;
1173 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
1180 Perl_scalarvoid(pTHX_ OP *o)
1184 SV *useless_sv = NULL;
1185 const char* useless = NULL;
1189 PERL_ARGS_ASSERT_SCALARVOID;
1191 /* trailing mad null ops don't count as "there" for void processing */
1193 o->op_type != OP_NULL &&
1195 o->op_sibling->op_type == OP_NULL)
1198 for (sib = o->op_sibling;
1199 sib && sib->op_type == OP_NULL;
1200 sib = sib->op_sibling) ;
1206 if (o->op_type == OP_NEXTSTATE
1207 || o->op_type == OP_DBSTATE
1208 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1209 || o->op_targ == OP_DBSTATE)))
1210 PL_curcop = (COP*)o; /* for warning below */
1212 /* assumes no premature commitment */
1213 want = o->op_flags & OPf_WANT;
1214 if ((want && want != OPf_WANT_SCALAR)
1215 || (PL_parser && PL_parser->error_count)
1216 || o->op_type == OP_RETURN || o->op_type == OP_REQUIRE || o->op_type == OP_LEAVEWHEN)
1221 if ((o->op_private & OPpTARGET_MY)
1222 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1224 return scalar(o); /* As if inside SASSIGN */
1227 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1229 switch (o->op_type) {
1231 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1235 if (o->op_flags & OPf_STACKED)
1239 if (o->op_private == 4)
1264 case OP_AELEMFAST_LEX:
1283 case OP_GETSOCKNAME:
1284 case OP_GETPEERNAME:
1289 case OP_GETPRIORITY:
1314 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1315 /* Otherwise it's "Useless use of grep iterator" */
1316 useless = OP_DESC(o);
1320 kid = cLISTOPo->op_first;
1321 if (kid && kid->op_type == OP_PUSHRE
1323 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetoff)
1325 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetgv)
1327 useless = OP_DESC(o);
1331 kid = cUNOPo->op_first;
1332 if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST &&
1333 kid->op_type != OP_TRANS && kid->op_type != OP_TRANSR) {
1336 useless = "negative pattern binding (!~)";
1340 if (cPMOPo->op_pmflags & PMf_NONDESTRUCT)
1341 useless = "non-destructive substitution (s///r)";
1345 useless = "non-destructive transliteration (tr///r)";
1352 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1353 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1354 useless = "a variable";
1359 if (cSVOPo->op_private & OPpCONST_STRICT)
1360 no_bareword_allowed(o);
1362 if (ckWARN(WARN_VOID)) {
1363 /* don't warn on optimised away booleans, eg
1364 * use constant Foo, 5; Foo || print; */
1365 if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT)
1367 /* the constants 0 and 1 are permitted as they are
1368 conventionally used as dummies in constructs like
1369 1 while some_condition_with_side_effects; */
1370 else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1372 else if (SvPOK(sv)) {
1373 /* perl4's way of mixing documentation and code
1374 (before the invention of POD) was based on a
1375 trick to mix nroff and perl code. The trick was
1376 built upon these three nroff macros being used in
1377 void context. The pink camel has the details in
1378 the script wrapman near page 319. */
1379 const char * const maybe_macro = SvPVX_const(sv);
1380 if (strnEQ(maybe_macro, "di", 2) ||
1381 strnEQ(maybe_macro, "ds", 2) ||
1382 strnEQ(maybe_macro, "ig", 2))
1385 SV * const dsv = newSVpvs("");
1387 = Perl_newSVpvf(aTHX_
1389 pv_pretty(dsv, maybe_macro,
1390 SvCUR(sv), 32, NULL, NULL,
1392 | PERL_PV_ESCAPE_NOCLEAR
1393 | PERL_PV_ESCAPE_UNI_DETECT));
1397 else if (SvOK(sv)) {
1398 useless_sv = Perl_newSVpvf(aTHX_ "a constant (%"SVf")", sv);
1401 useless = "a constant (undef)";
1404 op_null(o); /* don't execute or even remember it */
1408 o->op_type = OP_PREINC; /* pre-increment is faster */
1409 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1413 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1414 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1418 o->op_type = OP_I_PREINC; /* pre-increment is faster */
1419 o->op_ppaddr = PL_ppaddr[OP_I_PREINC];
1423 o->op_type = OP_I_PREDEC; /* pre-decrement is faster */
1424 o->op_ppaddr = PL_ppaddr[OP_I_PREDEC];
1429 UNOP *refgen, *rv2cv;
1432 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
1435 rv2gv = ((BINOP *)o)->op_last;
1436 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
1439 refgen = (UNOP *)((BINOP *)o)->op_first;
1441 if (!refgen || refgen->op_type != OP_REFGEN)
1444 exlist = (LISTOP *)refgen->op_first;
1445 if (!exlist || exlist->op_type != OP_NULL
1446 || exlist->op_targ != OP_LIST)
1449 if (exlist->op_first->op_type != OP_PUSHMARK)
1452 rv2cv = (UNOP*)exlist->op_last;
1454 if (rv2cv->op_type != OP_RV2CV)
1457 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
1458 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
1459 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
1461 o->op_private |= OPpASSIGN_CV_TO_GV;
1462 rv2gv->op_private |= OPpDONT_INIT_GV;
1463 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
1475 kid = cLOGOPo->op_first;
1476 if (kid->op_type == OP_NOT
1477 && (kid->op_flags & OPf_KIDS)
1479 if (o->op_type == OP_AND) {
1481 o->op_ppaddr = PL_ppaddr[OP_OR];
1483 o->op_type = OP_AND;
1484 o->op_ppaddr = PL_ppaddr[OP_AND];
1493 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1498 if (o->op_flags & OPf_STACKED)
1505 if (!(o->op_flags & OPf_KIDS))
1516 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1527 /* mortalise it, in case warnings are fatal. */
1528 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
1529 "Useless use of %"SVf" in void context",
1530 sv_2mortal(useless_sv));
1533 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
1534 "Useless use of %s in void context",
1541 S_listkids(pTHX_ OP *o)
1543 if (o && o->op_flags & OPf_KIDS) {
1545 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1552 Perl_list(pTHX_ OP *o)
1557 /* assumes no premature commitment */
1558 if (!o || (o->op_flags & OPf_WANT)
1559 || (PL_parser && PL_parser->error_count)
1560 || o->op_type == OP_RETURN)
1565 if ((o->op_private & OPpTARGET_MY)
1566 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1568 return o; /* As if inside SASSIGN */
1571 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1573 switch (o->op_type) {
1576 list(cBINOPo->op_first);
1581 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1589 if (!(o->op_flags & OPf_KIDS))
1591 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1592 list(cBINOPo->op_first);
1593 return gen_constant_list(o);
1600 kid = cLISTOPo->op_first;
1602 kid = kid->op_sibling;
1605 OP *sib = kid->op_sibling;
1606 if (sib && kid->op_type != OP_LEAVEWHEN)
1612 PL_curcop = &PL_compiling;
1616 kid = cLISTOPo->op_first;
1623 S_scalarseq(pTHX_ OP *o)
1627 const OPCODE type = o->op_type;
1629 if (type == OP_LINESEQ || type == OP_SCOPE ||
1630 type == OP_LEAVE || type == OP_LEAVETRY)
1633 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1634 if (kid->op_sibling) {
1638 PL_curcop = &PL_compiling;
1640 o->op_flags &= ~OPf_PARENS;
1641 if (PL_hints & HINT_BLOCK_SCOPE)
1642 o->op_flags |= OPf_PARENS;
1645 o = newOP(OP_STUB, 0);
1650 S_modkids(pTHX_ OP *o, I32 type)
1652 if (o && o->op_flags & OPf_KIDS) {
1654 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1655 op_lvalue(kid, type);
1661 =for apidoc finalize_optree
1663 This function finalizes the optree. Should be called directly after
1664 the complete optree is built. It does some additional
1665 checking which can't be done in the normal ck_xxx functions and makes
1666 the tree thread-safe.
1671 Perl_finalize_optree(pTHX_ OP* o)
1673 PERL_ARGS_ASSERT_FINALIZE_OPTREE;
1676 SAVEVPTR(PL_curcop);
1684 S_finalize_op(pTHX_ OP* o)
1686 PERL_ARGS_ASSERT_FINALIZE_OP;
1688 #if defined(PERL_MAD) && defined(USE_ITHREADS)
1690 /* Make sure mad ops are also thread-safe */
1691 MADPROP *mp = o->op_madprop;
1693 if (mp->mad_type == MAD_OP && mp->mad_vlen) {
1694 OP *prop_op = (OP *) mp->mad_val;
1695 /* We only need "Relocate sv to the pad for thread safety.", but this
1696 easiest way to make sure it traverses everything */
1697 if (prop_op->op_type == OP_CONST)
1698 cSVOPx(prop_op)->op_private &= ~OPpCONST_STRICT;
1699 finalize_op(prop_op);
1706 switch (o->op_type) {
1709 PL_curcop = ((COP*)o); /* for warnings */
1713 && (o->op_sibling->op_type == OP_NEXTSTATE || o->op_sibling->op_type == OP_DBSTATE)
1714 && ckWARN(WARN_SYNTAX))
1716 if (o->op_sibling->op_sibling) {
1717 const OPCODE type = o->op_sibling->op_sibling->op_type;
1718 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
1719 const line_t oldline = CopLINE(PL_curcop);
1720 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_sibling));
1721 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1722 "Statement unlikely to be reached");
1723 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1724 "\t(Maybe you meant system() when you said exec()?)\n");
1725 CopLINE_set(PL_curcop, oldline);
1732 if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
1733 GV * const gv = cGVOPo_gv;
1734 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
1735 /* XXX could check prototype here instead of just carping */
1736 SV * const sv = sv_newmortal();
1737 gv_efullname3(sv, gv, NULL);
1738 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
1739 "%"SVf"() called too early to check prototype",
1746 if (cSVOPo->op_private & OPpCONST_STRICT)
1747 no_bareword_allowed(o);
1751 case OP_METHOD_NAMED:
1752 /* Relocate sv to the pad for thread safety.
1753 * Despite being a "constant", the SV is written to,
1754 * for reference counts, sv_upgrade() etc. */
1755 if (cSVOPo->op_sv) {
1756 const PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
1757 if (o->op_type != OP_METHOD_NAMED &&
1758 (SvPADTMP(cSVOPo->op_sv) || SvPADMY(cSVOPo->op_sv)))
1760 /* If op_sv is already a PADTMP/MY then it is being used by
1761 * some pad, so make a copy. */
1762 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
1763 SvREADONLY_on(PAD_SVl(ix));
1764 SvREFCNT_dec(cSVOPo->op_sv);
1766 else if (o->op_type != OP_METHOD_NAMED
1767 && cSVOPo->op_sv == &PL_sv_undef) {
1768 /* PL_sv_undef is hack - it's unsafe to store it in the
1769 AV that is the pad, because av_fetch treats values of
1770 PL_sv_undef as a "free" AV entry and will merrily
1771 replace them with a new SV, causing pad_alloc to think
1772 that this pad slot is free. (When, clearly, it is not)
1774 SvOK_off(PAD_SVl(ix));
1775 SvPADTMP_on(PAD_SVl(ix));
1776 SvREADONLY_on(PAD_SVl(ix));
1779 SvREFCNT_dec(PAD_SVl(ix));
1780 SvPADTMP_on(cSVOPo->op_sv);
1781 PAD_SETSV(ix, cSVOPo->op_sv);
1782 /* XXX I don't know how this isn't readonly already. */
1783 SvREADONLY_on(PAD_SVl(ix));
1785 cSVOPo->op_sv = NULL;
1796 const char *key = NULL;
1799 if (((BINOP*)o)->op_last->op_type != OP_CONST)
1802 /* Make the CONST have a shared SV */
1803 svp = cSVOPx_svp(((BINOP*)o)->op_last);
1804 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv))
1805 && SvTYPE(sv) < SVt_PVMG && !SvROK(sv)) {
1806 key = SvPV_const(sv, keylen);
1807 lexname = newSVpvn_share(key,
1808 SvUTF8(sv) ? -(I32)keylen : (I32)keylen,
1814 if ((o->op_private & (OPpLVAL_INTRO)))
1817 rop = (UNOP*)((BINOP*)o)->op_first;
1818 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
1820 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
1821 if (!SvPAD_TYPED(lexname))
1823 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
1824 if (!fields || !GvHV(*fields))
1826 key = SvPV_const(*svp, keylen);
1827 if (!hv_fetch(GvHV(*fields), key,
1828 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) {
1829 Perl_croak(aTHX_ "No such class field \"%"SVf"\" "
1830 "in variable %"SVf" of type %"HEKf,
1831 SVfARG(*svp), SVfARG(lexname),
1832 HEKfARG(HvNAME_HEK(SvSTASH(lexname))));
1844 SVOP *first_key_op, *key_op;
1846 if ((o->op_private & (OPpLVAL_INTRO))
1847 /* I bet there's always a pushmark... */
1848 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
1849 /* hmmm, no optimization if list contains only one key. */
1851 rop = (UNOP*)((LISTOP*)o)->op_last;
1852 if (rop->op_type != OP_RV2HV)
1854 if (rop->op_first->op_type == OP_PADSV)
1855 /* @$hash{qw(keys here)} */
1856 rop = (UNOP*)rop->op_first;
1858 /* @{$hash}{qw(keys here)} */
1859 if (rop->op_first->op_type == OP_SCOPE
1860 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
1862 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
1868 lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE);
1869 if (!SvPAD_TYPED(lexname))
1871 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
1872 if (!fields || !GvHV(*fields))
1874 /* Again guessing that the pushmark can be jumped over.... */
1875 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
1876 ->op_first->op_sibling;
1877 for (key_op = first_key_op; key_op;
1878 key_op = (SVOP*)key_op->op_sibling) {
1879 if (key_op->op_type != OP_CONST)
1881 svp = cSVOPx_svp(key_op);
1882 key = SvPV_const(*svp, keylen);
1883 if (!hv_fetch(GvHV(*fields), key,
1884 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) {
1885 Perl_croak(aTHX_ "No such class field \"%"SVf"\" "
1886 "in variable %"SVf" of type %"HEKf,
1887 SVfARG(*svp), SVfARG(lexname),
1888 HEKfARG(HvNAME_HEK(SvSTASH(lexname))));
1894 if (cPMOPo->op_pmreplrootu.op_pmreplroot)
1895 finalize_op(cPMOPo->op_pmreplrootu.op_pmreplroot);
1902 if (o->op_flags & OPf_KIDS) {
1904 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1910 =for apidoc Amx|OP *|op_lvalue|OP *o|I32 type
1912 Propagate lvalue ("modifiable") context to an op and its children.
1913 I<type> represents the context type, roughly based on the type of op that
1914 would do the modifying, although C<local()> is represented by OP_NULL,
1915 because it has no op type of its own (it is signalled by a flag on
1918 This function detects things that can't be modified, such as C<$x+1>, and
1919 generates errors for them. For example, C<$x+1 = 2> would cause it to be
1920 called with an op of type OP_ADD and a C<type> argument of OP_SASSIGN.
1922 It also flags things that need to behave specially in an lvalue context,
1923 such as C<$$x = 5> which might have to vivify a reference in C<$x>.
1929 Perl_op_lvalue_flags(pTHX_ OP *o, I32 type, U32 flags)
1933 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
1936 if (!o || (PL_parser && PL_parser->error_count))
1939 if ((o->op_private & OPpTARGET_MY)
1940 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1945 assert( (o->op_flags & OPf_WANT) != OPf_WANT_VOID );
1947 if (type == OP_PRTF || type == OP_SPRINTF) type = OP_ENTERSUB;
1949 switch (o->op_type) {
1954 if ((o->op_flags & OPf_PARENS) || PL_madskills)
1958 if ((type == OP_UNDEF || type == OP_REFGEN || type == OP_LOCK) &&
1959 !(o->op_flags & OPf_STACKED)) {
1960 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1961 /* Both ENTERSUB and RV2CV use this bit, but for different pur-
1962 poses, so we need it clear. */
1963 o->op_private &= ~1;
1964 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1965 assert(cUNOPo->op_first->op_type == OP_NULL);
1966 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1969 else { /* lvalue subroutine call */
1970 o->op_private |= OPpLVAL_INTRO
1971 |(OPpENTERSUB_INARGS * (type == OP_LEAVESUBLV));
1972 PL_modcount = RETURN_UNLIMITED_NUMBER;
1973 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1974 /* Potential lvalue context: */
1975 o->op_private |= OPpENTERSUB_INARGS;
1978 else { /* Compile-time error message: */
1979 OP *kid = cUNOPo->op_first;
1982 if (kid->op_type != OP_PUSHMARK) {
1983 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1985 "panic: unexpected lvalue entersub "
1986 "args: type/targ %ld:%"UVuf,
1987 (long)kid->op_type, (UV)kid->op_targ);
1988 kid = kLISTOP->op_first;
1990 while (kid->op_sibling)
1991 kid = kid->op_sibling;
1992 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1993 break; /* Postpone until runtime */
1996 kid = kUNOP->op_first;
1997 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1998 kid = kUNOP->op_first;
1999 if (kid->op_type == OP_NULL)
2001 "Unexpected constant lvalue entersub "
2002 "entry via type/targ %ld:%"UVuf,
2003 (long)kid->op_type, (UV)kid->op_targ);
2004 if (kid->op_type != OP_GV) {
2008 cv = GvCV(kGVOP_gv);
2018 if (flags & OP_LVALUE_NO_CROAK) return NULL;
2019 /* grep, foreach, subcalls, refgen */
2020 if (type == OP_GREPSTART || type == OP_ENTERSUB
2021 || type == OP_REFGEN || type == OP_LEAVESUBLV)
2023 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
2024 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
2026 : (o->op_type == OP_ENTERSUB
2027 ? "non-lvalue subroutine call"
2029 type ? PL_op_desc[type] : "local"));
2043 case OP_RIGHT_SHIFT:
2052 if (!(o->op_flags & OPf_STACKED))
2059 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
2060 op_lvalue(kid, type);
2065 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
2066 PL_modcount = RETURN_UNLIMITED_NUMBER;
2067 return o; /* Treat \(@foo) like ordinary list. */
2071 if (scalar_mod_type(o, type))
2073 ref(cUNOPo->op_first, o->op_type);
2077 if (type == OP_LEAVESUBLV)
2078 o->op_private |= OPpMAYBE_LVSUB;
2084 PL_modcount = RETURN_UNLIMITED_NUMBER;
2087 PL_hints |= HINT_BLOCK_SCOPE;
2088 if (type == OP_LEAVESUBLV)
2089 o->op_private |= OPpMAYBE_LVSUB;
2093 ref(cUNOPo->op_first, o->op_type);
2097 PL_hints |= HINT_BLOCK_SCOPE;
2106 case OP_AELEMFAST_LEX:
2113 PL_modcount = RETURN_UNLIMITED_NUMBER;
2114 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
2115 return o; /* Treat \(@foo) like ordinary list. */
2116 if (scalar_mod_type(o, type))
2118 if (type == OP_LEAVESUBLV)
2119 o->op_private |= OPpMAYBE_LVSUB;
2123 if (!type) /* local() */
2124 Perl_croak(aTHX_ "Can't localize lexical variable %"SVf,
2125 PAD_COMPNAME_SV(o->op_targ));
2134 if (type != OP_SASSIGN && type != OP_LEAVESUBLV)
2138 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
2144 if (type == OP_LEAVESUBLV)
2145 o->op_private |= OPpMAYBE_LVSUB;
2146 pad_free(o->op_targ);
2147 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
2148 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
2149 if (o->op_flags & OPf_KIDS)
2150 op_lvalue(cBINOPo->op_first->op_sibling, type);
2155 ref(cBINOPo->op_first, o->op_type);
2156 if (type == OP_ENTERSUB &&
2157 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
2158 o->op_private |= OPpLVAL_DEFER;
2159 if (type == OP_LEAVESUBLV)
2160 o->op_private |= OPpMAYBE_LVSUB;
2170 if (o->op_flags & OPf_KIDS)
2171 op_lvalue(cLISTOPo->op_last, type);
2176 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
2178 else if (!(o->op_flags & OPf_KIDS))
2180 if (o->op_targ != OP_LIST) {
2181 op_lvalue(cBINOPo->op_first, type);
2187 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2188 /* elements might be in void context because the list is
2189 in scalar context or because they are attribute sub calls */
2190 if ( (kid->op_flags & OPf_WANT) != OPf_WANT_VOID )
2191 op_lvalue(kid, type);
2195 if (type != OP_LEAVESUBLV)
2197 break; /* op_lvalue()ing was handled by ck_return() */
2203 /* [20011101.069] File test operators interpret OPf_REF to mean that
2204 their argument is a filehandle; thus \stat(".") should not set
2206 if (type == OP_REFGEN &&
2207 PL_check[o->op_type] == Perl_ck_ftst)
2210 if (type != OP_LEAVESUBLV)
2211 o->op_flags |= OPf_MOD;
2213 if (type == OP_AASSIGN || type == OP_SASSIGN)
2214 o->op_flags |= OPf_SPECIAL|OPf_REF;
2215 else if (!type) { /* local() */
2218 o->op_private |= OPpLVAL_INTRO;
2219 o->op_flags &= ~OPf_SPECIAL;
2220 PL_hints |= HINT_BLOCK_SCOPE;
2225 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
2226 "Useless localization of %s", OP_DESC(o));
2229 else if (type != OP_GREPSTART && type != OP_ENTERSUB
2230 && type != OP_LEAVESUBLV)
2231 o->op_flags |= OPf_REF;
2236 S_scalar_mod_type(const OP *o, I32 type)
2241 if (o && o->op_type == OP_RV2GV)
2265 case OP_RIGHT_SHIFT:
2286 S_is_handle_constructor(const OP *o, I32 numargs)
2288 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
2290 switch (o->op_type) {
2298 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
2311 S_refkids(pTHX_ OP *o, I32 type)
2313 if (o && o->op_flags & OPf_KIDS) {
2315 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2322 Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
2327 PERL_ARGS_ASSERT_DOREF;
2329 if (!o || (PL_parser && PL_parser->error_count))
2332 switch (o->op_type) {
2334 if ((type == OP_EXISTS || type == OP_DEFINED) &&
2335 !(o->op_flags & OPf_STACKED)) {
2336 o->op_type = OP_RV2CV; /* entersub => rv2cv */
2337 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
2338 assert(cUNOPo->op_first->op_type == OP_NULL);
2339 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
2340 o->op_flags |= OPf_SPECIAL;
2341 o->op_private &= ~1;
2343 else if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV){
2344 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2345 : type == OP_RV2HV ? OPpDEREF_HV
2347 o->op_flags |= OPf_MOD;
2353 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
2354 doref(kid, type, set_op_ref);
2357 if (type == OP_DEFINED)
2358 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2359 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2362 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2363 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2364 : type == OP_RV2HV ? OPpDEREF_HV
2366 o->op_flags |= OPf_MOD;
2373 o->op_flags |= OPf_REF;
2376 if (type == OP_DEFINED)
2377 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2378 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2384 o->op_flags |= OPf_REF;
2389 if (!(o->op_flags & OPf_KIDS))
2391 doref(cBINOPo->op_first, type, set_op_ref);
2395 doref(cBINOPo->op_first, o->op_type, set_op_ref);
2396 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2397 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2398 : type == OP_RV2HV ? OPpDEREF_HV
2400 o->op_flags |= OPf_MOD;
2410 if (!(o->op_flags & OPf_KIDS))
2412 doref(cLISTOPo->op_last, type, set_op_ref);
2422 S_dup_attrlist(pTHX_ OP *o)
2427 PERL_ARGS_ASSERT_DUP_ATTRLIST;
2429 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
2430 * where the first kid is OP_PUSHMARK and the remaining ones
2431 * are OP_CONST. We need to push the OP_CONST values.
2433 if (o->op_type == OP_CONST)
2434 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
2436 else if (o->op_type == OP_NULL)
2440 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
2442 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
2443 if (o->op_type == OP_CONST)
2444 rop = op_append_elem(OP_LIST, rop,
2445 newSVOP(OP_CONST, o->op_flags,
2446 SvREFCNT_inc_NN(cSVOPo->op_sv)));
2453 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
2458 PERL_ARGS_ASSERT_APPLY_ATTRS;
2460 /* fake up C<use attributes $pkg,$rv,@attrs> */
2461 ENTER; /* need to protect against side-effects of 'use' */
2462 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2464 #define ATTRSMODULE "attributes"
2465 #define ATTRSMODULE_PM "attributes.pm"
2468 /* Don't force the C<use> if we don't need it. */
2469 SV * const * const svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
2470 if (svp && *svp != &PL_sv_undef)
2471 NOOP; /* already in %INC */
2473 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
2474 newSVpvs(ATTRSMODULE), NULL);
2477 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2478 newSVpvs(ATTRSMODULE),
2480 op_prepend_elem(OP_LIST,
2481 newSVOP(OP_CONST, 0, stashsv),
2482 op_prepend_elem(OP_LIST,
2483 newSVOP(OP_CONST, 0,
2485 dup_attrlist(attrs))));
2491 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
2494 OP *pack, *imop, *arg;
2497 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
2502 assert(target->op_type == OP_PADSV ||
2503 target->op_type == OP_PADHV ||
2504 target->op_type == OP_PADAV);
2506 /* Ensure that attributes.pm is loaded. */
2507 apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE);
2509 /* Need package name for method call. */
2510 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
2512 /* Build up the real arg-list. */
2513 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2515 arg = newOP(OP_PADSV, 0);
2516 arg->op_targ = target->op_targ;
2517 arg = op_prepend_elem(OP_LIST,
2518 newSVOP(OP_CONST, 0, stashsv),
2519 op_prepend_elem(OP_LIST,
2520 newUNOP(OP_REFGEN, 0,
2521 op_lvalue(arg, OP_REFGEN)),
2522 dup_attrlist(attrs)));
2524 /* Fake up a method call to import */
2525 meth = newSVpvs_share("import");
2526 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
2527 op_append_elem(OP_LIST,
2528 op_prepend_elem(OP_LIST, pack, list(arg)),
2529 newSVOP(OP_METHOD_NAMED, 0, meth)));
2531 /* Combine the ops. */
2532 *imopsp = op_append_elem(OP_LIST, *imopsp, imop);
2536 =notfor apidoc apply_attrs_string
2538 Attempts to apply a list of attributes specified by the C<attrstr> and
2539 C<len> arguments to the subroutine identified by the C<cv> argument which
2540 is expected to be associated with the package identified by the C<stashpv>
2541 argument (see L<attributes>). It gets this wrong, though, in that it
2542 does not correctly identify the boundaries of the individual attribute
2543 specifications within C<attrstr>. This is not really intended for the
2544 public API, but has to be listed here for systems such as AIX which
2545 need an explicit export list for symbols. (It's called from XS code
2546 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
2547 to respect attribute syntax properly would be welcome.
2553 Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
2554 const char *attrstr, STRLEN len)
2558 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2561 len = strlen(attrstr);
2565 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2567 const char * const sstr = attrstr;
2568 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2569 attrs = op_append_elem(OP_LIST, attrs,
2570 newSVOP(OP_CONST, 0,
2571 newSVpvn(sstr, attrstr-sstr)));
2575 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2576 newSVpvs(ATTRSMODULE),
2577 NULL, op_prepend_elem(OP_LIST,
2578 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2579 op_prepend_elem(OP_LIST,
2580 newSVOP(OP_CONST, 0,
2581 newRV(MUTABLE_SV(cv))),
2586 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
2590 const bool stately = PL_parser && PL_parser->in_my == KEY_state;
2592 PERL_ARGS_ASSERT_MY_KID;
2594 if (!o || (PL_parser && PL_parser->error_count))
2598 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2599 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2603 if (type == OP_LIST) {
2605 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2606 my_kid(kid, attrs, imopsp);
2608 } else if (type == OP_UNDEF || type == OP_STUB) {
2610 } else if (type == OP_RV2SV || /* "our" declaration */
2612 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
2613 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
2614 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2616 PL_parser->in_my == KEY_our
2618 : PL_parser->in_my == KEY_state ? "state" : "my"));
2620 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
2621 PL_parser->in_my = FALSE;
2622 PL_parser->in_my_stash = NULL;
2623 apply_attrs(GvSTASH(gv),
2624 (type == OP_RV2SV ? GvSV(gv) :
2625 type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) :
2626 type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)),
2629 o->op_private |= OPpOUR_INTRO;
2632 else if (type != OP_PADSV &&
2635 type != OP_PUSHMARK)
2637 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2639 PL_parser->in_my == KEY_our
2641 : PL_parser->in_my == KEY_state ? "state" : "my"));
2644 else if (attrs && type != OP_PUSHMARK) {
2647 PL_parser->in_my = FALSE;
2648 PL_parser->in_my_stash = NULL;
2650 /* check for C<my Dog $spot> when deciding package */
2651 stash = PAD_COMPNAME_TYPE(o->op_targ);
2653 stash = PL_curstash;
2654 apply_attrs_my(stash, o, attrs, imopsp);
2656 o->op_flags |= OPf_MOD;
2657 o->op_private |= OPpLVAL_INTRO;
2659 o->op_private |= OPpPAD_STATE;
2664 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2668 int maybe_scalar = 0;
2670 PERL_ARGS_ASSERT_MY_ATTRS;
2672 /* [perl #17376]: this appears to be premature, and results in code such as
2673 C< our(%x); > executing in list mode rather than void mode */
2675 if (o->op_flags & OPf_PARENS)
2685 o = my_kid(o, attrs, &rops);
2687 if (maybe_scalar && o->op_type == OP_PADSV) {
2688 o = scalar(op_append_list(OP_LIST, rops, o));
2689 o->op_private |= OPpLVAL_INTRO;
2692 /* The listop in rops might have a pushmark at the beginning,
2693 which will mess up list assignment. */
2694 LISTOP * const lrops = (LISTOP *)rops; /* for brevity */
2695 if (rops->op_type == OP_LIST &&
2696 lrops->op_first && lrops->op_first->op_type == OP_PUSHMARK)
2698 OP * const pushmark = lrops->op_first;
2699 lrops->op_first = pushmark->op_sibling;
2702 o = op_append_list(OP_LIST, o, rops);
2705 PL_parser->in_my = FALSE;
2706 PL_parser->in_my_stash = NULL;
2711 Perl_sawparens(pTHX_ OP *o)
2713 PERL_UNUSED_CONTEXT;
2715 o->op_flags |= OPf_PARENS;
2720 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2724 const OPCODE ltype = left->op_type;
2725 const OPCODE rtype = right->op_type;
2727 PERL_ARGS_ASSERT_BIND_MATCH;
2729 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2730 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
2732 const char * const desc
2734 rtype == OP_SUBST || rtype == OP_TRANS
2735 || rtype == OP_TRANSR
2737 ? (int)rtype : OP_MATCH];
2738 const bool isary = ltype == OP_RV2AV || ltype == OP_PADAV;
2741 (ltype == OP_RV2AV || ltype == OP_RV2HV)
2742 ? cUNOPx(left)->op_first->op_type == OP_GV
2743 && (gv = cGVOPx_gv(cUNOPx(left)->op_first))
2744 ? varname(gv, isary ? '@' : '%', 0, NULL, 0, 1)
2747 (GV *)PL_compcv, isary ? '@' : '%', left->op_targ, NULL, 0, 1
2750 Perl_warner(aTHX_ packWARN(WARN_MISC),
2751 "Applying %s to %"SVf" will act on scalar(%"SVf")",
2754 const char * const sample = (isary
2755 ? "@array" : "%hash");
2756 Perl_warner(aTHX_ packWARN(WARN_MISC),
2757 "Applying %s to %s will act on scalar(%s)",
2758 desc, sample, sample);
2762 if (rtype == OP_CONST &&
2763 cSVOPx(right)->op_private & OPpCONST_BARE &&
2764 cSVOPx(right)->op_private & OPpCONST_STRICT)
2766 no_bareword_allowed(right);
2769 /* !~ doesn't make sense with /r, so error on it for now */
2770 if (rtype == OP_SUBST && (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT) &&
2772 yyerror("Using !~ with s///r doesn't make sense");
2773 if (rtype == OP_TRANSR && type == OP_NOT)
2774 yyerror("Using !~ with tr///r doesn't make sense");
2776 ismatchop = (rtype == OP_MATCH ||
2777 rtype == OP_SUBST ||
2778 rtype == OP_TRANS || rtype == OP_TRANSR)
2779 && !(right->op_flags & OPf_SPECIAL);
2780 if (ismatchop && right->op_private & OPpTARGET_MY) {
2782 right->op_private &= ~OPpTARGET_MY;
2784 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
2787 right->op_flags |= OPf_STACKED;
2788 if (rtype != OP_MATCH && rtype != OP_TRANSR &&
2789 ! (rtype == OP_TRANS &&
2790 right->op_private & OPpTRANS_IDENTICAL) &&
2791 ! (rtype == OP_SUBST &&
2792 (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT)))
2793 newleft = op_lvalue(left, rtype);
2796 if (right->op_type == OP_TRANS || right->op_type == OP_TRANSR)
2797 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
2799 o = op_prepend_elem(rtype, scalar(newleft), right);
2801 return newUNOP(OP_NOT, 0, scalar(o));
2805 return bind_match(type, left,
2806 pmruntime(newPMOP(OP_MATCH, 0), right, 0, 0));
2810 Perl_invert(pTHX_ OP *o)
2814 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2818 =for apidoc Amx|OP *|op_scope|OP *o
2820 Wraps up an op tree with some additional ops so that at runtime a dynamic
2821 scope will be created. The original ops run in the new dynamic scope,
2822 and then, provided that they exit normally, the scope will be unwound.
2823 The additional ops used to create and unwind the dynamic scope will
2824 normally be an C<enter>/C<leave> pair, but a C<scope> op may be used
2825 instead if the ops are simple enough to not need the full dynamic scope
2832 Perl_op_scope(pTHX_ OP *o)
2836 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2837 o = op_prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2838 o->op_type = OP_LEAVE;
2839 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2841 else if (o->op_type == OP_LINESEQ) {
2843 o->op_type = OP_SCOPE;
2844 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2845 kid = ((LISTOP*)o)->op_first;
2846 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2849 /* The following deals with things like 'do {1 for 1}' */
2850 kid = kid->op_sibling;
2852 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
2857 o = newLISTOP(OP_SCOPE, 0, o, NULL);
2863 Perl_op_unscope(pTHX_ OP *o)
2865 if (o && o->op_type == OP_LINESEQ) {
2866 OP *kid = cLISTOPo->op_first;
2867 for(; kid; kid = kid->op_sibling)
2868 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
2875 Perl_block_start(pTHX_ int full)
2878 const int retval = PL_savestack_ix;
2880 pad_block_start(full);
2882 PL_hints &= ~HINT_BLOCK_SCOPE;
2883 SAVECOMPILEWARNINGS();
2884 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
2886 CALL_BLOCK_HOOKS(bhk_start, full);
2892 Perl_block_end(pTHX_ I32 floor, OP *seq)
2895 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2896 OP* retval = scalarseq(seq);
2898 CALL_BLOCK_HOOKS(bhk_pre_end, &retval);
2901 CopHINTS_set(&PL_compiling, PL_hints);
2903 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2906 CALL_BLOCK_HOOKS(bhk_post_end, &retval);
2912 =head1 Compile-time scope hooks
2914 =for apidoc Aox||blockhook_register
2916 Register a set of hooks to be called when the Perl lexical scope changes
2917 at compile time. See L<perlguts/"Compile-time scope hooks">.
2923 Perl_blockhook_register(pTHX_ BHK *hk)
2925 PERL_ARGS_ASSERT_BLOCKHOOK_REGISTER;
2927 Perl_av_create_and_push(aTHX_ &PL_blockhooks, newSViv(PTR2IV(hk)));
2934 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
2935 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
2936 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2939 OP * const o = newOP(OP_PADSV, 0);
2940 o->op_targ = offset;
2946 Perl_newPROG(pTHX_ OP *o)
2950 PERL_ARGS_ASSERT_NEWPROG;
2957 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2958 ((PL_in_eval & EVAL_KEEPERR)
2959 ? OPf_SPECIAL : 0), o);
2961 cx = &cxstack[cxstack_ix];
2962 assert(CxTYPE(cx) == CXt_EVAL);
2964 if ((cx->blk_gimme & G_WANT) == G_VOID)
2965 scalarvoid(PL_eval_root);
2966 else if ((cx->blk_gimme & G_WANT) == G_ARRAY)
2969 scalar(PL_eval_root);
2971 PL_eval_start = op_linklist(PL_eval_root);
2972 PL_eval_root->op_private |= OPpREFCOUNTED;
2973 OpREFCNT_set(PL_eval_root, 1);
2974 PL_eval_root->op_next = 0;
2975 i = PL_savestack_ix;
2978 CALL_PEEP(PL_eval_start);
2979 finalize_optree(PL_eval_root);
2981 PL_savestack_ix = i;
2984 if (o->op_type == OP_STUB) {
2985 /* This block is entered if nothing is compiled for the main
2986 program. This will be the case for an genuinely empty main
2987 program, or one which only has BEGIN blocks etc, so already
2990 Historically (5.000) the guard above was !o. However, commit
2991 f8a08f7b8bd67b28 (Jun 2001), integrated to blead as
2992 c71fccf11fde0068, changed perly.y so that newPROG() is now
2993 called with the output of block_end(), which returns a new
2994 OP_STUB for the case of an empty optree. ByteLoader (and
2995 maybe other things) also take this path, because they set up
2996 PL_main_start and PL_main_root directly, without generating an
3000 PL_comppad_name = 0;
3002 S_op_destroy(aTHX_ o);
3005 PL_main_root = op_scope(sawparens(scalarvoid(o)));
3006 PL_curcop = &PL_compiling;
3007 PL_main_start = LINKLIST(PL_main_root);
3008 PL_main_root->op_private |= OPpREFCOUNTED;
3009 OpREFCNT_set(PL_main_root, 1);
3010 PL_main_root->op_next = 0;
3011 CALL_PEEP(PL_main_start);
3012 finalize_optree(PL_main_root);
3013 cv_forget_slab(PL_compcv);
3016 /* Register with debugger */
3018 CV * const cv = get_cvs("DB::postponed", 0);
3022 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
3024 call_sv(MUTABLE_SV(cv), G_DISCARD);
3031 Perl_localize(pTHX_ OP *o, I32 lex)
3035 PERL_ARGS_ASSERT_LOCALIZE;
3037 if (o->op_flags & OPf_PARENS)
3038 /* [perl #17376]: this appears to be premature, and results in code such as
3039 C< our(%x); > executing in list mode rather than void mode */
3046 if ( PL_parser->bufptr > PL_parser->oldbufptr
3047 && PL_parser->bufptr[-1] == ','
3048 && ckWARN(WARN_PARENTHESIS))
3050 char *s = PL_parser->bufptr;
3053 /* some heuristics to detect a potential error */
3054 while (*s && (strchr(", \t\n", *s)))
3058 if (*s && strchr("@$%*", *s) && *++s
3059 && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) {
3062 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)))
3064 while (*s && (strchr(", \t\n", *s)))
3070 if (sigil && (*s == ';' || *s == '=')) {
3071 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
3072 "Parentheses missing around \"%s\" list",
3074 ? (PL_parser->in_my == KEY_our
3076 : PL_parser->in_my == KEY_state
3086 o = op_lvalue(o, OP_NULL); /* a bit kludgey */
3087 PL_parser->in_my = FALSE;
3088 PL_parser->in_my_stash = NULL;
3093 Perl_jmaybe(pTHX_ OP *o)
3095 PERL_ARGS_ASSERT_JMAYBE;
3097 if (o->op_type == OP_LIST) {
3099 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
3100 o = convert(OP_JOIN, 0, op_prepend_elem(OP_LIST, o2, o));
3105 PERL_STATIC_INLINE OP *
3106 S_op_std_init(pTHX_ OP *o)
3108 I32 type = o->op_type;
3110 PERL_ARGS_ASSERT_OP_STD_INIT;
3112 if (PL_opargs[type] & OA_RETSCALAR)
3114 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
3115 o->op_targ = pad_alloc(type, SVs_PADTMP);
3120 PERL_STATIC_INLINE OP *
3121 S_op_integerize(pTHX_ OP *o)
3123 I32 type = o->op_type;
3125 PERL_ARGS_ASSERT_OP_INTEGERIZE;
3127 /* integerize op. */
3128 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
3131 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
3134 if (type == OP_NEGATE)
3135 /* XXX might want a ck_negate() for this */
3136 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
3142 S_fold_constants(pTHX_ register OP *o)
3147 VOL I32 type = o->op_type;
3152 SV * const oldwarnhook = PL_warnhook;
3153 SV * const olddiehook = PL_diehook;
3157 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
3159 if (!(PL_opargs[type] & OA_FOLDCONST))
3173 /* XXX what about the numeric ops? */
3174 if (IN_LOCALE_COMPILETIME)
3178 if (!cLISTOPo->op_first->op_sibling
3179 || cLISTOPo->op_first->op_sibling->op_type != OP_CONST)
3182 SV * const sv = cSVOPx_sv(cLISTOPo->op_first->op_sibling);
3183 if (!SvPOK(sv) || SvGMAGICAL(sv)) goto nope;
3185 const char *s = SvPVX_const(sv);
3186 while (s < SvEND(sv)) {
3187 if (*s == 'p' || *s == 'P') goto nope;
3194 if (o->op_private & OPpREPEAT_DOLIST) goto nope;
3197 if (PL_parser && PL_parser->error_count)
3198 goto nope; /* Don't try to run w/ errors */
3200 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3201 const OPCODE type = curop->op_type;
3202 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
3204 type != OP_SCALAR &&
3206 type != OP_PUSHMARK)
3212 curop = LINKLIST(o);
3213 old_next = o->op_next;
3217 oldscope = PL_scopestack_ix;
3218 create_eval_scope(G_FAKINGEVAL);
3220 /* Verify that we don't need to save it: */
3221 assert(PL_curcop == &PL_compiling);
3222 StructCopy(&PL_compiling, ¬_compiling, COP);
3223 PL_curcop = ¬_compiling;
3224 /* The above ensures that we run with all the correct hints of the
3225 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
3226 assert(IN_PERL_RUNTIME);
3227 PL_warnhook = PERL_WARNHOOK_FATAL;
3234 sv = *(PL_stack_sp--);
3235 if (o->op_targ && sv == PAD_SV(o->op_targ)) { /* grab pad temp? */
3237 /* Can't simply swipe the SV from the pad, because that relies on
3238 the op being freed "real soon now". Under MAD, this doesn't
3239 happen (see the #ifdef below). */
3242 pad_swipe(o->op_targ, FALSE);
3245 else if (SvTEMP(sv)) { /* grab mortal temp? */
3246 SvREFCNT_inc_simple_void(sv);
3251 /* Something tried to die. Abandon constant folding. */
3252 /* Pretend the error never happened. */
3254 o->op_next = old_next;
3258 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
3259 PL_warnhook = oldwarnhook;
3260 PL_diehook = olddiehook;
3261 /* XXX note that this croak may fail as we've already blown away
3262 * the stack - eg any nested evals */
3263 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
3266 PL_warnhook = oldwarnhook;
3267 PL_diehook = olddiehook;
3268 PL_curcop = &PL_compiling;
3270 if (PL_scopestack_ix > oldscope)
3271 delete_eval_scope();
3280 if (type == OP_RV2GV)
3281 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
3283 newop = newSVOP(OP_CONST, OPpCONST_FOLDED<<8, MUTABLE_SV(sv));
3284 op_getmad(o,newop,'f');
3292 S_gen_constant_list(pTHX_ register OP *o)
3296 const I32 oldtmps_floor = PL_tmps_floor;
3299 if (PL_parser && PL_parser->error_count)
3300 return o; /* Don't attempt to run with errors */
3302 PL_op = curop = LINKLIST(o);
3305 Perl_pp_pushmark(aTHX);
3308 assert (!(curop->op_flags & OPf_SPECIAL));
3309 assert(curop->op_type == OP_RANGE);
3310 Perl_pp_anonlist(aTHX);
3311 PL_tmps_floor = oldtmps_floor;
3313 o->op_type = OP_RV2AV;
3314 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
3315 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
3316 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
3317 o->op_opt = 0; /* needs to be revisited in rpeep() */
3318 curop = ((UNOP*)o)->op_first;
3319 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
3321 op_getmad(curop,o,'O');
3330 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
3333 if (type < 0) type = -type, flags |= OPf_SPECIAL;
3334 if (!o || o->op_type != OP_LIST)
3335 o = newLISTOP(OP_LIST, 0, o, NULL);
3337 o->op_flags &= ~OPf_WANT;
3339 if (!(PL_opargs[type] & OA_MARK))
3340 op_null(cLISTOPo->op_first);
3342 OP * const kid2 = cLISTOPo->op_first->op_sibling;
3343 if (kid2 && kid2->op_type == OP_COREARGS) {
3344 op_null(cLISTOPo->op_first);
3345 kid2->op_private |= OPpCOREARGS_PUSHMARK;
3349 o->op_type = (OPCODE)type;
3350 o->op_ppaddr = PL_ppaddr[type];
3351 o->op_flags |= flags;
3353 o = CHECKOP(type, o);
3354 if (o->op_type != (unsigned)type)
3357 return fold_constants(op_integerize(op_std_init(o)));
3361 =head1 Optree Manipulation Functions
3364 /* List constructors */
3367 =for apidoc Am|OP *|op_append_elem|I32 optype|OP *first|OP *last
3369 Append an item to the list of ops contained directly within a list-type
3370 op, returning the lengthened list. I<first> is the list-type op,
3371 and I<last> is the op to append to the list. I<optype> specifies the
3372 intended opcode for the list. If I<first> is not already a list of the
3373 right type, it will be upgraded into one. If either I<first> or I<last>
3374 is null, the other is returned unchanged.
3380 Perl_op_append_elem(pTHX_ I32 type, OP *first, OP *last)
3388 if (first->op_type != (unsigned)type
3389 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
3391 return newLISTOP(type, 0, first, last);
3394 if (first->op_flags & OPf_KIDS)
3395 ((LISTOP*)first)->op_last->op_sibling = last;
3397 first->op_flags |= OPf_KIDS;
3398 ((LISTOP*)first)->op_first = last;
3400 ((LISTOP*)first)->op_last = last;
3405 =for apidoc Am|OP *|op_append_list|I32 optype|OP *first|OP *last
3407 Concatenate the lists of ops contained directly within two list-type ops,
3408 returning the combined list. I<first> and I<last> are the list-type ops
3409 to concatenate. I<optype> specifies the intended opcode for the list.
3410 If either I<first> or I<last> is not already a list of the right type,
3411 it will be upgraded into one. If either I<first> or I<last> is null,
3412 the other is returned unchanged.
3418 Perl_op_append_list(pTHX_ I32 type, OP *first, OP *last)
3426 if (first->op_type != (unsigned)type)
3427 return op_prepend_elem(type, first, last);
3429 if (last->op_type != (unsigned)type)
3430 return op_append_elem(type, first, last);
3432 ((LISTOP*)first)->op_last->op_sibling = ((LISTOP*)last)->op_first;
3433 ((LISTOP*)first)->op_last = ((LISTOP*)last)->op_last;
3434 first->op_flags |= (last->op_flags & OPf_KIDS);
3437 if (((LISTOP*)last)->op_first && first->op_madprop) {
3438 MADPROP *mp = ((LISTOP*)last)->op_first->op_madprop;
3440 while (mp->mad_next)
3442 mp->mad_next = first->op_madprop;
3445 ((LISTOP*)last)->op_first->op_madprop = first->op_madprop;
3448 first->op_madprop = last->op_madprop;
3449 last->op_madprop = 0;
3452 S_op_destroy(aTHX_ last);
3458 =for apidoc Am|OP *|op_prepend_elem|I32 optype|OP *first|OP *last
3460 Prepend an item to the list of ops contained directly within a list-type
3461 op, returning the lengthened list. I<first> is the op to prepend to the
3462 list, and I<last> is the list-type op. I<optype> specifies the intended
3463 opcode for the list. If I<last> is not already a list of the right type,
3464 it will be upgraded into one. If either I<first> or I<last> is null,
3465 the other is returned unchanged.
3471 Perl_op_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
3479 if (last->op_type == (unsigned)type) {
3480 if (type == OP_LIST) { /* already a PUSHMARK there */
3481 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
3482 ((LISTOP*)last)->op_first->op_sibling = first;
3483 if (!(first->op_flags & OPf_PARENS))
3484 last->op_flags &= ~OPf_PARENS;
3487 if (!(last->op_flags & OPf_KIDS)) {
3488 ((LISTOP*)last)->op_last = first;
3489 last->op_flags |= OPf_KIDS;
3491 first->op_sibling = ((LISTOP*)last)->op_first;
3492 ((LISTOP*)last)->op_first = first;
3494 last->op_flags |= OPf_KIDS;
3498 return newLISTOP(type, 0, first, last);
3506 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
3509 Newxz(tk, 1, TOKEN);
3510 tk->tk_type = (OPCODE)optype;
3511 tk->tk_type = 12345;
3513 tk->tk_mad = madprop;
3518 Perl_token_free(pTHX_ TOKEN* tk)
3520 PERL_ARGS_ASSERT_TOKEN_FREE;
3522 if (tk->tk_type != 12345)
3524 mad_free(tk->tk_mad);
3529 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
3534 PERL_ARGS_ASSERT_TOKEN_GETMAD;
3536 if (tk->tk_type != 12345) {
3537 Perl_warner(aTHX_ packWARN(WARN_MISC),
3538 "Invalid TOKEN object ignored");
3545 /* faked up qw list? */
3547 tm->mad_type == MAD_SV &&
3548 SvPVX((SV *)tm->mad_val)[0] == 'q')
3555 /* pretend constant fold didn't happen? */
3556 if (mp->mad_key == 'f' &&
3557 (o->op_type == OP_CONST ||
3558 o->op_type == OP_GV) )
3560 token_getmad(tk,(OP*)mp->mad_val,slot);
3574 if (mp->mad_key == 'X')
3575 mp->mad_key = slot; /* just change the first one */
3585 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
3594 /* pretend constant fold didn't happen? */
3595 if (mp->mad_key == 'f' &&
3596 (o->op_type == OP_CONST ||
3597 o->op_type == OP_GV) )
3599 op_getmad(from,(OP*)mp->mad_val,slot);
3606 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
3609 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
3615 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
3624 /* pretend constant fold didn't happen? */
3625 if (mp->mad_key == 'f' &&
3626 (o->op_type == OP_CONST ||
3627 o->op_type == OP_GV) )
3629 op_getmad(from,(OP*)mp->mad_val,slot);
3636 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
3639 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
3643 PerlIO_printf(PerlIO_stderr(),
3644 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
3650 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
3668 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
3672 addmad(tm, &(o->op_madprop), slot);
3676 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
3697 Perl_newMADsv(pTHX_ char key, SV* sv)
3699 PERL_ARGS_ASSERT_NEWMADSV;
3701 return newMADPROP(key, MAD_SV, sv, 0);
3705 Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
3707 MADPROP *const mp = (MADPROP *) PerlMemShared_malloc(sizeof(MADPROP));
3710 mp->mad_vlen = vlen;
3711 mp->mad_type = type;
3713 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
3718 Perl_mad_free(pTHX_ MADPROP* mp)
3720 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
3724 mad_free(mp->mad_next);
3725 /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
3726 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
3727 switch (mp->mad_type) {
3731 Safefree((char*)mp->mad_val);
3734 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
3735 op_free((OP*)mp->mad_val);
3738 sv_free(MUTABLE_SV(mp->mad_val));
3741 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
3744 PerlMemShared_free(mp);
3750 =head1 Optree construction
3752 =for apidoc Am|OP *|newNULLLIST
3754 Constructs, checks, and returns a new C<stub> op, which represents an
3755 empty list expression.
3761 Perl_newNULLLIST(pTHX)
3763 return newOP(OP_STUB, 0);
3767 S_force_list(pTHX_ OP *o)
3769 if (!o || o->op_type != OP_LIST)
3770 o = newLISTOP(OP_LIST, 0, o, NULL);
3776 =for apidoc Am|OP *|newLISTOP|I32 type|I32 flags|OP *first|OP *last
3778 Constructs, checks, and returns an op of any list type. I<type> is
3779 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3780 C<OPf_KIDS> will be set automatically if required. I<first> and I<last>
3781 supply up to two ops to be direct children of the list op; they are
3782 consumed by this function and become part of the constructed op tree.
3788 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3793 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP);
3795 NewOp(1101, listop, 1, LISTOP);
3797 listop->op_type = (OPCODE)type;
3798 listop->op_ppaddr = PL_ppaddr[type];
3801 listop->op_flags = (U8)flags;
3805 else if (!first && last)
3808 first->op_sibling = last;
3809 listop->op_first = first;
3810 listop->op_last = last;
3811 if (type == OP_LIST) {
3812 OP* const pushop = newOP(OP_PUSHMARK, 0);
3813 pushop->op_sibling = first;
3814 listop->op_first = pushop;
3815 listop->op_flags |= OPf_KIDS;
3817 listop->op_last = pushop;
3820 return CHECKOP(type, listop);
3824 =for apidoc Am|OP *|newOP|I32 type|I32 flags
3826 Constructs, checks, and returns an op of any base type (any type that
3827 has no extra fields). I<type> is the opcode. I<flags> gives the
3828 eight bits of C<op_flags>, and, shifted up eight bits, the eight bits
3835 Perl_newOP(pTHX_ I32 type, I32 flags)
3840 if (type == -OP_ENTEREVAL) {
3841 type = OP_ENTEREVAL;
3842 flags |= OPpEVAL_BYTES<<8;
3845 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP
3846 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3847 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3848 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
3850 NewOp(1101, o, 1, OP);
3851 o->op_type = (OPCODE)type;
3852 o->op_ppaddr = PL_ppaddr[type];
3853 o->op_flags = (U8)flags;
3856 o->op_private = (U8)(0 | (flags >> 8));
3857 if (PL_opargs[type] & OA_RETSCALAR)
3859 if (PL_opargs[type] & OA_TARGET)
3860 o->op_targ = pad_alloc(type, SVs_PADTMP);
3861 return CHECKOP(type, o);
3865 =for apidoc Am|OP *|newUNOP|I32 type|I32 flags|OP *first
3867 Constructs, checks, and returns an op of any unary type. I<type> is
3868 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3869 C<OPf_KIDS> will be set automatically if required, and, shifted up eight
3870 bits, the eight bits of C<op_private>, except that the bit with value 1
3871 is automatically set. I<first> supplies an optional op to be the direct
3872 child of the unary op; it is consumed by this function and become part
3873 of the constructed op tree.
3879 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
3884 if (type == -OP_ENTEREVAL) {
3885 type = OP_ENTEREVAL;
3886 flags |= OPpEVAL_BYTES<<8;
3889 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP
3890 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3891 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3892 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP
3893 || type == OP_SASSIGN
3894 || type == OP_ENTERTRY
3895 || type == OP_NULL );
3898 first = newOP(OP_STUB, 0);
3899 if (PL_opargs[type] & OA_MARK)
3900 first = force_list(first);
3902 NewOp(1101, unop, 1, UNOP);
3903 unop->op_type = (OPCODE)type;
3904 unop->op_ppaddr = PL_ppaddr[type];
3905 unop->op_first = first;
3906 unop->op_flags = (U8)(flags | OPf_KIDS);
3907 unop->op_private = (U8)(1 | (flags >> 8));
3908 unop = (UNOP*) CHECKOP(type, unop);
3912 return fold_constants(op_integerize(op_std_init((OP *) unop)));
3916 =for apidoc Am|OP *|newBINOP|I32 type|I32 flags|OP *first|OP *last
3918 Constructs, checks, and returns an op of any binary type. I<type>
3919 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
3920 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
3921 the eight bits of C<op_private>, except that the bit with value 1 or
3922 2 is automatically set as required. I<first> and I<last> supply up to
3923 two ops to be the direct children of the binary op; they are consumed
3924 by this function and become part of the constructed op tree.
3930 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3935 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP
3936 || type == OP_SASSIGN || type == OP_NULL );
3938 NewOp(1101, binop, 1, BINOP);
3941 first = newOP(OP_NULL, 0);
3943 binop->op_type = (OPCODE)type;
3944 binop->op_ppaddr = PL_ppaddr[type];
3945 binop->op_first = first;
3946 binop->op_flags = (U8)(flags | OPf_KIDS);
3949 binop->op_private = (U8)(1 | (flags >> 8));
3952 binop->op_private = (U8)(2 | (flags >> 8));
3953 first->op_sibling = last;
3956 binop = (BINOP*)CHECKOP(type, binop);
3957 if (binop->op_next || binop->op_type != (OPCODE)type)
3960 binop->op_last = binop->op_first->op_sibling;
3962 return fold_constants(op_integerize(op_std_init((OP *)binop)));
3965 static int uvcompare(const void *a, const void *b)
3966 __attribute__nonnull__(1)
3967 __attribute__nonnull__(2)
3968 __attribute__pure__;
3969 static int uvcompare(const void *a, const void *b)
3971 if (*((const UV *)a) < (*(const UV *)b))
3973 if (*((const UV *)a) > (*(const UV *)b))
3975 if (*((const UV *)a+1) < (*(const UV *)b+1))
3977 if (*((const UV *)a+1) > (*(const UV *)b+1))
3983 S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
3986 SV * const tstr = ((SVOP*)expr)->op_sv;
3989 (repl->op_type == OP_NULL)
3990 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
3992 ((SVOP*)repl)->op_sv;
3995 const U8 *t = (U8*)SvPV_const(tstr, tlen);
3996 const U8 *r = (U8*)SvPV_const(rstr, rlen);
4002 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
4003 const I32 squash = o->op_private & OPpTRANS_SQUASH;
4004 I32 del = o->op_private & OPpTRANS_DELETE;
4007 PERL_ARGS_ASSERT_PMTRANS;
4009 PL_hints |= HINT_BLOCK_SCOPE;
4012 o->op_private |= OPpTRANS_FROM_UTF;
4015 o->op_private |= OPpTRANS_TO_UTF;
4017 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
4018 SV* const listsv = newSVpvs("# comment\n");
4020 const U8* tend = t + tlen;
4021 const U8* rend = r + rlen;
4035 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
4036 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
4039 const U32 flags = UTF8_ALLOW_DEFAULT;
4043 t = tsave = bytes_to_utf8(t, &len);
4046 if (!to_utf && rlen) {
4048 r = rsave = bytes_to_utf8(r, &len);
4052 /* There are several snags with this code on EBCDIC:
4053 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
4054 2. scan_const() in toke.c has encoded chars in native encoding which makes
4055 ranges at least in EBCDIC 0..255 range the bottom odd.
4059 U8 tmpbuf[UTF8_MAXBYTES+1];
4062 Newx(cp, 2*tlen, UV);
4064 transv = newSVpvs("");
4066 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
4068 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
4070 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
4074 cp[2*i+1] = cp[2*i];
4078 qsort(cp, i, 2*sizeof(UV), uvcompare);
4079 for (j = 0; j < i; j++) {
4081 diff = val - nextmin;
4083 t = uvuni_to_utf8(tmpbuf,nextmin);
4084 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4086 U8 range_mark = UTF_TO_NATIVE(0xff);
4087 t = uvuni_to_utf8(tmpbuf, val - 1);
4088 sv_catpvn(transv, (char *)&range_mark, 1);
4089 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4096 t = uvuni_to_utf8(tmpbuf,nextmin);
4097 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4099 U8 range_mark = UTF_TO_NATIVE(0xff);
4100 sv_catpvn(transv, (char *)&range_mark, 1);
4102 t = uvuni_to_utf8(tmpbuf, 0x7fffffff);
4103 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4104 t = (const U8*)SvPVX_const(transv);
4105 tlen = SvCUR(transv);
4109 else if (!rlen && !del) {
4110 r = t; rlen = tlen; rend = tend;
4113 if ((!rlen && !del) || t == r ||
4114 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
4116 o->op_private |= OPpTRANS_IDENTICAL;
4120 while (t < tend || tfirst <= tlast) {
4121 /* see if we need more "t" chars */
4122 if (tfirst > tlast) {
4123 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
4125 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
4127 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
4134 /* now see if we need more "r" chars */
4135 if (rfirst > rlast) {
4137 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
4139 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
4141 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
4150 rfirst = rlast = 0xffffffff;
4154 /* now see which range will peter our first, if either. */
4155 tdiff = tlast - tfirst;
4156 rdiff = rlast - rfirst;
4163 if (rfirst == 0xffffffff) {
4164 diff = tdiff; /* oops, pretend rdiff is infinite */
4166 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
4167 (long)tfirst, (long)tlast);
4169 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
4173 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
4174 (long)tfirst, (long)(tfirst + diff),
4177 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
4178 (long)tfirst, (long)rfirst);
4180 if (rfirst + diff > max)
4181 max = rfirst + diff;
4183 grows = (tfirst < rfirst &&
4184 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
4196 else if (max > 0xff)
4201 swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none));
4203 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP);
4204 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
4205 PAD_SETSV(cPADOPo->op_padix, swash);
4207 SvREADONLY_on(swash);
4209 cSVOPo->op_sv = swash;
4211 SvREFCNT_dec(listsv);
4212 SvREFCNT_dec(transv);
4214 if (!del && havefinal && rlen)
4215 (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5,
4216 newSVuv((UV)final), 0);
4219 o->op_private |= OPpTRANS_GROWS;
4225 op_getmad(expr,o,'e');
4226 op_getmad(repl,o,'r');
4234 tbl = (short*)PerlMemShared_calloc(
4235 (o->op_private & OPpTRANS_COMPLEMENT) &&
4236 !(o->op_private & OPpTRANS_DELETE) ? 258 : 256,
4238 cPVOPo->op_pv = (char*)tbl;
4240 for (i = 0; i < (I32)tlen; i++)
4242 for (i = 0, j = 0; i < 256; i++) {
4244 if (j >= (I32)rlen) {
4253 if (i < 128 && r[j] >= 128)
4263 o->op_private |= OPpTRANS_IDENTICAL;
4265 else if (j >= (I32)rlen)
4270 PerlMemShared_realloc(tbl,
4271 (0x101+rlen-j) * sizeof(short));
4272 cPVOPo->op_pv = (char*)tbl;
4274 tbl[0x100] = (short)(rlen - j);
4275 for (i=0; i < (I32)rlen - j; i++)
4276 tbl[0x101+i] = r[j+i];
4280 if (!rlen && !del) {
4283 o->op_private |= OPpTRANS_IDENTICAL;
4285 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
4286 o->op_private |= OPpTRANS_IDENTICAL;
4288 for (i = 0; i < 256; i++)
4290 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
4291 if (j >= (I32)rlen) {
4293 if (tbl[t[i]] == -1)
4299 if (tbl[t[i]] == -1) {
4300 if (t[i] < 128 && r[j] >= 128)
4307 if(del && rlen == tlen) {
4308 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator");
4309 } else if(rlen > tlen) {
4310 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list");
4314 o->op_private |= OPpTRANS_GROWS;
4316 op_getmad(expr,o,'e');
4317 op_getmad(repl,o,'r');
4327 =for apidoc Am|OP *|newPMOP|I32 type|I32 flags
4329 Constructs, checks, and returns an op of any pattern matching type.
4330 I<type> is the opcode. I<flags> gives the eight bits of C<op_flags>
4331 and, shifted up eight bits, the eight bits of C<op_private>.
4337 Perl_newPMOP(pTHX_ I32 type, I32 flags)
4342 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PMOP);
4344 NewOp(1101, pmop, 1, PMOP);
4345 pmop->op_type = (OPCODE)type;
4346 pmop->op_ppaddr = PL_ppaddr[type];
4347 pmop->op_flags = (U8)flags;
4348 pmop->op_private = (U8)(0 | (flags >> 8));
4350 if (PL_hints & HINT_RE_TAINT)
4351 pmop->op_pmflags |= PMf_RETAINT;
4352 if (IN_LOCALE_COMPILETIME) {
4353 set_regex_charset(&(pmop->op_pmflags), REGEX_LOCALE_CHARSET);
4355 else if ((! (PL_hints & HINT_BYTES))
4356 /* Both UNI_8_BIT and locale :not_characters imply Unicode */
4357 && (PL_hints & (HINT_UNI_8_BIT|HINT_LOCALE_NOT_CHARS)))
4359 set_regex_charset(&(pmop->op_pmflags), REGEX_UNICODE_CHARSET);
4361 if (PL_hints & HINT_RE_FLAGS) {
4362 SV *reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4363 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags"), 0, 0
4365 if (reflags && SvOK(reflags)) pmop->op_pmflags |= SvIV(reflags);
4366 reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4367 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags_charset"), 0, 0
4369 if (reflags && SvOK(reflags)) {
4370 set_regex_charset(&(pmop->op_pmflags), (regex_charset)SvIV(reflags));
4376 assert(SvPOK(PL_regex_pad[0]));
4377 if (SvCUR(PL_regex_pad[0])) {
4378 /* Pop off the "packed" IV from the end. */
4379 SV *const repointer_list = PL_regex_pad[0];
4380 const char *p = SvEND(repointer_list) - sizeof(IV);
4381 const IV offset = *((IV*)p);
4383 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
4385 SvEND_set(repointer_list, p);
4387 pmop->op_pmoffset = offset;
4388 /* This slot should be free, so assert this: */
4389 assert(PL_regex_pad[offset] == &PL_sv_undef);
4391 SV * const repointer = &PL_sv_undef;
4392 av_push(PL_regex_padav, repointer);
4393 pmop->op_pmoffset = av_len(PL_regex_padav);
4394 PL_regex_pad = AvARRAY(PL_regex_padav);
4398 return CHECKOP(type, pmop);
4401 /* Given some sort of match op o, and an expression expr containing a
4402 * pattern, either compile expr into a regex and attach it to o (if it's
4403 * constant), or convert expr into a runtime regcomp op sequence (if it's
4406 * isreg indicates that the pattern is part of a regex construct, eg
4407 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
4408 * split "pattern", which aren't. In the former case, expr will be a list
4409 * if the pattern contains more than one term (eg /a$b/) or if it contains
4410 * a replacement, ie s/// or tr///.
4412 * When the pattern has been compiled within a new anon CV (for
4413 * qr/(?{...})/ ), then floor indicates the savestack level just before
4414 * the new sub was created
4418 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg, I32 floor)
4423 I32 repl_has_vars = 0;
4425 bool is_trans = (o->op_type == OP_TRANS || o->op_type == OP_TRANSR);
4426 bool is_compiletime;
4429 PERL_ARGS_ASSERT_PMRUNTIME;
4431 /* for s/// and tr///, last element in list is the replacement; pop it */
4433 if (is_trans || o->op_type == OP_SUBST) {
4435 repl = cLISTOPx(expr)->op_last;
4436 kid = cLISTOPx(expr)->op_first;
4437 while (kid->op_sibling != repl)
4438 kid = kid->op_sibling;
4439 kid->op_sibling = NULL;
4440 cLISTOPx(expr)->op_last = kid;
4443 /* for TRANS, convert LIST/PUSH/CONST into CONST, and pass to pmtrans() */
4446 OP* const oe = expr;
4447 assert(expr->op_type == OP_LIST);
4448 assert(cLISTOPx(expr)->op_first->op_type == OP_PUSHMARK);
4449 assert(cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last);
4450 expr = cLISTOPx(oe)->op_last;
4451 cLISTOPx(oe)->op_first->op_sibling = NULL;
4452 cLISTOPx(oe)->op_last = NULL;
4455 return pmtrans(o, expr, repl);
4458 /* find whether we have any runtime or code elements;
4459 * at the same time, temporarily set the op_next of each DO block;
4460 * then when we LINKLIST, this will cause the DO blocks to be excluded
4461 * from the op_next chain (and from having LINKLIST recursively
4462 * applied to them). We fix up the DOs specially later */
4466 if (expr->op_type == OP_LIST) {
4468 for (o = cLISTOPx(expr)->op_first; o; o = o->op_sibling) {
4469 if (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)) {
4471 assert(!o->op_next && o->op_sibling);
4472 o->op_next = o->op_sibling;
4474 else if (o->op_type != OP_CONST && o->op_type != OP_PUSHMARK)
4478 else if (expr->op_type != OP_CONST)
4483 /* fix up DO blocks; treat each one as a separate little sub */
4485 if (expr->op_type == OP_LIST) {
4487 for (o = cLISTOPx(expr)->op_first; o; o = o->op_sibling) {
4488 if (!(o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)))
4490 o->op_next = NULL; /* undo temporary hack from above */
4493 if (cLISTOPo->op_first->op_type == OP_LEAVE) {
4494 LISTOP *leave = cLISTOPx(cLISTOPo->op_first);
4496 assert(leave->op_first->op_type == OP_ENTER);
4497 assert(leave->op_first->op_sibling);
4498 o->op_next = leave->op_first->op_sibling;
4500 assert(leave->op_flags & OPf_KIDS);
4501 assert(leave->op_last->op_next = (OP*)leave);
4502 leave->op_next = NULL; /* stop on last op */
4503 op_null((OP*)leave);
4507 OP *scope = cLISTOPo->op_first;
4508 assert(scope->op_type == OP_SCOPE);
4509 assert(scope->op_flags & OPf_KIDS);
4510 scope->op_next = NULL; /* stop on last op */
4513 /* have to peep the DOs individually as we've removed it from
4514 * the op_next chain */
4517 /* runtime finalizes as part of finalizing whole tree */
4522 PL_hints |= HINT_BLOCK_SCOPE;
4524 assert(floor==0 || (pm->op_pmflags & PMf_HAS_CV));
4526 if (is_compiletime) {
4527 U32 rx_flags = pm->op_pmflags & RXf_PMf_COMPILETIME;
4528 regexp_engine const *eng = current_re_engine();
4530 if (o->op_flags & OPf_SPECIAL)
4531 rx_flags |= RXf_SPLIT;
4533 if (!has_code || !eng->op_comp) {
4534 /* compile-time simple constant pattern */
4536 if ((pm->op_pmflags & PMf_HAS_CV) && !has_code) {
4537 /* whoops! we guessed that a qr// had a code block, but we
4538 * were wrong (e.g. /[(?{}]/ ). Throw away the PL_compcv
4539 * that isn't required now. Note that we have to be pretty
4540 * confident that nothing used that CV's pad while the
4541 * regex was parsed */
4542 assert(AvFILLp(PL_comppad) == 0); /* just @_ */
4543 /* But we know that one op is using this CV's slab. */
4544 cv_forget_slab(PL_compcv);
4546 pm->op_pmflags &= ~PMf_HAS_CV;
4551 ? eng->op_comp(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4552 rx_flags, pm->op_pmflags)
4553 : Perl_re_op_compile(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4554 rx_flags, pm->op_pmflags)
4557 op_getmad(expr,(OP*)pm,'e');
4563 /* compile-time pattern that includes literal code blocks */
4564 REGEXP* re = eng->op_comp(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4567 ((PL_hints & HINT_RE_EVAL) ? PMf_USE_RE_EVAL : 0))
4570 if (pm->op_pmflags & PMf_HAS_CV) {
4572 /* this QR op (and the anon sub we embed it in) is never
4573 * actually executed. It's just a placeholder where we can
4574 * squirrel away expr in op_code_list without the peephole
4575 * optimiser etc processing it for a second time */
4576 OP *qr = newPMOP(OP_QR, 0);
4577 ((PMOP*)qr)->op_code_list = expr;
4579 /* handle the implicit sub{} wrapped round the qr/(?{..})/ */
4580 SvREFCNT_inc_simple_void(PL_compcv);
4581 cv = newATTRSUB(floor, 0, NULL, NULL, qr);
4582 ((struct regexp *)SvANY(re))->qr_anoncv = cv;
4584 /* attach the anon CV to the pad so that
4585 * pad_fixup_inner_anons() can find it */
4586 (void)pad_add_anon(cv, o->op_type);
4587 SvREFCNT_inc_simple_void(cv);
4590 pm->op_code_list = expr;
4595 /* runtime pattern: build chain of regcomp etc ops */
4597 PADOFFSET cv_targ = 0;
4599 reglist = isreg && expr->op_type == OP_LIST;
4604 pm->op_code_list = expr;
4605 /* don't free op_code_list; its ops are embedded elsewhere too */
4606 pm->op_pmflags |= PMf_CODELIST_PRIVATE;
4609 /* the OP_REGCMAYBE is a placeholder in the non-threaded case
4610 * to allow its op_next to be pointed past the regcomp and
4611 * preceding stacking ops;
4612 * OP_REGCRESET is there to reset taint before executing the
4614 if (pm->op_pmflags & PMf_KEEP || PL_tainting)
4615 expr = newUNOP((PL_tainting ? OP_REGCRESET : OP_REGCMAYBE),0,expr);
4617 if (pm->op_pmflags & PMf_HAS_CV) {
4618 /* we have a runtime qr with literal code. This means
4619 * that the qr// has been wrapped in a new CV, which
4620 * means that runtime consts, vars etc will have been compiled
4621 * against a new pad. So... we need to execute those ops
4622 * within the environment of the new CV. So wrap them in a call
4623 * to a new anon sub. i.e. for
4627 * we build an anon sub that looks like
4629 * sub { "a", $b, '(?{...})' }
4631 * and call it, passing the returned list to regcomp.
4632 * Or to put it another way, the list of ops that get executed
4636 * ------ -------------------
4637 * pushmark (for regcomp)
4638 * pushmark (for entersub)
4639 * pushmark (for refgen)
4643 * regcreset regcreset
4645 * const("a") const("a")
4647 * const("(?{...})") const("(?{...})")
4652 SvREFCNT_inc_simple_void(PL_compcv);
4653 /* these lines are just an unrolled newANONATTRSUB */
4654 expr = newSVOP(OP_ANONCODE, 0,
4655 MUTABLE_SV(newATTRSUB(floor, 0, NULL, NULL, expr)));
4656 cv_targ = expr->op_targ;
4657 expr = newUNOP(OP_REFGEN, 0, expr);
4659 expr = list(force_list(newUNOP(OP_ENTERSUB, 0, scalar(expr))));
4662 NewOp(1101, rcop, 1, LOGOP);
4663 rcop->op_type = OP_REGCOMP;
4664 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
4665 rcop->op_first = scalar(expr);
4666 rcop->op_flags |= OPf_KIDS
4667 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
4668 | (reglist ? OPf_STACKED : 0);
4669 rcop->op_private = 0;
4671 rcop->op_targ = cv_targ;
4673 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
4674 if (PL_hints & HINT_RE_EVAL) PL_cv_has_eval = 1;
4676 /* establish postfix order */
4677 if (expr->op_type == OP_REGCRESET || expr->op_type == OP_REGCMAYBE) {
4679 rcop->op_next = expr;
4680 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
4683 rcop->op_next = LINKLIST(expr);
4684 expr->op_next = (OP*)rcop;
4687 op_prepend_elem(o->op_type, scalar((OP*)rcop), o);
4692 if (pm->op_pmflags & PMf_EVAL) {
4694 if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end)
4695 CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end);
4697 else if (repl->op_type == OP_CONST)
4701 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
4702 if (curop->op_type == OP_SCOPE
4703 || curop->op_type == OP_LEAVE
4704 || (PL_opargs[curop->op_type] & OA_DANGEROUS)) {
4705 if (curop->op_type == OP_GV) {
4706 GV * const gv = cGVOPx_gv(curop);
4708 if (strchr("&`'123456789+-\016\022", *GvENAME(gv)))
4711 else if (curop->op_type == OP_RV2CV)
4713 else if (curop->op_type == OP_RV2SV ||
4714 curop->op_type == OP_RV2AV ||
4715 curop->op_type == OP_RV2HV ||
4716 curop->op_type == OP_RV2GV) {
4717 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
4720 else if (curop->op_type == OP_PADSV ||
4721 curop->op_type == OP_PADAV ||
4722 curop->op_type == OP_PADHV ||
4723 curop->op_type == OP_PADANY)
4727 else if (curop->op_type == OP_PUSHRE)
4728 NOOP; /* Okay here, dangerous in newASSIGNOP */
4738 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
4740 pm->op_pmflags |= PMf_CONST; /* const for long enough */
4741 op_prepend_elem(o->op_type, scalar(repl), o);
4744 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
4745 pm->op_pmflags |= PMf_MAYBE_CONST;
4747 NewOp(1101, rcop, 1, LOGOP);
4748 rcop->op_type = OP_SUBSTCONT;
4749 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
4750 rcop->op_first = scalar(repl);
4751 rcop->op_flags |= OPf_KIDS;
4752 rcop->op_private = 1;
4755 /* establish postfix order */
4756 rcop->op_next = LINKLIST(repl);
4757 repl->op_next = (OP*)rcop;
4759 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
4760 assert(!(pm->op_pmflags & PMf_ONCE));
4761 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
4770 =for apidoc Am|OP *|newSVOP|I32 type|I32 flags|SV *sv
4772 Constructs, checks, and returns an op of any type that involves an
4773 embedded SV. I<type> is the opcode. I<flags> gives the eight bits
4774 of C<op_flags>. I<sv> gives the SV to embed in the op; this function
4775 takes ownership of one reference to it.
4781 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
4786 PERL_ARGS_ASSERT_NEWSVOP;
4788 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4789 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4790 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4792 NewOp(1101, svop, 1, SVOP);
4793 svop->op_type = (OPCODE)type;
4794 svop->op_ppaddr = PL_ppaddr[type];
4796 svop->op_next = (OP*)svop;
4797 svop->op_flags = (U8)flags;
4798 svop->op_private = (U8)(0 | (flags >> 8));
4799 if (PL_opargs[type] & OA_RETSCALAR)
4801 if (PL_opargs[type] & OA_TARGET)
4802 svop->op_targ = pad_alloc(type, SVs_PADTMP);
4803 return CHECKOP(type, svop);
4809 =for apidoc Am|OP *|newPADOP|I32 type|I32 flags|SV *sv
4811 Constructs, checks, and returns an op of any type that involves a
4812 reference to a pad element. I<type> is the opcode. I<flags> gives the
4813 eight bits of C<op_flags>. A pad slot is automatically allocated, and
4814 is populated with I<sv>; this function takes ownership of one reference
4817 This function only exists if Perl has been compiled to use ithreads.
4823 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
4828 PERL_ARGS_ASSERT_NEWPADOP;
4830 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4831 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4832 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4834 NewOp(1101, padop, 1, PADOP);
4835 padop->op_type = (OPCODE)type;
4836 padop->op_ppaddr = PL_ppaddr[type];
4837 padop->op_padix = pad_alloc(type, SVs_PADTMP);
4838 SvREFCNT_dec(PAD_SVl(padop->op_padix));
4839 PAD_SETSV(padop->op_padix, sv);
4842 padop->op_next = (OP*)padop;
4843 padop->op_flags = (U8)flags;
4844 if (PL_opargs[type] & OA_RETSCALAR)
4846 if (PL_opargs[type] & OA_TARGET)
4847 padop->op_targ = pad_alloc(type, SVs_PADTMP);
4848 return CHECKOP(type, padop);
4851 #endif /* !USE_ITHREADS */
4854 =for apidoc Am|OP *|newGVOP|I32 type|I32 flags|GV *gv
4856 Constructs, checks, and returns an op of any type that involves an
4857 embedded reference to a GV. I<type> is the opcode. I<flags> gives the
4858 eight bits of C<op_flags>. I<gv> identifies the GV that the op should
4859 reference; calling this function does not transfer ownership of any
4866 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
4870 PERL_ARGS_ASSERT_NEWGVOP;
4874 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4876 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4881 =for apidoc Am|OP *|newPVOP|I32 type|I32 flags|char *pv
4883 Constructs, checks, and returns an op of any type that involves an
4884 embedded C-level pointer (PV). I<type> is the opcode. I<flags> gives
4885 the eight bits of C<op_flags>. I<pv> supplies the C-level pointer, which
4886 must have been allocated using L</PerlMemShared_malloc>; the memory will
4887 be freed when the op is destroyed.
4893 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
4896 const bool utf8 = cBOOL(flags & SVf_UTF8);
4901 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4903 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
4905 NewOp(1101, pvop, 1, PVOP);
4906 pvop->op_type = (OPCODE)type;
4907 pvop->op_ppaddr = PL_ppaddr[type];
4909 pvop->op_next = (OP*)pvop;
4910 pvop->op_flags = (U8)flags;
4911 pvop->op_private = utf8 ? OPpPV_IS_UTF8 : 0;
4912 if (PL_opargs[type] & OA_RETSCALAR)
4914 if (PL_opargs[type] & OA_TARGET)
4915 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
4916 return CHECKOP(type, pvop);
4924 Perl_package(pTHX_ OP *o)
4927 SV *const sv = cSVOPo->op_sv;
4932 PERL_ARGS_ASSERT_PACKAGE;
4934 SAVEGENERICSV(PL_curstash);
4935 save_item(PL_curstname);
4937 PL_curstash = (HV *)SvREFCNT_inc(gv_stashsv(sv, GV_ADD));
4939 sv_setsv(PL_curstname, sv);
4941 PL_hints |= HINT_BLOCK_SCOPE;
4942 PL_parser->copline = NOLINE;
4943 PL_parser->expect = XSTATE;
4948 if (!PL_madskills) {
4953 pegop = newOP(OP_NULL,0);
4954 op_getmad(o,pegop,'P');
4960 Perl_package_version( pTHX_ OP *v )
4963 U32 savehints = PL_hints;
4964 PERL_ARGS_ASSERT_PACKAGE_VERSION;
4965 PL_hints &= ~HINT_STRICT_VARS;
4966 sv_setsv( GvSV(gv_fetchpvs("VERSION", GV_ADDMULTI, SVt_PV)), cSVOPx(v)->op_sv );
4967 PL_hints = savehints;
4976 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
4983 OP *pegop = PL_madskills ? newOP(OP_NULL,0) : NULL;
4985 SV *use_version = NULL;
4987 PERL_ARGS_ASSERT_UTILIZE;
4989 if (idop->op_type != OP_CONST)
4990 Perl_croak(aTHX_ "Module name must be constant");
4993 op_getmad(idop,pegop,'U');
4998 SV * const vesv = ((SVOP*)version)->op_sv;
5001 op_getmad(version,pegop,'V');
5002 if (!arg && !SvNIOKp(vesv)) {
5009 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
5010 Perl_croak(aTHX_ "Version number must be a constant number");
5012 /* Make copy of idop so we don't free it twice */
5013 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
5015 /* Fake up a method call to VERSION */
5016 meth = newSVpvs_share("VERSION");
5017 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
5018 op_append_elem(OP_LIST,
5019 op_prepend_elem(OP_LIST, pack, list(version)),
5020 newSVOP(OP_METHOD_NAMED, 0, meth)));
5024 /* Fake up an import/unimport */
5025 if (arg && arg->op_type == OP_STUB) {
5027 op_getmad(arg,pegop,'S');
5028 imop = arg; /* no import on explicit () */
5030 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
5031 imop = NULL; /* use 5.0; */
5033 use_version = ((SVOP*)idop)->op_sv;
5035 idop->op_private |= OPpCONST_NOVER;
5041 op_getmad(arg,pegop,'A');
5043 /* Make copy of idop so we don't free it twice */
5044 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
5046 /* Fake up a method call to import/unimport */
5048 ? newSVpvs_share("import") : newSVpvs_share("unimport");
5049 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
5050 op_append_elem(OP_LIST,
5051 op_prepend_elem(OP_LIST, pack, list(arg)),
5052 newSVOP(OP_METHOD_NAMED, 0, meth)));
5055 /* Fake up the BEGIN {}, which does its thing immediately. */
5057 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
5060 op_append_elem(OP_LINESEQ,
5061 op_append_elem(OP_LINESEQ,
5062 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
5063 newSTATEOP(0, NULL, veop)),
5064 newSTATEOP(0, NULL, imop) ));
5068 * feature bundle that corresponds to the required version. */
5069 use_version = sv_2mortal(new_version(use_version));
5070 S_enable_feature_bundle(aTHX_ use_version);
5072 /* If a version >= 5.11.0 is requested, strictures are on by default! */
5073 if (vcmp(use_version,
5074 sv_2mortal(upg_version(newSVnv(5.011000), FALSE))) >= 0) {
5075 if (!(PL_hints & HINT_EXPLICIT_STRICT_REFS))
5076 PL_hints |= HINT_STRICT_REFS;
5077 if (!(PL_hints & HINT_EXPLICIT_STRICT_SUBS))
5078 PL_hints |= HINT_STRICT_SUBS;
5079 if (!(PL_hints & HINT_EXPLICIT_STRICT_VARS))
5080 PL_hints |= HINT_STRICT_VARS;
5082 /* otherwise they are off */
5084 if (!(PL_hints & HINT_EXPLICIT_STRICT_REFS))
5085 PL_hints &= ~HINT_STRICT_REFS;
5086 if (!(PL_hints & HINT_EXPLICIT_STRICT_SUBS))
5087 PL_hints &= ~HINT_STRICT_SUBS;
5088 if (!(PL_hints & HINT_EXPLICIT_STRICT_VARS))
5089 PL_hints &= ~HINT_STRICT_VARS;
5093 /* The "did you use incorrect case?" warning used to be here.
5094 * The problem is that on case-insensitive filesystems one
5095 * might get false positives for "use" (and "require"):
5096 * "use Strict" or "require CARP" will work. This causes
5097 * portability problems for the script: in case-strict
5098 * filesystems the script will stop working.
5100 * The "incorrect case" warning checked whether "use Foo"
5101 * imported "Foo" to your namespace, but that is wrong, too:
5102 * there is no requirement nor promise in the language that
5103 * a Foo.pm should or would contain anything in package "Foo".
5105 * There is very little Configure-wise that can be done, either:
5106 * the case-sensitivity of the build filesystem of Perl does not
5107 * help in guessing the case-sensitivity of the runtime environment.
5110 PL_hints |= HINT_BLOCK_SCOPE;
5111 PL_parser->copline = NOLINE;
5112 PL_parser->expect = XSTATE;
5113 PL_cop_seqmax++; /* Purely for B::*'s benefit */
5114 if (PL_cop_seqmax == PERL_PADSEQ_INTRO) /* not a legal value */
5123 =head1 Embedding Functions
5125 =for apidoc load_module
5127 Loads the module whose name is pointed to by the string part of name.
5128 Note that the actual module name, not its filename, should be given.
5129 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
5130 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
5131 (or 0 for no flags). ver, if specified and not NULL, provides version semantics
5132 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
5133 arguments can be used to specify arguments to the module's import()
5134 method, similar to C<use Foo::Bar VERSION LIST>. They must be
5135 terminated with a final NULL pointer. Note that this list can only
5136 be omitted when the PERL_LOADMOD_NOIMPORT flag has been used.
5137 Otherwise at least a single NULL pointer to designate the default
5138 import list is required.
5140 The reference count for each specified C<SV*> parameter is decremented.
5145 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
5149 PERL_ARGS_ASSERT_LOAD_MODULE;
5151 va_start(args, ver);
5152 vload_module(flags, name, ver, &args);
5156 #ifdef PERL_IMPLICIT_CONTEXT
5158 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
5162 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
5163 va_start(args, ver);
5164 vload_module(flags, name, ver, &args);
5170 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
5174 OP * const modname = newSVOP(OP_CONST, 0, name);
5176 PERL_ARGS_ASSERT_VLOAD_MODULE;
5178 modname->op_private |= OPpCONST_BARE;
5180 veop = newSVOP(OP_CONST, 0, ver);
5184 if (flags & PERL_LOADMOD_NOIMPORT) {
5185 imop = sawparens(newNULLLIST());
5187 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
5188 imop = va_arg(*args, OP*);
5193 sv = va_arg(*args, SV*);
5195 imop = op_append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
5196 sv = va_arg(*args, SV*);
5200 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
5201 * that it has a PL_parser to play with while doing that, and also
5202 * that it doesn't mess with any existing parser, by creating a tmp
5203 * new parser with lex_start(). This won't actually be used for much,
5204 * since pp_require() will create another parser for the real work. */
5207 SAVEVPTR(PL_curcop);
5208 lex_start(NULL, NULL, LEX_START_SAME_FILTER);
5209 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
5210 veop, modname, imop);
5215 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
5221 PERL_ARGS_ASSERT_DOFILE;
5223 if (!force_builtin) {
5224 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
5225 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
5226 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
5227 gv = gvp ? *gvp : NULL;
5231 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
5232 doop = newUNOP(OP_ENTERSUB, OPf_STACKED,
5233 op_append_elem(OP_LIST, term,
5234 scalar(newUNOP(OP_RV2CV, 0,
5235 newGVOP(OP_GV, 0, gv)))));
5238 doop = newUNOP(OP_DOFILE, 0, scalar(term));
5244 =head1 Optree construction
5246 =for apidoc Am|OP *|newSLICEOP|I32 flags|OP *subscript|OP *listval
5248 Constructs, checks, and returns an C<lslice> (list slice) op. I<flags>
5249 gives the eight bits of C<op_flags>, except that C<OPf_KIDS> will
5250 be set automatically, and, shifted up eight bits, the eight bits of
5251 C<op_private>, except that the bit with value 1 or 2 is automatically
5252 set as required. I<listval> and I<subscript> supply the parameters of
5253 the slice; they are consumed by this function and become part of the
5254 constructed op tree.
5260 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
5262 return newBINOP(OP_LSLICE, flags,
5263 list(force_list(subscript)),
5264 list(force_list(listval)) );
5268 S_is_list_assignment(pTHX_ register const OP *o)
5276 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
5277 o = cUNOPo->op_first;
5279 flags = o->op_flags;
5281 if (type == OP_COND_EXPR) {
5282 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
5283 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
5288 yyerror("Assignment to both a list and a scalar");
5292 if (type == OP_LIST &&
5293 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
5294 o->op_private & OPpLVAL_INTRO)
5297 if (type == OP_LIST || flags & OPf_PARENS ||
5298 type == OP_RV2AV || type == OP_RV2HV ||
5299 type == OP_ASLICE || type == OP_HSLICE)
5302 if (type == OP_PADAV || type == OP_PADHV)
5305 if (type == OP_RV2SV)
5312 Helper function for newASSIGNOP to detection commonality between the
5313 lhs and the rhs. Marks all variables with PL_generation. If it
5314 returns TRUE the assignment must be able to handle common variables.
5316 PERL_STATIC_INLINE bool
5317 S_aassign_common_vars(pTHX_ OP* o)
5320 for (curop = cUNOPo->op_first; curop; curop=curop->op_sibling) {
5321 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
5322 if (curop->op_type == OP_GV) {
5323 GV *gv = cGVOPx_gv(curop);
5325 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5327 GvASSIGN_GENERATION_set(gv, PL_generation);
5329 else if (curop->op_type == OP_PADSV ||
5330 curop->op_type == OP_PADAV ||
5331 curop->op_type == OP_PADHV ||
5332 curop->op_type == OP_PADANY)
5334 if (PAD_COMPNAME_GEN(curop->op_targ)
5335 == (STRLEN)PL_generation)
5337 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
5340 else if (curop->op_type == OP_RV2CV)
5342 else if (curop->op_type == OP_RV2SV ||
5343 curop->op_type == OP_RV2AV ||
5344 curop->op_type == OP_RV2HV ||
5345 curop->op_type == OP_RV2GV) {
5346 if (cUNOPx(curop)->op_first->op_type != OP_GV) /* funny deref? */
5349 else if (curop->op_type == OP_PUSHRE) {
5351 if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) {
5352 GV *const gv = MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff));
5354 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5356 GvASSIGN_GENERATION_set(gv, PL_generation);
5360 = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
5363 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5365 GvASSIGN_GENERATION_set(gv, PL_generation);
5373 if (curop->op_flags & OPf_KIDS) {
5374 if (aassign_common_vars(curop))
5382 =for apidoc Am|OP *|newASSIGNOP|I32 flags|OP *left|I32 optype|OP *right
5384 Constructs, checks, and returns an assignment op. I<left> and I<right>
5385 supply the parameters of the assignment; they are consumed by this
5386 function and become part of the constructed op tree.
5388 If I<optype> is C<OP_ANDASSIGN>, C<OP_ORASSIGN>, or C<OP_DORASSIGN>, then
5389 a suitable conditional optree is constructed. If I<optype> is the opcode
5390 of a binary operator, such as C<OP_BIT_OR>, then an op is constructed that
5391 performs the binary operation and assigns the result to the left argument.
5392 Either way, if I<optype> is non-zero then I<flags> has no effect.
5394 If I<optype> is zero, then a plain scalar or list assignment is
5395 constructed. Which type of assignment it is is automatically determined.
5396 I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5397 will be set automatically, and, shifted up eight bits, the eight bits
5398 of C<op_private>, except that the bit with value 1 or 2 is automatically
5405 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
5411 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
5412 return newLOGOP(optype, 0,
5413 op_lvalue(scalar(left), optype),
5414 newUNOP(OP_SASSIGN, 0, scalar(right)));
5417 return newBINOP(optype, OPf_STACKED,
5418 op_lvalue(scalar(left), optype), scalar(right));
5422 if (is_list_assignment(left)) {
5423 static const char no_list_state[] = "Initialization of state variables"
5424 " in list context currently forbidden";
5426 bool maybe_common_vars = TRUE;
5429 left = op_lvalue(left, OP_AASSIGN);
5430 curop = list(force_list(left));
5431 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
5432 o->op_private = (U8)(0 | (flags >> 8));
5434 if ((left->op_type == OP_LIST
5435 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
5437 OP* lop = ((LISTOP*)left)->op_first;
5438 maybe_common_vars = FALSE;
5440 if (lop->op_type == OP_PADSV ||
5441 lop->op_type == OP_PADAV ||
5442 lop->op_type == OP_PADHV ||
5443 lop->op_type == OP_PADANY) {
5444 if (!(lop->op_private & OPpLVAL_INTRO))
5445 maybe_common_vars = TRUE;
5447 if (lop->op_private & OPpPAD_STATE) {
5448 if (left->op_private & OPpLVAL_INTRO) {
5449 /* Each variable in state($a, $b, $c) = ... */
5452 /* Each state variable in
5453 (state $a, my $b, our $c, $d, undef) = ... */
5455 yyerror(no_list_state);
5457 /* Each my variable in
5458 (state $a, my $b, our $c, $d, undef) = ... */
5460 } else if (lop->op_type == OP_UNDEF ||
5461 lop->op_type == OP_PUSHMARK) {
5462 /* undef may be interesting in
5463 (state $a, undef, state $c) */
5465 /* Other ops in the list. */
5466 maybe_common_vars = TRUE;
5468 lop = lop->op_sibling;
5471 else if ((left->op_private & OPpLVAL_INTRO)
5472 && ( left->op_type == OP_PADSV
5473 || left->op_type == OP_PADAV
5474 || left->op_type == OP_PADHV
5475 || left->op_type == OP_PADANY))
5477 if (left->op_type == OP_PADSV) maybe_common_vars = FALSE;
5478 if (left->op_private & OPpPAD_STATE) {
5479 /* All single variable list context state assignments, hence
5489 yyerror(no_list_state);
5493 /* PL_generation sorcery:
5494 * an assignment like ($a,$b) = ($c,$d) is easier than
5495 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
5496 * To detect whether there are common vars, the global var
5497 * PL_generation is incremented for each assign op we compile.
5498 * Then, while compiling the assign op, we run through all the
5499 * variables on both sides of the assignment, setting a spare slot
5500 * in each of them to PL_generation. If any of them already have
5501 * that value, we know we've got commonality. We could use a
5502 * single bit marker, but then we'd have to make 2 passes, first
5503 * to clear the flag, then to test and set it. To find somewhere
5504 * to store these values, evil chicanery is done with SvUVX().
5507 if (maybe_common_vars) {
5509 if (aassign_common_vars(o))
5510 o->op_private |= OPpASSIGN_COMMON;
5514 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
5515 OP* tmpop = ((LISTOP*)right)->op_first;
5516 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
5517 PMOP * const pm = (PMOP*)tmpop;
5518 if (left->op_type == OP_RV2AV &&
5519 !(left->op_private & OPpLVAL_INTRO) &&
5520 !(o->op_private & OPpASSIGN_COMMON) )
5522 tmpop = ((UNOP*)left)->op_first;
5523 if (tmpop->op_type == OP_GV
5525 && !pm->op_pmreplrootu.op_pmtargetoff
5527 && !pm->op_pmreplrootu.op_pmtargetgv
5531 pm->op_pmreplrootu.op_pmtargetoff
5532 = cPADOPx(tmpop)->op_padix;
5533 cPADOPx(tmpop)->op_padix = 0; /* steal it */
5535 pm->op_pmreplrootu.op_pmtargetgv
5536 = MUTABLE_GV(cSVOPx(tmpop)->op_sv);
5537 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
5539 pm->op_pmflags |= PMf_ONCE;
5540 tmpop = cUNOPo->op_first; /* to list (nulled) */
5541 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
5542 tmpop->op_sibling = NULL; /* don't free split */
5543 right->op_next = tmpop->op_next; /* fix starting loc */
5544 op_free(o); /* blow off assign */
5545 right->op_flags &= ~OPf_WANT;
5546 /* "I don't know and I don't care." */
5551 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
5552 ((LISTOP*)right)->op_last->op_type == OP_CONST)
5554 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
5555 if (SvIOK(sv) && SvIVX(sv) == 0)
5556 sv_setiv(sv, PL_modcount+1);
5564 right = newOP(OP_UNDEF, 0);
5565 if (right->op_type == OP_READLINE) {
5566 right->op_flags |= OPf_STACKED;
5567 return newBINOP(OP_NULL, flags, op_lvalue(scalar(left), OP_SASSIGN),
5571 o = newBINOP(OP_SASSIGN, flags,
5572 scalar(right), op_lvalue(scalar(left), OP_SASSIGN) );
5578 =for apidoc Am|OP *|newSTATEOP|I32 flags|char *label|OP *o
5580 Constructs a state op (COP). The state op is normally a C<nextstate> op,
5581 but will be a C<dbstate> op if debugging is enabled for currently-compiled
5582 code. The state op is populated from L</PL_curcop> (or L</PL_compiling>).
5583 If I<label> is non-null, it supplies the name of a label to attach to
5584 the state op; this function takes ownership of the memory pointed at by
5585 I<label>, and will free it. I<flags> gives the eight bits of C<op_flags>
5588 If I<o> is null, the state op is returned. Otherwise the state op is
5589 combined with I<o> into a C<lineseq> list op, which is returned. I<o>
5590 is consumed by this function and becomes part of the returned op tree.
5596 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
5599 const U32 seq = intro_my();
5600 const U32 utf8 = flags & SVf_UTF8;
5605 NewOp(1101, cop, 1, COP);
5606 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
5607 cop->op_type = OP_DBSTATE;
5608 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
5611 cop->op_type = OP_NEXTSTATE;
5612 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
5614 cop->op_flags = (U8)flags;
5615 CopHINTS_set(cop, PL_hints);
5617 cop->op_private |= NATIVE_HINTS;
5619 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
5620 cop->op_next = (OP*)cop;
5623 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
5624 CopHINTHASH_set(cop, cophh_copy(CopHINTHASH_get(PL_curcop)));
5626 Perl_cop_store_label(aTHX_ cop, label, strlen(label), utf8);
5628 PL_hints |= HINT_BLOCK_SCOPE;
5629 /* It seems that we need to defer freeing this pointer, as other parts
5630 of the grammar end up wanting to copy it after this op has been
5635 if (PL_parser && PL_parser->copline == NOLINE)
5636 CopLINE_set(cop, CopLINE(PL_curcop));
5638 CopLINE_set(cop, PL_parser->copline);
5639 PL_parser->copline = NOLINE;
5642 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
5644 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
5646 CopSTASH_set(cop, PL_curstash);
5648 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) {
5649 /* this line can have a breakpoint - store the cop in IV */
5650 AV *av = CopFILEAVx(PL_curcop);
5652 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
5653 if (svp && *svp != &PL_sv_undef ) {
5654 (void)SvIOK_on(*svp);
5655 SvIV_set(*svp, PTR2IV(cop));
5660 if (flags & OPf_SPECIAL)
5662 return op_prepend_elem(OP_LINESEQ, (OP*)cop, o);
5666 =for apidoc Am|OP *|newLOGOP|I32 type|I32 flags|OP *first|OP *other
5668 Constructs, checks, and returns a logical (flow control) op. I<type>
5669 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
5670 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
5671 the eight bits of C<op_private>, except that the bit with value 1 is
5672 automatically set. I<first> supplies the expression controlling the
5673 flow, and I<other> supplies the side (alternate) chain of ops; they are
5674 consumed by this function and become part of the constructed op tree.
5680 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
5684 PERL_ARGS_ASSERT_NEWLOGOP;
5686 return new_logop(type, flags, &first, &other);
5690 S_search_const(pTHX_ OP *o)
5692 PERL_ARGS_ASSERT_SEARCH_CONST;
5694 switch (o->op_type) {
5698 if (o->op_flags & OPf_KIDS)
5699 return search_const(cUNOPo->op_first);
5706 if (!(o->op_flags & OPf_KIDS))
5708 kid = cLISTOPo->op_first;
5710 switch (kid->op_type) {
5714 kid = kid->op_sibling;
5717 if (kid != cLISTOPo->op_last)
5723 kid = cLISTOPo->op_last;
5725 return search_const(kid);
5733 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
5741 int prepend_not = 0;
5743 PERL_ARGS_ASSERT_NEW_LOGOP;
5748 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
5749 return newBINOP(type, flags, scalar(first), scalar(other));
5751 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOGOP);
5753 scalarboolean(first);
5754 /* optimize AND and OR ops that have NOTs as children */
5755 if (first->op_type == OP_NOT
5756 && (first->op_flags & OPf_KIDS)
5757 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
5758 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
5760 if (type == OP_AND || type == OP_OR) {
5766 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
5768 prepend_not = 1; /* prepend a NOT op later */
5772 /* search for a constant op that could let us fold the test */
5773 if ((cstop = search_const(first))) {
5774 if (cstop->op_private & OPpCONST_STRICT)
5775 no_bareword_allowed(cstop);
5776 else if ((cstop->op_private & OPpCONST_BARE))
5777 Perl_ck_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
5778 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
5779 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
5780 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
5782 if (other->op_type == OP_CONST)
5783 other->op_private |= OPpCONST_SHORTCIRCUIT;
5785 OP *newop = newUNOP(OP_NULL, 0, other);
5786 op_getmad(first, newop, '1');
5787 newop->op_targ = type; /* set "was" field */
5791 if (other->op_type == OP_LEAVE)
5792 other = newUNOP(OP_NULL, OPf_SPECIAL, other);
5793 else if (other->op_type == OP_MATCH
5794 || other->op_type == OP_SUBST
5795 || other->op_type == OP_TRANSR
5796 || other->op_type == OP_TRANS)
5797 /* Mark the op as being unbindable with =~ */
5798 other->op_flags |= OPf_SPECIAL;
5799 else if (other->op_type == OP_CONST)
5800 other->op_private |= OPpCONST_FOLDED;
5804 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
5805 const OP *o2 = other;
5806 if ( ! (o2->op_type == OP_LIST
5807 && (( o2 = cUNOPx(o2)->op_first))
5808 && o2->op_type == OP_PUSHMARK
5809 && (( o2 = o2->op_sibling)) )
5812 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
5813 || o2->op_type == OP_PADHV)
5814 && o2->op_private & OPpLVAL_INTRO
5815 && !(o2->op_private & OPpPAD_STATE))
5817 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
5818 "Deprecated use of my() in false conditional");
5822 if (first->op_type == OP_CONST)
5823 first->op_private |= OPpCONST_SHORTCIRCUIT;
5825 first = newUNOP(OP_NULL, 0, first);
5826 op_getmad(other, first, '2');
5827 first->op_targ = type; /* set "was" field */
5834 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
5835 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
5837 const OP * const k1 = ((UNOP*)first)->op_first;
5838 const OP * const k2 = k1->op_sibling;
5840 switch (first->op_type)
5843 if (k2 && k2->op_type == OP_READLINE
5844 && (k2->op_flags & OPf_STACKED)
5845 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5847 warnop = k2->op_type;
5852 if (k1->op_type == OP_READDIR
5853 || k1->op_type == OP_GLOB
5854 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5855 || k1->op_type == OP_EACH
5856 || k1->op_type == OP_AEACH)
5858 warnop = ((k1->op_type == OP_NULL)
5859 ? (OPCODE)k1->op_targ : k1->op_type);
5864 const line_t oldline = CopLINE(PL_curcop);
5865 /* This ensures that warnings are reported at the first line
5866 of the construction, not the last. */
5867 CopLINE_set(PL_curcop, PL_parser->copline);
5868 Perl_warner(aTHX_ packWARN(WARN_MISC),
5869 "Value of %s%s can be \"0\"; test with defined()",
5871 ((warnop == OP_READLINE || warnop == OP_GLOB)
5872 ? " construct" : "() operator"));
5873 CopLINE_set(PL_curcop, oldline);
5880 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
5881 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
5883 NewOp(1101, logop, 1, LOGOP);
5885 logop->op_type = (OPCODE)type;
5886 logop->op_ppaddr = PL_ppaddr[type];
5887 logop->op_first = first;
5888 logop->op_flags = (U8)(flags | OPf_KIDS);
5889 logop->op_other = LINKLIST(other);
5890 logop->op_private = (U8)(1 | (flags >> 8));
5892 /* establish postfix order */
5893 logop->op_next = LINKLIST(first);
5894 first->op_next = (OP*)logop;
5895 first->op_sibling = other;
5897 CHECKOP(type,logop);
5899 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
5906 =for apidoc Am|OP *|newCONDOP|I32 flags|OP *first|OP *trueop|OP *falseop
5908 Constructs, checks, and returns a conditional-expression (C<cond_expr>)
5909 op. I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5910 will be set automatically, and, shifted up eight bits, the eight bits of
5911 C<op_private>, except that the bit with value 1 is automatically set.
5912 I<first> supplies the expression selecting between the two branches,
5913 and I<trueop> and I<falseop> supply the branches; they are consumed by
5914 this function and become part of the constructed op tree.
5920 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
5928 PERL_ARGS_ASSERT_NEWCONDOP;
5931 return newLOGOP(OP_AND, 0, first, trueop);
5933 return newLOGOP(OP_OR, 0, first, falseop);
5935 scalarboolean(first);
5936 if ((cstop = search_const(first))) {
5937 /* Left or right arm of the conditional? */
5938 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
5939 OP *live = left ? trueop : falseop;
5940 OP *const dead = left ? falseop : trueop;
5941 if (cstop->op_private & OPpCONST_BARE &&
5942 cstop->op_private & OPpCONST_STRICT) {
5943 no_bareword_allowed(cstop);
5946 /* This is all dead code when PERL_MAD is not defined. */
5947 live = newUNOP(OP_NULL, 0, live);
5948 op_getmad(first, live, 'C');
5949 op_getmad(dead, live, left ? 'e' : 't');
5954 if (live->op_type == OP_LEAVE)
5955 live = newUNOP(OP_NULL, OPf_SPECIAL, live);
5956 else if (live->op_type == OP_MATCH || live->op_type == OP_SUBST
5957 || live->op_type == OP_TRANS || live->op_type == OP_TRANSR)
5958 /* Mark the op as being unbindable with =~ */
5959 live->op_flags |= OPf_SPECIAL;
5960 else if (live->op_type == OP_CONST)
5961 live->op_private |= OPpCONST_FOLDED;
5964 NewOp(1101, logop, 1, LOGOP);
5965 logop->op_type = OP_COND_EXPR;
5966 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
5967 logop->op_first = first;
5968 logop->op_flags = (U8)(flags | OPf_KIDS);
5969 logop->op_private = (U8)(1 | (flags >> 8));
5970 logop->op_other = LINKLIST(trueop);
5971 logop->op_next = LINKLIST(falseop);
5973 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
5976 /* establish postfix order */
5977 start = LINKLIST(first);
5978 first->op_next = (OP*)logop;
5980 first->op_sibling = trueop;
5981 trueop->op_sibling = falseop;
5982 o = newUNOP(OP_NULL, 0, (OP*)logop);
5984 trueop->op_next = falseop->op_next = o;
5991 =for apidoc Am|OP *|newRANGE|I32 flags|OP *left|OP *right
5993 Constructs and returns a C<range> op, with subordinate C<flip> and
5994 C<flop> ops. I<flags> gives the eight bits of C<op_flags> for the
5995 C<flip> op and, shifted up eight bits, the eight bits of C<op_private>
5996 for both the C<flip> and C<range> ops, except that the bit with value
5997 1 is automatically set. I<left> and I<right> supply the expressions
5998 controlling the endpoints of the range; they are consumed by this function
5999 and become part of the constructed op tree.
6005 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
6014 PERL_ARGS_ASSERT_NEWRANGE;
6016 NewOp(1101, range, 1, LOGOP);
6018 range->op_type = OP_RANGE;
6019 range->op_ppaddr = PL_ppaddr[OP_RANGE];
6020 range->op_first = left;
6021 range->op_flags = OPf_KIDS;
6022 leftstart = LINKLIST(left);
6023 range->op_other = LINKLIST(right);
6024 range->op_private = (U8)(1 | (flags >> 8));
6026 left->op_sibling = right;
6028 range->op_next = (OP*)range;
6029 flip = newUNOP(OP_FLIP, flags, (OP*)range);
6030 flop = newUNOP(OP_FLOP, 0, flip);
6031 o = newUNOP(OP_NULL, 0, flop);
6033 range->op_next = leftstart;
6035 left->op_next = flip;
6036 right->op_next = flop;
6038 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
6039 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
6040 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
6041 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
6043 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
6044 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
6046 /* check barewords before they might be optimized aways */
6047 if (flip->op_private && cSVOPx(left)->op_private & OPpCONST_STRICT)
6048 no_bareword_allowed(left);
6049 if (flop->op_private && cSVOPx(right)->op_private & OPpCONST_STRICT)
6050 no_bareword_allowed(right);
6053 if (!flip->op_private || !flop->op_private)
6054 LINKLIST(o); /* blow off optimizer unless constant */
6060 =for apidoc Am|OP *|newLOOPOP|I32 flags|I32 debuggable|OP *expr|OP *block
6062 Constructs, checks, and returns an op tree expressing a loop. This is
6063 only a loop in the control flow through the op tree; it does not have
6064 the heavyweight loop structure that allows exiting the loop by C<last>
6065 and suchlike. I<flags> gives the eight bits of C<op_flags> for the
6066 top-level op, except that some bits will be set automatically as required.
6067 I<expr> supplies the expression controlling loop iteration, and I<block>
6068 supplies the body of the loop; they are consumed by this function and
6069 become part of the constructed op tree. I<debuggable> is currently
6070 unused and should always be 1.
6076 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
6081 const bool once = block && block->op_flags & OPf_SPECIAL &&
6082 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
6084 PERL_UNUSED_ARG(debuggable);
6087 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
6088 return block; /* do {} while 0 does once */
6089 if (expr->op_type == OP_READLINE
6090 || expr->op_type == OP_READDIR
6091 || expr->op_type == OP_GLOB
6092 || expr->op_type == OP_EACH || expr->op_type == OP_AEACH
6093 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
6094 expr = newUNOP(OP_DEFINED, 0,
6095 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
6096 } else if (expr->op_flags & OPf_KIDS) {
6097 const OP * const k1 = ((UNOP*)expr)->op_first;
6098 const OP * const k2 = k1 ? k1->op_sibling : NULL;
6099 switch (expr->op_type) {
6101 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
6102 && (k2->op_flags & OPf_STACKED)
6103 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
6104 expr = newUNOP(OP_DEFINED, 0, expr);
6108 if (k1 && (k1->op_type == OP_READDIR
6109 || k1->op_type == OP_GLOB
6110 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
6111 || k1->op_type == OP_EACH
6112 || k1->op_type == OP_AEACH))
6113 expr = newUNOP(OP_DEFINED, 0, expr);
6119 /* if block is null, the next op_append_elem() would put UNSTACK, a scalar
6120 * op, in listop. This is wrong. [perl #27024] */
6122 block = newOP(OP_NULL, 0);
6123 listop = op_append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
6124 o = new_logop(OP_AND, 0, &expr, &listop);
6127 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
6129 if (once && o != listop)
6130 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
6133 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
6135 o->op_flags |= flags;
6137 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
6142 =for apidoc Am|OP *|newWHILEOP|I32 flags|I32 debuggable|LOOP *loop|OP *expr|OP *block|OP *cont|I32 has_my
6144 Constructs, checks, and returns an op tree expressing a C<while> loop.
6145 This is a heavyweight loop, with structure that allows exiting the loop
6146 by C<last> and suchlike.
6148 I<loop> is an optional preconstructed C<enterloop> op to use in the
6149 loop; if it is null then a suitable op will be constructed automatically.
6150 I<expr> supplies the loop's controlling expression. I<block> supplies the
6151 main body of the loop, and I<cont> optionally supplies a C<continue> block
6152 that operates as a second half of the body. All of these optree inputs
6153 are consumed by this function and become part of the constructed op tree.
6155 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
6156 op and, shifted up eight bits, the eight bits of C<op_private> for
6157 the C<leaveloop> op, except that (in both cases) some bits will be set
6158 automatically. I<debuggable> is currently unused and should always be 1.
6159 I<has_my> can be supplied as true to force the
6160 loop body to be enclosed in its own scope.
6166 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop,
6167 OP *expr, OP *block, OP *cont, I32 has_my)
6176 PERL_UNUSED_ARG(debuggable);
6179 if (expr->op_type == OP_READLINE
6180 || expr->op_type == OP_READDIR
6181 || expr->op_type == OP_GLOB
6182 || expr->op_type == OP_EACH || expr->op_type == OP_AEACH
6183 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
6184 expr = newUNOP(OP_DEFINED, 0,
6185 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
6186 } else if (expr->op_flags & OPf_KIDS) {
6187 const OP * const k1 = ((UNOP*)expr)->op_first;
6188 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
6189 switch (expr->op_type) {
6191 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
6192 && (k2->op_flags & OPf_STACKED)
6193 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
6194 expr = newUNOP(OP_DEFINED, 0, expr);
6198 if (k1 && (k1->op_type == OP_READDIR
6199 || k1->op_type == OP_GLOB
6200 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
6201 || k1->op_type == OP_EACH
6202 || k1->op_type == OP_AEACH))
6203 expr = newUNOP(OP_DEFINED, 0, expr);
6210 block = newOP(OP_NULL, 0);
6211 else if (cont || has_my) {
6212 block = op_scope(block);
6216 next = LINKLIST(cont);
6219 OP * const unstack = newOP(OP_UNSTACK, 0);
6222 cont = op_append_elem(OP_LINESEQ, cont, unstack);
6226 listop = op_append_list(OP_LINESEQ, block, cont);
6228 redo = LINKLIST(listop);
6232 o = new_logop(OP_AND, 0, &expr, &listop);
6233 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
6235 return expr; /* listop already freed by new_logop */
6238 ((LISTOP*)listop)->op_last->op_next =
6239 (o == listop ? redo : LINKLIST(o));
6245 NewOp(1101,loop,1,LOOP);
6246 loop->op_type = OP_ENTERLOOP;
6247 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
6248 loop->op_private = 0;
6249 loop->op_next = (OP*)loop;
6252 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
6254 loop->op_redoop = redo;
6255 loop->op_lastop = o;
6256 o->op_private |= loopflags;
6259 loop->op_nextop = next;
6261 loop->op_nextop = o;
6263 o->op_flags |= flags;
6264 o->op_private |= (flags >> 8);
6269 =for apidoc Am|OP *|newFOROP|I32 flags|OP *sv|OP *expr|OP *block|OP *cont
6271 Constructs, checks, and returns an op tree expressing a C<foreach>
6272 loop (iteration through a list of values). This is a heavyweight loop,
6273 with structure that allows exiting the loop by C<last> and suchlike.
6275 I<sv> optionally supplies the variable that will be aliased to each
6276 item in turn; if null, it defaults to C<$_> (either lexical or global).
6277 I<expr> supplies the list of values to iterate over. I<block> supplies
6278 the main body of the loop, and I<cont> optionally supplies a C<continue>
6279 block that operates as a second half of the body. All of these optree
6280 inputs are consumed by this function and become part of the constructed
6283 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
6284 op and, shifted up eight bits, the eight bits of C<op_private> for
6285 the C<leaveloop> op, except that (in both cases) some bits will be set
6292 Perl_newFOROP(pTHX_ I32 flags, OP *sv, OP *expr, OP *block, OP *cont)
6297 PADOFFSET padoff = 0;
6302 PERL_ARGS_ASSERT_NEWFOROP;
6305 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
6306 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
6307 sv->op_type = OP_RV2GV;
6308 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
6310 /* The op_type check is needed to prevent a possible segfault
6311 * if the loop variable is undeclared and 'strict vars' is in
6312 * effect. This is illegal but is nonetheless parsed, so we
6313 * may reach this point with an OP_CONST where we're expecting
6316 if (cUNOPx(sv)->op_first->op_type == OP_GV
6317 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
6318 iterpflags |= OPpITER_DEF;
6320 else if (sv->op_type == OP_PADSV) { /* private variable */
6321 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
6322 padoff = sv->op_targ;
6332 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
6334 SV *const namesv = PAD_COMPNAME_SV(padoff);
6336 const char *const name = SvPV_const(namesv, len);
6338 if (len == 2 && name[0] == '$' && name[1] == '_')
6339 iterpflags |= OPpITER_DEF;
6343 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
6344 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
6345 sv = newGVOP(OP_GV, 0, PL_defgv);
6350 iterpflags |= OPpITER_DEF;
6352 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
6353 expr = op_lvalue(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
6354 iterflags |= OPf_STACKED;
6356 else if (expr->op_type == OP_NULL &&
6357 (expr->op_flags & OPf_KIDS) &&
6358 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
6360 /* Basically turn for($x..$y) into the same as for($x,$y), but we
6361 * set the STACKED flag to indicate that these values are to be
6362 * treated as min/max values by 'pp_iterinit'.
6364 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
6365 LOGOP* const range = (LOGOP*) flip->op_first;
6366 OP* const left = range->op_first;
6367 OP* const right = left->op_sibling;
6370 range->op_flags &= ~OPf_KIDS;
6371 range->op_first = NULL;
6373 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
6374 listop->op_first->op_next = range->op_next;
6375 left->op_next = range->op_other;
6376 right->op_next = (OP*)listop;
6377 listop->op_next = listop->op_first;
6380 op_getmad(expr,(OP*)listop,'O');
6384 expr = (OP*)(listop);
6386 iterflags |= OPf_STACKED;
6389 expr = op_lvalue(force_list(expr), OP_GREPSTART);
6392 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
6393 op_append_elem(OP_LIST, expr, scalar(sv))));
6394 assert(!loop->op_next);
6395 /* for my $x () sets OPpLVAL_INTRO;
6396 * for our $x () sets OPpOUR_INTRO */
6397 loop->op_private = (U8)iterpflags;
6398 if (loop->op_slabbed
6399 && DIFF(loop, OpSLOT(loop)->opslot_next)
6400 < SIZE_TO_PSIZE(sizeof(LOOP)))
6403 NewOp(1234,tmp,1,LOOP);
6404 Copy(loop,tmp,1,LISTOP);
6405 S_op_destroy(aTHX_ (OP*)loop);
6408 else if (!loop->op_slabbed)
6409 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
6410 loop->op_targ = padoff;
6411 wop = newWHILEOP(flags, 1, loop, newOP(OP_ITER, 0), block, cont, 0);
6413 op_getmad(madsv, (OP*)loop, 'v');
6418 =for apidoc Am|OP *|newLOOPEX|I32 type|OP *label
6420 Constructs, checks, and returns a loop-exiting op (such as C<goto>
6421 or C<last>). I<type> is the opcode. I<label> supplies the parameter
6422 determining the target of the op; it is consumed by this function and
6423 becomes part of the constructed op tree.
6429 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
6434 PERL_ARGS_ASSERT_NEWLOOPEX;
6436 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
6438 if (type != OP_GOTO) {
6439 /* "last()" means "last" */
6440 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS)) {
6441 o = newOP(type, OPf_SPECIAL);
6445 /* Check whether it's going to be a goto &function */
6446 if (label->op_type == OP_ENTERSUB
6447 && !(label->op_flags & OPf_STACKED))
6448 label = newUNOP(OP_REFGEN, 0, op_lvalue(label, OP_REFGEN));
6451 /* Check for a constant argument */
6452 if (label->op_type == OP_CONST) {
6453 SV * const sv = ((SVOP *)label)->op_sv;
6455 const char *s = SvPV_const(sv,l);
6456 if (l == strlen(s)) {
6458 SvUTF8(((SVOP*)label)->op_sv),
6460 SvPV_nolen_const(((SVOP*)label)->op_sv)));
6464 /* If we have already created an op, we do not need the label. */
6467 op_getmad(label,o,'L');
6471 else o = newUNOP(type, OPf_STACKED, label);
6473 PL_hints |= HINT_BLOCK_SCOPE;
6477 /* if the condition is a literal array or hash
6478 (or @{ ... } etc), make a reference to it.
6481 S_ref_array_or_hash(pTHX_ OP *cond)
6484 && (cond->op_type == OP_RV2AV
6485 || cond->op_type == OP_PADAV
6486 || cond->op_type == OP_RV2HV
6487 || cond->op_type == OP_PADHV))
6489 return newUNOP(OP_REFGEN, 0, op_lvalue(cond, OP_REFGEN));
6492 && (cond->op_type == OP_ASLICE
6493 || cond->op_type == OP_HSLICE)) {
6495 /* anonlist now needs a list from this op, was previously used in
6497 cond->op_flags |= ~(OPf_WANT_SCALAR | OPf_REF);
6498 cond->op_flags |= OPf_WANT_LIST;
6500 return newANONLIST(op_lvalue(cond, OP_ANONLIST));
6507 /* These construct the optree fragments representing given()
6510 entergiven and enterwhen are LOGOPs; the op_other pointer
6511 points up to the associated leave op. We need this so we
6512 can put it in the context and make break/continue work.
6513 (Also, of course, pp_enterwhen will jump straight to
6514 op_other if the match fails.)
6518 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
6519 I32 enter_opcode, I32 leave_opcode,
6520 PADOFFSET entertarg)
6526 PERL_ARGS_ASSERT_NEWGIVWHENOP;
6528 NewOp(1101, enterop, 1, LOGOP);
6529 enterop->op_type = (Optype)enter_opcode;
6530 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
6531 enterop->op_flags = (U8) OPf_KIDS;
6532 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
6533 enterop->op_private = 0;
6535 o = newUNOP(leave_opcode, 0, (OP *) enterop);
6538 enterop->op_first = scalar(cond);
6539 cond->op_sibling = block;
6541 o->op_next = LINKLIST(cond);
6542 cond->op_next = (OP *) enterop;
6545 /* This is a default {} block */
6546 enterop->op_first = block;
6547 enterop->op_flags |= OPf_SPECIAL;
6548 o ->op_flags |= OPf_SPECIAL;
6550 o->op_next = (OP *) enterop;
6553 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
6554 entergiven and enterwhen both
6557 enterop->op_next = LINKLIST(block);
6558 block->op_next = enterop->op_other = o;
6563 /* Does this look like a boolean operation? For these purposes
6564 a boolean operation is:
6565 - a subroutine call [*]
6566 - a logical connective
6567 - a comparison operator
6568 - a filetest operator, with the exception of -s -M -A -C
6569 - defined(), exists() or eof()
6570 - /$re/ or $foo =~ /$re/
6572 [*] possibly surprising
6575 S_looks_like_bool(pTHX_ const OP *o)
6579 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
6581 switch(o->op_type) {
6584 return looks_like_bool(cLOGOPo->op_first);
6588 looks_like_bool(cLOGOPo->op_first)
6589 && looks_like_bool(cLOGOPo->op_first->op_sibling));
6594 o->op_flags & OPf_KIDS
6595 && looks_like_bool(cUNOPo->op_first));
6599 case OP_NOT: case OP_XOR:
6601 case OP_EQ: case OP_NE: case OP_LT:
6602 case OP_GT: case OP_LE: case OP_GE:
6604 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
6605 case OP_I_GT: case OP_I_LE: case OP_I_GE:
6607 case OP_SEQ: case OP_SNE: case OP_SLT:
6608 case OP_SGT: case OP_SLE: case OP_SGE:
6612 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
6613 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
6614 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
6615 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
6616 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
6617 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
6618 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
6619 case OP_FTTEXT: case OP_FTBINARY:
6621 case OP_DEFINED: case OP_EXISTS:
6622 case OP_MATCH: case OP_EOF:
6629 /* Detect comparisons that have been optimized away */
6630 if (cSVOPo->op_sv == &PL_sv_yes
6631 || cSVOPo->op_sv == &PL_sv_no)
6644 =for apidoc Am|OP *|newGIVENOP|OP *cond|OP *block|PADOFFSET defsv_off
6646 Constructs, checks, and returns an op tree expressing a C<given> block.
6647 I<cond> supplies the expression that will be locally assigned to a lexical
6648 variable, and I<block> supplies the body of the C<given> construct; they
6649 are consumed by this function and become part of the constructed op tree.
6650 I<defsv_off> is the pad offset of the scalar lexical variable that will
6651 be affected. If it is 0, the global $_ will be used.
6657 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
6660 PERL_ARGS_ASSERT_NEWGIVENOP;
6661 return newGIVWHENOP(
6662 ref_array_or_hash(cond),
6664 OP_ENTERGIVEN, OP_LEAVEGIVEN,
6669 =for apidoc Am|OP *|newWHENOP|OP *cond|OP *block
6671 Constructs, checks, and returns an op tree expressing a C<when> block.
6672 I<cond> supplies the test expression, and I<block> supplies the block
6673 that will be executed if the test evaluates to true; they are consumed
6674 by this function and become part of the constructed op tree. I<cond>
6675 will be interpreted DWIMically, often as a comparison against C<$_>,
6676 and may be null to generate a C<default> block.
6682 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
6684 const bool cond_llb = (!cond || looks_like_bool(cond));
6687 PERL_ARGS_ASSERT_NEWWHENOP;
6692 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
6694 scalar(ref_array_or_hash(cond)));
6697 return newGIVWHENOP(cond_op, block, OP_ENTERWHEN, OP_LEAVEWHEN, 0);
6701 Perl_cv_ckproto_len_flags(pTHX_ const CV *cv, const GV *gv, const char *p,
6702 const STRLEN len, const U32 flags)
6704 const char * const cvp = SvROK(cv) ? "" : CvPROTO(cv);
6705 const STRLEN clen = CvPROTOLEN(cv);
6707 PERL_ARGS_ASSERT_CV_CKPROTO_LEN_FLAGS;
6709 if (((!p != !cvp) /* One has prototype, one has not. */
6711 (flags & SVf_UTF8) == SvUTF8(cv)
6712 ? len != clen || memNE(cvp, p, len)
6714 ? bytes_cmp_utf8((const U8 *)cvp, clen,
6716 : bytes_cmp_utf8((const U8 *)p, len,
6717 (const U8 *)cvp, clen)
6721 && ckWARN_d(WARN_PROTOTYPE)) {
6722 SV* const msg = sv_newmortal();
6728 gv_efullname3(name = sv_newmortal(), gv, NULL);
6729 else name = (SV *)gv;
6731 sv_setpvs(msg, "Prototype mismatch:");
6733 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
6735 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")",
6736 SVfARG(newSVpvn_flags(cvp,clen, SvUTF8(cv)|SVs_TEMP))
6739 sv_catpvs(msg, ": none");
6740 sv_catpvs(msg, " vs ");
6742 Perl_sv_catpvf(aTHX_ msg, "(%"SVf")", SVfARG(newSVpvn_flags(p, len, flags | SVs_TEMP)));
6744 sv_catpvs(msg, "none");
6745 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
6749 static void const_sv_xsub(pTHX_ CV* cv);
6753 =head1 Optree Manipulation Functions
6755 =for apidoc cv_const_sv
6757 If C<cv> is a constant sub eligible for inlining. returns the constant
6758 value returned by the sub. Otherwise, returns NULL.
6760 Constant subs can be created with C<newCONSTSUB> or as described in
6761 L<perlsub/"Constant Functions">.
6766 Perl_cv_const_sv(pTHX_ const CV *const cv)
6768 PERL_UNUSED_CONTEXT;
6771 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
6773 return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
6776 /* op_const_sv: examine an optree to determine whether it's in-lineable.
6777 * Can be called in 3 ways:
6780 * look for a single OP_CONST with attached value: return the value
6782 * cv && CvCLONE(cv) && !CvCONST(cv)
6784 * examine the clone prototype, and if contains only a single
6785 * OP_CONST referencing a pad const, or a single PADSV referencing
6786 * an outer lexical, return a non-zero value to indicate the CV is
6787 * a candidate for "constizing" at clone time
6791 * We have just cloned an anon prototype that was marked as a const
6792 * candidate. Try to grab the current value, and in the case of
6793 * PADSV, ignore it if it has multiple references. In this case we
6794 * return a newly created *copy* of the value.
6798 Perl_op_const_sv(pTHX_ const OP *o, CV *cv)
6809 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
6810 o = cLISTOPo->op_first->op_sibling;
6812 for (; o; o = o->op_next) {
6813 const OPCODE type = o->op_type;
6815 if (sv && o->op_next == o)
6817 if (o->op_next != o) {
6818 if (type == OP_NEXTSTATE
6819 || (type == OP_NULL && !(o->op_flags & OPf_KIDS))
6820 || type == OP_PUSHMARK)
6822 if (type == OP_DBSTATE)
6825 if (type == OP_LEAVESUB || type == OP_RETURN)
6829 if (type == OP_CONST && cSVOPo->op_sv)
6831 else if (cv && type == OP_CONST) {
6832 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6836 else if (cv && type == OP_PADSV) {
6837 if (CvCONST(cv)) { /* newly cloned anon */
6838 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6839 /* the candidate should have 1 ref from this pad and 1 ref
6840 * from the parent */
6841 if (!sv || SvREFCNT(sv) != 2)
6848 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
6849 sv = &PL_sv_undef; /* an arbitrary non-null value */
6864 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
6867 /* This would be the return value, but the return cannot be reached. */
6868 OP* pegop = newOP(OP_NULL, 0);
6871 PERL_UNUSED_ARG(floor);
6881 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
6883 NORETURN_FUNCTION_END;
6888 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
6890 return newATTRSUB_flags(floor, o, proto, attrs, block, 0);
6894 Perl_newATTRSUB_flags(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs,
6895 OP *block, U32 flags)
6900 STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */
6904 const bool ec = PL_parser && PL_parser->error_count;
6905 /* If the subroutine has no body, no attributes, and no builtin attributes
6906 then it's just a sub declaration, and we may be able to get away with
6907 storing with a placeholder scalar in the symbol table, rather than a
6908 full GV and CV. If anything is present then it will take a full CV to
6910 const I32 gv_fetch_flags
6911 = ec ? GV_NOADD_NOINIT :
6912 (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
6914 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
6916 const bool o_is_gv = flags & 1;
6917 const char * const name =
6918 o ? SvPV_const(o_is_gv ? (SV *)o : cSVOPo->op_sv, namlen) : NULL;
6920 bool name_is_utf8 = o && !o_is_gv && SvUTF8(cSVOPo->op_sv);
6921 #ifdef PERL_DEBUG_READONLY_OPS
6922 OPSLAB *slab = NULL;
6926 assert(proto->op_type == OP_CONST);
6927 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
6928 ps_utf8 = SvUTF8(((SVOP*)proto)->op_sv);
6938 gv = gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV);
6940 } else if (PERLDB_NAMEANON && CopLINE(PL_curcop)) {
6941 SV * const sv = sv_newmortal();
6942 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
6943 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
6944 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
6945 gv = gv_fetchsv(sv, gv_fetch_flags, SVt_PVCV);
6947 } else if (PL_curstash) {
6948 gv = gv_fetchpvs("__ANON__", gv_fetch_flags, SVt_PVCV);
6951 gv = gv_fetchpvs("__ANON__::__ANON__", gv_fetch_flags, SVt_PVCV);
6955 if (!PL_madskills) {
6966 if (name && block) {
6967 const char *s = strrchr(name, ':');
6969 if (strEQ(s, "BEGIN")) {
6970 const char not_safe[] =
6971 "BEGIN not safe after errors--compilation aborted";
6972 if (PL_in_eval & EVAL_KEEPERR)
6973 Perl_croak(aTHX_ not_safe);
6975 /* force display of errors found but not reported */
6976 sv_catpv(ERRSV, not_safe);
6977 Perl_croak(aTHX_ "%"SVf, SVfARG(ERRSV));
6985 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
6986 maximum a prototype before. */
6987 if (SvTYPE(gv) > SVt_NULL) {
6988 cv_ckproto_len_flags((const CV *)gv,
6989 o ? (const GV *)cSVOPo->op_sv : NULL, ps,
6993 sv_setpvn(MUTABLE_SV(gv), ps, ps_len);
6994 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(gv));
6997 sv_setiv(MUTABLE_SV(gv), -1);
6999 SvREFCNT_dec(PL_compcv);
7000 cv = PL_compcv = NULL;
7004 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
7006 if (!block || !ps || *ps || attrs
7007 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
7009 || block->op_type == OP_NULL
7014 const_sv = op_const_sv(block, NULL);
7017 const bool exists = CvROOT(cv) || CvXSUB(cv);
7019 /* if the subroutine doesn't exist and wasn't pre-declared
7020 * with a prototype, assume it will be AUTOLOADed,
7021 * skipping the prototype check
7023 if (exists || SvPOK(cv))
7024 cv_ckproto_len_flags(cv, gv, ps, ps_len, ps_utf8);
7025 /* already defined (or promised)? */
7026 if (exists || GvASSUMECV(gv)) {
7029 || block->op_type == OP_NULL
7032 if (CvFLAGS(PL_compcv)) {
7033 /* might have had built-in attrs applied */
7034 const bool pureperl = !CvISXSUB(cv) && CvROOT(cv);
7035 if (CvLVALUE(PL_compcv) && ! CvLVALUE(cv) && pureperl
7036 && ckWARN(WARN_MISC))
7037 Perl_warner(aTHX_ packWARN(WARN_MISC), "lvalue attribute ignored after the subroutine has been defined");
7039 (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS
7040 & ~(CVf_LVALUE * pureperl));
7042 if (attrs) goto attrs;
7043 /* just a "sub foo;" when &foo is already defined */
7044 SAVEFREESV(PL_compcv);
7049 && block->op_type != OP_NULL
7052 const line_t oldline = CopLINE(PL_curcop);
7053 if (PL_parser && PL_parser->copline != NOLINE) {
7054 /* This ensures that warnings are reported at the first
7055 line of a redefinition, not the last. */
7056 CopLINE_set(PL_curcop, PL_parser->copline);
7058 report_redefined_cv(cSVOPo->op_sv, cv, &const_sv);
7059 CopLINE_set(PL_curcop, oldline);
7061 if (!PL_minus_c) /* keep old one around for madskills */
7064 /* (PL_madskills unset in used file.) */
7072 SvREFCNT_inc_simple_void_NN(const_sv);
7074 assert(!CvROOT(cv) && !CvCONST(cv));
7076 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
7077 CvXSUBANY(cv).any_ptr = const_sv;
7078 CvXSUB(cv) = const_sv_xsub;
7084 cv = newCONSTSUB_flags(
7085 NULL, name, namlen, name_is_utf8 ? SVf_UTF8 : 0,
7092 SvREFCNT_dec(PL_compcv);
7096 if (cv) { /* must reuse cv if autoloaded */
7097 /* transfer PL_compcv to cv */
7100 && block->op_type != OP_NULL
7103 cv_flags_t existing_builtin_attrs = CvFLAGS(cv) & CVf_BUILTIN_ATTRS;
7104 PADLIST *const temp_av = CvPADLIST(cv);
7105 CV *const temp_cv = CvOUTSIDE(cv);
7106 const cv_flags_t other_flags =
7107 CvFLAGS(cv) & (CVf_SLABBED|CVf_WEAKOUTSIDE);
7108 OP * const cvstart = CvSTART(cv);
7111 assert(!CvCVGV_RC(cv));
7112 assert(CvGV(cv) == gv);
7115 CvFLAGS(cv) = CvFLAGS(PL_compcv) | existing_builtin_attrs;
7116 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
7117 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
7118 CvPADLIST(cv) = CvPADLIST(PL_compcv);
7119 CvOUTSIDE(PL_compcv) = temp_cv;
7120 CvPADLIST(PL_compcv) = temp_av;
7121 CvSTART(cv) = CvSTART(PL_compcv);
7122 CvSTART(PL_compcv) = cvstart;
7123 CvFLAGS(PL_compcv) &= ~(CVf_SLABBED|CVf_WEAKOUTSIDE);
7124 CvFLAGS(PL_compcv) |= other_flags;
7126 if (CvFILE(cv) && CvDYNFILE(cv)) {
7127 Safefree(CvFILE(cv));
7129 CvFILE_set_from_cop(cv, PL_curcop);
7130 CvSTASH_set(cv, PL_curstash);
7132 /* inner references to PL_compcv must be fixed up ... */
7133 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
7134 if (PERLDB_INTER)/* Advice debugger on the new sub. */
7135 ++PL_sub_generation;
7138 /* Might have had built-in attributes applied -- propagate them. */
7139 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
7141 /* ... before we throw it away */
7142 SvREFCNT_dec(PL_compcv);
7150 if (strEQ(name, "import")) {
7151 PL_formfeed = MUTABLE_SV(cv);
7152 /* diag_listed_as: SKIPME */
7153 Perl_warner(aTHX_ packWARN(WARN_VOID), "0x%"UVxf"\n", PTR2UV(cv));
7157 if (HvENAME_HEK(GvSTASH(gv)))
7158 /* sub Foo::bar { (shift)+1 } */
7159 mro_method_changed_in(GvSTASH(gv));
7164 CvFILE_set_from_cop(cv, PL_curcop);
7165 CvSTASH_set(cv, PL_curstash);
7169 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
7170 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(cv));
7177 /* If we assign an optree to a PVCV, then we've defined a subroutine that
7178 the debugger could be able to set a breakpoint in, so signal to
7179 pp_entereval that it should not throw away any saved lines at scope
7182 PL_breakable_sub_gen++;
7183 /* This makes sub {}; work as expected. */
7184 if (block->op_type == OP_STUB) {
7185 OP* const newblock = newSTATEOP(0, NULL, 0);
7187 op_getmad(block,newblock,'B');
7193 CvROOT(cv) = CvLVALUE(cv)
7194 ? newUNOP(OP_LEAVESUBLV, 0,
7195 op_lvalue(scalarseq(block), OP_LEAVESUBLV))
7196 : newUNOP(OP_LEAVESUB, 0, scalarseq(block));
7197 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7198 OpREFCNT_set(CvROOT(cv), 1);
7199 /* The cv no longer needs to hold a refcount on the slab, as CvROOT
7200 itself has a refcount. */
7202 OpslabREFCNT_dec_padok((OPSLAB *)CvSTART(cv));
7203 #ifdef PERL_DEBUG_READONLY_OPS
7204 slab = (OPSLAB *)CvSTART(cv);
7206 CvSTART(cv) = LINKLIST(CvROOT(cv));
7207 CvROOT(cv)->op_next = 0;
7208 CALL_PEEP(CvSTART(cv));
7209 finalize_optree(CvROOT(cv));
7211 /* now that optimizer has done its work, adjust pad values */
7213 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
7216 assert(!CvCONST(cv));
7217 if (ps && !*ps && op_const_sv(block, cv))
7223 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
7224 HV *stash = name && GvSTASH(CvGV(cv)) ? GvSTASH(CvGV(cv)) : PL_curstash;
7225 apply_attrs(stash, MUTABLE_SV(cv), attrs, FALSE);
7228 if (block && has_name) {
7229 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
7230 SV * const tmpstr = sv_newmortal();
7231 GV * const db_postponed = gv_fetchpvs("DB::postponed",
7232 GV_ADDMULTI, SVt_PVHV);
7234 SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld",
7237 (long)CopLINE(PL_curcop));
7238 gv_efullname3(tmpstr, gv, NULL);
7239 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
7240 SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr), sv, 0);
7241 hv = GvHVn(db_postponed);
7242 if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr))) {
7243 CV * const pcv = GvCV(db_postponed);
7249 call_sv(MUTABLE_SV(pcv), G_DISCARD);
7254 if (name && ! (PL_parser && PL_parser->error_count))
7255 process_special_blocks(name, gv, cv);
7260 PL_parser->copline = NOLINE;
7262 #ifdef PERL_DEBUG_READONLY_OPS
7263 /* Watch out for BEGIN blocks */
7264 if (slab && gv && isGV(gv) && GvCV(gv)) Slab_to_ro(slab);
7270 S_process_special_blocks(pTHX_ const char *const fullname, GV *const gv,
7273 const char *const colon = strrchr(fullname,':');
7274 const char *const name = colon ? colon + 1 : fullname;
7276 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
7279 if (strEQ(name, "BEGIN")) {
7280 const I32 oldscope = PL_scopestack_ix;
7282 SAVECOPFILE(&PL_compiling);
7283 SAVECOPLINE(&PL_compiling);
7284 SAVEVPTR(PL_curcop);
7286 DEBUG_x( dump_sub(gv) );
7287 Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv));
7288 GvCV_set(gv,0); /* cv has been hijacked */
7289 call_list(oldscope, PL_beginav);
7291 CopHINTS_set(&PL_compiling, PL_hints);
7298 if strEQ(name, "END") {
7299 DEBUG_x( dump_sub(gv) );
7300 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv));
7303 } else if (*name == 'U') {
7304 if (strEQ(name, "UNITCHECK")) {
7305 /* It's never too late to run a unitcheck block */
7306 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv));
7310 } else if (*name == 'C') {
7311 if (strEQ(name, "CHECK")) {
7313 /* diag_listed_as: Too late to run %s block */
7314 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
7315 "Too late to run CHECK block");
7316 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv));
7320 } else if (*name == 'I') {
7321 if (strEQ(name, "INIT")) {
7323 /* diag_listed_as: Too late to run %s block */
7324 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
7325 "Too late to run INIT block");
7326 Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv));
7332 DEBUG_x( dump_sub(gv) );
7333 GvCV_set(gv,0); /* cv has been hijacked */
7338 =for apidoc newCONSTSUB
7340 See L</newCONSTSUB_flags>.
7346 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
7348 return newCONSTSUB_flags(stash, name, name ? strlen(name) : 0, 0, sv);
7352 =for apidoc newCONSTSUB_flags
7354 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
7355 eligible for inlining at compile-time.
7357 Currently, the only useful value for C<flags> is SVf_UTF8.
7359 The newly created subroutine takes ownership of a reference to the passed in
7362 Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>,
7363 which won't be called if used as a destructor, but will suppress the overhead
7364 of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at
7371 Perl_newCONSTSUB_flags(pTHX_ HV *stash, const char *name, STRLEN len,
7377 const char *const file = CopFILE(PL_curcop);
7379 SV *const temp_sv = CopFILESV(PL_curcop);
7380 const char *const file = temp_sv ? SvPV_nolen_const(temp_sv) : NULL;
7385 if (IN_PERL_RUNTIME) {
7386 /* at runtime, it's not safe to manipulate PL_curcop: it may be
7387 * an op shared between threads. Use a non-shared COP for our
7389 SAVEVPTR(PL_curcop);
7390 SAVECOMPILEWARNINGS();
7391 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
7392 PL_curcop = &PL_compiling;
7394 SAVECOPLINE(PL_curcop);
7395 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
7398 PL_hints &= ~HINT_BLOCK_SCOPE;
7401 SAVEGENERICSV(PL_curstash);
7402 PL_curstash = (HV *)SvREFCNT_inc_simple_NN(stash);
7405 /* file becomes the CvFILE. For an XS, it's usually static storage,
7406 and so doesn't get free()d. (It's expected to be from the C pre-
7407 processor __FILE__ directive). But we need a dynamically allocated one,
7408 and we need it to get freed. */
7409 cv = newXS_len_flags(name, len, const_sv_xsub, file ? file : "", "",
7410 &sv, XS_DYNAMIC_FILENAME | flags);
7411 CvXSUBANY(cv).any_ptr = sv;
7420 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
7421 const char *const filename, const char *const proto,
7424 PERL_ARGS_ASSERT_NEWXS_FLAGS;
7425 return newXS_len_flags(
7426 name, name ? strlen(name) : 0, subaddr, filename, proto, NULL, flags
7431 Perl_newXS_len_flags(pTHX_ const char *name, STRLEN len,
7432 XSUBADDR_t subaddr, const char *const filename,
7433 const char *const proto, SV **const_svp,
7438 PERL_ARGS_ASSERT_NEWXS_LEN_FLAGS;
7441 GV * const gv = name
7443 name,len,GV_ADDMULTI|flags,SVt_PVCV
7446 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
7447 GV_ADDMULTI | flags, SVt_PVCV);
7450 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
7452 if ((cv = (name ? GvCV(gv) : NULL))) {
7454 /* just a cached method */
7458 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
7459 /* already defined (or promised) */
7460 /* Redundant check that allows us to avoid creating an SV
7461 most of the time: */
7462 if (CvCONST(cv) || ckWARN(WARN_REDEFINE)) {
7463 report_redefined_cv(newSVpvn_flags(
7464 name,len,(flags&SVf_UTF8)|SVs_TEMP
7473 if (cv) /* must reuse cv if autoloaded */
7476 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7480 if (HvENAME_HEK(GvSTASH(gv)))
7481 mro_method_changed_in(GvSTASH(gv)); /* newXS */
7487 (void)gv_fetchfile(filename);
7488 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
7489 an external constant string */
7490 assert(!CvDYNFILE(cv)); /* cv_undef should have turned it off */
7492 CvXSUB(cv) = subaddr;
7495 process_special_blocks(name, gv, cv);
7498 if (flags & XS_DYNAMIC_FILENAME) {
7499 CvFILE(cv) = savepv(filename);
7502 sv_setpv(MUTABLE_SV(cv), proto);
7507 Perl_newSTUB(pTHX_ GV *gv, bool fake)
7509 CV *cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7510 PERL_ARGS_ASSERT_NEWSTUB;
7514 if (!fake && HvENAME_HEK(GvSTASH(gv)))
7515 mro_method_changed_in(GvSTASH(gv));
7517 CvFILE_set_from_cop(cv, PL_curcop);
7518 CvSTASH_set(cv, PL_curstash);
7524 =for apidoc U||newXS
7526 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
7527 static storage, as it is used directly as CvFILE(), without a copy being made.
7533 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
7535 PERL_ARGS_ASSERT_NEWXS;
7536 return newXS_len_flags(
7537 name, name ? strlen(name) : 0, subaddr, filename, NULL, NULL, 0
7546 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
7551 OP* pegop = newOP(OP_NULL, 0);
7556 if (PL_parser && PL_parser->error_count) {
7562 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
7563 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
7566 if ((cv = GvFORM(gv))) {
7567 if (ckWARN(WARN_REDEFINE)) {
7568 const line_t oldline = CopLINE(PL_curcop);
7569 if (PL_parser && PL_parser->copline != NOLINE)
7570 CopLINE_set(PL_curcop, PL_parser->copline);
7572 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
7573 "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv));
7575 /* diag_listed_as: Format %s redefined */
7576 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
7577 "Format STDOUT redefined");
7579 CopLINE_set(PL_curcop, oldline);
7584 GvFORM(gv) = (CV *)SvREFCNT_inc_simple_NN(cv);
7586 CvFILE_set_from_cop(cv, PL_curcop);
7589 pad_tidy(padtidy_FORMAT);
7590 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
7591 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7592 OpREFCNT_set(CvROOT(cv), 1);
7593 CvSTART(cv) = LINKLIST(CvROOT(cv));
7594 CvROOT(cv)->op_next = 0;
7595 CALL_PEEP(CvSTART(cv));
7596 finalize_optree(CvROOT(cv));
7601 op_getmad(o,pegop,'n');
7602 op_getmad_weak(block, pegop, 'b');
7607 PL_parser->copline = NOLINE;
7615 Perl_newANONLIST(pTHX_ OP *o)
7617 return convert(OP_ANONLIST, OPf_SPECIAL, o);
7621 Perl_newANONHASH(pTHX_ OP *o)
7623 return convert(OP_ANONHASH, OPf_SPECIAL, o);
7627 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
7629 return newANONATTRSUB(floor, proto, NULL, block);
7633 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
7635 return newUNOP(OP_REFGEN, 0,
7636 newSVOP(OP_ANONCODE, 0,
7637 MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block))));
7641 Perl_oopsAV(pTHX_ OP *o)
7645 PERL_ARGS_ASSERT_OOPSAV;
7647 switch (o->op_type) {
7649 o->op_type = OP_PADAV;
7650 o->op_ppaddr = PL_ppaddr[OP_PADAV];
7651 return ref(o, OP_RV2AV);
7654 o->op_type = OP_RV2AV;
7655 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
7660 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
7667 Perl_oopsHV(pTHX_ OP *o)
7671 PERL_ARGS_ASSERT_OOPSHV;
7673 switch (o->op_type) {
7676 o->op_type = OP_PADHV;
7677 o->op_ppaddr = PL_ppaddr[OP_PADHV];
7678 return ref(o, OP_RV2HV);
7682 o->op_type = OP_RV2HV;
7683 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
7688 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
7695 Perl_newAVREF(pTHX_ OP *o)
7699 PERL_ARGS_ASSERT_NEWAVREF;
7701 if (o->op_type == OP_PADANY) {
7702 o->op_type = OP_PADAV;
7703 o->op_ppaddr = PL_ppaddr[OP_PADAV];
7706 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)) {
7707 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7708 "Using an array as a reference is deprecated");
7710 return newUNOP(OP_RV2AV, 0, scalar(o));
7714 Perl_newGVREF(pTHX_ I32 type, OP *o)
7716 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
7717 return newUNOP(OP_NULL, 0, o);
7718 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
7722 Perl_newHVREF(pTHX_ OP *o)
7726 PERL_ARGS_ASSERT_NEWHVREF;
7728 if (o->op_type == OP_PADANY) {
7729 o->op_type = OP_PADHV;
7730 o->op_ppaddr = PL_ppaddr[OP_PADHV];
7733 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)) {
7734 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7735 "Using a hash as a reference is deprecated");
7737 return newUNOP(OP_RV2HV, 0, scalar(o));
7741 Perl_newCVREF(pTHX_ I32 flags, OP *o)
7743 return newUNOP(OP_RV2CV, flags, scalar(o));
7747 Perl_newSVREF(pTHX_ OP *o)
7751 PERL_ARGS_ASSERT_NEWSVREF;
7753 if (o->op_type == OP_PADANY) {
7754 o->op_type = OP_PADSV;
7755 o->op_ppaddr = PL_ppaddr[OP_PADSV];
7758 return newUNOP(OP_RV2SV, 0, scalar(o));
7761 /* Check routines. See the comments at the top of this file for details
7762 * on when these are called */
7765 Perl_ck_anoncode(pTHX_ OP *o)
7767 PERL_ARGS_ASSERT_CK_ANONCODE;
7769 cSVOPo->op_targ = pad_add_anon((CV*)cSVOPo->op_sv, o->op_type);
7771 cSVOPo->op_sv = NULL;
7776 Perl_ck_bitop(pTHX_ OP *o)
7780 PERL_ARGS_ASSERT_CK_BITOP;
7782 o->op_private = (U8)(PL_hints & HINT_INTEGER);
7783 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
7784 && (o->op_type == OP_BIT_OR
7785 || o->op_type == OP_BIT_AND
7786 || o->op_type == OP_BIT_XOR))
7788 const OP * const left = cBINOPo->op_first;
7789 const OP * const right = left->op_sibling;
7790 if ((OP_IS_NUMCOMPARE(left->op_type) &&
7791 (left->op_flags & OPf_PARENS) == 0) ||
7792 (OP_IS_NUMCOMPARE(right->op_type) &&
7793 (right->op_flags & OPf_PARENS) == 0))
7794 Perl_ck_warner(aTHX_ packWARN(WARN_PRECEDENCE),
7795 "Possible precedence problem on bitwise %c operator",
7796 o->op_type == OP_BIT_OR ? '|'
7797 : o->op_type == OP_BIT_AND ? '&' : '^'
7803 PERL_STATIC_INLINE bool
7804 is_dollar_bracket(pTHX_ const OP * const o)
7807 return o->op_type == OP_RV2SV && o->op_flags & OPf_KIDS
7808 && (kid = cUNOPx(o)->op_first)
7809 && kid->op_type == OP_GV
7810 && strEQ(GvNAME(cGVOPx_gv(kid)), "[");
7814 Perl_ck_cmp(pTHX_ OP *o)
7816 PERL_ARGS_ASSERT_CK_CMP;
7817 if (ckWARN(WARN_SYNTAX)) {
7818 const OP *kid = cUNOPo->op_first;
7821 is_dollar_bracket(aTHX_ kid)
7822 && kid->op_sibling && kid->op_sibling->op_type == OP_CONST
7824 || ( kid->op_type == OP_CONST
7825 && (kid = kid->op_sibling) && is_dollar_bracket(aTHX_ kid))
7827 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7828 "$[ used in %s (did you mean $] ?)", OP_DESC(o));
7834 Perl_ck_concat(pTHX_ OP *o)
7836 const OP * const kid = cUNOPo->op_first;
7838 PERL_ARGS_ASSERT_CK_CONCAT;
7839 PERL_UNUSED_CONTEXT;
7841 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
7842 !(kUNOP->op_first->op_flags & OPf_MOD))
7843 o->op_flags |= OPf_STACKED;
7848 Perl_ck_spair(pTHX_ OP *o)
7852 PERL_ARGS_ASSERT_CK_SPAIR;
7854 if (o->op_flags & OPf_KIDS) {
7857 const OPCODE type = o->op_type;
7858 o = modkids(ck_fun(o), type);
7859 kid = cUNOPo->op_first;
7860 newop = kUNOP->op_first->op_sibling;
7862 const OPCODE type = newop->op_type;
7863 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
7864 type == OP_PADAV || type == OP_PADHV ||
7865 type == OP_RV2AV || type == OP_RV2HV)
7869 op_getmad(kUNOP->op_first,newop,'K');
7871 op_free(kUNOP->op_first);
7873 kUNOP->op_first = newop;
7875 o->op_ppaddr = PL_ppaddr[++o->op_type];
7880 Perl_ck_delete(pTHX_ OP *o)
7882 PERL_ARGS_ASSERT_CK_DELETE;
7886 if (o->op_flags & OPf_KIDS) {
7887 OP * const kid = cUNOPo->op_first;
7888 switch (kid->op_type) {
7890 o->op_flags |= OPf_SPECIAL;
7893 o->op_private |= OPpSLICE;
7896 o->op_flags |= OPf_SPECIAL;
7901 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
7904 if (kid->op_private & OPpLVAL_INTRO)
7905 o->op_private |= OPpLVAL_INTRO;
7912 Perl_ck_die(pTHX_ OP *o)
7914 PERL_ARGS_ASSERT_CK_DIE;
7917 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
7923 Perl_ck_eof(pTHX_ OP *o)
7927 PERL_ARGS_ASSERT_CK_EOF;
7929 if (o->op_flags & OPf_KIDS) {
7931 if (cLISTOPo->op_first->op_type == OP_STUB) {
7933 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
7935 op_getmad(o,newop,'O');
7942 kid = cLISTOPo->op_first;
7943 if (kid->op_type == OP_RV2GV)
7944 kid->op_private |= OPpALLOW_FAKE;
7950 Perl_ck_eval(pTHX_ OP *o)
7954 PERL_ARGS_ASSERT_CK_EVAL;
7956 PL_hints |= HINT_BLOCK_SCOPE;
7957 if (o->op_flags & OPf_KIDS) {
7958 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7961 o->op_flags &= ~OPf_KIDS;
7964 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
7970 cUNOPo->op_first = 0;
7975 NewOp(1101, enter, 1, LOGOP);
7976 enter->op_type = OP_ENTERTRY;
7977 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
7978 enter->op_private = 0;
7980 /* establish postfix order */
7981 enter->op_next = (OP*)enter;
7983 o = op_prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
7984 o->op_type = OP_LEAVETRY;
7985 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
7986 enter->op_other = o;
7987 op_getmad(oldo,o,'O');
7996 const U8 priv = o->op_private;
8002 o = newUNOP(OP_ENTEREVAL, priv <<8, newDEFSVOP());
8003 op_getmad(oldo,o,'O');
8005 o->op_targ = (PADOFFSET)PL_hints;
8006 if (o->op_private & OPpEVAL_BYTES) o->op_targ &= ~HINT_UTF8;
8007 if ((PL_hints & HINT_LOCALIZE_HH) != 0
8008 && !(o->op_private & OPpEVAL_COPHH) && GvHV(PL_hintgv)) {
8009 /* Store a copy of %^H that pp_entereval can pick up. */
8010 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
8011 MUTABLE_SV(hv_copy_hints_hv(GvHV(PL_hintgv))));
8012 cUNOPo->op_first->op_sibling = hhop;
8013 o->op_private |= OPpEVAL_HAS_HH;
8015 if (!(o->op_private & OPpEVAL_BYTES)
8016 && FEATURE_UNIEVAL_IS_ENABLED)
8017 o->op_private |= OPpEVAL_UNICODE;
8022 Perl_ck_exit(pTHX_ OP *o)
8024 PERL_ARGS_ASSERT_CK_EXIT;
8027 HV * const table = GvHV(PL_hintgv);
8029 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
8030 if (svp && *svp && SvTRUE(*svp))
8031 o->op_private |= OPpEXIT_VMSISH;
8033 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
8039 Perl_ck_exec(pTHX_ OP *o)
8041 PERL_ARGS_ASSERT_CK_EXEC;
8043 if (o->op_flags & OPf_STACKED) {
8046 kid = cUNOPo->op_first->op_sibling;
8047 if (kid->op_type == OP_RV2GV)
8056 Perl_ck_exists(pTHX_ OP *o)
8060 PERL_ARGS_ASSERT_CK_EXISTS;
8063 if (o->op_flags & OPf_KIDS) {
8064 OP * const kid = cUNOPo->op_first;
8065 if (kid->op_type == OP_ENTERSUB) {
8066 (void) ref(kid, o->op_type);
8067 if (kid->op_type != OP_RV2CV
8068 && !(PL_parser && PL_parser->error_count))
8069 Perl_croak(aTHX_ "%s argument is not a subroutine name",
8071 o->op_private |= OPpEXISTS_SUB;
8073 else if (kid->op_type == OP_AELEM)
8074 o->op_flags |= OPf_SPECIAL;
8075 else if (kid->op_type != OP_HELEM)
8076 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine",
8084 Perl_ck_rvconst(pTHX_ register OP *o)
8087 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8089 PERL_ARGS_ASSERT_CK_RVCONST;
8091 o->op_private |= (PL_hints & HINT_STRICT_REFS);
8092 if (o->op_type == OP_RV2CV)
8093 o->op_private &= ~1;
8095 if (kid->op_type == OP_CONST) {
8098 SV * const kidsv = kid->op_sv;
8100 /* Is it a constant from cv_const_sv()? */
8101 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
8102 SV * const rsv = SvRV(kidsv);
8103 const svtype type = SvTYPE(rsv);
8104 const char *badtype = NULL;
8106 switch (o->op_type) {
8108 if (type > SVt_PVMG)
8109 badtype = "a SCALAR";
8112 if (type != SVt_PVAV)
8113 badtype = "an ARRAY";
8116 if (type != SVt_PVHV)
8120 if (type != SVt_PVCV)
8125 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
8128 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
8129 const char *badthing;
8130 switch (o->op_type) {
8132 badthing = "a SCALAR";
8135 badthing = "an ARRAY";
8138 badthing = "a HASH";
8146 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
8147 SVfARG(kidsv), badthing);
8150 * This is a little tricky. We only want to add the symbol if we
8151 * didn't add it in the lexer. Otherwise we get duplicate strict
8152 * warnings. But if we didn't add it in the lexer, we must at
8153 * least pretend like we wanted to add it even if it existed before,
8154 * or we get possible typo warnings. OPpCONST_ENTERED says
8155 * whether the lexer already added THIS instance of this symbol.
8157 iscv = (o->op_type == OP_RV2CV) * 2;
8159 gv = gv_fetchsv(kidsv,
8160 iscv | !(kid->op_private & OPpCONST_ENTERED),
8163 : o->op_type == OP_RV2SV
8165 : o->op_type == OP_RV2AV
8167 : o->op_type == OP_RV2HV
8170 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
8172 kid->op_type = OP_GV;
8173 SvREFCNT_dec(kid->op_sv);
8175 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
8176 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
8177 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
8179 PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv)));
8181 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
8183 kid->op_private = 0;
8184 kid->op_ppaddr = PL_ppaddr[OP_GV];
8185 /* FAKE globs in the symbol table cause weird bugs (#77810) */
8193 Perl_ck_ftst(pTHX_ OP *o)
8196 const I32 type = o->op_type;
8198 PERL_ARGS_ASSERT_CK_FTST;
8200 if (o->op_flags & OPf_REF) {
8203 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
8204 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8205 const OPCODE kidtype = kid->op_type;
8207 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)
8208 && !(kid->op_private & OPpCONST_FOLDED)) {
8209 OP * const newop = newGVOP(type, OPf_REF,
8210 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
8212 op_getmad(o,newop,'O');
8218 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
8219 o->op_private |= OPpFT_ACCESS;
8220 if (PL_check[kidtype] == Perl_ck_ftst
8221 && kidtype != OP_STAT && kidtype != OP_LSTAT) {
8222 o->op_private |= OPpFT_STACKED;
8223 kid->op_private |= OPpFT_STACKING;
8224 if (kidtype == OP_FTTTY && (
8225 !(kid->op_private & OPpFT_STACKED)
8226 || kid->op_private & OPpFT_AFTER_t
8228 o->op_private |= OPpFT_AFTER_t;
8237 if (type == OP_FTTTY)
8238 o = newGVOP(type, OPf_REF, PL_stdingv);
8240 o = newUNOP(type, 0, newDEFSVOP());
8241 op_getmad(oldo,o,'O');
8247 Perl_ck_fun(pTHX_ OP *o)
8250 const int type = o->op_type;
8251 I32 oa = PL_opargs[type] >> OASHIFT;
8253 PERL_ARGS_ASSERT_CK_FUN;
8255 if (o->op_flags & OPf_STACKED) {
8256 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
8259 return no_fh_allowed(o);
8262 if (o->op_flags & OPf_KIDS) {
8263 OP **tokid = &cLISTOPo->op_first;
8264 OP *kid = cLISTOPo->op_first;
8267 bool seen_optional = FALSE;
8269 if (kid->op_type == OP_PUSHMARK ||
8270 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
8272 tokid = &kid->op_sibling;
8273 kid = kid->op_sibling;
8275 if (kid && kid->op_type == OP_COREARGS) {
8276 bool optional = FALSE;
8279 if (oa & OA_OPTIONAL) optional = TRUE;
8282 if (optional) o->op_private |= numargs;
8287 if (oa & OA_OPTIONAL || (oa & 7) == OA_LIST) {
8288 if (!kid && !seen_optional && PL_opargs[type] & OA_DEFGV)
8289 *tokid = kid = newDEFSVOP();
8290 seen_optional = TRUE;
8295 sibl = kid->op_sibling;
8297 if (!sibl && kid->op_type == OP_STUB) {
8304 /* list seen where single (scalar) arg expected? */
8305 if (numargs == 1 && !(oa >> 4)
8306 && kid->op_type == OP_LIST && type != OP_SCALAR)
8308 return too_many_arguments_pv(o,PL_op_desc[type], 0);
8321 if ((type == OP_PUSH || type == OP_UNSHIFT)
8322 && !kid->op_sibling)
8323 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
8324 "Useless use of %s with no values",
8327 if (kid->op_type == OP_CONST &&
8328 (kid->op_private & OPpCONST_BARE))
8330 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
8331 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
8332 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8333 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
8334 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
8336 op_getmad(kid,newop,'K');
8341 kid->op_sibling = sibl;
8344 else if (kid->op_type == OP_CONST
8345 && ( !SvROK(cSVOPx_sv(kid))
8346 || SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV )
8348 bad_type_pv(numargs, "array", PL_op_desc[type], 0, kid);
8349 /* Defer checks to run-time if we have a scalar arg */
8350 if (kid->op_type == OP_RV2AV || kid->op_type == OP_PADAV)
8351 op_lvalue(kid, type);
8355 if (kid->op_type == OP_CONST &&
8356 (kid->op_private & OPpCONST_BARE))
8358 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
8359 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
8360 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8361 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
8362 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
8364 op_getmad(kid,newop,'K');
8369 kid->op_sibling = sibl;
8372 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
8373 bad_type_pv(numargs, "hash", PL_op_desc[type], 0, kid);
8374 op_lvalue(kid, type);
8378 OP * const newop = newUNOP(OP_NULL, 0, kid);
8379 kid->op_sibling = 0;
8380 newop->op_next = newop;
8382 kid->op_sibling = sibl;
8387 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
8388 if (kid->op_type == OP_CONST &&
8389 (kid->op_private & OPpCONST_BARE))
8391 OP * const newop = newGVOP(OP_GV, 0,
8392 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
8393 if (!(o->op_private & 1) && /* if not unop */
8394 kid == cLISTOPo->op_last)
8395 cLISTOPo->op_last = newop;
8397 op_getmad(kid,newop,'K');
8403 else if (kid->op_type == OP_READLINE) {
8404 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
8405 bad_type_pv(numargs, "HANDLE", OP_DESC(o), 0, kid);
8408 I32 flags = OPf_SPECIAL;
8412 /* is this op a FH constructor? */
8413 if (is_handle_constructor(o,numargs)) {
8414 const char *name = NULL;
8417 bool want_dollar = TRUE;
8420 /* Set a flag to tell rv2gv to vivify
8421 * need to "prove" flag does not mean something
8422 * else already - NI-S 1999/05/07
8425 if (kid->op_type == OP_PADSV) {
8427 = PAD_COMPNAME_SV(kid->op_targ);
8428 name = SvPV_const(namesv, len);
8429 name_utf8 = SvUTF8(namesv);
8431 else if (kid->op_type == OP_RV2SV
8432 && kUNOP->op_first->op_type == OP_GV)
8434 GV * const gv = cGVOPx_gv(kUNOP->op_first);
8436 len = GvNAMELEN(gv);
8437 name_utf8 = GvNAMEUTF8(gv) ? SVf_UTF8 : 0;
8439 else if (kid->op_type == OP_AELEM
8440 || kid->op_type == OP_HELEM)
8443 OP *op = ((BINOP*)kid)->op_first;
8447 const char * const a =
8448 kid->op_type == OP_AELEM ?
8450 if (((op->op_type == OP_RV2AV) ||
8451 (op->op_type == OP_RV2HV)) &&
8452 (firstop = ((UNOP*)op)->op_first) &&
8453 (firstop->op_type == OP_GV)) {
8454 /* packagevar $a[] or $h{} */
8455 GV * const gv = cGVOPx_gv(firstop);
8463 else if (op->op_type == OP_PADAV
8464 || op->op_type == OP_PADHV) {
8465 /* lexicalvar $a[] or $h{} */
8466 const char * const padname =
8467 PAD_COMPNAME_PV(op->op_targ);
8476 name = SvPV_const(tmpstr, len);
8477 name_utf8 = SvUTF8(tmpstr);
8482 name = "__ANONIO__";
8484 want_dollar = FALSE;
8486 op_lvalue(kid, type);
8490 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
8491 namesv = PAD_SVl(targ);
8492 SvUPGRADE(namesv, SVt_PV);
8493 if (want_dollar && *name != '$')
8494 sv_setpvs(namesv, "$");
8495 sv_catpvn(namesv, name, len);
8496 if ( name_utf8 ) SvUTF8_on(namesv);
8499 kid->op_sibling = 0;
8500 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
8501 kid->op_targ = targ;
8502 kid->op_private |= priv;
8504 kid->op_sibling = sibl;
8510 if ((type == OP_UNDEF || type == OP_POS)
8511 && numargs == 1 && !(oa >> 4)
8512 && kid->op_type == OP_LIST)
8513 return too_many_arguments_pv(o,PL_op_desc[type], 0);
8514 op_lvalue(scalar(kid), type);
8518 tokid = &kid->op_sibling;
8519 kid = kid->op_sibling;
8522 if (kid && kid->op_type != OP_STUB)
8523 return too_many_arguments_pv(o,OP_DESC(o), 0);
8524 o->op_private |= numargs;
8526 /* FIXME - should the numargs move as for the PERL_MAD case? */
8527 o->op_private |= numargs;
8529 return too_many_arguments_pv(o,OP_DESC(o), 0);
8533 else if (PL_opargs[type] & OA_DEFGV) {
8535 OP *newop = newUNOP(type, 0, newDEFSVOP());
8536 op_getmad(o,newop,'O');
8539 /* Ordering of these two is important to keep f_map.t passing. */
8541 return newUNOP(type, 0, newDEFSVOP());
8546 while (oa & OA_OPTIONAL)
8548 if (oa && oa != OA_LIST)
8549 return too_few_arguments_pv(o,OP_DESC(o), 0);
8555 Perl_ck_glob(pTHX_ OP *o)
8559 const bool core = o->op_flags & OPf_SPECIAL;
8561 PERL_ARGS_ASSERT_CK_GLOB;
8564 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
8565 op_append_elem(OP_GLOB, o, newDEFSVOP()); /* glob() => glob($_) */
8567 if (core) gv = NULL;
8568 else if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
8569 && GvCVu(gv) && GvIMPORTED_CV(gv)))
8571 GV * const * const gvp =
8572 (GV **)hv_fetchs(PL_globalstash, "glob", FALSE);
8573 gv = gvp ? *gvp : NULL;
8576 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
8579 * \ null - const(wildcard)
8584 * \ mark - glob - rv2cv
8585 * | \ gv(CORE::GLOBAL::glob)
8587 * \ null - const(wildcard) - const(ix)
8589 o->op_flags |= OPf_SPECIAL;
8590 o->op_targ = pad_alloc(OP_GLOB, SVs_PADTMP);
8591 op_append_elem(OP_GLOB, o,
8592 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
8593 o = newLISTOP(OP_LIST, 0, o, NULL);
8594 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
8595 op_append_elem(OP_LIST, o,
8596 scalar(newUNOP(OP_RV2CV, 0,
8597 newGVOP(OP_GV, 0, gv)))));
8598 o = newUNOP(OP_NULL, 0, o);
8599 o->op_targ = OP_GLOB; /* hint at what it used to be: eg in newWHILEOP */
8602 else o->op_flags &= ~OPf_SPECIAL;
8603 #if !defined(PERL_EXTERNAL_GLOB)
8606 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
8607 newSVpvs("File::Glob"), NULL, NULL, NULL);
8610 #endif /* !PERL_EXTERNAL_GLOB */
8611 gv = newGVgen("main");
8613 #ifndef PERL_EXTERNAL_GLOB
8614 sv_setiv(GvSVn(gv),PL_glob_index++);
8616 op_append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
8622 Perl_ck_grep(pTHX_ OP *o)
8627 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
8630 PERL_ARGS_ASSERT_CK_GREP;
8632 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
8633 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
8635 if (o->op_flags & OPf_STACKED) {
8636 kid = cUNOPx(cLISTOPo->op_first->op_sibling)->op_first;
8637 if (kid->op_type != OP_SCOPE && kid->op_type != OP_LEAVE)
8638 return no_fh_allowed(o);
8639 o->op_flags &= ~OPf_STACKED;
8641 kid = cLISTOPo->op_first->op_sibling;
8642 if (type == OP_MAPWHILE)
8647 if (PL_parser && PL_parser->error_count)
8649 kid = cLISTOPo->op_first->op_sibling;
8650 if (kid->op_type != OP_NULL)
8651 Perl_croak(aTHX_ "panic: ck_grep, type=%u", (unsigned) kid->op_type);
8652 kid = kUNOP->op_first;
8654 NewOp(1101, gwop, 1, LOGOP);
8655 gwop->op_type = type;
8656 gwop->op_ppaddr = PL_ppaddr[type];
8658 gwop->op_flags |= OPf_KIDS;
8659 gwop->op_other = LINKLIST(kid);
8660 kid->op_next = (OP*)gwop;
8661 offset = pad_findmy_pvs("$_", 0);
8662 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
8663 o->op_private = gwop->op_private = 0;
8664 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
8667 o->op_private = gwop->op_private = OPpGREP_LEX;
8668 gwop->op_targ = o->op_targ = offset;
8671 kid = cLISTOPo->op_first->op_sibling;
8672 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
8673 op_lvalue(kid, OP_GREPSTART);
8679 Perl_ck_index(pTHX_ OP *o)
8681 PERL_ARGS_ASSERT_CK_INDEX;
8683 if (o->op_flags & OPf_KIDS) {
8684 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8686 kid = kid->op_sibling; /* get past "big" */
8687 if (kid && kid->op_type == OP_CONST) {
8688 const bool save_taint = PL_tainted;
8689 fbm_compile(((SVOP*)kid)->op_sv, 0);
8690 PL_tainted = save_taint;
8697 Perl_ck_lfun(pTHX_ OP *o)
8699 const OPCODE type = o->op_type;
8701 PERL_ARGS_ASSERT_CK_LFUN;
8703 return modkids(ck_fun(o), type);
8707 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
8709 PERL_ARGS_ASSERT_CK_DEFINED;
8711 if ((o->op_flags & OPf_KIDS)) {
8712 switch (cUNOPo->op_first->op_type) {
8715 case OP_AASSIGN: /* Is this a good idea? */
8716 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8717 "defined(@array) is deprecated");
8718 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8719 "\t(Maybe you should just omit the defined()?)\n");
8723 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8724 "defined(%%hash) is deprecated");
8725 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8726 "\t(Maybe you should just omit the defined()?)\n");
8737 Perl_ck_readline(pTHX_ OP *o)
8739 PERL_ARGS_ASSERT_CK_READLINE;
8741 if (o->op_flags & OPf_KIDS) {
8742 OP *kid = cLISTOPo->op_first;
8743 if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE;
8747 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
8749 op_getmad(o,newop,'O');
8759 Perl_ck_rfun(pTHX_ OP *o)
8761 const OPCODE type = o->op_type;
8763 PERL_ARGS_ASSERT_CK_RFUN;
8765 return refkids(ck_fun(o), type);
8769 Perl_ck_listiob(pTHX_ OP *o)
8773 PERL_ARGS_ASSERT_CK_LISTIOB;
8775 kid = cLISTOPo->op_first;
8778 kid = cLISTOPo->op_first;
8780 if (kid->op_type == OP_PUSHMARK)
8781 kid = kid->op_sibling;
8782 if (kid && o->op_flags & OPf_STACKED)
8783 kid = kid->op_sibling;
8784 else if (kid && !kid->op_sibling) { /* print HANDLE; */
8785 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE
8786 && !(kid->op_private & OPpCONST_FOLDED)) {
8787 o->op_flags |= OPf_STACKED; /* make it a filehandle */
8788 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
8789 cLISTOPo->op_first->op_sibling = kid;
8790 cLISTOPo->op_last = kid;
8791 kid = kid->op_sibling;
8796 op_append_elem(o->op_type, o, newDEFSVOP());
8798 if (o->op_type == OP_PRTF) return modkids(listkids(o), OP_PRTF);
8803 Perl_ck_smartmatch(pTHX_ OP *o)
8806 PERL_ARGS_ASSERT_CK_SMARTMATCH;
8807 if (0 == (o->op_flags & OPf_SPECIAL)) {
8808 OP *first = cBINOPo->op_first;
8809 OP *second = first->op_sibling;
8811 /* Implicitly take a reference to an array or hash */
8812 first->op_sibling = NULL;
8813 first = cBINOPo->op_first = ref_array_or_hash(first);
8814 second = first->op_sibling = ref_array_or_hash(second);
8816 /* Implicitly take a reference to a regular expression */
8817 if (first->op_type == OP_MATCH) {
8818 first->op_type = OP_QR;
8819 first->op_ppaddr = PL_ppaddr[OP_QR];
8821 if (second->op_type == OP_MATCH) {
8822 second->op_type = OP_QR;
8823 second->op_ppaddr = PL_ppaddr[OP_QR];
8832 Perl_ck_sassign(pTHX_ OP *o)
8835 OP * const kid = cLISTOPo->op_first;
8837 PERL_ARGS_ASSERT_CK_SASSIGN;
8839 /* has a disposable target? */
8840 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
8841 && !(kid->op_flags & OPf_STACKED)
8842 /* Cannot steal the second time! */
8843 && !(kid->op_private & OPpTARGET_MY)
8844 /* Keep the full thing for madskills */
8848 OP * const kkid = kid->op_sibling;
8850 /* Can just relocate the target. */
8851 if (kkid && kkid->op_type == OP_PADSV
8852 && !(kkid->op_private & OPpLVAL_INTRO))
8854 kid->op_targ = kkid->op_targ;
8856 /* Now we do not need PADSV and SASSIGN. */
8857 kid->op_sibling = o->op_sibling; /* NULL */
8858 cLISTOPo->op_first = NULL;
8861 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
8865 if (kid->op_sibling) {
8866 OP *kkid = kid->op_sibling;
8867 /* For state variable assignment, kkid is a list op whose op_last
8869 if ((kkid->op_type == OP_PADSV ||
8870 (kkid->op_type == OP_LIST &&
8871 (kkid = cLISTOPx(kkid)->op_last)->op_type == OP_PADSV
8874 && (kkid->op_private & OPpLVAL_INTRO)
8875 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
8876 const PADOFFSET target = kkid->op_targ;
8877 OP *const other = newOP(OP_PADSV,
8879 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
8880 OP *const first = newOP(OP_NULL, 0);
8881 OP *const nullop = newCONDOP(0, first, o, other);
8882 OP *const condop = first->op_next;
8883 /* hijacking PADSTALE for uninitialized state variables */
8884 SvPADSTALE_on(PAD_SVl(target));
8886 condop->op_type = OP_ONCE;
8887 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
8888 condop->op_targ = target;
8889 other->op_targ = target;
8891 /* Because we change the type of the op here, we will skip the
8892 assignment binop->op_last = binop->op_first->op_sibling; at the
8893 end of Perl_newBINOP(). So need to do it here. */
8894 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
8903 Perl_ck_match(pTHX_ OP *o)
8907 PERL_ARGS_ASSERT_CK_MATCH;
8909 if (o->op_type != OP_QR && PL_compcv) {
8910 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
8911 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
8912 o->op_targ = offset;
8913 o->op_private |= OPpTARGET_MY;
8916 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
8917 o->op_private |= OPpRUNTIME;
8922 Perl_ck_method(pTHX_ OP *o)
8924 OP * const kid = cUNOPo->op_first;
8926 PERL_ARGS_ASSERT_CK_METHOD;
8928 if (kid->op_type == OP_CONST) {
8929 SV* sv = kSVOP->op_sv;
8930 const char * const method = SvPVX_const(sv);
8931 if (!(strchr(method, ':') || strchr(method, '\''))) {
8933 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
8934 sv = newSVpvn_share(method, SvUTF8(sv) ? -(I32)SvCUR(sv) : (I32)SvCUR(sv), 0);
8937 kSVOP->op_sv = NULL;
8939 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
8941 op_getmad(o,cmop,'O');
8952 Perl_ck_null(pTHX_ OP *o)
8954 PERL_ARGS_ASSERT_CK_NULL;
8955 PERL_UNUSED_CONTEXT;
8960 Perl_ck_open(pTHX_ OP *o)
8963 HV * const table = GvHV(PL_hintgv);
8965 PERL_ARGS_ASSERT_CK_OPEN;
8968 SV **svp = hv_fetchs(table, "open_IN", FALSE);
8971 const char *d = SvPV_const(*svp, len);
8972 const I32 mode = mode_from_discipline(d, len);
8973 if (mode & O_BINARY)
8974 o->op_private |= OPpOPEN_IN_RAW;
8975 else if (mode & O_TEXT)
8976 o->op_private |= OPpOPEN_IN_CRLF;
8979 svp = hv_fetchs(table, "open_OUT", FALSE);
8982 const char *d = SvPV_const(*svp, len);
8983 const I32 mode = mode_from_discipline(d, len);
8984 if (mode & O_BINARY)
8985 o->op_private |= OPpOPEN_OUT_RAW;
8986 else if (mode & O_TEXT)
8987 o->op_private |= OPpOPEN_OUT_CRLF;
8990 if (o->op_type == OP_BACKTICK) {
8991 if (!(o->op_flags & OPf_KIDS)) {
8992 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
8994 op_getmad(o,newop,'O');
9003 /* In case of three-arg dup open remove strictness
9004 * from the last arg if it is a bareword. */
9005 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
9006 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
9010 if ((last->op_type == OP_CONST) && /* The bareword. */
9011 (last->op_private & OPpCONST_BARE) &&
9012 (last->op_private & OPpCONST_STRICT) &&
9013 (oa = first->op_sibling) && /* The fh. */
9014 (oa = oa->op_sibling) && /* The mode. */
9015 (oa->op_type == OP_CONST) &&
9016 SvPOK(((SVOP*)oa)->op_sv) &&
9017 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
9018 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
9019 (last == oa->op_sibling)) /* The bareword. */
9020 last->op_private &= ~OPpCONST_STRICT;
9026 Perl_ck_repeat(pTHX_ OP *o)
9028 PERL_ARGS_ASSERT_CK_REPEAT;
9030 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
9031 o->op_private |= OPpREPEAT_DOLIST;
9032 cBINOPo->op_first = force_list(cBINOPo->op_first);
9040 Perl_ck_require(pTHX_ OP *o)
9045 PERL_ARGS_ASSERT_CK_REQUIRE;
9047 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
9048 SVOP * const kid = (SVOP*)cUNOPo->op_first;
9050 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
9051 SV * const sv = kid->op_sv;
9052 U32 was_readonly = SvREADONLY(sv);
9059 sv_force_normal_flags(sv, 0);
9060 assert(!SvREADONLY(sv));
9070 for (; s < end; s++) {
9071 if (*s == ':' && s[1] == ':') {
9073 Move(s+2, s+1, end - s - 1, char);
9078 sv_catpvs(sv, ".pm");
9079 SvFLAGS(sv) |= was_readonly;
9083 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
9084 /* handle override, if any */
9085 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
9086 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
9087 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
9088 gv = gvp ? *gvp : NULL;
9092 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
9094 if (o->op_flags & OPf_KIDS) {
9095 kid = cUNOPo->op_first;
9096 cUNOPo->op_first = NULL;
9104 newop = newUNOP(OP_ENTERSUB, OPf_STACKED,
9105 op_append_elem(OP_LIST, kid,
9106 scalar(newUNOP(OP_RV2CV, 0,
9109 op_getmad(o,newop,'O');
9113 return scalar(ck_fun(o));
9117 Perl_ck_return(pTHX_ OP *o)
9122 PERL_ARGS_ASSERT_CK_RETURN;
9124 kid = cLISTOPo->op_first->op_sibling;
9125 if (CvLVALUE(PL_compcv)) {
9126 for (; kid; kid = kid->op_sibling)
9127 op_lvalue(kid, OP_LEAVESUBLV);
9134 Perl_ck_select(pTHX_ OP *o)
9139 PERL_ARGS_ASSERT_CK_SELECT;
9141 if (o->op_flags & OPf_KIDS) {
9142 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9143 if (kid && kid->op_sibling) {
9144 o->op_type = OP_SSELECT;
9145 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
9147 return fold_constants(op_integerize(op_std_init(o)));
9151 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9152 if (kid && kid->op_type == OP_RV2GV)
9153 kid->op_private &= ~HINT_STRICT_REFS;
9158 Perl_ck_shift(pTHX_ OP *o)
9161 const I32 type = o->op_type;
9163 PERL_ARGS_ASSERT_CK_SHIFT;
9165 if (!(o->op_flags & OPf_KIDS)) {
9168 if (!CvUNIQUE(PL_compcv)) {
9169 o->op_flags |= OPf_SPECIAL;
9173 argop = newUNOP(OP_RV2AV, 0, scalar(newGVOP(OP_GV, 0, PL_argvgv)));
9176 OP * const oldo = o;
9177 o = newUNOP(type, 0, scalar(argop));
9178 op_getmad(oldo,o,'O');
9183 return newUNOP(type, 0, scalar(argop));
9186 return scalar(ck_fun(o));
9190 Perl_ck_sort(pTHX_ OP *o)
9194 HV * const hinthv = GvHV(PL_hintgv);
9196 PERL_ARGS_ASSERT_CK_SORT;
9199 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
9201 const I32 sorthints = (I32)SvIV(*svp);
9202 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
9203 o->op_private |= OPpSORT_QSORT;
9204 if ((sorthints & HINT_SORT_STABLE) != 0)
9205 o->op_private |= OPpSORT_STABLE;
9209 if (o->op_flags & OPf_STACKED)
9211 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9212 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
9213 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
9215 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
9217 if (kid->op_type == OP_LEAVE)
9218 op_null(kid); /* wipe out leave */
9219 /* Prevent execution from escaping out of the sort block. */
9222 /* provide scalar context for comparison function/block */
9223 kid = scalar(firstkid);
9225 o->op_flags |= OPf_SPECIAL;
9228 firstkid = firstkid->op_sibling;
9231 /* provide list context for arguments */
9238 S_simplify_sort(pTHX_ OP *o)
9241 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9248 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
9250 if (!(o->op_flags & OPf_STACKED))
9252 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
9253 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
9254 kid = kUNOP->op_first; /* get past null */
9255 if (!(have_scopeop = kid->op_type == OP_SCOPE)
9256 && kid->op_type != OP_LEAVE)
9258 kid = kLISTOP->op_last; /* get past scope */
9259 switch(kid->op_type) {
9263 if (!have_scopeop) goto padkids;
9268 k = kid; /* remember this node*/
9269 if (kBINOP->op_first->op_type != OP_RV2SV
9270 || kBINOP->op_last ->op_type != OP_RV2SV)
9273 Warn about my($a) or my($b) in a sort block, *if* $a or $b is
9274 then used in a comparison. This catches most, but not
9275 all cases. For instance, it catches
9276 sort { my($a); $a <=> $b }
9278 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
9279 (although why you'd do that is anyone's guess).
9283 if (!ckWARN(WARN_SYNTAX)) return;
9284 kid = kBINOP->op_first;
9286 if (kid->op_type == OP_PADSV) {
9287 SV * const name = AvARRAY(PL_comppad_name)[kid->op_targ];
9288 if (SvCUR(name) == 2 && *SvPVX(name) == '$'
9289 && (SvPVX(name)[1] == 'a' || SvPVX(name)[1] == 'b'))
9290 /* diag_listed_as: "my %s" used in sort comparison */
9291 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
9292 "\"%s %s\" used in sort comparison",
9293 SvPAD_STATE(name) ? "state" : "my",
9296 } while ((kid = kid->op_sibling));
9299 kid = kBINOP->op_first; /* get past cmp */
9300 if (kUNOP->op_first->op_type != OP_GV)
9302 kid = kUNOP->op_first; /* get past rv2sv */
9304 if (GvSTASH(gv) != PL_curstash)
9306 gvname = GvNAME(gv);
9307 if (*gvname == 'a' && gvname[1] == '\0')
9309 else if (*gvname == 'b' && gvname[1] == '\0')
9314 kid = k; /* back to cmp */
9315 /* already checked above that it is rv2sv */
9316 kid = kBINOP->op_last; /* down to 2nd arg */
9317 if (kUNOP->op_first->op_type != OP_GV)
9319 kid = kUNOP->op_first; /* get past rv2sv */
9321 if (GvSTASH(gv) != PL_curstash)
9323 gvname = GvNAME(gv);
9325 ? !(*gvname == 'a' && gvname[1] == '\0')
9326 : !(*gvname == 'b' && gvname[1] == '\0'))
9328 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
9330 o->op_private |= OPpSORT_DESCEND;
9331 if (k->op_type == OP_NCMP)
9332 o->op_private |= OPpSORT_NUMERIC;
9333 if (k->op_type == OP_I_NCMP)
9334 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
9335 kid = cLISTOPo->op_first->op_sibling;
9336 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
9338 op_getmad(kid,o,'S'); /* then delete it */
9340 op_free(kid); /* then delete it */
9345 Perl_ck_split(pTHX_ OP *o)
9350 PERL_ARGS_ASSERT_CK_SPLIT;
9352 if (o->op_flags & OPf_STACKED)
9353 return no_fh_allowed(o);
9355 kid = cLISTOPo->op_first;
9356 if (kid->op_type != OP_NULL)
9357 Perl_croak(aTHX_ "panic: ck_split, type=%u", (unsigned) kid->op_type);
9358 kid = kid->op_sibling;
9359 op_free(cLISTOPo->op_first);
9361 cLISTOPo->op_first = kid;
9363 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
9364 cLISTOPo->op_last = kid; /* There was only one element previously */
9367 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
9368 OP * const sibl = kid->op_sibling;
9369 kid->op_sibling = 0;
9370 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0, 0);
9371 if (cLISTOPo->op_first == cLISTOPo->op_last)
9372 cLISTOPo->op_last = kid;
9373 cLISTOPo->op_first = kid;
9374 kid->op_sibling = sibl;
9377 kid->op_type = OP_PUSHRE;
9378 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
9380 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
9381 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP),
9382 "Use of /g modifier is meaningless in split");
9385 if (!kid->op_sibling)
9386 op_append_elem(OP_SPLIT, o, newDEFSVOP());
9388 kid = kid->op_sibling;
9391 if (!kid->op_sibling)
9392 op_append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
9393 assert(kid->op_sibling);
9395 kid = kid->op_sibling;
9398 if (kid->op_sibling)
9399 return too_many_arguments_pv(o,OP_DESC(o), 0);
9405 Perl_ck_join(pTHX_ OP *o)
9407 const OP * const kid = cLISTOPo->op_first->op_sibling;
9409 PERL_ARGS_ASSERT_CK_JOIN;
9411 if (kid && kid->op_type == OP_MATCH) {
9412 if (ckWARN(WARN_SYNTAX)) {
9413 const REGEXP *re = PM_GETRE(kPMOP);
9415 ? newSVpvn_flags( RX_PRECOMP_const(re), RX_PRELEN(re),
9416 SVs_TEMP | ( RX_UTF8(re) ? SVf_UTF8 : 0 ) )
9417 : newSVpvs_flags( "STRING", SVs_TEMP );
9418 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
9419 "/%"SVf"/ should probably be written as \"%"SVf"\"",
9420 SVfARG(msg), SVfARG(msg));
9427 =for apidoc Am|CV *|rv2cv_op_cv|OP *cvop|U32 flags
9429 Examines an op, which is expected to identify a subroutine at runtime,
9430 and attempts to determine at compile time which subroutine it identifies.
9431 This is normally used during Perl compilation to determine whether
9432 a prototype can be applied to a function call. I<cvop> is the op
9433 being considered, normally an C<rv2cv> op. A pointer to the identified
9434 subroutine is returned, if it could be determined statically, and a null
9435 pointer is returned if it was not possible to determine statically.
9437 Currently, the subroutine can be identified statically if the RV that the
9438 C<rv2cv> is to operate on is provided by a suitable C<gv> or C<const> op.
9439 A C<gv> op is suitable if the GV's CV slot is populated. A C<const> op is
9440 suitable if the constant value must be an RV pointing to a CV. Details of
9441 this process may change in future versions of Perl. If the C<rv2cv> op
9442 has the C<OPpENTERSUB_AMPER> flag set then no attempt is made to identify
9443 the subroutine statically: this flag is used to suppress compile-time
9444 magic on a subroutine call, forcing it to use default runtime behaviour.
9446 If I<flags> has the bit C<RV2CVOPCV_MARK_EARLY> set, then the handling
9447 of a GV reference is modified. If a GV was examined and its CV slot was
9448 found to be empty, then the C<gv> op has the C<OPpEARLY_CV> flag set.
9449 If the op is not optimised away, and the CV slot is later populated with
9450 a subroutine having a prototype, that flag eventually triggers the warning
9451 "called too early to check prototype".
9453 If I<flags> has the bit C<RV2CVOPCV_RETURN_NAME_GV> set, then instead
9454 of returning a pointer to the subroutine it returns a pointer to the
9455 GV giving the most appropriate name for the subroutine in this context.
9456 Normally this is just the C<CvGV> of the subroutine, but for an anonymous
9457 (C<CvANON>) subroutine that is referenced through a GV it will be the
9458 referencing GV. The resulting C<GV*> is cast to C<CV*> to be returned.
9459 A null pointer is returned as usual if there is no statically-determinable
9466 Perl_rv2cv_op_cv(pTHX_ OP *cvop, U32 flags)
9471 PERL_ARGS_ASSERT_RV2CV_OP_CV;
9472 if (flags & ~(RV2CVOPCV_MARK_EARLY|RV2CVOPCV_RETURN_NAME_GV))
9473 Perl_croak(aTHX_ "panic: rv2cv_op_cv bad flags %x", (unsigned)flags);
9474 if (cvop->op_type != OP_RV2CV)
9476 if (cvop->op_private & OPpENTERSUB_AMPER)
9478 if (!(cvop->op_flags & OPf_KIDS))
9480 rvop = cUNOPx(cvop)->op_first;
9481 switch (rvop->op_type) {
9483 gv = cGVOPx_gv(rvop);
9486 if (flags & RV2CVOPCV_MARK_EARLY)
9487 rvop->op_private |= OPpEARLY_CV;
9492 SV *rv = cSVOPx_sv(rvop);
9502 if (SvTYPE((SV*)cv) != SVt_PVCV)
9504 if (flags & RV2CVOPCV_RETURN_NAME_GV) {
9505 if (!CvANON(cv) || !gv)
9514 =for apidoc Am|OP *|ck_entersub_args_list|OP *entersubop
9516 Performs the default fixup of the arguments part of an C<entersub>
9517 op tree. This consists of applying list context to each of the
9518 argument ops. This is the standard treatment used on a call marked
9519 with C<&>, or a method call, or a call through a subroutine reference,
9520 or any other call where the callee can't be identified at compile time,
9521 or a call where the callee has no prototype.
9527 Perl_ck_entersub_args_list(pTHX_ OP *entersubop)
9530 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_LIST;
9531 aop = cUNOPx(entersubop)->op_first;
9532 if (!aop->op_sibling)
9533 aop = cUNOPx(aop)->op_first;
9534 for (aop = aop->op_sibling; aop->op_sibling; aop = aop->op_sibling) {
9535 if (!(PL_madskills && aop->op_type == OP_STUB)) {
9537 op_lvalue(aop, OP_ENTERSUB);
9544 =for apidoc Am|OP *|ck_entersub_args_proto|OP *entersubop|GV *namegv|SV *protosv
9546 Performs the fixup of the arguments part of an C<entersub> op tree
9547 based on a subroutine prototype. This makes various modifications to
9548 the argument ops, from applying context up to inserting C<refgen> ops,
9549 and checking the number and syntactic types of arguments, as directed by
9550 the prototype. This is the standard treatment used on a subroutine call,
9551 not marked with C<&>, where the callee can be identified at compile time
9552 and has a prototype.
9554 I<protosv> supplies the subroutine prototype to be applied to the call.
9555 It may be a normal defined scalar, of which the string value will be used.
9556 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
9557 that has been cast to C<SV*>) which has a prototype. The prototype
9558 supplied, in whichever form, does not need to match the actual callee
9559 referenced by the op tree.
9561 If the argument ops disagree with the prototype, for example by having
9562 an unacceptable number of arguments, a valid op tree is returned anyway.
9563 The error is reflected in the parser state, normally resulting in a single
9564 exception at the top level of parsing which covers all the compilation
9565 errors that occurred. In the error message, the callee is referred to
9566 by the name defined by the I<namegv> parameter.
9572 Perl_ck_entersub_args_proto(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
9575 const char *proto, *proto_end;
9576 OP *aop, *prev, *cvop;
9579 I32 contextclass = 0;
9580 const char *e = NULL;
9581 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO;
9582 if (SvTYPE(protosv) == SVt_PVCV ? !SvPOK(protosv) : !SvOK(protosv))
9583 Perl_croak(aTHX_ "panic: ck_entersub_args_proto CV with no proto, "
9584 "flags=%lx", (unsigned long) SvFLAGS(protosv));
9585 if (SvTYPE(protosv) == SVt_PVCV)
9586 proto = CvPROTO(protosv), proto_len = CvPROTOLEN(protosv);
9587 else proto = SvPV(protosv, proto_len);
9588 proto_end = proto + proto_len;
9589 aop = cUNOPx(entersubop)->op_first;
9590 if (!aop->op_sibling)
9591 aop = cUNOPx(aop)->op_first;
9593 aop = aop->op_sibling;
9594 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
9595 while (aop != cvop) {
9597 if (PL_madskills && aop->op_type == OP_STUB) {
9598 aop = aop->op_sibling;
9601 if (PL_madskills && aop->op_type == OP_NULL)
9602 o3 = ((UNOP*)aop)->op_first;
9606 if (proto >= proto_end)
9607 return too_many_arguments_sv(entersubop, gv_ename(namegv), 0);
9615 /* _ must be at the end */
9616 if (proto[1] && !strchr(";@%", proto[1]))
9631 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
9633 arg == 1 ? "block or sub {}" : "sub {}",
9634 gv_ename(namegv), 0, o3);
9637 /* '*' allows any scalar type, including bareword */
9640 if (o3->op_type == OP_RV2GV)
9641 goto wrapref; /* autoconvert GLOB -> GLOBref */
9642 else if (o3->op_type == OP_CONST)
9643 o3->op_private &= ~OPpCONST_STRICT;
9644 else if (o3->op_type == OP_ENTERSUB) {
9645 /* accidental subroutine, revert to bareword */
9646 OP *gvop = ((UNOP*)o3)->op_first;
9647 if (gvop && gvop->op_type == OP_NULL) {
9648 gvop = ((UNOP*)gvop)->op_first;
9650 for (; gvop->op_sibling; gvop = gvop->op_sibling)
9653 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
9654 (gvop = ((UNOP*)gvop)->op_first) &&
9655 gvop->op_type == OP_GV)
9657 GV * const gv = cGVOPx_gv(gvop);
9658 OP * const sibling = aop->op_sibling;
9659 SV * const n = newSVpvs("");
9661 OP * const oldaop = aop;
9665 gv_fullname4(n, gv, "", FALSE);
9666 aop = newSVOP(OP_CONST, 0, n);
9667 op_getmad(oldaop,aop,'O');
9668 prev->op_sibling = aop;
9669 aop->op_sibling = sibling;
9679 if (o3->op_type == OP_RV2AV ||
9680 o3->op_type == OP_PADAV ||
9681 o3->op_type == OP_RV2HV ||
9682 o3->op_type == OP_PADHV
9697 if (contextclass++ == 0) {
9698 e = strchr(proto, ']');
9699 if (!e || e == proto)
9708 const char *p = proto;
9709 const char *const end = proto;
9712 /* \[$] accepts any scalar lvalue */
9714 && Perl_op_lvalue_flags(aTHX_
9716 OP_READ, /* not entersub */
9719 bad_type_sv(arg, Perl_form(aTHX_ "one of %.*s",
9721 gv_ename(namegv), 0, o3);
9726 if (o3->op_type == OP_RV2GV)
9729 bad_type_sv(arg, "symbol", gv_ename(namegv), 0, o3);
9732 if (o3->op_type == OP_ENTERSUB)
9735 bad_type_sv(arg, "subroutine entry", gv_ename(namegv), 0,
9739 if (o3->op_type == OP_RV2SV ||
9740 o3->op_type == OP_PADSV ||
9741 o3->op_type == OP_HELEM ||
9742 o3->op_type == OP_AELEM)
9744 if (!contextclass) {
9745 /* \$ accepts any scalar lvalue */
9746 if (Perl_op_lvalue_flags(aTHX_
9748 OP_READ, /* not entersub */
9751 bad_type_sv(arg, "scalar", gv_ename(namegv), 0, o3);
9755 if (o3->op_type == OP_RV2AV ||
9756 o3->op_type == OP_PADAV)
9759 bad_type_sv(arg, "array", gv_ename(namegv), 0, o3);
9762 if (o3->op_type == OP_RV2HV ||
9763 o3->op_type == OP_PADHV)
9766 bad_type_sv(arg, "hash", gv_ename(namegv), 0, o3);
9770 OP* const kid = aop;
9771 OP* const sib = kid->op_sibling;
9772 kid->op_sibling = 0;
9773 aop = newUNOP(OP_REFGEN, 0, kid);
9774 aop->op_sibling = sib;
9775 prev->op_sibling = aop;
9777 if (contextclass && e) {
9792 SV* const tmpsv = sv_newmortal();
9793 gv_efullname3(tmpsv, namegv, NULL);
9794 Perl_croak(aTHX_ "Malformed prototype for %"SVf": %"SVf,
9795 SVfARG(tmpsv), SVfARG(protosv));
9799 op_lvalue(aop, OP_ENTERSUB);
9801 aop = aop->op_sibling;
9803 if (aop == cvop && *proto == '_') {
9804 /* generate an access to $_ */
9806 aop->op_sibling = prev->op_sibling;
9807 prev->op_sibling = aop; /* instead of cvop */
9809 if (!optional && proto_end > proto &&
9810 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
9811 return too_few_arguments_sv(entersubop, gv_ename(namegv), 0);
9816 =for apidoc Am|OP *|ck_entersub_args_proto_or_list|OP *entersubop|GV *namegv|SV *protosv
9818 Performs the fixup of the arguments part of an C<entersub> op tree either
9819 based on a subroutine prototype or using default list-context processing.
9820 This is the standard treatment used on a subroutine call, not marked
9821 with C<&>, where the callee can be identified at compile time.
9823 I<protosv> supplies the subroutine prototype to be applied to the call,
9824 or indicates that there is no prototype. It may be a normal scalar,
9825 in which case if it is defined then the string value will be used
9826 as a prototype, and if it is undefined then there is no prototype.
9827 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
9828 that has been cast to C<SV*>), of which the prototype will be used if it
9829 has one. The prototype (or lack thereof) supplied, in whichever form,
9830 does not need to match the actual callee referenced by the op tree.
9832 If the argument ops disagree with the prototype, for example by having
9833 an unacceptable number of arguments, a valid op tree is returned anyway.
9834 The error is reflected in the parser state, normally resulting in a single
9835 exception at the top level of parsing which covers all the compilation
9836 errors that occurred. In the error message, the callee is referred to
9837 by the name defined by the I<namegv> parameter.
9843 Perl_ck_entersub_args_proto_or_list(pTHX_ OP *entersubop,
9844 GV *namegv, SV *protosv)
9846 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO_OR_LIST;
9847 if (SvTYPE(protosv) == SVt_PVCV ? SvPOK(protosv) : SvOK(protosv))
9848 return ck_entersub_args_proto(entersubop, namegv, protosv);
9850 return ck_entersub_args_list(entersubop);
9854 Perl_ck_entersub_args_core(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
9856 int opnum = SvTYPE(protosv) == SVt_PVCV ? 0 : (int)SvUV(protosv);
9857 OP *aop = cUNOPx(entersubop)->op_first;
9859 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_CORE;
9863 if (!aop->op_sibling)
9864 aop = cUNOPx(aop)->op_first;
9865 aop = aop->op_sibling;
9866 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
9867 if (PL_madskills) while (aop != cvop && aop->op_type == OP_STUB) {
9868 aop = aop->op_sibling;
9871 (void)too_many_arguments_pv(entersubop, GvNAME(namegv), 0);
9873 op_free(entersubop);
9874 switch(GvNAME(namegv)[2]) {
9875 case 'F': return newSVOP(OP_CONST, 0,
9876 newSVpv(CopFILE(PL_curcop),0));
9877 case 'L': return newSVOP(
9880 "%"IVdf, (IV)CopLINE(PL_curcop)
9883 case 'P': return newSVOP(OP_CONST, 0,
9885 ? newSVhek(HvNAME_HEK(PL_curstash))
9896 bool seenarg = FALSE;
9898 if (!aop->op_sibling)
9899 aop = cUNOPx(aop)->op_first;
9902 aop = aop->op_sibling;
9903 prev->op_sibling = NULL;
9906 prev=cvop, cvop = cvop->op_sibling)
9908 if (PL_madskills && cvop->op_sibling
9909 && cvop->op_type != OP_STUB) seenarg = TRUE
9912 prev->op_sibling = NULL;
9913 flags = OPf_SPECIAL * !(cvop->op_private & OPpENTERSUB_NOPAREN);
9915 if (aop == cvop) aop = NULL;
9916 op_free(entersubop);
9918 if (opnum == OP_ENTEREVAL
9919 && GvNAMELEN(namegv)==9 && strnEQ(GvNAME(namegv), "evalbytes", 9))
9920 flags |= OPpEVAL_BYTES <<8;
9922 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
9924 case OA_BASEOP_OR_UNOP:
9926 return aop ? newUNOP(opnum,flags,aop) : newOP(opnum,flags);
9930 if (!PL_madskills || seenarg)
9932 (void)too_many_arguments_pv(aop, GvNAME(namegv), 0);
9935 return opnum == OP_RUNCV
9936 ? newPVOP(OP_RUNCV,0,NULL)
9939 return convert(opnum,0,aop);
9947 =for apidoc Am|void|cv_get_call_checker|CV *cv|Perl_call_checker *ckfun_p|SV **ckobj_p
9949 Retrieves the function that will be used to fix up a call to I<cv>.
9950 Specifically, the function is applied to an C<entersub> op tree for a
9951 subroutine call, not marked with C<&>, where the callee can be identified
9952 at compile time as I<cv>.
9954 The C-level function pointer is returned in I<*ckfun_p>, and an SV
9955 argument for it is returned in I<*ckobj_p>. The function is intended
9956 to be called in this manner:
9958 entersubop = (*ckfun_p)(aTHX_ entersubop, namegv, (*ckobj_p));
9960 In this call, I<entersubop> is a pointer to the C<entersub> op,
9961 which may be replaced by the check function, and I<namegv> is a GV
9962 supplying the name that should be used by the check function to refer
9963 to the callee of the C<entersub> op if it needs to emit any diagnostics.
9964 It is permitted to apply the check function in non-standard situations,
9965 such as to a call to a different subroutine or to a method call.
9967 By default, the function is
9968 L<Perl_ck_entersub_args_proto_or_list|/ck_entersub_args_proto_or_list>,
9969 and the SV parameter is I<cv> itself. This implements standard
9970 prototype processing. It can be changed, for a particular subroutine,
9971 by L</cv_set_call_checker>.
9977 Perl_cv_get_call_checker(pTHX_ CV *cv, Perl_call_checker *ckfun_p, SV **ckobj_p)
9980 PERL_ARGS_ASSERT_CV_GET_CALL_CHECKER;
9981 callmg = SvMAGICAL((SV*)cv) ? mg_find((SV*)cv, PERL_MAGIC_checkcall) : NULL;
9983 *ckfun_p = DPTR2FPTR(Perl_call_checker, callmg->mg_ptr);
9984 *ckobj_p = callmg->mg_obj;
9986 *ckfun_p = Perl_ck_entersub_args_proto_or_list;
9992 =for apidoc Am|void|cv_set_call_checker|CV *cv|Perl_call_checker ckfun|SV *ckobj
9994 Sets the function that will be used to fix up a call to I<cv>.
9995 Specifically, the function is applied to an C<entersub> op tree for a
9996 subroutine call, not marked with C<&>, where the callee can be identified
9997 at compile time as I<cv>.
9999 The C-level function pointer is supplied in I<ckfun>, and an SV argument
10000 for it is supplied in I<ckobj>. The function is intended to be called
10003 entersubop = ckfun(aTHX_ entersubop, namegv, ckobj);
10005 In this call, I<entersubop> is a pointer to the C<entersub> op,
10006 which may be replaced by the check function, and I<namegv> is a GV
10007 supplying the name that should be used by the check function to refer
10008 to the callee of the C<entersub> op if it needs to emit any diagnostics.
10009 It is permitted to apply the check function in non-standard situations,
10010 such as to a call to a different subroutine or to a method call.
10012 The current setting for a particular CV can be retrieved by
10013 L</cv_get_call_checker>.
10019 Perl_cv_set_call_checker(pTHX_ CV *cv, Perl_call_checker ckfun, SV *ckobj)
10021 PERL_ARGS_ASSERT_CV_SET_CALL_CHECKER;
10022 if (ckfun == Perl_ck_entersub_args_proto_or_list && ckobj == (SV*)cv) {
10023 if (SvMAGICAL((SV*)cv))
10024 mg_free_type((SV*)cv, PERL_MAGIC_checkcall);
10027 sv_magic((SV*)cv, &PL_sv_undef, PERL_MAGIC_checkcall, NULL, 0);
10028 callmg = mg_find((SV*)cv, PERL_MAGIC_checkcall);
10029 if (callmg->mg_flags & MGf_REFCOUNTED) {
10030 SvREFCNT_dec(callmg->mg_obj);
10031 callmg->mg_flags &= ~MGf_REFCOUNTED;
10033 callmg->mg_ptr = FPTR2DPTR(char *, ckfun);
10034 callmg->mg_obj = ckobj;
10035 if (ckobj != (SV*)cv) {
10036 SvREFCNT_inc_simple_void_NN(ckobj);
10037 callmg->mg_flags |= MGf_REFCOUNTED;
10039 callmg->mg_flags |= MGf_COPY;
10044 Perl_ck_subr(pTHX_ OP *o)
10050 PERL_ARGS_ASSERT_CK_SUBR;
10052 aop = cUNOPx(o)->op_first;
10053 if (!aop->op_sibling)
10054 aop = cUNOPx(aop)->op_first;
10055 aop = aop->op_sibling;
10056 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
10057 cv = rv2cv_op_cv(cvop, RV2CVOPCV_MARK_EARLY);
10058 namegv = cv ? (GV*)rv2cv_op_cv(cvop, RV2CVOPCV_RETURN_NAME_GV) : NULL;
10060 o->op_private &= ~1;
10061 o->op_private |= OPpENTERSUB_HASTARG;
10062 o->op_private |= (PL_hints & HINT_STRICT_REFS);
10063 if (PERLDB_SUB && PL_curstash != PL_debstash)
10064 o->op_private |= OPpENTERSUB_DB;
10065 if (cvop->op_type == OP_RV2CV) {
10066 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
10068 } else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
10069 if (aop->op_type == OP_CONST)
10070 aop->op_private &= ~OPpCONST_STRICT;
10071 else if (aop->op_type == OP_LIST) {
10072 OP * const sib = ((UNOP*)aop)->op_first->op_sibling;
10073 if (sib && sib->op_type == OP_CONST)
10074 sib->op_private &= ~OPpCONST_STRICT;
10079 return ck_entersub_args_list(o);
10081 Perl_call_checker ckfun;
10083 cv_get_call_checker(cv, &ckfun, &ckobj);
10084 return ckfun(aTHX_ o, namegv, ckobj);
10089 Perl_ck_svconst(pTHX_ OP *o)
10091 PERL_ARGS_ASSERT_CK_SVCONST;
10092 PERL_UNUSED_CONTEXT;
10093 SvREADONLY_on(cSVOPo->op_sv);
10098 Perl_ck_trunc(pTHX_ OP *o)
10100 PERL_ARGS_ASSERT_CK_TRUNC;
10102 if (o->op_flags & OPf_KIDS) {
10103 SVOP *kid = (SVOP*)cUNOPo->op_first;
10105 if (kid->op_type == OP_NULL)
10106 kid = (SVOP*)kid->op_sibling;
10107 if (kid && kid->op_type == OP_CONST &&
10108 (kid->op_private & (OPpCONST_BARE|OPpCONST_FOLDED))
10111 o->op_flags |= OPf_SPECIAL;
10112 kid->op_private &= ~OPpCONST_STRICT;
10119 Perl_ck_substr(pTHX_ OP *o)
10121 PERL_ARGS_ASSERT_CK_SUBSTR;
10124 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
10125 OP *kid = cLISTOPo->op_first;
10127 if (kid->op_type == OP_NULL)
10128 kid = kid->op_sibling;
10130 kid->op_flags |= OPf_MOD;
10137 Perl_ck_tell(pTHX_ OP *o)
10139 PERL_ARGS_ASSERT_CK_TELL;
10141 if (o->op_flags & OPf_KIDS) {
10142 OP *kid = cLISTOPo->op_first;
10143 if (kid->op_type == OP_NULL && kid->op_sibling) kid = kid->op_sibling;
10144 if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE;
10150 Perl_ck_each(pTHX_ OP *o)
10153 OP *kid = o->op_flags & OPf_KIDS ? cUNOPo->op_first : NULL;
10154 const unsigned orig_type = o->op_type;
10155 const unsigned array_type = orig_type == OP_EACH ? OP_AEACH
10156 : orig_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
10157 const unsigned ref_type = orig_type == OP_EACH ? OP_REACH
10158 : orig_type == OP_KEYS ? OP_RKEYS : OP_RVALUES;
10160 PERL_ARGS_ASSERT_CK_EACH;
10163 switch (kid->op_type) {
10169 CHANGE_TYPE(o, array_type);
10172 if (kid->op_private == OPpCONST_BARE
10173 || !SvROK(cSVOPx_sv(kid))
10174 || ( SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV
10175 && SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVHV )
10177 /* we let ck_fun handle it */
10180 CHANGE_TYPE(o, ref_type);
10184 /* if treating as a reference, defer additional checks to runtime */
10185 return o->op_type == ref_type ? o : ck_fun(o);
10189 Perl_ck_length(pTHX_ OP *o)
10191 PERL_ARGS_ASSERT_CK_LENGTH;
10195 if (ckWARN(WARN_SYNTAX)) {
10196 const OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : NULL;
10200 const bool hash = kid->op_type == OP_PADHV
10201 || kid->op_type == OP_RV2HV;
10202 switch (kid->op_type) {
10206 (GV *)PL_compcv, hash ? '%' : '@', kid->op_targ,
10212 if (cUNOPx(kid)->op_first->op_type != OP_GV) break;
10214 GV *gv = cGVOPx_gv(cUNOPx(kid)->op_first);
10216 name = varname(gv, hash?'%':'@', 0, NULL, 0, 1);
10223 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10224 "length() used on %"SVf" (did you mean \"scalar(%s%"SVf
10226 name, hash ? "keys " : "", name
10229 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10230 "length() used on %%hash (did you mean \"scalar(keys %%hash)\"?)");
10232 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10233 "length() used on @array (did you mean \"scalar(@array)\"?)");
10240 /* Check for in place reverse and sort assignments like "@a = reverse @a"
10241 and modify the optree to make them work inplace */
10244 S_inplace_aassign(pTHX_ OP *o) {
10246 OP *modop, *modop_pushmark;
10248 OP *oleft, *oleft_pushmark;
10250 PERL_ARGS_ASSERT_INPLACE_AASSIGN;
10252 assert((o->op_flags & OPf_WANT) == OPf_WANT_VOID);
10254 assert(cUNOPo->op_first->op_type == OP_NULL);
10255 modop_pushmark = cUNOPx(cUNOPo->op_first)->op_first;
10256 assert(modop_pushmark->op_type == OP_PUSHMARK);
10257 modop = modop_pushmark->op_sibling;
10259 if (modop->op_type != OP_SORT && modop->op_type != OP_REVERSE)
10262 /* no other operation except sort/reverse */
10263 if (modop->op_sibling)
10266 assert(cUNOPx(modop)->op_first->op_type == OP_PUSHMARK);
10267 if (!(oright = cUNOPx(modop)->op_first->op_sibling)) return;
10269 if (modop->op_flags & OPf_STACKED) {
10270 /* skip sort subroutine/block */
10271 assert(oright->op_type == OP_NULL);
10272 oright = oright->op_sibling;
10275 assert(cUNOPo->op_first->op_sibling->op_type == OP_NULL);
10276 oleft_pushmark = cUNOPx(cUNOPo->op_first->op_sibling)->op_first;
10277 assert(oleft_pushmark->op_type == OP_PUSHMARK);
10278 oleft = oleft_pushmark->op_sibling;
10280 /* Check the lhs is an array */
10282 (oleft->op_type != OP_RV2AV && oleft->op_type != OP_PADAV)
10283 || oleft->op_sibling
10284 || (oleft->op_private & OPpLVAL_INTRO)
10288 /* Only one thing on the rhs */
10289 if (oright->op_sibling)
10292 /* check the array is the same on both sides */
10293 if (oleft->op_type == OP_RV2AV) {
10294 if (oright->op_type != OP_RV2AV
10295 || !cUNOPx(oright)->op_first
10296 || cUNOPx(oright)->op_first->op_type != OP_GV
10297 || cUNOPx(oleft )->op_first->op_type != OP_GV
10298 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
10299 cGVOPx_gv(cUNOPx(oright)->op_first)
10303 else if (oright->op_type != OP_PADAV
10304 || oright->op_targ != oleft->op_targ
10308 /* This actually is an inplace assignment */
10310 modop->op_private |= OPpSORT_INPLACE;
10312 /* transfer MODishness etc from LHS arg to RHS arg */
10313 oright->op_flags = oleft->op_flags;
10315 /* remove the aassign op and the lhs */
10317 op_null(oleft_pushmark);
10318 if (oleft->op_type == OP_RV2AV && cUNOPx(oleft)->op_first)
10319 op_null(cUNOPx(oleft)->op_first);
10323 #define MAX_DEFERRED 4
10327 if (defer_ix == (MAX_DEFERRED-1)) { \
10328 CALL_RPEEP(defer_queue[defer_base]); \
10329 defer_base = (defer_base + 1) % MAX_DEFERRED; \
10332 defer_queue[(defer_base + ++defer_ix) % MAX_DEFERRED] = o; \
10335 /* A peephole optimizer. We visit the ops in the order they're to execute.
10336 * See the comments at the top of this file for more details about when
10337 * peep() is called */
10340 Perl_rpeep(pTHX_ register OP *o)
10344 OP* defer_queue[MAX_DEFERRED]; /* small queue of deferred branches */
10345 int defer_base = 0;
10348 if (!o || o->op_opt)
10352 SAVEVPTR(PL_curcop);
10353 for (;; o = o->op_next) {
10354 if (o && o->op_opt)
10357 while (defer_ix >= 0)
10358 CALL_RPEEP(defer_queue[(defer_base + defer_ix--) % MAX_DEFERRED]);
10362 /* By default, this op has now been optimised. A couple of cases below
10363 clear this again. */
10366 switch (o->op_type) {
10368 PL_curcop = ((COP*)o); /* for warnings */
10371 PL_curcop = ((COP*)o); /* for warnings */
10373 /* Two NEXTSTATEs in a row serve no purpose. Except if they happen
10374 to carry two labels. For now, take the easier option, and skip
10375 this optimisation if the first NEXTSTATE has a label. */
10376 if (!CopLABEL((COP*)o) && !PERLDB_NOOPT) {
10377 OP *nextop = o->op_next;
10378 while (nextop && nextop->op_type == OP_NULL)
10379 nextop = nextop->op_next;
10381 if (nextop && (nextop->op_type == OP_NEXTSTATE)) {
10382 COP *firstcop = (COP *)o;
10383 COP *secondcop = (COP *)nextop;
10384 /* We want the COP pointed to by o (and anything else) to
10385 become the next COP down the line. */
10386 cop_free(firstcop);
10388 firstcop->op_next = secondcop->op_next;
10390 /* Now steal all its pointers, and duplicate the other
10392 firstcop->cop_line = secondcop->cop_line;
10393 #ifdef USE_ITHREADS
10394 firstcop->cop_stashoff = secondcop->cop_stashoff;
10395 firstcop->cop_file = secondcop->cop_file;
10397 firstcop->cop_stash = secondcop->cop_stash;
10398 firstcop->cop_filegv = secondcop->cop_filegv;
10400 firstcop->cop_hints = secondcop->cop_hints;
10401 firstcop->cop_seq = secondcop->cop_seq;
10402 firstcop->cop_warnings = secondcop->cop_warnings;
10403 firstcop->cop_hints_hash = secondcop->cop_hints_hash;
10405 #ifdef USE_ITHREADS
10406 secondcop->cop_stashoff = 0;
10407 secondcop->cop_file = NULL;
10409 secondcop->cop_stash = NULL;
10410 secondcop->cop_filegv = NULL;
10412 secondcop->cop_warnings = NULL;
10413 secondcop->cop_hints_hash = NULL;
10415 /* If we use op_null(), and hence leave an ex-COP, some
10416 warnings are misreported. For example, the compile-time
10417 error in 'use strict; no strict refs;' */
10418 secondcop->op_type = OP_NULL;
10419 secondcop->op_ppaddr = PL_ppaddr[OP_NULL];
10425 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
10426 if (o->op_next->op_private & OPpTARGET_MY) {
10427 if (o->op_flags & OPf_STACKED) /* chained concats */
10428 break; /* ignore_optimization */
10430 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
10431 o->op_targ = o->op_next->op_targ;
10432 o->op_next->op_targ = 0;
10433 o->op_private |= OPpTARGET_MY;
10436 op_null(o->op_next);
10440 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
10441 break; /* Scalar stub must produce undef. List stub is noop */
10445 if (o->op_targ == OP_NEXTSTATE
10446 || o->op_targ == OP_DBSTATE)
10448 PL_curcop = ((COP*)o);
10450 /* XXX: We avoid setting op_seq here to prevent later calls
10451 to rpeep() from mistakenly concluding that optimisation
10452 has already occurred. This doesn't fix the real problem,
10453 though (See 20010220.007). AMS 20010719 */
10454 /* op_seq functionality is now replaced by op_opt */
10461 if (oldop && o->op_next) {
10462 oldop->op_next = o->op_next;
10470 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
10471 OP* const pop = (o->op_type == OP_PADAV) ?
10472 o->op_next : o->op_next->op_next;
10474 if (pop && pop->op_type == OP_CONST &&
10475 ((PL_op = pop->op_next)) &&
10476 pop->op_next->op_type == OP_AELEM &&
10477 !(pop->op_next->op_private &
10478 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
10479 (i = SvIV(((SVOP*)pop)->op_sv)) <= 255 && i >= 0)
10482 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
10483 no_bareword_allowed(pop);
10484 if (o->op_type == OP_GV)
10485 op_null(o->op_next);
10486 op_null(pop->op_next);
10488 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
10489 o->op_next = pop->op_next->op_next;
10490 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
10491 o->op_private = (U8)i;
10492 if (o->op_type == OP_GV) {
10495 o->op_type = OP_AELEMFAST;
10498 o->op_type = OP_AELEMFAST_LEX;
10503 if (o->op_next->op_type == OP_RV2SV) {
10504 if (!(o->op_next->op_private & OPpDEREF)) {
10505 op_null(o->op_next);
10506 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
10508 o->op_next = o->op_next->op_next;
10509 o->op_type = OP_GVSV;
10510 o->op_ppaddr = PL_ppaddr[OP_GVSV];
10513 else if (o->op_next->op_type == OP_READLINE
10514 && o->op_next->op_next->op_type == OP_CONCAT
10515 && (o->op_next->op_next->op_flags & OPf_STACKED))
10517 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
10518 o->op_type = OP_RCATLINE;
10519 o->op_flags |= OPf_STACKED;
10520 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
10521 op_null(o->op_next->op_next);
10522 op_null(o->op_next);
10531 #define HV_OR_SCALARHV(op) \
10532 ( (op)->op_type == OP_PADHV || (op)->op_type == OP_RV2HV \
10534 : (op)->op_type == OP_SCALAR && (op)->op_flags & OPf_KIDS \
10535 && ( cUNOPx(op)->op_first->op_type == OP_PADHV \
10536 || cUNOPx(op)->op_first->op_type == OP_RV2HV) \
10537 ? cUNOPx(op)->op_first \
10541 if ((fop = HV_OR_SCALARHV(cUNOP->op_first)))
10542 fop->op_private |= OPpTRUEBOOL;
10548 fop = cLOGOP->op_first;
10549 sop = fop->op_sibling;
10550 while (cLOGOP->op_other->op_type == OP_NULL)
10551 cLOGOP->op_other = cLOGOP->op_other->op_next;
10552 while (o->op_next && ( o->op_type == o->op_next->op_type
10553 || o->op_next->op_type == OP_NULL))
10554 o->op_next = o->op_next->op_next;
10555 DEFER(cLOGOP->op_other);
10558 fop = HV_OR_SCALARHV(fop);
10559 if (sop) sop = HV_OR_SCALARHV(sop);
10564 if (!((nop->op_flags & OPf_WANT) == OPf_WANT_VOID)) {
10565 while (nop && nop->op_next) {
10566 switch (nop->op_next->op_type) {
10571 lop = nop = nop->op_next;
10574 nop = nop->op_next;
10583 if ( (lop->op_flags & OPf_WANT) == OPf_WANT_VOID
10584 || o->op_type == OP_AND )
10585 fop->op_private |= OPpTRUEBOOL;
10586 else if (!(lop->op_flags & OPf_WANT))
10587 fop->op_private |= OPpMAYBE_TRUEBOOL;
10589 if ( (lop->op_flags & OPf_WANT) == OPf_WANT_VOID
10591 sop->op_private |= OPpTRUEBOOL;
10598 if ((fop = HV_OR_SCALARHV(cLOGOP->op_first)))
10599 fop->op_private |= OPpTRUEBOOL;
10600 #undef HV_OR_SCALARHV
10611 while (cLOGOP->op_other->op_type == OP_NULL)
10612 cLOGOP->op_other = cLOGOP->op_other->op_next;
10613 DEFER(cLOGOP->op_other);
10618 while (cLOOP->op_redoop->op_type == OP_NULL)
10619 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
10620 while (cLOOP->op_nextop->op_type == OP_NULL)
10621 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
10622 while (cLOOP->op_lastop->op_type == OP_NULL)
10623 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
10624 /* a while(1) loop doesn't have an op_next that escapes the
10625 * loop, so we have to explicitly follow the op_lastop to
10626 * process the rest of the code */
10627 DEFER(cLOOP->op_lastop);
10631 assert(!(cPMOP->op_pmflags & PMf_ONCE));
10632 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
10633 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
10634 cPMOP->op_pmstashstartu.op_pmreplstart
10635 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
10636 DEFER(cPMOP->op_pmstashstartu.op_pmreplstart);
10642 if (o->op_flags & OPf_STACKED) {
10644 cUNOPx(cLISTOP->op_first->op_sibling)->op_first;
10645 if (kid->op_type == OP_SCOPE
10646 || (kid->op_type == OP_NULL && kid->op_targ == OP_LEAVE))
10647 DEFER(kLISTOP->op_first);
10650 /* check that RHS of sort is a single plain array */
10651 oright = cUNOPo->op_first;
10652 if (!oright || oright->op_type != OP_PUSHMARK)
10655 if (o->op_private & OPpSORT_INPLACE)
10658 /* reverse sort ... can be optimised. */
10659 if (!cUNOPo->op_sibling) {
10660 /* Nothing follows us on the list. */
10661 OP * const reverse = o->op_next;
10663 if (reverse->op_type == OP_REVERSE &&
10664 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
10665 OP * const pushmark = cUNOPx(reverse)->op_first;
10666 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
10667 && (cUNOPx(pushmark)->op_sibling == o)) {
10668 /* reverse -> pushmark -> sort */
10669 o->op_private |= OPpSORT_REVERSE;
10671 pushmark->op_next = oright->op_next;
10681 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
10683 LISTOP *enter, *exlist;
10685 if (o->op_private & OPpSORT_INPLACE)
10688 enter = (LISTOP *) o->op_next;
10691 if (enter->op_type == OP_NULL) {
10692 enter = (LISTOP *) enter->op_next;
10696 /* for $a (...) will have OP_GV then OP_RV2GV here.
10697 for (...) just has an OP_GV. */
10698 if (enter->op_type == OP_GV) {
10699 gvop = (OP *) enter;
10700 enter = (LISTOP *) enter->op_next;
10703 if (enter->op_type == OP_RV2GV) {
10704 enter = (LISTOP *) enter->op_next;
10710 if (enter->op_type != OP_ENTERITER)
10713 iter = enter->op_next;
10714 if (!iter || iter->op_type != OP_ITER)
10717 expushmark = enter->op_first;
10718 if (!expushmark || expushmark->op_type != OP_NULL
10719 || expushmark->op_targ != OP_PUSHMARK)
10722 exlist = (LISTOP *) expushmark->op_sibling;
10723 if (!exlist || exlist->op_type != OP_NULL
10724 || exlist->op_targ != OP_LIST)
10727 if (exlist->op_last != o) {
10728 /* Mmm. Was expecting to point back to this op. */
10731 theirmark = exlist->op_first;
10732 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
10735 if (theirmark->op_sibling != o) {
10736 /* There's something between the mark and the reverse, eg
10737 for (1, reverse (...))
10742 ourmark = ((LISTOP *)o)->op_first;
10743 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
10746 ourlast = ((LISTOP *)o)->op_last;
10747 if (!ourlast || ourlast->op_next != o)
10750 rv2av = ourmark->op_sibling;
10751 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
10752 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
10753 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
10754 /* We're just reversing a single array. */
10755 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
10756 enter->op_flags |= OPf_STACKED;
10759 /* We don't have control over who points to theirmark, so sacrifice
10761 theirmark->op_next = ourmark->op_next;
10762 theirmark->op_flags = ourmark->op_flags;
10763 ourlast->op_next = gvop ? gvop : (OP *) enter;
10766 enter->op_private |= OPpITER_REVERSED;
10767 iter->op_private |= OPpITER_REVERSED;
10774 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
10775 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
10780 if (!(o->op_private & OPpOFFBYONE) && !CvCLONE(PL_compcv)) {
10782 if (CvEVAL(PL_compcv)) sv = &PL_sv_undef;
10784 sv = newRV((SV *)PL_compcv);
10788 o->op_type = OP_CONST;
10789 o->op_ppaddr = PL_ppaddr[OP_CONST];
10790 o->op_flags |= OPf_SPECIAL;
10791 cSVOPo->op_sv = sv;
10796 if (OP_GIMME(o,0) == G_VOID) {
10797 OP *right = cBINOP->op_first;
10799 OP *left = right->op_sibling;
10800 if (left->op_type == OP_SUBSTR
10801 && (left->op_private & 7) < 4) {
10803 cBINOP->op_first = left;
10804 right->op_sibling =
10805 cBINOPx(left)->op_first->op_sibling;
10806 cBINOPx(left)->op_first->op_sibling = right;
10807 left->op_private |= OPpSUBSTR_REPL_FIRST;
10809 (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
10816 Perl_cpeep_t cpeep =
10817 XopENTRY(Perl_custom_op_xop(aTHX_ o), xop_peep);
10819 cpeep(aTHX_ o, oldop);
10830 Perl_peep(pTHX_ register OP *o)
10836 =head1 Custom Operators
10838 =for apidoc Ao||custom_op_xop
10839 Return the XOP structure for a given custom op. This function should be
10840 considered internal to OP_NAME and the other access macros: use them instead.
10846 Perl_custom_op_xop(pTHX_ const OP *o)
10852 static const XOP xop_null = { 0, 0, 0, 0, 0 };
10854 PERL_ARGS_ASSERT_CUSTOM_OP_XOP;
10855 assert(o->op_type == OP_CUSTOM);
10857 /* This is wrong. It assumes a function pointer can be cast to IV,
10858 * which isn't guaranteed, but this is what the old custom OP code
10859 * did. In principle it should be safer to Copy the bytes of the
10860 * pointer into a PV: since the new interface is hidden behind
10861 * functions, this can be changed later if necessary. */
10862 /* Change custom_op_xop if this ever happens */
10863 keysv = sv_2mortal(newSViv(PTR2IV(o->op_ppaddr)));
10866 he = hv_fetch_ent(PL_custom_ops, keysv, 0, 0);
10868 /* assume noone will have just registered a desc */
10869 if (!he && PL_custom_op_names &&
10870 (he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0))
10875 /* XXX does all this need to be shared mem? */
10876 Newxz(xop, 1, XOP);
10877 pv = SvPV(HeVAL(he), l);
10878 XopENTRY_set(xop, xop_name, savepvn(pv, l));
10879 if (PL_custom_op_descs &&
10880 (he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0))
10882 pv = SvPV(HeVAL(he), l);
10883 XopENTRY_set(xop, xop_desc, savepvn(pv, l));
10885 Perl_custom_op_register(aTHX_ o->op_ppaddr, xop);
10889 if (!he) return &xop_null;
10891 xop = INT2PTR(XOP *, SvIV(HeVAL(he)));
10896 =for apidoc Ao||custom_op_register
10897 Register a custom op. See L<perlguts/"Custom Operators">.
10903 Perl_custom_op_register(pTHX_ Perl_ppaddr_t ppaddr, const XOP *xop)
10907 PERL_ARGS_ASSERT_CUSTOM_OP_REGISTER;
10909 /* see the comment in custom_op_xop */
10910 keysv = sv_2mortal(newSViv(PTR2IV(ppaddr)));
10912 if (!PL_custom_ops)
10913 PL_custom_ops = newHV();
10915 if (!hv_store_ent(PL_custom_ops, keysv, newSViv(PTR2IV(xop)), 0))
10916 Perl_croak(aTHX_ "panic: can't register custom OP %s", xop->xop_name);
10920 =head1 Functions in file op.c
10922 =for apidoc core_prototype
10923 This function assigns the prototype of the named core function to C<sv>, or
10924 to a new mortal SV if C<sv> is NULL. It returns the modified C<sv>, or
10925 NULL if the core function has no prototype. C<code> is a code as returned
10926 by C<keyword()>. It must not be equal to 0 or -KEY_CORE.
10932 Perl_core_prototype(pTHX_ SV *sv, const char *name, const int code,
10935 int i = 0, n = 0, seen_question = 0, defgv = 0;
10937 #define MAX_ARGS_OP ((sizeof(I32) - 1) * 2)
10938 char str[ MAX_ARGS_OP * 2 + 2 ]; /* One ';', one '\0' */
10939 bool nullret = FALSE;
10941 PERL_ARGS_ASSERT_CORE_PROTOTYPE;
10943 assert (code && code != -KEY_CORE);
10945 if (!sv) sv = sv_newmortal();
10947 #define retsetpvs(x,y) sv_setpvs(sv, x); if(opnum) *opnum=(y); return sv
10949 switch (code < 0 ? -code : code) {
10950 case KEY_and : case KEY_chop: case KEY_chomp:
10951 case KEY_cmp : case KEY_defined: case KEY_delete: case KEY_exec :
10952 case KEY_exists: case KEY_eq : case KEY_ge : case KEY_goto :
10953 case KEY_grep : case KEY_gt : case KEY_last : case KEY_le :
10954 case KEY_lt : case KEY_map : case KEY_ne : case KEY_next :
10955 case KEY_or : case KEY_print : case KEY_printf: case KEY_qr :
10956 case KEY_redo : case KEY_require: case KEY_return: case KEY_say :
10957 case KEY_select: case KEY_sort : case KEY_split : case KEY_system:
10958 case KEY_x : case KEY_xor :
10959 if (!opnum) return NULL; nullret = TRUE; goto findopnum;
10960 case KEY_glob: retsetpvs("_;", OP_GLOB);
10961 case KEY_keys: retsetpvs("+", OP_KEYS);
10962 case KEY_values: retsetpvs("+", OP_VALUES);
10963 case KEY_each: retsetpvs("+", OP_EACH);
10964 case KEY_push: retsetpvs("+@", OP_PUSH);
10965 case KEY_unshift: retsetpvs("+@", OP_UNSHIFT);
10966 case KEY_pop: retsetpvs(";+", OP_POP);
10967 case KEY_shift: retsetpvs(";+", OP_SHIFT);
10968 case KEY_pos: retsetpvs(";\\[$*]", OP_POS);
10970 retsetpvs("+;$$@", OP_SPLICE);
10971 case KEY___FILE__: case KEY___LINE__: case KEY___PACKAGE__:
10973 case KEY_evalbytes:
10974 name = "entereval"; break;
10982 while (i < MAXO) { /* The slow way. */
10983 if (strEQ(name, PL_op_name[i])
10984 || strEQ(name, PL_op_desc[i]))
10986 if (nullret) { assert(opnum); *opnum = i; return NULL; }
10993 defgv = PL_opargs[i] & OA_DEFGV;
10994 oa = PL_opargs[i] >> OASHIFT;
10996 if (oa & OA_OPTIONAL && !seen_question && (
10997 !defgv || (oa & (OA_OPTIONAL - 1)) == OA_FILEREF
11002 if ((oa & (OA_OPTIONAL - 1)) >= OA_AVREF
11003 && (oa & (OA_OPTIONAL - 1)) <= OA_SCALARREF
11004 /* But globs are already references (kinda) */
11005 && (oa & (OA_OPTIONAL - 1)) != OA_FILEREF
11009 if ((oa & (OA_OPTIONAL - 1)) == OA_SCALARREF
11010 && !scalar_mod_type(NULL, i)) {
11015 if (i == OP_LOCK || i == OP_UNDEF) str[n++] = '&';
11019 else str[n++] = ("?$@@%&*$")[oa & (OA_OPTIONAL - 1)];
11020 if (oa & OA_OPTIONAL && defgv && str[n-1] == '$') {
11021 str[n-1] = '_'; defgv = 0;
11025 if (code == -KEY_not || code == -KEY_getprotobynumber) str[n++] = ';';
11027 sv_setpvn(sv, str, n - 1);
11028 if (opnum) *opnum = i;
11033 Perl_coresub_op(pTHX_ SV * const coreargssv, const int code,
11036 OP * const argop = newSVOP(OP_COREARGS,0,coreargssv);
11039 PERL_ARGS_ASSERT_CORESUB_OP;
11043 return op_append_elem(OP_LINESEQ,
11046 newSVOP(OP_CONST, 0, newSViv(-code % 3)),
11050 case OP_SELECT: /* which represents OP_SSELECT as well */
11055 newAVREF(newGVOP(OP_GV, 0, PL_defgv)),
11056 newSVOP(OP_CONST, 0, newSVuv(1))
11058 coresub_op(newSVuv((UV)OP_SSELECT), 0,
11060 coresub_op(coreargssv, 0, OP_SELECT)
11064 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
11066 return op_append_elem(
11069 opnum == OP_WANTARRAY || opnum == OP_RUNCV
11070 ? OPpOFFBYONE << 8 : 0)
11072 case OA_BASEOP_OR_UNOP:
11073 if (opnum == OP_ENTEREVAL) {
11074 o = newUNOP(OP_ENTEREVAL,OPpEVAL_COPHH<<8,argop);
11075 if (code == -KEY_evalbytes) o->op_private |= OPpEVAL_BYTES;
11077 else o = newUNOP(opnum,0,argop);
11078 if (opnum == OP_CALLER) o->op_private |= OPpOFFBYONE;
11081 if (is_handle_constructor(o, 1))
11082 argop->op_private |= OPpCOREARGS_DEREF1;
11083 if (scalar_mod_type(NULL, opnum))
11084 argop->op_private |= OPpCOREARGS_SCALARMOD;
11088 o = convert(opnum,OPf_SPECIAL*(opnum == OP_GLOB),argop);
11089 if (is_handle_constructor(o, 2))
11090 argop->op_private |= OPpCOREARGS_DEREF2;
11091 if (opnum == OP_SUBSTR) {
11092 o->op_private |= OPpMAYBE_LVSUB;
11101 Perl_report_redefined_cv(pTHX_ const SV *name, const CV *old_cv,
11102 SV * const *new_const_svp)
11104 const char *hvname;
11105 bool is_const = !!CvCONST(old_cv);
11106 SV *old_const_sv = is_const ? cv_const_sv(old_cv) : NULL;
11108 PERL_ARGS_ASSERT_REPORT_REDEFINED_CV;
11110 if (is_const && new_const_svp && old_const_sv == *new_const_svp)
11112 /* They are 2 constant subroutines generated from
11113 the same constant. This probably means that
11114 they are really the "same" proxy subroutine
11115 instantiated in 2 places. Most likely this is
11116 when a constant is exported twice. Don't warn.
11119 (ckWARN(WARN_REDEFINE)
11121 CvGV(old_cv) && GvSTASH(CvGV(old_cv))
11122 && HvNAMELEN(GvSTASH(CvGV(old_cv))) == 7
11123 && (hvname = HvNAME(GvSTASH(CvGV(old_cv))),
11124 strEQ(hvname, "autouse"))
11128 && ckWARN_d(WARN_REDEFINE)
11129 && (!new_const_svp || sv_cmp(old_const_sv, *new_const_svp))
11132 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
11134 ? "Constant subroutine %"SVf" redefined"
11135 : "Subroutine %"SVf" redefined",
11140 =head1 Hook manipulation
11142 These functions provide convenient and thread-safe means of manipulating
11149 =for apidoc Am|void|wrap_op_checker|Optype opcode|Perl_check_t new_checker|Perl_check_t *old_checker_p
11151 Puts a C function into the chain of check functions for a specified op
11152 type. This is the preferred way to manipulate the L</PL_check> array.
11153 I<opcode> specifies which type of op is to be affected. I<new_checker>
11154 is a pointer to the C function that is to be added to that opcode's
11155 check chain, and I<old_checker_p> points to the storage location where a
11156 pointer to the next function in the chain will be stored. The value of
11157 I<new_pointer> is written into the L</PL_check> array, while the value
11158 previously stored there is written to I<*old_checker_p>.
11160 L</PL_check> is global to an entire process, and a module wishing to
11161 hook op checking may find itself invoked more than once per process,
11162 typically in different threads. To handle that situation, this function
11163 is idempotent. The location I<*old_checker_p> must initially (once
11164 per process) contain a null pointer. A C variable of static duration
11165 (declared at file scope, typically also marked C<static> to give
11166 it internal linkage) will be implicitly initialised appropriately,
11167 if it does not have an explicit initialiser. This function will only
11168 actually modify the check chain if it finds I<*old_checker_p> to be null.
11169 This function is also thread safe on the small scale. It uses appropriate
11170 locking to avoid race conditions in accessing L</PL_check>.
11172 When this function is called, the function referenced by I<new_checker>
11173 must be ready to be called, except for I<*old_checker_p> being unfilled.
11174 In a threading situation, I<new_checker> may be called immediately,
11175 even before this function has returned. I<*old_checker_p> will always
11176 be appropriately set before I<new_checker> is called. If I<new_checker>
11177 decides not to do anything special with an op that it is given (which
11178 is the usual case for most uses of op check hooking), it must chain the
11179 check function referenced by I<*old_checker_p>.
11181 If you want to influence compilation of calls to a specific subroutine,
11182 then use L</cv_set_call_checker> rather than hooking checking of all
11189 Perl_wrap_op_checker(pTHX_ Optype opcode,
11190 Perl_check_t new_checker, Perl_check_t *old_checker_p)
11194 PERL_ARGS_ASSERT_WRAP_OP_CHECKER;
11195 if (*old_checker_p) return;
11196 OP_CHECK_MUTEX_LOCK;
11197 if (!*old_checker_p) {
11198 *old_checker_p = PL_check[opcode];
11199 PL_check[opcode] = new_checker;
11201 OP_CHECK_MUTEX_UNLOCK;
11206 /* Efficient sub that returns a constant scalar value. */
11208 const_sv_xsub(pTHX_ CV* cv)
11212 SV *const sv = MUTABLE_SV(XSANY.any_ptr);
11216 /* diag_listed_as: SKIPME */
11217 Perl_croak(aTHX_ "usage: %s::%s()",
11218 HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
11231 * c-indentation-style: bsd
11232 * c-basic-offset: 4
11233 * indent-tabs-mode: nil
11236 * ex: set ts=8 sts=4 sw=4 et: