3 * Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008
4 * by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
11 * 'Anyway: there was this Mr. Frodo left an orphan and stranded, as you
12 * might say, among those queer Bucklanders, being brought up anyhow in
13 * Brandy Hall. A regular warren, by all accounts. Old Master Gorbadoc
14 * never had fewer than a couple of hundred relations in the place.
15 * Mr. Bilbo never did a kinder deed than when he brought the lad back
16 * to live among decent folk.' --the Gaffer
18 * [p.23 of _The Lord of the Rings_, I/i: "A Long-Expected Party"]
22 * As of Sept 2002, this file is new and may be in a state of flux for
23 * a while. I've marked things I intent to come back and look at further
24 * with an 'XXX DAPM' comment.
28 =head1 Pad Data Structures
30 This file contains the functions that create and manipulate scratchpads,
31 which are array-of-array data structures attached to a CV (ie a sub)
32 and which store lexical variables and opcode temporary and per-thread
35 =for apidoc m|AV *|CvPADLIST|CV *cv
36 CV's can have CvPADLIST(cv) set to point to an AV.
38 For these purposes "forms" are a kind-of CV, eval""s are too (except they're
39 not callable at will and are always thrown away after the eval"" is done
40 executing). Require'd files are simply evals without any outer lexical
43 XSUBs don't have CvPADLIST set - dXSTARG fetches values from PL_curpad,
44 but that is really the callers pad (a slot of which is allocated by
47 The CvPADLIST AV has does not have AvREAL set, so REFCNT of component items
48 is managed "manual" (mostly in pad.c) rather than normal av.c rules.
49 The items in the AV are not SVs as for a normal AV, but other AVs:
51 0'th Entry of the CvPADLIST is an AV which represents the "names" or rather
52 the "static type information" for lexicals.
54 The CvDEPTH'th entry of CvPADLIST AV is an AV which is the stack frame at that
55 depth of recursion into the CV.
56 The 0'th slot of a frame AV is an AV which is @_.
57 other entries are storage for variables and op targets.
60 C<PL_comppad_name> is set to the names AV.
61 C<PL_comppad> is set to the frame AV for the frame CvDEPTH == 1.
62 C<PL_curpad> is set to the body of the frame AV (i.e. AvARRAY(PL_comppad)).
64 During execution, C<PL_comppad> and C<PL_curpad> refer to the live
65 frame of the currently executing sub.
67 Iterating over the names AV iterates over all possible pad
68 items. Pad slots that are SVs_PADTMP (targets/GVs/constants) end up having
69 &PL_sv_undef "names" (see pad_alloc()).
71 Only my/our variable (SVs_PADMY/SVs_PADOUR) slots get valid names.
72 The rest are op targets/GVs/constants which are statically allocated
73 or resolved at compile time. These don't have names by which they
74 can be looked up from Perl code at run time through eval"" like
75 my/our variables can be. Since they can't be looked up by "name"
76 but only by their index allocated at compile time (which is usually
77 in PL_op->op_targ), wasting a name SV for them doesn't make sense.
79 The SVs in the names AV have their PV being the name of the variable.
80 xlow+1..xhigh inclusive in the NV union is a range of cop_seq numbers for
81 which the name is valid. For typed lexicals name SV is SVt_PVMG and SvSTASH
82 points at the type. For C<our> lexicals, the type is also SVt_PVMG, with the
83 SvOURSTASH slot pointing at the stash of the associated global (so that
84 duplicate C<our> declarations in the same package can be detected). SvUVX is
85 sometimes hijacked to store the generation number during compilation.
87 If SvFAKE is set on the name SV, then that slot in the frame AV is
88 a REFCNT'ed reference to a lexical from "outside". In this case,
89 the name SV does not use xlow and xhigh to store a cop_seq range, since it is
90 in scope throughout. Instead xhigh stores some flags containing info about
91 the real lexical (is it declared in an anon, and is it capable of being
92 instantiated multiple times?), and for fake ANONs, xlow contains the index
93 within the parent's pad where the lexical's value is stored, to make
96 If the 'name' is '&' the corresponding entry in frame AV
97 is a CV representing a possible closure.
98 (SvFAKE and name of '&' is not a meaningful combination currently but could
99 become so if C<my sub foo {}> is implemented.)
101 Note that formats are treated as anon subs, and are cloned each time
102 write is called (if necessary).
104 The flag SVf_PADSTALE is cleared on lexicals each time the my() is executed,
105 and set on scope exit. This allows the 'Variable $x is not available' warning
106 to be generated in evals, such as
108 { my $x = 1; sub f { eval '$x'} } f();
110 For state vars, SVf_PADSTALE is overloaded to mean 'not yet initialised'
117 #define PERL_IN_PAD_C
119 #include "keywords.h"
121 #define COP_SEQ_RANGE_LOW_set(sv,val) \
122 STMT_START { ((XPVNV*)SvANY(sv))->xnv_u.xpad_cop_seq.xlow = (val); } STMT_END
123 #define COP_SEQ_RANGE_HIGH_set(sv,val) \
124 STMT_START { ((XPVNV*)SvANY(sv))->xnv_u.xpad_cop_seq.xhigh = (val); } STMT_END
126 #define PARENT_PAD_INDEX_set(sv,val) \
127 STMT_START { ((XPVNV*)SvANY(sv))->xnv_u.xpad_cop_seq.xlow = (val); } STMT_END
128 #define PARENT_FAKELEX_FLAGS_set(sv,val) \
129 STMT_START { ((XPVNV*)SvANY(sv))->xnv_u.xpad_cop_seq.xhigh = (val); } STMT_END
131 #define PAD_MAX I32_MAX
134 void pad_peg(const char* s) {
137 PERL_ARGS_ASSERT_PAD_PEG;
146 Create a new compiling padlist, saving and updating the various global
147 vars at the same time as creating the pad itself. The following flags
148 can be OR'ed together:
150 padnew_CLONE this pad is for a cloned CV
151 padnew_SAVE save old globals
152 padnew_SAVESUB also save extra stuff for start of sub
158 Perl_pad_new(pTHX_ int flags)
161 AV *padlist, *padname, *pad;
163 ASSERT_CURPAD_LEGAL("pad_new");
165 /* XXX DAPM really need a new SAVEt_PAD which restores all or most
166 * vars (based on flags) rather than storing vals + addresses for
167 * each individually. Also see pad_block_start.
168 * XXX DAPM Try to see whether all these conditionals are required
171 /* save existing state, ... */
173 if (flags & padnew_SAVE) {
175 SAVESPTR(PL_comppad_name);
176 if (! (flags & padnew_CLONE)) {
178 SAVEI32(PL_comppad_name_fill);
179 SAVEI32(PL_min_intro_pending);
180 SAVEI32(PL_max_intro_pending);
181 SAVEBOOL(PL_cv_has_eval);
182 if (flags & padnew_SAVESUB) {
183 SAVEBOOL(PL_pad_reset_pending);
187 /* XXX DAPM interestingly, PL_comppad_name_floor never seems to be
188 * saved - check at some pt that this is okay */
190 /* ... create new pad ... */
196 if (flags & padnew_CLONE) {
197 /* XXX DAPM I dont know why cv_clone needs it
198 * doing differently yet - perhaps this separate branch can be
199 * dispensed with eventually ???
202 AV * const a0 = newAV(); /* will be @_ */
204 av_store(pad, 0, MUTABLE_SV(a0));
208 av_store(pad, 0, NULL);
212 av_store(padlist, 0, MUTABLE_SV(padname));
213 av_store(padlist, 1, MUTABLE_SV(pad));
215 /* ... then update state variables */
217 PL_comppad_name = MUTABLE_AV((*av_fetch(padlist, 0, FALSE)));
218 PL_comppad = MUTABLE_AV((*av_fetch(padlist, 1, FALSE)));
219 PL_curpad = AvARRAY(PL_comppad);
221 if (! (flags & padnew_CLONE)) {
222 PL_comppad_name_fill = 0;
223 PL_min_intro_pending = 0;
228 DEBUG_X(PerlIO_printf(Perl_debug_log,
229 "Pad 0x%"UVxf"[0x%"UVxf"] new: compcv=0x%"UVxf
230 " name=0x%"UVxf" flags=0x%"UVxf"\n",
231 PTR2UV(PL_comppad), PTR2UV(PL_curpad), PTR2UV(PL_compcv),
232 PTR2UV(padname), (UV)flags
236 return (PADLIST*)padlist;
240 =for apidoc pad_undef
242 Free the padlist associated with a CV.
243 If parts of it happen to be current, we null the relevant
244 PL_*pad* global vars so that we don't have any dangling references left.
245 We also repoint the CvOUTSIDE of any about-to-be-orphaned
246 inner subs to the outer of this cv.
248 (This function should really be called pad_free, but the name was already
255 Perl_pad_undef(pTHX_ CV* cv)
259 const PADLIST * const padlist = CvPADLIST(cv);
261 PERL_ARGS_ASSERT_PAD_UNDEF;
263 pad_peg("pad_undef");
266 if (SvIS_FREED(padlist)) /* may be during global destruction */
269 DEBUG_X(PerlIO_printf(Perl_debug_log,
270 "Pad undef: cv=0x%"UVxf" padlist=0x%"UVxf" comppad=0x%"UVxf"\n",
271 PTR2UV(cv), PTR2UV(padlist), PTR2UV(PL_comppad))
274 /* detach any '&' anon children in the pad; if afterwards they
275 * are still live, fix up their CvOUTSIDEs to point to our outside,
277 /* XXX DAPM for efficiency, we should only do this if we know we have
278 * children, or integrate this loop with general cleanup */
280 if (!PL_dirty) { /* don't bother during global destruction */
281 CV * const outercv = CvOUTSIDE(cv);
282 const U32 seq = CvOUTSIDE_SEQ(cv);
283 AV * const comppad_name = MUTABLE_AV(AvARRAY(padlist)[0]);
284 SV ** const namepad = AvARRAY(comppad_name);
285 AV * const comppad = MUTABLE_AV(AvARRAY(padlist)[1]);
286 SV ** const curpad = AvARRAY(comppad);
287 for (ix = AvFILLp(comppad_name); ix > 0; ix--) {
288 SV * const namesv = namepad[ix];
289 if (namesv && namesv != &PL_sv_undef
290 && *SvPVX_const(namesv) == '&')
292 CV * const innercv = MUTABLE_CV(curpad[ix]);
293 U32 inner_rc = SvREFCNT(innercv);
296 SvREFCNT_dec(namesv);
298 if (SvREFCNT(comppad) < 2) { /* allow for /(?{ sub{} })/ */
300 SvREFCNT_dec(innercv);
304 /* in use, not just a prototype */
305 if (inner_rc && (CvOUTSIDE(innercv) == cv)) {
306 assert(CvWEAKOUTSIDE(innercv));
307 /* don't relink to grandfather if he's being freed */
308 if (outercv && SvREFCNT(outercv)) {
309 CvWEAKOUTSIDE_off(innercv);
310 CvOUTSIDE(innercv) = outercv;
311 CvOUTSIDE_SEQ(innercv) = seq;
312 SvREFCNT_inc_simple_void_NN(outercv);
315 CvOUTSIDE(innercv) = NULL;
322 ix = AvFILLp(padlist);
324 SV* const sv = AvARRAY(padlist)[ix--];
326 if (sv == (const SV *)PL_comppad_name)
327 PL_comppad_name = NULL;
328 else if (sv == (const SV *)PL_comppad) {
335 SvREFCNT_dec(MUTABLE_SV(CvPADLIST(cv)));
336 CvPADLIST(cv) = NULL;
343 S_pad_add_name_sv(pTHX_ SV *namesv, const U32 flags, HV *typestash,
347 const PADOFFSET offset = pad_alloc(OP_PADSV, SVs_PADMY);
349 PERL_ARGS_ASSERT_PAD_ADD_NAME_SV;
351 ASSERT_CURPAD_ACTIVE("pad_add_name");
354 assert(SvTYPE(namesv) == SVt_PVMG);
355 SvPAD_TYPED_on(namesv);
356 SvSTASH_set(namesv, MUTABLE_HV(SvREFCNT_inc_simple_NN(MUTABLE_SV(typestash))));
359 SvPAD_OUR_on(namesv);
360 SvOURSTASH_set(namesv, ourstash);
361 SvREFCNT_inc_simple_void_NN(ourstash);
363 else if (flags & pad_add_STATE) {
364 SvPAD_STATE_on(namesv);
367 av_store(PL_comppad_name, offset, namesv);
372 =for apidoc pad_add_name
374 Create a new name and associated PADMY SV in the current pad; return the
376 If C<typestash> is valid, the name is for a typed lexical; set the
377 name's stash to that value.
378 If C<ourstash> is valid, it's an our lexical, set the name's
379 SvOURSTASH to that value
381 If fake, it means we're cloning an existing entry
387 Perl_pad_add_name(pTHX_ const char *name, const STRLEN len, const U32 flags,
388 HV *typestash, HV *ourstash)
394 PERL_ARGS_ASSERT_PAD_ADD_NAME;
396 if (flags & ~(pad_add_OUR|pad_add_STATE|pad_add_NO_DUP_CHECK))
397 Perl_croak(aTHX_ "panic: pad_add_name illegal flag bits 0x%" UVxf,
401 if ((flags & pad_add_NO_DUP_CHECK) == 0) {
402 /* check for duplicate declaration */
403 pad_check_dup(name, len, flags & pad_add_OUR, ourstash);
406 namesv = newSV_type((ourstash || typestash) ? SVt_PVMG : SVt_PVNV);
408 /* Until we're using the length for real, cross check that we're being told
410 PERL_UNUSED_ARG(len);
411 assert(strlen(name) == len);
413 sv_setpv(namesv, name);
415 offset = pad_add_name_sv(namesv, flags, typestash, ourstash);
417 /* not yet introduced */
418 COP_SEQ_RANGE_LOW_set(namesv, PAD_MAX); /* min */
419 COP_SEQ_RANGE_HIGH_set(namesv, 0); /* max */
421 if (!PL_min_intro_pending)
422 PL_min_intro_pending = offset;
423 PL_max_intro_pending = offset;
424 /* if it's not a simple scalar, replace with an AV or HV */
425 /* XXX DAPM since slot has been allocated, replace
426 * av_store with PL_curpad[offset] ? */
428 av_store(PL_comppad, offset, MUTABLE_SV(newAV()));
429 else if (*name == '%')
430 av_store(PL_comppad, offset, MUTABLE_SV(newHV()));
431 SvPADMY_on(PL_curpad[offset]);
432 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
433 "Pad addname: %ld \"%s\" new lex=0x%"UVxf"\n",
434 (long)offset, name, PTR2UV(PL_curpad[offset])));
443 =for apidoc pad_alloc
445 Allocate a new my or tmp pad entry. For a my, simply push a null SV onto
446 the end of PL_comppad, but for a tmp, scan the pad from PL_padix upwards
447 for a slot which has no name and no active value.
452 /* XXX DAPM integrate alloc(), add_name() and add_anon(),
453 * or at least rationalise ??? */
454 /* And flag whether the incoming name is UTF8 or 8 bit?
455 Could do this either with the +ve/-ve hack of the HV code, or expanding
456 the flag bits. Either way, this makes proper Unicode safe pad support.
461 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
467 PERL_UNUSED_ARG(optype);
468 ASSERT_CURPAD_ACTIVE("pad_alloc");
470 if (AvARRAY(PL_comppad) != PL_curpad)
471 Perl_croak(aTHX_ "panic: pad_alloc");
472 if (PL_pad_reset_pending)
474 if (tmptype & SVs_PADMY) {
475 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
476 retval = AvFILLp(PL_comppad);
479 SV * const * const names = AvARRAY(PL_comppad_name);
480 const SSize_t names_fill = AvFILLp(PL_comppad_name);
483 * "foreach" index vars temporarily become aliases to non-"my"
484 * values. Thus we must skip, not just pad values that are
485 * marked as current pad values, but also those with names.
487 /* HVDS why copy to sv here? we don't seem to use it */
488 if (++PL_padix <= names_fill &&
489 (sv = names[PL_padix]) && sv != &PL_sv_undef)
491 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
492 if (!(SvFLAGS(sv) & (SVs_PADTMP | SVs_PADMY)) &&
493 !IS_PADGV(sv) && !IS_PADCONST(sv))
498 SvFLAGS(sv) |= tmptype;
499 PL_curpad = AvARRAY(PL_comppad);
501 DEBUG_X(PerlIO_printf(Perl_debug_log,
502 "Pad 0x%"UVxf"[0x%"UVxf"] alloc: %ld for %s\n",
503 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long) retval,
504 PL_op_name[optype]));
505 #ifdef DEBUG_LEAKING_SCALARS
506 sv->sv_debug_optype = optype;
507 sv->sv_debug_inpad = 1;
509 return (PADOFFSET)retval;
513 =for apidoc pad_add_anon
515 Add an anon code entry to the current compiling pad
521 Perl_pad_add_anon(pTHX_ SV* sv, OPCODE op_type)
525 SV* const name = newSV_type(SVt_PVNV);
527 PERL_ARGS_ASSERT_PAD_ADD_ANON;
530 sv_setpvs(name, "&");
531 /* Are these two actually ever read? */
532 COP_SEQ_RANGE_HIGH_set(name, ~0);
533 COP_SEQ_RANGE_LOW_set(name, 1);
534 ix = pad_alloc(op_type, SVs_PADMY);
535 av_store(PL_comppad_name, ix, name);
536 /* XXX DAPM use PL_curpad[] ? */
537 av_store(PL_comppad, ix, sv);
540 /* to avoid ref loops, we never have parent + child referencing each
541 * other simultaneously */
542 if (CvOUTSIDE((const CV *)sv)) {
543 assert(!CvWEAKOUTSIDE((const CV *)sv));
544 CvWEAKOUTSIDE_on(MUTABLE_CV(sv));
545 SvREFCNT_dec(CvOUTSIDE(MUTABLE_CV(sv)));
553 =for apidoc pad_check_dup
555 Check for duplicate declarations: report any of:
556 * a my in the current scope with the same name;
557 * an our (anywhere in the pad) with the same name and the same stash
559 C<is_our> indicates that the name to check is an 'our' declaration
565 S_pad_check_dup(pTHX_ const char *name, const STRLEN len, const U32 flags,
571 const U32 is_our = flags & pad_add_OUR;
573 PERL_ARGS_ASSERT_PAD_CHECK_DUP;
575 ASSERT_CURPAD_ACTIVE("pad_check_dup");
577 assert((flags & ~pad_add_OUR) == 0);
579 /* Until we're using the length for real, cross check that we're being told
581 PERL_UNUSED_ARG(len);
582 assert(strlen(name) == len);
584 if (AvFILLp(PL_comppad_name) < 0 || !ckWARN(WARN_MISC))
585 return; /* nothing to check */
587 svp = AvARRAY(PL_comppad_name);
588 top = AvFILLp(PL_comppad_name);
589 /* check the current scope */
590 /* XXX DAPM - why the (I32) cast - shouldn't we ensure they're the same
592 for (off = top; (I32)off > PL_comppad_name_floor; off--) {
593 SV * const sv = svp[off];
595 && sv != &PL_sv_undef
597 && (COP_SEQ_RANGE_HIGH(sv) == PAD_MAX || COP_SEQ_RANGE_HIGH(sv) == 0)
598 && strEQ(name, SvPVX_const(sv)))
600 if (is_our && (SvPAD_OUR(sv)))
601 break; /* "our" masking "our" */
602 Perl_warner(aTHX_ packWARN(WARN_MISC),
603 "\"%s\" variable %"SVf" masks earlier declaration in same %s",
604 (is_our ? "our" : PL_parser->in_my == KEY_my ? "my" : "state"),
606 (COP_SEQ_RANGE_HIGH(sv) == PAD_MAX ? "scope" : "statement"));
611 /* check the rest of the pad */
614 SV * const sv = svp[off];
616 && sv != &PL_sv_undef
618 && (COP_SEQ_RANGE_HIGH(sv) == PAD_MAX || COP_SEQ_RANGE_HIGH(sv) == 0)
619 && SvOURSTASH(sv) == ourstash
620 && strEQ(name, SvPVX_const(sv)))
622 Perl_warner(aTHX_ packWARN(WARN_MISC),
623 "\"our\" variable %"SVf" redeclared", sv);
624 if ((I32)off <= PL_comppad_name_floor)
625 Perl_warner(aTHX_ packWARN(WARN_MISC),
626 "\t(Did you mean \"local\" instead of \"our\"?)\n");
629 } while ( off-- > 0 );
635 =for apidoc pad_findmy
637 Given a lexical name, try to find its offset, first in the current pad,
638 or failing that, in the pads of any lexically enclosing subs (including
639 the complications introduced by eval). If the name is found in an outer pad,
640 then a fake entry is added to the current pad.
641 Returns the offset in the current pad, or NOT_IN_PAD on failure.
647 Perl_pad_findmy(pTHX_ const char *name, STRLEN len, U32 flags)
656 PERL_ARGS_ASSERT_PAD_FINDMY;
658 pad_peg("pad_findmy");
661 Perl_croak(aTHX_ "panic: pad_findmy illegal flag bits 0x%" UVxf,
664 /* Yes, it is a bug (read work in progress) that we're not really using this
665 length parameter, and instead relying on strlen() later on. But I'm not
666 comfortable about changing the pad API piecemeal to use and rely on
667 lengths. This only exists to avoid an "unused parameter" warning. */
671 /* But until we're using the length for real, cross check that we're being
673 assert(strlen(name) == len);
675 offset = pad_findlex(name, PL_compcv, PL_cop_seqmax, 1,
676 NULL, &out_sv, &out_flags);
677 if ((PADOFFSET)offset != NOT_IN_PAD)
680 /* look for an our that's being introduced; this allows
681 * our $foo = 0 unless defined $foo;
682 * to not give a warning. (Yes, this is a hack) */
684 nameav = MUTABLE_AV(AvARRAY(CvPADLIST(PL_compcv))[0]);
685 name_svp = AvARRAY(nameav);
686 for (offset = AvFILLp(nameav); offset > 0; offset--) {
687 const SV * const namesv = name_svp[offset];
688 if (namesv && namesv != &PL_sv_undef
690 && (SvPAD_OUR(namesv))
691 && strEQ(SvPVX_const(namesv), name)
692 && COP_SEQ_RANGE_LOW(namesv) == PAD_MAX /* min */
700 * Returns the offset of a lexical $_, if there is one, at run time.
701 * Used by the UNDERBAR XS macro.
705 Perl_find_rundefsvoffset(pTHX)
710 return pad_findlex("$_", find_runcv(NULL), PL_curcop->cop_seq, 1,
711 NULL, &out_sv, &out_flags);
715 =for apidoc pad_findlex
717 Find a named lexical anywhere in a chain of nested pads. Add fake entries
718 in the inner pads if it's found in an outer one.
720 Returns the offset in the bottom pad of the lex or the fake lex.
721 cv is the CV in which to start the search, and seq is the current cop_seq
722 to match against. If warn is true, print appropriate warnings. The out_*
723 vars return values, and so are pointers to where the returned values
724 should be stored. out_capture, if non-null, requests that the innermost
725 instance of the lexical is captured; out_name_sv is set to the innermost
726 matched namesv or fake namesv; out_flags returns the flags normally
727 associated with the IVX field of a fake namesv.
729 Note that pad_findlex() is recursive; it recurses up the chain of CVs,
730 then comes back down, adding fake entries as it goes. It has to be this way
731 because fake namesvs in anon protoypes have to store in xlow the index into
737 /* the CV has finished being compiled. This is not a sufficient test for
738 * all CVs (eg XSUBs), but suffices for the CVs found in a lexical chain */
739 #define CvCOMPILED(cv) CvROOT(cv)
741 /* the CV does late binding of its lexicals */
742 #define CvLATE(cv) (CvANON(cv) || SvTYPE(cv) == SVt_PVFM)
746 S_pad_findlex(pTHX_ const char *name, const CV* cv, U32 seq, int warn,
747 SV** out_capture, SV** out_name_sv, int *out_flags)
750 I32 offset, new_offset;
753 const AV * const padlist = CvPADLIST(cv);
755 PERL_ARGS_ASSERT_PAD_FINDLEX;
759 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
760 "Pad findlex cv=0x%"UVxf" searching \"%s\" seq=%d%s\n",
761 PTR2UV(cv), name, (int)seq, out_capture ? " capturing" : "" ));
763 /* first, search this pad */
765 if (padlist) { /* not an undef CV */
767 const AV * const nameav = MUTABLE_AV(AvARRAY(padlist)[0]);
768 SV * const * const name_svp = AvARRAY(nameav);
770 for (offset = AvFILLp(nameav); offset > 0; offset--) {
771 const SV * const namesv = name_svp[offset];
772 if (namesv && namesv != &PL_sv_undef
773 && strEQ(SvPVX_const(namesv), name))
776 fake_offset = offset; /* in case we don't find a real one */
777 else if ( seq > COP_SEQ_RANGE_LOW(namesv) /* min */
778 && seq <= COP_SEQ_RANGE_HIGH(namesv)) /* max */
783 if (offset > 0 || fake_offset > 0 ) { /* a match! */
784 if (offset > 0) { /* not fake */
786 *out_name_sv = name_svp[offset]; /* return the namesv */
788 /* set PAD_FAKELEX_MULTI if this lex can have multiple
789 * instances. For now, we just test !CvUNIQUE(cv), but
790 * ideally, we should detect my's declared within loops
791 * etc - this would allow a wider range of 'not stayed
792 * shared' warnings. We also treated alreadly-compiled
793 * lexes as not multi as viewed from evals. */
795 *out_flags = CvANON(cv) ?
797 (!CvUNIQUE(cv) && ! CvCOMPILED(cv))
798 ? PAD_FAKELEX_MULTI : 0;
800 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
801 "Pad findlex cv=0x%"UVxf" matched: offset=%ld (%lu,%lu)\n",
802 PTR2UV(cv), (long)offset,
803 (unsigned long)COP_SEQ_RANGE_LOW(*out_name_sv),
804 (unsigned long)COP_SEQ_RANGE_HIGH(*out_name_sv)));
806 else { /* fake match */
807 offset = fake_offset;
808 *out_name_sv = name_svp[offset]; /* return the namesv */
809 *out_flags = PARENT_FAKELEX_FLAGS(*out_name_sv);
810 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
811 "Pad findlex cv=0x%"UVxf" matched: offset=%ld flags=0x%lx index=%lu\n",
812 PTR2UV(cv), (long)offset, (unsigned long)*out_flags,
813 (unsigned long) PARENT_PAD_INDEX(*out_name_sv)
817 /* return the lex? */
822 if (SvPAD_OUR(*out_name_sv)) {
827 /* trying to capture from an anon prototype? */
829 ? CvANON(cv) && CvCLONE(cv) && !CvCLONED(cv)
830 : *out_flags & PAD_FAKELEX_ANON)
833 Perl_ck_warner(aTHX_ packWARN(WARN_CLOSURE),
834 "Variable \"%s\" is not available", name);
841 if (!CvCOMPILED(cv) && (*out_flags & PAD_FAKELEX_MULTI)
842 && !SvPAD_STATE(name_svp[offset])
843 && warn && ckWARN(WARN_CLOSURE)) {
845 Perl_warner(aTHX_ packWARN(WARN_CLOSURE),
846 "Variable \"%s\" will not stay shared", name);
849 if (fake_offset && CvANON(cv)
850 && CvCLONE(cv) &&!CvCLONED(cv))
853 /* not yet caught - look further up */
854 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
855 "Pad findlex cv=0x%"UVxf" chasing lex in outer pad\n",
858 (void) pad_findlex(name, CvOUTSIDE(cv),
860 newwarn, out_capture, out_name_sv, out_flags);
865 *out_capture = AvARRAY(MUTABLE_AV(AvARRAY(padlist)[
866 CvDEPTH(cv) ? CvDEPTH(cv) : 1]))[offset];
867 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
868 "Pad findlex cv=0x%"UVxf" found lex=0x%"UVxf"\n",
869 PTR2UV(cv), PTR2UV(*out_capture)));
871 if (SvPADSTALE(*out_capture)
872 && !SvPAD_STATE(name_svp[offset]))
874 Perl_ck_warner(aTHX_ packWARN(WARN_CLOSURE),
875 "Variable \"%s\" is not available", name);
881 *out_capture = sv_2mortal(MUTABLE_SV(newAV()));
882 else if (*name == '%')
883 *out_capture = sv_2mortal(MUTABLE_SV(newHV()));
885 *out_capture = sv_newmortal();
893 /* it's not in this pad - try above */
898 /* out_capture non-null means caller wants us to capture lex; in
899 * addition we capture ourselves unless it's an ANON/format */
900 new_capturep = out_capture ? out_capture :
901 CvLATE(cv) ? NULL : &new_capture;
903 offset = pad_findlex(name, CvOUTSIDE(cv), CvOUTSIDE_SEQ(cv), 1,
904 new_capturep, out_name_sv, out_flags);
905 if ((PADOFFSET)offset == NOT_IN_PAD)
908 /* found in an outer CV. Add appropriate fake entry to this pad */
910 /* don't add new fake entries (via eval) to CVs that we have already
911 * finished compiling, or to undef CVs */
912 if (CvCOMPILED(cv) || !padlist)
913 return 0; /* this dummy (and invalid) value isnt used by the caller */
916 /* This relies on sv_setsv_flags() upgrading the destination to the same
917 type as the source, independant of the flags set, and on it being
918 "good" and only copying flag bits and pointers that it understands.
920 SV *new_namesv = newSVsv(*out_name_sv);
921 AV * const ocomppad_name = PL_comppad_name;
922 PAD * const ocomppad = PL_comppad;
923 PL_comppad_name = MUTABLE_AV(AvARRAY(padlist)[0]);
924 PL_comppad = MUTABLE_AV(AvARRAY(padlist)[1]);
925 PL_curpad = AvARRAY(PL_comppad);
928 = pad_add_name_sv(new_namesv,
929 (SvPAD_STATE(*out_name_sv) ? pad_add_STATE : 0),
930 SvPAD_TYPED(*out_name_sv)
931 ? SvSTASH(*out_name_sv) : NULL,
932 SvOURSTASH(*out_name_sv)
935 SvFAKE_on(new_namesv);
936 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
937 "Pad addname: %ld \"%.*s\" FAKE\n",
939 (int) SvCUR(new_namesv), SvPVX(new_namesv)));
940 PARENT_FAKELEX_FLAGS_set(new_namesv, *out_flags);
942 PARENT_PAD_INDEX_set(new_namesv, 0);
943 if (SvPAD_OUR(new_namesv)) {
944 NOOP; /* do nothing */
946 else if (CvLATE(cv)) {
947 /* delayed creation - just note the offset within parent pad */
948 PARENT_PAD_INDEX_set(new_namesv, offset);
952 /* immediate creation - capture outer value right now */
953 av_store(PL_comppad, new_offset, SvREFCNT_inc(*new_capturep));
954 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
955 "Pad findlex cv=0x%"UVxf" saved captured sv 0x%"UVxf" at offset %ld\n",
956 PTR2UV(cv), PTR2UV(*new_capturep), (long)new_offset));
958 *out_name_sv = new_namesv;
959 *out_flags = PARENT_FAKELEX_FLAGS(new_namesv);
961 PL_comppad_name = ocomppad_name;
962 PL_comppad = ocomppad;
963 PL_curpad = ocomppad ? AvARRAY(ocomppad) : NULL;
973 Get the value at offset po in the current pad.
974 Use macro PAD_SV instead of calling this function directly.
981 Perl_pad_sv(pTHX_ PADOFFSET po)
984 ASSERT_CURPAD_ACTIVE("pad_sv");
987 Perl_croak(aTHX_ "panic: pad_sv po");
988 DEBUG_X(PerlIO_printf(Perl_debug_log,
989 "Pad 0x%"UVxf"[0x%"UVxf"] sv: %ld sv=0x%"UVxf"\n",
990 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long)po, PTR2UV(PL_curpad[po]))
992 return PL_curpad[po];
997 =for apidoc pad_setsv
999 Set the entry at offset po in the current pad to sv.
1000 Use the macro PAD_SETSV() rather than calling this function directly.
1006 Perl_pad_setsv(pTHX_ PADOFFSET po, SV* sv)
1010 PERL_ARGS_ASSERT_PAD_SETSV;
1012 ASSERT_CURPAD_ACTIVE("pad_setsv");
1014 DEBUG_X(PerlIO_printf(Perl_debug_log,
1015 "Pad 0x%"UVxf"[0x%"UVxf"] setsv: %ld sv=0x%"UVxf"\n",
1016 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long)po, PTR2UV(sv))
1025 =for apidoc pad_block_start
1027 Update the pad compilation state variables on entry to a new block
1032 /* XXX DAPM perhaps:
1033 * - integrate this in general state-saving routine ???
1034 * - combine with the state-saving going on in pad_new ???
1035 * - introduce a new SAVE type that does all this in one go ?
1039 Perl_pad_block_start(pTHX_ int full)
1042 ASSERT_CURPAD_ACTIVE("pad_block_start");
1043 SAVEI32(PL_comppad_name_floor);
1044 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
1046 PL_comppad_name_fill = PL_comppad_name_floor;
1047 if (PL_comppad_name_floor < 0)
1048 PL_comppad_name_floor = 0;
1049 SAVEI32(PL_min_intro_pending);
1050 SAVEI32(PL_max_intro_pending);
1051 PL_min_intro_pending = 0;
1052 SAVEI32(PL_comppad_name_fill);
1053 SAVEI32(PL_padix_floor);
1054 PL_padix_floor = PL_padix;
1055 PL_pad_reset_pending = FALSE;
1060 =for apidoc intro_my
1062 "Introduce" my variables to visible status.
1074 ASSERT_CURPAD_ACTIVE("intro_my");
1075 if (! PL_min_intro_pending)
1076 return PL_cop_seqmax;
1078 svp = AvARRAY(PL_comppad_name);
1079 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
1080 SV * const sv = svp[i];
1082 if (sv && sv != &PL_sv_undef && !SvFAKE(sv) && !COP_SEQ_RANGE_HIGH(sv)) {
1083 COP_SEQ_RANGE_HIGH_set(sv, PAD_MAX); /* Don't know scope end yet. */
1084 COP_SEQ_RANGE_LOW_set(sv, PL_cop_seqmax);
1085 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1086 "Pad intromy: %ld \"%s\", (%lu,%lu)\n",
1087 (long)i, SvPVX_const(sv),
1088 (unsigned long)COP_SEQ_RANGE_LOW(sv),
1089 (unsigned long)COP_SEQ_RANGE_HIGH(sv))
1093 PL_min_intro_pending = 0;
1094 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
1095 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1096 "Pad intromy: seq -> %ld\n", (long)(PL_cop_seqmax+1)));
1098 return PL_cop_seqmax++;
1102 =for apidoc pad_leavemy
1104 Cleanup at end of scope during compilation: set the max seq number for
1105 lexicals in this scope and warn of any lexicals that never got introduced.
1111 Perl_pad_leavemy(pTHX)
1115 SV * const * const svp = AvARRAY(PL_comppad_name);
1117 PL_pad_reset_pending = FALSE;
1119 ASSERT_CURPAD_ACTIVE("pad_leavemy");
1120 if (PL_min_intro_pending && PL_comppad_name_fill < PL_min_intro_pending) {
1121 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
1122 const SV * const sv = svp[off];
1123 if (sv && sv != &PL_sv_undef && !SvFAKE(sv))
1124 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL),
1125 "%"SVf" never introduced",
1129 /* "Deintroduce" my variables that are leaving with this scope. */
1130 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_fill; off--) {
1131 const SV * const sv = svp[off];
1132 if (sv && sv != &PL_sv_undef && !SvFAKE(sv) && COP_SEQ_RANGE_HIGH(sv) == PAD_MAX) {
1133 COP_SEQ_RANGE_HIGH_set(sv, PL_cop_seqmax);
1134 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1135 "Pad leavemy: %ld \"%s\", (%lu,%lu)\n",
1136 (long)off, SvPVX_const(sv),
1137 (unsigned long)COP_SEQ_RANGE_LOW(sv),
1138 (unsigned long)COP_SEQ_RANGE_HIGH(sv))
1143 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1144 "Pad leavemy: seq = %ld\n", (long)PL_cop_seqmax));
1149 =for apidoc pad_swipe
1151 Abandon the tmp in the current pad at offset po and replace with a
1158 Perl_pad_swipe(pTHX_ PADOFFSET po, bool refadjust)
1161 ASSERT_CURPAD_LEGAL("pad_swipe");
1164 if (AvARRAY(PL_comppad) != PL_curpad)
1165 Perl_croak(aTHX_ "panic: pad_swipe curpad");
1167 Perl_croak(aTHX_ "panic: pad_swipe po");
1169 DEBUG_X(PerlIO_printf(Perl_debug_log,
1170 "Pad 0x%"UVxf"[0x%"UVxf"] swipe: %ld\n",
1171 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long)po));
1174 SvPADTMP_off(PL_curpad[po]);
1176 SvREFCNT_dec(PL_curpad[po]);
1179 /* if pad tmps aren't shared between ops, then there's no need to
1180 * create a new tmp when an existing op is freed */
1181 #ifdef USE_BROKEN_PAD_RESET
1182 PL_curpad[po] = newSV(0);
1183 SvPADTMP_on(PL_curpad[po]);
1185 PL_curpad[po] = &PL_sv_undef;
1187 if ((I32)po < PL_padix)
1193 =for apidoc pad_reset
1195 Mark all the current temporaries for reuse
1200 /* XXX pad_reset() is currently disabled because it results in serious bugs.
1201 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
1202 * on the stack by OPs that use them, there are several ways to get an alias
1203 * to a shared TARG. Such an alias will change randomly and unpredictably.
1204 * We avoid doing this until we can think of a Better Way.
1210 #ifdef USE_BROKEN_PAD_RESET
1211 if (AvARRAY(PL_comppad) != PL_curpad)
1212 Perl_croak(aTHX_ "panic: pad_reset curpad");
1214 DEBUG_X(PerlIO_printf(Perl_debug_log,
1215 "Pad 0x%"UVxf"[0x%"UVxf"] reset: padix %ld -> %ld",
1216 PTR2UV(PL_comppad), PTR2UV(PL_curpad),
1217 (long)PL_padix, (long)PL_padix_floor
1221 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
1223 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
1224 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
1225 SvPADTMP_off(PL_curpad[po]);
1227 PL_padix = PL_padix_floor;
1230 PL_pad_reset_pending = FALSE;
1235 =for apidoc pad_tidy
1237 Tidy up a pad after we've finished compiling it:
1238 * remove most stuff from the pads of anonsub prototypes;
1240 * mark tmps as such.
1245 /* XXX DAPM surely most of this stuff should be done properly
1246 * at the right time beforehand, rather than going around afterwards
1247 * cleaning up our mistakes ???
1251 Perl_pad_tidy(pTHX_ padtidy_type type)
1255 ASSERT_CURPAD_ACTIVE("pad_tidy");
1257 /* If this CV has had any 'eval-capable' ops planted in it
1258 * (ie it contains eval '...', //ee, /$var/ or /(?{..})/), Then any
1259 * anon prototypes in the chain of CVs should be marked as cloneable,
1260 * so that for example the eval's CV in C<< sub { eval '$x' } >> gets
1261 * the right CvOUTSIDE.
1262 * If running with -d, *any* sub may potentially have an eval
1263 * excuted within it.
1266 if (PL_cv_has_eval || PL_perldb) {
1268 for (cv = PL_compcv ;cv; cv = CvOUTSIDE(cv)) {
1269 if (cv != PL_compcv && CvCOMPILED(cv))
1270 break; /* no need to mark already-compiled code */
1272 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1273 "Pad clone on cv=0x%"UVxf"\n", PTR2UV(cv)));
1279 /* extend curpad to match namepad */
1280 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
1281 av_store(PL_comppad_name, AvFILLp(PL_comppad), NULL);
1283 if (type == padtidy_SUBCLONE) {
1284 SV * const * const namep = AvARRAY(PL_comppad_name);
1287 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
1290 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
1293 * The only things that a clonable function needs in its
1294 * pad are anonymous subs.
1295 * The rest are created anew during cloning.
1297 if (!((namesv = namep[ix]) != NULL &&
1298 namesv != &PL_sv_undef &&
1299 *SvPVX_const(namesv) == '&'))
1301 SvREFCNT_dec(PL_curpad[ix]);
1302 PL_curpad[ix] = NULL;
1306 else if (type == padtidy_SUB) {
1307 /* XXX DAPM this same bit of code keeps appearing !!! Rationalise? */
1308 AV * const av = newAV(); /* Will be @_ */
1310 av_store(PL_comppad, 0, MUTABLE_SV(av));
1314 /* XXX DAPM rationalise these two similar branches */
1316 if (type == padtidy_SUB) {
1318 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
1319 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
1321 if (!SvPADMY(PL_curpad[ix]))
1322 SvPADTMP_on(PL_curpad[ix]);
1325 else if (type == padtidy_FORMAT) {
1327 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
1328 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
1329 SvPADTMP_on(PL_curpad[ix]);
1332 PL_curpad = AvARRAY(PL_comppad);
1337 =for apidoc pad_free
1339 Free the SV at offset po in the current pad.
1344 /* XXX DAPM integrate with pad_swipe ???? */
1346 Perl_pad_free(pTHX_ PADOFFSET po)
1349 ASSERT_CURPAD_LEGAL("pad_free");
1352 if (AvARRAY(PL_comppad) != PL_curpad)
1353 Perl_croak(aTHX_ "panic: pad_free curpad");
1355 Perl_croak(aTHX_ "panic: pad_free po");
1357 DEBUG_X(PerlIO_printf(Perl_debug_log,
1358 "Pad 0x%"UVxf"[0x%"UVxf"] free: %ld\n",
1359 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long)po)
1362 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef) {
1363 SvPADTMP_off(PL_curpad[po]);
1365 /* SV could be a shared hash key (eg bugid #19022) */
1366 if (!SvIsCOW(PL_curpad[po]))
1367 SvREADONLY_off(PL_curpad[po]); /* could be a freed constant */
1370 if ((I32)po < PL_padix)
1377 =for apidoc do_dump_pad
1379 Dump the contents of a padlist
1385 Perl_do_dump_pad(pTHX_ I32 level, PerlIO *file, PADLIST *padlist, int full)
1394 PERL_ARGS_ASSERT_DO_DUMP_PAD;
1399 pad_name = MUTABLE_AV(*av_fetch(MUTABLE_AV(padlist), 0, FALSE));
1400 pad = MUTABLE_AV(*av_fetch(MUTABLE_AV(padlist), 1, FALSE));
1401 pname = AvARRAY(pad_name);
1402 ppad = AvARRAY(pad);
1403 Perl_dump_indent(aTHX_ level, file,
1404 "PADNAME = 0x%"UVxf"(0x%"UVxf") PAD = 0x%"UVxf"(0x%"UVxf")\n",
1405 PTR2UV(pad_name), PTR2UV(pname), PTR2UV(pad), PTR2UV(ppad)
1408 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
1409 const SV *namesv = pname[ix];
1410 if (namesv && namesv == &PL_sv_undef) {
1415 Perl_dump_indent(aTHX_ level+1, file,
1416 "%2d. 0x%"UVxf"<%lu> FAKE \"%s\" flags=0x%lx index=%lu\n",
1419 (unsigned long) (ppad[ix] ? SvREFCNT(ppad[ix]) : 0),
1420 SvPVX_const(namesv),
1421 (unsigned long)PARENT_FAKELEX_FLAGS(namesv),
1422 (unsigned long)PARENT_PAD_INDEX(namesv)
1426 Perl_dump_indent(aTHX_ level+1, file,
1427 "%2d. 0x%"UVxf"<%lu> (%lu,%lu) \"%s\"\n",
1430 (unsigned long) (ppad[ix] ? SvREFCNT(ppad[ix]) : 0),
1431 (unsigned long)COP_SEQ_RANGE_LOW(namesv),
1432 (unsigned long)COP_SEQ_RANGE_HIGH(namesv),
1437 Perl_dump_indent(aTHX_ level+1, file,
1438 "%2d. 0x%"UVxf"<%lu>\n",
1441 (unsigned long) (ppad[ix] ? SvREFCNT(ppad[ix]) : 0)
1452 dump the contents of a CV
1459 S_cv_dump(pTHX_ const CV *cv, const char *title)
1462 const CV * const outside = CvOUTSIDE(cv);
1463 AV* const padlist = CvPADLIST(cv);
1465 PERL_ARGS_ASSERT_CV_DUMP;
1467 PerlIO_printf(Perl_debug_log,
1468 " %s: CV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
1471 (CvANON(cv) ? "ANON"
1472 : (SvTYPE(cv) == SVt_PVFM) ? "FORMAT"
1473 : (cv == PL_main_cv) ? "MAIN"
1474 : CvUNIQUE(cv) ? "UNIQUE"
1475 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
1478 : CvANON(outside) ? "ANON"
1479 : (outside == PL_main_cv) ? "MAIN"
1480 : CvUNIQUE(outside) ? "UNIQUE"
1481 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
1483 PerlIO_printf(Perl_debug_log,
1484 " PADLIST = 0x%"UVxf"\n", PTR2UV(padlist));
1485 do_dump_pad(1, Perl_debug_log, padlist, 1);
1487 #endif /* DEBUGGING */
1494 =for apidoc cv_clone
1496 Clone a CV: make a new CV which points to the same code etc, but which
1497 has a newly-created pad built by copying the prototype pad and capturing
1504 Perl_cv_clone(pTHX_ CV *proto)
1508 AV* const protopadlist = CvPADLIST(proto);
1509 const AV *const protopad_name = (const AV *)*av_fetch(protopadlist, 0, FALSE);
1510 const AV *const protopad = (const AV *)*av_fetch(protopadlist, 1, FALSE);
1511 SV** const pname = AvARRAY(protopad_name);
1512 SV** const ppad = AvARRAY(protopad);
1513 const I32 fname = AvFILLp(protopad_name);
1514 const I32 fpad = AvFILLp(protopad);
1520 PERL_ARGS_ASSERT_CV_CLONE;
1522 assert(!CvUNIQUE(proto));
1524 /* Since cloneable anon subs can be nested, CvOUTSIDE may point
1525 * to a prototype; we instead want the cloned parent who called us.
1526 * Note that in general for formats, CvOUTSIDE != find_runcv */
1528 outside = CvOUTSIDE(proto);
1529 if (outside && CvCLONE(outside) && ! CvCLONED(outside))
1530 outside = find_runcv(NULL);
1531 depth = CvDEPTH(outside);
1532 assert(depth || SvTYPE(proto) == SVt_PVFM);
1535 assert(CvPADLIST(outside));
1538 SAVESPTR(PL_compcv);
1540 cv = PL_compcv = MUTABLE_CV(newSV_type(SvTYPE(proto)));
1541 CvFLAGS(cv) = CvFLAGS(proto) & ~(CVf_CLONE|CVf_WEAKOUTSIDE);
1545 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto)
1546 : savepv(CvFILE(proto));
1548 CvFILE(cv) = CvFILE(proto);
1550 CvGV(cv) = CvGV(proto);
1551 CvSTASH(cv) = CvSTASH(proto);
1553 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1555 CvSTART(cv) = CvSTART(proto);
1556 CvOUTSIDE(cv) = MUTABLE_CV(SvREFCNT_inc_simple(outside));
1557 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1560 sv_setpvn(MUTABLE_SV(cv), SvPVX_const(proto), SvCUR(proto));
1562 CvPADLIST(cv) = pad_new(padnew_CLONE|padnew_SAVE);
1564 av_fill(PL_comppad, fpad);
1565 for (ix = fname; ix >= 0; ix--)
1566 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
1568 PL_curpad = AvARRAY(PL_comppad);
1570 outpad = AvARRAY(AvARRAY(CvPADLIST(outside))[depth]);
1572 for (ix = fpad; ix > 0; ix--) {
1573 SV* const namesv = (ix <= fname) ? pname[ix] : NULL;
1575 if (namesv && namesv != &PL_sv_undef) { /* lexical */
1576 if (SvFAKE(namesv)) { /* lexical from outside? */
1577 sv = outpad[PARENT_PAD_INDEX(namesv)];
1579 /* formats may have an inactive parent,
1580 while my $x if $false can leave an active var marked as
1581 stale. And state vars are always available */
1582 if (SvPADSTALE(sv) && !SvPAD_STATE(namesv)) {
1583 Perl_ck_warner(aTHX_ packWARN(WARN_CLOSURE),
1584 "Variable \"%s\" is not available", SvPVX_const(namesv));
1588 SvREFCNT_inc_simple_void_NN(sv);
1591 const char sigil = SvPVX_const(namesv)[0];
1593 sv = SvREFCNT_inc(ppad[ix]);
1594 else if (sigil == '@')
1595 sv = MUTABLE_SV(newAV());
1596 else if (sigil == '%')
1597 sv = MUTABLE_SV(newHV());
1601 /* reset the 'assign only once' flag on each state var */
1602 if (SvPAD_STATE(namesv))
1606 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
1607 sv = SvREFCNT_inc_NN(ppad[ix]);
1617 PerlIO_printf(Perl_debug_log, "\nPad CV clone\n");
1618 cv_dump(outside, "Outside");
1619 cv_dump(proto, "Proto");
1626 /* Constant sub () { $x } closing over $x - see lib/constant.pm:
1627 * The prototype was marked as a candiate for const-ization,
1628 * so try to grab the current const value, and if successful,
1629 * turn into a const sub:
1631 SV* const const_sv = op_const_sv(CvSTART(cv), cv);
1634 cv = newCONSTSUB(CvSTASH(proto), NULL, const_sv);
1646 =for apidoc pad_fixup_inner_anons
1648 For any anon CVs in the pad, change CvOUTSIDE of that CV from
1649 old_cv to new_cv if necessary. Needed when a newly-compiled CV has to be
1650 moved to a pre-existing CV struct.
1656 Perl_pad_fixup_inner_anons(pTHX_ PADLIST *padlist, CV *old_cv, CV *new_cv)
1660 AV * const comppad_name = MUTABLE_AV(AvARRAY(padlist)[0]);
1661 AV * const comppad = MUTABLE_AV(AvARRAY(padlist)[1]);
1662 SV ** const namepad = AvARRAY(comppad_name);
1663 SV ** const curpad = AvARRAY(comppad);
1665 PERL_ARGS_ASSERT_PAD_FIXUP_INNER_ANONS;
1666 PERL_UNUSED_ARG(old_cv);
1668 for (ix = AvFILLp(comppad_name); ix > 0; ix--) {
1669 const SV * const namesv = namepad[ix];
1670 if (namesv && namesv != &PL_sv_undef
1671 && *SvPVX_const(namesv) == '&')
1673 CV * const innercv = MUTABLE_CV(curpad[ix]);
1674 assert(CvWEAKOUTSIDE(innercv));
1675 assert(CvOUTSIDE(innercv) == old_cv);
1676 CvOUTSIDE(innercv) = new_cv;
1683 =for apidoc pad_push
1685 Push a new pad frame onto the padlist, unless there's already a pad at
1686 this depth, in which case don't bother creating a new one. Then give
1687 the new pad an @_ in slot zero.
1693 Perl_pad_push(pTHX_ PADLIST *padlist, int depth)
1697 PERL_ARGS_ASSERT_PAD_PUSH;
1699 if (depth > AvFILLp(padlist)) {
1700 SV** const svp = AvARRAY(padlist);
1701 AV* const newpad = newAV();
1702 SV** const oldpad = AvARRAY(svp[depth-1]);
1703 I32 ix = AvFILLp((const AV *)svp[1]);
1704 const I32 names_fill = AvFILLp((const AV *)svp[0]);
1705 SV** const names = AvARRAY(svp[0]);
1708 for ( ;ix > 0; ix--) {
1709 if (names_fill >= ix && names[ix] != &PL_sv_undef) {
1710 const char sigil = SvPVX_const(names[ix])[0];
1711 if ((SvFLAGS(names[ix]) & SVf_FAKE)
1712 || (SvFLAGS(names[ix]) & SVpad_STATE)
1715 /* outer lexical or anon code */
1716 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
1718 else { /* our own lexical */
1721 sv = MUTABLE_SV(newAV());
1722 else if (sigil == '%')
1723 sv = MUTABLE_SV(newHV());
1726 av_store(newpad, ix, sv);
1730 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
1731 av_store(newpad, ix, SvREFCNT_inc_NN(oldpad[ix]));
1734 /* save temporaries on recursion? */
1735 SV * const sv = newSV(0);
1736 av_store(newpad, ix, sv);
1742 av_store(newpad, 0, MUTABLE_SV(av));
1745 av_store(padlist, depth, MUTABLE_SV(newpad));
1746 AvFILLp(padlist) = depth;
1752 Perl_pad_compname_type(pTHX_ const PADOFFSET po)
1755 SV* const * const av = av_fetch(PL_comppad_name, po, FALSE);
1756 if ( SvPAD_TYPED(*av) ) {
1757 return SvSTASH(*av);
1764 * c-indentation-style: bsd
1766 * indent-tabs-mode: t
1769 * ex: set ts=8 sts=4 sw=4 noet: