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)
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_sv(pTHX_ I32 n, const char *t, SV *namesv, U32 flags, const OP *kid)
540 PERL_ARGS_ASSERT_BAD_TYPE_SV;
542 yyerror_pv(Perl_form(aTHX_ "Type of arg %d to %"SVf" must be %s (not %s)",
543 (int)n, SVfARG(namesv), t, OP_DESC(kid)), SvUTF8(namesv) | flags);
547 S_no_bareword_allowed(pTHX_ OP *o)
549 PERL_ARGS_ASSERT_NO_BAREWORD_ALLOWED;
552 return; /* various ok barewords are hidden in extra OP_NULL */
553 qerror(Perl_mess(aTHX_
554 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
556 o->op_private &= ~OPpCONST_STRICT; /* prevent warning twice about the same OP */
559 /* "register" allocation */
562 Perl_allocmy(pTHX_ const char *const name, const STRLEN len, const U32 flags)
566 const bool is_our = (PL_parser->in_my == KEY_our);
568 PERL_ARGS_ASSERT_ALLOCMY;
570 if (flags & ~SVf_UTF8)
571 Perl_croak(aTHX_ "panic: allocmy illegal flag bits 0x%" UVxf,
574 /* Until we're using the length for real, cross check that we're being
576 assert(strlen(name) == len);
578 /* complain about "my $<special_var>" etc etc */
582 ((flags & SVf_UTF8) && isIDFIRST_utf8((U8 *)name+1)) ||
583 (name[1] == '_' && (*name == '$' || len > 2))))
585 /* name[2] is true if strlen(name) > 2 */
586 if (!(flags & SVf_UTF8 && UTF8_IS_START(name[1]))
587 && (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1]))) {
588 yyerror(Perl_form(aTHX_ "Can't use global %c^%c%.*s in \"%s\"",
589 name[0], toCTRL(name[1]), (int)(len - 2), name + 2,
590 PL_parser->in_my == KEY_state ? "state" : "my"));
592 yyerror_pv(Perl_form(aTHX_ "Can't use global %.*s in \"%s\"", (int) len, name,
593 PL_parser->in_my == KEY_state ? "state" : "my"), flags & SVf_UTF8);
596 else if (len == 2 && name[1] == '_' && !is_our)
597 /* diag_listed_as: Use of my $_ is experimental */
598 Perl_ck_warner_d(aTHX_ packWARN(WARN_EXPERIMENTAL__LEXICAL_TOPIC),
599 "Use of %s $_ is experimental",
600 PL_parser->in_my == KEY_state
604 /* allocate a spare slot and store the name in that slot */
606 off = pad_add_name_pvn(name, len,
607 (is_our ? padadd_OUR :
608 PL_parser->in_my == KEY_state ? padadd_STATE : 0)
609 | ( flags & SVf_UTF8 ? SVf_UTF8 : 0 ),
610 PL_parser->in_my_stash,
612 /* $_ is always in main::, even with our */
613 ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash)
617 /* anon sub prototypes contains state vars should always be cloned,
618 * otherwise the state var would be shared between anon subs */
620 if (PL_parser->in_my == KEY_state && CvANON(PL_compcv))
621 CvCLONE_on(PL_compcv);
627 =for apidoc alloccopstash
629 Available only under threaded builds, this function allocates an entry in
630 C<PL_stashpad> for the stash passed to it.
637 Perl_alloccopstash(pTHX_ HV *hv)
639 PADOFFSET off = 0, o = 1;
640 bool found_slot = FALSE;
642 PERL_ARGS_ASSERT_ALLOCCOPSTASH;
644 if (PL_stashpad[PL_stashpadix] == hv) return PL_stashpadix;
646 for (; o < PL_stashpadmax; ++o) {
647 if (PL_stashpad[o] == hv) return PL_stashpadix = o;
648 if (!PL_stashpad[o] || SvTYPE(PL_stashpad[o]) != SVt_PVHV)
649 found_slot = TRUE, off = o;
652 Renew(PL_stashpad, PL_stashpadmax + 10, HV *);
653 Zero(PL_stashpad + PL_stashpadmax, 10, HV *);
654 off = PL_stashpadmax;
655 PL_stashpadmax += 10;
658 PL_stashpad[PL_stashpadix = off] = hv;
663 /* free the body of an op without examining its contents.
664 * Always use this rather than FreeOp directly */
667 S_op_destroy(pTHX_ OP *o)
675 Perl_op_free(pTHX_ OP *o)
680 /* Though ops may be freed twice, freeing the op after its slab is a
682 assert(!o || !o->op_slabbed || OpSLAB(o)->opslab_refcnt != ~(size_t)0);
683 /* During the forced freeing of ops after compilation failure, kidops
684 may be freed before their parents. */
685 if (!o || o->op_type == OP_FREED)
689 if (o->op_private & OPpREFCOUNTED) {
700 refcnt = OpREFCNT_dec(o);
703 /* Need to find and remove any pattern match ops from the list
704 we maintain for reset(). */
705 find_and_forget_pmops(o);
715 /* Call the op_free hook if it has been set. Do it now so that it's called
716 * at the right time for refcounted ops, but still before all of the kids
720 if (o->op_flags & OPf_KIDS) {
722 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
723 nextkid = kid->op_sibling; /* Get before next freeing kid */
728 type = (OPCODE)o->op_targ;
731 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 /* perl4's way of mixing documentation and code
1385 (before the invention of POD) was based on a
1386 trick to mix nroff and perl code. The trick was
1387 built upon these three nroff macros being used in
1388 void context. The pink camel has the details in
1389 the script wrapman near page 319. */
1390 const char * const maybe_macro = SvPVX_const(sv);
1391 if (strnEQ(maybe_macro, "di", 2) ||
1392 strnEQ(maybe_macro, "ds", 2) ||
1393 strnEQ(maybe_macro, "ig", 2))
1396 SV * const dsv = newSVpvs("");
1398 = Perl_newSVpvf(aTHX_
1400 pv_pretty(dsv, maybe_macro,
1401 SvCUR(sv), 32, NULL, NULL,
1403 | PERL_PV_ESCAPE_NOCLEAR
1404 | PERL_PV_ESCAPE_UNI_DETECT));
1405 SvREFCNT_dec_NN(dsv);
1408 else if (SvOK(sv)) {
1409 useless_sv = Perl_newSVpvf(aTHX_ "a constant (%"SVf")", sv);
1412 useless = "a constant (undef)";
1415 op_null(o); /* don't execute or even remember it */
1419 o->op_type = OP_PREINC; /* pre-increment is faster */
1420 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1424 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1425 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1429 o->op_type = OP_I_PREINC; /* pre-increment is faster */
1430 o->op_ppaddr = PL_ppaddr[OP_I_PREINC];
1434 o->op_type = OP_I_PREDEC; /* pre-decrement is faster */
1435 o->op_ppaddr = PL_ppaddr[OP_I_PREDEC];
1440 UNOP *refgen, *rv2cv;
1443 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
1446 rv2gv = ((BINOP *)o)->op_last;
1447 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
1450 refgen = (UNOP *)((BINOP *)o)->op_first;
1452 if (!refgen || refgen->op_type != OP_REFGEN)
1455 exlist = (LISTOP *)refgen->op_first;
1456 if (!exlist || exlist->op_type != OP_NULL
1457 || exlist->op_targ != OP_LIST)
1460 if (exlist->op_first->op_type != OP_PUSHMARK)
1463 rv2cv = (UNOP*)exlist->op_last;
1465 if (rv2cv->op_type != OP_RV2CV)
1468 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
1469 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
1470 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
1472 o->op_private |= OPpASSIGN_CV_TO_GV;
1473 rv2gv->op_private |= OPpDONT_INIT_GV;
1474 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
1486 kid = cLOGOPo->op_first;
1487 if (kid->op_type == OP_NOT
1488 && (kid->op_flags & OPf_KIDS)
1490 if (o->op_type == OP_AND) {
1492 o->op_ppaddr = PL_ppaddr[OP_OR];
1494 o->op_type = OP_AND;
1495 o->op_ppaddr = PL_ppaddr[OP_AND];
1504 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1509 if (o->op_flags & OPf_STACKED)
1516 if (!(o->op_flags & OPf_KIDS))
1527 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1538 /* mortalise it, in case warnings are fatal. */
1539 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
1540 "Useless use of %"SVf" in void context",
1541 sv_2mortal(useless_sv));
1544 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
1545 "Useless use of %s in void context",
1552 S_listkids(pTHX_ OP *o)
1554 if (o && o->op_flags & OPf_KIDS) {
1556 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1563 Perl_list(pTHX_ OP *o)
1568 /* assumes no premature commitment */
1569 if (!o || (o->op_flags & OPf_WANT)
1570 || (PL_parser && PL_parser->error_count)
1571 || o->op_type == OP_RETURN)
1576 if ((o->op_private & OPpTARGET_MY)
1577 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1579 return o; /* As if inside SASSIGN */
1582 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1584 switch (o->op_type) {
1587 list(cBINOPo->op_first);
1592 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1600 if (!(o->op_flags & OPf_KIDS))
1602 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1603 list(cBINOPo->op_first);
1604 return gen_constant_list(o);
1611 kid = cLISTOPo->op_first;
1613 kid = kid->op_sibling;
1616 OP *sib = kid->op_sibling;
1617 if (sib && kid->op_type != OP_LEAVEWHEN)
1623 PL_curcop = &PL_compiling;
1627 kid = cLISTOPo->op_first;
1634 S_scalarseq(pTHX_ OP *o)
1638 const OPCODE type = o->op_type;
1640 if (type == OP_LINESEQ || type == OP_SCOPE ||
1641 type == OP_LEAVE || type == OP_LEAVETRY)
1644 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1645 if (kid->op_sibling) {
1649 PL_curcop = &PL_compiling;
1651 o->op_flags &= ~OPf_PARENS;
1652 if (PL_hints & HINT_BLOCK_SCOPE)
1653 o->op_flags |= OPf_PARENS;
1656 o = newOP(OP_STUB, 0);
1661 S_modkids(pTHX_ OP *o, I32 type)
1663 if (o && o->op_flags & OPf_KIDS) {
1665 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1666 op_lvalue(kid, type);
1672 =for apidoc finalize_optree
1674 This function finalizes the optree. Should be called directly after
1675 the complete optree is built. It does some additional
1676 checking which can't be done in the normal ck_xxx functions and makes
1677 the tree thread-safe.
1682 Perl_finalize_optree(pTHX_ OP* o)
1684 PERL_ARGS_ASSERT_FINALIZE_OPTREE;
1687 SAVEVPTR(PL_curcop);
1695 S_finalize_op(pTHX_ OP* o)
1697 PERL_ARGS_ASSERT_FINALIZE_OP;
1699 #if defined(PERL_MAD) && defined(USE_ITHREADS)
1701 /* Make sure mad ops are also thread-safe */
1702 MADPROP *mp = o->op_madprop;
1704 if (mp->mad_type == MAD_OP && mp->mad_vlen) {
1705 OP *prop_op = (OP *) mp->mad_val;
1706 /* We only need "Relocate sv to the pad for thread safety.", but this
1707 easiest way to make sure it traverses everything */
1708 if (prop_op->op_type == OP_CONST)
1709 cSVOPx(prop_op)->op_private &= ~OPpCONST_STRICT;
1710 finalize_op(prop_op);
1717 switch (o->op_type) {
1720 PL_curcop = ((COP*)o); /* for warnings */
1724 && (o->op_sibling->op_type == OP_NEXTSTATE || o->op_sibling->op_type == OP_DBSTATE)
1725 && ckWARN(WARN_SYNTAX))
1727 if (o->op_sibling->op_sibling) {
1728 const OPCODE type = o->op_sibling->op_sibling->op_type;
1729 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
1730 const line_t oldline = CopLINE(PL_curcop);
1731 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_sibling));
1732 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1733 "Statement unlikely to be reached");
1734 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1735 "\t(Maybe you meant system() when you said exec()?)\n");
1736 CopLINE_set(PL_curcop, oldline);
1743 if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
1744 GV * const gv = cGVOPo_gv;
1745 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
1746 /* XXX could check prototype here instead of just carping */
1747 SV * const sv = sv_newmortal();
1748 gv_efullname3(sv, gv, NULL);
1749 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
1750 "%"SVf"() called too early to check prototype",
1757 if (cSVOPo->op_private & OPpCONST_STRICT)
1758 no_bareword_allowed(o);
1762 case OP_METHOD_NAMED:
1763 /* Relocate sv to the pad for thread safety.
1764 * Despite being a "constant", the SV is written to,
1765 * for reference counts, sv_upgrade() etc. */
1766 if (cSVOPo->op_sv) {
1767 const PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
1768 if (o->op_type != OP_METHOD_NAMED &&
1769 (SvPADTMP(cSVOPo->op_sv) || SvPADMY(cSVOPo->op_sv)))
1771 /* If op_sv is already a PADTMP/MY then it is being used by
1772 * some pad, so make a copy. */
1773 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
1774 if (!SvIsCOW(PAD_SVl(ix))) SvREADONLY_on(PAD_SVl(ix));
1775 SvREFCNT_dec(cSVOPo->op_sv);
1777 else if (o->op_type != OP_METHOD_NAMED
1778 && cSVOPo->op_sv == &PL_sv_undef) {
1779 /* PL_sv_undef is hack - it's unsafe to store it in the
1780 AV that is the pad, because av_fetch treats values of
1781 PL_sv_undef as a "free" AV entry and will merrily
1782 replace them with a new SV, causing pad_alloc to think
1783 that this pad slot is free. (When, clearly, it is not)
1785 SvOK_off(PAD_SVl(ix));
1786 SvPADTMP_on(PAD_SVl(ix));
1787 SvREADONLY_on(PAD_SVl(ix));
1790 SvREFCNT_dec(PAD_SVl(ix));
1791 SvPADTMP_on(cSVOPo->op_sv);
1792 PAD_SETSV(ix, cSVOPo->op_sv);
1793 /* XXX I don't know how this isn't readonly already. */
1794 if (!SvIsCOW(PAD_SVl(ix))) SvREADONLY_on(PAD_SVl(ix));
1796 cSVOPo->op_sv = NULL;
1807 const char *key = NULL;
1810 if (((BINOP*)o)->op_last->op_type != OP_CONST)
1813 /* Make the CONST have a shared SV */
1814 svp = cSVOPx_svp(((BINOP*)o)->op_last);
1815 if ((!SvIsCOW(sv = *svp))
1816 && SvTYPE(sv) < SVt_PVMG && !SvROK(sv)) {
1817 key = SvPV_const(sv, keylen);
1818 lexname = newSVpvn_share(key,
1819 SvUTF8(sv) ? -(I32)keylen : (I32)keylen,
1821 SvREFCNT_dec_NN(sv);
1825 if ((o->op_private & (OPpLVAL_INTRO)))
1828 rop = (UNOP*)((BINOP*)o)->op_first;
1829 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
1831 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
1832 if (!SvPAD_TYPED(lexname))
1834 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
1835 if (!fields || !GvHV(*fields))
1837 key = SvPV_const(*svp, keylen);
1838 if (!hv_fetch(GvHV(*fields), key,
1839 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) {
1840 Perl_croak(aTHX_ "No such class field \"%"SVf"\" "
1841 "in variable %"SVf" of type %"HEKf,
1842 SVfARG(*svp), SVfARG(lexname),
1843 HEKfARG(HvNAME_HEK(SvSTASH(lexname))));
1855 SVOP *first_key_op, *key_op;
1857 if ((o->op_private & (OPpLVAL_INTRO))
1858 /* I bet there's always a pushmark... */
1859 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
1860 /* hmmm, no optimization if list contains only one key. */
1862 rop = (UNOP*)((LISTOP*)o)->op_last;
1863 if (rop->op_type != OP_RV2HV)
1865 if (rop->op_first->op_type == OP_PADSV)
1866 /* @$hash{qw(keys here)} */
1867 rop = (UNOP*)rop->op_first;
1869 /* @{$hash}{qw(keys here)} */
1870 if (rop->op_first->op_type == OP_SCOPE
1871 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
1873 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
1879 lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE);
1880 if (!SvPAD_TYPED(lexname))
1882 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
1883 if (!fields || !GvHV(*fields))
1885 /* Again guessing that the pushmark can be jumped over.... */
1886 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
1887 ->op_first->op_sibling;
1888 for (key_op = first_key_op; key_op;
1889 key_op = (SVOP*)key_op->op_sibling) {
1890 if (key_op->op_type != OP_CONST)
1892 svp = cSVOPx_svp(key_op);
1893 key = SvPV_const(*svp, keylen);
1894 if (!hv_fetch(GvHV(*fields), key,
1895 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) {
1896 Perl_croak(aTHX_ "No such class field \"%"SVf"\" "
1897 "in variable %"SVf" of type %"HEKf,
1898 SVfARG(*svp), SVfARG(lexname),
1899 HEKfARG(HvNAME_HEK(SvSTASH(lexname))));
1906 if (cPMOPo->op_pmreplrootu.op_pmreplroot)
1907 finalize_op(cPMOPo->op_pmreplrootu.op_pmreplroot);
1914 if (o->op_flags & OPf_KIDS) {
1916 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1922 =for apidoc Amx|OP *|op_lvalue|OP *o|I32 type
1924 Propagate lvalue ("modifiable") context to an op and its children.
1925 I<type> represents the context type, roughly based on the type of op that
1926 would do the modifying, although C<local()> is represented by OP_NULL,
1927 because it has no op type of its own (it is signalled by a flag on
1930 This function detects things that can't be modified, such as C<$x+1>, and
1931 generates errors for them. For example, C<$x+1 = 2> would cause it to be
1932 called with an op of type OP_ADD and a C<type> argument of OP_SASSIGN.
1934 It also flags things that need to behave specially in an lvalue context,
1935 such as C<$$x = 5> which might have to vivify a reference in C<$x>.
1941 Perl_op_lvalue_flags(pTHX_ OP *o, I32 type, U32 flags)
1945 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
1948 if (!o || (PL_parser && PL_parser->error_count))
1951 if ((o->op_private & OPpTARGET_MY)
1952 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1957 assert( (o->op_flags & OPf_WANT) != OPf_WANT_VOID );
1959 if (type == OP_PRTF || type == OP_SPRINTF) type = OP_ENTERSUB;
1961 switch (o->op_type) {
1966 if ((o->op_flags & OPf_PARENS) || PL_madskills)
1970 if ((type == OP_UNDEF || type == OP_REFGEN || type == OP_LOCK) &&
1971 !(o->op_flags & OPf_STACKED)) {
1972 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1973 /* Both ENTERSUB and RV2CV use this bit, but for different pur-
1974 poses, so we need it clear. */
1975 o->op_private &= ~1;
1976 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1977 assert(cUNOPo->op_first->op_type == OP_NULL);
1978 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1981 else { /* lvalue subroutine call */
1982 o->op_private |= OPpLVAL_INTRO
1983 |(OPpENTERSUB_INARGS * (type == OP_LEAVESUBLV));
1984 PL_modcount = RETURN_UNLIMITED_NUMBER;
1985 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1986 /* Potential lvalue context: */
1987 o->op_private |= OPpENTERSUB_INARGS;
1990 else { /* Compile-time error message: */
1991 OP *kid = cUNOPo->op_first;
1994 if (kid->op_type != OP_PUSHMARK) {
1995 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1997 "panic: unexpected lvalue entersub "
1998 "args: type/targ %ld:%"UVuf,
1999 (long)kid->op_type, (UV)kid->op_targ);
2000 kid = kLISTOP->op_first;
2002 while (kid->op_sibling)
2003 kid = kid->op_sibling;
2004 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
2005 break; /* Postpone until runtime */
2008 kid = kUNOP->op_first;
2009 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
2010 kid = kUNOP->op_first;
2011 if (kid->op_type == OP_NULL)
2013 "Unexpected constant lvalue entersub "
2014 "entry via type/targ %ld:%"UVuf,
2015 (long)kid->op_type, (UV)kid->op_targ);
2016 if (kid->op_type != OP_GV) {
2020 cv = GvCV(kGVOP_gv);
2030 if (flags & OP_LVALUE_NO_CROAK) return NULL;
2031 /* grep, foreach, subcalls, refgen */
2032 if (type == OP_GREPSTART || type == OP_ENTERSUB
2033 || type == OP_REFGEN || type == OP_LEAVESUBLV)
2035 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
2036 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
2038 : (o->op_type == OP_ENTERSUB
2039 ? "non-lvalue subroutine call"
2041 type ? PL_op_desc[type] : "local"));
2055 case OP_RIGHT_SHIFT:
2064 if (!(o->op_flags & OPf_STACKED))
2071 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
2072 op_lvalue(kid, type);
2077 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
2078 PL_modcount = RETURN_UNLIMITED_NUMBER;
2079 return o; /* Treat \(@foo) like ordinary list. */
2083 if (scalar_mod_type(o, type))
2085 ref(cUNOPo->op_first, o->op_type);
2092 if (type == OP_LEAVESUBLV)
2093 o->op_private |= OPpMAYBE_LVSUB;
2097 PL_modcount = RETURN_UNLIMITED_NUMBER;
2100 PL_hints |= HINT_BLOCK_SCOPE;
2101 if (type == OP_LEAVESUBLV)
2102 o->op_private |= OPpMAYBE_LVSUB;
2106 ref(cUNOPo->op_first, o->op_type);
2110 PL_hints |= HINT_BLOCK_SCOPE;
2119 case OP_AELEMFAST_LEX:
2126 PL_modcount = RETURN_UNLIMITED_NUMBER;
2127 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
2128 return o; /* Treat \(@foo) like ordinary list. */
2129 if (scalar_mod_type(o, type))
2131 if (type == OP_LEAVESUBLV)
2132 o->op_private |= OPpMAYBE_LVSUB;
2136 if (!type) /* local() */
2137 Perl_croak(aTHX_ "Can't localize lexical variable %"SVf,
2138 PAD_COMPNAME_SV(o->op_targ));
2147 if (type != OP_SASSIGN && type != OP_LEAVESUBLV)
2151 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
2157 if (type == OP_LEAVESUBLV)
2158 o->op_private |= OPpMAYBE_LVSUB;
2159 pad_free(o->op_targ);
2160 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
2161 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
2162 if (o->op_flags & OPf_KIDS)
2163 op_lvalue(cBINOPo->op_first->op_sibling, type);
2168 ref(cBINOPo->op_first, o->op_type);
2169 if (type == OP_ENTERSUB &&
2170 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
2171 o->op_private |= OPpLVAL_DEFER;
2172 if (type == OP_LEAVESUBLV)
2173 o->op_private |= OPpMAYBE_LVSUB;
2183 if (o->op_flags & OPf_KIDS)
2184 op_lvalue(cLISTOPo->op_last, type);
2189 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
2191 else if (!(o->op_flags & OPf_KIDS))
2193 if (o->op_targ != OP_LIST) {
2194 op_lvalue(cBINOPo->op_first, type);
2200 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2201 /* elements might be in void context because the list is
2202 in scalar context or because they are attribute sub calls */
2203 if ( (kid->op_flags & OPf_WANT) != OPf_WANT_VOID )
2204 op_lvalue(kid, type);
2208 if (type != OP_LEAVESUBLV)
2210 break; /* op_lvalue()ing was handled by ck_return() */
2216 /* [20011101.069] File test operators interpret OPf_REF to mean that
2217 their argument is a filehandle; thus \stat(".") should not set
2219 if (type == OP_REFGEN &&
2220 PL_check[o->op_type] == Perl_ck_ftst)
2223 if (type != OP_LEAVESUBLV)
2224 o->op_flags |= OPf_MOD;
2226 if (type == OP_AASSIGN || type == OP_SASSIGN)
2227 o->op_flags |= OPf_SPECIAL|OPf_REF;
2228 else if (!type) { /* local() */
2231 o->op_private |= OPpLVAL_INTRO;
2232 o->op_flags &= ~OPf_SPECIAL;
2233 PL_hints |= HINT_BLOCK_SCOPE;
2238 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
2239 "Useless localization of %s", OP_DESC(o));
2242 else if (type != OP_GREPSTART && type != OP_ENTERSUB
2243 && type != OP_LEAVESUBLV)
2244 o->op_flags |= OPf_REF;
2249 S_scalar_mod_type(const OP *o, I32 type)
2254 if (o && o->op_type == OP_RV2GV)
2278 case OP_RIGHT_SHIFT:
2299 S_is_handle_constructor(const OP *o, I32 numargs)
2301 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
2303 switch (o->op_type) {
2311 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
2324 S_refkids(pTHX_ OP *o, I32 type)
2326 if (o && o->op_flags & OPf_KIDS) {
2328 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2335 Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
2340 PERL_ARGS_ASSERT_DOREF;
2342 if (!o || (PL_parser && PL_parser->error_count))
2345 switch (o->op_type) {
2347 if ((type == OP_EXISTS || type == OP_DEFINED) &&
2348 !(o->op_flags & OPf_STACKED)) {
2349 o->op_type = OP_RV2CV; /* entersub => rv2cv */
2350 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
2351 assert(cUNOPo->op_first->op_type == OP_NULL);
2352 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
2353 o->op_flags |= OPf_SPECIAL;
2354 o->op_private &= ~1;
2356 else if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV){
2357 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2358 : type == OP_RV2HV ? OPpDEREF_HV
2360 o->op_flags |= OPf_MOD;
2366 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
2367 doref(kid, type, set_op_ref);
2370 if (type == OP_DEFINED)
2371 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2372 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2375 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2376 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2377 : type == OP_RV2HV ? OPpDEREF_HV
2379 o->op_flags |= OPf_MOD;
2386 o->op_flags |= OPf_REF;
2389 if (type == OP_DEFINED)
2390 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2391 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2397 o->op_flags |= OPf_REF;
2402 if (!(o->op_flags & OPf_KIDS) || type == OP_DEFINED)
2404 doref(cBINOPo->op_first, type, set_op_ref);
2408 doref(cBINOPo->op_first, o->op_type, set_op_ref);
2409 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2410 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2411 : type == OP_RV2HV ? OPpDEREF_HV
2413 o->op_flags |= OPf_MOD;
2423 if (!(o->op_flags & OPf_KIDS))
2425 doref(cLISTOPo->op_last, type, set_op_ref);
2435 S_dup_attrlist(pTHX_ OP *o)
2440 PERL_ARGS_ASSERT_DUP_ATTRLIST;
2442 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
2443 * where the first kid is OP_PUSHMARK and the remaining ones
2444 * are OP_CONST. We need to push the OP_CONST values.
2446 if (o->op_type == OP_CONST)
2447 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
2449 else if (o->op_type == OP_NULL)
2453 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
2455 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
2456 if (o->op_type == OP_CONST)
2457 rop = op_append_elem(OP_LIST, rop,
2458 newSVOP(OP_CONST, o->op_flags,
2459 SvREFCNT_inc_NN(cSVOPo->op_sv)));
2466 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
2469 SV * const stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2471 PERL_ARGS_ASSERT_APPLY_ATTRS;
2473 /* fake up C<use attributes $pkg,$rv,@attrs> */
2474 ENTER; /* need to protect against side-effects of 'use' */
2476 #define ATTRSMODULE "attributes"
2477 #define ATTRSMODULE_PM "attributes.pm"
2479 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2480 newSVpvs(ATTRSMODULE),
2482 op_prepend_elem(OP_LIST,
2483 newSVOP(OP_CONST, 0, stashsv),
2484 op_prepend_elem(OP_LIST,
2485 newSVOP(OP_CONST, 0,
2487 dup_attrlist(attrs))));
2492 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
2495 OP *pack, *imop, *arg;
2496 SV *meth, *stashsv, **svp;
2498 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
2503 assert(target->op_type == OP_PADSV ||
2504 target->op_type == OP_PADHV ||
2505 target->op_type == OP_PADAV);
2507 /* Ensure that attributes.pm is loaded. */
2508 ENTER; /* need to protect against side-effects of 'use' */
2509 /* Don't force the C<use> if we don't need it. */
2510 svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
2511 if (svp && *svp != &PL_sv_undef)
2512 NOOP; /* already in %INC */
2514 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
2515 newSVpvs(ATTRSMODULE), NULL);
2518 /* Need package name for method call. */
2519 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
2521 /* Build up the real arg-list. */
2522 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2524 arg = newOP(OP_PADSV, 0);
2525 arg->op_targ = target->op_targ;
2526 arg = op_prepend_elem(OP_LIST,
2527 newSVOP(OP_CONST, 0, stashsv),
2528 op_prepend_elem(OP_LIST,
2529 newUNOP(OP_REFGEN, 0,
2530 op_lvalue(arg, OP_REFGEN)),
2531 dup_attrlist(attrs)));
2533 /* Fake up a method call to import */
2534 meth = newSVpvs_share("import");
2535 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
2536 op_append_elem(OP_LIST,
2537 op_prepend_elem(OP_LIST, pack, list(arg)),
2538 newSVOP(OP_METHOD_NAMED, 0, meth)));
2540 /* Combine the ops. */
2541 *imopsp = op_append_elem(OP_LIST, *imopsp, imop);
2545 =notfor apidoc apply_attrs_string
2547 Attempts to apply a list of attributes specified by the C<attrstr> and
2548 C<len> arguments to the subroutine identified by the C<cv> argument which
2549 is expected to be associated with the package identified by the C<stashpv>
2550 argument (see L<attributes>). It gets this wrong, though, in that it
2551 does not correctly identify the boundaries of the individual attribute
2552 specifications within C<attrstr>. This is not really intended for the
2553 public API, but has to be listed here for systems such as AIX which
2554 need an explicit export list for symbols. (It's called from XS code
2555 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
2556 to respect attribute syntax properly would be welcome.
2562 Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
2563 const char *attrstr, STRLEN len)
2567 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2570 len = strlen(attrstr);
2574 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2576 const char * const sstr = attrstr;
2577 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2578 attrs = op_append_elem(OP_LIST, attrs,
2579 newSVOP(OP_CONST, 0,
2580 newSVpvn(sstr, attrstr-sstr)));
2584 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2585 newSVpvs(ATTRSMODULE),
2586 NULL, op_prepend_elem(OP_LIST,
2587 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2588 op_prepend_elem(OP_LIST,
2589 newSVOP(OP_CONST, 0,
2590 newRV(MUTABLE_SV(cv))),
2595 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
2599 const bool stately = PL_parser && PL_parser->in_my == KEY_state;
2601 PERL_ARGS_ASSERT_MY_KID;
2603 if (!o || (PL_parser && PL_parser->error_count))
2607 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2608 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2612 if (type == OP_LIST) {
2614 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2615 my_kid(kid, attrs, imopsp);
2617 } else if (type == OP_UNDEF || type == OP_STUB) {
2619 } else if (type == OP_RV2SV || /* "our" declaration */
2621 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
2622 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
2623 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2625 PL_parser->in_my == KEY_our
2627 : PL_parser->in_my == KEY_state ? "state" : "my"));
2629 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
2630 PL_parser->in_my = FALSE;
2631 PL_parser->in_my_stash = NULL;
2632 apply_attrs(GvSTASH(gv),
2633 (type == OP_RV2SV ? GvSV(gv) :
2634 type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) :
2635 type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)),
2638 o->op_private |= OPpOUR_INTRO;
2641 else if (type != OP_PADSV &&
2644 type != OP_PUSHMARK)
2646 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2648 PL_parser->in_my == KEY_our
2650 : PL_parser->in_my == KEY_state ? "state" : "my"));
2653 else if (attrs && type != OP_PUSHMARK) {
2656 PL_parser->in_my = FALSE;
2657 PL_parser->in_my_stash = NULL;
2659 /* check for C<my Dog $spot> when deciding package */
2660 stash = PAD_COMPNAME_TYPE(o->op_targ);
2662 stash = PL_curstash;
2663 apply_attrs_my(stash, o, attrs, imopsp);
2665 o->op_flags |= OPf_MOD;
2666 o->op_private |= OPpLVAL_INTRO;
2668 o->op_private |= OPpPAD_STATE;
2673 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2677 int maybe_scalar = 0;
2679 PERL_ARGS_ASSERT_MY_ATTRS;
2681 /* [perl #17376]: this appears to be premature, and results in code such as
2682 C< our(%x); > executing in list mode rather than void mode */
2684 if (o->op_flags & OPf_PARENS)
2694 o = my_kid(o, attrs, &rops);
2696 if (maybe_scalar && o->op_type == OP_PADSV) {
2697 o = scalar(op_append_list(OP_LIST, rops, o));
2698 o->op_private |= OPpLVAL_INTRO;
2701 /* The listop in rops might have a pushmark at the beginning,
2702 which will mess up list assignment. */
2703 LISTOP * const lrops = (LISTOP *)rops; /* for brevity */
2704 if (rops->op_type == OP_LIST &&
2705 lrops->op_first && lrops->op_first->op_type == OP_PUSHMARK)
2707 OP * const pushmark = lrops->op_first;
2708 lrops->op_first = pushmark->op_sibling;
2711 o = op_append_list(OP_LIST, o, rops);
2714 PL_parser->in_my = FALSE;
2715 PL_parser->in_my_stash = NULL;
2720 Perl_sawparens(pTHX_ OP *o)
2722 PERL_UNUSED_CONTEXT;
2724 o->op_flags |= OPf_PARENS;
2729 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2733 const OPCODE ltype = left->op_type;
2734 const OPCODE rtype = right->op_type;
2736 PERL_ARGS_ASSERT_BIND_MATCH;
2738 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2739 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
2741 const char * const desc
2743 rtype == OP_SUBST || rtype == OP_TRANS
2744 || rtype == OP_TRANSR
2746 ? (int)rtype : OP_MATCH];
2747 const bool isary = ltype == OP_RV2AV || ltype == OP_PADAV;
2750 (ltype == OP_RV2AV || ltype == OP_RV2HV)
2751 ? cUNOPx(left)->op_first->op_type == OP_GV
2752 && (gv = cGVOPx_gv(cUNOPx(left)->op_first))
2753 ? varname(gv, isary ? '@' : '%', 0, NULL, 0, 1)
2756 (GV *)PL_compcv, isary ? '@' : '%', left->op_targ, NULL, 0, 1
2759 Perl_warner(aTHX_ packWARN(WARN_MISC),
2760 "Applying %s to %"SVf" will act on scalar(%"SVf")",
2763 const char * const sample = (isary
2764 ? "@array" : "%hash");
2765 Perl_warner(aTHX_ packWARN(WARN_MISC),
2766 "Applying %s to %s will act on scalar(%s)",
2767 desc, sample, sample);
2771 if (rtype == OP_CONST &&
2772 cSVOPx(right)->op_private & OPpCONST_BARE &&
2773 cSVOPx(right)->op_private & OPpCONST_STRICT)
2775 no_bareword_allowed(right);
2778 /* !~ doesn't make sense with /r, so error on it for now */
2779 if (rtype == OP_SUBST && (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT) &&
2781 yyerror("Using !~ with s///r doesn't make sense");
2782 if (rtype == OP_TRANSR && type == OP_NOT)
2783 yyerror("Using !~ with tr///r doesn't make sense");
2785 ismatchop = (rtype == OP_MATCH ||
2786 rtype == OP_SUBST ||
2787 rtype == OP_TRANS || rtype == OP_TRANSR)
2788 && !(right->op_flags & OPf_SPECIAL);
2789 if (ismatchop && right->op_private & OPpTARGET_MY) {
2791 right->op_private &= ~OPpTARGET_MY;
2793 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
2796 right->op_flags |= OPf_STACKED;
2797 if (rtype != OP_MATCH && rtype != OP_TRANSR &&
2798 ! (rtype == OP_TRANS &&
2799 right->op_private & OPpTRANS_IDENTICAL) &&
2800 ! (rtype == OP_SUBST &&
2801 (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT)))
2802 newleft = op_lvalue(left, rtype);
2805 if (right->op_type == OP_TRANS || right->op_type == OP_TRANSR)
2806 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
2808 o = op_prepend_elem(rtype, scalar(newleft), right);
2810 return newUNOP(OP_NOT, 0, scalar(o));
2814 return bind_match(type, left,
2815 pmruntime(newPMOP(OP_MATCH, 0), right, 0, 0));
2819 Perl_invert(pTHX_ OP *o)
2823 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2827 =for apidoc Amx|OP *|op_scope|OP *o
2829 Wraps up an op tree with some additional ops so that at runtime a dynamic
2830 scope will be created. The original ops run in the new dynamic scope,
2831 and then, provided that they exit normally, the scope will be unwound.
2832 The additional ops used to create and unwind the dynamic scope will
2833 normally be an C<enter>/C<leave> pair, but a C<scope> op may be used
2834 instead if the ops are simple enough to not need the full dynamic scope
2841 Perl_op_scope(pTHX_ OP *o)
2845 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || TAINTING_get) {
2846 o = op_prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2847 o->op_type = OP_LEAVE;
2848 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2850 else if (o->op_type == OP_LINESEQ) {
2852 o->op_type = OP_SCOPE;
2853 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2854 kid = ((LISTOP*)o)->op_first;
2855 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2858 /* The following deals with things like 'do {1 for 1}' */
2859 kid = kid->op_sibling;
2861 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
2866 o = newLISTOP(OP_SCOPE, 0, o, NULL);
2872 Perl_op_unscope(pTHX_ OP *o)
2874 if (o && o->op_type == OP_LINESEQ) {
2875 OP *kid = cLISTOPo->op_first;
2876 for(; kid; kid = kid->op_sibling)
2877 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
2884 Perl_block_start(pTHX_ int full)
2887 const int retval = PL_savestack_ix;
2889 pad_block_start(full);
2891 PL_hints &= ~HINT_BLOCK_SCOPE;
2892 SAVECOMPILEWARNINGS();
2893 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
2895 CALL_BLOCK_HOOKS(bhk_start, full);
2901 Perl_block_end(pTHX_ I32 floor, OP *seq)
2904 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2905 OP* retval = scalarseq(seq);
2908 CALL_BLOCK_HOOKS(bhk_pre_end, &retval);
2911 CopHINTS_set(&PL_compiling, PL_hints);
2913 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2917 /* pad_leavemy has created a sequence of introcv ops for all my
2918 subs declared in the block. We have to replicate that list with
2919 clonecv ops, to deal with this situation:
2924 sub s1 { state sub foo { \&s2 } }
2927 Originally, I was going to have introcv clone the CV and turn
2928 off the stale flag. Since &s1 is declared before &s2, the
2929 introcv op for &s1 is executed (on sub entry) before the one for
2930 &s2. But the &foo sub inside &s1 (which is cloned when &s1 is
2931 cloned, since it is a state sub) closes over &s2 and expects
2932 to see it in its outer CV’s pad. If the introcv op clones &s1,
2933 then &s2 is still marked stale. Since &s1 is not active, and
2934 &foo closes over &s1’s implicit entry for &s2, we get a ‘Varia-
2935 ble will not stay shared’ warning. Because it is the same stub
2936 that will be used when the introcv op for &s2 is executed, clos-
2937 ing over it is safe. Hence, we have to turn off the stale flag
2938 on all lexical subs in the block before we clone any of them.
2939 Hence, having introcv clone the sub cannot work. So we create a
2940 list of ops like this:
2964 OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : o;
2965 OP * const last = o->op_flags & OPf_KIDS ? cLISTOPo->op_last : o;
2966 for (;; kid = kid->op_sibling) {
2967 OP *newkid = newOP(OP_CLONECV, 0);
2968 newkid->op_targ = kid->op_targ;
2969 o = op_append_elem(OP_LINESEQ, o, newkid);
2970 if (kid == last) break;
2972 retval = op_prepend_elem(OP_LINESEQ, o, retval);
2975 CALL_BLOCK_HOOKS(bhk_post_end, &retval);
2981 =head1 Compile-time scope hooks
2983 =for apidoc Aox||blockhook_register
2985 Register a set of hooks to be called when the Perl lexical scope changes
2986 at compile time. See L<perlguts/"Compile-time scope hooks">.
2992 Perl_blockhook_register(pTHX_ BHK *hk)
2994 PERL_ARGS_ASSERT_BLOCKHOOK_REGISTER;
2996 Perl_av_create_and_push(aTHX_ &PL_blockhooks, newSViv(PTR2IV(hk)));
3003 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
3004 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
3005 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
3008 OP * const o = newOP(OP_PADSV, 0);
3009 o->op_targ = offset;
3015 Perl_newPROG(pTHX_ OP *o)
3019 PERL_ARGS_ASSERT_NEWPROG;
3026 PL_eval_root = newUNOP(OP_LEAVEEVAL,
3027 ((PL_in_eval & EVAL_KEEPERR)
3028 ? OPf_SPECIAL : 0), o);
3030 cx = &cxstack[cxstack_ix];
3031 assert(CxTYPE(cx) == CXt_EVAL);
3033 if ((cx->blk_gimme & G_WANT) == G_VOID)
3034 scalarvoid(PL_eval_root);
3035 else if ((cx->blk_gimme & G_WANT) == G_ARRAY)
3038 scalar(PL_eval_root);
3040 PL_eval_start = op_linklist(PL_eval_root);
3041 PL_eval_root->op_private |= OPpREFCOUNTED;
3042 OpREFCNT_set(PL_eval_root, 1);
3043 PL_eval_root->op_next = 0;
3044 i = PL_savestack_ix;
3047 CALL_PEEP(PL_eval_start);
3048 finalize_optree(PL_eval_root);
3050 PL_savestack_ix = i;
3053 if (o->op_type == OP_STUB) {
3054 /* This block is entered if nothing is compiled for the main
3055 program. This will be the case for an genuinely empty main
3056 program, or one which only has BEGIN blocks etc, so already
3059 Historically (5.000) the guard above was !o. However, commit
3060 f8a08f7b8bd67b28 (Jun 2001), integrated to blead as
3061 c71fccf11fde0068, changed perly.y so that newPROG() is now
3062 called with the output of block_end(), which returns a new
3063 OP_STUB for the case of an empty optree. ByteLoader (and
3064 maybe other things) also take this path, because they set up
3065 PL_main_start and PL_main_root directly, without generating an
3068 If the parsing the main program aborts (due to parse errors,
3069 or due to BEGIN or similar calling exit), then newPROG()
3070 isn't even called, and hence this code path and its cleanups
3071 are skipped. This shouldn't make a make a difference:
3072 * a non-zero return from perl_parse is a failure, and
3073 perl_destruct() should be called immediately.
3074 * however, if exit(0) is called during the parse, then
3075 perl_parse() returns 0, and perl_run() is called. As
3076 PL_main_start will be NULL, perl_run() will return
3077 promptly, and the exit code will remain 0.
3080 PL_comppad_name = 0;
3082 S_op_destroy(aTHX_ o);
3085 PL_main_root = op_scope(sawparens(scalarvoid(o)));
3086 PL_curcop = &PL_compiling;
3087 PL_main_start = LINKLIST(PL_main_root);
3088 PL_main_root->op_private |= OPpREFCOUNTED;
3089 OpREFCNT_set(PL_main_root, 1);
3090 PL_main_root->op_next = 0;
3091 CALL_PEEP(PL_main_start);
3092 finalize_optree(PL_main_root);
3093 cv_forget_slab(PL_compcv);
3096 /* Register with debugger */
3098 CV * const cv = get_cvs("DB::postponed", 0);
3102 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
3104 call_sv(MUTABLE_SV(cv), G_DISCARD);
3111 Perl_localize(pTHX_ OP *o, I32 lex)
3115 PERL_ARGS_ASSERT_LOCALIZE;
3117 if (o->op_flags & OPf_PARENS)
3118 /* [perl #17376]: this appears to be premature, and results in code such as
3119 C< our(%x); > executing in list mode rather than void mode */
3126 if ( PL_parser->bufptr > PL_parser->oldbufptr
3127 && PL_parser->bufptr[-1] == ','
3128 && ckWARN(WARN_PARENTHESIS))
3130 char *s = PL_parser->bufptr;
3133 /* some heuristics to detect a potential error */
3134 while (*s && (strchr(", \t\n", *s)))
3138 if (*s && strchr("@$%*", *s) && *++s
3139 && (isWORDCHAR(*s) || UTF8_IS_CONTINUED(*s))) {
3142 while (*s && (isWORDCHAR(*s) || UTF8_IS_CONTINUED(*s)))
3144 while (*s && (strchr(", \t\n", *s)))
3150 if (sigil && (*s == ';' || *s == '=')) {
3151 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
3152 "Parentheses missing around \"%s\" list",
3154 ? (PL_parser->in_my == KEY_our
3156 : PL_parser->in_my == KEY_state
3166 o = op_lvalue(o, OP_NULL); /* a bit kludgey */
3167 PL_parser->in_my = FALSE;
3168 PL_parser->in_my_stash = NULL;
3173 Perl_jmaybe(pTHX_ OP *o)
3175 PERL_ARGS_ASSERT_JMAYBE;
3177 if (o->op_type == OP_LIST) {
3179 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
3180 o = convert(OP_JOIN, 0, op_prepend_elem(OP_LIST, o2, o));
3185 PERL_STATIC_INLINE OP *
3186 S_op_std_init(pTHX_ OP *o)
3188 I32 type = o->op_type;
3190 PERL_ARGS_ASSERT_OP_STD_INIT;
3192 if (PL_opargs[type] & OA_RETSCALAR)
3194 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
3195 o->op_targ = pad_alloc(type, SVs_PADTMP);
3200 PERL_STATIC_INLINE OP *
3201 S_op_integerize(pTHX_ OP *o)
3203 I32 type = o->op_type;
3205 PERL_ARGS_ASSERT_OP_INTEGERIZE;
3207 /* integerize op. */
3208 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
3211 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
3214 if (type == OP_NEGATE)
3215 /* XXX might want a ck_negate() for this */
3216 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
3222 S_fold_constants(pTHX_ OP *o)
3227 VOL I32 type = o->op_type;
3232 SV * const oldwarnhook = PL_warnhook;
3233 SV * const olddiehook = PL_diehook;
3237 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
3239 if (!(PL_opargs[type] & OA_FOLDCONST))
3254 /* XXX what about the numeric ops? */
3255 if (IN_LOCALE_COMPILETIME)
3259 if (!cLISTOPo->op_first->op_sibling
3260 || cLISTOPo->op_first->op_sibling->op_type != OP_CONST)
3263 SV * const sv = cSVOPx_sv(cLISTOPo->op_first->op_sibling);
3264 if (!SvPOK(sv) || SvGMAGICAL(sv)) goto nope;
3266 const char *s = SvPVX_const(sv);
3267 while (s < SvEND(sv)) {
3268 if (*s == 'p' || *s == 'P') goto nope;
3275 if (o->op_private & OPpREPEAT_DOLIST) goto nope;
3278 if (PL_parser && PL_parser->error_count)
3279 goto nope; /* Don't try to run w/ errors */
3281 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3282 const OPCODE type = curop->op_type;
3283 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
3285 type != OP_SCALAR &&
3287 type != OP_PUSHMARK)
3293 curop = LINKLIST(o);
3294 old_next = o->op_next;
3298 oldscope = PL_scopestack_ix;
3299 create_eval_scope(G_FAKINGEVAL);
3301 /* Verify that we don't need to save it: */
3302 assert(PL_curcop == &PL_compiling);
3303 StructCopy(&PL_compiling, ¬_compiling, COP);
3304 PL_curcop = ¬_compiling;
3305 /* The above ensures that we run with all the correct hints of the
3306 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
3307 assert(IN_PERL_RUNTIME);
3308 PL_warnhook = PERL_WARNHOOK_FATAL;
3315 sv = *(PL_stack_sp--);
3316 if (o->op_targ && sv == PAD_SV(o->op_targ)) { /* grab pad temp? */
3318 /* Can't simply swipe the SV from the pad, because that relies on
3319 the op being freed "real soon now". Under MAD, this doesn't
3320 happen (see the #ifdef below). */
3323 pad_swipe(o->op_targ, FALSE);
3326 else if (SvTEMP(sv)) { /* grab mortal temp? */
3327 SvREFCNT_inc_simple_void(sv);
3332 /* Something tried to die. Abandon constant folding. */
3333 /* Pretend the error never happened. */
3335 o->op_next = old_next;
3339 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
3340 PL_warnhook = oldwarnhook;
3341 PL_diehook = olddiehook;
3342 /* XXX note that this croak may fail as we've already blown away
3343 * the stack - eg any nested evals */
3344 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
3347 PL_warnhook = oldwarnhook;
3348 PL_diehook = olddiehook;
3349 PL_curcop = &PL_compiling;
3351 if (PL_scopestack_ix > oldscope)
3352 delete_eval_scope();
3361 if (type == OP_RV2GV)
3362 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
3364 newop = newSVOP(OP_CONST, OPpCONST_FOLDED<<8, MUTABLE_SV(sv));
3365 op_getmad(o,newop,'f');
3373 S_gen_constant_list(pTHX_ OP *o)
3377 const I32 oldtmps_floor = PL_tmps_floor;
3380 if (PL_parser && PL_parser->error_count)
3381 return o; /* Don't attempt to run with errors */
3383 PL_op = curop = LINKLIST(o);
3386 Perl_pp_pushmark(aTHX);
3389 assert (!(curop->op_flags & OPf_SPECIAL));
3390 assert(curop->op_type == OP_RANGE);
3391 Perl_pp_anonlist(aTHX);
3392 PL_tmps_floor = oldtmps_floor;
3394 o->op_type = OP_RV2AV;
3395 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
3396 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
3397 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
3398 o->op_opt = 0; /* needs to be revisited in rpeep() */
3399 curop = ((UNOP*)o)->op_first;
3400 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
3402 op_getmad(curop,o,'O');
3411 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
3414 if (type < 0) type = -type, flags |= OPf_SPECIAL;
3415 if (!o || o->op_type != OP_LIST)
3416 o = newLISTOP(OP_LIST, 0, o, NULL);
3418 o->op_flags &= ~OPf_WANT;
3420 if (!(PL_opargs[type] & OA_MARK))
3421 op_null(cLISTOPo->op_first);
3423 OP * const kid2 = cLISTOPo->op_first->op_sibling;
3424 if (kid2 && kid2->op_type == OP_COREARGS) {
3425 op_null(cLISTOPo->op_first);
3426 kid2->op_private |= OPpCOREARGS_PUSHMARK;
3430 o->op_type = (OPCODE)type;
3431 o->op_ppaddr = PL_ppaddr[type];
3432 o->op_flags |= flags;
3434 o = CHECKOP(type, o);
3435 if (o->op_type != (unsigned)type)
3438 return fold_constants(op_integerize(op_std_init(o)));
3442 =head1 Optree Manipulation Functions
3445 /* List constructors */
3448 =for apidoc Am|OP *|op_append_elem|I32 optype|OP *first|OP *last
3450 Append an item to the list of ops contained directly within a list-type
3451 op, returning the lengthened list. I<first> is the list-type op,
3452 and I<last> is the op to append to the list. I<optype> specifies the
3453 intended opcode for the list. If I<first> is not already a list of the
3454 right type, it will be upgraded into one. If either I<first> or I<last>
3455 is null, the other is returned unchanged.
3461 Perl_op_append_elem(pTHX_ I32 type, OP *first, OP *last)
3469 if (first->op_type != (unsigned)type
3470 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
3472 return newLISTOP(type, 0, first, last);
3475 if (first->op_flags & OPf_KIDS)
3476 ((LISTOP*)first)->op_last->op_sibling = last;
3478 first->op_flags |= OPf_KIDS;
3479 ((LISTOP*)first)->op_first = last;
3481 ((LISTOP*)first)->op_last = last;
3486 =for apidoc Am|OP *|op_append_list|I32 optype|OP *first|OP *last
3488 Concatenate the lists of ops contained directly within two list-type ops,
3489 returning the combined list. I<first> and I<last> are the list-type ops
3490 to concatenate. I<optype> specifies the intended opcode for the list.
3491 If either I<first> or I<last> is not already a list of the right type,
3492 it will be upgraded into one. If either I<first> or I<last> is null,
3493 the other is returned unchanged.
3499 Perl_op_append_list(pTHX_ I32 type, OP *first, OP *last)
3507 if (first->op_type != (unsigned)type)
3508 return op_prepend_elem(type, first, last);
3510 if (last->op_type != (unsigned)type)
3511 return op_append_elem(type, first, last);
3513 ((LISTOP*)first)->op_last->op_sibling = ((LISTOP*)last)->op_first;
3514 ((LISTOP*)first)->op_last = ((LISTOP*)last)->op_last;
3515 first->op_flags |= (last->op_flags & OPf_KIDS);
3518 if (((LISTOP*)last)->op_first && first->op_madprop) {
3519 MADPROP *mp = ((LISTOP*)last)->op_first->op_madprop;
3521 while (mp->mad_next)
3523 mp->mad_next = first->op_madprop;
3526 ((LISTOP*)last)->op_first->op_madprop = first->op_madprop;
3529 first->op_madprop = last->op_madprop;
3530 last->op_madprop = 0;
3533 S_op_destroy(aTHX_ last);
3539 =for apidoc Am|OP *|op_prepend_elem|I32 optype|OP *first|OP *last
3541 Prepend an item to the list of ops contained directly within a list-type
3542 op, returning the lengthened list. I<first> is the op to prepend to the
3543 list, and I<last> is the list-type op. I<optype> specifies the intended
3544 opcode for the list. If I<last> is not already a list of the right type,
3545 it will be upgraded into one. If either I<first> or I<last> is null,
3546 the other is returned unchanged.
3552 Perl_op_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
3560 if (last->op_type == (unsigned)type) {
3561 if (type == OP_LIST) { /* already a PUSHMARK there */
3562 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
3563 ((LISTOP*)last)->op_first->op_sibling = first;
3564 if (!(first->op_flags & OPf_PARENS))
3565 last->op_flags &= ~OPf_PARENS;
3568 if (!(last->op_flags & OPf_KIDS)) {
3569 ((LISTOP*)last)->op_last = first;
3570 last->op_flags |= OPf_KIDS;
3572 first->op_sibling = ((LISTOP*)last)->op_first;
3573 ((LISTOP*)last)->op_first = first;
3575 last->op_flags |= OPf_KIDS;
3579 return newLISTOP(type, 0, first, last);
3587 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
3590 Newxz(tk, 1, TOKEN);
3591 tk->tk_type = (OPCODE)optype;
3592 tk->tk_type = 12345;
3594 tk->tk_mad = madprop;
3599 Perl_token_free(pTHX_ TOKEN* tk)
3601 PERL_ARGS_ASSERT_TOKEN_FREE;
3603 if (tk->tk_type != 12345)
3605 mad_free(tk->tk_mad);
3610 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
3615 PERL_ARGS_ASSERT_TOKEN_GETMAD;
3617 if (tk->tk_type != 12345) {
3618 Perl_warner(aTHX_ packWARN(WARN_MISC),
3619 "Invalid TOKEN object ignored");
3626 /* faked up qw list? */
3628 tm->mad_type == MAD_SV &&
3629 SvPVX((SV *)tm->mad_val)[0] == 'q')
3636 /* pretend constant fold didn't happen? */
3637 if (mp->mad_key == 'f' &&
3638 (o->op_type == OP_CONST ||
3639 o->op_type == OP_GV) )
3641 token_getmad(tk,(OP*)mp->mad_val,slot);
3655 if (mp->mad_key == 'X')
3656 mp->mad_key = slot; /* just change the first one */
3666 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
3675 /* pretend constant fold didn't happen? */
3676 if (mp->mad_key == 'f' &&
3677 (o->op_type == OP_CONST ||
3678 o->op_type == OP_GV) )
3680 op_getmad(from,(OP*)mp->mad_val,slot);
3687 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
3690 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
3696 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
3705 /* pretend constant fold didn't happen? */
3706 if (mp->mad_key == 'f' &&
3707 (o->op_type == OP_CONST ||
3708 o->op_type == OP_GV) )
3710 op_getmad(from,(OP*)mp->mad_val,slot);
3717 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
3720 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
3724 PerlIO_printf(PerlIO_stderr(),
3725 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
3731 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
3749 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
3753 addmad(tm, &(o->op_madprop), slot);
3757 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
3778 Perl_newMADsv(pTHX_ char key, SV* sv)
3780 PERL_ARGS_ASSERT_NEWMADSV;
3782 return newMADPROP(key, MAD_SV, sv, 0);
3786 Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
3788 MADPROP *const mp = (MADPROP *) PerlMemShared_malloc(sizeof(MADPROP));
3791 mp->mad_vlen = vlen;
3792 mp->mad_type = type;
3794 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
3799 Perl_mad_free(pTHX_ MADPROP* mp)
3801 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
3805 mad_free(mp->mad_next);
3806 /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
3807 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
3808 switch (mp->mad_type) {
3812 Safefree(mp->mad_val);
3815 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
3816 op_free((OP*)mp->mad_val);
3819 sv_free(MUTABLE_SV(mp->mad_val));
3822 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
3825 PerlMemShared_free(mp);
3831 =head1 Optree construction
3833 =for apidoc Am|OP *|newNULLLIST
3835 Constructs, checks, and returns a new C<stub> op, which represents an
3836 empty list expression.
3842 Perl_newNULLLIST(pTHX)
3844 return newOP(OP_STUB, 0);
3848 S_force_list(pTHX_ OP *o)
3850 if (!o || o->op_type != OP_LIST)
3851 o = newLISTOP(OP_LIST, 0, o, NULL);
3857 =for apidoc Am|OP *|newLISTOP|I32 type|I32 flags|OP *first|OP *last
3859 Constructs, checks, and returns an op of any list type. I<type> is
3860 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3861 C<OPf_KIDS> will be set automatically if required. I<first> and I<last>
3862 supply up to two ops to be direct children of the list op; they are
3863 consumed by this function and become part of the constructed op tree.
3869 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3874 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP);
3876 NewOp(1101, listop, 1, LISTOP);
3878 listop->op_type = (OPCODE)type;
3879 listop->op_ppaddr = PL_ppaddr[type];
3882 listop->op_flags = (U8)flags;
3886 else if (!first && last)
3889 first->op_sibling = last;
3890 listop->op_first = first;
3891 listop->op_last = last;
3892 if (type == OP_LIST) {
3893 OP* const pushop = newOP(OP_PUSHMARK, 0);
3894 pushop->op_sibling = first;
3895 listop->op_first = pushop;
3896 listop->op_flags |= OPf_KIDS;
3898 listop->op_last = pushop;
3901 return CHECKOP(type, listop);
3905 =for apidoc Am|OP *|newOP|I32 type|I32 flags
3907 Constructs, checks, and returns an op of any base type (any type that
3908 has no extra fields). I<type> is the opcode. I<flags> gives the
3909 eight bits of C<op_flags>, and, shifted up eight bits, the eight bits
3916 Perl_newOP(pTHX_ I32 type, I32 flags)
3921 if (type == -OP_ENTEREVAL) {
3922 type = OP_ENTEREVAL;
3923 flags |= OPpEVAL_BYTES<<8;
3926 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP
3927 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3928 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3929 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
3931 NewOp(1101, o, 1, OP);
3932 o->op_type = (OPCODE)type;
3933 o->op_ppaddr = PL_ppaddr[type];
3934 o->op_flags = (U8)flags;
3937 o->op_private = (U8)(0 | (flags >> 8));
3938 if (PL_opargs[type] & OA_RETSCALAR)
3940 if (PL_opargs[type] & OA_TARGET)
3941 o->op_targ = pad_alloc(type, SVs_PADTMP);
3942 return CHECKOP(type, o);
3946 =for apidoc Am|OP *|newUNOP|I32 type|I32 flags|OP *first
3948 Constructs, checks, and returns an op of any unary type. I<type> is
3949 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3950 C<OPf_KIDS> will be set automatically if required, and, shifted up eight
3951 bits, the eight bits of C<op_private>, except that the bit with value 1
3952 is automatically set. I<first> supplies an optional op to be the direct
3953 child of the unary op; it is consumed by this function and become part
3954 of the constructed op tree.
3960 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
3965 if (type == -OP_ENTEREVAL) {
3966 type = OP_ENTEREVAL;
3967 flags |= OPpEVAL_BYTES<<8;
3970 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP
3971 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3972 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3973 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP
3974 || type == OP_SASSIGN
3975 || type == OP_ENTERTRY
3976 || type == OP_NULL );
3979 first = newOP(OP_STUB, 0);
3980 if (PL_opargs[type] & OA_MARK)
3981 first = force_list(first);
3983 NewOp(1101, unop, 1, UNOP);
3984 unop->op_type = (OPCODE)type;
3985 unop->op_ppaddr = PL_ppaddr[type];
3986 unop->op_first = first;
3987 unop->op_flags = (U8)(flags | OPf_KIDS);
3988 unop->op_private = (U8)(1 | (flags >> 8));
3989 unop = (UNOP*) CHECKOP(type, unop);
3993 return fold_constants(op_integerize(op_std_init((OP *) unop)));
3997 =for apidoc Am|OP *|newBINOP|I32 type|I32 flags|OP *first|OP *last
3999 Constructs, checks, and returns an op of any binary type. I<type>
4000 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
4001 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
4002 the eight bits of C<op_private>, except that the bit with value 1 or
4003 2 is automatically set as required. I<first> and I<last> supply up to
4004 two ops to be the direct children of the binary op; they are consumed
4005 by this function and become part of the constructed op tree.
4011 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
4016 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP
4017 || type == OP_SASSIGN || type == OP_NULL );
4019 NewOp(1101, binop, 1, BINOP);
4022 first = newOP(OP_NULL, 0);
4024 binop->op_type = (OPCODE)type;
4025 binop->op_ppaddr = PL_ppaddr[type];
4026 binop->op_first = first;
4027 binop->op_flags = (U8)(flags | OPf_KIDS);
4030 binop->op_private = (U8)(1 | (flags >> 8));
4033 binop->op_private = (U8)(2 | (flags >> 8));
4034 first->op_sibling = last;
4037 binop = (BINOP*)CHECKOP(type, binop);
4038 if (binop->op_next || binop->op_type != (OPCODE)type)
4041 binop->op_last = binop->op_first->op_sibling;
4043 return fold_constants(op_integerize(op_std_init((OP *)binop)));
4046 static int uvcompare(const void *a, const void *b)
4047 __attribute__nonnull__(1)
4048 __attribute__nonnull__(2)
4049 __attribute__pure__;
4050 static int uvcompare(const void *a, const void *b)
4052 if (*((const UV *)a) < (*(const UV *)b))
4054 if (*((const UV *)a) > (*(const UV *)b))
4056 if (*((const UV *)a+1) < (*(const UV *)b+1))
4058 if (*((const UV *)a+1) > (*(const UV *)b+1))
4064 S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
4067 SV * const tstr = ((SVOP*)expr)->op_sv;
4070 (repl->op_type == OP_NULL)
4071 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
4073 ((SVOP*)repl)->op_sv;
4076 const U8 *t = (U8*)SvPV_const(tstr, tlen);
4077 const U8 *r = (U8*)SvPV_const(rstr, rlen);
4083 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
4084 const I32 squash = o->op_private & OPpTRANS_SQUASH;
4085 I32 del = o->op_private & OPpTRANS_DELETE;
4088 PERL_ARGS_ASSERT_PMTRANS;
4090 PL_hints |= HINT_BLOCK_SCOPE;
4093 o->op_private |= OPpTRANS_FROM_UTF;
4096 o->op_private |= OPpTRANS_TO_UTF;
4098 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
4099 SV* const listsv = newSVpvs("# comment\n");
4101 const U8* tend = t + tlen;
4102 const U8* rend = r + rlen;
4116 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
4117 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
4120 const U32 flags = UTF8_ALLOW_DEFAULT;
4124 t = tsave = bytes_to_utf8(t, &len);
4127 if (!to_utf && rlen) {
4129 r = rsave = bytes_to_utf8(r, &len);
4133 /* There are several snags with this code on EBCDIC:
4134 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
4135 2. scan_const() in toke.c has encoded chars in native encoding which makes
4136 ranges at least in EBCDIC 0..255 range the bottom odd.
4140 U8 tmpbuf[UTF8_MAXBYTES+1];
4143 Newx(cp, 2*tlen, UV);
4145 transv = newSVpvs("");
4147 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
4149 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
4151 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
4155 cp[2*i+1] = cp[2*i];
4159 qsort(cp, i, 2*sizeof(UV), uvcompare);
4160 for (j = 0; j < i; j++) {
4162 diff = val - nextmin;
4164 t = uvuni_to_utf8(tmpbuf,nextmin);
4165 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4167 U8 range_mark = UTF_TO_NATIVE(0xff);
4168 t = uvuni_to_utf8(tmpbuf, val - 1);
4169 sv_catpvn(transv, (char *)&range_mark, 1);
4170 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4177 t = uvuni_to_utf8(tmpbuf,nextmin);
4178 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4180 U8 range_mark = UTF_TO_NATIVE(0xff);
4181 sv_catpvn(transv, (char *)&range_mark, 1);
4183 t = uvuni_to_utf8(tmpbuf, 0x7fffffff);
4184 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4185 t = (const U8*)SvPVX_const(transv);
4186 tlen = SvCUR(transv);
4190 else if (!rlen && !del) {
4191 r = t; rlen = tlen; rend = tend;
4194 if ((!rlen && !del) || t == r ||
4195 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
4197 o->op_private |= OPpTRANS_IDENTICAL;
4201 while (t < tend || tfirst <= tlast) {
4202 /* see if we need more "t" chars */
4203 if (tfirst > tlast) {
4204 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
4206 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
4208 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
4215 /* now see if we need more "r" chars */
4216 if (rfirst > rlast) {
4218 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
4220 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
4222 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
4231 rfirst = rlast = 0xffffffff;
4235 /* now see which range will peter our first, if either. */
4236 tdiff = tlast - tfirst;
4237 rdiff = rlast - rfirst;
4244 if (rfirst == 0xffffffff) {
4245 diff = tdiff; /* oops, pretend rdiff is infinite */
4247 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
4248 (long)tfirst, (long)tlast);
4250 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
4254 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
4255 (long)tfirst, (long)(tfirst + diff),
4258 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
4259 (long)tfirst, (long)rfirst);
4261 if (rfirst + diff > max)
4262 max = rfirst + diff;
4264 grows = (tfirst < rfirst &&
4265 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
4277 else if (max > 0xff)
4282 swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none));
4284 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP);
4285 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
4286 PAD_SETSV(cPADOPo->op_padix, swash);
4288 SvREADONLY_on(swash);
4290 cSVOPo->op_sv = swash;
4292 SvREFCNT_dec(listsv);
4293 SvREFCNT_dec(transv);
4295 if (!del && havefinal && rlen)
4296 (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5,
4297 newSVuv((UV)final), 0);
4300 o->op_private |= OPpTRANS_GROWS;
4306 op_getmad(expr,o,'e');
4307 op_getmad(repl,o,'r');
4315 tbl = (short*)PerlMemShared_calloc(
4316 (o->op_private & OPpTRANS_COMPLEMENT) &&
4317 !(o->op_private & OPpTRANS_DELETE) ? 258 : 256,
4319 cPVOPo->op_pv = (char*)tbl;
4321 for (i = 0; i < (I32)tlen; i++)
4323 for (i = 0, j = 0; i < 256; i++) {
4325 if (j >= (I32)rlen) {
4334 if (i < 128 && r[j] >= 128)
4344 o->op_private |= OPpTRANS_IDENTICAL;
4346 else if (j >= (I32)rlen)
4351 PerlMemShared_realloc(tbl,
4352 (0x101+rlen-j) * sizeof(short));
4353 cPVOPo->op_pv = (char*)tbl;
4355 tbl[0x100] = (short)(rlen - j);
4356 for (i=0; i < (I32)rlen - j; i++)
4357 tbl[0x101+i] = r[j+i];
4361 if (!rlen && !del) {
4364 o->op_private |= OPpTRANS_IDENTICAL;
4366 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
4367 o->op_private |= OPpTRANS_IDENTICAL;
4369 for (i = 0; i < 256; i++)
4371 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
4372 if (j >= (I32)rlen) {
4374 if (tbl[t[i]] == -1)
4380 if (tbl[t[i]] == -1) {
4381 if (t[i] < 128 && r[j] >= 128)
4388 if(del && rlen == tlen) {
4389 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator");
4390 } else if(rlen > tlen) {
4391 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list");
4395 o->op_private |= OPpTRANS_GROWS;
4397 op_getmad(expr,o,'e');
4398 op_getmad(repl,o,'r');
4408 =for apidoc Am|OP *|newPMOP|I32 type|I32 flags
4410 Constructs, checks, and returns an op of any pattern matching type.
4411 I<type> is the opcode. I<flags> gives the eight bits of C<op_flags>
4412 and, shifted up eight bits, the eight bits of C<op_private>.
4418 Perl_newPMOP(pTHX_ I32 type, I32 flags)
4423 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PMOP);
4425 NewOp(1101, pmop, 1, PMOP);
4426 pmop->op_type = (OPCODE)type;
4427 pmop->op_ppaddr = PL_ppaddr[type];
4428 pmop->op_flags = (U8)flags;
4429 pmop->op_private = (U8)(0 | (flags >> 8));
4431 if (PL_hints & HINT_RE_TAINT)
4432 pmop->op_pmflags |= PMf_RETAINT;
4433 if (IN_LOCALE_COMPILETIME) {
4434 set_regex_charset(&(pmop->op_pmflags), REGEX_LOCALE_CHARSET);
4436 else if ((! (PL_hints & HINT_BYTES))
4437 /* Both UNI_8_BIT and locale :not_characters imply Unicode */
4438 && (PL_hints & (HINT_UNI_8_BIT|HINT_LOCALE_NOT_CHARS)))
4440 set_regex_charset(&(pmop->op_pmflags), REGEX_UNICODE_CHARSET);
4442 if (PL_hints & HINT_RE_FLAGS) {
4443 SV *reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4444 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags"), 0, 0
4446 if (reflags && SvOK(reflags)) pmop->op_pmflags |= SvIV(reflags);
4447 reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4448 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags_charset"), 0, 0
4450 if (reflags && SvOK(reflags)) {
4451 set_regex_charset(&(pmop->op_pmflags), (regex_charset)SvIV(reflags));
4457 assert(SvPOK(PL_regex_pad[0]));
4458 if (SvCUR(PL_regex_pad[0])) {
4459 /* Pop off the "packed" IV from the end. */
4460 SV *const repointer_list = PL_regex_pad[0];
4461 const char *p = SvEND(repointer_list) - sizeof(IV);
4462 const IV offset = *((IV*)p);
4464 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
4466 SvEND_set(repointer_list, p);
4468 pmop->op_pmoffset = offset;
4469 /* This slot should be free, so assert this: */
4470 assert(PL_regex_pad[offset] == &PL_sv_undef);
4472 SV * const repointer = &PL_sv_undef;
4473 av_push(PL_regex_padav, repointer);
4474 pmop->op_pmoffset = av_len(PL_regex_padav);
4475 PL_regex_pad = AvARRAY(PL_regex_padav);
4479 return CHECKOP(type, pmop);
4482 /* Given some sort of match op o, and an expression expr containing a
4483 * pattern, either compile expr into a regex and attach it to o (if it's
4484 * constant), or convert expr into a runtime regcomp op sequence (if it's
4487 * isreg indicates that the pattern is part of a regex construct, eg
4488 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
4489 * split "pattern", which aren't. In the former case, expr will be a list
4490 * if the pattern contains more than one term (eg /a$b/) or if it contains
4491 * a replacement, ie s/// or tr///.
4493 * When the pattern has been compiled within a new anon CV (for
4494 * qr/(?{...})/ ), then floor indicates the savestack level just before
4495 * the new sub was created
4499 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg, I32 floor)
4504 I32 repl_has_vars = 0;
4506 bool is_trans = (o->op_type == OP_TRANS || o->op_type == OP_TRANSR);
4507 bool is_compiletime;
4510 PERL_ARGS_ASSERT_PMRUNTIME;
4512 /* for s/// and tr///, last element in list is the replacement; pop it */
4514 if (is_trans || o->op_type == OP_SUBST) {
4516 repl = cLISTOPx(expr)->op_last;
4517 kid = cLISTOPx(expr)->op_first;
4518 while (kid->op_sibling != repl)
4519 kid = kid->op_sibling;
4520 kid->op_sibling = NULL;
4521 cLISTOPx(expr)->op_last = kid;
4524 /* for TRANS, convert LIST/PUSH/CONST into CONST, and pass to pmtrans() */
4527 OP* const oe = expr;
4528 assert(expr->op_type == OP_LIST);
4529 assert(cLISTOPx(expr)->op_first->op_type == OP_PUSHMARK);
4530 assert(cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last);
4531 expr = cLISTOPx(oe)->op_last;
4532 cLISTOPx(oe)->op_first->op_sibling = NULL;
4533 cLISTOPx(oe)->op_last = NULL;
4536 return pmtrans(o, expr, repl);
4539 /* find whether we have any runtime or code elements;
4540 * at the same time, temporarily set the op_next of each DO block;
4541 * then when we LINKLIST, this will cause the DO blocks to be excluded
4542 * from the op_next chain (and from having LINKLIST recursively
4543 * applied to them). We fix up the DOs specially later */
4547 if (expr->op_type == OP_LIST) {
4549 for (o = cLISTOPx(expr)->op_first; o; o = o->op_sibling) {
4550 if (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)) {
4552 assert(!o->op_next && o->op_sibling);
4553 o->op_next = o->op_sibling;
4555 else if (o->op_type != OP_CONST && o->op_type != OP_PUSHMARK)
4559 else if (expr->op_type != OP_CONST)
4564 /* fix up DO blocks; treat each one as a separate little sub;
4565 * also, mark any arrays as LIST/REF */
4567 if (expr->op_type == OP_LIST) {
4569 for (o = cLISTOPx(expr)->op_first; o; o = o->op_sibling) {
4571 if (o->op_type == OP_PADAV || o->op_type == OP_RV2AV) {
4572 assert( !(o->op_flags & OPf_WANT));
4573 /* push the array rather than its contents. The regex
4574 * engine will retrieve and join the elements later */
4575 o->op_flags |= (OPf_WANT_LIST | OPf_REF);
4579 if (!(o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)))
4581 o->op_next = NULL; /* undo temporary hack from above */
4584 if (cLISTOPo->op_first->op_type == OP_LEAVE) {
4585 LISTOP *leaveop = cLISTOPx(cLISTOPo->op_first);
4587 assert(leaveop->op_first->op_type == OP_ENTER);
4588 assert(leaveop->op_first->op_sibling);
4589 o->op_next = leaveop->op_first->op_sibling;
4591 assert(leaveop->op_flags & OPf_KIDS);
4592 assert(leaveop->op_last->op_next == (OP*)leaveop);
4593 leaveop->op_next = NULL; /* stop on last op */
4594 op_null((OP*)leaveop);
4598 OP *scope = cLISTOPo->op_first;
4599 assert(scope->op_type == OP_SCOPE);
4600 assert(scope->op_flags & OPf_KIDS);
4601 scope->op_next = NULL; /* stop on last op */
4604 /* have to peep the DOs individually as we've removed it from
4605 * the op_next chain */
4608 /* runtime finalizes as part of finalizing whole tree */
4612 else if (expr->op_type == OP_PADAV || expr->op_type == OP_RV2AV) {
4613 assert( !(expr->op_flags & OPf_WANT));
4614 /* push the array rather than its contents. The regex
4615 * engine will retrieve and join the elements later */
4616 expr->op_flags |= (OPf_WANT_LIST | OPf_REF);
4619 PL_hints |= HINT_BLOCK_SCOPE;
4621 assert(floor==0 || (pm->op_pmflags & PMf_HAS_CV));
4623 if (is_compiletime) {
4624 U32 rx_flags = pm->op_pmflags & RXf_PMf_COMPILETIME;
4625 regexp_engine const *eng = current_re_engine();
4627 if (o->op_flags & OPf_SPECIAL)
4628 rx_flags |= RXf_SPLIT;
4630 if (!has_code || !eng->op_comp) {
4631 /* compile-time simple constant pattern */
4633 if ((pm->op_pmflags & PMf_HAS_CV) && !has_code) {
4634 /* whoops! we guessed that a qr// had a code block, but we
4635 * were wrong (e.g. /[(?{}]/ ). Throw away the PL_compcv
4636 * that isn't required now. Note that we have to be pretty
4637 * confident that nothing used that CV's pad while the
4638 * regex was parsed */
4639 assert(AvFILLp(PL_comppad) == 0); /* just @_ */
4640 /* But we know that one op is using this CV's slab. */
4641 cv_forget_slab(PL_compcv);
4643 pm->op_pmflags &= ~PMf_HAS_CV;
4648 ? eng->op_comp(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4649 rx_flags, pm->op_pmflags)
4650 : Perl_re_op_compile(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4651 rx_flags, pm->op_pmflags)
4654 op_getmad(expr,(OP*)pm,'e');
4660 /* compile-time pattern that includes literal code blocks */
4661 REGEXP* re = eng->op_comp(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4664 ((PL_hints & HINT_RE_EVAL) ? PMf_USE_RE_EVAL : 0))
4667 if (pm->op_pmflags & PMf_HAS_CV) {
4669 /* this QR op (and the anon sub we embed it in) is never
4670 * actually executed. It's just a placeholder where we can
4671 * squirrel away expr in op_code_list without the peephole
4672 * optimiser etc processing it for a second time */
4673 OP *qr = newPMOP(OP_QR, 0);
4674 ((PMOP*)qr)->op_code_list = expr;
4676 /* handle the implicit sub{} wrapped round the qr/(?{..})/ */
4677 SvREFCNT_inc_simple_void(PL_compcv);
4678 cv = newATTRSUB(floor, 0, NULL, NULL, qr);
4679 ReANY(re)->qr_anoncv = cv;
4681 /* attach the anon CV to the pad so that
4682 * pad_fixup_inner_anons() can find it */
4683 (void)pad_add_anon(cv, o->op_type);
4684 SvREFCNT_inc_simple_void(cv);
4687 pm->op_code_list = expr;
4692 /* runtime pattern: build chain of regcomp etc ops */
4694 PADOFFSET cv_targ = 0;
4696 reglist = isreg && expr->op_type == OP_LIST;
4701 pm->op_code_list = expr;
4702 /* don't free op_code_list; its ops are embedded elsewhere too */
4703 pm->op_pmflags |= PMf_CODELIST_PRIVATE;
4706 if (o->op_flags & OPf_SPECIAL)
4707 pm->op_pmflags |= PMf_SPLIT;
4709 /* the OP_REGCMAYBE is a placeholder in the non-threaded case
4710 * to allow its op_next to be pointed past the regcomp and
4711 * preceding stacking ops;
4712 * OP_REGCRESET is there to reset taint before executing the
4714 if (pm->op_pmflags & PMf_KEEP || TAINTING_get)
4715 expr = newUNOP((TAINTING_get ? OP_REGCRESET : OP_REGCMAYBE),0,expr);
4717 if (pm->op_pmflags & PMf_HAS_CV) {
4718 /* we have a runtime qr with literal code. This means
4719 * that the qr// has been wrapped in a new CV, which
4720 * means that runtime consts, vars etc will have been compiled
4721 * against a new pad. So... we need to execute those ops
4722 * within the environment of the new CV. So wrap them in a call
4723 * to a new anon sub. i.e. for
4727 * we build an anon sub that looks like
4729 * sub { "a", $b, '(?{...})' }
4731 * and call it, passing the returned list to regcomp.
4732 * Or to put it another way, the list of ops that get executed
4736 * ------ -------------------
4737 * pushmark (for regcomp)
4738 * pushmark (for entersub)
4739 * pushmark (for refgen)
4743 * regcreset regcreset
4745 * const("a") const("a")
4747 * const("(?{...})") const("(?{...})")
4752 SvREFCNT_inc_simple_void(PL_compcv);
4753 /* these lines are just an unrolled newANONATTRSUB */
4754 expr = newSVOP(OP_ANONCODE, 0,
4755 MUTABLE_SV(newATTRSUB(floor, 0, NULL, NULL, expr)));
4756 cv_targ = expr->op_targ;
4757 expr = newUNOP(OP_REFGEN, 0, expr);
4759 expr = list(force_list(newUNOP(OP_ENTERSUB, 0, scalar(expr))));
4762 NewOp(1101, rcop, 1, LOGOP);
4763 rcop->op_type = OP_REGCOMP;
4764 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
4765 rcop->op_first = scalar(expr);
4766 rcop->op_flags |= OPf_KIDS
4767 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
4768 | (reglist ? OPf_STACKED : 0);
4769 rcop->op_private = 0;
4771 rcop->op_targ = cv_targ;
4773 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
4774 if (PL_hints & HINT_RE_EVAL) PL_cv_has_eval = 1;
4776 /* establish postfix order */
4777 if (expr->op_type == OP_REGCRESET || expr->op_type == OP_REGCMAYBE) {
4779 rcop->op_next = expr;
4780 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
4783 rcop->op_next = LINKLIST(expr);
4784 expr->op_next = (OP*)rcop;
4787 op_prepend_elem(o->op_type, scalar((OP*)rcop), o);
4793 if (pm->op_pmflags & PMf_EVAL) {
4794 if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end)
4795 CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end);
4797 /* If we are looking at s//.../e with a single statement, get past
4798 the implicit do{}. */
4799 if (curop->op_type == OP_NULL && curop->op_flags & OPf_KIDS
4800 && cUNOPx(curop)->op_first->op_type == OP_SCOPE
4801 && cUNOPx(curop)->op_first->op_flags & OPf_KIDS) {
4802 OP *kid = cUNOPx(cUNOPx(curop)->op_first)->op_first;
4803 if (kid->op_type == OP_NULL && kid->op_sibling
4804 && !kid->op_sibling->op_sibling)
4805 curop = kid->op_sibling;
4807 if (curop->op_type == OP_CONST)
4809 else if (( (curop->op_type == OP_RV2SV ||
4810 curop->op_type == OP_RV2AV ||
4811 curop->op_type == OP_RV2HV ||
4812 curop->op_type == OP_RV2GV)
4813 && cUNOPx(curop)->op_first
4814 && cUNOPx(curop)->op_first->op_type == OP_GV )
4815 || curop->op_type == OP_PADSV
4816 || curop->op_type == OP_PADAV
4817 || curop->op_type == OP_PADHV
4818 || curop->op_type == OP_PADANY) {
4826 || !RX_PRELEN(PM_GETRE(pm))
4827 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
4829 pm->op_pmflags |= PMf_CONST; /* const for long enough */
4830 op_prepend_elem(o->op_type, scalar(repl), o);
4833 NewOp(1101, rcop, 1, LOGOP);
4834 rcop->op_type = OP_SUBSTCONT;
4835 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
4836 rcop->op_first = scalar(repl);
4837 rcop->op_flags |= OPf_KIDS;
4838 rcop->op_private = 1;
4841 /* establish postfix order */
4842 rcop->op_next = LINKLIST(repl);
4843 repl->op_next = (OP*)rcop;
4845 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
4846 assert(!(pm->op_pmflags & PMf_ONCE));
4847 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
4856 =for apidoc Am|OP *|newSVOP|I32 type|I32 flags|SV *sv
4858 Constructs, checks, and returns an op of any type that involves an
4859 embedded SV. I<type> is the opcode. I<flags> gives the eight bits
4860 of C<op_flags>. I<sv> gives the SV to embed in the op; this function
4861 takes ownership of one reference to it.
4867 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
4872 PERL_ARGS_ASSERT_NEWSVOP;
4874 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4875 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4876 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4878 NewOp(1101, svop, 1, SVOP);
4879 svop->op_type = (OPCODE)type;
4880 svop->op_ppaddr = PL_ppaddr[type];
4882 svop->op_next = (OP*)svop;
4883 svop->op_flags = (U8)flags;
4884 svop->op_private = (U8)(0 | (flags >> 8));
4885 if (PL_opargs[type] & OA_RETSCALAR)
4887 if (PL_opargs[type] & OA_TARGET)
4888 svop->op_targ = pad_alloc(type, SVs_PADTMP);
4889 return CHECKOP(type, svop);
4895 =for apidoc Am|OP *|newPADOP|I32 type|I32 flags|SV *sv
4897 Constructs, checks, and returns an op of any type that involves a
4898 reference to a pad element. I<type> is the opcode. I<flags> gives the
4899 eight bits of C<op_flags>. A pad slot is automatically allocated, and
4900 is populated with I<sv>; this function takes ownership of one reference
4903 This function only exists if Perl has been compiled to use ithreads.
4909 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
4914 PERL_ARGS_ASSERT_NEWPADOP;
4916 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4917 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4918 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4920 NewOp(1101, padop, 1, PADOP);
4921 padop->op_type = (OPCODE)type;
4922 padop->op_ppaddr = PL_ppaddr[type];
4923 padop->op_padix = pad_alloc(type, SVs_PADTMP);
4924 SvREFCNT_dec(PAD_SVl(padop->op_padix));
4925 PAD_SETSV(padop->op_padix, sv);
4928 padop->op_next = (OP*)padop;
4929 padop->op_flags = (U8)flags;
4930 if (PL_opargs[type] & OA_RETSCALAR)
4932 if (PL_opargs[type] & OA_TARGET)
4933 padop->op_targ = pad_alloc(type, SVs_PADTMP);
4934 return CHECKOP(type, padop);
4937 #endif /* !USE_ITHREADS */
4940 =for apidoc Am|OP *|newGVOP|I32 type|I32 flags|GV *gv
4942 Constructs, checks, and returns an op of any type that involves an
4943 embedded reference to a GV. I<type> is the opcode. I<flags> gives the
4944 eight bits of C<op_flags>. I<gv> identifies the GV that the op should
4945 reference; calling this function does not transfer ownership of any
4952 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
4956 PERL_ARGS_ASSERT_NEWGVOP;
4960 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4962 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4967 =for apidoc Am|OP *|newPVOP|I32 type|I32 flags|char *pv
4969 Constructs, checks, and returns an op of any type that involves an
4970 embedded C-level pointer (PV). I<type> is the opcode. I<flags> gives
4971 the eight bits of C<op_flags>. I<pv> supplies the C-level pointer, which
4972 must have been allocated using C<PerlMemShared_malloc>; the memory will
4973 be freed when the op is destroyed.
4979 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
4982 const bool utf8 = cBOOL(flags & SVf_UTF8);
4987 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4989 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
4991 NewOp(1101, pvop, 1, PVOP);
4992 pvop->op_type = (OPCODE)type;
4993 pvop->op_ppaddr = PL_ppaddr[type];
4995 pvop->op_next = (OP*)pvop;
4996 pvop->op_flags = (U8)flags;
4997 pvop->op_private = utf8 ? OPpPV_IS_UTF8 : 0;
4998 if (PL_opargs[type] & OA_RETSCALAR)
5000 if (PL_opargs[type] & OA_TARGET)
5001 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
5002 return CHECKOP(type, pvop);
5010 Perl_package(pTHX_ OP *o)
5013 SV *const sv = cSVOPo->op_sv;
5018 PERL_ARGS_ASSERT_PACKAGE;
5020 SAVEGENERICSV(PL_curstash);
5021 save_item(PL_curstname);
5023 PL_curstash = (HV *)SvREFCNT_inc(gv_stashsv(sv, GV_ADD));
5025 sv_setsv(PL_curstname, sv);
5027 PL_hints |= HINT_BLOCK_SCOPE;
5028 PL_parser->copline = NOLINE;
5029 PL_parser->expect = XSTATE;
5034 if (!PL_madskills) {
5039 pegop = newOP(OP_NULL,0);
5040 op_getmad(o,pegop,'P');
5046 Perl_package_version( pTHX_ OP *v )
5049 U32 savehints = PL_hints;
5050 PERL_ARGS_ASSERT_PACKAGE_VERSION;
5051 PL_hints &= ~HINT_STRICT_VARS;
5052 sv_setsv( GvSV(gv_fetchpvs("VERSION", GV_ADDMULTI, SVt_PV)), cSVOPx(v)->op_sv );
5053 PL_hints = savehints;
5062 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
5069 OP *pegop = PL_madskills ? newOP(OP_NULL,0) : NULL;
5071 SV *use_version = NULL;
5073 PERL_ARGS_ASSERT_UTILIZE;
5075 if (idop->op_type != OP_CONST)
5076 Perl_croak(aTHX_ "Module name must be constant");
5079 op_getmad(idop,pegop,'U');
5084 SV * const vesv = ((SVOP*)version)->op_sv;
5087 op_getmad(version,pegop,'V');
5088 if (!arg && !SvNIOKp(vesv)) {
5095 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
5096 Perl_croak(aTHX_ "Version number must be a constant number");
5098 /* Make copy of idop so we don't free it twice */
5099 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
5101 /* Fake up a method call to VERSION */
5102 meth = newSVpvs_share("VERSION");
5103 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
5104 op_append_elem(OP_LIST,
5105 op_prepend_elem(OP_LIST, pack, list(version)),
5106 newSVOP(OP_METHOD_NAMED, 0, meth)));
5110 /* Fake up an import/unimport */
5111 if (arg && arg->op_type == OP_STUB) {
5113 op_getmad(arg,pegop,'S');
5114 imop = arg; /* no import on explicit () */
5116 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
5117 imop = NULL; /* use 5.0; */
5119 use_version = ((SVOP*)idop)->op_sv;
5121 idop->op_private |= OPpCONST_NOVER;
5127 op_getmad(arg,pegop,'A');
5129 /* Make copy of idop so we don't free it twice */
5130 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
5132 /* Fake up a method call to import/unimport */
5134 ? newSVpvs_share("import") : newSVpvs_share("unimport");
5135 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
5136 op_append_elem(OP_LIST,
5137 op_prepend_elem(OP_LIST, pack, list(arg)),
5138 newSVOP(OP_METHOD_NAMED, 0, meth)));
5141 /* Fake up the BEGIN {}, which does its thing immediately. */
5143 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
5146 op_append_elem(OP_LINESEQ,
5147 op_append_elem(OP_LINESEQ,
5148 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
5149 newSTATEOP(0, NULL, veop)),
5150 newSTATEOP(0, NULL, imop) ));
5154 * feature bundle that corresponds to the required version. */
5155 use_version = sv_2mortal(new_version(use_version));
5156 S_enable_feature_bundle(aTHX_ use_version);
5158 /* If a version >= 5.11.0 is requested, strictures are on by default! */
5159 if (vcmp(use_version,
5160 sv_2mortal(upg_version(newSVnv(5.011000), FALSE))) >= 0) {
5161 if (!(PL_hints & HINT_EXPLICIT_STRICT_REFS))
5162 PL_hints |= HINT_STRICT_REFS;
5163 if (!(PL_hints & HINT_EXPLICIT_STRICT_SUBS))
5164 PL_hints |= HINT_STRICT_SUBS;
5165 if (!(PL_hints & HINT_EXPLICIT_STRICT_VARS))
5166 PL_hints |= HINT_STRICT_VARS;
5168 /* otherwise they are off */
5170 if (!(PL_hints & HINT_EXPLICIT_STRICT_REFS))
5171 PL_hints &= ~HINT_STRICT_REFS;
5172 if (!(PL_hints & HINT_EXPLICIT_STRICT_SUBS))
5173 PL_hints &= ~HINT_STRICT_SUBS;
5174 if (!(PL_hints & HINT_EXPLICIT_STRICT_VARS))
5175 PL_hints &= ~HINT_STRICT_VARS;
5179 /* The "did you use incorrect case?" warning used to be here.
5180 * The problem is that on case-insensitive filesystems one
5181 * might get false positives for "use" (and "require"):
5182 * "use Strict" or "require CARP" will work. This causes
5183 * portability problems for the script: in case-strict
5184 * filesystems the script will stop working.
5186 * The "incorrect case" warning checked whether "use Foo"
5187 * imported "Foo" to your namespace, but that is wrong, too:
5188 * there is no requirement nor promise in the language that
5189 * a Foo.pm should or would contain anything in package "Foo".
5191 * There is very little Configure-wise that can be done, either:
5192 * the case-sensitivity of the build filesystem of Perl does not
5193 * help in guessing the case-sensitivity of the runtime environment.
5196 PL_hints |= HINT_BLOCK_SCOPE;
5197 PL_parser->copline = NOLINE;
5198 PL_parser->expect = XSTATE;
5199 PL_cop_seqmax++; /* Purely for B::*'s benefit */
5200 if (PL_cop_seqmax == PERL_PADSEQ_INTRO) /* not a legal value */
5209 =head1 Embedding Functions
5211 =for apidoc load_module
5213 Loads the module whose name is pointed to by the string part of name.
5214 Note that the actual module name, not its filename, should be given.
5215 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
5216 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
5217 (or 0 for no flags). ver, if specified and not NULL, provides version semantics
5218 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
5219 arguments can be used to specify arguments to the module's import()
5220 method, similar to C<use Foo::Bar VERSION LIST>. They must be
5221 terminated with a final NULL pointer. Note that this list can only
5222 be omitted when the PERL_LOADMOD_NOIMPORT flag has been used.
5223 Otherwise at least a single NULL pointer to designate the default
5224 import list is required.
5226 The reference count for each specified C<SV*> parameter is decremented.
5231 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
5235 PERL_ARGS_ASSERT_LOAD_MODULE;
5237 va_start(args, ver);
5238 vload_module(flags, name, ver, &args);
5242 #ifdef PERL_IMPLICIT_CONTEXT
5244 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
5248 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
5249 va_start(args, ver);
5250 vload_module(flags, name, ver, &args);
5256 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
5260 OP * const modname = newSVOP(OP_CONST, 0, name);
5262 PERL_ARGS_ASSERT_VLOAD_MODULE;
5264 modname->op_private |= OPpCONST_BARE;
5266 veop = newSVOP(OP_CONST, 0, ver);
5270 if (flags & PERL_LOADMOD_NOIMPORT) {
5271 imop = sawparens(newNULLLIST());
5273 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
5274 imop = va_arg(*args, OP*);
5279 sv = va_arg(*args, SV*);
5281 imop = op_append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
5282 sv = va_arg(*args, SV*);
5286 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
5287 * that it has a PL_parser to play with while doing that, and also
5288 * that it doesn't mess with any existing parser, by creating a tmp
5289 * new parser with lex_start(). This won't actually be used for much,
5290 * since pp_require() will create another parser for the real work. */
5293 SAVEVPTR(PL_curcop);
5294 lex_start(NULL, NULL, LEX_START_SAME_FILTER);
5295 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
5296 veop, modname, imop);
5301 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
5307 PERL_ARGS_ASSERT_DOFILE;
5309 if (!force_builtin) {
5310 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
5311 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
5312 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
5313 gv = gvp ? *gvp : NULL;
5317 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
5318 doop = newUNOP(OP_ENTERSUB, OPf_STACKED,
5319 op_append_elem(OP_LIST, term,
5320 scalar(newUNOP(OP_RV2CV, 0,
5321 newGVOP(OP_GV, 0, gv)))));
5324 doop = newUNOP(OP_DOFILE, 0, scalar(term));
5330 =head1 Optree construction
5332 =for apidoc Am|OP *|newSLICEOP|I32 flags|OP *subscript|OP *listval
5334 Constructs, checks, and returns an C<lslice> (list slice) op. I<flags>
5335 gives the eight bits of C<op_flags>, except that C<OPf_KIDS> will
5336 be set automatically, and, shifted up eight bits, the eight bits of
5337 C<op_private>, except that the bit with value 1 or 2 is automatically
5338 set as required. I<listval> and I<subscript> supply the parameters of
5339 the slice; they are consumed by this function and become part of the
5340 constructed op tree.
5346 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
5348 return newBINOP(OP_LSLICE, flags,
5349 list(force_list(subscript)),
5350 list(force_list(listval)) );
5354 S_is_list_assignment(pTHX_ const OP *o)
5362 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
5363 o = cUNOPo->op_first;
5365 flags = o->op_flags;
5367 if (type == OP_COND_EXPR) {
5368 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
5369 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
5374 yyerror("Assignment to both a list and a scalar");
5378 if (type == OP_LIST &&
5379 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
5380 o->op_private & OPpLVAL_INTRO)
5383 if (type == OP_LIST || flags & OPf_PARENS ||
5384 type == OP_RV2AV || type == OP_RV2HV ||
5385 type == OP_ASLICE || type == OP_HSLICE)
5388 if (type == OP_PADAV || type == OP_PADHV)
5391 if (type == OP_RV2SV)
5398 Helper function for newASSIGNOP to detection commonality between the
5399 lhs and the rhs. Marks all variables with PL_generation. If it
5400 returns TRUE the assignment must be able to handle common variables.
5402 PERL_STATIC_INLINE bool
5403 S_aassign_common_vars(pTHX_ OP* o)
5406 for (curop = cUNOPo->op_first; curop; curop=curop->op_sibling) {
5407 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
5408 if (curop->op_type == OP_GV) {
5409 GV *gv = cGVOPx_gv(curop);
5411 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5413 GvASSIGN_GENERATION_set(gv, PL_generation);
5415 else if (curop->op_type == OP_PADSV ||
5416 curop->op_type == OP_PADAV ||
5417 curop->op_type == OP_PADHV ||
5418 curop->op_type == OP_PADANY)
5420 if (PAD_COMPNAME_GEN(curop->op_targ)
5421 == (STRLEN)PL_generation)
5423 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
5426 else if (curop->op_type == OP_RV2CV)
5428 else if (curop->op_type == OP_RV2SV ||
5429 curop->op_type == OP_RV2AV ||
5430 curop->op_type == OP_RV2HV ||
5431 curop->op_type == OP_RV2GV) {
5432 if (cUNOPx(curop)->op_first->op_type != OP_GV) /* funny deref? */
5435 else if (curop->op_type == OP_PUSHRE) {
5437 if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) {
5438 GV *const gv = MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff));
5440 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5442 GvASSIGN_GENERATION_set(gv, PL_generation);
5446 = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
5449 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5451 GvASSIGN_GENERATION_set(gv, PL_generation);
5459 if (curop->op_flags & OPf_KIDS) {
5460 if (aassign_common_vars(curop))
5468 =for apidoc Am|OP *|newASSIGNOP|I32 flags|OP *left|I32 optype|OP *right
5470 Constructs, checks, and returns an assignment op. I<left> and I<right>
5471 supply the parameters of the assignment; they are consumed by this
5472 function and become part of the constructed op tree.
5474 If I<optype> is C<OP_ANDASSIGN>, C<OP_ORASSIGN>, or C<OP_DORASSIGN>, then
5475 a suitable conditional optree is constructed. If I<optype> is the opcode
5476 of a binary operator, such as C<OP_BIT_OR>, then an op is constructed that
5477 performs the binary operation and assigns the result to the left argument.
5478 Either way, if I<optype> is non-zero then I<flags> has no effect.
5480 If I<optype> is zero, then a plain scalar or list assignment is
5481 constructed. Which type of assignment it is is automatically determined.
5482 I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5483 will be set automatically, and, shifted up eight bits, the eight bits
5484 of C<op_private>, except that the bit with value 1 or 2 is automatically
5491 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
5497 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
5498 return newLOGOP(optype, 0,
5499 op_lvalue(scalar(left), optype),
5500 newUNOP(OP_SASSIGN, 0, scalar(right)));
5503 return newBINOP(optype, OPf_STACKED,
5504 op_lvalue(scalar(left), optype), scalar(right));
5508 if (is_list_assignment(left)) {
5509 static const char no_list_state[] = "Initialization of state variables"
5510 " in list context currently forbidden";
5512 bool maybe_common_vars = TRUE;
5515 left = op_lvalue(left, OP_AASSIGN);
5516 curop = list(force_list(left));
5517 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
5518 o->op_private = (U8)(0 | (flags >> 8));
5520 if ((left->op_type == OP_LIST
5521 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
5523 OP* lop = ((LISTOP*)left)->op_first;
5524 maybe_common_vars = FALSE;
5526 if (lop->op_type == OP_PADSV ||
5527 lop->op_type == OP_PADAV ||
5528 lop->op_type == OP_PADHV ||
5529 lop->op_type == OP_PADANY) {
5530 if (!(lop->op_private & OPpLVAL_INTRO))
5531 maybe_common_vars = TRUE;
5533 if (lop->op_private & OPpPAD_STATE) {
5534 if (left->op_private & OPpLVAL_INTRO) {
5535 /* Each variable in state($a, $b, $c) = ... */
5538 /* Each state variable in
5539 (state $a, my $b, our $c, $d, undef) = ... */
5541 yyerror(no_list_state);
5543 /* Each my variable in
5544 (state $a, my $b, our $c, $d, undef) = ... */
5546 } else if (lop->op_type == OP_UNDEF ||
5547 lop->op_type == OP_PUSHMARK) {
5548 /* undef may be interesting in
5549 (state $a, undef, state $c) */
5551 /* Other ops in the list. */
5552 maybe_common_vars = TRUE;
5554 lop = lop->op_sibling;
5557 else if ((left->op_private & OPpLVAL_INTRO)
5558 && ( left->op_type == OP_PADSV
5559 || left->op_type == OP_PADAV
5560 || left->op_type == OP_PADHV
5561 || left->op_type == OP_PADANY))
5563 if (left->op_type == OP_PADSV) maybe_common_vars = FALSE;
5564 if (left->op_private & OPpPAD_STATE) {
5565 /* All single variable list context state assignments, hence
5575 yyerror(no_list_state);
5579 /* PL_generation sorcery:
5580 * an assignment like ($a,$b) = ($c,$d) is easier than
5581 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
5582 * To detect whether there are common vars, the global var
5583 * PL_generation is incremented for each assign op we compile.
5584 * Then, while compiling the assign op, we run through all the
5585 * variables on both sides of the assignment, setting a spare slot
5586 * in each of them to PL_generation. If any of them already have
5587 * that value, we know we've got commonality. We could use a
5588 * single bit marker, but then we'd have to make 2 passes, first
5589 * to clear the flag, then to test and set it. To find somewhere
5590 * to store these values, evil chicanery is done with SvUVX().
5593 if (maybe_common_vars) {
5595 if (aassign_common_vars(o))
5596 o->op_private |= OPpASSIGN_COMMON;
5600 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
5601 OP* tmpop = ((LISTOP*)right)->op_first;
5602 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
5603 PMOP * const pm = (PMOP*)tmpop;
5604 if (left->op_type == OP_RV2AV &&
5605 !(left->op_private & OPpLVAL_INTRO) &&
5606 !(o->op_private & OPpASSIGN_COMMON) )
5608 tmpop = ((UNOP*)left)->op_first;
5609 if (tmpop->op_type == OP_GV
5611 && !pm->op_pmreplrootu.op_pmtargetoff
5613 && !pm->op_pmreplrootu.op_pmtargetgv
5617 pm->op_pmreplrootu.op_pmtargetoff
5618 = cPADOPx(tmpop)->op_padix;
5619 cPADOPx(tmpop)->op_padix = 0; /* steal it */
5621 pm->op_pmreplrootu.op_pmtargetgv
5622 = MUTABLE_GV(cSVOPx(tmpop)->op_sv);
5623 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
5625 tmpop = cUNOPo->op_first; /* to list (nulled) */
5626 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
5627 tmpop->op_sibling = NULL; /* don't free split */
5628 right->op_next = tmpop->op_next; /* fix starting loc */
5629 op_free(o); /* blow off assign */
5630 right->op_flags &= ~OPf_WANT;
5631 /* "I don't know and I don't care." */
5636 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
5637 ((LISTOP*)right)->op_last->op_type == OP_CONST)
5639 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
5640 if (SvIOK(sv) && SvIVX(sv) == 0)
5641 sv_setiv(sv, PL_modcount+1);
5649 right = newOP(OP_UNDEF, 0);
5650 if (right->op_type == OP_READLINE) {
5651 right->op_flags |= OPf_STACKED;
5652 return newBINOP(OP_NULL, flags, op_lvalue(scalar(left), OP_SASSIGN),
5656 o = newBINOP(OP_SASSIGN, flags,
5657 scalar(right), op_lvalue(scalar(left), OP_SASSIGN) );
5663 =for apidoc Am|OP *|newSTATEOP|I32 flags|char *label|OP *o
5665 Constructs a state op (COP). The state op is normally a C<nextstate> op,
5666 but will be a C<dbstate> op if debugging is enabled for currently-compiled
5667 code. The state op is populated from C<PL_curcop> (or C<PL_compiling>).
5668 If I<label> is non-null, it supplies the name of a label to attach to
5669 the state op; this function takes ownership of the memory pointed at by
5670 I<label>, and will free it. I<flags> gives the eight bits of C<op_flags>
5673 If I<o> is null, the state op is returned. Otherwise the state op is
5674 combined with I<o> into a C<lineseq> list op, which is returned. I<o>
5675 is consumed by this function and becomes part of the returned op tree.
5681 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
5684 const U32 seq = intro_my();
5685 const U32 utf8 = flags & SVf_UTF8;
5690 NewOp(1101, cop, 1, COP);
5691 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
5692 cop->op_type = OP_DBSTATE;
5693 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
5696 cop->op_type = OP_NEXTSTATE;
5697 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
5699 cop->op_flags = (U8)flags;
5700 CopHINTS_set(cop, PL_hints);
5702 cop->op_private |= NATIVE_HINTS;
5704 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
5705 cop->op_next = (OP*)cop;
5708 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
5709 CopHINTHASH_set(cop, cophh_copy(CopHINTHASH_get(PL_curcop)));
5711 Perl_cop_store_label(aTHX_ cop, label, strlen(label), utf8);
5713 PL_hints |= HINT_BLOCK_SCOPE;
5714 /* It seems that we need to defer freeing this pointer, as other parts
5715 of the grammar end up wanting to copy it after this op has been
5720 if (PL_parser && PL_parser->copline == NOLINE)
5721 CopLINE_set(cop, CopLINE(PL_curcop));
5723 CopLINE_set(cop, PL_parser->copline);
5724 PL_parser->copline = NOLINE;
5727 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
5729 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
5731 CopSTASH_set(cop, PL_curstash);
5733 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) {
5734 /* this line can have a breakpoint - store the cop in IV */
5735 AV *av = CopFILEAVx(PL_curcop);
5737 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
5738 if (svp && *svp != &PL_sv_undef ) {
5739 (void)SvIOK_on(*svp);
5740 SvIV_set(*svp, PTR2IV(cop));
5745 if (flags & OPf_SPECIAL)
5747 return op_prepend_elem(OP_LINESEQ, (OP*)cop, o);
5751 =for apidoc Am|OP *|newLOGOP|I32 type|I32 flags|OP *first|OP *other
5753 Constructs, checks, and returns a logical (flow control) op. I<type>
5754 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
5755 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
5756 the eight bits of C<op_private>, except that the bit with value 1 is
5757 automatically set. I<first> supplies the expression controlling the
5758 flow, and I<other> supplies the side (alternate) chain of ops; they are
5759 consumed by this function and become part of the constructed op tree.
5765 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
5769 PERL_ARGS_ASSERT_NEWLOGOP;
5771 return new_logop(type, flags, &first, &other);
5775 S_search_const(pTHX_ OP *o)
5777 PERL_ARGS_ASSERT_SEARCH_CONST;
5779 switch (o->op_type) {
5783 if (o->op_flags & OPf_KIDS)
5784 return search_const(cUNOPo->op_first);
5791 if (!(o->op_flags & OPf_KIDS))
5793 kid = cLISTOPo->op_first;
5795 switch (kid->op_type) {
5799 kid = kid->op_sibling;
5802 if (kid != cLISTOPo->op_last)
5808 kid = cLISTOPo->op_last;
5810 return search_const(kid);
5818 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
5826 int prepend_not = 0;
5828 PERL_ARGS_ASSERT_NEW_LOGOP;
5833 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
5834 return newBINOP(type, flags, scalar(first), scalar(other));
5836 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOGOP);
5838 scalarboolean(first);
5839 /* optimize AND and OR ops that have NOTs as children */
5840 if (first->op_type == OP_NOT
5841 && (first->op_flags & OPf_KIDS)
5842 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
5843 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
5845 if (type == OP_AND || type == OP_OR) {
5851 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
5853 prepend_not = 1; /* prepend a NOT op later */
5857 /* search for a constant op that could let us fold the test */
5858 if ((cstop = search_const(first))) {
5859 if (cstop->op_private & OPpCONST_STRICT)
5860 no_bareword_allowed(cstop);
5861 else if ((cstop->op_private & OPpCONST_BARE))
5862 Perl_ck_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
5863 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
5864 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
5865 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
5867 if (other->op_type == OP_CONST)
5868 other->op_private |= OPpCONST_SHORTCIRCUIT;
5870 OP *newop = newUNOP(OP_NULL, 0, other);
5871 op_getmad(first, newop, '1');
5872 newop->op_targ = type; /* set "was" field */
5876 if (other->op_type == OP_LEAVE)
5877 other = newUNOP(OP_NULL, OPf_SPECIAL, other);
5878 else if (other->op_type == OP_MATCH
5879 || other->op_type == OP_SUBST
5880 || other->op_type == OP_TRANSR
5881 || other->op_type == OP_TRANS)
5882 /* Mark the op as being unbindable with =~ */
5883 other->op_flags |= OPf_SPECIAL;
5884 else if (other->op_type == OP_CONST)
5885 other->op_private |= OPpCONST_FOLDED;
5889 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
5890 const OP *o2 = other;
5891 if ( ! (o2->op_type == OP_LIST
5892 && (( o2 = cUNOPx(o2)->op_first))
5893 && o2->op_type == OP_PUSHMARK
5894 && (( o2 = o2->op_sibling)) )
5897 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
5898 || o2->op_type == OP_PADHV)
5899 && o2->op_private & OPpLVAL_INTRO
5900 && !(o2->op_private & OPpPAD_STATE))
5902 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
5903 "Deprecated use of my() in false conditional");
5907 if (first->op_type == OP_CONST)
5908 first->op_private |= OPpCONST_SHORTCIRCUIT;
5910 first = newUNOP(OP_NULL, 0, first);
5911 op_getmad(other, first, '2');
5912 first->op_targ = type; /* set "was" field */
5919 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
5920 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
5922 const OP * const k1 = ((UNOP*)first)->op_first;
5923 const OP * const k2 = k1->op_sibling;
5925 switch (first->op_type)
5928 if (k2 && k2->op_type == OP_READLINE
5929 && (k2->op_flags & OPf_STACKED)
5930 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5932 warnop = k2->op_type;
5937 if (k1->op_type == OP_READDIR
5938 || k1->op_type == OP_GLOB
5939 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5940 || k1->op_type == OP_EACH
5941 || k1->op_type == OP_AEACH)
5943 warnop = ((k1->op_type == OP_NULL)
5944 ? (OPCODE)k1->op_targ : k1->op_type);
5949 const line_t oldline = CopLINE(PL_curcop);
5950 /* This ensures that warnings are reported at the first line
5951 of the construction, not the last. */
5952 CopLINE_set(PL_curcop, PL_parser->copline);
5953 Perl_warner(aTHX_ packWARN(WARN_MISC),
5954 "Value of %s%s can be \"0\"; test with defined()",
5956 ((warnop == OP_READLINE || warnop == OP_GLOB)
5957 ? " construct" : "() operator"));
5958 CopLINE_set(PL_curcop, oldline);
5965 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
5966 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
5968 NewOp(1101, logop, 1, LOGOP);
5970 logop->op_type = (OPCODE)type;
5971 logop->op_ppaddr = PL_ppaddr[type];
5972 logop->op_first = first;
5973 logop->op_flags = (U8)(flags | OPf_KIDS);
5974 logop->op_other = LINKLIST(other);
5975 logop->op_private = (U8)(1 | (flags >> 8));
5977 /* establish postfix order */
5978 logop->op_next = LINKLIST(first);
5979 first->op_next = (OP*)logop;
5980 first->op_sibling = other;
5982 CHECKOP(type,logop);
5984 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
5991 =for apidoc Am|OP *|newCONDOP|I32 flags|OP *first|OP *trueop|OP *falseop
5993 Constructs, checks, and returns a conditional-expression (C<cond_expr>)
5994 op. I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5995 will be set automatically, and, shifted up eight bits, the eight bits of
5996 C<op_private>, except that the bit with value 1 is automatically set.
5997 I<first> supplies the expression selecting between the two branches,
5998 and I<trueop> and I<falseop> supply the branches; they are consumed by
5999 this function and become part of the constructed op tree.
6005 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
6013 PERL_ARGS_ASSERT_NEWCONDOP;
6016 return newLOGOP(OP_AND, 0, first, trueop);
6018 return newLOGOP(OP_OR, 0, first, falseop);
6020 scalarboolean(first);
6021 if ((cstop = search_const(first))) {
6022 /* Left or right arm of the conditional? */
6023 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
6024 OP *live = left ? trueop : falseop;
6025 OP *const dead = left ? falseop : trueop;
6026 if (cstop->op_private & OPpCONST_BARE &&
6027 cstop->op_private & OPpCONST_STRICT) {
6028 no_bareword_allowed(cstop);
6031 /* This is all dead code when PERL_MAD is not defined. */
6032 live = newUNOP(OP_NULL, 0, live);
6033 op_getmad(first, live, 'C');
6034 op_getmad(dead, live, left ? 'e' : 't');
6039 if (live->op_type == OP_LEAVE)
6040 live = newUNOP(OP_NULL, OPf_SPECIAL, live);
6041 else if (live->op_type == OP_MATCH || live->op_type == OP_SUBST
6042 || live->op_type == OP_TRANS || live->op_type == OP_TRANSR)
6043 /* Mark the op as being unbindable with =~ */
6044 live->op_flags |= OPf_SPECIAL;
6045 else if (live->op_type == OP_CONST)
6046 live->op_private |= OPpCONST_FOLDED;
6049 NewOp(1101, logop, 1, LOGOP);
6050 logop->op_type = OP_COND_EXPR;
6051 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
6052 logop->op_first = first;
6053 logop->op_flags = (U8)(flags | OPf_KIDS);
6054 logop->op_private = (U8)(1 | (flags >> 8));
6055 logop->op_other = LINKLIST(trueop);
6056 logop->op_next = LINKLIST(falseop);
6058 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
6061 /* establish postfix order */
6062 start = LINKLIST(first);
6063 first->op_next = (OP*)logop;
6065 first->op_sibling = trueop;
6066 trueop->op_sibling = falseop;
6067 o = newUNOP(OP_NULL, 0, (OP*)logop);
6069 trueop->op_next = falseop->op_next = o;
6076 =for apidoc Am|OP *|newRANGE|I32 flags|OP *left|OP *right
6078 Constructs and returns a C<range> op, with subordinate C<flip> and
6079 C<flop> ops. I<flags> gives the eight bits of C<op_flags> for the
6080 C<flip> op and, shifted up eight bits, the eight bits of C<op_private>
6081 for both the C<flip> and C<range> ops, except that the bit with value
6082 1 is automatically set. I<left> and I<right> supply the expressions
6083 controlling the endpoints of the range; they are consumed by this function
6084 and become part of the constructed op tree.
6090 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
6099 PERL_ARGS_ASSERT_NEWRANGE;
6101 NewOp(1101, range, 1, LOGOP);
6103 range->op_type = OP_RANGE;
6104 range->op_ppaddr = PL_ppaddr[OP_RANGE];
6105 range->op_first = left;
6106 range->op_flags = OPf_KIDS;
6107 leftstart = LINKLIST(left);
6108 range->op_other = LINKLIST(right);
6109 range->op_private = (U8)(1 | (flags >> 8));
6111 left->op_sibling = right;
6113 range->op_next = (OP*)range;
6114 flip = newUNOP(OP_FLIP, flags, (OP*)range);
6115 flop = newUNOP(OP_FLOP, 0, flip);
6116 o = newUNOP(OP_NULL, 0, flop);
6118 range->op_next = leftstart;
6120 left->op_next = flip;
6121 right->op_next = flop;
6123 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
6124 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
6125 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
6126 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
6128 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
6129 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
6131 /* check barewords before they might be optimized aways */
6132 if (flip->op_private && cSVOPx(left)->op_private & OPpCONST_STRICT)
6133 no_bareword_allowed(left);
6134 if (flop->op_private && cSVOPx(right)->op_private & OPpCONST_STRICT)
6135 no_bareword_allowed(right);
6138 if (!flip->op_private || !flop->op_private)
6139 LINKLIST(o); /* blow off optimizer unless constant */
6145 =for apidoc Am|OP *|newLOOPOP|I32 flags|I32 debuggable|OP *expr|OP *block
6147 Constructs, checks, and returns an op tree expressing a loop. This is
6148 only a loop in the control flow through the op tree; it does not have
6149 the heavyweight loop structure that allows exiting the loop by C<last>
6150 and suchlike. I<flags> gives the eight bits of C<op_flags> for the
6151 top-level op, except that some bits will be set automatically as required.
6152 I<expr> supplies the expression controlling loop iteration, and I<block>
6153 supplies the body of the loop; they are consumed by this function and
6154 become part of the constructed op tree. I<debuggable> is currently
6155 unused and should always be 1.
6161 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
6166 const bool once = block && block->op_flags & OPf_SPECIAL &&
6167 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
6169 PERL_UNUSED_ARG(debuggable);
6172 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
6173 return block; /* do {} while 0 does once */
6174 if (expr->op_type == OP_READLINE
6175 || expr->op_type == OP_READDIR
6176 || expr->op_type == OP_GLOB
6177 || expr->op_type == OP_EACH || expr->op_type == OP_AEACH
6178 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
6179 expr = newUNOP(OP_DEFINED, 0,
6180 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
6181 } else if (expr->op_flags & OPf_KIDS) {
6182 const OP * const k1 = ((UNOP*)expr)->op_first;
6183 const OP * const k2 = k1 ? k1->op_sibling : NULL;
6184 switch (expr->op_type) {
6186 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
6187 && (k2->op_flags & OPf_STACKED)
6188 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
6189 expr = newUNOP(OP_DEFINED, 0, expr);
6193 if (k1 && (k1->op_type == OP_READDIR
6194 || k1->op_type == OP_GLOB
6195 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
6196 || k1->op_type == OP_EACH
6197 || k1->op_type == OP_AEACH))
6198 expr = newUNOP(OP_DEFINED, 0, expr);
6204 /* if block is null, the next op_append_elem() would put UNSTACK, a scalar
6205 * op, in listop. This is wrong. [perl #27024] */
6207 block = newOP(OP_NULL, 0);
6208 listop = op_append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
6209 o = new_logop(OP_AND, 0, &expr, &listop);
6212 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
6214 if (once && o != listop)
6215 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
6218 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
6220 o->op_flags |= flags;
6222 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
6227 =for apidoc Am|OP *|newWHILEOP|I32 flags|I32 debuggable|LOOP *loop|OP *expr|OP *block|OP *cont|I32 has_my
6229 Constructs, checks, and returns an op tree expressing a C<while> loop.
6230 This is a heavyweight loop, with structure that allows exiting the loop
6231 by C<last> and suchlike.
6233 I<loop> is an optional preconstructed C<enterloop> op to use in the
6234 loop; if it is null then a suitable op will be constructed automatically.
6235 I<expr> supplies the loop's controlling expression. I<block> supplies the
6236 main body of the loop, and I<cont> optionally supplies a C<continue> block
6237 that operates as a second half of the body. All of these optree inputs
6238 are consumed by this function and become part of the constructed op tree.
6240 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
6241 op and, shifted up eight bits, the eight bits of C<op_private> for
6242 the C<leaveloop> op, except that (in both cases) some bits will be set
6243 automatically. I<debuggable> is currently unused and should always be 1.
6244 I<has_my> can be supplied as true to force the
6245 loop body to be enclosed in its own scope.
6251 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop,
6252 OP *expr, OP *block, OP *cont, I32 has_my)
6261 PERL_UNUSED_ARG(debuggable);
6264 if (expr->op_type == OP_READLINE
6265 || expr->op_type == OP_READDIR
6266 || expr->op_type == OP_GLOB
6267 || expr->op_type == OP_EACH || expr->op_type == OP_AEACH
6268 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
6269 expr = newUNOP(OP_DEFINED, 0,
6270 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
6271 } else if (expr->op_flags & OPf_KIDS) {
6272 const OP * const k1 = ((UNOP*)expr)->op_first;
6273 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
6274 switch (expr->op_type) {
6276 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
6277 && (k2->op_flags & OPf_STACKED)
6278 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
6279 expr = newUNOP(OP_DEFINED, 0, expr);
6283 if (k1 && (k1->op_type == OP_READDIR
6284 || k1->op_type == OP_GLOB
6285 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
6286 || k1->op_type == OP_EACH
6287 || k1->op_type == OP_AEACH))
6288 expr = newUNOP(OP_DEFINED, 0, expr);
6295 block = newOP(OP_NULL, 0);
6296 else if (cont || has_my) {
6297 block = op_scope(block);
6301 next = LINKLIST(cont);
6304 OP * const unstack = newOP(OP_UNSTACK, 0);
6307 cont = op_append_elem(OP_LINESEQ, cont, unstack);
6311 listop = op_append_list(OP_LINESEQ, block, cont);
6313 redo = LINKLIST(listop);
6317 o = new_logop(OP_AND, 0, &expr, &listop);
6318 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
6320 return expr; /* listop already freed by new_logop */
6323 ((LISTOP*)listop)->op_last->op_next =
6324 (o == listop ? redo : LINKLIST(o));
6330 NewOp(1101,loop,1,LOOP);
6331 loop->op_type = OP_ENTERLOOP;
6332 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
6333 loop->op_private = 0;
6334 loop->op_next = (OP*)loop;
6337 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
6339 loop->op_redoop = redo;
6340 loop->op_lastop = o;
6341 o->op_private |= loopflags;
6344 loop->op_nextop = next;
6346 loop->op_nextop = o;
6348 o->op_flags |= flags;
6349 o->op_private |= (flags >> 8);
6354 =for apidoc Am|OP *|newFOROP|I32 flags|OP *sv|OP *expr|OP *block|OP *cont
6356 Constructs, checks, and returns an op tree expressing a C<foreach>
6357 loop (iteration through a list of values). This is a heavyweight loop,
6358 with structure that allows exiting the loop by C<last> and suchlike.
6360 I<sv> optionally supplies the variable that will be aliased to each
6361 item in turn; if null, it defaults to C<$_> (either lexical or global).
6362 I<expr> supplies the list of values to iterate over. I<block> supplies
6363 the main body of the loop, and I<cont> optionally supplies a C<continue>
6364 block that operates as a second half of the body. All of these optree
6365 inputs are consumed by this function and become part of the constructed
6368 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
6369 op and, shifted up eight bits, the eight bits of C<op_private> for
6370 the C<leaveloop> op, except that (in both cases) some bits will be set
6377 Perl_newFOROP(pTHX_ I32 flags, OP *sv, OP *expr, OP *block, OP *cont)
6382 PADOFFSET padoff = 0;
6387 PERL_ARGS_ASSERT_NEWFOROP;
6390 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
6391 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
6392 sv->op_type = OP_RV2GV;
6393 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
6395 /* The op_type check is needed to prevent a possible segfault
6396 * if the loop variable is undeclared and 'strict vars' is in
6397 * effect. This is illegal but is nonetheless parsed, so we
6398 * may reach this point with an OP_CONST where we're expecting
6401 if (cUNOPx(sv)->op_first->op_type == OP_GV
6402 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
6403 iterpflags |= OPpITER_DEF;
6405 else if (sv->op_type == OP_PADSV) { /* private variable */
6406 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
6407 padoff = sv->op_targ;
6417 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
6419 SV *const namesv = PAD_COMPNAME_SV(padoff);
6421 const char *const name = SvPV_const(namesv, len);
6423 if (len == 2 && name[0] == '$' && name[1] == '_')
6424 iterpflags |= OPpITER_DEF;
6428 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
6429 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
6430 sv = newGVOP(OP_GV, 0, PL_defgv);
6435 iterpflags |= OPpITER_DEF;
6437 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
6438 expr = op_lvalue(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
6439 iterflags |= OPf_STACKED;
6441 else if (expr->op_type == OP_NULL &&
6442 (expr->op_flags & OPf_KIDS) &&
6443 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
6445 /* Basically turn for($x..$y) into the same as for($x,$y), but we
6446 * set the STACKED flag to indicate that these values are to be
6447 * treated as min/max values by 'pp_enteriter'.
6449 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
6450 LOGOP* const range = (LOGOP*) flip->op_first;
6451 OP* const left = range->op_first;
6452 OP* const right = left->op_sibling;
6455 range->op_flags &= ~OPf_KIDS;
6456 range->op_first = NULL;
6458 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
6459 listop->op_first->op_next = range->op_next;
6460 left->op_next = range->op_other;
6461 right->op_next = (OP*)listop;
6462 listop->op_next = listop->op_first;
6465 op_getmad(expr,(OP*)listop,'O');
6469 expr = (OP*)(listop);
6471 iterflags |= OPf_STACKED;
6474 expr = op_lvalue(force_list(expr), OP_GREPSTART);
6477 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
6478 op_append_elem(OP_LIST, expr, scalar(sv))));
6479 assert(!loop->op_next);
6480 /* for my $x () sets OPpLVAL_INTRO;
6481 * for our $x () sets OPpOUR_INTRO */
6482 loop->op_private = (U8)iterpflags;
6483 if (loop->op_slabbed
6484 && DIFF(loop, OpSLOT(loop)->opslot_next)
6485 < SIZE_TO_PSIZE(sizeof(LOOP)))
6488 NewOp(1234,tmp,1,LOOP);
6489 Copy(loop,tmp,1,LISTOP);
6490 S_op_destroy(aTHX_ (OP*)loop);
6493 else if (!loop->op_slabbed)
6494 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
6495 loop->op_targ = padoff;
6496 wop = newWHILEOP(flags, 1, loop, newOP(OP_ITER, 0), block, cont, 0);
6498 op_getmad(madsv, (OP*)loop, 'v');
6503 =for apidoc Am|OP *|newLOOPEX|I32 type|OP *label
6505 Constructs, checks, and returns a loop-exiting op (such as C<goto>
6506 or C<last>). I<type> is the opcode. I<label> supplies the parameter
6507 determining the target of the op; it is consumed by this function and
6508 becomes part of the constructed op tree.
6514 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
6519 PERL_ARGS_ASSERT_NEWLOOPEX;
6521 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
6523 if (type != OP_GOTO) {
6524 /* "last()" means "last" */
6525 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS)) {
6526 o = newOP(type, OPf_SPECIAL);
6530 /* Check whether it's going to be a goto &function */
6531 if (label->op_type == OP_ENTERSUB
6532 && !(label->op_flags & OPf_STACKED))
6533 label = newUNOP(OP_REFGEN, 0, op_lvalue(label, OP_REFGEN));
6536 /* Check for a constant argument */
6537 if (label->op_type == OP_CONST) {
6538 SV * const sv = ((SVOP *)label)->op_sv;
6540 const char *s = SvPV_const(sv,l);
6541 if (l == strlen(s)) {
6543 SvUTF8(((SVOP*)label)->op_sv),
6545 SvPV_nolen_const(((SVOP*)label)->op_sv)));
6549 /* If we have already created an op, we do not need the label. */
6552 op_getmad(label,o,'L');
6556 else o = newUNOP(type, OPf_STACKED, label);
6558 PL_hints |= HINT_BLOCK_SCOPE;
6562 /* if the condition is a literal array or hash
6563 (or @{ ... } etc), make a reference to it.
6566 S_ref_array_or_hash(pTHX_ OP *cond)
6569 && (cond->op_type == OP_RV2AV
6570 || cond->op_type == OP_PADAV
6571 || cond->op_type == OP_RV2HV
6572 || cond->op_type == OP_PADHV))
6574 return newUNOP(OP_REFGEN, 0, op_lvalue(cond, OP_REFGEN));
6577 && (cond->op_type == OP_ASLICE
6578 || cond->op_type == OP_HSLICE)) {
6580 /* anonlist now needs a list from this op, was previously used in
6582 cond->op_flags |= ~(OPf_WANT_SCALAR | OPf_REF);
6583 cond->op_flags |= OPf_WANT_LIST;
6585 return newANONLIST(op_lvalue(cond, OP_ANONLIST));
6592 /* These construct the optree fragments representing given()
6595 entergiven and enterwhen are LOGOPs; the op_other pointer
6596 points up to the associated leave op. We need this so we
6597 can put it in the context and make break/continue work.
6598 (Also, of course, pp_enterwhen will jump straight to
6599 op_other if the match fails.)
6603 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
6604 I32 enter_opcode, I32 leave_opcode,
6605 PADOFFSET entertarg)
6611 PERL_ARGS_ASSERT_NEWGIVWHENOP;
6613 NewOp(1101, enterop, 1, LOGOP);
6614 enterop->op_type = (Optype)enter_opcode;
6615 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
6616 enterop->op_flags = (U8) OPf_KIDS;
6617 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
6618 enterop->op_private = 0;
6620 o = newUNOP(leave_opcode, 0, (OP *) enterop);
6623 enterop->op_first = scalar(cond);
6624 cond->op_sibling = block;
6626 o->op_next = LINKLIST(cond);
6627 cond->op_next = (OP *) enterop;
6630 /* This is a default {} block */
6631 enterop->op_first = block;
6632 enterop->op_flags |= OPf_SPECIAL;
6633 o ->op_flags |= OPf_SPECIAL;
6635 o->op_next = (OP *) enterop;
6638 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
6639 entergiven and enterwhen both
6642 enterop->op_next = LINKLIST(block);
6643 block->op_next = enterop->op_other = o;
6648 /* Does this look like a boolean operation? For these purposes
6649 a boolean operation is:
6650 - a subroutine call [*]
6651 - a logical connective
6652 - a comparison operator
6653 - a filetest operator, with the exception of -s -M -A -C
6654 - defined(), exists() or eof()
6655 - /$re/ or $foo =~ /$re/
6657 [*] possibly surprising
6660 S_looks_like_bool(pTHX_ const OP *o)
6664 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
6666 switch(o->op_type) {
6669 return looks_like_bool(cLOGOPo->op_first);
6673 looks_like_bool(cLOGOPo->op_first)
6674 && looks_like_bool(cLOGOPo->op_first->op_sibling));
6679 o->op_flags & OPf_KIDS
6680 && looks_like_bool(cUNOPo->op_first));
6684 case OP_NOT: case OP_XOR:
6686 case OP_EQ: case OP_NE: case OP_LT:
6687 case OP_GT: case OP_LE: case OP_GE:
6689 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
6690 case OP_I_GT: case OP_I_LE: case OP_I_GE:
6692 case OP_SEQ: case OP_SNE: case OP_SLT:
6693 case OP_SGT: case OP_SLE: case OP_SGE:
6697 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
6698 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
6699 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
6700 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
6701 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
6702 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
6703 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
6704 case OP_FTTEXT: case OP_FTBINARY:
6706 case OP_DEFINED: case OP_EXISTS:
6707 case OP_MATCH: case OP_EOF:
6714 /* Detect comparisons that have been optimized away */
6715 if (cSVOPo->op_sv == &PL_sv_yes
6716 || cSVOPo->op_sv == &PL_sv_no)
6729 =for apidoc Am|OP *|newGIVENOP|OP *cond|OP *block|PADOFFSET defsv_off
6731 Constructs, checks, and returns an op tree expressing a C<given> block.
6732 I<cond> supplies the expression that will be locally assigned to a lexical
6733 variable, and I<block> supplies the body of the C<given> construct; they
6734 are consumed by this function and become part of the constructed op tree.
6735 I<defsv_off> is the pad offset of the scalar lexical variable that will
6736 be affected. If it is 0, the global $_ will be used.
6742 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
6745 PERL_ARGS_ASSERT_NEWGIVENOP;
6746 return newGIVWHENOP(
6747 ref_array_or_hash(cond),
6749 OP_ENTERGIVEN, OP_LEAVEGIVEN,
6754 =for apidoc Am|OP *|newWHENOP|OP *cond|OP *block
6756 Constructs, checks, and returns an op tree expressing a C<when> block.
6757 I<cond> supplies the test expression, and I<block> supplies the block
6758 that will be executed if the test evaluates to true; they are consumed
6759 by this function and become part of the constructed op tree. I<cond>
6760 will be interpreted DWIMically, often as a comparison against C<$_>,
6761 and may be null to generate a C<default> block.
6767 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
6769 const bool cond_llb = (!cond || looks_like_bool(cond));
6772 PERL_ARGS_ASSERT_NEWWHENOP;
6777 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
6779 scalar(ref_array_or_hash(cond)));
6782 return newGIVWHENOP(cond_op, block, OP_ENTERWHEN, OP_LEAVEWHEN, 0);
6786 Perl_cv_ckproto_len_flags(pTHX_ const CV *cv, const GV *gv, const char *p,
6787 const STRLEN len, const U32 flags)
6789 const char * const cvp = SvROK(cv) ? "" : CvPROTO(cv);
6790 const STRLEN clen = CvPROTOLEN(cv);
6792 PERL_ARGS_ASSERT_CV_CKPROTO_LEN_FLAGS;
6794 if (((!p != !cvp) /* One has prototype, one has not. */
6796 (flags & SVf_UTF8) == SvUTF8(cv)
6797 ? len != clen || memNE(cvp, p, len)
6799 ? bytes_cmp_utf8((const U8 *)cvp, clen,
6801 : bytes_cmp_utf8((const U8 *)p, len,
6802 (const U8 *)cvp, clen)
6806 && ckWARN_d(WARN_PROTOTYPE)) {
6807 SV* const msg = sv_newmortal();
6813 gv_efullname3(name = sv_newmortal(), gv, NULL);
6814 else if (SvPOK(gv) && *SvPVX((SV *)gv) == '&')
6815 name = newSVpvn_flags(SvPVX((SV *)gv)+1, SvCUR(gv)-1,
6816 SvUTF8(gv)|SVs_TEMP);
6817 else name = (SV *)gv;
6819 sv_setpvs(msg, "Prototype mismatch:");
6821 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
6823 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")",
6824 SVfARG(newSVpvn_flags(cvp,clen, SvUTF8(cv)|SVs_TEMP))
6827 sv_catpvs(msg, ": none");
6828 sv_catpvs(msg, " vs ");
6830 Perl_sv_catpvf(aTHX_ msg, "(%"SVf")", SVfARG(newSVpvn_flags(p, len, flags | SVs_TEMP)));
6832 sv_catpvs(msg, "none");
6833 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
6837 static void const_sv_xsub(pTHX_ CV* cv);
6841 =head1 Optree Manipulation Functions
6843 =for apidoc cv_const_sv
6845 If C<cv> is a constant sub eligible for inlining. returns the constant
6846 value returned by the sub. Otherwise, returns NULL.
6848 Constant subs can be created with C<newCONSTSUB> or as described in
6849 L<perlsub/"Constant Functions">.
6854 Perl_cv_const_sv(pTHX_ const CV *const cv)
6856 PERL_UNUSED_CONTEXT;
6859 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
6861 return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
6864 /* op_const_sv: examine an optree to determine whether it's in-lineable.
6865 * Can be called in 3 ways:
6868 * look for a single OP_CONST with attached value: return the value
6870 * cv && CvCLONE(cv) && !CvCONST(cv)
6872 * examine the clone prototype, and if contains only a single
6873 * OP_CONST referencing a pad const, or a single PADSV referencing
6874 * an outer lexical, return a non-zero value to indicate the CV is
6875 * a candidate for "constizing" at clone time
6879 * We have just cloned an anon prototype that was marked as a const
6880 * candidate. Try to grab the current value, and in the case of
6881 * PADSV, ignore it if it has multiple references. In this case we
6882 * return a newly created *copy* of the value.
6886 Perl_op_const_sv(pTHX_ const OP *o, CV *cv)
6897 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
6898 o = cLISTOPo->op_first->op_sibling;
6900 for (; o; o = o->op_next) {
6901 const OPCODE type = o->op_type;
6903 if (sv && o->op_next == o)
6905 if (o->op_next != o) {
6906 if (type == OP_NEXTSTATE
6907 || (type == OP_NULL && !(o->op_flags & OPf_KIDS))
6908 || type == OP_PUSHMARK)
6910 if (type == OP_DBSTATE)
6913 if (type == OP_LEAVESUB || type == OP_RETURN)
6917 if (type == OP_CONST && cSVOPo->op_sv)
6919 else if (cv && type == OP_CONST) {
6920 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6924 else if (cv && type == OP_PADSV) {
6925 if (CvCONST(cv)) { /* newly cloned anon */
6926 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6927 /* the candidate should have 1 ref from this pad and 1 ref
6928 * from the parent */
6929 if (!sv || SvREFCNT(sv) != 2)
6936 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
6937 sv = &PL_sv_undef; /* an arbitrary non-null value */
6948 S_already_defined(pTHX_ CV *const cv, OP * const block, OP * const o,
6949 PADNAME * const name, SV ** const const_svp)
6956 || block->op_type == OP_NULL
6959 if (CvFLAGS(PL_compcv)) {
6960 /* might have had built-in attrs applied */
6961 const bool pureperl = !CvISXSUB(cv) && CvROOT(cv);
6962 if (CvLVALUE(PL_compcv) && ! CvLVALUE(cv) && pureperl
6963 && ckWARN(WARN_MISC))
6965 /* protect against fatal warnings leaking compcv */
6966 SAVEFREESV(PL_compcv);
6967 Perl_warner(aTHX_ packWARN(WARN_MISC), "lvalue attribute ignored after the subroutine has been defined");
6968 SvREFCNT_inc_simple_void_NN(PL_compcv);
6971 (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS
6972 & ~(CVf_LVALUE * pureperl));
6977 /* redundant check for speed: */
6978 if (CvCONST(cv) || ckWARN(WARN_REDEFINE)) {
6979 const line_t oldline = CopLINE(PL_curcop);
6982 : sv_2mortal(newSVpvn_utf8(
6983 PadnamePV(name)+1,PadnameLEN(name)-1, PadnameUTF8(name)
6985 if (PL_parser && PL_parser->copline != NOLINE)
6986 /* This ensures that warnings are reported at the first
6987 line of a redefinition, not the last. */
6988 CopLINE_set(PL_curcop, PL_parser->copline);
6989 /* protect against fatal warnings leaking compcv */
6990 SAVEFREESV(PL_compcv);
6991 report_redefined_cv(namesv, cv, const_svp);
6992 SvREFCNT_inc_simple_void_NN(PL_compcv);
6993 CopLINE_set(PL_curcop, oldline);
6996 if (!PL_minus_c) /* keep old one around for madskills */
6999 /* (PL_madskills unset in used file.) */
7006 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
7012 STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */
7015 CV *compcv = PL_compcv;
7018 PADOFFSET pax = o->op_targ;
7019 CV *outcv = CvOUTSIDE(PL_compcv);
7022 bool reusable = FALSE;
7024 PERL_ARGS_ASSERT_NEWMYSUB;
7026 /* Find the pad slot for storing the new sub.
7027 We cannot use PL_comppad, as it is the pad owned by the new sub. We
7028 need to look in CvOUTSIDE and find the pad belonging to the enclos-
7029 ing sub. And then we need to dig deeper if this is a lexical from
7031 my sub foo; sub { sub foo { } }
7034 name = PadlistNAMESARRAY(CvPADLIST(outcv))[pax];
7035 if (PadnameOUTER(name) && PARENT_PAD_INDEX(name)) {
7036 pax = PARENT_PAD_INDEX(name);
7037 outcv = CvOUTSIDE(outcv);
7042 &PadARRAY(PadlistARRAY(CvPADLIST(outcv))
7043 [CvDEPTH(outcv) ? CvDEPTH(outcv) : 1])[pax];
7044 spot = (CV **)svspot;
7047 assert(proto->op_type == OP_CONST);
7048 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
7049 ps_utf8 = SvUTF8(((SVOP*)proto)->op_sv);
7054 if (!PL_madskills) {
7061 if (PL_parser && PL_parser->error_count) {
7063 SvREFCNT_dec(PL_compcv);
7068 if (CvDEPTH(outcv) && CvCLONE(compcv)) {
7070 svspot = (SV **)(spot = &clonee);
7072 else if (PadnameIsSTATE(name) || CvDEPTH(outcv))
7076 SvUPGRADE(name, SVt_PVMG);
7077 mg = mg_find(name, PERL_MAGIC_proto);
7078 assert (SvTYPE(*spot) == SVt_PVCV);
7080 hek = CvNAME_HEK(*spot);
7082 CvNAME_HEK_set(*spot, hek =
7085 PadnameLEN(name)-1 * (PadnameUTF8(name) ? -1 : 1), 0
7091 cv = (CV *)mg->mg_obj;
7094 sv_magic(name, &PL_sv_undef, PERL_MAGIC_proto, NULL, 0);
7095 mg = mg_find(name, PERL_MAGIC_proto);
7097 spot = (CV **)(svspot = &mg->mg_obj);
7100 if (!block || !ps || *ps || attrs
7101 || (CvFLAGS(compcv) & CVf_BUILTIN_ATTRS)
7103 || block->op_type == OP_NULL
7108 const_sv = op_const_sv(block, NULL);
7111 const bool exists = CvROOT(cv) || CvXSUB(cv);
7113 /* if the subroutine doesn't exist and wasn't pre-declared
7114 * with a prototype, assume it will be AUTOLOADed,
7115 * skipping the prototype check
7117 if (exists || SvPOK(cv))
7118 cv_ckproto_len_flags(cv, (GV *)name, ps, ps_len, ps_utf8);
7119 /* already defined? */
7121 if (S_already_defined(aTHX_ cv, block, NULL, name, &const_sv))
7124 if (attrs) goto attrs;
7125 /* just a "sub foo;" when &foo is already defined */
7130 else if (CvDEPTH(outcv) && CvCLONE(compcv)) {
7136 SvREFCNT_inc_simple_void_NN(const_sv);
7138 assert(!CvROOT(cv) && !CvCONST(cv));
7142 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7143 CvFILE_set_from_cop(cv, PL_curcop);
7144 CvSTASH_set(cv, PL_curstash);
7147 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
7148 CvXSUBANY(cv).any_ptr = const_sv;
7149 CvXSUB(cv) = const_sv_xsub;
7155 SvREFCNT_dec(compcv);
7159 /* Checking whether outcv is CvOUTSIDE(compcv) is not sufficient to
7160 determine whether this sub definition is in the same scope as its
7161 declaration. If this sub definition is inside an inner named pack-
7162 age sub (my sub foo; sub bar { sub foo { ... } }), outcv points to
7163 the package sub. So check PadnameOUTER(name) too.
7165 if (outcv == CvOUTSIDE(compcv) && !PadnameOUTER(name)) {
7166 assert(!CvWEAKOUTSIDE(compcv));
7167 SvREFCNT_dec(CvOUTSIDE(compcv));
7168 CvWEAKOUTSIDE_on(compcv);
7170 /* XXX else do we have a circular reference? */
7171 if (cv) { /* must reuse cv in case stub is referenced elsewhere */
7172 /* transfer PL_compcv to cv */
7175 && block->op_type != OP_NULL
7178 cv_flags_t preserved_flags =
7179 CvFLAGS(cv) & (CVf_BUILTIN_ATTRS|CVf_NAMED);
7180 PADLIST *const temp_padl = CvPADLIST(cv);
7181 CV *const temp_cv = CvOUTSIDE(cv);
7182 const cv_flags_t other_flags =
7183 CvFLAGS(cv) & (CVf_SLABBED|CVf_WEAKOUTSIDE);
7184 OP * const cvstart = CvSTART(cv);
7188 CvFLAGS(compcv) | preserved_flags;
7189 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
7190 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(compcv);
7191 CvPADLIST(cv) = CvPADLIST(compcv);
7192 CvOUTSIDE(compcv) = temp_cv;
7193 CvPADLIST(compcv) = temp_padl;
7194 CvSTART(cv) = CvSTART(compcv);
7195 CvSTART(compcv) = cvstart;
7196 CvFLAGS(compcv) &= ~(CVf_SLABBED|CVf_WEAKOUTSIDE);
7197 CvFLAGS(compcv) |= other_flags;
7199 if (CvFILE(cv) && CvDYNFILE(cv)) {
7200 Safefree(CvFILE(cv));
7203 /* inner references to compcv must be fixed up ... */
7204 pad_fixup_inner_anons(CvPADLIST(cv), compcv, cv);
7205 if (PERLDB_INTER)/* Advice debugger on the new sub. */
7206 ++PL_sub_generation;
7209 /* Might have had built-in attributes applied -- propagate them. */
7210 CvFLAGS(cv) |= (CvFLAGS(compcv) & CVf_BUILTIN_ATTRS);
7212 /* ... before we throw it away */
7213 SvREFCNT_dec(compcv);
7214 PL_compcv = compcv = cv;
7220 if (!CvNAME_HEK(cv)) {
7223 ? share_hek_hek(hek)
7224 : share_hek(PadnamePV(name)+1,
7225 PadnameLEN(name)-1 * (PadnameUTF8(name) ? -1 : 1),
7229 CvFILE_set_from_cop(cv, PL_curcop);
7230 CvSTASH_set(cv, PL_curstash);
7233 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
7234 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(cv));
7241 /* If we assign an optree to a PVCV, then we've defined a subroutine that
7242 the debugger could be able to set a breakpoint in, so signal to
7243 pp_entereval that it should not throw away any saved lines at scope
7246 PL_breakable_sub_gen++;
7247 /* This makes sub {}; work as expected. */
7248 if (block->op_type == OP_STUB) {
7249 OP* const newblock = newSTATEOP(0, NULL, 0);
7251 op_getmad(block,newblock,'B');
7257 CvROOT(cv) = CvLVALUE(cv)
7258 ? newUNOP(OP_LEAVESUBLV, 0,
7259 op_lvalue(scalarseq(block), OP_LEAVESUBLV))
7260 : newUNOP(OP_LEAVESUB, 0, scalarseq(block));
7261 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7262 OpREFCNT_set(CvROOT(cv), 1);
7263 /* The cv no longer needs to hold a refcount on the slab, as CvROOT
7264 itself has a refcount. */
7266 OpslabREFCNT_dec_padok((OPSLAB *)CvSTART(cv));
7267 CvSTART(cv) = LINKLIST(CvROOT(cv));
7268 CvROOT(cv)->op_next = 0;
7269 CALL_PEEP(CvSTART(cv));
7270 finalize_optree(CvROOT(cv));
7272 /* now that optimizer has done its work, adjust pad values */
7274 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
7277 assert(!CvCONST(cv));
7278 if (ps && !*ps && op_const_sv(block, cv))
7284 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
7285 apply_attrs(PL_curstash, MUTABLE_SV(cv), attrs);
7289 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
7290 SV * const tmpstr = sv_newmortal();
7291 GV * const db_postponed = gv_fetchpvs("DB::postponed",
7292 GV_ADDMULTI, SVt_PVHV);
7294 SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld",
7297 (long)CopLINE(PL_curcop));
7298 if (HvNAME_HEK(PL_curstash)) {
7299 sv_sethek(tmpstr, HvNAME_HEK(PL_curstash));
7300 sv_catpvs(tmpstr, "::");
7302 else sv_setpvs(tmpstr, "__ANON__::");
7303 sv_catpvn_flags(tmpstr, PadnamePV(name)+1, PadnameLEN(name)-1,
7304 PadnameUTF8(name) ? SV_CATUTF8 : SV_CATBYTES);
7305 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
7306 SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr), sv, 0);
7307 hv = GvHVn(db_postponed);
7308 if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr))) {
7309 CV * const pcv = GvCV(db_postponed);
7315 call_sv(MUTABLE_SV(pcv), G_DISCARD);
7323 assert(CvDEPTH(outcv));
7325 &PadARRAY(PadlistARRAY(CvPADLIST(outcv))[CvDEPTH(outcv)])[pax];
7326 if (reusable) cv_clone_into(clonee, *spot);
7327 else *spot = cv_clone(clonee);
7328 SvREFCNT_dec_NN(clonee);
7332 if (CvDEPTH(outcv) && !reusable && PadnameIsSTATE(name)) {
7333 PADOFFSET depth = CvDEPTH(outcv);
7336 svspot = &PadARRAY(PadlistARRAY(CvPADLIST(outcv))[depth])[pax];
7338 *svspot = SvREFCNT_inc_simple_NN(cv);
7339 SvREFCNT_dec(oldcv);
7345 PL_parser->copline = NOLINE;
7352 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
7354 return newATTRSUB_flags(floor, o, proto, attrs, block, 0);
7358 Perl_newATTRSUB_flags(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs,
7359 OP *block, U32 flags)
7364 STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */
7368 const bool ec = PL_parser && PL_parser->error_count;
7369 /* If the subroutine has no body, no attributes, and no builtin attributes
7370 then it's just a sub declaration, and we may be able to get away with
7371 storing with a placeholder scalar in the symbol table, rather than a
7372 full GV and CV. If anything is present then it will take a full CV to
7374 const I32 gv_fetch_flags
7375 = ec ? GV_NOADD_NOINIT :
7376 (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
7378 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
7380 const bool o_is_gv = flags & 1;
7381 const char * const name =
7382 o ? SvPV_const(o_is_gv ? (SV *)o : cSVOPo->op_sv, namlen) : NULL;
7384 bool name_is_utf8 = o && !o_is_gv && SvUTF8(cSVOPo->op_sv);
7385 #ifdef PERL_DEBUG_READONLY_OPS
7386 OPSLAB *slab = NULL;
7390 assert(proto->op_type == OP_CONST);
7391 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
7392 ps_utf8 = SvUTF8(((SVOP*)proto)->op_sv);
7402 gv = gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV);
7404 } else if (PERLDB_NAMEANON && CopLINE(PL_curcop)) {
7405 SV * const sv = sv_newmortal();
7406 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
7407 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
7408 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7409 gv = gv_fetchsv(sv, gv_fetch_flags, SVt_PVCV);
7411 } else if (PL_curstash) {
7412 gv = gv_fetchpvs("__ANON__", gv_fetch_flags, SVt_PVCV);
7415 gv = gv_fetchpvs("__ANON__::__ANON__", gv_fetch_flags, SVt_PVCV);
7419 if (!PL_madskills) {
7430 if (name) SvREFCNT_dec(PL_compcv);
7431 else cv = PL_compcv;
7433 if (name && block) {
7434 const char *s = strrchr(name, ':');
7436 if (strEQ(s, "BEGIN")) {
7437 if (PL_in_eval & EVAL_KEEPERR)
7438 Perl_croak_nocontext("BEGIN not safe after errors--compilation aborted");
7440 SV * const errsv = ERRSV;
7441 /* force display of errors found but not reported */
7442 sv_catpvs(errsv, "BEGIN not safe after errors--compilation aborted");
7443 Perl_croak_nocontext("%"SVf, SVfARG(errsv));
7450 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
7451 maximum a prototype before. */
7452 if (SvTYPE(gv) > SVt_NULL) {
7453 cv_ckproto_len_flags((const CV *)gv,
7454 o ? (const GV *)cSVOPo->op_sv : NULL, ps,
7458 sv_setpvn(MUTABLE_SV(gv), ps, ps_len);
7459 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(gv));
7462 sv_setiv(MUTABLE_SV(gv), -1);
7464 SvREFCNT_dec(PL_compcv);
7465 cv = PL_compcv = NULL;
7469 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
7471 if (!block || !ps || *ps || attrs
7472 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
7474 || block->op_type == OP_NULL
7479 const_sv = op_const_sv(block, NULL);
7482 const bool exists = CvROOT(cv) || CvXSUB(cv);
7484 /* if the subroutine doesn't exist and wasn't pre-declared
7485 * with a prototype, assume it will be AUTOLOADed,
7486 * skipping the prototype check
7488 if (exists || SvPOK(cv))
7489 cv_ckproto_len_flags(cv, gv, ps, ps_len, ps_utf8);
7490 /* already defined (or promised)? */
7491 if (exists || GvASSUMECV(gv)) {
7492 if (S_already_defined(aTHX_ cv, block, o, NULL, &const_sv))
7495 if (attrs) goto attrs;
7496 /* just a "sub foo;" when &foo is already defined */
7497 SAVEFREESV(PL_compcv);
7503 SvREFCNT_inc_simple_void_NN(const_sv);
7505 assert(!CvROOT(cv) && !CvCONST(cv));
7507 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
7508 CvXSUBANY(cv).any_ptr = const_sv;
7509 CvXSUB(cv) = const_sv_xsub;
7515 cv = newCONSTSUB_flags(
7516 NULL, name, namlen, name_is_utf8 ? SVf_UTF8 : 0,
7523 SvREFCNT_dec(PL_compcv);
7527 if (cv) { /* must reuse cv if autoloaded */
7528 /* transfer PL_compcv to cv */
7531 && block->op_type != OP_NULL
7534 cv_flags_t existing_builtin_attrs = CvFLAGS(cv) & CVf_BUILTIN_ATTRS;
7535 PADLIST *const temp_av = CvPADLIST(cv);
7536 CV *const temp_cv = CvOUTSIDE(cv);
7537 const cv_flags_t other_flags =
7538 CvFLAGS(cv) & (CVf_SLABBED|CVf_WEAKOUTSIDE);
7539 OP * const cvstart = CvSTART(cv);
7542 assert(!CvCVGV_RC(cv));
7543 assert(CvGV(cv) == gv);
7546 CvFLAGS(cv) = CvFLAGS(PL_compcv) | existing_builtin_attrs;
7547 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
7548 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
7549 CvPADLIST(cv) = CvPADLIST(PL_compcv);
7550 CvOUTSIDE(PL_compcv) = temp_cv;
7551 CvPADLIST(PL_compcv) = temp_av;
7552 CvSTART(cv) = CvSTART(PL_compcv);
7553 CvSTART(PL_compcv) = cvstart;
7554 CvFLAGS(PL_compcv) &= ~(CVf_SLABBED|CVf_WEAKOUTSIDE);
7555 CvFLAGS(PL_compcv) |= other_flags;
7557 if (CvFILE(cv) && CvDYNFILE(cv)) {
7558 Safefree(CvFILE(cv));
7560 CvFILE_set_from_cop(cv, PL_curcop);
7561 CvSTASH_set(cv, PL_curstash);
7563 /* inner references to PL_compcv must be fixed up ... */
7564 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
7565 if (PERLDB_INTER)/* Advice debugger on the new sub. */
7566 ++PL_sub_generation;
7569 /* Might have had built-in attributes applied -- propagate them. */
7570 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
7572 /* ... before we throw it away */
7573 SvREFCNT_dec(PL_compcv);
7581 if (HvENAME_HEK(GvSTASH(gv)))
7582 /* sub Foo::bar { (shift)+1 } */
7583 gv_method_changed(gv);
7588 CvFILE_set_from_cop(cv, PL_curcop);
7589 CvSTASH_set(cv, PL_curstash);
7593 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
7594 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(cv));
7601 /* If we assign an optree to a PVCV, then we've defined a subroutine that
7602 the debugger could be able to set a breakpoint in, so signal to
7603 pp_entereval that it should not throw away any saved lines at scope
7606 PL_breakable_sub_gen++;
7607 /* This makes sub {}; work as expected. */
7608 if (block->op_type == OP_STUB) {
7609 OP* const newblock = newSTATEOP(0, NULL, 0);
7611 op_getmad(block,newblock,'B');
7617 CvROOT(cv) = CvLVALUE(cv)
7618 ? newUNOP(OP_LEAVESUBLV, 0,
7619 op_lvalue(scalarseq(block), OP_LEAVESUBLV))
7620 : newUNOP(OP_LEAVESUB, 0, scalarseq(block));
7621 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7622 OpREFCNT_set(CvROOT(cv), 1);
7623 /* The cv no longer needs to hold a refcount on the slab, as CvROOT
7624 itself has a refcount. */
7626 OpslabREFCNT_dec_padok((OPSLAB *)CvSTART(cv));
7627 #ifdef PERL_DEBUG_READONLY_OPS
7628 slab = (OPSLAB *)CvSTART(cv);
7630 CvSTART(cv) = LINKLIST(CvROOT(cv));
7631 CvROOT(cv)->op_next = 0;
7632 CALL_PEEP(CvSTART(cv));
7633 finalize_optree(CvROOT(cv));
7635 /* now that optimizer has done its work, adjust pad values */
7637 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
7640 assert(!CvCONST(cv));
7641 if (ps && !*ps && op_const_sv(block, cv))
7647 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
7648 HV *stash = name && GvSTASH(CvGV(cv)) ? GvSTASH(CvGV(cv)) : PL_curstash;
7649 if (!name) SAVEFREESV(cv);
7650 apply_attrs(stash, MUTABLE_SV(cv), attrs);
7651 if (!name) SvREFCNT_inc_simple_void_NN(cv);
7654 if (block && has_name) {
7655 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
7656 SV * const tmpstr = sv_newmortal();
7657 GV * const db_postponed = gv_fetchpvs("DB::postponed",
7658 GV_ADDMULTI, SVt_PVHV);
7660 SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld",
7663 (long)CopLINE(PL_curcop));
7664 gv_efullname3(tmpstr, gv, NULL);
7665 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
7666 SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr), sv, 0);
7667 hv = GvHVn(db_postponed);
7668 if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr))) {
7669 CV * const pcv = GvCV(db_postponed);
7675 call_sv(MUTABLE_SV(pcv), G_DISCARD);
7680 if (name && ! (PL_parser && PL_parser->error_count))
7681 process_special_blocks(floor, name, gv, cv);
7686 PL_parser->copline = NOLINE;
7688 #ifdef PERL_DEBUG_READONLY_OPS
7689 /* Watch out for BEGIN blocks */
7690 if (slab && gv && isGV(gv) && GvCV(gv)) Slab_to_ro(slab);
7696 S_process_special_blocks(pTHX_ I32 floor, const char *const fullname,
7700 const char *const colon = strrchr(fullname,':');
7701 const char *const name = colon ? colon + 1 : fullname;
7703 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
7706 if (strEQ(name, "BEGIN")) {
7707 const I32 oldscope = PL_scopestack_ix;
7708 if (floor) LEAVE_SCOPE(floor);
7710 SAVECOPFILE(&PL_compiling);
7711 SAVECOPLINE(&PL_compiling);
7712 SAVEVPTR(PL_curcop);
7714 DEBUG_x( dump_sub(gv) );
7715 Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv));
7716 GvCV_set(gv,0); /* cv has been hijacked */
7717 call_list(oldscope, PL_beginav);
7719 CopHINTS_set(&PL_compiling, PL_hints);
7726 if strEQ(name, "END") {
7727 DEBUG_x( dump_sub(gv) );
7728 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv));
7731 } else if (*name == 'U') {
7732 if (strEQ(name, "UNITCHECK")) {
7733 /* It's never too late to run a unitcheck block */
7734 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv));
7738 } else if (*name == 'C') {
7739 if (strEQ(name, "CHECK")) {
7741 /* diag_listed_as: Too late to run %s block */
7742 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
7743 "Too late to run CHECK block");
7744 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv));
7748 } else if (*name == 'I') {
7749 if (strEQ(name, "INIT")) {
7751 /* diag_listed_as: Too late to run %s block */
7752 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
7753 "Too late to run INIT block");
7754 Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv));
7760 DEBUG_x( dump_sub(gv) );
7761 GvCV_set(gv,0); /* cv has been hijacked */
7766 =for apidoc newCONSTSUB
7768 See L</newCONSTSUB_flags>.
7774 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
7776 return newCONSTSUB_flags(stash, name, name ? strlen(name) : 0, 0, sv);
7780 =for apidoc newCONSTSUB_flags
7782 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
7783 eligible for inlining at compile-time.
7785 Currently, the only useful value for C<flags> is SVf_UTF8.
7787 The newly created subroutine takes ownership of a reference to the passed in
7790 Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>,
7791 which won't be called if used as a destructor, but will suppress the overhead
7792 of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at
7799 Perl_newCONSTSUB_flags(pTHX_ HV *stash, const char *name, STRLEN len,
7805 const char *const file = CopFILE(PL_curcop);
7807 SV *const temp_sv = CopFILESV(PL_curcop);
7808 const char *const file = temp_sv ? SvPV_nolen_const(temp_sv) : NULL;
7813 if (IN_PERL_RUNTIME) {
7814 /* at runtime, it's not safe to manipulate PL_curcop: it may be
7815 * an op shared between threads. Use a non-shared COP for our
7817 SAVEVPTR(PL_curcop);
7818 SAVECOMPILEWARNINGS();
7819 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
7820 PL_curcop = &PL_compiling;
7822 SAVECOPLINE(PL_curcop);
7823 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
7826 PL_hints &= ~HINT_BLOCK_SCOPE;
7829 SAVEGENERICSV(PL_curstash);
7830 PL_curstash = (HV *)SvREFCNT_inc_simple_NN(stash);
7833 /* Protect sv against leakage caused by fatal warnings. */
7834 if (sv) SAVEFREESV(sv);
7836 /* file becomes the CvFILE. For an XS, it's usually static storage,
7837 and so doesn't get free()d. (It's expected to be from the C pre-
7838 processor __FILE__ directive). But we need a dynamically allocated one,
7839 and we need it to get freed. */
7840 cv = newXS_len_flags(name, len, const_sv_xsub, file ? file : "", "",
7841 &sv, XS_DYNAMIC_FILENAME | flags);
7842 CvXSUBANY(cv).any_ptr = SvREFCNT_inc_simple(sv);
7851 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
7852 const char *const filename, const char *const proto,
7855 PERL_ARGS_ASSERT_NEWXS_FLAGS;
7856 return newXS_len_flags(
7857 name, name ? strlen(name) : 0, subaddr, filename, proto, NULL, flags
7862 Perl_newXS_len_flags(pTHX_ const char *name, STRLEN len,
7863 XSUBADDR_t subaddr, const char *const filename,
7864 const char *const proto, SV **const_svp,
7869 PERL_ARGS_ASSERT_NEWXS_LEN_FLAGS;
7872 GV * const gv = gv_fetchpvn(
7873 name ? name : PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
7874 name ? len : PL_curstash ? sizeof("__ANON__") - 1:
7875 sizeof("__ANON__::__ANON__") - 1,
7876 GV_ADDMULTI | flags, SVt_PVCV);
7879 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
7881 if ((cv = (name ? GvCV(gv) : NULL))) {
7883 /* just a cached method */
7887 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
7888 /* already defined (or promised) */
7889 /* Redundant check that allows us to avoid creating an SV
7890 most of the time: */
7891 if (CvCONST(cv) || ckWARN(WARN_REDEFINE)) {
7892 report_redefined_cv(newSVpvn_flags(
7893 name,len,(flags&SVf_UTF8)|SVs_TEMP
7897 SvREFCNT_dec_NN(cv);
7902 if (cv) /* must reuse cv if autoloaded */
7905 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7909 if (HvENAME_HEK(GvSTASH(gv)))
7910 gv_method_changed(gv); /* newXS */
7916 (void)gv_fetchfile(filename);
7917 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
7918 an external constant string */
7919 assert(!CvDYNFILE(cv)); /* cv_undef should have turned it off */
7921 CvXSUB(cv) = subaddr;
7924 process_special_blocks(0, name, gv, cv);
7927 if (flags & XS_DYNAMIC_FILENAME) {
7928 CvFILE(cv) = savepv(filename);
7931 sv_setpv(MUTABLE_SV(cv), proto);
7936 Perl_newSTUB(pTHX_ GV *gv, bool fake)
7938 CV *cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7939 PERL_ARGS_ASSERT_NEWSTUB;
7943 if (!fake && HvENAME_HEK(GvSTASH(gv)))
7944 gv_method_changed(gv);
7946 CvFILE_set_from_cop(cv, PL_curcop);
7947 CvSTASH_set(cv, PL_curstash);
7953 =for apidoc U||newXS
7955 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
7956 static storage, as it is used directly as CvFILE(), without a copy being made.
7962 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
7964 PERL_ARGS_ASSERT_NEWXS;
7965 return newXS_len_flags(
7966 name, name ? strlen(name) : 0, subaddr, filename, NULL, NULL, 0
7975 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
7980 OP* pegop = newOP(OP_NULL, 0);
7985 if (PL_parser && PL_parser->error_count) {
7991 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
7992 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
7995 if ((cv = GvFORM(gv))) {
7996 if (ckWARN(WARN_REDEFINE)) {
7997 const line_t oldline = CopLINE(PL_curcop);
7998 if (PL_parser && PL_parser->copline != NOLINE)
7999 CopLINE_set(PL_curcop, PL_parser->copline);
8001 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
8002 "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv));
8004 /* diag_listed_as: Format %s redefined */
8005 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
8006 "Format STDOUT redefined");
8008 CopLINE_set(PL_curcop, oldline);
8013 GvFORM(gv) = (CV *)SvREFCNT_inc_simple_NN(cv);
8015 CvFILE_set_from_cop(cv, PL_curcop);
8018 pad_tidy(padtidy_FORMAT);
8019 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
8020 CvROOT(cv)->op_private |= OPpREFCOUNTED;
8021 OpREFCNT_set(CvROOT(cv), 1);
8022 CvSTART(cv) = LINKLIST(CvROOT(cv));
8023 CvROOT(cv)->op_next = 0;
8024 CALL_PEEP(CvSTART(cv));
8025 finalize_optree(CvROOT(cv));
8030 op_getmad(o,pegop,'n');
8031 op_getmad_weak(block, pegop, 'b');
8036 PL_parser->copline = NOLINE;
8044 Perl_newANONLIST(pTHX_ OP *o)
8046 return convert(OP_ANONLIST, OPf_SPECIAL, o);
8050 Perl_newANONHASH(pTHX_ OP *o)
8052 return convert(OP_ANONHASH, OPf_SPECIAL, o);
8056 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
8058 return newANONATTRSUB(floor, proto, NULL, block);
8062 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
8064 return newUNOP(OP_REFGEN, 0,
8065 newSVOP(OP_ANONCODE, 0,
8066 MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block))));
8070 Perl_oopsAV(pTHX_ OP *o)
8074 PERL_ARGS_ASSERT_OOPSAV;
8076 switch (o->op_type) {
8078 o->op_type = OP_PADAV;
8079 o->op_ppaddr = PL_ppaddr[OP_PADAV];
8080 return ref(o, OP_RV2AV);
8083 o->op_type = OP_RV2AV;
8084 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
8089 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
8096 Perl_oopsHV(pTHX_ OP *o)
8100 PERL_ARGS_ASSERT_OOPSHV;
8102 switch (o->op_type) {
8105 o->op_type = OP_PADHV;
8106 o->op_ppaddr = PL_ppaddr[OP_PADHV];
8107 return ref(o, OP_RV2HV);
8111 o->op_type = OP_RV2HV;
8112 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
8117 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
8124 Perl_newAVREF(pTHX_ OP *o)
8128 PERL_ARGS_ASSERT_NEWAVREF;
8130 if (o->op_type == OP_PADANY) {
8131 o->op_type = OP_PADAV;
8132 o->op_ppaddr = PL_ppaddr[OP_PADAV];
8135 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)) {
8136 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8137 "Using an array as a reference is deprecated");
8139 return newUNOP(OP_RV2AV, 0, scalar(o));
8143 Perl_newGVREF(pTHX_ I32 type, OP *o)
8145 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
8146 return newUNOP(OP_NULL, 0, o);
8147 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
8151 Perl_newHVREF(pTHX_ OP *o)
8155 PERL_ARGS_ASSERT_NEWHVREF;
8157 if (o->op_type == OP_PADANY) {
8158 o->op_type = OP_PADHV;
8159 o->op_ppaddr = PL_ppaddr[OP_PADHV];
8162 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)) {
8163 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8164 "Using a hash as a reference is deprecated");
8166 return newUNOP(OP_RV2HV, 0, scalar(o));
8170 Perl_newCVREF(pTHX_ I32 flags, OP *o)
8172 if (o->op_type == OP_PADANY) {
8174 o->op_type = OP_PADCV;
8175 o->op_ppaddr = PL_ppaddr[OP_PADCV];
8178 return newUNOP(OP_RV2CV, flags, scalar(o));
8182 Perl_newSVREF(pTHX_ OP *o)
8186 PERL_ARGS_ASSERT_NEWSVREF;
8188 if (o->op_type == OP_PADANY) {
8189 o->op_type = OP_PADSV;
8190 o->op_ppaddr = PL_ppaddr[OP_PADSV];
8193 return newUNOP(OP_RV2SV, 0, scalar(o));
8196 /* Check routines. See the comments at the top of this file for details
8197 * on when these are called */
8200 Perl_ck_anoncode(pTHX_ OP *o)
8202 PERL_ARGS_ASSERT_CK_ANONCODE;
8204 cSVOPo->op_targ = pad_add_anon((CV*)cSVOPo->op_sv, o->op_type);
8206 cSVOPo->op_sv = NULL;
8211 Perl_ck_bitop(pTHX_ OP *o)
8215 PERL_ARGS_ASSERT_CK_BITOP;
8217 o->op_private = (U8)(PL_hints & HINT_INTEGER);
8218 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
8219 && (o->op_type == OP_BIT_OR
8220 || o->op_type == OP_BIT_AND
8221 || o->op_type == OP_BIT_XOR))
8223 const OP * const left = cBINOPo->op_first;
8224 const OP * const right = left->op_sibling;
8225 if ((OP_IS_NUMCOMPARE(left->op_type) &&
8226 (left->op_flags & OPf_PARENS) == 0) ||
8227 (OP_IS_NUMCOMPARE(right->op_type) &&
8228 (right->op_flags & OPf_PARENS) == 0))
8229 Perl_ck_warner(aTHX_ packWARN(WARN_PRECEDENCE),
8230 "Possible precedence problem on bitwise %c operator",
8231 o->op_type == OP_BIT_OR ? '|'
8232 : o->op_type == OP_BIT_AND ? '&' : '^'
8238 PERL_STATIC_INLINE bool
8239 is_dollar_bracket(pTHX_ const OP * const o)
8242 return o->op_type == OP_RV2SV && o->op_flags & OPf_KIDS
8243 && (kid = cUNOPx(o)->op_first)
8244 && kid->op_type == OP_GV
8245 && strEQ(GvNAME(cGVOPx_gv(kid)), "[");
8249 Perl_ck_cmp(pTHX_ OP *o)
8251 PERL_ARGS_ASSERT_CK_CMP;
8252 if (ckWARN(WARN_SYNTAX)) {
8253 const OP *kid = cUNOPo->op_first;
8256 is_dollar_bracket(aTHX_ kid)
8257 && kid->op_sibling && kid->op_sibling->op_type == OP_CONST
8259 || ( kid->op_type == OP_CONST
8260 && (kid = kid->op_sibling) && is_dollar_bracket(aTHX_ kid))
8262 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
8263 "$[ used in %s (did you mean $] ?)", OP_DESC(o));
8269 Perl_ck_concat(pTHX_ OP *o)
8271 const OP * const kid = cUNOPo->op_first;
8273 PERL_ARGS_ASSERT_CK_CONCAT;
8274 PERL_UNUSED_CONTEXT;
8276 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
8277 !(kUNOP->op_first->op_flags & OPf_MOD))
8278 o->op_flags |= OPf_STACKED;
8283 Perl_ck_spair(pTHX_ OP *o)
8287 PERL_ARGS_ASSERT_CK_SPAIR;
8289 if (o->op_flags & OPf_KIDS) {
8292 const OPCODE type = o->op_type;
8293 o = modkids(ck_fun(o), type);
8294 kid = cUNOPo->op_first;
8295 newop = kUNOP->op_first->op_sibling;
8297 const OPCODE type = newop->op_type;
8298 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
8299 type == OP_PADAV || type == OP_PADHV ||
8300 type == OP_RV2AV || type == OP_RV2HV)
8304 op_getmad(kUNOP->op_first,newop,'K');
8306 op_free(kUNOP->op_first);
8308 kUNOP->op_first = newop;
8310 /* transforms OP_REFGEN into OP_SREFGEN, OP_CHOP into OP_SCHOP,
8311 * and OP_CHOMP into OP_SCHOMP */
8312 o->op_ppaddr = PL_ppaddr[++o->op_type];
8317 Perl_ck_delete(pTHX_ OP *o)
8319 PERL_ARGS_ASSERT_CK_DELETE;
8323 if (o->op_flags & OPf_KIDS) {
8324 OP * const kid = cUNOPo->op_first;
8325 switch (kid->op_type) {
8327 o->op_flags |= OPf_SPECIAL;
8330 o->op_private |= OPpSLICE;
8333 o->op_flags |= OPf_SPECIAL;
8338 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
8341 if (kid->op_private & OPpLVAL_INTRO)
8342 o->op_private |= OPpLVAL_INTRO;
8349 Perl_ck_die(pTHX_ OP *o)
8351 PERL_ARGS_ASSERT_CK_DIE;
8354 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
8360 Perl_ck_eof(pTHX_ OP *o)
8364 PERL_ARGS_ASSERT_CK_EOF;
8366 if (o->op_flags & OPf_KIDS) {
8368 if (cLISTOPo->op_first->op_type == OP_STUB) {
8370 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
8372 op_getmad(o,newop,'O');
8379 kid = cLISTOPo->op_first;
8380 if (kid->op_type == OP_RV2GV)
8381 kid->op_private |= OPpALLOW_FAKE;
8387 Perl_ck_eval(pTHX_ OP *o)
8391 PERL_ARGS_ASSERT_CK_EVAL;
8393 PL_hints |= HINT_BLOCK_SCOPE;
8394 if (o->op_flags & OPf_KIDS) {
8395 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8398 o->op_flags &= ~OPf_KIDS;
8401 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
8407 cUNOPo->op_first = 0;
8412 NewOp(1101, enter, 1, LOGOP);
8413 enter->op_type = OP_ENTERTRY;
8414 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
8415 enter->op_private = 0;
8417 /* establish postfix order */
8418 enter->op_next = (OP*)enter;
8420 o = op_prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
8421 o->op_type = OP_LEAVETRY;
8422 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
8423 enter->op_other = o;
8424 op_getmad(oldo,o,'O');
8433 const U8 priv = o->op_private;
8439 o = newUNOP(OP_ENTEREVAL, priv <<8, newDEFSVOP());
8440 op_getmad(oldo,o,'O');
8442 o->op_targ = (PADOFFSET)PL_hints;
8443 if (o->op_private & OPpEVAL_BYTES) o->op_targ &= ~HINT_UTF8;
8444 if ((PL_hints & HINT_LOCALIZE_HH) != 0
8445 && !(o->op_private & OPpEVAL_COPHH) && GvHV(PL_hintgv)) {
8446 /* Store a copy of %^H that pp_entereval can pick up. */
8447 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
8448 MUTABLE_SV(hv_copy_hints_hv(GvHV(PL_hintgv))));
8449 cUNOPo->op_first->op_sibling = hhop;
8450 o->op_private |= OPpEVAL_HAS_HH;
8452 if (!(o->op_private & OPpEVAL_BYTES)
8453 && FEATURE_UNIEVAL_IS_ENABLED)
8454 o->op_private |= OPpEVAL_UNICODE;
8459 Perl_ck_exit(pTHX_ OP *o)
8461 PERL_ARGS_ASSERT_CK_EXIT;
8464 HV * const table = GvHV(PL_hintgv);
8466 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
8467 if (svp && *svp && SvTRUE(*svp))
8468 o->op_private |= OPpEXIT_VMSISH;
8470 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
8476 Perl_ck_exec(pTHX_ OP *o)
8478 PERL_ARGS_ASSERT_CK_EXEC;
8480 if (o->op_flags & OPf_STACKED) {
8483 kid = cUNOPo->op_first->op_sibling;
8484 if (kid->op_type == OP_RV2GV)
8493 Perl_ck_exists(pTHX_ OP *o)
8497 PERL_ARGS_ASSERT_CK_EXISTS;
8500 if (o->op_flags & OPf_KIDS) {
8501 OP * const kid = cUNOPo->op_first;
8502 if (kid->op_type == OP_ENTERSUB) {
8503 (void) ref(kid, o->op_type);
8504 if (kid->op_type != OP_RV2CV
8505 && !(PL_parser && PL_parser->error_count))
8506 Perl_croak(aTHX_ "%s argument is not a subroutine name",
8508 o->op_private |= OPpEXISTS_SUB;
8510 else if (kid->op_type == OP_AELEM)
8511 o->op_flags |= OPf_SPECIAL;
8512 else if (kid->op_type != OP_HELEM)
8513 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine",
8521 Perl_ck_rvconst(pTHX_ OP *o)
8524 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8526 PERL_ARGS_ASSERT_CK_RVCONST;
8528 o->op_private |= (PL_hints & HINT_STRICT_REFS);
8529 if (o->op_type == OP_RV2CV)
8530 o->op_private &= ~1;
8532 if (kid->op_type == OP_CONST) {
8535 SV * const kidsv = kid->op_sv;
8537 /* Is it a constant from cv_const_sv()? */
8538 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
8539 SV * const rsv = SvRV(kidsv);
8540 const svtype type = SvTYPE(rsv);
8541 const char *badtype = NULL;
8543 switch (o->op_type) {
8545 if (type > SVt_PVMG)
8546 badtype = "a SCALAR";
8549 if (type != SVt_PVAV)
8550 badtype = "an ARRAY";
8553 if (type != SVt_PVHV)
8557 if (type != SVt_PVCV)
8562 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
8565 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
8566 const char *badthing;
8567 switch (o->op_type) {
8569 badthing = "a SCALAR";
8572 badthing = "an ARRAY";
8575 badthing = "a HASH";
8583 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
8584 SVfARG(kidsv), badthing);
8587 * This is a little tricky. We only want to add the symbol if we
8588 * didn't add it in the lexer. Otherwise we get duplicate strict
8589 * warnings. But if we didn't add it in the lexer, we must at
8590 * least pretend like we wanted to add it even if it existed before,
8591 * or we get possible typo warnings. OPpCONST_ENTERED says
8592 * whether the lexer already added THIS instance of this symbol.
8594 iscv = (o->op_type == OP_RV2CV) * 2;
8596 gv = gv_fetchsv(kidsv,
8597 iscv | !(kid->op_private & OPpCONST_ENTERED),
8600 : o->op_type == OP_RV2SV
8602 : o->op_type == OP_RV2AV
8604 : o->op_type == OP_RV2HV
8607 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
8609 kid->op_type = OP_GV;
8610 SvREFCNT_dec(kid->op_sv);
8612 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
8613 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
8614 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
8616 PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv)));
8618 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
8620 kid->op_private = 0;
8621 kid->op_ppaddr = PL_ppaddr[OP_GV];
8622 /* FAKE globs in the symbol table cause weird bugs (#77810) */
8630 Perl_ck_ftst(pTHX_ OP *o)
8633 const I32 type = o->op_type;
8635 PERL_ARGS_ASSERT_CK_FTST;
8637 if (o->op_flags & OPf_REF) {
8640 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
8641 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8642 const OPCODE kidtype = kid->op_type;
8644 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)
8645 && !(kid->op_private & OPpCONST_FOLDED)) {
8646 OP * const newop = newGVOP(type, OPf_REF,
8647 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
8649 op_getmad(o,newop,'O');
8655 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
8656 o->op_private |= OPpFT_ACCESS;
8657 if (PL_check[kidtype] == Perl_ck_ftst
8658 && kidtype != OP_STAT && kidtype != OP_LSTAT) {
8659 o->op_private |= OPpFT_STACKED;
8660 kid->op_private |= OPpFT_STACKING;
8661 if (kidtype == OP_FTTTY && (
8662 !(kid->op_private & OPpFT_STACKED)
8663 || kid->op_private & OPpFT_AFTER_t
8665 o->op_private |= OPpFT_AFTER_t;
8674 if (type == OP_FTTTY)
8675 o = newGVOP(type, OPf_REF, PL_stdingv);
8677 o = newUNOP(type, 0, newDEFSVOP());
8678 op_getmad(oldo,o,'O');
8684 Perl_ck_fun(pTHX_ OP *o)
8687 const int type = o->op_type;
8688 I32 oa = PL_opargs[type] >> OASHIFT;
8690 PERL_ARGS_ASSERT_CK_FUN;
8692 if (o->op_flags & OPf_STACKED) {
8693 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
8696 return no_fh_allowed(o);
8699 if (o->op_flags & OPf_KIDS) {
8700 OP **tokid = &cLISTOPo->op_first;
8701 OP *kid = cLISTOPo->op_first;
8704 bool seen_optional = FALSE;
8706 if (kid->op_type == OP_PUSHMARK ||
8707 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
8709 tokid = &kid->op_sibling;
8710 kid = kid->op_sibling;
8712 if (kid && kid->op_type == OP_COREARGS) {
8713 bool optional = FALSE;
8716 if (oa & OA_OPTIONAL) optional = TRUE;
8719 if (optional) o->op_private |= numargs;
8724 if (oa & OA_OPTIONAL || (oa & 7) == OA_LIST) {
8725 if (!kid && !seen_optional && PL_opargs[type] & OA_DEFGV)
8726 *tokid = kid = newDEFSVOP();
8727 seen_optional = TRUE;
8732 sibl = kid->op_sibling;
8734 if (!sibl && kid->op_type == OP_STUB) {
8741 /* list seen where single (scalar) arg expected? */
8742 if (numargs == 1 && !(oa >> 4)
8743 && kid->op_type == OP_LIST && type != OP_SCALAR)
8745 return too_many_arguments_pv(o,PL_op_desc[type], 0);
8758 if ((type == OP_PUSH || type == OP_UNSHIFT)
8759 && !kid->op_sibling)
8760 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
8761 "Useless use of %s with no values",
8764 if (kid->op_type == OP_CONST &&
8765 (kid->op_private & OPpCONST_BARE))
8767 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
8768 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
8769 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8770 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
8771 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
8773 op_getmad(kid,newop,'K');
8778 kid->op_sibling = sibl;
8781 else if (kid->op_type == OP_CONST
8782 && ( !SvROK(cSVOPx_sv(kid))
8783 || SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV )
8785 bad_type_pv(numargs, "array", PL_op_desc[type], 0, kid);
8786 /* Defer checks to run-time if we have a scalar arg */
8787 if (kid->op_type == OP_RV2AV || kid->op_type == OP_PADAV)
8788 op_lvalue(kid, type);
8792 if (kid->op_type == OP_CONST &&
8793 (kid->op_private & OPpCONST_BARE))
8795 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
8796 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
8797 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8798 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
8799 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
8801 op_getmad(kid,newop,'K');
8806 kid->op_sibling = sibl;
8809 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
8810 bad_type_pv(numargs, "hash", PL_op_desc[type], 0, kid);
8811 op_lvalue(kid, type);
8815 OP * const newop = newUNOP(OP_NULL, 0, kid);
8816 kid->op_sibling = 0;
8817 newop->op_next = newop;
8819 kid->op_sibling = sibl;
8824 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
8825 if (kid->op_type == OP_CONST &&
8826 (kid->op_private & OPpCONST_BARE))
8828 OP * const newop = newGVOP(OP_GV, 0,
8829 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
8830 if (!(o->op_private & 1) && /* if not unop */
8831 kid == cLISTOPo->op_last)
8832 cLISTOPo->op_last = newop;
8834 op_getmad(kid,newop,'K');
8840 else if (kid->op_type == OP_READLINE) {
8841 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
8842 bad_type_pv(numargs, "HANDLE", OP_DESC(o), 0, kid);
8845 I32 flags = OPf_SPECIAL;
8849 /* is this op a FH constructor? */
8850 if (is_handle_constructor(o,numargs)) {
8851 const char *name = NULL;
8854 bool want_dollar = TRUE;
8857 /* Set a flag to tell rv2gv to vivify
8858 * need to "prove" flag does not mean something
8859 * else already - NI-S 1999/05/07
8862 if (kid->op_type == OP_PADSV) {
8864 = PAD_COMPNAME_SV(kid->op_targ);
8865 name = SvPV_const(namesv, len);
8866 name_utf8 = SvUTF8(namesv);
8868 else if (kid->op_type == OP_RV2SV
8869 && kUNOP->op_first->op_type == OP_GV)
8871 GV * const gv = cGVOPx_gv(kUNOP->op_first);
8873 len = GvNAMELEN(gv);
8874 name_utf8 = GvNAMEUTF8(gv) ? SVf_UTF8 : 0;
8876 else if (kid->op_type == OP_AELEM
8877 || kid->op_type == OP_HELEM)
8880 OP *op = ((BINOP*)kid)->op_first;
8884 const char * const a =
8885 kid->op_type == OP_AELEM ?
8887 if (((op->op_type == OP_RV2AV) ||
8888 (op->op_type == OP_RV2HV)) &&
8889 (firstop = ((UNOP*)op)->op_first) &&
8890 (firstop->op_type == OP_GV)) {
8891 /* packagevar $a[] or $h{} */
8892 GV * const gv = cGVOPx_gv(firstop);
8900 else if (op->op_type == OP_PADAV
8901 || op->op_type == OP_PADHV) {
8902 /* lexicalvar $a[] or $h{} */
8903 const char * const padname =
8904 PAD_COMPNAME_PV(op->op_targ);
8913 name = SvPV_const(tmpstr, len);
8914 name_utf8 = SvUTF8(tmpstr);
8919 name = "__ANONIO__";
8921 want_dollar = FALSE;
8923 op_lvalue(kid, type);
8927 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
8928 namesv = PAD_SVl(targ);
8929 SvUPGRADE(namesv, SVt_PV);
8930 if (want_dollar && *name != '$')
8931 sv_setpvs(namesv, "$");
8932 sv_catpvn(namesv, name, len);
8933 if ( name_utf8 ) SvUTF8_on(namesv);
8936 kid->op_sibling = 0;
8937 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
8938 kid->op_targ = targ;
8939 kid->op_private |= priv;
8941 kid->op_sibling = sibl;
8947 if ((type == OP_UNDEF || type == OP_POS)
8948 && numargs == 1 && !(oa >> 4)
8949 && kid->op_type == OP_LIST)
8950 return too_many_arguments_pv(o,PL_op_desc[type], 0);
8951 op_lvalue(scalar(kid), type);
8955 tokid = &kid->op_sibling;
8956 kid = kid->op_sibling;
8959 if (kid && kid->op_type != OP_STUB)
8960 return too_many_arguments_pv(o,OP_DESC(o), 0);
8961 o->op_private |= numargs;
8963 /* FIXME - should the numargs move as for the PERL_MAD case? */
8964 o->op_private |= numargs;
8966 return too_many_arguments_pv(o,OP_DESC(o), 0);
8970 else if (PL_opargs[type] & OA_DEFGV) {
8972 OP *newop = newUNOP(type, 0, newDEFSVOP());
8973 op_getmad(o,newop,'O');
8976 /* Ordering of these two is important to keep f_map.t passing. */
8978 return newUNOP(type, 0, newDEFSVOP());
8983 while (oa & OA_OPTIONAL)
8985 if (oa && oa != OA_LIST)
8986 return too_few_arguments_pv(o,OP_DESC(o), 0);
8992 Perl_ck_glob(pTHX_ OP *o)
8996 const bool core = o->op_flags & OPf_SPECIAL;
8998 PERL_ARGS_ASSERT_CK_GLOB;
9001 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
9002 op_append_elem(OP_GLOB, o, newDEFSVOP()); /* glob() => glob($_) */
9004 if (core) gv = NULL;
9005 else if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
9006 && GvCVu(gv) && GvIMPORTED_CV(gv)))
9008 GV * const * const gvp =
9009 (GV **)hv_fetchs(PL_globalstash, "glob", FALSE);
9010 gv = gvp ? *gvp : NULL;
9013 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
9016 * \ null - const(wildcard)
9021 * \ mark - glob - rv2cv
9022 * | \ gv(CORE::GLOBAL::glob)
9024 * \ null - const(wildcard)
9026 o->op_flags |= OPf_SPECIAL;
9027 o->op_targ = pad_alloc(OP_GLOB, SVs_PADTMP);
9028 o = newLISTOP(OP_LIST, 0, o, NULL);
9029 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
9030 op_append_elem(OP_LIST, o,
9031 scalar(newUNOP(OP_RV2CV, 0,
9032 newGVOP(OP_GV, 0, gv)))));
9033 o = newUNOP(OP_NULL, 0, o);
9034 o->op_targ = OP_GLOB; /* hint at what it used to be: eg in newWHILEOP */
9037 else o->op_flags &= ~OPf_SPECIAL;
9038 #if !defined(PERL_EXTERNAL_GLOB)
9041 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
9042 newSVpvs("File::Glob"), NULL, NULL, NULL);
9045 #endif /* !PERL_EXTERNAL_GLOB */
9046 gv = (GV *)newSV(0);
9047 gv_init(gv, 0, "", 0, 0);
9049 op_append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
9050 SvREFCNT_dec_NN(gv); /* newGVOP increased it */
9056 Perl_ck_grep(pTHX_ OP *o)
9061 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
9064 PERL_ARGS_ASSERT_CK_GREP;
9066 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
9067 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
9069 if (o->op_flags & OPf_STACKED) {
9070 kid = cUNOPx(cLISTOPo->op_first->op_sibling)->op_first;
9071 if (kid->op_type != OP_SCOPE && kid->op_type != OP_LEAVE)
9072 return no_fh_allowed(o);
9073 o->op_flags &= ~OPf_STACKED;
9075 kid = cLISTOPo->op_first->op_sibling;
9076 if (type == OP_MAPWHILE)
9081 if (PL_parser && PL_parser->error_count)
9083 kid = cLISTOPo->op_first->op_sibling;
9084 if (kid->op_type != OP_NULL)
9085 Perl_croak(aTHX_ "panic: ck_grep, type=%u", (unsigned) kid->op_type);
9086 kid = kUNOP->op_first;
9088 NewOp(1101, gwop, 1, LOGOP);
9089 gwop->op_type = type;
9090 gwop->op_ppaddr = PL_ppaddr[type];
9092 gwop->op_flags |= OPf_KIDS;
9093 gwop->op_other = LINKLIST(kid);
9094 kid->op_next = (OP*)gwop;
9095 offset = pad_findmy_pvs("$_", 0);
9096 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
9097 o->op_private = gwop->op_private = 0;
9098 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
9101 o->op_private = gwop->op_private = OPpGREP_LEX;
9102 gwop->op_targ = o->op_targ = offset;
9105 kid = cLISTOPo->op_first->op_sibling;
9106 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
9107 op_lvalue(kid, OP_GREPSTART);
9113 Perl_ck_index(pTHX_ OP *o)
9115 PERL_ARGS_ASSERT_CK_INDEX;
9117 if (o->op_flags & OPf_KIDS) {
9118 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9120 kid = kid->op_sibling; /* get past "big" */
9121 if (kid && kid->op_type == OP_CONST) {
9122 const bool save_taint = TAINT_get;
9123 fbm_compile(((SVOP*)kid)->op_sv, 0);
9124 TAINT_set(save_taint);
9125 #ifdef NO_TAINT_SUPPORT
9126 PERL_UNUSED_VAR(save_taint);
9134 Perl_ck_lfun(pTHX_ OP *o)
9136 const OPCODE type = o->op_type;
9138 PERL_ARGS_ASSERT_CK_LFUN;
9140 return modkids(ck_fun(o), type);
9144 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
9146 PERL_ARGS_ASSERT_CK_DEFINED;
9148 if ((o->op_flags & OPf_KIDS)) {
9149 switch (cUNOPo->op_first->op_type) {
9152 case OP_AASSIGN: /* Is this a good idea? */
9153 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9154 "defined(@array) is deprecated");
9155 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9156 "\t(Maybe you should just omit the defined()?)\n");
9160 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9161 "defined(%%hash) is deprecated");
9162 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9163 "\t(Maybe you should just omit the defined()?)\n");
9174 Perl_ck_readline(pTHX_ OP *o)
9176 PERL_ARGS_ASSERT_CK_READLINE;
9178 if (o->op_flags & OPf_KIDS) {
9179 OP *kid = cLISTOPo->op_first;
9180 if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE;
9184 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
9186 op_getmad(o,newop,'O');
9196 Perl_ck_rfun(pTHX_ OP *o)
9198 const OPCODE type = o->op_type;
9200 PERL_ARGS_ASSERT_CK_RFUN;
9202 return refkids(ck_fun(o), type);
9206 Perl_ck_listiob(pTHX_ OP *o)
9210 PERL_ARGS_ASSERT_CK_LISTIOB;
9212 kid = cLISTOPo->op_first;
9215 kid = cLISTOPo->op_first;
9217 if (kid->op_type == OP_PUSHMARK)
9218 kid = kid->op_sibling;
9219 if (kid && o->op_flags & OPf_STACKED)
9220 kid = kid->op_sibling;
9221 else if (kid && !kid->op_sibling) { /* print HANDLE; */
9222 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE
9223 && !(kid->op_private & OPpCONST_FOLDED)) {
9224 o->op_flags |= OPf_STACKED; /* make it a filehandle */
9225 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
9226 cLISTOPo->op_first->op_sibling = kid;
9227 cLISTOPo->op_last = kid;
9228 kid = kid->op_sibling;
9233 op_append_elem(o->op_type, o, newDEFSVOP());
9235 if (o->op_type == OP_PRTF) return modkids(listkids(o), OP_PRTF);
9240 Perl_ck_smartmatch(pTHX_ OP *o)
9243 PERL_ARGS_ASSERT_CK_SMARTMATCH;
9244 if (0 == (o->op_flags & OPf_SPECIAL)) {
9245 OP *first = cBINOPo->op_first;
9246 OP *second = first->op_sibling;
9248 /* Implicitly take a reference to an array or hash */
9249 first->op_sibling = NULL;
9250 first = cBINOPo->op_first = ref_array_or_hash(first);
9251 second = first->op_sibling = ref_array_or_hash(second);
9253 /* Implicitly take a reference to a regular expression */
9254 if (first->op_type == OP_MATCH) {
9255 first->op_type = OP_QR;
9256 first->op_ppaddr = PL_ppaddr[OP_QR];
9258 if (second->op_type == OP_MATCH) {
9259 second->op_type = OP_QR;
9260 second->op_ppaddr = PL_ppaddr[OP_QR];
9269 Perl_ck_sassign(pTHX_ OP *o)
9272 OP * const kid = cLISTOPo->op_first;
9274 PERL_ARGS_ASSERT_CK_SASSIGN;
9276 /* has a disposable target? */
9277 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
9278 && !(kid->op_flags & OPf_STACKED)
9279 /* Cannot steal the second time! */
9280 && !(kid->op_private & OPpTARGET_MY)
9281 /* Keep the full thing for madskills */
9285 OP * const kkid = kid->op_sibling;
9287 /* Can just relocate the target. */
9288 if (kkid && kkid->op_type == OP_PADSV
9289 && !(kkid->op_private & OPpLVAL_INTRO))
9291 kid->op_targ = kkid->op_targ;
9293 /* Now we do not need PADSV and SASSIGN. */
9294 kid->op_sibling = o->op_sibling; /* NULL */
9295 cLISTOPo->op_first = NULL;
9298 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
9302 if (kid->op_sibling) {
9303 OP *kkid = kid->op_sibling;
9304 /* For state variable assignment, kkid is a list op whose op_last
9306 if ((kkid->op_type == OP_PADSV ||
9307 (kkid->op_type == OP_LIST &&
9308 (kkid = cLISTOPx(kkid)->op_last)->op_type == OP_PADSV
9311 && (kkid->op_private & OPpLVAL_INTRO)
9312 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
9313 const PADOFFSET target = kkid->op_targ;
9314 OP *const other = newOP(OP_PADSV,
9316 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
9317 OP *const first = newOP(OP_NULL, 0);
9318 OP *const nullop = newCONDOP(0, first, o, other);
9319 OP *const condop = first->op_next;
9320 /* hijacking PADSTALE for uninitialized state variables */
9321 SvPADSTALE_on(PAD_SVl(target));
9323 condop->op_type = OP_ONCE;
9324 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
9325 condop->op_targ = target;
9326 other->op_targ = target;
9328 /* Because we change the type of the op here, we will skip the
9329 assignment binop->op_last = binop->op_first->op_sibling; at the
9330 end of Perl_newBINOP(). So need to do it here. */
9331 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
9340 Perl_ck_match(pTHX_ OP *o)
9344 PERL_ARGS_ASSERT_CK_MATCH;
9346 if (o->op_type != OP_QR && PL_compcv) {
9347 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
9348 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
9349 o->op_targ = offset;
9350 o->op_private |= OPpTARGET_MY;
9353 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
9354 o->op_private |= OPpRUNTIME;
9359 Perl_ck_method(pTHX_ OP *o)
9361 OP * const kid = cUNOPo->op_first;
9363 PERL_ARGS_ASSERT_CK_METHOD;
9365 if (kid->op_type == OP_CONST) {
9366 SV* sv = kSVOP->op_sv;
9367 const char * const method = SvPVX_const(sv);
9368 if (!(strchr(method, ':') || strchr(method, '\''))) {
9371 sv = newSVpvn_share(method, SvUTF8(sv) ? -(I32)SvCUR(sv) : (I32)SvCUR(sv), 0);
9374 kSVOP->op_sv = NULL;
9376 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
9378 op_getmad(o,cmop,'O');
9389 Perl_ck_null(pTHX_ OP *o)
9391 PERL_ARGS_ASSERT_CK_NULL;
9392 PERL_UNUSED_CONTEXT;
9397 Perl_ck_open(pTHX_ OP *o)
9400 HV * const table = GvHV(PL_hintgv);
9402 PERL_ARGS_ASSERT_CK_OPEN;
9405 SV **svp = hv_fetchs(table, "open_IN", FALSE);
9408 const char *d = SvPV_const(*svp, len);
9409 const I32 mode = mode_from_discipline(d, len);
9410 if (mode & O_BINARY)
9411 o->op_private |= OPpOPEN_IN_RAW;
9412 else if (mode & O_TEXT)
9413 o->op_private |= OPpOPEN_IN_CRLF;
9416 svp = hv_fetchs(table, "open_OUT", FALSE);
9419 const char *d = SvPV_const(*svp, len);
9420 const I32 mode = mode_from_discipline(d, len);
9421 if (mode & O_BINARY)
9422 o->op_private |= OPpOPEN_OUT_RAW;
9423 else if (mode & O_TEXT)
9424 o->op_private |= OPpOPEN_OUT_CRLF;
9427 if (o->op_type == OP_BACKTICK) {
9428 if (!(o->op_flags & OPf_KIDS)) {
9429 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
9431 op_getmad(o,newop,'O');
9440 /* In case of three-arg dup open remove strictness
9441 * from the last arg if it is a bareword. */
9442 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
9443 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
9447 if ((last->op_type == OP_CONST) && /* The bareword. */
9448 (last->op_private & OPpCONST_BARE) &&
9449 (last->op_private & OPpCONST_STRICT) &&
9450 (oa = first->op_sibling) && /* The fh. */
9451 (oa = oa->op_sibling) && /* The mode. */
9452 (oa->op_type == OP_CONST) &&
9453 SvPOK(((SVOP*)oa)->op_sv) &&
9454 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
9455 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
9456 (last == oa->op_sibling)) /* The bareword. */
9457 last->op_private &= ~OPpCONST_STRICT;
9463 Perl_ck_repeat(pTHX_ OP *o)
9465 PERL_ARGS_ASSERT_CK_REPEAT;
9467 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
9468 o->op_private |= OPpREPEAT_DOLIST;
9469 cBINOPo->op_first = force_list(cBINOPo->op_first);
9477 Perl_ck_require(pTHX_ OP *o)
9482 PERL_ARGS_ASSERT_CK_REQUIRE;
9484 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
9485 SVOP * const kid = (SVOP*)cUNOPo->op_first;
9487 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
9488 SV * const sv = kid->op_sv;
9489 U32 was_readonly = SvREADONLY(sv);
9497 if (SvIsCOW(sv)) sv_force_normal_flags(sv, 0);
9502 for (; s < end; s++) {
9503 if (*s == ':' && s[1] == ':') {
9505 Move(s+2, s+1, end - s - 1, char);
9510 sv_catpvs(sv, ".pm");
9511 SvFLAGS(sv) |= was_readonly;
9515 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
9516 /* handle override, if any */
9517 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
9518 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
9519 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
9520 gv = gvp ? *gvp : NULL;
9524 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
9526 if (o->op_flags & OPf_KIDS) {
9527 kid = cUNOPo->op_first;
9528 cUNOPo->op_first = NULL;
9536 newop = newUNOP(OP_ENTERSUB, OPf_STACKED,
9537 op_append_elem(OP_LIST, kid,
9538 scalar(newUNOP(OP_RV2CV, 0,
9541 op_getmad(o,newop,'O');
9545 return scalar(ck_fun(o));
9549 Perl_ck_return(pTHX_ OP *o)
9554 PERL_ARGS_ASSERT_CK_RETURN;
9556 kid = cLISTOPo->op_first->op_sibling;
9557 if (CvLVALUE(PL_compcv)) {
9558 for (; kid; kid = kid->op_sibling)
9559 op_lvalue(kid, OP_LEAVESUBLV);
9566 Perl_ck_select(pTHX_ OP *o)
9571 PERL_ARGS_ASSERT_CK_SELECT;
9573 if (o->op_flags & OPf_KIDS) {
9574 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9575 if (kid && kid->op_sibling) {
9576 o->op_type = OP_SSELECT;
9577 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
9579 return fold_constants(op_integerize(op_std_init(o)));
9583 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9584 if (kid && kid->op_type == OP_RV2GV)
9585 kid->op_private &= ~HINT_STRICT_REFS;
9590 Perl_ck_shift(pTHX_ OP *o)
9593 const I32 type = o->op_type;
9595 PERL_ARGS_ASSERT_CK_SHIFT;
9597 if (!(o->op_flags & OPf_KIDS)) {
9600 if (!CvUNIQUE(PL_compcv)) {
9601 o->op_flags |= OPf_SPECIAL;
9605 argop = newUNOP(OP_RV2AV, 0, scalar(newGVOP(OP_GV, 0, PL_argvgv)));
9608 OP * const oldo = o;
9609 o = newUNOP(type, 0, scalar(argop));
9610 op_getmad(oldo,o,'O');
9615 return newUNOP(type, 0, scalar(argop));
9618 return scalar(ck_fun(o));
9622 Perl_ck_sort(pTHX_ OP *o)
9626 HV * const hinthv = GvHV(PL_hintgv);
9628 PERL_ARGS_ASSERT_CK_SORT;
9631 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
9633 const I32 sorthints = (I32)SvIV(*svp);
9634 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
9635 o->op_private |= OPpSORT_QSORT;
9636 if ((sorthints & HINT_SORT_STABLE) != 0)
9637 o->op_private |= OPpSORT_STABLE;
9641 if (o->op_flags & OPf_STACKED)
9643 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9644 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
9645 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
9647 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
9649 if (kid->op_type == OP_LEAVE)
9650 op_null(kid); /* wipe out leave */
9651 /* Prevent execution from escaping out of the sort block. */
9654 /* provide scalar context for comparison function/block */
9655 kid = scalar(firstkid);
9657 o->op_flags |= OPf_SPECIAL;
9660 firstkid = firstkid->op_sibling;
9663 /* provide list context for arguments */
9670 S_simplify_sort(pTHX_ OP *o)
9673 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9680 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
9682 if (!(o->op_flags & OPf_STACKED))
9684 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
9685 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
9686 kid = kUNOP->op_first; /* get past null */
9687 if (!(have_scopeop = kid->op_type == OP_SCOPE)
9688 && kid->op_type != OP_LEAVE)
9690 kid = kLISTOP->op_last; /* get past scope */
9691 switch(kid->op_type) {
9695 if (!have_scopeop) goto padkids;
9700 k = kid; /* remember this node*/
9701 if (kBINOP->op_first->op_type != OP_RV2SV
9702 || kBINOP->op_last ->op_type != OP_RV2SV)
9705 Warn about my($a) or my($b) in a sort block, *if* $a or $b is
9706 then used in a comparison. This catches most, but not
9707 all cases. For instance, it catches
9708 sort { my($a); $a <=> $b }
9710 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
9711 (although why you'd do that is anyone's guess).
9715 if (!ckWARN(WARN_SYNTAX)) return;
9716 kid = kBINOP->op_first;
9718 if (kid->op_type == OP_PADSV) {
9719 SV * const name = AvARRAY(PL_comppad_name)[kid->op_targ];
9720 if (SvCUR(name) == 2 && *SvPVX(name) == '$'
9721 && (SvPVX(name)[1] == 'a' || SvPVX(name)[1] == 'b'))
9722 /* diag_listed_as: "my %s" used in sort comparison */
9723 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
9724 "\"%s %s\" used in sort comparison",
9725 SvPAD_STATE(name) ? "state" : "my",
9728 } while ((kid = kid->op_sibling));
9731 kid = kBINOP->op_first; /* get past cmp */
9732 if (kUNOP->op_first->op_type != OP_GV)
9734 kid = kUNOP->op_first; /* get past rv2sv */
9736 if (GvSTASH(gv) != PL_curstash)
9738 gvname = GvNAME(gv);
9739 if (*gvname == 'a' && gvname[1] == '\0')
9741 else if (*gvname == 'b' && gvname[1] == '\0')
9746 kid = k; /* back to cmp */
9747 /* already checked above that it is rv2sv */
9748 kid = kBINOP->op_last; /* down to 2nd arg */
9749 if (kUNOP->op_first->op_type != OP_GV)
9751 kid = kUNOP->op_first; /* get past rv2sv */
9753 if (GvSTASH(gv) != PL_curstash)
9755 gvname = GvNAME(gv);
9757 ? !(*gvname == 'a' && gvname[1] == '\0')
9758 : !(*gvname == 'b' && gvname[1] == '\0'))
9760 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
9762 o->op_private |= OPpSORT_DESCEND;
9763 if (k->op_type == OP_NCMP)
9764 o->op_private |= OPpSORT_NUMERIC;
9765 if (k->op_type == OP_I_NCMP)
9766 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
9767 kid = cLISTOPo->op_first->op_sibling;
9768 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
9770 op_getmad(kid,o,'S'); /* then delete it */
9772 op_free(kid); /* then delete it */
9777 Perl_ck_split(pTHX_ OP *o)
9782 PERL_ARGS_ASSERT_CK_SPLIT;
9784 if (o->op_flags & OPf_STACKED)
9785 return no_fh_allowed(o);
9787 kid = cLISTOPo->op_first;
9788 if (kid->op_type != OP_NULL)
9789 Perl_croak(aTHX_ "panic: ck_split, type=%u", (unsigned) kid->op_type);
9790 kid = kid->op_sibling;
9791 op_free(cLISTOPo->op_first);
9793 cLISTOPo->op_first = kid;
9795 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
9796 cLISTOPo->op_last = kid; /* There was only one element previously */
9799 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
9800 OP * const sibl = kid->op_sibling;
9801 kid->op_sibling = 0;
9802 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0, 0); /* OPf_SPECIAL is used to trigger split " " behavior */
9803 if (cLISTOPo->op_first == cLISTOPo->op_last)
9804 cLISTOPo->op_last = kid;
9805 cLISTOPo->op_first = kid;
9806 kid->op_sibling = sibl;
9809 kid->op_type = OP_PUSHRE;
9810 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
9812 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
9813 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP),
9814 "Use of /g modifier is meaningless in split");
9817 if (!kid->op_sibling)
9818 op_append_elem(OP_SPLIT, o, newDEFSVOP());
9820 kid = kid->op_sibling;
9823 if (!kid->op_sibling)
9824 op_append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
9825 assert(kid->op_sibling);
9827 kid = kid->op_sibling;
9830 if (kid->op_sibling)
9831 return too_many_arguments_pv(o,OP_DESC(o), 0);
9837 Perl_ck_join(pTHX_ OP *o)
9839 const OP * const kid = cLISTOPo->op_first->op_sibling;
9841 PERL_ARGS_ASSERT_CK_JOIN;
9843 if (kid && kid->op_type == OP_MATCH) {
9844 if (ckWARN(WARN_SYNTAX)) {
9845 const REGEXP *re = PM_GETRE(kPMOP);
9847 ? newSVpvn_flags( RX_PRECOMP_const(re), RX_PRELEN(re),
9848 SVs_TEMP | ( RX_UTF8(re) ? SVf_UTF8 : 0 ) )
9849 : newSVpvs_flags( "STRING", SVs_TEMP );
9850 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
9851 "/%"SVf"/ should probably be written as \"%"SVf"\"",
9852 SVfARG(msg), SVfARG(msg));
9859 =for apidoc Am|CV *|rv2cv_op_cv|OP *cvop|U32 flags
9861 Examines an op, which is expected to identify a subroutine at runtime,
9862 and attempts to determine at compile time which subroutine it identifies.
9863 This is normally used during Perl compilation to determine whether
9864 a prototype can be applied to a function call. I<cvop> is the op
9865 being considered, normally an C<rv2cv> op. A pointer to the identified
9866 subroutine is returned, if it could be determined statically, and a null
9867 pointer is returned if it was not possible to determine statically.
9869 Currently, the subroutine can be identified statically if the RV that the
9870 C<rv2cv> is to operate on is provided by a suitable C<gv> or C<const> op.
9871 A C<gv> op is suitable if the GV's CV slot is populated. A C<const> op is
9872 suitable if the constant value must be an RV pointing to a CV. Details of
9873 this process may change in future versions of Perl. If the C<rv2cv> op
9874 has the C<OPpENTERSUB_AMPER> flag set then no attempt is made to identify
9875 the subroutine statically: this flag is used to suppress compile-time
9876 magic on a subroutine call, forcing it to use default runtime behaviour.
9878 If I<flags> has the bit C<RV2CVOPCV_MARK_EARLY> set, then the handling
9879 of a GV reference is modified. If a GV was examined and its CV slot was
9880 found to be empty, then the C<gv> op has the C<OPpEARLY_CV> flag set.
9881 If the op is not optimised away, and the CV slot is later populated with
9882 a subroutine having a prototype, that flag eventually triggers the warning
9883 "called too early to check prototype".
9885 If I<flags> has the bit C<RV2CVOPCV_RETURN_NAME_GV> set, then instead
9886 of returning a pointer to the subroutine it returns a pointer to the
9887 GV giving the most appropriate name for the subroutine in this context.
9888 Normally this is just the C<CvGV> of the subroutine, but for an anonymous
9889 (C<CvANON>) subroutine that is referenced through a GV it will be the
9890 referencing GV. The resulting C<GV*> is cast to C<CV*> to be returned.
9891 A null pointer is returned as usual if there is no statically-determinable
9898 Perl_rv2cv_op_cv(pTHX_ OP *cvop, U32 flags)
9903 PERL_ARGS_ASSERT_RV2CV_OP_CV;
9904 if (flags & ~(RV2CVOPCV_MARK_EARLY|RV2CVOPCV_RETURN_NAME_GV))
9905 Perl_croak(aTHX_ "panic: rv2cv_op_cv bad flags %x", (unsigned)flags);
9906 if (cvop->op_type != OP_RV2CV)
9908 if (cvop->op_private & OPpENTERSUB_AMPER)
9910 if (!(cvop->op_flags & OPf_KIDS))
9912 rvop = cUNOPx(cvop)->op_first;
9913 switch (rvop->op_type) {
9915 gv = cGVOPx_gv(rvop);
9918 if (flags & RV2CVOPCV_MARK_EARLY)
9919 rvop->op_private |= OPpEARLY_CV;
9924 SV *rv = cSVOPx_sv(rvop);
9931 PADNAME *name = PAD_COMPNAME(rvop->op_targ);
9932 CV *compcv = PL_compcv;
9933 PADOFFSET off = rvop->op_targ;
9934 while (PadnameOUTER(name)) {
9935 assert(PARENT_PAD_INDEX(name));
9936 compcv = CvOUTSIDE(PL_compcv);
9937 name = PadlistNAMESARRAY(CvPADLIST(compcv))
9938 [off = PARENT_PAD_INDEX(name)];
9940 assert(!PadnameIsOUR(name));
9941 if (!PadnameIsSTATE(name)) {
9942 MAGIC * mg = mg_find(name, PERL_MAGIC_proto);
9945 cv = (CV *)mg->mg_obj;
9948 (CV *)AvARRAY(PadlistARRAY(CvPADLIST(compcv))[1])[off];
9955 if (SvTYPE((SV*)cv) != SVt_PVCV)
9957 if (flags & RV2CVOPCV_RETURN_NAME_GV) {
9958 if (!CvANON(cv) || !gv)
9967 =for apidoc Am|OP *|ck_entersub_args_list|OP *entersubop
9969 Performs the default fixup of the arguments part of an C<entersub>
9970 op tree. This consists of applying list context to each of the
9971 argument ops. This is the standard treatment used on a call marked
9972 with C<&>, or a method call, or a call through a subroutine reference,
9973 or any other call where the callee can't be identified at compile time,
9974 or a call where the callee has no prototype.
9980 Perl_ck_entersub_args_list(pTHX_ OP *entersubop)
9983 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_LIST;
9984 aop = cUNOPx(entersubop)->op_first;
9985 if (!aop->op_sibling)
9986 aop = cUNOPx(aop)->op_first;
9987 for (aop = aop->op_sibling; aop->op_sibling; aop = aop->op_sibling) {
9988 if (!(PL_madskills && aop->op_type == OP_STUB)) {
9990 op_lvalue(aop, OP_ENTERSUB);
9997 =for apidoc Am|OP *|ck_entersub_args_proto|OP *entersubop|GV *namegv|SV *protosv
9999 Performs the fixup of the arguments part of an C<entersub> op tree
10000 based on a subroutine prototype. This makes various modifications to
10001 the argument ops, from applying context up to inserting C<refgen> ops,
10002 and checking the number and syntactic types of arguments, as directed by
10003 the prototype. This is the standard treatment used on a subroutine call,
10004 not marked with C<&>, where the callee can be identified at compile time
10005 and has a prototype.
10007 I<protosv> supplies the subroutine prototype to be applied to the call.
10008 It may be a normal defined scalar, of which the string value will be used.
10009 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
10010 that has been cast to C<SV*>) which has a prototype. The prototype
10011 supplied, in whichever form, does not need to match the actual callee
10012 referenced by the op tree.
10014 If the argument ops disagree with the prototype, for example by having
10015 an unacceptable number of arguments, a valid op tree is returned anyway.
10016 The error is reflected in the parser state, normally resulting in a single
10017 exception at the top level of parsing which covers all the compilation
10018 errors that occurred. In the error message, the callee is referred to
10019 by the name defined by the I<namegv> parameter.
10025 Perl_ck_entersub_args_proto(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
10028 const char *proto, *proto_end;
10029 OP *aop, *prev, *cvop;
10032 I32 contextclass = 0;
10033 const char *e = NULL;
10034 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO;
10035 if (SvTYPE(protosv) == SVt_PVCV ? !SvPOK(protosv) : !SvOK(protosv))
10036 Perl_croak(aTHX_ "panic: ck_entersub_args_proto CV with no proto, "
10037 "flags=%lx", (unsigned long) SvFLAGS(protosv));
10038 if (SvTYPE(protosv) == SVt_PVCV)
10039 proto = CvPROTO(protosv), proto_len = CvPROTOLEN(protosv);
10040 else proto = SvPV(protosv, 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 {}",
10087 gv_ename(namegv), 0, o3);
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_sv(arg, Perl_form(aTHX_ "one of %.*s",
10173 (int)(end - p), p),
10174 gv_ename(namegv), 0, o3);
10179 if (o3->op_type == OP_RV2GV)
10182 bad_type_sv(arg, "symbol", gv_ename(namegv), 0, o3);
10185 if (o3->op_type == OP_ENTERSUB)
10188 bad_type_sv(arg, "subroutine entry", gv_ename(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_sv(arg, "scalar", gv_ename(namegv), 0, o3);
10208 if (o3->op_type == OP_RV2AV ||
10209 o3->op_type == OP_PADAV)
10212 bad_type_sv(arg, "array", gv_ename(namegv), 0, o3);
10215 if (o3->op_type == OP_RV2HV ||
10216 o3->op_type == OP_PADHV)
10219 bad_type_sv(arg, "hash", gv_ename(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);
10546 namegv = (GV *)sv_newmortal();
10547 gv_init_pvn(namegv, PL_curstash, HEK_KEY(hek), HEK_LEN(hek),
10548 SVf_UTF8 * !!HEK_UTF8(hek));
10550 return ckfun(aTHX_ o, namegv, ckobj);
10555 Perl_ck_svconst(pTHX_ OP *o)
10557 PERL_ARGS_ASSERT_CK_SVCONST;
10558 PERL_UNUSED_CONTEXT;
10559 if (!SvIsCOW(cSVOPo->op_sv)) SvREADONLY_on(cSVOPo->op_sv);
10564 Perl_ck_trunc(pTHX_ OP *o)
10566 PERL_ARGS_ASSERT_CK_TRUNC;
10568 if (o->op_flags & OPf_KIDS) {
10569 SVOP *kid = (SVOP*)cUNOPo->op_first;
10571 if (kid->op_type == OP_NULL)
10572 kid = (SVOP*)kid->op_sibling;
10573 if (kid && kid->op_type == OP_CONST &&
10574 (kid->op_private & (OPpCONST_BARE|OPpCONST_FOLDED))
10577 o->op_flags |= OPf_SPECIAL;
10578 kid->op_private &= ~OPpCONST_STRICT;
10585 Perl_ck_substr(pTHX_ OP *o)
10587 PERL_ARGS_ASSERT_CK_SUBSTR;
10590 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
10591 OP *kid = cLISTOPo->op_first;
10593 if (kid->op_type == OP_NULL)
10594 kid = kid->op_sibling;
10596 kid->op_flags |= OPf_MOD;
10603 Perl_ck_tell(pTHX_ OP *o)
10605 PERL_ARGS_ASSERT_CK_TELL;
10607 if (o->op_flags & OPf_KIDS) {
10608 OP *kid = cLISTOPo->op_first;
10609 if (kid->op_type == OP_NULL && kid->op_sibling) kid = kid->op_sibling;
10610 if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE;
10616 Perl_ck_each(pTHX_ OP *o)
10619 OP *kid = o->op_flags & OPf_KIDS ? cUNOPo->op_first : NULL;
10620 const unsigned orig_type = o->op_type;
10621 const unsigned array_type = orig_type == OP_EACH ? OP_AEACH
10622 : orig_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
10623 const unsigned ref_type = orig_type == OP_EACH ? OP_REACH
10624 : orig_type == OP_KEYS ? OP_RKEYS : OP_RVALUES;
10626 PERL_ARGS_ASSERT_CK_EACH;
10629 switch (kid->op_type) {
10635 CHANGE_TYPE(o, array_type);
10638 if (kid->op_private == OPpCONST_BARE
10639 || !SvROK(cSVOPx_sv(kid))
10640 || ( SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV
10641 && SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVHV )
10643 /* we let ck_fun handle it */
10646 CHANGE_TYPE(o, ref_type);
10650 /* if treating as a reference, defer additional checks to runtime */
10651 return o->op_type == ref_type ? o : ck_fun(o);
10655 Perl_ck_length(pTHX_ OP *o)
10657 PERL_ARGS_ASSERT_CK_LENGTH;
10661 if (ckWARN(WARN_SYNTAX)) {
10662 const OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : NULL;
10666 const bool hash = kid->op_type == OP_PADHV
10667 || kid->op_type == OP_RV2HV;
10668 switch (kid->op_type) {
10672 (GV *)PL_compcv, hash ? '%' : '@', kid->op_targ,
10678 if (cUNOPx(kid)->op_first->op_type != OP_GV) break;
10680 GV *gv = cGVOPx_gv(cUNOPx(kid)->op_first);
10682 name = varname(gv, hash?'%':'@', 0, NULL, 0, 1);
10689 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10690 "length() used on %"SVf" (did you mean \"scalar(%s%"SVf
10692 name, hash ? "keys " : "", name
10695 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10696 "length() used on %%hash (did you mean \"scalar(keys %%hash)\"?)");
10698 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10699 "length() used on @array (did you mean \"scalar(@array)\"?)");
10706 /* Check for in place reverse and sort assignments like "@a = reverse @a"
10707 and modify the optree to make them work inplace */
10710 S_inplace_aassign(pTHX_ OP *o) {
10712 OP *modop, *modop_pushmark;
10714 OP *oleft, *oleft_pushmark;
10716 PERL_ARGS_ASSERT_INPLACE_AASSIGN;
10718 assert((o->op_flags & OPf_WANT) == OPf_WANT_VOID);
10720 assert(cUNOPo->op_first->op_type == OP_NULL);
10721 modop_pushmark = cUNOPx(cUNOPo->op_first)->op_first;
10722 assert(modop_pushmark->op_type == OP_PUSHMARK);
10723 modop = modop_pushmark->op_sibling;
10725 if (modop->op_type != OP_SORT && modop->op_type != OP_REVERSE)
10728 /* no other operation except sort/reverse */
10729 if (modop->op_sibling)
10732 assert(cUNOPx(modop)->op_first->op_type == OP_PUSHMARK);
10733 if (!(oright = cUNOPx(modop)->op_first->op_sibling)) return;
10735 if (modop->op_flags & OPf_STACKED) {
10736 /* skip sort subroutine/block */
10737 assert(oright->op_type == OP_NULL);
10738 oright = oright->op_sibling;
10741 assert(cUNOPo->op_first->op_sibling->op_type == OP_NULL);
10742 oleft_pushmark = cUNOPx(cUNOPo->op_first->op_sibling)->op_first;
10743 assert(oleft_pushmark->op_type == OP_PUSHMARK);
10744 oleft = oleft_pushmark->op_sibling;
10746 /* Check the lhs is an array */
10748 (oleft->op_type != OP_RV2AV && oleft->op_type != OP_PADAV)
10749 || oleft->op_sibling
10750 || (oleft->op_private & OPpLVAL_INTRO)
10754 /* Only one thing on the rhs */
10755 if (oright->op_sibling)
10758 /* check the array is the same on both sides */
10759 if (oleft->op_type == OP_RV2AV) {
10760 if (oright->op_type != OP_RV2AV
10761 || !cUNOPx(oright)->op_first
10762 || cUNOPx(oright)->op_first->op_type != OP_GV
10763 || cUNOPx(oleft )->op_first->op_type != OP_GV
10764 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
10765 cGVOPx_gv(cUNOPx(oright)->op_first)
10769 else if (oright->op_type != OP_PADAV
10770 || oright->op_targ != oleft->op_targ
10774 /* This actually is an inplace assignment */
10776 modop->op_private |= OPpSORT_INPLACE;
10778 /* transfer MODishness etc from LHS arg to RHS arg */
10779 oright->op_flags = oleft->op_flags;
10781 /* remove the aassign op and the lhs */
10783 op_null(oleft_pushmark);
10784 if (oleft->op_type == OP_RV2AV && cUNOPx(oleft)->op_first)
10785 op_null(cUNOPx(oleft)->op_first);
10789 #define MAX_DEFERRED 4
10793 if (defer_ix == (MAX_DEFERRED-1)) { \
10794 CALL_RPEEP(defer_queue[defer_base]); \
10795 defer_base = (defer_base + 1) % MAX_DEFERRED; \
10798 defer_queue[(defer_base + ++defer_ix) % MAX_DEFERRED] = o; \
10801 /* A peephole optimizer. We visit the ops in the order they're to execute.
10802 * See the comments at the top of this file for more details about when
10803 * peep() is called */
10806 Perl_rpeep(pTHX_ OP *o)
10810 OP* oldoldop = NULL;
10811 OP* defer_queue[MAX_DEFERRED]; /* small queue of deferred branches */
10812 int defer_base = 0;
10815 if (!o || o->op_opt)
10819 SAVEVPTR(PL_curcop);
10820 for (;; o = o->op_next) {
10821 if (o && o->op_opt)
10824 while (defer_ix >= 0)
10825 CALL_RPEEP(defer_queue[(defer_base + defer_ix--) % MAX_DEFERRED]);
10829 /* By default, this op has now been optimised. A couple of cases below
10830 clear this again. */
10833 switch (o->op_type) {
10835 PL_curcop = ((COP*)o); /* for warnings */
10838 PL_curcop = ((COP*)o); /* for warnings */
10840 /* Two NEXTSTATEs in a row serve no purpose. Except if they happen
10841 to carry two labels. For now, take the easier option, and skip
10842 this optimisation if the first NEXTSTATE has a label. */
10843 if (!CopLABEL((COP*)o) && !PERLDB_NOOPT) {
10844 OP *nextop = o->op_next;
10845 while (nextop && nextop->op_type == OP_NULL)
10846 nextop = nextop->op_next;
10848 if (nextop && (nextop->op_type == OP_NEXTSTATE)) {
10849 COP *firstcop = (COP *)o;
10850 COP *secondcop = (COP *)nextop;
10851 /* We want the COP pointed to by o (and anything else) to
10852 become the next COP down the line. */
10853 cop_free(firstcop);
10855 firstcop->op_next = secondcop->op_next;
10857 /* Now steal all its pointers, and duplicate the other
10859 firstcop->cop_line = secondcop->cop_line;
10860 #ifdef USE_ITHREADS
10861 firstcop->cop_stashoff = secondcop->cop_stashoff;
10862 firstcop->cop_file = secondcop->cop_file;
10864 firstcop->cop_stash = secondcop->cop_stash;
10865 firstcop->cop_filegv = secondcop->cop_filegv;
10867 firstcop->cop_hints = secondcop->cop_hints;
10868 firstcop->cop_seq = secondcop->cop_seq;
10869 firstcop->cop_warnings = secondcop->cop_warnings;
10870 firstcop->cop_hints_hash = secondcop->cop_hints_hash;
10872 #ifdef USE_ITHREADS
10873 secondcop->cop_stashoff = 0;
10874 secondcop->cop_file = NULL;
10876 secondcop->cop_stash = NULL;
10877 secondcop->cop_filegv = NULL;
10879 secondcop->cop_warnings = NULL;
10880 secondcop->cop_hints_hash = NULL;
10882 /* If we use op_null(), and hence leave an ex-COP, some
10883 warnings are misreported. For example, the compile-time
10884 error in 'use strict; no strict refs;' */
10885 secondcop->op_type = OP_NULL;
10886 secondcop->op_ppaddr = PL_ppaddr[OP_NULL];
10892 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
10893 if (o->op_next->op_private & OPpTARGET_MY) {
10894 if (o->op_flags & OPf_STACKED) /* chained concats */
10895 break; /* ignore_optimization */
10897 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
10898 o->op_targ = o->op_next->op_targ;
10899 o->op_next->op_targ = 0;
10900 o->op_private |= OPpTARGET_MY;
10903 op_null(o->op_next);
10907 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
10908 break; /* Scalar stub must produce undef. List stub is noop */
10912 if (o->op_targ == OP_NEXTSTATE
10913 || o->op_targ == OP_DBSTATE)
10915 PL_curcop = ((COP*)o);
10917 /* XXX: We avoid setting op_seq here to prevent later calls
10918 to rpeep() from mistakenly concluding that optimisation
10919 has already occurred. This doesn't fix the real problem,
10920 though (See 20010220.007). AMS 20010719 */
10921 /* op_seq functionality is now replaced by op_opt */
10928 if (oldop && o->op_next) {
10929 oldop->op_next = o->op_next;
10937 /* Convert a series of PAD ops for my vars plus support into a
10938 * single padrange op. Basically
10940 * pushmark -> pad[ahs]v -> pad[ahs]?v -> ... -> (list) -> rest
10942 * becomes, depending on circumstances, one of
10944 * padrange ----------------------------------> (list) -> rest
10945 * padrange --------------------------------------------> rest
10947 * where all the pad indexes are sequential and of the same type
10949 * We convert the pushmark into a padrange op, then skip
10950 * any other pad ops, and possibly some trailing ops.
10951 * Note that we don't null() the skipped ops, to make it
10952 * easier for Deparse to undo this optimisation (and none of
10953 * the skipped ops are holding any resourses). It also makes
10954 * it easier for find_uninit_var(), as it can just ignore
10955 * padrange, and examine the original pad ops.
10959 OP *followop = NULL; /* the op that will follow the padrange op */
10962 PADOFFSET base = 0; /* init only to stop compiler whining */
10963 U8 gimme = 0; /* init only to stop compiler whining */
10964 bool defav = 0; /* seen (...) = @_ */
10965 bool reuse = 0; /* reuse an existing padrange op */
10967 /* look for a pushmark -> gv[_] -> rv2av */
10973 if ( p->op_type == OP_GV
10974 && (gv = cGVOPx_gv(p))
10975 && GvNAMELEN_get(gv) == 1
10976 && *GvNAME_get(gv) == '_'
10977 && GvSTASH(gv) == PL_defstash
10978 && (rv2av = p->op_next)
10979 && rv2av->op_type == OP_RV2AV
10980 && !(rv2av->op_flags & OPf_REF)
10981 && !(rv2av->op_private & (OPpLVAL_INTRO|OPpMAYBE_LVSUB))
10982 && ((rv2av->op_flags & OPf_WANT) == OPf_WANT_LIST)
10983 && o->op_sibling == rv2av /* these two for Deparse */
10984 && cUNOPx(rv2av)->op_first == p
10986 q = rv2av->op_next;
10987 if (q->op_type == OP_NULL)
10989 if (q->op_type == OP_PUSHMARK) {
10996 /* To allow Deparse to pessimise this, it needs to be able
10997 * to restore the pushmark's original op_next, which it
10998 * will assume to be the same as op_sibling. */
10999 if (o->op_next != o->op_sibling)
11004 /* scan for PAD ops */
11006 for (p = p->op_next; p; p = p->op_next) {
11007 if (p->op_type == OP_NULL)
11010 if (( p->op_type != OP_PADSV
11011 && p->op_type != OP_PADAV
11012 && p->op_type != OP_PADHV
11014 /* any private flag other than INTRO? e.g. STATE */
11015 || (p->op_private & ~OPpLVAL_INTRO)
11019 /* let $a[N] potentially be optimised into ALEMFAST_LEX
11021 if ( p->op_type == OP_PADAV
11023 && p->op_next->op_type == OP_CONST
11024 && p->op_next->op_next
11025 && p->op_next->op_next->op_type == OP_AELEM
11029 /* for 1st padop, note what type it is and the range
11030 * start; for the others, check that it's the same type
11031 * and that the targs are contiguous */
11033 intro = (p->op_private & OPpLVAL_INTRO);
11035 gimme = (p->op_flags & OPf_WANT);
11038 if ((p->op_private & OPpLVAL_INTRO) != intro)
11040 /* Note that you'd normally expect targs to be
11041 * contiguous in my($a,$b,$c), but that's not the case
11042 * when external modules start doing things, e.g.
11043 i* Function::Parameters */
11044 if (p->op_targ != base + count)
11046 assert(p->op_targ == base + count);
11047 /* all the padops should be in the same context */
11048 if (gimme != (p->op_flags & OPf_WANT))
11052 /* for AV, HV, only when we're not flattening */
11053 if ( p->op_type != OP_PADSV
11054 && gimme != OPf_WANT_VOID
11055 && !(p->op_flags & OPf_REF)
11059 if (count >= OPpPADRANGE_COUNTMASK)
11062 /* there's a biggest base we can fit into a
11063 * SAVEt_CLEARPADRANGE in pp_padrange */
11064 if (intro && base >
11065 (UV_MAX >> (OPpPADRANGE_COUNTSHIFT+SAVE_TIGHT_SHIFT)))
11068 /* Success! We've got another valid pad op to optimise away */
11070 followop = p->op_next;
11076 /* pp_padrange in specifically compile-time void context
11077 * skips pushing a mark and lexicals; in all other contexts
11078 * (including unknown till runtime) it pushes a mark and the
11079 * lexicals. We must be very careful then, that the ops we
11080 * optimise away would have exactly the same effect as the
11082 * In particular in void context, we can only optimise to
11083 * a padrange if see see the complete sequence
11084 * pushmark, pad*v, ...., list, nextstate
11085 * which has the net effect of of leaving the stack empty
11086 * (for now we leave the nextstate in the execution chain, for
11087 * its other side-effects).
11090 if (gimme == OPf_WANT_VOID) {
11091 if (followop->op_type == OP_LIST
11092 && gimme == (followop->op_flags & OPf_WANT)
11093 && ( followop->op_next->op_type == OP_NEXTSTATE
11094 || followop->op_next->op_type == OP_DBSTATE))
11096 followop = followop->op_next; /* skip OP_LIST */
11098 /* consolidate two successive my(...);'s */
11101 && oldoldop->op_type == OP_PADRANGE
11102 && (oldoldop->op_flags & OPf_WANT) == OPf_WANT_VOID
11103 && (oldoldop->op_private & OPpLVAL_INTRO) == intro
11104 && !(oldoldop->op_flags & OPf_SPECIAL)
11107 assert(oldoldop->op_next == oldop);
11108 assert( oldop->op_type == OP_NEXTSTATE
11109 || oldop->op_type == OP_DBSTATE);
11110 assert(oldop->op_next == o);
11113 = (oldoldop->op_private & OPpPADRANGE_COUNTMASK);
11114 assert(oldoldop->op_targ + old_count == base);
11116 if (old_count < OPpPADRANGE_COUNTMASK - count) {
11117 base = oldoldop->op_targ;
11118 count += old_count;
11123 /* if there's any immediately following singleton
11124 * my var's; then swallow them and the associated
11126 * my ($a,$b); my $c; my $d;
11128 * my ($a,$b,$c,$d);
11131 while ( ((p = followop->op_next))
11132 && ( p->op_type == OP_PADSV
11133 || p->op_type == OP_PADAV
11134 || p->op_type == OP_PADHV)
11135 && (p->op_flags & OPf_WANT) == OPf_WANT_VOID
11136 && (p->op_private & OPpLVAL_INTRO) == intro
11138 && ( p->op_next->op_type == OP_NEXTSTATE
11139 || p->op_next->op_type == OP_DBSTATE)
11140 && count < OPpPADRANGE_COUNTMASK
11142 assert(base + count == p->op_targ);
11144 followop = p->op_next;
11152 assert(oldoldop->op_type == OP_PADRANGE);
11153 oldoldop->op_next = followop;
11154 oldoldop->op_private = (intro | count);
11160 /* Convert the pushmark into a padrange.
11161 * To make Deparse easier, we guarantee that a padrange was
11162 * *always* formerly a pushmark */
11163 assert(o->op_type == OP_PUSHMARK);
11164 o->op_next = followop;
11165 o->op_type = OP_PADRANGE;
11166 o->op_ppaddr = PL_ppaddr[OP_PADRANGE];
11168 /* bit 7: INTRO; bit 6..0: count */
11169 o->op_private = (intro | count);
11170 o->op_flags = ((o->op_flags & ~(OPf_WANT|OPf_SPECIAL))
11171 | gimme | (defav ? OPf_SPECIAL : 0));
11178 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
11179 OP* const pop = (o->op_type == OP_PADAV) ?
11180 o->op_next : o->op_next->op_next;
11182 if (pop && pop->op_type == OP_CONST &&
11183 ((PL_op = pop->op_next)) &&
11184 pop->op_next->op_type == OP_AELEM &&
11185 !(pop->op_next->op_private &
11186 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
11187 (i = SvIV(((SVOP*)pop)->op_sv)) <= 255 && i >= 0)
11190 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
11191 no_bareword_allowed(pop);
11192 if (o->op_type == OP_GV)
11193 op_null(o->op_next);
11194 op_null(pop->op_next);
11196 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
11197 o->op_next = pop->op_next->op_next;
11198 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
11199 o->op_private = (U8)i;
11200 if (o->op_type == OP_GV) {
11203 o->op_type = OP_AELEMFAST;
11206 o->op_type = OP_AELEMFAST_LEX;
11211 if (o->op_next->op_type == OP_RV2SV) {
11212 if (!(o->op_next->op_private & OPpDEREF)) {
11213 op_null(o->op_next);
11214 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
11216 o->op_next = o->op_next->op_next;
11217 o->op_type = OP_GVSV;
11218 o->op_ppaddr = PL_ppaddr[OP_GVSV];
11221 else if (o->op_next->op_type == OP_READLINE
11222 && o->op_next->op_next->op_type == OP_CONCAT
11223 && (o->op_next->op_next->op_flags & OPf_STACKED))
11225 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
11226 o->op_type = OP_RCATLINE;
11227 o->op_flags |= OPf_STACKED;
11228 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
11229 op_null(o->op_next->op_next);
11230 op_null(o->op_next);
11239 #define HV_OR_SCALARHV(op) \
11240 ( (op)->op_type == OP_PADHV || (op)->op_type == OP_RV2HV \
11242 : (op)->op_type == OP_SCALAR && (op)->op_flags & OPf_KIDS \
11243 && ( cUNOPx(op)->op_first->op_type == OP_PADHV \
11244 || cUNOPx(op)->op_first->op_type == OP_RV2HV) \
11245 ? cUNOPx(op)->op_first \
11249 if ((fop = HV_OR_SCALARHV(cUNOP->op_first)))
11250 fop->op_private |= OPpTRUEBOOL;
11256 fop = cLOGOP->op_first;
11257 sop = fop->op_sibling;
11258 while (cLOGOP->op_other->op_type == OP_NULL)
11259 cLOGOP->op_other = cLOGOP->op_other->op_next;
11260 while (o->op_next && ( o->op_type == o->op_next->op_type
11261 || o->op_next->op_type == OP_NULL))
11262 o->op_next = o->op_next->op_next;
11263 DEFER(cLOGOP->op_other);
11266 fop = HV_OR_SCALARHV(fop);
11267 if (sop) sop = HV_OR_SCALARHV(sop);
11272 if (!((nop->op_flags & OPf_WANT) == OPf_WANT_VOID)) {
11273 while (nop && nop->op_next) {
11274 switch (nop->op_next->op_type) {
11279 lop = nop = nop->op_next;
11282 nop = nop->op_next;
11291 if ( (lop->op_flags & OPf_WANT) == OPf_WANT_VOID
11292 || o->op_type == OP_AND )
11293 fop->op_private |= OPpTRUEBOOL;
11294 else if (!(lop->op_flags & OPf_WANT))
11295 fop->op_private |= OPpMAYBE_TRUEBOOL;
11297 if ( (lop->op_flags & OPf_WANT) == OPf_WANT_VOID
11299 sop->op_private |= OPpTRUEBOOL;
11306 if ((fop = HV_OR_SCALARHV(cLOGOP->op_first)))
11307 fop->op_private |= OPpTRUEBOOL;
11308 #undef HV_OR_SCALARHV
11319 while (cLOGOP->op_other->op_type == OP_NULL)
11320 cLOGOP->op_other = cLOGOP->op_other->op_next;
11321 DEFER(cLOGOP->op_other);
11326 while (cLOOP->op_redoop->op_type == OP_NULL)
11327 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
11328 while (cLOOP->op_nextop->op_type == OP_NULL)
11329 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
11330 while (cLOOP->op_lastop->op_type == OP_NULL)
11331 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
11332 /* a while(1) loop doesn't have an op_next that escapes the
11333 * loop, so we have to explicitly follow the op_lastop to
11334 * process the rest of the code */
11335 DEFER(cLOOP->op_lastop);
11339 assert(!(cPMOP->op_pmflags & PMf_ONCE));
11340 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
11341 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
11342 cPMOP->op_pmstashstartu.op_pmreplstart
11343 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
11344 DEFER(cPMOP->op_pmstashstartu.op_pmreplstart);
11350 if (o->op_flags & OPf_STACKED) {
11352 cUNOPx(cLISTOP->op_first->op_sibling)->op_first;
11353 if (kid->op_type == OP_SCOPE
11354 || (kid->op_type == OP_NULL && kid->op_targ == OP_LEAVE))
11355 DEFER(kLISTOP->op_first);
11358 /* check that RHS of sort is a single plain array */
11359 oright = cUNOPo->op_first;
11360 if (!oright || oright->op_type != OP_PUSHMARK)
11363 if (o->op_private & OPpSORT_INPLACE)
11366 /* reverse sort ... can be optimised. */
11367 if (!cUNOPo->op_sibling) {
11368 /* Nothing follows us on the list. */
11369 OP * const reverse = o->op_next;
11371 if (reverse->op_type == OP_REVERSE &&
11372 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
11373 OP * const pushmark = cUNOPx(reverse)->op_first;
11374 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
11375 && (cUNOPx(pushmark)->op_sibling == o)) {
11376 /* reverse -> pushmark -> sort */
11377 o->op_private |= OPpSORT_REVERSE;
11379 pushmark->op_next = oright->op_next;
11389 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
11391 LISTOP *enter, *exlist;
11393 if (o->op_private & OPpSORT_INPLACE)
11396 enter = (LISTOP *) o->op_next;
11399 if (enter->op_type == OP_NULL) {
11400 enter = (LISTOP *) enter->op_next;
11404 /* for $a (...) will have OP_GV then OP_RV2GV here.
11405 for (...) just has an OP_GV. */
11406 if (enter->op_type == OP_GV) {
11407 gvop = (OP *) enter;
11408 enter = (LISTOP *) enter->op_next;
11411 if (enter->op_type == OP_RV2GV) {
11412 enter = (LISTOP *) enter->op_next;
11418 if (enter->op_type != OP_ENTERITER)
11421 iter = enter->op_next;
11422 if (!iter || iter->op_type != OP_ITER)
11425 expushmark = enter->op_first;
11426 if (!expushmark || expushmark->op_type != OP_NULL
11427 || expushmark->op_targ != OP_PUSHMARK)
11430 exlist = (LISTOP *) expushmark->op_sibling;
11431 if (!exlist || exlist->op_type != OP_NULL
11432 || exlist->op_targ != OP_LIST)
11435 if (exlist->op_last != o) {
11436 /* Mmm. Was expecting to point back to this op. */
11439 theirmark = exlist->op_first;
11440 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
11443 if (theirmark->op_sibling != o) {
11444 /* There's something between the mark and the reverse, eg
11445 for (1, reverse (...))
11450 ourmark = ((LISTOP *)o)->op_first;
11451 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
11454 ourlast = ((LISTOP *)o)->op_last;
11455 if (!ourlast || ourlast->op_next != o)
11458 rv2av = ourmark->op_sibling;
11459 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
11460 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
11461 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
11462 /* We're just reversing a single array. */
11463 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
11464 enter->op_flags |= OPf_STACKED;
11467 /* We don't have control over who points to theirmark, so sacrifice
11469 theirmark->op_next = ourmark->op_next;
11470 theirmark->op_flags = ourmark->op_flags;
11471 ourlast->op_next = gvop ? gvop : (OP *) enter;
11474 enter->op_private |= OPpITER_REVERSED;
11475 iter->op_private |= OPpITER_REVERSED;
11482 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
11483 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
11488 if (!(o->op_private & OPpOFFBYONE) && !CvCLONE(PL_compcv)) {
11490 if (CvEVAL(PL_compcv)) sv = &PL_sv_undef;
11492 sv = newRV((SV *)PL_compcv);
11496 o->op_type = OP_CONST;
11497 o->op_ppaddr = PL_ppaddr[OP_CONST];
11498 o->op_flags |= OPf_SPECIAL;
11499 cSVOPo->op_sv = sv;
11504 if (OP_GIMME(o,0) == G_VOID) {
11505 OP *right = cBINOP->op_first;
11507 OP *left = right->op_sibling;
11508 if (left->op_type == OP_SUBSTR
11509 && (left->op_private & 7) < 4) {
11511 cBINOP->op_first = left;
11512 right->op_sibling =
11513 cBINOPx(left)->op_first->op_sibling;
11514 cBINOPx(left)->op_first->op_sibling = right;
11515 left->op_private |= OPpSUBSTR_REPL_FIRST;
11517 (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
11524 Perl_cpeep_t cpeep =
11525 XopENTRY(Perl_custom_op_xop(aTHX_ o), xop_peep);
11527 cpeep(aTHX_ o, oldop);
11539 Perl_peep(pTHX_ OP *o)
11545 =head1 Custom Operators
11547 =for apidoc Ao||custom_op_xop
11548 Return the XOP structure for a given custom op. This function should be
11549 considered internal to OP_NAME and the other access macros: use them instead.
11555 Perl_custom_op_xop(pTHX_ const OP *o)
11561 static const XOP xop_null = { 0, 0, 0, 0, 0 };
11563 PERL_ARGS_ASSERT_CUSTOM_OP_XOP;
11564 assert(o->op_type == OP_CUSTOM);
11566 /* This is wrong. It assumes a function pointer can be cast to IV,
11567 * which isn't guaranteed, but this is what the old custom OP code
11568 * did. In principle it should be safer to Copy the bytes of the
11569 * pointer into a PV: since the new interface is hidden behind
11570 * functions, this can be changed later if necessary. */
11571 /* Change custom_op_xop if this ever happens */
11572 keysv = sv_2mortal(newSViv(PTR2IV(o->op_ppaddr)));
11575 he = hv_fetch_ent(PL_custom_ops, keysv, 0, 0);
11577 /* assume noone will have just registered a desc */
11578 if (!he && PL_custom_op_names &&
11579 (he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0))
11584 /* XXX does all this need to be shared mem? */
11585 Newxz(xop, 1, XOP);
11586 pv = SvPV(HeVAL(he), l);
11587 XopENTRY_set(xop, xop_name, savepvn(pv, l));
11588 if (PL_custom_op_descs &&
11589 (he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0))
11591 pv = SvPV(HeVAL(he), l);
11592 XopENTRY_set(xop, xop_desc, savepvn(pv, l));
11594 Perl_custom_op_register(aTHX_ o->op_ppaddr, xop);
11598 if (!he) return &xop_null;
11600 xop = INT2PTR(XOP *, SvIV(HeVAL(he)));
11605 =for apidoc Ao||custom_op_register
11606 Register a custom op. See L<perlguts/"Custom Operators">.
11612 Perl_custom_op_register(pTHX_ Perl_ppaddr_t ppaddr, const XOP *xop)
11616 PERL_ARGS_ASSERT_CUSTOM_OP_REGISTER;
11618 /* see the comment in custom_op_xop */
11619 keysv = sv_2mortal(newSViv(PTR2IV(ppaddr)));
11621 if (!PL_custom_ops)
11622 PL_custom_ops = newHV();
11624 if (!hv_store_ent(PL_custom_ops, keysv, newSViv(PTR2IV(xop)), 0))
11625 Perl_croak(aTHX_ "panic: can't register custom OP %s", xop->xop_name);
11629 =head1 Functions in file op.c
11631 =for apidoc core_prototype
11632 This function assigns the prototype of the named core function to C<sv>, or
11633 to a new mortal SV if C<sv> is NULL. It returns the modified C<sv>, or
11634 NULL if the core function has no prototype. C<code> is a code as returned
11635 by C<keyword()>. It must not be equal to 0 or -KEY_CORE.
11641 Perl_core_prototype(pTHX_ SV *sv, const char *name, const int code,
11644 int i = 0, n = 0, seen_question = 0, defgv = 0;
11646 #define MAX_ARGS_OP ((sizeof(I32) - 1) * 2)
11647 char str[ MAX_ARGS_OP * 2 + 2 ]; /* One ';', one '\0' */
11648 bool nullret = FALSE;
11650 PERL_ARGS_ASSERT_CORE_PROTOTYPE;
11652 assert (code && code != -KEY_CORE);
11654 if (!sv) sv = sv_newmortal();
11656 #define retsetpvs(x,y) sv_setpvs(sv, x); if(opnum) *opnum=(y); return sv
11658 switch (code < 0 ? -code : code) {
11659 case KEY_and : case KEY_chop: case KEY_chomp:
11660 case KEY_cmp : case KEY_defined: case KEY_delete: case KEY_exec :
11661 case KEY_exists: case KEY_eq : case KEY_ge : case KEY_goto :
11662 case KEY_grep : case KEY_gt : case KEY_last : case KEY_le :
11663 case KEY_lt : case KEY_map : case KEY_ne : case KEY_next :
11664 case KEY_or : case KEY_print : case KEY_printf: case KEY_qr :
11665 case KEY_redo : case KEY_require: case KEY_return: case KEY_say :
11666 case KEY_select: case KEY_sort : case KEY_split : case KEY_system:
11667 case KEY_x : case KEY_xor :
11668 if (!opnum) return NULL; nullret = TRUE; goto findopnum;
11669 case KEY_glob: retsetpvs("_;", OP_GLOB);
11670 case KEY_keys: retsetpvs("+", OP_KEYS);
11671 case KEY_values: retsetpvs("+", OP_VALUES);
11672 case KEY_each: retsetpvs("+", OP_EACH);
11673 case KEY_push: retsetpvs("+@", OP_PUSH);
11674 case KEY_unshift: retsetpvs("+@", OP_UNSHIFT);
11675 case KEY_pop: retsetpvs(";+", OP_POP);
11676 case KEY_shift: retsetpvs(";+", OP_SHIFT);
11677 case KEY_pos: retsetpvs(";\\[$*]", OP_POS);
11679 retsetpvs("+;$$@", OP_SPLICE);
11680 case KEY___FILE__: case KEY___LINE__: case KEY___PACKAGE__:
11682 case KEY_evalbytes:
11683 name = "entereval"; break;
11691 while (i < MAXO) { /* The slow way. */
11692 if (strEQ(name, PL_op_name[i])
11693 || strEQ(name, PL_op_desc[i]))
11695 if (nullret) { assert(opnum); *opnum = i; return NULL; }
11702 defgv = PL_opargs[i] & OA_DEFGV;
11703 oa = PL_opargs[i] >> OASHIFT;
11705 if (oa & OA_OPTIONAL && !seen_question && (
11706 !defgv || (oa & (OA_OPTIONAL - 1)) == OA_FILEREF
11711 if ((oa & (OA_OPTIONAL - 1)) >= OA_AVREF
11712 && (oa & (OA_OPTIONAL - 1)) <= OA_SCALARREF
11713 /* But globs are already references (kinda) */
11714 && (oa & (OA_OPTIONAL - 1)) != OA_FILEREF
11718 if ((oa & (OA_OPTIONAL - 1)) == OA_SCALARREF
11719 && !scalar_mod_type(NULL, i)) {
11724 if (i == OP_LOCK || i == OP_UNDEF) str[n++] = '&';
11728 else str[n++] = ("?$@@%&*$")[oa & (OA_OPTIONAL - 1)];
11729 if (oa & OA_OPTIONAL && defgv && str[n-1] == '$') {
11730 str[n-1] = '_'; defgv = 0;
11734 if (code == -KEY_not || code == -KEY_getprotobynumber) str[n++] = ';';
11736 sv_setpvn(sv, str, n - 1);
11737 if (opnum) *opnum = i;
11742 Perl_coresub_op(pTHX_ SV * const coreargssv, const int code,
11745 OP * const argop = newSVOP(OP_COREARGS,0,coreargssv);
11748 PERL_ARGS_ASSERT_CORESUB_OP;
11752 return op_append_elem(OP_LINESEQ,
11755 newSVOP(OP_CONST, 0, newSViv(-code % 3)),
11759 case OP_SELECT: /* which represents OP_SSELECT as well */
11764 newAVREF(newGVOP(OP_GV, 0, PL_defgv)),
11765 newSVOP(OP_CONST, 0, newSVuv(1))
11767 coresub_op(newSVuv((UV)OP_SSELECT), 0,
11769 coresub_op(coreargssv, 0, OP_SELECT)
11773 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
11775 return op_append_elem(
11778 opnum == OP_WANTARRAY || opnum == OP_RUNCV
11779 ? OPpOFFBYONE << 8 : 0)
11781 case OA_BASEOP_OR_UNOP:
11782 if (opnum == OP_ENTEREVAL) {
11783 o = newUNOP(OP_ENTEREVAL,OPpEVAL_COPHH<<8,argop);
11784 if (code == -KEY_evalbytes) o->op_private |= OPpEVAL_BYTES;
11786 else o = newUNOP(opnum,0,argop);
11787 if (opnum == OP_CALLER) o->op_private |= OPpOFFBYONE;
11790 if (is_handle_constructor(o, 1))
11791 argop->op_private |= OPpCOREARGS_DEREF1;
11792 if (scalar_mod_type(NULL, opnum))
11793 argop->op_private |= OPpCOREARGS_SCALARMOD;
11797 o = convert(opnum,OPf_SPECIAL*(opnum == OP_GLOB),argop);
11798 if (is_handle_constructor(o, 2))
11799 argop->op_private |= OPpCOREARGS_DEREF2;
11800 if (opnum == OP_SUBSTR) {
11801 o->op_private |= OPpMAYBE_LVSUB;
11810 Perl_report_redefined_cv(pTHX_ const SV *name, const CV *old_cv,
11811 SV * const *new_const_svp)
11813 const char *hvname;
11814 bool is_const = !!CvCONST(old_cv);
11815 SV *old_const_sv = is_const ? cv_const_sv(old_cv) : NULL;
11817 PERL_ARGS_ASSERT_REPORT_REDEFINED_CV;
11819 if (is_const && new_const_svp && old_const_sv == *new_const_svp)
11821 /* They are 2 constant subroutines generated from
11822 the same constant. This probably means that
11823 they are really the "same" proxy subroutine
11824 instantiated in 2 places. Most likely this is
11825 when a constant is exported twice. Don't warn.
11828 (ckWARN(WARN_REDEFINE)
11830 CvGV(old_cv) && GvSTASH(CvGV(old_cv))
11831 && HvNAMELEN(GvSTASH(CvGV(old_cv))) == 7
11832 && (hvname = HvNAME(GvSTASH(CvGV(old_cv))),
11833 strEQ(hvname, "autouse"))
11837 && ckWARN_d(WARN_REDEFINE)
11838 && (!new_const_svp || sv_cmp(old_const_sv, *new_const_svp))
11841 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
11843 ? "Constant subroutine %"SVf" redefined"
11844 : "Subroutine %"SVf" redefined",
11849 =head1 Hook manipulation
11851 These functions provide convenient and thread-safe means of manipulating
11858 =for apidoc Am|void|wrap_op_checker|Optype opcode|Perl_check_t new_checker|Perl_check_t *old_checker_p
11860 Puts a C function into the chain of check functions for a specified op
11861 type. This is the preferred way to manipulate the L</PL_check> array.
11862 I<opcode> specifies which type of op is to be affected. I<new_checker>
11863 is a pointer to the C function that is to be added to that opcode's
11864 check chain, and I<old_checker_p> points to the storage location where a
11865 pointer to the next function in the chain will be stored. The value of
11866 I<new_pointer> is written into the L</PL_check> array, while the value
11867 previously stored there is written to I<*old_checker_p>.
11869 L</PL_check> is global to an entire process, and a module wishing to
11870 hook op checking may find itself invoked more than once per process,
11871 typically in different threads. To handle that situation, this function
11872 is idempotent. The location I<*old_checker_p> must initially (once
11873 per process) contain a null pointer. A C variable of static duration
11874 (declared at file scope, typically also marked C<static> to give
11875 it internal linkage) will be implicitly initialised appropriately,
11876 if it does not have an explicit initialiser. This function will only
11877 actually modify the check chain if it finds I<*old_checker_p> to be null.
11878 This function is also thread safe on the small scale. It uses appropriate
11879 locking to avoid race conditions in accessing L</PL_check>.
11881 When this function is called, the function referenced by I<new_checker>
11882 must be ready to be called, except for I<*old_checker_p> being unfilled.
11883 In a threading situation, I<new_checker> may be called immediately,
11884 even before this function has returned. I<*old_checker_p> will always
11885 be appropriately set before I<new_checker> is called. If I<new_checker>
11886 decides not to do anything special with an op that it is given (which
11887 is the usual case for most uses of op check hooking), it must chain the
11888 check function referenced by I<*old_checker_p>.
11890 If you want to influence compilation of calls to a specific subroutine,
11891 then use L</cv_set_call_checker> rather than hooking checking of all
11898 Perl_wrap_op_checker(pTHX_ Optype opcode,
11899 Perl_check_t new_checker, Perl_check_t *old_checker_p)
11903 PERL_ARGS_ASSERT_WRAP_OP_CHECKER;
11904 if (*old_checker_p) return;
11905 OP_CHECK_MUTEX_LOCK;
11906 if (!*old_checker_p) {
11907 *old_checker_p = PL_check[opcode];
11908 PL_check[opcode] = new_checker;
11910 OP_CHECK_MUTEX_UNLOCK;
11915 /* Efficient sub that returns a constant scalar value. */
11917 const_sv_xsub(pTHX_ CV* cv)
11921 SV *const sv = MUTABLE_SV(XSANY.any_ptr);
11925 /* diag_listed_as: SKIPME */
11926 Perl_croak(aTHX_ "usage: %s::%s()",
11927 HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
11940 * c-indentation-style: bsd
11941 * c-basic-offset: 4
11942 * indent-tabs-mode: nil
11945 * ex: set ts=8 sts=4 sw=4 et: