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);
2899 CALL_BLOCK_HOOKS(bhk_pre_end, &retval);
2902 CopHINTS_set(&PL_compiling, PL_hints);
2904 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2908 /* pad_leavemy has created a sequence of introcv ops for all my
2909 subs declared in the block. We have to replicate that list with
2910 clonecv ops, to deal with this situation:
2915 sub s1 { state sub foo { \&s2 } }
2918 Originally, I was going to have introcv clone the CV and turn
2919 off the stale flag. Since &s1 is declared before &s2, the
2920 introcv op for &s1 is executed (on sub entry) before the one for
2921 &s2. But the &foo sub inside &s1 (which is cloned when &s1 is
2922 cloned, since it is a state sub) closes over &s2 and expects
2923 to see it in its outer CV’s pad. If the introcv op clones &s1,
2924 then &s2 is still marked stale. Since &s1 is not active, and
2925 &foo closes over &s1’s implicit entry for &s2, we get a ‘Varia-
2926 ble will not stay shared’ warning. Because it is the same stub
2927 that will be used when the introcv op for &s2 is executed, clos-
2928 ing over it is safe. Hence, we have to turn off the stale flag
2929 on all lexical subs in the block before we clone any of them.
2930 Hence, having introcv clone the sub cannot work. So we create a
2931 list of ops like this:
2955 OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : o;
2956 OP * const last = o->op_flags & OPf_KIDS ? cLISTOPo->op_last : o;
2957 for (;; kid = kid->op_sibling) {
2958 OP *newkid = newOP(OP_CLONECV, 0);
2959 newkid->op_targ = kid->op_targ;
2960 o = op_append_elem(OP_LINESEQ, o, newkid);
2961 if (kid == last) break;
2963 retval = op_prepend_elem(OP_LINESEQ, o, retval);
2966 CALL_BLOCK_HOOKS(bhk_post_end, &retval);
2972 =head1 Compile-time scope hooks
2974 =for apidoc Aox||blockhook_register
2976 Register a set of hooks to be called when the Perl lexical scope changes
2977 at compile time. See L<perlguts/"Compile-time scope hooks">.
2983 Perl_blockhook_register(pTHX_ BHK *hk)
2985 PERL_ARGS_ASSERT_BLOCKHOOK_REGISTER;
2987 Perl_av_create_and_push(aTHX_ &PL_blockhooks, newSViv(PTR2IV(hk)));
2994 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
2995 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
2996 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2999 OP * const o = newOP(OP_PADSV, 0);
3000 o->op_targ = offset;
3006 Perl_newPROG(pTHX_ OP *o)
3010 PERL_ARGS_ASSERT_NEWPROG;
3017 PL_eval_root = newUNOP(OP_LEAVEEVAL,
3018 ((PL_in_eval & EVAL_KEEPERR)
3019 ? OPf_SPECIAL : 0), o);
3021 cx = &cxstack[cxstack_ix];
3022 assert(CxTYPE(cx) == CXt_EVAL);
3024 if ((cx->blk_gimme & G_WANT) == G_VOID)
3025 scalarvoid(PL_eval_root);
3026 else if ((cx->blk_gimme & G_WANT) == G_ARRAY)
3029 scalar(PL_eval_root);
3031 PL_eval_start = op_linklist(PL_eval_root);
3032 PL_eval_root->op_private |= OPpREFCOUNTED;
3033 OpREFCNT_set(PL_eval_root, 1);
3034 PL_eval_root->op_next = 0;
3035 i = PL_savestack_ix;
3038 CALL_PEEP(PL_eval_start);
3039 finalize_optree(PL_eval_root);
3041 PL_savestack_ix = i;
3044 if (o->op_type == OP_STUB) {
3045 /* This block is entered if nothing is compiled for the main
3046 program. This will be the case for an genuinely empty main
3047 program, or one which only has BEGIN blocks etc, so already
3050 Historically (5.000) the guard above was !o. However, commit
3051 f8a08f7b8bd67b28 (Jun 2001), integrated to blead as
3052 c71fccf11fde0068, changed perly.y so that newPROG() is now
3053 called with the output of block_end(), which returns a new
3054 OP_STUB for the case of an empty optree. ByteLoader (and
3055 maybe other things) also take this path, because they set up
3056 PL_main_start and PL_main_root directly, without generating an
3060 PL_comppad_name = 0;
3062 S_op_destroy(aTHX_ o);
3065 PL_main_root = op_scope(sawparens(scalarvoid(o)));
3066 PL_curcop = &PL_compiling;
3067 PL_main_start = LINKLIST(PL_main_root);
3068 PL_main_root->op_private |= OPpREFCOUNTED;
3069 OpREFCNT_set(PL_main_root, 1);
3070 PL_main_root->op_next = 0;
3071 CALL_PEEP(PL_main_start);
3072 finalize_optree(PL_main_root);
3073 cv_forget_slab(PL_compcv);
3076 /* Register with debugger */
3078 CV * const cv = get_cvs("DB::postponed", 0);
3082 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
3084 call_sv(MUTABLE_SV(cv), G_DISCARD);
3091 Perl_localize(pTHX_ OP *o, I32 lex)
3095 PERL_ARGS_ASSERT_LOCALIZE;
3097 if (o->op_flags & OPf_PARENS)
3098 /* [perl #17376]: this appears to be premature, and results in code such as
3099 C< our(%x); > executing in list mode rather than void mode */
3106 if ( PL_parser->bufptr > PL_parser->oldbufptr
3107 && PL_parser->bufptr[-1] == ','
3108 && ckWARN(WARN_PARENTHESIS))
3110 char *s = PL_parser->bufptr;
3113 /* some heuristics to detect a potential error */
3114 while (*s && (strchr(", \t\n", *s)))
3118 if (*s && strchr("@$%*", *s) && *++s
3119 && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) {
3122 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)))
3124 while (*s && (strchr(", \t\n", *s)))
3130 if (sigil && (*s == ';' || *s == '=')) {
3131 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
3132 "Parentheses missing around \"%s\" list",
3134 ? (PL_parser->in_my == KEY_our
3136 : PL_parser->in_my == KEY_state
3146 o = op_lvalue(o, OP_NULL); /* a bit kludgey */
3147 PL_parser->in_my = FALSE;
3148 PL_parser->in_my_stash = NULL;
3153 Perl_jmaybe(pTHX_ OP *o)
3155 PERL_ARGS_ASSERT_JMAYBE;
3157 if (o->op_type == OP_LIST) {
3159 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
3160 o = convert(OP_JOIN, 0, op_prepend_elem(OP_LIST, o2, o));
3165 PERL_STATIC_INLINE OP *
3166 S_op_std_init(pTHX_ OP *o)
3168 I32 type = o->op_type;
3170 PERL_ARGS_ASSERT_OP_STD_INIT;
3172 if (PL_opargs[type] & OA_RETSCALAR)
3174 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
3175 o->op_targ = pad_alloc(type, SVs_PADTMP);
3180 PERL_STATIC_INLINE OP *
3181 S_op_integerize(pTHX_ OP *o)
3183 I32 type = o->op_type;
3185 PERL_ARGS_ASSERT_OP_INTEGERIZE;
3187 /* integerize op. */
3188 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
3191 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
3194 if (type == OP_NEGATE)
3195 /* XXX might want a ck_negate() for this */
3196 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
3202 S_fold_constants(pTHX_ register OP *o)
3207 VOL I32 type = o->op_type;
3212 SV * const oldwarnhook = PL_warnhook;
3213 SV * const olddiehook = PL_diehook;
3217 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
3219 if (!(PL_opargs[type] & OA_FOLDCONST))
3233 /* XXX what about the numeric ops? */
3234 if (IN_LOCALE_COMPILETIME)
3238 if (!cLISTOPo->op_first->op_sibling
3239 || cLISTOPo->op_first->op_sibling->op_type != OP_CONST)
3242 SV * const sv = cSVOPx_sv(cLISTOPo->op_first->op_sibling);
3243 if (!SvPOK(sv) || SvGMAGICAL(sv)) goto nope;
3245 const char *s = SvPVX_const(sv);
3246 while (s < SvEND(sv)) {
3247 if (*s == 'p' || *s == 'P') goto nope;
3254 if (o->op_private & OPpREPEAT_DOLIST) goto nope;
3257 if (PL_parser && PL_parser->error_count)
3258 goto nope; /* Don't try to run w/ errors */
3260 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3261 const OPCODE type = curop->op_type;
3262 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
3264 type != OP_SCALAR &&
3266 type != OP_PUSHMARK)
3272 curop = LINKLIST(o);
3273 old_next = o->op_next;
3277 oldscope = PL_scopestack_ix;
3278 create_eval_scope(G_FAKINGEVAL);
3280 /* Verify that we don't need to save it: */
3281 assert(PL_curcop == &PL_compiling);
3282 StructCopy(&PL_compiling, ¬_compiling, COP);
3283 PL_curcop = ¬_compiling;
3284 /* The above ensures that we run with all the correct hints of the
3285 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
3286 assert(IN_PERL_RUNTIME);
3287 PL_warnhook = PERL_WARNHOOK_FATAL;
3294 sv = *(PL_stack_sp--);
3295 if (o->op_targ && sv == PAD_SV(o->op_targ)) { /* grab pad temp? */
3297 /* Can't simply swipe the SV from the pad, because that relies on
3298 the op being freed "real soon now". Under MAD, this doesn't
3299 happen (see the #ifdef below). */
3302 pad_swipe(o->op_targ, FALSE);
3305 else if (SvTEMP(sv)) { /* grab mortal temp? */
3306 SvREFCNT_inc_simple_void(sv);
3311 /* Something tried to die. Abandon constant folding. */
3312 /* Pretend the error never happened. */
3314 o->op_next = old_next;
3318 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
3319 PL_warnhook = oldwarnhook;
3320 PL_diehook = olddiehook;
3321 /* XXX note that this croak may fail as we've already blown away
3322 * the stack - eg any nested evals */
3323 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
3326 PL_warnhook = oldwarnhook;
3327 PL_diehook = olddiehook;
3328 PL_curcop = &PL_compiling;
3330 if (PL_scopestack_ix > oldscope)
3331 delete_eval_scope();
3340 if (type == OP_RV2GV)
3341 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
3343 newop = newSVOP(OP_CONST, OPpCONST_FOLDED<<8, MUTABLE_SV(sv));
3344 op_getmad(o,newop,'f');
3352 S_gen_constant_list(pTHX_ register OP *o)
3356 const I32 oldtmps_floor = PL_tmps_floor;
3359 if (PL_parser && PL_parser->error_count)
3360 return o; /* Don't attempt to run with errors */
3362 PL_op = curop = LINKLIST(o);
3365 Perl_pp_pushmark(aTHX);
3368 assert (!(curop->op_flags & OPf_SPECIAL));
3369 assert(curop->op_type == OP_RANGE);
3370 Perl_pp_anonlist(aTHX);
3371 PL_tmps_floor = oldtmps_floor;
3373 o->op_type = OP_RV2AV;
3374 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
3375 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
3376 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
3377 o->op_opt = 0; /* needs to be revisited in rpeep() */
3378 curop = ((UNOP*)o)->op_first;
3379 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
3381 op_getmad(curop,o,'O');
3390 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
3393 if (type < 0) type = -type, flags |= OPf_SPECIAL;
3394 if (!o || o->op_type != OP_LIST)
3395 o = newLISTOP(OP_LIST, 0, o, NULL);
3397 o->op_flags &= ~OPf_WANT;
3399 if (!(PL_opargs[type] & OA_MARK))
3400 op_null(cLISTOPo->op_first);
3402 OP * const kid2 = cLISTOPo->op_first->op_sibling;
3403 if (kid2 && kid2->op_type == OP_COREARGS) {
3404 op_null(cLISTOPo->op_first);
3405 kid2->op_private |= OPpCOREARGS_PUSHMARK;
3409 o->op_type = (OPCODE)type;
3410 o->op_ppaddr = PL_ppaddr[type];
3411 o->op_flags |= flags;
3413 o = CHECKOP(type, o);
3414 if (o->op_type != (unsigned)type)
3417 return fold_constants(op_integerize(op_std_init(o)));
3421 =head1 Optree Manipulation Functions
3424 /* List constructors */
3427 =for apidoc Am|OP *|op_append_elem|I32 optype|OP *first|OP *last
3429 Append an item to the list of ops contained directly within a list-type
3430 op, returning the lengthened list. I<first> is the list-type op,
3431 and I<last> is the op to append to the list. I<optype> specifies the
3432 intended opcode for the list. If I<first> is not already a list of the
3433 right type, it will be upgraded into one. If either I<first> or I<last>
3434 is null, the other is returned unchanged.
3440 Perl_op_append_elem(pTHX_ I32 type, OP *first, OP *last)
3448 if (first->op_type != (unsigned)type
3449 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
3451 return newLISTOP(type, 0, first, last);
3454 if (first->op_flags & OPf_KIDS)
3455 ((LISTOP*)first)->op_last->op_sibling = last;
3457 first->op_flags |= OPf_KIDS;
3458 ((LISTOP*)first)->op_first = last;
3460 ((LISTOP*)first)->op_last = last;
3465 =for apidoc Am|OP *|op_append_list|I32 optype|OP *first|OP *last
3467 Concatenate the lists of ops contained directly within two list-type ops,
3468 returning the combined list. I<first> and I<last> are the list-type ops
3469 to concatenate. I<optype> specifies the intended opcode for the list.
3470 If either I<first> or I<last> is not already a list of the right type,
3471 it will be upgraded into one. If either I<first> or I<last> is null,
3472 the other is returned unchanged.
3478 Perl_op_append_list(pTHX_ I32 type, OP *first, OP *last)
3486 if (first->op_type != (unsigned)type)
3487 return op_prepend_elem(type, first, last);
3489 if (last->op_type != (unsigned)type)
3490 return op_append_elem(type, first, last);
3492 ((LISTOP*)first)->op_last->op_sibling = ((LISTOP*)last)->op_first;
3493 ((LISTOP*)first)->op_last = ((LISTOP*)last)->op_last;
3494 first->op_flags |= (last->op_flags & OPf_KIDS);
3497 if (((LISTOP*)last)->op_first && first->op_madprop) {
3498 MADPROP *mp = ((LISTOP*)last)->op_first->op_madprop;
3500 while (mp->mad_next)
3502 mp->mad_next = first->op_madprop;
3505 ((LISTOP*)last)->op_first->op_madprop = first->op_madprop;
3508 first->op_madprop = last->op_madprop;
3509 last->op_madprop = 0;
3512 S_op_destroy(aTHX_ last);
3518 =for apidoc Am|OP *|op_prepend_elem|I32 optype|OP *first|OP *last
3520 Prepend an item to the list of ops contained directly within a list-type
3521 op, returning the lengthened list. I<first> is the op to prepend to the
3522 list, and I<last> is the list-type op. I<optype> specifies the intended
3523 opcode for the list. If I<last> is not already a list of the right type,
3524 it will be upgraded into one. If either I<first> or I<last> is null,
3525 the other is returned unchanged.
3531 Perl_op_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
3539 if (last->op_type == (unsigned)type) {
3540 if (type == OP_LIST) { /* already a PUSHMARK there */
3541 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
3542 ((LISTOP*)last)->op_first->op_sibling = first;
3543 if (!(first->op_flags & OPf_PARENS))
3544 last->op_flags &= ~OPf_PARENS;
3547 if (!(last->op_flags & OPf_KIDS)) {
3548 ((LISTOP*)last)->op_last = first;
3549 last->op_flags |= OPf_KIDS;
3551 first->op_sibling = ((LISTOP*)last)->op_first;
3552 ((LISTOP*)last)->op_first = first;
3554 last->op_flags |= OPf_KIDS;
3558 return newLISTOP(type, 0, first, last);
3566 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
3569 Newxz(tk, 1, TOKEN);
3570 tk->tk_type = (OPCODE)optype;
3571 tk->tk_type = 12345;
3573 tk->tk_mad = madprop;
3578 Perl_token_free(pTHX_ TOKEN* tk)
3580 PERL_ARGS_ASSERT_TOKEN_FREE;
3582 if (tk->tk_type != 12345)
3584 mad_free(tk->tk_mad);
3589 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
3594 PERL_ARGS_ASSERT_TOKEN_GETMAD;
3596 if (tk->tk_type != 12345) {
3597 Perl_warner(aTHX_ packWARN(WARN_MISC),
3598 "Invalid TOKEN object ignored");
3605 /* faked up qw list? */
3607 tm->mad_type == MAD_SV &&
3608 SvPVX((SV *)tm->mad_val)[0] == 'q')
3615 /* pretend constant fold didn't happen? */
3616 if (mp->mad_key == 'f' &&
3617 (o->op_type == OP_CONST ||
3618 o->op_type == OP_GV) )
3620 token_getmad(tk,(OP*)mp->mad_val,slot);
3634 if (mp->mad_key == 'X')
3635 mp->mad_key = slot; /* just change the first one */
3645 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
3654 /* pretend constant fold didn't happen? */
3655 if (mp->mad_key == 'f' &&
3656 (o->op_type == OP_CONST ||
3657 o->op_type == OP_GV) )
3659 op_getmad(from,(OP*)mp->mad_val,slot);
3666 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
3669 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
3675 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
3684 /* pretend constant fold didn't happen? */
3685 if (mp->mad_key == 'f' &&
3686 (o->op_type == OP_CONST ||
3687 o->op_type == OP_GV) )
3689 op_getmad(from,(OP*)mp->mad_val,slot);
3696 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
3699 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
3703 PerlIO_printf(PerlIO_stderr(),
3704 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
3710 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
3728 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
3732 addmad(tm, &(o->op_madprop), slot);
3736 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
3757 Perl_newMADsv(pTHX_ char key, SV* sv)
3759 PERL_ARGS_ASSERT_NEWMADSV;
3761 return newMADPROP(key, MAD_SV, sv, 0);
3765 Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
3767 MADPROP *const mp = (MADPROP *) PerlMemShared_malloc(sizeof(MADPROP));
3770 mp->mad_vlen = vlen;
3771 mp->mad_type = type;
3773 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
3778 Perl_mad_free(pTHX_ MADPROP* mp)
3780 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
3784 mad_free(mp->mad_next);
3785 /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
3786 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
3787 switch (mp->mad_type) {
3791 Safefree((char*)mp->mad_val);
3794 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
3795 op_free((OP*)mp->mad_val);
3798 sv_free(MUTABLE_SV(mp->mad_val));
3801 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
3804 PerlMemShared_free(mp);
3810 =head1 Optree construction
3812 =for apidoc Am|OP *|newNULLLIST
3814 Constructs, checks, and returns a new C<stub> op, which represents an
3815 empty list expression.
3821 Perl_newNULLLIST(pTHX)
3823 return newOP(OP_STUB, 0);
3827 S_force_list(pTHX_ OP *o)
3829 if (!o || o->op_type != OP_LIST)
3830 o = newLISTOP(OP_LIST, 0, o, NULL);
3836 =for apidoc Am|OP *|newLISTOP|I32 type|I32 flags|OP *first|OP *last
3838 Constructs, checks, and returns an op of any list type. I<type> is
3839 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3840 C<OPf_KIDS> will be set automatically if required. I<first> and I<last>
3841 supply up to two ops to be direct children of the list op; they are
3842 consumed by this function and become part of the constructed op tree.
3848 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3853 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP);
3855 NewOp(1101, listop, 1, LISTOP);
3857 listop->op_type = (OPCODE)type;
3858 listop->op_ppaddr = PL_ppaddr[type];
3861 listop->op_flags = (U8)flags;
3865 else if (!first && last)
3868 first->op_sibling = last;
3869 listop->op_first = first;
3870 listop->op_last = last;
3871 if (type == OP_LIST) {
3872 OP* const pushop = newOP(OP_PUSHMARK, 0);
3873 pushop->op_sibling = first;
3874 listop->op_first = pushop;
3875 listop->op_flags |= OPf_KIDS;
3877 listop->op_last = pushop;
3880 return CHECKOP(type, listop);
3884 =for apidoc Am|OP *|newOP|I32 type|I32 flags
3886 Constructs, checks, and returns an op of any base type (any type that
3887 has no extra fields). I<type> is the opcode. I<flags> gives the
3888 eight bits of C<op_flags>, and, shifted up eight bits, the eight bits
3895 Perl_newOP(pTHX_ I32 type, I32 flags)
3900 if (type == -OP_ENTEREVAL) {
3901 type = OP_ENTEREVAL;
3902 flags |= OPpEVAL_BYTES<<8;
3905 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP
3906 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3907 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3908 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
3910 NewOp(1101, o, 1, OP);
3911 o->op_type = (OPCODE)type;
3912 o->op_ppaddr = PL_ppaddr[type];
3913 o->op_flags = (U8)flags;
3916 o->op_private = (U8)(0 | (flags >> 8));
3917 if (PL_opargs[type] & OA_RETSCALAR)
3919 if (PL_opargs[type] & OA_TARGET)
3920 o->op_targ = pad_alloc(type, SVs_PADTMP);
3921 return CHECKOP(type, o);
3925 =for apidoc Am|OP *|newUNOP|I32 type|I32 flags|OP *first
3927 Constructs, checks, and returns an op of any unary type. I<type> is
3928 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3929 C<OPf_KIDS> will be set automatically if required, and, shifted up eight
3930 bits, the eight bits of C<op_private>, except that the bit with value 1
3931 is automatically set. I<first> supplies an optional op to be the direct
3932 child of the unary op; it is consumed by this function and become part
3933 of the constructed op tree.
3939 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
3944 if (type == -OP_ENTEREVAL) {
3945 type = OP_ENTEREVAL;
3946 flags |= OPpEVAL_BYTES<<8;
3949 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP
3950 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3951 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3952 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP
3953 || type == OP_SASSIGN
3954 || type == OP_ENTERTRY
3955 || type == OP_NULL );
3958 first = newOP(OP_STUB, 0);
3959 if (PL_opargs[type] & OA_MARK)
3960 first = force_list(first);
3962 NewOp(1101, unop, 1, UNOP);
3963 unop->op_type = (OPCODE)type;
3964 unop->op_ppaddr = PL_ppaddr[type];
3965 unop->op_first = first;
3966 unop->op_flags = (U8)(flags | OPf_KIDS);
3967 unop->op_private = (U8)(1 | (flags >> 8));
3968 unop = (UNOP*) CHECKOP(type, unop);
3972 return fold_constants(op_integerize(op_std_init((OP *) unop)));
3976 =for apidoc Am|OP *|newBINOP|I32 type|I32 flags|OP *first|OP *last
3978 Constructs, checks, and returns an op of any binary type. I<type>
3979 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
3980 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
3981 the eight bits of C<op_private>, except that the bit with value 1 or
3982 2 is automatically set as required. I<first> and I<last> supply up to
3983 two ops to be the direct children of the binary op; they are consumed
3984 by this function and become part of the constructed op tree.
3990 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3995 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP
3996 || type == OP_SASSIGN || type == OP_NULL );
3998 NewOp(1101, binop, 1, BINOP);
4001 first = newOP(OP_NULL, 0);
4003 binop->op_type = (OPCODE)type;
4004 binop->op_ppaddr = PL_ppaddr[type];
4005 binop->op_first = first;
4006 binop->op_flags = (U8)(flags | OPf_KIDS);
4009 binop->op_private = (U8)(1 | (flags >> 8));
4012 binop->op_private = (U8)(2 | (flags >> 8));
4013 first->op_sibling = last;
4016 binop = (BINOP*)CHECKOP(type, binop);
4017 if (binop->op_next || binop->op_type != (OPCODE)type)
4020 binop->op_last = binop->op_first->op_sibling;
4022 return fold_constants(op_integerize(op_std_init((OP *)binop)));
4025 static int uvcompare(const void *a, const void *b)
4026 __attribute__nonnull__(1)
4027 __attribute__nonnull__(2)
4028 __attribute__pure__;
4029 static int uvcompare(const void *a, const void *b)
4031 if (*((const UV *)a) < (*(const UV *)b))
4033 if (*((const UV *)a) > (*(const UV *)b))
4035 if (*((const UV *)a+1) < (*(const UV *)b+1))
4037 if (*((const UV *)a+1) > (*(const UV *)b+1))
4043 S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
4046 SV * const tstr = ((SVOP*)expr)->op_sv;
4049 (repl->op_type == OP_NULL)
4050 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
4052 ((SVOP*)repl)->op_sv;
4055 const U8 *t = (U8*)SvPV_const(tstr, tlen);
4056 const U8 *r = (U8*)SvPV_const(rstr, rlen);
4062 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
4063 const I32 squash = o->op_private & OPpTRANS_SQUASH;
4064 I32 del = o->op_private & OPpTRANS_DELETE;
4067 PERL_ARGS_ASSERT_PMTRANS;
4069 PL_hints |= HINT_BLOCK_SCOPE;
4072 o->op_private |= OPpTRANS_FROM_UTF;
4075 o->op_private |= OPpTRANS_TO_UTF;
4077 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
4078 SV* const listsv = newSVpvs("# comment\n");
4080 const U8* tend = t + tlen;
4081 const U8* rend = r + rlen;
4095 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
4096 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
4099 const U32 flags = UTF8_ALLOW_DEFAULT;
4103 t = tsave = bytes_to_utf8(t, &len);
4106 if (!to_utf && rlen) {
4108 r = rsave = bytes_to_utf8(r, &len);
4112 /* There are several snags with this code on EBCDIC:
4113 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
4114 2. scan_const() in toke.c has encoded chars in native encoding which makes
4115 ranges at least in EBCDIC 0..255 range the bottom odd.
4119 U8 tmpbuf[UTF8_MAXBYTES+1];
4122 Newx(cp, 2*tlen, UV);
4124 transv = newSVpvs("");
4126 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
4128 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
4130 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
4134 cp[2*i+1] = cp[2*i];
4138 qsort(cp, i, 2*sizeof(UV), uvcompare);
4139 for (j = 0; j < i; j++) {
4141 diff = val - nextmin;
4143 t = uvuni_to_utf8(tmpbuf,nextmin);
4144 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4146 U8 range_mark = UTF_TO_NATIVE(0xff);
4147 t = uvuni_to_utf8(tmpbuf, val - 1);
4148 sv_catpvn(transv, (char *)&range_mark, 1);
4149 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4156 t = uvuni_to_utf8(tmpbuf,nextmin);
4157 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4159 U8 range_mark = UTF_TO_NATIVE(0xff);
4160 sv_catpvn(transv, (char *)&range_mark, 1);
4162 t = uvuni_to_utf8(tmpbuf, 0x7fffffff);
4163 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4164 t = (const U8*)SvPVX_const(transv);
4165 tlen = SvCUR(transv);
4169 else if (!rlen && !del) {
4170 r = t; rlen = tlen; rend = tend;
4173 if ((!rlen && !del) || t == r ||
4174 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
4176 o->op_private |= OPpTRANS_IDENTICAL;
4180 while (t < tend || tfirst <= tlast) {
4181 /* see if we need more "t" chars */
4182 if (tfirst > tlast) {
4183 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
4185 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
4187 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
4194 /* now see if we need more "r" chars */
4195 if (rfirst > rlast) {
4197 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
4199 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
4201 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
4210 rfirst = rlast = 0xffffffff;
4214 /* now see which range will peter our first, if either. */
4215 tdiff = tlast - tfirst;
4216 rdiff = rlast - rfirst;
4223 if (rfirst == 0xffffffff) {
4224 diff = tdiff; /* oops, pretend rdiff is infinite */
4226 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
4227 (long)tfirst, (long)tlast);
4229 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
4233 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
4234 (long)tfirst, (long)(tfirst + diff),
4237 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
4238 (long)tfirst, (long)rfirst);
4240 if (rfirst + diff > max)
4241 max = rfirst + diff;
4243 grows = (tfirst < rfirst &&
4244 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
4256 else if (max > 0xff)
4261 swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none));
4263 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP);
4264 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
4265 PAD_SETSV(cPADOPo->op_padix, swash);
4267 SvREADONLY_on(swash);
4269 cSVOPo->op_sv = swash;
4271 SvREFCNT_dec(listsv);
4272 SvREFCNT_dec(transv);
4274 if (!del && havefinal && rlen)
4275 (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5,
4276 newSVuv((UV)final), 0);
4279 o->op_private |= OPpTRANS_GROWS;
4285 op_getmad(expr,o,'e');
4286 op_getmad(repl,o,'r');
4294 tbl = (short*)PerlMemShared_calloc(
4295 (o->op_private & OPpTRANS_COMPLEMENT) &&
4296 !(o->op_private & OPpTRANS_DELETE) ? 258 : 256,
4298 cPVOPo->op_pv = (char*)tbl;
4300 for (i = 0; i < (I32)tlen; i++)
4302 for (i = 0, j = 0; i < 256; i++) {
4304 if (j >= (I32)rlen) {
4313 if (i < 128 && r[j] >= 128)
4323 o->op_private |= OPpTRANS_IDENTICAL;
4325 else if (j >= (I32)rlen)
4330 PerlMemShared_realloc(tbl,
4331 (0x101+rlen-j) * sizeof(short));
4332 cPVOPo->op_pv = (char*)tbl;
4334 tbl[0x100] = (short)(rlen - j);
4335 for (i=0; i < (I32)rlen - j; i++)
4336 tbl[0x101+i] = r[j+i];
4340 if (!rlen && !del) {
4343 o->op_private |= OPpTRANS_IDENTICAL;
4345 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
4346 o->op_private |= OPpTRANS_IDENTICAL;
4348 for (i = 0; i < 256; i++)
4350 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
4351 if (j >= (I32)rlen) {
4353 if (tbl[t[i]] == -1)
4359 if (tbl[t[i]] == -1) {
4360 if (t[i] < 128 && r[j] >= 128)
4367 if(del && rlen == tlen) {
4368 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator");
4369 } else if(rlen > tlen) {
4370 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list");
4374 o->op_private |= OPpTRANS_GROWS;
4376 op_getmad(expr,o,'e');
4377 op_getmad(repl,o,'r');
4387 =for apidoc Am|OP *|newPMOP|I32 type|I32 flags
4389 Constructs, checks, and returns an op of any pattern matching type.
4390 I<type> is the opcode. I<flags> gives the eight bits of C<op_flags>
4391 and, shifted up eight bits, the eight bits of C<op_private>.
4397 Perl_newPMOP(pTHX_ I32 type, I32 flags)
4402 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PMOP);
4404 NewOp(1101, pmop, 1, PMOP);
4405 pmop->op_type = (OPCODE)type;
4406 pmop->op_ppaddr = PL_ppaddr[type];
4407 pmop->op_flags = (U8)flags;
4408 pmop->op_private = (U8)(0 | (flags >> 8));
4410 if (PL_hints & HINT_RE_TAINT)
4411 pmop->op_pmflags |= PMf_RETAINT;
4412 if (IN_LOCALE_COMPILETIME) {
4413 set_regex_charset(&(pmop->op_pmflags), REGEX_LOCALE_CHARSET);
4415 else if ((! (PL_hints & HINT_BYTES))
4416 /* Both UNI_8_BIT and locale :not_characters imply Unicode */
4417 && (PL_hints & (HINT_UNI_8_BIT|HINT_LOCALE_NOT_CHARS)))
4419 set_regex_charset(&(pmop->op_pmflags), REGEX_UNICODE_CHARSET);
4421 if (PL_hints & HINT_RE_FLAGS) {
4422 SV *reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4423 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags"), 0, 0
4425 if (reflags && SvOK(reflags)) pmop->op_pmflags |= SvIV(reflags);
4426 reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4427 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags_charset"), 0, 0
4429 if (reflags && SvOK(reflags)) {
4430 set_regex_charset(&(pmop->op_pmflags), (regex_charset)SvIV(reflags));
4436 assert(SvPOK(PL_regex_pad[0]));
4437 if (SvCUR(PL_regex_pad[0])) {
4438 /* Pop off the "packed" IV from the end. */
4439 SV *const repointer_list = PL_regex_pad[0];
4440 const char *p = SvEND(repointer_list) - sizeof(IV);
4441 const IV offset = *((IV*)p);
4443 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
4445 SvEND_set(repointer_list, p);
4447 pmop->op_pmoffset = offset;
4448 /* This slot should be free, so assert this: */
4449 assert(PL_regex_pad[offset] == &PL_sv_undef);
4451 SV * const repointer = &PL_sv_undef;
4452 av_push(PL_regex_padav, repointer);
4453 pmop->op_pmoffset = av_len(PL_regex_padav);
4454 PL_regex_pad = AvARRAY(PL_regex_padav);
4458 return CHECKOP(type, pmop);
4461 /* Given some sort of match op o, and an expression expr containing a
4462 * pattern, either compile expr into a regex and attach it to o (if it's
4463 * constant), or convert expr into a runtime regcomp op sequence (if it's
4466 * isreg indicates that the pattern is part of a regex construct, eg
4467 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
4468 * split "pattern", which aren't. In the former case, expr will be a list
4469 * if the pattern contains more than one term (eg /a$b/) or if it contains
4470 * a replacement, ie s/// or tr///.
4472 * When the pattern has been compiled within a new anon CV (for
4473 * qr/(?{...})/ ), then floor indicates the savestack level just before
4474 * the new sub was created
4478 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg, I32 floor)
4483 I32 repl_has_vars = 0;
4485 bool is_trans = (o->op_type == OP_TRANS || o->op_type == OP_TRANSR);
4486 bool is_compiletime;
4489 PERL_ARGS_ASSERT_PMRUNTIME;
4491 /* for s/// and tr///, last element in list is the replacement; pop it */
4493 if (is_trans || o->op_type == OP_SUBST) {
4495 repl = cLISTOPx(expr)->op_last;
4496 kid = cLISTOPx(expr)->op_first;
4497 while (kid->op_sibling != repl)
4498 kid = kid->op_sibling;
4499 kid->op_sibling = NULL;
4500 cLISTOPx(expr)->op_last = kid;
4503 /* for TRANS, convert LIST/PUSH/CONST into CONST, and pass to pmtrans() */
4506 OP* const oe = expr;
4507 assert(expr->op_type == OP_LIST);
4508 assert(cLISTOPx(expr)->op_first->op_type == OP_PUSHMARK);
4509 assert(cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last);
4510 expr = cLISTOPx(oe)->op_last;
4511 cLISTOPx(oe)->op_first->op_sibling = NULL;
4512 cLISTOPx(oe)->op_last = NULL;
4515 return pmtrans(o, expr, repl);
4518 /* find whether we have any runtime or code elements;
4519 * at the same time, temporarily set the op_next of each DO block;
4520 * then when we LINKLIST, this will cause the DO blocks to be excluded
4521 * from the op_next chain (and from having LINKLIST recursively
4522 * applied to them). We fix up the DOs specially later */
4526 if (expr->op_type == OP_LIST) {
4528 for (o = cLISTOPx(expr)->op_first; o; o = o->op_sibling) {
4529 if (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)) {
4531 assert(!o->op_next && o->op_sibling);
4532 o->op_next = o->op_sibling;
4534 else if (o->op_type != OP_CONST && o->op_type != OP_PUSHMARK)
4538 else if (expr->op_type != OP_CONST)
4543 /* fix up DO blocks; treat each one as a separate little sub */
4545 if (expr->op_type == OP_LIST) {
4547 for (o = cLISTOPx(expr)->op_first; o; o = o->op_sibling) {
4548 if (!(o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)))
4550 o->op_next = NULL; /* undo temporary hack from above */
4553 if (cLISTOPo->op_first->op_type == OP_LEAVE) {
4554 LISTOP *leave = cLISTOPx(cLISTOPo->op_first);
4556 assert(leave->op_first->op_type == OP_ENTER);
4557 assert(leave->op_first->op_sibling);
4558 o->op_next = leave->op_first->op_sibling;
4560 assert(leave->op_flags & OPf_KIDS);
4561 assert(leave->op_last->op_next = (OP*)leave);
4562 leave->op_next = NULL; /* stop on last op */
4563 op_null((OP*)leave);
4567 OP *scope = cLISTOPo->op_first;
4568 assert(scope->op_type == OP_SCOPE);
4569 assert(scope->op_flags & OPf_KIDS);
4570 scope->op_next = NULL; /* stop on last op */
4573 /* have to peep the DOs individually as we've removed it from
4574 * the op_next chain */
4577 /* runtime finalizes as part of finalizing whole tree */
4582 PL_hints |= HINT_BLOCK_SCOPE;
4584 assert(floor==0 || (pm->op_pmflags & PMf_HAS_CV));
4586 if (is_compiletime) {
4587 U32 rx_flags = pm->op_pmflags & RXf_PMf_COMPILETIME;
4588 regexp_engine const *eng = current_re_engine();
4590 if (o->op_flags & OPf_SPECIAL)
4591 rx_flags |= RXf_SPLIT;
4593 if (!has_code || !eng->op_comp) {
4594 /* compile-time simple constant pattern */
4596 if ((pm->op_pmflags & PMf_HAS_CV) && !has_code) {
4597 /* whoops! we guessed that a qr// had a code block, but we
4598 * were wrong (e.g. /[(?{}]/ ). Throw away the PL_compcv
4599 * that isn't required now. Note that we have to be pretty
4600 * confident that nothing used that CV's pad while the
4601 * regex was parsed */
4602 assert(AvFILLp(PL_comppad) == 0); /* just @_ */
4603 /* But we know that one op is using this CV's slab. */
4604 cv_forget_slab(PL_compcv);
4606 pm->op_pmflags &= ~PMf_HAS_CV;
4611 ? eng->op_comp(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4612 rx_flags, pm->op_pmflags)
4613 : Perl_re_op_compile(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4614 rx_flags, pm->op_pmflags)
4617 op_getmad(expr,(OP*)pm,'e');
4623 /* compile-time pattern that includes literal code blocks */
4624 REGEXP* re = eng->op_comp(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4627 ((PL_hints & HINT_RE_EVAL) ? PMf_USE_RE_EVAL : 0))
4630 if (pm->op_pmflags & PMf_HAS_CV) {
4632 /* this QR op (and the anon sub we embed it in) is never
4633 * actually executed. It's just a placeholder where we can
4634 * squirrel away expr in op_code_list without the peephole
4635 * optimiser etc processing it for a second time */
4636 OP *qr = newPMOP(OP_QR, 0);
4637 ((PMOP*)qr)->op_code_list = expr;
4639 /* handle the implicit sub{} wrapped round the qr/(?{..})/ */
4640 SvREFCNT_inc_simple_void(PL_compcv);
4641 cv = newATTRSUB(floor, 0, NULL, NULL, qr);
4642 ((struct regexp *)SvANY(re))->qr_anoncv = cv;
4644 /* attach the anon CV to the pad so that
4645 * pad_fixup_inner_anons() can find it */
4646 (void)pad_add_anon(cv, o->op_type);
4647 SvREFCNT_inc_simple_void(cv);
4650 pm->op_code_list = expr;
4655 /* runtime pattern: build chain of regcomp etc ops */
4657 PADOFFSET cv_targ = 0;
4659 reglist = isreg && expr->op_type == OP_LIST;
4664 pm->op_code_list = expr;
4665 /* don't free op_code_list; its ops are embedded elsewhere too */
4666 pm->op_pmflags |= PMf_CODELIST_PRIVATE;
4669 /* the OP_REGCMAYBE is a placeholder in the non-threaded case
4670 * to allow its op_next to be pointed past the regcomp and
4671 * preceding stacking ops;
4672 * OP_REGCRESET is there to reset taint before executing the
4674 if (pm->op_pmflags & PMf_KEEP || PL_tainting)
4675 expr = newUNOP((PL_tainting ? OP_REGCRESET : OP_REGCMAYBE),0,expr);
4677 if (pm->op_pmflags & PMf_HAS_CV) {
4678 /* we have a runtime qr with literal code. This means
4679 * that the qr// has been wrapped in a new CV, which
4680 * means that runtime consts, vars etc will have been compiled
4681 * against a new pad. So... we need to execute those ops
4682 * within the environment of the new CV. So wrap them in a call
4683 * to a new anon sub. i.e. for
4687 * we build an anon sub that looks like
4689 * sub { "a", $b, '(?{...})' }
4691 * and call it, passing the returned list to regcomp.
4692 * Or to put it another way, the list of ops that get executed
4696 * ------ -------------------
4697 * pushmark (for regcomp)
4698 * pushmark (for entersub)
4699 * pushmark (for refgen)
4703 * regcreset regcreset
4705 * const("a") const("a")
4707 * const("(?{...})") const("(?{...})")
4712 SvREFCNT_inc_simple_void(PL_compcv);
4713 /* these lines are just an unrolled newANONATTRSUB */
4714 expr = newSVOP(OP_ANONCODE, 0,
4715 MUTABLE_SV(newATTRSUB(floor, 0, NULL, NULL, expr)));
4716 cv_targ = expr->op_targ;
4717 expr = newUNOP(OP_REFGEN, 0, expr);
4719 expr = list(force_list(newUNOP(OP_ENTERSUB, 0, scalar(expr))));
4722 NewOp(1101, rcop, 1, LOGOP);
4723 rcop->op_type = OP_REGCOMP;
4724 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
4725 rcop->op_first = scalar(expr);
4726 rcop->op_flags |= OPf_KIDS
4727 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
4728 | (reglist ? OPf_STACKED : 0);
4729 rcop->op_private = 0;
4731 rcop->op_targ = cv_targ;
4733 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
4734 if (PL_hints & HINT_RE_EVAL) PL_cv_has_eval = 1;
4736 /* establish postfix order */
4737 if (expr->op_type == OP_REGCRESET || expr->op_type == OP_REGCMAYBE) {
4739 rcop->op_next = expr;
4740 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
4743 rcop->op_next = LINKLIST(expr);
4744 expr->op_next = (OP*)rcop;
4747 op_prepend_elem(o->op_type, scalar((OP*)rcop), o);
4752 if (pm->op_pmflags & PMf_EVAL) {
4754 if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end)
4755 CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end);
4757 else if (repl->op_type == OP_CONST)
4761 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
4762 if (curop->op_type == OP_SCOPE
4763 || curop->op_type == OP_LEAVE
4764 || (PL_opargs[curop->op_type] & OA_DANGEROUS)) {
4765 if (curop->op_type == OP_GV) {
4766 GV * const gv = cGVOPx_gv(curop);
4768 if (strchr("&`'123456789+-\016\022", *GvENAME(gv)))
4771 else if (curop->op_type == OP_RV2CV)
4773 else if (curop->op_type == OP_RV2SV ||
4774 curop->op_type == OP_RV2AV ||
4775 curop->op_type == OP_RV2HV ||
4776 curop->op_type == OP_RV2GV) {
4777 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
4780 else if (curop->op_type == OP_PADSV ||
4781 curop->op_type == OP_PADAV ||
4782 curop->op_type == OP_PADHV ||
4783 curop->op_type == OP_PADANY)
4787 else if (curop->op_type == OP_PUSHRE)
4788 NOOP; /* Okay here, dangerous in newASSIGNOP */
4798 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
4800 pm->op_pmflags |= PMf_CONST; /* const for long enough */
4801 op_prepend_elem(o->op_type, scalar(repl), o);
4804 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
4805 pm->op_pmflags |= PMf_MAYBE_CONST;
4807 NewOp(1101, rcop, 1, LOGOP);
4808 rcop->op_type = OP_SUBSTCONT;
4809 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
4810 rcop->op_first = scalar(repl);
4811 rcop->op_flags |= OPf_KIDS;
4812 rcop->op_private = 1;
4815 /* establish postfix order */
4816 rcop->op_next = LINKLIST(repl);
4817 repl->op_next = (OP*)rcop;
4819 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
4820 assert(!(pm->op_pmflags & PMf_ONCE));
4821 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
4830 =for apidoc Am|OP *|newSVOP|I32 type|I32 flags|SV *sv
4832 Constructs, checks, and returns an op of any type that involves an
4833 embedded SV. I<type> is the opcode. I<flags> gives the eight bits
4834 of C<op_flags>. I<sv> gives the SV to embed in the op; this function
4835 takes ownership of one reference to it.
4841 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
4846 PERL_ARGS_ASSERT_NEWSVOP;
4848 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4849 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4850 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4852 NewOp(1101, svop, 1, SVOP);
4853 svop->op_type = (OPCODE)type;
4854 svop->op_ppaddr = PL_ppaddr[type];
4856 svop->op_next = (OP*)svop;
4857 svop->op_flags = (U8)flags;
4858 svop->op_private = (U8)(0 | (flags >> 8));
4859 if (PL_opargs[type] & OA_RETSCALAR)
4861 if (PL_opargs[type] & OA_TARGET)
4862 svop->op_targ = pad_alloc(type, SVs_PADTMP);
4863 return CHECKOP(type, svop);
4869 =for apidoc Am|OP *|newPADOP|I32 type|I32 flags|SV *sv
4871 Constructs, checks, and returns an op of any type that involves a
4872 reference to a pad element. I<type> is the opcode. I<flags> gives the
4873 eight bits of C<op_flags>. A pad slot is automatically allocated, and
4874 is populated with I<sv>; this function takes ownership of one reference
4877 This function only exists if Perl has been compiled to use ithreads.
4883 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
4888 PERL_ARGS_ASSERT_NEWPADOP;
4890 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4891 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4892 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4894 NewOp(1101, padop, 1, PADOP);
4895 padop->op_type = (OPCODE)type;
4896 padop->op_ppaddr = PL_ppaddr[type];
4897 padop->op_padix = pad_alloc(type, SVs_PADTMP);
4898 SvREFCNT_dec(PAD_SVl(padop->op_padix));
4899 PAD_SETSV(padop->op_padix, sv);
4902 padop->op_next = (OP*)padop;
4903 padop->op_flags = (U8)flags;
4904 if (PL_opargs[type] & OA_RETSCALAR)
4906 if (PL_opargs[type] & OA_TARGET)
4907 padop->op_targ = pad_alloc(type, SVs_PADTMP);
4908 return CHECKOP(type, padop);
4911 #endif /* !USE_ITHREADS */
4914 =for apidoc Am|OP *|newGVOP|I32 type|I32 flags|GV *gv
4916 Constructs, checks, and returns an op of any type that involves an
4917 embedded reference to a GV. I<type> is the opcode. I<flags> gives the
4918 eight bits of C<op_flags>. I<gv> identifies the GV that the op should
4919 reference; calling this function does not transfer ownership of any
4926 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
4930 PERL_ARGS_ASSERT_NEWGVOP;
4934 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4936 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4941 =for apidoc Am|OP *|newPVOP|I32 type|I32 flags|char *pv
4943 Constructs, checks, and returns an op of any type that involves an
4944 embedded C-level pointer (PV). I<type> is the opcode. I<flags> gives
4945 the eight bits of C<op_flags>. I<pv> supplies the C-level pointer, which
4946 must have been allocated using L</PerlMemShared_malloc>; the memory will
4947 be freed when the op is destroyed.
4953 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
4956 const bool utf8 = cBOOL(flags & SVf_UTF8);
4961 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4963 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
4965 NewOp(1101, pvop, 1, PVOP);
4966 pvop->op_type = (OPCODE)type;
4967 pvop->op_ppaddr = PL_ppaddr[type];
4969 pvop->op_next = (OP*)pvop;
4970 pvop->op_flags = (U8)flags;
4971 pvop->op_private = utf8 ? OPpPV_IS_UTF8 : 0;
4972 if (PL_opargs[type] & OA_RETSCALAR)
4974 if (PL_opargs[type] & OA_TARGET)
4975 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
4976 return CHECKOP(type, pvop);
4984 Perl_package(pTHX_ OP *o)
4987 SV *const sv = cSVOPo->op_sv;
4992 PERL_ARGS_ASSERT_PACKAGE;
4994 SAVEGENERICSV(PL_curstash);
4995 save_item(PL_curstname);
4997 PL_curstash = (HV *)SvREFCNT_inc(gv_stashsv(sv, GV_ADD));
4999 sv_setsv(PL_curstname, sv);
5001 PL_hints |= HINT_BLOCK_SCOPE;
5002 PL_parser->copline = NOLINE;
5003 PL_parser->expect = XSTATE;
5008 if (!PL_madskills) {
5013 pegop = newOP(OP_NULL,0);
5014 op_getmad(o,pegop,'P');
5020 Perl_package_version( pTHX_ OP *v )
5023 U32 savehints = PL_hints;
5024 PERL_ARGS_ASSERT_PACKAGE_VERSION;
5025 PL_hints &= ~HINT_STRICT_VARS;
5026 sv_setsv( GvSV(gv_fetchpvs("VERSION", GV_ADDMULTI, SVt_PV)), cSVOPx(v)->op_sv );
5027 PL_hints = savehints;
5036 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
5043 OP *pegop = PL_madskills ? newOP(OP_NULL,0) : NULL;
5045 SV *use_version = NULL;
5047 PERL_ARGS_ASSERT_UTILIZE;
5049 if (idop->op_type != OP_CONST)
5050 Perl_croak(aTHX_ "Module name must be constant");
5053 op_getmad(idop,pegop,'U');
5058 SV * const vesv = ((SVOP*)version)->op_sv;
5061 op_getmad(version,pegop,'V');
5062 if (!arg && !SvNIOKp(vesv)) {
5069 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
5070 Perl_croak(aTHX_ "Version number must be a constant number");
5072 /* Make copy of idop so we don't free it twice */
5073 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
5075 /* Fake up a method call to VERSION */
5076 meth = newSVpvs_share("VERSION");
5077 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
5078 op_append_elem(OP_LIST,
5079 op_prepend_elem(OP_LIST, pack, list(version)),
5080 newSVOP(OP_METHOD_NAMED, 0, meth)));
5084 /* Fake up an import/unimport */
5085 if (arg && arg->op_type == OP_STUB) {
5087 op_getmad(arg,pegop,'S');
5088 imop = arg; /* no import on explicit () */
5090 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
5091 imop = NULL; /* use 5.0; */
5093 use_version = ((SVOP*)idop)->op_sv;
5095 idop->op_private |= OPpCONST_NOVER;
5101 op_getmad(arg,pegop,'A');
5103 /* Make copy of idop so we don't free it twice */
5104 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
5106 /* Fake up a method call to import/unimport */
5108 ? newSVpvs_share("import") : newSVpvs_share("unimport");
5109 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
5110 op_append_elem(OP_LIST,
5111 op_prepend_elem(OP_LIST, pack, list(arg)),
5112 newSVOP(OP_METHOD_NAMED, 0, meth)));
5115 /* Fake up the BEGIN {}, which does its thing immediately. */
5117 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
5120 op_append_elem(OP_LINESEQ,
5121 op_append_elem(OP_LINESEQ,
5122 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
5123 newSTATEOP(0, NULL, veop)),
5124 newSTATEOP(0, NULL, imop) ));
5128 * feature bundle that corresponds to the required version. */
5129 use_version = sv_2mortal(new_version(use_version));
5130 S_enable_feature_bundle(aTHX_ use_version);
5132 /* If a version >= 5.11.0 is requested, strictures are on by default! */
5133 if (vcmp(use_version,
5134 sv_2mortal(upg_version(newSVnv(5.011000), FALSE))) >= 0) {
5135 if (!(PL_hints & HINT_EXPLICIT_STRICT_REFS))
5136 PL_hints |= HINT_STRICT_REFS;
5137 if (!(PL_hints & HINT_EXPLICIT_STRICT_SUBS))
5138 PL_hints |= HINT_STRICT_SUBS;
5139 if (!(PL_hints & HINT_EXPLICIT_STRICT_VARS))
5140 PL_hints |= HINT_STRICT_VARS;
5142 /* otherwise they are off */
5144 if (!(PL_hints & HINT_EXPLICIT_STRICT_REFS))
5145 PL_hints &= ~HINT_STRICT_REFS;
5146 if (!(PL_hints & HINT_EXPLICIT_STRICT_SUBS))
5147 PL_hints &= ~HINT_STRICT_SUBS;
5148 if (!(PL_hints & HINT_EXPLICIT_STRICT_VARS))
5149 PL_hints &= ~HINT_STRICT_VARS;
5153 /* The "did you use incorrect case?" warning used to be here.
5154 * The problem is that on case-insensitive filesystems one
5155 * might get false positives for "use" (and "require"):
5156 * "use Strict" or "require CARP" will work. This causes
5157 * portability problems for the script: in case-strict
5158 * filesystems the script will stop working.
5160 * The "incorrect case" warning checked whether "use Foo"
5161 * imported "Foo" to your namespace, but that is wrong, too:
5162 * there is no requirement nor promise in the language that
5163 * a Foo.pm should or would contain anything in package "Foo".
5165 * There is very little Configure-wise that can be done, either:
5166 * the case-sensitivity of the build filesystem of Perl does not
5167 * help in guessing the case-sensitivity of the runtime environment.
5170 PL_hints |= HINT_BLOCK_SCOPE;
5171 PL_parser->copline = NOLINE;
5172 PL_parser->expect = XSTATE;
5173 PL_cop_seqmax++; /* Purely for B::*'s benefit */
5174 if (PL_cop_seqmax == PERL_PADSEQ_INTRO) /* not a legal value */
5183 =head1 Embedding Functions
5185 =for apidoc load_module
5187 Loads the module whose name is pointed to by the string part of name.
5188 Note that the actual module name, not its filename, should be given.
5189 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
5190 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
5191 (or 0 for no flags). ver, if specified and not NULL, provides version semantics
5192 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
5193 arguments can be used to specify arguments to the module's import()
5194 method, similar to C<use Foo::Bar VERSION LIST>. They must be
5195 terminated with a final NULL pointer. Note that this list can only
5196 be omitted when the PERL_LOADMOD_NOIMPORT flag has been used.
5197 Otherwise at least a single NULL pointer to designate the default
5198 import list is required.
5200 The reference count for each specified C<SV*> parameter is decremented.
5205 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
5209 PERL_ARGS_ASSERT_LOAD_MODULE;
5211 va_start(args, ver);
5212 vload_module(flags, name, ver, &args);
5216 #ifdef PERL_IMPLICIT_CONTEXT
5218 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
5222 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
5223 va_start(args, ver);
5224 vload_module(flags, name, ver, &args);
5230 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
5234 OP * const modname = newSVOP(OP_CONST, 0, name);
5236 PERL_ARGS_ASSERT_VLOAD_MODULE;
5238 modname->op_private |= OPpCONST_BARE;
5240 veop = newSVOP(OP_CONST, 0, ver);
5244 if (flags & PERL_LOADMOD_NOIMPORT) {
5245 imop = sawparens(newNULLLIST());
5247 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
5248 imop = va_arg(*args, OP*);
5253 sv = va_arg(*args, SV*);
5255 imop = op_append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
5256 sv = va_arg(*args, SV*);
5260 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
5261 * that it has a PL_parser to play with while doing that, and also
5262 * that it doesn't mess with any existing parser, by creating a tmp
5263 * new parser with lex_start(). This won't actually be used for much,
5264 * since pp_require() will create another parser for the real work. */
5267 SAVEVPTR(PL_curcop);
5268 lex_start(NULL, NULL, LEX_START_SAME_FILTER);
5269 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
5270 veop, modname, imop);
5275 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
5281 PERL_ARGS_ASSERT_DOFILE;
5283 if (!force_builtin) {
5284 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
5285 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
5286 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
5287 gv = gvp ? *gvp : NULL;
5291 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
5292 doop = newUNOP(OP_ENTERSUB, OPf_STACKED,
5293 op_append_elem(OP_LIST, term,
5294 scalar(newUNOP(OP_RV2CV, 0,
5295 newGVOP(OP_GV, 0, gv)))));
5298 doop = newUNOP(OP_DOFILE, 0, scalar(term));
5304 =head1 Optree construction
5306 =for apidoc Am|OP *|newSLICEOP|I32 flags|OP *subscript|OP *listval
5308 Constructs, checks, and returns an C<lslice> (list slice) op. I<flags>
5309 gives the eight bits of C<op_flags>, except that C<OPf_KIDS> will
5310 be set automatically, and, shifted up eight bits, the eight bits of
5311 C<op_private>, except that the bit with value 1 or 2 is automatically
5312 set as required. I<listval> and I<subscript> supply the parameters of
5313 the slice; they are consumed by this function and become part of the
5314 constructed op tree.
5320 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
5322 return newBINOP(OP_LSLICE, flags,
5323 list(force_list(subscript)),
5324 list(force_list(listval)) );
5328 S_is_list_assignment(pTHX_ register const OP *o)
5336 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
5337 o = cUNOPo->op_first;
5339 flags = o->op_flags;
5341 if (type == OP_COND_EXPR) {
5342 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
5343 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
5348 yyerror("Assignment to both a list and a scalar");
5352 if (type == OP_LIST &&
5353 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
5354 o->op_private & OPpLVAL_INTRO)
5357 if (type == OP_LIST || flags & OPf_PARENS ||
5358 type == OP_RV2AV || type == OP_RV2HV ||
5359 type == OP_ASLICE || type == OP_HSLICE)
5362 if (type == OP_PADAV || type == OP_PADHV)
5365 if (type == OP_RV2SV)
5372 Helper function for newASSIGNOP to detection commonality between the
5373 lhs and the rhs. Marks all variables with PL_generation. If it
5374 returns TRUE the assignment must be able to handle common variables.
5376 PERL_STATIC_INLINE bool
5377 S_aassign_common_vars(pTHX_ OP* o)
5380 for (curop = cUNOPo->op_first; curop; curop=curop->op_sibling) {
5381 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
5382 if (curop->op_type == OP_GV) {
5383 GV *gv = cGVOPx_gv(curop);
5385 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5387 GvASSIGN_GENERATION_set(gv, PL_generation);
5389 else if (curop->op_type == OP_PADSV ||
5390 curop->op_type == OP_PADAV ||
5391 curop->op_type == OP_PADHV ||
5392 curop->op_type == OP_PADANY)
5394 if (PAD_COMPNAME_GEN(curop->op_targ)
5395 == (STRLEN)PL_generation)
5397 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
5400 else if (curop->op_type == OP_RV2CV)
5402 else if (curop->op_type == OP_RV2SV ||
5403 curop->op_type == OP_RV2AV ||
5404 curop->op_type == OP_RV2HV ||
5405 curop->op_type == OP_RV2GV) {
5406 if (cUNOPx(curop)->op_first->op_type != OP_GV) /* funny deref? */
5409 else if (curop->op_type == OP_PUSHRE) {
5411 if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) {
5412 GV *const gv = MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff));
5414 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5416 GvASSIGN_GENERATION_set(gv, PL_generation);
5420 = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
5423 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5425 GvASSIGN_GENERATION_set(gv, PL_generation);
5433 if (curop->op_flags & OPf_KIDS) {
5434 if (aassign_common_vars(curop))
5442 =for apidoc Am|OP *|newASSIGNOP|I32 flags|OP *left|I32 optype|OP *right
5444 Constructs, checks, and returns an assignment op. I<left> and I<right>
5445 supply the parameters of the assignment; they are consumed by this
5446 function and become part of the constructed op tree.
5448 If I<optype> is C<OP_ANDASSIGN>, C<OP_ORASSIGN>, or C<OP_DORASSIGN>, then
5449 a suitable conditional optree is constructed. If I<optype> is the opcode
5450 of a binary operator, such as C<OP_BIT_OR>, then an op is constructed that
5451 performs the binary operation and assigns the result to the left argument.
5452 Either way, if I<optype> is non-zero then I<flags> has no effect.
5454 If I<optype> is zero, then a plain scalar or list assignment is
5455 constructed. Which type of assignment it is is automatically determined.
5456 I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5457 will be set automatically, and, shifted up eight bits, the eight bits
5458 of C<op_private>, except that the bit with value 1 or 2 is automatically
5465 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
5471 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
5472 return newLOGOP(optype, 0,
5473 op_lvalue(scalar(left), optype),
5474 newUNOP(OP_SASSIGN, 0, scalar(right)));
5477 return newBINOP(optype, OPf_STACKED,
5478 op_lvalue(scalar(left), optype), scalar(right));
5482 if (is_list_assignment(left)) {
5483 static const char no_list_state[] = "Initialization of state variables"
5484 " in list context currently forbidden";
5486 bool maybe_common_vars = TRUE;
5489 left = op_lvalue(left, OP_AASSIGN);
5490 curop = list(force_list(left));
5491 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
5492 o->op_private = (U8)(0 | (flags >> 8));
5494 if ((left->op_type == OP_LIST
5495 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
5497 OP* lop = ((LISTOP*)left)->op_first;
5498 maybe_common_vars = FALSE;
5500 if (lop->op_type == OP_PADSV ||
5501 lop->op_type == OP_PADAV ||
5502 lop->op_type == OP_PADHV ||
5503 lop->op_type == OP_PADANY) {
5504 if (!(lop->op_private & OPpLVAL_INTRO))
5505 maybe_common_vars = TRUE;
5507 if (lop->op_private & OPpPAD_STATE) {
5508 if (left->op_private & OPpLVAL_INTRO) {
5509 /* Each variable in state($a, $b, $c) = ... */
5512 /* Each state variable in
5513 (state $a, my $b, our $c, $d, undef) = ... */
5515 yyerror(no_list_state);
5517 /* Each my variable in
5518 (state $a, my $b, our $c, $d, undef) = ... */
5520 } else if (lop->op_type == OP_UNDEF ||
5521 lop->op_type == OP_PUSHMARK) {
5522 /* undef may be interesting in
5523 (state $a, undef, state $c) */
5525 /* Other ops in the list. */
5526 maybe_common_vars = TRUE;
5528 lop = lop->op_sibling;
5531 else if ((left->op_private & OPpLVAL_INTRO)
5532 && ( left->op_type == OP_PADSV
5533 || left->op_type == OP_PADAV
5534 || left->op_type == OP_PADHV
5535 || left->op_type == OP_PADANY))
5537 if (left->op_type == OP_PADSV) maybe_common_vars = FALSE;
5538 if (left->op_private & OPpPAD_STATE) {
5539 /* All single variable list context state assignments, hence
5549 yyerror(no_list_state);
5553 /* PL_generation sorcery:
5554 * an assignment like ($a,$b) = ($c,$d) is easier than
5555 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
5556 * To detect whether there are common vars, the global var
5557 * PL_generation is incremented for each assign op we compile.
5558 * Then, while compiling the assign op, we run through all the
5559 * variables on both sides of the assignment, setting a spare slot
5560 * in each of them to PL_generation. If any of them already have
5561 * that value, we know we've got commonality. We could use a
5562 * single bit marker, but then we'd have to make 2 passes, first
5563 * to clear the flag, then to test and set it. To find somewhere
5564 * to store these values, evil chicanery is done with SvUVX().
5567 if (maybe_common_vars) {
5569 if (aassign_common_vars(o))
5570 o->op_private |= OPpASSIGN_COMMON;
5574 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
5575 OP* tmpop = ((LISTOP*)right)->op_first;
5576 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
5577 PMOP * const pm = (PMOP*)tmpop;
5578 if (left->op_type == OP_RV2AV &&
5579 !(left->op_private & OPpLVAL_INTRO) &&
5580 !(o->op_private & OPpASSIGN_COMMON) )
5582 tmpop = ((UNOP*)left)->op_first;
5583 if (tmpop->op_type == OP_GV
5585 && !pm->op_pmreplrootu.op_pmtargetoff
5587 && !pm->op_pmreplrootu.op_pmtargetgv
5591 pm->op_pmreplrootu.op_pmtargetoff
5592 = cPADOPx(tmpop)->op_padix;
5593 cPADOPx(tmpop)->op_padix = 0; /* steal it */
5595 pm->op_pmreplrootu.op_pmtargetgv
5596 = MUTABLE_GV(cSVOPx(tmpop)->op_sv);
5597 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
5599 pm->op_pmflags |= PMf_ONCE;
5600 tmpop = cUNOPo->op_first; /* to list (nulled) */
5601 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
5602 tmpop->op_sibling = NULL; /* don't free split */
5603 right->op_next = tmpop->op_next; /* fix starting loc */
5604 op_free(o); /* blow off assign */
5605 right->op_flags &= ~OPf_WANT;
5606 /* "I don't know and I don't care." */
5611 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
5612 ((LISTOP*)right)->op_last->op_type == OP_CONST)
5614 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
5615 if (SvIOK(sv) && SvIVX(sv) == 0)
5616 sv_setiv(sv, PL_modcount+1);
5624 right = newOP(OP_UNDEF, 0);
5625 if (right->op_type == OP_READLINE) {
5626 right->op_flags |= OPf_STACKED;
5627 return newBINOP(OP_NULL, flags, op_lvalue(scalar(left), OP_SASSIGN),
5631 o = newBINOP(OP_SASSIGN, flags,
5632 scalar(right), op_lvalue(scalar(left), OP_SASSIGN) );
5638 =for apidoc Am|OP *|newSTATEOP|I32 flags|char *label|OP *o
5640 Constructs a state op (COP). The state op is normally a C<nextstate> op,
5641 but will be a C<dbstate> op if debugging is enabled for currently-compiled
5642 code. The state op is populated from L</PL_curcop> (or L</PL_compiling>).
5643 If I<label> is non-null, it supplies the name of a label to attach to
5644 the state op; this function takes ownership of the memory pointed at by
5645 I<label>, and will free it. I<flags> gives the eight bits of C<op_flags>
5648 If I<o> is null, the state op is returned. Otherwise the state op is
5649 combined with I<o> into a C<lineseq> list op, which is returned. I<o>
5650 is consumed by this function and becomes part of the returned op tree.
5656 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
5659 const U32 seq = intro_my();
5660 const U32 utf8 = flags & SVf_UTF8;
5665 NewOp(1101, cop, 1, COP);
5666 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
5667 cop->op_type = OP_DBSTATE;
5668 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
5671 cop->op_type = OP_NEXTSTATE;
5672 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
5674 cop->op_flags = (U8)flags;
5675 CopHINTS_set(cop, PL_hints);
5677 cop->op_private |= NATIVE_HINTS;
5679 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
5680 cop->op_next = (OP*)cop;
5683 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
5684 CopHINTHASH_set(cop, cophh_copy(CopHINTHASH_get(PL_curcop)));
5686 Perl_cop_store_label(aTHX_ cop, label, strlen(label), utf8);
5688 PL_hints |= HINT_BLOCK_SCOPE;
5689 /* It seems that we need to defer freeing this pointer, as other parts
5690 of the grammar end up wanting to copy it after this op has been
5695 if (PL_parser && PL_parser->copline == NOLINE)
5696 CopLINE_set(cop, CopLINE(PL_curcop));
5698 CopLINE_set(cop, PL_parser->copline);
5699 PL_parser->copline = NOLINE;
5702 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
5704 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
5706 CopSTASH_set(cop, PL_curstash);
5708 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) {
5709 /* this line can have a breakpoint - store the cop in IV */
5710 AV *av = CopFILEAVx(PL_curcop);
5712 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
5713 if (svp && *svp != &PL_sv_undef ) {
5714 (void)SvIOK_on(*svp);
5715 SvIV_set(*svp, PTR2IV(cop));
5720 if (flags & OPf_SPECIAL)
5722 return op_prepend_elem(OP_LINESEQ, (OP*)cop, o);
5726 =for apidoc Am|OP *|newLOGOP|I32 type|I32 flags|OP *first|OP *other
5728 Constructs, checks, and returns a logical (flow control) op. I<type>
5729 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
5730 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
5731 the eight bits of C<op_private>, except that the bit with value 1 is
5732 automatically set. I<first> supplies the expression controlling the
5733 flow, and I<other> supplies the side (alternate) chain of ops; they are
5734 consumed by this function and become part of the constructed op tree.
5740 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
5744 PERL_ARGS_ASSERT_NEWLOGOP;
5746 return new_logop(type, flags, &first, &other);
5750 S_search_const(pTHX_ OP *o)
5752 PERL_ARGS_ASSERT_SEARCH_CONST;
5754 switch (o->op_type) {
5758 if (o->op_flags & OPf_KIDS)
5759 return search_const(cUNOPo->op_first);
5766 if (!(o->op_flags & OPf_KIDS))
5768 kid = cLISTOPo->op_first;
5770 switch (kid->op_type) {
5774 kid = kid->op_sibling;
5777 if (kid != cLISTOPo->op_last)
5783 kid = cLISTOPo->op_last;
5785 return search_const(kid);
5793 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
5801 int prepend_not = 0;
5803 PERL_ARGS_ASSERT_NEW_LOGOP;
5808 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
5809 return newBINOP(type, flags, scalar(first), scalar(other));
5811 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOGOP);
5813 scalarboolean(first);
5814 /* optimize AND and OR ops that have NOTs as children */
5815 if (first->op_type == OP_NOT
5816 && (first->op_flags & OPf_KIDS)
5817 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
5818 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
5820 if (type == OP_AND || type == OP_OR) {
5826 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
5828 prepend_not = 1; /* prepend a NOT op later */
5832 /* search for a constant op that could let us fold the test */
5833 if ((cstop = search_const(first))) {
5834 if (cstop->op_private & OPpCONST_STRICT)
5835 no_bareword_allowed(cstop);
5836 else if ((cstop->op_private & OPpCONST_BARE))
5837 Perl_ck_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
5838 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
5839 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
5840 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
5842 if (other->op_type == OP_CONST)
5843 other->op_private |= OPpCONST_SHORTCIRCUIT;
5845 OP *newop = newUNOP(OP_NULL, 0, other);
5846 op_getmad(first, newop, '1');
5847 newop->op_targ = type; /* set "was" field */
5851 if (other->op_type == OP_LEAVE)
5852 other = newUNOP(OP_NULL, OPf_SPECIAL, other);
5853 else if (other->op_type == OP_MATCH
5854 || other->op_type == OP_SUBST
5855 || other->op_type == OP_TRANSR
5856 || other->op_type == OP_TRANS)
5857 /* Mark the op as being unbindable with =~ */
5858 other->op_flags |= OPf_SPECIAL;
5859 else if (other->op_type == OP_CONST)
5860 other->op_private |= OPpCONST_FOLDED;
5864 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
5865 const OP *o2 = other;
5866 if ( ! (o2->op_type == OP_LIST
5867 && (( o2 = cUNOPx(o2)->op_first))
5868 && o2->op_type == OP_PUSHMARK
5869 && (( o2 = o2->op_sibling)) )
5872 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
5873 || o2->op_type == OP_PADHV)
5874 && o2->op_private & OPpLVAL_INTRO
5875 && !(o2->op_private & OPpPAD_STATE))
5877 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
5878 "Deprecated use of my() in false conditional");
5882 if (first->op_type == OP_CONST)
5883 first->op_private |= OPpCONST_SHORTCIRCUIT;
5885 first = newUNOP(OP_NULL, 0, first);
5886 op_getmad(other, first, '2');
5887 first->op_targ = type; /* set "was" field */
5894 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
5895 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
5897 const OP * const k1 = ((UNOP*)first)->op_first;
5898 const OP * const k2 = k1->op_sibling;
5900 switch (first->op_type)
5903 if (k2 && k2->op_type == OP_READLINE
5904 && (k2->op_flags & OPf_STACKED)
5905 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5907 warnop = k2->op_type;
5912 if (k1->op_type == OP_READDIR
5913 || k1->op_type == OP_GLOB
5914 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5915 || k1->op_type == OP_EACH
5916 || k1->op_type == OP_AEACH)
5918 warnop = ((k1->op_type == OP_NULL)
5919 ? (OPCODE)k1->op_targ : k1->op_type);
5924 const line_t oldline = CopLINE(PL_curcop);
5925 /* This ensures that warnings are reported at the first line
5926 of the construction, not the last. */
5927 CopLINE_set(PL_curcop, PL_parser->copline);
5928 Perl_warner(aTHX_ packWARN(WARN_MISC),
5929 "Value of %s%s can be \"0\"; test with defined()",
5931 ((warnop == OP_READLINE || warnop == OP_GLOB)
5932 ? " construct" : "() operator"));
5933 CopLINE_set(PL_curcop, oldline);
5940 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
5941 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
5943 NewOp(1101, logop, 1, LOGOP);
5945 logop->op_type = (OPCODE)type;
5946 logop->op_ppaddr = PL_ppaddr[type];
5947 logop->op_first = first;
5948 logop->op_flags = (U8)(flags | OPf_KIDS);
5949 logop->op_other = LINKLIST(other);
5950 logop->op_private = (U8)(1 | (flags >> 8));
5952 /* establish postfix order */
5953 logop->op_next = LINKLIST(first);
5954 first->op_next = (OP*)logop;
5955 first->op_sibling = other;
5957 CHECKOP(type,logop);
5959 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
5966 =for apidoc Am|OP *|newCONDOP|I32 flags|OP *first|OP *trueop|OP *falseop
5968 Constructs, checks, and returns a conditional-expression (C<cond_expr>)
5969 op. I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5970 will be set automatically, and, shifted up eight bits, the eight bits of
5971 C<op_private>, except that the bit with value 1 is automatically set.
5972 I<first> supplies the expression selecting between the two branches,
5973 and I<trueop> and I<falseop> supply the branches; they are consumed by
5974 this function and become part of the constructed op tree.
5980 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
5988 PERL_ARGS_ASSERT_NEWCONDOP;
5991 return newLOGOP(OP_AND, 0, first, trueop);
5993 return newLOGOP(OP_OR, 0, first, falseop);
5995 scalarboolean(first);
5996 if ((cstop = search_const(first))) {
5997 /* Left or right arm of the conditional? */
5998 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
5999 OP *live = left ? trueop : falseop;
6000 OP *const dead = left ? falseop : trueop;
6001 if (cstop->op_private & OPpCONST_BARE &&
6002 cstop->op_private & OPpCONST_STRICT) {
6003 no_bareword_allowed(cstop);
6006 /* This is all dead code when PERL_MAD is not defined. */
6007 live = newUNOP(OP_NULL, 0, live);
6008 op_getmad(first, live, 'C');
6009 op_getmad(dead, live, left ? 'e' : 't');
6014 if (live->op_type == OP_LEAVE)
6015 live = newUNOP(OP_NULL, OPf_SPECIAL, live);
6016 else if (live->op_type == OP_MATCH || live->op_type == OP_SUBST
6017 || live->op_type == OP_TRANS || live->op_type == OP_TRANSR)
6018 /* Mark the op as being unbindable with =~ */
6019 live->op_flags |= OPf_SPECIAL;
6020 else if (live->op_type == OP_CONST)
6021 live->op_private |= OPpCONST_FOLDED;
6024 NewOp(1101, logop, 1, LOGOP);
6025 logop->op_type = OP_COND_EXPR;
6026 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
6027 logop->op_first = first;
6028 logop->op_flags = (U8)(flags | OPf_KIDS);
6029 logop->op_private = (U8)(1 | (flags >> 8));
6030 logop->op_other = LINKLIST(trueop);
6031 logop->op_next = LINKLIST(falseop);
6033 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
6036 /* establish postfix order */
6037 start = LINKLIST(first);
6038 first->op_next = (OP*)logop;
6040 first->op_sibling = trueop;
6041 trueop->op_sibling = falseop;
6042 o = newUNOP(OP_NULL, 0, (OP*)logop);
6044 trueop->op_next = falseop->op_next = o;
6051 =for apidoc Am|OP *|newRANGE|I32 flags|OP *left|OP *right
6053 Constructs and returns a C<range> op, with subordinate C<flip> and
6054 C<flop> ops. I<flags> gives the eight bits of C<op_flags> for the
6055 C<flip> op and, shifted up eight bits, the eight bits of C<op_private>
6056 for both the C<flip> and C<range> ops, except that the bit with value
6057 1 is automatically set. I<left> and I<right> supply the expressions
6058 controlling the endpoints of the range; they are consumed by this function
6059 and become part of the constructed op tree.
6065 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
6074 PERL_ARGS_ASSERT_NEWRANGE;
6076 NewOp(1101, range, 1, LOGOP);
6078 range->op_type = OP_RANGE;
6079 range->op_ppaddr = PL_ppaddr[OP_RANGE];
6080 range->op_first = left;
6081 range->op_flags = OPf_KIDS;
6082 leftstart = LINKLIST(left);
6083 range->op_other = LINKLIST(right);
6084 range->op_private = (U8)(1 | (flags >> 8));
6086 left->op_sibling = right;
6088 range->op_next = (OP*)range;
6089 flip = newUNOP(OP_FLIP, flags, (OP*)range);
6090 flop = newUNOP(OP_FLOP, 0, flip);
6091 o = newUNOP(OP_NULL, 0, flop);
6093 range->op_next = leftstart;
6095 left->op_next = flip;
6096 right->op_next = flop;
6098 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
6099 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
6100 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
6101 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
6103 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
6104 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
6106 /* check barewords before they might be optimized aways */
6107 if (flip->op_private && cSVOPx(left)->op_private & OPpCONST_STRICT)
6108 no_bareword_allowed(left);
6109 if (flop->op_private && cSVOPx(right)->op_private & OPpCONST_STRICT)
6110 no_bareword_allowed(right);
6113 if (!flip->op_private || !flop->op_private)
6114 LINKLIST(o); /* blow off optimizer unless constant */
6120 =for apidoc Am|OP *|newLOOPOP|I32 flags|I32 debuggable|OP *expr|OP *block
6122 Constructs, checks, and returns an op tree expressing a loop. This is
6123 only a loop in the control flow through the op tree; it does not have
6124 the heavyweight loop structure that allows exiting the loop by C<last>
6125 and suchlike. I<flags> gives the eight bits of C<op_flags> for the
6126 top-level op, except that some bits will be set automatically as required.
6127 I<expr> supplies the expression controlling loop iteration, and I<block>
6128 supplies the body of the loop; they are consumed by this function and
6129 become part of the constructed op tree. I<debuggable> is currently
6130 unused and should always be 1.
6136 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
6141 const bool once = block && block->op_flags & OPf_SPECIAL &&
6142 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
6144 PERL_UNUSED_ARG(debuggable);
6147 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
6148 return block; /* do {} while 0 does once */
6149 if (expr->op_type == OP_READLINE
6150 || expr->op_type == OP_READDIR
6151 || expr->op_type == OP_GLOB
6152 || expr->op_type == OP_EACH || expr->op_type == OP_AEACH
6153 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
6154 expr = newUNOP(OP_DEFINED, 0,
6155 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
6156 } else if (expr->op_flags & OPf_KIDS) {
6157 const OP * const k1 = ((UNOP*)expr)->op_first;
6158 const OP * const k2 = k1 ? k1->op_sibling : NULL;
6159 switch (expr->op_type) {
6161 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
6162 && (k2->op_flags & OPf_STACKED)
6163 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
6164 expr = newUNOP(OP_DEFINED, 0, expr);
6168 if (k1 && (k1->op_type == OP_READDIR
6169 || k1->op_type == OP_GLOB
6170 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
6171 || k1->op_type == OP_EACH
6172 || k1->op_type == OP_AEACH))
6173 expr = newUNOP(OP_DEFINED, 0, expr);
6179 /* if block is null, the next op_append_elem() would put UNSTACK, a scalar
6180 * op, in listop. This is wrong. [perl #27024] */
6182 block = newOP(OP_NULL, 0);
6183 listop = op_append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
6184 o = new_logop(OP_AND, 0, &expr, &listop);
6187 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
6189 if (once && o != listop)
6190 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
6193 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
6195 o->op_flags |= flags;
6197 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
6202 =for apidoc Am|OP *|newWHILEOP|I32 flags|I32 debuggable|LOOP *loop|OP *expr|OP *block|OP *cont|I32 has_my
6204 Constructs, checks, and returns an op tree expressing a C<while> loop.
6205 This is a heavyweight loop, with structure that allows exiting the loop
6206 by C<last> and suchlike.
6208 I<loop> is an optional preconstructed C<enterloop> op to use in the
6209 loop; if it is null then a suitable op will be constructed automatically.
6210 I<expr> supplies the loop's controlling expression. I<block> supplies the
6211 main body of the loop, and I<cont> optionally supplies a C<continue> block
6212 that operates as a second half of the body. All of these optree inputs
6213 are consumed by this function and become part of the constructed op tree.
6215 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
6216 op and, shifted up eight bits, the eight bits of C<op_private> for
6217 the C<leaveloop> op, except that (in both cases) some bits will be set
6218 automatically. I<debuggable> is currently unused and should always be 1.
6219 I<has_my> can be supplied as true to force the
6220 loop body to be enclosed in its own scope.
6226 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop,
6227 OP *expr, OP *block, OP *cont, I32 has_my)
6236 PERL_UNUSED_ARG(debuggable);
6239 if (expr->op_type == OP_READLINE
6240 || expr->op_type == OP_READDIR
6241 || expr->op_type == OP_GLOB
6242 || expr->op_type == OP_EACH || expr->op_type == OP_AEACH
6243 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
6244 expr = newUNOP(OP_DEFINED, 0,
6245 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
6246 } else if (expr->op_flags & OPf_KIDS) {
6247 const OP * const k1 = ((UNOP*)expr)->op_first;
6248 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
6249 switch (expr->op_type) {
6251 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
6252 && (k2->op_flags & OPf_STACKED)
6253 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
6254 expr = newUNOP(OP_DEFINED, 0, expr);
6258 if (k1 && (k1->op_type == OP_READDIR
6259 || k1->op_type == OP_GLOB
6260 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
6261 || k1->op_type == OP_EACH
6262 || k1->op_type == OP_AEACH))
6263 expr = newUNOP(OP_DEFINED, 0, expr);
6270 block = newOP(OP_NULL, 0);
6271 else if (cont || has_my) {
6272 block = op_scope(block);
6276 next = LINKLIST(cont);
6279 OP * const unstack = newOP(OP_UNSTACK, 0);
6282 cont = op_append_elem(OP_LINESEQ, cont, unstack);
6286 listop = op_append_list(OP_LINESEQ, block, cont);
6288 redo = LINKLIST(listop);
6292 o = new_logop(OP_AND, 0, &expr, &listop);
6293 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
6295 return expr; /* listop already freed by new_logop */
6298 ((LISTOP*)listop)->op_last->op_next =
6299 (o == listop ? redo : LINKLIST(o));
6305 NewOp(1101,loop,1,LOOP);
6306 loop->op_type = OP_ENTERLOOP;
6307 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
6308 loop->op_private = 0;
6309 loop->op_next = (OP*)loop;
6312 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
6314 loop->op_redoop = redo;
6315 loop->op_lastop = o;
6316 o->op_private |= loopflags;
6319 loop->op_nextop = next;
6321 loop->op_nextop = o;
6323 o->op_flags |= flags;
6324 o->op_private |= (flags >> 8);
6329 =for apidoc Am|OP *|newFOROP|I32 flags|OP *sv|OP *expr|OP *block|OP *cont
6331 Constructs, checks, and returns an op tree expressing a C<foreach>
6332 loop (iteration through a list of values). This is a heavyweight loop,
6333 with structure that allows exiting the loop by C<last> and suchlike.
6335 I<sv> optionally supplies the variable that will be aliased to each
6336 item in turn; if null, it defaults to C<$_> (either lexical or global).
6337 I<expr> supplies the list of values to iterate over. I<block> supplies
6338 the main body of the loop, and I<cont> optionally supplies a C<continue>
6339 block that operates as a second half of the body. All of these optree
6340 inputs are consumed by this function and become part of the constructed
6343 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
6344 op and, shifted up eight bits, the eight bits of C<op_private> for
6345 the C<leaveloop> op, except that (in both cases) some bits will be set
6352 Perl_newFOROP(pTHX_ I32 flags, OP *sv, OP *expr, OP *block, OP *cont)
6357 PADOFFSET padoff = 0;
6362 PERL_ARGS_ASSERT_NEWFOROP;
6365 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
6366 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
6367 sv->op_type = OP_RV2GV;
6368 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
6370 /* The op_type check is needed to prevent a possible segfault
6371 * if the loop variable is undeclared and 'strict vars' is in
6372 * effect. This is illegal but is nonetheless parsed, so we
6373 * may reach this point with an OP_CONST where we're expecting
6376 if (cUNOPx(sv)->op_first->op_type == OP_GV
6377 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
6378 iterpflags |= OPpITER_DEF;
6380 else if (sv->op_type == OP_PADSV) { /* private variable */
6381 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
6382 padoff = sv->op_targ;
6392 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
6394 SV *const namesv = PAD_COMPNAME_SV(padoff);
6396 const char *const name = SvPV_const(namesv, len);
6398 if (len == 2 && name[0] == '$' && name[1] == '_')
6399 iterpflags |= OPpITER_DEF;
6403 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
6404 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
6405 sv = newGVOP(OP_GV, 0, PL_defgv);
6410 iterpflags |= OPpITER_DEF;
6412 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
6413 expr = op_lvalue(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
6414 iterflags |= OPf_STACKED;
6416 else if (expr->op_type == OP_NULL &&
6417 (expr->op_flags & OPf_KIDS) &&
6418 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
6420 /* Basically turn for($x..$y) into the same as for($x,$y), but we
6421 * set the STACKED flag to indicate that these values are to be
6422 * treated as min/max values by 'pp_iterinit'.
6424 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
6425 LOGOP* const range = (LOGOP*) flip->op_first;
6426 OP* const left = range->op_first;
6427 OP* const right = left->op_sibling;
6430 range->op_flags &= ~OPf_KIDS;
6431 range->op_first = NULL;
6433 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
6434 listop->op_first->op_next = range->op_next;
6435 left->op_next = range->op_other;
6436 right->op_next = (OP*)listop;
6437 listop->op_next = listop->op_first;
6440 op_getmad(expr,(OP*)listop,'O');
6444 expr = (OP*)(listop);
6446 iterflags |= OPf_STACKED;
6449 expr = op_lvalue(force_list(expr), OP_GREPSTART);
6452 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
6453 op_append_elem(OP_LIST, expr, scalar(sv))));
6454 assert(!loop->op_next);
6455 /* for my $x () sets OPpLVAL_INTRO;
6456 * for our $x () sets OPpOUR_INTRO */
6457 loop->op_private = (U8)iterpflags;
6458 if (loop->op_slabbed
6459 && DIFF(loop, OpSLOT(loop)->opslot_next)
6460 < SIZE_TO_PSIZE(sizeof(LOOP)))
6463 NewOp(1234,tmp,1,LOOP);
6464 Copy(loop,tmp,1,LISTOP);
6465 S_op_destroy(aTHX_ (OP*)loop);
6468 else if (!loop->op_slabbed)
6469 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
6470 loop->op_targ = padoff;
6471 wop = newWHILEOP(flags, 1, loop, newOP(OP_ITER, 0), block, cont, 0);
6473 op_getmad(madsv, (OP*)loop, 'v');
6478 =for apidoc Am|OP *|newLOOPEX|I32 type|OP *label
6480 Constructs, checks, and returns a loop-exiting op (such as C<goto>
6481 or C<last>). I<type> is the opcode. I<label> supplies the parameter
6482 determining the target of the op; it is consumed by this function and
6483 becomes part of the constructed op tree.
6489 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
6494 PERL_ARGS_ASSERT_NEWLOOPEX;
6496 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
6498 if (type != OP_GOTO) {
6499 /* "last()" means "last" */
6500 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS)) {
6501 o = newOP(type, OPf_SPECIAL);
6505 /* Check whether it's going to be a goto &function */
6506 if (label->op_type == OP_ENTERSUB
6507 && !(label->op_flags & OPf_STACKED))
6508 label = newUNOP(OP_REFGEN, 0, op_lvalue(label, OP_REFGEN));
6511 /* Check for a constant argument */
6512 if (label->op_type == OP_CONST) {
6513 SV * const sv = ((SVOP *)label)->op_sv;
6515 const char *s = SvPV_const(sv,l);
6516 if (l == strlen(s)) {
6518 SvUTF8(((SVOP*)label)->op_sv),
6520 SvPV_nolen_const(((SVOP*)label)->op_sv)));
6524 /* If we have already created an op, we do not need the label. */
6527 op_getmad(label,o,'L');
6531 else o = newUNOP(type, OPf_STACKED, label);
6533 PL_hints |= HINT_BLOCK_SCOPE;
6537 /* if the condition is a literal array or hash
6538 (or @{ ... } etc), make a reference to it.
6541 S_ref_array_or_hash(pTHX_ OP *cond)
6544 && (cond->op_type == OP_RV2AV
6545 || cond->op_type == OP_PADAV
6546 || cond->op_type == OP_RV2HV
6547 || cond->op_type == OP_PADHV))
6549 return newUNOP(OP_REFGEN, 0, op_lvalue(cond, OP_REFGEN));
6552 && (cond->op_type == OP_ASLICE
6553 || cond->op_type == OP_HSLICE)) {
6555 /* anonlist now needs a list from this op, was previously used in
6557 cond->op_flags |= ~(OPf_WANT_SCALAR | OPf_REF);
6558 cond->op_flags |= OPf_WANT_LIST;
6560 return newANONLIST(op_lvalue(cond, OP_ANONLIST));
6567 /* These construct the optree fragments representing given()
6570 entergiven and enterwhen are LOGOPs; the op_other pointer
6571 points up to the associated leave op. We need this so we
6572 can put it in the context and make break/continue work.
6573 (Also, of course, pp_enterwhen will jump straight to
6574 op_other if the match fails.)
6578 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
6579 I32 enter_opcode, I32 leave_opcode,
6580 PADOFFSET entertarg)
6586 PERL_ARGS_ASSERT_NEWGIVWHENOP;
6588 NewOp(1101, enterop, 1, LOGOP);
6589 enterop->op_type = (Optype)enter_opcode;
6590 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
6591 enterop->op_flags = (U8) OPf_KIDS;
6592 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
6593 enterop->op_private = 0;
6595 o = newUNOP(leave_opcode, 0, (OP *) enterop);
6598 enterop->op_first = scalar(cond);
6599 cond->op_sibling = block;
6601 o->op_next = LINKLIST(cond);
6602 cond->op_next = (OP *) enterop;
6605 /* This is a default {} block */
6606 enterop->op_first = block;
6607 enterop->op_flags |= OPf_SPECIAL;
6608 o ->op_flags |= OPf_SPECIAL;
6610 o->op_next = (OP *) enterop;
6613 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
6614 entergiven and enterwhen both
6617 enterop->op_next = LINKLIST(block);
6618 block->op_next = enterop->op_other = o;
6623 /* Does this look like a boolean operation? For these purposes
6624 a boolean operation is:
6625 - a subroutine call [*]
6626 - a logical connective
6627 - a comparison operator
6628 - a filetest operator, with the exception of -s -M -A -C
6629 - defined(), exists() or eof()
6630 - /$re/ or $foo =~ /$re/
6632 [*] possibly surprising
6635 S_looks_like_bool(pTHX_ const OP *o)
6639 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
6641 switch(o->op_type) {
6644 return looks_like_bool(cLOGOPo->op_first);
6648 looks_like_bool(cLOGOPo->op_first)
6649 && looks_like_bool(cLOGOPo->op_first->op_sibling));
6654 o->op_flags & OPf_KIDS
6655 && looks_like_bool(cUNOPo->op_first));
6659 case OP_NOT: case OP_XOR:
6661 case OP_EQ: case OP_NE: case OP_LT:
6662 case OP_GT: case OP_LE: case OP_GE:
6664 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
6665 case OP_I_GT: case OP_I_LE: case OP_I_GE:
6667 case OP_SEQ: case OP_SNE: case OP_SLT:
6668 case OP_SGT: case OP_SLE: case OP_SGE:
6672 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
6673 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
6674 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
6675 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
6676 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
6677 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
6678 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
6679 case OP_FTTEXT: case OP_FTBINARY:
6681 case OP_DEFINED: case OP_EXISTS:
6682 case OP_MATCH: case OP_EOF:
6689 /* Detect comparisons that have been optimized away */
6690 if (cSVOPo->op_sv == &PL_sv_yes
6691 || cSVOPo->op_sv == &PL_sv_no)
6704 =for apidoc Am|OP *|newGIVENOP|OP *cond|OP *block|PADOFFSET defsv_off
6706 Constructs, checks, and returns an op tree expressing a C<given> block.
6707 I<cond> supplies the expression that will be locally assigned to a lexical
6708 variable, and I<block> supplies the body of the C<given> construct; they
6709 are consumed by this function and become part of the constructed op tree.
6710 I<defsv_off> is the pad offset of the scalar lexical variable that will
6711 be affected. If it is 0, the global $_ will be used.
6717 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
6720 PERL_ARGS_ASSERT_NEWGIVENOP;
6721 return newGIVWHENOP(
6722 ref_array_or_hash(cond),
6724 OP_ENTERGIVEN, OP_LEAVEGIVEN,
6729 =for apidoc Am|OP *|newWHENOP|OP *cond|OP *block
6731 Constructs, checks, and returns an op tree expressing a C<when> block.
6732 I<cond> supplies the test expression, and I<block> supplies the block
6733 that will be executed if the test evaluates to true; they are consumed
6734 by this function and become part of the constructed op tree. I<cond>
6735 will be interpreted DWIMically, often as a comparison against C<$_>,
6736 and may be null to generate a C<default> block.
6742 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
6744 const bool cond_llb = (!cond || looks_like_bool(cond));
6747 PERL_ARGS_ASSERT_NEWWHENOP;
6752 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
6754 scalar(ref_array_or_hash(cond)));
6757 return newGIVWHENOP(cond_op, block, OP_ENTERWHEN, OP_LEAVEWHEN, 0);
6761 Perl_cv_ckproto_len_flags(pTHX_ const CV *cv, const GV *gv, const char *p,
6762 const STRLEN len, const U32 flags)
6764 const char * const cvp = SvROK(cv) ? "" : CvPROTO(cv);
6765 const STRLEN clen = CvPROTOLEN(cv);
6767 PERL_ARGS_ASSERT_CV_CKPROTO_LEN_FLAGS;
6769 if (((!p != !cvp) /* One has prototype, one has not. */
6771 (flags & SVf_UTF8) == SvUTF8(cv)
6772 ? len != clen || memNE(cvp, p, len)
6774 ? bytes_cmp_utf8((const U8 *)cvp, clen,
6776 : bytes_cmp_utf8((const U8 *)p, len,
6777 (const U8 *)cvp, clen)
6781 && ckWARN_d(WARN_PROTOTYPE)) {
6782 SV* const msg = sv_newmortal();
6788 gv_efullname3(name = sv_newmortal(), gv, NULL);
6789 else if (SvPOK(gv) && *SvPVX((SV *)gv) == '&')
6790 name = newSVpvn_flags(SvPVX((SV *)gv)+1, SvCUR(gv)-1,
6791 SvUTF8(gv)|SVs_TEMP);
6792 else name = (SV *)gv;
6794 sv_setpvs(msg, "Prototype mismatch:");
6796 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
6798 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")",
6799 SVfARG(newSVpvn_flags(cvp,clen, SvUTF8(cv)|SVs_TEMP))
6802 sv_catpvs(msg, ": none");
6803 sv_catpvs(msg, " vs ");
6805 Perl_sv_catpvf(aTHX_ msg, "(%"SVf")", SVfARG(newSVpvn_flags(p, len, flags | SVs_TEMP)));
6807 sv_catpvs(msg, "none");
6808 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
6812 static void const_sv_xsub(pTHX_ CV* cv);
6816 =head1 Optree Manipulation Functions
6818 =for apidoc cv_const_sv
6820 If C<cv> is a constant sub eligible for inlining. returns the constant
6821 value returned by the sub. Otherwise, returns NULL.
6823 Constant subs can be created with C<newCONSTSUB> or as described in
6824 L<perlsub/"Constant Functions">.
6829 Perl_cv_const_sv(pTHX_ const CV *const cv)
6831 PERL_UNUSED_CONTEXT;
6834 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
6836 return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
6839 /* op_const_sv: examine an optree to determine whether it's in-lineable.
6840 * Can be called in 3 ways:
6843 * look for a single OP_CONST with attached value: return the value
6845 * cv && CvCLONE(cv) && !CvCONST(cv)
6847 * examine the clone prototype, and if contains only a single
6848 * OP_CONST referencing a pad const, or a single PADSV referencing
6849 * an outer lexical, return a non-zero value to indicate the CV is
6850 * a candidate for "constizing" at clone time
6854 * We have just cloned an anon prototype that was marked as a const
6855 * candidate. Try to grab the current value, and in the case of
6856 * PADSV, ignore it if it has multiple references. In this case we
6857 * return a newly created *copy* of the value.
6861 Perl_op_const_sv(pTHX_ const OP *o, CV *cv)
6872 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
6873 o = cLISTOPo->op_first->op_sibling;
6875 for (; o; o = o->op_next) {
6876 const OPCODE type = o->op_type;
6878 if (sv && o->op_next == o)
6880 if (o->op_next != o) {
6881 if (type == OP_NEXTSTATE
6882 || (type == OP_NULL && !(o->op_flags & OPf_KIDS))
6883 || type == OP_PUSHMARK)
6885 if (type == OP_DBSTATE)
6888 if (type == OP_LEAVESUB || type == OP_RETURN)
6892 if (type == OP_CONST && cSVOPo->op_sv)
6894 else if (cv && type == OP_CONST) {
6895 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6899 else if (cv && type == OP_PADSV) {
6900 if (CvCONST(cv)) { /* newly cloned anon */
6901 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6902 /* the candidate should have 1 ref from this pad and 1 ref
6903 * from the parent */
6904 if (!sv || SvREFCNT(sv) != 2)
6911 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
6912 sv = &PL_sv_undef; /* an arbitrary non-null value */
6923 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
6929 STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */
6931 register CV *cv = NULL;
6932 register CV *compcv = PL_compcv;
6935 PADOFFSET pax = o->op_targ;
6936 CV *outcv = CvOUTSIDE(PL_compcv);
6939 bool reusable = FALSE;
6941 PERL_ARGS_ASSERT_NEWMYSUB;
6943 /* Find the pad slot for storing the new sub.
6944 We cannot use PL_comppad, as it is the pad owned by the new sub. We
6945 need to look in CvOUTSIDE and find the pad belonging to the enclos-
6946 ing sub. And then we need to dig deeper if this is a lexical from
6948 my sub foo; sub { sub foo { } }
6951 name = PadlistNAMESARRAY(CvPADLIST(outcv))[pax];
6952 if (PadnameOUTER(name) && PARENT_PAD_INDEX(name)) {
6953 pax = PARENT_PAD_INDEX(name);
6954 outcv = CvOUTSIDE(outcv);
6959 &PadARRAY(PadlistARRAY(CvPADLIST(outcv))
6960 [CvDEPTH(outcv) ? CvDEPTH(outcv) : 1])[pax];
6961 spot = (CV **)svspot;
6964 assert(proto->op_type == OP_CONST);
6965 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
6966 ps_utf8 = SvUTF8(((SVOP*)proto)->op_sv);
6971 if (!PL_madskills) {
6978 if (PL_parser && PL_parser->error_count) {
6983 if (CvDEPTH(outcv) && CvCLONE(compcv)) {
6985 svspot = (SV **)(spot = &clonee);
6987 else if (PadnameIsSTATE(name) || CvDEPTH(outcv))
6991 SvUPGRADE(name, SVt_PVMG);
6992 mg = mg_find(name, PERL_MAGIC_proto);
6993 assert (SvTYPE(*spot) == SVt_PVCV);
6995 hek = CvNAME_HEK(*spot);
6997 CvNAME_HEK_set(*spot, hek =
7000 PadnameLEN(name)-1 * (PadnameUTF8(name) ? -1 : 1), 0
7006 cv = (CV *)mg->mg_obj;
7009 sv_magic(name, &PL_sv_undef, PERL_MAGIC_proto, NULL, 0);
7010 mg = mg_find(name, PERL_MAGIC_proto);
7012 spot = (CV **)(svspot = &mg->mg_obj);
7015 if (!block || !ps || *ps || attrs
7016 || (CvFLAGS(compcv) & CVf_BUILTIN_ATTRS)
7018 || block->op_type == OP_NULL
7023 const_sv = op_const_sv(block, NULL);
7026 const bool exists = CvROOT(cv) || CvXSUB(cv);
7028 /* if the subroutine doesn't exist and wasn't pre-declared
7029 * with a prototype, assume it will be AUTOLOADed,
7030 * skipping the prototype check
7032 if (exists || SvPOK(cv))
7033 cv_ckproto_len_flags(cv, (GV *)name, ps, ps_len, ps_utf8);
7034 /* already defined? */
7038 || block->op_type == OP_NULL
7041 if (CvFLAGS(compcv)) {
7042 /* might have had built-in attrs applied */
7043 const bool pureperl = !CvISXSUB(cv) && CvROOT(cv);
7044 if (CvLVALUE(compcv) && ! CvLVALUE(cv) && pureperl
7045 && ckWARN(WARN_MISC))
7046 Perl_warner(aTHX_ packWARN(WARN_MISC), "lvalue attribute ignored after the subroutine has been defined");
7048 (CvFLAGS(compcv) & CVf_BUILTIN_ATTRS
7049 & ~(CVf_LVALUE * pureperl));
7051 if (attrs) goto attrs;
7052 /* just a "sub foo;" when &foo is already defined */
7057 /* redundant check that avoids creating the extra SV
7058 most of the time: */
7059 if (const_sv || ckWARN(WARN_REDEFINE)) {
7060 const line_t oldline = CopLINE(PL_curcop);
7061 SV *noamp = sv_2mortal(newSVpvn_utf8(
7062 PadnamePV(name)+1,PadnameLEN(name)-1,
7065 if (PL_parser && PL_parser->copline != NOLINE)
7066 CopLINE_set(PL_curcop, PL_parser->copline);
7067 report_redefined_cv(noamp, cv, &const_sv);
7068 CopLINE_set(PL_curcop, oldline);
7071 if (!PL_minus_c) /* keep old one around for madskills */
7074 /* (PL_madskills unset in used file.) */
7080 else if (CvDEPTH(outcv) && CvCLONE(compcv)) {
7086 SvREFCNT_inc_simple_void_NN(const_sv);
7088 assert(!CvROOT(cv) && !CvCONST(cv));
7092 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7093 CvFILE_set_from_cop(cv, PL_curcop);
7094 CvSTASH_set(cv, PL_curstash);
7097 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
7098 CvXSUBANY(cv).any_ptr = const_sv;
7099 CvXSUB(cv) = const_sv_xsub;
7105 SvREFCNT_dec(compcv);
7109 /* Checking whether outcv is CvOUTSIDE(compcv) is not sufficient to
7110 determine whether this sub definition is in the same scope as its
7111 declaration. If this sub definition is inside an inner named pack-
7112 age sub (my sub foo; sub bar { sub foo { ... } }), outcv points to
7113 the package sub. So check PadnameOUTER(name) too.
7115 if (outcv == CvOUTSIDE(compcv) && !PadnameOUTER(name)) {
7116 assert(!CvWEAKOUTSIDE(compcv));
7117 SvREFCNT_dec(CvOUTSIDE(compcv));
7118 CvWEAKOUTSIDE_on(compcv);
7120 /* XXX else do we have a circular reference? */
7121 if (cv) { /* must reuse cv in case stub is referenced elsewhere */
7122 /* transfer PL_compcv to cv */
7125 && block->op_type != OP_NULL
7128 cv_flags_t preserved_flags =
7129 CvFLAGS(cv) & (CVf_BUILTIN_ATTRS|CVf_NAMED);
7130 PADLIST *const temp_padl = CvPADLIST(cv);
7131 CV *const temp_cv = CvOUTSIDE(cv);
7132 const cv_flags_t other_flags =
7133 CvFLAGS(cv) & (CVf_SLABBED|CVf_WEAKOUTSIDE);
7134 OP * const cvstart = CvSTART(cv);
7138 CvFLAGS(compcv) | preserved_flags;
7139 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
7140 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(compcv);
7141 CvPADLIST(cv) = CvPADLIST(compcv);
7142 CvOUTSIDE(compcv) = temp_cv;
7143 CvPADLIST(compcv) = temp_padl;
7144 CvSTART(cv) = CvSTART(compcv);
7145 CvSTART(compcv) = cvstart;
7146 CvFLAGS(compcv) &= ~(CVf_SLABBED|CVf_WEAKOUTSIDE);
7147 CvFLAGS(compcv) |= other_flags;
7149 if (CvFILE(cv) && CvDYNFILE(cv)) {
7150 Safefree(CvFILE(cv));
7153 /* inner references to compcv must be fixed up ... */
7154 pad_fixup_inner_anons(CvPADLIST(cv), compcv, cv);
7155 if (PERLDB_INTER)/* Advice debugger on the new sub. */
7156 ++PL_sub_generation;
7159 /* Might have had built-in attributes applied -- propagate them. */
7160 CvFLAGS(cv) |= (CvFLAGS(compcv) & CVf_BUILTIN_ATTRS);
7162 /* ... before we throw it away */
7163 SvREFCNT_dec(compcv);
7164 PL_compcv = compcv = cv;
7170 if (!CvNAME_HEK(cv)) {
7173 ? share_hek_hek(hek)
7174 : share_hek(PadnamePV(name)+1,
7175 PadnameLEN(name)-1 * (PadnameUTF8(name) ? -1 : 1),
7179 CvFILE_set_from_cop(cv, PL_curcop);
7180 CvSTASH_set(cv, PL_curstash);
7183 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
7184 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(cv));
7191 /* If we assign an optree to a PVCV, then we've defined a subroutine that
7192 the debugger could be able to set a breakpoint in, so signal to
7193 pp_entereval that it should not throw away any saved lines at scope
7196 PL_breakable_sub_gen++;
7197 /* This makes sub {}; work as expected. */
7198 if (block->op_type == OP_STUB) {
7199 OP* const newblock = newSTATEOP(0, NULL, 0);
7201 op_getmad(block,newblock,'B');
7207 CvROOT(cv) = CvLVALUE(cv)
7208 ? newUNOP(OP_LEAVESUBLV, 0,
7209 op_lvalue(scalarseq(block), OP_LEAVESUBLV))
7210 : newUNOP(OP_LEAVESUB, 0, scalarseq(block));
7211 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7212 OpREFCNT_set(CvROOT(cv), 1);
7213 /* The cv no longer needs to hold a refcount on the slab, as CvROOT
7214 itself has a refcount. */
7216 OpslabREFCNT_dec_padok((OPSLAB *)CvSTART(cv));
7217 CvSTART(cv) = LINKLIST(CvROOT(cv));
7218 CvROOT(cv)->op_next = 0;
7219 CALL_PEEP(CvSTART(cv));
7220 finalize_optree(CvROOT(cv));
7222 /* now that optimizer has done its work, adjust pad values */
7224 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
7227 assert(!CvCONST(cv));
7228 if (ps && !*ps && op_const_sv(block, cv))
7234 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
7235 apply_attrs(PL_curstash, MUTABLE_SV(cv), attrs, FALSE);
7239 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
7240 SV * const tmpstr = sv_newmortal();
7241 GV * const db_postponed = gv_fetchpvs("DB::postponed",
7242 GV_ADDMULTI, SVt_PVHV);
7244 SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld",
7247 (long)CopLINE(PL_curcop));
7248 if (HvNAME_HEK(PL_curstash)) {
7249 sv_sethek(tmpstr, HvNAME_HEK(PL_curstash));
7250 sv_catpvs(tmpstr, "::");
7252 else sv_setpvs(tmpstr, "__ANON__::");
7253 sv_catpvn_flags(tmpstr, PadnamePV(name)+1, PadnameLEN(name)-1,
7254 PadnameUTF8(name) ? SV_CATUTF8 : SV_CATBYTES);
7255 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
7256 SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr), sv, 0);
7257 hv = GvHVn(db_postponed);
7258 if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr))) {
7259 CV * const pcv = GvCV(db_postponed);
7265 call_sv(MUTABLE_SV(pcv), G_DISCARD);
7273 assert(CvDEPTH(outcv));
7275 &PadARRAY(PadlistARRAY(CvPADLIST(outcv))[CvDEPTH(outcv)])[pax];
7276 if (reusable) cv_clone_into(clonee, *spot);
7277 else *spot = cv_clone(clonee);
7278 SvREFCNT_dec(clonee);
7282 if (CvDEPTH(outcv) && !reusable && PadnameIsSTATE(name)) {
7283 PADOFFSET depth = CvDEPTH(outcv);
7286 svspot = &PadARRAY(PadlistARRAY(CvPADLIST(outcv))[depth])[pax];
7288 *svspot = SvREFCNT_inc_simple_NN(cv);
7289 SvREFCNT_dec(oldcv);
7295 PL_parser->copline = NOLINE;
7302 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
7304 return newATTRSUB_flags(floor, o, proto, attrs, block, 0);
7308 Perl_newATTRSUB_flags(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs,
7309 OP *block, U32 flags)
7314 STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */
7318 const bool ec = PL_parser && PL_parser->error_count;
7319 /* If the subroutine has no body, no attributes, and no builtin attributes
7320 then it's just a sub declaration, and we may be able to get away with
7321 storing with a placeholder scalar in the symbol table, rather than a
7322 full GV and CV. If anything is present then it will take a full CV to
7324 const I32 gv_fetch_flags
7325 = ec ? GV_NOADD_NOINIT :
7326 (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
7328 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
7330 const bool o_is_gv = flags & 1;
7331 const char * const name =
7332 o ? SvPV_const(o_is_gv ? (SV *)o : cSVOPo->op_sv, namlen) : NULL;
7334 bool name_is_utf8 = o && !o_is_gv && SvUTF8(cSVOPo->op_sv);
7335 #ifdef PERL_DEBUG_READONLY_OPS
7336 OPSLAB *slab = NULL;
7340 assert(proto->op_type == OP_CONST);
7341 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
7342 ps_utf8 = SvUTF8(((SVOP*)proto)->op_sv);
7352 gv = gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV);
7354 } else if (PERLDB_NAMEANON && CopLINE(PL_curcop)) {
7355 SV * const sv = sv_newmortal();
7356 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
7357 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
7358 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7359 gv = gv_fetchsv(sv, gv_fetch_flags, SVt_PVCV);
7361 } else if (PL_curstash) {
7362 gv = gv_fetchpvs("__ANON__", gv_fetch_flags, SVt_PVCV);
7365 gv = gv_fetchpvs("__ANON__::__ANON__", gv_fetch_flags, SVt_PVCV);
7369 if (!PL_madskills) {
7380 if (name && block) {
7381 const char *s = strrchr(name, ':');
7383 if (strEQ(s, "BEGIN")) {
7384 const char not_safe[] =
7385 "BEGIN not safe after errors--compilation aborted";
7386 if (PL_in_eval & EVAL_KEEPERR)
7387 Perl_croak(aTHX_ not_safe);
7389 /* force display of errors found but not reported */
7390 sv_catpv(ERRSV, not_safe);
7391 Perl_croak(aTHX_ "%"SVf, SVfARG(ERRSV));
7399 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
7400 maximum a prototype before. */
7401 if (SvTYPE(gv) > SVt_NULL) {
7402 cv_ckproto_len_flags((const CV *)gv,
7403 o ? (const GV *)cSVOPo->op_sv : NULL, ps,
7407 sv_setpvn(MUTABLE_SV(gv), ps, ps_len);
7408 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(gv));
7411 sv_setiv(MUTABLE_SV(gv), -1);
7413 SvREFCNT_dec(PL_compcv);
7414 cv = PL_compcv = NULL;
7418 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
7420 if (!block || !ps || *ps || attrs
7421 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
7423 || block->op_type == OP_NULL
7428 const_sv = op_const_sv(block, NULL);
7431 const bool exists = CvROOT(cv) || CvXSUB(cv);
7433 /* if the subroutine doesn't exist and wasn't pre-declared
7434 * with a prototype, assume it will be AUTOLOADed,
7435 * skipping the prototype check
7437 if (exists || SvPOK(cv))
7438 cv_ckproto_len_flags(cv, gv, ps, ps_len, ps_utf8);
7439 /* already defined (or promised)? */
7440 if (exists || GvASSUMECV(gv)) {
7443 || block->op_type == OP_NULL
7446 if (CvFLAGS(PL_compcv)) {
7447 /* might have had built-in attrs applied */
7448 const bool pureperl = !CvISXSUB(cv) && CvROOT(cv);
7449 if (CvLVALUE(PL_compcv) && ! CvLVALUE(cv) && pureperl
7450 && ckWARN(WARN_MISC))
7451 Perl_warner(aTHX_ packWARN(WARN_MISC), "lvalue attribute ignored after the subroutine has been defined");
7453 (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS
7454 & ~(CVf_LVALUE * pureperl));
7456 if (attrs) goto attrs;
7457 /* just a "sub foo;" when &foo is already defined */
7458 SAVEFREESV(PL_compcv);
7463 && block->op_type != OP_NULL
7466 const line_t oldline = CopLINE(PL_curcop);
7467 if (PL_parser && PL_parser->copline != NOLINE) {
7468 /* This ensures that warnings are reported at the first
7469 line of a redefinition, not the last. */
7470 CopLINE_set(PL_curcop, PL_parser->copline);
7472 report_redefined_cv(cSVOPo->op_sv, cv, &const_sv);
7473 CopLINE_set(PL_curcop, oldline);
7475 if (!PL_minus_c) /* keep old one around for madskills */
7478 /* (PL_madskills unset in used file.) */
7486 SvREFCNT_inc_simple_void_NN(const_sv);
7488 assert(!CvROOT(cv) && !CvCONST(cv));
7490 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
7491 CvXSUBANY(cv).any_ptr = const_sv;
7492 CvXSUB(cv) = const_sv_xsub;
7498 cv = newCONSTSUB_flags(
7499 NULL, name, namlen, name_is_utf8 ? SVf_UTF8 : 0,
7506 SvREFCNT_dec(PL_compcv);
7510 if (cv) { /* must reuse cv if autoloaded */
7511 /* transfer PL_compcv to cv */
7514 && block->op_type != OP_NULL
7517 cv_flags_t existing_builtin_attrs = CvFLAGS(cv) & CVf_BUILTIN_ATTRS;
7518 PADLIST *const temp_av = CvPADLIST(cv);
7519 CV *const temp_cv = CvOUTSIDE(cv);
7520 const cv_flags_t other_flags =
7521 CvFLAGS(cv) & (CVf_SLABBED|CVf_WEAKOUTSIDE);
7522 OP * const cvstart = CvSTART(cv);
7525 assert(!CvCVGV_RC(cv));
7526 assert(CvGV(cv) == gv);
7529 CvFLAGS(cv) = CvFLAGS(PL_compcv) | existing_builtin_attrs;
7530 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
7531 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
7532 CvPADLIST(cv) = CvPADLIST(PL_compcv);
7533 CvOUTSIDE(PL_compcv) = temp_cv;
7534 CvPADLIST(PL_compcv) = temp_av;
7535 CvSTART(cv) = CvSTART(PL_compcv);
7536 CvSTART(PL_compcv) = cvstart;
7537 CvFLAGS(PL_compcv) &= ~(CVf_SLABBED|CVf_WEAKOUTSIDE);
7538 CvFLAGS(PL_compcv) |= other_flags;
7540 if (CvFILE(cv) && CvDYNFILE(cv)) {
7541 Safefree(CvFILE(cv));
7543 CvFILE_set_from_cop(cv, PL_curcop);
7544 CvSTASH_set(cv, PL_curstash);
7546 /* inner references to PL_compcv must be fixed up ... */
7547 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
7548 if (PERLDB_INTER)/* Advice debugger on the new sub. */
7549 ++PL_sub_generation;
7552 /* Might have had built-in attributes applied -- propagate them. */
7553 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
7555 /* ... before we throw it away */
7556 SvREFCNT_dec(PL_compcv);
7564 if (strEQ(name, "import")) {
7565 PL_formfeed = MUTABLE_SV(cv);
7566 /* diag_listed_as: SKIPME */
7567 Perl_warner(aTHX_ packWARN(WARN_VOID), "0x%"UVxf"\n", PTR2UV(cv));
7571 if (HvENAME_HEK(GvSTASH(gv)))
7572 /* sub Foo::bar { (shift)+1 } */
7573 mro_method_changed_in(GvSTASH(gv));
7578 CvFILE_set_from_cop(cv, PL_curcop);
7579 CvSTASH_set(cv, PL_curstash);
7583 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
7584 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(cv));
7591 /* If we assign an optree to a PVCV, then we've defined a subroutine that
7592 the debugger could be able to set a breakpoint in, so signal to
7593 pp_entereval that it should not throw away any saved lines at scope
7596 PL_breakable_sub_gen++;
7597 /* This makes sub {}; work as expected. */
7598 if (block->op_type == OP_STUB) {
7599 OP* const newblock = newSTATEOP(0, NULL, 0);
7601 op_getmad(block,newblock,'B');
7607 CvROOT(cv) = CvLVALUE(cv)
7608 ? newUNOP(OP_LEAVESUBLV, 0,
7609 op_lvalue(scalarseq(block), OP_LEAVESUBLV))
7610 : newUNOP(OP_LEAVESUB, 0, scalarseq(block));
7611 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7612 OpREFCNT_set(CvROOT(cv), 1);
7613 /* The cv no longer needs to hold a refcount on the slab, as CvROOT
7614 itself has a refcount. */
7616 OpslabREFCNT_dec_padok((OPSLAB *)CvSTART(cv));
7617 #ifdef PERL_DEBUG_READONLY_OPS
7618 slab = (OPSLAB *)CvSTART(cv);
7620 CvSTART(cv) = LINKLIST(CvROOT(cv));
7621 CvROOT(cv)->op_next = 0;
7622 CALL_PEEP(CvSTART(cv));
7623 finalize_optree(CvROOT(cv));
7625 /* now that optimizer has done its work, adjust pad values */
7627 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
7630 assert(!CvCONST(cv));
7631 if (ps && !*ps && op_const_sv(block, cv))
7637 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
7638 HV *stash = name && GvSTASH(CvGV(cv)) ? GvSTASH(CvGV(cv)) : PL_curstash;
7639 apply_attrs(stash, MUTABLE_SV(cv), attrs, FALSE);
7642 if (block && has_name) {
7643 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
7644 SV * const tmpstr = sv_newmortal();
7645 GV * const db_postponed = gv_fetchpvs("DB::postponed",
7646 GV_ADDMULTI, SVt_PVHV);
7648 SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld",
7651 (long)CopLINE(PL_curcop));
7652 gv_efullname3(tmpstr, gv, NULL);
7653 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
7654 SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr), sv, 0);
7655 hv = GvHVn(db_postponed);
7656 if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr))) {
7657 CV * const pcv = GvCV(db_postponed);
7663 call_sv(MUTABLE_SV(pcv), G_DISCARD);
7668 if (name && ! (PL_parser && PL_parser->error_count))
7669 process_special_blocks(name, gv, cv);
7674 PL_parser->copline = NOLINE;
7676 #ifdef PERL_DEBUG_READONLY_OPS
7677 /* Watch out for BEGIN blocks */
7678 if (slab && gv && isGV(gv) && GvCV(gv)) Slab_to_ro(slab);
7684 S_process_special_blocks(pTHX_ const char *const fullname, GV *const gv,
7687 const char *const colon = strrchr(fullname,':');
7688 const char *const name = colon ? colon + 1 : fullname;
7690 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
7693 if (strEQ(name, "BEGIN")) {
7694 const I32 oldscope = PL_scopestack_ix;
7696 SAVECOPFILE(&PL_compiling);
7697 SAVECOPLINE(&PL_compiling);
7698 SAVEVPTR(PL_curcop);
7700 DEBUG_x( dump_sub(gv) );
7701 Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv));
7702 GvCV_set(gv,0); /* cv has been hijacked */
7703 call_list(oldscope, PL_beginav);
7705 CopHINTS_set(&PL_compiling, PL_hints);
7712 if strEQ(name, "END") {
7713 DEBUG_x( dump_sub(gv) );
7714 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv));
7717 } else if (*name == 'U') {
7718 if (strEQ(name, "UNITCHECK")) {
7719 /* It's never too late to run a unitcheck block */
7720 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv));
7724 } else if (*name == 'C') {
7725 if (strEQ(name, "CHECK")) {
7727 /* diag_listed_as: Too late to run %s block */
7728 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
7729 "Too late to run CHECK block");
7730 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv));
7734 } else if (*name == 'I') {
7735 if (strEQ(name, "INIT")) {
7737 /* diag_listed_as: Too late to run %s block */
7738 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
7739 "Too late to run INIT block");
7740 Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv));
7746 DEBUG_x( dump_sub(gv) );
7747 GvCV_set(gv,0); /* cv has been hijacked */
7752 =for apidoc newCONSTSUB
7754 See L</newCONSTSUB_flags>.
7760 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
7762 return newCONSTSUB_flags(stash, name, name ? strlen(name) : 0, 0, sv);
7766 =for apidoc newCONSTSUB_flags
7768 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
7769 eligible for inlining at compile-time.
7771 Currently, the only useful value for C<flags> is SVf_UTF8.
7773 The newly created subroutine takes ownership of a reference to the passed in
7776 Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>,
7777 which won't be called if used as a destructor, but will suppress the overhead
7778 of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at
7785 Perl_newCONSTSUB_flags(pTHX_ HV *stash, const char *name, STRLEN len,
7791 const char *const file = CopFILE(PL_curcop);
7793 SV *const temp_sv = CopFILESV(PL_curcop);
7794 const char *const file = temp_sv ? SvPV_nolen_const(temp_sv) : NULL;
7799 if (IN_PERL_RUNTIME) {
7800 /* at runtime, it's not safe to manipulate PL_curcop: it may be
7801 * an op shared between threads. Use a non-shared COP for our
7803 SAVEVPTR(PL_curcop);
7804 SAVECOMPILEWARNINGS();
7805 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
7806 PL_curcop = &PL_compiling;
7808 SAVECOPLINE(PL_curcop);
7809 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
7812 PL_hints &= ~HINT_BLOCK_SCOPE;
7815 SAVEGENERICSV(PL_curstash);
7816 PL_curstash = (HV *)SvREFCNT_inc_simple_NN(stash);
7819 /* file becomes the CvFILE. For an XS, it's usually static storage,
7820 and so doesn't get free()d. (It's expected to be from the C pre-
7821 processor __FILE__ directive). But we need a dynamically allocated one,
7822 and we need it to get freed. */
7823 cv = newXS_len_flags(name, len, const_sv_xsub, file ? file : "", "",
7824 &sv, XS_DYNAMIC_FILENAME | flags);
7825 CvXSUBANY(cv).any_ptr = sv;
7834 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
7835 const char *const filename, const char *const proto,
7838 PERL_ARGS_ASSERT_NEWXS_FLAGS;
7839 return newXS_len_flags(
7840 name, name ? strlen(name) : 0, subaddr, filename, proto, NULL, flags
7845 Perl_newXS_len_flags(pTHX_ const char *name, STRLEN len,
7846 XSUBADDR_t subaddr, const char *const filename,
7847 const char *const proto, SV **const_svp,
7852 PERL_ARGS_ASSERT_NEWXS_LEN_FLAGS;
7855 GV * const gv = name
7857 name,len,GV_ADDMULTI|flags,SVt_PVCV
7860 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
7861 GV_ADDMULTI | flags, SVt_PVCV);
7864 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
7866 if ((cv = (name ? GvCV(gv) : NULL))) {
7868 /* just a cached method */
7872 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
7873 /* already defined (or promised) */
7874 /* Redundant check that allows us to avoid creating an SV
7875 most of the time: */
7876 if (CvCONST(cv) || ckWARN(WARN_REDEFINE)) {
7877 report_redefined_cv(newSVpvn_flags(
7878 name,len,(flags&SVf_UTF8)|SVs_TEMP
7887 if (cv) /* must reuse cv if autoloaded */
7890 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7894 if (HvENAME_HEK(GvSTASH(gv)))
7895 mro_method_changed_in(GvSTASH(gv)); /* newXS */
7901 (void)gv_fetchfile(filename);
7902 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
7903 an external constant string */
7904 assert(!CvDYNFILE(cv)); /* cv_undef should have turned it off */
7906 CvXSUB(cv) = subaddr;
7909 process_special_blocks(name, gv, cv);
7912 if (flags & XS_DYNAMIC_FILENAME) {
7913 CvFILE(cv) = savepv(filename);
7916 sv_setpv(MUTABLE_SV(cv), proto);
7921 Perl_newSTUB(pTHX_ GV *gv, bool fake)
7923 CV *cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7924 PERL_ARGS_ASSERT_NEWSTUB;
7928 if (!fake && HvENAME_HEK(GvSTASH(gv)))
7929 mro_method_changed_in(GvSTASH(gv));
7931 CvFILE_set_from_cop(cv, PL_curcop);
7932 CvSTASH_set(cv, PL_curstash);
7938 =for apidoc U||newXS
7940 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
7941 static storage, as it is used directly as CvFILE(), without a copy being made.
7947 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
7949 PERL_ARGS_ASSERT_NEWXS;
7950 return newXS_len_flags(
7951 name, name ? strlen(name) : 0, subaddr, filename, NULL, NULL, 0
7960 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
7965 OP* pegop = newOP(OP_NULL, 0);
7970 if (PL_parser && PL_parser->error_count) {
7976 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
7977 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
7980 if ((cv = GvFORM(gv))) {
7981 if (ckWARN(WARN_REDEFINE)) {
7982 const line_t oldline = CopLINE(PL_curcop);
7983 if (PL_parser && PL_parser->copline != NOLINE)
7984 CopLINE_set(PL_curcop, PL_parser->copline);
7986 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
7987 "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv));
7989 /* diag_listed_as: Format %s redefined */
7990 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
7991 "Format STDOUT redefined");
7993 CopLINE_set(PL_curcop, oldline);
7998 GvFORM(gv) = (CV *)SvREFCNT_inc_simple_NN(cv);
8000 CvFILE_set_from_cop(cv, PL_curcop);
8003 pad_tidy(padtidy_FORMAT);
8004 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
8005 CvROOT(cv)->op_private |= OPpREFCOUNTED;
8006 OpREFCNT_set(CvROOT(cv), 1);
8007 CvSTART(cv) = LINKLIST(CvROOT(cv));
8008 CvROOT(cv)->op_next = 0;
8009 CALL_PEEP(CvSTART(cv));
8010 finalize_optree(CvROOT(cv));
8015 op_getmad(o,pegop,'n');
8016 op_getmad_weak(block, pegop, 'b');
8021 PL_parser->copline = NOLINE;
8029 Perl_newANONLIST(pTHX_ OP *o)
8031 return convert(OP_ANONLIST, OPf_SPECIAL, o);
8035 Perl_newANONHASH(pTHX_ OP *o)
8037 return convert(OP_ANONHASH, OPf_SPECIAL, o);
8041 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
8043 return newANONATTRSUB(floor, proto, NULL, block);
8047 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
8049 return newUNOP(OP_REFGEN, 0,
8050 newSVOP(OP_ANONCODE, 0,
8051 MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block))));
8055 Perl_oopsAV(pTHX_ OP *o)
8059 PERL_ARGS_ASSERT_OOPSAV;
8061 switch (o->op_type) {
8063 o->op_type = OP_PADAV;
8064 o->op_ppaddr = PL_ppaddr[OP_PADAV];
8065 return ref(o, OP_RV2AV);
8068 o->op_type = OP_RV2AV;
8069 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
8074 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
8081 Perl_oopsHV(pTHX_ OP *o)
8085 PERL_ARGS_ASSERT_OOPSHV;
8087 switch (o->op_type) {
8090 o->op_type = OP_PADHV;
8091 o->op_ppaddr = PL_ppaddr[OP_PADHV];
8092 return ref(o, OP_RV2HV);
8096 o->op_type = OP_RV2HV;
8097 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
8102 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
8109 Perl_newAVREF(pTHX_ OP *o)
8113 PERL_ARGS_ASSERT_NEWAVREF;
8115 if (o->op_type == OP_PADANY) {
8116 o->op_type = OP_PADAV;
8117 o->op_ppaddr = PL_ppaddr[OP_PADAV];
8120 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)) {
8121 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8122 "Using an array as a reference is deprecated");
8124 return newUNOP(OP_RV2AV, 0, scalar(o));
8128 Perl_newGVREF(pTHX_ I32 type, OP *o)
8130 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
8131 return newUNOP(OP_NULL, 0, o);
8132 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
8136 Perl_newHVREF(pTHX_ OP *o)
8140 PERL_ARGS_ASSERT_NEWHVREF;
8142 if (o->op_type == OP_PADANY) {
8143 o->op_type = OP_PADHV;
8144 o->op_ppaddr = PL_ppaddr[OP_PADHV];
8147 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)) {
8148 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8149 "Using a hash as a reference is deprecated");
8151 return newUNOP(OP_RV2HV, 0, scalar(o));
8155 Perl_newCVREF(pTHX_ I32 flags, OP *o)
8157 if (o->op_type == OP_PADANY) {
8158 o->op_type = OP_PADCV;
8159 o->op_ppaddr = PL_ppaddr[OP_PADCV];
8162 return newUNOP(OP_RV2CV, flags, scalar(o));
8166 Perl_newSVREF(pTHX_ OP *o)
8170 PERL_ARGS_ASSERT_NEWSVREF;
8172 if (o->op_type == OP_PADANY) {
8173 o->op_type = OP_PADSV;
8174 o->op_ppaddr = PL_ppaddr[OP_PADSV];
8177 return newUNOP(OP_RV2SV, 0, scalar(o));
8180 /* Check routines. See the comments at the top of this file for details
8181 * on when these are called */
8184 Perl_ck_anoncode(pTHX_ OP *o)
8186 PERL_ARGS_ASSERT_CK_ANONCODE;
8188 cSVOPo->op_targ = pad_add_anon((CV*)cSVOPo->op_sv, o->op_type);
8190 cSVOPo->op_sv = NULL;
8195 Perl_ck_bitop(pTHX_ OP *o)
8199 PERL_ARGS_ASSERT_CK_BITOP;
8201 o->op_private = (U8)(PL_hints & HINT_INTEGER);
8202 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
8203 && (o->op_type == OP_BIT_OR
8204 || o->op_type == OP_BIT_AND
8205 || o->op_type == OP_BIT_XOR))
8207 const OP * const left = cBINOPo->op_first;
8208 const OP * const right = left->op_sibling;
8209 if ((OP_IS_NUMCOMPARE(left->op_type) &&
8210 (left->op_flags & OPf_PARENS) == 0) ||
8211 (OP_IS_NUMCOMPARE(right->op_type) &&
8212 (right->op_flags & OPf_PARENS) == 0))
8213 Perl_ck_warner(aTHX_ packWARN(WARN_PRECEDENCE),
8214 "Possible precedence problem on bitwise %c operator",
8215 o->op_type == OP_BIT_OR ? '|'
8216 : o->op_type == OP_BIT_AND ? '&' : '^'
8222 PERL_STATIC_INLINE bool
8223 is_dollar_bracket(pTHX_ const OP * const o)
8226 return o->op_type == OP_RV2SV && o->op_flags & OPf_KIDS
8227 && (kid = cUNOPx(o)->op_first)
8228 && kid->op_type == OP_GV
8229 && strEQ(GvNAME(cGVOPx_gv(kid)), "[");
8233 Perl_ck_cmp(pTHX_ OP *o)
8235 PERL_ARGS_ASSERT_CK_CMP;
8236 if (ckWARN(WARN_SYNTAX)) {
8237 const OP *kid = cUNOPo->op_first;
8240 is_dollar_bracket(aTHX_ kid)
8241 && kid->op_sibling && kid->op_sibling->op_type == OP_CONST
8243 || ( kid->op_type == OP_CONST
8244 && (kid = kid->op_sibling) && is_dollar_bracket(aTHX_ kid))
8246 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
8247 "$[ used in %s (did you mean $] ?)", OP_DESC(o));
8253 Perl_ck_concat(pTHX_ OP *o)
8255 const OP * const kid = cUNOPo->op_first;
8257 PERL_ARGS_ASSERT_CK_CONCAT;
8258 PERL_UNUSED_CONTEXT;
8260 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
8261 !(kUNOP->op_first->op_flags & OPf_MOD))
8262 o->op_flags |= OPf_STACKED;
8267 Perl_ck_spair(pTHX_ OP *o)
8271 PERL_ARGS_ASSERT_CK_SPAIR;
8273 if (o->op_flags & OPf_KIDS) {
8276 const OPCODE type = o->op_type;
8277 o = modkids(ck_fun(o), type);
8278 kid = cUNOPo->op_first;
8279 newop = kUNOP->op_first->op_sibling;
8281 const OPCODE type = newop->op_type;
8282 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
8283 type == OP_PADAV || type == OP_PADHV ||
8284 type == OP_RV2AV || type == OP_RV2HV)
8288 op_getmad(kUNOP->op_first,newop,'K');
8290 op_free(kUNOP->op_first);
8292 kUNOP->op_first = newop;
8294 o->op_ppaddr = PL_ppaddr[++o->op_type];
8299 Perl_ck_delete(pTHX_ OP *o)
8301 PERL_ARGS_ASSERT_CK_DELETE;
8305 if (o->op_flags & OPf_KIDS) {
8306 OP * const kid = cUNOPo->op_first;
8307 switch (kid->op_type) {
8309 o->op_flags |= OPf_SPECIAL;
8312 o->op_private |= OPpSLICE;
8315 o->op_flags |= OPf_SPECIAL;
8320 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
8323 if (kid->op_private & OPpLVAL_INTRO)
8324 o->op_private |= OPpLVAL_INTRO;
8331 Perl_ck_die(pTHX_ OP *o)
8333 PERL_ARGS_ASSERT_CK_DIE;
8336 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
8342 Perl_ck_eof(pTHX_ OP *o)
8346 PERL_ARGS_ASSERT_CK_EOF;
8348 if (o->op_flags & OPf_KIDS) {
8350 if (cLISTOPo->op_first->op_type == OP_STUB) {
8352 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
8354 op_getmad(o,newop,'O');
8361 kid = cLISTOPo->op_first;
8362 if (kid->op_type == OP_RV2GV)
8363 kid->op_private |= OPpALLOW_FAKE;
8369 Perl_ck_eval(pTHX_ OP *o)
8373 PERL_ARGS_ASSERT_CK_EVAL;
8375 PL_hints |= HINT_BLOCK_SCOPE;
8376 if (o->op_flags & OPf_KIDS) {
8377 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8380 o->op_flags &= ~OPf_KIDS;
8383 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
8389 cUNOPo->op_first = 0;
8394 NewOp(1101, enter, 1, LOGOP);
8395 enter->op_type = OP_ENTERTRY;
8396 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
8397 enter->op_private = 0;
8399 /* establish postfix order */
8400 enter->op_next = (OP*)enter;
8402 o = op_prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
8403 o->op_type = OP_LEAVETRY;
8404 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
8405 enter->op_other = o;
8406 op_getmad(oldo,o,'O');
8415 const U8 priv = o->op_private;
8421 o = newUNOP(OP_ENTEREVAL, priv <<8, newDEFSVOP());
8422 op_getmad(oldo,o,'O');
8424 o->op_targ = (PADOFFSET)PL_hints;
8425 if (o->op_private & OPpEVAL_BYTES) o->op_targ &= ~HINT_UTF8;
8426 if ((PL_hints & HINT_LOCALIZE_HH) != 0
8427 && !(o->op_private & OPpEVAL_COPHH) && GvHV(PL_hintgv)) {
8428 /* Store a copy of %^H that pp_entereval can pick up. */
8429 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
8430 MUTABLE_SV(hv_copy_hints_hv(GvHV(PL_hintgv))));
8431 cUNOPo->op_first->op_sibling = hhop;
8432 o->op_private |= OPpEVAL_HAS_HH;
8434 if (!(o->op_private & OPpEVAL_BYTES)
8435 && FEATURE_UNIEVAL_IS_ENABLED)
8436 o->op_private |= OPpEVAL_UNICODE;
8441 Perl_ck_exit(pTHX_ OP *o)
8443 PERL_ARGS_ASSERT_CK_EXIT;
8446 HV * const table = GvHV(PL_hintgv);
8448 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
8449 if (svp && *svp && SvTRUE(*svp))
8450 o->op_private |= OPpEXIT_VMSISH;
8452 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
8458 Perl_ck_exec(pTHX_ OP *o)
8460 PERL_ARGS_ASSERT_CK_EXEC;
8462 if (o->op_flags & OPf_STACKED) {
8465 kid = cUNOPo->op_first->op_sibling;
8466 if (kid->op_type == OP_RV2GV)
8475 Perl_ck_exists(pTHX_ OP *o)
8479 PERL_ARGS_ASSERT_CK_EXISTS;
8482 if (o->op_flags & OPf_KIDS) {
8483 OP * const kid = cUNOPo->op_first;
8484 if (kid->op_type == OP_ENTERSUB) {
8485 (void) ref(kid, o->op_type);
8486 if (kid->op_type != OP_RV2CV
8487 && !(PL_parser && PL_parser->error_count))
8488 Perl_croak(aTHX_ "%s argument is not a subroutine name",
8490 o->op_private |= OPpEXISTS_SUB;
8492 else if (kid->op_type == OP_AELEM)
8493 o->op_flags |= OPf_SPECIAL;
8494 else if (kid->op_type != OP_HELEM)
8495 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine",
8503 Perl_ck_rvconst(pTHX_ register OP *o)
8506 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8508 PERL_ARGS_ASSERT_CK_RVCONST;
8510 o->op_private |= (PL_hints & HINT_STRICT_REFS);
8511 if (o->op_type == OP_RV2CV)
8512 o->op_private &= ~1;
8514 if (kid->op_type == OP_CONST) {
8517 SV * const kidsv = kid->op_sv;
8519 /* Is it a constant from cv_const_sv()? */
8520 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
8521 SV * const rsv = SvRV(kidsv);
8522 const svtype type = SvTYPE(rsv);
8523 const char *badtype = NULL;
8525 switch (o->op_type) {
8527 if (type > SVt_PVMG)
8528 badtype = "a SCALAR";
8531 if (type != SVt_PVAV)
8532 badtype = "an ARRAY";
8535 if (type != SVt_PVHV)
8539 if (type != SVt_PVCV)
8544 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
8547 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
8548 const char *badthing;
8549 switch (o->op_type) {
8551 badthing = "a SCALAR";
8554 badthing = "an ARRAY";
8557 badthing = "a HASH";
8565 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
8566 SVfARG(kidsv), badthing);
8569 * This is a little tricky. We only want to add the symbol if we
8570 * didn't add it in the lexer. Otherwise we get duplicate strict
8571 * warnings. But if we didn't add it in the lexer, we must at
8572 * least pretend like we wanted to add it even if it existed before,
8573 * or we get possible typo warnings. OPpCONST_ENTERED says
8574 * whether the lexer already added THIS instance of this symbol.
8576 iscv = (o->op_type == OP_RV2CV) * 2;
8578 gv = gv_fetchsv(kidsv,
8579 iscv | !(kid->op_private & OPpCONST_ENTERED),
8582 : o->op_type == OP_RV2SV
8584 : o->op_type == OP_RV2AV
8586 : o->op_type == OP_RV2HV
8589 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
8591 kid->op_type = OP_GV;
8592 SvREFCNT_dec(kid->op_sv);
8594 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
8595 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
8596 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
8598 PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv)));
8600 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
8602 kid->op_private = 0;
8603 kid->op_ppaddr = PL_ppaddr[OP_GV];
8604 /* FAKE globs in the symbol table cause weird bugs (#77810) */
8612 Perl_ck_ftst(pTHX_ OP *o)
8615 const I32 type = o->op_type;
8617 PERL_ARGS_ASSERT_CK_FTST;
8619 if (o->op_flags & OPf_REF) {
8622 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
8623 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8624 const OPCODE kidtype = kid->op_type;
8626 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)
8627 && !(kid->op_private & OPpCONST_FOLDED)) {
8628 OP * const newop = newGVOP(type, OPf_REF,
8629 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
8631 op_getmad(o,newop,'O');
8637 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
8638 o->op_private |= OPpFT_ACCESS;
8639 if (PL_check[kidtype] == Perl_ck_ftst
8640 && kidtype != OP_STAT && kidtype != OP_LSTAT) {
8641 o->op_private |= OPpFT_STACKED;
8642 kid->op_private |= OPpFT_STACKING;
8643 if (kidtype == OP_FTTTY && (
8644 !(kid->op_private & OPpFT_STACKED)
8645 || kid->op_private & OPpFT_AFTER_t
8647 o->op_private |= OPpFT_AFTER_t;
8656 if (type == OP_FTTTY)
8657 o = newGVOP(type, OPf_REF, PL_stdingv);
8659 o = newUNOP(type, 0, newDEFSVOP());
8660 op_getmad(oldo,o,'O');
8666 Perl_ck_fun(pTHX_ OP *o)
8669 const int type = o->op_type;
8670 I32 oa = PL_opargs[type] >> OASHIFT;
8672 PERL_ARGS_ASSERT_CK_FUN;
8674 if (o->op_flags & OPf_STACKED) {
8675 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
8678 return no_fh_allowed(o);
8681 if (o->op_flags & OPf_KIDS) {
8682 OP **tokid = &cLISTOPo->op_first;
8683 OP *kid = cLISTOPo->op_first;
8686 bool seen_optional = FALSE;
8688 if (kid->op_type == OP_PUSHMARK ||
8689 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
8691 tokid = &kid->op_sibling;
8692 kid = kid->op_sibling;
8694 if (kid && kid->op_type == OP_COREARGS) {
8695 bool optional = FALSE;
8698 if (oa & OA_OPTIONAL) optional = TRUE;
8701 if (optional) o->op_private |= numargs;
8706 if (oa & OA_OPTIONAL || (oa & 7) == OA_LIST) {
8707 if (!kid && !seen_optional && PL_opargs[type] & OA_DEFGV)
8708 *tokid = kid = newDEFSVOP();
8709 seen_optional = TRUE;
8714 sibl = kid->op_sibling;
8716 if (!sibl && kid->op_type == OP_STUB) {
8723 /* list seen where single (scalar) arg expected? */
8724 if (numargs == 1 && !(oa >> 4)
8725 && kid->op_type == OP_LIST && type != OP_SCALAR)
8727 return too_many_arguments_pv(o,PL_op_desc[type], 0);
8740 if ((type == OP_PUSH || type == OP_UNSHIFT)
8741 && !kid->op_sibling)
8742 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
8743 "Useless use of %s with no values",
8746 if (kid->op_type == OP_CONST &&
8747 (kid->op_private & OPpCONST_BARE))
8749 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
8750 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
8751 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8752 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
8753 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
8755 op_getmad(kid,newop,'K');
8760 kid->op_sibling = sibl;
8763 else if (kid->op_type == OP_CONST
8764 && ( !SvROK(cSVOPx_sv(kid))
8765 || SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV )
8767 bad_type_pv(numargs, "array", PL_op_desc[type], 0, kid);
8768 /* Defer checks to run-time if we have a scalar arg */
8769 if (kid->op_type == OP_RV2AV || kid->op_type == OP_PADAV)
8770 op_lvalue(kid, type);
8774 if (kid->op_type == OP_CONST &&
8775 (kid->op_private & OPpCONST_BARE))
8777 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
8778 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
8779 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8780 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
8781 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
8783 op_getmad(kid,newop,'K');
8788 kid->op_sibling = sibl;
8791 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
8792 bad_type_pv(numargs, "hash", PL_op_desc[type], 0, kid);
8793 op_lvalue(kid, type);
8797 OP * const newop = newUNOP(OP_NULL, 0, kid);
8798 kid->op_sibling = 0;
8799 newop->op_next = newop;
8801 kid->op_sibling = sibl;
8806 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
8807 if (kid->op_type == OP_CONST &&
8808 (kid->op_private & OPpCONST_BARE))
8810 OP * const newop = newGVOP(OP_GV, 0,
8811 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
8812 if (!(o->op_private & 1) && /* if not unop */
8813 kid == cLISTOPo->op_last)
8814 cLISTOPo->op_last = newop;
8816 op_getmad(kid,newop,'K');
8822 else if (kid->op_type == OP_READLINE) {
8823 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
8824 bad_type_pv(numargs, "HANDLE", OP_DESC(o), 0, kid);
8827 I32 flags = OPf_SPECIAL;
8831 /* is this op a FH constructor? */
8832 if (is_handle_constructor(o,numargs)) {
8833 const char *name = NULL;
8836 bool want_dollar = TRUE;
8839 /* Set a flag to tell rv2gv to vivify
8840 * need to "prove" flag does not mean something
8841 * else already - NI-S 1999/05/07
8844 if (kid->op_type == OP_PADSV) {
8846 = PAD_COMPNAME_SV(kid->op_targ);
8847 name = SvPV_const(namesv, len);
8848 name_utf8 = SvUTF8(namesv);
8850 else if (kid->op_type == OP_RV2SV
8851 && kUNOP->op_first->op_type == OP_GV)
8853 GV * const gv = cGVOPx_gv(kUNOP->op_first);
8855 len = GvNAMELEN(gv);
8856 name_utf8 = GvNAMEUTF8(gv) ? SVf_UTF8 : 0;
8858 else if (kid->op_type == OP_AELEM
8859 || kid->op_type == OP_HELEM)
8862 OP *op = ((BINOP*)kid)->op_first;
8866 const char * const a =
8867 kid->op_type == OP_AELEM ?
8869 if (((op->op_type == OP_RV2AV) ||
8870 (op->op_type == OP_RV2HV)) &&
8871 (firstop = ((UNOP*)op)->op_first) &&
8872 (firstop->op_type == OP_GV)) {
8873 /* packagevar $a[] or $h{} */
8874 GV * const gv = cGVOPx_gv(firstop);
8882 else if (op->op_type == OP_PADAV
8883 || op->op_type == OP_PADHV) {
8884 /* lexicalvar $a[] or $h{} */
8885 const char * const padname =
8886 PAD_COMPNAME_PV(op->op_targ);
8895 name = SvPV_const(tmpstr, len);
8896 name_utf8 = SvUTF8(tmpstr);
8901 name = "__ANONIO__";
8903 want_dollar = FALSE;
8905 op_lvalue(kid, type);
8909 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
8910 namesv = PAD_SVl(targ);
8911 SvUPGRADE(namesv, SVt_PV);
8912 if (want_dollar && *name != '$')
8913 sv_setpvs(namesv, "$");
8914 sv_catpvn(namesv, name, len);
8915 if ( name_utf8 ) SvUTF8_on(namesv);
8918 kid->op_sibling = 0;
8919 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
8920 kid->op_targ = targ;
8921 kid->op_private |= priv;
8923 kid->op_sibling = sibl;
8929 if ((type == OP_UNDEF || type == OP_POS)
8930 && numargs == 1 && !(oa >> 4)
8931 && kid->op_type == OP_LIST)
8932 return too_many_arguments_pv(o,PL_op_desc[type], 0);
8933 op_lvalue(scalar(kid), type);
8937 tokid = &kid->op_sibling;
8938 kid = kid->op_sibling;
8941 if (kid && kid->op_type != OP_STUB)
8942 return too_many_arguments_pv(o,OP_DESC(o), 0);
8943 o->op_private |= numargs;
8945 /* FIXME - should the numargs move as for the PERL_MAD case? */
8946 o->op_private |= numargs;
8948 return too_many_arguments_pv(o,OP_DESC(o), 0);
8952 else if (PL_opargs[type] & OA_DEFGV) {
8954 OP *newop = newUNOP(type, 0, newDEFSVOP());
8955 op_getmad(o,newop,'O');
8958 /* Ordering of these two is important to keep f_map.t passing. */
8960 return newUNOP(type, 0, newDEFSVOP());
8965 while (oa & OA_OPTIONAL)
8967 if (oa && oa != OA_LIST)
8968 return too_few_arguments_pv(o,OP_DESC(o), 0);
8974 Perl_ck_glob(pTHX_ OP *o)
8978 const bool core = o->op_flags & OPf_SPECIAL;
8980 PERL_ARGS_ASSERT_CK_GLOB;
8983 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
8984 op_append_elem(OP_GLOB, o, newDEFSVOP()); /* glob() => glob($_) */
8986 if (core) gv = NULL;
8987 else if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
8988 && GvCVu(gv) && GvIMPORTED_CV(gv)))
8990 GV * const * const gvp =
8991 (GV **)hv_fetchs(PL_globalstash, "glob", FALSE);
8992 gv = gvp ? *gvp : NULL;
8995 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
8998 * \ null - const(wildcard)
9003 * \ mark - glob - rv2cv
9004 * | \ gv(CORE::GLOBAL::glob)
9006 * \ null - const(wildcard) - const(ix)
9008 o->op_flags |= OPf_SPECIAL;
9009 o->op_targ = pad_alloc(OP_GLOB, SVs_PADTMP);
9010 op_append_elem(OP_GLOB, o,
9011 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
9012 o = newLISTOP(OP_LIST, 0, o, NULL);
9013 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
9014 op_append_elem(OP_LIST, o,
9015 scalar(newUNOP(OP_RV2CV, 0,
9016 newGVOP(OP_GV, 0, gv)))));
9017 o = newUNOP(OP_NULL, 0, o);
9018 o->op_targ = OP_GLOB; /* hint at what it used to be: eg in newWHILEOP */
9021 else o->op_flags &= ~OPf_SPECIAL;
9022 #if !defined(PERL_EXTERNAL_GLOB)
9025 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
9026 newSVpvs("File::Glob"), NULL, NULL, NULL);
9029 #endif /* !PERL_EXTERNAL_GLOB */
9030 gv = newGVgen("main");
9032 #ifndef PERL_EXTERNAL_GLOB
9033 sv_setiv(GvSVn(gv),PL_glob_index++);
9035 op_append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
9041 Perl_ck_grep(pTHX_ OP *o)
9046 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
9049 PERL_ARGS_ASSERT_CK_GREP;
9051 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
9052 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
9054 if (o->op_flags & OPf_STACKED) {
9055 kid = cUNOPx(cLISTOPo->op_first->op_sibling)->op_first;
9056 if (kid->op_type != OP_SCOPE && kid->op_type != OP_LEAVE)
9057 return no_fh_allowed(o);
9058 o->op_flags &= ~OPf_STACKED;
9060 kid = cLISTOPo->op_first->op_sibling;
9061 if (type == OP_MAPWHILE)
9066 if (PL_parser && PL_parser->error_count)
9068 kid = cLISTOPo->op_first->op_sibling;
9069 if (kid->op_type != OP_NULL)
9070 Perl_croak(aTHX_ "panic: ck_grep, type=%u", (unsigned) kid->op_type);
9071 kid = kUNOP->op_first;
9073 NewOp(1101, gwop, 1, LOGOP);
9074 gwop->op_type = type;
9075 gwop->op_ppaddr = PL_ppaddr[type];
9077 gwop->op_flags |= OPf_KIDS;
9078 gwop->op_other = LINKLIST(kid);
9079 kid->op_next = (OP*)gwop;
9080 offset = pad_findmy_pvs("$_", 0);
9081 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
9082 o->op_private = gwop->op_private = 0;
9083 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
9086 o->op_private = gwop->op_private = OPpGREP_LEX;
9087 gwop->op_targ = o->op_targ = offset;
9090 kid = cLISTOPo->op_first->op_sibling;
9091 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
9092 op_lvalue(kid, OP_GREPSTART);
9098 Perl_ck_index(pTHX_ OP *o)
9100 PERL_ARGS_ASSERT_CK_INDEX;
9102 if (o->op_flags & OPf_KIDS) {
9103 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9105 kid = kid->op_sibling; /* get past "big" */
9106 if (kid && kid->op_type == OP_CONST) {
9107 const bool save_taint = PL_tainted;
9108 fbm_compile(((SVOP*)kid)->op_sv, 0);
9109 PL_tainted = save_taint;
9116 Perl_ck_lfun(pTHX_ OP *o)
9118 const OPCODE type = o->op_type;
9120 PERL_ARGS_ASSERT_CK_LFUN;
9122 return modkids(ck_fun(o), type);
9126 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
9128 PERL_ARGS_ASSERT_CK_DEFINED;
9130 if ((o->op_flags & OPf_KIDS)) {
9131 switch (cUNOPo->op_first->op_type) {
9134 case OP_AASSIGN: /* Is this a good idea? */
9135 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9136 "defined(@array) is deprecated");
9137 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9138 "\t(Maybe you should just omit the defined()?)\n");
9142 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9143 "defined(%%hash) is deprecated");
9144 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9145 "\t(Maybe you should just omit the defined()?)\n");
9156 Perl_ck_readline(pTHX_ OP *o)
9158 PERL_ARGS_ASSERT_CK_READLINE;
9160 if (o->op_flags & OPf_KIDS) {
9161 OP *kid = cLISTOPo->op_first;
9162 if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE;
9166 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
9168 op_getmad(o,newop,'O');
9178 Perl_ck_rfun(pTHX_ OP *o)
9180 const OPCODE type = o->op_type;
9182 PERL_ARGS_ASSERT_CK_RFUN;
9184 return refkids(ck_fun(o), type);
9188 Perl_ck_listiob(pTHX_ OP *o)
9192 PERL_ARGS_ASSERT_CK_LISTIOB;
9194 kid = cLISTOPo->op_first;
9197 kid = cLISTOPo->op_first;
9199 if (kid->op_type == OP_PUSHMARK)
9200 kid = kid->op_sibling;
9201 if (kid && o->op_flags & OPf_STACKED)
9202 kid = kid->op_sibling;
9203 else if (kid && !kid->op_sibling) { /* print HANDLE; */
9204 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE
9205 && !(kid->op_private & OPpCONST_FOLDED)) {
9206 o->op_flags |= OPf_STACKED; /* make it a filehandle */
9207 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
9208 cLISTOPo->op_first->op_sibling = kid;
9209 cLISTOPo->op_last = kid;
9210 kid = kid->op_sibling;
9215 op_append_elem(o->op_type, o, newDEFSVOP());
9217 if (o->op_type == OP_PRTF) return modkids(listkids(o), OP_PRTF);
9222 Perl_ck_smartmatch(pTHX_ OP *o)
9225 PERL_ARGS_ASSERT_CK_SMARTMATCH;
9226 if (0 == (o->op_flags & OPf_SPECIAL)) {
9227 OP *first = cBINOPo->op_first;
9228 OP *second = first->op_sibling;
9230 /* Implicitly take a reference to an array or hash */
9231 first->op_sibling = NULL;
9232 first = cBINOPo->op_first = ref_array_or_hash(first);
9233 second = first->op_sibling = ref_array_or_hash(second);
9235 /* Implicitly take a reference to a regular expression */
9236 if (first->op_type == OP_MATCH) {
9237 first->op_type = OP_QR;
9238 first->op_ppaddr = PL_ppaddr[OP_QR];
9240 if (second->op_type == OP_MATCH) {
9241 second->op_type = OP_QR;
9242 second->op_ppaddr = PL_ppaddr[OP_QR];
9251 Perl_ck_sassign(pTHX_ OP *o)
9254 OP * const kid = cLISTOPo->op_first;
9256 PERL_ARGS_ASSERT_CK_SASSIGN;
9258 /* has a disposable target? */
9259 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
9260 && !(kid->op_flags & OPf_STACKED)
9261 /* Cannot steal the second time! */
9262 && !(kid->op_private & OPpTARGET_MY)
9263 /* Keep the full thing for madskills */
9267 OP * const kkid = kid->op_sibling;
9269 /* Can just relocate the target. */
9270 if (kkid && kkid->op_type == OP_PADSV
9271 && !(kkid->op_private & OPpLVAL_INTRO))
9273 kid->op_targ = kkid->op_targ;
9275 /* Now we do not need PADSV and SASSIGN. */
9276 kid->op_sibling = o->op_sibling; /* NULL */
9277 cLISTOPo->op_first = NULL;
9280 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
9284 if (kid->op_sibling) {
9285 OP *kkid = kid->op_sibling;
9286 /* For state variable assignment, kkid is a list op whose op_last
9288 if ((kkid->op_type == OP_PADSV ||
9289 (kkid->op_type == OP_LIST &&
9290 (kkid = cLISTOPx(kkid)->op_last)->op_type == OP_PADSV
9293 && (kkid->op_private & OPpLVAL_INTRO)
9294 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
9295 const PADOFFSET target = kkid->op_targ;
9296 OP *const other = newOP(OP_PADSV,
9298 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
9299 OP *const first = newOP(OP_NULL, 0);
9300 OP *const nullop = newCONDOP(0, first, o, other);
9301 OP *const condop = first->op_next;
9302 /* hijacking PADSTALE for uninitialized state variables */
9303 SvPADSTALE_on(PAD_SVl(target));
9305 condop->op_type = OP_ONCE;
9306 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
9307 condop->op_targ = target;
9308 other->op_targ = target;
9310 /* Because we change the type of the op here, we will skip the
9311 assignment binop->op_last = binop->op_first->op_sibling; at the
9312 end of Perl_newBINOP(). So need to do it here. */
9313 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
9322 Perl_ck_match(pTHX_ OP *o)
9326 PERL_ARGS_ASSERT_CK_MATCH;
9328 if (o->op_type != OP_QR && PL_compcv) {
9329 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
9330 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
9331 o->op_targ = offset;
9332 o->op_private |= OPpTARGET_MY;
9335 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
9336 o->op_private |= OPpRUNTIME;
9341 Perl_ck_method(pTHX_ OP *o)
9343 OP * const kid = cUNOPo->op_first;
9345 PERL_ARGS_ASSERT_CK_METHOD;
9347 if (kid->op_type == OP_CONST) {
9348 SV* sv = kSVOP->op_sv;
9349 const char * const method = SvPVX_const(sv);
9350 if (!(strchr(method, ':') || strchr(method, '\''))) {
9352 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
9353 sv = newSVpvn_share(method, SvUTF8(sv) ? -(I32)SvCUR(sv) : (I32)SvCUR(sv), 0);
9356 kSVOP->op_sv = NULL;
9358 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
9360 op_getmad(o,cmop,'O');
9371 Perl_ck_null(pTHX_ OP *o)
9373 PERL_ARGS_ASSERT_CK_NULL;
9374 PERL_UNUSED_CONTEXT;
9379 Perl_ck_open(pTHX_ OP *o)
9382 HV * const table = GvHV(PL_hintgv);
9384 PERL_ARGS_ASSERT_CK_OPEN;
9387 SV **svp = hv_fetchs(table, "open_IN", FALSE);
9390 const char *d = SvPV_const(*svp, len);
9391 const I32 mode = mode_from_discipline(d, len);
9392 if (mode & O_BINARY)
9393 o->op_private |= OPpOPEN_IN_RAW;
9394 else if (mode & O_TEXT)
9395 o->op_private |= OPpOPEN_IN_CRLF;
9398 svp = hv_fetchs(table, "open_OUT", FALSE);
9401 const char *d = SvPV_const(*svp, len);
9402 const I32 mode = mode_from_discipline(d, len);
9403 if (mode & O_BINARY)
9404 o->op_private |= OPpOPEN_OUT_RAW;
9405 else if (mode & O_TEXT)
9406 o->op_private |= OPpOPEN_OUT_CRLF;
9409 if (o->op_type == OP_BACKTICK) {
9410 if (!(o->op_flags & OPf_KIDS)) {
9411 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
9413 op_getmad(o,newop,'O');
9422 /* In case of three-arg dup open remove strictness
9423 * from the last arg if it is a bareword. */
9424 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
9425 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
9429 if ((last->op_type == OP_CONST) && /* The bareword. */
9430 (last->op_private & OPpCONST_BARE) &&
9431 (last->op_private & OPpCONST_STRICT) &&
9432 (oa = first->op_sibling) && /* The fh. */
9433 (oa = oa->op_sibling) && /* The mode. */
9434 (oa->op_type == OP_CONST) &&
9435 SvPOK(((SVOP*)oa)->op_sv) &&
9436 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
9437 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
9438 (last == oa->op_sibling)) /* The bareword. */
9439 last->op_private &= ~OPpCONST_STRICT;
9445 Perl_ck_repeat(pTHX_ OP *o)
9447 PERL_ARGS_ASSERT_CK_REPEAT;
9449 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
9450 o->op_private |= OPpREPEAT_DOLIST;
9451 cBINOPo->op_first = force_list(cBINOPo->op_first);
9459 Perl_ck_require(pTHX_ OP *o)
9464 PERL_ARGS_ASSERT_CK_REQUIRE;
9466 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
9467 SVOP * const kid = (SVOP*)cUNOPo->op_first;
9469 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
9470 SV * const sv = kid->op_sv;
9471 U32 was_readonly = SvREADONLY(sv);
9478 sv_force_normal_flags(sv, 0);
9479 assert(!SvREADONLY(sv));
9489 for (; s < end; s++) {
9490 if (*s == ':' && s[1] == ':') {
9492 Move(s+2, s+1, end - s - 1, char);
9497 sv_catpvs(sv, ".pm");
9498 SvFLAGS(sv) |= was_readonly;
9502 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
9503 /* handle override, if any */
9504 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
9505 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
9506 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
9507 gv = gvp ? *gvp : NULL;
9511 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
9513 if (o->op_flags & OPf_KIDS) {
9514 kid = cUNOPo->op_first;
9515 cUNOPo->op_first = NULL;
9523 newop = newUNOP(OP_ENTERSUB, OPf_STACKED,
9524 op_append_elem(OP_LIST, kid,
9525 scalar(newUNOP(OP_RV2CV, 0,
9528 op_getmad(o,newop,'O');
9532 return scalar(ck_fun(o));
9536 Perl_ck_return(pTHX_ OP *o)
9541 PERL_ARGS_ASSERT_CK_RETURN;
9543 kid = cLISTOPo->op_first->op_sibling;
9544 if (CvLVALUE(PL_compcv)) {
9545 for (; kid; kid = kid->op_sibling)
9546 op_lvalue(kid, OP_LEAVESUBLV);
9553 Perl_ck_select(pTHX_ OP *o)
9558 PERL_ARGS_ASSERT_CK_SELECT;
9560 if (o->op_flags & OPf_KIDS) {
9561 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9562 if (kid && kid->op_sibling) {
9563 o->op_type = OP_SSELECT;
9564 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
9566 return fold_constants(op_integerize(op_std_init(o)));
9570 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9571 if (kid && kid->op_type == OP_RV2GV)
9572 kid->op_private &= ~HINT_STRICT_REFS;
9577 Perl_ck_shift(pTHX_ OP *o)
9580 const I32 type = o->op_type;
9582 PERL_ARGS_ASSERT_CK_SHIFT;
9584 if (!(o->op_flags & OPf_KIDS)) {
9587 if (!CvUNIQUE(PL_compcv)) {
9588 o->op_flags |= OPf_SPECIAL;
9592 argop = newUNOP(OP_RV2AV, 0, scalar(newGVOP(OP_GV, 0, PL_argvgv)));
9595 OP * const oldo = o;
9596 o = newUNOP(type, 0, scalar(argop));
9597 op_getmad(oldo,o,'O');
9602 return newUNOP(type, 0, scalar(argop));
9605 return scalar(ck_fun(o));
9609 Perl_ck_sort(pTHX_ OP *o)
9613 HV * const hinthv = GvHV(PL_hintgv);
9615 PERL_ARGS_ASSERT_CK_SORT;
9618 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
9620 const I32 sorthints = (I32)SvIV(*svp);
9621 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
9622 o->op_private |= OPpSORT_QSORT;
9623 if ((sorthints & HINT_SORT_STABLE) != 0)
9624 o->op_private |= OPpSORT_STABLE;
9628 if (o->op_flags & OPf_STACKED)
9630 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9631 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
9632 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
9634 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
9636 if (kid->op_type == OP_LEAVE)
9637 op_null(kid); /* wipe out leave */
9638 /* Prevent execution from escaping out of the sort block. */
9641 /* provide scalar context for comparison function/block */
9642 kid = scalar(firstkid);
9644 o->op_flags |= OPf_SPECIAL;
9647 firstkid = firstkid->op_sibling;
9650 /* provide list context for arguments */
9657 S_simplify_sort(pTHX_ OP *o)
9660 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9667 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
9669 if (!(o->op_flags & OPf_STACKED))
9671 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
9672 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
9673 kid = kUNOP->op_first; /* get past null */
9674 if (!(have_scopeop = kid->op_type == OP_SCOPE)
9675 && kid->op_type != OP_LEAVE)
9677 kid = kLISTOP->op_last; /* get past scope */
9678 switch(kid->op_type) {
9682 if (!have_scopeop) goto padkids;
9687 k = kid; /* remember this node*/
9688 if (kBINOP->op_first->op_type != OP_RV2SV
9689 || kBINOP->op_last ->op_type != OP_RV2SV)
9692 Warn about my($a) or my($b) in a sort block, *if* $a or $b is
9693 then used in a comparison. This catches most, but not
9694 all cases. For instance, it catches
9695 sort { my($a); $a <=> $b }
9697 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
9698 (although why you'd do that is anyone's guess).
9702 if (!ckWARN(WARN_SYNTAX)) return;
9703 kid = kBINOP->op_first;
9705 if (kid->op_type == OP_PADSV) {
9706 SV * const name = AvARRAY(PL_comppad_name)[kid->op_targ];
9707 if (SvCUR(name) == 2 && *SvPVX(name) == '$'
9708 && (SvPVX(name)[1] == 'a' || SvPVX(name)[1] == 'b'))
9709 /* diag_listed_as: "my %s" used in sort comparison */
9710 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
9711 "\"%s %s\" used in sort comparison",
9712 SvPAD_STATE(name) ? "state" : "my",
9715 } while ((kid = kid->op_sibling));
9718 kid = kBINOP->op_first; /* get past cmp */
9719 if (kUNOP->op_first->op_type != OP_GV)
9721 kid = kUNOP->op_first; /* get past rv2sv */
9723 if (GvSTASH(gv) != PL_curstash)
9725 gvname = GvNAME(gv);
9726 if (*gvname == 'a' && gvname[1] == '\0')
9728 else if (*gvname == 'b' && gvname[1] == '\0')
9733 kid = k; /* back to cmp */
9734 /* already checked above that it is rv2sv */
9735 kid = kBINOP->op_last; /* down to 2nd arg */
9736 if (kUNOP->op_first->op_type != OP_GV)
9738 kid = kUNOP->op_first; /* get past rv2sv */
9740 if (GvSTASH(gv) != PL_curstash)
9742 gvname = GvNAME(gv);
9744 ? !(*gvname == 'a' && gvname[1] == '\0')
9745 : !(*gvname == 'b' && gvname[1] == '\0'))
9747 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
9749 o->op_private |= OPpSORT_DESCEND;
9750 if (k->op_type == OP_NCMP)
9751 o->op_private |= OPpSORT_NUMERIC;
9752 if (k->op_type == OP_I_NCMP)
9753 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
9754 kid = cLISTOPo->op_first->op_sibling;
9755 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
9757 op_getmad(kid,o,'S'); /* then delete it */
9759 op_free(kid); /* then delete it */
9764 Perl_ck_split(pTHX_ OP *o)
9769 PERL_ARGS_ASSERT_CK_SPLIT;
9771 if (o->op_flags & OPf_STACKED)
9772 return no_fh_allowed(o);
9774 kid = cLISTOPo->op_first;
9775 if (kid->op_type != OP_NULL)
9776 Perl_croak(aTHX_ "panic: ck_split, type=%u", (unsigned) kid->op_type);
9777 kid = kid->op_sibling;
9778 op_free(cLISTOPo->op_first);
9780 cLISTOPo->op_first = kid;
9782 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
9783 cLISTOPo->op_last = kid; /* There was only one element previously */
9786 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
9787 OP * const sibl = kid->op_sibling;
9788 kid->op_sibling = 0;
9789 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0, 0);
9790 if (cLISTOPo->op_first == cLISTOPo->op_last)
9791 cLISTOPo->op_last = kid;
9792 cLISTOPo->op_first = kid;
9793 kid->op_sibling = sibl;
9796 kid->op_type = OP_PUSHRE;
9797 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
9799 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
9800 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP),
9801 "Use of /g modifier is meaningless in split");
9804 if (!kid->op_sibling)
9805 op_append_elem(OP_SPLIT, o, newDEFSVOP());
9807 kid = kid->op_sibling;
9810 if (!kid->op_sibling)
9811 op_append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
9812 assert(kid->op_sibling);
9814 kid = kid->op_sibling;
9817 if (kid->op_sibling)
9818 return too_many_arguments_pv(o,OP_DESC(o), 0);
9824 Perl_ck_join(pTHX_ OP *o)
9826 const OP * const kid = cLISTOPo->op_first->op_sibling;
9828 PERL_ARGS_ASSERT_CK_JOIN;
9830 if (kid && kid->op_type == OP_MATCH) {
9831 if (ckWARN(WARN_SYNTAX)) {
9832 const REGEXP *re = PM_GETRE(kPMOP);
9834 ? newSVpvn_flags( RX_PRECOMP_const(re), RX_PRELEN(re),
9835 SVs_TEMP | ( RX_UTF8(re) ? SVf_UTF8 : 0 ) )
9836 : newSVpvs_flags( "STRING", SVs_TEMP );
9837 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
9838 "/%"SVf"/ should probably be written as \"%"SVf"\"",
9839 SVfARG(msg), SVfARG(msg));
9846 =for apidoc Am|CV *|rv2cv_op_cv|OP *cvop|U32 flags
9848 Examines an op, which is expected to identify a subroutine at runtime,
9849 and attempts to determine at compile time which subroutine it identifies.
9850 This is normally used during Perl compilation to determine whether
9851 a prototype can be applied to a function call. I<cvop> is the op
9852 being considered, normally an C<rv2cv> op. A pointer to the identified
9853 subroutine is returned, if it could be determined statically, and a null
9854 pointer is returned if it was not possible to determine statically.
9856 Currently, the subroutine can be identified statically if the RV that the
9857 C<rv2cv> is to operate on is provided by a suitable C<gv> or C<const> op.
9858 A C<gv> op is suitable if the GV's CV slot is populated. A C<const> op is
9859 suitable if the constant value must be an RV pointing to a CV. Details of
9860 this process may change in future versions of Perl. If the C<rv2cv> op
9861 has the C<OPpENTERSUB_AMPER> flag set then no attempt is made to identify
9862 the subroutine statically: this flag is used to suppress compile-time
9863 magic on a subroutine call, forcing it to use default runtime behaviour.
9865 If I<flags> has the bit C<RV2CVOPCV_MARK_EARLY> set, then the handling
9866 of a GV reference is modified. If a GV was examined and its CV slot was
9867 found to be empty, then the C<gv> op has the C<OPpEARLY_CV> flag set.
9868 If the op is not optimised away, and the CV slot is later populated with
9869 a subroutine having a prototype, that flag eventually triggers the warning
9870 "called too early to check prototype".
9872 If I<flags> has the bit C<RV2CVOPCV_RETURN_NAME_GV> set, then instead
9873 of returning a pointer to the subroutine it returns a pointer to the
9874 GV giving the most appropriate name for the subroutine in this context.
9875 Normally this is just the C<CvGV> of the subroutine, but for an anonymous
9876 (C<CvANON>) subroutine that is referenced through a GV it will be the
9877 referencing GV. The resulting C<GV*> is cast to C<CV*> to be returned.
9878 A null pointer is returned as usual if there is no statically-determinable
9885 Perl_rv2cv_op_cv(pTHX_ OP *cvop, U32 flags)
9890 PERL_ARGS_ASSERT_RV2CV_OP_CV;
9891 if (flags & ~(RV2CVOPCV_MARK_EARLY|RV2CVOPCV_RETURN_NAME_GV))
9892 Perl_croak(aTHX_ "panic: rv2cv_op_cv bad flags %x", (unsigned)flags);
9893 if (cvop->op_type != OP_RV2CV)
9895 if (cvop->op_private & OPpENTERSUB_AMPER)
9897 if (!(cvop->op_flags & OPf_KIDS))
9899 rvop = cUNOPx(cvop)->op_first;
9900 switch (rvop->op_type) {
9902 gv = cGVOPx_gv(rvop);
9905 if (flags & RV2CVOPCV_MARK_EARLY)
9906 rvop->op_private |= OPpEARLY_CV;
9911 SV *rv = cSVOPx_sv(rvop);
9918 PADNAME *name = PAD_COMPNAME(rvop->op_targ);
9919 CV *compcv = PL_compcv;
9920 PADOFFSET off = rvop->op_targ;
9921 while (PadnameOUTER(name)) {
9922 assert(PARENT_PAD_INDEX(name));
9923 compcv = CvOUTSIDE(PL_compcv);
9924 name = PadlistNAMESARRAY(CvPADLIST(compcv))
9925 [off = PARENT_PAD_INDEX(name)];
9927 assert(!PadnameIsOUR(name));
9928 if (!PadnameIsSTATE(name)) {
9929 MAGIC * mg = mg_find(name, PERL_MAGIC_proto);
9932 cv = (CV *)mg->mg_obj;
9935 (CV *)AvARRAY(PadlistARRAY(CvPADLIST(compcv))[1])[off];
9942 if (SvTYPE((SV*)cv) != SVt_PVCV)
9944 if (flags & RV2CVOPCV_RETURN_NAME_GV) {
9945 if (!CvANON(cv) || !gv)
9954 =for apidoc Am|OP *|ck_entersub_args_list|OP *entersubop
9956 Performs the default fixup of the arguments part of an C<entersub>
9957 op tree. This consists of applying list context to each of the
9958 argument ops. This is the standard treatment used on a call marked
9959 with C<&>, or a method call, or a call through a subroutine reference,
9960 or any other call where the callee can't be identified at compile time,
9961 or a call where the callee has no prototype.
9967 Perl_ck_entersub_args_list(pTHX_ OP *entersubop)
9970 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_LIST;
9971 aop = cUNOPx(entersubop)->op_first;
9972 if (!aop->op_sibling)
9973 aop = cUNOPx(aop)->op_first;
9974 for (aop = aop->op_sibling; aop->op_sibling; aop = aop->op_sibling) {
9975 if (!(PL_madskills && aop->op_type == OP_STUB)) {
9977 op_lvalue(aop, OP_ENTERSUB);
9984 =for apidoc Am|OP *|ck_entersub_args_proto|OP *entersubop|GV *namegv|SV *protosv
9986 Performs the fixup of the arguments part of an C<entersub> op tree
9987 based on a subroutine prototype. This makes various modifications to
9988 the argument ops, from applying context up to inserting C<refgen> ops,
9989 and checking the number and syntactic types of arguments, as directed by
9990 the prototype. This is the standard treatment used on a subroutine call,
9991 not marked with C<&>, where the callee can be identified at compile time
9992 and has a prototype.
9994 I<protosv> supplies the subroutine prototype to be applied to the call.
9995 It may be a normal defined scalar, of which the string value will be used.
9996 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
9997 that has been cast to C<SV*>) which has a prototype. The prototype
9998 supplied, in whichever form, does not need to match the actual callee
9999 referenced by the op tree.
10001 If the argument ops disagree with the prototype, for example by having
10002 an unacceptable number of arguments, a valid op tree is returned anyway.
10003 The error is reflected in the parser state, normally resulting in a single
10004 exception at the top level of parsing which covers all the compilation
10005 errors that occurred. In the error message, the callee is referred to
10006 by the name defined by the I<namegv> parameter.
10012 Perl_ck_entersub_args_proto(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
10015 const char *proto, *proto_end;
10016 OP *aop, *prev, *cvop;
10019 I32 contextclass = 0;
10020 const char *e = NULL;
10021 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO;
10022 if (SvTYPE(protosv) == SVt_PVCV ? !SvPOK(protosv) : !SvOK(protosv))
10023 Perl_croak(aTHX_ "panic: ck_entersub_args_proto CV with no proto, "
10024 "flags=%lx", (unsigned long) SvFLAGS(protosv));
10025 if (SvTYPE(protosv) == SVt_PVCV)
10026 proto = CvPROTO(protosv), proto_len = CvPROTOLEN(protosv);
10027 else proto = SvPV(protosv, proto_len);
10028 proto_end = proto + proto_len;
10029 aop = cUNOPx(entersubop)->op_first;
10030 if (!aop->op_sibling)
10031 aop = cUNOPx(aop)->op_first;
10033 aop = aop->op_sibling;
10034 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
10035 while (aop != cvop) {
10037 if (PL_madskills && aop->op_type == OP_STUB) {
10038 aop = aop->op_sibling;
10041 if (PL_madskills && aop->op_type == OP_NULL)
10042 o3 = ((UNOP*)aop)->op_first;
10046 if (proto >= proto_end)
10047 return too_many_arguments_sv(entersubop, gv_ename(namegv), 0);
10055 /* _ must be at the end */
10056 if (proto[1] && !strchr(";@%", proto[1]))
10071 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
10073 arg == 1 ? "block or sub {}" : "sub {}",
10074 gv_ename(namegv), 0, o3);
10077 /* '*' allows any scalar type, including bareword */
10080 if (o3->op_type == OP_RV2GV)
10081 goto wrapref; /* autoconvert GLOB -> GLOBref */
10082 else if (o3->op_type == OP_CONST)
10083 o3->op_private &= ~OPpCONST_STRICT;
10084 else if (o3->op_type == OP_ENTERSUB) {
10085 /* accidental subroutine, revert to bareword */
10086 OP *gvop = ((UNOP*)o3)->op_first;
10087 if (gvop && gvop->op_type == OP_NULL) {
10088 gvop = ((UNOP*)gvop)->op_first;
10090 for (; gvop->op_sibling; gvop = gvop->op_sibling)
10093 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
10094 (gvop = ((UNOP*)gvop)->op_first) &&
10095 gvop->op_type == OP_GV)
10097 GV * const gv = cGVOPx_gv(gvop);
10098 OP * const sibling = aop->op_sibling;
10099 SV * const n = newSVpvs("");
10101 OP * const oldaop = aop;
10105 gv_fullname4(n, gv, "", FALSE);
10106 aop = newSVOP(OP_CONST, 0, n);
10107 op_getmad(oldaop,aop,'O');
10108 prev->op_sibling = aop;
10109 aop->op_sibling = sibling;
10119 if (o3->op_type == OP_RV2AV ||
10120 o3->op_type == OP_PADAV ||
10121 o3->op_type == OP_RV2HV ||
10122 o3->op_type == OP_PADHV
10128 case '[': case ']':
10135 switch (*proto++) {
10137 if (contextclass++ == 0) {
10138 e = strchr(proto, ']');
10139 if (!e || e == proto)
10147 if (contextclass) {
10148 const char *p = proto;
10149 const char *const end = proto;
10151 while (*--p != '[')
10152 /* \[$] accepts any scalar lvalue */
10154 && Perl_op_lvalue_flags(aTHX_
10156 OP_READ, /* not entersub */
10159 bad_type_sv(arg, Perl_form(aTHX_ "one of %.*s",
10160 (int)(end - p), p),
10161 gv_ename(namegv), 0, o3);
10166 if (o3->op_type == OP_RV2GV)
10169 bad_type_sv(arg, "symbol", gv_ename(namegv), 0, o3);
10172 if (o3->op_type == OP_ENTERSUB)
10175 bad_type_sv(arg, "subroutine entry", gv_ename(namegv), 0,
10179 if (o3->op_type == OP_RV2SV ||
10180 o3->op_type == OP_PADSV ||
10181 o3->op_type == OP_HELEM ||
10182 o3->op_type == OP_AELEM)
10184 if (!contextclass) {
10185 /* \$ accepts any scalar lvalue */
10186 if (Perl_op_lvalue_flags(aTHX_
10188 OP_READ, /* not entersub */
10191 bad_type_sv(arg, "scalar", gv_ename(namegv), 0, o3);
10195 if (o3->op_type == OP_RV2AV ||
10196 o3->op_type == OP_PADAV)
10199 bad_type_sv(arg, "array", gv_ename(namegv), 0, o3);
10202 if (o3->op_type == OP_RV2HV ||
10203 o3->op_type == OP_PADHV)
10206 bad_type_sv(arg, "hash", gv_ename(namegv), 0, o3);
10210 OP* const kid = aop;
10211 OP* const sib = kid->op_sibling;
10212 kid->op_sibling = 0;
10213 aop = newUNOP(OP_REFGEN, 0, kid);
10214 aop->op_sibling = sib;
10215 prev->op_sibling = aop;
10217 if (contextclass && e) {
10222 default: goto oops;
10232 SV* const tmpsv = sv_newmortal();
10233 gv_efullname3(tmpsv, namegv, NULL);
10234 Perl_croak(aTHX_ "Malformed prototype for %"SVf": %"SVf,
10235 SVfARG(tmpsv), SVfARG(protosv));
10239 op_lvalue(aop, OP_ENTERSUB);
10241 aop = aop->op_sibling;
10243 if (aop == cvop && *proto == '_') {
10244 /* generate an access to $_ */
10245 aop = newDEFSVOP();
10246 aop->op_sibling = prev->op_sibling;
10247 prev->op_sibling = aop; /* instead of cvop */
10249 if (!optional && proto_end > proto &&
10250 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
10251 return too_few_arguments_sv(entersubop, gv_ename(namegv), 0);
10256 =for apidoc Am|OP *|ck_entersub_args_proto_or_list|OP *entersubop|GV *namegv|SV *protosv
10258 Performs the fixup of the arguments part of an C<entersub> op tree either
10259 based on a subroutine prototype or using default list-context processing.
10260 This is the standard treatment used on a subroutine call, not marked
10261 with C<&>, where the callee can be identified at compile time.
10263 I<protosv> supplies the subroutine prototype to be applied to the call,
10264 or indicates that there is no prototype. It may be a normal scalar,
10265 in which case if it is defined then the string value will be used
10266 as a prototype, and if it is undefined then there is no prototype.
10267 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
10268 that has been cast to C<SV*>), of which the prototype will be used if it
10269 has one. The prototype (or lack thereof) supplied, in whichever form,
10270 does not need to match the actual callee referenced by the op tree.
10272 If the argument ops disagree with the prototype, for example by having
10273 an unacceptable number of arguments, a valid op tree is returned anyway.
10274 The error is reflected in the parser state, normally resulting in a single
10275 exception at the top level of parsing which covers all the compilation
10276 errors that occurred. In the error message, the callee is referred to
10277 by the name defined by the I<namegv> parameter.
10283 Perl_ck_entersub_args_proto_or_list(pTHX_ OP *entersubop,
10284 GV *namegv, SV *protosv)
10286 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO_OR_LIST;
10287 if (SvTYPE(protosv) == SVt_PVCV ? SvPOK(protosv) : SvOK(protosv))
10288 return ck_entersub_args_proto(entersubop, namegv, protosv);
10290 return ck_entersub_args_list(entersubop);
10294 Perl_ck_entersub_args_core(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
10296 int opnum = SvTYPE(protosv) == SVt_PVCV ? 0 : (int)SvUV(protosv);
10297 OP *aop = cUNOPx(entersubop)->op_first;
10299 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_CORE;
10303 if (!aop->op_sibling)
10304 aop = cUNOPx(aop)->op_first;
10305 aop = aop->op_sibling;
10306 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
10307 if (PL_madskills) while (aop != cvop && aop->op_type == OP_STUB) {
10308 aop = aop->op_sibling;
10311 (void)too_many_arguments_pv(entersubop, GvNAME(namegv), 0);
10313 op_free(entersubop);
10314 switch(GvNAME(namegv)[2]) {
10315 case 'F': return newSVOP(OP_CONST, 0,
10316 newSVpv(CopFILE(PL_curcop),0));
10317 case 'L': return newSVOP(
10319 Perl_newSVpvf(aTHX_
10320 "%"IVdf, (IV)CopLINE(PL_curcop)
10323 case 'P': return newSVOP(OP_CONST, 0,
10325 ? newSVhek(HvNAME_HEK(PL_curstash))
10336 bool seenarg = FALSE;
10338 if (!aop->op_sibling)
10339 aop = cUNOPx(aop)->op_first;
10342 aop = aop->op_sibling;
10343 prev->op_sibling = NULL;
10346 prev=cvop, cvop = cvop->op_sibling)
10348 if (PL_madskills && cvop->op_sibling
10349 && cvop->op_type != OP_STUB) seenarg = TRUE
10352 prev->op_sibling = NULL;
10353 flags = OPf_SPECIAL * !(cvop->op_private & OPpENTERSUB_NOPAREN);
10355 if (aop == cvop) aop = NULL;
10356 op_free(entersubop);
10358 if (opnum == OP_ENTEREVAL
10359 && GvNAMELEN(namegv)==9 && strnEQ(GvNAME(namegv), "evalbytes", 9))
10360 flags |= OPpEVAL_BYTES <<8;
10362 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
10364 case OA_BASEOP_OR_UNOP:
10365 case OA_FILESTATOP:
10366 return aop ? newUNOP(opnum,flags,aop) : newOP(opnum,flags);
10370 if (!PL_madskills || seenarg)
10372 (void)too_many_arguments_pv(aop, GvNAME(namegv), 0);
10375 return opnum == OP_RUNCV
10376 ? newPVOP(OP_RUNCV,0,NULL)
10379 return convert(opnum,0,aop);
10387 =for apidoc Am|void|cv_get_call_checker|CV *cv|Perl_call_checker *ckfun_p|SV **ckobj_p
10389 Retrieves the function that will be used to fix up a call to I<cv>.
10390 Specifically, the function is applied to an C<entersub> op tree for a
10391 subroutine call, not marked with C<&>, where the callee can be identified
10392 at compile time as I<cv>.
10394 The C-level function pointer is returned in I<*ckfun_p>, and an SV
10395 argument for it is returned in I<*ckobj_p>. The function is intended
10396 to be called in this manner:
10398 entersubop = (*ckfun_p)(aTHX_ entersubop, namegv, (*ckobj_p));
10400 In this call, I<entersubop> is a pointer to the C<entersub> op,
10401 which may be replaced by the check function, and I<namegv> is a GV
10402 supplying the name that should be used by the check function to refer
10403 to the callee of the C<entersub> op if it needs to emit any diagnostics.
10404 It is permitted to apply the check function in non-standard situations,
10405 such as to a call to a different subroutine or to a method call.
10407 By default, the function is
10408 L<Perl_ck_entersub_args_proto_or_list|/ck_entersub_args_proto_or_list>,
10409 and the SV parameter is I<cv> itself. This implements standard
10410 prototype processing. It can be changed, for a particular subroutine,
10411 by L</cv_set_call_checker>.
10417 Perl_cv_get_call_checker(pTHX_ CV *cv, Perl_call_checker *ckfun_p, SV **ckobj_p)
10420 PERL_ARGS_ASSERT_CV_GET_CALL_CHECKER;
10421 callmg = SvMAGICAL((SV*)cv) ? mg_find((SV*)cv, PERL_MAGIC_checkcall) : NULL;
10423 *ckfun_p = DPTR2FPTR(Perl_call_checker, callmg->mg_ptr);
10424 *ckobj_p = callmg->mg_obj;
10426 *ckfun_p = Perl_ck_entersub_args_proto_or_list;
10427 *ckobj_p = (SV*)cv;
10432 =for apidoc Am|void|cv_set_call_checker|CV *cv|Perl_call_checker ckfun|SV *ckobj
10434 Sets the function that will be used to fix up a call to I<cv>.
10435 Specifically, the function is applied to an C<entersub> op tree for a
10436 subroutine call, not marked with C<&>, where the callee can be identified
10437 at compile time as I<cv>.
10439 The C-level function pointer is supplied in I<ckfun>, and an SV argument
10440 for it is supplied in I<ckobj>. The function is intended to be called
10443 entersubop = ckfun(aTHX_ entersubop, namegv, ckobj);
10445 In this call, I<entersubop> is a pointer to the C<entersub> op,
10446 which may be replaced by the check function, and I<namegv> is a GV
10447 supplying the name that should be used by the check function to refer
10448 to the callee of the C<entersub> op if it needs to emit any diagnostics.
10449 It is permitted to apply the check function in non-standard situations,
10450 such as to a call to a different subroutine or to a method call.
10452 The current setting for a particular CV can be retrieved by
10453 L</cv_get_call_checker>.
10459 Perl_cv_set_call_checker(pTHX_ CV *cv, Perl_call_checker ckfun, SV *ckobj)
10461 PERL_ARGS_ASSERT_CV_SET_CALL_CHECKER;
10462 if (ckfun == Perl_ck_entersub_args_proto_or_list && ckobj == (SV*)cv) {
10463 if (SvMAGICAL((SV*)cv))
10464 mg_free_type((SV*)cv, PERL_MAGIC_checkcall);
10467 sv_magic((SV*)cv, &PL_sv_undef, PERL_MAGIC_checkcall, NULL, 0);
10468 callmg = mg_find((SV*)cv, PERL_MAGIC_checkcall);
10469 if (callmg->mg_flags & MGf_REFCOUNTED) {
10470 SvREFCNT_dec(callmg->mg_obj);
10471 callmg->mg_flags &= ~MGf_REFCOUNTED;
10473 callmg->mg_ptr = FPTR2DPTR(char *, ckfun);
10474 callmg->mg_obj = ckobj;
10475 if (ckobj != (SV*)cv) {
10476 SvREFCNT_inc_simple_void_NN(ckobj);
10477 callmg->mg_flags |= MGf_REFCOUNTED;
10479 callmg->mg_flags |= MGf_COPY;
10484 Perl_ck_subr(pTHX_ OP *o)
10490 PERL_ARGS_ASSERT_CK_SUBR;
10492 aop = cUNOPx(o)->op_first;
10493 if (!aop->op_sibling)
10494 aop = cUNOPx(aop)->op_first;
10495 aop = aop->op_sibling;
10496 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
10497 cv = rv2cv_op_cv(cvop, RV2CVOPCV_MARK_EARLY);
10498 namegv = cv ? (GV*)rv2cv_op_cv(cvop, RV2CVOPCV_RETURN_NAME_GV) : NULL;
10500 o->op_private &= ~1;
10501 o->op_private |= OPpENTERSUB_HASTARG;
10502 o->op_private |= (PL_hints & HINT_STRICT_REFS);
10503 if (PERLDB_SUB && PL_curstash != PL_debstash)
10504 o->op_private |= OPpENTERSUB_DB;
10505 if (cvop->op_type == OP_RV2CV) {
10506 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
10508 } else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
10509 if (aop->op_type == OP_CONST)
10510 aop->op_private &= ~OPpCONST_STRICT;
10511 else if (aop->op_type == OP_LIST) {
10512 OP * const sib = ((UNOP*)aop)->op_first->op_sibling;
10513 if (sib && sib->op_type == OP_CONST)
10514 sib->op_private &= ~OPpCONST_STRICT;
10519 return ck_entersub_args_list(o);
10521 Perl_call_checker ckfun;
10523 cv_get_call_checker(cv, &ckfun, &ckobj);
10524 if (!namegv) { /* expletive! */
10525 /* XXX The call checker API is public. And it guarantees that
10526 a GV will be provided with the right name. So we have
10527 to create a GV. But it is still not correct, as its
10528 stringification will include the package. What we
10529 really need is a new call checker API that accepts a
10530 GV or string (or GV or CV). */
10531 HEK * const hek = CvNAME_HEK(cv);
10533 namegv = (GV *)sv_newmortal();
10534 gv_init_pvn(namegv, PL_curstash, HEK_KEY(hek), HEK_LEN(hek),
10535 SVf_UTF8 * !!HEK_UTF8(hek));
10537 return ckfun(aTHX_ o, namegv, ckobj);
10542 Perl_ck_svconst(pTHX_ OP *o)
10544 PERL_ARGS_ASSERT_CK_SVCONST;
10545 PERL_UNUSED_CONTEXT;
10546 SvREADONLY_on(cSVOPo->op_sv);
10551 Perl_ck_trunc(pTHX_ OP *o)
10553 PERL_ARGS_ASSERT_CK_TRUNC;
10555 if (o->op_flags & OPf_KIDS) {
10556 SVOP *kid = (SVOP*)cUNOPo->op_first;
10558 if (kid->op_type == OP_NULL)
10559 kid = (SVOP*)kid->op_sibling;
10560 if (kid && kid->op_type == OP_CONST &&
10561 (kid->op_private & (OPpCONST_BARE|OPpCONST_FOLDED))
10564 o->op_flags |= OPf_SPECIAL;
10565 kid->op_private &= ~OPpCONST_STRICT;
10572 Perl_ck_substr(pTHX_ OP *o)
10574 PERL_ARGS_ASSERT_CK_SUBSTR;
10577 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
10578 OP *kid = cLISTOPo->op_first;
10580 if (kid->op_type == OP_NULL)
10581 kid = kid->op_sibling;
10583 kid->op_flags |= OPf_MOD;
10590 Perl_ck_tell(pTHX_ OP *o)
10592 PERL_ARGS_ASSERT_CK_TELL;
10594 if (o->op_flags & OPf_KIDS) {
10595 OP *kid = cLISTOPo->op_first;
10596 if (kid->op_type == OP_NULL && kid->op_sibling) kid = kid->op_sibling;
10597 if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE;
10603 Perl_ck_each(pTHX_ OP *o)
10606 OP *kid = o->op_flags & OPf_KIDS ? cUNOPo->op_first : NULL;
10607 const unsigned orig_type = o->op_type;
10608 const unsigned array_type = orig_type == OP_EACH ? OP_AEACH
10609 : orig_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
10610 const unsigned ref_type = orig_type == OP_EACH ? OP_REACH
10611 : orig_type == OP_KEYS ? OP_RKEYS : OP_RVALUES;
10613 PERL_ARGS_ASSERT_CK_EACH;
10616 switch (kid->op_type) {
10622 CHANGE_TYPE(o, array_type);
10625 if (kid->op_private == OPpCONST_BARE
10626 || !SvROK(cSVOPx_sv(kid))
10627 || ( SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV
10628 && SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVHV )
10630 /* we let ck_fun handle it */
10633 CHANGE_TYPE(o, ref_type);
10637 /* if treating as a reference, defer additional checks to runtime */
10638 return o->op_type == ref_type ? o : ck_fun(o);
10642 Perl_ck_length(pTHX_ OP *o)
10644 PERL_ARGS_ASSERT_CK_LENGTH;
10648 if (ckWARN(WARN_SYNTAX)) {
10649 const OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : NULL;
10653 const bool hash = kid->op_type == OP_PADHV
10654 || kid->op_type == OP_RV2HV;
10655 switch (kid->op_type) {
10659 (GV *)PL_compcv, hash ? '%' : '@', kid->op_targ,
10665 if (cUNOPx(kid)->op_first->op_type != OP_GV) break;
10667 GV *gv = cGVOPx_gv(cUNOPx(kid)->op_first);
10669 name = varname(gv, hash?'%':'@', 0, NULL, 0, 1);
10676 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10677 "length() used on %"SVf" (did you mean \"scalar(%s%"SVf
10679 name, hash ? "keys " : "", name
10682 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10683 "length() used on %%hash (did you mean \"scalar(keys %%hash)\"?)");
10685 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10686 "length() used on @array (did you mean \"scalar(@array)\"?)");
10693 /* Check for in place reverse and sort assignments like "@a = reverse @a"
10694 and modify the optree to make them work inplace */
10697 S_inplace_aassign(pTHX_ OP *o) {
10699 OP *modop, *modop_pushmark;
10701 OP *oleft, *oleft_pushmark;
10703 PERL_ARGS_ASSERT_INPLACE_AASSIGN;
10705 assert((o->op_flags & OPf_WANT) == OPf_WANT_VOID);
10707 assert(cUNOPo->op_first->op_type == OP_NULL);
10708 modop_pushmark = cUNOPx(cUNOPo->op_first)->op_first;
10709 assert(modop_pushmark->op_type == OP_PUSHMARK);
10710 modop = modop_pushmark->op_sibling;
10712 if (modop->op_type != OP_SORT && modop->op_type != OP_REVERSE)
10715 /* no other operation except sort/reverse */
10716 if (modop->op_sibling)
10719 assert(cUNOPx(modop)->op_first->op_type == OP_PUSHMARK);
10720 if (!(oright = cUNOPx(modop)->op_first->op_sibling)) return;
10722 if (modop->op_flags & OPf_STACKED) {
10723 /* skip sort subroutine/block */
10724 assert(oright->op_type == OP_NULL);
10725 oright = oright->op_sibling;
10728 assert(cUNOPo->op_first->op_sibling->op_type == OP_NULL);
10729 oleft_pushmark = cUNOPx(cUNOPo->op_first->op_sibling)->op_first;
10730 assert(oleft_pushmark->op_type == OP_PUSHMARK);
10731 oleft = oleft_pushmark->op_sibling;
10733 /* Check the lhs is an array */
10735 (oleft->op_type != OP_RV2AV && oleft->op_type != OP_PADAV)
10736 || oleft->op_sibling
10737 || (oleft->op_private & OPpLVAL_INTRO)
10741 /* Only one thing on the rhs */
10742 if (oright->op_sibling)
10745 /* check the array is the same on both sides */
10746 if (oleft->op_type == OP_RV2AV) {
10747 if (oright->op_type != OP_RV2AV
10748 || !cUNOPx(oright)->op_first
10749 || cUNOPx(oright)->op_first->op_type != OP_GV
10750 || cUNOPx(oleft )->op_first->op_type != OP_GV
10751 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
10752 cGVOPx_gv(cUNOPx(oright)->op_first)
10756 else if (oright->op_type != OP_PADAV
10757 || oright->op_targ != oleft->op_targ
10761 /* This actually is an inplace assignment */
10763 modop->op_private |= OPpSORT_INPLACE;
10765 /* transfer MODishness etc from LHS arg to RHS arg */
10766 oright->op_flags = oleft->op_flags;
10768 /* remove the aassign op and the lhs */
10770 op_null(oleft_pushmark);
10771 if (oleft->op_type == OP_RV2AV && cUNOPx(oleft)->op_first)
10772 op_null(cUNOPx(oleft)->op_first);
10776 #define MAX_DEFERRED 4
10780 if (defer_ix == (MAX_DEFERRED-1)) { \
10781 CALL_RPEEP(defer_queue[defer_base]); \
10782 defer_base = (defer_base + 1) % MAX_DEFERRED; \
10785 defer_queue[(defer_base + ++defer_ix) % MAX_DEFERRED] = o; \
10788 /* A peephole optimizer. We visit the ops in the order they're to execute.
10789 * See the comments at the top of this file for more details about when
10790 * peep() is called */
10793 Perl_rpeep(pTHX_ register OP *o)
10797 OP* defer_queue[MAX_DEFERRED]; /* small queue of deferred branches */
10798 int defer_base = 0;
10801 if (!o || o->op_opt)
10805 SAVEVPTR(PL_curcop);
10806 for (;; o = o->op_next) {
10807 if (o && o->op_opt)
10810 while (defer_ix >= 0)
10811 CALL_RPEEP(defer_queue[(defer_base + defer_ix--) % MAX_DEFERRED]);
10815 /* By default, this op has now been optimised. A couple of cases below
10816 clear this again. */
10819 switch (o->op_type) {
10821 PL_curcop = ((COP*)o); /* for warnings */
10824 PL_curcop = ((COP*)o); /* for warnings */
10826 /* Two NEXTSTATEs in a row serve no purpose. Except if they happen
10827 to carry two labels. For now, take the easier option, and skip
10828 this optimisation if the first NEXTSTATE has a label. */
10829 if (!CopLABEL((COP*)o) && !PERLDB_NOOPT) {
10830 OP *nextop = o->op_next;
10831 while (nextop && nextop->op_type == OP_NULL)
10832 nextop = nextop->op_next;
10834 if (nextop && (nextop->op_type == OP_NEXTSTATE)) {
10835 COP *firstcop = (COP *)o;
10836 COP *secondcop = (COP *)nextop;
10837 /* We want the COP pointed to by o (and anything else) to
10838 become the next COP down the line. */
10839 cop_free(firstcop);
10841 firstcop->op_next = secondcop->op_next;
10843 /* Now steal all its pointers, and duplicate the other
10845 firstcop->cop_line = secondcop->cop_line;
10846 #ifdef USE_ITHREADS
10847 firstcop->cop_stashoff = secondcop->cop_stashoff;
10848 firstcop->cop_file = secondcop->cop_file;
10850 firstcop->cop_stash = secondcop->cop_stash;
10851 firstcop->cop_filegv = secondcop->cop_filegv;
10853 firstcop->cop_hints = secondcop->cop_hints;
10854 firstcop->cop_seq = secondcop->cop_seq;
10855 firstcop->cop_warnings = secondcop->cop_warnings;
10856 firstcop->cop_hints_hash = secondcop->cop_hints_hash;
10858 #ifdef USE_ITHREADS
10859 secondcop->cop_stashoff = 0;
10860 secondcop->cop_file = NULL;
10862 secondcop->cop_stash = NULL;
10863 secondcop->cop_filegv = NULL;
10865 secondcop->cop_warnings = NULL;
10866 secondcop->cop_hints_hash = NULL;
10868 /* If we use op_null(), and hence leave an ex-COP, some
10869 warnings are misreported. For example, the compile-time
10870 error in 'use strict; no strict refs;' */
10871 secondcop->op_type = OP_NULL;
10872 secondcop->op_ppaddr = PL_ppaddr[OP_NULL];
10878 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
10879 if (o->op_next->op_private & OPpTARGET_MY) {
10880 if (o->op_flags & OPf_STACKED) /* chained concats */
10881 break; /* ignore_optimization */
10883 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
10884 o->op_targ = o->op_next->op_targ;
10885 o->op_next->op_targ = 0;
10886 o->op_private |= OPpTARGET_MY;
10889 op_null(o->op_next);
10893 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
10894 break; /* Scalar stub must produce undef. List stub is noop */
10898 if (o->op_targ == OP_NEXTSTATE
10899 || o->op_targ == OP_DBSTATE)
10901 PL_curcop = ((COP*)o);
10903 /* XXX: We avoid setting op_seq here to prevent later calls
10904 to rpeep() from mistakenly concluding that optimisation
10905 has already occurred. This doesn't fix the real problem,
10906 though (See 20010220.007). AMS 20010719 */
10907 /* op_seq functionality is now replaced by op_opt */
10914 if (oldop && o->op_next) {
10915 oldop->op_next = o->op_next;
10923 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
10924 OP* const pop = (o->op_type == OP_PADAV) ?
10925 o->op_next : o->op_next->op_next;
10927 if (pop && pop->op_type == OP_CONST &&
10928 ((PL_op = pop->op_next)) &&
10929 pop->op_next->op_type == OP_AELEM &&
10930 !(pop->op_next->op_private &
10931 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
10932 (i = SvIV(((SVOP*)pop)->op_sv)) <= 255 && i >= 0)
10935 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
10936 no_bareword_allowed(pop);
10937 if (o->op_type == OP_GV)
10938 op_null(o->op_next);
10939 op_null(pop->op_next);
10941 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
10942 o->op_next = pop->op_next->op_next;
10943 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
10944 o->op_private = (U8)i;
10945 if (o->op_type == OP_GV) {
10948 o->op_type = OP_AELEMFAST;
10951 o->op_type = OP_AELEMFAST_LEX;
10956 if (o->op_next->op_type == OP_RV2SV) {
10957 if (!(o->op_next->op_private & OPpDEREF)) {
10958 op_null(o->op_next);
10959 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
10961 o->op_next = o->op_next->op_next;
10962 o->op_type = OP_GVSV;
10963 o->op_ppaddr = PL_ppaddr[OP_GVSV];
10966 else if (o->op_next->op_type == OP_READLINE
10967 && o->op_next->op_next->op_type == OP_CONCAT
10968 && (o->op_next->op_next->op_flags & OPf_STACKED))
10970 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
10971 o->op_type = OP_RCATLINE;
10972 o->op_flags |= OPf_STACKED;
10973 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
10974 op_null(o->op_next->op_next);
10975 op_null(o->op_next);
10984 #define HV_OR_SCALARHV(op) \
10985 ( (op)->op_type == OP_PADHV || (op)->op_type == OP_RV2HV \
10987 : (op)->op_type == OP_SCALAR && (op)->op_flags & OPf_KIDS \
10988 && ( cUNOPx(op)->op_first->op_type == OP_PADHV \
10989 || cUNOPx(op)->op_first->op_type == OP_RV2HV) \
10990 ? cUNOPx(op)->op_first \
10994 if ((fop = HV_OR_SCALARHV(cUNOP->op_first)))
10995 fop->op_private |= OPpTRUEBOOL;
11001 fop = cLOGOP->op_first;
11002 sop = fop->op_sibling;
11003 while (cLOGOP->op_other->op_type == OP_NULL)
11004 cLOGOP->op_other = cLOGOP->op_other->op_next;
11005 while (o->op_next && ( o->op_type == o->op_next->op_type
11006 || o->op_next->op_type == OP_NULL))
11007 o->op_next = o->op_next->op_next;
11008 DEFER(cLOGOP->op_other);
11011 fop = HV_OR_SCALARHV(fop);
11012 if (sop) sop = HV_OR_SCALARHV(sop);
11017 if (!((nop->op_flags & OPf_WANT) == OPf_WANT_VOID)) {
11018 while (nop && nop->op_next) {
11019 switch (nop->op_next->op_type) {
11024 lop = nop = nop->op_next;
11027 nop = nop->op_next;
11036 if ( (lop->op_flags & OPf_WANT) == OPf_WANT_VOID
11037 || o->op_type == OP_AND )
11038 fop->op_private |= OPpTRUEBOOL;
11039 else if (!(lop->op_flags & OPf_WANT))
11040 fop->op_private |= OPpMAYBE_TRUEBOOL;
11042 if ( (lop->op_flags & OPf_WANT) == OPf_WANT_VOID
11044 sop->op_private |= OPpTRUEBOOL;
11051 if ((fop = HV_OR_SCALARHV(cLOGOP->op_first)))
11052 fop->op_private |= OPpTRUEBOOL;
11053 #undef HV_OR_SCALARHV
11064 while (cLOGOP->op_other->op_type == OP_NULL)
11065 cLOGOP->op_other = cLOGOP->op_other->op_next;
11066 DEFER(cLOGOP->op_other);
11071 while (cLOOP->op_redoop->op_type == OP_NULL)
11072 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
11073 while (cLOOP->op_nextop->op_type == OP_NULL)
11074 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
11075 while (cLOOP->op_lastop->op_type == OP_NULL)
11076 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
11077 /* a while(1) loop doesn't have an op_next that escapes the
11078 * loop, so we have to explicitly follow the op_lastop to
11079 * process the rest of the code */
11080 DEFER(cLOOP->op_lastop);
11084 assert(!(cPMOP->op_pmflags & PMf_ONCE));
11085 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
11086 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
11087 cPMOP->op_pmstashstartu.op_pmreplstart
11088 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
11089 DEFER(cPMOP->op_pmstashstartu.op_pmreplstart);
11095 if (o->op_flags & OPf_STACKED) {
11097 cUNOPx(cLISTOP->op_first->op_sibling)->op_first;
11098 if (kid->op_type == OP_SCOPE
11099 || (kid->op_type == OP_NULL && kid->op_targ == OP_LEAVE))
11100 DEFER(kLISTOP->op_first);
11103 /* check that RHS of sort is a single plain array */
11104 oright = cUNOPo->op_first;
11105 if (!oright || oright->op_type != OP_PUSHMARK)
11108 if (o->op_private & OPpSORT_INPLACE)
11111 /* reverse sort ... can be optimised. */
11112 if (!cUNOPo->op_sibling) {
11113 /* Nothing follows us on the list. */
11114 OP * const reverse = o->op_next;
11116 if (reverse->op_type == OP_REVERSE &&
11117 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
11118 OP * const pushmark = cUNOPx(reverse)->op_first;
11119 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
11120 && (cUNOPx(pushmark)->op_sibling == o)) {
11121 /* reverse -> pushmark -> sort */
11122 o->op_private |= OPpSORT_REVERSE;
11124 pushmark->op_next = oright->op_next;
11134 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
11136 LISTOP *enter, *exlist;
11138 if (o->op_private & OPpSORT_INPLACE)
11141 enter = (LISTOP *) o->op_next;
11144 if (enter->op_type == OP_NULL) {
11145 enter = (LISTOP *) enter->op_next;
11149 /* for $a (...) will have OP_GV then OP_RV2GV here.
11150 for (...) just has an OP_GV. */
11151 if (enter->op_type == OP_GV) {
11152 gvop = (OP *) enter;
11153 enter = (LISTOP *) enter->op_next;
11156 if (enter->op_type == OP_RV2GV) {
11157 enter = (LISTOP *) enter->op_next;
11163 if (enter->op_type != OP_ENTERITER)
11166 iter = enter->op_next;
11167 if (!iter || iter->op_type != OP_ITER)
11170 expushmark = enter->op_first;
11171 if (!expushmark || expushmark->op_type != OP_NULL
11172 || expushmark->op_targ != OP_PUSHMARK)
11175 exlist = (LISTOP *) expushmark->op_sibling;
11176 if (!exlist || exlist->op_type != OP_NULL
11177 || exlist->op_targ != OP_LIST)
11180 if (exlist->op_last != o) {
11181 /* Mmm. Was expecting to point back to this op. */
11184 theirmark = exlist->op_first;
11185 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
11188 if (theirmark->op_sibling != o) {
11189 /* There's something between the mark and the reverse, eg
11190 for (1, reverse (...))
11195 ourmark = ((LISTOP *)o)->op_first;
11196 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
11199 ourlast = ((LISTOP *)o)->op_last;
11200 if (!ourlast || ourlast->op_next != o)
11203 rv2av = ourmark->op_sibling;
11204 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
11205 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
11206 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
11207 /* We're just reversing a single array. */
11208 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
11209 enter->op_flags |= OPf_STACKED;
11212 /* We don't have control over who points to theirmark, so sacrifice
11214 theirmark->op_next = ourmark->op_next;
11215 theirmark->op_flags = ourmark->op_flags;
11216 ourlast->op_next = gvop ? gvop : (OP *) enter;
11219 enter->op_private |= OPpITER_REVERSED;
11220 iter->op_private |= OPpITER_REVERSED;
11227 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
11228 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
11233 if (!(o->op_private & OPpOFFBYONE) && !CvCLONE(PL_compcv)) {
11235 if (CvEVAL(PL_compcv)) sv = &PL_sv_undef;
11237 sv = newRV((SV *)PL_compcv);
11241 o->op_type = OP_CONST;
11242 o->op_ppaddr = PL_ppaddr[OP_CONST];
11243 o->op_flags |= OPf_SPECIAL;
11244 cSVOPo->op_sv = sv;
11249 if (OP_GIMME(o,0) == G_VOID) {
11250 OP *right = cBINOP->op_first;
11252 OP *left = right->op_sibling;
11253 if (left->op_type == OP_SUBSTR
11254 && (left->op_private & 7) < 4) {
11256 cBINOP->op_first = left;
11257 right->op_sibling =
11258 cBINOPx(left)->op_first->op_sibling;
11259 cBINOPx(left)->op_first->op_sibling = right;
11260 left->op_private |= OPpSUBSTR_REPL_FIRST;
11262 (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
11269 Perl_cpeep_t cpeep =
11270 XopENTRY(Perl_custom_op_xop(aTHX_ o), xop_peep);
11272 cpeep(aTHX_ o, oldop);
11283 Perl_peep(pTHX_ register OP *o)
11289 =head1 Custom Operators
11291 =for apidoc Ao||custom_op_xop
11292 Return the XOP structure for a given custom op. This function should be
11293 considered internal to OP_NAME and the other access macros: use them instead.
11299 Perl_custom_op_xop(pTHX_ const OP *o)
11305 static const XOP xop_null = { 0, 0, 0, 0, 0 };
11307 PERL_ARGS_ASSERT_CUSTOM_OP_XOP;
11308 assert(o->op_type == OP_CUSTOM);
11310 /* This is wrong. It assumes a function pointer can be cast to IV,
11311 * which isn't guaranteed, but this is what the old custom OP code
11312 * did. In principle it should be safer to Copy the bytes of the
11313 * pointer into a PV: since the new interface is hidden behind
11314 * functions, this can be changed later if necessary. */
11315 /* Change custom_op_xop if this ever happens */
11316 keysv = sv_2mortal(newSViv(PTR2IV(o->op_ppaddr)));
11319 he = hv_fetch_ent(PL_custom_ops, keysv, 0, 0);
11321 /* assume noone will have just registered a desc */
11322 if (!he && PL_custom_op_names &&
11323 (he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0))
11328 /* XXX does all this need to be shared mem? */
11329 Newxz(xop, 1, XOP);
11330 pv = SvPV(HeVAL(he), l);
11331 XopENTRY_set(xop, xop_name, savepvn(pv, l));
11332 if (PL_custom_op_descs &&
11333 (he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0))
11335 pv = SvPV(HeVAL(he), l);
11336 XopENTRY_set(xop, xop_desc, savepvn(pv, l));
11338 Perl_custom_op_register(aTHX_ o->op_ppaddr, xop);
11342 if (!he) return &xop_null;
11344 xop = INT2PTR(XOP *, SvIV(HeVAL(he)));
11349 =for apidoc Ao||custom_op_register
11350 Register a custom op. See L<perlguts/"Custom Operators">.
11356 Perl_custom_op_register(pTHX_ Perl_ppaddr_t ppaddr, const XOP *xop)
11360 PERL_ARGS_ASSERT_CUSTOM_OP_REGISTER;
11362 /* see the comment in custom_op_xop */
11363 keysv = sv_2mortal(newSViv(PTR2IV(ppaddr)));
11365 if (!PL_custom_ops)
11366 PL_custom_ops = newHV();
11368 if (!hv_store_ent(PL_custom_ops, keysv, newSViv(PTR2IV(xop)), 0))
11369 Perl_croak(aTHX_ "panic: can't register custom OP %s", xop->xop_name);
11373 =head1 Functions in file op.c
11375 =for apidoc core_prototype
11376 This function assigns the prototype of the named core function to C<sv>, or
11377 to a new mortal SV if C<sv> is NULL. It returns the modified C<sv>, or
11378 NULL if the core function has no prototype. C<code> is a code as returned
11379 by C<keyword()>. It must not be equal to 0 or -KEY_CORE.
11385 Perl_core_prototype(pTHX_ SV *sv, const char *name, const int code,
11388 int i = 0, n = 0, seen_question = 0, defgv = 0;
11390 #define MAX_ARGS_OP ((sizeof(I32) - 1) * 2)
11391 char str[ MAX_ARGS_OP * 2 + 2 ]; /* One ';', one '\0' */
11392 bool nullret = FALSE;
11394 PERL_ARGS_ASSERT_CORE_PROTOTYPE;
11396 assert (code && code != -KEY_CORE);
11398 if (!sv) sv = sv_newmortal();
11400 #define retsetpvs(x,y) sv_setpvs(sv, x); if(opnum) *opnum=(y); return sv
11402 switch (code < 0 ? -code : code) {
11403 case KEY_and : case KEY_chop: case KEY_chomp:
11404 case KEY_cmp : case KEY_defined: case KEY_delete: case KEY_exec :
11405 case KEY_exists: case KEY_eq : case KEY_ge : case KEY_goto :
11406 case KEY_grep : case KEY_gt : case KEY_last : case KEY_le :
11407 case KEY_lt : case KEY_map : case KEY_ne : case KEY_next :
11408 case KEY_or : case KEY_print : case KEY_printf: case KEY_qr :
11409 case KEY_redo : case KEY_require: case KEY_return: case KEY_say :
11410 case KEY_select: case KEY_sort : case KEY_split : case KEY_system:
11411 case KEY_x : case KEY_xor :
11412 if (!opnum) return NULL; nullret = TRUE; goto findopnum;
11413 case KEY_glob: retsetpvs("_;", OP_GLOB);
11414 case KEY_keys: retsetpvs("+", OP_KEYS);
11415 case KEY_values: retsetpvs("+", OP_VALUES);
11416 case KEY_each: retsetpvs("+", OP_EACH);
11417 case KEY_push: retsetpvs("+@", OP_PUSH);
11418 case KEY_unshift: retsetpvs("+@", OP_UNSHIFT);
11419 case KEY_pop: retsetpvs(";+", OP_POP);
11420 case KEY_shift: retsetpvs(";+", OP_SHIFT);
11421 case KEY_pos: retsetpvs(";\\[$*]", OP_POS);
11423 retsetpvs("+;$$@", OP_SPLICE);
11424 case KEY___FILE__: case KEY___LINE__: case KEY___PACKAGE__:
11426 case KEY_evalbytes:
11427 name = "entereval"; break;
11435 while (i < MAXO) { /* The slow way. */
11436 if (strEQ(name, PL_op_name[i])
11437 || strEQ(name, PL_op_desc[i]))
11439 if (nullret) { assert(opnum); *opnum = i; return NULL; }
11446 defgv = PL_opargs[i] & OA_DEFGV;
11447 oa = PL_opargs[i] >> OASHIFT;
11449 if (oa & OA_OPTIONAL && !seen_question && (
11450 !defgv || (oa & (OA_OPTIONAL - 1)) == OA_FILEREF
11455 if ((oa & (OA_OPTIONAL - 1)) >= OA_AVREF
11456 && (oa & (OA_OPTIONAL - 1)) <= OA_SCALARREF
11457 /* But globs are already references (kinda) */
11458 && (oa & (OA_OPTIONAL - 1)) != OA_FILEREF
11462 if ((oa & (OA_OPTIONAL - 1)) == OA_SCALARREF
11463 && !scalar_mod_type(NULL, i)) {
11468 if (i == OP_LOCK || i == OP_UNDEF) str[n++] = '&';
11472 else str[n++] = ("?$@@%&*$")[oa & (OA_OPTIONAL - 1)];
11473 if (oa & OA_OPTIONAL && defgv && str[n-1] == '$') {
11474 str[n-1] = '_'; defgv = 0;
11478 if (code == -KEY_not || code == -KEY_getprotobynumber) str[n++] = ';';
11480 sv_setpvn(sv, str, n - 1);
11481 if (opnum) *opnum = i;
11486 Perl_coresub_op(pTHX_ SV * const coreargssv, const int code,
11489 OP * const argop = newSVOP(OP_COREARGS,0,coreargssv);
11492 PERL_ARGS_ASSERT_CORESUB_OP;
11496 return op_append_elem(OP_LINESEQ,
11499 newSVOP(OP_CONST, 0, newSViv(-code % 3)),
11503 case OP_SELECT: /* which represents OP_SSELECT as well */
11508 newAVREF(newGVOP(OP_GV, 0, PL_defgv)),
11509 newSVOP(OP_CONST, 0, newSVuv(1))
11511 coresub_op(newSVuv((UV)OP_SSELECT), 0,
11513 coresub_op(coreargssv, 0, OP_SELECT)
11517 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
11519 return op_append_elem(
11522 opnum == OP_WANTARRAY || opnum == OP_RUNCV
11523 ? OPpOFFBYONE << 8 : 0)
11525 case OA_BASEOP_OR_UNOP:
11526 if (opnum == OP_ENTEREVAL) {
11527 o = newUNOP(OP_ENTEREVAL,OPpEVAL_COPHH<<8,argop);
11528 if (code == -KEY_evalbytes) o->op_private |= OPpEVAL_BYTES;
11530 else o = newUNOP(opnum,0,argop);
11531 if (opnum == OP_CALLER) o->op_private |= OPpOFFBYONE;
11534 if (is_handle_constructor(o, 1))
11535 argop->op_private |= OPpCOREARGS_DEREF1;
11536 if (scalar_mod_type(NULL, opnum))
11537 argop->op_private |= OPpCOREARGS_SCALARMOD;
11541 o = convert(opnum,OPf_SPECIAL*(opnum == OP_GLOB),argop);
11542 if (is_handle_constructor(o, 2))
11543 argop->op_private |= OPpCOREARGS_DEREF2;
11544 if (opnum == OP_SUBSTR) {
11545 o->op_private |= OPpMAYBE_LVSUB;
11554 Perl_report_redefined_cv(pTHX_ const SV *name, const CV *old_cv,
11555 SV * const *new_const_svp)
11557 const char *hvname;
11558 bool is_const = !!CvCONST(old_cv);
11559 SV *old_const_sv = is_const ? cv_const_sv(old_cv) : NULL;
11561 PERL_ARGS_ASSERT_REPORT_REDEFINED_CV;
11563 if (is_const && new_const_svp && old_const_sv == *new_const_svp)
11565 /* They are 2 constant subroutines generated from
11566 the same constant. This probably means that
11567 they are really the "same" proxy subroutine
11568 instantiated in 2 places. Most likely this is
11569 when a constant is exported twice. Don't warn.
11572 (ckWARN(WARN_REDEFINE)
11574 CvGV(old_cv) && GvSTASH(CvGV(old_cv))
11575 && HvNAMELEN(GvSTASH(CvGV(old_cv))) == 7
11576 && (hvname = HvNAME(GvSTASH(CvGV(old_cv))),
11577 strEQ(hvname, "autouse"))
11581 && ckWARN_d(WARN_REDEFINE)
11582 && (!new_const_svp || sv_cmp(old_const_sv, *new_const_svp))
11585 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
11587 ? "Constant subroutine %"SVf" redefined"
11588 : "Subroutine %"SVf" redefined",
11593 =head1 Hook manipulation
11595 These functions provide convenient and thread-safe means of manipulating
11602 =for apidoc Am|void|wrap_op_checker|Optype opcode|Perl_check_t new_checker|Perl_check_t *old_checker_p
11604 Puts a C function into the chain of check functions for a specified op
11605 type. This is the preferred way to manipulate the L</PL_check> array.
11606 I<opcode> specifies which type of op is to be affected. I<new_checker>
11607 is a pointer to the C function that is to be added to that opcode's
11608 check chain, and I<old_checker_p> points to the storage location where a
11609 pointer to the next function in the chain will be stored. The value of
11610 I<new_pointer> is written into the L</PL_check> array, while the value
11611 previously stored there is written to I<*old_checker_p>.
11613 L</PL_check> is global to an entire process, and a module wishing to
11614 hook op checking may find itself invoked more than once per process,
11615 typically in different threads. To handle that situation, this function
11616 is idempotent. The location I<*old_checker_p> must initially (once
11617 per process) contain a null pointer. A C variable of static duration
11618 (declared at file scope, typically also marked C<static> to give
11619 it internal linkage) will be implicitly initialised appropriately,
11620 if it does not have an explicit initialiser. This function will only
11621 actually modify the check chain if it finds I<*old_checker_p> to be null.
11622 This function is also thread safe on the small scale. It uses appropriate
11623 locking to avoid race conditions in accessing L</PL_check>.
11625 When this function is called, the function referenced by I<new_checker>
11626 must be ready to be called, except for I<*old_checker_p> being unfilled.
11627 In a threading situation, I<new_checker> may be called immediately,
11628 even before this function has returned. I<*old_checker_p> will always
11629 be appropriately set before I<new_checker> is called. If I<new_checker>
11630 decides not to do anything special with an op that it is given (which
11631 is the usual case for most uses of op check hooking), it must chain the
11632 check function referenced by I<*old_checker_p>.
11634 If you want to influence compilation of calls to a specific subroutine,
11635 then use L</cv_set_call_checker> rather than hooking checking of all
11642 Perl_wrap_op_checker(pTHX_ Optype opcode,
11643 Perl_check_t new_checker, Perl_check_t *old_checker_p)
11647 PERL_ARGS_ASSERT_WRAP_OP_CHECKER;
11648 if (*old_checker_p) return;
11649 OP_CHECK_MUTEX_LOCK;
11650 if (!*old_checker_p) {
11651 *old_checker_p = PL_check[opcode];
11652 PL_check[opcode] = new_checker;
11654 OP_CHECK_MUTEX_UNLOCK;
11659 /* Efficient sub that returns a constant scalar value. */
11661 const_sv_xsub(pTHX_ CV* cv)
11665 SV *const sv = MUTABLE_SV(XSANY.any_ptr);
11669 /* diag_listed_as: SKIPME */
11670 Perl_croak(aTHX_ "usage: %s::%s()",
11671 HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
11684 * c-indentation-style: bsd
11685 * c-basic-offset: 4
11686 * indent-tabs-mode: nil
11689 * ex: set ts=8 sts=4 sw=4 et: