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 /* We only allocate ops from the slab during subroutine compilation.
169 We find the slab via PL_compcv, hence that must be non-NULL. It could
170 also be pointing to a subroutine which is now fully set up (CvROOT()
171 pointing to the top of the optree for that sub), or a subroutine
172 which isn't using the slab allocator. If our sanity checks aren't met,
173 don't use a slab, but allocate the OP directly from the heap. */
174 if (!PL_compcv || CvROOT(PL_compcv)
175 || (CvSTART(PL_compcv) && !CvSLABBED(PL_compcv)))
176 return PerlMemShared_calloc(1, sz);
178 /* While the subroutine is under construction, the slabs are accessed via
179 CvSTART(), to avoid needing to expand PVCV by one pointer for something
180 unneeded at runtime. Once a subroutine is constructed, the slabs are
181 accessed via CvROOT(). So if CvSTART() is NULL, no slab has been
182 allocated yet. See the commit message for 8be227ab5eaa23f2 for more
184 if (!CvSTART(PL_compcv)) {
186 (OP *)(slab = S_new_slab(aTHX_ PERL_SLAB_SIZE));
187 CvSLABBED_on(PL_compcv);
188 slab->opslab_refcnt = 2; /* one for the CV; one for the new OP */
190 else ++(slab = (OPSLAB *)CvSTART(PL_compcv))->opslab_refcnt;
192 opsz = SIZE_TO_PSIZE(sz);
193 sz = opsz + OPSLOT_HEADER_P;
195 /* The slabs maintain a free list of OPs. In particular, constant folding
196 will free up OPs, so it makes sense to re-use them where possible. A
197 freed up slot is used in preference to a new allocation. */
198 if (slab->opslab_freed) {
199 OP **too = &slab->opslab_freed;
201 DEBUG_S_warn((aTHX_ "found free op at %p, slab %p", o, slab));
202 while (o && DIFF(OpSLOT(o), OpSLOT(o)->opslot_next) < sz) {
203 DEBUG_S_warn((aTHX_ "Alas! too small"));
204 o = *(too = &o->op_next);
205 if (o) { DEBUG_S_warn((aTHX_ "found another free op at %p", o)); }
209 Zero(o, opsz, I32 *);
215 #define INIT_OPSLOT \
216 slot->opslot_slab = slab; \
217 slot->opslot_next = slab2->opslab_first; \
218 slab2->opslab_first = slot; \
219 o = &slot->opslot_op; \
222 /* The partially-filled slab is next in the chain. */
223 slab2 = slab->opslab_next ? slab->opslab_next : slab;
224 if ((space = DIFF(&slab2->opslab_slots, slab2->opslab_first)) < sz) {
225 /* Remaining space is too small. */
227 /* If we can fit a BASEOP, add it to the free chain, so as not
229 if (space >= SIZE_TO_PSIZE(sizeof(OP)) + OPSLOT_HEADER_P) {
230 slot = &slab2->opslab_slots;
232 o->op_type = OP_FREED;
233 o->op_next = slab->opslab_freed;
234 slab->opslab_freed = o;
237 /* Create a new slab. Make this one twice as big. */
238 slot = slab2->opslab_first;
239 while (slot->opslot_next) slot = slot->opslot_next;
240 slab2 = S_new_slab(aTHX_
241 (DIFF(slab2, slot)+1)*2 > PERL_MAX_SLAB_SIZE
243 : (DIFF(slab2, slot)+1)*2);
244 slab2->opslab_next = slab->opslab_next;
245 slab->opslab_next = slab2;
247 assert(DIFF(&slab2->opslab_slots, slab2->opslab_first) >= sz);
249 /* Create a new op slot */
250 slot = (OPSLOT *)((I32 **)slab2->opslab_first - sz);
251 assert(slot >= &slab2->opslab_slots);
252 if (DIFF(&slab2->opslab_slots, slot)
253 < SIZE_TO_PSIZE(sizeof(OP)) + OPSLOT_HEADER_P)
254 slot = &slab2->opslab_slots;
256 DEBUG_S_warn((aTHX_ "allocating op at %p, slab %p", o, slab));
262 #ifdef PERL_DEBUG_READONLY_OPS
264 Perl_Slab_to_ro(pTHX_ OPSLAB *slab)
266 PERL_ARGS_ASSERT_SLAB_TO_RO;
268 if (slab->opslab_readonly) return;
269 slab->opslab_readonly = 1;
270 for (; slab; slab = slab->opslab_next) {
271 /*DEBUG_U(PerlIO_printf(Perl_debug_log,"mprotect ->ro %lu at %p\n",
272 (unsigned long) slab->opslab_size, slab));*/
273 if (mprotect(slab, slab->opslab_size * sizeof(I32 *), PROT_READ))
274 Perl_warn(aTHX_ "mprotect for %p %lu failed with %d", slab,
275 (unsigned long)slab->opslab_size, errno);
280 Perl_Slab_to_rw(pTHX_ OPSLAB *const slab)
284 PERL_ARGS_ASSERT_SLAB_TO_RW;
286 if (!slab->opslab_readonly) return;
288 for (; slab2; slab2 = slab2->opslab_next) {
289 /*DEBUG_U(PerlIO_printf(Perl_debug_log,"mprotect ->rw %lu at %p\n",
290 (unsigned long) size, slab2));*/
291 if (mprotect((void *)slab2, slab2->opslab_size * sizeof(I32 *),
292 PROT_READ|PROT_WRITE)) {
293 Perl_warn(aTHX_ "mprotect RW for %p %lu failed with %d", slab,
294 (unsigned long)slab2->opslab_size, errno);
297 slab->opslab_readonly = 0;
301 # define Slab_to_rw(op) NOOP
304 /* This cannot possibly be right, but it was copied from the old slab
305 allocator, to which it was originally added, without explanation, in
308 # define PerlMemShared PerlMem
312 Perl_Slab_Free(pTHX_ void *op)
315 OP * const o = (OP *)op;
318 PERL_ARGS_ASSERT_SLAB_FREE;
320 if (!o->op_slabbed) {
322 PerlMemShared_free(op);
327 /* If this op is already freed, our refcount will get screwy. */
328 assert(o->op_type != OP_FREED);
329 o->op_type = OP_FREED;
330 o->op_next = slab->opslab_freed;
331 slab->opslab_freed = o;
332 DEBUG_S_warn((aTHX_ "free op at %p, recorded in slab %p", o, slab));
333 OpslabREFCNT_dec_padok(slab);
337 Perl_opslab_free_nopad(pTHX_ OPSLAB *slab)
340 const bool havepad = !!PL_comppad;
341 PERL_ARGS_ASSERT_OPSLAB_FREE_NOPAD;
344 PAD_SAVE_SETNULLPAD();
351 Perl_opslab_free(pTHX_ OPSLAB *slab)
355 PERL_ARGS_ASSERT_OPSLAB_FREE;
356 DEBUG_S_warn((aTHX_ "freeing slab %p", slab));
357 assert(slab->opslab_refcnt == 1);
358 for (; slab; slab = slab2) {
359 slab2 = slab->opslab_next;
361 slab->opslab_refcnt = ~(size_t)0;
363 #ifdef PERL_DEBUG_READONLY_OPS
364 DEBUG_m(PerlIO_printf(Perl_debug_log, "Deallocate slab at %p\n",
366 if (munmap(slab, slab->opslab_size * sizeof(I32 *))) {
367 perror("munmap failed");
371 PerlMemShared_free(slab);
377 Perl_opslab_force_free(pTHX_ OPSLAB *slab)
382 size_t savestack_count = 0;
384 PERL_ARGS_ASSERT_OPSLAB_FORCE_FREE;
387 for (slot = slab2->opslab_first;
389 slot = slot->opslot_next) {
390 if (slot->opslot_op.op_type != OP_FREED
391 && !(slot->opslot_op.op_savefree
397 assert(slot->opslot_op.op_slabbed);
398 op_free(&slot->opslot_op);
399 if (slab->opslab_refcnt == 1) goto free;
402 } while ((slab2 = slab2->opslab_next));
403 /* > 1 because the CV still holds a reference count. */
404 if (slab->opslab_refcnt > 1) { /* still referenced by the savestack */
406 assert(savestack_count == slab->opslab_refcnt-1);
408 /* Remove the CV’s reference count. */
409 slab->opslab_refcnt--;
416 #ifdef PERL_DEBUG_READONLY_OPS
418 Perl_op_refcnt_inc(pTHX_ OP *o)
421 OPSLAB *const slab = o->op_slabbed ? OpSLAB(o) : NULL;
422 if (slab && slab->opslab_readonly) {
435 Perl_op_refcnt_dec(pTHX_ OP *o)
438 OPSLAB *const slab = o->op_slabbed ? OpSLAB(o) : NULL;
440 PERL_ARGS_ASSERT_OP_REFCNT_DEC;
442 if (slab && slab->opslab_readonly) {
444 result = --o->op_targ;
447 result = --o->op_targ;
453 * In the following definition, the ", (OP*)0" is just to make the compiler
454 * think the expression is of the right type: croak actually does a Siglongjmp.
456 #define CHECKOP(type,o) \
457 ((PL_op_mask && PL_op_mask[type]) \
458 ? ( op_free((OP*)o), \
459 Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \
461 : PL_check[type](aTHX_ (OP*)o))
463 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
465 #define CHANGE_TYPE(o,type) \
467 o->op_type = (OPCODE)type; \
468 o->op_ppaddr = PL_ppaddr[type]; \
472 S_gv_ename(pTHX_ GV *gv)
474 SV* const tmpsv = sv_newmortal();
476 PERL_ARGS_ASSERT_GV_ENAME;
478 gv_efullname3(tmpsv, gv, NULL);
483 S_no_fh_allowed(pTHX_ OP *o)
485 PERL_ARGS_ASSERT_NO_FH_ALLOWED;
487 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
493 S_too_few_arguments_sv(pTHX_ OP *o, SV *namesv, U32 flags)
495 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS_SV;
496 yyerror_pv(Perl_form(aTHX_ "Not enough arguments for %"SVf, namesv),
497 SvUTF8(namesv) | flags);
502 S_too_few_arguments_pv(pTHX_ OP *o, const char* name, U32 flags)
504 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS_PV;
505 yyerror_pv(Perl_form(aTHX_ "Not enough arguments for %s", name), flags);
510 S_too_many_arguments_pv(pTHX_ OP *o, const char *name, U32 flags)
512 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS_PV;
514 yyerror_pv(Perl_form(aTHX_ "Too many arguments for %s", name), flags);
519 S_too_many_arguments_sv(pTHX_ OP *o, SV *namesv, U32 flags)
521 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS_SV;
523 yyerror_pv(Perl_form(aTHX_ "Too many arguments for %"SVf, SVfARG(namesv)),
524 SvUTF8(namesv) | flags);
529 S_bad_type_pv(pTHX_ I32 n, const char *t, const char *name, U32 flags, const OP *kid)
531 PERL_ARGS_ASSERT_BAD_TYPE_PV;
533 yyerror_pv(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
534 (int)n, name, t, OP_DESC(kid)), flags);
538 S_bad_type_gv(pTHX_ I32 n, const char *t, GV *gv, U32 flags, const OP *kid)
540 SV * const namesv = gv_ename(gv);
541 PERL_ARGS_ASSERT_BAD_TYPE_GV;
543 yyerror_pv(Perl_form(aTHX_ "Type of arg %d to %"SVf" must be %s (not %s)",
544 (int)n, SVfARG(namesv), t, OP_DESC(kid)), SvUTF8(namesv) | flags);
548 S_no_bareword_allowed(pTHX_ OP *o)
550 PERL_ARGS_ASSERT_NO_BAREWORD_ALLOWED;
553 return; /* various ok barewords are hidden in extra OP_NULL */
554 qerror(Perl_mess(aTHX_
555 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
557 o->op_private &= ~OPpCONST_STRICT; /* prevent warning twice about the same OP */
560 /* "register" allocation */
563 Perl_allocmy(pTHX_ const char *const name, const STRLEN len, const U32 flags)
567 const bool is_our = (PL_parser->in_my == KEY_our);
569 PERL_ARGS_ASSERT_ALLOCMY;
571 if (flags & ~SVf_UTF8)
572 Perl_croak(aTHX_ "panic: allocmy illegal flag bits 0x%" UVxf,
575 /* Until we're using the length for real, cross check that we're being
577 assert(strlen(name) == len);
579 /* complain about "my $<special_var>" etc etc */
583 ((flags & SVf_UTF8) && isIDFIRST_utf8((U8 *)name+1)) ||
584 (name[1] == '_' && (*name == '$' || len > 2))))
586 /* name[2] is true if strlen(name) > 2 */
587 if (!(flags & SVf_UTF8 && UTF8_IS_START(name[1]))
588 && (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1]))) {
589 yyerror(Perl_form(aTHX_ "Can't use global %c^%c%.*s in \"%s\"",
590 name[0], toCTRL(name[1]), (int)(len - 2), name + 2,
591 PL_parser->in_my == KEY_state ? "state" : "my"));
593 yyerror_pv(Perl_form(aTHX_ "Can't use global %.*s in \"%s\"", (int) len, name,
594 PL_parser->in_my == KEY_state ? "state" : "my"), flags & SVf_UTF8);
597 else if (len == 2 && name[1] == '_' && !is_our)
598 /* diag_listed_as: Use of my $_ is experimental */
599 Perl_ck_warner_d(aTHX_ packWARN(WARN_EXPERIMENTAL__LEXICAL_TOPIC),
600 "Use of %s $_ is experimental",
601 PL_parser->in_my == KEY_state
605 /* allocate a spare slot and store the name in that slot */
607 off = pad_add_name_pvn(name, len,
608 (is_our ? padadd_OUR :
609 PL_parser->in_my == KEY_state ? padadd_STATE : 0)
610 | ( flags & SVf_UTF8 ? SVf_UTF8 : 0 ),
611 PL_parser->in_my_stash,
613 /* $_ is always in main::, even with our */
614 ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash)
618 /* anon sub prototypes contains state vars should always be cloned,
619 * otherwise the state var would be shared between anon subs */
621 if (PL_parser->in_my == KEY_state && CvANON(PL_compcv))
622 CvCLONE_on(PL_compcv);
628 =for apidoc alloccopstash
630 Available only under threaded builds, this function allocates an entry in
631 C<PL_stashpad> for the stash passed to it.
638 Perl_alloccopstash(pTHX_ HV *hv)
640 PADOFFSET off = 0, o = 1;
641 bool found_slot = FALSE;
643 PERL_ARGS_ASSERT_ALLOCCOPSTASH;
645 if (PL_stashpad[PL_stashpadix] == hv) return PL_stashpadix;
647 for (; o < PL_stashpadmax; ++o) {
648 if (PL_stashpad[o] == hv) return PL_stashpadix = o;
649 if (!PL_stashpad[o] || SvTYPE(PL_stashpad[o]) != SVt_PVHV)
650 found_slot = TRUE, off = o;
653 Renew(PL_stashpad, PL_stashpadmax + 10, HV *);
654 Zero(PL_stashpad + PL_stashpadmax, 10, HV *);
655 off = PL_stashpadmax;
656 PL_stashpadmax += 10;
659 PL_stashpad[PL_stashpadix = off] = hv;
664 /* free the body of an op without examining its contents.
665 * Always use this rather than FreeOp directly */
668 S_op_destroy(pTHX_ OP *o)
676 Perl_op_free(pTHX_ OP *o)
681 /* Though ops may be freed twice, freeing the op after its slab is a
683 assert(!o || !o->op_slabbed || OpSLAB(o)->opslab_refcnt != ~(size_t)0);
684 /* During the forced freeing of ops after compilation failure, kidops
685 may be freed before their parents. */
686 if (!o || o->op_type == OP_FREED)
690 if (o->op_private & OPpREFCOUNTED) {
701 refcnt = OpREFCNT_dec(o);
704 /* Need to find and remove any pattern match ops from the list
705 we maintain for reset(). */
706 find_and_forget_pmops(o);
716 /* Call the op_free hook if it has been set. Do it now so that it's called
717 * at the right time for refcounted ops, but still before all of the kids
721 if (o->op_flags & OPf_KIDS) {
723 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
724 nextkid = kid->op_sibling; /* Get before next freeing kid */
729 type = (OPCODE)o->op_targ;
732 Slab_to_rw(OpSLAB(o));
734 /* COP* is not cleared by op_clear() so that we may track line
735 * numbers etc even after null() */
736 if (type == OP_NEXTSTATE || type == OP_DBSTATE) {
742 #ifdef DEBUG_LEAKING_SCALARS
749 Perl_op_clear(pTHX_ OP *o)
754 PERL_ARGS_ASSERT_OP_CLEAR;
757 mad_free(o->op_madprop);
762 switch (o->op_type) {
763 case OP_NULL: /* Was holding old type, if any. */
764 if (PL_madskills && o->op_targ != OP_NULL) {
765 o->op_type = (Optype)o->op_targ;
770 case OP_ENTEREVAL: /* Was holding hints. */
774 if (!(o->op_flags & OPf_REF)
775 || (PL_check[o->op_type] != Perl_ck_ftst))
782 GV *gv = (o->op_type == OP_GV || o->op_type == OP_GVSV)
787 /* It's possible during global destruction that the GV is freed
788 before the optree. Whilst the SvREFCNT_inc is happy to bump from
789 0 to 1 on a freed SV, the corresponding SvREFCNT_dec from 1 to 0
790 will trigger an assertion failure, because the entry to sv_clear
791 checks that the scalar is not already freed. A check of for
792 !SvIS_FREED(gv) turns out to be invalid, because during global
793 destruction the reference count can be forced down to zero
794 (with SVf_BREAK set). In which case raising to 1 and then
795 dropping to 0 triggers cleanup before it should happen. I
796 *think* that this might actually be a general, systematic,
797 weakness of the whole idea of SVf_BREAK, in that code *is*
798 allowed to raise and lower references during global destruction,
799 so any *valid* code that happens to do this during global
800 destruction might well trigger premature cleanup. */
801 bool still_valid = gv && SvREFCNT(gv);
804 SvREFCNT_inc_simple_void(gv);
806 if (cPADOPo->op_padix > 0) {
807 /* No GvIN_PAD_off(cGVOPo_gv) here, because other references
808 * may still exist on the pad */
809 pad_swipe(cPADOPo->op_padix, TRUE);
810 cPADOPo->op_padix = 0;
813 SvREFCNT_dec(cSVOPo->op_sv);
814 cSVOPo->op_sv = NULL;
817 int try_downgrade = SvREFCNT(gv) == 2;
820 gv_try_downgrade(gv);
824 case OP_METHOD_NAMED:
827 SvREFCNT_dec(cSVOPo->op_sv);
828 cSVOPo->op_sv = NULL;
831 Even if op_clear does a pad_free for the target of the op,
832 pad_free doesn't actually remove the sv that exists in the pad;
833 instead it lives on. This results in that it could be reused as
834 a target later on when the pad was reallocated.
837 pad_swipe(o->op_targ,1);
847 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
852 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
853 assert(o->op_type == OP_TRANS || o->op_type == OP_TRANSR);
855 if (cPADOPo->op_padix > 0) {
856 pad_swipe(cPADOPo->op_padix, TRUE);
857 cPADOPo->op_padix = 0;
860 SvREFCNT_dec(cSVOPo->op_sv);
861 cSVOPo->op_sv = NULL;
865 PerlMemShared_free(cPVOPo->op_pv);
866 cPVOPo->op_pv = NULL;
870 op_free(cPMOPo->op_pmreplrootu.op_pmreplroot);
874 if (cPMOPo->op_pmreplrootu.op_pmtargetoff) {
875 /* No GvIN_PAD_off here, because other references may still
876 * exist on the pad */
877 pad_swipe(cPMOPo->op_pmreplrootu.op_pmtargetoff, TRUE);
880 SvREFCNT_dec(MUTABLE_SV(cPMOPo->op_pmreplrootu.op_pmtargetgv));
886 if (!(cPMOPo->op_pmflags & PMf_CODELIST_PRIVATE))
887 op_free(cPMOPo->op_code_list);
888 cPMOPo->op_code_list = NULL;
890 cPMOPo->op_pmreplrootu.op_pmreplroot = NULL;
891 /* we use the same protection as the "SAFE" version of the PM_ macros
892 * here since sv_clean_all might release some PMOPs
893 * after PL_regex_padav has been cleared
894 * and the clearing of PL_regex_padav needs to
895 * happen before sv_clean_all
898 if(PL_regex_pad) { /* We could be in destruction */
899 const IV offset = (cPMOPo)->op_pmoffset;
900 ReREFCNT_dec(PM_GETRE(cPMOPo));
901 PL_regex_pad[offset] = &PL_sv_undef;
902 sv_catpvn_nomg(PL_regex_pad[0], (const char *)&offset,
906 ReREFCNT_dec(PM_GETRE(cPMOPo));
907 PM_SETRE(cPMOPo, NULL);
913 if (o->op_targ > 0) {
914 pad_free(o->op_targ);
920 S_cop_free(pTHX_ COP* cop)
922 PERL_ARGS_ASSERT_COP_FREE;
925 if (! specialWARN(cop->cop_warnings))
926 PerlMemShared_free(cop->cop_warnings);
927 cophh_free(CopHINTHASH_get(cop));
931 S_forget_pmop(pTHX_ PMOP *const o
934 HV * const pmstash = PmopSTASH(o);
936 PERL_ARGS_ASSERT_FORGET_PMOP;
938 if (pmstash && !SvIS_FREED(pmstash) && SvMAGICAL(pmstash)) {
939 MAGIC * const mg = mg_find((const SV *)pmstash, PERL_MAGIC_symtab);
941 PMOP **const array = (PMOP**) mg->mg_ptr;
942 U32 count = mg->mg_len / sizeof(PMOP**);
947 /* Found it. Move the entry at the end to overwrite it. */
948 array[i] = array[--count];
949 mg->mg_len = count * sizeof(PMOP**);
950 /* Could realloc smaller at this point always, but probably
951 not worth it. Probably worth free()ing if we're the
954 Safefree(mg->mg_ptr);
967 S_find_and_forget_pmops(pTHX_ OP *o)
969 PERL_ARGS_ASSERT_FIND_AND_FORGET_PMOPS;
971 if (o->op_flags & OPf_KIDS) {
972 OP *kid = cUNOPo->op_first;
974 switch (kid->op_type) {
979 forget_pmop((PMOP*)kid);
981 find_and_forget_pmops(kid);
982 kid = kid->op_sibling;
988 Perl_op_null(pTHX_ OP *o)
992 PERL_ARGS_ASSERT_OP_NULL;
994 if (o->op_type == OP_NULL)
998 o->op_targ = o->op_type;
999 o->op_type = OP_NULL;
1000 o->op_ppaddr = PL_ppaddr[OP_NULL];
1004 Perl_op_refcnt_lock(pTHX)
1007 PERL_UNUSED_CONTEXT;
1012 Perl_op_refcnt_unlock(pTHX)
1015 PERL_UNUSED_CONTEXT;
1019 /* Contextualizers */
1022 =for apidoc Am|OP *|op_contextualize|OP *o|I32 context
1024 Applies a syntactic context to an op tree representing an expression.
1025 I<o> is the op tree, and I<context> must be C<G_SCALAR>, C<G_ARRAY>,
1026 or C<G_VOID> to specify the context to apply. The modified op tree
1033 Perl_op_contextualize(pTHX_ OP *o, I32 context)
1035 PERL_ARGS_ASSERT_OP_CONTEXTUALIZE;
1037 case G_SCALAR: return scalar(o);
1038 case G_ARRAY: return list(o);
1039 case G_VOID: return scalarvoid(o);
1041 Perl_croak(aTHX_ "panic: op_contextualize bad context %ld",
1048 =head1 Optree Manipulation Functions
1050 =for apidoc Am|OP*|op_linklist|OP *o
1051 This function is the implementation of the L</LINKLIST> macro. It should
1052 not be called directly.
1058 Perl_op_linklist(pTHX_ OP *o)
1062 PERL_ARGS_ASSERT_OP_LINKLIST;
1067 /* establish postfix order */
1068 first = cUNOPo->op_first;
1071 o->op_next = LINKLIST(first);
1074 if (kid->op_sibling) {
1075 kid->op_next = LINKLIST(kid->op_sibling);
1076 kid = kid->op_sibling;
1090 S_scalarkids(pTHX_ OP *o)
1092 if (o && o->op_flags & OPf_KIDS) {
1094 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1101 S_scalarboolean(pTHX_ OP *o)
1105 PERL_ARGS_ASSERT_SCALARBOOLEAN;
1107 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST
1108 && !(cBINOPo->op_first->op_flags & OPf_SPECIAL)) {
1109 if (ckWARN(WARN_SYNTAX)) {
1110 const line_t oldline = CopLINE(PL_curcop);
1112 if (PL_parser && PL_parser->copline != NOLINE) {
1113 /* This ensures that warnings are reported at the first line
1114 of the conditional, not the last. */
1115 CopLINE_set(PL_curcop, PL_parser->copline);
1117 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
1118 CopLINE_set(PL_curcop, oldline);
1125 Perl_scalar(pTHX_ OP *o)
1130 /* assumes no premature commitment */
1131 if (!o || (PL_parser && PL_parser->error_count)
1132 || (o->op_flags & OPf_WANT)
1133 || o->op_type == OP_RETURN)
1138 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
1140 switch (o->op_type) {
1142 scalar(cBINOPo->op_first);
1147 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1157 if (o->op_flags & OPf_KIDS) {
1158 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1164 kid = cLISTOPo->op_first;
1166 kid = kid->op_sibling;
1169 OP *sib = kid->op_sibling;
1170 if (sib && kid->op_type != OP_LEAVEWHEN)
1176 PL_curcop = &PL_compiling;
1181 kid = cLISTOPo->op_first;
1184 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
1191 Perl_scalarvoid(pTHX_ OP *o)
1195 SV *useless_sv = NULL;
1196 const char* useless = NULL;
1200 PERL_ARGS_ASSERT_SCALARVOID;
1202 /* trailing mad null ops don't count as "there" for void processing */
1204 o->op_type != OP_NULL &&
1206 o->op_sibling->op_type == OP_NULL)
1209 for (sib = o->op_sibling;
1210 sib && sib->op_type == OP_NULL;
1211 sib = sib->op_sibling) ;
1217 if (o->op_type == OP_NEXTSTATE
1218 || o->op_type == OP_DBSTATE
1219 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1220 || o->op_targ == OP_DBSTATE)))
1221 PL_curcop = (COP*)o; /* for warning below */
1223 /* assumes no premature commitment */
1224 want = o->op_flags & OPf_WANT;
1225 if ((want && want != OPf_WANT_SCALAR)
1226 || (PL_parser && PL_parser->error_count)
1227 || o->op_type == OP_RETURN || o->op_type == OP_REQUIRE || o->op_type == OP_LEAVEWHEN)
1232 if ((o->op_private & OPpTARGET_MY)
1233 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1235 return scalar(o); /* As if inside SASSIGN */
1238 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1240 switch (o->op_type) {
1242 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1246 if (o->op_flags & OPf_STACKED)
1250 if (o->op_private == 4)
1275 case OP_AELEMFAST_LEX:
1294 case OP_GETSOCKNAME:
1295 case OP_GETPEERNAME:
1300 case OP_GETPRIORITY:
1325 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1326 /* Otherwise it's "Useless use of grep iterator" */
1327 useless = OP_DESC(o);
1331 kid = cLISTOPo->op_first;
1332 if (kid && kid->op_type == OP_PUSHRE
1334 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetoff)
1336 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetgv)
1338 useless = OP_DESC(o);
1342 kid = cUNOPo->op_first;
1343 if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST &&
1344 kid->op_type != OP_TRANS && kid->op_type != OP_TRANSR) {
1347 useless = "negative pattern binding (!~)";
1351 if (cPMOPo->op_pmflags & PMf_NONDESTRUCT)
1352 useless = "non-destructive substitution (s///r)";
1356 useless = "non-destructive transliteration (tr///r)";
1363 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1364 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1365 useless = "a variable";
1370 if (cSVOPo->op_private & OPpCONST_STRICT)
1371 no_bareword_allowed(o);
1373 if (ckWARN(WARN_VOID)) {
1374 /* don't warn on optimised away booleans, eg
1375 * use constant Foo, 5; Foo || print; */
1376 if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT)
1378 /* the constants 0 and 1 are permitted as they are
1379 conventionally used as dummies in constructs like
1380 1 while some_condition_with_side_effects; */
1381 else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1383 else if (SvPOK(sv)) {
1384 SV * const dsv = newSVpvs("");
1386 = Perl_newSVpvf(aTHX_
1388 pv_pretty(dsv, SvPVX_const(sv),
1389 SvCUR(sv), 32, NULL, NULL,
1391 | PERL_PV_ESCAPE_NOCLEAR
1392 | PERL_PV_ESCAPE_UNI_DETECT));
1393 SvREFCNT_dec_NN(dsv);
1395 else if (SvOK(sv)) {
1396 useless_sv = Perl_newSVpvf(aTHX_ "a constant (%"SVf")", sv);
1399 useless = "a constant (undef)";
1402 op_null(o); /* don't execute or even remember it */
1406 o->op_type = OP_PREINC; /* pre-increment is faster */
1407 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1411 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1412 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1416 o->op_type = OP_I_PREINC; /* pre-increment is faster */
1417 o->op_ppaddr = PL_ppaddr[OP_I_PREINC];
1421 o->op_type = OP_I_PREDEC; /* pre-decrement is faster */
1422 o->op_ppaddr = PL_ppaddr[OP_I_PREDEC];
1427 UNOP *refgen, *rv2cv;
1430 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
1433 rv2gv = ((BINOP *)o)->op_last;
1434 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
1437 refgen = (UNOP *)((BINOP *)o)->op_first;
1439 if (!refgen || refgen->op_type != OP_REFGEN)
1442 exlist = (LISTOP *)refgen->op_first;
1443 if (!exlist || exlist->op_type != OP_NULL
1444 || exlist->op_targ != OP_LIST)
1447 if (exlist->op_first->op_type != OP_PUSHMARK)
1450 rv2cv = (UNOP*)exlist->op_last;
1452 if (rv2cv->op_type != OP_RV2CV)
1455 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
1456 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
1457 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
1459 o->op_private |= OPpASSIGN_CV_TO_GV;
1460 rv2gv->op_private |= OPpDONT_INIT_GV;
1461 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
1473 kid = cLOGOPo->op_first;
1474 if (kid->op_type == OP_NOT
1475 && (kid->op_flags & OPf_KIDS)
1477 if (o->op_type == OP_AND) {
1479 o->op_ppaddr = PL_ppaddr[OP_OR];
1481 o->op_type = OP_AND;
1482 o->op_ppaddr = PL_ppaddr[OP_AND];
1491 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1496 if (o->op_flags & OPf_STACKED)
1503 if (!(o->op_flags & OPf_KIDS))
1514 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1525 /* mortalise it, in case warnings are fatal. */
1526 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
1527 "Useless use of %"SVf" in void context",
1528 sv_2mortal(useless_sv));
1531 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
1532 "Useless use of %s in void context",
1539 S_listkids(pTHX_ OP *o)
1541 if (o && o->op_flags & OPf_KIDS) {
1543 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1550 Perl_list(pTHX_ OP *o)
1555 /* assumes no premature commitment */
1556 if (!o || (o->op_flags & OPf_WANT)
1557 || (PL_parser && PL_parser->error_count)
1558 || o->op_type == OP_RETURN)
1563 if ((o->op_private & OPpTARGET_MY)
1564 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1566 return o; /* As if inside SASSIGN */
1569 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1571 switch (o->op_type) {
1574 list(cBINOPo->op_first);
1579 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1587 if (!(o->op_flags & OPf_KIDS))
1589 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1590 list(cBINOPo->op_first);
1591 return gen_constant_list(o);
1598 kid = cLISTOPo->op_first;
1600 kid = kid->op_sibling;
1603 OP *sib = kid->op_sibling;
1604 if (sib && kid->op_type != OP_LEAVEWHEN)
1610 PL_curcop = &PL_compiling;
1614 kid = cLISTOPo->op_first;
1621 S_scalarseq(pTHX_ OP *o)
1625 const OPCODE type = o->op_type;
1627 if (type == OP_LINESEQ || type == OP_SCOPE ||
1628 type == OP_LEAVE || type == OP_LEAVETRY)
1631 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1632 if (kid->op_sibling) {
1636 PL_curcop = &PL_compiling;
1638 o->op_flags &= ~OPf_PARENS;
1639 if (PL_hints & HINT_BLOCK_SCOPE)
1640 o->op_flags |= OPf_PARENS;
1643 o = newOP(OP_STUB, 0);
1648 S_modkids(pTHX_ OP *o, I32 type)
1650 if (o && o->op_flags & OPf_KIDS) {
1652 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1653 op_lvalue(kid, type);
1659 =for apidoc finalize_optree
1661 This function finalizes the optree. Should be called directly after
1662 the complete optree is built. It does some additional
1663 checking which can't be done in the normal ck_xxx functions and makes
1664 the tree thread-safe.
1669 Perl_finalize_optree(pTHX_ OP* o)
1671 PERL_ARGS_ASSERT_FINALIZE_OPTREE;
1674 SAVEVPTR(PL_curcop);
1682 S_finalize_op(pTHX_ OP* o)
1684 PERL_ARGS_ASSERT_FINALIZE_OP;
1686 #if defined(PERL_MAD) && defined(USE_ITHREADS)
1688 /* Make sure mad ops are also thread-safe */
1689 MADPROP *mp = o->op_madprop;
1691 if (mp->mad_type == MAD_OP && mp->mad_vlen) {
1692 OP *prop_op = (OP *) mp->mad_val;
1693 /* We only need "Relocate sv to the pad for thread safety.", but this
1694 easiest way to make sure it traverses everything */
1695 if (prop_op->op_type == OP_CONST)
1696 cSVOPx(prop_op)->op_private &= ~OPpCONST_STRICT;
1697 finalize_op(prop_op);
1704 switch (o->op_type) {
1707 PL_curcop = ((COP*)o); /* for warnings */
1711 && (o->op_sibling->op_type == OP_NEXTSTATE || o->op_sibling->op_type == OP_DBSTATE)
1712 && ckWARN(WARN_EXEC))
1714 if (o->op_sibling->op_sibling) {
1715 const OPCODE type = o->op_sibling->op_sibling->op_type;
1716 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
1717 const line_t oldline = CopLINE(PL_curcop);
1718 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_sibling));
1719 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1720 "Statement unlikely to be reached");
1721 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1722 "\t(Maybe you meant system() when you said exec()?)\n");
1723 CopLINE_set(PL_curcop, oldline);
1730 if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
1731 GV * const gv = cGVOPo_gv;
1732 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
1733 /* XXX could check prototype here instead of just carping */
1734 SV * const sv = sv_newmortal();
1735 gv_efullname3(sv, gv, NULL);
1736 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
1737 "%"SVf"() called too early to check prototype",
1744 if (cSVOPo->op_private & OPpCONST_STRICT)
1745 no_bareword_allowed(o);
1749 case OP_METHOD_NAMED:
1750 /* Relocate sv to the pad for thread safety.
1751 * Despite being a "constant", the SV is written to,
1752 * for reference counts, sv_upgrade() etc. */
1753 if (cSVOPo->op_sv) {
1754 const PADOFFSET ix = pad_alloc(OP_CONST, SVf_READONLY);
1755 if (o->op_type != OP_METHOD_NAMED
1756 && cSVOPo->op_sv == &PL_sv_undef) {
1757 /* PL_sv_undef is hack - it's unsafe to store it in the
1758 AV that is the pad, because av_fetch treats values of
1759 PL_sv_undef as a "free" AV entry and will merrily
1760 replace them with a new SV, causing pad_alloc to think
1761 that this pad slot is free. (When, clearly, it is not)
1763 SvOK_off(PAD_SVl(ix));
1764 SvPADTMP_on(PAD_SVl(ix));
1765 SvREADONLY_on(PAD_SVl(ix));
1768 SvREFCNT_dec(PAD_SVl(ix));
1769 PAD_SETSV(ix, cSVOPo->op_sv);
1770 /* XXX I don't know how this isn't readonly already. */
1771 if (!SvIsCOW(PAD_SVl(ix))) SvREADONLY_on(PAD_SVl(ix));
1773 cSVOPo->op_sv = NULL;
1784 const char *key = NULL;
1787 if (((BINOP*)o)->op_last->op_type != OP_CONST)
1790 /* Make the CONST have a shared SV */
1791 svp = cSVOPx_svp(((BINOP*)o)->op_last);
1792 if ((!SvIsCOW_shared_hash(sv = *svp))
1793 && SvTYPE(sv) < SVt_PVMG && SvOK(sv) && !SvROK(sv)) {
1794 key = SvPV_const(sv, keylen);
1795 lexname = newSVpvn_share(key,
1796 SvUTF8(sv) ? -(I32)keylen : (I32)keylen,
1798 SvREFCNT_dec_NN(sv);
1802 if ((o->op_private & (OPpLVAL_INTRO)))
1805 rop = (UNOP*)((BINOP*)o)->op_first;
1806 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
1808 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
1809 if (!SvPAD_TYPED(lexname))
1811 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
1812 if (!fields || !GvHV(*fields))
1814 key = SvPV_const(*svp, keylen);
1815 if (!hv_fetch(GvHV(*fields), key,
1816 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) {
1817 Perl_croak(aTHX_ "No such class field \"%"SVf"\" "
1818 "in variable %"SVf" of type %"HEKf,
1819 SVfARG(*svp), SVfARG(lexname),
1820 HEKfARG(HvNAME_HEK(SvSTASH(lexname))));
1832 SVOP *first_key_op, *key_op;
1834 if ((o->op_private & (OPpLVAL_INTRO))
1835 /* I bet there's always a pushmark... */
1836 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
1837 /* hmmm, no optimization if list contains only one key. */
1839 rop = (UNOP*)((LISTOP*)o)->op_last;
1840 if (rop->op_type != OP_RV2HV)
1842 if (rop->op_first->op_type == OP_PADSV)
1843 /* @$hash{qw(keys here)} */
1844 rop = (UNOP*)rop->op_first;
1846 /* @{$hash}{qw(keys here)} */
1847 if (rop->op_first->op_type == OP_SCOPE
1848 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
1850 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
1856 lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE);
1857 if (!SvPAD_TYPED(lexname))
1859 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
1860 if (!fields || !GvHV(*fields))
1862 /* Again guessing that the pushmark can be jumped over.... */
1863 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
1864 ->op_first->op_sibling;
1865 for (key_op = first_key_op; key_op;
1866 key_op = (SVOP*)key_op->op_sibling) {
1867 if (key_op->op_type != OP_CONST)
1869 svp = cSVOPx_svp(key_op);
1870 key = SvPV_const(*svp, keylen);
1871 if (!hv_fetch(GvHV(*fields), key,
1872 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) {
1873 Perl_croak(aTHX_ "No such class field \"%"SVf"\" "
1874 "in variable %"SVf" of type %"HEKf,
1875 SVfARG(*svp), SVfARG(lexname),
1876 HEKfARG(HvNAME_HEK(SvSTASH(lexname))));
1883 if (cPMOPo->op_pmreplrootu.op_pmreplroot)
1884 finalize_op(cPMOPo->op_pmreplrootu.op_pmreplroot);
1891 if (o->op_flags & OPf_KIDS) {
1893 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1899 =for apidoc Amx|OP *|op_lvalue|OP *o|I32 type
1901 Propagate lvalue ("modifiable") context to an op and its children.
1902 I<type> represents the context type, roughly based on the type of op that
1903 would do the modifying, although C<local()> is represented by OP_NULL,
1904 because it has no op type of its own (it is signalled by a flag on
1907 This function detects things that can't be modified, such as C<$x+1>, and
1908 generates errors for them. For example, C<$x+1 = 2> would cause it to be
1909 called with an op of type OP_ADD and a C<type> argument of OP_SASSIGN.
1911 It also flags things that need to behave specially in an lvalue context,
1912 such as C<$$x = 5> which might have to vivify a reference in C<$x>.
1918 Perl_op_lvalue_flags(pTHX_ OP *o, I32 type, U32 flags)
1922 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
1925 if (!o || (PL_parser && PL_parser->error_count))
1928 if ((o->op_private & OPpTARGET_MY)
1929 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1934 assert( (o->op_flags & OPf_WANT) != OPf_WANT_VOID );
1936 if (type == OP_PRTF || type == OP_SPRINTF) type = OP_ENTERSUB;
1938 switch (o->op_type) {
1943 if ((o->op_flags & OPf_PARENS) || PL_madskills)
1947 if ((type == OP_UNDEF || type == OP_REFGEN || type == OP_LOCK) &&
1948 !(o->op_flags & OPf_STACKED)) {
1949 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1950 /* Both ENTERSUB and RV2CV use this bit, but for different pur-
1951 poses, so we need it clear. */
1952 o->op_private &= ~1;
1953 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1954 assert(cUNOPo->op_first->op_type == OP_NULL);
1955 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1958 else { /* lvalue subroutine call */
1959 o->op_private |= OPpLVAL_INTRO
1960 |(OPpENTERSUB_INARGS * (type == OP_LEAVESUBLV));
1961 PL_modcount = RETURN_UNLIMITED_NUMBER;
1962 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1963 /* Potential lvalue context: */
1964 o->op_private |= OPpENTERSUB_INARGS;
1967 else { /* Compile-time error message: */
1968 OP *kid = cUNOPo->op_first;
1971 if (kid->op_type != OP_PUSHMARK) {
1972 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1974 "panic: unexpected lvalue entersub "
1975 "args: type/targ %ld:%"UVuf,
1976 (long)kid->op_type, (UV)kid->op_targ);
1977 kid = kLISTOP->op_first;
1979 while (kid->op_sibling)
1980 kid = kid->op_sibling;
1981 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1982 break; /* Postpone until runtime */
1985 kid = kUNOP->op_first;
1986 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1987 kid = kUNOP->op_first;
1988 if (kid->op_type == OP_NULL)
1990 "Unexpected constant lvalue entersub "
1991 "entry via type/targ %ld:%"UVuf,
1992 (long)kid->op_type, (UV)kid->op_targ);
1993 if (kid->op_type != OP_GV) {
1997 cv = GvCV(kGVOP_gv);
2007 if (flags & OP_LVALUE_NO_CROAK) return NULL;
2008 /* grep, foreach, subcalls, refgen */
2009 if (type == OP_GREPSTART || type == OP_ENTERSUB
2010 || type == OP_REFGEN || type == OP_LEAVESUBLV)
2012 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
2013 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
2015 : (o->op_type == OP_ENTERSUB
2016 ? "non-lvalue subroutine call"
2018 type ? PL_op_desc[type] : "local"));
2032 case OP_RIGHT_SHIFT:
2041 if (!(o->op_flags & OPf_STACKED))
2048 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
2049 op_lvalue(kid, type);
2054 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
2055 PL_modcount = RETURN_UNLIMITED_NUMBER;
2056 return o; /* Treat \(@foo) like ordinary list. */
2060 if (scalar_mod_type(o, type))
2062 ref(cUNOPo->op_first, o->op_type);
2069 if (type == OP_LEAVESUBLV)
2070 o->op_private |= OPpMAYBE_LVSUB;
2074 PL_modcount = RETURN_UNLIMITED_NUMBER;
2077 PL_hints |= HINT_BLOCK_SCOPE;
2078 if (type == OP_LEAVESUBLV)
2079 o->op_private |= OPpMAYBE_LVSUB;
2083 ref(cUNOPo->op_first, o->op_type);
2087 PL_hints |= HINT_BLOCK_SCOPE;
2096 case OP_AELEMFAST_LEX:
2103 PL_modcount = RETURN_UNLIMITED_NUMBER;
2104 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
2105 return o; /* Treat \(@foo) like ordinary list. */
2106 if (scalar_mod_type(o, type))
2108 if (type == OP_LEAVESUBLV)
2109 o->op_private |= OPpMAYBE_LVSUB;
2113 if (!type) /* local() */
2114 Perl_croak(aTHX_ "Can't localize lexical variable %"SVf,
2115 PAD_COMPNAME_SV(o->op_targ));
2124 if (type != OP_SASSIGN && type != OP_LEAVESUBLV)
2128 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
2134 if (type == OP_LEAVESUBLV)
2135 o->op_private |= OPpMAYBE_LVSUB;
2136 if (o->op_flags & OPf_KIDS)
2137 op_lvalue(cBINOPo->op_first->op_sibling, type);
2142 ref(cBINOPo->op_first, o->op_type);
2143 if (type == OP_ENTERSUB &&
2144 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
2145 o->op_private |= OPpLVAL_DEFER;
2146 if (type == OP_LEAVESUBLV)
2147 o->op_private |= OPpMAYBE_LVSUB;
2157 if (o->op_flags & OPf_KIDS)
2158 op_lvalue(cLISTOPo->op_last, type);
2163 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
2165 else if (!(o->op_flags & OPf_KIDS))
2167 if (o->op_targ != OP_LIST) {
2168 op_lvalue(cBINOPo->op_first, type);
2174 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2175 /* elements might be in void context because the list is
2176 in scalar context or because they are attribute sub calls */
2177 if ( (kid->op_flags & OPf_WANT) != OPf_WANT_VOID )
2178 op_lvalue(kid, type);
2182 if (type != OP_LEAVESUBLV)
2184 break; /* op_lvalue()ing was handled by ck_return() */
2190 /* [20011101.069] File test operators interpret OPf_REF to mean that
2191 their argument is a filehandle; thus \stat(".") should not set
2193 if (type == OP_REFGEN &&
2194 PL_check[o->op_type] == Perl_ck_ftst)
2197 if (type != OP_LEAVESUBLV)
2198 o->op_flags |= OPf_MOD;
2200 if (type == OP_AASSIGN || type == OP_SASSIGN)
2201 o->op_flags |= OPf_SPECIAL|OPf_REF;
2202 else if (!type) { /* local() */
2205 o->op_private |= OPpLVAL_INTRO;
2206 o->op_flags &= ~OPf_SPECIAL;
2207 PL_hints |= HINT_BLOCK_SCOPE;
2212 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
2213 "Useless localization of %s", OP_DESC(o));
2216 else if (type != OP_GREPSTART && type != OP_ENTERSUB
2217 && type != OP_LEAVESUBLV)
2218 o->op_flags |= OPf_REF;
2223 S_scalar_mod_type(const OP *o, I32 type)
2228 if (o && o->op_type == OP_RV2GV)
2252 case OP_RIGHT_SHIFT:
2273 S_is_handle_constructor(const OP *o, I32 numargs)
2275 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
2277 switch (o->op_type) {
2285 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
2298 S_refkids(pTHX_ OP *o, I32 type)
2300 if (o && o->op_flags & OPf_KIDS) {
2302 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2309 Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
2314 PERL_ARGS_ASSERT_DOREF;
2316 if (!o || (PL_parser && PL_parser->error_count))
2319 switch (o->op_type) {
2321 if ((type == OP_EXISTS || type == OP_DEFINED) &&
2322 !(o->op_flags & OPf_STACKED)) {
2323 o->op_type = OP_RV2CV; /* entersub => rv2cv */
2324 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
2325 assert(cUNOPo->op_first->op_type == OP_NULL);
2326 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
2327 o->op_flags |= OPf_SPECIAL;
2328 o->op_private &= ~1;
2330 else if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV){
2331 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2332 : type == OP_RV2HV ? OPpDEREF_HV
2334 o->op_flags |= OPf_MOD;
2340 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
2341 doref(kid, type, set_op_ref);
2344 if (type == OP_DEFINED)
2345 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2346 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2349 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2350 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2351 : type == OP_RV2HV ? OPpDEREF_HV
2353 o->op_flags |= OPf_MOD;
2360 o->op_flags |= OPf_REF;
2363 if (type == OP_DEFINED)
2364 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2365 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2371 o->op_flags |= OPf_REF;
2376 if (!(o->op_flags & OPf_KIDS) || type == OP_DEFINED)
2378 doref(cBINOPo->op_first, type, set_op_ref);
2382 doref(cBINOPo->op_first, o->op_type, set_op_ref);
2383 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2384 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2385 : type == OP_RV2HV ? OPpDEREF_HV
2387 o->op_flags |= OPf_MOD;
2397 if (!(o->op_flags & OPf_KIDS))
2399 doref(cLISTOPo->op_last, type, set_op_ref);
2409 S_dup_attrlist(pTHX_ OP *o)
2414 PERL_ARGS_ASSERT_DUP_ATTRLIST;
2416 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
2417 * where the first kid is OP_PUSHMARK and the remaining ones
2418 * are OP_CONST. We need to push the OP_CONST values.
2420 if (o->op_type == OP_CONST)
2421 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
2423 else if (o->op_type == OP_NULL)
2427 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
2429 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
2430 if (o->op_type == OP_CONST)
2431 rop = op_append_elem(OP_LIST, rop,
2432 newSVOP(OP_CONST, o->op_flags,
2433 SvREFCNT_inc_NN(cSVOPo->op_sv)));
2440 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
2443 SV * const stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2445 PERL_ARGS_ASSERT_APPLY_ATTRS;
2447 /* fake up C<use attributes $pkg,$rv,@attrs> */
2448 ENTER; /* need to protect against side-effects of 'use' */
2450 #define ATTRSMODULE "attributes"
2451 #define ATTRSMODULE_PM "attributes.pm"
2453 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2454 newSVpvs(ATTRSMODULE),
2456 op_prepend_elem(OP_LIST,
2457 newSVOP(OP_CONST, 0, stashsv),
2458 op_prepend_elem(OP_LIST,
2459 newSVOP(OP_CONST, 0,
2461 dup_attrlist(attrs))));
2466 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
2469 OP *pack, *imop, *arg;
2470 SV *meth, *stashsv, **svp;
2472 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
2477 assert(target->op_type == OP_PADSV ||
2478 target->op_type == OP_PADHV ||
2479 target->op_type == OP_PADAV);
2481 /* Ensure that attributes.pm is loaded. */
2482 ENTER; /* need to protect against side-effects of 'use' */
2483 /* Don't force the C<use> if we don't need it. */
2484 svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
2485 if (svp && *svp != &PL_sv_undef)
2486 NOOP; /* already in %INC */
2488 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
2489 newSVpvs(ATTRSMODULE), NULL);
2492 /* Need package name for method call. */
2493 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
2495 /* Build up the real arg-list. */
2496 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2498 arg = newOP(OP_PADSV, 0);
2499 arg->op_targ = target->op_targ;
2500 arg = op_prepend_elem(OP_LIST,
2501 newSVOP(OP_CONST, 0, stashsv),
2502 op_prepend_elem(OP_LIST,
2503 newUNOP(OP_REFGEN, 0,
2504 op_lvalue(arg, OP_REFGEN)),
2505 dup_attrlist(attrs)));
2507 /* Fake up a method call to import */
2508 meth = newSVpvs_share("import");
2509 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
2510 op_append_elem(OP_LIST,
2511 op_prepend_elem(OP_LIST, pack, list(arg)),
2512 newSVOP(OP_METHOD_NAMED, 0, meth)));
2514 /* Combine the ops. */
2515 *imopsp = op_append_elem(OP_LIST, *imopsp, imop);
2519 =notfor apidoc apply_attrs_string
2521 Attempts to apply a list of attributes specified by the C<attrstr> and
2522 C<len> arguments to the subroutine identified by the C<cv> argument which
2523 is expected to be associated with the package identified by the C<stashpv>
2524 argument (see L<attributes>). It gets this wrong, though, in that it
2525 does not correctly identify the boundaries of the individual attribute
2526 specifications within C<attrstr>. This is not really intended for the
2527 public API, but has to be listed here for systems such as AIX which
2528 need an explicit export list for symbols. (It's called from XS code
2529 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
2530 to respect attribute syntax properly would be welcome.
2536 Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
2537 const char *attrstr, STRLEN len)
2541 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2544 len = strlen(attrstr);
2548 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2550 const char * const sstr = attrstr;
2551 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2552 attrs = op_append_elem(OP_LIST, attrs,
2553 newSVOP(OP_CONST, 0,
2554 newSVpvn(sstr, attrstr-sstr)));
2558 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2559 newSVpvs(ATTRSMODULE),
2560 NULL, op_prepend_elem(OP_LIST,
2561 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2562 op_prepend_elem(OP_LIST,
2563 newSVOP(OP_CONST, 0,
2564 newRV(MUTABLE_SV(cv))),
2569 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
2573 const bool stately = PL_parser && PL_parser->in_my == KEY_state;
2575 PERL_ARGS_ASSERT_MY_KID;
2577 if (!o || (PL_parser && PL_parser->error_count))
2581 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2582 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2586 if (type == OP_LIST) {
2588 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2589 my_kid(kid, attrs, imopsp);
2591 } else if (type == OP_UNDEF || type == OP_STUB) {
2593 } else if (type == OP_RV2SV || /* "our" declaration */
2595 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
2596 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
2597 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2599 PL_parser->in_my == KEY_our
2601 : PL_parser->in_my == KEY_state ? "state" : "my"));
2603 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
2604 PL_parser->in_my = FALSE;
2605 PL_parser->in_my_stash = NULL;
2606 apply_attrs(GvSTASH(gv),
2607 (type == OP_RV2SV ? GvSV(gv) :
2608 type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) :
2609 type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)),
2612 o->op_private |= OPpOUR_INTRO;
2615 else if (type != OP_PADSV &&
2618 type != OP_PUSHMARK)
2620 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2622 PL_parser->in_my == KEY_our
2624 : PL_parser->in_my == KEY_state ? "state" : "my"));
2627 else if (attrs && type != OP_PUSHMARK) {
2630 PL_parser->in_my = FALSE;
2631 PL_parser->in_my_stash = NULL;
2633 /* check for C<my Dog $spot> when deciding package */
2634 stash = PAD_COMPNAME_TYPE(o->op_targ);
2636 stash = PL_curstash;
2637 apply_attrs_my(stash, o, attrs, imopsp);
2639 o->op_flags |= OPf_MOD;
2640 o->op_private |= OPpLVAL_INTRO;
2642 o->op_private |= OPpPAD_STATE;
2647 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2651 int maybe_scalar = 0;
2653 PERL_ARGS_ASSERT_MY_ATTRS;
2655 /* [perl #17376]: this appears to be premature, and results in code such as
2656 C< our(%x); > executing in list mode rather than void mode */
2658 if (o->op_flags & OPf_PARENS)
2668 o = my_kid(o, attrs, &rops);
2670 if (maybe_scalar && o->op_type == OP_PADSV) {
2671 o = scalar(op_append_list(OP_LIST, rops, o));
2672 o->op_private |= OPpLVAL_INTRO;
2675 /* The listop in rops might have a pushmark at the beginning,
2676 which will mess up list assignment. */
2677 LISTOP * const lrops = (LISTOP *)rops; /* for brevity */
2678 if (rops->op_type == OP_LIST &&
2679 lrops->op_first && lrops->op_first->op_type == OP_PUSHMARK)
2681 OP * const pushmark = lrops->op_first;
2682 lrops->op_first = pushmark->op_sibling;
2685 o = op_append_list(OP_LIST, o, rops);
2688 PL_parser->in_my = FALSE;
2689 PL_parser->in_my_stash = NULL;
2694 Perl_sawparens(pTHX_ OP *o)
2696 PERL_UNUSED_CONTEXT;
2698 o->op_flags |= OPf_PARENS;
2703 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2707 const OPCODE ltype = left->op_type;
2708 const OPCODE rtype = right->op_type;
2710 PERL_ARGS_ASSERT_BIND_MATCH;
2712 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2713 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
2715 const char * const desc
2717 rtype == OP_SUBST || rtype == OP_TRANS
2718 || rtype == OP_TRANSR
2720 ? (int)rtype : OP_MATCH];
2721 const bool isary = ltype == OP_RV2AV || ltype == OP_PADAV;
2724 (ltype == OP_RV2AV || ltype == OP_RV2HV)
2725 ? cUNOPx(left)->op_first->op_type == OP_GV
2726 && (gv = cGVOPx_gv(cUNOPx(left)->op_first))
2727 ? varname(gv, isary ? '@' : '%', 0, NULL, 0, 1)
2730 (GV *)PL_compcv, isary ? '@' : '%', left->op_targ, NULL, 0, 1
2733 Perl_warner(aTHX_ packWARN(WARN_MISC),
2734 "Applying %s to %"SVf" will act on scalar(%"SVf")",
2737 const char * const sample = (isary
2738 ? "@array" : "%hash");
2739 Perl_warner(aTHX_ packWARN(WARN_MISC),
2740 "Applying %s to %s will act on scalar(%s)",
2741 desc, sample, sample);
2745 if (rtype == OP_CONST &&
2746 cSVOPx(right)->op_private & OPpCONST_BARE &&
2747 cSVOPx(right)->op_private & OPpCONST_STRICT)
2749 no_bareword_allowed(right);
2752 /* !~ doesn't make sense with /r, so error on it for now */
2753 if (rtype == OP_SUBST && (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT) &&
2755 yyerror("Using !~ with s///r doesn't make sense");
2756 if (rtype == OP_TRANSR && type == OP_NOT)
2757 yyerror("Using !~ with tr///r doesn't make sense");
2759 ismatchop = (rtype == OP_MATCH ||
2760 rtype == OP_SUBST ||
2761 rtype == OP_TRANS || rtype == OP_TRANSR)
2762 && !(right->op_flags & OPf_SPECIAL);
2763 if (ismatchop && right->op_private & OPpTARGET_MY) {
2765 right->op_private &= ~OPpTARGET_MY;
2767 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
2770 right->op_flags |= OPf_STACKED;
2771 if (rtype != OP_MATCH && rtype != OP_TRANSR &&
2772 ! (rtype == OP_TRANS &&
2773 right->op_private & OPpTRANS_IDENTICAL) &&
2774 ! (rtype == OP_SUBST &&
2775 (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT)))
2776 newleft = op_lvalue(left, rtype);
2779 if (right->op_type == OP_TRANS || right->op_type == OP_TRANSR)
2780 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
2782 o = op_prepend_elem(rtype, scalar(newleft), right);
2784 return newUNOP(OP_NOT, 0, scalar(o));
2788 return bind_match(type, left,
2789 pmruntime(newPMOP(OP_MATCH, 0), right, 0, 0));
2793 Perl_invert(pTHX_ OP *o)
2797 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2801 =for apidoc Amx|OP *|op_scope|OP *o
2803 Wraps up an op tree with some additional ops so that at runtime a dynamic
2804 scope will be created. The original ops run in the new dynamic scope,
2805 and then, provided that they exit normally, the scope will be unwound.
2806 The additional ops used to create and unwind the dynamic scope will
2807 normally be an C<enter>/C<leave> pair, but a C<scope> op may be used
2808 instead if the ops are simple enough to not need the full dynamic scope
2815 Perl_op_scope(pTHX_ OP *o)
2819 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || TAINTING_get) {
2820 o = op_prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2821 o->op_type = OP_LEAVE;
2822 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2824 else if (o->op_type == OP_LINESEQ) {
2826 o->op_type = OP_SCOPE;
2827 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2828 kid = ((LISTOP*)o)->op_first;
2829 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2832 /* The following deals with things like 'do {1 for 1}' */
2833 kid = kid->op_sibling;
2835 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
2840 o = newLISTOP(OP_SCOPE, 0, o, NULL);
2846 Perl_op_unscope(pTHX_ OP *o)
2848 if (o && o->op_type == OP_LINESEQ) {
2849 OP *kid = cLISTOPo->op_first;
2850 for(; kid; kid = kid->op_sibling)
2851 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
2858 Perl_block_start(pTHX_ int full)
2861 const int retval = PL_savestack_ix;
2863 pad_block_start(full);
2865 PL_hints &= ~HINT_BLOCK_SCOPE;
2866 SAVECOMPILEWARNINGS();
2867 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
2869 CALL_BLOCK_HOOKS(bhk_start, full);
2875 Perl_block_end(pTHX_ I32 floor, OP *seq)
2878 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2879 OP* retval = scalarseq(seq);
2882 CALL_BLOCK_HOOKS(bhk_pre_end, &retval);
2885 CopHINTS_set(&PL_compiling, PL_hints);
2887 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2891 /* pad_leavemy has created a sequence of introcv ops for all my
2892 subs declared in the block. We have to replicate that list with
2893 clonecv ops, to deal with this situation:
2898 sub s1 { state sub foo { \&s2 } }
2901 Originally, I was going to have introcv clone the CV and turn
2902 off the stale flag. Since &s1 is declared before &s2, the
2903 introcv op for &s1 is executed (on sub entry) before the one for
2904 &s2. But the &foo sub inside &s1 (which is cloned when &s1 is
2905 cloned, since it is a state sub) closes over &s2 and expects
2906 to see it in its outer CV’s pad. If the introcv op clones &s1,
2907 then &s2 is still marked stale. Since &s1 is not active, and
2908 &foo closes over &s1’s implicit entry for &s2, we get a ‘Varia-
2909 ble will not stay shared’ warning. Because it is the same stub
2910 that will be used when the introcv op for &s2 is executed, clos-
2911 ing over it is safe. Hence, we have to turn off the stale flag
2912 on all lexical subs in the block before we clone any of them.
2913 Hence, having introcv clone the sub cannot work. So we create a
2914 list of ops like this:
2938 OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : o;
2939 OP * const last = o->op_flags & OPf_KIDS ? cLISTOPo->op_last : o;
2940 for (;; kid = kid->op_sibling) {
2941 OP *newkid = newOP(OP_CLONECV, 0);
2942 newkid->op_targ = kid->op_targ;
2943 o = op_append_elem(OP_LINESEQ, o, newkid);
2944 if (kid == last) break;
2946 retval = op_prepend_elem(OP_LINESEQ, o, retval);
2949 CALL_BLOCK_HOOKS(bhk_post_end, &retval);
2955 =head1 Compile-time scope hooks
2957 =for apidoc Aox||blockhook_register
2959 Register a set of hooks to be called when the Perl lexical scope changes
2960 at compile time. See L<perlguts/"Compile-time scope hooks">.
2966 Perl_blockhook_register(pTHX_ BHK *hk)
2968 PERL_ARGS_ASSERT_BLOCKHOOK_REGISTER;
2970 Perl_av_create_and_push(aTHX_ &PL_blockhooks, newSViv(PTR2IV(hk)));
2977 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
2978 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
2979 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2982 OP * const o = newOP(OP_PADSV, 0);
2983 o->op_targ = offset;
2989 Perl_newPROG(pTHX_ OP *o)
2993 PERL_ARGS_ASSERT_NEWPROG;
3000 PL_eval_root = newUNOP(OP_LEAVEEVAL,
3001 ((PL_in_eval & EVAL_KEEPERR)
3002 ? OPf_SPECIAL : 0), o);
3004 cx = &cxstack[cxstack_ix];
3005 assert(CxTYPE(cx) == CXt_EVAL);
3007 if ((cx->blk_gimme & G_WANT) == G_VOID)
3008 scalarvoid(PL_eval_root);
3009 else if ((cx->blk_gimme & G_WANT) == G_ARRAY)
3012 scalar(PL_eval_root);
3014 PL_eval_start = op_linklist(PL_eval_root);
3015 PL_eval_root->op_private |= OPpREFCOUNTED;
3016 OpREFCNT_set(PL_eval_root, 1);
3017 PL_eval_root->op_next = 0;
3018 i = PL_savestack_ix;
3021 CALL_PEEP(PL_eval_start);
3022 finalize_optree(PL_eval_root);
3024 PL_savestack_ix = i;
3027 if (o->op_type == OP_STUB) {
3028 /* This block is entered if nothing is compiled for the main
3029 program. This will be the case for an genuinely empty main
3030 program, or one which only has BEGIN blocks etc, so already
3033 Historically (5.000) the guard above was !o. However, commit
3034 f8a08f7b8bd67b28 (Jun 2001), integrated to blead as
3035 c71fccf11fde0068, changed perly.y so that newPROG() is now
3036 called with the output of block_end(), which returns a new
3037 OP_STUB for the case of an empty optree. ByteLoader (and
3038 maybe other things) also take this path, because they set up
3039 PL_main_start and PL_main_root directly, without generating an
3042 If the parsing the main program aborts (due to parse errors,
3043 or due to BEGIN or similar calling exit), then newPROG()
3044 isn't even called, and hence this code path and its cleanups
3045 are skipped. This shouldn't make a make a difference:
3046 * a non-zero return from perl_parse is a failure, and
3047 perl_destruct() should be called immediately.
3048 * however, if exit(0) is called during the parse, then
3049 perl_parse() returns 0, and perl_run() is called. As
3050 PL_main_start will be NULL, perl_run() will return
3051 promptly, and the exit code will remain 0.
3054 PL_comppad_name = 0;
3056 S_op_destroy(aTHX_ o);
3059 PL_main_root = op_scope(sawparens(scalarvoid(o)));
3060 PL_curcop = &PL_compiling;
3061 PL_main_start = LINKLIST(PL_main_root);
3062 PL_main_root->op_private |= OPpREFCOUNTED;
3063 OpREFCNT_set(PL_main_root, 1);
3064 PL_main_root->op_next = 0;
3065 CALL_PEEP(PL_main_start);
3066 finalize_optree(PL_main_root);
3067 cv_forget_slab(PL_compcv);
3070 /* Register with debugger */
3072 CV * const cv = get_cvs("DB::postponed", 0);
3076 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
3078 call_sv(MUTABLE_SV(cv), G_DISCARD);
3085 Perl_localize(pTHX_ OP *o, I32 lex)
3089 PERL_ARGS_ASSERT_LOCALIZE;
3091 if (o->op_flags & OPf_PARENS)
3092 /* [perl #17376]: this appears to be premature, and results in code such as
3093 C< our(%x); > executing in list mode rather than void mode */
3100 if ( PL_parser->bufptr > PL_parser->oldbufptr
3101 && PL_parser->bufptr[-1] == ','
3102 && ckWARN(WARN_PARENTHESIS))
3104 char *s = PL_parser->bufptr;
3107 /* some heuristics to detect a potential error */
3108 while (*s && (strchr(", \t\n", *s)))
3112 if (*s && strchr("@$%*", *s) && *++s
3113 && (isWORDCHAR(*s) || UTF8_IS_CONTINUED(*s))) {
3116 while (*s && (isWORDCHAR(*s) || UTF8_IS_CONTINUED(*s)))
3118 while (*s && (strchr(", \t\n", *s)))
3124 if (sigil && (*s == ';' || *s == '=')) {
3125 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
3126 "Parentheses missing around \"%s\" list",
3128 ? (PL_parser->in_my == KEY_our
3130 : PL_parser->in_my == KEY_state
3140 o = op_lvalue(o, OP_NULL); /* a bit kludgey */
3141 PL_parser->in_my = FALSE;
3142 PL_parser->in_my_stash = NULL;
3147 Perl_jmaybe(pTHX_ OP *o)
3149 PERL_ARGS_ASSERT_JMAYBE;
3151 if (o->op_type == OP_LIST) {
3153 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
3154 o = convert(OP_JOIN, 0, op_prepend_elem(OP_LIST, o2, o));
3159 PERL_STATIC_INLINE OP *
3160 S_op_std_init(pTHX_ OP *o)
3162 I32 type = o->op_type;
3164 PERL_ARGS_ASSERT_OP_STD_INIT;
3166 if (PL_opargs[type] & OA_RETSCALAR)
3168 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
3169 o->op_targ = pad_alloc(type, SVs_PADTMP);
3174 PERL_STATIC_INLINE OP *
3175 S_op_integerize(pTHX_ OP *o)
3177 I32 type = o->op_type;
3179 PERL_ARGS_ASSERT_OP_INTEGERIZE;
3181 /* integerize op. */
3182 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
3185 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
3188 if (type == OP_NEGATE)
3189 /* XXX might want a ck_negate() for this */
3190 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
3196 S_fold_constants(pTHX_ OP *o)
3201 VOL I32 type = o->op_type;
3206 SV * const oldwarnhook = PL_warnhook;
3207 SV * const olddiehook = PL_diehook;
3211 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
3213 if (!(PL_opargs[type] & OA_FOLDCONST))
3228 /* XXX what about the numeric ops? */
3229 if (IN_LOCALE_COMPILETIME)
3233 if (!cLISTOPo->op_first->op_sibling
3234 || cLISTOPo->op_first->op_sibling->op_type != OP_CONST)
3237 SV * const sv = cSVOPx_sv(cLISTOPo->op_first->op_sibling);
3238 if (!SvPOK(sv) || SvGMAGICAL(sv)) goto nope;
3240 const char *s = SvPVX_const(sv);
3241 while (s < SvEND(sv)) {
3242 if (*s == 'p' || *s == 'P') goto nope;
3249 if (o->op_private & OPpREPEAT_DOLIST) goto nope;
3252 if (PL_parser && PL_parser->error_count)
3253 goto nope; /* Don't try to run w/ errors */
3255 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3256 const OPCODE type = curop->op_type;
3257 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
3259 type != OP_SCALAR &&
3261 type != OP_PUSHMARK)
3267 curop = LINKLIST(o);
3268 old_next = o->op_next;
3272 oldscope = PL_scopestack_ix;
3273 create_eval_scope(G_FAKINGEVAL);
3275 /* Verify that we don't need to save it: */
3276 assert(PL_curcop == &PL_compiling);
3277 StructCopy(&PL_compiling, ¬_compiling, COP);
3278 CopHINTS_set(¬_compiling, PL_hints);
3279 PL_curcop = ¬_compiling;
3280 /* The above ensures that we run with all the correct hints of the
3281 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
3282 assert(IN_PERL_RUNTIME);
3283 PL_warnhook = PERL_WARNHOOK_FATAL;
3290 sv = *(PL_stack_sp--);
3291 if (o->op_targ && sv == PAD_SV(o->op_targ)) { /* grab pad temp? */
3293 /* Can't simply swipe the SV from the pad, because that relies on
3294 the op being freed "real soon now". Under MAD, this doesn't
3295 happen (see the #ifdef below). */
3298 pad_swipe(o->op_targ, FALSE);
3301 else if (SvTEMP(sv)) { /* grab mortal temp? */
3302 SvREFCNT_inc_simple_void(sv);
3305 else { assert(SvIMMORTAL(sv)); }
3308 /* Something tried to die. Abandon constant folding. */
3309 /* Pretend the error never happened. */
3311 o->op_next = old_next;
3315 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
3316 PL_warnhook = oldwarnhook;
3317 PL_diehook = olddiehook;
3318 /* XXX note that this croak may fail as we've already blown away
3319 * the stack - eg any nested evals */
3320 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
3323 PL_warnhook = oldwarnhook;
3324 PL_diehook = olddiehook;
3325 PL_curcop = &PL_compiling;
3327 if (PL_scopestack_ix > oldscope)
3328 delete_eval_scope();
3337 if (type == OP_STRINGIFY) SvPADTMP_off(sv);
3338 else if (!SvIMMORTAL(sv)) SvPADTMP_on(sv);
3339 if (type == OP_RV2GV)
3340 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
3343 newop = newSVOP(OP_CONST, OPpCONST_FOLDED<<8, MUTABLE_SV(sv));
3344 newop->op_folded = 1;
3346 op_getmad(o,newop,'f');
3354 S_gen_constant_list(pTHX_ OP *o)
3358 const I32 oldtmps_floor = PL_tmps_floor;
3363 if (PL_parser && PL_parser->error_count)
3364 return o; /* Don't attempt to run with errors */
3366 PL_op = curop = LINKLIST(o);
3369 Perl_pp_pushmark(aTHX);
3372 assert (!(curop->op_flags & OPf_SPECIAL));
3373 assert(curop->op_type == OP_RANGE);
3374 Perl_pp_anonlist(aTHX);
3375 PL_tmps_floor = oldtmps_floor;
3377 o->op_type = OP_RV2AV;
3378 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
3379 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
3380 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
3381 o->op_opt = 0; /* needs to be revisited in rpeep() */
3382 curop = ((UNOP*)o)->op_first;
3383 av = (AV *)SvREFCNT_inc_NN(*PL_stack_sp--);
3384 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, (SV *)av);
3385 if (AvFILLp(av) != -1)
3386 for (svp = AvARRAY(av) + AvFILLp(av); svp >= AvARRAY(av); --svp)
3389 op_getmad(curop,o,'O');
3398 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
3401 if (type < 0) type = -type, flags |= OPf_SPECIAL;
3402 if (!o || o->op_type != OP_LIST)
3403 o = newLISTOP(OP_LIST, 0, o, NULL);
3405 o->op_flags &= ~OPf_WANT;
3407 if (!(PL_opargs[type] & OA_MARK))
3408 op_null(cLISTOPo->op_first);
3410 OP * const kid2 = cLISTOPo->op_first->op_sibling;
3411 if (kid2 && kid2->op_type == OP_COREARGS) {
3412 op_null(cLISTOPo->op_first);
3413 kid2->op_private |= OPpCOREARGS_PUSHMARK;
3417 o->op_type = (OPCODE)type;
3418 o->op_ppaddr = PL_ppaddr[type];
3419 o->op_flags |= flags;
3421 o = CHECKOP(type, o);
3422 if (o->op_type != (unsigned)type)
3425 return fold_constants(op_integerize(op_std_init(o)));
3429 =head1 Optree Manipulation Functions
3432 /* List constructors */
3435 =for apidoc Am|OP *|op_append_elem|I32 optype|OP *first|OP *last
3437 Append an item to the list of ops contained directly within a list-type
3438 op, returning the lengthened list. I<first> is the list-type op,
3439 and I<last> is the op to append to the list. I<optype> specifies the
3440 intended opcode for the list. If I<first> is not already a list of the
3441 right type, it will be upgraded into one. If either I<first> or I<last>
3442 is null, the other is returned unchanged.
3448 Perl_op_append_elem(pTHX_ I32 type, OP *first, OP *last)
3456 if (first->op_type != (unsigned)type
3457 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
3459 return newLISTOP(type, 0, first, last);
3462 if (first->op_flags & OPf_KIDS)
3463 ((LISTOP*)first)->op_last->op_sibling = last;
3465 first->op_flags |= OPf_KIDS;
3466 ((LISTOP*)first)->op_first = last;
3468 ((LISTOP*)first)->op_last = last;
3473 =for apidoc Am|OP *|op_append_list|I32 optype|OP *first|OP *last
3475 Concatenate the lists of ops contained directly within two list-type ops,
3476 returning the combined list. I<first> and I<last> are the list-type ops
3477 to concatenate. I<optype> specifies the intended opcode for the list.
3478 If either I<first> or I<last> is not already a list of the right type,
3479 it will be upgraded into one. If either I<first> or I<last> is null,
3480 the other is returned unchanged.
3486 Perl_op_append_list(pTHX_ I32 type, OP *first, OP *last)
3494 if (first->op_type != (unsigned)type)
3495 return op_prepend_elem(type, first, last);
3497 if (last->op_type != (unsigned)type)
3498 return op_append_elem(type, first, last);
3500 ((LISTOP*)first)->op_last->op_sibling = ((LISTOP*)last)->op_first;
3501 ((LISTOP*)first)->op_last = ((LISTOP*)last)->op_last;
3502 first->op_flags |= (last->op_flags & OPf_KIDS);
3505 if (((LISTOP*)last)->op_first && first->op_madprop) {
3506 MADPROP *mp = ((LISTOP*)last)->op_first->op_madprop;
3508 while (mp->mad_next)
3510 mp->mad_next = first->op_madprop;
3513 ((LISTOP*)last)->op_first->op_madprop = first->op_madprop;
3516 first->op_madprop = last->op_madprop;
3517 last->op_madprop = 0;
3520 S_op_destroy(aTHX_ last);
3526 =for apidoc Am|OP *|op_prepend_elem|I32 optype|OP *first|OP *last
3528 Prepend an item to the list of ops contained directly within a list-type
3529 op, returning the lengthened list. I<first> is the op to prepend to the
3530 list, and I<last> is the list-type op. I<optype> specifies the intended
3531 opcode for the list. If I<last> is not already a list of the right type,
3532 it will be upgraded into one. If either I<first> or I<last> is null,
3533 the other is returned unchanged.
3539 Perl_op_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
3547 if (last->op_type == (unsigned)type) {
3548 if (type == OP_LIST) { /* already a PUSHMARK there */
3549 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
3550 ((LISTOP*)last)->op_first->op_sibling = first;
3551 if (!(first->op_flags & OPf_PARENS))
3552 last->op_flags &= ~OPf_PARENS;
3555 if (!(last->op_flags & OPf_KIDS)) {
3556 ((LISTOP*)last)->op_last = first;
3557 last->op_flags |= OPf_KIDS;
3559 first->op_sibling = ((LISTOP*)last)->op_first;
3560 ((LISTOP*)last)->op_first = first;
3562 last->op_flags |= OPf_KIDS;
3566 return newLISTOP(type, 0, first, last);
3574 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
3577 Newxz(tk, 1, TOKEN);
3578 tk->tk_type = (OPCODE)optype;
3579 tk->tk_type = 12345;
3581 tk->tk_mad = madprop;
3586 Perl_token_free(pTHX_ TOKEN* tk)
3588 PERL_ARGS_ASSERT_TOKEN_FREE;
3590 if (tk->tk_type != 12345)
3592 mad_free(tk->tk_mad);
3597 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
3602 PERL_ARGS_ASSERT_TOKEN_GETMAD;
3604 if (tk->tk_type != 12345) {
3605 Perl_warner(aTHX_ packWARN(WARN_MISC),
3606 "Invalid TOKEN object ignored");
3613 /* faked up qw list? */
3615 tm->mad_type == MAD_SV &&
3616 SvPVX((SV *)tm->mad_val)[0] == 'q')
3623 /* pretend constant fold didn't happen? */
3624 if (mp->mad_key == 'f' &&
3625 (o->op_type == OP_CONST ||
3626 o->op_type == OP_GV) )
3628 token_getmad(tk,(OP*)mp->mad_val,slot);
3642 if (mp->mad_key == 'X')
3643 mp->mad_key = slot; /* just change the first one */
3653 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
3662 /* pretend constant fold didn't happen? */
3663 if (mp->mad_key == 'f' &&
3664 (o->op_type == OP_CONST ||
3665 o->op_type == OP_GV) )
3667 op_getmad(from,(OP*)mp->mad_val,slot);
3674 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
3677 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
3683 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
3692 /* pretend constant fold didn't happen? */
3693 if (mp->mad_key == 'f' &&
3694 (o->op_type == OP_CONST ||
3695 o->op_type == OP_GV) )
3697 op_getmad(from,(OP*)mp->mad_val,slot);
3704 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
3707 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
3711 PerlIO_printf(PerlIO_stderr(),
3712 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
3718 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
3736 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
3740 addmad(tm, &(o->op_madprop), slot);
3744 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
3765 Perl_newMADsv(pTHX_ char key, SV* sv)
3767 PERL_ARGS_ASSERT_NEWMADSV;
3769 return newMADPROP(key, MAD_SV, sv, 0);
3773 Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
3775 MADPROP *const mp = (MADPROP *) PerlMemShared_malloc(sizeof(MADPROP));
3778 mp->mad_vlen = vlen;
3779 mp->mad_type = type;
3781 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
3786 Perl_mad_free(pTHX_ MADPROP* mp)
3788 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
3792 mad_free(mp->mad_next);
3793 /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
3794 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
3795 switch (mp->mad_type) {
3799 Safefree(mp->mad_val);
3802 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
3803 op_free((OP*)mp->mad_val);
3806 sv_free(MUTABLE_SV(mp->mad_val));
3809 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
3812 PerlMemShared_free(mp);
3818 =head1 Optree construction
3820 =for apidoc Am|OP *|newNULLLIST
3822 Constructs, checks, and returns a new C<stub> op, which represents an
3823 empty list expression.
3829 Perl_newNULLLIST(pTHX)
3831 return newOP(OP_STUB, 0);
3835 S_force_list(pTHX_ OP *o)
3837 if (!o || o->op_type != OP_LIST)
3838 o = newLISTOP(OP_LIST, 0, o, NULL);
3844 =for apidoc Am|OP *|newLISTOP|I32 type|I32 flags|OP *first|OP *last
3846 Constructs, checks, and returns an op of any list type. I<type> is
3847 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3848 C<OPf_KIDS> will be set automatically if required. I<first> and I<last>
3849 supply up to two ops to be direct children of the list op; they are
3850 consumed by this function and become part of the constructed op tree.
3856 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3861 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP);
3863 NewOp(1101, listop, 1, LISTOP);
3865 listop->op_type = (OPCODE)type;
3866 listop->op_ppaddr = PL_ppaddr[type];
3869 listop->op_flags = (U8)flags;
3873 else if (!first && last)
3876 first->op_sibling = last;
3877 listop->op_first = first;
3878 listop->op_last = last;
3879 if (type == OP_LIST) {
3880 OP* const pushop = newOP(OP_PUSHMARK, 0);
3881 pushop->op_sibling = first;
3882 listop->op_first = pushop;
3883 listop->op_flags |= OPf_KIDS;
3885 listop->op_last = pushop;
3888 return CHECKOP(type, listop);
3892 =for apidoc Am|OP *|newOP|I32 type|I32 flags
3894 Constructs, checks, and returns an op of any base type (any type that
3895 has no extra fields). I<type> is the opcode. I<flags> gives the
3896 eight bits of C<op_flags>, and, shifted up eight bits, the eight bits
3903 Perl_newOP(pTHX_ I32 type, I32 flags)
3908 if (type == -OP_ENTEREVAL) {
3909 type = OP_ENTEREVAL;
3910 flags |= OPpEVAL_BYTES<<8;
3913 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP
3914 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3915 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3916 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
3918 NewOp(1101, o, 1, OP);
3919 o->op_type = (OPCODE)type;
3920 o->op_ppaddr = PL_ppaddr[type];
3921 o->op_flags = (U8)flags;
3924 o->op_private = (U8)(0 | (flags >> 8));
3925 if (PL_opargs[type] & OA_RETSCALAR)
3927 if (PL_opargs[type] & OA_TARGET)
3928 o->op_targ = pad_alloc(type, SVs_PADTMP);
3929 return CHECKOP(type, o);
3933 =for apidoc Am|OP *|newUNOP|I32 type|I32 flags|OP *first
3935 Constructs, checks, and returns an op of any unary type. I<type> is
3936 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3937 C<OPf_KIDS> will be set automatically if required, and, shifted up eight
3938 bits, the eight bits of C<op_private>, except that the bit with value 1
3939 is automatically set. I<first> supplies an optional op to be the direct
3940 child of the unary op; it is consumed by this function and become part
3941 of the constructed op tree.
3947 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
3952 if (type == -OP_ENTEREVAL) {
3953 type = OP_ENTEREVAL;
3954 flags |= OPpEVAL_BYTES<<8;
3957 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP
3958 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3959 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3960 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP
3961 || type == OP_SASSIGN
3962 || type == OP_ENTERTRY
3963 || type == OP_NULL );
3966 first = newOP(OP_STUB, 0);
3967 if (PL_opargs[type] & OA_MARK)
3968 first = force_list(first);
3970 NewOp(1101, unop, 1, UNOP);
3971 unop->op_type = (OPCODE)type;
3972 unop->op_ppaddr = PL_ppaddr[type];
3973 unop->op_first = first;
3974 unop->op_flags = (U8)(flags | OPf_KIDS);
3975 unop->op_private = (U8)(1 | (flags >> 8));
3976 unop = (UNOP*) CHECKOP(type, unop);
3980 return fold_constants(op_integerize(op_std_init((OP *) unop)));
3984 =for apidoc Am|OP *|newBINOP|I32 type|I32 flags|OP *first|OP *last
3986 Constructs, checks, and returns an op of any binary type. I<type>
3987 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
3988 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
3989 the eight bits of C<op_private>, except that the bit with value 1 or
3990 2 is automatically set as required. I<first> and I<last> supply up to
3991 two ops to be the direct children of the binary op; they are consumed
3992 by this function and become part of the constructed op tree.
3998 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
4003 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP
4004 || type == OP_SASSIGN || type == OP_NULL );
4006 NewOp(1101, binop, 1, BINOP);
4009 first = newOP(OP_NULL, 0);
4011 binop->op_type = (OPCODE)type;
4012 binop->op_ppaddr = PL_ppaddr[type];
4013 binop->op_first = first;
4014 binop->op_flags = (U8)(flags | OPf_KIDS);
4017 binop->op_private = (U8)(1 | (flags >> 8));
4020 binop->op_private = (U8)(2 | (flags >> 8));
4021 first->op_sibling = last;
4024 binop = (BINOP*)CHECKOP(type, binop);
4025 if (binop->op_next || binop->op_type != (OPCODE)type)
4028 binop->op_last = binop->op_first->op_sibling;
4030 return fold_constants(op_integerize(op_std_init((OP *)binop)));
4033 static int uvcompare(const void *a, const void *b)
4034 __attribute__nonnull__(1)
4035 __attribute__nonnull__(2)
4036 __attribute__pure__;
4037 static int uvcompare(const void *a, const void *b)
4039 if (*((const UV *)a) < (*(const UV *)b))
4041 if (*((const UV *)a) > (*(const UV *)b))
4043 if (*((const UV *)a+1) < (*(const UV *)b+1))
4045 if (*((const UV *)a+1) > (*(const UV *)b+1))
4051 S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
4054 SV * const tstr = ((SVOP*)expr)->op_sv;
4057 (repl->op_type == OP_NULL)
4058 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
4060 ((SVOP*)repl)->op_sv;
4063 const U8 *t = (U8*)SvPV_const(tstr, tlen);
4064 const U8 *r = (U8*)SvPV_const(rstr, rlen);
4070 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
4071 const I32 squash = o->op_private & OPpTRANS_SQUASH;
4072 I32 del = o->op_private & OPpTRANS_DELETE;
4075 PERL_ARGS_ASSERT_PMTRANS;
4077 PL_hints |= HINT_BLOCK_SCOPE;
4080 o->op_private |= OPpTRANS_FROM_UTF;
4083 o->op_private |= OPpTRANS_TO_UTF;
4085 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
4086 SV* const listsv = newSVpvs("# comment\n");
4088 const U8* tend = t + tlen;
4089 const U8* rend = r + rlen;
4103 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
4104 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
4107 const U32 flags = UTF8_ALLOW_DEFAULT;
4111 t = tsave = bytes_to_utf8(t, &len);
4114 if (!to_utf && rlen) {
4116 r = rsave = bytes_to_utf8(r, &len);
4120 /* There are several snags with this code on EBCDIC:
4121 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
4122 2. scan_const() in toke.c has encoded chars in native encoding which makes
4123 ranges at least in EBCDIC 0..255 range the bottom odd.
4127 U8 tmpbuf[UTF8_MAXBYTES+1];
4130 Newx(cp, 2*tlen, UV);
4132 transv = newSVpvs("");
4134 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
4136 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
4138 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
4142 cp[2*i+1] = cp[2*i];
4146 qsort(cp, i, 2*sizeof(UV), uvcompare);
4147 for (j = 0; j < i; j++) {
4149 diff = val - nextmin;
4151 t = uvuni_to_utf8(tmpbuf,nextmin);
4152 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4154 U8 range_mark = UTF_TO_NATIVE(0xff);
4155 t = uvuni_to_utf8(tmpbuf, val - 1);
4156 sv_catpvn(transv, (char *)&range_mark, 1);
4157 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4164 t = uvuni_to_utf8(tmpbuf,nextmin);
4165 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4167 U8 range_mark = UTF_TO_NATIVE(0xff);
4168 sv_catpvn(transv, (char *)&range_mark, 1);
4170 t = uvuni_to_utf8(tmpbuf, 0x7fffffff);
4171 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4172 t = (const U8*)SvPVX_const(transv);
4173 tlen = SvCUR(transv);
4177 else if (!rlen && !del) {
4178 r = t; rlen = tlen; rend = tend;
4181 if ((!rlen && !del) || t == r ||
4182 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
4184 o->op_private |= OPpTRANS_IDENTICAL;
4188 while (t < tend || tfirst <= tlast) {
4189 /* see if we need more "t" chars */
4190 if (tfirst > tlast) {
4191 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
4193 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
4195 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
4202 /* now see if we need more "r" chars */
4203 if (rfirst > rlast) {
4205 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
4207 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
4209 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
4218 rfirst = rlast = 0xffffffff;
4222 /* now see which range will peter our first, if either. */
4223 tdiff = tlast - tfirst;
4224 rdiff = rlast - rfirst;
4231 if (rfirst == 0xffffffff) {
4232 diff = tdiff; /* oops, pretend rdiff is infinite */
4234 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
4235 (long)tfirst, (long)tlast);
4237 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
4241 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
4242 (long)tfirst, (long)(tfirst + diff),
4245 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
4246 (long)tfirst, (long)rfirst);
4248 if (rfirst + diff > max)
4249 max = rfirst + diff;
4251 grows = (tfirst < rfirst &&
4252 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
4264 else if (max > 0xff)
4269 swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none));
4271 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP);
4272 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
4273 PAD_SETSV(cPADOPo->op_padix, swash);
4275 SvREADONLY_on(swash);
4277 cSVOPo->op_sv = swash;
4279 SvREFCNT_dec(listsv);
4280 SvREFCNT_dec(transv);
4282 if (!del && havefinal && rlen)
4283 (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5,
4284 newSVuv((UV)final), 0);
4287 o->op_private |= OPpTRANS_GROWS;
4293 op_getmad(expr,o,'e');
4294 op_getmad(repl,o,'r');
4302 tbl = (short*)PerlMemShared_calloc(
4303 (o->op_private & OPpTRANS_COMPLEMENT) &&
4304 !(o->op_private & OPpTRANS_DELETE) ? 258 : 256,
4306 cPVOPo->op_pv = (char*)tbl;
4308 for (i = 0; i < (I32)tlen; i++)
4310 for (i = 0, j = 0; i < 256; i++) {
4312 if (j >= (I32)rlen) {
4321 if (i < 128 && r[j] >= 128)
4331 o->op_private |= OPpTRANS_IDENTICAL;
4333 else if (j >= (I32)rlen)
4338 PerlMemShared_realloc(tbl,
4339 (0x101+rlen-j) * sizeof(short));
4340 cPVOPo->op_pv = (char*)tbl;
4342 tbl[0x100] = (short)(rlen - j);
4343 for (i=0; i < (I32)rlen - j; i++)
4344 tbl[0x101+i] = r[j+i];
4348 if (!rlen && !del) {
4351 o->op_private |= OPpTRANS_IDENTICAL;
4353 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
4354 o->op_private |= OPpTRANS_IDENTICAL;
4356 for (i = 0; i < 256; i++)
4358 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
4359 if (j >= (I32)rlen) {
4361 if (tbl[t[i]] == -1)
4367 if (tbl[t[i]] == -1) {
4368 if (t[i] < 128 && r[j] >= 128)
4375 if(del && rlen == tlen) {
4376 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator");
4377 } else if(rlen > tlen && !complement) {
4378 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list");
4382 o->op_private |= OPpTRANS_GROWS;
4384 op_getmad(expr,o,'e');
4385 op_getmad(repl,o,'r');
4395 =for apidoc Am|OP *|newPMOP|I32 type|I32 flags
4397 Constructs, checks, and returns an op of any pattern matching type.
4398 I<type> is the opcode. I<flags> gives the eight bits of C<op_flags>
4399 and, shifted up eight bits, the eight bits of C<op_private>.
4405 Perl_newPMOP(pTHX_ I32 type, I32 flags)
4410 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PMOP);
4412 NewOp(1101, pmop, 1, PMOP);
4413 pmop->op_type = (OPCODE)type;
4414 pmop->op_ppaddr = PL_ppaddr[type];
4415 pmop->op_flags = (U8)flags;
4416 pmop->op_private = (U8)(0 | (flags >> 8));
4418 if (PL_hints & HINT_RE_TAINT)
4419 pmop->op_pmflags |= PMf_RETAINT;
4420 if (IN_LOCALE_COMPILETIME) {
4421 set_regex_charset(&(pmop->op_pmflags), REGEX_LOCALE_CHARSET);
4423 else if ((! (PL_hints & HINT_BYTES))
4424 /* Both UNI_8_BIT and locale :not_characters imply Unicode */
4425 && (PL_hints & (HINT_UNI_8_BIT|HINT_LOCALE_NOT_CHARS)))
4427 set_regex_charset(&(pmop->op_pmflags), REGEX_UNICODE_CHARSET);
4429 if (PL_hints & HINT_RE_FLAGS) {
4430 SV *reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4431 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags"), 0, 0
4433 if (reflags && SvOK(reflags)) pmop->op_pmflags |= SvIV(reflags);
4434 reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4435 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags_charset"), 0, 0
4437 if (reflags && SvOK(reflags)) {
4438 set_regex_charset(&(pmop->op_pmflags), (regex_charset)SvIV(reflags));
4444 assert(SvPOK(PL_regex_pad[0]));
4445 if (SvCUR(PL_regex_pad[0])) {
4446 /* Pop off the "packed" IV from the end. */
4447 SV *const repointer_list = PL_regex_pad[0];
4448 const char *p = SvEND(repointer_list) - sizeof(IV);
4449 const IV offset = *((IV*)p);
4451 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
4453 SvEND_set(repointer_list, p);
4455 pmop->op_pmoffset = offset;
4456 /* This slot should be free, so assert this: */
4457 assert(PL_regex_pad[offset] == &PL_sv_undef);
4459 SV * const repointer = &PL_sv_undef;
4460 av_push(PL_regex_padav, repointer);
4461 pmop->op_pmoffset = av_len(PL_regex_padav);
4462 PL_regex_pad = AvARRAY(PL_regex_padav);
4466 return CHECKOP(type, pmop);
4469 /* Given some sort of match op o, and an expression expr containing a
4470 * pattern, either compile expr into a regex and attach it to o (if it's
4471 * constant), or convert expr into a runtime regcomp op sequence (if it's
4474 * isreg indicates that the pattern is part of a regex construct, eg
4475 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
4476 * split "pattern", which aren't. In the former case, expr will be a list
4477 * if the pattern contains more than one term (eg /a$b/) or if it contains
4478 * a replacement, ie s/// or tr///.
4480 * When the pattern has been compiled within a new anon CV (for
4481 * qr/(?{...})/ ), then floor indicates the savestack level just before
4482 * the new sub was created
4486 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg, I32 floor)
4491 I32 repl_has_vars = 0;
4493 bool is_trans = (o->op_type == OP_TRANS || o->op_type == OP_TRANSR);
4494 bool is_compiletime;
4497 PERL_ARGS_ASSERT_PMRUNTIME;
4499 /* for s/// and tr///, last element in list is the replacement; pop it */
4501 if (is_trans || o->op_type == OP_SUBST) {
4503 repl = cLISTOPx(expr)->op_last;
4504 kid = cLISTOPx(expr)->op_first;
4505 while (kid->op_sibling != repl)
4506 kid = kid->op_sibling;
4507 kid->op_sibling = NULL;
4508 cLISTOPx(expr)->op_last = kid;
4511 /* for TRANS, convert LIST/PUSH/CONST into CONST, and pass to pmtrans() */
4514 OP* const oe = expr;
4515 assert(expr->op_type == OP_LIST);
4516 assert(cLISTOPx(expr)->op_first->op_type == OP_PUSHMARK);
4517 assert(cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last);
4518 expr = cLISTOPx(oe)->op_last;
4519 cLISTOPx(oe)->op_first->op_sibling = NULL;
4520 cLISTOPx(oe)->op_last = NULL;
4523 return pmtrans(o, expr, repl);
4526 /* find whether we have any runtime or code elements;
4527 * at the same time, temporarily set the op_next of each DO block;
4528 * then when we LINKLIST, this will cause the DO blocks to be excluded
4529 * from the op_next chain (and from having LINKLIST recursively
4530 * applied to them). We fix up the DOs specially later */
4534 if (expr->op_type == OP_LIST) {
4536 for (o = cLISTOPx(expr)->op_first; o; o = o->op_sibling) {
4537 if (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)) {
4539 assert(!o->op_next && o->op_sibling);
4540 o->op_next = o->op_sibling;
4542 else if (o->op_type != OP_CONST && o->op_type != OP_PUSHMARK)
4546 else if (expr->op_type != OP_CONST)
4551 /* fix up DO blocks; treat each one as a separate little sub;
4552 * also, mark any arrays as LIST/REF */
4554 if (expr->op_type == OP_LIST) {
4556 for (o = cLISTOPx(expr)->op_first; o; o = o->op_sibling) {
4558 if (o->op_type == OP_PADAV || o->op_type == OP_RV2AV) {
4559 assert( !(o->op_flags & OPf_WANT));
4560 /* push the array rather than its contents. The regex
4561 * engine will retrieve and join the elements later */
4562 o->op_flags |= (OPf_WANT_LIST | OPf_REF);
4566 if (!(o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)))
4568 o->op_next = NULL; /* undo temporary hack from above */
4571 if (cLISTOPo->op_first->op_type == OP_LEAVE) {
4572 LISTOP *leaveop = cLISTOPx(cLISTOPo->op_first);
4574 assert(leaveop->op_first->op_type == OP_ENTER);
4575 assert(leaveop->op_first->op_sibling);
4576 o->op_next = leaveop->op_first->op_sibling;
4578 assert(leaveop->op_flags & OPf_KIDS);
4579 assert(leaveop->op_last->op_next == (OP*)leaveop);
4580 leaveop->op_next = NULL; /* stop on last op */
4581 op_null((OP*)leaveop);
4585 OP *scope = cLISTOPo->op_first;
4586 assert(scope->op_type == OP_SCOPE);
4587 assert(scope->op_flags & OPf_KIDS);
4588 scope->op_next = NULL; /* stop on last op */
4591 /* have to peep the DOs individually as we've removed it from
4592 * the op_next chain */
4595 /* runtime finalizes as part of finalizing whole tree */
4599 else if (expr->op_type == OP_PADAV || expr->op_type == OP_RV2AV) {
4600 assert( !(expr->op_flags & OPf_WANT));
4601 /* push the array rather than its contents. The regex
4602 * engine will retrieve and join the elements later */
4603 expr->op_flags |= (OPf_WANT_LIST | OPf_REF);
4606 PL_hints |= HINT_BLOCK_SCOPE;
4608 assert(floor==0 || (pm->op_pmflags & PMf_HAS_CV));
4610 if (is_compiletime) {
4611 U32 rx_flags = pm->op_pmflags & RXf_PMf_COMPILETIME;
4612 regexp_engine const *eng = current_re_engine();
4614 if (o->op_flags & OPf_SPECIAL)
4615 rx_flags |= RXf_SPLIT;
4617 if (!has_code || !eng->op_comp) {
4618 /* compile-time simple constant pattern */
4620 if ((pm->op_pmflags & PMf_HAS_CV) && !has_code) {
4621 /* whoops! we guessed that a qr// had a code block, but we
4622 * were wrong (e.g. /[(?{}]/ ). Throw away the PL_compcv
4623 * that isn't required now. Note that we have to be pretty
4624 * confident that nothing used that CV's pad while the
4625 * regex was parsed */
4626 assert(AvFILLp(PL_comppad) == 0); /* just @_ */
4627 /* But we know that one op is using this CV's slab. */
4628 cv_forget_slab(PL_compcv);
4630 pm->op_pmflags &= ~PMf_HAS_CV;
4635 ? eng->op_comp(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4636 rx_flags, pm->op_pmflags)
4637 : Perl_re_op_compile(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4638 rx_flags, pm->op_pmflags)
4641 op_getmad(expr,(OP*)pm,'e');
4647 /* compile-time pattern that includes literal code blocks */
4648 REGEXP* re = eng->op_comp(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4651 ((PL_hints & HINT_RE_EVAL) ? PMf_USE_RE_EVAL : 0))
4654 if (pm->op_pmflags & PMf_HAS_CV) {
4656 /* this QR op (and the anon sub we embed it in) is never
4657 * actually executed. It's just a placeholder where we can
4658 * squirrel away expr in op_code_list without the peephole
4659 * optimiser etc processing it for a second time */
4660 OP *qr = newPMOP(OP_QR, 0);
4661 ((PMOP*)qr)->op_code_list = expr;
4663 /* handle the implicit sub{} wrapped round the qr/(?{..})/ */
4664 SvREFCNT_inc_simple_void(PL_compcv);
4665 cv = newATTRSUB(floor, 0, NULL, NULL, qr);
4666 ReANY(re)->qr_anoncv = cv;
4668 /* attach the anon CV to the pad so that
4669 * pad_fixup_inner_anons() can find it */
4670 (void)pad_add_anon(cv, o->op_type);
4671 SvREFCNT_inc_simple_void(cv);
4674 pm->op_code_list = expr;
4679 /* runtime pattern: build chain of regcomp etc ops */
4681 PADOFFSET cv_targ = 0;
4683 reglist = isreg && expr->op_type == OP_LIST;
4688 pm->op_code_list = expr;
4689 /* don't free op_code_list; its ops are embedded elsewhere too */
4690 pm->op_pmflags |= PMf_CODELIST_PRIVATE;
4693 if (o->op_flags & OPf_SPECIAL)
4694 pm->op_pmflags |= PMf_SPLIT;
4696 /* the OP_REGCMAYBE is a placeholder in the non-threaded case
4697 * to allow its op_next to be pointed past the regcomp and
4698 * preceding stacking ops;
4699 * OP_REGCRESET is there to reset taint before executing the
4701 if (pm->op_pmflags & PMf_KEEP || TAINTING_get)
4702 expr = newUNOP((TAINTING_get ? OP_REGCRESET : OP_REGCMAYBE),0,expr);
4704 if (pm->op_pmflags & PMf_HAS_CV) {
4705 /* we have a runtime qr with literal code. This means
4706 * that the qr// has been wrapped in a new CV, which
4707 * means that runtime consts, vars etc will have been compiled
4708 * against a new pad. So... we need to execute those ops
4709 * within the environment of the new CV. So wrap them in a call
4710 * to a new anon sub. i.e. for
4714 * we build an anon sub that looks like
4716 * sub { "a", $b, '(?{...})' }
4718 * and call it, passing the returned list to regcomp.
4719 * Or to put it another way, the list of ops that get executed
4723 * ------ -------------------
4724 * pushmark (for regcomp)
4725 * pushmark (for entersub)
4726 * pushmark (for refgen)
4730 * regcreset regcreset
4732 * const("a") const("a")
4734 * const("(?{...})") const("(?{...})")
4739 SvREFCNT_inc_simple_void(PL_compcv);
4740 /* these lines are just an unrolled newANONATTRSUB */
4741 expr = newSVOP(OP_ANONCODE, 0,
4742 MUTABLE_SV(newATTRSUB(floor, 0, NULL, NULL, expr)));
4743 cv_targ = expr->op_targ;
4744 expr = newUNOP(OP_REFGEN, 0, expr);
4746 expr = list(force_list(newUNOP(OP_ENTERSUB, 0, scalar(expr))));
4749 NewOp(1101, rcop, 1, LOGOP);
4750 rcop->op_type = OP_REGCOMP;
4751 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
4752 rcop->op_first = scalar(expr);
4753 rcop->op_flags |= OPf_KIDS
4754 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
4755 | (reglist ? OPf_STACKED : 0);
4756 rcop->op_private = 0;
4758 rcop->op_targ = cv_targ;
4760 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
4761 if (PL_hints & HINT_RE_EVAL) PL_cv_has_eval = 1;
4763 /* establish postfix order */
4764 if (expr->op_type == OP_REGCRESET || expr->op_type == OP_REGCMAYBE) {
4766 rcop->op_next = expr;
4767 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
4770 rcop->op_next = LINKLIST(expr);
4771 expr->op_next = (OP*)rcop;
4774 op_prepend_elem(o->op_type, scalar((OP*)rcop), o);
4780 if (pm->op_pmflags & PMf_EVAL) {
4781 if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end)
4782 CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end);
4784 /* If we are looking at s//.../e with a single statement, get past
4785 the implicit do{}. */
4786 if (curop->op_type == OP_NULL && curop->op_flags & OPf_KIDS
4787 && cUNOPx(curop)->op_first->op_type == OP_SCOPE
4788 && cUNOPx(curop)->op_first->op_flags & OPf_KIDS) {
4789 OP *kid = cUNOPx(cUNOPx(curop)->op_first)->op_first;
4790 if (kid->op_type == OP_NULL && kid->op_sibling
4791 && !kid->op_sibling->op_sibling)
4792 curop = kid->op_sibling;
4794 if (curop->op_type == OP_CONST)
4796 else if (( (curop->op_type == OP_RV2SV ||
4797 curop->op_type == OP_RV2AV ||
4798 curop->op_type == OP_RV2HV ||
4799 curop->op_type == OP_RV2GV)
4800 && cUNOPx(curop)->op_first
4801 && cUNOPx(curop)->op_first->op_type == OP_GV )
4802 || curop->op_type == OP_PADSV
4803 || curop->op_type == OP_PADAV
4804 || curop->op_type == OP_PADHV
4805 || curop->op_type == OP_PADANY) {
4813 || !RX_PRELEN(PM_GETRE(pm))
4814 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
4816 pm->op_pmflags |= PMf_CONST; /* const for long enough */
4817 op_prepend_elem(o->op_type, scalar(repl), o);
4820 NewOp(1101, rcop, 1, LOGOP);
4821 rcop->op_type = OP_SUBSTCONT;
4822 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
4823 rcop->op_first = scalar(repl);
4824 rcop->op_flags |= OPf_KIDS;
4825 rcop->op_private = 1;
4828 /* establish postfix order */
4829 rcop->op_next = LINKLIST(repl);
4830 repl->op_next = (OP*)rcop;
4832 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
4833 assert(!(pm->op_pmflags & PMf_ONCE));
4834 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
4843 =for apidoc Am|OP *|newSVOP|I32 type|I32 flags|SV *sv
4845 Constructs, checks, and returns an op of any type that involves an
4846 embedded SV. I<type> is the opcode. I<flags> gives the eight bits
4847 of C<op_flags>. I<sv> gives the SV to embed in the op; this function
4848 takes ownership of one reference to it.
4854 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
4859 PERL_ARGS_ASSERT_NEWSVOP;
4861 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4862 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4863 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4865 NewOp(1101, svop, 1, SVOP);
4866 svop->op_type = (OPCODE)type;
4867 svop->op_ppaddr = PL_ppaddr[type];
4869 svop->op_next = (OP*)svop;
4870 svop->op_flags = (U8)flags;
4871 svop->op_private = (U8)(0 | (flags >> 8));
4872 if (PL_opargs[type] & OA_RETSCALAR)
4874 if (PL_opargs[type] & OA_TARGET)
4875 svop->op_targ = pad_alloc(type, SVs_PADTMP);
4876 return CHECKOP(type, svop);
4882 =for apidoc Am|OP *|newPADOP|I32 type|I32 flags|SV *sv
4884 Constructs, checks, and returns an op of any type that involves a
4885 reference to a pad element. I<type> is the opcode. I<flags> gives the
4886 eight bits of C<op_flags>. A pad slot is automatically allocated, and
4887 is populated with I<sv>; this function takes ownership of one reference
4890 This function only exists if Perl has been compiled to use ithreads.
4896 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
4901 PERL_ARGS_ASSERT_NEWPADOP;
4903 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4904 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4905 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4907 NewOp(1101, padop, 1, PADOP);
4908 padop->op_type = (OPCODE)type;
4909 padop->op_ppaddr = PL_ppaddr[type];
4910 padop->op_padix = pad_alloc(type, SVs_PADTMP);
4911 SvREFCNT_dec(PAD_SVl(padop->op_padix));
4912 PAD_SETSV(padop->op_padix, sv);
4915 padop->op_next = (OP*)padop;
4916 padop->op_flags = (U8)flags;
4917 if (PL_opargs[type] & OA_RETSCALAR)
4919 if (PL_opargs[type] & OA_TARGET)
4920 padop->op_targ = pad_alloc(type, SVs_PADTMP);
4921 return CHECKOP(type, padop);
4924 #endif /* USE_ITHREADS */
4927 =for apidoc Am|OP *|newGVOP|I32 type|I32 flags|GV *gv
4929 Constructs, checks, and returns an op of any type that involves an
4930 embedded reference to a GV. I<type> is the opcode. I<flags> gives the
4931 eight bits of C<op_flags>. I<gv> identifies the GV that the op should
4932 reference; calling this function does not transfer ownership of any
4939 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
4943 PERL_ARGS_ASSERT_NEWGVOP;
4947 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4949 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4954 =for apidoc Am|OP *|newPVOP|I32 type|I32 flags|char *pv
4956 Constructs, checks, and returns an op of any type that involves an
4957 embedded C-level pointer (PV). I<type> is the opcode. I<flags> gives
4958 the eight bits of C<op_flags>. I<pv> supplies the C-level pointer, which
4959 must have been allocated using C<PerlMemShared_malloc>; the memory will
4960 be freed when the op is destroyed.
4966 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
4969 const bool utf8 = cBOOL(flags & SVf_UTF8);
4974 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4976 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
4978 NewOp(1101, pvop, 1, PVOP);
4979 pvop->op_type = (OPCODE)type;
4980 pvop->op_ppaddr = PL_ppaddr[type];
4982 pvop->op_next = (OP*)pvop;
4983 pvop->op_flags = (U8)flags;
4984 pvop->op_private = utf8 ? OPpPV_IS_UTF8 : 0;
4985 if (PL_opargs[type] & OA_RETSCALAR)
4987 if (PL_opargs[type] & OA_TARGET)
4988 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
4989 return CHECKOP(type, pvop);
4997 Perl_package(pTHX_ OP *o)
5000 SV *const sv = cSVOPo->op_sv;
5005 PERL_ARGS_ASSERT_PACKAGE;
5007 SAVEGENERICSV(PL_curstash);
5008 save_item(PL_curstname);
5010 PL_curstash = (HV *)SvREFCNT_inc(gv_stashsv(sv, GV_ADD));
5012 sv_setsv(PL_curstname, sv);
5014 PL_hints |= HINT_BLOCK_SCOPE;
5015 PL_parser->copline = NOLINE;
5016 PL_parser->expect = XSTATE;
5021 if (!PL_madskills) {
5026 pegop = newOP(OP_NULL,0);
5027 op_getmad(o,pegop,'P');
5033 Perl_package_version( pTHX_ OP *v )
5036 U32 savehints = PL_hints;
5037 PERL_ARGS_ASSERT_PACKAGE_VERSION;
5038 PL_hints &= ~HINT_STRICT_VARS;
5039 sv_setsv( GvSV(gv_fetchpvs("VERSION", GV_ADDMULTI, SVt_PV)), cSVOPx(v)->op_sv );
5040 PL_hints = savehints;
5049 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
5056 OP *pegop = PL_madskills ? newOP(OP_NULL,0) : NULL;
5058 SV *use_version = NULL;
5060 PERL_ARGS_ASSERT_UTILIZE;
5062 if (idop->op_type != OP_CONST)
5063 Perl_croak(aTHX_ "Module name must be constant");
5066 op_getmad(idop,pegop,'U');
5071 SV * const vesv = ((SVOP*)version)->op_sv;
5074 op_getmad(version,pegop,'V');
5075 if (!arg && !SvNIOKp(vesv)) {
5082 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
5083 Perl_croak(aTHX_ "Version number must be a constant number");
5085 /* Make copy of idop so we don't free it twice */
5086 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
5088 /* Fake up a method call to VERSION */
5089 meth = newSVpvs_share("VERSION");
5090 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
5091 op_append_elem(OP_LIST,
5092 op_prepend_elem(OP_LIST, pack, list(version)),
5093 newSVOP(OP_METHOD_NAMED, 0, meth)));
5097 /* Fake up an import/unimport */
5098 if (arg && arg->op_type == OP_STUB) {
5100 op_getmad(arg,pegop,'S');
5101 imop = arg; /* no import on explicit () */
5103 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
5104 imop = NULL; /* use 5.0; */
5106 use_version = ((SVOP*)idop)->op_sv;
5108 idop->op_private |= OPpCONST_NOVER;
5114 op_getmad(arg,pegop,'A');
5116 /* Make copy of idop so we don't free it twice */
5117 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
5119 /* Fake up a method call to import/unimport */
5121 ? newSVpvs_share("import") : newSVpvs_share("unimport");
5122 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
5123 op_append_elem(OP_LIST,
5124 op_prepend_elem(OP_LIST, pack, list(arg)),
5125 newSVOP(OP_METHOD_NAMED, 0, meth)));
5128 /* Fake up the BEGIN {}, which does its thing immediately. */
5130 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
5133 op_append_elem(OP_LINESEQ,
5134 op_append_elem(OP_LINESEQ,
5135 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
5136 newSTATEOP(0, NULL, veop)),
5137 newSTATEOP(0, NULL, imop) ));
5141 * feature bundle that corresponds to the required version. */
5142 use_version = sv_2mortal(new_version(use_version));
5143 S_enable_feature_bundle(aTHX_ use_version);
5145 /* If a version >= 5.11.0 is requested, strictures are on by default! */
5146 if (vcmp(use_version,
5147 sv_2mortal(upg_version(newSVnv(5.011000), FALSE))) >= 0) {
5148 if (!(PL_hints & HINT_EXPLICIT_STRICT_REFS))
5149 PL_hints |= HINT_STRICT_REFS;
5150 if (!(PL_hints & HINT_EXPLICIT_STRICT_SUBS))
5151 PL_hints |= HINT_STRICT_SUBS;
5152 if (!(PL_hints & HINT_EXPLICIT_STRICT_VARS))
5153 PL_hints |= HINT_STRICT_VARS;
5155 /* otherwise they are off */
5157 if (!(PL_hints & HINT_EXPLICIT_STRICT_REFS))
5158 PL_hints &= ~HINT_STRICT_REFS;
5159 if (!(PL_hints & HINT_EXPLICIT_STRICT_SUBS))
5160 PL_hints &= ~HINT_STRICT_SUBS;
5161 if (!(PL_hints & HINT_EXPLICIT_STRICT_VARS))
5162 PL_hints &= ~HINT_STRICT_VARS;
5166 /* The "did you use incorrect case?" warning used to be here.
5167 * The problem is that on case-insensitive filesystems one
5168 * might get false positives for "use" (and "require"):
5169 * "use Strict" or "require CARP" will work. This causes
5170 * portability problems for the script: in case-strict
5171 * filesystems the script will stop working.
5173 * The "incorrect case" warning checked whether "use Foo"
5174 * imported "Foo" to your namespace, but that is wrong, too:
5175 * there is no requirement nor promise in the language that
5176 * a Foo.pm should or would contain anything in package "Foo".
5178 * There is very little Configure-wise that can be done, either:
5179 * the case-sensitivity of the build filesystem of Perl does not
5180 * help in guessing the case-sensitivity of the runtime environment.
5183 PL_hints |= HINT_BLOCK_SCOPE;
5184 PL_parser->copline = NOLINE;
5185 PL_parser->expect = XSTATE;
5186 PL_cop_seqmax++; /* Purely for B::*'s benefit */
5187 if (PL_cop_seqmax == PERL_PADSEQ_INTRO) /* not a legal value */
5196 =head1 Embedding Functions
5198 =for apidoc load_module
5200 Loads the module whose name is pointed to by the string part of name.
5201 Note that the actual module name, not its filename, should be given.
5202 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
5203 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
5204 (or 0 for no flags). ver, if specified and not NULL, provides version semantics
5205 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
5206 arguments can be used to specify arguments to the module's import()
5207 method, similar to C<use Foo::Bar VERSION LIST>. They must be
5208 terminated with a final NULL pointer. Note that this list can only
5209 be omitted when the PERL_LOADMOD_NOIMPORT flag has been used.
5210 Otherwise at least a single NULL pointer to designate the default
5211 import list is required.
5213 The reference count for each specified C<SV*> parameter is decremented.
5218 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
5222 PERL_ARGS_ASSERT_LOAD_MODULE;
5224 va_start(args, ver);
5225 vload_module(flags, name, ver, &args);
5229 #ifdef PERL_IMPLICIT_CONTEXT
5231 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
5235 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
5236 va_start(args, ver);
5237 vload_module(flags, name, ver, &args);
5243 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
5247 OP * const modname = newSVOP(OP_CONST, 0, name);
5249 PERL_ARGS_ASSERT_VLOAD_MODULE;
5251 modname->op_private |= OPpCONST_BARE;
5253 veop = newSVOP(OP_CONST, 0, ver);
5257 if (flags & PERL_LOADMOD_NOIMPORT) {
5258 imop = sawparens(newNULLLIST());
5260 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
5261 imop = va_arg(*args, OP*);
5266 sv = va_arg(*args, SV*);
5268 imop = op_append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
5269 sv = va_arg(*args, SV*);
5273 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
5274 * that it has a PL_parser to play with while doing that, and also
5275 * that it doesn't mess with any existing parser, by creating a tmp
5276 * new parser with lex_start(). This won't actually be used for much,
5277 * since pp_require() will create another parser for the real work. */
5280 SAVEVPTR(PL_curcop);
5281 lex_start(NULL, NULL, LEX_START_SAME_FILTER);
5282 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
5283 veop, modname, imop);
5288 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
5294 PERL_ARGS_ASSERT_DOFILE;
5296 if (!force_builtin) {
5297 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
5298 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
5299 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
5300 gv = gvp ? *gvp : NULL;
5304 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
5305 doop = newUNOP(OP_ENTERSUB, OPf_STACKED,
5306 op_append_elem(OP_LIST, term,
5307 scalar(newUNOP(OP_RV2CV, 0,
5308 newGVOP(OP_GV, 0, gv)))));
5311 doop = newUNOP(OP_DOFILE, 0, scalar(term));
5317 =head1 Optree construction
5319 =for apidoc Am|OP *|newSLICEOP|I32 flags|OP *subscript|OP *listval
5321 Constructs, checks, and returns an C<lslice> (list slice) op. I<flags>
5322 gives the eight bits of C<op_flags>, except that C<OPf_KIDS> will
5323 be set automatically, and, shifted up eight bits, the eight bits of
5324 C<op_private>, except that the bit with value 1 or 2 is automatically
5325 set as required. I<listval> and I<subscript> supply the parameters of
5326 the slice; they are consumed by this function and become part of the
5327 constructed op tree.
5333 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
5335 return newBINOP(OP_LSLICE, flags,
5336 list(force_list(subscript)),
5337 list(force_list(listval)) );
5341 S_is_list_assignment(pTHX_ const OP *o)
5349 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
5350 o = cUNOPo->op_first;
5352 flags = o->op_flags;
5354 if (type == OP_COND_EXPR) {
5355 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
5356 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
5361 yyerror("Assignment to both a list and a scalar");
5365 if (type == OP_LIST &&
5366 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
5367 o->op_private & OPpLVAL_INTRO)
5370 if (type == OP_LIST || flags & OPf_PARENS ||
5371 type == OP_RV2AV || type == OP_RV2HV ||
5372 type == OP_ASLICE || type == OP_HSLICE)
5375 if (type == OP_PADAV || type == OP_PADHV)
5378 if (type == OP_RV2SV)
5385 Helper function for newASSIGNOP to detection commonality between the
5386 lhs and the rhs. Marks all variables with PL_generation. If it
5387 returns TRUE the assignment must be able to handle common variables.
5389 PERL_STATIC_INLINE bool
5390 S_aassign_common_vars(pTHX_ OP* o)
5393 for (curop = cUNOPo->op_first; curop; curop=curop->op_sibling) {
5394 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
5395 if (curop->op_type == OP_GV) {
5396 GV *gv = cGVOPx_gv(curop);
5398 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5400 GvASSIGN_GENERATION_set(gv, PL_generation);
5402 else if (curop->op_type == OP_PADSV ||
5403 curop->op_type == OP_PADAV ||
5404 curop->op_type == OP_PADHV ||
5405 curop->op_type == OP_PADANY)
5407 if (PAD_COMPNAME_GEN(curop->op_targ)
5408 == (STRLEN)PL_generation)
5410 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
5413 else if (curop->op_type == OP_RV2CV)
5415 else if (curop->op_type == OP_RV2SV ||
5416 curop->op_type == OP_RV2AV ||
5417 curop->op_type == OP_RV2HV ||
5418 curop->op_type == OP_RV2GV) {
5419 if (cUNOPx(curop)->op_first->op_type != OP_GV) /* funny deref? */
5422 else if (curop->op_type == OP_PUSHRE) {
5425 ((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff
5426 ? MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff))
5429 ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
5433 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5435 GvASSIGN_GENERATION_set(gv, PL_generation);
5442 if (curop->op_flags & OPf_KIDS) {
5443 if (aassign_common_vars(curop))
5451 =for apidoc Am|OP *|newASSIGNOP|I32 flags|OP *left|I32 optype|OP *right
5453 Constructs, checks, and returns an assignment op. I<left> and I<right>
5454 supply the parameters of the assignment; they are consumed by this
5455 function and become part of the constructed op tree.
5457 If I<optype> is C<OP_ANDASSIGN>, C<OP_ORASSIGN>, or C<OP_DORASSIGN>, then
5458 a suitable conditional optree is constructed. If I<optype> is the opcode
5459 of a binary operator, such as C<OP_BIT_OR>, then an op is constructed that
5460 performs the binary operation and assigns the result to the left argument.
5461 Either way, if I<optype> is non-zero then I<flags> has no effect.
5463 If I<optype> is zero, then a plain scalar or list assignment is
5464 constructed. Which type of assignment it is is automatically determined.
5465 I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5466 will be set automatically, and, shifted up eight bits, the eight bits
5467 of C<op_private>, except that the bit with value 1 or 2 is automatically
5474 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
5480 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
5481 return newLOGOP(optype, 0,
5482 op_lvalue(scalar(left), optype),
5483 newUNOP(OP_SASSIGN, 0, scalar(right)));
5486 return newBINOP(optype, OPf_STACKED,
5487 op_lvalue(scalar(left), optype), scalar(right));
5491 if (is_list_assignment(left)) {
5492 static const char no_list_state[] = "Initialization of state variables"
5493 " in list context currently forbidden";
5495 bool maybe_common_vars = TRUE;
5498 left = op_lvalue(left, OP_AASSIGN);
5499 curop = list(force_list(left));
5500 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
5501 o->op_private = (U8)(0 | (flags >> 8));
5503 if ((left->op_type == OP_LIST
5504 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
5506 OP* lop = ((LISTOP*)left)->op_first;
5507 maybe_common_vars = FALSE;
5509 if (lop->op_type == OP_PADSV ||
5510 lop->op_type == OP_PADAV ||
5511 lop->op_type == OP_PADHV ||
5512 lop->op_type == OP_PADANY) {
5513 if (!(lop->op_private & OPpLVAL_INTRO))
5514 maybe_common_vars = TRUE;
5516 if (lop->op_private & OPpPAD_STATE) {
5517 if (left->op_private & OPpLVAL_INTRO) {
5518 /* Each variable in state($a, $b, $c) = ... */
5521 /* Each state variable in
5522 (state $a, my $b, our $c, $d, undef) = ... */
5524 yyerror(no_list_state);
5526 /* Each my variable in
5527 (state $a, my $b, our $c, $d, undef) = ... */
5529 } else if (lop->op_type == OP_UNDEF ||
5530 lop->op_type == OP_PUSHMARK) {
5531 /* undef may be interesting in
5532 (state $a, undef, state $c) */
5534 /* Other ops in the list. */
5535 maybe_common_vars = TRUE;
5537 lop = lop->op_sibling;
5540 else if ((left->op_private & OPpLVAL_INTRO)
5541 && ( left->op_type == OP_PADSV
5542 || left->op_type == OP_PADAV
5543 || left->op_type == OP_PADHV
5544 || left->op_type == OP_PADANY))
5546 if (left->op_type == OP_PADSV) maybe_common_vars = FALSE;
5547 if (left->op_private & OPpPAD_STATE) {
5548 /* All single variable list context state assignments, hence
5558 yyerror(no_list_state);
5562 /* PL_generation sorcery:
5563 * an assignment like ($a,$b) = ($c,$d) is easier than
5564 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
5565 * To detect whether there are common vars, the global var
5566 * PL_generation is incremented for each assign op we compile.
5567 * Then, while compiling the assign op, we run through all the
5568 * variables on both sides of the assignment, setting a spare slot
5569 * in each of them to PL_generation. If any of them already have
5570 * that value, we know we've got commonality. We could use a
5571 * single bit marker, but then we'd have to make 2 passes, first
5572 * to clear the flag, then to test and set it. To find somewhere
5573 * to store these values, evil chicanery is done with SvUVX().
5576 if (maybe_common_vars) {
5578 if (aassign_common_vars(o))
5579 o->op_private |= OPpASSIGN_COMMON;
5583 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
5584 OP* tmpop = ((LISTOP*)right)->op_first;
5585 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
5586 PMOP * const pm = (PMOP*)tmpop;
5587 if (left->op_type == OP_RV2AV &&
5588 !(left->op_private & OPpLVAL_INTRO) &&
5589 !(o->op_private & OPpASSIGN_COMMON) )
5591 tmpop = ((UNOP*)left)->op_first;
5592 if (tmpop->op_type == OP_GV
5594 && !pm->op_pmreplrootu.op_pmtargetoff
5596 && !pm->op_pmreplrootu.op_pmtargetgv
5600 pm->op_pmreplrootu.op_pmtargetoff
5601 = cPADOPx(tmpop)->op_padix;
5602 cPADOPx(tmpop)->op_padix = 0; /* steal it */
5604 pm->op_pmreplrootu.op_pmtargetgv
5605 = MUTABLE_GV(cSVOPx(tmpop)->op_sv);
5606 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
5608 tmpop = cUNOPo->op_first; /* to list (nulled) */
5609 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
5610 tmpop->op_sibling = NULL; /* don't free split */
5611 right->op_next = tmpop->op_next; /* fix starting loc */
5612 op_free(o); /* blow off assign */
5613 right->op_flags &= ~OPf_WANT;
5614 /* "I don't know and I don't care." */
5619 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
5620 ((LISTOP*)right)->op_last->op_type == OP_CONST)
5623 &((SVOP*)((LISTOP*)right)->op_last)->op_sv;
5624 SV * const sv = *svp;
5625 if (SvIOK(sv) && SvIVX(sv) == 0)
5627 if (right->op_private & OPpSPLIT_IMPLIM) {
5628 /* our own SV, created in ck_split */
5630 sv_setiv(sv, PL_modcount+1);
5633 /* SV may belong to someone else */
5635 *svp = newSViv(PL_modcount+1);
5645 right = newOP(OP_UNDEF, 0);
5646 if (right->op_type == OP_READLINE) {
5647 right->op_flags |= OPf_STACKED;
5648 return newBINOP(OP_NULL, flags, op_lvalue(scalar(left), OP_SASSIGN),
5652 o = newBINOP(OP_SASSIGN, flags,
5653 scalar(right), op_lvalue(scalar(left), OP_SASSIGN) );
5659 =for apidoc Am|OP *|newSTATEOP|I32 flags|char *label|OP *o
5661 Constructs a state op (COP). The state op is normally a C<nextstate> op,
5662 but will be a C<dbstate> op if debugging is enabled for currently-compiled
5663 code. The state op is populated from C<PL_curcop> (or C<PL_compiling>).
5664 If I<label> is non-null, it supplies the name of a label to attach to
5665 the state op; this function takes ownership of the memory pointed at by
5666 I<label>, and will free it. I<flags> gives the eight bits of C<op_flags>
5669 If I<o> is null, the state op is returned. Otherwise the state op is
5670 combined with I<o> into a C<lineseq> list op, which is returned. I<o>
5671 is consumed by this function and becomes part of the returned op tree.
5677 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
5680 const U32 seq = intro_my();
5681 const U32 utf8 = flags & SVf_UTF8;
5686 NewOp(1101, cop, 1, COP);
5687 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
5688 cop->op_type = OP_DBSTATE;
5689 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
5692 cop->op_type = OP_NEXTSTATE;
5693 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
5695 cop->op_flags = (U8)flags;
5696 CopHINTS_set(cop, PL_hints);
5698 cop->op_private |= NATIVE_HINTS;
5700 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
5701 cop->op_next = (OP*)cop;
5704 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
5705 CopHINTHASH_set(cop, cophh_copy(CopHINTHASH_get(PL_curcop)));
5707 Perl_cop_store_label(aTHX_ cop, label, strlen(label), utf8);
5709 PL_hints |= HINT_BLOCK_SCOPE;
5710 /* It seems that we need to defer freeing this pointer, as other parts
5711 of the grammar end up wanting to copy it after this op has been
5716 if (PL_parser && PL_parser->copline == NOLINE)
5717 CopLINE_set(cop, CopLINE(PL_curcop));
5719 CopLINE_set(cop, PL_parser->copline);
5720 PL_parser->copline = NOLINE;
5723 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
5725 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
5727 CopSTASH_set(cop, PL_curstash);
5729 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) {
5730 /* this line can have a breakpoint - store the cop in IV */
5731 AV *av = CopFILEAVx(PL_curcop);
5733 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
5734 if (svp && *svp != &PL_sv_undef ) {
5735 (void)SvIOK_on(*svp);
5736 SvIV_set(*svp, PTR2IV(cop));
5741 if (flags & OPf_SPECIAL)
5743 return op_prepend_elem(OP_LINESEQ, (OP*)cop, o);
5747 =for apidoc Am|OP *|newLOGOP|I32 type|I32 flags|OP *first|OP *other
5749 Constructs, checks, and returns a logical (flow control) op. I<type>
5750 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
5751 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
5752 the eight bits of C<op_private>, except that the bit with value 1 is
5753 automatically set. I<first> supplies the expression controlling the
5754 flow, and I<other> supplies the side (alternate) chain of ops; they are
5755 consumed by this function and become part of the constructed op tree.
5761 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
5765 PERL_ARGS_ASSERT_NEWLOGOP;
5767 return new_logop(type, flags, &first, &other);
5771 S_search_const(pTHX_ OP *o)
5773 PERL_ARGS_ASSERT_SEARCH_CONST;
5775 switch (o->op_type) {
5779 if (o->op_flags & OPf_KIDS)
5780 return search_const(cUNOPo->op_first);
5787 if (!(o->op_flags & OPf_KIDS))
5789 kid = cLISTOPo->op_first;
5791 switch (kid->op_type) {
5795 kid = kid->op_sibling;
5798 if (kid != cLISTOPo->op_last)
5804 kid = cLISTOPo->op_last;
5806 return search_const(kid);
5814 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
5822 int prepend_not = 0;
5824 PERL_ARGS_ASSERT_NEW_LOGOP;
5829 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
5830 return newBINOP(type, flags, scalar(first), scalar(other));
5832 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOGOP);
5834 scalarboolean(first);
5835 /* optimize AND and OR ops that have NOTs as children */
5836 if (first->op_type == OP_NOT
5837 && (first->op_flags & OPf_KIDS)
5838 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
5839 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
5841 if (type == OP_AND || type == OP_OR) {
5847 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
5849 prepend_not = 1; /* prepend a NOT op later */
5853 /* search for a constant op that could let us fold the test */
5854 if ((cstop = search_const(first))) {
5855 if (cstop->op_private & OPpCONST_STRICT)
5856 no_bareword_allowed(cstop);
5857 else if ((cstop->op_private & OPpCONST_BARE))
5858 Perl_ck_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
5859 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
5860 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
5861 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
5863 if (other->op_type == OP_CONST)
5864 other->op_private |= OPpCONST_SHORTCIRCUIT;
5866 OP *newop = newUNOP(OP_NULL, 0, other);
5867 op_getmad(first, newop, '1');
5868 newop->op_targ = type; /* set "was" field */
5872 if (other->op_type == OP_LEAVE)
5873 other = newUNOP(OP_NULL, OPf_SPECIAL, other);
5874 else if (other->op_type == OP_MATCH
5875 || other->op_type == OP_SUBST
5876 || other->op_type == OP_TRANSR
5877 || other->op_type == OP_TRANS)
5878 /* Mark the op as being unbindable with =~ */
5879 other->op_flags |= OPf_SPECIAL;
5880 else if (other->op_type == OP_CONST)
5881 other->op_private |= OPpCONST_FOLDED;
5883 other->op_folded = 1;
5887 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
5888 const OP *o2 = other;
5889 if ( ! (o2->op_type == OP_LIST
5890 && (( o2 = cUNOPx(o2)->op_first))
5891 && o2->op_type == OP_PUSHMARK
5892 && (( o2 = o2->op_sibling)) )
5895 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
5896 || o2->op_type == OP_PADHV)
5897 && o2->op_private & OPpLVAL_INTRO
5898 && !(o2->op_private & OPpPAD_STATE))
5900 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
5901 "Deprecated use of my() in false conditional");
5905 if (first->op_type == OP_CONST)
5906 first->op_private |= OPpCONST_SHORTCIRCUIT;
5908 first = newUNOP(OP_NULL, 0, first);
5909 op_getmad(other, first, '2');
5910 first->op_targ = type; /* set "was" field */
5917 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
5918 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
5920 const OP * const k1 = ((UNOP*)first)->op_first;
5921 const OP * const k2 = k1->op_sibling;
5923 switch (first->op_type)
5926 if (k2 && k2->op_type == OP_READLINE
5927 && (k2->op_flags & OPf_STACKED)
5928 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5930 warnop = k2->op_type;
5935 if (k1->op_type == OP_READDIR
5936 || k1->op_type == OP_GLOB
5937 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5938 || k1->op_type == OP_EACH
5939 || k1->op_type == OP_AEACH)
5941 warnop = ((k1->op_type == OP_NULL)
5942 ? (OPCODE)k1->op_targ : k1->op_type);
5947 const line_t oldline = CopLINE(PL_curcop);
5948 /* This ensures that warnings are reported at the first line
5949 of the construction, not the last. */
5950 CopLINE_set(PL_curcop, PL_parser->copline);
5951 Perl_warner(aTHX_ packWARN(WARN_MISC),
5952 "Value of %s%s can be \"0\"; test with defined()",
5954 ((warnop == OP_READLINE || warnop == OP_GLOB)
5955 ? " construct" : "() operator"));
5956 CopLINE_set(PL_curcop, oldline);
5963 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
5964 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
5966 NewOp(1101, logop, 1, LOGOP);
5968 logop->op_type = (OPCODE)type;
5969 logop->op_ppaddr = PL_ppaddr[type];
5970 logop->op_first = first;
5971 logop->op_flags = (U8)(flags | OPf_KIDS);
5972 logop->op_other = LINKLIST(other);
5973 logop->op_private = (U8)(1 | (flags >> 8));
5975 /* establish postfix order */
5976 logop->op_next = LINKLIST(first);
5977 first->op_next = (OP*)logop;
5978 first->op_sibling = other;
5980 CHECKOP(type,logop);
5982 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
5989 =for apidoc Am|OP *|newCONDOP|I32 flags|OP *first|OP *trueop|OP *falseop
5991 Constructs, checks, and returns a conditional-expression (C<cond_expr>)
5992 op. I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5993 will be set automatically, and, shifted up eight bits, the eight bits of
5994 C<op_private>, except that the bit with value 1 is automatically set.
5995 I<first> supplies the expression selecting between the two branches,
5996 and I<trueop> and I<falseop> supply the branches; they are consumed by
5997 this function and become part of the constructed op tree.
6003 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
6011 PERL_ARGS_ASSERT_NEWCONDOP;
6014 return newLOGOP(OP_AND, 0, first, trueop);
6016 return newLOGOP(OP_OR, 0, first, falseop);
6018 scalarboolean(first);
6019 if ((cstop = search_const(first))) {
6020 /* Left or right arm of the conditional? */
6021 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
6022 OP *live = left ? trueop : falseop;
6023 OP *const dead = left ? falseop : trueop;
6024 if (cstop->op_private & OPpCONST_BARE &&
6025 cstop->op_private & OPpCONST_STRICT) {
6026 no_bareword_allowed(cstop);
6029 /* This is all dead code when PERL_MAD is not defined. */
6030 live = newUNOP(OP_NULL, 0, live);
6031 op_getmad(first, live, 'C');
6032 op_getmad(dead, live, left ? 'e' : 't');
6037 if (live->op_type == OP_LEAVE)
6038 live = newUNOP(OP_NULL, OPf_SPECIAL, live);
6039 else if (live->op_type == OP_MATCH || live->op_type == OP_SUBST
6040 || live->op_type == OP_TRANS || live->op_type == OP_TRANSR)
6041 /* Mark the op as being unbindable with =~ */
6042 live->op_flags |= OPf_SPECIAL;
6043 else if (live->op_type == OP_CONST)
6044 live->op_private |= OPpCONST_FOLDED;
6045 live->op_folded = 1;
6048 NewOp(1101, logop, 1, LOGOP);
6049 logop->op_type = OP_COND_EXPR;
6050 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
6051 logop->op_first = first;
6052 logop->op_flags = (U8)(flags | OPf_KIDS);
6053 logop->op_private = (U8)(1 | (flags >> 8));
6054 logop->op_other = LINKLIST(trueop);
6055 logop->op_next = LINKLIST(falseop);
6057 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
6060 /* establish postfix order */
6061 start = LINKLIST(first);
6062 first->op_next = (OP*)logop;
6064 first->op_sibling = trueop;
6065 trueop->op_sibling = falseop;
6066 o = newUNOP(OP_NULL, 0, (OP*)logop);
6068 trueop->op_next = falseop->op_next = o;
6075 =for apidoc Am|OP *|newRANGE|I32 flags|OP *left|OP *right
6077 Constructs and returns a C<range> op, with subordinate C<flip> and
6078 C<flop> ops. I<flags> gives the eight bits of C<op_flags> for the
6079 C<flip> op and, shifted up eight bits, the eight bits of C<op_private>
6080 for both the C<flip> and C<range> ops, except that the bit with value
6081 1 is automatically set. I<left> and I<right> supply the expressions
6082 controlling the endpoints of the range; they are consumed by this function
6083 and become part of the constructed op tree.
6089 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
6098 PERL_ARGS_ASSERT_NEWRANGE;
6100 NewOp(1101, range, 1, LOGOP);
6102 range->op_type = OP_RANGE;
6103 range->op_ppaddr = PL_ppaddr[OP_RANGE];
6104 range->op_first = left;
6105 range->op_flags = OPf_KIDS;
6106 leftstart = LINKLIST(left);
6107 range->op_other = LINKLIST(right);
6108 range->op_private = (U8)(1 | (flags >> 8));
6110 left->op_sibling = right;
6112 range->op_next = (OP*)range;
6113 flip = newUNOP(OP_FLIP, flags, (OP*)range);
6114 flop = newUNOP(OP_FLOP, 0, flip);
6115 o = newUNOP(OP_NULL, 0, flop);
6117 range->op_next = leftstart;
6119 left->op_next = flip;
6120 right->op_next = flop;
6122 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
6123 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
6124 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
6125 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
6127 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
6128 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
6130 /* check barewords before they might be optimized aways */
6131 if (flip->op_private && cSVOPx(left)->op_private & OPpCONST_STRICT)
6132 no_bareword_allowed(left);
6133 if (flop->op_private && cSVOPx(right)->op_private & OPpCONST_STRICT)
6134 no_bareword_allowed(right);
6137 if (!flip->op_private || !flop->op_private)
6138 LINKLIST(o); /* blow off optimizer unless constant */
6144 =for apidoc Am|OP *|newLOOPOP|I32 flags|I32 debuggable|OP *expr|OP *block
6146 Constructs, checks, and returns an op tree expressing a loop. This is
6147 only a loop in the control flow through the op tree; it does not have
6148 the heavyweight loop structure that allows exiting the loop by C<last>
6149 and suchlike. I<flags> gives the eight bits of C<op_flags> for the
6150 top-level op, except that some bits will be set automatically as required.
6151 I<expr> supplies the expression controlling loop iteration, and I<block>
6152 supplies the body of the loop; they are consumed by this function and
6153 become part of the constructed op tree. I<debuggable> is currently
6154 unused and should always be 1.
6160 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
6165 const bool once = block && block->op_flags & OPf_SPECIAL &&
6166 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
6168 PERL_UNUSED_ARG(debuggable);
6171 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
6172 return block; /* do {} while 0 does once */
6173 if (expr->op_type == OP_READLINE
6174 || expr->op_type == OP_READDIR
6175 || expr->op_type == OP_GLOB
6176 || expr->op_type == OP_EACH || expr->op_type == OP_AEACH
6177 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
6178 expr = newUNOP(OP_DEFINED, 0,
6179 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
6180 } else if (expr->op_flags & OPf_KIDS) {
6181 const OP * const k1 = ((UNOP*)expr)->op_first;
6182 const OP * const k2 = k1 ? k1->op_sibling : NULL;
6183 switch (expr->op_type) {
6185 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
6186 && (k2->op_flags & OPf_STACKED)
6187 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
6188 expr = newUNOP(OP_DEFINED, 0, expr);
6192 if (k1 && (k1->op_type == OP_READDIR
6193 || k1->op_type == OP_GLOB
6194 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
6195 || k1->op_type == OP_EACH
6196 || k1->op_type == OP_AEACH))
6197 expr = newUNOP(OP_DEFINED, 0, expr);
6203 /* if block is null, the next op_append_elem() would put UNSTACK, a scalar
6204 * op, in listop. This is wrong. [perl #27024] */
6206 block = newOP(OP_NULL, 0);
6207 listop = op_append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
6208 o = new_logop(OP_AND, 0, &expr, &listop);
6211 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
6213 if (once && o != listop)
6214 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
6217 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
6219 o->op_flags |= flags;
6221 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
6226 =for apidoc Am|OP *|newWHILEOP|I32 flags|I32 debuggable|LOOP *loop|OP *expr|OP *block|OP *cont|I32 has_my
6228 Constructs, checks, and returns an op tree expressing a C<while> loop.
6229 This is a heavyweight loop, with structure that allows exiting the loop
6230 by C<last> and suchlike.
6232 I<loop> is an optional preconstructed C<enterloop> op to use in the
6233 loop; if it is null then a suitable op will be constructed automatically.
6234 I<expr> supplies the loop's controlling expression. I<block> supplies the
6235 main body of the loop, and I<cont> optionally supplies a C<continue> block
6236 that operates as a second half of the body. All of these optree inputs
6237 are consumed by this function and become part of the constructed op tree.
6239 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
6240 op and, shifted up eight bits, the eight bits of C<op_private> for
6241 the C<leaveloop> op, except that (in both cases) some bits will be set
6242 automatically. I<debuggable> is currently unused and should always be 1.
6243 I<has_my> can be supplied as true to force the
6244 loop body to be enclosed in its own scope.
6250 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop,
6251 OP *expr, OP *block, OP *cont, I32 has_my)
6260 PERL_UNUSED_ARG(debuggable);
6263 if (expr->op_type == OP_READLINE
6264 || expr->op_type == OP_READDIR
6265 || expr->op_type == OP_GLOB
6266 || expr->op_type == OP_EACH || expr->op_type == OP_AEACH
6267 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
6268 expr = newUNOP(OP_DEFINED, 0,
6269 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
6270 } else if (expr->op_flags & OPf_KIDS) {
6271 const OP * const k1 = ((UNOP*)expr)->op_first;
6272 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
6273 switch (expr->op_type) {
6275 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
6276 && (k2->op_flags & OPf_STACKED)
6277 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
6278 expr = newUNOP(OP_DEFINED, 0, expr);
6282 if (k1 && (k1->op_type == OP_READDIR
6283 || k1->op_type == OP_GLOB
6284 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
6285 || k1->op_type == OP_EACH
6286 || k1->op_type == OP_AEACH))
6287 expr = newUNOP(OP_DEFINED, 0, expr);
6294 block = newOP(OP_NULL, 0);
6295 else if (cont || has_my) {
6296 block = op_scope(block);
6300 next = LINKLIST(cont);
6303 OP * const unstack = newOP(OP_UNSTACK, 0);
6306 cont = op_append_elem(OP_LINESEQ, cont, unstack);
6310 listop = op_append_list(OP_LINESEQ, block, cont);
6312 redo = LINKLIST(listop);
6316 o = new_logop(OP_AND, 0, &expr, &listop);
6317 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
6319 return expr; /* listop already freed by new_logop */
6322 ((LISTOP*)listop)->op_last->op_next =
6323 (o == listop ? redo : LINKLIST(o));
6329 NewOp(1101,loop,1,LOOP);
6330 loop->op_type = OP_ENTERLOOP;
6331 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
6332 loop->op_private = 0;
6333 loop->op_next = (OP*)loop;
6336 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
6338 loop->op_redoop = redo;
6339 loop->op_lastop = o;
6340 o->op_private |= loopflags;
6343 loop->op_nextop = next;
6345 loop->op_nextop = o;
6347 o->op_flags |= flags;
6348 o->op_private |= (flags >> 8);
6353 =for apidoc Am|OP *|newFOROP|I32 flags|OP *sv|OP *expr|OP *block|OP *cont
6355 Constructs, checks, and returns an op tree expressing a C<foreach>
6356 loop (iteration through a list of values). This is a heavyweight loop,
6357 with structure that allows exiting the loop by C<last> and suchlike.
6359 I<sv> optionally supplies the variable that will be aliased to each
6360 item in turn; if null, it defaults to C<$_> (either lexical or global).
6361 I<expr> supplies the list of values to iterate over. I<block> supplies
6362 the main body of the loop, and I<cont> optionally supplies a C<continue>
6363 block that operates as a second half of the body. All of these optree
6364 inputs are consumed by this function and become part of the constructed
6367 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
6368 op and, shifted up eight bits, the eight bits of C<op_private> for
6369 the C<leaveloop> op, except that (in both cases) some bits will be set
6376 Perl_newFOROP(pTHX_ I32 flags, OP *sv, OP *expr, OP *block, OP *cont)
6381 PADOFFSET padoff = 0;
6386 PERL_ARGS_ASSERT_NEWFOROP;
6389 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
6390 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
6391 sv->op_type = OP_RV2GV;
6392 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
6394 /* The op_type check is needed to prevent a possible segfault
6395 * if the loop variable is undeclared and 'strict vars' is in
6396 * effect. This is illegal but is nonetheless parsed, so we
6397 * may reach this point with an OP_CONST where we're expecting
6400 if (cUNOPx(sv)->op_first->op_type == OP_GV
6401 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
6402 iterpflags |= OPpITER_DEF;
6404 else if (sv->op_type == OP_PADSV) { /* private variable */
6405 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
6406 padoff = sv->op_targ;
6416 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
6418 SV *const namesv = PAD_COMPNAME_SV(padoff);
6420 const char *const name = SvPV_const(namesv, len);
6422 if (len == 2 && name[0] == '$' && name[1] == '_')
6423 iterpflags |= OPpITER_DEF;
6427 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
6428 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
6429 sv = newGVOP(OP_GV, 0, PL_defgv);
6434 iterpflags |= OPpITER_DEF;
6436 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
6437 expr = op_lvalue(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
6438 iterflags |= OPf_STACKED;
6440 else if (expr->op_type == OP_NULL &&
6441 (expr->op_flags & OPf_KIDS) &&
6442 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
6444 /* Basically turn for($x..$y) into the same as for($x,$y), but we
6445 * set the STACKED flag to indicate that these values are to be
6446 * treated as min/max values by 'pp_enteriter'.
6448 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
6449 LOGOP* const range = (LOGOP*) flip->op_first;
6450 OP* const left = range->op_first;
6451 OP* const right = left->op_sibling;
6454 range->op_flags &= ~OPf_KIDS;
6455 range->op_first = NULL;
6457 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
6458 listop->op_first->op_next = range->op_next;
6459 left->op_next = range->op_other;
6460 right->op_next = (OP*)listop;
6461 listop->op_next = listop->op_first;
6464 op_getmad(expr,(OP*)listop,'O');
6468 expr = (OP*)(listop);
6470 iterflags |= OPf_STACKED;
6473 expr = op_lvalue(force_list(expr), OP_GREPSTART);
6476 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
6477 op_append_elem(OP_LIST, expr, scalar(sv))));
6478 assert(!loop->op_next);
6479 /* for my $x () sets OPpLVAL_INTRO;
6480 * for our $x () sets OPpOUR_INTRO */
6481 loop->op_private = (U8)iterpflags;
6482 if (loop->op_slabbed
6483 && DIFF(loop, OpSLOT(loop)->opslot_next)
6484 < SIZE_TO_PSIZE(sizeof(LOOP)))
6487 NewOp(1234,tmp,1,LOOP);
6488 Copy(loop,tmp,1,LISTOP);
6489 S_op_destroy(aTHX_ (OP*)loop);
6492 else if (!loop->op_slabbed)
6493 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
6494 loop->op_targ = padoff;
6495 wop = newWHILEOP(flags, 1, loop, newOP(OP_ITER, 0), block, cont, 0);
6497 op_getmad(madsv, (OP*)loop, 'v');
6502 =for apidoc Am|OP *|newLOOPEX|I32 type|OP *label
6504 Constructs, checks, and returns a loop-exiting op (such as C<goto>
6505 or C<last>). I<type> is the opcode. I<label> supplies the parameter
6506 determining the target of the op; it is consumed by this function and
6507 becomes part of the constructed op tree.
6513 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
6518 PERL_ARGS_ASSERT_NEWLOOPEX;
6520 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
6522 if (type != OP_GOTO) {
6523 /* "last()" means "last" */
6524 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS)) {
6525 o = newOP(type, OPf_SPECIAL);
6529 /* Check whether it's going to be a goto &function */
6530 if (label->op_type == OP_ENTERSUB
6531 && !(label->op_flags & OPf_STACKED))
6532 label = newUNOP(OP_REFGEN, 0, op_lvalue(label, OP_REFGEN));
6535 /* Check for a constant argument */
6536 if (label->op_type == OP_CONST) {
6537 SV * const sv = ((SVOP *)label)->op_sv;
6539 const char *s = SvPV_const(sv,l);
6540 if (l == strlen(s)) {
6542 SvUTF8(((SVOP*)label)->op_sv),
6544 SvPV_nolen_const(((SVOP*)label)->op_sv)));
6548 /* If we have already created an op, we do not need the label. */
6551 op_getmad(label,o,'L');
6555 else o = newUNOP(type, OPf_STACKED, label);
6557 PL_hints |= HINT_BLOCK_SCOPE;
6561 /* if the condition is a literal array or hash
6562 (or @{ ... } etc), make a reference to it.
6565 S_ref_array_or_hash(pTHX_ OP *cond)
6568 && (cond->op_type == OP_RV2AV
6569 || cond->op_type == OP_PADAV
6570 || cond->op_type == OP_RV2HV
6571 || cond->op_type == OP_PADHV))
6573 return newUNOP(OP_REFGEN, 0, op_lvalue(cond, OP_REFGEN));
6576 && (cond->op_type == OP_ASLICE
6577 || cond->op_type == OP_HSLICE)) {
6579 /* anonlist now needs a list from this op, was previously used in
6581 cond->op_flags |= ~(OPf_WANT_SCALAR | OPf_REF);
6582 cond->op_flags |= OPf_WANT_LIST;
6584 return newANONLIST(op_lvalue(cond, OP_ANONLIST));
6591 /* These construct the optree fragments representing given()
6594 entergiven and enterwhen are LOGOPs; the op_other pointer
6595 points up to the associated leave op. We need this so we
6596 can put it in the context and make break/continue work.
6597 (Also, of course, pp_enterwhen will jump straight to
6598 op_other if the match fails.)
6602 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
6603 I32 enter_opcode, I32 leave_opcode,
6604 PADOFFSET entertarg)
6610 PERL_ARGS_ASSERT_NEWGIVWHENOP;
6612 NewOp(1101, enterop, 1, LOGOP);
6613 enterop->op_type = (Optype)enter_opcode;
6614 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
6615 enterop->op_flags = (U8) OPf_KIDS;
6616 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
6617 enterop->op_private = 0;
6619 o = newUNOP(leave_opcode, 0, (OP *) enterop);
6622 enterop->op_first = scalar(cond);
6623 cond->op_sibling = block;
6625 o->op_next = LINKLIST(cond);
6626 cond->op_next = (OP *) enterop;
6629 /* This is a default {} block */
6630 enterop->op_first = block;
6631 enterop->op_flags |= OPf_SPECIAL;
6632 o ->op_flags |= OPf_SPECIAL;
6634 o->op_next = (OP *) enterop;
6637 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
6638 entergiven and enterwhen both
6641 enterop->op_next = LINKLIST(block);
6642 block->op_next = enterop->op_other = o;
6647 /* Does this look like a boolean operation? For these purposes
6648 a boolean operation is:
6649 - a subroutine call [*]
6650 - a logical connective
6651 - a comparison operator
6652 - a filetest operator, with the exception of -s -M -A -C
6653 - defined(), exists() or eof()
6654 - /$re/ or $foo =~ /$re/
6656 [*] possibly surprising
6659 S_looks_like_bool(pTHX_ const OP *o)
6663 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
6665 switch(o->op_type) {
6668 return looks_like_bool(cLOGOPo->op_first);
6672 looks_like_bool(cLOGOPo->op_first)
6673 && looks_like_bool(cLOGOPo->op_first->op_sibling));
6678 o->op_flags & OPf_KIDS
6679 && looks_like_bool(cUNOPo->op_first));
6683 case OP_NOT: case OP_XOR:
6685 case OP_EQ: case OP_NE: case OP_LT:
6686 case OP_GT: case OP_LE: case OP_GE:
6688 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
6689 case OP_I_GT: case OP_I_LE: case OP_I_GE:
6691 case OP_SEQ: case OP_SNE: case OP_SLT:
6692 case OP_SGT: case OP_SLE: case OP_SGE:
6696 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
6697 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
6698 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
6699 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
6700 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
6701 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
6702 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
6703 case OP_FTTEXT: case OP_FTBINARY:
6705 case OP_DEFINED: case OP_EXISTS:
6706 case OP_MATCH: case OP_EOF:
6713 /* Detect comparisons that have been optimized away */
6714 if (cSVOPo->op_sv == &PL_sv_yes
6715 || cSVOPo->op_sv == &PL_sv_no)
6728 =for apidoc Am|OP *|newGIVENOP|OP *cond|OP *block|PADOFFSET defsv_off
6730 Constructs, checks, and returns an op tree expressing a C<given> block.
6731 I<cond> supplies the expression that will be locally assigned to a lexical
6732 variable, and I<block> supplies the body of the C<given> construct; they
6733 are consumed by this function and become part of the constructed op tree.
6734 I<defsv_off> is the pad offset of the scalar lexical variable that will
6735 be affected. If it is 0, the global $_ will be used.
6741 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
6744 PERL_ARGS_ASSERT_NEWGIVENOP;
6745 return newGIVWHENOP(
6746 ref_array_or_hash(cond),
6748 OP_ENTERGIVEN, OP_LEAVEGIVEN,
6753 =for apidoc Am|OP *|newWHENOP|OP *cond|OP *block
6755 Constructs, checks, and returns an op tree expressing a C<when> block.
6756 I<cond> supplies the test expression, and I<block> supplies the block
6757 that will be executed if the test evaluates to true; they are consumed
6758 by this function and become part of the constructed op tree. I<cond>
6759 will be interpreted DWIMically, often as a comparison against C<$_>,
6760 and may be null to generate a C<default> block.
6766 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
6768 const bool cond_llb = (!cond || looks_like_bool(cond));
6771 PERL_ARGS_ASSERT_NEWWHENOP;
6776 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
6778 scalar(ref_array_or_hash(cond)));
6781 return newGIVWHENOP(cond_op, block, OP_ENTERWHEN, OP_LEAVEWHEN, 0);
6785 Perl_cv_ckproto_len_flags(pTHX_ const CV *cv, const GV *gv, const char *p,
6786 const STRLEN len, const U32 flags)
6788 SV *name = NULL, *msg;
6789 const char * cvp = SvROK(cv) ? "" : CvPROTO(cv);
6790 STRLEN clen = CvPROTOLEN(cv), plen = len;
6792 PERL_ARGS_ASSERT_CV_CKPROTO_LEN_FLAGS;
6794 if (p == NULL && cvp == NULL)
6797 if (!ckWARN_d(WARN_PROTOTYPE))
6801 p = S_strip_spaces(aTHX_ p, &plen);
6802 cvp = S_strip_spaces(aTHX_ cvp, &clen);
6803 if ((flags & SVf_UTF8) == SvUTF8(cv)) {
6804 if (plen == clen && memEQ(cvp, p, plen))
6807 if (flags & SVf_UTF8) {
6808 if (bytes_cmp_utf8((const U8 *)cvp, clen, (const U8 *)p, plen) == 0)
6812 if (bytes_cmp_utf8((const U8 *)p, plen, (const U8 *)cvp, clen) == 0)
6818 msg = sv_newmortal();
6823 gv_efullname3(name = sv_newmortal(), gv, NULL);
6824 else if (SvPOK(gv) && *SvPVX((SV *)gv) == '&')
6825 name = newSVpvn_flags(SvPVX((SV *)gv)+1, SvCUR(gv)-1, SvUTF8(gv)|SVs_TEMP);
6826 else name = (SV *)gv;
6828 sv_setpvs(msg, "Prototype mismatch:");
6830 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
6832 Perl_sv_catpvf(aTHX_ msg, " (%"UTF8f")",
6833 UTF8fARG(SvUTF8(cv),clen,cvp)
6836 sv_catpvs(msg, ": none");
6837 sv_catpvs(msg, " vs ");
6839 Perl_sv_catpvf(aTHX_ msg, "(%"UTF8f")", UTF8fARG(flags & SVf_UTF8,len,p));
6841 sv_catpvs(msg, "none");
6842 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
6845 static void const_sv_xsub(pTHX_ CV* cv);
6846 static void const_av_xsub(pTHX_ CV* cv);
6850 =head1 Optree Manipulation Functions
6852 =for apidoc cv_const_sv
6854 If C<cv> is a constant sub eligible for inlining. returns the constant
6855 value returned by the sub. Otherwise, returns NULL.
6857 Constant subs can be created with C<newCONSTSUB> or as described in
6858 L<perlsub/"Constant Functions">.
6863 Perl_cv_const_sv(pTHX_ const CV *const cv)
6866 PERL_UNUSED_CONTEXT;
6869 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
6871 sv = CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
6872 if (sv && SvTYPE(sv) == SVt_PVAV) return NULL;
6877 Perl_cv_const_sv_or_av(pTHX_ const CV * const cv)
6879 PERL_UNUSED_CONTEXT;
6882 assert (SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM);
6883 return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
6886 /* op_const_sv: examine an optree to determine whether it's in-lineable.
6890 Perl_op_const_sv(pTHX_ const OP *o)
6901 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
6902 o = cLISTOPo->op_first->op_sibling;
6904 for (; o; o = o->op_next) {
6905 const OPCODE type = o->op_type;
6907 if (sv && o->op_next == o)
6909 if (o->op_next != o) {
6910 if (type == OP_NEXTSTATE
6911 || (type == OP_NULL && !(o->op_flags & OPf_KIDS))
6912 || type == OP_PUSHMARK)
6914 if (type == OP_DBSTATE)
6917 if (type == OP_LEAVESUB || type == OP_RETURN)
6921 if (type == OP_CONST && cSVOPo->op_sv)
6931 S_already_defined(pTHX_ CV *const cv, OP * const block, OP * const o,
6932 PADNAME * const name, SV ** const const_svp)
6939 || block->op_type == OP_NULL
6942 if (CvFLAGS(PL_compcv)) {
6943 /* might have had built-in attrs applied */
6944 const bool pureperl = !CvISXSUB(cv) && CvROOT(cv);
6945 if (CvLVALUE(PL_compcv) && ! CvLVALUE(cv) && pureperl
6946 && ckWARN(WARN_MISC))
6948 /* protect against fatal warnings leaking compcv */
6949 SAVEFREESV(PL_compcv);
6950 Perl_warner(aTHX_ packWARN(WARN_MISC), "lvalue attribute ignored after the subroutine has been defined");
6951 SvREFCNT_inc_simple_void_NN(PL_compcv);
6954 (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS
6955 & ~(CVf_LVALUE * pureperl));
6960 /* redundant check for speed: */
6961 if (CvCONST(cv) || ckWARN(WARN_REDEFINE)) {
6962 const line_t oldline = CopLINE(PL_curcop);
6965 : sv_2mortal(newSVpvn_utf8(
6966 PadnamePV(name)+1,PadnameLEN(name)-1, PadnameUTF8(name)
6968 if (PL_parser && PL_parser->copline != NOLINE)
6969 /* This ensures that warnings are reported at the first
6970 line of a redefinition, not the last. */
6971 CopLINE_set(PL_curcop, PL_parser->copline);
6972 /* protect against fatal warnings leaking compcv */
6973 SAVEFREESV(PL_compcv);
6974 report_redefined_cv(namesv, cv, const_svp);
6975 SvREFCNT_inc_simple_void_NN(PL_compcv);
6976 CopLINE_set(PL_curcop, oldline);
6979 if (!PL_minus_c) /* keep old one around for madskills */
6982 /* (PL_madskills unset in used file.) */
6989 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
6995 STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */
6998 CV *compcv = PL_compcv;
7001 PADOFFSET pax = o->op_targ;
7002 CV *outcv = CvOUTSIDE(PL_compcv);
7005 bool reusable = FALSE;
7007 PERL_ARGS_ASSERT_NEWMYSUB;
7009 /* Find the pad slot for storing the new sub.
7010 We cannot use PL_comppad, as it is the pad owned by the new sub. We
7011 need to look in CvOUTSIDE and find the pad belonging to the enclos-
7012 ing sub. And then we need to dig deeper if this is a lexical from
7014 my sub foo; sub { sub foo { } }
7017 name = PadlistNAMESARRAY(CvPADLIST(outcv))[pax];
7018 if (PadnameOUTER(name) && PARENT_PAD_INDEX(name)) {
7019 pax = PARENT_PAD_INDEX(name);
7020 outcv = CvOUTSIDE(outcv);
7025 &PadARRAY(PadlistARRAY(CvPADLIST(outcv))
7026 [CvDEPTH(outcv) ? CvDEPTH(outcv) : 1])[pax];
7027 spot = (CV **)svspot;
7030 assert(proto->op_type == OP_CONST);
7031 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
7032 ps_utf8 = SvUTF8(((SVOP*)proto)->op_sv);
7037 if (!PL_madskills) {
7044 if (PL_parser && PL_parser->error_count) {
7046 SvREFCNT_dec(PL_compcv);
7051 if (CvDEPTH(outcv) && CvCLONE(compcv)) {
7053 svspot = (SV **)(spot = &clonee);
7055 else if (PadnameIsSTATE(name) || CvDEPTH(outcv))
7059 SvUPGRADE(name, SVt_PVMG);
7060 mg = mg_find(name, PERL_MAGIC_proto);
7061 assert (SvTYPE(*spot) == SVt_PVCV);
7063 hek = CvNAME_HEK(*spot);
7065 CvNAME_HEK_set(*spot, hek =
7068 PadnameLEN(name)-1 * (PadnameUTF8(name) ? -1 : 1), 0
7074 cv = (CV *)mg->mg_obj;
7077 sv_magic(name, &PL_sv_undef, PERL_MAGIC_proto, NULL, 0);
7078 mg = mg_find(name, PERL_MAGIC_proto);
7080 spot = (CV **)(svspot = &mg->mg_obj);
7083 if (!block || !ps || *ps || attrs
7084 || (CvFLAGS(compcv) & CVf_BUILTIN_ATTRS)
7086 || block->op_type == OP_NULL
7091 const_sv = op_const_sv(block);
7094 const bool exists = CvROOT(cv) || CvXSUB(cv);
7096 /* if the subroutine doesn't exist and wasn't pre-declared
7097 * with a prototype, assume it will be AUTOLOADed,
7098 * skipping the prototype check
7100 if (exists || SvPOK(cv))
7101 cv_ckproto_len_flags(cv, (GV *)name, ps, ps_len, ps_utf8);
7102 /* already defined? */
7104 if (S_already_defined(aTHX_ cv, block, NULL, name, &const_sv))
7107 if (attrs) goto attrs;
7108 /* just a "sub foo;" when &foo is already defined */
7113 else if (CvDEPTH(outcv) && CvCLONE(compcv)) {
7119 SvREFCNT_inc_simple_void_NN(const_sv);
7120 SvFLAGS(const_sv) = (SvFLAGS(const_sv) & ~SVs_PADMY) | SVs_PADTMP;
7122 assert(!CvROOT(cv) && !CvCONST(cv));
7126 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7127 CvFILE_set_from_cop(cv, PL_curcop);
7128 CvSTASH_set(cv, PL_curstash);
7131 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
7132 CvXSUBANY(cv).any_ptr = const_sv;
7133 CvXSUB(cv) = const_sv_xsub;
7139 SvREFCNT_dec(compcv);
7143 /* Checking whether outcv is CvOUTSIDE(compcv) is not sufficient to
7144 determine whether this sub definition is in the same scope as its
7145 declaration. If this sub definition is inside an inner named pack-
7146 age sub (my sub foo; sub bar { sub foo { ... } }), outcv points to
7147 the package sub. So check PadnameOUTER(name) too.
7149 if (outcv == CvOUTSIDE(compcv) && !PadnameOUTER(name)) {
7150 assert(!CvWEAKOUTSIDE(compcv));
7151 SvREFCNT_dec(CvOUTSIDE(compcv));
7152 CvWEAKOUTSIDE_on(compcv);
7154 /* XXX else do we have a circular reference? */
7155 if (cv) { /* must reuse cv in case stub is referenced elsewhere */
7156 /* transfer PL_compcv to cv */
7159 && block->op_type != OP_NULL
7162 cv_flags_t preserved_flags =
7163 CvFLAGS(cv) & (CVf_BUILTIN_ATTRS|CVf_NAMED);
7164 PADLIST *const temp_padl = CvPADLIST(cv);
7165 CV *const temp_cv = CvOUTSIDE(cv);
7166 const cv_flags_t other_flags =
7167 CvFLAGS(cv) & (CVf_SLABBED|CVf_WEAKOUTSIDE);
7168 OP * const cvstart = CvSTART(cv);
7172 CvFLAGS(compcv) | preserved_flags;
7173 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
7174 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(compcv);
7175 CvPADLIST(cv) = CvPADLIST(compcv);
7176 CvOUTSIDE(compcv) = temp_cv;
7177 CvPADLIST(compcv) = temp_padl;
7178 CvSTART(cv) = CvSTART(compcv);
7179 CvSTART(compcv) = cvstart;
7180 CvFLAGS(compcv) &= ~(CVf_SLABBED|CVf_WEAKOUTSIDE);
7181 CvFLAGS(compcv) |= other_flags;
7183 if (CvFILE(cv) && CvDYNFILE(cv)) {
7184 Safefree(CvFILE(cv));
7187 /* inner references to compcv must be fixed up ... */
7188 pad_fixup_inner_anons(CvPADLIST(cv), compcv, cv);
7189 if (PERLDB_INTER)/* Advice debugger on the new sub. */
7190 ++PL_sub_generation;
7193 /* Might have had built-in attributes applied -- propagate them. */
7194 CvFLAGS(cv) |= (CvFLAGS(compcv) & CVf_BUILTIN_ATTRS);
7196 /* ... before we throw it away */
7197 SvREFCNT_dec(compcv);
7198 PL_compcv = compcv = cv;
7205 if (!CvNAME_HEK(cv)) {
7208 ? share_hek_hek(hek)
7209 : share_hek(PadnamePV(name)+1,
7210 PadnameLEN(name)-1 * (PadnameUTF8(name) ? -1 : 1),
7214 if (const_sv) goto clone;
7216 CvFILE_set_from_cop(cv, PL_curcop);
7217 CvSTASH_set(cv, PL_curstash);
7220 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
7221 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(cv));
7228 /* If we assign an optree to a PVCV, then we've defined a subroutine that
7229 the debugger could be able to set a breakpoint in, so signal to
7230 pp_entereval that it should not throw away any saved lines at scope
7233 PL_breakable_sub_gen++;
7234 /* This makes sub {}; work as expected. */
7235 if (block->op_type == OP_STUB) {
7236 OP* const newblock = newSTATEOP(0, NULL, 0);
7238 op_getmad(block,newblock,'B');
7244 CvROOT(cv) = CvLVALUE(cv)
7245 ? newUNOP(OP_LEAVESUBLV, 0,
7246 op_lvalue(scalarseq(block), OP_LEAVESUBLV))
7247 : newUNOP(OP_LEAVESUB, 0, scalarseq(block));
7248 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7249 OpREFCNT_set(CvROOT(cv), 1);
7250 /* The cv no longer needs to hold a refcount on the slab, as CvROOT
7251 itself has a refcount. */
7253 OpslabREFCNT_dec_padok((OPSLAB *)CvSTART(cv));
7254 CvSTART(cv) = LINKLIST(CvROOT(cv));
7255 CvROOT(cv)->op_next = 0;
7256 CALL_PEEP(CvSTART(cv));
7257 finalize_optree(CvROOT(cv));
7259 /* now that optimizer has done its work, adjust pad values */
7261 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
7265 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
7266 apply_attrs(PL_curstash, MUTABLE_SV(cv), attrs);
7270 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
7271 SV * const tmpstr = sv_newmortal();
7272 GV * const db_postponed = gv_fetchpvs("DB::postponed",
7273 GV_ADDMULTI, SVt_PVHV);
7275 SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld",
7278 (long)CopLINE(PL_curcop));
7279 if (HvNAME_HEK(PL_curstash)) {
7280 sv_sethek(tmpstr, HvNAME_HEK(PL_curstash));
7281 sv_catpvs(tmpstr, "::");
7283 else sv_setpvs(tmpstr, "__ANON__::");
7284 sv_catpvn_flags(tmpstr, PadnamePV(name)+1, PadnameLEN(name)-1,
7285 PadnameUTF8(name) ? SV_CATUTF8 : SV_CATBYTES);
7286 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
7287 SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr), sv, 0);
7288 hv = GvHVn(db_postponed);
7289 if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr))) {
7290 CV * const pcv = GvCV(db_postponed);
7296 call_sv(MUTABLE_SV(pcv), G_DISCARD);
7304 assert(CvDEPTH(outcv));
7306 &PadARRAY(PadlistARRAY(CvPADLIST(outcv))[CvDEPTH(outcv)])[pax];
7307 if (reusable) cv_clone_into(clonee, *spot);
7308 else *spot = cv_clone(clonee);
7309 SvREFCNT_dec_NN(clonee);
7313 if (CvDEPTH(outcv) && !reusable && PadnameIsSTATE(name)) {
7314 PADOFFSET depth = CvDEPTH(outcv);
7317 svspot = &PadARRAY(PadlistARRAY(CvPADLIST(outcv))[depth])[pax];
7319 *svspot = SvREFCNT_inc_simple_NN(cv);
7320 SvREFCNT_dec(oldcv);
7326 PL_parser->copline = NOLINE;
7333 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
7335 return newATTRSUB_flags(floor, o, proto, attrs, block, 0);
7339 Perl_newATTRSUB_flags(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs,
7340 OP *block, U32 flags)
7345 STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */
7349 const bool ec = PL_parser && PL_parser->error_count;
7350 /* If the subroutine has no body, no attributes, and no builtin attributes
7351 then it's just a sub declaration, and we may be able to get away with
7352 storing with a placeholder scalar in the symbol table, rather than a
7353 full GV and CV. If anything is present then it will take a full CV to
7355 const I32 gv_fetch_flags
7356 = ec ? GV_NOADD_NOINIT :
7357 (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
7359 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
7361 const bool o_is_gv = flags & 1;
7362 const char * const name =
7363 o ? SvPV_const(o_is_gv ? (SV *)o : cSVOPo->op_sv, namlen) : NULL;
7365 bool name_is_utf8 = o && !o_is_gv && SvUTF8(cSVOPo->op_sv);
7366 #ifdef PERL_DEBUG_READONLY_OPS
7367 OPSLAB *slab = NULL;
7371 assert(proto->op_type == OP_CONST);
7372 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
7373 ps_utf8 = SvUTF8(((SVOP*)proto)->op_sv);
7383 gv = gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV);
7385 } else if (PERLDB_NAMEANON && CopLINE(PL_curcop)) {
7386 SV * const sv = sv_newmortal();
7387 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
7388 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
7389 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7390 gv = gv_fetchsv(sv, gv_fetch_flags, SVt_PVCV);
7392 } else if (PL_curstash) {
7393 gv = gv_fetchpvs("__ANON__", gv_fetch_flags, SVt_PVCV);
7396 gv = gv_fetchpvs("__ANON__::__ANON__", gv_fetch_flags, SVt_PVCV);
7400 if (!PL_madskills) {
7411 if (name) SvREFCNT_dec(PL_compcv);
7412 else cv = PL_compcv;
7414 if (name && block) {
7415 const char *s = strrchr(name, ':');
7417 if (strEQ(s, "BEGIN")) {
7418 if (PL_in_eval & EVAL_KEEPERR)
7419 Perl_croak_nocontext("BEGIN not safe after errors--compilation aborted");
7421 SV * const errsv = ERRSV;
7422 /* force display of errors found but not reported */
7423 sv_catpvs(errsv, "BEGIN not safe after errors--compilation aborted");
7424 Perl_croak_nocontext("%"SVf, SVfARG(errsv));
7431 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
7432 maximum a prototype before. */
7433 if (SvTYPE(gv) > SVt_NULL) {
7434 cv_ckproto_len_flags((const CV *)gv,
7435 o ? (const GV *)cSVOPo->op_sv : NULL, ps,
7439 sv_setpvn(MUTABLE_SV(gv), ps, ps_len);
7440 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(gv));
7443 sv_setiv(MUTABLE_SV(gv), -1);
7445 SvREFCNT_dec(PL_compcv);
7446 cv = PL_compcv = NULL;
7450 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
7452 if (!block || !ps || *ps || attrs
7453 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
7455 || block->op_type == OP_NULL
7460 const_sv = op_const_sv(block);
7463 const bool exists = CvROOT(cv) || CvXSUB(cv);
7465 /* if the subroutine doesn't exist and wasn't pre-declared
7466 * with a prototype, assume it will be AUTOLOADed,
7467 * skipping the prototype check
7469 if (exists || SvPOK(cv))
7470 cv_ckproto_len_flags(cv, gv, ps, ps_len, ps_utf8);
7471 /* already defined (or promised)? */
7472 if (exists || GvASSUMECV(gv)) {
7473 if (S_already_defined(aTHX_ cv, block, o, NULL, &const_sv))
7476 if (attrs) goto attrs;
7477 /* just a "sub foo;" when &foo is already defined */
7478 SAVEFREESV(PL_compcv);
7484 SvREFCNT_inc_simple_void_NN(const_sv);
7485 SvFLAGS(const_sv) = (SvFLAGS(const_sv) & ~SVs_PADMY) | SVs_PADTMP;
7487 assert(!CvROOT(cv) && !CvCONST(cv));
7489 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
7490 CvXSUBANY(cv).any_ptr = const_sv;
7491 CvXSUB(cv) = const_sv_xsub;
7497 cv = newCONSTSUB_flags(
7498 NULL, name, namlen, name_is_utf8 ? SVf_UTF8 : 0,
7505 SvREFCNT_dec(PL_compcv);
7509 if (cv) { /* must reuse cv if autoloaded */
7510 /* transfer PL_compcv to cv */
7513 && block->op_type != OP_NULL
7516 cv_flags_t existing_builtin_attrs = CvFLAGS(cv) & CVf_BUILTIN_ATTRS;
7517 PADLIST *const temp_av = CvPADLIST(cv);
7518 CV *const temp_cv = CvOUTSIDE(cv);
7519 const cv_flags_t other_flags =
7520 CvFLAGS(cv) & (CVf_SLABBED|CVf_WEAKOUTSIDE);
7521 OP * const cvstart = CvSTART(cv);
7524 assert(!CvCVGV_RC(cv));
7525 assert(CvGV(cv) == gv);
7528 CvFLAGS(cv) = CvFLAGS(PL_compcv) | existing_builtin_attrs;
7529 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
7530 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
7531 CvPADLIST(cv) = CvPADLIST(PL_compcv);
7532 CvOUTSIDE(PL_compcv) = temp_cv;
7533 CvPADLIST(PL_compcv) = temp_av;
7534 CvSTART(cv) = CvSTART(PL_compcv);
7535 CvSTART(PL_compcv) = cvstart;
7536 CvFLAGS(PL_compcv) &= ~(CVf_SLABBED|CVf_WEAKOUTSIDE);
7537 CvFLAGS(PL_compcv) |= other_flags;
7539 if (CvFILE(cv) && CvDYNFILE(cv)) {
7540 Safefree(CvFILE(cv));
7542 CvFILE_set_from_cop(cv, PL_curcop);
7543 CvSTASH_set(cv, PL_curstash);
7545 /* inner references to PL_compcv must be fixed up ... */
7546 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
7547 if (PERLDB_INTER)/* Advice debugger on the new sub. */
7548 ++PL_sub_generation;
7551 /* Might have had built-in attributes applied -- propagate them. */
7552 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
7554 /* ... before we throw it away */
7555 SvREFCNT_dec(PL_compcv);
7563 if (HvENAME_HEK(GvSTASH(gv)))
7564 /* sub Foo::bar { (shift)+1 } */
7565 gv_method_changed(gv);
7570 CvFILE_set_from_cop(cv, PL_curcop);
7571 CvSTASH_set(cv, PL_curstash);
7575 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
7576 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(cv));
7583 /* If we assign an optree to a PVCV, then we've defined a subroutine that
7584 the debugger could be able to set a breakpoint in, so signal to
7585 pp_entereval that it should not throw away any saved lines at scope
7588 PL_breakable_sub_gen++;
7589 /* This makes sub {}; work as expected. */
7590 if (block->op_type == OP_STUB) {
7591 OP* const newblock = newSTATEOP(0, NULL, 0);
7593 op_getmad(block,newblock,'B');
7599 CvROOT(cv) = CvLVALUE(cv)
7600 ? newUNOP(OP_LEAVESUBLV, 0,
7601 op_lvalue(scalarseq(block), OP_LEAVESUBLV))
7602 : newUNOP(OP_LEAVESUB, 0, scalarseq(block));
7603 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7604 OpREFCNT_set(CvROOT(cv), 1);
7605 /* The cv no longer needs to hold a refcount on the slab, as CvROOT
7606 itself has a refcount. */
7608 OpslabREFCNT_dec_padok((OPSLAB *)CvSTART(cv));
7609 #ifdef PERL_DEBUG_READONLY_OPS
7610 slab = (OPSLAB *)CvSTART(cv);
7612 CvSTART(cv) = LINKLIST(CvROOT(cv));
7613 CvROOT(cv)->op_next = 0;
7614 CALL_PEEP(CvSTART(cv));
7615 finalize_optree(CvROOT(cv));
7617 /* now that optimizer has done its work, adjust pad values */
7619 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
7623 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
7624 HV *stash = name && GvSTASH(CvGV(cv)) ? GvSTASH(CvGV(cv)) : PL_curstash;
7625 if (!name) SAVEFREESV(cv);
7626 apply_attrs(stash, MUTABLE_SV(cv), attrs);
7627 if (!name) SvREFCNT_inc_simple_void_NN(cv);
7630 if (block && has_name) {
7631 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
7632 SV * const tmpstr = sv_newmortal();
7633 GV * const db_postponed = gv_fetchpvs("DB::postponed",
7634 GV_ADDMULTI, SVt_PVHV);
7636 SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld",
7639 (long)CopLINE(PL_curcop));
7640 gv_efullname3(tmpstr, gv, NULL);
7641 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
7642 SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr), sv, 0);
7643 hv = GvHVn(db_postponed);
7644 if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr))) {
7645 CV * const pcv = GvCV(db_postponed);
7651 call_sv(MUTABLE_SV(pcv), G_DISCARD);
7656 if (name && ! (PL_parser && PL_parser->error_count))
7657 process_special_blocks(floor, name, gv, cv);
7662 PL_parser->copline = NOLINE;
7664 #ifdef PERL_DEBUG_READONLY_OPS
7665 /* Watch out for BEGIN blocks */
7666 if (slab && gv && isGV(gv) && GvCV(gv)) Slab_to_ro(slab);
7672 S_process_special_blocks(pTHX_ I32 floor, const char *const fullname,
7676 const char *const colon = strrchr(fullname,':');
7677 const char *const name = colon ? colon + 1 : fullname;
7679 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
7682 if (strEQ(name, "BEGIN")) {
7683 const I32 oldscope = PL_scopestack_ix;
7684 if (floor) LEAVE_SCOPE(floor);
7686 SAVECOPFILE(&PL_compiling);
7687 SAVECOPLINE(&PL_compiling);
7688 SAVEVPTR(PL_curcop);
7690 DEBUG_x( dump_sub(gv) );
7691 Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv));
7692 GvCV_set(gv,0); /* cv has been hijacked */
7693 call_list(oldscope, PL_beginav);
7695 CopHINTS_set(&PL_compiling, PL_hints);
7702 if strEQ(name, "END") {
7703 DEBUG_x( dump_sub(gv) );
7704 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv));
7707 } else if (*name == 'U') {
7708 if (strEQ(name, "UNITCHECK")) {
7709 /* It's never too late to run a unitcheck block */
7710 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv));
7714 } else if (*name == 'C') {
7715 if (strEQ(name, "CHECK")) {
7717 /* diag_listed_as: Too late to run %s block */
7718 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
7719 "Too late to run CHECK block");
7720 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv));
7724 } else if (*name == 'I') {
7725 if (strEQ(name, "INIT")) {
7727 /* diag_listed_as: Too late to run %s block */
7728 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
7729 "Too late to run INIT block");
7730 Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv));
7736 DEBUG_x( dump_sub(gv) );
7737 GvCV_set(gv,0); /* cv has been hijacked */
7742 =for apidoc newCONSTSUB
7744 See L</newCONSTSUB_flags>.
7750 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
7752 return newCONSTSUB_flags(stash, name, name ? strlen(name) : 0, 0, sv);
7756 =for apidoc newCONSTSUB_flags
7758 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
7759 eligible for inlining at compile-time.
7761 Currently, the only useful value for C<flags> is SVf_UTF8.
7763 The newly created subroutine takes ownership of a reference to the passed in
7766 Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>,
7767 which won't be called if used as a destructor, but will suppress the overhead
7768 of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at
7775 Perl_newCONSTSUB_flags(pTHX_ HV *stash, const char *name, STRLEN len,
7780 const char *const file = CopFILE(PL_curcop);
7784 if (IN_PERL_RUNTIME) {
7785 /* at runtime, it's not safe to manipulate PL_curcop: it may be
7786 * an op shared between threads. Use a non-shared COP for our
7788 SAVEVPTR(PL_curcop);
7789 SAVECOMPILEWARNINGS();
7790 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
7791 PL_curcop = &PL_compiling;
7793 SAVECOPLINE(PL_curcop);
7794 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
7797 PL_hints &= ~HINT_BLOCK_SCOPE;
7800 SAVEGENERICSV(PL_curstash);
7801 PL_curstash = (HV *)SvREFCNT_inc_simple_NN(stash);
7804 /* Protect sv against leakage caused by fatal warnings. */
7805 if (sv) SAVEFREESV(sv);
7807 /* file becomes the CvFILE. For an XS, it's usually static storage,
7808 and so doesn't get free()d. (It's expected to be from the C pre-
7809 processor __FILE__ directive). But we need a dynamically allocated one,
7810 and we need it to get freed. */
7811 cv = newXS_len_flags(name, len,
7812 sv && SvTYPE(sv) == SVt_PVAV
7815 file ? file : "", "",
7816 &sv, XS_DYNAMIC_FILENAME | flags);
7817 CvXSUBANY(cv).any_ptr = SvREFCNT_inc_simple(sv);
7826 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
7827 const char *const filename, const char *const proto,
7830 PERL_ARGS_ASSERT_NEWXS_FLAGS;
7831 return newXS_len_flags(
7832 name, name ? strlen(name) : 0, subaddr, filename, proto, NULL, flags
7837 Perl_newXS_len_flags(pTHX_ const char *name, STRLEN len,
7838 XSUBADDR_t subaddr, const char *const filename,
7839 const char *const proto, SV **const_svp,
7844 PERL_ARGS_ASSERT_NEWXS_LEN_FLAGS;
7847 GV * const gv = gv_fetchpvn(
7848 name ? name : PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
7849 name ? len : PL_curstash ? sizeof("__ANON__") - 1:
7850 sizeof("__ANON__::__ANON__") - 1,
7851 GV_ADDMULTI | flags, SVt_PVCV);
7854 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
7856 if ((cv = (name ? GvCV(gv) : NULL))) {
7858 /* just a cached method */
7862 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
7863 /* already defined (or promised) */
7864 /* Redundant check that allows us to avoid creating an SV
7865 most of the time: */
7866 if (CvCONST(cv) || ckWARN(WARN_REDEFINE)) {
7867 report_redefined_cv(newSVpvn_flags(
7868 name,len,(flags&SVf_UTF8)|SVs_TEMP
7872 SvREFCNT_dec_NN(cv);
7877 if (cv) /* must reuse cv if autoloaded */
7880 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7884 if (HvENAME_HEK(GvSTASH(gv)))
7885 gv_method_changed(gv); /* newXS */
7891 (void)gv_fetchfile(filename);
7892 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
7893 an external constant string */
7894 assert(!CvDYNFILE(cv)); /* cv_undef should have turned it off */
7896 CvXSUB(cv) = subaddr;
7899 process_special_blocks(0, name, gv, cv);
7902 if (flags & XS_DYNAMIC_FILENAME) {
7903 CvFILE(cv) = savepv(filename);
7906 sv_setpv(MUTABLE_SV(cv), proto);
7911 Perl_newSTUB(pTHX_ GV *gv, bool fake)
7913 CV *cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7915 PERL_ARGS_ASSERT_NEWSTUB;
7919 if (!fake && HvENAME_HEK(GvSTASH(gv)))
7920 gv_method_changed(gv);
7922 cvgv = gv_fetchsv((SV *)gv, GV_ADDMULTI, SVt_PVCV);
7927 CvFILE_set_from_cop(cv, PL_curcop);
7928 CvSTASH_set(cv, PL_curstash);
7934 =for apidoc U||newXS
7936 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
7937 static storage, as it is used directly as CvFILE(), without a copy being made.
7943 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
7945 PERL_ARGS_ASSERT_NEWXS;
7946 return newXS_len_flags(
7947 name, name ? strlen(name) : 0, subaddr, filename, NULL, NULL, 0
7956 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
7961 OP* pegop = newOP(OP_NULL, 0);
7966 if (PL_parser && PL_parser->error_count) {
7972 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
7973 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
7976 if ((cv = GvFORM(gv))) {
7977 if (ckWARN(WARN_REDEFINE)) {
7978 const line_t oldline = CopLINE(PL_curcop);
7979 if (PL_parser && PL_parser->copline != NOLINE)
7980 CopLINE_set(PL_curcop, PL_parser->copline);
7982 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
7983 "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv));
7985 /* diag_listed_as: Format %s redefined */
7986 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
7987 "Format STDOUT redefined");
7989 CopLINE_set(PL_curcop, oldline);
7994 GvFORM(gv) = (CV *)SvREFCNT_inc_simple_NN(cv);
7996 CvFILE_set_from_cop(cv, PL_curcop);
7999 pad_tidy(padtidy_FORMAT);
8000 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
8001 CvROOT(cv)->op_private |= OPpREFCOUNTED;
8002 OpREFCNT_set(CvROOT(cv), 1);
8003 CvSTART(cv) = LINKLIST(CvROOT(cv));
8004 CvROOT(cv)->op_next = 0;
8005 CALL_PEEP(CvSTART(cv));
8006 finalize_optree(CvROOT(cv));
8011 op_getmad(o,pegop,'n');
8012 op_getmad_weak(block, pegop, 'b');
8017 PL_parser->copline = NOLINE;
8025 Perl_newANONLIST(pTHX_ OP *o)
8027 return convert(OP_ANONLIST, OPf_SPECIAL, o);
8031 Perl_newANONHASH(pTHX_ OP *o)
8033 return convert(OP_ANONHASH, OPf_SPECIAL, o);
8037 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
8039 return newANONATTRSUB(floor, proto, NULL, block);
8043 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
8045 return newUNOP(OP_REFGEN, 0,
8046 newSVOP(OP_ANONCODE, 0,
8047 MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block))));
8051 Perl_oopsAV(pTHX_ OP *o)
8055 PERL_ARGS_ASSERT_OOPSAV;
8057 switch (o->op_type) {
8059 o->op_type = OP_PADAV;
8060 o->op_ppaddr = PL_ppaddr[OP_PADAV];
8061 return ref(o, OP_RV2AV);
8064 o->op_type = OP_RV2AV;
8065 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
8070 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
8077 Perl_oopsHV(pTHX_ OP *o)
8081 PERL_ARGS_ASSERT_OOPSHV;
8083 switch (o->op_type) {
8086 o->op_type = OP_PADHV;
8087 o->op_ppaddr = PL_ppaddr[OP_PADHV];
8088 return ref(o, OP_RV2HV);
8092 o->op_type = OP_RV2HV;
8093 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
8098 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
8105 Perl_newAVREF(pTHX_ OP *o)
8109 PERL_ARGS_ASSERT_NEWAVREF;
8111 if (o->op_type == OP_PADANY) {
8112 o->op_type = OP_PADAV;
8113 o->op_ppaddr = PL_ppaddr[OP_PADAV];
8116 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)) {
8117 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8118 "Using an array as a reference is deprecated");
8120 return newUNOP(OP_RV2AV, 0, scalar(o));
8124 Perl_newGVREF(pTHX_ I32 type, OP *o)
8126 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
8127 return newUNOP(OP_NULL, 0, o);
8128 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
8132 Perl_newHVREF(pTHX_ OP *o)
8136 PERL_ARGS_ASSERT_NEWHVREF;
8138 if (o->op_type == OP_PADANY) {
8139 o->op_type = OP_PADHV;
8140 o->op_ppaddr = PL_ppaddr[OP_PADHV];
8143 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)) {
8144 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8145 "Using a hash as a reference is deprecated");
8147 return newUNOP(OP_RV2HV, 0, scalar(o));
8151 Perl_newCVREF(pTHX_ I32 flags, OP *o)
8153 if (o->op_type == OP_PADANY) {
8155 o->op_type = OP_PADCV;
8156 o->op_ppaddr = PL_ppaddr[OP_PADCV];
8158 return newUNOP(OP_RV2CV, flags, scalar(o));
8162 Perl_newSVREF(pTHX_ OP *o)
8166 PERL_ARGS_ASSERT_NEWSVREF;
8168 if (o->op_type == OP_PADANY) {
8169 o->op_type = OP_PADSV;
8170 o->op_ppaddr = PL_ppaddr[OP_PADSV];
8173 return newUNOP(OP_RV2SV, 0, scalar(o));
8176 /* Check routines. See the comments at the top of this file for details
8177 * on when these are called */
8180 Perl_ck_anoncode(pTHX_ OP *o)
8182 PERL_ARGS_ASSERT_CK_ANONCODE;
8184 cSVOPo->op_targ = pad_add_anon((CV*)cSVOPo->op_sv, o->op_type);
8186 cSVOPo->op_sv = NULL;
8191 Perl_ck_bitop(pTHX_ OP *o)
8195 PERL_ARGS_ASSERT_CK_BITOP;
8197 o->op_private = (U8)(PL_hints & HINT_INTEGER);
8198 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
8199 && (o->op_type == OP_BIT_OR
8200 || o->op_type == OP_BIT_AND
8201 || o->op_type == OP_BIT_XOR))
8203 const OP * const left = cBINOPo->op_first;
8204 const OP * const right = left->op_sibling;
8205 if ((OP_IS_NUMCOMPARE(left->op_type) &&
8206 (left->op_flags & OPf_PARENS) == 0) ||
8207 (OP_IS_NUMCOMPARE(right->op_type) &&
8208 (right->op_flags & OPf_PARENS) == 0))
8209 Perl_ck_warner(aTHX_ packWARN(WARN_PRECEDENCE),
8210 "Possible precedence problem on bitwise %c operator",
8211 o->op_type == OP_BIT_OR ? '|'
8212 : o->op_type == OP_BIT_AND ? '&' : '^'
8218 PERL_STATIC_INLINE bool
8219 is_dollar_bracket(pTHX_ const OP * const o)
8222 return o->op_type == OP_RV2SV && o->op_flags & OPf_KIDS
8223 && (kid = cUNOPx(o)->op_first)
8224 && kid->op_type == OP_GV
8225 && strEQ(GvNAME(cGVOPx_gv(kid)), "[");
8229 Perl_ck_cmp(pTHX_ OP *o)
8231 PERL_ARGS_ASSERT_CK_CMP;
8232 if (ckWARN(WARN_SYNTAX)) {
8233 const OP *kid = cUNOPo->op_first;
8236 is_dollar_bracket(aTHX_ kid)
8237 && kid->op_sibling && kid->op_sibling->op_type == OP_CONST
8239 || ( kid->op_type == OP_CONST
8240 && (kid = kid->op_sibling) && is_dollar_bracket(aTHX_ kid))
8242 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
8243 "$[ used in %s (did you mean $] ?)", OP_DESC(o));
8249 Perl_ck_concat(pTHX_ OP *o)
8251 const OP * const kid = cUNOPo->op_first;
8253 PERL_ARGS_ASSERT_CK_CONCAT;
8254 PERL_UNUSED_CONTEXT;
8256 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
8257 !(kUNOP->op_first->op_flags & OPf_MOD))
8258 o->op_flags |= OPf_STACKED;
8263 Perl_ck_spair(pTHX_ OP *o)
8267 PERL_ARGS_ASSERT_CK_SPAIR;
8269 if (o->op_flags & OPf_KIDS) {
8272 const OPCODE type = o->op_type;
8273 o = modkids(ck_fun(o), type);
8274 kid = cUNOPo->op_first;
8275 newop = kUNOP->op_first->op_sibling;
8277 const OPCODE type = newop->op_type;
8278 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
8279 type == OP_PADAV || type == OP_PADHV ||
8280 type == OP_RV2AV || type == OP_RV2HV)
8284 op_getmad(kUNOP->op_first,newop,'K');
8286 op_free(kUNOP->op_first);
8288 kUNOP->op_first = newop;
8290 /* transforms OP_REFGEN into OP_SREFGEN, OP_CHOP into OP_SCHOP,
8291 * and OP_CHOMP into OP_SCHOMP */
8292 o->op_ppaddr = PL_ppaddr[++o->op_type];
8297 Perl_ck_delete(pTHX_ OP *o)
8299 PERL_ARGS_ASSERT_CK_DELETE;
8303 if (o->op_flags & OPf_KIDS) {
8304 OP * const kid = cUNOPo->op_first;
8305 switch (kid->op_type) {
8307 o->op_flags |= OPf_SPECIAL;
8310 o->op_private |= OPpSLICE;
8313 o->op_flags |= OPf_SPECIAL;
8318 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
8321 if (kid->op_private & OPpLVAL_INTRO)
8322 o->op_private |= OPpLVAL_INTRO;
8329 Perl_ck_die(pTHX_ OP *o)
8331 PERL_ARGS_ASSERT_CK_DIE;
8334 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
8340 Perl_ck_eof(pTHX_ OP *o)
8344 PERL_ARGS_ASSERT_CK_EOF;
8346 if (o->op_flags & OPf_KIDS) {
8348 if (cLISTOPo->op_first->op_type == OP_STUB) {
8350 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
8352 op_getmad(o,newop,'O');
8359 kid = cLISTOPo->op_first;
8360 if (kid->op_type == OP_RV2GV)
8361 kid->op_private |= OPpALLOW_FAKE;
8367 Perl_ck_eval(pTHX_ OP *o)
8371 PERL_ARGS_ASSERT_CK_EVAL;
8373 PL_hints |= HINT_BLOCK_SCOPE;
8374 if (o->op_flags & OPf_KIDS) {
8375 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8378 if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
8384 cUNOPo->op_first = 0;
8389 NewOp(1101, enter, 1, LOGOP);
8390 enter->op_type = OP_ENTERTRY;
8391 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
8392 enter->op_private = 0;
8394 /* establish postfix order */
8395 enter->op_next = (OP*)enter;
8397 o = op_prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
8398 o->op_type = OP_LEAVETRY;
8399 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
8400 enter->op_other = o;
8401 op_getmad(oldo,o,'O');
8410 const U8 priv = o->op_private;
8416 o = newUNOP(OP_ENTEREVAL, priv <<8, newDEFSVOP());
8417 op_getmad(oldo,o,'O');
8419 o->op_targ = (PADOFFSET)PL_hints;
8420 if (o->op_private & OPpEVAL_BYTES) o->op_targ &= ~HINT_UTF8;
8421 if ((PL_hints & HINT_LOCALIZE_HH) != 0
8422 && !(o->op_private & OPpEVAL_COPHH) && GvHV(PL_hintgv)) {
8423 /* Store a copy of %^H that pp_entereval can pick up. */
8424 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
8425 MUTABLE_SV(hv_copy_hints_hv(GvHV(PL_hintgv))));
8426 cUNOPo->op_first->op_sibling = hhop;
8427 o->op_private |= OPpEVAL_HAS_HH;
8429 if (!(o->op_private & OPpEVAL_BYTES)
8430 && FEATURE_UNIEVAL_IS_ENABLED)
8431 o->op_private |= OPpEVAL_UNICODE;
8436 Perl_ck_exit(pTHX_ OP *o)
8438 PERL_ARGS_ASSERT_CK_EXIT;
8441 HV * const table = GvHV(PL_hintgv);
8443 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
8444 if (svp && *svp && SvTRUE(*svp))
8445 o->op_private |= OPpEXIT_VMSISH;
8447 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
8453 Perl_ck_exec(pTHX_ OP *o)
8455 PERL_ARGS_ASSERT_CK_EXEC;
8457 if (o->op_flags & OPf_STACKED) {
8460 kid = cUNOPo->op_first->op_sibling;
8461 if (kid->op_type == OP_RV2GV)
8470 Perl_ck_exists(pTHX_ OP *o)
8474 PERL_ARGS_ASSERT_CK_EXISTS;
8477 if (o->op_flags & OPf_KIDS) {
8478 OP * const kid = cUNOPo->op_first;
8479 if (kid->op_type == OP_ENTERSUB) {
8480 (void) ref(kid, o->op_type);
8481 if (kid->op_type != OP_RV2CV
8482 && !(PL_parser && PL_parser->error_count))
8483 Perl_croak(aTHX_ "%s argument is not a subroutine name",
8485 o->op_private |= OPpEXISTS_SUB;
8487 else if (kid->op_type == OP_AELEM)
8488 o->op_flags |= OPf_SPECIAL;
8489 else if (kid->op_type != OP_HELEM)
8490 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine",
8498 Perl_ck_rvconst(pTHX_ OP *o)
8501 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8503 PERL_ARGS_ASSERT_CK_RVCONST;
8505 o->op_private |= (PL_hints & HINT_STRICT_REFS);
8506 if (o->op_type == OP_RV2CV)
8507 o->op_private &= ~1;
8509 if (kid->op_type == OP_CONST) {
8512 SV * const kidsv = kid->op_sv;
8514 /* Is it a constant from cv_const_sv()? */
8515 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
8516 SV * const rsv = SvRV(kidsv);
8517 const svtype type = SvTYPE(rsv);
8518 const char *badtype = NULL;
8520 switch (o->op_type) {
8522 if (type > SVt_PVMG)
8523 badtype = "a SCALAR";
8526 if (type != SVt_PVAV)
8527 badtype = "an ARRAY";
8530 if (type != SVt_PVHV)
8534 if (type != SVt_PVCV)
8539 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
8542 if (SvTYPE(kidsv) == SVt_PVAV) return o;
8543 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
8544 const char *badthing;
8545 switch (o->op_type) {
8547 badthing = "a SCALAR";
8550 badthing = "an ARRAY";
8553 badthing = "a HASH";
8561 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
8562 SVfARG(kidsv), badthing);
8565 * This is a little tricky. We only want to add the symbol if we
8566 * didn't add it in the lexer. Otherwise we get duplicate strict
8567 * warnings. But if we didn't add it in the lexer, we must at
8568 * least pretend like we wanted to add it even if it existed before,
8569 * or we get possible typo warnings. OPpCONST_ENTERED says
8570 * whether the lexer already added THIS instance of this symbol.
8572 iscv = (o->op_type == OP_RV2CV) * 2;
8574 gv = gv_fetchsv(kidsv,
8575 iscv | !(kid->op_private & OPpCONST_ENTERED),
8578 : o->op_type == OP_RV2SV
8580 : o->op_type == OP_RV2AV
8582 : o->op_type == OP_RV2HV
8585 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
8587 kid->op_type = OP_GV;
8588 SvREFCNT_dec(kid->op_sv);
8590 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
8591 assert (sizeof(PADOP) <= sizeof(SVOP));
8592 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
8593 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
8595 PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv)));
8597 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
8599 kid->op_private = 0;
8600 kid->op_ppaddr = PL_ppaddr[OP_GV];
8601 /* FAKE globs in the symbol table cause weird bugs (#77810) */
8609 Perl_ck_ftst(pTHX_ OP *o)
8612 const I32 type = o->op_type;
8614 PERL_ARGS_ASSERT_CK_FTST;
8616 if (o->op_flags & OPf_REF) {
8619 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
8620 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8621 const OPCODE kidtype = kid->op_type;
8623 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)
8624 && !kid->op_folded) {
8625 OP * const newop = newGVOP(type, OPf_REF,
8626 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
8628 op_getmad(o,newop,'O');
8634 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
8635 o->op_private |= OPpFT_ACCESS;
8636 if (PL_check[kidtype] == Perl_ck_ftst
8637 && kidtype != OP_STAT && kidtype != OP_LSTAT) {
8638 o->op_private |= OPpFT_STACKED;
8639 kid->op_private |= OPpFT_STACKING;
8640 if (kidtype == OP_FTTTY && (
8641 !(kid->op_private & OPpFT_STACKED)
8642 || kid->op_private & OPpFT_AFTER_t
8644 o->op_private |= OPpFT_AFTER_t;
8653 if (type == OP_FTTTY)
8654 o = newGVOP(type, OPf_REF, PL_stdingv);
8656 o = newUNOP(type, 0, newDEFSVOP());
8657 op_getmad(oldo,o,'O');
8663 Perl_ck_fun(pTHX_ OP *o)
8666 const int type = o->op_type;
8667 I32 oa = PL_opargs[type] >> OASHIFT;
8669 PERL_ARGS_ASSERT_CK_FUN;
8671 if (o->op_flags & OPf_STACKED) {
8672 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
8675 return no_fh_allowed(o);
8678 if (o->op_flags & OPf_KIDS) {
8679 OP **tokid = &cLISTOPo->op_first;
8680 OP *kid = cLISTOPo->op_first;
8683 bool seen_optional = FALSE;
8685 if (kid->op_type == OP_PUSHMARK ||
8686 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
8688 tokid = &kid->op_sibling;
8689 kid = kid->op_sibling;
8691 if (kid && kid->op_type == OP_COREARGS) {
8692 bool optional = FALSE;
8695 if (oa & OA_OPTIONAL) optional = TRUE;
8698 if (optional) o->op_private |= numargs;
8703 if (oa & OA_OPTIONAL || (oa & 7) == OA_LIST) {
8704 if (!kid && !seen_optional && PL_opargs[type] & OA_DEFGV)
8705 *tokid = kid = newDEFSVOP();
8706 seen_optional = TRUE;
8711 sibl = kid->op_sibling;
8713 if (!sibl && kid->op_type == OP_STUB) {
8720 /* list seen where single (scalar) arg expected? */
8721 if (numargs == 1 && !(oa >> 4)
8722 && kid->op_type == OP_LIST && type != OP_SCALAR)
8724 return too_many_arguments_pv(o,PL_op_desc[type], 0);
8737 if ((type == OP_PUSH || type == OP_UNSHIFT)
8738 && !kid->op_sibling)
8739 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
8740 "Useless use of %s with no values",
8743 if (kid->op_type == OP_CONST &&
8744 (kid->op_private & OPpCONST_BARE))
8746 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
8747 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
8748 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8749 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
8750 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
8752 op_getmad(kid,newop,'K');
8757 kid->op_sibling = sibl;
8760 else if (kid->op_type == OP_CONST
8761 && ( !SvROK(cSVOPx_sv(kid))
8762 || SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV )
8764 bad_type_pv(numargs, "array", PL_op_desc[type], 0, kid);
8765 /* Defer checks to run-time if we have a scalar arg */
8766 if (kid->op_type == OP_RV2AV || kid->op_type == OP_PADAV)
8767 op_lvalue(kid, type);
8771 if (kid->op_type == OP_CONST &&
8772 (kid->op_private & OPpCONST_BARE))
8774 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
8775 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
8776 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8777 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
8778 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
8780 op_getmad(kid,newop,'K');
8785 kid->op_sibling = sibl;
8788 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
8789 bad_type_pv(numargs, "hash", PL_op_desc[type], 0, kid);
8790 op_lvalue(kid, type);
8794 OP * const newop = newUNOP(OP_NULL, 0, kid);
8795 kid->op_sibling = 0;
8796 newop->op_next = newop;
8798 kid->op_sibling = sibl;
8803 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
8804 if (kid->op_type == OP_CONST &&
8805 (kid->op_private & OPpCONST_BARE))
8807 OP * const newop = newGVOP(OP_GV, 0,
8808 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
8809 if (!(o->op_private & 1) && /* if not unop */
8810 kid == cLISTOPo->op_last)
8811 cLISTOPo->op_last = newop;
8813 op_getmad(kid,newop,'K');
8819 else if (kid->op_type == OP_READLINE) {
8820 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
8821 bad_type_pv(numargs, "HANDLE", OP_DESC(o), 0, kid);
8824 I32 flags = OPf_SPECIAL;
8828 /* is this op a FH constructor? */
8829 if (is_handle_constructor(o,numargs)) {
8830 const char *name = NULL;
8833 bool want_dollar = TRUE;
8836 /* Set a flag to tell rv2gv to vivify
8837 * need to "prove" flag does not mean something
8838 * else already - NI-S 1999/05/07
8841 if (kid->op_type == OP_PADSV) {
8843 = PAD_COMPNAME_SV(kid->op_targ);
8844 name = SvPV_const(namesv, len);
8845 name_utf8 = SvUTF8(namesv);
8847 else if (kid->op_type == OP_RV2SV
8848 && kUNOP->op_first->op_type == OP_GV)
8850 GV * const gv = cGVOPx_gv(kUNOP->op_first);
8852 len = GvNAMELEN(gv);
8853 name_utf8 = GvNAMEUTF8(gv) ? SVf_UTF8 : 0;
8855 else if (kid->op_type == OP_AELEM
8856 || kid->op_type == OP_HELEM)
8859 OP *op = ((BINOP*)kid)->op_first;
8863 const char * const a =
8864 kid->op_type == OP_AELEM ?
8866 if (((op->op_type == OP_RV2AV) ||
8867 (op->op_type == OP_RV2HV)) &&
8868 (firstop = ((UNOP*)op)->op_first) &&
8869 (firstop->op_type == OP_GV)) {
8870 /* packagevar $a[] or $h{} */
8871 GV * const gv = cGVOPx_gv(firstop);
8879 else if (op->op_type == OP_PADAV
8880 || op->op_type == OP_PADHV) {
8881 /* lexicalvar $a[] or $h{} */
8882 const char * const padname =
8883 PAD_COMPNAME_PV(op->op_targ);
8892 name = SvPV_const(tmpstr, len);
8893 name_utf8 = SvUTF8(tmpstr);
8898 name = "__ANONIO__";
8900 want_dollar = FALSE;
8902 op_lvalue(kid, type);
8906 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
8907 namesv = PAD_SVl(targ);
8908 SvUPGRADE(namesv, SVt_PV);
8909 if (want_dollar && *name != '$')
8910 sv_setpvs(namesv, "$");
8911 sv_catpvn(namesv, name, len);
8912 if ( name_utf8 ) SvUTF8_on(namesv);
8915 kid->op_sibling = 0;
8916 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
8917 kid->op_targ = targ;
8918 kid->op_private |= priv;
8920 kid->op_sibling = sibl;
8926 if ((type == OP_UNDEF || type == OP_POS)
8927 && numargs == 1 && !(oa >> 4)
8928 && kid->op_type == OP_LIST)
8929 return too_many_arguments_pv(o,PL_op_desc[type], 0);
8930 op_lvalue(scalar(kid), type);
8934 tokid = &kid->op_sibling;
8935 kid = kid->op_sibling;
8938 if (kid && kid->op_type != OP_STUB)
8939 return too_many_arguments_pv(o,OP_DESC(o), 0);
8940 o->op_private |= numargs;
8942 /* FIXME - should the numargs move as for the PERL_MAD case? */
8943 o->op_private |= numargs;
8945 return too_many_arguments_pv(o,OP_DESC(o), 0);
8949 else if (PL_opargs[type] & OA_DEFGV) {
8951 OP *newop = newUNOP(type, 0, newDEFSVOP());
8952 op_getmad(o,newop,'O');
8955 /* Ordering of these two is important to keep f_map.t passing. */
8957 return newUNOP(type, 0, newDEFSVOP());
8962 while (oa & OA_OPTIONAL)
8964 if (oa && oa != OA_LIST)
8965 return too_few_arguments_pv(o,OP_DESC(o), 0);
8971 Perl_ck_glob(pTHX_ OP *o)
8975 const bool core = o->op_flags & OPf_SPECIAL;
8977 PERL_ARGS_ASSERT_CK_GLOB;
8980 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
8981 op_append_elem(OP_GLOB, o, newDEFSVOP()); /* glob() => glob($_) */
8983 if (core) gv = NULL;
8984 else if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
8985 && GvCVu(gv) && GvIMPORTED_CV(gv)))
8987 GV * const * const gvp =
8988 (GV **)hv_fetchs(PL_globalstash, "glob", FALSE);
8989 gv = gvp ? *gvp : NULL;
8992 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
8995 * \ null - const(wildcard)
9000 * \ mark - glob - rv2cv
9001 * | \ gv(CORE::GLOBAL::glob)
9003 * \ null - const(wildcard)
9005 o->op_flags |= OPf_SPECIAL;
9006 o->op_targ = pad_alloc(OP_GLOB, SVs_PADTMP);
9007 o = newLISTOP(OP_LIST, 0, o, NULL);
9008 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
9009 op_append_elem(OP_LIST, o,
9010 scalar(newUNOP(OP_RV2CV, 0,
9011 newGVOP(OP_GV, 0, gv)))));
9012 o = newUNOP(OP_NULL, 0, o);
9013 o->op_targ = OP_GLOB; /* hint at what it used to be: eg in newWHILEOP */
9016 else o->op_flags &= ~OPf_SPECIAL;
9017 #if !defined(PERL_EXTERNAL_GLOB)
9020 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
9021 newSVpvs("File::Glob"), NULL, NULL, NULL);
9024 #endif /* !PERL_EXTERNAL_GLOB */
9025 gv = (GV *)newSV(0);
9026 gv_init(gv, 0, "", 0, 0);
9028 op_append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
9029 SvREFCNT_dec_NN(gv); /* newGVOP increased it */
9035 Perl_ck_grep(pTHX_ OP *o)
9040 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
9043 PERL_ARGS_ASSERT_CK_GREP;
9045 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
9046 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
9048 if (o->op_flags & OPf_STACKED) {
9049 kid = cUNOPx(cLISTOPo->op_first->op_sibling)->op_first;
9050 if (kid->op_type != OP_SCOPE && kid->op_type != OP_LEAVE)
9051 return no_fh_allowed(o);
9052 o->op_flags &= ~OPf_STACKED;
9054 kid = cLISTOPo->op_first->op_sibling;
9055 if (type == OP_MAPWHILE)
9060 if (PL_parser && PL_parser->error_count)
9062 kid = cLISTOPo->op_first->op_sibling;
9063 if (kid->op_type != OP_NULL)
9064 Perl_croak(aTHX_ "panic: ck_grep, type=%u", (unsigned) kid->op_type);
9065 kid = kUNOP->op_first;
9067 NewOp(1101, gwop, 1, LOGOP);
9068 gwop->op_type = type;
9069 gwop->op_ppaddr = PL_ppaddr[type];
9071 gwop->op_flags |= OPf_KIDS;
9072 gwop->op_other = LINKLIST(kid);
9073 kid->op_next = (OP*)gwop;
9074 offset = pad_findmy_pvs("$_", 0);
9075 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
9076 o->op_private = gwop->op_private = 0;
9077 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
9080 o->op_private = gwop->op_private = OPpGREP_LEX;
9081 gwop->op_targ = o->op_targ = offset;
9084 kid = cLISTOPo->op_first->op_sibling;
9085 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
9086 op_lvalue(kid, OP_GREPSTART);
9092 Perl_ck_index(pTHX_ OP *o)
9094 PERL_ARGS_ASSERT_CK_INDEX;
9096 if (o->op_flags & OPf_KIDS) {
9097 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9099 kid = kid->op_sibling; /* get past "big" */
9100 if (kid && kid->op_type == OP_CONST) {
9101 const bool save_taint = TAINT_get;
9102 SV *sv = kSVOP->op_sv;
9103 if ((!SvPOK(sv) || SvNIOKp(sv)) && SvOK(sv) && !SvROK(sv)) {
9105 sv_copypv(sv, kSVOP->op_sv);
9106 SvREFCNT_dec_NN(kSVOP->op_sv);
9109 if (SvOK(sv)) fbm_compile(sv, 0);
9110 TAINT_set(save_taint);
9111 #ifdef NO_TAINT_SUPPORT
9112 PERL_UNUSED_VAR(save_taint);
9120 Perl_ck_lfun(pTHX_ OP *o)
9122 const OPCODE type = o->op_type;
9124 PERL_ARGS_ASSERT_CK_LFUN;
9126 return modkids(ck_fun(o), type);
9130 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
9132 PERL_ARGS_ASSERT_CK_DEFINED;
9134 if ((o->op_flags & OPf_KIDS)) {
9135 switch (cUNOPo->op_first->op_type) {
9138 case OP_AASSIGN: /* Is this a good idea? */
9139 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9140 "defined(@array) is deprecated");
9141 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9142 "\t(Maybe you should just omit the defined()?)\n");
9146 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9147 "defined(%%hash) is deprecated");
9148 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9149 "\t(Maybe you should just omit the defined()?)\n");
9160 Perl_ck_readline(pTHX_ OP *o)
9162 PERL_ARGS_ASSERT_CK_READLINE;
9164 if (o->op_flags & OPf_KIDS) {
9165 OP *kid = cLISTOPo->op_first;
9166 if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE;
9170 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
9172 op_getmad(o,newop,'O');
9182 Perl_ck_rfun(pTHX_ OP *o)
9184 const OPCODE type = o->op_type;
9186 PERL_ARGS_ASSERT_CK_RFUN;
9188 return refkids(ck_fun(o), type);
9192 Perl_ck_listiob(pTHX_ OP *o)
9196 PERL_ARGS_ASSERT_CK_LISTIOB;
9198 kid = cLISTOPo->op_first;
9201 kid = cLISTOPo->op_first;
9203 if (kid->op_type == OP_PUSHMARK)
9204 kid = kid->op_sibling;
9205 if (kid && o->op_flags & OPf_STACKED)
9206 kid = kid->op_sibling;
9207 else if (kid && !kid->op_sibling) { /* print HANDLE; */
9208 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE
9209 && !kid->op_folded) {
9210 o->op_flags |= OPf_STACKED; /* make it a filehandle */
9211 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
9212 cLISTOPo->op_first->op_sibling = kid;
9213 cLISTOPo->op_last = kid;
9214 kid = kid->op_sibling;
9219 op_append_elem(o->op_type, o, newDEFSVOP());
9221 if (o->op_type == OP_PRTF) return modkids(listkids(o), OP_PRTF);
9226 Perl_ck_smartmatch(pTHX_ OP *o)
9229 PERL_ARGS_ASSERT_CK_SMARTMATCH;
9230 if (0 == (o->op_flags & OPf_SPECIAL)) {
9231 OP *first = cBINOPo->op_first;
9232 OP *second = first->op_sibling;
9234 /* Implicitly take a reference to an array or hash */
9235 first->op_sibling = NULL;
9236 first = cBINOPo->op_first = ref_array_or_hash(first);
9237 second = first->op_sibling = ref_array_or_hash(second);
9239 /* Implicitly take a reference to a regular expression */
9240 if (first->op_type == OP_MATCH) {
9241 first->op_type = OP_QR;
9242 first->op_ppaddr = PL_ppaddr[OP_QR];
9244 if (second->op_type == OP_MATCH) {
9245 second->op_type = OP_QR;
9246 second->op_ppaddr = PL_ppaddr[OP_QR];
9255 Perl_ck_sassign(pTHX_ OP *o)
9258 OP * const kid = cLISTOPo->op_first;
9260 PERL_ARGS_ASSERT_CK_SASSIGN;
9262 /* has a disposable target? */
9263 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
9264 && !(kid->op_flags & OPf_STACKED)
9265 /* Cannot steal the second time! */
9266 && !(kid->op_private & OPpTARGET_MY)
9267 /* Keep the full thing for madskills */
9271 OP * const kkid = kid->op_sibling;
9273 /* Can just relocate the target. */
9274 if (kkid && kkid->op_type == OP_PADSV
9275 && !(kkid->op_private & OPpLVAL_INTRO))
9277 kid->op_targ = kkid->op_targ;
9279 /* Now we do not need PADSV and SASSIGN. */
9280 kid->op_sibling = o->op_sibling; /* NULL */
9281 cLISTOPo->op_first = NULL;
9284 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
9288 if (kid->op_sibling) {
9289 OP *kkid = kid->op_sibling;
9290 /* For state variable assignment, kkid is a list op whose op_last
9292 if ((kkid->op_type == OP_PADSV ||
9293 (kkid->op_type == OP_LIST &&
9294 (kkid = cLISTOPx(kkid)->op_last)->op_type == OP_PADSV
9297 && (kkid->op_private & OPpLVAL_INTRO)
9298 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
9299 const PADOFFSET target = kkid->op_targ;
9300 OP *const other = newOP(OP_PADSV,
9302 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
9303 OP *const first = newOP(OP_NULL, 0);
9304 OP *const nullop = newCONDOP(0, first, o, other);
9305 OP *const condop = first->op_next;
9306 /* hijacking PADSTALE for uninitialized state variables */
9307 SvPADSTALE_on(PAD_SVl(target));
9309 condop->op_type = OP_ONCE;
9310 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
9311 condop->op_targ = target;
9312 other->op_targ = target;
9314 /* Because we change the type of the op here, we will skip the
9315 assignment binop->op_last = binop->op_first->op_sibling; at the
9316 end of Perl_newBINOP(). So need to do it here. */
9317 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
9326 Perl_ck_match(pTHX_ OP *o)
9330 PERL_ARGS_ASSERT_CK_MATCH;
9332 if (o->op_type != OP_QR && PL_compcv) {
9333 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
9334 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
9335 o->op_targ = offset;
9336 o->op_private |= OPpTARGET_MY;
9339 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
9340 o->op_private |= OPpRUNTIME;
9345 Perl_ck_method(pTHX_ OP *o)
9347 OP * const kid = cUNOPo->op_first;
9349 PERL_ARGS_ASSERT_CK_METHOD;
9351 if (kid->op_type == OP_CONST) {
9352 SV* sv = kSVOP->op_sv;
9353 const char * const method = SvPVX_const(sv);
9354 if (!(strchr(method, ':') || strchr(method, '\''))) {
9356 if (!SvIsCOW_shared_hash(sv)) {
9357 sv = newSVpvn_share(method, SvUTF8(sv) ? -(I32)SvCUR(sv) : (I32)SvCUR(sv), 0);
9360 kSVOP->op_sv = NULL;
9362 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
9364 op_getmad(o,cmop,'O');
9375 Perl_ck_null(pTHX_ OP *o)
9377 PERL_ARGS_ASSERT_CK_NULL;
9378 PERL_UNUSED_CONTEXT;
9383 Perl_ck_open(pTHX_ OP *o)
9386 HV * const table = GvHV(PL_hintgv);
9388 PERL_ARGS_ASSERT_CK_OPEN;
9391 SV **svp = hv_fetchs(table, "open_IN", FALSE);
9394 const char *d = SvPV_const(*svp, len);
9395 const I32 mode = mode_from_discipline(d, len);
9396 if (mode & O_BINARY)
9397 o->op_private |= OPpOPEN_IN_RAW;
9398 else if (mode & O_TEXT)
9399 o->op_private |= OPpOPEN_IN_CRLF;
9402 svp = hv_fetchs(table, "open_OUT", FALSE);
9405 const char *d = SvPV_const(*svp, len);
9406 const I32 mode = mode_from_discipline(d, len);
9407 if (mode & O_BINARY)
9408 o->op_private |= OPpOPEN_OUT_RAW;
9409 else if (mode & O_TEXT)
9410 o->op_private |= OPpOPEN_OUT_CRLF;
9413 if (o->op_type == OP_BACKTICK) {
9414 if (!(o->op_flags & OPf_KIDS)) {
9415 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
9417 op_getmad(o,newop,'O');
9426 /* In case of three-arg dup open remove strictness
9427 * from the last arg if it is a bareword. */
9428 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
9429 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
9433 if ((last->op_type == OP_CONST) && /* The bareword. */
9434 (last->op_private & OPpCONST_BARE) &&
9435 (last->op_private & OPpCONST_STRICT) &&
9436 (oa = first->op_sibling) && /* The fh. */
9437 (oa = oa->op_sibling) && /* The mode. */
9438 (oa->op_type == OP_CONST) &&
9439 SvPOK(((SVOP*)oa)->op_sv) &&
9440 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
9441 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
9442 (last == oa->op_sibling)) /* The bareword. */
9443 last->op_private &= ~OPpCONST_STRICT;
9449 Perl_ck_repeat(pTHX_ OP *o)
9451 PERL_ARGS_ASSERT_CK_REPEAT;
9453 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
9454 o->op_private |= OPpREPEAT_DOLIST;
9455 cBINOPo->op_first = force_list(cBINOPo->op_first);
9463 Perl_ck_require(pTHX_ OP *o)
9468 PERL_ARGS_ASSERT_CK_REQUIRE;
9470 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
9471 SVOP * const kid = (SVOP*)cUNOPo->op_first;
9473 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
9474 SV * const sv = kid->op_sv;
9475 U32 was_readonly = SvREADONLY(sv);
9483 if (SvIsCOW(sv)) sv_force_normal_flags(sv, 0);
9488 for (; s < end; s++) {
9489 if (*s == ':' && s[1] == ':') {
9491 Move(s+2, s+1, end - s - 1, char);
9496 sv_catpvs(sv, ".pm");
9497 SvFLAGS(sv) |= was_readonly;
9501 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
9502 /* handle override, if any */
9503 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
9504 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
9505 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
9506 gv = gvp ? *gvp : NULL;
9510 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
9512 if (o->op_flags & OPf_KIDS) {
9513 kid = cUNOPo->op_first;
9514 cUNOPo->op_first = NULL;
9522 newop = newUNOP(OP_ENTERSUB, OPf_STACKED,
9523 op_append_elem(OP_LIST, kid,
9524 scalar(newUNOP(OP_RV2CV, 0,
9527 op_getmad(o,newop,'O');
9531 return scalar(ck_fun(o));
9535 Perl_ck_return(pTHX_ OP *o)
9540 PERL_ARGS_ASSERT_CK_RETURN;
9542 kid = cLISTOPo->op_first->op_sibling;
9543 if (CvLVALUE(PL_compcv)) {
9544 for (; kid; kid = kid->op_sibling)
9545 op_lvalue(kid, OP_LEAVESUBLV);
9552 Perl_ck_select(pTHX_ OP *o)
9557 PERL_ARGS_ASSERT_CK_SELECT;
9559 if (o->op_flags & OPf_KIDS) {
9560 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9561 if (kid && kid->op_sibling) {
9562 o->op_type = OP_SSELECT;
9563 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
9565 return fold_constants(op_integerize(op_std_init(o)));
9569 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9570 if (kid && kid->op_type == OP_RV2GV)
9571 kid->op_private &= ~HINT_STRICT_REFS;
9576 Perl_ck_shift(pTHX_ OP *o)
9579 const I32 type = o->op_type;
9581 PERL_ARGS_ASSERT_CK_SHIFT;
9583 if (!(o->op_flags & OPf_KIDS)) {
9586 if (!CvUNIQUE(PL_compcv)) {
9587 o->op_flags |= OPf_SPECIAL;
9591 argop = newUNOP(OP_RV2AV, 0, scalar(newGVOP(OP_GV, 0, PL_argvgv)));
9594 OP * const oldo = o;
9595 o = newUNOP(type, 0, scalar(argop));
9596 op_getmad(oldo,o,'O');
9601 return newUNOP(type, 0, scalar(argop));
9604 return scalar(ck_fun(o));
9608 Perl_ck_sort(pTHX_ OP *o)
9614 PL_hints & HINT_LOCALIZE_HH ? GvHV(PL_hintgv) : NULL;
9617 PERL_ARGS_ASSERT_CK_SORT;
9620 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
9622 const I32 sorthints = (I32)SvIV(*svp);
9623 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
9624 o->op_private |= OPpSORT_QSORT;
9625 if ((sorthints & HINT_SORT_STABLE) != 0)
9626 o->op_private |= OPpSORT_STABLE;
9630 if (o->op_flags & OPf_STACKED)
9632 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9633 if ((stacked = o->op_flags & OPf_STACKED)) { /* may have been cleared */
9634 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
9636 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
9638 if (kid->op_type == OP_LEAVE)
9639 op_null(kid); /* wipe out leave */
9640 /* Prevent execution from escaping out of the sort block. */
9643 /* provide scalar context for comparison function/block */
9644 kid = scalar(firstkid);
9646 o->op_flags |= OPf_SPECIAL;
9649 firstkid = firstkid->op_sibling;
9652 for (kid = firstkid; kid; kid = kid->op_sibling) {
9653 /* provide list context for arguments */
9656 op_lvalue(kid, OP_GREPSTART);
9663 S_simplify_sort(pTHX_ OP *o)
9666 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9673 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
9675 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
9676 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
9677 kid = kUNOP->op_first; /* get past null */
9678 if (!(have_scopeop = kid->op_type == OP_SCOPE)
9679 && kid->op_type != OP_LEAVE)
9681 kid = kLISTOP->op_last; /* get past scope */
9682 switch(kid->op_type) {
9686 if (!have_scopeop) goto padkids;
9691 k = kid; /* remember this node*/
9692 if (kBINOP->op_first->op_type != OP_RV2SV
9693 || kBINOP->op_last ->op_type != OP_RV2SV)
9696 Warn about my($a) or my($b) in a sort block, *if* $a or $b is
9697 then used in a comparison. This catches most, but not
9698 all cases. For instance, it catches
9699 sort { my($a); $a <=> $b }
9701 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
9702 (although why you'd do that is anyone's guess).
9706 if (!ckWARN(WARN_SYNTAX)) return;
9707 kid = kBINOP->op_first;
9709 if (kid->op_type == OP_PADSV) {
9710 SV * const name = AvARRAY(PL_comppad_name)[kid->op_targ];
9711 if (SvCUR(name) == 2 && *SvPVX(name) == '$'
9712 && (SvPVX(name)[1] == 'a' || SvPVX(name)[1] == 'b'))
9713 /* diag_listed_as: "my %s" used in sort comparison */
9714 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
9715 "\"%s %s\" used in sort comparison",
9716 SvPAD_STATE(name) ? "state" : "my",
9719 } while ((kid = kid->op_sibling));
9722 kid = kBINOP->op_first; /* get past cmp */
9723 if (kUNOP->op_first->op_type != OP_GV)
9725 kid = kUNOP->op_first; /* get past rv2sv */
9727 if (GvSTASH(gv) != PL_curstash)
9729 gvname = GvNAME(gv);
9730 if (*gvname == 'a' && gvname[1] == '\0')
9732 else if (*gvname == 'b' && gvname[1] == '\0')
9737 kid = k; /* back to cmp */
9738 /* already checked above that it is rv2sv */
9739 kid = kBINOP->op_last; /* down to 2nd arg */
9740 if (kUNOP->op_first->op_type != OP_GV)
9742 kid = kUNOP->op_first; /* get past rv2sv */
9744 if (GvSTASH(gv) != PL_curstash)
9746 gvname = GvNAME(gv);
9748 ? !(*gvname == 'a' && gvname[1] == '\0')
9749 : !(*gvname == 'b' && gvname[1] == '\0'))
9751 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
9753 o->op_private |= OPpSORT_DESCEND;
9754 if (k->op_type == OP_NCMP)
9755 o->op_private |= OPpSORT_NUMERIC;
9756 if (k->op_type == OP_I_NCMP)
9757 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
9758 kid = cLISTOPo->op_first->op_sibling;
9759 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
9761 op_getmad(kid,o,'S'); /* then delete it */
9763 op_free(kid); /* then delete it */
9768 Perl_ck_split(pTHX_ OP *o)
9773 PERL_ARGS_ASSERT_CK_SPLIT;
9775 if (o->op_flags & OPf_STACKED)
9776 return no_fh_allowed(o);
9778 kid = cLISTOPo->op_first;
9779 if (kid->op_type != OP_NULL)
9780 Perl_croak(aTHX_ "panic: ck_split, type=%u", (unsigned) kid->op_type);
9781 kid = kid->op_sibling;
9782 op_free(cLISTOPo->op_first);
9784 cLISTOPo->op_first = kid;
9786 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
9787 cLISTOPo->op_last = kid; /* There was only one element previously */
9790 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
9791 OP * const sibl = kid->op_sibling;
9792 kid->op_sibling = 0;
9793 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0, 0); /* OPf_SPECIAL is used to trigger split " " behavior */
9794 if (cLISTOPo->op_first == cLISTOPo->op_last)
9795 cLISTOPo->op_last = kid;
9796 cLISTOPo->op_first = kid;
9797 kid->op_sibling = sibl;
9800 kid->op_type = OP_PUSHRE;
9801 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
9803 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
9804 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP),
9805 "Use of /g modifier is meaningless in split");
9808 if (!kid->op_sibling)
9809 op_append_elem(OP_SPLIT, o, newDEFSVOP());
9811 kid = kid->op_sibling;
9814 if (!kid->op_sibling)
9816 op_append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
9817 o->op_private |= OPpSPLIT_IMPLIM;
9819 assert(kid->op_sibling);
9821 kid = kid->op_sibling;
9824 if (kid->op_sibling)
9825 return too_many_arguments_pv(o,OP_DESC(o), 0);
9831 Perl_ck_join(pTHX_ OP *o)
9833 const OP * const kid = cLISTOPo->op_first->op_sibling;
9835 PERL_ARGS_ASSERT_CK_JOIN;
9837 if (kid && kid->op_type == OP_MATCH) {
9838 if (ckWARN(WARN_SYNTAX)) {
9839 const REGEXP *re = PM_GETRE(kPMOP);
9841 ? newSVpvn_flags( RX_PRECOMP_const(re), RX_PRELEN(re),
9842 SVs_TEMP | ( RX_UTF8(re) ? SVf_UTF8 : 0 ) )
9843 : newSVpvs_flags( "STRING", SVs_TEMP );
9844 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
9845 "/%"SVf"/ should probably be written as \"%"SVf"\"",
9846 SVfARG(msg), SVfARG(msg));
9853 =for apidoc Am|CV *|rv2cv_op_cv|OP *cvop|U32 flags
9855 Examines an op, which is expected to identify a subroutine at runtime,
9856 and attempts to determine at compile time which subroutine it identifies.
9857 This is normally used during Perl compilation to determine whether
9858 a prototype can be applied to a function call. I<cvop> is the op
9859 being considered, normally an C<rv2cv> op. A pointer to the identified
9860 subroutine is returned, if it could be determined statically, and a null
9861 pointer is returned if it was not possible to determine statically.
9863 Currently, the subroutine can be identified statically if the RV that the
9864 C<rv2cv> is to operate on is provided by a suitable C<gv> or C<const> op.
9865 A C<gv> op is suitable if the GV's CV slot is populated. A C<const> op is
9866 suitable if the constant value must be an RV pointing to a CV. Details of
9867 this process may change in future versions of Perl. If the C<rv2cv> op
9868 has the C<OPpENTERSUB_AMPER> flag set then no attempt is made to identify
9869 the subroutine statically: this flag is used to suppress compile-time
9870 magic on a subroutine call, forcing it to use default runtime behaviour.
9872 If I<flags> has the bit C<RV2CVOPCV_MARK_EARLY> set, then the handling
9873 of a GV reference is modified. If a GV was examined and its CV slot was
9874 found to be empty, then the C<gv> op has the C<OPpEARLY_CV> flag set.
9875 If the op is not optimised away, and the CV slot is later populated with
9876 a subroutine having a prototype, that flag eventually triggers the warning
9877 "called too early to check prototype".
9879 If I<flags> has the bit C<RV2CVOPCV_RETURN_NAME_GV> set, then instead
9880 of returning a pointer to the subroutine it returns a pointer to the
9881 GV giving the most appropriate name for the subroutine in this context.
9882 Normally this is just the C<CvGV> of the subroutine, but for an anonymous
9883 (C<CvANON>) subroutine that is referenced through a GV it will be the
9884 referencing GV. The resulting C<GV*> is cast to C<CV*> to be returned.
9885 A null pointer is returned as usual if there is no statically-determinable
9891 /* shared by toke.c:yylex */
9893 Perl_find_lexical_cv(pTHX_ PADOFFSET off)
9895 PADNAME *name = PAD_COMPNAME(off);
9896 CV *compcv = PL_compcv;
9897 while (PadnameOUTER(name)) {
9898 assert(PARENT_PAD_INDEX(name));
9899 compcv = CvOUTSIDE(PL_compcv);
9900 name = PadlistNAMESARRAY(CvPADLIST(compcv))
9901 [off = PARENT_PAD_INDEX(name)];
9903 assert(!PadnameIsOUR(name));
9904 if (!PadnameIsSTATE(name) && SvMAGICAL(name)) {
9905 MAGIC * mg = mg_find(name, PERL_MAGIC_proto);
9908 return (CV *)mg->mg_obj;
9910 return (CV *)AvARRAY(PadlistARRAY(CvPADLIST(compcv))[1])[off];
9914 Perl_rv2cv_op_cv(pTHX_ OP *cvop, U32 flags)
9919 PERL_ARGS_ASSERT_RV2CV_OP_CV;
9920 if (flags & ~(RV2CVOPCV_MARK_EARLY|RV2CVOPCV_RETURN_NAME_GV))
9921 Perl_croak(aTHX_ "panic: rv2cv_op_cv bad flags %x", (unsigned)flags);
9922 if (cvop->op_type != OP_RV2CV)
9924 if (cvop->op_private & OPpENTERSUB_AMPER)
9926 if (!(cvop->op_flags & OPf_KIDS))
9928 rvop = cUNOPx(cvop)->op_first;
9929 switch (rvop->op_type) {
9931 gv = cGVOPx_gv(rvop);
9934 if (flags & RV2CVOPCV_MARK_EARLY)
9935 rvop->op_private |= OPpEARLY_CV;
9940 SV *rv = cSVOPx_sv(rvop);
9947 cv = find_lexical_cv(rvop->op_targ);
9954 if (SvTYPE((SV*)cv) != SVt_PVCV)
9956 if (flags & RV2CVOPCV_RETURN_NAME_GV) {
9957 if (!CvANON(cv) || !gv)
9966 =for apidoc Am|OP *|ck_entersub_args_list|OP *entersubop
9968 Performs the default fixup of the arguments part of an C<entersub>
9969 op tree. This consists of applying list context to each of the
9970 argument ops. This is the standard treatment used on a call marked
9971 with C<&>, or a method call, or a call through a subroutine reference,
9972 or any other call where the callee can't be identified at compile time,
9973 or a call where the callee has no prototype.
9979 Perl_ck_entersub_args_list(pTHX_ OP *entersubop)
9982 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_LIST;
9983 aop = cUNOPx(entersubop)->op_first;
9984 if (!aop->op_sibling)
9985 aop = cUNOPx(aop)->op_first;
9986 for (aop = aop->op_sibling; aop->op_sibling; aop = aop->op_sibling) {
9987 if (!(PL_madskills && aop->op_type == OP_STUB)) {
9989 op_lvalue(aop, OP_ENTERSUB);
9996 =for apidoc Am|OP *|ck_entersub_args_proto|OP *entersubop|GV *namegv|SV *protosv
9998 Performs the fixup of the arguments part of an C<entersub> op tree
9999 based on a subroutine prototype. This makes various modifications to
10000 the argument ops, from applying context up to inserting C<refgen> ops,
10001 and checking the number and syntactic types of arguments, as directed by
10002 the prototype. This is the standard treatment used on a subroutine call,
10003 not marked with C<&>, where the callee can be identified at compile time
10004 and has a prototype.
10006 I<protosv> supplies the subroutine prototype to be applied to the call.
10007 It may be a normal defined scalar, of which the string value will be used.
10008 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
10009 that has been cast to C<SV*>) which has a prototype. The prototype
10010 supplied, in whichever form, does not need to match the actual callee
10011 referenced by the op tree.
10013 If the argument ops disagree with the prototype, for example by having
10014 an unacceptable number of arguments, a valid op tree is returned anyway.
10015 The error is reflected in the parser state, normally resulting in a single
10016 exception at the top level of parsing which covers all the compilation
10017 errors that occurred. In the error message, the callee is referred to
10018 by the name defined by the I<namegv> parameter.
10024 Perl_ck_entersub_args_proto(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
10027 const char *proto, *proto_end;
10028 OP *aop, *prev, *cvop;
10031 I32 contextclass = 0;
10032 const char *e = NULL;
10033 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO;
10034 if (SvTYPE(protosv) == SVt_PVCV ? !SvPOK(protosv) : !SvOK(protosv))
10035 Perl_croak(aTHX_ "panic: ck_entersub_args_proto CV with no proto, "
10036 "flags=%lx", (unsigned long) SvFLAGS(protosv));
10037 if (SvTYPE(protosv) == SVt_PVCV)
10038 proto = CvPROTO(protosv), proto_len = CvPROTOLEN(protosv);
10039 else proto = SvPV(protosv, proto_len);
10040 proto = S_strip_spaces(aTHX_ proto, &proto_len);
10041 proto_end = proto + proto_len;
10042 aop = cUNOPx(entersubop)->op_first;
10043 if (!aop->op_sibling)
10044 aop = cUNOPx(aop)->op_first;
10046 aop = aop->op_sibling;
10047 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
10048 while (aop != cvop) {
10050 if (PL_madskills && aop->op_type == OP_STUB) {
10051 aop = aop->op_sibling;
10054 if (PL_madskills && aop->op_type == OP_NULL)
10055 o3 = ((UNOP*)aop)->op_first;
10059 if (proto >= proto_end)
10060 return too_many_arguments_sv(entersubop, gv_ename(namegv), 0);
10068 /* _ must be at the end */
10069 if (proto[1] && !strchr(";@%", proto[1]))
10084 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
10086 arg == 1 ? "block or sub {}" : "sub {}",
10090 /* '*' allows any scalar type, including bareword */
10093 if (o3->op_type == OP_RV2GV)
10094 goto wrapref; /* autoconvert GLOB -> GLOBref */
10095 else if (o3->op_type == OP_CONST)
10096 o3->op_private &= ~OPpCONST_STRICT;
10097 else if (o3->op_type == OP_ENTERSUB) {
10098 /* accidental subroutine, revert to bareword */
10099 OP *gvop = ((UNOP*)o3)->op_first;
10100 if (gvop && gvop->op_type == OP_NULL) {
10101 gvop = ((UNOP*)gvop)->op_first;
10103 for (; gvop->op_sibling; gvop = gvop->op_sibling)
10106 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
10107 (gvop = ((UNOP*)gvop)->op_first) &&
10108 gvop->op_type == OP_GV)
10110 GV * const gv = cGVOPx_gv(gvop);
10111 OP * const sibling = aop->op_sibling;
10112 SV * const n = newSVpvs("");
10114 OP * const oldaop = aop;
10118 gv_fullname4(n, gv, "", FALSE);
10119 aop = newSVOP(OP_CONST, 0, n);
10120 op_getmad(oldaop,aop,'O');
10121 prev->op_sibling = aop;
10122 aop->op_sibling = sibling;
10132 if (o3->op_type == OP_RV2AV ||
10133 o3->op_type == OP_PADAV ||
10134 o3->op_type == OP_RV2HV ||
10135 o3->op_type == OP_PADHV
10141 case '[': case ']':
10148 switch (*proto++) {
10150 if (contextclass++ == 0) {
10151 e = strchr(proto, ']');
10152 if (!e || e == proto)
10160 if (contextclass) {
10161 const char *p = proto;
10162 const char *const end = proto;
10164 while (*--p != '[')
10165 /* \[$] accepts any scalar lvalue */
10167 && Perl_op_lvalue_flags(aTHX_
10169 OP_READ, /* not entersub */
10172 bad_type_gv(arg, Perl_form(aTHX_ "one of %.*s",
10173 (int)(end - p), p),
10179 if (o3->op_type == OP_RV2GV)
10182 bad_type_gv(arg, "symbol", namegv, 0, o3);
10185 if (o3->op_type == OP_ENTERSUB)
10188 bad_type_gv(arg, "subroutine entry", namegv, 0,
10192 if (o3->op_type == OP_RV2SV ||
10193 o3->op_type == OP_PADSV ||
10194 o3->op_type == OP_HELEM ||
10195 o3->op_type == OP_AELEM)
10197 if (!contextclass) {
10198 /* \$ accepts any scalar lvalue */
10199 if (Perl_op_lvalue_flags(aTHX_
10201 OP_READ, /* not entersub */
10204 bad_type_gv(arg, "scalar", namegv, 0, o3);
10208 if (o3->op_type == OP_RV2AV ||
10209 o3->op_type == OP_PADAV)
10212 bad_type_gv(arg, "array", namegv, 0, o3);
10215 if (o3->op_type == OP_RV2HV ||
10216 o3->op_type == OP_PADHV)
10219 bad_type_gv(arg, "hash", namegv, 0, o3);
10223 OP* const kid = aop;
10224 OP* const sib = kid->op_sibling;
10225 kid->op_sibling = 0;
10226 aop = newUNOP(OP_REFGEN, 0, kid);
10227 aop->op_sibling = sib;
10228 prev->op_sibling = aop;
10230 if (contextclass && e) {
10235 default: goto oops;
10245 SV* const tmpsv = sv_newmortal();
10246 gv_efullname3(tmpsv, namegv, NULL);
10247 Perl_croak(aTHX_ "Malformed prototype for %"SVf": %"SVf,
10248 SVfARG(tmpsv), SVfARG(protosv));
10252 op_lvalue(aop, OP_ENTERSUB);
10254 aop = aop->op_sibling;
10256 if (aop == cvop && *proto == '_') {
10257 /* generate an access to $_ */
10258 aop = newDEFSVOP();
10259 aop->op_sibling = prev->op_sibling;
10260 prev->op_sibling = aop; /* instead of cvop */
10262 if (!optional && proto_end > proto &&
10263 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
10264 return too_few_arguments_sv(entersubop, gv_ename(namegv), 0);
10269 =for apidoc Am|OP *|ck_entersub_args_proto_or_list|OP *entersubop|GV *namegv|SV *protosv
10271 Performs the fixup of the arguments part of an C<entersub> op tree either
10272 based on a subroutine prototype or using default list-context processing.
10273 This is the standard treatment used on a subroutine call, not marked
10274 with C<&>, where the callee can be identified at compile time.
10276 I<protosv> supplies the subroutine prototype to be applied to the call,
10277 or indicates that there is no prototype. It may be a normal scalar,
10278 in which case if it is defined then the string value will be used
10279 as a prototype, and if it is undefined then there is no prototype.
10280 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
10281 that has been cast to C<SV*>), of which the prototype will be used if it
10282 has one. The prototype (or lack thereof) supplied, in whichever form,
10283 does not need to match the actual callee referenced by the op tree.
10285 If the argument ops disagree with the prototype, for example by having
10286 an unacceptable number of arguments, a valid op tree is returned anyway.
10287 The error is reflected in the parser state, normally resulting in a single
10288 exception at the top level of parsing which covers all the compilation
10289 errors that occurred. In the error message, the callee is referred to
10290 by the name defined by the I<namegv> parameter.
10296 Perl_ck_entersub_args_proto_or_list(pTHX_ OP *entersubop,
10297 GV *namegv, SV *protosv)
10299 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO_OR_LIST;
10300 if (SvTYPE(protosv) == SVt_PVCV ? SvPOK(protosv) : SvOK(protosv))
10301 return ck_entersub_args_proto(entersubop, namegv, protosv);
10303 return ck_entersub_args_list(entersubop);
10307 Perl_ck_entersub_args_core(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
10309 int opnum = SvTYPE(protosv) == SVt_PVCV ? 0 : (int)SvUV(protosv);
10310 OP *aop = cUNOPx(entersubop)->op_first;
10312 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_CORE;
10316 if (!aop->op_sibling)
10317 aop = cUNOPx(aop)->op_first;
10318 aop = aop->op_sibling;
10319 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
10320 if (PL_madskills) while (aop != cvop && aop->op_type == OP_STUB) {
10321 aop = aop->op_sibling;
10324 (void)too_many_arguments_pv(entersubop, GvNAME(namegv), 0);
10326 op_free(entersubop);
10327 switch(GvNAME(namegv)[2]) {
10328 case 'F': return newSVOP(OP_CONST, 0,
10329 newSVpv(CopFILE(PL_curcop),0));
10330 case 'L': return newSVOP(
10332 Perl_newSVpvf(aTHX_
10333 "%"IVdf, (IV)CopLINE(PL_curcop)
10336 case 'P': return newSVOP(OP_CONST, 0,
10338 ? newSVhek(HvNAME_HEK(PL_curstash))
10349 bool seenarg = FALSE;
10351 if (!aop->op_sibling)
10352 aop = cUNOPx(aop)->op_first;
10355 aop = aop->op_sibling;
10356 prev->op_sibling = NULL;
10359 prev=cvop, cvop = cvop->op_sibling)
10361 if (PL_madskills && cvop->op_sibling
10362 && cvop->op_type != OP_STUB) seenarg = TRUE
10365 prev->op_sibling = NULL;
10366 flags = OPf_SPECIAL * !(cvop->op_private & OPpENTERSUB_NOPAREN);
10368 if (aop == cvop) aop = NULL;
10369 op_free(entersubop);
10371 if (opnum == OP_ENTEREVAL
10372 && GvNAMELEN(namegv)==9 && strnEQ(GvNAME(namegv), "evalbytes", 9))
10373 flags |= OPpEVAL_BYTES <<8;
10375 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
10377 case OA_BASEOP_OR_UNOP:
10378 case OA_FILESTATOP:
10379 return aop ? newUNOP(opnum,flags,aop) : newOP(opnum,flags);
10383 if (!PL_madskills || seenarg)
10385 (void)too_many_arguments_pv(aop, GvNAME(namegv), 0);
10388 return opnum == OP_RUNCV
10389 ? newPVOP(OP_RUNCV,0,NULL)
10392 return convert(opnum,0,aop);
10400 =for apidoc Am|void|cv_get_call_checker|CV *cv|Perl_call_checker *ckfun_p|SV **ckobj_p
10402 Retrieves the function that will be used to fix up a call to I<cv>.
10403 Specifically, the function is applied to an C<entersub> op tree for a
10404 subroutine call, not marked with C<&>, where the callee can be identified
10405 at compile time as I<cv>.
10407 The C-level function pointer is returned in I<*ckfun_p>, and an SV
10408 argument for it is returned in I<*ckobj_p>. The function is intended
10409 to be called in this manner:
10411 entersubop = (*ckfun_p)(aTHX_ entersubop, namegv, (*ckobj_p));
10413 In this call, I<entersubop> is a pointer to the C<entersub> op,
10414 which may be replaced by the check function, and I<namegv> is a GV
10415 supplying the name that should be used by the check function to refer
10416 to the callee of the C<entersub> op if it needs to emit any diagnostics.
10417 It is permitted to apply the check function in non-standard situations,
10418 such as to a call to a different subroutine or to a method call.
10420 By default, the function is
10421 L<Perl_ck_entersub_args_proto_or_list|/ck_entersub_args_proto_or_list>,
10422 and the SV parameter is I<cv> itself. This implements standard
10423 prototype processing. It can be changed, for a particular subroutine,
10424 by L</cv_set_call_checker>.
10430 Perl_cv_get_call_checker(pTHX_ CV *cv, Perl_call_checker *ckfun_p, SV **ckobj_p)
10433 PERL_ARGS_ASSERT_CV_GET_CALL_CHECKER;
10434 callmg = SvMAGICAL((SV*)cv) ? mg_find((SV*)cv, PERL_MAGIC_checkcall) : NULL;
10436 *ckfun_p = DPTR2FPTR(Perl_call_checker, callmg->mg_ptr);
10437 *ckobj_p = callmg->mg_obj;
10439 *ckfun_p = Perl_ck_entersub_args_proto_or_list;
10440 *ckobj_p = (SV*)cv;
10445 =for apidoc Am|void|cv_set_call_checker|CV *cv|Perl_call_checker ckfun|SV *ckobj
10447 Sets the function that will be used to fix up a call to I<cv>.
10448 Specifically, the function is applied to an C<entersub> op tree for a
10449 subroutine call, not marked with C<&>, where the callee can be identified
10450 at compile time as I<cv>.
10452 The C-level function pointer is supplied in I<ckfun>, and an SV argument
10453 for it is supplied in I<ckobj>. The function is intended to be called
10456 entersubop = ckfun(aTHX_ entersubop, namegv, ckobj);
10458 In this call, I<entersubop> is a pointer to the C<entersub> op,
10459 which may be replaced by the check function, and I<namegv> is a GV
10460 supplying the name that should be used by the check function to refer
10461 to the callee of the C<entersub> op if it needs to emit any diagnostics.
10462 It is permitted to apply the check function in non-standard situations,
10463 such as to a call to a different subroutine or to a method call.
10465 The current setting for a particular CV can be retrieved by
10466 L</cv_get_call_checker>.
10472 Perl_cv_set_call_checker(pTHX_ CV *cv, Perl_call_checker ckfun, SV *ckobj)
10474 PERL_ARGS_ASSERT_CV_SET_CALL_CHECKER;
10475 if (ckfun == Perl_ck_entersub_args_proto_or_list && ckobj == (SV*)cv) {
10476 if (SvMAGICAL((SV*)cv))
10477 mg_free_type((SV*)cv, PERL_MAGIC_checkcall);
10480 sv_magic((SV*)cv, &PL_sv_undef, PERL_MAGIC_checkcall, NULL, 0);
10481 callmg = mg_find((SV*)cv, PERL_MAGIC_checkcall);
10482 if (callmg->mg_flags & MGf_REFCOUNTED) {
10483 SvREFCNT_dec(callmg->mg_obj);
10484 callmg->mg_flags &= ~MGf_REFCOUNTED;
10486 callmg->mg_ptr = FPTR2DPTR(char *, ckfun);
10487 callmg->mg_obj = ckobj;
10488 if (ckobj != (SV*)cv) {
10489 SvREFCNT_inc_simple_void_NN(ckobj);
10490 callmg->mg_flags |= MGf_REFCOUNTED;
10492 callmg->mg_flags |= MGf_COPY;
10497 Perl_ck_subr(pTHX_ OP *o)
10503 PERL_ARGS_ASSERT_CK_SUBR;
10505 aop = cUNOPx(o)->op_first;
10506 if (!aop->op_sibling)
10507 aop = cUNOPx(aop)->op_first;
10508 aop = aop->op_sibling;
10509 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
10510 cv = rv2cv_op_cv(cvop, RV2CVOPCV_MARK_EARLY);
10511 namegv = cv ? (GV*)rv2cv_op_cv(cvop, RV2CVOPCV_RETURN_NAME_GV) : NULL;
10513 o->op_private &= ~1;
10514 o->op_private |= OPpENTERSUB_HASTARG;
10515 o->op_private |= (PL_hints & HINT_STRICT_REFS);
10516 if (PERLDB_SUB && PL_curstash != PL_debstash)
10517 o->op_private |= OPpENTERSUB_DB;
10518 if (cvop->op_type == OP_RV2CV) {
10519 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
10521 } else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
10522 if (aop->op_type == OP_CONST)
10523 aop->op_private &= ~OPpCONST_STRICT;
10524 else if (aop->op_type == OP_LIST) {
10525 OP * const sib = ((UNOP*)aop)->op_first->op_sibling;
10526 if (sib && sib->op_type == OP_CONST)
10527 sib->op_private &= ~OPpCONST_STRICT;
10532 return ck_entersub_args_list(o);
10534 Perl_call_checker ckfun;
10536 cv_get_call_checker(cv, &ckfun, &ckobj);
10537 if (!namegv) { /* expletive! */
10538 /* XXX The call checker API is public. And it guarantees that
10539 a GV will be provided with the right name. So we have
10540 to create a GV. But it is still not correct, as its
10541 stringification will include the package. What we
10542 really need is a new call checker API that accepts a
10543 GV or string (or GV or CV). */
10544 HEK * const hek = CvNAME_HEK(cv);
10545 /* After a syntax error in a lexical sub, the cv that
10546 rv2cv_op_cv returns may be a nameless stub. */
10547 if (!hek) return ck_entersub_args_list(o);;
10548 namegv = (GV *)sv_newmortal();
10549 gv_init_pvn(namegv, PL_curstash, HEK_KEY(hek), HEK_LEN(hek),
10550 SVf_UTF8 * !!HEK_UTF8(hek));
10552 return ckfun(aTHX_ o, namegv, ckobj);
10557 Perl_ck_svconst(pTHX_ OP *o)
10559 PERL_ARGS_ASSERT_CK_SVCONST;
10560 PERL_UNUSED_CONTEXT;
10561 #ifdef PERL_OLD_COPY_ON_WRITE
10562 if (SvIsCOW(cSVOPo->op_sv)) sv_force_normal(cSVOPo->op_sv);
10564 SvREADONLY_on(cSVOPo->op_sv);
10569 Perl_ck_trunc(pTHX_ OP *o)
10571 PERL_ARGS_ASSERT_CK_TRUNC;
10573 if (o->op_flags & OPf_KIDS) {
10574 SVOP *kid = (SVOP*)cUNOPo->op_first;
10576 if (kid->op_type == OP_NULL)
10577 kid = (SVOP*)kid->op_sibling;
10578 if (kid && kid->op_type == OP_CONST &&
10579 (kid->op_private & OPpCONST_BARE) &&
10582 o->op_flags |= OPf_SPECIAL;
10583 kid->op_private &= ~OPpCONST_STRICT;
10590 Perl_ck_substr(pTHX_ OP *o)
10592 PERL_ARGS_ASSERT_CK_SUBSTR;
10595 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
10596 OP *kid = cLISTOPo->op_first;
10598 if (kid->op_type == OP_NULL)
10599 kid = kid->op_sibling;
10601 kid->op_flags |= OPf_MOD;
10608 Perl_ck_tell(pTHX_ OP *o)
10610 PERL_ARGS_ASSERT_CK_TELL;
10612 if (o->op_flags & OPf_KIDS) {
10613 OP *kid = cLISTOPo->op_first;
10614 if (kid->op_type == OP_NULL && kid->op_sibling) kid = kid->op_sibling;
10615 if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE;
10621 Perl_ck_each(pTHX_ OP *o)
10624 OP *kid = o->op_flags & OPf_KIDS ? cUNOPo->op_first : NULL;
10625 const unsigned orig_type = o->op_type;
10626 const unsigned array_type = orig_type == OP_EACH ? OP_AEACH
10627 : orig_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
10628 const unsigned ref_type = orig_type == OP_EACH ? OP_REACH
10629 : orig_type == OP_KEYS ? OP_RKEYS : OP_RVALUES;
10631 PERL_ARGS_ASSERT_CK_EACH;
10634 switch (kid->op_type) {
10640 CHANGE_TYPE(o, array_type);
10643 if (kid->op_private == OPpCONST_BARE
10644 || !SvROK(cSVOPx_sv(kid))
10645 || ( SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV
10646 && SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVHV )
10648 /* we let ck_fun handle it */
10651 CHANGE_TYPE(o, ref_type);
10655 /* if treating as a reference, defer additional checks to runtime */
10656 return o->op_type == ref_type ? o : ck_fun(o);
10660 Perl_ck_length(pTHX_ OP *o)
10662 PERL_ARGS_ASSERT_CK_LENGTH;
10666 if (ckWARN(WARN_SYNTAX)) {
10667 const OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : NULL;
10671 const bool hash = kid->op_type == OP_PADHV
10672 || kid->op_type == OP_RV2HV;
10673 switch (kid->op_type) {
10677 (GV *)PL_compcv, hash ? '%' : '@', kid->op_targ,
10683 if (cUNOPx(kid)->op_first->op_type != OP_GV) break;
10685 GV *gv = cGVOPx_gv(cUNOPx(kid)->op_first);
10687 name = varname(gv, hash?'%':'@', 0, NULL, 0, 1);
10694 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10695 "length() used on %"SVf" (did you mean \"scalar(%s%"SVf
10697 name, hash ? "keys " : "", name
10700 /* diag_listed_as: length() used on %s (did you mean "scalar(%s)"?) */
10701 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10702 "length() used on %%hash (did you mean \"scalar(keys %%hash)\"?)");
10704 /* diag_listed_as: length() used on %s (did you mean "scalar(%s)"?) */
10705 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10706 "length() used on @array (did you mean \"scalar(@array)\"?)");
10713 /* Check for in place reverse and sort assignments like "@a = reverse @a"
10714 and modify the optree to make them work inplace */
10717 S_inplace_aassign(pTHX_ OP *o) {
10719 OP *modop, *modop_pushmark;
10721 OP *oleft, *oleft_pushmark;
10723 PERL_ARGS_ASSERT_INPLACE_AASSIGN;
10725 assert((o->op_flags & OPf_WANT) == OPf_WANT_VOID);
10727 assert(cUNOPo->op_first->op_type == OP_NULL);
10728 modop_pushmark = cUNOPx(cUNOPo->op_first)->op_first;
10729 assert(modop_pushmark->op_type == OP_PUSHMARK);
10730 modop = modop_pushmark->op_sibling;
10732 if (modop->op_type != OP_SORT && modop->op_type != OP_REVERSE)
10735 /* no other operation except sort/reverse */
10736 if (modop->op_sibling)
10739 assert(cUNOPx(modop)->op_first->op_type == OP_PUSHMARK);
10740 if (!(oright = cUNOPx(modop)->op_first->op_sibling)) return;
10742 if (modop->op_flags & OPf_STACKED) {
10743 /* skip sort subroutine/block */
10744 assert(oright->op_type == OP_NULL);
10745 oright = oright->op_sibling;
10748 assert(cUNOPo->op_first->op_sibling->op_type == OP_NULL);
10749 oleft_pushmark = cUNOPx(cUNOPo->op_first->op_sibling)->op_first;
10750 assert(oleft_pushmark->op_type == OP_PUSHMARK);
10751 oleft = oleft_pushmark->op_sibling;
10753 /* Check the lhs is an array */
10755 (oleft->op_type != OP_RV2AV && oleft->op_type != OP_PADAV)
10756 || oleft->op_sibling
10757 || (oleft->op_private & OPpLVAL_INTRO)
10761 /* Only one thing on the rhs */
10762 if (oright->op_sibling)
10765 /* check the array is the same on both sides */
10766 if (oleft->op_type == OP_RV2AV) {
10767 if (oright->op_type != OP_RV2AV
10768 || !cUNOPx(oright)->op_first
10769 || cUNOPx(oright)->op_first->op_type != OP_GV
10770 || cUNOPx(oleft )->op_first->op_type != OP_GV
10771 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
10772 cGVOPx_gv(cUNOPx(oright)->op_first)
10776 else if (oright->op_type != OP_PADAV
10777 || oright->op_targ != oleft->op_targ
10781 /* This actually is an inplace assignment */
10783 modop->op_private |= OPpSORT_INPLACE;
10785 /* transfer MODishness etc from LHS arg to RHS arg */
10786 oright->op_flags = oleft->op_flags;
10788 /* remove the aassign op and the lhs */
10790 op_null(oleft_pushmark);
10791 if (oleft->op_type == OP_RV2AV && cUNOPx(oleft)->op_first)
10792 op_null(cUNOPx(oleft)->op_first);
10796 #define MAX_DEFERRED 4
10800 if (defer_ix == (MAX_DEFERRED-1)) { \
10801 CALL_RPEEP(defer_queue[defer_base]); \
10802 defer_base = (defer_base + 1) % MAX_DEFERRED; \
10805 defer_queue[(defer_base + ++defer_ix) % MAX_DEFERRED] = o; \
10808 /* A peephole optimizer. We visit the ops in the order they're to execute.
10809 * See the comments at the top of this file for more details about when
10810 * peep() is called */
10813 Perl_rpeep(pTHX_ OP *o)
10817 OP* oldoldop = NULL;
10818 OP* defer_queue[MAX_DEFERRED]; /* small queue of deferred branches */
10819 int defer_base = 0;
10822 if (!o || o->op_opt)
10826 SAVEVPTR(PL_curcop);
10827 for (;; o = o->op_next) {
10828 if (o && o->op_opt)
10831 while (defer_ix >= 0)
10832 CALL_RPEEP(defer_queue[(defer_base + defer_ix--) % MAX_DEFERRED]);
10836 /* By default, this op has now been optimised. A couple of cases below
10837 clear this again. */
10840 switch (o->op_type) {
10842 PL_curcop = ((COP*)o); /* for warnings */
10845 PL_curcop = ((COP*)o); /* for warnings */
10847 /* Two NEXTSTATEs in a row serve no purpose. Except if they happen
10848 to carry two labels. For now, take the easier option, and skip
10849 this optimisation if the first NEXTSTATE has a label. */
10850 if (!CopLABEL((COP*)o) && !PERLDB_NOOPT) {
10851 OP *nextop = o->op_next;
10852 while (nextop && nextop->op_type == OP_NULL)
10853 nextop = nextop->op_next;
10855 if (nextop && (nextop->op_type == OP_NEXTSTATE)) {
10856 COP *firstcop = (COP *)o;
10857 COP *secondcop = (COP *)nextop;
10858 /* We want the COP pointed to by o (and anything else) to
10859 become the next COP down the line. */
10860 cop_free(firstcop);
10862 firstcop->op_next = secondcop->op_next;
10864 /* Now steal all its pointers, and duplicate the other
10866 firstcop->cop_line = secondcop->cop_line;
10867 #ifdef USE_ITHREADS
10868 firstcop->cop_stashoff = secondcop->cop_stashoff;
10869 firstcop->cop_file = secondcop->cop_file;
10871 firstcop->cop_stash = secondcop->cop_stash;
10872 firstcop->cop_filegv = secondcop->cop_filegv;
10874 firstcop->cop_hints = secondcop->cop_hints;
10875 firstcop->cop_seq = secondcop->cop_seq;
10876 firstcop->cop_warnings = secondcop->cop_warnings;
10877 firstcop->cop_hints_hash = secondcop->cop_hints_hash;
10879 #ifdef USE_ITHREADS
10880 secondcop->cop_stashoff = 0;
10881 secondcop->cop_file = NULL;
10883 secondcop->cop_stash = NULL;
10884 secondcop->cop_filegv = NULL;
10886 secondcop->cop_warnings = NULL;
10887 secondcop->cop_hints_hash = NULL;
10889 /* If we use op_null(), and hence leave an ex-COP, some
10890 warnings are misreported. For example, the compile-time
10891 error in 'use strict; no strict refs;' */
10892 secondcop->op_type = OP_NULL;
10893 secondcop->op_ppaddr = PL_ppaddr[OP_NULL];
10899 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
10900 if (o->op_next->op_private & OPpTARGET_MY) {
10901 if (o->op_flags & OPf_STACKED) /* chained concats */
10902 break; /* ignore_optimization */
10904 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
10905 o->op_targ = o->op_next->op_targ;
10906 o->op_next->op_targ = 0;
10907 o->op_private |= OPpTARGET_MY;
10910 op_null(o->op_next);
10914 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
10915 break; /* Scalar stub must produce undef. List stub is noop */
10919 if (o->op_targ == OP_NEXTSTATE
10920 || o->op_targ == OP_DBSTATE)
10922 PL_curcop = ((COP*)o);
10924 /* XXX: We avoid setting op_seq here to prevent later calls
10925 to rpeep() from mistakenly concluding that optimisation
10926 has already occurred. This doesn't fix the real problem,
10927 though (See 20010220.007). AMS 20010719 */
10928 /* op_seq functionality is now replaced by op_opt */
10935 if (oldop && o->op_next) {
10936 oldop->op_next = o->op_next;
10944 /* Convert a series of PAD ops for my vars plus support into a
10945 * single padrange op. Basically
10947 * pushmark -> pad[ahs]v -> pad[ahs]?v -> ... -> (list) -> rest
10949 * becomes, depending on circumstances, one of
10951 * padrange ----------------------------------> (list) -> rest
10952 * padrange --------------------------------------------> rest
10954 * where all the pad indexes are sequential and of the same type
10956 * We convert the pushmark into a padrange op, then skip
10957 * any other pad ops, and possibly some trailing ops.
10958 * Note that we don't null() the skipped ops, to make it
10959 * easier for Deparse to undo this optimisation (and none of
10960 * the skipped ops are holding any resourses). It also makes
10961 * it easier for find_uninit_var(), as it can just ignore
10962 * padrange, and examine the original pad ops.
10966 OP *followop = NULL; /* the op that will follow the padrange op */
10969 PADOFFSET base = 0; /* init only to stop compiler whining */
10970 U8 gimme = 0; /* init only to stop compiler whining */
10971 bool defav = 0; /* seen (...) = @_ */
10972 bool reuse = 0; /* reuse an existing padrange op */
10974 /* look for a pushmark -> gv[_] -> rv2av */
10980 if ( p->op_type == OP_GV
10981 && (gv = cGVOPx_gv(p))
10982 && GvNAMELEN_get(gv) == 1
10983 && *GvNAME_get(gv) == '_'
10984 && GvSTASH(gv) == PL_defstash
10985 && (rv2av = p->op_next)
10986 && rv2av->op_type == OP_RV2AV
10987 && !(rv2av->op_flags & OPf_REF)
10988 && !(rv2av->op_private & (OPpLVAL_INTRO|OPpMAYBE_LVSUB))
10989 && ((rv2av->op_flags & OPf_WANT) == OPf_WANT_LIST)
10990 && o->op_sibling == rv2av /* these two for Deparse */
10991 && cUNOPx(rv2av)->op_first == p
10993 q = rv2av->op_next;
10994 if (q->op_type == OP_NULL)
10996 if (q->op_type == OP_PUSHMARK) {
11003 /* To allow Deparse to pessimise this, it needs to be able
11004 * to restore the pushmark's original op_next, which it
11005 * will assume to be the same as op_sibling. */
11006 if (o->op_next != o->op_sibling)
11011 /* scan for PAD ops */
11013 for (p = p->op_next; p; p = p->op_next) {
11014 if (p->op_type == OP_NULL)
11017 if (( p->op_type != OP_PADSV
11018 && p->op_type != OP_PADAV
11019 && p->op_type != OP_PADHV
11021 /* any private flag other than INTRO? e.g. STATE */
11022 || (p->op_private & ~OPpLVAL_INTRO)
11026 /* let $a[N] potentially be optimised into ALEMFAST_LEX
11028 if ( p->op_type == OP_PADAV
11030 && p->op_next->op_type == OP_CONST
11031 && p->op_next->op_next
11032 && p->op_next->op_next->op_type == OP_AELEM
11036 /* for 1st padop, note what type it is and the range
11037 * start; for the others, check that it's the same type
11038 * and that the targs are contiguous */
11040 intro = (p->op_private & OPpLVAL_INTRO);
11042 gimme = (p->op_flags & OPf_WANT);
11045 if ((p->op_private & OPpLVAL_INTRO) != intro)
11047 /* Note that you'd normally expect targs to be
11048 * contiguous in my($a,$b,$c), but that's not the case
11049 * when external modules start doing things, e.g.
11050 i* Function::Parameters */
11051 if (p->op_targ != base + count)
11053 assert(p->op_targ == base + count);
11054 /* all the padops should be in the same context */
11055 if (gimme != (p->op_flags & OPf_WANT))
11059 /* for AV, HV, only when we're not flattening */
11060 if ( p->op_type != OP_PADSV
11061 && gimme != OPf_WANT_VOID
11062 && !(p->op_flags & OPf_REF)
11066 if (count >= OPpPADRANGE_COUNTMASK)
11069 /* there's a biggest base we can fit into a
11070 * SAVEt_CLEARPADRANGE in pp_padrange */
11071 if (intro && base >
11072 (UV_MAX >> (OPpPADRANGE_COUNTSHIFT+SAVE_TIGHT_SHIFT)))
11075 /* Success! We've got another valid pad op to optimise away */
11077 followop = p->op_next;
11083 /* pp_padrange in specifically compile-time void context
11084 * skips pushing a mark and lexicals; in all other contexts
11085 * (including unknown till runtime) it pushes a mark and the
11086 * lexicals. We must be very careful then, that the ops we
11087 * optimise away would have exactly the same effect as the
11089 * In particular in void context, we can only optimise to
11090 * a padrange if see see the complete sequence
11091 * pushmark, pad*v, ...., list, nextstate
11092 * which has the net effect of of leaving the stack empty
11093 * (for now we leave the nextstate in the execution chain, for
11094 * its other side-effects).
11097 if (gimme == OPf_WANT_VOID) {
11098 if (followop->op_type == OP_LIST
11099 && gimme == (followop->op_flags & OPf_WANT)
11100 && ( followop->op_next->op_type == OP_NEXTSTATE
11101 || followop->op_next->op_type == OP_DBSTATE))
11103 followop = followop->op_next; /* skip OP_LIST */
11105 /* consolidate two successive my(...);'s */
11108 && oldoldop->op_type == OP_PADRANGE
11109 && (oldoldop->op_flags & OPf_WANT) == OPf_WANT_VOID
11110 && (oldoldop->op_private & OPpLVAL_INTRO) == intro
11111 && !(oldoldop->op_flags & OPf_SPECIAL)
11114 assert(oldoldop->op_next == oldop);
11115 assert( oldop->op_type == OP_NEXTSTATE
11116 || oldop->op_type == OP_DBSTATE);
11117 assert(oldop->op_next == o);
11120 = (oldoldop->op_private & OPpPADRANGE_COUNTMASK);
11121 assert(oldoldop->op_targ + old_count == base);
11123 if (old_count < OPpPADRANGE_COUNTMASK - count) {
11124 base = oldoldop->op_targ;
11125 count += old_count;
11130 /* if there's any immediately following singleton
11131 * my var's; then swallow them and the associated
11133 * my ($a,$b); my $c; my $d;
11135 * my ($a,$b,$c,$d);
11138 while ( ((p = followop->op_next))
11139 && ( p->op_type == OP_PADSV
11140 || p->op_type == OP_PADAV
11141 || p->op_type == OP_PADHV)
11142 && (p->op_flags & OPf_WANT) == OPf_WANT_VOID
11143 && (p->op_private & OPpLVAL_INTRO) == intro
11145 && ( p->op_next->op_type == OP_NEXTSTATE
11146 || p->op_next->op_type == OP_DBSTATE)
11147 && count < OPpPADRANGE_COUNTMASK
11149 assert(base + count == p->op_targ);
11151 followop = p->op_next;
11159 assert(oldoldop->op_type == OP_PADRANGE);
11160 oldoldop->op_next = followop;
11161 oldoldop->op_private = (intro | count);
11167 /* Convert the pushmark into a padrange.
11168 * To make Deparse easier, we guarantee that a padrange was
11169 * *always* formerly a pushmark */
11170 assert(o->op_type == OP_PUSHMARK);
11171 o->op_next = followop;
11172 o->op_type = OP_PADRANGE;
11173 o->op_ppaddr = PL_ppaddr[OP_PADRANGE];
11175 /* bit 7: INTRO; bit 6..0: count */
11176 o->op_private = (intro | count);
11177 o->op_flags = ((o->op_flags & ~(OPf_WANT|OPf_SPECIAL))
11178 | gimme | (defav ? OPf_SPECIAL : 0));
11185 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
11186 OP* const pop = (o->op_type == OP_PADAV) ?
11187 o->op_next : o->op_next->op_next;
11189 if (pop && pop->op_type == OP_CONST &&
11190 ((PL_op = pop->op_next)) &&
11191 pop->op_next->op_type == OP_AELEM &&
11192 !(pop->op_next->op_private &
11193 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
11194 (i = SvIV(((SVOP*)pop)->op_sv)) <= 255 && i >= 0)
11197 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
11198 no_bareword_allowed(pop);
11199 if (o->op_type == OP_GV)
11200 op_null(o->op_next);
11201 op_null(pop->op_next);
11203 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
11204 o->op_next = pop->op_next->op_next;
11205 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
11206 o->op_private = (U8)i;
11207 if (o->op_type == OP_GV) {
11210 o->op_type = OP_AELEMFAST;
11213 o->op_type = OP_AELEMFAST_LEX;
11218 if (o->op_next->op_type == OP_RV2SV) {
11219 if (!(o->op_next->op_private & OPpDEREF)) {
11220 op_null(o->op_next);
11221 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
11223 o->op_next = o->op_next->op_next;
11224 o->op_type = OP_GVSV;
11225 o->op_ppaddr = PL_ppaddr[OP_GVSV];
11228 else if (o->op_next->op_type == OP_READLINE
11229 && o->op_next->op_next->op_type == OP_CONCAT
11230 && (o->op_next->op_next->op_flags & OPf_STACKED))
11232 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
11233 o->op_type = OP_RCATLINE;
11234 o->op_flags |= OPf_STACKED;
11235 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
11236 op_null(o->op_next->op_next);
11237 op_null(o->op_next);
11246 #define HV_OR_SCALARHV(op) \
11247 ( (op)->op_type == OP_PADHV || (op)->op_type == OP_RV2HV \
11249 : (op)->op_type == OP_SCALAR && (op)->op_flags & OPf_KIDS \
11250 && ( cUNOPx(op)->op_first->op_type == OP_PADHV \
11251 || cUNOPx(op)->op_first->op_type == OP_RV2HV) \
11252 ? cUNOPx(op)->op_first \
11256 if ((fop = HV_OR_SCALARHV(cUNOP->op_first)))
11257 fop->op_private |= OPpTRUEBOOL;
11263 fop = cLOGOP->op_first;
11264 sop = fop->op_sibling;
11265 while (cLOGOP->op_other->op_type == OP_NULL)
11266 cLOGOP->op_other = cLOGOP->op_other->op_next;
11267 while (o->op_next && ( o->op_type == o->op_next->op_type
11268 || o->op_next->op_type == OP_NULL))
11269 o->op_next = o->op_next->op_next;
11270 DEFER(cLOGOP->op_other);
11273 fop = HV_OR_SCALARHV(fop);
11274 if (sop) sop = HV_OR_SCALARHV(sop);
11279 if (!((nop->op_flags & OPf_WANT) == OPf_WANT_VOID)) {
11280 while (nop && nop->op_next) {
11281 switch (nop->op_next->op_type) {
11286 lop = nop = nop->op_next;
11289 nop = nop->op_next;
11298 if ( (lop->op_flags & OPf_WANT) == OPf_WANT_VOID
11299 || o->op_type == OP_AND )
11300 fop->op_private |= OPpTRUEBOOL;
11301 else if (!(lop->op_flags & OPf_WANT))
11302 fop->op_private |= OPpMAYBE_TRUEBOOL;
11304 if ( (lop->op_flags & OPf_WANT) == OPf_WANT_VOID
11306 sop->op_private |= OPpTRUEBOOL;
11313 if ((fop = HV_OR_SCALARHV(cLOGOP->op_first)))
11314 fop->op_private |= OPpTRUEBOOL;
11315 #undef HV_OR_SCALARHV
11326 while (cLOGOP->op_other->op_type == OP_NULL)
11327 cLOGOP->op_other = cLOGOP->op_other->op_next;
11328 DEFER(cLOGOP->op_other);
11333 while (cLOOP->op_redoop->op_type == OP_NULL)
11334 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
11335 while (cLOOP->op_nextop->op_type == OP_NULL)
11336 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
11337 while (cLOOP->op_lastop->op_type == OP_NULL)
11338 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
11339 /* a while(1) loop doesn't have an op_next that escapes the
11340 * loop, so we have to explicitly follow the op_lastop to
11341 * process the rest of the code */
11342 DEFER(cLOOP->op_lastop);
11346 assert(!(cPMOP->op_pmflags & PMf_ONCE));
11347 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
11348 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
11349 cPMOP->op_pmstashstartu.op_pmreplstart
11350 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
11351 DEFER(cPMOP->op_pmstashstartu.op_pmreplstart);
11357 if (o->op_flags & OPf_STACKED) {
11359 cUNOPx(cLISTOP->op_first->op_sibling)->op_first;
11360 if (kid->op_type == OP_SCOPE
11361 || (kid->op_type == OP_NULL && kid->op_targ == OP_LEAVE))
11362 DEFER(kLISTOP->op_first);
11365 /* check that RHS of sort is a single plain array */
11366 oright = cUNOPo->op_first;
11367 if (!oright || oright->op_type != OP_PUSHMARK)
11370 if (o->op_private & OPpSORT_INPLACE)
11373 /* reverse sort ... can be optimised. */
11374 if (!cUNOPo->op_sibling) {
11375 /* Nothing follows us on the list. */
11376 OP * const reverse = o->op_next;
11378 if (reverse->op_type == OP_REVERSE &&
11379 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
11380 OP * const pushmark = cUNOPx(reverse)->op_first;
11381 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
11382 && (cUNOPx(pushmark)->op_sibling == o)) {
11383 /* reverse -> pushmark -> sort */
11384 o->op_private |= OPpSORT_REVERSE;
11386 pushmark->op_next = oright->op_next;
11396 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
11398 LISTOP *enter, *exlist;
11400 if (o->op_private & OPpSORT_INPLACE)
11403 enter = (LISTOP *) o->op_next;
11406 if (enter->op_type == OP_NULL) {
11407 enter = (LISTOP *) enter->op_next;
11411 /* for $a (...) will have OP_GV then OP_RV2GV here.
11412 for (...) just has an OP_GV. */
11413 if (enter->op_type == OP_GV) {
11414 gvop = (OP *) enter;
11415 enter = (LISTOP *) enter->op_next;
11418 if (enter->op_type == OP_RV2GV) {
11419 enter = (LISTOP *) enter->op_next;
11425 if (enter->op_type != OP_ENTERITER)
11428 iter = enter->op_next;
11429 if (!iter || iter->op_type != OP_ITER)
11432 expushmark = enter->op_first;
11433 if (!expushmark || expushmark->op_type != OP_NULL
11434 || expushmark->op_targ != OP_PUSHMARK)
11437 exlist = (LISTOP *) expushmark->op_sibling;
11438 if (!exlist || exlist->op_type != OP_NULL
11439 || exlist->op_targ != OP_LIST)
11442 if (exlist->op_last != o) {
11443 /* Mmm. Was expecting to point back to this op. */
11446 theirmark = exlist->op_first;
11447 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
11450 if (theirmark->op_sibling != o) {
11451 /* There's something between the mark and the reverse, eg
11452 for (1, reverse (...))
11457 ourmark = ((LISTOP *)o)->op_first;
11458 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
11461 ourlast = ((LISTOP *)o)->op_last;
11462 if (!ourlast || ourlast->op_next != o)
11465 rv2av = ourmark->op_sibling;
11466 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
11467 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
11468 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
11469 /* We're just reversing a single array. */
11470 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
11471 enter->op_flags |= OPf_STACKED;
11474 /* We don't have control over who points to theirmark, so sacrifice
11476 theirmark->op_next = ourmark->op_next;
11477 theirmark->op_flags = ourmark->op_flags;
11478 ourlast->op_next = gvop ? gvop : (OP *) enter;
11481 enter->op_private |= OPpITER_REVERSED;
11482 iter->op_private |= OPpITER_REVERSED;
11489 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
11490 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
11495 if (!(o->op_private & OPpOFFBYONE) && !CvCLONE(PL_compcv)) {
11497 if (CvEVAL(PL_compcv)) sv = &PL_sv_undef;
11499 sv = newRV((SV *)PL_compcv);
11503 o->op_type = OP_CONST;
11504 o->op_ppaddr = PL_ppaddr[OP_CONST];
11505 o->op_flags |= OPf_SPECIAL;
11506 cSVOPo->op_sv = sv;
11511 if (OP_GIMME(o,0) == G_VOID) {
11512 OP *right = cBINOP->op_first;
11514 OP *left = right->op_sibling;
11515 if (left->op_type == OP_SUBSTR
11516 && (left->op_private & 7) < 4) {
11518 cBINOP->op_first = left;
11519 right->op_sibling =
11520 cBINOPx(left)->op_first->op_sibling;
11521 cBINOPx(left)->op_first->op_sibling = right;
11522 left->op_private |= OPpSUBSTR_REPL_FIRST;
11524 (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
11531 Perl_cpeep_t cpeep =
11532 XopENTRY(Perl_custom_op_xop(aTHX_ o), xop_peep);
11534 cpeep(aTHX_ o, oldop);
11546 Perl_peep(pTHX_ OP *o)
11552 =head1 Custom Operators
11554 =for apidoc Ao||custom_op_xop
11555 Return the XOP structure for a given custom op. This function should be
11556 considered internal to OP_NAME and the other access macros: use them instead.
11562 Perl_custom_op_xop(pTHX_ const OP *o)
11568 static const XOP xop_null = { 0, 0, 0, 0, 0 };
11570 PERL_ARGS_ASSERT_CUSTOM_OP_XOP;
11571 assert(o->op_type == OP_CUSTOM);
11573 /* This is wrong. It assumes a function pointer can be cast to IV,
11574 * which isn't guaranteed, but this is what the old custom OP code
11575 * did. In principle it should be safer to Copy the bytes of the
11576 * pointer into a PV: since the new interface is hidden behind
11577 * functions, this can be changed later if necessary. */
11578 /* Change custom_op_xop if this ever happens */
11579 keysv = sv_2mortal(newSViv(PTR2IV(o->op_ppaddr)));
11582 he = hv_fetch_ent(PL_custom_ops, keysv, 0, 0);
11584 /* assume noone will have just registered a desc */
11585 if (!he && PL_custom_op_names &&
11586 (he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0))
11591 /* XXX does all this need to be shared mem? */
11592 Newxz(xop, 1, XOP);
11593 pv = SvPV(HeVAL(he), l);
11594 XopENTRY_set(xop, xop_name, savepvn(pv, l));
11595 if (PL_custom_op_descs &&
11596 (he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0))
11598 pv = SvPV(HeVAL(he), l);
11599 XopENTRY_set(xop, xop_desc, savepvn(pv, l));
11601 Perl_custom_op_register(aTHX_ o->op_ppaddr, xop);
11605 if (!he) return &xop_null;
11607 xop = INT2PTR(XOP *, SvIV(HeVAL(he)));
11612 =for apidoc Ao||custom_op_register
11613 Register a custom op. See L<perlguts/"Custom Operators">.
11619 Perl_custom_op_register(pTHX_ Perl_ppaddr_t ppaddr, const XOP *xop)
11623 PERL_ARGS_ASSERT_CUSTOM_OP_REGISTER;
11625 /* see the comment in custom_op_xop */
11626 keysv = sv_2mortal(newSViv(PTR2IV(ppaddr)));
11628 if (!PL_custom_ops)
11629 PL_custom_ops = newHV();
11631 if (!hv_store_ent(PL_custom_ops, keysv, newSViv(PTR2IV(xop)), 0))
11632 Perl_croak(aTHX_ "panic: can't register custom OP %s", xop->xop_name);
11636 =head1 Functions in file op.c
11638 =for apidoc core_prototype
11639 This function assigns the prototype of the named core function to C<sv>, or
11640 to a new mortal SV if C<sv> is NULL. It returns the modified C<sv>, or
11641 NULL if the core function has no prototype. C<code> is a code as returned
11642 by C<keyword()>. It must not be equal to 0 or -KEY_CORE.
11648 Perl_core_prototype(pTHX_ SV *sv, const char *name, const int code,
11651 int i = 0, n = 0, seen_question = 0, defgv = 0;
11653 #define MAX_ARGS_OP ((sizeof(I32) - 1) * 2)
11654 char str[ MAX_ARGS_OP * 2 + 2 ]; /* One ';', one '\0' */
11655 bool nullret = FALSE;
11657 PERL_ARGS_ASSERT_CORE_PROTOTYPE;
11659 assert (code && code != -KEY_CORE);
11661 if (!sv) sv = sv_newmortal();
11663 #define retsetpvs(x,y) sv_setpvs(sv, x); if(opnum) *opnum=(y); return sv
11665 switch (code < 0 ? -code : code) {
11666 case KEY_and : case KEY_chop: case KEY_chomp:
11667 case KEY_cmp : case KEY_defined: case KEY_delete: case KEY_exec :
11668 case KEY_exists: case KEY_eq : case KEY_ge : case KEY_goto :
11669 case KEY_grep : case KEY_gt : case KEY_last : case KEY_le :
11670 case KEY_lt : case KEY_map : case KEY_ne : case KEY_next :
11671 case KEY_or : case KEY_print : case KEY_printf: case KEY_qr :
11672 case KEY_redo : case KEY_require: case KEY_return: case KEY_say :
11673 case KEY_select: case KEY_sort : case KEY_split : case KEY_system:
11674 case KEY_x : case KEY_xor :
11675 if (!opnum) return NULL; nullret = TRUE; goto findopnum;
11676 case KEY_glob: retsetpvs("_;", OP_GLOB);
11677 case KEY_keys: retsetpvs("+", OP_KEYS);
11678 case KEY_values: retsetpvs("+", OP_VALUES);
11679 case KEY_each: retsetpvs("+", OP_EACH);
11680 case KEY_push: retsetpvs("+@", OP_PUSH);
11681 case KEY_unshift: retsetpvs("+@", OP_UNSHIFT);
11682 case KEY_pop: retsetpvs(";+", OP_POP);
11683 case KEY_shift: retsetpvs(";+", OP_SHIFT);
11684 case KEY_pos: retsetpvs(";\\[$*]", OP_POS);
11686 retsetpvs("+;$$@", OP_SPLICE);
11687 case KEY___FILE__: case KEY___LINE__: case KEY___PACKAGE__:
11689 case KEY_evalbytes:
11690 name = "entereval"; break;
11698 while (i < MAXO) { /* The slow way. */
11699 if (strEQ(name, PL_op_name[i])
11700 || strEQ(name, PL_op_desc[i]))
11702 if (nullret) { assert(opnum); *opnum = i; return NULL; }
11709 defgv = PL_opargs[i] & OA_DEFGV;
11710 oa = PL_opargs[i] >> OASHIFT;
11712 if (oa & OA_OPTIONAL && !seen_question && (
11713 !defgv || (oa & (OA_OPTIONAL - 1)) == OA_FILEREF
11718 if ((oa & (OA_OPTIONAL - 1)) >= OA_AVREF
11719 && (oa & (OA_OPTIONAL - 1)) <= OA_SCALARREF
11720 /* But globs are already references (kinda) */
11721 && (oa & (OA_OPTIONAL - 1)) != OA_FILEREF
11725 if ((oa & (OA_OPTIONAL - 1)) == OA_SCALARREF
11726 && !scalar_mod_type(NULL, i)) {
11731 if (i == OP_LOCK || i == OP_UNDEF) str[n++] = '&';
11735 else str[n++] = ("?$@@%&*$")[oa & (OA_OPTIONAL - 1)];
11736 if (oa & OA_OPTIONAL && defgv && str[n-1] == '$') {
11737 str[n-1] = '_'; defgv = 0;
11741 if (code == -KEY_not || code == -KEY_getprotobynumber) str[n++] = ';';
11743 sv_setpvn(sv, str, n - 1);
11744 if (opnum) *opnum = i;
11749 Perl_coresub_op(pTHX_ SV * const coreargssv, const int code,
11752 OP * const argop = newSVOP(OP_COREARGS,0,coreargssv);
11755 PERL_ARGS_ASSERT_CORESUB_OP;
11759 return op_append_elem(OP_LINESEQ,
11762 newSVOP(OP_CONST, 0, newSViv(-code % 3)),
11766 case OP_SELECT: /* which represents OP_SSELECT as well */
11771 newAVREF(newGVOP(OP_GV, 0, PL_defgv)),
11772 newSVOP(OP_CONST, 0, newSVuv(1))
11774 coresub_op(newSVuv((UV)OP_SSELECT), 0,
11776 coresub_op(coreargssv, 0, OP_SELECT)
11780 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
11782 return op_append_elem(
11785 opnum == OP_WANTARRAY || opnum == OP_RUNCV
11786 ? OPpOFFBYONE << 8 : 0)
11788 case OA_BASEOP_OR_UNOP:
11789 if (opnum == OP_ENTEREVAL) {
11790 o = newUNOP(OP_ENTEREVAL,OPpEVAL_COPHH<<8,argop);
11791 if (code == -KEY_evalbytes) o->op_private |= OPpEVAL_BYTES;
11793 else o = newUNOP(opnum,0,argop);
11794 if (opnum == OP_CALLER) o->op_private |= OPpOFFBYONE;
11797 if (is_handle_constructor(o, 1))
11798 argop->op_private |= OPpCOREARGS_DEREF1;
11799 if (scalar_mod_type(NULL, opnum))
11800 argop->op_private |= OPpCOREARGS_SCALARMOD;
11804 o = convert(opnum,OPf_SPECIAL*(opnum == OP_GLOB),argop);
11805 if (is_handle_constructor(o, 2))
11806 argop->op_private |= OPpCOREARGS_DEREF2;
11807 if (opnum == OP_SUBSTR) {
11808 o->op_private |= OPpMAYBE_LVSUB;
11817 Perl_report_redefined_cv(pTHX_ const SV *name, const CV *old_cv,
11818 SV * const *new_const_svp)
11820 const char *hvname;
11821 bool is_const = !!CvCONST(old_cv);
11822 SV *old_const_sv = is_const ? cv_const_sv(old_cv) : NULL;
11824 PERL_ARGS_ASSERT_REPORT_REDEFINED_CV;
11826 if (is_const && new_const_svp && old_const_sv == *new_const_svp)
11828 /* They are 2 constant subroutines generated from
11829 the same constant. This probably means that
11830 they are really the "same" proxy subroutine
11831 instantiated in 2 places. Most likely this is
11832 when a constant is exported twice. Don't warn.
11835 (ckWARN(WARN_REDEFINE)
11837 CvGV(old_cv) && GvSTASH(CvGV(old_cv))
11838 && HvNAMELEN(GvSTASH(CvGV(old_cv))) == 7
11839 && (hvname = HvNAME(GvSTASH(CvGV(old_cv))),
11840 strEQ(hvname, "autouse"))
11844 && ckWARN_d(WARN_REDEFINE)
11845 && (!new_const_svp || sv_cmp(old_const_sv, *new_const_svp))
11848 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
11850 ? "Constant subroutine %"SVf" redefined"
11851 : "Subroutine %"SVf" redefined",
11856 =head1 Hook manipulation
11858 These functions provide convenient and thread-safe means of manipulating
11865 =for apidoc Am|void|wrap_op_checker|Optype opcode|Perl_check_t new_checker|Perl_check_t *old_checker_p
11867 Puts a C function into the chain of check functions for a specified op
11868 type. This is the preferred way to manipulate the L</PL_check> array.
11869 I<opcode> specifies which type of op is to be affected. I<new_checker>
11870 is a pointer to the C function that is to be added to that opcode's
11871 check chain, and I<old_checker_p> points to the storage location where a
11872 pointer to the next function in the chain will be stored. The value of
11873 I<new_pointer> is written into the L</PL_check> array, while the value
11874 previously stored there is written to I<*old_checker_p>.
11876 L</PL_check> is global to an entire process, and a module wishing to
11877 hook op checking may find itself invoked more than once per process,
11878 typically in different threads. To handle that situation, this function
11879 is idempotent. The location I<*old_checker_p> must initially (once
11880 per process) contain a null pointer. A C variable of static duration
11881 (declared at file scope, typically also marked C<static> to give
11882 it internal linkage) will be implicitly initialised appropriately,
11883 if it does not have an explicit initialiser. This function will only
11884 actually modify the check chain if it finds I<*old_checker_p> to be null.
11885 This function is also thread safe on the small scale. It uses appropriate
11886 locking to avoid race conditions in accessing L</PL_check>.
11888 When this function is called, the function referenced by I<new_checker>
11889 must be ready to be called, except for I<*old_checker_p> being unfilled.
11890 In a threading situation, I<new_checker> may be called immediately,
11891 even before this function has returned. I<*old_checker_p> will always
11892 be appropriately set before I<new_checker> is called. If I<new_checker>
11893 decides not to do anything special with an op that it is given (which
11894 is the usual case for most uses of op check hooking), it must chain the
11895 check function referenced by I<*old_checker_p>.
11897 If you want to influence compilation of calls to a specific subroutine,
11898 then use L</cv_set_call_checker> rather than hooking checking of all
11905 Perl_wrap_op_checker(pTHX_ Optype opcode,
11906 Perl_check_t new_checker, Perl_check_t *old_checker_p)
11910 PERL_ARGS_ASSERT_WRAP_OP_CHECKER;
11911 if (*old_checker_p) return;
11912 OP_CHECK_MUTEX_LOCK;
11913 if (!*old_checker_p) {
11914 *old_checker_p = PL_check[opcode];
11915 PL_check[opcode] = new_checker;
11917 OP_CHECK_MUTEX_UNLOCK;
11922 /* Efficient sub that returns a constant scalar value. */
11924 const_sv_xsub(pTHX_ CV* cv)
11928 SV *const sv = MUTABLE_SV(XSANY.any_ptr);
11929 PERL_UNUSED_ARG(items);
11939 const_av_xsub(pTHX_ CV* cv)
11943 AV * const av = MUTABLE_AV(XSANY.any_ptr);
11951 if (SvRMAGICAL(av))
11952 Perl_croak(aTHX_ "Magical list constants are not supported");
11953 if (GIMME_V != G_ARRAY) {
11955 ST(0) = newSViv((IV)AvFILLp(av)+1);
11958 EXTEND(SP, AvFILLp(av)+1);
11959 Copy(AvARRAY(av), &ST(0), AvFILLp(av)+1, SV *);
11960 XSRETURN(AvFILLp(av)+1);
11965 * c-indentation-style: bsd
11966 * c-basic-offset: 4
11967 * indent-tabs-mode: nil
11970 * ex: set ts=8 sts=4 sw=4 et: