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 =for apidoc pad_add_name
345 Create a new name and associated PADMY SV in the current pad; return the
347 If C<typestash> is valid, the name is for a typed lexical; set the
348 name's stash to that value.
349 If C<ourstash> is valid, it's an our lexical, set the name's
350 SvOURSTASH to that value
352 If fake, it means we're cloning an existing entry
358 Perl_pad_add_name(pTHX_ const char *name, HV* typestash, HV* ourstash, bool fake, bool state)
361 const PADOFFSET offset = pad_alloc(OP_PADSV, SVs_PADMY);
363 = newSV_type((ourstash || typestash) ? SVt_PVMG : SVt_PVNV);
365 PERL_ARGS_ASSERT_PAD_ADD_NAME;
367 ASSERT_CURPAD_ACTIVE("pad_add_name");
369 sv_setpv(namesv, name);
372 assert(SvTYPE(namesv) == SVt_PVMG);
373 SvPAD_TYPED_on(namesv);
374 SvSTASH_set(namesv, MUTABLE_HV(SvREFCNT_inc_simple_NN(MUTABLE_SV(typestash))));
377 SvPAD_OUR_on(namesv);
378 SvOURSTASH_set(namesv, ourstash);
379 SvREFCNT_inc_simple_void_NN(ourstash);
382 SvPAD_STATE_on(namesv);
385 av_store(PL_comppad_name, offset, namesv);
388 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
389 "Pad addname: %ld \"%s\" FAKE\n", (long)offset, name));
392 /* not yet introduced */
393 COP_SEQ_RANGE_LOW_set(namesv, PAD_MAX); /* min */
394 COP_SEQ_RANGE_HIGH_set(namesv, 0); /* max */
396 if (!PL_min_intro_pending)
397 PL_min_intro_pending = offset;
398 PL_max_intro_pending = offset;
399 /* if it's not a simple scalar, replace with an AV or HV */
400 /* XXX DAPM since slot has been allocated, replace
401 * av_store with PL_curpad[offset] ? */
403 av_store(PL_comppad, offset, MUTABLE_SV(newAV()));
404 else if (*name == '%')
405 av_store(PL_comppad, offset, MUTABLE_SV(newHV()));
406 SvPADMY_on(PL_curpad[offset]);
407 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
408 "Pad addname: %ld \"%s\" new lex=0x%"UVxf"\n",
409 (long)offset, name, PTR2UV(PL_curpad[offset])));
419 =for apidoc pad_alloc
421 Allocate a new my or tmp pad entry. For a my, simply push a null SV onto
422 the end of PL_comppad, but for a tmp, scan the pad from PL_padix upwards
423 for a slot which has no name and no active value.
428 /* XXX DAPM integrate alloc(), add_name() and add_anon(),
429 * or at least rationalise ??? */
430 /* And flag whether the incoming name is UTF8 or 8 bit?
431 Could do this either with the +ve/-ve hack of the HV code, or expanding
432 the flag bits. Either way, this makes proper Unicode safe pad support.
437 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
443 PERL_UNUSED_ARG(optype);
444 ASSERT_CURPAD_ACTIVE("pad_alloc");
446 if (AvARRAY(PL_comppad) != PL_curpad)
447 Perl_croak(aTHX_ "panic: pad_alloc");
448 if (PL_pad_reset_pending)
450 if (tmptype & SVs_PADMY) {
451 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
452 retval = AvFILLp(PL_comppad);
455 SV * const * const names = AvARRAY(PL_comppad_name);
456 const SSize_t names_fill = AvFILLp(PL_comppad_name);
459 * "foreach" index vars temporarily become aliases to non-"my"
460 * values. Thus we must skip, not just pad values that are
461 * marked as current pad values, but also those with names.
463 /* HVDS why copy to sv here? we don't seem to use it */
464 if (++PL_padix <= names_fill &&
465 (sv = names[PL_padix]) && sv != &PL_sv_undef)
467 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
468 if (!(SvFLAGS(sv) & (SVs_PADTMP | SVs_PADMY)) &&
469 !IS_PADGV(sv) && !IS_PADCONST(sv))
474 SvFLAGS(sv) |= tmptype;
475 PL_curpad = AvARRAY(PL_comppad);
477 DEBUG_X(PerlIO_printf(Perl_debug_log,
478 "Pad 0x%"UVxf"[0x%"UVxf"] alloc: %ld for %s\n",
479 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long) retval,
480 PL_op_name[optype]));
481 #ifdef DEBUG_LEAKING_SCALARS
482 sv->sv_debug_optype = optype;
483 sv->sv_debug_inpad = 1;
485 return (PADOFFSET)retval;
489 =for apidoc pad_add_anon
491 Add an anon code entry to the current compiling pad
497 Perl_pad_add_anon(pTHX_ SV* sv, OPCODE op_type)
501 SV* const name = newSV_type(SVt_PVNV);
503 PERL_ARGS_ASSERT_PAD_ADD_ANON;
506 sv_setpvs(name, "&");
507 /* Are these two actually ever read? */
508 COP_SEQ_RANGE_HIGH_set(name, ~0);
509 COP_SEQ_RANGE_LOW_set(name, 1);
510 ix = pad_alloc(op_type, SVs_PADMY);
511 av_store(PL_comppad_name, ix, name);
512 /* XXX DAPM use PL_curpad[] ? */
513 av_store(PL_comppad, ix, sv);
516 /* to avoid ref loops, we never have parent + child referencing each
517 * other simultaneously */
518 if (CvOUTSIDE((const CV *)sv)) {
519 assert(!CvWEAKOUTSIDE((const CV *)sv));
520 CvWEAKOUTSIDE_on(MUTABLE_CV(sv));
521 SvREFCNT_dec(CvOUTSIDE(MUTABLE_CV(sv)));
529 =for apidoc pad_check_dup
531 Check for duplicate declarations: report any of:
532 * a my in the current scope with the same name;
533 * an our (anywhere in the pad) with the same name and the same stash
535 C<is_our> indicates that the name to check is an 'our' declaration
540 /* XXX DAPM integrate this into pad_add_name ??? */
543 Perl_pad_check_dup(pTHX_ const char *name, const STRLEN len, const U32 flags,
549 const U32 is_our = flags & pad_add_OUR;
551 PERL_ARGS_ASSERT_PAD_CHECK_DUP;
553 ASSERT_CURPAD_ACTIVE("pad_check_dup");
555 if (flags & ~pad_add_OUR)
556 Perl_croak(aTHX_ "panic: pad_check_dup illegal flag bits 0x%" UVxf,
559 /* Until we're using the length for real, cross check that we're being told
561 PERL_UNUSED_ARG(len);
562 assert(strlen(name) == len);
564 if (AvFILLp(PL_comppad_name) < 0 || !ckWARN(WARN_MISC))
565 return; /* nothing to check */
567 svp = AvARRAY(PL_comppad_name);
568 top = AvFILLp(PL_comppad_name);
569 /* check the current scope */
570 /* XXX DAPM - why the (I32) cast - shouldn't we ensure they're the same
572 for (off = top; (I32)off > PL_comppad_name_floor; off--) {
573 SV * const sv = svp[off];
575 && sv != &PL_sv_undef
577 && (COP_SEQ_RANGE_HIGH(sv) == PAD_MAX || COP_SEQ_RANGE_HIGH(sv) == 0)
578 && strEQ(name, SvPVX_const(sv)))
580 if (is_our && (SvPAD_OUR(sv)))
581 break; /* "our" masking "our" */
582 Perl_warner(aTHX_ packWARN(WARN_MISC),
583 "\"%s\" variable %"SVf" masks earlier declaration in same %s",
584 (is_our ? "our" : PL_parser->in_my == KEY_my ? "my" : "state"),
586 (COP_SEQ_RANGE_HIGH(sv) == PAD_MAX ? "scope" : "statement"));
591 /* check the rest of the pad */
594 SV * const sv = svp[off];
596 && sv != &PL_sv_undef
598 && (COP_SEQ_RANGE_HIGH(sv) == PAD_MAX || COP_SEQ_RANGE_HIGH(sv) == 0)
599 && SvOURSTASH(sv) == ourstash
600 && strEQ(name, SvPVX_const(sv)))
602 Perl_warner(aTHX_ packWARN(WARN_MISC),
603 "\"our\" variable %"SVf" redeclared", sv);
604 if ((I32)off <= PL_comppad_name_floor)
605 Perl_warner(aTHX_ packWARN(WARN_MISC),
606 "\t(Did you mean \"local\" instead of \"our\"?)\n");
609 } while ( off-- > 0 );
615 =for apidoc pad_findmy
617 Given a lexical name, try to find its offset, first in the current pad,
618 or failing that, in the pads of any lexically enclosing subs (including
619 the complications introduced by eval). If the name is found in an outer pad,
620 then a fake entry is added to the current pad.
621 Returns the offset in the current pad, or NOT_IN_PAD on failure.
627 Perl_pad_findmy(pTHX_ const char *name, STRLEN len, U32 flags)
636 PERL_ARGS_ASSERT_PAD_FINDMY;
638 pad_peg("pad_findmy");
641 Perl_croak(aTHX_ "panic: pad_findmy illegal flag bits 0x%" UVxf,
644 /* Yes, it is a bug (read work in progress) that we're not really using this
645 length parameter, and instead relying on strlen() later on. But I'm not
646 comfortable about changing the pad API piecemeal to use and rely on
647 lengths. This only exists to avoid an "unused parameter" warning. */
651 /* But until we're using the length for real, cross check that we're being
653 assert(strlen(name) == len);
655 offset = pad_findlex(name, PL_compcv, PL_cop_seqmax, 1,
656 NULL, &out_sv, &out_flags);
657 if ((PADOFFSET)offset != NOT_IN_PAD)
660 /* look for an our that's being introduced; this allows
661 * our $foo = 0 unless defined $foo;
662 * to not give a warning. (Yes, this is a hack) */
664 nameav = MUTABLE_AV(AvARRAY(CvPADLIST(PL_compcv))[0]);
665 name_svp = AvARRAY(nameav);
666 for (offset = AvFILLp(nameav); offset > 0; offset--) {
667 const SV * const namesv = name_svp[offset];
668 if (namesv && namesv != &PL_sv_undef
670 && (SvPAD_OUR(namesv))
671 && strEQ(SvPVX_const(namesv), name)
672 && COP_SEQ_RANGE_LOW(namesv) == PAD_MAX /* min */
680 * Returns the offset of a lexical $_, if there is one, at run time.
681 * Used by the UNDERBAR XS macro.
685 Perl_find_rundefsvoffset(pTHX)
690 return pad_findlex("$_", find_runcv(NULL), PL_curcop->cop_seq, 1,
691 NULL, &out_sv, &out_flags);
695 =for apidoc pad_findlex
697 Find a named lexical anywhere in a chain of nested pads. Add fake entries
698 in the inner pads if it's found in an outer one.
700 Returns the offset in the bottom pad of the lex or the fake lex.
701 cv is the CV in which to start the search, and seq is the current cop_seq
702 to match against. If warn is true, print appropriate warnings. The out_*
703 vars return values, and so are pointers to where the returned values
704 should be stored. out_capture, if non-null, requests that the innermost
705 instance of the lexical is captured; out_name_sv is set to the innermost
706 matched namesv or fake namesv; out_flags returns the flags normally
707 associated with the IVX field of a fake namesv.
709 Note that pad_findlex() is recursive; it recurses up the chain of CVs,
710 then comes back down, adding fake entries as it goes. It has to be this way
711 because fake namesvs in anon protoypes have to store in xlow the index into
717 /* the CV has finished being compiled. This is not a sufficient test for
718 * all CVs (eg XSUBs), but suffices for the CVs found in a lexical chain */
719 #define CvCOMPILED(cv) CvROOT(cv)
721 /* the CV does late binding of its lexicals */
722 #define CvLATE(cv) (CvANON(cv) || SvTYPE(cv) == SVt_PVFM)
726 S_pad_findlex(pTHX_ const char *name, const CV* cv, U32 seq, int warn,
727 SV** out_capture, SV** out_name_sv, int *out_flags)
730 I32 offset, new_offset;
733 const AV * const padlist = CvPADLIST(cv);
735 PERL_ARGS_ASSERT_PAD_FINDLEX;
739 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
740 "Pad findlex cv=0x%"UVxf" searching \"%s\" seq=%d%s\n",
741 PTR2UV(cv), name, (int)seq, out_capture ? " capturing" : "" ));
743 /* first, search this pad */
745 if (padlist) { /* not an undef CV */
747 const AV * const nameav = MUTABLE_AV(AvARRAY(padlist)[0]);
748 SV * const * const name_svp = AvARRAY(nameav);
750 for (offset = AvFILLp(nameav); offset > 0; offset--) {
751 const SV * const namesv = name_svp[offset];
752 if (namesv && namesv != &PL_sv_undef
753 && strEQ(SvPVX_const(namesv), name))
756 fake_offset = offset; /* in case we don't find a real one */
757 else if ( seq > COP_SEQ_RANGE_LOW(namesv) /* min */
758 && seq <= COP_SEQ_RANGE_HIGH(namesv)) /* max */
763 if (offset > 0 || fake_offset > 0 ) { /* a match! */
764 if (offset > 0) { /* not fake */
766 *out_name_sv = name_svp[offset]; /* return the namesv */
768 /* set PAD_FAKELEX_MULTI if this lex can have multiple
769 * instances. For now, we just test !CvUNIQUE(cv), but
770 * ideally, we should detect my's declared within loops
771 * etc - this would allow a wider range of 'not stayed
772 * shared' warnings. We also treated alreadly-compiled
773 * lexes as not multi as viewed from evals. */
775 *out_flags = CvANON(cv) ?
777 (!CvUNIQUE(cv) && ! CvCOMPILED(cv))
778 ? PAD_FAKELEX_MULTI : 0;
780 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
781 "Pad findlex cv=0x%"UVxf" matched: offset=%ld (%lu,%lu)\n",
782 PTR2UV(cv), (long)offset,
783 (unsigned long)COP_SEQ_RANGE_LOW(*out_name_sv),
784 (unsigned long)COP_SEQ_RANGE_HIGH(*out_name_sv)));
786 else { /* fake match */
787 offset = fake_offset;
788 *out_name_sv = name_svp[offset]; /* return the namesv */
789 *out_flags = PARENT_FAKELEX_FLAGS(*out_name_sv);
790 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
791 "Pad findlex cv=0x%"UVxf" matched: offset=%ld flags=0x%lx index=%lu\n",
792 PTR2UV(cv), (long)offset, (unsigned long)*out_flags,
793 (unsigned long) PARENT_PAD_INDEX(*out_name_sv)
797 /* return the lex? */
802 if (SvPAD_OUR(*out_name_sv)) {
807 /* trying to capture from an anon prototype? */
809 ? CvANON(cv) && CvCLONE(cv) && !CvCLONED(cv)
810 : *out_flags & PAD_FAKELEX_ANON)
813 Perl_ck_warner(aTHX_ packWARN(WARN_CLOSURE),
814 "Variable \"%s\" is not available", name);
821 if (!CvCOMPILED(cv) && (*out_flags & PAD_FAKELEX_MULTI)
822 && !SvPAD_STATE(name_svp[offset])
823 && warn && ckWARN(WARN_CLOSURE)) {
825 Perl_warner(aTHX_ packWARN(WARN_CLOSURE),
826 "Variable \"%s\" will not stay shared", name);
829 if (fake_offset && CvANON(cv)
830 && CvCLONE(cv) &&!CvCLONED(cv))
833 /* not yet caught - look further up */
834 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
835 "Pad findlex cv=0x%"UVxf" chasing lex in outer pad\n",
838 (void) pad_findlex(name, CvOUTSIDE(cv),
840 newwarn, out_capture, out_name_sv, out_flags);
845 *out_capture = AvARRAY(MUTABLE_AV(AvARRAY(padlist)[
846 CvDEPTH(cv) ? CvDEPTH(cv) : 1]))[offset];
847 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
848 "Pad findlex cv=0x%"UVxf" found lex=0x%"UVxf"\n",
849 PTR2UV(cv), PTR2UV(*out_capture)));
851 if (SvPADSTALE(*out_capture)
852 && !SvPAD_STATE(name_svp[offset]))
854 Perl_ck_warner(aTHX_ packWARN(WARN_CLOSURE),
855 "Variable \"%s\" is not available", name);
861 *out_capture = sv_2mortal(MUTABLE_SV(newAV()));
862 else if (*name == '%')
863 *out_capture = sv_2mortal(MUTABLE_SV(newHV()));
865 *out_capture = sv_newmortal();
873 /* it's not in this pad - try above */
878 /* out_capture non-null means caller wants us to capture lex; in
879 * addition we capture ourselves unless it's an ANON/format */
880 new_capturep = out_capture ? out_capture :
881 CvLATE(cv) ? NULL : &new_capture;
883 offset = pad_findlex(name, CvOUTSIDE(cv), CvOUTSIDE_SEQ(cv), 1,
884 new_capturep, out_name_sv, out_flags);
885 if ((PADOFFSET)offset == NOT_IN_PAD)
888 /* found in an outer CV. Add appropriate fake entry to this pad */
890 /* don't add new fake entries (via eval) to CVs that we have already
891 * finished compiling, or to undef CVs */
892 if (CvCOMPILED(cv) || !padlist)
893 return 0; /* this dummy (and invalid) value isnt used by the caller */
897 AV * const ocomppad_name = PL_comppad_name;
898 PAD * const ocomppad = PL_comppad;
899 PL_comppad_name = MUTABLE_AV(AvARRAY(padlist)[0]);
900 PL_comppad = MUTABLE_AV(AvARRAY(padlist)[1]);
901 PL_curpad = AvARRAY(PL_comppad);
903 new_offset = pad_add_name(
904 SvPVX_const(*out_name_sv),
905 SvPAD_TYPED(*out_name_sv)
906 ? SvSTASH(*out_name_sv) : NULL,
907 SvOURSTASH(*out_name_sv),
909 SvPAD_STATE(*out_name_sv) ? 1 : 0 /* state variable ? */
912 new_namesv = AvARRAY(PL_comppad_name)[new_offset];
913 PARENT_FAKELEX_FLAGS_set(new_namesv, *out_flags);
915 PARENT_PAD_INDEX_set(new_namesv, 0);
916 if (SvPAD_OUR(new_namesv)) {
917 NOOP; /* do nothing */
919 else if (CvLATE(cv)) {
920 /* delayed creation - just note the offset within parent pad */
921 PARENT_PAD_INDEX_set(new_namesv, offset);
925 /* immediate creation - capture outer value right now */
926 av_store(PL_comppad, new_offset, SvREFCNT_inc(*new_capturep));
927 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
928 "Pad findlex cv=0x%"UVxf" saved captured sv 0x%"UVxf" at offset %ld\n",
929 PTR2UV(cv), PTR2UV(*new_capturep), (long)new_offset));
931 *out_name_sv = new_namesv;
932 *out_flags = PARENT_FAKELEX_FLAGS(new_namesv);
934 PL_comppad_name = ocomppad_name;
935 PL_comppad = ocomppad;
936 PL_curpad = ocomppad ? AvARRAY(ocomppad) : NULL;
946 Get the value at offset po in the current pad.
947 Use macro PAD_SV instead of calling this function directly.
954 Perl_pad_sv(pTHX_ PADOFFSET po)
957 ASSERT_CURPAD_ACTIVE("pad_sv");
960 Perl_croak(aTHX_ "panic: pad_sv po");
961 DEBUG_X(PerlIO_printf(Perl_debug_log,
962 "Pad 0x%"UVxf"[0x%"UVxf"] sv: %ld sv=0x%"UVxf"\n",
963 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long)po, PTR2UV(PL_curpad[po]))
965 return PL_curpad[po];
970 =for apidoc pad_setsv
972 Set the entry at offset po in the current pad to sv.
973 Use the macro PAD_SETSV() rather than calling this function directly.
979 Perl_pad_setsv(pTHX_ PADOFFSET po, SV* sv)
983 PERL_ARGS_ASSERT_PAD_SETSV;
985 ASSERT_CURPAD_ACTIVE("pad_setsv");
987 DEBUG_X(PerlIO_printf(Perl_debug_log,
988 "Pad 0x%"UVxf"[0x%"UVxf"] setsv: %ld sv=0x%"UVxf"\n",
989 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long)po, PTR2UV(sv))
998 =for apidoc pad_block_start
1000 Update the pad compilation state variables on entry to a new block
1005 /* XXX DAPM perhaps:
1006 * - integrate this in general state-saving routine ???
1007 * - combine with the state-saving going on in pad_new ???
1008 * - introduce a new SAVE type that does all this in one go ?
1012 Perl_pad_block_start(pTHX_ int full)
1015 ASSERT_CURPAD_ACTIVE("pad_block_start");
1016 SAVEI32(PL_comppad_name_floor);
1017 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
1019 PL_comppad_name_fill = PL_comppad_name_floor;
1020 if (PL_comppad_name_floor < 0)
1021 PL_comppad_name_floor = 0;
1022 SAVEI32(PL_min_intro_pending);
1023 SAVEI32(PL_max_intro_pending);
1024 PL_min_intro_pending = 0;
1025 SAVEI32(PL_comppad_name_fill);
1026 SAVEI32(PL_padix_floor);
1027 PL_padix_floor = PL_padix;
1028 PL_pad_reset_pending = FALSE;
1033 =for apidoc intro_my
1035 "Introduce" my variables to visible status.
1047 ASSERT_CURPAD_ACTIVE("intro_my");
1048 if (! PL_min_intro_pending)
1049 return PL_cop_seqmax;
1051 svp = AvARRAY(PL_comppad_name);
1052 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
1053 SV * const sv = svp[i];
1055 if (sv && sv != &PL_sv_undef && !SvFAKE(sv) && !COP_SEQ_RANGE_HIGH(sv)) {
1056 COP_SEQ_RANGE_HIGH_set(sv, PAD_MAX); /* Don't know scope end yet. */
1057 COP_SEQ_RANGE_LOW_set(sv, PL_cop_seqmax);
1058 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1059 "Pad intromy: %ld \"%s\", (%lu,%lu)\n",
1060 (long)i, SvPVX_const(sv),
1061 (unsigned long)COP_SEQ_RANGE_LOW(sv),
1062 (unsigned long)COP_SEQ_RANGE_HIGH(sv))
1066 PL_min_intro_pending = 0;
1067 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
1068 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1069 "Pad intromy: seq -> %ld\n", (long)(PL_cop_seqmax+1)));
1071 return PL_cop_seqmax++;
1075 =for apidoc pad_leavemy
1077 Cleanup at end of scope during compilation: set the max seq number for
1078 lexicals in this scope and warn of any lexicals that never got introduced.
1084 Perl_pad_leavemy(pTHX)
1088 SV * const * const svp = AvARRAY(PL_comppad_name);
1090 PL_pad_reset_pending = FALSE;
1092 ASSERT_CURPAD_ACTIVE("pad_leavemy");
1093 if (PL_min_intro_pending && PL_comppad_name_fill < PL_min_intro_pending) {
1094 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
1095 const SV * const sv = svp[off];
1096 if (sv && sv != &PL_sv_undef && !SvFAKE(sv))
1097 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL),
1098 "%"SVf" never introduced",
1102 /* "Deintroduce" my variables that are leaving with this scope. */
1103 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_fill; off--) {
1104 const SV * const sv = svp[off];
1105 if (sv && sv != &PL_sv_undef && !SvFAKE(sv) && COP_SEQ_RANGE_HIGH(sv) == PAD_MAX) {
1106 COP_SEQ_RANGE_HIGH_set(sv, PL_cop_seqmax);
1107 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1108 "Pad leavemy: %ld \"%s\", (%lu,%lu)\n",
1109 (long)off, SvPVX_const(sv),
1110 (unsigned long)COP_SEQ_RANGE_LOW(sv),
1111 (unsigned long)COP_SEQ_RANGE_HIGH(sv))
1116 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1117 "Pad leavemy: seq = %ld\n", (long)PL_cop_seqmax));
1122 =for apidoc pad_swipe
1124 Abandon the tmp in the current pad at offset po and replace with a
1131 Perl_pad_swipe(pTHX_ PADOFFSET po, bool refadjust)
1134 ASSERT_CURPAD_LEGAL("pad_swipe");
1137 if (AvARRAY(PL_comppad) != PL_curpad)
1138 Perl_croak(aTHX_ "panic: pad_swipe curpad");
1140 Perl_croak(aTHX_ "panic: pad_swipe po");
1142 DEBUG_X(PerlIO_printf(Perl_debug_log,
1143 "Pad 0x%"UVxf"[0x%"UVxf"] swipe: %ld\n",
1144 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long)po));
1147 SvPADTMP_off(PL_curpad[po]);
1149 SvREFCNT_dec(PL_curpad[po]);
1152 /* if pad tmps aren't shared between ops, then there's no need to
1153 * create a new tmp when an existing op is freed */
1154 #ifdef USE_BROKEN_PAD_RESET
1155 PL_curpad[po] = newSV(0);
1156 SvPADTMP_on(PL_curpad[po]);
1158 PL_curpad[po] = &PL_sv_undef;
1160 if ((I32)po < PL_padix)
1166 =for apidoc pad_reset
1168 Mark all the current temporaries for reuse
1173 /* XXX pad_reset() is currently disabled because it results in serious bugs.
1174 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
1175 * on the stack by OPs that use them, there are several ways to get an alias
1176 * to a shared TARG. Such an alias will change randomly and unpredictably.
1177 * We avoid doing this until we can think of a Better Way.
1183 #ifdef USE_BROKEN_PAD_RESET
1184 if (AvARRAY(PL_comppad) != PL_curpad)
1185 Perl_croak(aTHX_ "panic: pad_reset curpad");
1187 DEBUG_X(PerlIO_printf(Perl_debug_log,
1188 "Pad 0x%"UVxf"[0x%"UVxf"] reset: padix %ld -> %ld",
1189 PTR2UV(PL_comppad), PTR2UV(PL_curpad),
1190 (long)PL_padix, (long)PL_padix_floor
1194 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
1196 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
1197 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
1198 SvPADTMP_off(PL_curpad[po]);
1200 PL_padix = PL_padix_floor;
1203 PL_pad_reset_pending = FALSE;
1208 =for apidoc pad_tidy
1210 Tidy up a pad after we've finished compiling it:
1211 * remove most stuff from the pads of anonsub prototypes;
1213 * mark tmps as such.
1218 /* XXX DAPM surely most of this stuff should be done properly
1219 * at the right time beforehand, rather than going around afterwards
1220 * cleaning up our mistakes ???
1224 Perl_pad_tidy(pTHX_ padtidy_type type)
1228 ASSERT_CURPAD_ACTIVE("pad_tidy");
1230 /* If this CV has had any 'eval-capable' ops planted in it
1231 * (ie it contains eval '...', //ee, /$var/ or /(?{..})/), Then any
1232 * anon prototypes in the chain of CVs should be marked as cloneable,
1233 * so that for example the eval's CV in C<< sub { eval '$x' } >> gets
1234 * the right CvOUTSIDE.
1235 * If running with -d, *any* sub may potentially have an eval
1236 * excuted within it.
1239 if (PL_cv_has_eval || PL_perldb) {
1241 for (cv = PL_compcv ;cv; cv = CvOUTSIDE(cv)) {
1242 if (cv != PL_compcv && CvCOMPILED(cv))
1243 break; /* no need to mark already-compiled code */
1245 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1246 "Pad clone on cv=0x%"UVxf"\n", PTR2UV(cv)));
1252 /* extend curpad to match namepad */
1253 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
1254 av_store(PL_comppad_name, AvFILLp(PL_comppad), NULL);
1256 if (type == padtidy_SUBCLONE) {
1257 SV * const * const namep = AvARRAY(PL_comppad_name);
1260 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
1263 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
1266 * The only things that a clonable function needs in its
1267 * pad are anonymous subs.
1268 * The rest are created anew during cloning.
1270 if (!((namesv = namep[ix]) != NULL &&
1271 namesv != &PL_sv_undef &&
1272 *SvPVX_const(namesv) == '&'))
1274 SvREFCNT_dec(PL_curpad[ix]);
1275 PL_curpad[ix] = NULL;
1279 else if (type == padtidy_SUB) {
1280 /* XXX DAPM this same bit of code keeps appearing !!! Rationalise? */
1281 AV * const av = newAV(); /* Will be @_ */
1283 av_store(PL_comppad, 0, MUTABLE_SV(av));
1287 /* XXX DAPM rationalise these two similar branches */
1289 if (type == padtidy_SUB) {
1291 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
1292 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
1294 if (!SvPADMY(PL_curpad[ix]))
1295 SvPADTMP_on(PL_curpad[ix]);
1298 else if (type == padtidy_FORMAT) {
1300 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
1301 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
1302 SvPADTMP_on(PL_curpad[ix]);
1305 PL_curpad = AvARRAY(PL_comppad);
1310 =for apidoc pad_free
1312 Free the SV at offset po in the current pad.
1317 /* XXX DAPM integrate with pad_swipe ???? */
1319 Perl_pad_free(pTHX_ PADOFFSET po)
1322 ASSERT_CURPAD_LEGAL("pad_free");
1325 if (AvARRAY(PL_comppad) != PL_curpad)
1326 Perl_croak(aTHX_ "panic: pad_free curpad");
1328 Perl_croak(aTHX_ "panic: pad_free po");
1330 DEBUG_X(PerlIO_printf(Perl_debug_log,
1331 "Pad 0x%"UVxf"[0x%"UVxf"] free: %ld\n",
1332 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long)po)
1335 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef) {
1336 SvPADTMP_off(PL_curpad[po]);
1338 /* SV could be a shared hash key (eg bugid #19022) */
1339 if (!SvIsCOW(PL_curpad[po]))
1340 SvREADONLY_off(PL_curpad[po]); /* could be a freed constant */
1343 if ((I32)po < PL_padix)
1350 =for apidoc do_dump_pad
1352 Dump the contents of a padlist
1358 Perl_do_dump_pad(pTHX_ I32 level, PerlIO *file, PADLIST *padlist, int full)
1367 PERL_ARGS_ASSERT_DO_DUMP_PAD;
1372 pad_name = MUTABLE_AV(*av_fetch(MUTABLE_AV(padlist), 0, FALSE));
1373 pad = MUTABLE_AV(*av_fetch(MUTABLE_AV(padlist), 1, FALSE));
1374 pname = AvARRAY(pad_name);
1375 ppad = AvARRAY(pad);
1376 Perl_dump_indent(aTHX_ level, file,
1377 "PADNAME = 0x%"UVxf"(0x%"UVxf") PAD = 0x%"UVxf"(0x%"UVxf")\n",
1378 PTR2UV(pad_name), PTR2UV(pname), PTR2UV(pad), PTR2UV(ppad)
1381 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
1382 const SV *namesv = pname[ix];
1383 if (namesv && namesv == &PL_sv_undef) {
1388 Perl_dump_indent(aTHX_ level+1, file,
1389 "%2d. 0x%"UVxf"<%lu> FAKE \"%s\" flags=0x%lx index=%lu\n",
1392 (unsigned long) (ppad[ix] ? SvREFCNT(ppad[ix]) : 0),
1393 SvPVX_const(namesv),
1394 (unsigned long)PARENT_FAKELEX_FLAGS(namesv),
1395 (unsigned long)PARENT_PAD_INDEX(namesv)
1399 Perl_dump_indent(aTHX_ level+1, file,
1400 "%2d. 0x%"UVxf"<%lu> (%lu,%lu) \"%s\"\n",
1403 (unsigned long) (ppad[ix] ? SvREFCNT(ppad[ix]) : 0),
1404 (unsigned long)COP_SEQ_RANGE_LOW(namesv),
1405 (unsigned long)COP_SEQ_RANGE_HIGH(namesv),
1410 Perl_dump_indent(aTHX_ level+1, file,
1411 "%2d. 0x%"UVxf"<%lu>\n",
1414 (unsigned long) (ppad[ix] ? SvREFCNT(ppad[ix]) : 0)
1425 dump the contents of a CV
1432 S_cv_dump(pTHX_ const CV *cv, const char *title)
1435 const CV * const outside = CvOUTSIDE(cv);
1436 AV* const padlist = CvPADLIST(cv);
1438 PERL_ARGS_ASSERT_CV_DUMP;
1440 PerlIO_printf(Perl_debug_log,
1441 " %s: CV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
1444 (CvANON(cv) ? "ANON"
1445 : (SvTYPE(cv) == SVt_PVFM) ? "FORMAT"
1446 : (cv == PL_main_cv) ? "MAIN"
1447 : CvUNIQUE(cv) ? "UNIQUE"
1448 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
1451 : CvANON(outside) ? "ANON"
1452 : (outside == PL_main_cv) ? "MAIN"
1453 : CvUNIQUE(outside) ? "UNIQUE"
1454 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
1456 PerlIO_printf(Perl_debug_log,
1457 " PADLIST = 0x%"UVxf"\n", PTR2UV(padlist));
1458 do_dump_pad(1, Perl_debug_log, padlist, 1);
1460 #endif /* DEBUGGING */
1467 =for apidoc cv_clone
1469 Clone a CV: make a new CV which points to the same code etc, but which
1470 has a newly-created pad built by copying the prototype pad and capturing
1477 Perl_cv_clone(pTHX_ CV *proto)
1481 AV* const protopadlist = CvPADLIST(proto);
1482 const AV *const protopad_name = (const AV *)*av_fetch(protopadlist, 0, FALSE);
1483 const AV *const protopad = (const AV *)*av_fetch(protopadlist, 1, FALSE);
1484 SV** const pname = AvARRAY(protopad_name);
1485 SV** const ppad = AvARRAY(protopad);
1486 const I32 fname = AvFILLp(protopad_name);
1487 const I32 fpad = AvFILLp(protopad);
1493 PERL_ARGS_ASSERT_CV_CLONE;
1495 assert(!CvUNIQUE(proto));
1497 /* Since cloneable anon subs can be nested, CvOUTSIDE may point
1498 * to a prototype; we instead want the cloned parent who called us.
1499 * Note that in general for formats, CvOUTSIDE != find_runcv */
1501 outside = CvOUTSIDE(proto);
1502 if (outside && CvCLONE(outside) && ! CvCLONED(outside))
1503 outside = find_runcv(NULL);
1504 depth = CvDEPTH(outside);
1505 assert(depth || SvTYPE(proto) == SVt_PVFM);
1508 assert(CvPADLIST(outside));
1511 SAVESPTR(PL_compcv);
1513 cv = PL_compcv = MUTABLE_CV(newSV_type(SvTYPE(proto)));
1514 CvFLAGS(cv) = CvFLAGS(proto) & ~(CVf_CLONE|CVf_WEAKOUTSIDE);
1518 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto)
1519 : savepv(CvFILE(proto));
1521 CvFILE(cv) = CvFILE(proto);
1523 CvGV(cv) = CvGV(proto);
1524 CvSTASH(cv) = CvSTASH(proto);
1526 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1528 CvSTART(cv) = CvSTART(proto);
1529 CvOUTSIDE(cv) = MUTABLE_CV(SvREFCNT_inc_simple(outside));
1530 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1533 sv_setpvn(MUTABLE_SV(cv), SvPVX_const(proto), SvCUR(proto));
1535 CvPADLIST(cv) = pad_new(padnew_CLONE|padnew_SAVE);
1537 av_fill(PL_comppad, fpad);
1538 for (ix = fname; ix >= 0; ix--)
1539 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
1541 PL_curpad = AvARRAY(PL_comppad);
1543 outpad = AvARRAY(AvARRAY(CvPADLIST(outside))[depth]);
1545 for (ix = fpad; ix > 0; ix--) {
1546 SV* const namesv = (ix <= fname) ? pname[ix] : NULL;
1548 if (namesv && namesv != &PL_sv_undef) { /* lexical */
1549 if (SvFAKE(namesv)) { /* lexical from outside? */
1550 sv = outpad[PARENT_PAD_INDEX(namesv)];
1552 /* formats may have an inactive parent,
1553 while my $x if $false can leave an active var marked as
1554 stale. And state vars are always available */
1555 if (SvPADSTALE(sv) && !SvPAD_STATE(namesv)) {
1556 Perl_ck_warner(aTHX_ packWARN(WARN_CLOSURE),
1557 "Variable \"%s\" is not available", SvPVX_const(namesv));
1561 SvREFCNT_inc_simple_void_NN(sv);
1564 const char sigil = SvPVX_const(namesv)[0];
1566 sv = SvREFCNT_inc(ppad[ix]);
1567 else if (sigil == '@')
1568 sv = MUTABLE_SV(newAV());
1569 else if (sigil == '%')
1570 sv = MUTABLE_SV(newHV());
1574 /* reset the 'assign only once' flag on each state var */
1575 if (SvPAD_STATE(namesv))
1579 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
1580 sv = SvREFCNT_inc_NN(ppad[ix]);
1590 PerlIO_printf(Perl_debug_log, "\nPad CV clone\n");
1591 cv_dump(outside, "Outside");
1592 cv_dump(proto, "Proto");
1599 /* Constant sub () { $x } closing over $x - see lib/constant.pm:
1600 * The prototype was marked as a candiate for const-ization,
1601 * so try to grab the current const value, and if successful,
1602 * turn into a const sub:
1604 SV* const const_sv = op_const_sv(CvSTART(cv), cv);
1607 cv = newCONSTSUB(CvSTASH(proto), NULL, const_sv);
1619 =for apidoc pad_fixup_inner_anons
1621 For any anon CVs in the pad, change CvOUTSIDE of that CV from
1622 old_cv to new_cv if necessary. Needed when a newly-compiled CV has to be
1623 moved to a pre-existing CV struct.
1629 Perl_pad_fixup_inner_anons(pTHX_ PADLIST *padlist, CV *old_cv, CV *new_cv)
1633 AV * const comppad_name = MUTABLE_AV(AvARRAY(padlist)[0]);
1634 AV * const comppad = MUTABLE_AV(AvARRAY(padlist)[1]);
1635 SV ** const namepad = AvARRAY(comppad_name);
1636 SV ** const curpad = AvARRAY(comppad);
1638 PERL_ARGS_ASSERT_PAD_FIXUP_INNER_ANONS;
1639 PERL_UNUSED_ARG(old_cv);
1641 for (ix = AvFILLp(comppad_name); ix > 0; ix--) {
1642 const SV * const namesv = namepad[ix];
1643 if (namesv && namesv != &PL_sv_undef
1644 && *SvPVX_const(namesv) == '&')
1646 CV * const innercv = MUTABLE_CV(curpad[ix]);
1647 assert(CvWEAKOUTSIDE(innercv));
1648 assert(CvOUTSIDE(innercv) == old_cv);
1649 CvOUTSIDE(innercv) = new_cv;
1656 =for apidoc pad_push
1658 Push a new pad frame onto the padlist, unless there's already a pad at
1659 this depth, in which case don't bother creating a new one. Then give
1660 the new pad an @_ in slot zero.
1666 Perl_pad_push(pTHX_ PADLIST *padlist, int depth)
1670 PERL_ARGS_ASSERT_PAD_PUSH;
1672 if (depth > AvFILLp(padlist)) {
1673 SV** const svp = AvARRAY(padlist);
1674 AV* const newpad = newAV();
1675 SV** const oldpad = AvARRAY(svp[depth-1]);
1676 I32 ix = AvFILLp((const AV *)svp[1]);
1677 const I32 names_fill = AvFILLp((const AV *)svp[0]);
1678 SV** const names = AvARRAY(svp[0]);
1681 for ( ;ix > 0; ix--) {
1682 if (names_fill >= ix && names[ix] != &PL_sv_undef) {
1683 const char sigil = SvPVX_const(names[ix])[0];
1684 if ((SvFLAGS(names[ix]) & SVf_FAKE)
1685 || (SvFLAGS(names[ix]) & SVpad_STATE)
1688 /* outer lexical or anon code */
1689 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
1691 else { /* our own lexical */
1694 sv = MUTABLE_SV(newAV());
1695 else if (sigil == '%')
1696 sv = MUTABLE_SV(newHV());
1699 av_store(newpad, ix, sv);
1703 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
1704 av_store(newpad, ix, SvREFCNT_inc_NN(oldpad[ix]));
1707 /* save temporaries on recursion? */
1708 SV * const sv = newSV(0);
1709 av_store(newpad, ix, sv);
1715 av_store(newpad, 0, MUTABLE_SV(av));
1718 av_store(padlist, depth, MUTABLE_SV(newpad));
1719 AvFILLp(padlist) = depth;
1725 Perl_pad_compname_type(pTHX_ const PADOFFSET po)
1728 SV* const * const av = av_fetch(PL_comppad_name, po, FALSE);
1729 if ( SvPAD_TYPED(*av) ) {
1730 return SvSTASH(*av);
1737 * c-indentation-style: bsd
1739 * indent-tabs-mode: t
1742 * ex: set ts=8 sts=4 sw=4 noet: