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) {
307 PerlMemShared_free(op);
312 /* If this op is already freed, our refcount will get screwy. */
313 assert(o->op_type != OP_FREED);
314 o->op_type = OP_FREED;
315 o->op_next = slab->opslab_freed;
316 slab->opslab_freed = o;
317 DEBUG_S_warn((aTHX_ "free op at %p, recorded in slab %p", o, slab));
318 OpslabREFCNT_dec_padok(slab);
322 Perl_opslab_free_nopad(pTHX_ OPSLAB *slab)
325 const bool havepad = !!PL_comppad;
326 PERL_ARGS_ASSERT_OPSLAB_FREE_NOPAD;
329 PAD_SAVE_SETNULLPAD();
336 Perl_opslab_free(pTHX_ OPSLAB *slab)
340 PERL_ARGS_ASSERT_OPSLAB_FREE;
341 DEBUG_S_warn((aTHX_ "freeing slab %p", slab));
342 assert(slab->opslab_refcnt == 1);
343 for (; slab; slab = slab2) {
344 slab2 = slab->opslab_next;
346 slab->opslab_refcnt = ~(size_t)0;
348 #ifdef PERL_DEBUG_READONLY_OPS
349 DEBUG_m(PerlIO_printf(Perl_debug_log, "Deallocate slab at %p\n",
351 if (munmap(slab, slab->opslab_size * sizeof(I32 *))) {
352 perror("munmap failed");
356 PerlMemShared_free(slab);
362 Perl_opslab_force_free(pTHX_ OPSLAB *slab)
367 size_t savestack_count = 0;
369 PERL_ARGS_ASSERT_OPSLAB_FORCE_FREE;
372 for (slot = slab2->opslab_first;
374 slot = slot->opslot_next) {
375 if (slot->opslot_op.op_type != OP_FREED
376 && !(slot->opslot_op.op_savefree
382 assert(slot->opslot_op.op_slabbed);
383 op_free(&slot->opslot_op);
384 if (slab->opslab_refcnt == 1) 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);
393 /* Remove the CV’s reference count. */
394 slab->opslab_refcnt--;
401 #ifdef PERL_DEBUG_READONLY_OPS
403 Perl_op_refcnt_inc(pTHX_ OP *o)
406 OPSLAB *const slab = o->op_slabbed ? OpSLAB(o) : NULL;
407 if (slab && slab->opslab_readonly) {
420 Perl_op_refcnt_dec(pTHX_ OP *o)
423 OPSLAB *const slab = o->op_slabbed ? OpSLAB(o) : NULL;
425 PERL_ARGS_ASSERT_OP_REFCNT_DEC;
427 if (slab && slab->opslab_readonly) {
429 result = --o->op_targ;
432 result = --o->op_targ;
438 * In the following definition, the ", (OP*)0" is just to make the compiler
439 * think the expression is of the right type: croak actually does a Siglongjmp.
441 #define CHECKOP(type,o) \
442 ((PL_op_mask && PL_op_mask[type]) \
443 ? ( op_free((OP*)o), \
444 Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \
446 : PL_check[type](aTHX_ (OP*)o))
448 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
450 #define CHANGE_TYPE(o,type) \
452 o->op_type = (OPCODE)type; \
453 o->op_ppaddr = PL_ppaddr[type]; \
457 S_gv_ename(pTHX_ GV *gv)
459 SV* const tmpsv = sv_newmortal();
461 PERL_ARGS_ASSERT_GV_ENAME;
463 gv_efullname3(tmpsv, gv, NULL);
468 S_no_fh_allowed(pTHX_ OP *o)
470 PERL_ARGS_ASSERT_NO_FH_ALLOWED;
472 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
478 S_too_few_arguments_sv(pTHX_ OP *o, SV *namesv, U32 flags)
480 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS_SV;
481 yyerror_pv(Perl_form(aTHX_ "Not enough arguments for %"SVf, namesv),
482 SvUTF8(namesv) | flags);
487 S_too_few_arguments_pv(pTHX_ OP *o, const char* name, U32 flags)
489 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS_PV;
490 yyerror_pv(Perl_form(aTHX_ "Not enough arguments for %s", name), flags);
495 S_too_many_arguments_pv(pTHX_ OP *o, const char *name, U32 flags)
497 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS_PV;
499 yyerror_pv(Perl_form(aTHX_ "Too many arguments for %s", name), flags);
504 S_too_many_arguments_sv(pTHX_ OP *o, SV *namesv, U32 flags)
506 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS_SV;
508 yyerror_pv(Perl_form(aTHX_ "Too many arguments for %"SVf, SVfARG(namesv)),
509 SvUTF8(namesv) | flags);
514 S_bad_type_pv(pTHX_ I32 n, const char *t, const char *name, U32 flags, const OP *kid)
516 PERL_ARGS_ASSERT_BAD_TYPE_PV;
518 yyerror_pv(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
519 (int)n, name, t, OP_DESC(kid)), flags);
523 S_bad_type_sv(pTHX_ I32 n, const char *t, SV *namesv, U32 flags, const OP *kid)
525 PERL_ARGS_ASSERT_BAD_TYPE_SV;
527 yyerror_pv(Perl_form(aTHX_ "Type of arg %d to %"SVf" must be %s (not %s)",
528 (int)n, SVfARG(namesv), t, OP_DESC(kid)), SvUTF8(namesv) | flags);
532 S_no_bareword_allowed(pTHX_ OP *o)
534 PERL_ARGS_ASSERT_NO_BAREWORD_ALLOWED;
537 return; /* various ok barewords are hidden in extra OP_NULL */
538 qerror(Perl_mess(aTHX_
539 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
541 o->op_private &= ~OPpCONST_STRICT; /* prevent warning twice about the same OP */
544 /* "register" allocation */
547 Perl_allocmy(pTHX_ const char *const name, const STRLEN len, const U32 flags)
551 const bool is_our = (PL_parser->in_my == KEY_our);
553 PERL_ARGS_ASSERT_ALLOCMY;
555 if (flags & ~SVf_UTF8)
556 Perl_croak(aTHX_ "panic: allocmy illegal flag bits 0x%" UVxf,
559 /* Until we're using the length for real, cross check that we're being
561 assert(strlen(name) == len);
563 /* complain about "my $<special_var>" etc etc */
567 ((flags & SVf_UTF8) && isIDFIRST_utf8((U8 *)name+1)) ||
568 (name[1] == '_' && (*name == '$' || len > 2))))
570 /* name[2] is true if strlen(name) > 2 */
571 if (!(flags & SVf_UTF8 && UTF8_IS_START(name[1]))
572 && (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1]))) {
573 yyerror(Perl_form(aTHX_ "Can't use global %c^%c%.*s in \"%s\"",
574 name[0], toCTRL(name[1]), (int)(len - 2), name + 2,
575 PL_parser->in_my == KEY_state ? "state" : "my"));
577 yyerror_pv(Perl_form(aTHX_ "Can't use global %.*s in \"%s\"", (int) len, name,
578 PL_parser->in_my == KEY_state ? "state" : "my"), flags & SVf_UTF8);
581 else if (len == 2 && name[1] == '_' && !is_our)
582 /* diag_listed_as: Use of my $_ is experimental */
583 Perl_ck_warner_d(aTHX_ packWARN(WARN_EXPERIMENTAL__LEXICAL_TOPIC),
584 "Use of %s $_ is experimental",
585 PL_parser->in_my == KEY_state
589 /* allocate a spare slot and store the name in that slot */
591 off = pad_add_name_pvn(name, len,
592 (is_our ? padadd_OUR :
593 PL_parser->in_my == KEY_state ? padadd_STATE : 0)
594 | ( flags & SVf_UTF8 ? SVf_UTF8 : 0 ),
595 PL_parser->in_my_stash,
597 /* $_ is always in main::, even with our */
598 ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash)
602 /* anon sub prototypes contains state vars should always be cloned,
603 * otherwise the state var would be shared between anon subs */
605 if (PL_parser->in_my == KEY_state && CvANON(PL_compcv))
606 CvCLONE_on(PL_compcv);
612 =for apidoc alloccopstash
614 Available only under threaded builds, this function allocates an entry in
615 C<PL_stashpad> for the stash passed to it.
622 Perl_alloccopstash(pTHX_ HV *hv)
624 PADOFFSET off = 0, o = 1;
625 bool found_slot = FALSE;
627 PERL_ARGS_ASSERT_ALLOCCOPSTASH;
629 if (PL_stashpad[PL_stashpadix] == hv) return PL_stashpadix;
631 for (; o < PL_stashpadmax; ++o) {
632 if (PL_stashpad[o] == hv) return PL_stashpadix = o;
633 if (!PL_stashpad[o] || SvTYPE(PL_stashpad[o]) != SVt_PVHV)
634 found_slot = TRUE, off = o;
637 Renew(PL_stashpad, PL_stashpadmax + 10, HV *);
638 Zero(PL_stashpad + PL_stashpadmax, 10, HV *);
639 off = PL_stashpadmax;
640 PL_stashpadmax += 10;
643 PL_stashpad[PL_stashpadix = off] = hv;
648 /* free the body of an op without examining its contents.
649 * Always use this rather than FreeOp directly */
652 S_op_destroy(pTHX_ OP *o)
660 Perl_op_free(pTHX_ OP *o)
665 /* Though ops may be freed twice, freeing the op after its slab is a
667 assert(!o || !o->op_slabbed || OpSLAB(o)->opslab_refcnt != ~(size_t)0);
668 /* During the forced freeing of ops after compilation failure, kidops
669 may be freed before their parents. */
670 if (!o || o->op_type == OP_FREED)
674 if (o->op_private & OPpREFCOUNTED) {
685 refcnt = OpREFCNT_dec(o);
688 /* Need to find and remove any pattern match ops from the list
689 we maintain for reset(). */
690 find_and_forget_pmops(o);
700 /* Call the op_free hook if it has been set. Do it now so that it's called
701 * at the right time for refcounted ops, but still before all of the kids
705 if (o->op_flags & OPf_KIDS) {
707 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
708 nextkid = kid->op_sibling; /* Get before next freeing kid */
713 type = (OPCODE)o->op_targ;
716 Slab_to_rw(OpSLAB(o));
719 /* COP* is not cleared by op_clear() so that we may track line
720 * numbers etc even after null() */
721 if (type == OP_NEXTSTATE || type == OP_DBSTATE) {
727 #ifdef DEBUG_LEAKING_SCALARS
734 Perl_op_clear(pTHX_ OP *o)
739 PERL_ARGS_ASSERT_OP_CLEAR;
742 mad_free(o->op_madprop);
747 switch (o->op_type) {
748 case OP_NULL: /* Was holding old type, if any. */
749 if (PL_madskills && o->op_targ != OP_NULL) {
750 o->op_type = (Optype)o->op_targ;
755 case OP_ENTEREVAL: /* Was holding hints. */
759 if (!(o->op_flags & OPf_REF)
760 || (PL_check[o->op_type] != Perl_ck_ftst))
767 GV *gv = (o->op_type == OP_GV || o->op_type == OP_GVSV)
772 /* It's possible during global destruction that the GV is freed
773 before the optree. Whilst the SvREFCNT_inc is happy to bump from
774 0 to 1 on a freed SV, the corresponding SvREFCNT_dec from 1 to 0
775 will trigger an assertion failure, because the entry to sv_clear
776 checks that the scalar is not already freed. A check of for
777 !SvIS_FREED(gv) turns out to be invalid, because during global
778 destruction the reference count can be forced down to zero
779 (with SVf_BREAK set). In which case raising to 1 and then
780 dropping to 0 triggers cleanup before it should happen. I
781 *think* that this might actually be a general, systematic,
782 weakness of the whole idea of SVf_BREAK, in that code *is*
783 allowed to raise and lower references during global destruction,
784 so any *valid* code that happens to do this during global
785 destruction might well trigger premature cleanup. */
786 bool still_valid = gv && SvREFCNT(gv);
789 SvREFCNT_inc_simple_void(gv);
791 if (cPADOPo->op_padix > 0) {
792 /* No GvIN_PAD_off(cGVOPo_gv) here, because other references
793 * may still exist on the pad */
794 pad_swipe(cPADOPo->op_padix, TRUE);
795 cPADOPo->op_padix = 0;
798 SvREFCNT_dec(cSVOPo->op_sv);
799 cSVOPo->op_sv = NULL;
802 int try_downgrade = SvREFCNT(gv) == 2;
805 gv_try_downgrade(gv);
809 case OP_METHOD_NAMED:
812 SvREFCNT_dec(cSVOPo->op_sv);
813 cSVOPo->op_sv = NULL;
816 Even if op_clear does a pad_free for the target of the op,
817 pad_free doesn't actually remove the sv that exists in the pad;
818 instead it lives on. This results in that it could be reused as
819 a target later on when the pad was reallocated.
822 pad_swipe(o->op_targ,1);
832 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
837 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
838 assert(o->op_type == OP_TRANS || o->op_type == OP_TRANSR);
840 if (cPADOPo->op_padix > 0) {
841 pad_swipe(cPADOPo->op_padix, TRUE);
842 cPADOPo->op_padix = 0;
845 SvREFCNT_dec(cSVOPo->op_sv);
846 cSVOPo->op_sv = NULL;
850 PerlMemShared_free(cPVOPo->op_pv);
851 cPVOPo->op_pv = NULL;
855 op_free(cPMOPo->op_pmreplrootu.op_pmreplroot);
859 if (cPMOPo->op_pmreplrootu.op_pmtargetoff) {
860 /* No GvIN_PAD_off here, because other references may still
861 * exist on the pad */
862 pad_swipe(cPMOPo->op_pmreplrootu.op_pmtargetoff, TRUE);
865 SvREFCNT_dec(MUTABLE_SV(cPMOPo->op_pmreplrootu.op_pmtargetgv));
871 if (!(cPMOPo->op_pmflags & PMf_CODELIST_PRIVATE))
872 op_free(cPMOPo->op_code_list);
873 cPMOPo->op_code_list = NULL;
875 cPMOPo->op_pmreplrootu.op_pmreplroot = NULL;
876 /* we use the same protection as the "SAFE" version of the PM_ macros
877 * here since sv_clean_all might release some PMOPs
878 * after PL_regex_padav has been cleared
879 * and the clearing of PL_regex_padav needs to
880 * happen before sv_clean_all
883 if(PL_regex_pad) { /* We could be in destruction */
884 const IV offset = (cPMOPo)->op_pmoffset;
885 ReREFCNT_dec(PM_GETRE(cPMOPo));
886 PL_regex_pad[offset] = &PL_sv_undef;
887 sv_catpvn_nomg(PL_regex_pad[0], (const char *)&offset,
891 ReREFCNT_dec(PM_GETRE(cPMOPo));
892 PM_SETRE(cPMOPo, NULL);
898 if (o->op_targ > 0) {
899 pad_free(o->op_targ);
905 S_cop_free(pTHX_ COP* cop)
907 PERL_ARGS_ASSERT_COP_FREE;
910 if (! specialWARN(cop->cop_warnings))
911 PerlMemShared_free(cop->cop_warnings);
912 cophh_free(CopHINTHASH_get(cop));
916 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);
952 S_find_and_forget_pmops(pTHX_ OP *o)
954 PERL_ARGS_ASSERT_FIND_AND_FORGET_PMOPS;
956 if (o->op_flags & OPf_KIDS) {
957 OP *kid = cUNOPo->op_first;
959 switch (kid->op_type) {
964 forget_pmop((PMOP*)kid);
966 find_and_forget_pmops(kid);
967 kid = kid->op_sibling;
973 Perl_op_null(pTHX_ OP *o)
977 PERL_ARGS_ASSERT_OP_NULL;
979 if (o->op_type == OP_NULL)
983 o->op_targ = o->op_type;
984 o->op_type = OP_NULL;
985 o->op_ppaddr = PL_ppaddr[OP_NULL];
989 Perl_op_refcnt_lock(pTHX)
997 Perl_op_refcnt_unlock(pTHX)
1000 PERL_UNUSED_CONTEXT;
1004 /* Contextualizers */
1007 =for apidoc Am|OP *|op_contextualize|OP *o|I32 context
1009 Applies a syntactic context to an op tree representing an expression.
1010 I<o> is the op tree, and I<context> must be C<G_SCALAR>, C<G_ARRAY>,
1011 or C<G_VOID> to specify the context to apply. The modified op tree
1018 Perl_op_contextualize(pTHX_ OP *o, I32 context)
1020 PERL_ARGS_ASSERT_OP_CONTEXTUALIZE;
1022 case G_SCALAR: return scalar(o);
1023 case G_ARRAY: return list(o);
1024 case G_VOID: return scalarvoid(o);
1026 Perl_croak(aTHX_ "panic: op_contextualize bad context %ld",
1033 =head1 Optree Manipulation Functions
1035 =for apidoc Am|OP*|op_linklist|OP *o
1036 This function is the implementation of the L</LINKLIST> macro. It should
1037 not be called directly.
1043 Perl_op_linklist(pTHX_ OP *o)
1047 PERL_ARGS_ASSERT_OP_LINKLIST;
1052 /* establish postfix order */
1053 first = cUNOPo->op_first;
1056 o->op_next = LINKLIST(first);
1059 if (kid->op_sibling) {
1060 kid->op_next = LINKLIST(kid->op_sibling);
1061 kid = kid->op_sibling;
1075 S_scalarkids(pTHX_ OP *o)
1077 if (o && o->op_flags & OPf_KIDS) {
1079 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1086 S_scalarboolean(pTHX_ OP *o)
1090 PERL_ARGS_ASSERT_SCALARBOOLEAN;
1092 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST
1093 && !(cBINOPo->op_first->op_flags & OPf_SPECIAL)) {
1094 if (ckWARN(WARN_SYNTAX)) {
1095 const line_t oldline = CopLINE(PL_curcop);
1097 if (PL_parser && PL_parser->copline != NOLINE) {
1098 /* This ensures that warnings are reported at the first line
1099 of the conditional, not the last. */
1100 CopLINE_set(PL_curcop, PL_parser->copline);
1102 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
1103 CopLINE_set(PL_curcop, oldline);
1110 Perl_scalar(pTHX_ OP *o)
1115 /* assumes no premature commitment */
1116 if (!o || (PL_parser && PL_parser->error_count)
1117 || (o->op_flags & OPf_WANT)
1118 || o->op_type == OP_RETURN)
1123 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
1125 switch (o->op_type) {
1127 scalar(cBINOPo->op_first);
1132 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1142 if (o->op_flags & OPf_KIDS) {
1143 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1149 kid = cLISTOPo->op_first;
1151 kid = kid->op_sibling;
1154 OP *sib = kid->op_sibling;
1155 if (sib && kid->op_type != OP_LEAVEWHEN)
1161 PL_curcop = &PL_compiling;
1166 kid = cLISTOPo->op_first;
1169 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
1176 Perl_scalarvoid(pTHX_ OP *o)
1180 SV *useless_sv = NULL;
1181 const char* useless = NULL;
1185 PERL_ARGS_ASSERT_SCALARVOID;
1187 /* trailing mad null ops don't count as "there" for void processing */
1189 o->op_type != OP_NULL &&
1191 o->op_sibling->op_type == OP_NULL)
1194 for (sib = o->op_sibling;
1195 sib && sib->op_type == OP_NULL;
1196 sib = sib->op_sibling) ;
1202 if (o->op_type == OP_NEXTSTATE
1203 || o->op_type == OP_DBSTATE
1204 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1205 || o->op_targ == OP_DBSTATE)))
1206 PL_curcop = (COP*)o; /* for warning below */
1208 /* assumes no premature commitment */
1209 want = o->op_flags & OPf_WANT;
1210 if ((want && want != OPf_WANT_SCALAR)
1211 || (PL_parser && PL_parser->error_count)
1212 || o->op_type == OP_RETURN || o->op_type == OP_REQUIRE || o->op_type == OP_LEAVEWHEN)
1217 if ((o->op_private & OPpTARGET_MY)
1218 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1220 return scalar(o); /* As if inside SASSIGN */
1223 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1225 switch (o->op_type) {
1227 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1231 if (o->op_flags & OPf_STACKED)
1235 if (o->op_private == 4)
1260 case OP_AELEMFAST_LEX:
1279 case OP_GETSOCKNAME:
1280 case OP_GETPEERNAME:
1285 case OP_GETPRIORITY:
1310 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1311 /* Otherwise it's "Useless use of grep iterator" */
1312 useless = OP_DESC(o);
1316 kid = cLISTOPo->op_first;
1317 if (kid && kid->op_type == OP_PUSHRE
1319 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetoff)
1321 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetgv)
1323 useless = OP_DESC(o);
1327 kid = cUNOPo->op_first;
1328 if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST &&
1329 kid->op_type != OP_TRANS && kid->op_type != OP_TRANSR) {
1332 useless = "negative pattern binding (!~)";
1336 if (cPMOPo->op_pmflags & PMf_NONDESTRUCT)
1337 useless = "non-destructive substitution (s///r)";
1341 useless = "non-destructive transliteration (tr///r)";
1348 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1349 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1350 useless = "a variable";
1355 if (cSVOPo->op_private & OPpCONST_STRICT)
1356 no_bareword_allowed(o);
1358 if (ckWARN(WARN_VOID)) {
1359 /* don't warn on optimised away booleans, eg
1360 * use constant Foo, 5; Foo || print; */
1361 if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT)
1363 /* the constants 0 and 1 are permitted as they are
1364 conventionally used as dummies in constructs like
1365 1 while some_condition_with_side_effects; */
1366 else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1368 else if (SvPOK(sv)) {
1369 /* perl4's way of mixing documentation and code
1370 (before the invention of POD) was based on a
1371 trick to mix nroff and perl code. The trick was
1372 built upon these three nroff macros being used in
1373 void context. The pink camel has the details in
1374 the script wrapman near page 319. */
1375 const char * const maybe_macro = SvPVX_const(sv);
1376 if (strnEQ(maybe_macro, "di", 2) ||
1377 strnEQ(maybe_macro, "ds", 2) ||
1378 strnEQ(maybe_macro, "ig", 2))
1381 SV * const dsv = newSVpvs("");
1383 = Perl_newSVpvf(aTHX_
1385 pv_pretty(dsv, maybe_macro,
1386 SvCUR(sv), 32, NULL, NULL,
1388 | PERL_PV_ESCAPE_NOCLEAR
1389 | PERL_PV_ESCAPE_UNI_DETECT));
1390 SvREFCNT_dec_NN(dsv);
1393 else if (SvOK(sv)) {
1394 useless_sv = Perl_newSVpvf(aTHX_ "a constant (%"SVf")", sv);
1397 useless = "a constant (undef)";
1400 op_null(o); /* don't execute or even remember it */
1404 o->op_type = OP_PREINC; /* pre-increment is faster */
1405 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1409 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1410 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1414 o->op_type = OP_I_PREINC; /* pre-increment is faster */
1415 o->op_ppaddr = PL_ppaddr[OP_I_PREINC];
1419 o->op_type = OP_I_PREDEC; /* pre-decrement is faster */
1420 o->op_ppaddr = PL_ppaddr[OP_I_PREDEC];
1425 UNOP *refgen, *rv2cv;
1428 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
1431 rv2gv = ((BINOP *)o)->op_last;
1432 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
1435 refgen = (UNOP *)((BINOP *)o)->op_first;
1437 if (!refgen || refgen->op_type != OP_REFGEN)
1440 exlist = (LISTOP *)refgen->op_first;
1441 if (!exlist || exlist->op_type != OP_NULL
1442 || exlist->op_targ != OP_LIST)
1445 if (exlist->op_first->op_type != OP_PUSHMARK)
1448 rv2cv = (UNOP*)exlist->op_last;
1450 if (rv2cv->op_type != OP_RV2CV)
1453 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
1454 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
1455 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
1457 o->op_private |= OPpASSIGN_CV_TO_GV;
1458 rv2gv->op_private |= OPpDONT_INIT_GV;
1459 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
1471 kid = cLOGOPo->op_first;
1472 if (kid->op_type == OP_NOT
1473 && (kid->op_flags & OPf_KIDS)
1475 if (o->op_type == OP_AND) {
1477 o->op_ppaddr = PL_ppaddr[OP_OR];
1479 o->op_type = OP_AND;
1480 o->op_ppaddr = PL_ppaddr[OP_AND];
1489 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1494 if (o->op_flags & OPf_STACKED)
1501 if (!(o->op_flags & OPf_KIDS))
1512 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1523 /* mortalise it, in case warnings are fatal. */
1524 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
1525 "Useless use of %"SVf" in void context",
1526 sv_2mortal(useless_sv));
1529 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
1530 "Useless use of %s in void context",
1537 S_listkids(pTHX_ OP *o)
1539 if (o && o->op_flags & OPf_KIDS) {
1541 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1548 Perl_list(pTHX_ OP *o)
1553 /* assumes no premature commitment */
1554 if (!o || (o->op_flags & OPf_WANT)
1555 || (PL_parser && PL_parser->error_count)
1556 || o->op_type == OP_RETURN)
1561 if ((o->op_private & OPpTARGET_MY)
1562 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1564 return o; /* As if inside SASSIGN */
1567 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1569 switch (o->op_type) {
1572 list(cBINOPo->op_first);
1577 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1585 if (!(o->op_flags & OPf_KIDS))
1587 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1588 list(cBINOPo->op_first);
1589 return gen_constant_list(o);
1596 kid = cLISTOPo->op_first;
1598 kid = kid->op_sibling;
1601 OP *sib = kid->op_sibling;
1602 if (sib && kid->op_type != OP_LEAVEWHEN)
1608 PL_curcop = &PL_compiling;
1612 kid = cLISTOPo->op_first;
1619 S_scalarseq(pTHX_ OP *o)
1623 const OPCODE type = o->op_type;
1625 if (type == OP_LINESEQ || type == OP_SCOPE ||
1626 type == OP_LEAVE || type == OP_LEAVETRY)
1629 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1630 if (kid->op_sibling) {
1634 PL_curcop = &PL_compiling;
1636 o->op_flags &= ~OPf_PARENS;
1637 if (PL_hints & HINT_BLOCK_SCOPE)
1638 o->op_flags |= OPf_PARENS;
1641 o = newOP(OP_STUB, 0);
1646 S_modkids(pTHX_ OP *o, I32 type)
1648 if (o && o->op_flags & OPf_KIDS) {
1650 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1651 op_lvalue(kid, type);
1657 =for apidoc finalize_optree
1659 This function finalizes the optree. Should be called directly after
1660 the complete optree is built. It does some additional
1661 checking which can't be done in the normal ck_xxx functions and makes
1662 the tree thread-safe.
1667 Perl_finalize_optree(pTHX_ OP* o)
1669 PERL_ARGS_ASSERT_FINALIZE_OPTREE;
1672 SAVEVPTR(PL_curcop);
1680 S_finalize_op(pTHX_ OP* o)
1682 PERL_ARGS_ASSERT_FINALIZE_OP;
1684 #if defined(PERL_MAD) && defined(USE_ITHREADS)
1686 /* Make sure mad ops are also thread-safe */
1687 MADPROP *mp = o->op_madprop;
1689 if (mp->mad_type == MAD_OP && mp->mad_vlen) {
1690 OP *prop_op = (OP *) mp->mad_val;
1691 /* We only need "Relocate sv to the pad for thread safety.", but this
1692 easiest way to make sure it traverses everything */
1693 if (prop_op->op_type == OP_CONST)
1694 cSVOPx(prop_op)->op_private &= ~OPpCONST_STRICT;
1695 finalize_op(prop_op);
1702 switch (o->op_type) {
1705 PL_curcop = ((COP*)o); /* for warnings */
1709 && (o->op_sibling->op_type == OP_NEXTSTATE || o->op_sibling->op_type == OP_DBSTATE)
1710 && ckWARN(WARN_SYNTAX))
1712 if (o->op_sibling->op_sibling) {
1713 const OPCODE type = o->op_sibling->op_sibling->op_type;
1714 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
1715 const line_t oldline = CopLINE(PL_curcop);
1716 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_sibling));
1717 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1718 "Statement unlikely to be reached");
1719 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1720 "\t(Maybe you meant system() when you said exec()?)\n");
1721 CopLINE_set(PL_curcop, oldline);
1728 if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
1729 GV * const gv = cGVOPo_gv;
1730 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
1731 /* XXX could check prototype here instead of just carping */
1732 SV * const sv = sv_newmortal();
1733 gv_efullname3(sv, gv, NULL);
1734 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
1735 "%"SVf"() called too early to check prototype",
1742 if (cSVOPo->op_private & OPpCONST_STRICT)
1743 no_bareword_allowed(o);
1747 case OP_METHOD_NAMED:
1748 /* Relocate sv to the pad for thread safety.
1749 * Despite being a "constant", the SV is written to,
1750 * for reference counts, sv_upgrade() etc. */
1751 if (cSVOPo->op_sv) {
1752 const PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
1753 if (o->op_type != OP_METHOD_NAMED &&
1754 (SvPADTMP(cSVOPo->op_sv) || SvPADMY(cSVOPo->op_sv)))
1756 /* If op_sv is already a PADTMP/MY then it is being used by
1757 * some pad, so make a copy. */
1758 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
1759 if (!SvIsCOW(PAD_SVl(ix))) SvREADONLY_on(PAD_SVl(ix));
1760 SvREFCNT_dec(cSVOPo->op_sv);
1762 else if (o->op_type != OP_METHOD_NAMED
1763 && cSVOPo->op_sv == &PL_sv_undef) {
1764 /* PL_sv_undef is hack - it's unsafe to store it in the
1765 AV that is the pad, because av_fetch treats values of
1766 PL_sv_undef as a "free" AV entry and will merrily
1767 replace them with a new SV, causing pad_alloc to think
1768 that this pad slot is free. (When, clearly, it is not)
1770 SvOK_off(PAD_SVl(ix));
1771 SvPADTMP_on(PAD_SVl(ix));
1772 SvREADONLY_on(PAD_SVl(ix));
1775 SvREFCNT_dec(PAD_SVl(ix));
1776 SvPADTMP_on(cSVOPo->op_sv);
1777 PAD_SETSV(ix, cSVOPo->op_sv);
1778 /* XXX I don't know how this isn't readonly already. */
1779 if (!SvIsCOW(PAD_SVl(ix))) SvREADONLY_on(PAD_SVl(ix));
1781 cSVOPo->op_sv = NULL;
1792 const char *key = NULL;
1795 if (((BINOP*)o)->op_last->op_type != OP_CONST)
1798 /* Make the CONST have a shared SV */
1799 svp = cSVOPx_svp(((BINOP*)o)->op_last);
1800 if ((!SvIsCOW(sv = *svp))
1801 && SvTYPE(sv) < SVt_PVMG && !SvROK(sv)) {
1802 key = SvPV_const(sv, keylen);
1803 lexname = newSVpvn_share(key,
1804 SvUTF8(sv) ? -(I32)keylen : (I32)keylen,
1806 SvREFCNT_dec_NN(sv);
1810 if ((o->op_private & (OPpLVAL_INTRO)))
1813 rop = (UNOP*)((BINOP*)o)->op_first;
1814 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
1816 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
1817 if (!SvPAD_TYPED(lexname))
1819 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
1820 if (!fields || !GvHV(*fields))
1822 key = SvPV_const(*svp, keylen);
1823 if (!hv_fetch(GvHV(*fields), key,
1824 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) {
1825 Perl_croak(aTHX_ "No such class field \"%"SVf"\" "
1826 "in variable %"SVf" of type %"HEKf,
1827 SVfARG(*svp), SVfARG(lexname),
1828 HEKfARG(HvNAME_HEK(SvSTASH(lexname))));
1840 SVOP *first_key_op, *key_op;
1842 if ((o->op_private & (OPpLVAL_INTRO))
1843 /* I bet there's always a pushmark... */
1844 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
1845 /* hmmm, no optimization if list contains only one key. */
1847 rop = (UNOP*)((LISTOP*)o)->op_last;
1848 if (rop->op_type != OP_RV2HV)
1850 if (rop->op_first->op_type == OP_PADSV)
1851 /* @$hash{qw(keys here)} */
1852 rop = (UNOP*)rop->op_first;
1854 /* @{$hash}{qw(keys here)} */
1855 if (rop->op_first->op_type == OP_SCOPE
1856 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
1858 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
1864 lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE);
1865 if (!SvPAD_TYPED(lexname))
1867 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
1868 if (!fields || !GvHV(*fields))
1870 /* Again guessing that the pushmark can be jumped over.... */
1871 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
1872 ->op_first->op_sibling;
1873 for (key_op = first_key_op; key_op;
1874 key_op = (SVOP*)key_op->op_sibling) {
1875 if (key_op->op_type != OP_CONST)
1877 svp = cSVOPx_svp(key_op);
1878 key = SvPV_const(*svp, keylen);
1879 if (!hv_fetch(GvHV(*fields), key,
1880 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) {
1881 Perl_croak(aTHX_ "No such class field \"%"SVf"\" "
1882 "in variable %"SVf" of type %"HEKf,
1883 SVfARG(*svp), SVfARG(lexname),
1884 HEKfARG(HvNAME_HEK(SvSTASH(lexname))));
1891 if (cPMOPo->op_pmreplrootu.op_pmreplroot)
1892 finalize_op(cPMOPo->op_pmreplrootu.op_pmreplroot);
1899 if (o->op_flags & OPf_KIDS) {
1901 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1907 =for apidoc Amx|OP *|op_lvalue|OP *o|I32 type
1909 Propagate lvalue ("modifiable") context to an op and its children.
1910 I<type> represents the context type, roughly based on the type of op that
1911 would do the modifying, although C<local()> is represented by OP_NULL,
1912 because it has no op type of its own (it is signalled by a flag on
1915 This function detects things that can't be modified, such as C<$x+1>, and
1916 generates errors for them. For example, C<$x+1 = 2> would cause it to be
1917 called with an op of type OP_ADD and a C<type> argument of OP_SASSIGN.
1919 It also flags things that need to behave specially in an lvalue context,
1920 such as C<$$x = 5> which might have to vivify a reference in C<$x>.
1926 Perl_op_lvalue_flags(pTHX_ OP *o, I32 type, U32 flags)
1930 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
1933 if (!o || (PL_parser && PL_parser->error_count))
1936 if ((o->op_private & OPpTARGET_MY)
1937 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1942 assert( (o->op_flags & OPf_WANT) != OPf_WANT_VOID );
1944 if (type == OP_PRTF || type == OP_SPRINTF) type = OP_ENTERSUB;
1946 switch (o->op_type) {
1951 if ((o->op_flags & OPf_PARENS) || PL_madskills)
1955 if ((type == OP_UNDEF || type == OP_REFGEN || type == OP_LOCK) &&
1956 !(o->op_flags & OPf_STACKED)) {
1957 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1958 /* Both ENTERSUB and RV2CV use this bit, but for different pur-
1959 poses, so we need it clear. */
1960 o->op_private &= ~1;
1961 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1962 assert(cUNOPo->op_first->op_type == OP_NULL);
1963 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1966 else { /* lvalue subroutine call */
1967 o->op_private |= OPpLVAL_INTRO
1968 |(OPpENTERSUB_INARGS * (type == OP_LEAVESUBLV));
1969 PL_modcount = RETURN_UNLIMITED_NUMBER;
1970 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1971 /* Potential lvalue context: */
1972 o->op_private |= OPpENTERSUB_INARGS;
1975 else { /* Compile-time error message: */
1976 OP *kid = cUNOPo->op_first;
1979 if (kid->op_type != OP_PUSHMARK) {
1980 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1982 "panic: unexpected lvalue entersub "
1983 "args: type/targ %ld:%"UVuf,
1984 (long)kid->op_type, (UV)kid->op_targ);
1985 kid = kLISTOP->op_first;
1987 while (kid->op_sibling)
1988 kid = kid->op_sibling;
1989 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1990 break; /* Postpone until runtime */
1993 kid = kUNOP->op_first;
1994 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1995 kid = kUNOP->op_first;
1996 if (kid->op_type == OP_NULL)
1998 "Unexpected constant lvalue entersub "
1999 "entry via type/targ %ld:%"UVuf,
2000 (long)kid->op_type, (UV)kid->op_targ);
2001 if (kid->op_type != OP_GV) {
2005 cv = GvCV(kGVOP_gv);
2015 if (flags & OP_LVALUE_NO_CROAK) return NULL;
2016 /* grep, foreach, subcalls, refgen */
2017 if (type == OP_GREPSTART || type == OP_ENTERSUB
2018 || type == OP_REFGEN || type == OP_LEAVESUBLV)
2020 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
2021 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
2023 : (o->op_type == OP_ENTERSUB
2024 ? "non-lvalue subroutine call"
2026 type ? PL_op_desc[type] : "local"));
2040 case OP_RIGHT_SHIFT:
2049 if (!(o->op_flags & OPf_STACKED))
2056 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
2057 op_lvalue(kid, type);
2062 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
2063 PL_modcount = RETURN_UNLIMITED_NUMBER;
2064 return o; /* Treat \(@foo) like ordinary list. */
2068 if (scalar_mod_type(o, type))
2070 ref(cUNOPo->op_first, o->op_type);
2077 if (type == OP_LEAVESUBLV)
2078 o->op_private |= OPpMAYBE_LVSUB;
2082 PL_modcount = RETURN_UNLIMITED_NUMBER;
2085 PL_hints |= HINT_BLOCK_SCOPE;
2086 if (type == OP_LEAVESUBLV)
2087 o->op_private |= OPpMAYBE_LVSUB;
2091 ref(cUNOPo->op_first, o->op_type);
2095 PL_hints |= HINT_BLOCK_SCOPE;
2104 case OP_AELEMFAST_LEX:
2111 PL_modcount = RETURN_UNLIMITED_NUMBER;
2112 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
2113 return o; /* Treat \(@foo) like ordinary list. */
2114 if (scalar_mod_type(o, type))
2116 if (type == OP_LEAVESUBLV)
2117 o->op_private |= OPpMAYBE_LVSUB;
2121 if (!type) /* local() */
2122 Perl_croak(aTHX_ "Can't localize lexical variable %"SVf,
2123 PAD_COMPNAME_SV(o->op_targ));
2132 if (type != OP_SASSIGN && type != OP_LEAVESUBLV)
2136 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
2142 if (type == OP_LEAVESUBLV)
2143 o->op_private |= OPpMAYBE_LVSUB;
2144 pad_free(o->op_targ);
2145 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
2146 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
2147 if (o->op_flags & OPf_KIDS)
2148 op_lvalue(cBINOPo->op_first->op_sibling, type);
2153 ref(cBINOPo->op_first, o->op_type);
2154 if (type == OP_ENTERSUB &&
2155 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
2156 o->op_private |= OPpLVAL_DEFER;
2157 if (type == OP_LEAVESUBLV)
2158 o->op_private |= OPpMAYBE_LVSUB;
2168 if (o->op_flags & OPf_KIDS)
2169 op_lvalue(cLISTOPo->op_last, type);
2174 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
2176 else if (!(o->op_flags & OPf_KIDS))
2178 if (o->op_targ != OP_LIST) {
2179 op_lvalue(cBINOPo->op_first, type);
2185 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2186 /* elements might be in void context because the list is
2187 in scalar context or because they are attribute sub calls */
2188 if ( (kid->op_flags & OPf_WANT) != OPf_WANT_VOID )
2189 op_lvalue(kid, type);
2193 if (type != OP_LEAVESUBLV)
2195 break; /* op_lvalue()ing was handled by ck_return() */
2201 /* [20011101.069] File test operators interpret OPf_REF to mean that
2202 their argument is a filehandle; thus \stat(".") should not set
2204 if (type == OP_REFGEN &&
2205 PL_check[o->op_type] == Perl_ck_ftst)
2208 if (type != OP_LEAVESUBLV)
2209 o->op_flags |= OPf_MOD;
2211 if (type == OP_AASSIGN || type == OP_SASSIGN)
2212 o->op_flags |= OPf_SPECIAL|OPf_REF;
2213 else if (!type) { /* local() */
2216 o->op_private |= OPpLVAL_INTRO;
2217 o->op_flags &= ~OPf_SPECIAL;
2218 PL_hints |= HINT_BLOCK_SCOPE;
2223 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
2224 "Useless localization of %s", OP_DESC(o));
2227 else if (type != OP_GREPSTART && type != OP_ENTERSUB
2228 && type != OP_LEAVESUBLV)
2229 o->op_flags |= OPf_REF;
2234 S_scalar_mod_type(const OP *o, I32 type)
2239 if (o && o->op_type == OP_RV2GV)
2263 case OP_RIGHT_SHIFT:
2284 S_is_handle_constructor(const OP *o, I32 numargs)
2286 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
2288 switch (o->op_type) {
2296 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
2309 S_refkids(pTHX_ OP *o, I32 type)
2311 if (o && o->op_flags & OPf_KIDS) {
2313 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2320 Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
2325 PERL_ARGS_ASSERT_DOREF;
2327 if (!o || (PL_parser && PL_parser->error_count))
2330 switch (o->op_type) {
2332 if ((type == OP_EXISTS || type == OP_DEFINED) &&
2333 !(o->op_flags & OPf_STACKED)) {
2334 o->op_type = OP_RV2CV; /* entersub => rv2cv */
2335 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
2336 assert(cUNOPo->op_first->op_type == OP_NULL);
2337 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
2338 o->op_flags |= OPf_SPECIAL;
2339 o->op_private &= ~1;
2341 else if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV){
2342 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2343 : type == OP_RV2HV ? OPpDEREF_HV
2345 o->op_flags |= OPf_MOD;
2351 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
2352 doref(kid, type, set_op_ref);
2355 if (type == OP_DEFINED)
2356 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2357 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2360 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2361 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2362 : type == OP_RV2HV ? OPpDEREF_HV
2364 o->op_flags |= OPf_MOD;
2371 o->op_flags |= OPf_REF;
2374 if (type == OP_DEFINED)
2375 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2376 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2382 o->op_flags |= OPf_REF;
2387 if (!(o->op_flags & OPf_KIDS) || type == OP_DEFINED)
2389 doref(cBINOPo->op_first, type, set_op_ref);
2393 doref(cBINOPo->op_first, o->op_type, set_op_ref);
2394 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2395 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2396 : type == OP_RV2HV ? OPpDEREF_HV
2398 o->op_flags |= OPf_MOD;
2408 if (!(o->op_flags & OPf_KIDS))
2410 doref(cLISTOPo->op_last, type, set_op_ref);
2420 S_dup_attrlist(pTHX_ OP *o)
2425 PERL_ARGS_ASSERT_DUP_ATTRLIST;
2427 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
2428 * where the first kid is OP_PUSHMARK and the remaining ones
2429 * are OP_CONST. We need to push the OP_CONST values.
2431 if (o->op_type == OP_CONST)
2432 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
2434 else if (o->op_type == OP_NULL)
2438 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
2440 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
2441 if (o->op_type == OP_CONST)
2442 rop = op_append_elem(OP_LIST, rop,
2443 newSVOP(OP_CONST, o->op_flags,
2444 SvREFCNT_inc_NN(cSVOPo->op_sv)));
2451 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
2454 SV * const stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2456 PERL_ARGS_ASSERT_APPLY_ATTRS;
2458 /* fake up C<use attributes $pkg,$rv,@attrs> */
2459 ENTER; /* need to protect against side-effects of 'use' */
2461 #define ATTRSMODULE "attributes"
2462 #define ATTRSMODULE_PM "attributes.pm"
2464 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2465 newSVpvs(ATTRSMODULE),
2467 op_prepend_elem(OP_LIST,
2468 newSVOP(OP_CONST, 0, stashsv),
2469 op_prepend_elem(OP_LIST,
2470 newSVOP(OP_CONST, 0,
2472 dup_attrlist(attrs))));
2477 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
2480 OP *pack, *imop, *arg;
2481 SV *meth, *stashsv, **svp;
2483 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
2488 assert(target->op_type == OP_PADSV ||
2489 target->op_type == OP_PADHV ||
2490 target->op_type == OP_PADAV);
2492 /* Ensure that attributes.pm is loaded. */
2493 ENTER; /* need to protect against side-effects of 'use' */
2494 /* Don't force the C<use> if we don't need it. */
2495 svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
2496 if (svp && *svp != &PL_sv_undef)
2497 NOOP; /* already in %INC */
2499 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
2500 newSVpvs(ATTRSMODULE), NULL);
2503 /* Need package name for method call. */
2504 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
2506 /* Build up the real arg-list. */
2507 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2509 arg = newOP(OP_PADSV, 0);
2510 arg->op_targ = target->op_targ;
2511 arg = op_prepend_elem(OP_LIST,
2512 newSVOP(OP_CONST, 0, stashsv),
2513 op_prepend_elem(OP_LIST,
2514 newUNOP(OP_REFGEN, 0,
2515 op_lvalue(arg, OP_REFGEN)),
2516 dup_attrlist(attrs)));
2518 /* Fake up a method call to import */
2519 meth = newSVpvs_share("import");
2520 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
2521 op_append_elem(OP_LIST,
2522 op_prepend_elem(OP_LIST, pack, list(arg)),
2523 newSVOP(OP_METHOD_NAMED, 0, meth)));
2525 /* Combine the ops. */
2526 *imopsp = op_append_elem(OP_LIST, *imopsp, imop);
2530 =notfor apidoc apply_attrs_string
2532 Attempts to apply a list of attributes specified by the C<attrstr> and
2533 C<len> arguments to the subroutine identified by the C<cv> argument which
2534 is expected to be associated with the package identified by the C<stashpv>
2535 argument (see L<attributes>). It gets this wrong, though, in that it
2536 does not correctly identify the boundaries of the individual attribute
2537 specifications within C<attrstr>. This is not really intended for the
2538 public API, but has to be listed here for systems such as AIX which
2539 need an explicit export list for symbols. (It's called from XS code
2540 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
2541 to respect attribute syntax properly would be welcome.
2547 Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
2548 const char *attrstr, STRLEN len)
2552 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2555 len = strlen(attrstr);
2559 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2561 const char * const sstr = attrstr;
2562 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2563 attrs = op_append_elem(OP_LIST, attrs,
2564 newSVOP(OP_CONST, 0,
2565 newSVpvn(sstr, attrstr-sstr)));
2569 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2570 newSVpvs(ATTRSMODULE),
2571 NULL, op_prepend_elem(OP_LIST,
2572 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2573 op_prepend_elem(OP_LIST,
2574 newSVOP(OP_CONST, 0,
2575 newRV(MUTABLE_SV(cv))),
2580 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
2584 const bool stately = PL_parser && PL_parser->in_my == KEY_state;
2586 PERL_ARGS_ASSERT_MY_KID;
2588 if (!o || (PL_parser && PL_parser->error_count))
2592 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2593 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2597 if (type == OP_LIST) {
2599 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2600 my_kid(kid, attrs, imopsp);
2602 } else if (type == OP_UNDEF || type == OP_STUB) {
2604 } else if (type == OP_RV2SV || /* "our" declaration */
2606 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
2607 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
2608 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2610 PL_parser->in_my == KEY_our
2612 : PL_parser->in_my == KEY_state ? "state" : "my"));
2614 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
2615 PL_parser->in_my = FALSE;
2616 PL_parser->in_my_stash = NULL;
2617 apply_attrs(GvSTASH(gv),
2618 (type == OP_RV2SV ? GvSV(gv) :
2619 type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) :
2620 type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)),
2623 o->op_private |= OPpOUR_INTRO;
2626 else if (type != OP_PADSV &&
2629 type != OP_PUSHMARK)
2631 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2633 PL_parser->in_my == KEY_our
2635 : PL_parser->in_my == KEY_state ? "state" : "my"));
2638 else if (attrs && type != OP_PUSHMARK) {
2641 PL_parser->in_my = FALSE;
2642 PL_parser->in_my_stash = NULL;
2644 /* check for C<my Dog $spot> when deciding package */
2645 stash = PAD_COMPNAME_TYPE(o->op_targ);
2647 stash = PL_curstash;
2648 apply_attrs_my(stash, o, attrs, imopsp);
2650 o->op_flags |= OPf_MOD;
2651 o->op_private |= OPpLVAL_INTRO;
2653 o->op_private |= OPpPAD_STATE;
2658 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2662 int maybe_scalar = 0;
2664 PERL_ARGS_ASSERT_MY_ATTRS;
2666 /* [perl #17376]: this appears to be premature, and results in code such as
2667 C< our(%x); > executing in list mode rather than void mode */
2669 if (o->op_flags & OPf_PARENS)
2679 o = my_kid(o, attrs, &rops);
2681 if (maybe_scalar && o->op_type == OP_PADSV) {
2682 o = scalar(op_append_list(OP_LIST, rops, o));
2683 o->op_private |= OPpLVAL_INTRO;
2686 /* The listop in rops might have a pushmark at the beginning,
2687 which will mess up list assignment. */
2688 LISTOP * const lrops = (LISTOP *)rops; /* for brevity */
2689 if (rops->op_type == OP_LIST &&
2690 lrops->op_first && lrops->op_first->op_type == OP_PUSHMARK)
2692 OP * const pushmark = lrops->op_first;
2693 lrops->op_first = pushmark->op_sibling;
2696 o = op_append_list(OP_LIST, o, rops);
2699 PL_parser->in_my = FALSE;
2700 PL_parser->in_my_stash = NULL;
2705 Perl_sawparens(pTHX_ OP *o)
2707 PERL_UNUSED_CONTEXT;
2709 o->op_flags |= OPf_PARENS;
2714 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2718 const OPCODE ltype = left->op_type;
2719 const OPCODE rtype = right->op_type;
2721 PERL_ARGS_ASSERT_BIND_MATCH;
2723 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2724 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
2726 const char * const desc
2728 rtype == OP_SUBST || rtype == OP_TRANS
2729 || rtype == OP_TRANSR
2731 ? (int)rtype : OP_MATCH];
2732 const bool isary = ltype == OP_RV2AV || ltype == OP_PADAV;
2735 (ltype == OP_RV2AV || ltype == OP_RV2HV)
2736 ? cUNOPx(left)->op_first->op_type == OP_GV
2737 && (gv = cGVOPx_gv(cUNOPx(left)->op_first))
2738 ? varname(gv, isary ? '@' : '%', 0, NULL, 0, 1)
2741 (GV *)PL_compcv, isary ? '@' : '%', left->op_targ, NULL, 0, 1
2744 Perl_warner(aTHX_ packWARN(WARN_MISC),
2745 "Applying %s to %"SVf" will act on scalar(%"SVf")",
2748 const char * const sample = (isary
2749 ? "@array" : "%hash");
2750 Perl_warner(aTHX_ packWARN(WARN_MISC),
2751 "Applying %s to %s will act on scalar(%s)",
2752 desc, sample, sample);
2756 if (rtype == OP_CONST &&
2757 cSVOPx(right)->op_private & OPpCONST_BARE &&
2758 cSVOPx(right)->op_private & OPpCONST_STRICT)
2760 no_bareword_allowed(right);
2763 /* !~ doesn't make sense with /r, so error on it for now */
2764 if (rtype == OP_SUBST && (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT) &&
2766 yyerror("Using !~ with s///r doesn't make sense");
2767 if (rtype == OP_TRANSR && type == OP_NOT)
2768 yyerror("Using !~ with tr///r doesn't make sense");
2770 ismatchop = (rtype == OP_MATCH ||
2771 rtype == OP_SUBST ||
2772 rtype == OP_TRANS || rtype == OP_TRANSR)
2773 && !(right->op_flags & OPf_SPECIAL);
2774 if (ismatchop && right->op_private & OPpTARGET_MY) {
2776 right->op_private &= ~OPpTARGET_MY;
2778 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
2781 right->op_flags |= OPf_STACKED;
2782 if (rtype != OP_MATCH && rtype != OP_TRANSR &&
2783 ! (rtype == OP_TRANS &&
2784 right->op_private & OPpTRANS_IDENTICAL) &&
2785 ! (rtype == OP_SUBST &&
2786 (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT)))
2787 newleft = op_lvalue(left, rtype);
2790 if (right->op_type == OP_TRANS || right->op_type == OP_TRANSR)
2791 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
2793 o = op_prepend_elem(rtype, scalar(newleft), right);
2795 return newUNOP(OP_NOT, 0, scalar(o));
2799 return bind_match(type, left,
2800 pmruntime(newPMOP(OP_MATCH, 0), right, 0, 0));
2804 Perl_invert(pTHX_ OP *o)
2808 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2812 =for apidoc Amx|OP *|op_scope|OP *o
2814 Wraps up an op tree with some additional ops so that at runtime a dynamic
2815 scope will be created. The original ops run in the new dynamic scope,
2816 and then, provided that they exit normally, the scope will be unwound.
2817 The additional ops used to create and unwind the dynamic scope will
2818 normally be an C<enter>/C<leave> pair, but a C<scope> op may be used
2819 instead if the ops are simple enough to not need the full dynamic scope
2826 Perl_op_scope(pTHX_ OP *o)
2830 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || TAINTING_get) {
2831 o = op_prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2832 o->op_type = OP_LEAVE;
2833 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2835 else if (o->op_type == OP_LINESEQ) {
2837 o->op_type = OP_SCOPE;
2838 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2839 kid = ((LISTOP*)o)->op_first;
2840 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2843 /* The following deals with things like 'do {1 for 1}' */
2844 kid = kid->op_sibling;
2846 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
2851 o = newLISTOP(OP_SCOPE, 0, o, NULL);
2857 Perl_op_unscope(pTHX_ OP *o)
2859 if (o && o->op_type == OP_LINESEQ) {
2860 OP *kid = cLISTOPo->op_first;
2861 for(; kid; kid = kid->op_sibling)
2862 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
2869 Perl_block_start(pTHX_ int full)
2872 const int retval = PL_savestack_ix;
2874 pad_block_start(full);
2876 PL_hints &= ~HINT_BLOCK_SCOPE;
2877 SAVECOMPILEWARNINGS();
2878 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
2880 CALL_BLOCK_HOOKS(bhk_start, full);
2886 Perl_block_end(pTHX_ I32 floor, OP *seq)
2889 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2890 OP* retval = scalarseq(seq);
2893 CALL_BLOCK_HOOKS(bhk_pre_end, &retval);
2896 CopHINTS_set(&PL_compiling, PL_hints);
2898 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2902 /* pad_leavemy has created a sequence of introcv ops for all my
2903 subs declared in the block. We have to replicate that list with
2904 clonecv ops, to deal with this situation:
2909 sub s1 { state sub foo { \&s2 } }
2912 Originally, I was going to have introcv clone the CV and turn
2913 off the stale flag. Since &s1 is declared before &s2, the
2914 introcv op for &s1 is executed (on sub entry) before the one for
2915 &s2. But the &foo sub inside &s1 (which is cloned when &s1 is
2916 cloned, since it is a state sub) closes over &s2 and expects
2917 to see it in its outer CV’s pad. If the introcv op clones &s1,
2918 then &s2 is still marked stale. Since &s1 is not active, and
2919 &foo closes over &s1’s implicit entry for &s2, we get a ‘Varia-
2920 ble will not stay shared’ warning. Because it is the same stub
2921 that will be used when the introcv op for &s2 is executed, clos-
2922 ing over it is safe. Hence, we have to turn off the stale flag
2923 on all lexical subs in the block before we clone any of them.
2924 Hence, having introcv clone the sub cannot work. So we create a
2925 list of ops like this:
2949 OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : o;
2950 OP * const last = o->op_flags & OPf_KIDS ? cLISTOPo->op_last : o;
2951 for (;; kid = kid->op_sibling) {
2952 OP *newkid = newOP(OP_CLONECV, 0);
2953 newkid->op_targ = kid->op_targ;
2954 o = op_append_elem(OP_LINESEQ, o, newkid);
2955 if (kid == last) break;
2957 retval = op_prepend_elem(OP_LINESEQ, o, retval);
2960 CALL_BLOCK_HOOKS(bhk_post_end, &retval);
2966 =head1 Compile-time scope hooks
2968 =for apidoc Aox||blockhook_register
2970 Register a set of hooks to be called when the Perl lexical scope changes
2971 at compile time. See L<perlguts/"Compile-time scope hooks">.
2977 Perl_blockhook_register(pTHX_ BHK *hk)
2979 PERL_ARGS_ASSERT_BLOCKHOOK_REGISTER;
2981 Perl_av_create_and_push(aTHX_ &PL_blockhooks, newSViv(PTR2IV(hk)));
2988 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
2989 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
2990 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2993 OP * const o = newOP(OP_PADSV, 0);
2994 o->op_targ = offset;
3000 Perl_newPROG(pTHX_ OP *o)
3004 PERL_ARGS_ASSERT_NEWPROG;
3011 PL_eval_root = newUNOP(OP_LEAVEEVAL,
3012 ((PL_in_eval & EVAL_KEEPERR)
3013 ? OPf_SPECIAL : 0), o);
3015 cx = &cxstack[cxstack_ix];
3016 assert(CxTYPE(cx) == CXt_EVAL);
3018 if ((cx->blk_gimme & G_WANT) == G_VOID)
3019 scalarvoid(PL_eval_root);
3020 else if ((cx->blk_gimme & G_WANT) == G_ARRAY)
3023 scalar(PL_eval_root);
3025 PL_eval_start = op_linklist(PL_eval_root);
3026 PL_eval_root->op_private |= OPpREFCOUNTED;
3027 OpREFCNT_set(PL_eval_root, 1);
3028 PL_eval_root->op_next = 0;
3029 i = PL_savestack_ix;
3032 CALL_PEEP(PL_eval_start);
3033 finalize_optree(PL_eval_root);
3035 PL_savestack_ix = i;
3038 if (o->op_type == OP_STUB) {
3039 /* This block is entered if nothing is compiled for the main
3040 program. This will be the case for an genuinely empty main
3041 program, or one which only has BEGIN blocks etc, so already
3044 Historically (5.000) the guard above was !o. However, commit
3045 f8a08f7b8bd67b28 (Jun 2001), integrated to blead as
3046 c71fccf11fde0068, changed perly.y so that newPROG() is now
3047 called with the output of block_end(), which returns a new
3048 OP_STUB for the case of an empty optree. ByteLoader (and
3049 maybe other things) also take this path, because they set up
3050 PL_main_start and PL_main_root directly, without generating an
3053 If the parsing the main program aborts (due to parse errors,
3054 or due to BEGIN or similar calling exit), then newPROG()
3055 isn't even called, and hence this code path and its cleanups
3056 are skipped. This shouldn't make a make a difference:
3057 * a non-zero return from perl_parse is a failure, and
3058 perl_destruct() should be called immediately.
3059 * however, if exit(0) is called during the parse, then
3060 perl_parse() returns 0, and perl_run() is called. As
3061 PL_main_start will be NULL, perl_run() will return
3062 promptly, and the exit code will remain 0.
3065 PL_comppad_name = 0;
3067 S_op_destroy(aTHX_ o);
3070 PL_main_root = op_scope(sawparens(scalarvoid(o)));
3071 PL_curcop = &PL_compiling;
3072 PL_main_start = LINKLIST(PL_main_root);
3073 PL_main_root->op_private |= OPpREFCOUNTED;
3074 OpREFCNT_set(PL_main_root, 1);
3075 PL_main_root->op_next = 0;
3076 CALL_PEEP(PL_main_start);
3077 finalize_optree(PL_main_root);
3078 cv_forget_slab(PL_compcv);
3081 /* Register with debugger */
3083 CV * const cv = get_cvs("DB::postponed", 0);
3087 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
3089 call_sv(MUTABLE_SV(cv), G_DISCARD);
3096 Perl_localize(pTHX_ OP *o, I32 lex)
3100 PERL_ARGS_ASSERT_LOCALIZE;
3102 if (o->op_flags & OPf_PARENS)
3103 /* [perl #17376]: this appears to be premature, and results in code such as
3104 C< our(%x); > executing in list mode rather than void mode */
3111 if ( PL_parser->bufptr > PL_parser->oldbufptr
3112 && PL_parser->bufptr[-1] == ','
3113 && ckWARN(WARN_PARENTHESIS))
3115 char *s = PL_parser->bufptr;
3118 /* some heuristics to detect a potential error */
3119 while (*s && (strchr(", \t\n", *s)))
3123 if (*s && strchr("@$%*", *s) && *++s
3124 && (isWORDCHAR(*s) || UTF8_IS_CONTINUED(*s))) {
3127 while (*s && (isWORDCHAR(*s) || UTF8_IS_CONTINUED(*s)))
3129 while (*s && (strchr(", \t\n", *s)))
3135 if (sigil && (*s == ';' || *s == '=')) {
3136 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
3137 "Parentheses missing around \"%s\" list",
3139 ? (PL_parser->in_my == KEY_our
3141 : PL_parser->in_my == KEY_state
3151 o = op_lvalue(o, OP_NULL); /* a bit kludgey */
3152 PL_parser->in_my = FALSE;
3153 PL_parser->in_my_stash = NULL;
3158 Perl_jmaybe(pTHX_ OP *o)
3160 PERL_ARGS_ASSERT_JMAYBE;
3162 if (o->op_type == OP_LIST) {
3164 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
3165 o = convert(OP_JOIN, 0, op_prepend_elem(OP_LIST, o2, o));
3170 PERL_STATIC_INLINE OP *
3171 S_op_std_init(pTHX_ OP *o)
3173 I32 type = o->op_type;
3175 PERL_ARGS_ASSERT_OP_STD_INIT;
3177 if (PL_opargs[type] & OA_RETSCALAR)
3179 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
3180 o->op_targ = pad_alloc(type, SVs_PADTMP);
3185 PERL_STATIC_INLINE OP *
3186 S_op_integerize(pTHX_ OP *o)
3188 I32 type = o->op_type;
3190 PERL_ARGS_ASSERT_OP_INTEGERIZE;
3192 /* integerize op. */
3193 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
3196 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
3199 if (type == OP_NEGATE)
3200 /* XXX might want a ck_negate() for this */
3201 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
3207 S_fold_constants(pTHX_ OP *o)
3212 VOL I32 type = o->op_type;
3217 SV * const oldwarnhook = PL_warnhook;
3218 SV * const olddiehook = PL_diehook;
3222 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
3224 if (!(PL_opargs[type] & OA_FOLDCONST))
3238 /* XXX what about the numeric ops? */
3239 if (IN_LOCALE_COMPILETIME)
3243 if (!cLISTOPo->op_first->op_sibling
3244 || cLISTOPo->op_first->op_sibling->op_type != OP_CONST)
3247 SV * const sv = cSVOPx_sv(cLISTOPo->op_first->op_sibling);
3248 if (!SvPOK(sv) || SvGMAGICAL(sv)) goto nope;
3250 const char *s = SvPVX_const(sv);
3251 while (s < SvEND(sv)) {
3252 if (*s == 'p' || *s == 'P') goto nope;
3259 if (o->op_private & OPpREPEAT_DOLIST) goto nope;
3262 if (PL_parser && PL_parser->error_count)
3263 goto nope; /* Don't try to run w/ errors */
3265 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3266 const OPCODE type = curop->op_type;
3267 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
3269 type != OP_SCALAR &&
3271 type != OP_PUSHMARK)
3277 curop = LINKLIST(o);
3278 old_next = o->op_next;
3282 oldscope = PL_scopestack_ix;
3283 create_eval_scope(G_FAKINGEVAL);
3285 /* Verify that we don't need to save it: */
3286 assert(PL_curcop == &PL_compiling);
3287 StructCopy(&PL_compiling, ¬_compiling, COP);
3288 PL_curcop = ¬_compiling;
3289 /* The above ensures that we run with all the correct hints of the
3290 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
3291 assert(IN_PERL_RUNTIME);
3292 PL_warnhook = PERL_WARNHOOK_FATAL;
3299 sv = *(PL_stack_sp--);
3300 if (o->op_targ && sv == PAD_SV(o->op_targ)) { /* grab pad temp? */
3302 /* Can't simply swipe the SV from the pad, because that relies on
3303 the op being freed "real soon now". Under MAD, this doesn't
3304 happen (see the #ifdef below). */
3307 pad_swipe(o->op_targ, FALSE);
3310 else if (SvTEMP(sv)) { /* grab mortal temp? */
3311 SvREFCNT_inc_simple_void(sv);
3316 /* Something tried to die. Abandon constant folding. */
3317 /* Pretend the error never happened. */
3319 o->op_next = old_next;
3323 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
3324 PL_warnhook = oldwarnhook;
3325 PL_diehook = olddiehook;
3326 /* XXX note that this croak may fail as we've already blown away
3327 * the stack - eg any nested evals */
3328 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
3331 PL_warnhook = oldwarnhook;
3332 PL_diehook = olddiehook;
3333 PL_curcop = &PL_compiling;
3335 if (PL_scopestack_ix > oldscope)
3336 delete_eval_scope();
3345 if (type == OP_RV2GV)
3346 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
3348 newop = newSVOP(OP_CONST, OPpCONST_FOLDED<<8, MUTABLE_SV(sv));
3349 op_getmad(o,newop,'f');
3357 S_gen_constant_list(pTHX_ OP *o)
3361 const I32 oldtmps_floor = PL_tmps_floor;
3364 if (PL_parser && PL_parser->error_count)
3365 return o; /* Don't attempt to run with errors */
3367 PL_op = curop = LINKLIST(o);
3370 Perl_pp_pushmark(aTHX);
3373 assert (!(curop->op_flags & OPf_SPECIAL));
3374 assert(curop->op_type == OP_RANGE);
3375 Perl_pp_anonlist(aTHX);
3376 PL_tmps_floor = oldtmps_floor;
3378 o->op_type = OP_RV2AV;
3379 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
3380 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
3381 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
3382 o->op_opt = 0; /* needs to be revisited in rpeep() */
3383 curop = ((UNOP*)o)->op_first;
3384 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
3386 op_getmad(curop,o,'O');
3395 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
3398 if (type < 0) type = -type, flags |= OPf_SPECIAL;
3399 if (!o || o->op_type != OP_LIST)
3400 o = newLISTOP(OP_LIST, 0, o, NULL);
3402 o->op_flags &= ~OPf_WANT;
3404 if (!(PL_opargs[type] & OA_MARK))
3405 op_null(cLISTOPo->op_first);
3407 OP * const kid2 = cLISTOPo->op_first->op_sibling;
3408 if (kid2 && kid2->op_type == OP_COREARGS) {
3409 op_null(cLISTOPo->op_first);
3410 kid2->op_private |= OPpCOREARGS_PUSHMARK;
3414 o->op_type = (OPCODE)type;
3415 o->op_ppaddr = PL_ppaddr[type];
3416 o->op_flags |= flags;
3418 o = CHECKOP(type, o);
3419 if (o->op_type != (unsigned)type)
3422 return fold_constants(op_integerize(op_std_init(o)));
3426 =head1 Optree Manipulation Functions
3429 /* List constructors */
3432 =for apidoc Am|OP *|op_append_elem|I32 optype|OP *first|OP *last
3434 Append an item to the list of ops contained directly within a list-type
3435 op, returning the lengthened list. I<first> is the list-type op,
3436 and I<last> is the op to append to the list. I<optype> specifies the
3437 intended opcode for the list. If I<first> is not already a list of the
3438 right type, it will be upgraded into one. If either I<first> or I<last>
3439 is null, the other is returned unchanged.
3445 Perl_op_append_elem(pTHX_ I32 type, OP *first, OP *last)
3453 if (first->op_type != (unsigned)type
3454 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
3456 return newLISTOP(type, 0, first, last);
3459 if (first->op_flags & OPf_KIDS)
3460 ((LISTOP*)first)->op_last->op_sibling = last;
3462 first->op_flags |= OPf_KIDS;
3463 ((LISTOP*)first)->op_first = last;
3465 ((LISTOP*)first)->op_last = last;
3470 =for apidoc Am|OP *|op_append_list|I32 optype|OP *first|OP *last
3472 Concatenate the lists of ops contained directly within two list-type ops,
3473 returning the combined list. I<first> and I<last> are the list-type ops
3474 to concatenate. I<optype> specifies the intended opcode for the list.
3475 If either I<first> or I<last> is not already a list of the right type,
3476 it will be upgraded into one. If either I<first> or I<last> is null,
3477 the other is returned unchanged.
3483 Perl_op_append_list(pTHX_ I32 type, OP *first, OP *last)
3491 if (first->op_type != (unsigned)type)
3492 return op_prepend_elem(type, first, last);
3494 if (last->op_type != (unsigned)type)
3495 return op_append_elem(type, first, last);
3497 ((LISTOP*)first)->op_last->op_sibling = ((LISTOP*)last)->op_first;
3498 ((LISTOP*)first)->op_last = ((LISTOP*)last)->op_last;
3499 first->op_flags |= (last->op_flags & OPf_KIDS);
3502 if (((LISTOP*)last)->op_first && first->op_madprop) {
3503 MADPROP *mp = ((LISTOP*)last)->op_first->op_madprop;
3505 while (mp->mad_next)
3507 mp->mad_next = first->op_madprop;
3510 ((LISTOP*)last)->op_first->op_madprop = first->op_madprop;
3513 first->op_madprop = last->op_madprop;
3514 last->op_madprop = 0;
3517 S_op_destroy(aTHX_ last);
3523 =for apidoc Am|OP *|op_prepend_elem|I32 optype|OP *first|OP *last
3525 Prepend an item to the list of ops contained directly within a list-type
3526 op, returning the lengthened list. I<first> is the op to prepend to the
3527 list, and I<last> is the list-type op. I<optype> specifies the intended
3528 opcode for the list. If I<last> is not already a list of the right type,
3529 it will be upgraded into one. If either I<first> or I<last> is null,
3530 the other is returned unchanged.
3536 Perl_op_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
3544 if (last->op_type == (unsigned)type) {
3545 if (type == OP_LIST) { /* already a PUSHMARK there */
3546 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
3547 ((LISTOP*)last)->op_first->op_sibling = first;
3548 if (!(first->op_flags & OPf_PARENS))
3549 last->op_flags &= ~OPf_PARENS;
3552 if (!(last->op_flags & OPf_KIDS)) {
3553 ((LISTOP*)last)->op_last = first;
3554 last->op_flags |= OPf_KIDS;
3556 first->op_sibling = ((LISTOP*)last)->op_first;
3557 ((LISTOP*)last)->op_first = first;
3559 last->op_flags |= OPf_KIDS;
3563 return newLISTOP(type, 0, first, last);
3571 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
3574 Newxz(tk, 1, TOKEN);
3575 tk->tk_type = (OPCODE)optype;
3576 tk->tk_type = 12345;
3578 tk->tk_mad = madprop;
3583 Perl_token_free(pTHX_ TOKEN* tk)
3585 PERL_ARGS_ASSERT_TOKEN_FREE;
3587 if (tk->tk_type != 12345)
3589 mad_free(tk->tk_mad);
3594 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
3599 PERL_ARGS_ASSERT_TOKEN_GETMAD;
3601 if (tk->tk_type != 12345) {
3602 Perl_warner(aTHX_ packWARN(WARN_MISC),
3603 "Invalid TOKEN object ignored");
3610 /* faked up qw list? */
3612 tm->mad_type == MAD_SV &&
3613 SvPVX((SV *)tm->mad_val)[0] == 'q')
3620 /* pretend constant fold didn't happen? */
3621 if (mp->mad_key == 'f' &&
3622 (o->op_type == OP_CONST ||
3623 o->op_type == OP_GV) )
3625 token_getmad(tk,(OP*)mp->mad_val,slot);
3639 if (mp->mad_key == 'X')
3640 mp->mad_key = slot; /* just change the first one */
3650 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
3659 /* pretend constant fold didn't happen? */
3660 if (mp->mad_key == 'f' &&
3661 (o->op_type == OP_CONST ||
3662 o->op_type == OP_GV) )
3664 op_getmad(from,(OP*)mp->mad_val,slot);
3671 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
3674 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
3680 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
3689 /* pretend constant fold didn't happen? */
3690 if (mp->mad_key == 'f' &&
3691 (o->op_type == OP_CONST ||
3692 o->op_type == OP_GV) )
3694 op_getmad(from,(OP*)mp->mad_val,slot);
3701 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
3704 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
3708 PerlIO_printf(PerlIO_stderr(),
3709 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
3715 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
3733 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
3737 addmad(tm, &(o->op_madprop), slot);
3741 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
3762 Perl_newMADsv(pTHX_ char key, SV* sv)
3764 PERL_ARGS_ASSERT_NEWMADSV;
3766 return newMADPROP(key, MAD_SV, sv, 0);
3770 Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
3772 MADPROP *const mp = (MADPROP *) PerlMemShared_malloc(sizeof(MADPROP));
3775 mp->mad_vlen = vlen;
3776 mp->mad_type = type;
3778 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
3783 Perl_mad_free(pTHX_ MADPROP* mp)
3785 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
3789 mad_free(mp->mad_next);
3790 /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
3791 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
3792 switch (mp->mad_type) {
3796 Safefree(mp->mad_val);
3799 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
3800 op_free((OP*)mp->mad_val);
3803 sv_free(MUTABLE_SV(mp->mad_val));
3806 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
3809 PerlMemShared_free(mp);
3815 =head1 Optree construction
3817 =for apidoc Am|OP *|newNULLLIST
3819 Constructs, checks, and returns a new C<stub> op, which represents an
3820 empty list expression.
3826 Perl_newNULLLIST(pTHX)
3828 return newOP(OP_STUB, 0);
3832 S_force_list(pTHX_ OP *o)
3834 if (!o || o->op_type != OP_LIST)
3835 o = newLISTOP(OP_LIST, 0, o, NULL);
3841 =for apidoc Am|OP *|newLISTOP|I32 type|I32 flags|OP *first|OP *last
3843 Constructs, checks, and returns an op of any list type. I<type> is
3844 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3845 C<OPf_KIDS> will be set automatically if required. I<first> and I<last>
3846 supply up to two ops to be direct children of the list op; they are
3847 consumed by this function and become part of the constructed op tree.
3853 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3858 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP);
3860 NewOp(1101, listop, 1, LISTOP);
3862 listop->op_type = (OPCODE)type;
3863 listop->op_ppaddr = PL_ppaddr[type];
3866 listop->op_flags = (U8)flags;
3870 else if (!first && last)
3873 first->op_sibling = last;
3874 listop->op_first = first;
3875 listop->op_last = last;
3876 if (type == OP_LIST) {
3877 OP* const pushop = newOP(OP_PUSHMARK, 0);
3878 pushop->op_sibling = first;
3879 listop->op_first = pushop;
3880 listop->op_flags |= OPf_KIDS;
3882 listop->op_last = pushop;
3885 return CHECKOP(type, listop);
3889 =for apidoc Am|OP *|newOP|I32 type|I32 flags
3891 Constructs, checks, and returns an op of any base type (any type that
3892 has no extra fields). I<type> is the opcode. I<flags> gives the
3893 eight bits of C<op_flags>, and, shifted up eight bits, the eight bits
3900 Perl_newOP(pTHX_ I32 type, I32 flags)
3905 if (type == -OP_ENTEREVAL) {
3906 type = OP_ENTEREVAL;
3907 flags |= OPpEVAL_BYTES<<8;
3910 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP
3911 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3912 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3913 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
3915 NewOp(1101, o, 1, OP);
3916 o->op_type = (OPCODE)type;
3917 o->op_ppaddr = PL_ppaddr[type];
3918 o->op_flags = (U8)flags;
3921 o->op_private = (U8)(0 | (flags >> 8));
3922 if (PL_opargs[type] & OA_RETSCALAR)
3924 if (PL_opargs[type] & OA_TARGET)
3925 o->op_targ = pad_alloc(type, SVs_PADTMP);
3926 return CHECKOP(type, o);
3930 =for apidoc Am|OP *|newUNOP|I32 type|I32 flags|OP *first
3932 Constructs, checks, and returns an op of any unary type. I<type> is
3933 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3934 C<OPf_KIDS> will be set automatically if required, and, shifted up eight
3935 bits, the eight bits of C<op_private>, except that the bit with value 1
3936 is automatically set. I<first> supplies an optional op to be the direct
3937 child of the unary op; it is consumed by this function and become part
3938 of the constructed op tree.
3944 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
3949 if (type == -OP_ENTEREVAL) {
3950 type = OP_ENTEREVAL;
3951 flags |= OPpEVAL_BYTES<<8;
3954 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP
3955 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3956 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3957 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP
3958 || type == OP_SASSIGN
3959 || type == OP_ENTERTRY
3960 || type == OP_NULL );
3963 first = newOP(OP_STUB, 0);
3964 if (PL_opargs[type] & OA_MARK)
3965 first = force_list(first);
3967 NewOp(1101, unop, 1, UNOP);
3968 unop->op_type = (OPCODE)type;
3969 unop->op_ppaddr = PL_ppaddr[type];
3970 unop->op_first = first;
3971 unop->op_flags = (U8)(flags | OPf_KIDS);
3972 unop->op_private = (U8)(1 | (flags >> 8));
3973 unop = (UNOP*) CHECKOP(type, unop);
3977 return fold_constants(op_integerize(op_std_init((OP *) unop)));
3981 =for apidoc Am|OP *|newBINOP|I32 type|I32 flags|OP *first|OP *last
3983 Constructs, checks, and returns an op of any binary type. I<type>
3984 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
3985 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
3986 the eight bits of C<op_private>, except that the bit with value 1 or
3987 2 is automatically set as required. I<first> and I<last> supply up to
3988 two ops to be the direct children of the binary op; they are consumed
3989 by this function and become part of the constructed op tree.
3995 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
4000 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP
4001 || type == OP_SASSIGN || type == OP_NULL );
4003 NewOp(1101, binop, 1, BINOP);
4006 first = newOP(OP_NULL, 0);
4008 binop->op_type = (OPCODE)type;
4009 binop->op_ppaddr = PL_ppaddr[type];
4010 binop->op_first = first;
4011 binop->op_flags = (U8)(flags | OPf_KIDS);
4014 binop->op_private = (U8)(1 | (flags >> 8));
4017 binop->op_private = (U8)(2 | (flags >> 8));
4018 first->op_sibling = last;
4021 binop = (BINOP*)CHECKOP(type, binop);
4022 if (binop->op_next || binop->op_type != (OPCODE)type)
4025 binop->op_last = binop->op_first->op_sibling;
4027 return fold_constants(op_integerize(op_std_init((OP *)binop)));
4030 static int uvcompare(const void *a, const void *b)
4031 __attribute__nonnull__(1)
4032 __attribute__nonnull__(2)
4033 __attribute__pure__;
4034 static int uvcompare(const void *a, const void *b)
4036 if (*((const UV *)a) < (*(const UV *)b))
4038 if (*((const UV *)a) > (*(const UV *)b))
4040 if (*((const UV *)a+1) < (*(const UV *)b+1))
4042 if (*((const UV *)a+1) > (*(const UV *)b+1))
4048 S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
4051 SV * const tstr = ((SVOP*)expr)->op_sv;
4054 (repl->op_type == OP_NULL)
4055 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
4057 ((SVOP*)repl)->op_sv;
4060 const U8 *t = (U8*)SvPV_const(tstr, tlen);
4061 const U8 *r = (U8*)SvPV_const(rstr, rlen);
4067 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
4068 const I32 squash = o->op_private & OPpTRANS_SQUASH;
4069 I32 del = o->op_private & OPpTRANS_DELETE;
4072 PERL_ARGS_ASSERT_PMTRANS;
4074 PL_hints |= HINT_BLOCK_SCOPE;
4077 o->op_private |= OPpTRANS_FROM_UTF;
4080 o->op_private |= OPpTRANS_TO_UTF;
4082 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
4083 SV* const listsv = newSVpvs("# comment\n");
4085 const U8* tend = t + tlen;
4086 const U8* rend = r + rlen;
4100 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
4101 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
4104 const U32 flags = UTF8_ALLOW_DEFAULT;
4108 t = tsave = bytes_to_utf8(t, &len);
4111 if (!to_utf && rlen) {
4113 r = rsave = bytes_to_utf8(r, &len);
4117 /* There are several snags with this code on EBCDIC:
4118 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
4119 2. scan_const() in toke.c has encoded chars in native encoding which makes
4120 ranges at least in EBCDIC 0..255 range the bottom odd.
4124 U8 tmpbuf[UTF8_MAXBYTES+1];
4127 Newx(cp, 2*tlen, UV);
4129 transv = newSVpvs("");
4131 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
4133 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
4135 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
4139 cp[2*i+1] = cp[2*i];
4143 qsort(cp, i, 2*sizeof(UV), uvcompare);
4144 for (j = 0; j < i; j++) {
4146 diff = val - nextmin;
4148 t = uvuni_to_utf8(tmpbuf,nextmin);
4149 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4151 U8 range_mark = UTF_TO_NATIVE(0xff);
4152 t = uvuni_to_utf8(tmpbuf, val - 1);
4153 sv_catpvn(transv, (char *)&range_mark, 1);
4154 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4161 t = uvuni_to_utf8(tmpbuf,nextmin);
4162 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4164 U8 range_mark = UTF_TO_NATIVE(0xff);
4165 sv_catpvn(transv, (char *)&range_mark, 1);
4167 t = uvuni_to_utf8(tmpbuf, 0x7fffffff);
4168 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4169 t = (const U8*)SvPVX_const(transv);
4170 tlen = SvCUR(transv);
4174 else if (!rlen && !del) {
4175 r = t; rlen = tlen; rend = tend;
4178 if ((!rlen && !del) || t == r ||
4179 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
4181 o->op_private |= OPpTRANS_IDENTICAL;
4185 while (t < tend || tfirst <= tlast) {
4186 /* see if we need more "t" chars */
4187 if (tfirst > tlast) {
4188 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
4190 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
4192 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
4199 /* now see if we need more "r" chars */
4200 if (rfirst > rlast) {
4202 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
4204 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
4206 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
4215 rfirst = rlast = 0xffffffff;
4219 /* now see which range will peter our first, if either. */
4220 tdiff = tlast - tfirst;
4221 rdiff = rlast - rfirst;
4228 if (rfirst == 0xffffffff) {
4229 diff = tdiff; /* oops, pretend rdiff is infinite */
4231 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
4232 (long)tfirst, (long)tlast);
4234 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
4238 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
4239 (long)tfirst, (long)(tfirst + diff),
4242 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
4243 (long)tfirst, (long)rfirst);
4245 if (rfirst + diff > max)
4246 max = rfirst + diff;
4248 grows = (tfirst < rfirst &&
4249 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
4261 else if (max > 0xff)
4266 swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none));
4268 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP);
4269 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
4270 PAD_SETSV(cPADOPo->op_padix, swash);
4272 SvREADONLY_on(swash);
4274 cSVOPo->op_sv = swash;
4276 SvREFCNT_dec(listsv);
4277 SvREFCNT_dec(transv);
4279 if (!del && havefinal && rlen)
4280 (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5,
4281 newSVuv((UV)final), 0);
4284 o->op_private |= OPpTRANS_GROWS;
4290 op_getmad(expr,o,'e');
4291 op_getmad(repl,o,'r');
4299 tbl = (short*)PerlMemShared_calloc(
4300 (o->op_private & OPpTRANS_COMPLEMENT) &&
4301 !(o->op_private & OPpTRANS_DELETE) ? 258 : 256,
4303 cPVOPo->op_pv = (char*)tbl;
4305 for (i = 0; i < (I32)tlen; i++)
4307 for (i = 0, j = 0; i < 256; i++) {
4309 if (j >= (I32)rlen) {
4318 if (i < 128 && r[j] >= 128)
4328 o->op_private |= OPpTRANS_IDENTICAL;
4330 else if (j >= (I32)rlen)
4335 PerlMemShared_realloc(tbl,
4336 (0x101+rlen-j) * sizeof(short));
4337 cPVOPo->op_pv = (char*)tbl;
4339 tbl[0x100] = (short)(rlen - j);
4340 for (i=0; i < (I32)rlen - j; i++)
4341 tbl[0x101+i] = r[j+i];
4345 if (!rlen && !del) {
4348 o->op_private |= OPpTRANS_IDENTICAL;
4350 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
4351 o->op_private |= OPpTRANS_IDENTICAL;
4353 for (i = 0; i < 256; i++)
4355 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
4356 if (j >= (I32)rlen) {
4358 if (tbl[t[i]] == -1)
4364 if (tbl[t[i]] == -1) {
4365 if (t[i] < 128 && r[j] >= 128)
4372 if(del && rlen == tlen) {
4373 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator");
4374 } else if(rlen > tlen) {
4375 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list");
4379 o->op_private |= OPpTRANS_GROWS;
4381 op_getmad(expr,o,'e');
4382 op_getmad(repl,o,'r');
4392 =for apidoc Am|OP *|newPMOP|I32 type|I32 flags
4394 Constructs, checks, and returns an op of any pattern matching type.
4395 I<type> is the opcode. I<flags> gives the eight bits of C<op_flags>
4396 and, shifted up eight bits, the eight bits of C<op_private>.
4402 Perl_newPMOP(pTHX_ I32 type, I32 flags)
4407 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PMOP);
4409 NewOp(1101, pmop, 1, PMOP);
4410 pmop->op_type = (OPCODE)type;
4411 pmop->op_ppaddr = PL_ppaddr[type];
4412 pmop->op_flags = (U8)flags;
4413 pmop->op_private = (U8)(0 | (flags >> 8));
4415 if (PL_hints & HINT_RE_TAINT)
4416 pmop->op_pmflags |= PMf_RETAINT;
4417 if (IN_LOCALE_COMPILETIME) {
4418 set_regex_charset(&(pmop->op_pmflags), REGEX_LOCALE_CHARSET);
4420 else if ((! (PL_hints & HINT_BYTES))
4421 /* Both UNI_8_BIT and locale :not_characters imply Unicode */
4422 && (PL_hints & (HINT_UNI_8_BIT|HINT_LOCALE_NOT_CHARS)))
4424 set_regex_charset(&(pmop->op_pmflags), REGEX_UNICODE_CHARSET);
4426 if (PL_hints & HINT_RE_FLAGS) {
4427 SV *reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4428 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags"), 0, 0
4430 if (reflags && SvOK(reflags)) pmop->op_pmflags |= SvIV(reflags);
4431 reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4432 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags_charset"), 0, 0
4434 if (reflags && SvOK(reflags)) {
4435 set_regex_charset(&(pmop->op_pmflags), (regex_charset)SvIV(reflags));
4441 assert(SvPOK(PL_regex_pad[0]));
4442 if (SvCUR(PL_regex_pad[0])) {
4443 /* Pop off the "packed" IV from the end. */
4444 SV *const repointer_list = PL_regex_pad[0];
4445 const char *p = SvEND(repointer_list) - sizeof(IV);
4446 const IV offset = *((IV*)p);
4448 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
4450 SvEND_set(repointer_list, p);
4452 pmop->op_pmoffset = offset;
4453 /* This slot should be free, so assert this: */
4454 assert(PL_regex_pad[offset] == &PL_sv_undef);
4456 SV * const repointer = &PL_sv_undef;
4457 av_push(PL_regex_padav, repointer);
4458 pmop->op_pmoffset = av_len(PL_regex_padav);
4459 PL_regex_pad = AvARRAY(PL_regex_padav);
4463 return CHECKOP(type, pmop);
4466 /* Given some sort of match op o, and an expression expr containing a
4467 * pattern, either compile expr into a regex and attach it to o (if it's
4468 * constant), or convert expr into a runtime regcomp op sequence (if it's
4471 * isreg indicates that the pattern is part of a regex construct, eg
4472 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
4473 * split "pattern", which aren't. In the former case, expr will be a list
4474 * if the pattern contains more than one term (eg /a$b/) or if it contains
4475 * a replacement, ie s/// or tr///.
4477 * When the pattern has been compiled within a new anon CV (for
4478 * qr/(?{...})/ ), then floor indicates the savestack level just before
4479 * the new sub was created
4483 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg, I32 floor)
4488 I32 repl_has_vars = 0;
4490 bool is_trans = (o->op_type == OP_TRANS || o->op_type == OP_TRANSR);
4491 bool is_compiletime;
4494 PERL_ARGS_ASSERT_PMRUNTIME;
4496 /* for s/// and tr///, last element in list is the replacement; pop it */
4498 if (is_trans || o->op_type == OP_SUBST) {
4500 repl = cLISTOPx(expr)->op_last;
4501 kid = cLISTOPx(expr)->op_first;
4502 while (kid->op_sibling != repl)
4503 kid = kid->op_sibling;
4504 kid->op_sibling = NULL;
4505 cLISTOPx(expr)->op_last = kid;
4508 /* for TRANS, convert LIST/PUSH/CONST into CONST, and pass to pmtrans() */
4511 OP* const oe = expr;
4512 assert(expr->op_type == OP_LIST);
4513 assert(cLISTOPx(expr)->op_first->op_type == OP_PUSHMARK);
4514 assert(cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last);
4515 expr = cLISTOPx(oe)->op_last;
4516 cLISTOPx(oe)->op_first->op_sibling = NULL;
4517 cLISTOPx(oe)->op_last = NULL;
4520 return pmtrans(o, expr, repl);
4523 /* find whether we have any runtime or code elements;
4524 * at the same time, temporarily set the op_next of each DO block;
4525 * then when we LINKLIST, this will cause the DO blocks to be excluded
4526 * from the op_next chain (and from having LINKLIST recursively
4527 * applied to them). We fix up the DOs specially later */
4531 if (expr->op_type == OP_LIST) {
4533 for (o = cLISTOPx(expr)->op_first; o; o = o->op_sibling) {
4534 if (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)) {
4536 assert(!o->op_next && o->op_sibling);
4537 o->op_next = o->op_sibling;
4539 else if (o->op_type != OP_CONST && o->op_type != OP_PUSHMARK)
4543 else if (expr->op_type != OP_CONST)
4548 /* fix up DO blocks; treat each one as a separate little sub */
4550 if (expr->op_type == OP_LIST) {
4552 for (o = cLISTOPx(expr)->op_first; o; o = o->op_sibling) {
4553 if (!(o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)))
4555 o->op_next = NULL; /* undo temporary hack from above */
4558 if (cLISTOPo->op_first->op_type == OP_LEAVE) {
4559 LISTOP *leaveop = cLISTOPx(cLISTOPo->op_first);
4561 assert(leaveop->op_first->op_type == OP_ENTER);
4562 assert(leaveop->op_first->op_sibling);
4563 o->op_next = leaveop->op_first->op_sibling;
4565 assert(leaveop->op_flags & OPf_KIDS);
4566 assert(leaveop->op_last->op_next == (OP*)leaveop);
4567 leaveop->op_next = NULL; /* stop on last op */
4568 op_null((OP*)leaveop);
4572 OP *scope = cLISTOPo->op_first;
4573 assert(scope->op_type == OP_SCOPE);
4574 assert(scope->op_flags & OPf_KIDS);
4575 scope->op_next = NULL; /* stop on last op */
4578 /* have to peep the DOs individually as we've removed it from
4579 * the op_next chain */
4582 /* runtime finalizes as part of finalizing whole tree */
4587 PL_hints |= HINT_BLOCK_SCOPE;
4589 assert(floor==0 || (pm->op_pmflags & PMf_HAS_CV));
4591 if (is_compiletime) {
4592 U32 rx_flags = pm->op_pmflags & RXf_PMf_COMPILETIME;
4593 regexp_engine const *eng = current_re_engine();
4595 if (o->op_flags & OPf_SPECIAL)
4596 rx_flags |= RXf_SPLIT;
4598 if (!has_code || !eng->op_comp) {
4599 /* compile-time simple constant pattern */
4601 if ((pm->op_pmflags & PMf_HAS_CV) && !has_code) {
4602 /* whoops! we guessed that a qr// had a code block, but we
4603 * were wrong (e.g. /[(?{}]/ ). Throw away the PL_compcv
4604 * that isn't required now. Note that we have to be pretty
4605 * confident that nothing used that CV's pad while the
4606 * regex was parsed */
4607 assert(AvFILLp(PL_comppad) == 0); /* just @_ */
4608 /* But we know that one op is using this CV's slab. */
4609 cv_forget_slab(PL_compcv);
4611 pm->op_pmflags &= ~PMf_HAS_CV;
4616 ? eng->op_comp(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4617 rx_flags, pm->op_pmflags)
4618 : Perl_re_op_compile(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4619 rx_flags, pm->op_pmflags)
4622 op_getmad(expr,(OP*)pm,'e');
4628 /* compile-time pattern that includes literal code blocks */
4629 REGEXP* re = eng->op_comp(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4632 ((PL_hints & HINT_RE_EVAL) ? PMf_USE_RE_EVAL : 0))
4635 if (pm->op_pmflags & PMf_HAS_CV) {
4637 /* this QR op (and the anon sub we embed it in) is never
4638 * actually executed. It's just a placeholder where we can
4639 * squirrel away expr in op_code_list without the peephole
4640 * optimiser etc processing it for a second time */
4641 OP *qr = newPMOP(OP_QR, 0);
4642 ((PMOP*)qr)->op_code_list = expr;
4644 /* handle the implicit sub{} wrapped round the qr/(?{..})/ */
4645 SvREFCNT_inc_simple_void(PL_compcv);
4646 cv = newATTRSUB(floor, 0, NULL, NULL, qr);
4647 ReANY(re)->qr_anoncv = cv;
4649 /* attach the anon CV to the pad so that
4650 * pad_fixup_inner_anons() can find it */
4651 (void)pad_add_anon(cv, o->op_type);
4652 SvREFCNT_inc_simple_void(cv);
4655 pm->op_code_list = expr;
4660 /* runtime pattern: build chain of regcomp etc ops */
4662 PADOFFSET cv_targ = 0;
4664 reglist = isreg && expr->op_type == OP_LIST;
4669 pm->op_code_list = expr;
4670 /* don't free op_code_list; its ops are embedded elsewhere too */
4671 pm->op_pmflags |= PMf_CODELIST_PRIVATE;
4674 if (o->op_flags & OPf_SPECIAL)
4675 pm->op_pmflags |= PMf_SPLIT;
4677 /* the OP_REGCMAYBE is a placeholder in the non-threaded case
4678 * to allow its op_next to be pointed past the regcomp and
4679 * preceding stacking ops;
4680 * OP_REGCRESET is there to reset taint before executing the
4682 if (pm->op_pmflags & PMf_KEEP || TAINTING_get)
4683 expr = newUNOP((TAINTING_get ? OP_REGCRESET : OP_REGCMAYBE),0,expr);
4685 if (pm->op_pmflags & PMf_HAS_CV) {
4686 /* we have a runtime qr with literal code. This means
4687 * that the qr// has been wrapped in a new CV, which
4688 * means that runtime consts, vars etc will have been compiled
4689 * against a new pad. So... we need to execute those ops
4690 * within the environment of the new CV. So wrap them in a call
4691 * to a new anon sub. i.e. for
4695 * we build an anon sub that looks like
4697 * sub { "a", $b, '(?{...})' }
4699 * and call it, passing the returned list to regcomp.
4700 * Or to put it another way, the list of ops that get executed
4704 * ------ -------------------
4705 * pushmark (for regcomp)
4706 * pushmark (for entersub)
4707 * pushmark (for refgen)
4711 * regcreset regcreset
4713 * const("a") const("a")
4715 * const("(?{...})") const("(?{...})")
4720 SvREFCNT_inc_simple_void(PL_compcv);
4721 /* these lines are just an unrolled newANONATTRSUB */
4722 expr = newSVOP(OP_ANONCODE, 0,
4723 MUTABLE_SV(newATTRSUB(floor, 0, NULL, NULL, expr)));
4724 cv_targ = expr->op_targ;
4725 expr = newUNOP(OP_REFGEN, 0, expr);
4727 expr = list(force_list(newUNOP(OP_ENTERSUB, 0, scalar(expr))));
4730 NewOp(1101, rcop, 1, LOGOP);
4731 rcop->op_type = OP_REGCOMP;
4732 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
4733 rcop->op_first = scalar(expr);
4734 rcop->op_flags |= OPf_KIDS
4735 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
4736 | (reglist ? OPf_STACKED : 0);
4737 rcop->op_private = 0;
4739 rcop->op_targ = cv_targ;
4741 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
4742 if (PL_hints & HINT_RE_EVAL) PL_cv_has_eval = 1;
4744 /* establish postfix order */
4745 if (expr->op_type == OP_REGCRESET || expr->op_type == OP_REGCMAYBE) {
4747 rcop->op_next = expr;
4748 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
4751 rcop->op_next = LINKLIST(expr);
4752 expr->op_next = (OP*)rcop;
4755 op_prepend_elem(o->op_type, scalar((OP*)rcop), o);
4761 if (pm->op_pmflags & PMf_EVAL) {
4762 if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end)
4763 CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end);
4765 /* If we are looking at s//.../e with a single statement, get past
4766 the implicit do{}. */
4767 if (curop->op_type == OP_NULL && curop->op_flags & OPf_KIDS
4768 && cUNOPx(curop)->op_first->op_type == OP_SCOPE
4769 && cUNOPx(curop)->op_first->op_flags & OPf_KIDS) {
4770 OP *kid = cUNOPx(cUNOPx(curop)->op_first)->op_first;
4771 if (kid->op_type == OP_NULL && kid->op_sibling
4772 && !kid->op_sibling->op_sibling)
4773 curop = kid->op_sibling;
4775 if (curop->op_type == OP_CONST)
4777 else if (( (curop->op_type == OP_RV2SV ||
4778 curop->op_type == OP_RV2AV ||
4779 curop->op_type == OP_RV2HV ||
4780 curop->op_type == OP_RV2GV)
4781 && cUNOPx(curop)->op_first
4782 && cUNOPx(curop)->op_first->op_type == OP_GV )
4783 || curop->op_type == OP_PADSV
4784 || curop->op_type == OP_PADAV
4785 || curop->op_type == OP_PADHV
4786 || curop->op_type == OP_PADANY) {
4794 || !RX_PRELEN(PM_GETRE(pm))
4795 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
4797 pm->op_pmflags |= PMf_CONST; /* const for long enough */
4798 op_prepend_elem(o->op_type, scalar(repl), o);
4801 NewOp(1101, rcop, 1, LOGOP);
4802 rcop->op_type = OP_SUBSTCONT;
4803 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
4804 rcop->op_first = scalar(repl);
4805 rcop->op_flags |= OPf_KIDS;
4806 rcop->op_private = 1;
4809 /* establish postfix order */
4810 rcop->op_next = LINKLIST(repl);
4811 repl->op_next = (OP*)rcop;
4813 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
4814 assert(!(pm->op_pmflags & PMf_ONCE));
4815 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
4824 =for apidoc Am|OP *|newSVOP|I32 type|I32 flags|SV *sv
4826 Constructs, checks, and returns an op of any type that involves an
4827 embedded SV. I<type> is the opcode. I<flags> gives the eight bits
4828 of C<op_flags>. I<sv> gives the SV to embed in the op; this function
4829 takes ownership of one reference to it.
4835 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
4840 PERL_ARGS_ASSERT_NEWSVOP;
4842 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4843 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4844 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4846 NewOp(1101, svop, 1, SVOP);
4847 svop->op_type = (OPCODE)type;
4848 svop->op_ppaddr = PL_ppaddr[type];
4850 svop->op_next = (OP*)svop;
4851 svop->op_flags = (U8)flags;
4852 svop->op_private = (U8)(0 | (flags >> 8));
4853 if (PL_opargs[type] & OA_RETSCALAR)
4855 if (PL_opargs[type] & OA_TARGET)
4856 svop->op_targ = pad_alloc(type, SVs_PADTMP);
4857 return CHECKOP(type, svop);
4863 =for apidoc Am|OP *|newPADOP|I32 type|I32 flags|SV *sv
4865 Constructs, checks, and returns an op of any type that involves a
4866 reference to a pad element. I<type> is the opcode. I<flags> gives the
4867 eight bits of C<op_flags>. A pad slot is automatically allocated, and
4868 is populated with I<sv>; this function takes ownership of one reference
4871 This function only exists if Perl has been compiled to use ithreads.
4877 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
4882 PERL_ARGS_ASSERT_NEWPADOP;
4884 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4885 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4886 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4888 NewOp(1101, padop, 1, PADOP);
4889 padop->op_type = (OPCODE)type;
4890 padop->op_ppaddr = PL_ppaddr[type];
4891 padop->op_padix = pad_alloc(type, SVs_PADTMP);
4892 SvREFCNT_dec(PAD_SVl(padop->op_padix));
4893 PAD_SETSV(padop->op_padix, sv);
4896 padop->op_next = (OP*)padop;
4897 padop->op_flags = (U8)flags;
4898 if (PL_opargs[type] & OA_RETSCALAR)
4900 if (PL_opargs[type] & OA_TARGET)
4901 padop->op_targ = pad_alloc(type, SVs_PADTMP);
4902 return CHECKOP(type, padop);
4905 #endif /* !USE_ITHREADS */
4908 =for apidoc Am|OP *|newGVOP|I32 type|I32 flags|GV *gv
4910 Constructs, checks, and returns an op of any type that involves an
4911 embedded reference to a GV. I<type> is the opcode. I<flags> gives the
4912 eight bits of C<op_flags>. I<gv> identifies the GV that the op should
4913 reference; calling this function does not transfer ownership of any
4920 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
4924 PERL_ARGS_ASSERT_NEWGVOP;
4928 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4930 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4935 =for apidoc Am|OP *|newPVOP|I32 type|I32 flags|char *pv
4937 Constructs, checks, and returns an op of any type that involves an
4938 embedded C-level pointer (PV). I<type> is the opcode. I<flags> gives
4939 the eight bits of C<op_flags>. I<pv> supplies the C-level pointer, which
4940 must have been allocated using L</PerlMemShared_malloc>; the memory will
4941 be freed when the op is destroyed.
4947 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
4950 const bool utf8 = cBOOL(flags & SVf_UTF8);
4955 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4957 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
4959 NewOp(1101, pvop, 1, PVOP);
4960 pvop->op_type = (OPCODE)type;
4961 pvop->op_ppaddr = PL_ppaddr[type];
4963 pvop->op_next = (OP*)pvop;
4964 pvop->op_flags = (U8)flags;
4965 pvop->op_private = utf8 ? OPpPV_IS_UTF8 : 0;
4966 if (PL_opargs[type] & OA_RETSCALAR)
4968 if (PL_opargs[type] & OA_TARGET)
4969 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
4970 return CHECKOP(type, pvop);
4978 Perl_package(pTHX_ OP *o)
4981 SV *const sv = cSVOPo->op_sv;
4986 PERL_ARGS_ASSERT_PACKAGE;
4988 SAVEGENERICSV(PL_curstash);
4989 save_item(PL_curstname);
4991 PL_curstash = (HV *)SvREFCNT_inc(gv_stashsv(sv, GV_ADD));
4993 sv_setsv(PL_curstname, sv);
4995 PL_hints |= HINT_BLOCK_SCOPE;
4996 PL_parser->copline = NOLINE;
4997 PL_parser->expect = XSTATE;
5002 if (!PL_madskills) {
5007 pegop = newOP(OP_NULL,0);
5008 op_getmad(o,pegop,'P');
5014 Perl_package_version( pTHX_ OP *v )
5017 U32 savehints = PL_hints;
5018 PERL_ARGS_ASSERT_PACKAGE_VERSION;
5019 PL_hints &= ~HINT_STRICT_VARS;
5020 sv_setsv( GvSV(gv_fetchpvs("VERSION", GV_ADDMULTI, SVt_PV)), cSVOPx(v)->op_sv );
5021 PL_hints = savehints;
5030 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
5037 OP *pegop = PL_madskills ? newOP(OP_NULL,0) : NULL;
5039 SV *use_version = NULL;
5041 PERL_ARGS_ASSERT_UTILIZE;
5043 if (idop->op_type != OP_CONST)
5044 Perl_croak(aTHX_ "Module name must be constant");
5047 op_getmad(idop,pegop,'U');
5052 SV * const vesv = ((SVOP*)version)->op_sv;
5055 op_getmad(version,pegop,'V');
5056 if (!arg && !SvNIOKp(vesv)) {
5063 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
5064 Perl_croak(aTHX_ "Version number must be a constant number");
5066 /* Make copy of idop so we don't free it twice */
5067 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
5069 /* Fake up a method call to VERSION */
5070 meth = newSVpvs_share("VERSION");
5071 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
5072 op_append_elem(OP_LIST,
5073 op_prepend_elem(OP_LIST, pack, list(version)),
5074 newSVOP(OP_METHOD_NAMED, 0, meth)));
5078 /* Fake up an import/unimport */
5079 if (arg && arg->op_type == OP_STUB) {
5081 op_getmad(arg,pegop,'S');
5082 imop = arg; /* no import on explicit () */
5084 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
5085 imop = NULL; /* use 5.0; */
5087 use_version = ((SVOP*)idop)->op_sv;
5089 idop->op_private |= OPpCONST_NOVER;
5095 op_getmad(arg,pegop,'A');
5097 /* Make copy of idop so we don't free it twice */
5098 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
5100 /* Fake up a method call to import/unimport */
5102 ? newSVpvs_share("import") : newSVpvs_share("unimport");
5103 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
5104 op_append_elem(OP_LIST,
5105 op_prepend_elem(OP_LIST, pack, list(arg)),
5106 newSVOP(OP_METHOD_NAMED, 0, meth)));
5109 /* Fake up the BEGIN {}, which does its thing immediately. */
5111 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
5114 op_append_elem(OP_LINESEQ,
5115 op_append_elem(OP_LINESEQ,
5116 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
5117 newSTATEOP(0, NULL, veop)),
5118 newSTATEOP(0, NULL, imop) ));
5122 * feature bundle that corresponds to the required version. */
5123 use_version = sv_2mortal(new_version(use_version));
5124 S_enable_feature_bundle(aTHX_ use_version);
5126 /* If a version >= 5.11.0 is requested, strictures are on by default! */
5127 if (vcmp(use_version,
5128 sv_2mortal(upg_version(newSVnv(5.011000), FALSE))) >= 0) {
5129 if (!(PL_hints & HINT_EXPLICIT_STRICT_REFS))
5130 PL_hints |= HINT_STRICT_REFS;
5131 if (!(PL_hints & HINT_EXPLICIT_STRICT_SUBS))
5132 PL_hints |= HINT_STRICT_SUBS;
5133 if (!(PL_hints & HINT_EXPLICIT_STRICT_VARS))
5134 PL_hints |= HINT_STRICT_VARS;
5136 /* otherwise they are off */
5138 if (!(PL_hints & HINT_EXPLICIT_STRICT_REFS))
5139 PL_hints &= ~HINT_STRICT_REFS;
5140 if (!(PL_hints & HINT_EXPLICIT_STRICT_SUBS))
5141 PL_hints &= ~HINT_STRICT_SUBS;
5142 if (!(PL_hints & HINT_EXPLICIT_STRICT_VARS))
5143 PL_hints &= ~HINT_STRICT_VARS;
5147 /* The "did you use incorrect case?" warning used to be here.
5148 * The problem is that on case-insensitive filesystems one
5149 * might get false positives for "use" (and "require"):
5150 * "use Strict" or "require CARP" will work. This causes
5151 * portability problems for the script: in case-strict
5152 * filesystems the script will stop working.
5154 * The "incorrect case" warning checked whether "use Foo"
5155 * imported "Foo" to your namespace, but that is wrong, too:
5156 * there is no requirement nor promise in the language that
5157 * a Foo.pm should or would contain anything in package "Foo".
5159 * There is very little Configure-wise that can be done, either:
5160 * the case-sensitivity of the build filesystem of Perl does not
5161 * help in guessing the case-sensitivity of the runtime environment.
5164 PL_hints |= HINT_BLOCK_SCOPE;
5165 PL_parser->copline = NOLINE;
5166 PL_parser->expect = XSTATE;
5167 PL_cop_seqmax++; /* Purely for B::*'s benefit */
5168 if (PL_cop_seqmax == PERL_PADSEQ_INTRO) /* not a legal value */
5177 =head1 Embedding Functions
5179 =for apidoc load_module
5181 Loads the module whose name is pointed to by the string part of name.
5182 Note that the actual module name, not its filename, should be given.
5183 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
5184 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
5185 (or 0 for no flags). ver, if specified and not NULL, provides version semantics
5186 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
5187 arguments can be used to specify arguments to the module's import()
5188 method, similar to C<use Foo::Bar VERSION LIST>. They must be
5189 terminated with a final NULL pointer. Note that this list can only
5190 be omitted when the PERL_LOADMOD_NOIMPORT flag has been used.
5191 Otherwise at least a single NULL pointer to designate the default
5192 import list is required.
5194 The reference count for each specified C<SV*> parameter is decremented.
5199 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
5203 PERL_ARGS_ASSERT_LOAD_MODULE;
5205 va_start(args, ver);
5206 vload_module(flags, name, ver, &args);
5210 #ifdef PERL_IMPLICIT_CONTEXT
5212 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
5216 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
5217 va_start(args, ver);
5218 vload_module(flags, name, ver, &args);
5224 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
5228 OP * const modname = newSVOP(OP_CONST, 0, name);
5230 PERL_ARGS_ASSERT_VLOAD_MODULE;
5232 modname->op_private |= OPpCONST_BARE;
5234 veop = newSVOP(OP_CONST, 0, ver);
5238 if (flags & PERL_LOADMOD_NOIMPORT) {
5239 imop = sawparens(newNULLLIST());
5241 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
5242 imop = va_arg(*args, OP*);
5247 sv = va_arg(*args, SV*);
5249 imop = op_append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
5250 sv = va_arg(*args, SV*);
5254 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
5255 * that it has a PL_parser to play with while doing that, and also
5256 * that it doesn't mess with any existing parser, by creating a tmp
5257 * new parser with lex_start(). This won't actually be used for much,
5258 * since pp_require() will create another parser for the real work. */
5261 SAVEVPTR(PL_curcop);
5262 lex_start(NULL, NULL, LEX_START_SAME_FILTER);
5263 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
5264 veop, modname, imop);
5269 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
5275 PERL_ARGS_ASSERT_DOFILE;
5277 if (!force_builtin) {
5278 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
5279 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
5280 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
5281 gv = gvp ? *gvp : NULL;
5285 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
5286 doop = newUNOP(OP_ENTERSUB, OPf_STACKED,
5287 op_append_elem(OP_LIST, term,
5288 scalar(newUNOP(OP_RV2CV, 0,
5289 newGVOP(OP_GV, 0, gv)))));
5292 doop = newUNOP(OP_DOFILE, 0, scalar(term));
5298 =head1 Optree construction
5300 =for apidoc Am|OP *|newSLICEOP|I32 flags|OP *subscript|OP *listval
5302 Constructs, checks, and returns an C<lslice> (list slice) op. I<flags>
5303 gives the eight bits of C<op_flags>, except that C<OPf_KIDS> will
5304 be set automatically, and, shifted up eight bits, the eight bits of
5305 C<op_private>, except that the bit with value 1 or 2 is automatically
5306 set as required. I<listval> and I<subscript> supply the parameters of
5307 the slice; they are consumed by this function and become part of the
5308 constructed op tree.
5314 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
5316 return newBINOP(OP_LSLICE, flags,
5317 list(force_list(subscript)),
5318 list(force_list(listval)) );
5322 S_is_list_assignment(pTHX_ const OP *o)
5330 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
5331 o = cUNOPo->op_first;
5333 flags = o->op_flags;
5335 if (type == OP_COND_EXPR) {
5336 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
5337 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
5342 yyerror("Assignment to both a list and a scalar");
5346 if (type == OP_LIST &&
5347 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
5348 o->op_private & OPpLVAL_INTRO)
5351 if (type == OP_LIST || flags & OPf_PARENS ||
5352 type == OP_RV2AV || type == OP_RV2HV ||
5353 type == OP_ASLICE || type == OP_HSLICE)
5356 if (type == OP_PADAV || type == OP_PADHV)
5359 if (type == OP_RV2SV)
5366 Helper function for newASSIGNOP to detection commonality between the
5367 lhs and the rhs. Marks all variables with PL_generation. If it
5368 returns TRUE the assignment must be able to handle common variables.
5370 PERL_STATIC_INLINE bool
5371 S_aassign_common_vars(pTHX_ OP* o)
5374 for (curop = cUNOPo->op_first; curop; curop=curop->op_sibling) {
5375 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
5376 if (curop->op_type == OP_GV) {
5377 GV *gv = cGVOPx_gv(curop);
5379 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5381 GvASSIGN_GENERATION_set(gv, PL_generation);
5383 else if (curop->op_type == OP_PADSV ||
5384 curop->op_type == OP_PADAV ||
5385 curop->op_type == OP_PADHV ||
5386 curop->op_type == OP_PADANY)
5388 if (PAD_COMPNAME_GEN(curop->op_targ)
5389 == (STRLEN)PL_generation)
5391 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
5394 else if (curop->op_type == OP_RV2CV)
5396 else if (curop->op_type == OP_RV2SV ||
5397 curop->op_type == OP_RV2AV ||
5398 curop->op_type == OP_RV2HV ||
5399 curop->op_type == OP_RV2GV) {
5400 if (cUNOPx(curop)->op_first->op_type != OP_GV) /* funny deref? */
5403 else if (curop->op_type == OP_PUSHRE) {
5405 if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) {
5406 GV *const gv = MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff));
5408 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5410 GvASSIGN_GENERATION_set(gv, PL_generation);
5414 = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
5417 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5419 GvASSIGN_GENERATION_set(gv, PL_generation);
5427 if (curop->op_flags & OPf_KIDS) {
5428 if (aassign_common_vars(curop))
5436 =for apidoc Am|OP *|newASSIGNOP|I32 flags|OP *left|I32 optype|OP *right
5438 Constructs, checks, and returns an assignment op. I<left> and I<right>
5439 supply the parameters of the assignment; they are consumed by this
5440 function and become part of the constructed op tree.
5442 If I<optype> is C<OP_ANDASSIGN>, C<OP_ORASSIGN>, or C<OP_DORASSIGN>, then
5443 a suitable conditional optree is constructed. If I<optype> is the opcode
5444 of a binary operator, such as C<OP_BIT_OR>, then an op is constructed that
5445 performs the binary operation and assigns the result to the left argument.
5446 Either way, if I<optype> is non-zero then I<flags> has no effect.
5448 If I<optype> is zero, then a plain scalar or list assignment is
5449 constructed. Which type of assignment it is is automatically determined.
5450 I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5451 will be set automatically, and, shifted up eight bits, the eight bits
5452 of C<op_private>, except that the bit with value 1 or 2 is automatically
5459 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
5465 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
5466 return newLOGOP(optype, 0,
5467 op_lvalue(scalar(left), optype),
5468 newUNOP(OP_SASSIGN, 0, scalar(right)));
5471 return newBINOP(optype, OPf_STACKED,
5472 op_lvalue(scalar(left), optype), scalar(right));
5476 if (is_list_assignment(left)) {
5477 static const char no_list_state[] = "Initialization of state variables"
5478 " in list context currently forbidden";
5480 bool maybe_common_vars = TRUE;
5483 left = op_lvalue(left, OP_AASSIGN);
5484 curop = list(force_list(left));
5485 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
5486 o->op_private = (U8)(0 | (flags >> 8));
5488 if ((left->op_type == OP_LIST
5489 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
5491 OP* lop = ((LISTOP*)left)->op_first;
5492 maybe_common_vars = FALSE;
5494 if (lop->op_type == OP_PADSV ||
5495 lop->op_type == OP_PADAV ||
5496 lop->op_type == OP_PADHV ||
5497 lop->op_type == OP_PADANY) {
5498 if (!(lop->op_private & OPpLVAL_INTRO))
5499 maybe_common_vars = TRUE;
5501 if (lop->op_private & OPpPAD_STATE) {
5502 if (left->op_private & OPpLVAL_INTRO) {
5503 /* Each variable in state($a, $b, $c) = ... */
5506 /* Each state variable in
5507 (state $a, my $b, our $c, $d, undef) = ... */
5509 yyerror(no_list_state);
5511 /* Each my variable in
5512 (state $a, my $b, our $c, $d, undef) = ... */
5514 } else if (lop->op_type == OP_UNDEF ||
5515 lop->op_type == OP_PUSHMARK) {
5516 /* undef may be interesting in
5517 (state $a, undef, state $c) */
5519 /* Other ops in the list. */
5520 maybe_common_vars = TRUE;
5522 lop = lop->op_sibling;
5525 else if ((left->op_private & OPpLVAL_INTRO)
5526 && ( left->op_type == OP_PADSV
5527 || left->op_type == OP_PADAV
5528 || left->op_type == OP_PADHV
5529 || left->op_type == OP_PADANY))
5531 if (left->op_type == OP_PADSV) maybe_common_vars = FALSE;
5532 if (left->op_private & OPpPAD_STATE) {
5533 /* All single variable list context state assignments, hence
5543 yyerror(no_list_state);
5547 /* PL_generation sorcery:
5548 * an assignment like ($a,$b) = ($c,$d) is easier than
5549 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
5550 * To detect whether there are common vars, the global var
5551 * PL_generation is incremented for each assign op we compile.
5552 * Then, while compiling the assign op, we run through all the
5553 * variables on both sides of the assignment, setting a spare slot
5554 * in each of them to PL_generation. If any of them already have
5555 * that value, we know we've got commonality. We could use a
5556 * single bit marker, but then we'd have to make 2 passes, first
5557 * to clear the flag, then to test and set it. To find somewhere
5558 * to store these values, evil chicanery is done with SvUVX().
5561 if (maybe_common_vars) {
5563 if (aassign_common_vars(o))
5564 o->op_private |= OPpASSIGN_COMMON;
5568 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
5569 OP* tmpop = ((LISTOP*)right)->op_first;
5570 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
5571 PMOP * const pm = (PMOP*)tmpop;
5572 if (left->op_type == OP_RV2AV &&
5573 !(left->op_private & OPpLVAL_INTRO) &&
5574 !(o->op_private & OPpASSIGN_COMMON) )
5576 tmpop = ((UNOP*)left)->op_first;
5577 if (tmpop->op_type == OP_GV
5579 && !pm->op_pmreplrootu.op_pmtargetoff
5581 && !pm->op_pmreplrootu.op_pmtargetgv
5585 pm->op_pmreplrootu.op_pmtargetoff
5586 = cPADOPx(tmpop)->op_padix;
5587 cPADOPx(tmpop)->op_padix = 0; /* steal it */
5589 pm->op_pmreplrootu.op_pmtargetgv
5590 = MUTABLE_GV(cSVOPx(tmpop)->op_sv);
5591 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
5593 tmpop = cUNOPo->op_first; /* to list (nulled) */
5594 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
5595 tmpop->op_sibling = NULL; /* don't free split */
5596 right->op_next = tmpop->op_next; /* fix starting loc */
5597 op_free(o); /* blow off assign */
5598 right->op_flags &= ~OPf_WANT;
5599 /* "I don't know and I don't care." */
5604 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
5605 ((LISTOP*)right)->op_last->op_type == OP_CONST)
5607 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
5608 if (SvIOK(sv) && SvIVX(sv) == 0)
5609 sv_setiv(sv, PL_modcount+1);
5617 right = newOP(OP_UNDEF, 0);
5618 if (right->op_type == OP_READLINE) {
5619 right->op_flags |= OPf_STACKED;
5620 return newBINOP(OP_NULL, flags, op_lvalue(scalar(left), OP_SASSIGN),
5624 o = newBINOP(OP_SASSIGN, flags,
5625 scalar(right), op_lvalue(scalar(left), OP_SASSIGN) );
5631 =for apidoc Am|OP *|newSTATEOP|I32 flags|char *label|OP *o
5633 Constructs a state op (COP). The state op is normally a C<nextstate> op,
5634 but will be a C<dbstate> op if debugging is enabled for currently-compiled
5635 code. The state op is populated from L</PL_curcop> (or L</PL_compiling>).
5636 If I<label> is non-null, it supplies the name of a label to attach to
5637 the state op; this function takes ownership of the memory pointed at by
5638 I<label>, and will free it. I<flags> gives the eight bits of C<op_flags>
5641 If I<o> is null, the state op is returned. Otherwise the state op is
5642 combined with I<o> into a C<lineseq> list op, which is returned. I<o>
5643 is consumed by this function and becomes part of the returned op tree.
5649 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
5652 const U32 seq = intro_my();
5653 const U32 utf8 = flags & SVf_UTF8;
5658 NewOp(1101, cop, 1, COP);
5659 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
5660 cop->op_type = OP_DBSTATE;
5661 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
5664 cop->op_type = OP_NEXTSTATE;
5665 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
5667 cop->op_flags = (U8)flags;
5668 CopHINTS_set(cop, PL_hints);
5670 cop->op_private |= NATIVE_HINTS;
5672 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
5673 cop->op_next = (OP*)cop;
5676 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
5677 CopHINTHASH_set(cop, cophh_copy(CopHINTHASH_get(PL_curcop)));
5679 Perl_cop_store_label(aTHX_ cop, label, strlen(label), utf8);
5681 PL_hints |= HINT_BLOCK_SCOPE;
5682 /* It seems that we need to defer freeing this pointer, as other parts
5683 of the grammar end up wanting to copy it after this op has been
5688 if (PL_parser && PL_parser->copline == NOLINE)
5689 CopLINE_set(cop, CopLINE(PL_curcop));
5691 CopLINE_set(cop, PL_parser->copline);
5692 PL_parser->copline = NOLINE;
5695 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
5697 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
5699 CopSTASH_set(cop, PL_curstash);
5701 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) {
5702 /* this line can have a breakpoint - store the cop in IV */
5703 AV *av = CopFILEAVx(PL_curcop);
5705 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
5706 if (svp && *svp != &PL_sv_undef ) {
5707 (void)SvIOK_on(*svp);
5708 SvIV_set(*svp, PTR2IV(cop));
5713 if (flags & OPf_SPECIAL)
5715 return op_prepend_elem(OP_LINESEQ, (OP*)cop, o);
5719 =for apidoc Am|OP *|newLOGOP|I32 type|I32 flags|OP *first|OP *other
5721 Constructs, checks, and returns a logical (flow control) op. I<type>
5722 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
5723 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
5724 the eight bits of C<op_private>, except that the bit with value 1 is
5725 automatically set. I<first> supplies the expression controlling the
5726 flow, and I<other> supplies the side (alternate) chain of ops; they are
5727 consumed by this function and become part of the constructed op tree.
5733 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
5737 PERL_ARGS_ASSERT_NEWLOGOP;
5739 return new_logop(type, flags, &first, &other);
5743 S_search_const(pTHX_ OP *o)
5745 PERL_ARGS_ASSERT_SEARCH_CONST;
5747 switch (o->op_type) {
5751 if (o->op_flags & OPf_KIDS)
5752 return search_const(cUNOPo->op_first);
5759 if (!(o->op_flags & OPf_KIDS))
5761 kid = cLISTOPo->op_first;
5763 switch (kid->op_type) {
5767 kid = kid->op_sibling;
5770 if (kid != cLISTOPo->op_last)
5776 kid = cLISTOPo->op_last;
5778 return search_const(kid);
5786 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
5794 int prepend_not = 0;
5796 PERL_ARGS_ASSERT_NEW_LOGOP;
5801 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
5802 return newBINOP(type, flags, scalar(first), scalar(other));
5804 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOGOP);
5806 scalarboolean(first);
5807 /* optimize AND and OR ops that have NOTs as children */
5808 if (first->op_type == OP_NOT
5809 && (first->op_flags & OPf_KIDS)
5810 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
5811 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
5813 if (type == OP_AND || type == OP_OR) {
5819 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
5821 prepend_not = 1; /* prepend a NOT op later */
5825 /* search for a constant op that could let us fold the test */
5826 if ((cstop = search_const(first))) {
5827 if (cstop->op_private & OPpCONST_STRICT)
5828 no_bareword_allowed(cstop);
5829 else if ((cstop->op_private & OPpCONST_BARE))
5830 Perl_ck_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
5831 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
5832 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
5833 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
5835 if (other->op_type == OP_CONST)
5836 other->op_private |= OPpCONST_SHORTCIRCUIT;
5838 OP *newop = newUNOP(OP_NULL, 0, other);
5839 op_getmad(first, newop, '1');
5840 newop->op_targ = type; /* set "was" field */
5844 if (other->op_type == OP_LEAVE)
5845 other = newUNOP(OP_NULL, OPf_SPECIAL, other);
5846 else if (other->op_type == OP_MATCH
5847 || other->op_type == OP_SUBST
5848 || other->op_type == OP_TRANSR
5849 || other->op_type == OP_TRANS)
5850 /* Mark the op as being unbindable with =~ */
5851 other->op_flags |= OPf_SPECIAL;
5852 else if (other->op_type == OP_CONST)
5853 other->op_private |= OPpCONST_FOLDED;
5857 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
5858 const OP *o2 = other;
5859 if ( ! (o2->op_type == OP_LIST
5860 && (( o2 = cUNOPx(o2)->op_first))
5861 && o2->op_type == OP_PUSHMARK
5862 && (( o2 = o2->op_sibling)) )
5865 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
5866 || o2->op_type == OP_PADHV)
5867 && o2->op_private & OPpLVAL_INTRO
5868 && !(o2->op_private & OPpPAD_STATE))
5870 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
5871 "Deprecated use of my() in false conditional");
5875 if (first->op_type == OP_CONST)
5876 first->op_private |= OPpCONST_SHORTCIRCUIT;
5878 first = newUNOP(OP_NULL, 0, first);
5879 op_getmad(other, first, '2');
5880 first->op_targ = type; /* set "was" field */
5887 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
5888 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
5890 const OP * const k1 = ((UNOP*)first)->op_first;
5891 const OP * const k2 = k1->op_sibling;
5893 switch (first->op_type)
5896 if (k2 && k2->op_type == OP_READLINE
5897 && (k2->op_flags & OPf_STACKED)
5898 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5900 warnop = k2->op_type;
5905 if (k1->op_type == OP_READDIR
5906 || k1->op_type == OP_GLOB
5907 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5908 || k1->op_type == OP_EACH
5909 || k1->op_type == OP_AEACH)
5911 warnop = ((k1->op_type == OP_NULL)
5912 ? (OPCODE)k1->op_targ : k1->op_type);
5917 const line_t oldline = CopLINE(PL_curcop);
5918 /* This ensures that warnings are reported at the first line
5919 of the construction, not the last. */
5920 CopLINE_set(PL_curcop, PL_parser->copline);
5921 Perl_warner(aTHX_ packWARN(WARN_MISC),
5922 "Value of %s%s can be \"0\"; test with defined()",
5924 ((warnop == OP_READLINE || warnop == OP_GLOB)
5925 ? " construct" : "() operator"));
5926 CopLINE_set(PL_curcop, oldline);
5933 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
5934 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
5936 NewOp(1101, logop, 1, LOGOP);
5938 logop->op_type = (OPCODE)type;
5939 logop->op_ppaddr = PL_ppaddr[type];
5940 logop->op_first = first;
5941 logop->op_flags = (U8)(flags | OPf_KIDS);
5942 logop->op_other = LINKLIST(other);
5943 logop->op_private = (U8)(1 | (flags >> 8));
5945 /* establish postfix order */
5946 logop->op_next = LINKLIST(first);
5947 first->op_next = (OP*)logop;
5948 first->op_sibling = other;
5950 CHECKOP(type,logop);
5952 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
5959 =for apidoc Am|OP *|newCONDOP|I32 flags|OP *first|OP *trueop|OP *falseop
5961 Constructs, checks, and returns a conditional-expression (C<cond_expr>)
5962 op. I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5963 will be set automatically, and, shifted up eight bits, the eight bits of
5964 C<op_private>, except that the bit with value 1 is automatically set.
5965 I<first> supplies the expression selecting between the two branches,
5966 and I<trueop> and I<falseop> supply the branches; they are consumed by
5967 this function and become part of the constructed op tree.
5973 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
5981 PERL_ARGS_ASSERT_NEWCONDOP;
5984 return newLOGOP(OP_AND, 0, first, trueop);
5986 return newLOGOP(OP_OR, 0, first, falseop);
5988 scalarboolean(first);
5989 if ((cstop = search_const(first))) {
5990 /* Left or right arm of the conditional? */
5991 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
5992 OP *live = left ? trueop : falseop;
5993 OP *const dead = left ? falseop : trueop;
5994 if (cstop->op_private & OPpCONST_BARE &&
5995 cstop->op_private & OPpCONST_STRICT) {
5996 no_bareword_allowed(cstop);
5999 /* This is all dead code when PERL_MAD is not defined. */
6000 live = newUNOP(OP_NULL, 0, live);
6001 op_getmad(first, live, 'C');
6002 op_getmad(dead, live, left ? 'e' : 't');
6007 if (live->op_type == OP_LEAVE)
6008 live = newUNOP(OP_NULL, OPf_SPECIAL, live);
6009 else if (live->op_type == OP_MATCH || live->op_type == OP_SUBST
6010 || live->op_type == OP_TRANS || live->op_type == OP_TRANSR)
6011 /* Mark the op as being unbindable with =~ */
6012 live->op_flags |= OPf_SPECIAL;
6013 else if (live->op_type == OP_CONST)
6014 live->op_private |= OPpCONST_FOLDED;
6017 NewOp(1101, logop, 1, LOGOP);
6018 logop->op_type = OP_COND_EXPR;
6019 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
6020 logop->op_first = first;
6021 logop->op_flags = (U8)(flags | OPf_KIDS);
6022 logop->op_private = (U8)(1 | (flags >> 8));
6023 logop->op_other = LINKLIST(trueop);
6024 logop->op_next = LINKLIST(falseop);
6026 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
6029 /* establish postfix order */
6030 start = LINKLIST(first);
6031 first->op_next = (OP*)logop;
6033 first->op_sibling = trueop;
6034 trueop->op_sibling = falseop;
6035 o = newUNOP(OP_NULL, 0, (OP*)logop);
6037 trueop->op_next = falseop->op_next = o;
6044 =for apidoc Am|OP *|newRANGE|I32 flags|OP *left|OP *right
6046 Constructs and returns a C<range> op, with subordinate C<flip> and
6047 C<flop> ops. I<flags> gives the eight bits of C<op_flags> for the
6048 C<flip> op and, shifted up eight bits, the eight bits of C<op_private>
6049 for both the C<flip> and C<range> ops, except that the bit with value
6050 1 is automatically set. I<left> and I<right> supply the expressions
6051 controlling the endpoints of the range; they are consumed by this function
6052 and become part of the constructed op tree.
6058 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
6067 PERL_ARGS_ASSERT_NEWRANGE;
6069 NewOp(1101, range, 1, LOGOP);
6071 range->op_type = OP_RANGE;
6072 range->op_ppaddr = PL_ppaddr[OP_RANGE];
6073 range->op_first = left;
6074 range->op_flags = OPf_KIDS;
6075 leftstart = LINKLIST(left);
6076 range->op_other = LINKLIST(right);
6077 range->op_private = (U8)(1 | (flags >> 8));
6079 left->op_sibling = right;
6081 range->op_next = (OP*)range;
6082 flip = newUNOP(OP_FLIP, flags, (OP*)range);
6083 flop = newUNOP(OP_FLOP, 0, flip);
6084 o = newUNOP(OP_NULL, 0, flop);
6086 range->op_next = leftstart;
6088 left->op_next = flip;
6089 right->op_next = flop;
6091 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
6092 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
6093 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
6094 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
6096 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
6097 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
6099 /* check barewords before they might be optimized aways */
6100 if (flip->op_private && cSVOPx(left)->op_private & OPpCONST_STRICT)
6101 no_bareword_allowed(left);
6102 if (flop->op_private && cSVOPx(right)->op_private & OPpCONST_STRICT)
6103 no_bareword_allowed(right);
6106 if (!flip->op_private || !flop->op_private)
6107 LINKLIST(o); /* blow off optimizer unless constant */
6113 =for apidoc Am|OP *|newLOOPOP|I32 flags|I32 debuggable|OP *expr|OP *block
6115 Constructs, checks, and returns an op tree expressing a loop. This is
6116 only a loop in the control flow through the op tree; it does not have
6117 the heavyweight loop structure that allows exiting the loop by C<last>
6118 and suchlike. I<flags> gives the eight bits of C<op_flags> for the
6119 top-level op, except that some bits will be set automatically as required.
6120 I<expr> supplies the expression controlling loop iteration, and I<block>
6121 supplies the body of the loop; they are consumed by this function and
6122 become part of the constructed op tree. I<debuggable> is currently
6123 unused and should always be 1.
6129 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
6134 const bool once = block && block->op_flags & OPf_SPECIAL &&
6135 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
6137 PERL_UNUSED_ARG(debuggable);
6140 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
6141 return block; /* do {} while 0 does once */
6142 if (expr->op_type == OP_READLINE
6143 || expr->op_type == OP_READDIR
6144 || expr->op_type == OP_GLOB
6145 || expr->op_type == OP_EACH || expr->op_type == OP_AEACH
6146 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
6147 expr = newUNOP(OP_DEFINED, 0,
6148 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
6149 } else if (expr->op_flags & OPf_KIDS) {
6150 const OP * const k1 = ((UNOP*)expr)->op_first;
6151 const OP * const k2 = k1 ? k1->op_sibling : NULL;
6152 switch (expr->op_type) {
6154 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
6155 && (k2->op_flags & OPf_STACKED)
6156 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
6157 expr = newUNOP(OP_DEFINED, 0, expr);
6161 if (k1 && (k1->op_type == OP_READDIR
6162 || k1->op_type == OP_GLOB
6163 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
6164 || k1->op_type == OP_EACH
6165 || k1->op_type == OP_AEACH))
6166 expr = newUNOP(OP_DEFINED, 0, expr);
6172 /* if block is null, the next op_append_elem() would put UNSTACK, a scalar
6173 * op, in listop. This is wrong. [perl #27024] */
6175 block = newOP(OP_NULL, 0);
6176 listop = op_append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
6177 o = new_logop(OP_AND, 0, &expr, &listop);
6180 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
6182 if (once && o != listop)
6183 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
6186 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
6188 o->op_flags |= flags;
6190 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
6195 =for apidoc Am|OP *|newWHILEOP|I32 flags|I32 debuggable|LOOP *loop|OP *expr|OP *block|OP *cont|I32 has_my
6197 Constructs, checks, and returns an op tree expressing a C<while> loop.
6198 This is a heavyweight loop, with structure that allows exiting the loop
6199 by C<last> and suchlike.
6201 I<loop> is an optional preconstructed C<enterloop> op to use in the
6202 loop; if it is null then a suitable op will be constructed automatically.
6203 I<expr> supplies the loop's controlling expression. I<block> supplies the
6204 main body of the loop, and I<cont> optionally supplies a C<continue> block
6205 that operates as a second half of the body. All of these optree inputs
6206 are consumed by this function and become part of the constructed op tree.
6208 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
6209 op and, shifted up eight bits, the eight bits of C<op_private> for
6210 the C<leaveloop> op, except that (in both cases) some bits will be set
6211 automatically. I<debuggable> is currently unused and should always be 1.
6212 I<has_my> can be supplied as true to force the
6213 loop body to be enclosed in its own scope.
6219 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop,
6220 OP *expr, OP *block, OP *cont, I32 has_my)
6229 PERL_UNUSED_ARG(debuggable);
6232 if (expr->op_type == OP_READLINE
6233 || expr->op_type == OP_READDIR
6234 || expr->op_type == OP_GLOB
6235 || expr->op_type == OP_EACH || expr->op_type == OP_AEACH
6236 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
6237 expr = newUNOP(OP_DEFINED, 0,
6238 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
6239 } else if (expr->op_flags & OPf_KIDS) {
6240 const OP * const k1 = ((UNOP*)expr)->op_first;
6241 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
6242 switch (expr->op_type) {
6244 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
6245 && (k2->op_flags & OPf_STACKED)
6246 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
6247 expr = newUNOP(OP_DEFINED, 0, expr);
6251 if (k1 && (k1->op_type == OP_READDIR
6252 || k1->op_type == OP_GLOB
6253 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
6254 || k1->op_type == OP_EACH
6255 || k1->op_type == OP_AEACH))
6256 expr = newUNOP(OP_DEFINED, 0, expr);
6263 block = newOP(OP_NULL, 0);
6264 else if (cont || has_my) {
6265 block = op_scope(block);
6269 next = LINKLIST(cont);
6272 OP * const unstack = newOP(OP_UNSTACK, 0);
6275 cont = op_append_elem(OP_LINESEQ, cont, unstack);
6279 listop = op_append_list(OP_LINESEQ, block, cont);
6281 redo = LINKLIST(listop);
6285 o = new_logop(OP_AND, 0, &expr, &listop);
6286 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
6288 return expr; /* listop already freed by new_logop */
6291 ((LISTOP*)listop)->op_last->op_next =
6292 (o == listop ? redo : LINKLIST(o));
6298 NewOp(1101,loop,1,LOOP);
6299 loop->op_type = OP_ENTERLOOP;
6300 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
6301 loop->op_private = 0;
6302 loop->op_next = (OP*)loop;
6305 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
6307 loop->op_redoop = redo;
6308 loop->op_lastop = o;
6309 o->op_private |= loopflags;
6312 loop->op_nextop = next;
6314 loop->op_nextop = o;
6316 o->op_flags |= flags;
6317 o->op_private |= (flags >> 8);
6322 =for apidoc Am|OP *|newFOROP|I32 flags|OP *sv|OP *expr|OP *block|OP *cont
6324 Constructs, checks, and returns an op tree expressing a C<foreach>
6325 loop (iteration through a list of values). This is a heavyweight loop,
6326 with structure that allows exiting the loop by C<last> and suchlike.
6328 I<sv> optionally supplies the variable that will be aliased to each
6329 item in turn; if null, it defaults to C<$_> (either lexical or global).
6330 I<expr> supplies the list of values to iterate over. I<block> supplies
6331 the main body of the loop, and I<cont> optionally supplies a C<continue>
6332 block that operates as a second half of the body. All of these optree
6333 inputs are consumed by this function and become part of the constructed
6336 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
6337 op and, shifted up eight bits, the eight bits of C<op_private> for
6338 the C<leaveloop> op, except that (in both cases) some bits will be set
6345 Perl_newFOROP(pTHX_ I32 flags, OP *sv, OP *expr, OP *block, OP *cont)
6350 PADOFFSET padoff = 0;
6355 PERL_ARGS_ASSERT_NEWFOROP;
6358 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
6359 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
6360 sv->op_type = OP_RV2GV;
6361 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
6363 /* The op_type check is needed to prevent a possible segfault
6364 * if the loop variable is undeclared and 'strict vars' is in
6365 * effect. This is illegal but is nonetheless parsed, so we
6366 * may reach this point with an OP_CONST where we're expecting
6369 if (cUNOPx(sv)->op_first->op_type == OP_GV
6370 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
6371 iterpflags |= OPpITER_DEF;
6373 else if (sv->op_type == OP_PADSV) { /* private variable */
6374 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
6375 padoff = sv->op_targ;
6385 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
6387 SV *const namesv = PAD_COMPNAME_SV(padoff);
6389 const char *const name = SvPV_const(namesv, len);
6391 if (len == 2 && name[0] == '$' && name[1] == '_')
6392 iterpflags |= OPpITER_DEF;
6396 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
6397 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
6398 sv = newGVOP(OP_GV, 0, PL_defgv);
6403 iterpflags |= OPpITER_DEF;
6405 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
6406 expr = op_lvalue(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
6407 iterflags |= OPf_STACKED;
6409 else if (expr->op_type == OP_NULL &&
6410 (expr->op_flags & OPf_KIDS) &&
6411 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
6413 /* Basically turn for($x..$y) into the same as for($x,$y), but we
6414 * set the STACKED flag to indicate that these values are to be
6415 * treated as min/max values by 'pp_enteriter'.
6417 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
6418 LOGOP* const range = (LOGOP*) flip->op_first;
6419 OP* const left = range->op_first;
6420 OP* const right = left->op_sibling;
6423 range->op_flags &= ~OPf_KIDS;
6424 range->op_first = NULL;
6426 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
6427 listop->op_first->op_next = range->op_next;
6428 left->op_next = range->op_other;
6429 right->op_next = (OP*)listop;
6430 listop->op_next = listop->op_first;
6433 op_getmad(expr,(OP*)listop,'O');
6437 expr = (OP*)(listop);
6439 iterflags |= OPf_STACKED;
6442 expr = op_lvalue(force_list(expr), OP_GREPSTART);
6445 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
6446 op_append_elem(OP_LIST, expr, scalar(sv))));
6447 assert(!loop->op_next);
6448 /* for my $x () sets OPpLVAL_INTRO;
6449 * for our $x () sets OPpOUR_INTRO */
6450 loop->op_private = (U8)iterpflags;
6451 if (loop->op_slabbed
6452 && DIFF(loop, OpSLOT(loop)->opslot_next)
6453 < SIZE_TO_PSIZE(sizeof(LOOP)))
6456 NewOp(1234,tmp,1,LOOP);
6457 Copy(loop,tmp,1,LISTOP);
6458 S_op_destroy(aTHX_ (OP*)loop);
6461 else if (!loop->op_slabbed)
6462 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
6463 loop->op_targ = padoff;
6464 wop = newWHILEOP(flags, 1, loop, newOP(OP_ITER, 0), block, cont, 0);
6466 op_getmad(madsv, (OP*)loop, 'v');
6471 =for apidoc Am|OP *|newLOOPEX|I32 type|OP *label
6473 Constructs, checks, and returns a loop-exiting op (such as C<goto>
6474 or C<last>). I<type> is the opcode. I<label> supplies the parameter
6475 determining the target of the op; it is consumed by this function and
6476 becomes part of the constructed op tree.
6482 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
6487 PERL_ARGS_ASSERT_NEWLOOPEX;
6489 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
6491 if (type != OP_GOTO) {
6492 /* "last()" means "last" */
6493 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS)) {
6494 o = newOP(type, OPf_SPECIAL);
6498 /* Check whether it's going to be a goto &function */
6499 if (label->op_type == OP_ENTERSUB
6500 && !(label->op_flags & OPf_STACKED))
6501 label = newUNOP(OP_REFGEN, 0, op_lvalue(label, OP_REFGEN));
6504 /* Check for a constant argument */
6505 if (label->op_type == OP_CONST) {
6506 SV * const sv = ((SVOP *)label)->op_sv;
6508 const char *s = SvPV_const(sv,l);
6509 if (l == strlen(s)) {
6511 SvUTF8(((SVOP*)label)->op_sv),
6513 SvPV_nolen_const(((SVOP*)label)->op_sv)));
6517 /* If we have already created an op, we do not need the label. */
6520 op_getmad(label,o,'L');
6524 else o = newUNOP(type, OPf_STACKED, label);
6526 PL_hints |= HINT_BLOCK_SCOPE;
6530 /* if the condition is a literal array or hash
6531 (or @{ ... } etc), make a reference to it.
6534 S_ref_array_or_hash(pTHX_ OP *cond)
6537 && (cond->op_type == OP_RV2AV
6538 || cond->op_type == OP_PADAV
6539 || cond->op_type == OP_RV2HV
6540 || cond->op_type == OP_PADHV))
6542 return newUNOP(OP_REFGEN, 0, op_lvalue(cond, OP_REFGEN));
6545 && (cond->op_type == OP_ASLICE
6546 || cond->op_type == OP_HSLICE)) {
6548 /* anonlist now needs a list from this op, was previously used in
6550 cond->op_flags |= ~(OPf_WANT_SCALAR | OPf_REF);
6551 cond->op_flags |= OPf_WANT_LIST;
6553 return newANONLIST(op_lvalue(cond, OP_ANONLIST));
6560 /* These construct the optree fragments representing given()
6563 entergiven and enterwhen are LOGOPs; the op_other pointer
6564 points up to the associated leave op. We need this so we
6565 can put it in the context and make break/continue work.
6566 (Also, of course, pp_enterwhen will jump straight to
6567 op_other if the match fails.)
6571 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
6572 I32 enter_opcode, I32 leave_opcode,
6573 PADOFFSET entertarg)
6579 PERL_ARGS_ASSERT_NEWGIVWHENOP;
6581 NewOp(1101, enterop, 1, LOGOP);
6582 enterop->op_type = (Optype)enter_opcode;
6583 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
6584 enterop->op_flags = (U8) OPf_KIDS;
6585 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
6586 enterop->op_private = 0;
6588 o = newUNOP(leave_opcode, 0, (OP *) enterop);
6591 enterop->op_first = scalar(cond);
6592 cond->op_sibling = block;
6594 o->op_next = LINKLIST(cond);
6595 cond->op_next = (OP *) enterop;
6598 /* This is a default {} block */
6599 enterop->op_first = block;
6600 enterop->op_flags |= OPf_SPECIAL;
6601 o ->op_flags |= OPf_SPECIAL;
6603 o->op_next = (OP *) enterop;
6606 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
6607 entergiven and enterwhen both
6610 enterop->op_next = LINKLIST(block);
6611 block->op_next = enterop->op_other = o;
6616 /* Does this look like a boolean operation? For these purposes
6617 a boolean operation is:
6618 - a subroutine call [*]
6619 - a logical connective
6620 - a comparison operator
6621 - a filetest operator, with the exception of -s -M -A -C
6622 - defined(), exists() or eof()
6623 - /$re/ or $foo =~ /$re/
6625 [*] possibly surprising
6628 S_looks_like_bool(pTHX_ const OP *o)
6632 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
6634 switch(o->op_type) {
6637 return looks_like_bool(cLOGOPo->op_first);
6641 looks_like_bool(cLOGOPo->op_first)
6642 && looks_like_bool(cLOGOPo->op_first->op_sibling));
6647 o->op_flags & OPf_KIDS
6648 && looks_like_bool(cUNOPo->op_first));
6652 case OP_NOT: case OP_XOR:
6654 case OP_EQ: case OP_NE: case OP_LT:
6655 case OP_GT: case OP_LE: case OP_GE:
6657 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
6658 case OP_I_GT: case OP_I_LE: case OP_I_GE:
6660 case OP_SEQ: case OP_SNE: case OP_SLT:
6661 case OP_SGT: case OP_SLE: case OP_SGE:
6665 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
6666 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
6667 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
6668 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
6669 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
6670 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
6671 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
6672 case OP_FTTEXT: case OP_FTBINARY:
6674 case OP_DEFINED: case OP_EXISTS:
6675 case OP_MATCH: case OP_EOF:
6682 /* Detect comparisons that have been optimized away */
6683 if (cSVOPo->op_sv == &PL_sv_yes
6684 || cSVOPo->op_sv == &PL_sv_no)
6697 =for apidoc Am|OP *|newGIVENOP|OP *cond|OP *block|PADOFFSET defsv_off
6699 Constructs, checks, and returns an op tree expressing a C<given> block.
6700 I<cond> supplies the expression that will be locally assigned to a lexical
6701 variable, and I<block> supplies the body of the C<given> construct; they
6702 are consumed by this function and become part of the constructed op tree.
6703 I<defsv_off> is the pad offset of the scalar lexical variable that will
6704 be affected. If it is 0, the global $_ will be used.
6710 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
6713 PERL_ARGS_ASSERT_NEWGIVENOP;
6714 return newGIVWHENOP(
6715 ref_array_or_hash(cond),
6717 OP_ENTERGIVEN, OP_LEAVEGIVEN,
6722 =for apidoc Am|OP *|newWHENOP|OP *cond|OP *block
6724 Constructs, checks, and returns an op tree expressing a C<when> block.
6725 I<cond> supplies the test expression, and I<block> supplies the block
6726 that will be executed if the test evaluates to true; they are consumed
6727 by this function and become part of the constructed op tree. I<cond>
6728 will be interpreted DWIMically, often as a comparison against C<$_>,
6729 and may be null to generate a C<default> block.
6735 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
6737 const bool cond_llb = (!cond || looks_like_bool(cond));
6740 PERL_ARGS_ASSERT_NEWWHENOP;
6745 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
6747 scalar(ref_array_or_hash(cond)));
6750 return newGIVWHENOP(cond_op, block, OP_ENTERWHEN, OP_LEAVEWHEN, 0);
6754 Perl_cv_ckproto_len_flags(pTHX_ const CV *cv, const GV *gv, const char *p,
6755 const STRLEN len, const U32 flags)
6757 const char * const cvp = SvROK(cv) ? "" : CvPROTO(cv);
6758 const STRLEN clen = CvPROTOLEN(cv);
6760 PERL_ARGS_ASSERT_CV_CKPROTO_LEN_FLAGS;
6762 if (((!p != !cvp) /* One has prototype, one has not. */
6764 (flags & SVf_UTF8) == SvUTF8(cv)
6765 ? len != clen || memNE(cvp, p, len)
6767 ? bytes_cmp_utf8((const U8 *)cvp, clen,
6769 : bytes_cmp_utf8((const U8 *)p, len,
6770 (const U8 *)cvp, clen)
6774 && ckWARN_d(WARN_PROTOTYPE)) {
6775 SV* const msg = sv_newmortal();
6781 gv_efullname3(name = sv_newmortal(), gv, NULL);
6782 else if (SvPOK(gv) && *SvPVX((SV *)gv) == '&')
6783 name = newSVpvn_flags(SvPVX((SV *)gv)+1, SvCUR(gv)-1,
6784 SvUTF8(gv)|SVs_TEMP);
6785 else name = (SV *)gv;
6787 sv_setpvs(msg, "Prototype mismatch:");
6789 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
6791 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")",
6792 SVfARG(newSVpvn_flags(cvp,clen, SvUTF8(cv)|SVs_TEMP))
6795 sv_catpvs(msg, ": none");
6796 sv_catpvs(msg, " vs ");
6798 Perl_sv_catpvf(aTHX_ msg, "(%"SVf")", SVfARG(newSVpvn_flags(p, len, flags | SVs_TEMP)));
6800 sv_catpvs(msg, "none");
6801 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
6805 static void const_sv_xsub(pTHX_ CV* cv);
6809 =head1 Optree Manipulation Functions
6811 =for apidoc cv_const_sv
6813 If C<cv> is a constant sub eligible for inlining. returns the constant
6814 value returned by the sub. Otherwise, returns NULL.
6816 Constant subs can be created with C<newCONSTSUB> or as described in
6817 L<perlsub/"Constant Functions">.
6822 Perl_cv_const_sv(pTHX_ const CV *const cv)
6824 PERL_UNUSED_CONTEXT;
6827 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
6829 return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
6832 /* op_const_sv: examine an optree to determine whether it's in-lineable.
6833 * Can be called in 3 ways:
6836 * look for a single OP_CONST with attached value: return the value
6838 * cv && CvCLONE(cv) && !CvCONST(cv)
6840 * examine the clone prototype, and if contains only a single
6841 * OP_CONST referencing a pad const, or a single PADSV referencing
6842 * an outer lexical, return a non-zero value to indicate the CV is
6843 * a candidate for "constizing" at clone time
6847 * We have just cloned an anon prototype that was marked as a const
6848 * candidate. Try to grab the current value, and in the case of
6849 * PADSV, ignore it if it has multiple references. In this case we
6850 * return a newly created *copy* of the value.
6854 Perl_op_const_sv(pTHX_ const OP *o, CV *cv)
6865 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
6866 o = cLISTOPo->op_first->op_sibling;
6868 for (; o; o = o->op_next) {
6869 const OPCODE type = o->op_type;
6871 if (sv && o->op_next == o)
6873 if (o->op_next != o) {
6874 if (type == OP_NEXTSTATE
6875 || (type == OP_NULL && !(o->op_flags & OPf_KIDS))
6876 || type == OP_PUSHMARK)
6878 if (type == OP_DBSTATE)
6881 if (type == OP_LEAVESUB || type == OP_RETURN)
6885 if (type == OP_CONST && cSVOPo->op_sv)
6887 else if (cv && type == OP_CONST) {
6888 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6892 else if (cv && type == OP_PADSV) {
6893 if (CvCONST(cv)) { /* newly cloned anon */
6894 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6895 /* the candidate should have 1 ref from this pad and 1 ref
6896 * from the parent */
6897 if (!sv || SvREFCNT(sv) != 2)
6904 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
6905 sv = &PL_sv_undef; /* an arbitrary non-null value */
6916 S_already_defined(pTHX_ CV *const cv, OP * const block, OP * const o,
6917 PADNAME * const name, SV ** const const_svp)
6924 || block->op_type == OP_NULL
6927 if (CvFLAGS(PL_compcv)) {
6928 /* might have had built-in attrs applied */
6929 const bool pureperl = !CvISXSUB(cv) && CvROOT(cv);
6930 if (CvLVALUE(PL_compcv) && ! CvLVALUE(cv) && pureperl
6931 && ckWARN(WARN_MISC))
6933 /* protect against fatal warnings leaking compcv */
6934 SAVEFREESV(PL_compcv);
6935 Perl_warner(aTHX_ packWARN(WARN_MISC), "lvalue attribute ignored after the subroutine has been defined");
6936 SvREFCNT_inc_simple_void_NN(PL_compcv);
6939 (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS
6940 & ~(CVf_LVALUE * pureperl));
6945 /* redundant check for speed: */
6946 if (CvCONST(cv) || ckWARN(WARN_REDEFINE)) {
6947 const line_t oldline = CopLINE(PL_curcop);
6950 : sv_2mortal(newSVpvn_utf8(
6951 PadnamePV(name)+1,PadnameLEN(name)-1, PadnameUTF8(name)
6953 if (PL_parser && PL_parser->copline != NOLINE)
6954 /* This ensures that warnings are reported at the first
6955 line of a redefinition, not the last. */
6956 CopLINE_set(PL_curcop, PL_parser->copline);
6957 /* protect against fatal warnings leaking compcv */
6958 SAVEFREESV(PL_compcv);
6959 report_redefined_cv(namesv, cv, const_svp);
6960 SvREFCNT_inc_simple_void_NN(PL_compcv);
6961 CopLINE_set(PL_curcop, oldline);
6964 if (!PL_minus_c) /* keep old one around for madskills */
6967 /* (PL_madskills unset in used file.) */
6974 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
6980 STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */
6983 CV *compcv = PL_compcv;
6986 PADOFFSET pax = o->op_targ;
6987 CV *outcv = CvOUTSIDE(PL_compcv);
6990 bool reusable = FALSE;
6992 PERL_ARGS_ASSERT_NEWMYSUB;
6994 /* Find the pad slot for storing the new sub.
6995 We cannot use PL_comppad, as it is the pad owned by the new sub. We
6996 need to look in CvOUTSIDE and find the pad belonging to the enclos-
6997 ing sub. And then we need to dig deeper if this is a lexical from
6999 my sub foo; sub { sub foo { } }
7002 name = PadlistNAMESARRAY(CvPADLIST(outcv))[pax];
7003 if (PadnameOUTER(name) && PARENT_PAD_INDEX(name)) {
7004 pax = PARENT_PAD_INDEX(name);
7005 outcv = CvOUTSIDE(outcv);
7010 &PadARRAY(PadlistARRAY(CvPADLIST(outcv))
7011 [CvDEPTH(outcv) ? CvDEPTH(outcv) : 1])[pax];
7012 spot = (CV **)svspot;
7015 assert(proto->op_type == OP_CONST);
7016 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
7017 ps_utf8 = SvUTF8(((SVOP*)proto)->op_sv);
7022 if (!PL_madskills) {
7029 if (PL_parser && PL_parser->error_count) {
7031 SvREFCNT_dec(PL_compcv);
7036 if (CvDEPTH(outcv) && CvCLONE(compcv)) {
7038 svspot = (SV **)(spot = &clonee);
7040 else if (PadnameIsSTATE(name) || CvDEPTH(outcv))
7044 SvUPGRADE(name, SVt_PVMG);
7045 mg = mg_find(name, PERL_MAGIC_proto);
7046 assert (SvTYPE(*spot) == SVt_PVCV);
7048 hek = CvNAME_HEK(*spot);
7050 CvNAME_HEK_set(*spot, hek =
7053 PadnameLEN(name)-1 * (PadnameUTF8(name) ? -1 : 1), 0
7059 cv = (CV *)mg->mg_obj;
7062 sv_magic(name, &PL_sv_undef, PERL_MAGIC_proto, NULL, 0);
7063 mg = mg_find(name, PERL_MAGIC_proto);
7065 spot = (CV **)(svspot = &mg->mg_obj);
7068 if (!block || !ps || *ps || attrs
7069 || (CvFLAGS(compcv) & CVf_BUILTIN_ATTRS)
7071 || block->op_type == OP_NULL
7076 const_sv = op_const_sv(block, NULL);
7079 const bool exists = CvROOT(cv) || CvXSUB(cv);
7081 /* if the subroutine doesn't exist and wasn't pre-declared
7082 * with a prototype, assume it will be AUTOLOADed,
7083 * skipping the prototype check
7085 if (exists || SvPOK(cv))
7086 cv_ckproto_len_flags(cv, (GV *)name, ps, ps_len, ps_utf8);
7087 /* already defined? */
7089 if (S_already_defined(aTHX_ cv, block, NULL, name, &const_sv))
7092 if (attrs) goto attrs;
7093 /* just a "sub foo;" when &foo is already defined */
7098 else if (CvDEPTH(outcv) && CvCLONE(compcv)) {
7104 SvREFCNT_inc_simple_void_NN(const_sv);
7106 assert(!CvROOT(cv) && !CvCONST(cv));
7110 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7111 CvFILE_set_from_cop(cv, PL_curcop);
7112 CvSTASH_set(cv, PL_curstash);
7115 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
7116 CvXSUBANY(cv).any_ptr = const_sv;
7117 CvXSUB(cv) = const_sv_xsub;
7123 SvREFCNT_dec(compcv);
7127 /* Checking whether outcv is CvOUTSIDE(compcv) is not sufficient to
7128 determine whether this sub definition is in the same scope as its
7129 declaration. If this sub definition is inside an inner named pack-
7130 age sub (my sub foo; sub bar { sub foo { ... } }), outcv points to
7131 the package sub. So check PadnameOUTER(name) too.
7133 if (outcv == CvOUTSIDE(compcv) && !PadnameOUTER(name)) {
7134 assert(!CvWEAKOUTSIDE(compcv));
7135 SvREFCNT_dec(CvOUTSIDE(compcv));
7136 CvWEAKOUTSIDE_on(compcv);
7138 /* XXX else do we have a circular reference? */
7139 if (cv) { /* must reuse cv in case stub is referenced elsewhere */
7140 /* transfer PL_compcv to cv */
7143 && block->op_type != OP_NULL
7146 cv_flags_t preserved_flags =
7147 CvFLAGS(cv) & (CVf_BUILTIN_ATTRS|CVf_NAMED);
7148 PADLIST *const temp_padl = CvPADLIST(cv);
7149 CV *const temp_cv = CvOUTSIDE(cv);
7150 const cv_flags_t other_flags =
7151 CvFLAGS(cv) & (CVf_SLABBED|CVf_WEAKOUTSIDE);
7152 OP * const cvstart = CvSTART(cv);
7156 CvFLAGS(compcv) | preserved_flags;
7157 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
7158 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(compcv);
7159 CvPADLIST(cv) = CvPADLIST(compcv);
7160 CvOUTSIDE(compcv) = temp_cv;
7161 CvPADLIST(compcv) = temp_padl;
7162 CvSTART(cv) = CvSTART(compcv);
7163 CvSTART(compcv) = cvstart;
7164 CvFLAGS(compcv) &= ~(CVf_SLABBED|CVf_WEAKOUTSIDE);
7165 CvFLAGS(compcv) |= other_flags;
7167 if (CvFILE(cv) && CvDYNFILE(cv)) {
7168 Safefree(CvFILE(cv));
7171 /* inner references to compcv must be fixed up ... */
7172 pad_fixup_inner_anons(CvPADLIST(cv), compcv, cv);
7173 if (PERLDB_INTER)/* Advice debugger on the new sub. */
7174 ++PL_sub_generation;
7177 /* Might have had built-in attributes applied -- propagate them. */
7178 CvFLAGS(cv) |= (CvFLAGS(compcv) & CVf_BUILTIN_ATTRS);
7180 /* ... before we throw it away */
7181 SvREFCNT_dec(compcv);
7182 PL_compcv = compcv = cv;
7188 if (!CvNAME_HEK(cv)) {
7191 ? share_hek_hek(hek)
7192 : share_hek(PadnamePV(name)+1,
7193 PadnameLEN(name)-1 * (PadnameUTF8(name) ? -1 : 1),
7197 CvFILE_set_from_cop(cv, PL_curcop);
7198 CvSTASH_set(cv, PL_curstash);
7201 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
7202 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(cv));
7209 /* If we assign an optree to a PVCV, then we've defined a subroutine that
7210 the debugger could be able to set a breakpoint in, so signal to
7211 pp_entereval that it should not throw away any saved lines at scope
7214 PL_breakable_sub_gen++;
7215 /* This makes sub {}; work as expected. */
7216 if (block->op_type == OP_STUB) {
7217 OP* const newblock = newSTATEOP(0, NULL, 0);
7219 op_getmad(block,newblock,'B');
7225 CvROOT(cv) = CvLVALUE(cv)
7226 ? newUNOP(OP_LEAVESUBLV, 0,
7227 op_lvalue(scalarseq(block), OP_LEAVESUBLV))
7228 : newUNOP(OP_LEAVESUB, 0, scalarseq(block));
7229 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7230 OpREFCNT_set(CvROOT(cv), 1);
7231 /* The cv no longer needs to hold a refcount on the slab, as CvROOT
7232 itself has a refcount. */
7234 OpslabREFCNT_dec_padok((OPSLAB *)CvSTART(cv));
7235 CvSTART(cv) = LINKLIST(CvROOT(cv));
7236 CvROOT(cv)->op_next = 0;
7237 CALL_PEEP(CvSTART(cv));
7238 finalize_optree(CvROOT(cv));
7240 /* now that optimizer has done its work, adjust pad values */
7242 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
7245 assert(!CvCONST(cv));
7246 if (ps && !*ps && op_const_sv(block, cv))
7252 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
7253 apply_attrs(PL_curstash, MUTABLE_SV(cv), attrs);
7257 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
7258 SV * const tmpstr = sv_newmortal();
7259 GV * const db_postponed = gv_fetchpvs("DB::postponed",
7260 GV_ADDMULTI, SVt_PVHV);
7262 SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld",
7265 (long)CopLINE(PL_curcop));
7266 if (HvNAME_HEK(PL_curstash)) {
7267 sv_sethek(tmpstr, HvNAME_HEK(PL_curstash));
7268 sv_catpvs(tmpstr, "::");
7270 else sv_setpvs(tmpstr, "__ANON__::");
7271 sv_catpvn_flags(tmpstr, PadnamePV(name)+1, PadnameLEN(name)-1,
7272 PadnameUTF8(name) ? SV_CATUTF8 : SV_CATBYTES);
7273 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
7274 SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr), sv, 0);
7275 hv = GvHVn(db_postponed);
7276 if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr))) {
7277 CV * const pcv = GvCV(db_postponed);
7283 call_sv(MUTABLE_SV(pcv), G_DISCARD);
7291 assert(CvDEPTH(outcv));
7293 &PadARRAY(PadlistARRAY(CvPADLIST(outcv))[CvDEPTH(outcv)])[pax];
7294 if (reusable) cv_clone_into(clonee, *spot);
7295 else *spot = cv_clone(clonee);
7296 SvREFCNT_dec_NN(clonee);
7300 if (CvDEPTH(outcv) && !reusable && PadnameIsSTATE(name)) {
7301 PADOFFSET depth = CvDEPTH(outcv);
7304 svspot = &PadARRAY(PadlistARRAY(CvPADLIST(outcv))[depth])[pax];
7306 *svspot = SvREFCNT_inc_simple_NN(cv);
7307 SvREFCNT_dec(oldcv);
7313 PL_parser->copline = NOLINE;
7320 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
7322 return newATTRSUB_flags(floor, o, proto, attrs, block, 0);
7326 Perl_newATTRSUB_flags(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs,
7327 OP *block, U32 flags)
7332 STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */
7336 const bool ec = PL_parser && PL_parser->error_count;
7337 /* If the subroutine has no body, no attributes, and no builtin attributes
7338 then it's just a sub declaration, and we may be able to get away with
7339 storing with a placeholder scalar in the symbol table, rather than a
7340 full GV and CV. If anything is present then it will take a full CV to
7342 const I32 gv_fetch_flags
7343 = ec ? GV_NOADD_NOINIT :
7344 (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
7346 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
7348 const bool o_is_gv = flags & 1;
7349 const char * const name =
7350 o ? SvPV_const(o_is_gv ? (SV *)o : cSVOPo->op_sv, namlen) : NULL;
7352 bool name_is_utf8 = o && !o_is_gv && SvUTF8(cSVOPo->op_sv);
7353 #ifdef PERL_DEBUG_READONLY_OPS
7354 OPSLAB *slab = NULL;
7358 assert(proto->op_type == OP_CONST);
7359 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
7360 ps_utf8 = SvUTF8(((SVOP*)proto)->op_sv);
7370 gv = gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV);
7372 } else if (PERLDB_NAMEANON && CopLINE(PL_curcop)) {
7373 SV * const sv = sv_newmortal();
7374 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
7375 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
7376 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7377 gv = gv_fetchsv(sv, gv_fetch_flags, SVt_PVCV);
7379 } else if (PL_curstash) {
7380 gv = gv_fetchpvs("__ANON__", gv_fetch_flags, SVt_PVCV);
7383 gv = gv_fetchpvs("__ANON__::__ANON__", gv_fetch_flags, SVt_PVCV);
7387 if (!PL_madskills) {
7398 if (name) SvREFCNT_dec(PL_compcv);
7399 else cv = PL_compcv;
7401 if (name && block) {
7402 const char *s = strrchr(name, ':');
7404 if (strEQ(s, "BEGIN")) {
7405 if (PL_in_eval & EVAL_KEEPERR)
7406 Perl_croak_nocontext("BEGIN not safe after errors--compilation aborted");
7408 SV * const errsv = ERRSV;
7409 /* force display of errors found but not reported */
7410 sv_catpvs(errsv, "BEGIN not safe after errors--compilation aborted");
7411 Perl_croak_nocontext("%"SVf, SVfARG(errsv));
7418 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
7419 maximum a prototype before. */
7420 if (SvTYPE(gv) > SVt_NULL) {
7421 cv_ckproto_len_flags((const CV *)gv,
7422 o ? (const GV *)cSVOPo->op_sv : NULL, ps,
7426 sv_setpvn(MUTABLE_SV(gv), ps, ps_len);
7427 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(gv));
7430 sv_setiv(MUTABLE_SV(gv), -1);
7432 SvREFCNT_dec(PL_compcv);
7433 cv = PL_compcv = NULL;
7437 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
7439 if (!block || !ps || *ps || attrs
7440 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
7442 || block->op_type == OP_NULL
7447 const_sv = op_const_sv(block, NULL);
7450 const bool exists = CvROOT(cv) || CvXSUB(cv);
7452 /* if the subroutine doesn't exist and wasn't pre-declared
7453 * with a prototype, assume it will be AUTOLOADed,
7454 * skipping the prototype check
7456 if (exists || SvPOK(cv))
7457 cv_ckproto_len_flags(cv, gv, ps, ps_len, ps_utf8);
7458 /* already defined (or promised)? */
7459 if (exists || GvASSUMECV(gv)) {
7460 if (S_already_defined(aTHX_ cv, block, o, NULL, &const_sv))
7463 if (attrs) goto attrs;
7464 /* just a "sub foo;" when &foo is already defined */
7465 SAVEFREESV(PL_compcv);
7471 SvREFCNT_inc_simple_void_NN(const_sv);
7473 assert(!CvROOT(cv) && !CvCONST(cv));
7475 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
7476 CvXSUBANY(cv).any_ptr = const_sv;
7477 CvXSUB(cv) = const_sv_xsub;
7483 cv = newCONSTSUB_flags(
7484 NULL, name, namlen, name_is_utf8 ? SVf_UTF8 : 0,
7491 SvREFCNT_dec(PL_compcv);
7495 if (cv) { /* must reuse cv if autoloaded */
7496 /* transfer PL_compcv to cv */
7499 && block->op_type != OP_NULL
7502 cv_flags_t existing_builtin_attrs = CvFLAGS(cv) & CVf_BUILTIN_ATTRS;
7503 PADLIST *const temp_av = CvPADLIST(cv);
7504 CV *const temp_cv = CvOUTSIDE(cv);
7505 const cv_flags_t other_flags =
7506 CvFLAGS(cv) & (CVf_SLABBED|CVf_WEAKOUTSIDE);
7507 OP * const cvstart = CvSTART(cv);
7510 assert(!CvCVGV_RC(cv));
7511 assert(CvGV(cv) == gv);
7514 CvFLAGS(cv) = CvFLAGS(PL_compcv) | existing_builtin_attrs;
7515 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
7516 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
7517 CvPADLIST(cv) = CvPADLIST(PL_compcv);
7518 CvOUTSIDE(PL_compcv) = temp_cv;
7519 CvPADLIST(PL_compcv) = temp_av;
7520 CvSTART(cv) = CvSTART(PL_compcv);
7521 CvSTART(PL_compcv) = cvstart;
7522 CvFLAGS(PL_compcv) &= ~(CVf_SLABBED|CVf_WEAKOUTSIDE);
7523 CvFLAGS(PL_compcv) |= other_flags;
7525 if (CvFILE(cv) && CvDYNFILE(cv)) {
7526 Safefree(CvFILE(cv));
7528 CvFILE_set_from_cop(cv, PL_curcop);
7529 CvSTASH_set(cv, PL_curstash);
7531 /* inner references to PL_compcv must be fixed up ... */
7532 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
7533 if (PERLDB_INTER)/* Advice debugger on the new sub. */
7534 ++PL_sub_generation;
7537 /* Might have had built-in attributes applied -- propagate them. */
7538 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
7540 /* ... before we throw it away */
7541 SvREFCNT_dec(PL_compcv);
7549 if (HvENAME_HEK(GvSTASH(gv)))
7550 /* sub Foo::bar { (shift)+1 } */
7551 gv_method_changed(gv);
7556 CvFILE_set_from_cop(cv, PL_curcop);
7557 CvSTASH_set(cv, PL_curstash);
7561 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
7562 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(cv));
7569 /* If we assign an optree to a PVCV, then we've defined a subroutine that
7570 the debugger could be able to set a breakpoint in, so signal to
7571 pp_entereval that it should not throw away any saved lines at scope
7574 PL_breakable_sub_gen++;
7575 /* This makes sub {}; work as expected. */
7576 if (block->op_type == OP_STUB) {
7577 OP* const newblock = newSTATEOP(0, NULL, 0);
7579 op_getmad(block,newblock,'B');
7585 CvROOT(cv) = CvLVALUE(cv)
7586 ? newUNOP(OP_LEAVESUBLV, 0,
7587 op_lvalue(scalarseq(block), OP_LEAVESUBLV))
7588 : newUNOP(OP_LEAVESUB, 0, scalarseq(block));
7589 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7590 OpREFCNT_set(CvROOT(cv), 1);
7591 /* The cv no longer needs to hold a refcount on the slab, as CvROOT
7592 itself has a refcount. */
7594 OpslabREFCNT_dec_padok((OPSLAB *)CvSTART(cv));
7595 #ifdef PERL_DEBUG_READONLY_OPS
7596 slab = (OPSLAB *)CvSTART(cv);
7598 CvSTART(cv) = LINKLIST(CvROOT(cv));
7599 CvROOT(cv)->op_next = 0;
7600 CALL_PEEP(CvSTART(cv));
7601 finalize_optree(CvROOT(cv));
7603 /* now that optimizer has done its work, adjust pad values */
7605 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
7608 assert(!CvCONST(cv));
7609 if (ps && !*ps && op_const_sv(block, cv))
7615 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
7616 HV *stash = name && GvSTASH(CvGV(cv)) ? GvSTASH(CvGV(cv)) : PL_curstash;
7617 if (!name) SAVEFREESV(cv);
7618 apply_attrs(stash, MUTABLE_SV(cv), attrs);
7619 if (!name) SvREFCNT_inc_simple_void_NN(cv);
7622 if (block && has_name) {
7623 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
7624 SV * const tmpstr = sv_newmortal();
7625 GV * const db_postponed = gv_fetchpvs("DB::postponed",
7626 GV_ADDMULTI, SVt_PVHV);
7628 SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld",
7631 (long)CopLINE(PL_curcop));
7632 gv_efullname3(tmpstr, gv, NULL);
7633 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
7634 SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr), sv, 0);
7635 hv = GvHVn(db_postponed);
7636 if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr))) {
7637 CV * const pcv = GvCV(db_postponed);
7643 call_sv(MUTABLE_SV(pcv), G_DISCARD);
7648 if (name && ! (PL_parser && PL_parser->error_count))
7649 process_special_blocks(floor, name, gv, cv);
7654 PL_parser->copline = NOLINE;
7656 #ifdef PERL_DEBUG_READONLY_OPS
7657 /* Watch out for BEGIN blocks */
7658 if (slab && gv && isGV(gv) && GvCV(gv)) Slab_to_ro(slab);
7664 S_process_special_blocks(pTHX_ I32 floor, const char *const fullname,
7668 const char *const colon = strrchr(fullname,':');
7669 const char *const name = colon ? colon + 1 : fullname;
7671 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
7674 if (strEQ(name, "BEGIN")) {
7675 const I32 oldscope = PL_scopestack_ix;
7676 if (floor) LEAVE_SCOPE(floor);
7678 SAVECOPFILE(&PL_compiling);
7679 SAVECOPLINE(&PL_compiling);
7680 SAVEVPTR(PL_curcop);
7682 DEBUG_x( dump_sub(gv) );
7683 Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv));
7684 GvCV_set(gv,0); /* cv has been hijacked */
7685 call_list(oldscope, PL_beginav);
7687 CopHINTS_set(&PL_compiling, PL_hints);
7694 if strEQ(name, "END") {
7695 DEBUG_x( dump_sub(gv) );
7696 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv));
7699 } else if (*name == 'U') {
7700 if (strEQ(name, "UNITCHECK")) {
7701 /* It's never too late to run a unitcheck block */
7702 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv));
7706 } else if (*name == 'C') {
7707 if (strEQ(name, "CHECK")) {
7709 /* diag_listed_as: Too late to run %s block */
7710 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
7711 "Too late to run CHECK block");
7712 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv));
7716 } else if (*name == 'I') {
7717 if (strEQ(name, "INIT")) {
7719 /* diag_listed_as: Too late to run %s block */
7720 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
7721 "Too late to run INIT block");
7722 Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv));
7728 DEBUG_x( dump_sub(gv) );
7729 GvCV_set(gv,0); /* cv has been hijacked */
7734 =for apidoc newCONSTSUB
7736 See L</newCONSTSUB_flags>.
7742 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
7744 return newCONSTSUB_flags(stash, name, name ? strlen(name) : 0, 0, sv);
7748 =for apidoc newCONSTSUB_flags
7750 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
7751 eligible for inlining at compile-time.
7753 Currently, the only useful value for C<flags> is SVf_UTF8.
7755 The newly created subroutine takes ownership of a reference to the passed in
7758 Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>,
7759 which won't be called if used as a destructor, but will suppress the overhead
7760 of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at
7767 Perl_newCONSTSUB_flags(pTHX_ HV *stash, const char *name, STRLEN len,
7773 const char *const file = CopFILE(PL_curcop);
7775 SV *const temp_sv = CopFILESV(PL_curcop);
7776 const char *const file = temp_sv ? SvPV_nolen_const(temp_sv) : NULL;
7781 if (IN_PERL_RUNTIME) {
7782 /* at runtime, it's not safe to manipulate PL_curcop: it may be
7783 * an op shared between threads. Use a non-shared COP for our
7785 SAVEVPTR(PL_curcop);
7786 SAVECOMPILEWARNINGS();
7787 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
7788 PL_curcop = &PL_compiling;
7790 SAVECOPLINE(PL_curcop);
7791 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
7794 PL_hints &= ~HINT_BLOCK_SCOPE;
7797 SAVEGENERICSV(PL_curstash);
7798 PL_curstash = (HV *)SvREFCNT_inc_simple_NN(stash);
7801 /* Protect sv against leakage caused by fatal warnings. */
7802 if (sv) SAVEFREESV(sv);
7804 /* file becomes the CvFILE. For an XS, it's usually static storage,
7805 and so doesn't get free()d. (It's expected to be from the C pre-
7806 processor __FILE__ directive). But we need a dynamically allocated one,
7807 and we need it to get freed. */
7808 cv = newXS_len_flags(name, len, const_sv_xsub, file ? file : "", "",
7809 &sv, XS_DYNAMIC_FILENAME | flags);
7810 CvXSUBANY(cv).any_ptr = SvREFCNT_inc_simple(sv);
7819 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
7820 const char *const filename, const char *const proto,
7823 PERL_ARGS_ASSERT_NEWXS_FLAGS;
7824 return newXS_len_flags(
7825 name, name ? strlen(name) : 0, subaddr, filename, proto, NULL, flags
7830 Perl_newXS_len_flags(pTHX_ const char *name, STRLEN len,
7831 XSUBADDR_t subaddr, const char *const filename,
7832 const char *const proto, SV **const_svp,
7837 PERL_ARGS_ASSERT_NEWXS_LEN_FLAGS;
7840 GV * const gv = gv_fetchpvn(
7841 name ? name : PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
7842 name ? len : PL_curstash ? sizeof("__ANON__") - 1:
7843 sizeof("__ANON__::__ANON__") - 1,
7844 GV_ADDMULTI | flags, SVt_PVCV);
7847 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
7849 if ((cv = (name ? GvCV(gv) : NULL))) {
7851 /* just a cached method */
7855 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
7856 /* already defined (or promised) */
7857 /* Redundant check that allows us to avoid creating an SV
7858 most of the time: */
7859 if (CvCONST(cv) || ckWARN(WARN_REDEFINE)) {
7860 report_redefined_cv(newSVpvn_flags(
7861 name,len,(flags&SVf_UTF8)|SVs_TEMP
7865 SvREFCNT_dec_NN(cv);
7870 if (cv) /* must reuse cv if autoloaded */
7873 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7877 if (HvENAME_HEK(GvSTASH(gv)))
7878 gv_method_changed(gv); /* newXS */
7884 (void)gv_fetchfile(filename);
7885 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
7886 an external constant string */
7887 assert(!CvDYNFILE(cv)); /* cv_undef should have turned it off */
7889 CvXSUB(cv) = subaddr;
7892 process_special_blocks(0, name, gv, cv);
7895 if (flags & XS_DYNAMIC_FILENAME) {
7896 CvFILE(cv) = savepv(filename);
7899 sv_setpv(MUTABLE_SV(cv), proto);
7904 Perl_newSTUB(pTHX_ GV *gv, bool fake)
7906 CV *cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7907 PERL_ARGS_ASSERT_NEWSTUB;
7911 if (!fake && HvENAME_HEK(GvSTASH(gv)))
7912 gv_method_changed(gv);
7914 CvFILE_set_from_cop(cv, PL_curcop);
7915 CvSTASH_set(cv, PL_curstash);
7921 =for apidoc U||newXS
7923 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
7924 static storage, as it is used directly as CvFILE(), without a copy being made.
7930 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
7932 PERL_ARGS_ASSERT_NEWXS;
7933 return newXS_len_flags(
7934 name, name ? strlen(name) : 0, subaddr, filename, NULL, NULL, 0
7943 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
7948 OP* pegop = newOP(OP_NULL, 0);
7953 if (PL_parser && PL_parser->error_count) {
7959 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
7960 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
7963 if ((cv = GvFORM(gv))) {
7964 if (ckWARN(WARN_REDEFINE)) {
7965 const line_t oldline = CopLINE(PL_curcop);
7966 if (PL_parser && PL_parser->copline != NOLINE)
7967 CopLINE_set(PL_curcop, PL_parser->copline);
7969 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
7970 "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv));
7972 /* diag_listed_as: Format %s redefined */
7973 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
7974 "Format STDOUT redefined");
7976 CopLINE_set(PL_curcop, oldline);
7981 GvFORM(gv) = (CV *)SvREFCNT_inc_simple_NN(cv);
7983 CvFILE_set_from_cop(cv, PL_curcop);
7986 pad_tidy(padtidy_FORMAT);
7987 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
7988 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7989 OpREFCNT_set(CvROOT(cv), 1);
7990 CvSTART(cv) = LINKLIST(CvROOT(cv));
7991 CvROOT(cv)->op_next = 0;
7992 CALL_PEEP(CvSTART(cv));
7993 finalize_optree(CvROOT(cv));
7998 op_getmad(o,pegop,'n');
7999 op_getmad_weak(block, pegop, 'b');
8004 PL_parser->copline = NOLINE;
8012 Perl_newANONLIST(pTHX_ OP *o)
8014 return convert(OP_ANONLIST, OPf_SPECIAL, o);
8018 Perl_newANONHASH(pTHX_ OP *o)
8020 return convert(OP_ANONHASH, OPf_SPECIAL, o);
8024 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
8026 return newANONATTRSUB(floor, proto, NULL, block);
8030 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
8032 return newUNOP(OP_REFGEN, 0,
8033 newSVOP(OP_ANONCODE, 0,
8034 MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block))));
8038 Perl_oopsAV(pTHX_ OP *o)
8042 PERL_ARGS_ASSERT_OOPSAV;
8044 switch (o->op_type) {
8046 o->op_type = OP_PADAV;
8047 o->op_ppaddr = PL_ppaddr[OP_PADAV];
8048 return ref(o, OP_RV2AV);
8051 o->op_type = OP_RV2AV;
8052 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
8057 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
8064 Perl_oopsHV(pTHX_ OP *o)
8068 PERL_ARGS_ASSERT_OOPSHV;
8070 switch (o->op_type) {
8073 o->op_type = OP_PADHV;
8074 o->op_ppaddr = PL_ppaddr[OP_PADHV];
8075 return ref(o, OP_RV2HV);
8079 o->op_type = OP_RV2HV;
8080 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
8085 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
8092 Perl_newAVREF(pTHX_ OP *o)
8096 PERL_ARGS_ASSERT_NEWAVREF;
8098 if (o->op_type == OP_PADANY) {
8099 o->op_type = OP_PADAV;
8100 o->op_ppaddr = PL_ppaddr[OP_PADAV];
8103 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)) {
8104 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8105 "Using an array as a reference is deprecated");
8107 return newUNOP(OP_RV2AV, 0, scalar(o));
8111 Perl_newGVREF(pTHX_ I32 type, OP *o)
8113 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
8114 return newUNOP(OP_NULL, 0, o);
8115 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
8119 Perl_newHVREF(pTHX_ OP *o)
8123 PERL_ARGS_ASSERT_NEWHVREF;
8125 if (o->op_type == OP_PADANY) {
8126 o->op_type = OP_PADHV;
8127 o->op_ppaddr = PL_ppaddr[OP_PADHV];
8130 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)) {
8131 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8132 "Using a hash as a reference is deprecated");
8134 return newUNOP(OP_RV2HV, 0, scalar(o));
8138 Perl_newCVREF(pTHX_ I32 flags, OP *o)
8140 if (o->op_type == OP_PADANY) {
8142 o->op_type = OP_PADCV;
8143 o->op_ppaddr = PL_ppaddr[OP_PADCV];
8146 return newUNOP(OP_RV2CV, flags, scalar(o));
8150 Perl_newSVREF(pTHX_ OP *o)
8154 PERL_ARGS_ASSERT_NEWSVREF;
8156 if (o->op_type == OP_PADANY) {
8157 o->op_type = OP_PADSV;
8158 o->op_ppaddr = PL_ppaddr[OP_PADSV];
8161 return newUNOP(OP_RV2SV, 0, scalar(o));
8164 /* Check routines. See the comments at the top of this file for details
8165 * on when these are called */
8168 Perl_ck_anoncode(pTHX_ OP *o)
8170 PERL_ARGS_ASSERT_CK_ANONCODE;
8172 cSVOPo->op_targ = pad_add_anon((CV*)cSVOPo->op_sv, o->op_type);
8174 cSVOPo->op_sv = NULL;
8179 Perl_ck_bitop(pTHX_ OP *o)
8183 PERL_ARGS_ASSERT_CK_BITOP;
8185 o->op_private = (U8)(PL_hints & HINT_INTEGER);
8186 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
8187 && (o->op_type == OP_BIT_OR
8188 || o->op_type == OP_BIT_AND
8189 || o->op_type == OP_BIT_XOR))
8191 const OP * const left = cBINOPo->op_first;
8192 const OP * const right = left->op_sibling;
8193 if ((OP_IS_NUMCOMPARE(left->op_type) &&
8194 (left->op_flags & OPf_PARENS) == 0) ||
8195 (OP_IS_NUMCOMPARE(right->op_type) &&
8196 (right->op_flags & OPf_PARENS) == 0))
8197 Perl_ck_warner(aTHX_ packWARN(WARN_PRECEDENCE),
8198 "Possible precedence problem on bitwise %c operator",
8199 o->op_type == OP_BIT_OR ? '|'
8200 : o->op_type == OP_BIT_AND ? '&' : '^'
8206 PERL_STATIC_INLINE bool
8207 is_dollar_bracket(pTHX_ const OP * const o)
8210 return o->op_type == OP_RV2SV && o->op_flags & OPf_KIDS
8211 && (kid = cUNOPx(o)->op_first)
8212 && kid->op_type == OP_GV
8213 && strEQ(GvNAME(cGVOPx_gv(kid)), "[");
8217 Perl_ck_cmp(pTHX_ OP *o)
8219 PERL_ARGS_ASSERT_CK_CMP;
8220 if (ckWARN(WARN_SYNTAX)) {
8221 const OP *kid = cUNOPo->op_first;
8224 is_dollar_bracket(aTHX_ kid)
8225 && kid->op_sibling && kid->op_sibling->op_type == OP_CONST
8227 || ( kid->op_type == OP_CONST
8228 && (kid = kid->op_sibling) && is_dollar_bracket(aTHX_ kid))
8230 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
8231 "$[ used in %s (did you mean $] ?)", OP_DESC(o));
8237 Perl_ck_concat(pTHX_ OP *o)
8239 const OP * const kid = cUNOPo->op_first;
8241 PERL_ARGS_ASSERT_CK_CONCAT;
8242 PERL_UNUSED_CONTEXT;
8244 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
8245 !(kUNOP->op_first->op_flags & OPf_MOD))
8246 o->op_flags |= OPf_STACKED;
8251 Perl_ck_spair(pTHX_ OP *o)
8255 PERL_ARGS_ASSERT_CK_SPAIR;
8257 if (o->op_flags & OPf_KIDS) {
8260 const OPCODE type = o->op_type;
8261 o = modkids(ck_fun(o), type);
8262 kid = cUNOPo->op_first;
8263 newop = kUNOP->op_first->op_sibling;
8265 const OPCODE type = newop->op_type;
8266 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
8267 type == OP_PADAV || type == OP_PADHV ||
8268 type == OP_RV2AV || type == OP_RV2HV)
8272 op_getmad(kUNOP->op_first,newop,'K');
8274 op_free(kUNOP->op_first);
8276 kUNOP->op_first = newop;
8278 /* transforms OP_REFGEN into OP_SREFGEN, OP_CHOP into OP_SCHOP,
8279 * and OP_CHOMP into OP_SCHOMP */
8280 o->op_ppaddr = PL_ppaddr[++o->op_type];
8285 Perl_ck_delete(pTHX_ OP *o)
8287 PERL_ARGS_ASSERT_CK_DELETE;
8291 if (o->op_flags & OPf_KIDS) {
8292 OP * const kid = cUNOPo->op_first;
8293 switch (kid->op_type) {
8295 o->op_flags |= OPf_SPECIAL;
8298 o->op_private |= OPpSLICE;
8301 o->op_flags |= OPf_SPECIAL;
8306 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
8309 if (kid->op_private & OPpLVAL_INTRO)
8310 o->op_private |= OPpLVAL_INTRO;
8317 Perl_ck_die(pTHX_ OP *o)
8319 PERL_ARGS_ASSERT_CK_DIE;
8322 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
8328 Perl_ck_eof(pTHX_ OP *o)
8332 PERL_ARGS_ASSERT_CK_EOF;
8334 if (o->op_flags & OPf_KIDS) {
8336 if (cLISTOPo->op_first->op_type == OP_STUB) {
8338 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
8340 op_getmad(o,newop,'O');
8347 kid = cLISTOPo->op_first;
8348 if (kid->op_type == OP_RV2GV)
8349 kid->op_private |= OPpALLOW_FAKE;
8355 Perl_ck_eval(pTHX_ OP *o)
8359 PERL_ARGS_ASSERT_CK_EVAL;
8361 PL_hints |= HINT_BLOCK_SCOPE;
8362 if (o->op_flags & OPf_KIDS) {
8363 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8366 o->op_flags &= ~OPf_KIDS;
8369 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
8375 cUNOPo->op_first = 0;
8380 NewOp(1101, enter, 1, LOGOP);
8381 enter->op_type = OP_ENTERTRY;
8382 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
8383 enter->op_private = 0;
8385 /* establish postfix order */
8386 enter->op_next = (OP*)enter;
8388 o = op_prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
8389 o->op_type = OP_LEAVETRY;
8390 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
8391 enter->op_other = o;
8392 op_getmad(oldo,o,'O');
8401 const U8 priv = o->op_private;
8407 o = newUNOP(OP_ENTEREVAL, priv <<8, newDEFSVOP());
8408 op_getmad(oldo,o,'O');
8410 o->op_targ = (PADOFFSET)PL_hints;
8411 if (o->op_private & OPpEVAL_BYTES) o->op_targ &= ~HINT_UTF8;
8412 if ((PL_hints & HINT_LOCALIZE_HH) != 0
8413 && !(o->op_private & OPpEVAL_COPHH) && GvHV(PL_hintgv)) {
8414 /* Store a copy of %^H that pp_entereval can pick up. */
8415 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
8416 MUTABLE_SV(hv_copy_hints_hv(GvHV(PL_hintgv))));
8417 cUNOPo->op_first->op_sibling = hhop;
8418 o->op_private |= OPpEVAL_HAS_HH;
8420 if (!(o->op_private & OPpEVAL_BYTES)
8421 && FEATURE_UNIEVAL_IS_ENABLED)
8422 o->op_private |= OPpEVAL_UNICODE;
8427 Perl_ck_exit(pTHX_ OP *o)
8429 PERL_ARGS_ASSERT_CK_EXIT;
8432 HV * const table = GvHV(PL_hintgv);
8434 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
8435 if (svp && *svp && SvTRUE(*svp))
8436 o->op_private |= OPpEXIT_VMSISH;
8438 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
8444 Perl_ck_exec(pTHX_ OP *o)
8446 PERL_ARGS_ASSERT_CK_EXEC;
8448 if (o->op_flags & OPf_STACKED) {
8451 kid = cUNOPo->op_first->op_sibling;
8452 if (kid->op_type == OP_RV2GV)
8461 Perl_ck_exists(pTHX_ OP *o)
8465 PERL_ARGS_ASSERT_CK_EXISTS;
8468 if (o->op_flags & OPf_KIDS) {
8469 OP * const kid = cUNOPo->op_first;
8470 if (kid->op_type == OP_ENTERSUB) {
8471 (void) ref(kid, o->op_type);
8472 if (kid->op_type != OP_RV2CV
8473 && !(PL_parser && PL_parser->error_count))
8474 Perl_croak(aTHX_ "%s argument is not a subroutine name",
8476 o->op_private |= OPpEXISTS_SUB;
8478 else if (kid->op_type == OP_AELEM)
8479 o->op_flags |= OPf_SPECIAL;
8480 else if (kid->op_type != OP_HELEM)
8481 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine",
8489 Perl_ck_rvconst(pTHX_ OP *o)
8492 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8494 PERL_ARGS_ASSERT_CK_RVCONST;
8496 o->op_private |= (PL_hints & HINT_STRICT_REFS);
8497 if (o->op_type == OP_RV2CV)
8498 o->op_private &= ~1;
8500 if (kid->op_type == OP_CONST) {
8503 SV * const kidsv = kid->op_sv;
8505 /* Is it a constant from cv_const_sv()? */
8506 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
8507 SV * const rsv = SvRV(kidsv);
8508 const svtype type = SvTYPE(rsv);
8509 const char *badtype = NULL;
8511 switch (o->op_type) {
8513 if (type > SVt_PVMG)
8514 badtype = "a SCALAR";
8517 if (type != SVt_PVAV)
8518 badtype = "an ARRAY";
8521 if (type != SVt_PVHV)
8525 if (type != SVt_PVCV)
8530 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
8533 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
8534 const char *badthing;
8535 switch (o->op_type) {
8537 badthing = "a SCALAR";
8540 badthing = "an ARRAY";
8543 badthing = "a HASH";
8551 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
8552 SVfARG(kidsv), badthing);
8555 * This is a little tricky. We only want to add the symbol if we
8556 * didn't add it in the lexer. Otherwise we get duplicate strict
8557 * warnings. But if we didn't add it in the lexer, we must at
8558 * least pretend like we wanted to add it even if it existed before,
8559 * or we get possible typo warnings. OPpCONST_ENTERED says
8560 * whether the lexer already added THIS instance of this symbol.
8562 iscv = (o->op_type == OP_RV2CV) * 2;
8564 gv = gv_fetchsv(kidsv,
8565 iscv | !(kid->op_private & OPpCONST_ENTERED),
8568 : o->op_type == OP_RV2SV
8570 : o->op_type == OP_RV2AV
8572 : o->op_type == OP_RV2HV
8575 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
8577 kid->op_type = OP_GV;
8578 SvREFCNT_dec(kid->op_sv);
8580 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
8581 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
8582 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
8584 PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv)));
8586 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
8588 kid->op_private = 0;
8589 kid->op_ppaddr = PL_ppaddr[OP_GV];
8590 /* FAKE globs in the symbol table cause weird bugs (#77810) */
8598 Perl_ck_ftst(pTHX_ OP *o)
8601 const I32 type = o->op_type;
8603 PERL_ARGS_ASSERT_CK_FTST;
8605 if (o->op_flags & OPf_REF) {
8608 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
8609 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8610 const OPCODE kidtype = kid->op_type;
8612 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)
8613 && !(kid->op_private & OPpCONST_FOLDED)) {
8614 OP * const newop = newGVOP(type, OPf_REF,
8615 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
8617 op_getmad(o,newop,'O');
8623 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
8624 o->op_private |= OPpFT_ACCESS;
8625 if (PL_check[kidtype] == Perl_ck_ftst
8626 && kidtype != OP_STAT && kidtype != OP_LSTAT) {
8627 o->op_private |= OPpFT_STACKED;
8628 kid->op_private |= OPpFT_STACKING;
8629 if (kidtype == OP_FTTTY && (
8630 !(kid->op_private & OPpFT_STACKED)
8631 || kid->op_private & OPpFT_AFTER_t
8633 o->op_private |= OPpFT_AFTER_t;
8642 if (type == OP_FTTTY)
8643 o = newGVOP(type, OPf_REF, PL_stdingv);
8645 o = newUNOP(type, 0, newDEFSVOP());
8646 op_getmad(oldo,o,'O');
8652 Perl_ck_fun(pTHX_ OP *o)
8655 const int type = o->op_type;
8656 I32 oa = PL_opargs[type] >> OASHIFT;
8658 PERL_ARGS_ASSERT_CK_FUN;
8660 if (o->op_flags & OPf_STACKED) {
8661 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
8664 return no_fh_allowed(o);
8667 if (o->op_flags & OPf_KIDS) {
8668 OP **tokid = &cLISTOPo->op_first;
8669 OP *kid = cLISTOPo->op_first;
8672 bool seen_optional = FALSE;
8674 if (kid->op_type == OP_PUSHMARK ||
8675 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
8677 tokid = &kid->op_sibling;
8678 kid = kid->op_sibling;
8680 if (kid && kid->op_type == OP_COREARGS) {
8681 bool optional = FALSE;
8684 if (oa & OA_OPTIONAL) optional = TRUE;
8687 if (optional) o->op_private |= numargs;
8692 if (oa & OA_OPTIONAL || (oa & 7) == OA_LIST) {
8693 if (!kid && !seen_optional && PL_opargs[type] & OA_DEFGV)
8694 *tokid = kid = newDEFSVOP();
8695 seen_optional = TRUE;
8700 sibl = kid->op_sibling;
8702 if (!sibl && kid->op_type == OP_STUB) {
8709 /* list seen where single (scalar) arg expected? */
8710 if (numargs == 1 && !(oa >> 4)
8711 && kid->op_type == OP_LIST && type != OP_SCALAR)
8713 return too_many_arguments_pv(o,PL_op_desc[type], 0);
8726 if ((type == OP_PUSH || type == OP_UNSHIFT)
8727 && !kid->op_sibling)
8728 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
8729 "Useless use of %s with no values",
8732 if (kid->op_type == OP_CONST &&
8733 (kid->op_private & OPpCONST_BARE))
8735 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
8736 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
8737 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8738 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
8739 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
8741 op_getmad(kid,newop,'K');
8746 kid->op_sibling = sibl;
8749 else if (kid->op_type == OP_CONST
8750 && ( !SvROK(cSVOPx_sv(kid))
8751 || SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV )
8753 bad_type_pv(numargs, "array", PL_op_desc[type], 0, kid);
8754 /* Defer checks to run-time if we have a scalar arg */
8755 if (kid->op_type == OP_RV2AV || kid->op_type == OP_PADAV)
8756 op_lvalue(kid, type);
8760 if (kid->op_type == OP_CONST &&
8761 (kid->op_private & OPpCONST_BARE))
8763 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
8764 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
8765 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8766 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
8767 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
8769 op_getmad(kid,newop,'K');
8774 kid->op_sibling = sibl;
8777 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
8778 bad_type_pv(numargs, "hash", PL_op_desc[type], 0, kid);
8779 op_lvalue(kid, type);
8783 OP * const newop = newUNOP(OP_NULL, 0, kid);
8784 kid->op_sibling = 0;
8785 newop->op_next = newop;
8787 kid->op_sibling = sibl;
8792 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
8793 if (kid->op_type == OP_CONST &&
8794 (kid->op_private & OPpCONST_BARE))
8796 OP * const newop = newGVOP(OP_GV, 0,
8797 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
8798 if (!(o->op_private & 1) && /* if not unop */
8799 kid == cLISTOPo->op_last)
8800 cLISTOPo->op_last = newop;
8802 op_getmad(kid,newop,'K');
8808 else if (kid->op_type == OP_READLINE) {
8809 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
8810 bad_type_pv(numargs, "HANDLE", OP_DESC(o), 0, kid);
8813 I32 flags = OPf_SPECIAL;
8817 /* is this op a FH constructor? */
8818 if (is_handle_constructor(o,numargs)) {
8819 const char *name = NULL;
8822 bool want_dollar = TRUE;
8825 /* Set a flag to tell rv2gv to vivify
8826 * need to "prove" flag does not mean something
8827 * else already - NI-S 1999/05/07
8830 if (kid->op_type == OP_PADSV) {
8832 = PAD_COMPNAME_SV(kid->op_targ);
8833 name = SvPV_const(namesv, len);
8834 name_utf8 = SvUTF8(namesv);
8836 else if (kid->op_type == OP_RV2SV
8837 && kUNOP->op_first->op_type == OP_GV)
8839 GV * const gv = cGVOPx_gv(kUNOP->op_first);
8841 len = GvNAMELEN(gv);
8842 name_utf8 = GvNAMEUTF8(gv) ? SVf_UTF8 : 0;
8844 else if (kid->op_type == OP_AELEM
8845 || kid->op_type == OP_HELEM)
8848 OP *op = ((BINOP*)kid)->op_first;
8852 const char * const a =
8853 kid->op_type == OP_AELEM ?
8855 if (((op->op_type == OP_RV2AV) ||
8856 (op->op_type == OP_RV2HV)) &&
8857 (firstop = ((UNOP*)op)->op_first) &&
8858 (firstop->op_type == OP_GV)) {
8859 /* packagevar $a[] or $h{} */
8860 GV * const gv = cGVOPx_gv(firstop);
8868 else if (op->op_type == OP_PADAV
8869 || op->op_type == OP_PADHV) {
8870 /* lexicalvar $a[] or $h{} */
8871 const char * const padname =
8872 PAD_COMPNAME_PV(op->op_targ);
8881 name = SvPV_const(tmpstr, len);
8882 name_utf8 = SvUTF8(tmpstr);
8887 name = "__ANONIO__";
8889 want_dollar = FALSE;
8891 op_lvalue(kid, type);
8895 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
8896 namesv = PAD_SVl(targ);
8897 SvUPGRADE(namesv, SVt_PV);
8898 if (want_dollar && *name != '$')
8899 sv_setpvs(namesv, "$");
8900 sv_catpvn(namesv, name, len);
8901 if ( name_utf8 ) SvUTF8_on(namesv);
8904 kid->op_sibling = 0;
8905 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
8906 kid->op_targ = targ;
8907 kid->op_private |= priv;
8909 kid->op_sibling = sibl;
8915 if ((type == OP_UNDEF || type == OP_POS)
8916 && numargs == 1 && !(oa >> 4)
8917 && kid->op_type == OP_LIST)
8918 return too_many_arguments_pv(o,PL_op_desc[type], 0);
8919 op_lvalue(scalar(kid), type);
8923 tokid = &kid->op_sibling;
8924 kid = kid->op_sibling;
8927 if (kid && kid->op_type != OP_STUB)
8928 return too_many_arguments_pv(o,OP_DESC(o), 0);
8929 o->op_private |= numargs;
8931 /* FIXME - should the numargs move as for the PERL_MAD case? */
8932 o->op_private |= numargs;
8934 return too_many_arguments_pv(o,OP_DESC(o), 0);
8938 else if (PL_opargs[type] & OA_DEFGV) {
8940 OP *newop = newUNOP(type, 0, newDEFSVOP());
8941 op_getmad(o,newop,'O');
8944 /* Ordering of these two is important to keep f_map.t passing. */
8946 return newUNOP(type, 0, newDEFSVOP());
8951 while (oa & OA_OPTIONAL)
8953 if (oa && oa != OA_LIST)
8954 return too_few_arguments_pv(o,OP_DESC(o), 0);
8960 Perl_ck_glob(pTHX_ OP *o)
8964 const bool core = o->op_flags & OPf_SPECIAL;
8966 PERL_ARGS_ASSERT_CK_GLOB;
8969 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
8970 op_append_elem(OP_GLOB, o, newDEFSVOP()); /* glob() => glob($_) */
8972 if (core) gv = NULL;
8973 else if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
8974 && GvCVu(gv) && GvIMPORTED_CV(gv)))
8976 GV * const * const gvp =
8977 (GV **)hv_fetchs(PL_globalstash, "glob", FALSE);
8978 gv = gvp ? *gvp : NULL;
8981 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
8984 * \ null - const(wildcard)
8989 * \ mark - glob - rv2cv
8990 * | \ gv(CORE::GLOBAL::glob)
8992 * \ null - const(wildcard)
8994 o->op_flags |= OPf_SPECIAL;
8995 o->op_targ = pad_alloc(OP_GLOB, SVs_PADTMP);
8996 o = newLISTOP(OP_LIST, 0, o, NULL);
8997 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
8998 op_append_elem(OP_LIST, o,
8999 scalar(newUNOP(OP_RV2CV, 0,
9000 newGVOP(OP_GV, 0, gv)))));
9001 o = newUNOP(OP_NULL, 0, o);
9002 o->op_targ = OP_GLOB; /* hint at what it used to be: eg in newWHILEOP */
9005 else o->op_flags &= ~OPf_SPECIAL;
9006 #if !defined(PERL_EXTERNAL_GLOB)
9009 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
9010 newSVpvs("File::Glob"), NULL, NULL, NULL);
9013 #endif /* !PERL_EXTERNAL_GLOB */
9014 gv = (GV *)newSV(0);
9015 gv_init(gv, 0, "", 0, 0);
9017 op_append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
9018 SvREFCNT_dec_NN(gv); /* newGVOP increased it */
9024 Perl_ck_grep(pTHX_ OP *o)
9029 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
9032 PERL_ARGS_ASSERT_CK_GREP;
9034 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
9035 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
9037 if (o->op_flags & OPf_STACKED) {
9038 kid = cUNOPx(cLISTOPo->op_first->op_sibling)->op_first;
9039 if (kid->op_type != OP_SCOPE && kid->op_type != OP_LEAVE)
9040 return no_fh_allowed(o);
9041 o->op_flags &= ~OPf_STACKED;
9043 kid = cLISTOPo->op_first->op_sibling;
9044 if (type == OP_MAPWHILE)
9049 if (PL_parser && PL_parser->error_count)
9051 kid = cLISTOPo->op_first->op_sibling;
9052 if (kid->op_type != OP_NULL)
9053 Perl_croak(aTHX_ "panic: ck_grep, type=%u", (unsigned) kid->op_type);
9054 kid = kUNOP->op_first;
9056 NewOp(1101, gwop, 1, LOGOP);
9057 gwop->op_type = type;
9058 gwop->op_ppaddr = PL_ppaddr[type];
9060 gwop->op_flags |= OPf_KIDS;
9061 gwop->op_other = LINKLIST(kid);
9062 kid->op_next = (OP*)gwop;
9063 offset = pad_findmy_pvs("$_", 0);
9064 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
9065 o->op_private = gwop->op_private = 0;
9066 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
9069 o->op_private = gwop->op_private = OPpGREP_LEX;
9070 gwop->op_targ = o->op_targ = offset;
9073 kid = cLISTOPo->op_first->op_sibling;
9074 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
9075 op_lvalue(kid, OP_GREPSTART);
9081 Perl_ck_index(pTHX_ OP *o)
9083 PERL_ARGS_ASSERT_CK_INDEX;
9085 if (o->op_flags & OPf_KIDS) {
9086 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9088 kid = kid->op_sibling; /* get past "big" */
9089 if (kid && kid->op_type == OP_CONST) {
9090 const bool save_taint = TAINT_get; /* accepted unused var warning if NO_TAINT_SUPPORT */
9091 fbm_compile(((SVOP*)kid)->op_sv, 0);
9092 TAINT_set(save_taint);
9099 Perl_ck_lfun(pTHX_ OP *o)
9101 const OPCODE type = o->op_type;
9103 PERL_ARGS_ASSERT_CK_LFUN;
9105 return modkids(ck_fun(o), type);
9109 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
9111 PERL_ARGS_ASSERT_CK_DEFINED;
9113 if ((o->op_flags & OPf_KIDS)) {
9114 switch (cUNOPo->op_first->op_type) {
9117 case OP_AASSIGN: /* Is this a good idea? */
9118 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9119 "defined(@array) is deprecated");
9120 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9121 "\t(Maybe you should just omit the defined()?)\n");
9125 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9126 "defined(%%hash) is deprecated");
9127 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9128 "\t(Maybe you should just omit the defined()?)\n");
9139 Perl_ck_readline(pTHX_ OP *o)
9141 PERL_ARGS_ASSERT_CK_READLINE;
9143 if (o->op_flags & OPf_KIDS) {
9144 OP *kid = cLISTOPo->op_first;
9145 if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE;
9149 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
9151 op_getmad(o,newop,'O');
9161 Perl_ck_rfun(pTHX_ OP *o)
9163 const OPCODE type = o->op_type;
9165 PERL_ARGS_ASSERT_CK_RFUN;
9167 return refkids(ck_fun(o), type);
9171 Perl_ck_listiob(pTHX_ OP *o)
9175 PERL_ARGS_ASSERT_CK_LISTIOB;
9177 kid = cLISTOPo->op_first;
9180 kid = cLISTOPo->op_first;
9182 if (kid->op_type == OP_PUSHMARK)
9183 kid = kid->op_sibling;
9184 if (kid && o->op_flags & OPf_STACKED)
9185 kid = kid->op_sibling;
9186 else if (kid && !kid->op_sibling) { /* print HANDLE; */
9187 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE
9188 && !(kid->op_private & OPpCONST_FOLDED)) {
9189 o->op_flags |= OPf_STACKED; /* make it a filehandle */
9190 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
9191 cLISTOPo->op_first->op_sibling = kid;
9192 cLISTOPo->op_last = kid;
9193 kid = kid->op_sibling;
9198 op_append_elem(o->op_type, o, newDEFSVOP());
9200 if (o->op_type == OP_PRTF) return modkids(listkids(o), OP_PRTF);
9205 Perl_ck_smartmatch(pTHX_ OP *o)
9208 PERL_ARGS_ASSERT_CK_SMARTMATCH;
9209 if (0 == (o->op_flags & OPf_SPECIAL)) {
9210 OP *first = cBINOPo->op_first;
9211 OP *second = first->op_sibling;
9213 /* Implicitly take a reference to an array or hash */
9214 first->op_sibling = NULL;
9215 first = cBINOPo->op_first = ref_array_or_hash(first);
9216 second = first->op_sibling = ref_array_or_hash(second);
9218 /* Implicitly take a reference to a regular expression */
9219 if (first->op_type == OP_MATCH) {
9220 first->op_type = OP_QR;
9221 first->op_ppaddr = PL_ppaddr[OP_QR];
9223 if (second->op_type == OP_MATCH) {
9224 second->op_type = OP_QR;
9225 second->op_ppaddr = PL_ppaddr[OP_QR];
9234 Perl_ck_sassign(pTHX_ OP *o)
9237 OP * const kid = cLISTOPo->op_first;
9239 PERL_ARGS_ASSERT_CK_SASSIGN;
9241 /* has a disposable target? */
9242 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
9243 && !(kid->op_flags & OPf_STACKED)
9244 /* Cannot steal the second time! */
9245 && !(kid->op_private & OPpTARGET_MY)
9246 /* Keep the full thing for madskills */
9250 OP * const kkid = kid->op_sibling;
9252 /* Can just relocate the target. */
9253 if (kkid && kkid->op_type == OP_PADSV
9254 && !(kkid->op_private & OPpLVAL_INTRO))
9256 kid->op_targ = kkid->op_targ;
9258 /* Now we do not need PADSV and SASSIGN. */
9259 kid->op_sibling = o->op_sibling; /* NULL */
9260 cLISTOPo->op_first = NULL;
9263 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
9267 if (kid->op_sibling) {
9268 OP *kkid = kid->op_sibling;
9269 /* For state variable assignment, kkid is a list op whose op_last
9271 if ((kkid->op_type == OP_PADSV ||
9272 (kkid->op_type == OP_LIST &&
9273 (kkid = cLISTOPx(kkid)->op_last)->op_type == OP_PADSV
9276 && (kkid->op_private & OPpLVAL_INTRO)
9277 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
9278 const PADOFFSET target = kkid->op_targ;
9279 OP *const other = newOP(OP_PADSV,
9281 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
9282 OP *const first = newOP(OP_NULL, 0);
9283 OP *const nullop = newCONDOP(0, first, o, other);
9284 OP *const condop = first->op_next;
9285 /* hijacking PADSTALE for uninitialized state variables */
9286 SvPADSTALE_on(PAD_SVl(target));
9288 condop->op_type = OP_ONCE;
9289 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
9290 condop->op_targ = target;
9291 other->op_targ = target;
9293 /* Because we change the type of the op here, we will skip the
9294 assignment binop->op_last = binop->op_first->op_sibling; at the
9295 end of Perl_newBINOP(). So need to do it here. */
9296 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
9305 Perl_ck_match(pTHX_ OP *o)
9309 PERL_ARGS_ASSERT_CK_MATCH;
9311 if (o->op_type != OP_QR && PL_compcv) {
9312 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
9313 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
9314 o->op_targ = offset;
9315 o->op_private |= OPpTARGET_MY;
9318 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
9319 o->op_private |= OPpRUNTIME;
9324 Perl_ck_method(pTHX_ OP *o)
9326 OP * const kid = cUNOPo->op_first;
9328 PERL_ARGS_ASSERT_CK_METHOD;
9330 if (kid->op_type == OP_CONST) {
9331 SV* sv = kSVOP->op_sv;
9332 const char * const method = SvPVX_const(sv);
9333 if (!(strchr(method, ':') || strchr(method, '\''))) {
9336 sv = newSVpvn_share(method, SvUTF8(sv) ? -(I32)SvCUR(sv) : (I32)SvCUR(sv), 0);
9339 kSVOP->op_sv = NULL;
9341 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
9343 op_getmad(o,cmop,'O');
9354 Perl_ck_null(pTHX_ OP *o)
9356 PERL_ARGS_ASSERT_CK_NULL;
9357 PERL_UNUSED_CONTEXT;
9362 Perl_ck_open(pTHX_ OP *o)
9365 HV * const table = GvHV(PL_hintgv);
9367 PERL_ARGS_ASSERT_CK_OPEN;
9370 SV **svp = hv_fetchs(table, "open_IN", FALSE);
9373 const char *d = SvPV_const(*svp, len);
9374 const I32 mode = mode_from_discipline(d, len);
9375 if (mode & O_BINARY)
9376 o->op_private |= OPpOPEN_IN_RAW;
9377 else if (mode & O_TEXT)
9378 o->op_private |= OPpOPEN_IN_CRLF;
9381 svp = hv_fetchs(table, "open_OUT", FALSE);
9384 const char *d = SvPV_const(*svp, len);
9385 const I32 mode = mode_from_discipline(d, len);
9386 if (mode & O_BINARY)
9387 o->op_private |= OPpOPEN_OUT_RAW;
9388 else if (mode & O_TEXT)
9389 o->op_private |= OPpOPEN_OUT_CRLF;
9392 if (o->op_type == OP_BACKTICK) {
9393 if (!(o->op_flags & OPf_KIDS)) {
9394 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
9396 op_getmad(o,newop,'O');
9405 /* In case of three-arg dup open remove strictness
9406 * from the last arg if it is a bareword. */
9407 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
9408 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
9412 if ((last->op_type == OP_CONST) && /* The bareword. */
9413 (last->op_private & OPpCONST_BARE) &&
9414 (last->op_private & OPpCONST_STRICT) &&
9415 (oa = first->op_sibling) && /* The fh. */
9416 (oa = oa->op_sibling) && /* The mode. */
9417 (oa->op_type == OP_CONST) &&
9418 SvPOK(((SVOP*)oa)->op_sv) &&
9419 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
9420 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
9421 (last == oa->op_sibling)) /* The bareword. */
9422 last->op_private &= ~OPpCONST_STRICT;
9428 Perl_ck_repeat(pTHX_ OP *o)
9430 PERL_ARGS_ASSERT_CK_REPEAT;
9432 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
9433 o->op_private |= OPpREPEAT_DOLIST;
9434 cBINOPo->op_first = force_list(cBINOPo->op_first);
9442 Perl_ck_require(pTHX_ OP *o)
9447 PERL_ARGS_ASSERT_CK_REQUIRE;
9449 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
9450 SVOP * const kid = (SVOP*)cUNOPo->op_first;
9452 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
9453 SV * const sv = kid->op_sv;
9454 U32 was_readonly = SvREADONLY(sv);
9462 if (SvIsCOW(sv)) sv_force_normal_flags(sv, 0);
9467 for (; s < end; s++) {
9468 if (*s == ':' && s[1] == ':') {
9470 Move(s+2, s+1, end - s - 1, char);
9475 sv_catpvs(sv, ".pm");
9476 SvFLAGS(sv) |= was_readonly;
9480 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
9481 /* handle override, if any */
9482 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
9483 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
9484 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
9485 gv = gvp ? *gvp : NULL;
9489 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
9491 if (o->op_flags & OPf_KIDS) {
9492 kid = cUNOPo->op_first;
9493 cUNOPo->op_first = NULL;
9501 newop = newUNOP(OP_ENTERSUB, OPf_STACKED,
9502 op_append_elem(OP_LIST, kid,
9503 scalar(newUNOP(OP_RV2CV, 0,
9506 op_getmad(o,newop,'O');
9510 return scalar(ck_fun(o));
9514 Perl_ck_return(pTHX_ OP *o)
9519 PERL_ARGS_ASSERT_CK_RETURN;
9521 kid = cLISTOPo->op_first->op_sibling;
9522 if (CvLVALUE(PL_compcv)) {
9523 for (; kid; kid = kid->op_sibling)
9524 op_lvalue(kid, OP_LEAVESUBLV);
9531 Perl_ck_select(pTHX_ OP *o)
9536 PERL_ARGS_ASSERT_CK_SELECT;
9538 if (o->op_flags & OPf_KIDS) {
9539 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9540 if (kid && kid->op_sibling) {
9541 o->op_type = OP_SSELECT;
9542 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
9544 return fold_constants(op_integerize(op_std_init(o)));
9548 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9549 if (kid && kid->op_type == OP_RV2GV)
9550 kid->op_private &= ~HINT_STRICT_REFS;
9555 Perl_ck_shift(pTHX_ OP *o)
9558 const I32 type = o->op_type;
9560 PERL_ARGS_ASSERT_CK_SHIFT;
9562 if (!(o->op_flags & OPf_KIDS)) {
9565 if (!CvUNIQUE(PL_compcv)) {
9566 o->op_flags |= OPf_SPECIAL;
9570 argop = newUNOP(OP_RV2AV, 0, scalar(newGVOP(OP_GV, 0, PL_argvgv)));
9573 OP * const oldo = o;
9574 o = newUNOP(type, 0, scalar(argop));
9575 op_getmad(oldo,o,'O');
9580 return newUNOP(type, 0, scalar(argop));
9583 return scalar(ck_fun(o));
9587 Perl_ck_sort(pTHX_ OP *o)
9591 HV * const hinthv = GvHV(PL_hintgv);
9593 PERL_ARGS_ASSERT_CK_SORT;
9596 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
9598 const I32 sorthints = (I32)SvIV(*svp);
9599 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
9600 o->op_private |= OPpSORT_QSORT;
9601 if ((sorthints & HINT_SORT_STABLE) != 0)
9602 o->op_private |= OPpSORT_STABLE;
9606 if (o->op_flags & OPf_STACKED)
9608 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9609 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
9610 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
9612 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
9614 if (kid->op_type == OP_LEAVE)
9615 op_null(kid); /* wipe out leave */
9616 /* Prevent execution from escaping out of the sort block. */
9619 /* provide scalar context for comparison function/block */
9620 kid = scalar(firstkid);
9622 o->op_flags |= OPf_SPECIAL;
9625 firstkid = firstkid->op_sibling;
9628 /* provide list context for arguments */
9635 S_simplify_sort(pTHX_ OP *o)
9638 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9645 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
9647 if (!(o->op_flags & OPf_STACKED))
9649 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
9650 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
9651 kid = kUNOP->op_first; /* get past null */
9652 if (!(have_scopeop = kid->op_type == OP_SCOPE)
9653 && kid->op_type != OP_LEAVE)
9655 kid = kLISTOP->op_last; /* get past scope */
9656 switch(kid->op_type) {
9660 if (!have_scopeop) goto padkids;
9665 k = kid; /* remember this node*/
9666 if (kBINOP->op_first->op_type != OP_RV2SV
9667 || kBINOP->op_last ->op_type != OP_RV2SV)
9670 Warn about my($a) or my($b) in a sort block, *if* $a or $b is
9671 then used in a comparison. This catches most, but not
9672 all cases. For instance, it catches
9673 sort { my($a); $a <=> $b }
9675 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
9676 (although why you'd do that is anyone's guess).
9680 if (!ckWARN(WARN_SYNTAX)) return;
9681 kid = kBINOP->op_first;
9683 if (kid->op_type == OP_PADSV) {
9684 SV * const name = AvARRAY(PL_comppad_name)[kid->op_targ];
9685 if (SvCUR(name) == 2 && *SvPVX(name) == '$'
9686 && (SvPVX(name)[1] == 'a' || SvPVX(name)[1] == 'b'))
9687 /* diag_listed_as: "my %s" used in sort comparison */
9688 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
9689 "\"%s %s\" used in sort comparison",
9690 SvPAD_STATE(name) ? "state" : "my",
9693 } while ((kid = kid->op_sibling));
9696 kid = kBINOP->op_first; /* get past cmp */
9697 if (kUNOP->op_first->op_type != OP_GV)
9699 kid = kUNOP->op_first; /* get past rv2sv */
9701 if (GvSTASH(gv) != PL_curstash)
9703 gvname = GvNAME(gv);
9704 if (*gvname == 'a' && gvname[1] == '\0')
9706 else if (*gvname == 'b' && gvname[1] == '\0')
9711 kid = k; /* back to cmp */
9712 /* already checked above that it is rv2sv */
9713 kid = kBINOP->op_last; /* down to 2nd arg */
9714 if (kUNOP->op_first->op_type != OP_GV)
9716 kid = kUNOP->op_first; /* get past rv2sv */
9718 if (GvSTASH(gv) != PL_curstash)
9720 gvname = GvNAME(gv);
9722 ? !(*gvname == 'a' && gvname[1] == '\0')
9723 : !(*gvname == 'b' && gvname[1] == '\0'))
9725 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
9727 o->op_private |= OPpSORT_DESCEND;
9728 if (k->op_type == OP_NCMP)
9729 o->op_private |= OPpSORT_NUMERIC;
9730 if (k->op_type == OP_I_NCMP)
9731 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
9732 kid = cLISTOPo->op_first->op_sibling;
9733 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
9735 op_getmad(kid,o,'S'); /* then delete it */
9737 op_free(kid); /* then delete it */
9742 Perl_ck_split(pTHX_ OP *o)
9747 PERL_ARGS_ASSERT_CK_SPLIT;
9749 if (o->op_flags & OPf_STACKED)
9750 return no_fh_allowed(o);
9752 kid = cLISTOPo->op_first;
9753 if (kid->op_type != OP_NULL)
9754 Perl_croak(aTHX_ "panic: ck_split, type=%u", (unsigned) kid->op_type);
9755 kid = kid->op_sibling;
9756 op_free(cLISTOPo->op_first);
9758 cLISTOPo->op_first = kid;
9760 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
9761 cLISTOPo->op_last = kid; /* There was only one element previously */
9764 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
9765 OP * const sibl = kid->op_sibling;
9766 kid->op_sibling = 0;
9767 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0, 0); /* OPf_SPECIAL is used to trigger split " " behavior */
9768 if (cLISTOPo->op_first == cLISTOPo->op_last)
9769 cLISTOPo->op_last = kid;
9770 cLISTOPo->op_first = kid;
9771 kid->op_sibling = sibl;
9774 kid->op_type = OP_PUSHRE;
9775 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
9777 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
9778 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP),
9779 "Use of /g modifier is meaningless in split");
9782 if (!kid->op_sibling)
9783 op_append_elem(OP_SPLIT, o, newDEFSVOP());
9785 kid = kid->op_sibling;
9788 if (!kid->op_sibling)
9789 op_append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
9790 assert(kid->op_sibling);
9792 kid = kid->op_sibling;
9795 if (kid->op_sibling)
9796 return too_many_arguments_pv(o,OP_DESC(o), 0);
9802 Perl_ck_join(pTHX_ OP *o)
9804 const OP * const kid = cLISTOPo->op_first->op_sibling;
9806 PERL_ARGS_ASSERT_CK_JOIN;
9808 if (kid && kid->op_type == OP_MATCH) {
9809 if (ckWARN(WARN_SYNTAX)) {
9810 const REGEXP *re = PM_GETRE(kPMOP);
9812 ? newSVpvn_flags( RX_PRECOMP_const(re), RX_PRELEN(re),
9813 SVs_TEMP | ( RX_UTF8(re) ? SVf_UTF8 : 0 ) )
9814 : newSVpvs_flags( "STRING", SVs_TEMP );
9815 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
9816 "/%"SVf"/ should probably be written as \"%"SVf"\"",
9817 SVfARG(msg), SVfARG(msg));
9824 =for apidoc Am|CV *|rv2cv_op_cv|OP *cvop|U32 flags
9826 Examines an op, which is expected to identify a subroutine at runtime,
9827 and attempts to determine at compile time which subroutine it identifies.
9828 This is normally used during Perl compilation to determine whether
9829 a prototype can be applied to a function call. I<cvop> is the op
9830 being considered, normally an C<rv2cv> op. A pointer to the identified
9831 subroutine is returned, if it could be determined statically, and a null
9832 pointer is returned if it was not possible to determine statically.
9834 Currently, the subroutine can be identified statically if the RV that the
9835 C<rv2cv> is to operate on is provided by a suitable C<gv> or C<const> op.
9836 A C<gv> op is suitable if the GV's CV slot is populated. A C<const> op is
9837 suitable if the constant value must be an RV pointing to a CV. Details of
9838 this process may change in future versions of Perl. If the C<rv2cv> op
9839 has the C<OPpENTERSUB_AMPER> flag set then no attempt is made to identify
9840 the subroutine statically: this flag is used to suppress compile-time
9841 magic on a subroutine call, forcing it to use default runtime behaviour.
9843 If I<flags> has the bit C<RV2CVOPCV_MARK_EARLY> set, then the handling
9844 of a GV reference is modified. If a GV was examined and its CV slot was
9845 found to be empty, then the C<gv> op has the C<OPpEARLY_CV> flag set.
9846 If the op is not optimised away, and the CV slot is later populated with
9847 a subroutine having a prototype, that flag eventually triggers the warning
9848 "called too early to check prototype".
9850 If I<flags> has the bit C<RV2CVOPCV_RETURN_NAME_GV> set, then instead
9851 of returning a pointer to the subroutine it returns a pointer to the
9852 GV giving the most appropriate name for the subroutine in this context.
9853 Normally this is just the C<CvGV> of the subroutine, but for an anonymous
9854 (C<CvANON>) subroutine that is referenced through a GV it will be the
9855 referencing GV. The resulting C<GV*> is cast to C<CV*> to be returned.
9856 A null pointer is returned as usual if there is no statically-determinable
9863 Perl_rv2cv_op_cv(pTHX_ OP *cvop, U32 flags)
9868 PERL_ARGS_ASSERT_RV2CV_OP_CV;
9869 if (flags & ~(RV2CVOPCV_MARK_EARLY|RV2CVOPCV_RETURN_NAME_GV))
9870 Perl_croak(aTHX_ "panic: rv2cv_op_cv bad flags %x", (unsigned)flags);
9871 if (cvop->op_type != OP_RV2CV)
9873 if (cvop->op_private & OPpENTERSUB_AMPER)
9875 if (!(cvop->op_flags & OPf_KIDS))
9877 rvop = cUNOPx(cvop)->op_first;
9878 switch (rvop->op_type) {
9880 gv = cGVOPx_gv(rvop);
9883 if (flags & RV2CVOPCV_MARK_EARLY)
9884 rvop->op_private |= OPpEARLY_CV;
9889 SV *rv = cSVOPx_sv(rvop);
9896 PADNAME *name = PAD_COMPNAME(rvop->op_targ);
9897 CV *compcv = PL_compcv;
9898 PADOFFSET off = rvop->op_targ;
9899 while (PadnameOUTER(name)) {
9900 assert(PARENT_PAD_INDEX(name));
9901 compcv = CvOUTSIDE(PL_compcv);
9902 name = PadlistNAMESARRAY(CvPADLIST(compcv))
9903 [off = PARENT_PAD_INDEX(name)];
9905 assert(!PadnameIsOUR(name));
9906 if (!PadnameIsSTATE(name)) {
9907 MAGIC * mg = mg_find(name, PERL_MAGIC_proto);
9910 cv = (CV *)mg->mg_obj;
9913 (CV *)AvARRAY(PadlistARRAY(CvPADLIST(compcv))[1])[off];
9920 if (SvTYPE((SV*)cv) != SVt_PVCV)
9922 if (flags & RV2CVOPCV_RETURN_NAME_GV) {
9923 if (!CvANON(cv) || !gv)
9932 =for apidoc Am|OP *|ck_entersub_args_list|OP *entersubop
9934 Performs the default fixup of the arguments part of an C<entersub>
9935 op tree. This consists of applying list context to each of the
9936 argument ops. This is the standard treatment used on a call marked
9937 with C<&>, or a method call, or a call through a subroutine reference,
9938 or any other call where the callee can't be identified at compile time,
9939 or a call where the callee has no prototype.
9945 Perl_ck_entersub_args_list(pTHX_ OP *entersubop)
9948 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_LIST;
9949 aop = cUNOPx(entersubop)->op_first;
9950 if (!aop->op_sibling)
9951 aop = cUNOPx(aop)->op_first;
9952 for (aop = aop->op_sibling; aop->op_sibling; aop = aop->op_sibling) {
9953 if (!(PL_madskills && aop->op_type == OP_STUB)) {
9955 op_lvalue(aop, OP_ENTERSUB);
9962 =for apidoc Am|OP *|ck_entersub_args_proto|OP *entersubop|GV *namegv|SV *protosv
9964 Performs the fixup of the arguments part of an C<entersub> op tree
9965 based on a subroutine prototype. This makes various modifications to
9966 the argument ops, from applying context up to inserting C<refgen> ops,
9967 and checking the number and syntactic types of arguments, as directed by
9968 the prototype. This is the standard treatment used on a subroutine call,
9969 not marked with C<&>, where the callee can be identified at compile time
9970 and has a prototype.
9972 I<protosv> supplies the subroutine prototype to be applied to the call.
9973 It may be a normal defined scalar, of which the string value will be used.
9974 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
9975 that has been cast to C<SV*>) which has a prototype. The prototype
9976 supplied, in whichever form, does not need to match the actual callee
9977 referenced by the op tree.
9979 If the argument ops disagree with the prototype, for example by having
9980 an unacceptable number of arguments, a valid op tree is returned anyway.
9981 The error is reflected in the parser state, normally resulting in a single
9982 exception at the top level of parsing which covers all the compilation
9983 errors that occurred. In the error message, the callee is referred to
9984 by the name defined by the I<namegv> parameter.
9990 Perl_ck_entersub_args_proto(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
9993 const char *proto, *proto_end;
9994 OP *aop, *prev, *cvop;
9997 I32 contextclass = 0;
9998 const char *e = NULL;
9999 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO;
10000 if (SvTYPE(protosv) == SVt_PVCV ? !SvPOK(protosv) : !SvOK(protosv))
10001 Perl_croak(aTHX_ "panic: ck_entersub_args_proto CV with no proto, "
10002 "flags=%lx", (unsigned long) SvFLAGS(protosv));
10003 if (SvTYPE(protosv) == SVt_PVCV)
10004 proto = CvPROTO(protosv), proto_len = CvPROTOLEN(protosv);
10005 else proto = SvPV(protosv, proto_len);
10006 proto_end = proto + proto_len;
10007 aop = cUNOPx(entersubop)->op_first;
10008 if (!aop->op_sibling)
10009 aop = cUNOPx(aop)->op_first;
10011 aop = aop->op_sibling;
10012 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
10013 while (aop != cvop) {
10015 if (PL_madskills && aop->op_type == OP_STUB) {
10016 aop = aop->op_sibling;
10019 if (PL_madskills && aop->op_type == OP_NULL)
10020 o3 = ((UNOP*)aop)->op_first;
10024 if (proto >= proto_end)
10025 return too_many_arguments_sv(entersubop, gv_ename(namegv), 0);
10033 /* _ must be at the end */
10034 if (proto[1] && !strchr(";@%", proto[1]))
10049 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
10051 arg == 1 ? "block or sub {}" : "sub {}",
10052 gv_ename(namegv), 0, o3);
10055 /* '*' allows any scalar type, including bareword */
10058 if (o3->op_type == OP_RV2GV)
10059 goto wrapref; /* autoconvert GLOB -> GLOBref */
10060 else if (o3->op_type == OP_CONST)
10061 o3->op_private &= ~OPpCONST_STRICT;
10062 else if (o3->op_type == OP_ENTERSUB) {
10063 /* accidental subroutine, revert to bareword */
10064 OP *gvop = ((UNOP*)o3)->op_first;
10065 if (gvop && gvop->op_type == OP_NULL) {
10066 gvop = ((UNOP*)gvop)->op_first;
10068 for (; gvop->op_sibling; gvop = gvop->op_sibling)
10071 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
10072 (gvop = ((UNOP*)gvop)->op_first) &&
10073 gvop->op_type == OP_GV)
10075 GV * const gv = cGVOPx_gv(gvop);
10076 OP * const sibling = aop->op_sibling;
10077 SV * const n = newSVpvs("");
10079 OP * const oldaop = aop;
10083 gv_fullname4(n, gv, "", FALSE);
10084 aop = newSVOP(OP_CONST, 0, n);
10085 op_getmad(oldaop,aop,'O');
10086 prev->op_sibling = aop;
10087 aop->op_sibling = sibling;
10097 if (o3->op_type == OP_RV2AV ||
10098 o3->op_type == OP_PADAV ||
10099 o3->op_type == OP_RV2HV ||
10100 o3->op_type == OP_PADHV
10106 case '[': case ']':
10113 switch (*proto++) {
10115 if (contextclass++ == 0) {
10116 e = strchr(proto, ']');
10117 if (!e || e == proto)
10125 if (contextclass) {
10126 const char *p = proto;
10127 const char *const end = proto;
10129 while (*--p != '[')
10130 /* \[$] accepts any scalar lvalue */
10132 && Perl_op_lvalue_flags(aTHX_
10134 OP_READ, /* not entersub */
10137 bad_type_sv(arg, Perl_form(aTHX_ "one of %.*s",
10138 (int)(end - p), p),
10139 gv_ename(namegv), 0, o3);
10144 if (o3->op_type == OP_RV2GV)
10147 bad_type_sv(arg, "symbol", gv_ename(namegv), 0, o3);
10150 if (o3->op_type == OP_ENTERSUB)
10153 bad_type_sv(arg, "subroutine entry", gv_ename(namegv), 0,
10157 if (o3->op_type == OP_RV2SV ||
10158 o3->op_type == OP_PADSV ||
10159 o3->op_type == OP_HELEM ||
10160 o3->op_type == OP_AELEM)
10162 if (!contextclass) {
10163 /* \$ accepts any scalar lvalue */
10164 if (Perl_op_lvalue_flags(aTHX_
10166 OP_READ, /* not entersub */
10169 bad_type_sv(arg, "scalar", gv_ename(namegv), 0, o3);
10173 if (o3->op_type == OP_RV2AV ||
10174 o3->op_type == OP_PADAV)
10177 bad_type_sv(arg, "array", gv_ename(namegv), 0, o3);
10180 if (o3->op_type == OP_RV2HV ||
10181 o3->op_type == OP_PADHV)
10184 bad_type_sv(arg, "hash", gv_ename(namegv), 0, o3);
10188 OP* const kid = aop;
10189 OP* const sib = kid->op_sibling;
10190 kid->op_sibling = 0;
10191 aop = newUNOP(OP_REFGEN, 0, kid);
10192 aop->op_sibling = sib;
10193 prev->op_sibling = aop;
10195 if (contextclass && e) {
10200 default: goto oops;
10210 SV* const tmpsv = sv_newmortal();
10211 gv_efullname3(tmpsv, namegv, NULL);
10212 Perl_croak(aTHX_ "Malformed prototype for %"SVf": %"SVf,
10213 SVfARG(tmpsv), SVfARG(protosv));
10217 op_lvalue(aop, OP_ENTERSUB);
10219 aop = aop->op_sibling;
10221 if (aop == cvop && *proto == '_') {
10222 /* generate an access to $_ */
10223 aop = newDEFSVOP();
10224 aop->op_sibling = prev->op_sibling;
10225 prev->op_sibling = aop; /* instead of cvop */
10227 if (!optional && proto_end > proto &&
10228 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
10229 return too_few_arguments_sv(entersubop, gv_ename(namegv), 0);
10234 =for apidoc Am|OP *|ck_entersub_args_proto_or_list|OP *entersubop|GV *namegv|SV *protosv
10236 Performs the fixup of the arguments part of an C<entersub> op tree either
10237 based on a subroutine prototype or using default list-context processing.
10238 This is the standard treatment used on a subroutine call, not marked
10239 with C<&>, where the callee can be identified at compile time.
10241 I<protosv> supplies the subroutine prototype to be applied to the call,
10242 or indicates that there is no prototype. It may be a normal scalar,
10243 in which case if it is defined then the string value will be used
10244 as a prototype, and if it is undefined then there is no prototype.
10245 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
10246 that has been cast to C<SV*>), of which the prototype will be used if it
10247 has one. The prototype (or lack thereof) supplied, in whichever form,
10248 does not need to match the actual callee referenced by the op tree.
10250 If the argument ops disagree with the prototype, for example by having
10251 an unacceptable number of arguments, a valid op tree is returned anyway.
10252 The error is reflected in the parser state, normally resulting in a single
10253 exception at the top level of parsing which covers all the compilation
10254 errors that occurred. In the error message, the callee is referred to
10255 by the name defined by the I<namegv> parameter.
10261 Perl_ck_entersub_args_proto_or_list(pTHX_ OP *entersubop,
10262 GV *namegv, SV *protosv)
10264 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO_OR_LIST;
10265 if (SvTYPE(protosv) == SVt_PVCV ? SvPOK(protosv) : SvOK(protosv))
10266 return ck_entersub_args_proto(entersubop, namegv, protosv);
10268 return ck_entersub_args_list(entersubop);
10272 Perl_ck_entersub_args_core(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
10274 int opnum = SvTYPE(protosv) == SVt_PVCV ? 0 : (int)SvUV(protosv);
10275 OP *aop = cUNOPx(entersubop)->op_first;
10277 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_CORE;
10281 if (!aop->op_sibling)
10282 aop = cUNOPx(aop)->op_first;
10283 aop = aop->op_sibling;
10284 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
10285 if (PL_madskills) while (aop != cvop && aop->op_type == OP_STUB) {
10286 aop = aop->op_sibling;
10289 (void)too_many_arguments_pv(entersubop, GvNAME(namegv), 0);
10291 op_free(entersubop);
10292 switch(GvNAME(namegv)[2]) {
10293 case 'F': return newSVOP(OP_CONST, 0,
10294 newSVpv(CopFILE(PL_curcop),0));
10295 case 'L': return newSVOP(
10297 Perl_newSVpvf(aTHX_
10298 "%"IVdf, (IV)CopLINE(PL_curcop)
10301 case 'P': return newSVOP(OP_CONST, 0,
10303 ? newSVhek(HvNAME_HEK(PL_curstash))
10314 bool seenarg = FALSE;
10316 if (!aop->op_sibling)
10317 aop = cUNOPx(aop)->op_first;
10320 aop = aop->op_sibling;
10321 prev->op_sibling = NULL;
10324 prev=cvop, cvop = cvop->op_sibling)
10326 if (PL_madskills && cvop->op_sibling
10327 && cvop->op_type != OP_STUB) seenarg = TRUE
10330 prev->op_sibling = NULL;
10331 flags = OPf_SPECIAL * !(cvop->op_private & OPpENTERSUB_NOPAREN);
10333 if (aop == cvop) aop = NULL;
10334 op_free(entersubop);
10336 if (opnum == OP_ENTEREVAL
10337 && GvNAMELEN(namegv)==9 && strnEQ(GvNAME(namegv), "evalbytes", 9))
10338 flags |= OPpEVAL_BYTES <<8;
10340 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
10342 case OA_BASEOP_OR_UNOP:
10343 case OA_FILESTATOP:
10344 return aop ? newUNOP(opnum,flags,aop) : newOP(opnum,flags);
10348 if (!PL_madskills || seenarg)
10350 (void)too_many_arguments_pv(aop, GvNAME(namegv), 0);
10353 return opnum == OP_RUNCV
10354 ? newPVOP(OP_RUNCV,0,NULL)
10357 return convert(opnum,0,aop);
10365 =for apidoc Am|void|cv_get_call_checker|CV *cv|Perl_call_checker *ckfun_p|SV **ckobj_p
10367 Retrieves the function that will be used to fix up a call to I<cv>.
10368 Specifically, the function is applied to an C<entersub> op tree for a
10369 subroutine call, not marked with C<&>, where the callee can be identified
10370 at compile time as I<cv>.
10372 The C-level function pointer is returned in I<*ckfun_p>, and an SV
10373 argument for it is returned in I<*ckobj_p>. The function is intended
10374 to be called in this manner:
10376 entersubop = (*ckfun_p)(aTHX_ entersubop, namegv, (*ckobj_p));
10378 In this call, I<entersubop> is a pointer to the C<entersub> op,
10379 which may be replaced by the check function, and I<namegv> is a GV
10380 supplying the name that should be used by the check function to refer
10381 to the callee of the C<entersub> op if it needs to emit any diagnostics.
10382 It is permitted to apply the check function in non-standard situations,
10383 such as to a call to a different subroutine or to a method call.
10385 By default, the function is
10386 L<Perl_ck_entersub_args_proto_or_list|/ck_entersub_args_proto_or_list>,
10387 and the SV parameter is I<cv> itself. This implements standard
10388 prototype processing. It can be changed, for a particular subroutine,
10389 by L</cv_set_call_checker>.
10395 Perl_cv_get_call_checker(pTHX_ CV *cv, Perl_call_checker *ckfun_p, SV **ckobj_p)
10398 PERL_ARGS_ASSERT_CV_GET_CALL_CHECKER;
10399 callmg = SvMAGICAL((SV*)cv) ? mg_find((SV*)cv, PERL_MAGIC_checkcall) : NULL;
10401 *ckfun_p = DPTR2FPTR(Perl_call_checker, callmg->mg_ptr);
10402 *ckobj_p = callmg->mg_obj;
10404 *ckfun_p = Perl_ck_entersub_args_proto_or_list;
10405 *ckobj_p = (SV*)cv;
10410 =for apidoc Am|void|cv_set_call_checker|CV *cv|Perl_call_checker ckfun|SV *ckobj
10412 Sets the function that will be used to fix up a call to I<cv>.
10413 Specifically, the function is applied to an C<entersub> op tree for a
10414 subroutine call, not marked with C<&>, where the callee can be identified
10415 at compile time as I<cv>.
10417 The C-level function pointer is supplied in I<ckfun>, and an SV argument
10418 for it is supplied in I<ckobj>. The function is intended to be called
10421 entersubop = ckfun(aTHX_ entersubop, namegv, ckobj);
10423 In this call, I<entersubop> is a pointer to the C<entersub> op,
10424 which may be replaced by the check function, and I<namegv> is a GV
10425 supplying the name that should be used by the check function to refer
10426 to the callee of the C<entersub> op if it needs to emit any diagnostics.
10427 It is permitted to apply the check function in non-standard situations,
10428 such as to a call to a different subroutine or to a method call.
10430 The current setting for a particular CV can be retrieved by
10431 L</cv_get_call_checker>.
10437 Perl_cv_set_call_checker(pTHX_ CV *cv, Perl_call_checker ckfun, SV *ckobj)
10439 PERL_ARGS_ASSERT_CV_SET_CALL_CHECKER;
10440 if (ckfun == Perl_ck_entersub_args_proto_or_list && ckobj == (SV*)cv) {
10441 if (SvMAGICAL((SV*)cv))
10442 mg_free_type((SV*)cv, PERL_MAGIC_checkcall);
10445 sv_magic((SV*)cv, &PL_sv_undef, PERL_MAGIC_checkcall, NULL, 0);
10446 callmg = mg_find((SV*)cv, PERL_MAGIC_checkcall);
10447 if (callmg->mg_flags & MGf_REFCOUNTED) {
10448 SvREFCNT_dec(callmg->mg_obj);
10449 callmg->mg_flags &= ~MGf_REFCOUNTED;
10451 callmg->mg_ptr = FPTR2DPTR(char *, ckfun);
10452 callmg->mg_obj = ckobj;
10453 if (ckobj != (SV*)cv) {
10454 SvREFCNT_inc_simple_void_NN(ckobj);
10455 callmg->mg_flags |= MGf_REFCOUNTED;
10457 callmg->mg_flags |= MGf_COPY;
10462 Perl_ck_subr(pTHX_ OP *o)
10468 PERL_ARGS_ASSERT_CK_SUBR;
10470 aop = cUNOPx(o)->op_first;
10471 if (!aop->op_sibling)
10472 aop = cUNOPx(aop)->op_first;
10473 aop = aop->op_sibling;
10474 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
10475 cv = rv2cv_op_cv(cvop, RV2CVOPCV_MARK_EARLY);
10476 namegv = cv ? (GV*)rv2cv_op_cv(cvop, RV2CVOPCV_RETURN_NAME_GV) : NULL;
10478 o->op_private &= ~1;
10479 o->op_private |= OPpENTERSUB_HASTARG;
10480 o->op_private |= (PL_hints & HINT_STRICT_REFS);
10481 if (PERLDB_SUB && PL_curstash != PL_debstash)
10482 o->op_private |= OPpENTERSUB_DB;
10483 if (cvop->op_type == OP_RV2CV) {
10484 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
10486 } else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
10487 if (aop->op_type == OP_CONST)
10488 aop->op_private &= ~OPpCONST_STRICT;
10489 else if (aop->op_type == OP_LIST) {
10490 OP * const sib = ((UNOP*)aop)->op_first->op_sibling;
10491 if (sib && sib->op_type == OP_CONST)
10492 sib->op_private &= ~OPpCONST_STRICT;
10497 return ck_entersub_args_list(o);
10499 Perl_call_checker ckfun;
10501 cv_get_call_checker(cv, &ckfun, &ckobj);
10502 if (!namegv) { /* expletive! */
10503 /* XXX The call checker API is public. And it guarantees that
10504 a GV will be provided with the right name. So we have
10505 to create a GV. But it is still not correct, as its
10506 stringification will include the package. What we
10507 really need is a new call checker API that accepts a
10508 GV or string (or GV or CV). */
10509 HEK * const hek = CvNAME_HEK(cv);
10511 namegv = (GV *)sv_newmortal();
10512 gv_init_pvn(namegv, PL_curstash, HEK_KEY(hek), HEK_LEN(hek),
10513 SVf_UTF8 * !!HEK_UTF8(hek));
10515 return ckfun(aTHX_ o, namegv, ckobj);
10520 Perl_ck_svconst(pTHX_ OP *o)
10522 PERL_ARGS_ASSERT_CK_SVCONST;
10523 PERL_UNUSED_CONTEXT;
10524 if (!SvIsCOW(cSVOPo->op_sv)) SvREADONLY_on(cSVOPo->op_sv);
10529 Perl_ck_trunc(pTHX_ OP *o)
10531 PERL_ARGS_ASSERT_CK_TRUNC;
10533 if (o->op_flags & OPf_KIDS) {
10534 SVOP *kid = (SVOP*)cUNOPo->op_first;
10536 if (kid->op_type == OP_NULL)
10537 kid = (SVOP*)kid->op_sibling;
10538 if (kid && kid->op_type == OP_CONST &&
10539 (kid->op_private & (OPpCONST_BARE|OPpCONST_FOLDED))
10542 o->op_flags |= OPf_SPECIAL;
10543 kid->op_private &= ~OPpCONST_STRICT;
10550 Perl_ck_substr(pTHX_ OP *o)
10552 PERL_ARGS_ASSERT_CK_SUBSTR;
10555 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
10556 OP *kid = cLISTOPo->op_first;
10558 if (kid->op_type == OP_NULL)
10559 kid = kid->op_sibling;
10561 kid->op_flags |= OPf_MOD;
10568 Perl_ck_tell(pTHX_ OP *o)
10570 PERL_ARGS_ASSERT_CK_TELL;
10572 if (o->op_flags & OPf_KIDS) {
10573 OP *kid = cLISTOPo->op_first;
10574 if (kid->op_type == OP_NULL && kid->op_sibling) kid = kid->op_sibling;
10575 if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE;
10581 Perl_ck_each(pTHX_ OP *o)
10584 OP *kid = o->op_flags & OPf_KIDS ? cUNOPo->op_first : NULL;
10585 const unsigned orig_type = o->op_type;
10586 const unsigned array_type = orig_type == OP_EACH ? OP_AEACH
10587 : orig_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
10588 const unsigned ref_type = orig_type == OP_EACH ? OP_REACH
10589 : orig_type == OP_KEYS ? OP_RKEYS : OP_RVALUES;
10591 PERL_ARGS_ASSERT_CK_EACH;
10594 switch (kid->op_type) {
10600 CHANGE_TYPE(o, array_type);
10603 if (kid->op_private == OPpCONST_BARE
10604 || !SvROK(cSVOPx_sv(kid))
10605 || ( SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV
10606 && SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVHV )
10608 /* we let ck_fun handle it */
10611 CHANGE_TYPE(o, ref_type);
10615 /* if treating as a reference, defer additional checks to runtime */
10616 return o->op_type == ref_type ? o : ck_fun(o);
10620 Perl_ck_length(pTHX_ OP *o)
10622 PERL_ARGS_ASSERT_CK_LENGTH;
10626 if (ckWARN(WARN_SYNTAX)) {
10627 const OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : NULL;
10631 const bool hash = kid->op_type == OP_PADHV
10632 || kid->op_type == OP_RV2HV;
10633 switch (kid->op_type) {
10637 (GV *)PL_compcv, hash ? '%' : '@', kid->op_targ,
10643 if (cUNOPx(kid)->op_first->op_type != OP_GV) break;
10645 GV *gv = cGVOPx_gv(cUNOPx(kid)->op_first);
10647 name = varname(gv, hash?'%':'@', 0, NULL, 0, 1);
10654 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10655 "length() used on %"SVf" (did you mean \"scalar(%s%"SVf
10657 name, hash ? "keys " : "", name
10660 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10661 "length() used on %%hash (did you mean \"scalar(keys %%hash)\"?)");
10663 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10664 "length() used on @array (did you mean \"scalar(@array)\"?)");
10671 /* Check for in place reverse and sort assignments like "@a = reverse @a"
10672 and modify the optree to make them work inplace */
10675 S_inplace_aassign(pTHX_ OP *o) {
10677 OP *modop, *modop_pushmark;
10679 OP *oleft, *oleft_pushmark;
10681 PERL_ARGS_ASSERT_INPLACE_AASSIGN;
10683 assert((o->op_flags & OPf_WANT) == OPf_WANT_VOID);
10685 assert(cUNOPo->op_first->op_type == OP_NULL);
10686 modop_pushmark = cUNOPx(cUNOPo->op_first)->op_first;
10687 assert(modop_pushmark->op_type == OP_PUSHMARK);
10688 modop = modop_pushmark->op_sibling;
10690 if (modop->op_type != OP_SORT && modop->op_type != OP_REVERSE)
10693 /* no other operation except sort/reverse */
10694 if (modop->op_sibling)
10697 assert(cUNOPx(modop)->op_first->op_type == OP_PUSHMARK);
10698 if (!(oright = cUNOPx(modop)->op_first->op_sibling)) return;
10700 if (modop->op_flags & OPf_STACKED) {
10701 /* skip sort subroutine/block */
10702 assert(oright->op_type == OP_NULL);
10703 oright = oright->op_sibling;
10706 assert(cUNOPo->op_first->op_sibling->op_type == OP_NULL);
10707 oleft_pushmark = cUNOPx(cUNOPo->op_first->op_sibling)->op_first;
10708 assert(oleft_pushmark->op_type == OP_PUSHMARK);
10709 oleft = oleft_pushmark->op_sibling;
10711 /* Check the lhs is an array */
10713 (oleft->op_type != OP_RV2AV && oleft->op_type != OP_PADAV)
10714 || oleft->op_sibling
10715 || (oleft->op_private & OPpLVAL_INTRO)
10719 /* Only one thing on the rhs */
10720 if (oright->op_sibling)
10723 /* check the array is the same on both sides */
10724 if (oleft->op_type == OP_RV2AV) {
10725 if (oright->op_type != OP_RV2AV
10726 || !cUNOPx(oright)->op_first
10727 || cUNOPx(oright)->op_first->op_type != OP_GV
10728 || cUNOPx(oleft )->op_first->op_type != OP_GV
10729 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
10730 cGVOPx_gv(cUNOPx(oright)->op_first)
10734 else if (oright->op_type != OP_PADAV
10735 || oright->op_targ != oleft->op_targ
10739 /* This actually is an inplace assignment */
10741 modop->op_private |= OPpSORT_INPLACE;
10743 /* transfer MODishness etc from LHS arg to RHS arg */
10744 oright->op_flags = oleft->op_flags;
10746 /* remove the aassign op and the lhs */
10748 op_null(oleft_pushmark);
10749 if (oleft->op_type == OP_RV2AV && cUNOPx(oleft)->op_first)
10750 op_null(cUNOPx(oleft)->op_first);
10754 #define MAX_DEFERRED 4
10758 if (defer_ix == (MAX_DEFERRED-1)) { \
10759 CALL_RPEEP(defer_queue[defer_base]); \
10760 defer_base = (defer_base + 1) % MAX_DEFERRED; \
10763 defer_queue[(defer_base + ++defer_ix) % MAX_DEFERRED] = o; \
10766 /* A peephole optimizer. We visit the ops in the order they're to execute.
10767 * See the comments at the top of this file for more details about when
10768 * peep() is called */
10771 Perl_rpeep(pTHX_ OP *o)
10775 OP* oldoldop = NULL;
10776 OP* defer_queue[MAX_DEFERRED]; /* small queue of deferred branches */
10777 int defer_base = 0;
10780 if (!o || o->op_opt)
10784 SAVEVPTR(PL_curcop);
10785 for (;; o = o->op_next) {
10786 if (o && o->op_opt)
10789 while (defer_ix >= 0)
10790 CALL_RPEEP(defer_queue[(defer_base + defer_ix--) % MAX_DEFERRED]);
10794 /* By default, this op has now been optimised. A couple of cases below
10795 clear this again. */
10798 switch (o->op_type) {
10800 PL_curcop = ((COP*)o); /* for warnings */
10803 PL_curcop = ((COP*)o); /* for warnings */
10805 /* Two NEXTSTATEs in a row serve no purpose. Except if they happen
10806 to carry two labels. For now, take the easier option, and skip
10807 this optimisation if the first NEXTSTATE has a label. */
10808 if (!CopLABEL((COP*)o) && !PERLDB_NOOPT) {
10809 OP *nextop = o->op_next;
10810 while (nextop && nextop->op_type == OP_NULL)
10811 nextop = nextop->op_next;
10813 if (nextop && (nextop->op_type == OP_NEXTSTATE)) {
10814 COP *firstcop = (COP *)o;
10815 COP *secondcop = (COP *)nextop;
10816 /* We want the COP pointed to by o (and anything else) to
10817 become the next COP down the line. */
10818 cop_free(firstcop);
10820 firstcop->op_next = secondcop->op_next;
10822 /* Now steal all its pointers, and duplicate the other
10824 firstcop->cop_line = secondcop->cop_line;
10825 #ifdef USE_ITHREADS
10826 firstcop->cop_stashoff = secondcop->cop_stashoff;
10827 firstcop->cop_file = secondcop->cop_file;
10829 firstcop->cop_stash = secondcop->cop_stash;
10830 firstcop->cop_filegv = secondcop->cop_filegv;
10832 firstcop->cop_hints = secondcop->cop_hints;
10833 firstcop->cop_seq = secondcop->cop_seq;
10834 firstcop->cop_warnings = secondcop->cop_warnings;
10835 firstcop->cop_hints_hash = secondcop->cop_hints_hash;
10837 #ifdef USE_ITHREADS
10838 secondcop->cop_stashoff = 0;
10839 secondcop->cop_file = NULL;
10841 secondcop->cop_stash = NULL;
10842 secondcop->cop_filegv = NULL;
10844 secondcop->cop_warnings = NULL;
10845 secondcop->cop_hints_hash = NULL;
10847 /* If we use op_null(), and hence leave an ex-COP, some
10848 warnings are misreported. For example, the compile-time
10849 error in 'use strict; no strict refs;' */
10850 secondcop->op_type = OP_NULL;
10851 secondcop->op_ppaddr = PL_ppaddr[OP_NULL];
10857 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
10858 if (o->op_next->op_private & OPpTARGET_MY) {
10859 if (o->op_flags & OPf_STACKED) /* chained concats */
10860 break; /* ignore_optimization */
10862 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
10863 o->op_targ = o->op_next->op_targ;
10864 o->op_next->op_targ = 0;
10865 o->op_private |= OPpTARGET_MY;
10868 op_null(o->op_next);
10872 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
10873 break; /* Scalar stub must produce undef. List stub is noop */
10877 if (o->op_targ == OP_NEXTSTATE
10878 || o->op_targ == OP_DBSTATE)
10880 PL_curcop = ((COP*)o);
10882 /* XXX: We avoid setting op_seq here to prevent later calls
10883 to rpeep() from mistakenly concluding that optimisation
10884 has already occurred. This doesn't fix the real problem,
10885 though (See 20010220.007). AMS 20010719 */
10886 /* op_seq functionality is now replaced by op_opt */
10893 if (oldop && o->op_next) {
10894 oldop->op_next = o->op_next;
10902 /* Convert a series of PAD ops for my vars plus support into a
10903 * single padrange op. Basically
10905 * pushmark -> pad[ahs]v -> pad[ahs]?v -> ... -> (list) -> rest
10907 * becomes, depending on circumstances, one of
10909 * padrange ----------------------------------> (list) -> rest
10910 * padrange --------------------------------------------> rest
10912 * where all the pad indexes are sequential and of the same type
10914 * We convert the pushmark into a padrange op, then skip
10915 * any other pad ops, and possibly some trailing ops.
10916 * Note that we don't null() the skipped ops, to make it
10917 * easier for Deparse to undo this optimisation (and none of
10918 * the skipped ops are holding any resourses). It also makes
10919 * it easier for find_uninit_var(), as it can just ignore
10920 * padrange, and examine the original pad ops.
10924 OP *followop = NULL; /* the op that will follow the padrange op */
10927 PADOFFSET base = 0; /* init only to stop compiler whining */
10928 U8 gimme = 0; /* init only to stop compiler whining */
10929 bool defav = 0; /* seen (...) = @_ */
10930 bool reuse = 0; /* reuse an existing padrange op */
10932 /* look for a pushmark -> gv[_] -> rv2av */
10938 if ( p->op_type == OP_GV
10939 && (gv = cGVOPx_gv(p))
10940 && GvNAMELEN_get(gv) == 1
10941 && *GvNAME_get(gv) == '_'
10942 && GvSTASH(gv) == PL_defstash
10943 && (rv2av = p->op_next)
10944 && rv2av->op_type == OP_RV2AV
10945 && !(rv2av->op_flags & OPf_REF)
10946 && !(rv2av->op_private & (OPpLVAL_INTRO|OPpMAYBE_LVSUB))
10947 && ((rv2av->op_flags & OPf_WANT) == OPf_WANT_LIST)
10948 && o->op_sibling == rv2av /* these two for Deparse */
10949 && cUNOPx(rv2av)->op_first == p
10951 q = rv2av->op_next;
10952 if (q->op_type == OP_NULL)
10954 if (q->op_type == OP_PUSHMARK) {
10961 /* To allow Deparse to pessimise this, it needs to be able
10962 * to restore the pushmark's original op_next, which it
10963 * will assume to be the same as op_sibling. */
10964 if (o->op_next != o->op_sibling)
10969 /* scan for PAD ops */
10971 for (p = p->op_next; p; p = p->op_next) {
10972 if (p->op_type == OP_NULL)
10975 if (( p->op_type != OP_PADSV
10976 && p->op_type != OP_PADAV
10977 && p->op_type != OP_PADHV
10979 /* any private flag other than INTRO? e.g. STATE */
10980 || (p->op_private & ~OPpLVAL_INTRO)
10984 /* let $a[N] potentially be optimised into ALEMFAST_LEX
10986 if ( p->op_type == OP_PADAV
10988 && p->op_next->op_type == OP_CONST
10989 && p->op_next->op_next
10990 && p->op_next->op_next->op_type == OP_AELEM
10994 /* for 1st padop, note what type it is and the range
10995 * start; for the others, check that it's the same type
10996 * and that the targs are contiguous */
10998 intro = (p->op_private & OPpLVAL_INTRO);
11000 gimme = (p->op_flags & OPf_WANT);
11003 if ((p->op_private & OPpLVAL_INTRO) != intro)
11005 /* Note that you'd normally expect targs to be
11006 * contiguous in my($a,$b,$c), but that's not the case
11007 * when external modules start doing things, e.g.
11008 i* Function::Parameters */
11009 if (p->op_targ != base + count)
11011 assert(p->op_targ == base + count);
11012 /* all the padops should be in the same context */
11013 if (gimme != (p->op_flags & OPf_WANT))
11017 /* for AV, HV, only when we're not flattening */
11018 if ( p->op_type != OP_PADSV
11019 && gimme != OPf_WANT_VOID
11020 && !(p->op_flags & OPf_REF)
11024 if (count >= OPpPADRANGE_COUNTMASK)
11027 /* there's a biggest base we can fit into a
11028 * SAVEt_CLEARPADRANGE in pp_padrange */
11029 if (intro && base >
11030 (UV_MAX >> (OPpPADRANGE_COUNTSHIFT+SAVE_TIGHT_SHIFT)))
11033 /* Success! We've got another valid pad op to optimise away */
11035 followop = p->op_next;
11041 /* pp_padrange in specifically compile-time void context
11042 * skips pushing a mark and lexicals; in all other contexts
11043 * (including unknown till runtime) it pushes a mark and the
11044 * lexicals. We must be very careful then, that the ops we
11045 * optimise away would have exactly the same effect as the
11047 * In particular in void context, we can only optimise to
11048 * a padrange if see see the complete sequence
11049 * pushmark, pad*v, ...., list, nextstate
11050 * which has the net effect of of leaving the stack empty
11051 * (for now we leave the nextstate in the execution chain, for
11052 * its other side-effects).
11055 if (gimme == OPf_WANT_VOID) {
11056 if (followop->op_type == OP_LIST
11057 && gimme == (followop->op_flags & OPf_WANT)
11058 && ( followop->op_next->op_type == OP_NEXTSTATE
11059 || followop->op_next->op_type == OP_DBSTATE))
11061 followop = followop->op_next; /* skip OP_LIST */
11063 /* consolidate two successive my(...);'s */
11066 && oldoldop->op_type == OP_PADRANGE
11067 && (oldoldop->op_flags & OPf_WANT) == OPf_WANT_VOID
11068 && (oldoldop->op_private & OPpLVAL_INTRO) == intro
11069 && !(oldoldop->op_flags & OPf_SPECIAL)
11072 assert(oldoldop->op_next == oldop);
11073 assert( oldop->op_type == OP_NEXTSTATE
11074 || oldop->op_type == OP_DBSTATE);
11075 assert(oldop->op_next == o);
11078 = (oldoldop->op_private & OPpPADRANGE_COUNTMASK);
11079 assert(oldoldop->op_targ + old_count == base);
11081 if (old_count < OPpPADRANGE_COUNTMASK - count) {
11082 base = oldoldop->op_targ;
11083 count += old_count;
11088 /* if there's any immediately following singleton
11089 * my var's; then swallow them and the associated
11091 * my ($a,$b); my $c; my $d;
11093 * my ($a,$b,$c,$d);
11096 while ( ((p = followop->op_next))
11097 && ( p->op_type == OP_PADSV
11098 || p->op_type == OP_PADAV
11099 || p->op_type == OP_PADHV)
11100 && (p->op_flags & OPf_WANT) == OPf_WANT_VOID
11101 && (p->op_private & OPpLVAL_INTRO) == intro
11103 && ( p->op_next->op_type == OP_NEXTSTATE
11104 || p->op_next->op_type == OP_DBSTATE)
11105 && count < OPpPADRANGE_COUNTMASK
11107 assert(base + count == p->op_targ);
11109 followop = p->op_next;
11117 assert(oldoldop->op_type == OP_PADRANGE);
11118 oldoldop->op_next = followop;
11119 oldoldop->op_private = (intro | count);
11125 /* Convert the pushmark into a padrange.
11126 * To make Deparse easier, we guarantee that a padrange was
11127 * *always* formerly a pushmark */
11128 assert(o->op_type == OP_PUSHMARK);
11129 o->op_next = followop;
11130 o->op_type = OP_PADRANGE;
11131 o->op_ppaddr = PL_ppaddr[OP_PADRANGE];
11133 /* bit 7: INTRO; bit 6..0: count */
11134 o->op_private = (intro | count);
11135 o->op_flags = ((o->op_flags & ~(OPf_WANT|OPf_SPECIAL))
11136 | gimme | (defav ? OPf_SPECIAL : 0));
11143 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
11144 OP* const pop = (o->op_type == OP_PADAV) ?
11145 o->op_next : o->op_next->op_next;
11147 if (pop && pop->op_type == OP_CONST &&
11148 ((PL_op = pop->op_next)) &&
11149 pop->op_next->op_type == OP_AELEM &&
11150 !(pop->op_next->op_private &
11151 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
11152 (i = SvIV(((SVOP*)pop)->op_sv)) <= 255 && i >= 0)
11155 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
11156 no_bareword_allowed(pop);
11157 if (o->op_type == OP_GV)
11158 op_null(o->op_next);
11159 op_null(pop->op_next);
11161 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
11162 o->op_next = pop->op_next->op_next;
11163 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
11164 o->op_private = (U8)i;
11165 if (o->op_type == OP_GV) {
11168 o->op_type = OP_AELEMFAST;
11171 o->op_type = OP_AELEMFAST_LEX;
11176 if (o->op_next->op_type == OP_RV2SV) {
11177 if (!(o->op_next->op_private & OPpDEREF)) {
11178 op_null(o->op_next);
11179 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
11181 o->op_next = o->op_next->op_next;
11182 o->op_type = OP_GVSV;
11183 o->op_ppaddr = PL_ppaddr[OP_GVSV];
11186 else if (o->op_next->op_type == OP_READLINE
11187 && o->op_next->op_next->op_type == OP_CONCAT
11188 && (o->op_next->op_next->op_flags & OPf_STACKED))
11190 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
11191 o->op_type = OP_RCATLINE;
11192 o->op_flags |= OPf_STACKED;
11193 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
11194 op_null(o->op_next->op_next);
11195 op_null(o->op_next);
11204 #define HV_OR_SCALARHV(op) \
11205 ( (op)->op_type == OP_PADHV || (op)->op_type == OP_RV2HV \
11207 : (op)->op_type == OP_SCALAR && (op)->op_flags & OPf_KIDS \
11208 && ( cUNOPx(op)->op_first->op_type == OP_PADHV \
11209 || cUNOPx(op)->op_first->op_type == OP_RV2HV) \
11210 ? cUNOPx(op)->op_first \
11214 if ((fop = HV_OR_SCALARHV(cUNOP->op_first)))
11215 fop->op_private |= OPpTRUEBOOL;
11221 fop = cLOGOP->op_first;
11222 sop = fop->op_sibling;
11223 while (cLOGOP->op_other->op_type == OP_NULL)
11224 cLOGOP->op_other = cLOGOP->op_other->op_next;
11225 while (o->op_next && ( o->op_type == o->op_next->op_type
11226 || o->op_next->op_type == OP_NULL))
11227 o->op_next = o->op_next->op_next;
11228 DEFER(cLOGOP->op_other);
11231 fop = HV_OR_SCALARHV(fop);
11232 if (sop) sop = HV_OR_SCALARHV(sop);
11237 if (!((nop->op_flags & OPf_WANT) == OPf_WANT_VOID)) {
11238 while (nop && nop->op_next) {
11239 switch (nop->op_next->op_type) {
11244 lop = nop = nop->op_next;
11247 nop = nop->op_next;
11256 if ( (lop->op_flags & OPf_WANT) == OPf_WANT_VOID
11257 || o->op_type == OP_AND )
11258 fop->op_private |= OPpTRUEBOOL;
11259 else if (!(lop->op_flags & OPf_WANT))
11260 fop->op_private |= OPpMAYBE_TRUEBOOL;
11262 if ( (lop->op_flags & OPf_WANT) == OPf_WANT_VOID
11264 sop->op_private |= OPpTRUEBOOL;
11271 if ((fop = HV_OR_SCALARHV(cLOGOP->op_first)))
11272 fop->op_private |= OPpTRUEBOOL;
11273 #undef HV_OR_SCALARHV
11284 while (cLOGOP->op_other->op_type == OP_NULL)
11285 cLOGOP->op_other = cLOGOP->op_other->op_next;
11286 DEFER(cLOGOP->op_other);
11291 while (cLOOP->op_redoop->op_type == OP_NULL)
11292 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
11293 while (cLOOP->op_nextop->op_type == OP_NULL)
11294 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
11295 while (cLOOP->op_lastop->op_type == OP_NULL)
11296 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
11297 /* a while(1) loop doesn't have an op_next that escapes the
11298 * loop, so we have to explicitly follow the op_lastop to
11299 * process the rest of the code */
11300 DEFER(cLOOP->op_lastop);
11304 assert(!(cPMOP->op_pmflags & PMf_ONCE));
11305 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
11306 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
11307 cPMOP->op_pmstashstartu.op_pmreplstart
11308 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
11309 DEFER(cPMOP->op_pmstashstartu.op_pmreplstart);
11315 if (o->op_flags & OPf_STACKED) {
11317 cUNOPx(cLISTOP->op_first->op_sibling)->op_first;
11318 if (kid->op_type == OP_SCOPE
11319 || (kid->op_type == OP_NULL && kid->op_targ == OP_LEAVE))
11320 DEFER(kLISTOP->op_first);
11323 /* check that RHS of sort is a single plain array */
11324 oright = cUNOPo->op_first;
11325 if (!oright || oright->op_type != OP_PUSHMARK)
11328 if (o->op_private & OPpSORT_INPLACE)
11331 /* reverse sort ... can be optimised. */
11332 if (!cUNOPo->op_sibling) {
11333 /* Nothing follows us on the list. */
11334 OP * const reverse = o->op_next;
11336 if (reverse->op_type == OP_REVERSE &&
11337 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
11338 OP * const pushmark = cUNOPx(reverse)->op_first;
11339 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
11340 && (cUNOPx(pushmark)->op_sibling == o)) {
11341 /* reverse -> pushmark -> sort */
11342 o->op_private |= OPpSORT_REVERSE;
11344 pushmark->op_next = oright->op_next;
11354 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
11356 LISTOP *enter, *exlist;
11358 if (o->op_private & OPpSORT_INPLACE)
11361 enter = (LISTOP *) o->op_next;
11364 if (enter->op_type == OP_NULL) {
11365 enter = (LISTOP *) enter->op_next;
11369 /* for $a (...) will have OP_GV then OP_RV2GV here.
11370 for (...) just has an OP_GV. */
11371 if (enter->op_type == OP_GV) {
11372 gvop = (OP *) enter;
11373 enter = (LISTOP *) enter->op_next;
11376 if (enter->op_type == OP_RV2GV) {
11377 enter = (LISTOP *) enter->op_next;
11383 if (enter->op_type != OP_ENTERITER)
11386 iter = enter->op_next;
11387 if (!iter || iter->op_type != OP_ITER)
11390 expushmark = enter->op_first;
11391 if (!expushmark || expushmark->op_type != OP_NULL
11392 || expushmark->op_targ != OP_PUSHMARK)
11395 exlist = (LISTOP *) expushmark->op_sibling;
11396 if (!exlist || exlist->op_type != OP_NULL
11397 || exlist->op_targ != OP_LIST)
11400 if (exlist->op_last != o) {
11401 /* Mmm. Was expecting to point back to this op. */
11404 theirmark = exlist->op_first;
11405 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
11408 if (theirmark->op_sibling != o) {
11409 /* There's something between the mark and the reverse, eg
11410 for (1, reverse (...))
11415 ourmark = ((LISTOP *)o)->op_first;
11416 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
11419 ourlast = ((LISTOP *)o)->op_last;
11420 if (!ourlast || ourlast->op_next != o)
11423 rv2av = ourmark->op_sibling;
11424 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
11425 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
11426 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
11427 /* We're just reversing a single array. */
11428 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
11429 enter->op_flags |= OPf_STACKED;
11432 /* We don't have control over who points to theirmark, so sacrifice
11434 theirmark->op_next = ourmark->op_next;
11435 theirmark->op_flags = ourmark->op_flags;
11436 ourlast->op_next = gvop ? gvop : (OP *) enter;
11439 enter->op_private |= OPpITER_REVERSED;
11440 iter->op_private |= OPpITER_REVERSED;
11447 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
11448 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
11453 if (!(o->op_private & OPpOFFBYONE) && !CvCLONE(PL_compcv)) {
11455 if (CvEVAL(PL_compcv)) sv = &PL_sv_undef;
11457 sv = newRV((SV *)PL_compcv);
11461 o->op_type = OP_CONST;
11462 o->op_ppaddr = PL_ppaddr[OP_CONST];
11463 o->op_flags |= OPf_SPECIAL;
11464 cSVOPo->op_sv = sv;
11469 if (OP_GIMME(o,0) == G_VOID) {
11470 OP *right = cBINOP->op_first;
11472 OP *left = right->op_sibling;
11473 if (left->op_type == OP_SUBSTR
11474 && (left->op_private & 7) < 4) {
11476 cBINOP->op_first = left;
11477 right->op_sibling =
11478 cBINOPx(left)->op_first->op_sibling;
11479 cBINOPx(left)->op_first->op_sibling = right;
11480 left->op_private |= OPpSUBSTR_REPL_FIRST;
11482 (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
11489 Perl_cpeep_t cpeep =
11490 XopENTRY(Perl_custom_op_xop(aTHX_ o), xop_peep);
11492 cpeep(aTHX_ o, oldop);
11504 Perl_peep(pTHX_ OP *o)
11510 =head1 Custom Operators
11512 =for apidoc Ao||custom_op_xop
11513 Return the XOP structure for a given custom op. This function should be
11514 considered internal to OP_NAME and the other access macros: use them instead.
11520 Perl_custom_op_xop(pTHX_ const OP *o)
11526 static const XOP xop_null = { 0, 0, 0, 0, 0 };
11528 PERL_ARGS_ASSERT_CUSTOM_OP_XOP;
11529 assert(o->op_type == OP_CUSTOM);
11531 /* This is wrong. It assumes a function pointer can be cast to IV,
11532 * which isn't guaranteed, but this is what the old custom OP code
11533 * did. In principle it should be safer to Copy the bytes of the
11534 * pointer into a PV: since the new interface is hidden behind
11535 * functions, this can be changed later if necessary. */
11536 /* Change custom_op_xop if this ever happens */
11537 keysv = sv_2mortal(newSViv(PTR2IV(o->op_ppaddr)));
11540 he = hv_fetch_ent(PL_custom_ops, keysv, 0, 0);
11542 /* assume noone will have just registered a desc */
11543 if (!he && PL_custom_op_names &&
11544 (he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0))
11549 /* XXX does all this need to be shared mem? */
11550 Newxz(xop, 1, XOP);
11551 pv = SvPV(HeVAL(he), l);
11552 XopENTRY_set(xop, xop_name, savepvn(pv, l));
11553 if (PL_custom_op_descs &&
11554 (he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0))
11556 pv = SvPV(HeVAL(he), l);
11557 XopENTRY_set(xop, xop_desc, savepvn(pv, l));
11559 Perl_custom_op_register(aTHX_ o->op_ppaddr, xop);
11563 if (!he) return &xop_null;
11565 xop = INT2PTR(XOP *, SvIV(HeVAL(he)));
11570 =for apidoc Ao||custom_op_register
11571 Register a custom op. See L<perlguts/"Custom Operators">.
11577 Perl_custom_op_register(pTHX_ Perl_ppaddr_t ppaddr, const XOP *xop)
11581 PERL_ARGS_ASSERT_CUSTOM_OP_REGISTER;
11583 /* see the comment in custom_op_xop */
11584 keysv = sv_2mortal(newSViv(PTR2IV(ppaddr)));
11586 if (!PL_custom_ops)
11587 PL_custom_ops = newHV();
11589 if (!hv_store_ent(PL_custom_ops, keysv, newSViv(PTR2IV(xop)), 0))
11590 Perl_croak(aTHX_ "panic: can't register custom OP %s", xop->xop_name);
11594 =head1 Functions in file op.c
11596 =for apidoc core_prototype
11597 This function assigns the prototype of the named core function to C<sv>, or
11598 to a new mortal SV if C<sv> is NULL. It returns the modified C<sv>, or
11599 NULL if the core function has no prototype. C<code> is a code as returned
11600 by C<keyword()>. It must not be equal to 0 or -KEY_CORE.
11606 Perl_core_prototype(pTHX_ SV *sv, const char *name, const int code,
11609 int i = 0, n = 0, seen_question = 0, defgv = 0;
11611 #define MAX_ARGS_OP ((sizeof(I32) - 1) * 2)
11612 char str[ MAX_ARGS_OP * 2 + 2 ]; /* One ';', one '\0' */
11613 bool nullret = FALSE;
11615 PERL_ARGS_ASSERT_CORE_PROTOTYPE;
11617 assert (code && code != -KEY_CORE);
11619 if (!sv) sv = sv_newmortal();
11621 #define retsetpvs(x,y) sv_setpvs(sv, x); if(opnum) *opnum=(y); return sv
11623 switch (code < 0 ? -code : code) {
11624 case KEY_and : case KEY_chop: case KEY_chomp:
11625 case KEY_cmp : case KEY_defined: case KEY_delete: case KEY_exec :
11626 case KEY_exists: case KEY_eq : case KEY_ge : case KEY_goto :
11627 case KEY_grep : case KEY_gt : case KEY_last : case KEY_le :
11628 case KEY_lt : case KEY_map : case KEY_ne : case KEY_next :
11629 case KEY_or : case KEY_print : case KEY_printf: case KEY_qr :
11630 case KEY_redo : case KEY_require: case KEY_return: case KEY_say :
11631 case KEY_select: case KEY_sort : case KEY_split : case KEY_system:
11632 case KEY_x : case KEY_xor :
11633 if (!opnum) return NULL; nullret = TRUE; goto findopnum;
11634 case KEY_glob: retsetpvs("_;", OP_GLOB);
11635 case KEY_keys: retsetpvs("+", OP_KEYS);
11636 case KEY_values: retsetpvs("+", OP_VALUES);
11637 case KEY_each: retsetpvs("+", OP_EACH);
11638 case KEY_push: retsetpvs("+@", OP_PUSH);
11639 case KEY_unshift: retsetpvs("+@", OP_UNSHIFT);
11640 case KEY_pop: retsetpvs(";+", OP_POP);
11641 case KEY_shift: retsetpvs(";+", OP_SHIFT);
11642 case KEY_pos: retsetpvs(";\\[$*]", OP_POS);
11644 retsetpvs("+;$$@", OP_SPLICE);
11645 case KEY___FILE__: case KEY___LINE__: case KEY___PACKAGE__:
11647 case KEY_evalbytes:
11648 name = "entereval"; break;
11656 while (i < MAXO) { /* The slow way. */
11657 if (strEQ(name, PL_op_name[i])
11658 || strEQ(name, PL_op_desc[i]))
11660 if (nullret) { assert(opnum); *opnum = i; return NULL; }
11667 defgv = PL_opargs[i] & OA_DEFGV;
11668 oa = PL_opargs[i] >> OASHIFT;
11670 if (oa & OA_OPTIONAL && !seen_question && (
11671 !defgv || (oa & (OA_OPTIONAL - 1)) == OA_FILEREF
11676 if ((oa & (OA_OPTIONAL - 1)) >= OA_AVREF
11677 && (oa & (OA_OPTIONAL - 1)) <= OA_SCALARREF
11678 /* But globs are already references (kinda) */
11679 && (oa & (OA_OPTIONAL - 1)) != OA_FILEREF
11683 if ((oa & (OA_OPTIONAL - 1)) == OA_SCALARREF
11684 && !scalar_mod_type(NULL, i)) {
11689 if (i == OP_LOCK || i == OP_UNDEF) str[n++] = '&';
11693 else str[n++] = ("?$@@%&*$")[oa & (OA_OPTIONAL - 1)];
11694 if (oa & OA_OPTIONAL && defgv && str[n-1] == '$') {
11695 str[n-1] = '_'; defgv = 0;
11699 if (code == -KEY_not || code == -KEY_getprotobynumber) str[n++] = ';';
11701 sv_setpvn(sv, str, n - 1);
11702 if (opnum) *opnum = i;
11707 Perl_coresub_op(pTHX_ SV * const coreargssv, const int code,
11710 OP * const argop = newSVOP(OP_COREARGS,0,coreargssv);
11713 PERL_ARGS_ASSERT_CORESUB_OP;
11717 return op_append_elem(OP_LINESEQ,
11720 newSVOP(OP_CONST, 0, newSViv(-code % 3)),
11724 case OP_SELECT: /* which represents OP_SSELECT as well */
11729 newAVREF(newGVOP(OP_GV, 0, PL_defgv)),
11730 newSVOP(OP_CONST, 0, newSVuv(1))
11732 coresub_op(newSVuv((UV)OP_SSELECT), 0,
11734 coresub_op(coreargssv, 0, OP_SELECT)
11738 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
11740 return op_append_elem(
11743 opnum == OP_WANTARRAY || opnum == OP_RUNCV
11744 ? OPpOFFBYONE << 8 : 0)
11746 case OA_BASEOP_OR_UNOP:
11747 if (opnum == OP_ENTEREVAL) {
11748 o = newUNOP(OP_ENTEREVAL,OPpEVAL_COPHH<<8,argop);
11749 if (code == -KEY_evalbytes) o->op_private |= OPpEVAL_BYTES;
11751 else o = newUNOP(opnum,0,argop);
11752 if (opnum == OP_CALLER) o->op_private |= OPpOFFBYONE;
11755 if (is_handle_constructor(o, 1))
11756 argop->op_private |= OPpCOREARGS_DEREF1;
11757 if (scalar_mod_type(NULL, opnum))
11758 argop->op_private |= OPpCOREARGS_SCALARMOD;
11762 o = convert(opnum,OPf_SPECIAL*(opnum == OP_GLOB),argop);
11763 if (is_handle_constructor(o, 2))
11764 argop->op_private |= OPpCOREARGS_DEREF2;
11765 if (opnum == OP_SUBSTR) {
11766 o->op_private |= OPpMAYBE_LVSUB;
11775 Perl_report_redefined_cv(pTHX_ const SV *name, const CV *old_cv,
11776 SV * const *new_const_svp)
11778 const char *hvname;
11779 bool is_const = !!CvCONST(old_cv);
11780 SV *old_const_sv = is_const ? cv_const_sv(old_cv) : NULL;
11782 PERL_ARGS_ASSERT_REPORT_REDEFINED_CV;
11784 if (is_const && new_const_svp && old_const_sv == *new_const_svp)
11786 /* They are 2 constant subroutines generated from
11787 the same constant. This probably means that
11788 they are really the "same" proxy subroutine
11789 instantiated in 2 places. Most likely this is
11790 when a constant is exported twice. Don't warn.
11793 (ckWARN(WARN_REDEFINE)
11795 CvGV(old_cv) && GvSTASH(CvGV(old_cv))
11796 && HvNAMELEN(GvSTASH(CvGV(old_cv))) == 7
11797 && (hvname = HvNAME(GvSTASH(CvGV(old_cv))),
11798 strEQ(hvname, "autouse"))
11802 && ckWARN_d(WARN_REDEFINE)
11803 && (!new_const_svp || sv_cmp(old_const_sv, *new_const_svp))
11806 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
11808 ? "Constant subroutine %"SVf" redefined"
11809 : "Subroutine %"SVf" redefined",
11814 =head1 Hook manipulation
11816 These functions provide convenient and thread-safe means of manipulating
11823 =for apidoc Am|void|wrap_op_checker|Optype opcode|Perl_check_t new_checker|Perl_check_t *old_checker_p
11825 Puts a C function into the chain of check functions for a specified op
11826 type. This is the preferred way to manipulate the L</PL_check> array.
11827 I<opcode> specifies which type of op is to be affected. I<new_checker>
11828 is a pointer to the C function that is to be added to that opcode's
11829 check chain, and I<old_checker_p> points to the storage location where a
11830 pointer to the next function in the chain will be stored. The value of
11831 I<new_pointer> is written into the L</PL_check> array, while the value
11832 previously stored there is written to I<*old_checker_p>.
11834 L</PL_check> is global to an entire process, and a module wishing to
11835 hook op checking may find itself invoked more than once per process,
11836 typically in different threads. To handle that situation, this function
11837 is idempotent. The location I<*old_checker_p> must initially (once
11838 per process) contain a null pointer. A C variable of static duration
11839 (declared at file scope, typically also marked C<static> to give
11840 it internal linkage) will be implicitly initialised appropriately,
11841 if it does not have an explicit initialiser. This function will only
11842 actually modify the check chain if it finds I<*old_checker_p> to be null.
11843 This function is also thread safe on the small scale. It uses appropriate
11844 locking to avoid race conditions in accessing L</PL_check>.
11846 When this function is called, the function referenced by I<new_checker>
11847 must be ready to be called, except for I<*old_checker_p> being unfilled.
11848 In a threading situation, I<new_checker> may be called immediately,
11849 even before this function has returned. I<*old_checker_p> will always
11850 be appropriately set before I<new_checker> is called. If I<new_checker>
11851 decides not to do anything special with an op that it is given (which
11852 is the usual case for most uses of op check hooking), it must chain the
11853 check function referenced by I<*old_checker_p>.
11855 If you want to influence compilation of calls to a specific subroutine,
11856 then use L</cv_set_call_checker> rather than hooking checking of all
11863 Perl_wrap_op_checker(pTHX_ Optype opcode,
11864 Perl_check_t new_checker, Perl_check_t *old_checker_p)
11868 PERL_ARGS_ASSERT_WRAP_OP_CHECKER;
11869 if (*old_checker_p) return;
11870 OP_CHECK_MUTEX_LOCK;
11871 if (!*old_checker_p) {
11872 *old_checker_p = PL_check[opcode];
11873 PL_check[opcode] = new_checker;
11875 OP_CHECK_MUTEX_UNLOCK;
11880 /* Efficient sub that returns a constant scalar value. */
11882 const_sv_xsub(pTHX_ CV* cv)
11886 SV *const sv = MUTABLE_SV(XSANY.any_ptr);
11890 /* diag_listed_as: SKIPME */
11891 Perl_croak(aTHX_ "usage: %s::%s()",
11892 HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
11905 * c-indentation-style: bsd
11906 * c-basic-offset: 4
11907 * indent-tabs-mode: nil
11910 * ex: set ts=8 sts=4 sw=4 et: