3 * Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007 by Larry Wall and others
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
8 * "Anyway: there was this Mr Frodo left an orphan and stranded, as you
9 * might say, among those queer Bucklanders, being brought up anyhow in
10 * Brandy Hall. A regular warren, by all accounts. Old Master Gorbadoc
11 * never had fewer than a couple of hundred relations in the place. Mr
12 * Bilbo never did a kinder deed than when he brought the lad back to
13 * live among decent folk." --the Gaffer
17 * As of Sept 2002, this file is new and may be in a state of flux for
18 * a while. I've marked things I intent to come back and look at further
19 * with an 'XXX DAPM' comment.
23 =head1 Pad Data Structures
25 This file contains the functions that create and manipulate scratchpads,
26 which are array-of-array data structures attached to a CV (ie a sub)
27 and which store lexical variables and opcode temporary and per-thread
30 =for apidoc m|AV *|CvPADLIST|CV *cv
31 CV's can have CvPADLIST(cv) set to point to an AV.
33 For these purposes "forms" are a kind-of CV, eval""s are too (except they're
34 not callable at will and are always thrown away after the eval"" is done
35 executing). Require'd files are simply evals without any outer lexical
38 XSUBs don't have CvPADLIST set - dXSTARG fetches values from PL_curpad,
39 but that is really the callers pad (a slot of which is allocated by
42 The CvPADLIST AV has does not have AvREAL set, so REFCNT of component items
43 is managed "manual" (mostly in pad.c) rather than normal av.c rules.
44 The items in the AV are not SVs as for a normal AV, but other AVs:
46 0'th Entry of the CvPADLIST is an AV which represents the "names" or rather
47 the "static type information" for lexicals.
49 The CvDEPTH'th entry of CvPADLIST AV is an AV which is the stack frame at that
50 depth of recursion into the CV.
51 The 0'th slot of a frame AV is an AV which is @_.
52 other entries are storage for variables and op targets.
55 C<PL_comppad_name> is set to the names AV.
56 C<PL_comppad> is set to the frame AV for the frame CvDEPTH == 1.
57 C<PL_curpad> is set to the body of the frame AV (i.e. AvARRAY(PL_comppad)).
59 During execution, C<PL_comppad> and C<PL_curpad> refer to the live
60 frame of the currently executing sub.
62 Iterating over the names AV iterates over all possible pad
63 items. Pad slots that are SVs_PADTMP (targets/GVs/constants) end up having
64 &PL_sv_undef "names" (see pad_alloc()).
66 Only my/our variable (SVs_PADMY/SVs_PADOUR) slots get valid names.
67 The rest are op targets/GVs/constants which are statically allocated
68 or resolved at compile time. These don't have names by which they
69 can be looked up from Perl code at run time through eval"" like
70 my/our variables can be. Since they can't be looked up by "name"
71 but only by their index allocated at compile time (which is usually
72 in PL_op->op_targ), wasting a name SV for them doesn't make sense.
74 The SVs in the names AV have their PV being the name of the variable.
75 xlow+1..xhigh inclusive in the NV union is a range of cop_seq numbers for
76 which the name is valid. For typed lexicals name SV is SVt_PVMG and SvSTASH
77 points at the type. For C<our> lexicals, the type is also SVt_PVMG, with the
78 SvOURSTASH slot pointing at the stash of the associated global (so that
79 duplicate C<our> declarations in the same package can be detected). SvUVX is
80 sometimes hijacked to store the generation number during compilation.
82 If SvFAKE is set on the name SV, then that slot in the frame AV is
83 a REFCNT'ed reference to a lexical from "outside". In this case,
84 the name SV does not use xlow and xhigh to store a cop_seq range, since it is
85 in scope throughout. Instead xhigh stores some flags containing info about
86 the real lexical (is it declared in an anon, and is it capable of being
87 instantiated multiple times?), and for fake ANONs, xlow contains the index
88 within the parent's pad where the lexical's value is stored, to make
91 If the 'name' is '&' the corresponding entry in frame AV
92 is a CV representing a possible closure.
93 (SvFAKE and name of '&' is not a meaningful combination currently but could
94 become so if C<my sub foo {}> is implemented.)
96 Note that formats are treated as anon subs, and are cloned each time
97 write is called (if necessary).
99 The flag SVf_PADSTALE is cleared on lexicals each time the my() is executed,
100 and set on scope exit. This allows the 'Variable $x is not available' warning
101 to be generated in evals, such as
103 { my $x = 1; sub f { eval '$x'} } f();
110 #define PERL_IN_PAD_C
112 #include "keywords.h"
114 #define COP_SEQ_RANGE_LOW_set(sv,val) \
115 STMT_START { ((XPVNV*)SvANY(sv))->xnv_u.xpad_cop_seq.xlow = (val); } STMT_END
116 #define COP_SEQ_RANGE_HIGH_set(sv,val) \
117 STMT_START { ((XPVNV*)SvANY(sv))->xnv_u.xpad_cop_seq.xhigh = (val); } STMT_END
119 #define PARENT_PAD_INDEX_set(sv,val) \
120 STMT_START { ((XPVNV*)SvANY(sv))->xnv_u.xpad_cop_seq.xlow = (val); } STMT_END
121 #define PARENT_FAKELEX_FLAGS_set(sv,val) \
122 STMT_START { ((XPVNV*)SvANY(sv))->xnv_u.xpad_cop_seq.xhigh = (val); } STMT_END
124 #define PAD_MAX I32_MAX
127 void pad_peg(const char* s) {
136 Create a new compiling padlist, saving and updating the various global
137 vars at the same time as creating the pad itself. The following flags
138 can be OR'ed together:
140 padnew_CLONE this pad is for a cloned CV
141 padnew_SAVE save old globals
142 padnew_SAVESUB also save extra stuff for start of sub
148 Perl_pad_new(pTHX_ int flags)
151 AV *padlist, *padname, *pad;
153 ASSERT_CURPAD_LEGAL("pad_new");
155 /* XXX DAPM really need a new SAVEt_PAD which restores all or most
156 * vars (based on flags) rather than storing vals + addresses for
157 * each individually. Also see pad_block_start.
158 * XXX DAPM Try to see whether all these conditionals are required
161 /* save existing state, ... */
163 if (flags & padnew_SAVE) {
165 SAVESPTR(PL_comppad_name);
166 if (! (flags & padnew_CLONE)) {
168 SAVEI32(PL_comppad_name_fill);
169 SAVEI32(PL_min_intro_pending);
170 SAVEI32(PL_max_intro_pending);
171 SAVEI32(PL_cv_has_eval);
172 if (flags & padnew_SAVESUB) {
173 SAVEI32(PL_pad_reset_pending);
177 /* XXX DAPM interestingly, PL_comppad_name_floor never seems to be
178 * saved - check at some pt that this is okay */
180 /* ... create new pad ... */
186 if (flags & padnew_CLONE) {
187 /* XXX DAPM I dont know why cv_clone needs it
188 * doing differently yet - perhaps this separate branch can be
189 * dispensed with eventually ???
192 AV * const a0 = newAV(); /* will be @_ */
194 av_store(pad, 0, (SV*)a0);
198 av_store(pad, 0, NULL);
202 av_store(padlist, 0, (SV*)padname);
203 av_store(padlist, 1, (SV*)pad);
205 /* ... then update state variables */
207 PL_comppad_name = (AV*)(*av_fetch(padlist, 0, FALSE));
208 PL_comppad = (AV*)(*av_fetch(padlist, 1, FALSE));
209 PL_curpad = AvARRAY(PL_comppad);
211 if (! (flags & padnew_CLONE)) {
212 PL_comppad_name_fill = 0;
213 PL_min_intro_pending = 0;
218 DEBUG_X(PerlIO_printf(Perl_debug_log,
219 "Pad 0x%"UVxf"[0x%"UVxf"] new: compcv=0x%"UVxf
220 " name=0x%"UVxf" flags=0x%"UVxf"\n",
221 PTR2UV(PL_comppad), PTR2UV(PL_curpad), PTR2UV(PL_compcv),
222 PTR2UV(padname), (UV)flags
226 return (PADLIST*)padlist;
230 =for apidoc pad_undef
232 Free the padlist associated with a CV.
233 If parts of it happen to be current, we null the relevant
234 PL_*pad* global vars so that we don't have any dangling references left.
235 We also repoint the CvOUTSIDE of any about-to-be-orphaned
236 inner subs to the outer of this cv.
238 (This function should really be called pad_free, but the name was already
245 Perl_pad_undef(pTHX_ CV* cv)
249 const PADLIST * const padlist = CvPADLIST(cv);
251 pad_peg("pad_undef");
254 if (SvIS_FREED(padlist)) /* may be during global destruction */
257 DEBUG_X(PerlIO_printf(Perl_debug_log,
258 "Pad undef: cv=0x%"UVxf" padlist=0x%"UVxf"\n",
259 PTR2UV(cv), PTR2UV(padlist))
262 /* detach any '&' anon children in the pad; if afterwards they
263 * are still live, fix up their CvOUTSIDEs to point to our outside,
265 /* XXX DAPM for efficiency, we should only do this if we know we have
266 * children, or integrate this loop with general cleanup */
268 if (!PL_dirty) { /* don't bother during global destruction */
269 CV * const outercv = CvOUTSIDE(cv);
270 const U32 seq = CvOUTSIDE_SEQ(cv);
271 AV * const comppad_name = (AV*)AvARRAY(padlist)[0];
272 SV ** const namepad = AvARRAY(comppad_name);
273 AV * const comppad = (AV*)AvARRAY(padlist)[1];
274 SV ** const curpad = AvARRAY(comppad);
275 for (ix = AvFILLp(comppad_name); ix > 0; ix--) {
276 SV * const namesv = namepad[ix];
277 if (namesv && namesv != &PL_sv_undef
278 && *SvPVX_const(namesv) == '&')
280 CV * const innercv = (CV*)curpad[ix];
281 U32 inner_rc = SvREFCNT(innercv);
284 SvREFCNT_dec(namesv);
286 if (SvREFCNT(comppad) < 2) { /* allow for /(?{ sub{} })/ */
288 SvREFCNT_dec(innercv);
292 /* in use, not just a prototype */
293 if (inner_rc && (CvOUTSIDE(innercv) == cv)) {
294 assert(CvWEAKOUTSIDE(innercv));
295 /* don't relink to grandfather if he's being freed */
296 if (outercv && SvREFCNT(outercv)) {
297 CvWEAKOUTSIDE_off(innercv);
298 CvOUTSIDE(innercv) = outercv;
299 CvOUTSIDE_SEQ(innercv) = seq;
300 SvREFCNT_inc_simple_void_NN(outercv);
303 CvOUTSIDE(innercv) = NULL;
310 ix = AvFILLp(padlist);
312 const SV* const sv = AvARRAY(padlist)[ix--];
314 if (sv == (SV*)PL_comppad_name)
315 PL_comppad_name = NULL;
316 else if (sv == (SV*)PL_comppad) {
323 SvREFCNT_dec((SV*)CvPADLIST(cv));
324 CvPADLIST(cv) = NULL;
331 =for apidoc pad_add_name
333 Create a new name and associated PADMY SV in the current pad; return the
335 If C<typestash> is valid, the name is for a typed lexical; set the
336 name's stash to that value.
337 If C<ourstash> is valid, it's an our lexical, set the name's
338 SvOURSTASH to that value
340 If fake, it means we're cloning an existing entry
346 Perl_pad_add_name(pTHX_ const char *name, HV* typestash, HV* ourstash, bool fake, bool state)
349 const PADOFFSET offset = pad_alloc(OP_PADSV, SVs_PADMY);
351 = newSV_type((ourstash || typestash) ? SVt_PVMG : SVt_PVNV);
353 ASSERT_CURPAD_ACTIVE("pad_add_name");
355 sv_setpv(namesv, name);
358 assert(SvTYPE(namesv) == SVt_PVMG);
359 SvPAD_TYPED_on(namesv);
360 SvSTASH_set(namesv, (HV*)SvREFCNT_inc_simple_NN((SV*)typestash));
363 SvPAD_OUR_on(namesv);
364 SvOURSTASH_set(namesv, ourstash);
365 SvREFCNT_inc_simple_void_NN(ourstash);
368 SvPAD_STATE_on(namesv);
371 av_store(PL_comppad_name, offset, namesv);
374 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
375 "Pad addname: %ld \"%s\" FAKE\n", (long)offset, name));
378 /* not yet introduced */
379 COP_SEQ_RANGE_LOW_set(namesv, PAD_MAX); /* min */
380 COP_SEQ_RANGE_HIGH_set(namesv, 0); /* max */
382 if (!PL_min_intro_pending)
383 PL_min_intro_pending = offset;
384 PL_max_intro_pending = offset;
385 /* if it's not a simple scalar, replace with an AV or HV */
386 /* XXX DAPM since slot has been allocated, replace
387 * av_store with PL_curpad[offset] ? */
389 av_store(PL_comppad, offset, (SV*)newAV());
390 else if (*name == '%')
391 av_store(PL_comppad, offset, (SV*)newHV());
392 SvPADMY_on(PL_curpad[offset]);
393 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
394 "Pad addname: %ld \"%s\" new lex=0x%"UVxf"\n",
395 (long)offset, name, PTR2UV(PL_curpad[offset])));
405 =for apidoc pad_alloc
407 Allocate a new my or tmp pad entry. For a my, simply push a null SV onto
408 the end of PL_comppad, but for a tmp, scan the pad from PL_padix upwards
409 for a slot which has no name and no active value.
414 /* XXX DAPM integrate alloc(), add_name() and add_anon(),
415 * or at least rationalise ??? */
416 /* And flag whether the incoming name is UTF8 or 8 bit?
417 Could do this either with the +ve/-ve hack of the HV code, or expanding
418 the flag bits. Either way, this makes proper Unicode safe pad support.
423 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
429 PERL_UNUSED_ARG(optype);
430 ASSERT_CURPAD_ACTIVE("pad_alloc");
432 if (AvARRAY(PL_comppad) != PL_curpad)
433 Perl_croak(aTHX_ "panic: pad_alloc");
434 if (PL_pad_reset_pending)
436 if (tmptype & SVs_PADMY) {
437 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
438 retval = AvFILLp(PL_comppad);
441 SV * const * const names = AvARRAY(PL_comppad_name);
442 const SSize_t names_fill = AvFILLp(PL_comppad_name);
445 * "foreach" index vars temporarily become aliases to non-"my"
446 * values. Thus we must skip, not just pad values that are
447 * marked as current pad values, but also those with names.
449 /* HVDS why copy to sv here? we don't seem to use it */
450 if (++PL_padix <= names_fill &&
451 (sv = names[PL_padix]) && sv != &PL_sv_undef)
453 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
454 if (!(SvFLAGS(sv) & (SVs_PADTMP | SVs_PADMY)) &&
455 !IS_PADGV(sv) && !IS_PADCONST(sv))
460 SvFLAGS(sv) |= tmptype;
461 PL_curpad = AvARRAY(PL_comppad);
463 DEBUG_X(PerlIO_printf(Perl_debug_log,
464 "Pad 0x%"UVxf"[0x%"UVxf"] alloc: %ld for %s\n",
465 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long) retval,
466 PL_op_name[optype]));
467 #ifdef DEBUG_LEAKING_SCALARS
468 sv->sv_debug_optype = optype;
469 sv->sv_debug_inpad = 1;
471 return (PADOFFSET)retval;
475 =for apidoc pad_add_anon
477 Add an anon code entry to the current compiling pad
483 Perl_pad_add_anon(pTHX_ SV* sv, OPCODE op_type)
487 SV* const name = newSV_type(SVt_PVNV);
489 sv_setpvn(name, "&", 1);
490 /* Are these two actually ever read? */
491 COP_SEQ_RANGE_HIGH_set(name, ~0);
492 COP_SEQ_RANGE_LOW_set(name, 1);
493 ix = pad_alloc(op_type, SVs_PADMY);
494 av_store(PL_comppad_name, ix, name);
495 /* XXX DAPM use PL_curpad[] ? */
496 av_store(PL_comppad, ix, sv);
499 /* to avoid ref loops, we never have parent + child referencing each
500 * other simultaneously */
501 if (CvOUTSIDE((CV*)sv)) {
502 assert(!CvWEAKOUTSIDE((CV*)sv));
503 CvWEAKOUTSIDE_on((CV*)sv);
504 SvREFCNT_dec(CvOUTSIDE((CV*)sv));
512 =for apidoc pad_check_dup
514 Check for duplicate declarations: report any of:
515 * a my in the current scope with the same name;
516 * an our (anywhere in the pad) with the same name and the same stash
518 C<is_our> indicates that the name to check is an 'our' declaration
523 /* XXX DAPM integrate this into pad_add_name ??? */
526 Perl_pad_check_dup(pTHX_ const char *name, bool is_our, const HV *ourstash)
532 ASSERT_CURPAD_ACTIVE("pad_check_dup");
533 if (AvFILLp(PL_comppad_name) < 0 || !ckWARN(WARN_MISC))
534 return; /* nothing to check */
536 svp = AvARRAY(PL_comppad_name);
537 top = AvFILLp(PL_comppad_name);
538 /* check the current scope */
539 /* XXX DAPM - why the (I32) cast - shouldn't we ensure they're the same
541 for (off = top; (I32)off > PL_comppad_name_floor; off--) {
542 SV * const sv = svp[off];
544 && sv != &PL_sv_undef
546 && (COP_SEQ_RANGE_HIGH(sv) == PAD_MAX || COP_SEQ_RANGE_HIGH(sv) == 0)
547 && strEQ(name, SvPVX_const(sv)))
549 if (is_our && (SvPAD_OUR(sv)))
550 break; /* "our" masking "our" */
551 Perl_warner(aTHX_ packWARN(WARN_MISC),
552 "\"%s\" variable %s masks earlier declaration in same %s",
553 (is_our ? "our" : PL_in_my == KEY_my ? "my" : "state"),
555 (COP_SEQ_RANGE_HIGH(sv) == PAD_MAX ? "scope" : "statement"));
560 /* check the rest of the pad */
563 SV * const sv = svp[off];
565 && sv != &PL_sv_undef
567 && (COP_SEQ_RANGE_HIGH(sv) == PAD_MAX || COP_SEQ_RANGE_HIGH(sv) == 0)
568 && SvOURSTASH(sv) == ourstash
569 && strEQ(name, SvPVX_const(sv)))
571 Perl_warner(aTHX_ packWARN(WARN_MISC),
572 "\"our\" variable %s redeclared", name);
573 if ((I32)off <= PL_comppad_name_floor)
574 Perl_warner(aTHX_ packWARN(WARN_MISC),
575 "\t(Did you mean \"local\" instead of \"our\"?)\n");
578 } while ( off-- > 0 );
584 =for apidoc pad_findmy
586 Given a lexical name, try to find its offset, first in the current pad,
587 or failing that, in the pads of any lexically enclosing subs (including
588 the complications introduced by eval). If the name is found in an outer pad,
589 then a fake entry is added to the current pad.
590 Returns the offset in the current pad, or NOT_IN_PAD on failure.
596 Perl_pad_findmy(pTHX_ const char *name)
605 pad_peg("pad_findmy");
606 offset = pad_findlex(name, PL_compcv, PL_cop_seqmax, 1,
607 NULL, &out_sv, &out_flags);
608 if ((PADOFFSET)offset != NOT_IN_PAD)
611 /* look for an our that's being introduced; this allows
612 * our $foo = 0 unless defined $foo;
613 * to not give a warning. (Yes, this is a hack) */
615 nameav = (AV*)AvARRAY(CvPADLIST(PL_compcv))[0];
616 name_svp = AvARRAY(nameav);
617 for (offset = AvFILLp(nameav); offset > 0; offset--) {
618 const SV * const namesv = name_svp[offset];
619 if (namesv && namesv != &PL_sv_undef
621 && (SvPAD_OUR(namesv))
622 && strEQ(SvPVX_const(namesv), name)
623 && COP_SEQ_RANGE_LOW(namesv) == PAD_MAX /* min */
631 * Returns the offset of a lexical $_, if there is one, at run time.
632 * Used by the UNDERBAR XS macro.
636 Perl_find_rundefsvoffset(pTHX)
641 return pad_findlex("$_", find_runcv(NULL), PL_curcop->cop_seq, 1,
642 NULL, &out_sv, &out_flags);
646 =for apidoc pad_findlex
648 Find a named lexical anywhere in a chain of nested pads. Add fake entries
649 in the inner pads if it's found in an outer one.
651 Returns the offset in the bottom pad of the lex or the fake lex.
652 cv is the CV in which to start the search, and seq is the current cop_seq
653 to match against. If warn is true, print appropriate warnings. The out_*
654 vars return values, and so are pointers to where the returned values
655 should be stored. out_capture, if non-null, requests that the innermost
656 instance of the lexical is captured; out_name_sv is set to the innermost
657 matched namesv or fake namesv; out_flags returns the flags normally
658 associated with the IVX field of a fake namesv.
660 Note that pad_findlex() is recursive; it recurses up the chain of CVs,
661 then comes back down, adding fake entries as it goes. It has to be this way
662 because fake namesvs in anon protoypes have to store in xlow the index into
668 /* the CV has finished being compiled. This is not a sufficient test for
669 * all CVs (eg XSUBs), but suffices for the CVs found in a lexical chain */
670 #define CvCOMPILED(cv) CvROOT(cv)
672 /* the CV does late binding of its lexicals */
673 #define CvLATE(cv) (CvANON(cv) || SvTYPE(cv) == SVt_PVFM)
677 S_pad_findlex(pTHX_ const char *name, const CV* cv, U32 seq, int warn,
678 SV** out_capture, SV** out_name_sv, int *out_flags)
681 I32 offset, new_offset;
684 const AV * const padlist = CvPADLIST(cv);
688 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
689 "Pad findlex cv=0x%"UVxf" searching \"%s\" seq=%d%s\n",
690 PTR2UV(cv), name, (int)seq, out_capture ? " capturing" : "" ));
692 /* first, search this pad */
694 if (padlist) { /* not an undef CV */
696 const AV * const nameav = (AV*)AvARRAY(padlist)[0];
697 SV * const * const name_svp = AvARRAY(nameav);
699 for (offset = AvFILLp(nameav); offset > 0; offset--) {
700 const SV * const namesv = name_svp[offset];
701 if (namesv && namesv != &PL_sv_undef
702 && strEQ(SvPVX_const(namesv), name))
705 fake_offset = offset; /* in case we don't find a real one */
706 else if ( seq > COP_SEQ_RANGE_LOW(namesv) /* min */
707 && seq <= COP_SEQ_RANGE_HIGH(namesv)) /* max */
712 if (offset > 0 || fake_offset > 0 ) { /* a match! */
713 if (offset > 0) { /* not fake */
715 *out_name_sv = name_svp[offset]; /* return the namesv */
717 /* set PAD_FAKELEX_MULTI if this lex can have multiple
718 * instances. For now, we just test !CvUNIQUE(cv), but
719 * ideally, we should detect my's declared within loops
720 * etc - this would allow a wider range of 'not stayed
721 * shared' warnings. We also treated alreadly-compiled
722 * lexes as not multi as viewed from evals. */
724 *out_flags = CvANON(cv) ?
726 (!CvUNIQUE(cv) && ! CvCOMPILED(cv))
727 ? PAD_FAKELEX_MULTI : 0;
729 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
730 "Pad findlex cv=0x%"UVxf" matched: offset=%ld (%lu,%lu)\n",
731 PTR2UV(cv), (long)offset,
732 (unsigned long)COP_SEQ_RANGE_LOW(*out_name_sv),
733 (unsigned long)COP_SEQ_RANGE_HIGH(*out_name_sv)));
735 else { /* fake match */
736 offset = fake_offset;
737 *out_name_sv = name_svp[offset]; /* return the namesv */
738 *out_flags = PARENT_FAKELEX_FLAGS(*out_name_sv);
739 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
740 "Pad findlex cv=0x%"UVxf" matched: offset=%ld flags=0x%lx index=%lu\n",
741 PTR2UV(cv), (long)offset, (unsigned long)*out_flags,
742 (unsigned long) PARENT_PAD_INDEX(*out_name_sv)
746 /* return the lex? */
751 if (SvPAD_OUR(*out_name_sv)) {
756 /* trying to capture from an anon prototype? */
758 ? CvANON(cv) && CvCLONE(cv) && !CvCLONED(cv)
759 : *out_flags & PAD_FAKELEX_ANON)
761 if (warn && ckWARN(WARN_CLOSURE))
762 Perl_warner(aTHX_ packWARN(WARN_CLOSURE),
763 "Variable \"%s\" is not available", name);
770 if (!CvCOMPILED(cv) && (*out_flags & PAD_FAKELEX_MULTI)
771 && warn && ckWARN(WARN_CLOSURE)) {
773 Perl_warner(aTHX_ packWARN(WARN_CLOSURE),
774 "Variable \"%s\" will not stay shared", name);
777 if (fake_offset && CvANON(cv)
778 && CvCLONE(cv) &&!CvCLONED(cv))
781 /* not yet caught - look further up */
782 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
783 "Pad findlex cv=0x%"UVxf" chasing lex in outer pad\n",
786 (void) pad_findlex(name, CvOUTSIDE(cv),
788 newwarn, out_capture, out_name_sv, out_flags);
793 *out_capture = AvARRAY((AV*)AvARRAY(padlist)[
794 CvDEPTH(cv) ? CvDEPTH(cv) : 1])[offset];
795 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
796 "Pad findlex cv=0x%"UVxf" found lex=0x%"UVxf"\n",
797 PTR2UV(cv), PTR2UV(*out_capture)));
799 if (SvPADSTALE(*out_capture)) {
800 if (ckWARN(WARN_CLOSURE))
801 Perl_warner(aTHX_ packWARN(WARN_CLOSURE),
802 "Variable \"%s\" is not available", name);
808 *out_capture = sv_2mortal((SV*)newAV());
809 else if (*name == '%')
810 *out_capture = sv_2mortal((SV*)newHV());
812 *out_capture = sv_newmortal();
820 /* it's not in this pad - try above */
825 /* out_capture non-null means caller wants us to capture lex; in
826 * addition we capture ourselves unless it's an ANON/format */
827 new_capturep = out_capture ? out_capture :
828 CvLATE(cv) ? NULL : &new_capture;
830 offset = pad_findlex(name, CvOUTSIDE(cv), CvOUTSIDE_SEQ(cv), 1,
831 new_capturep, out_name_sv, out_flags);
832 if ((PADOFFSET)offset == NOT_IN_PAD)
835 /* found in an outer CV. Add appropriate fake entry to this pad */
837 /* don't add new fake entries (via eval) to CVs that we have already
838 * finished compiling, or to undef CVs */
839 if (CvCOMPILED(cv) || !padlist)
840 return 0; /* this dummy (and invalid) value isnt used by the caller */
844 AV * const ocomppad_name = PL_comppad_name;
845 PAD * const ocomppad = PL_comppad;
846 PL_comppad_name = (AV*)AvARRAY(padlist)[0];
847 PL_comppad = (AV*)AvARRAY(padlist)[1];
848 PL_curpad = AvARRAY(PL_comppad);
850 new_offset = pad_add_name(
851 SvPVX_const(*out_name_sv),
852 SvPAD_TYPED(*out_name_sv)
853 ? SvSTASH(*out_name_sv) : NULL,
854 SvOURSTASH(*out_name_sv),
856 0 /* not a state variable */
859 new_namesv = AvARRAY(PL_comppad_name)[new_offset];
860 PARENT_FAKELEX_FLAGS_set(new_namesv, *out_flags);
862 PARENT_PAD_INDEX_set(new_namesv, 0);
863 if (SvPAD_OUR(new_namesv)) {
864 NOOP; /* do nothing */
866 else if (CvLATE(cv)) {
867 /* delayed creation - just note the offset within parent pad */
868 PARENT_PAD_INDEX_set(new_namesv, offset);
872 /* immediate creation - capture outer value right now */
873 av_store(PL_comppad, new_offset, SvREFCNT_inc(*new_capturep));
874 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
875 "Pad findlex cv=0x%"UVxf" saved captured sv 0x%"UVxf" at offset %ld\n",
876 PTR2UV(cv), PTR2UV(*new_capturep), (long)new_offset));
878 *out_name_sv = new_namesv;
879 *out_flags = PARENT_FAKELEX_FLAGS(new_namesv);
881 PL_comppad_name = ocomppad_name;
882 PL_comppad = ocomppad;
883 PL_curpad = ocomppad ? AvARRAY(ocomppad) : NULL;
893 Get the value at offset po in the current pad.
894 Use macro PAD_SV instead of calling this function directly.
901 Perl_pad_sv(pTHX_ PADOFFSET po)
904 ASSERT_CURPAD_ACTIVE("pad_sv");
907 Perl_croak(aTHX_ "panic: pad_sv po");
908 DEBUG_X(PerlIO_printf(Perl_debug_log,
909 "Pad 0x%"UVxf"[0x%"UVxf"] sv: %ld sv=0x%"UVxf"\n",
910 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long)po, PTR2UV(PL_curpad[po]))
912 return PL_curpad[po];
917 =for apidoc pad_setsv
919 Set the entry at offset po in the current pad to sv.
920 Use the macro PAD_SETSV() rather than calling this function directly.
926 Perl_pad_setsv(pTHX_ PADOFFSET po, SV* sv)
929 ASSERT_CURPAD_ACTIVE("pad_setsv");
931 DEBUG_X(PerlIO_printf(Perl_debug_log,
932 "Pad 0x%"UVxf"[0x%"UVxf"] setsv: %ld sv=0x%"UVxf"\n",
933 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long)po, PTR2UV(sv))
942 =for apidoc pad_block_start
944 Update the pad compilation state variables on entry to a new block
950 * - integrate this in general state-saving routine ???
951 * - combine with the state-saving going on in pad_new ???
952 * - introduce a new SAVE type that does all this in one go ?
956 Perl_pad_block_start(pTHX_ int full)
959 ASSERT_CURPAD_ACTIVE("pad_block_start");
960 SAVEI32(PL_comppad_name_floor);
961 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
963 PL_comppad_name_fill = PL_comppad_name_floor;
964 if (PL_comppad_name_floor < 0)
965 PL_comppad_name_floor = 0;
966 SAVEI32(PL_min_intro_pending);
967 SAVEI32(PL_max_intro_pending);
968 PL_min_intro_pending = 0;
969 SAVEI32(PL_comppad_name_fill);
970 SAVEI32(PL_padix_floor);
971 PL_padix_floor = PL_padix;
972 PL_pad_reset_pending = FALSE;
979 "Introduce" my variables to visible status.
991 ASSERT_CURPAD_ACTIVE("intro_my");
992 if (! PL_min_intro_pending)
993 return PL_cop_seqmax;
995 svp = AvARRAY(PL_comppad_name);
996 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
997 SV * const sv = svp[i];
999 if (sv && sv != &PL_sv_undef && !SvFAKE(sv) && !COP_SEQ_RANGE_HIGH(sv)) {
1000 COP_SEQ_RANGE_HIGH_set(sv, PAD_MAX); /* Don't know scope end yet. */
1001 COP_SEQ_RANGE_LOW_set(sv, PL_cop_seqmax);
1002 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1003 "Pad intromy: %ld \"%s\", (%lu,%lu)\n",
1004 (long)i, SvPVX_const(sv),
1005 (unsigned long)COP_SEQ_RANGE_LOW(sv),
1006 (unsigned long)COP_SEQ_RANGE_HIGH(sv))
1010 PL_min_intro_pending = 0;
1011 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
1012 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1013 "Pad intromy: seq -> %ld\n", (long)(PL_cop_seqmax+1)));
1015 return PL_cop_seqmax++;
1019 =for apidoc pad_leavemy
1021 Cleanup at end of scope during compilation: set the max seq number for
1022 lexicals in this scope and warn of any lexicals that never got introduced.
1028 Perl_pad_leavemy(pTHX)
1032 SV * const * const svp = AvARRAY(PL_comppad_name);
1034 PL_pad_reset_pending = FALSE;
1036 ASSERT_CURPAD_ACTIVE("pad_leavemy");
1037 if (PL_min_intro_pending && PL_comppad_name_fill < PL_min_intro_pending) {
1038 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
1039 const SV * const sv = svp[off];
1040 if (sv && sv != &PL_sv_undef
1041 && !SvFAKE(sv) && ckWARN_d(WARN_INTERNAL))
1042 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
1043 "%"SVf" never introduced",
1047 /* "Deintroduce" my variables that are leaving with this scope. */
1048 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_fill; off--) {
1049 const SV * const sv = svp[off];
1050 if (sv && sv != &PL_sv_undef && !SvFAKE(sv) && COP_SEQ_RANGE_HIGH(sv) == PAD_MAX) {
1051 COP_SEQ_RANGE_HIGH_set(sv, PL_cop_seqmax);
1052 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1053 "Pad leavemy: %ld \"%s\", (%lu,%lu)\n",
1054 (long)off, SvPVX_const(sv),
1055 (unsigned long)COP_SEQ_RANGE_LOW(sv),
1056 (unsigned long)COP_SEQ_RANGE_HIGH(sv))
1061 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1062 "Pad leavemy: seq = %ld\n", (long)PL_cop_seqmax));
1067 =for apidoc pad_swipe
1069 Abandon the tmp in the current pad at offset po and replace with a
1076 Perl_pad_swipe(pTHX_ PADOFFSET po, bool refadjust)
1079 ASSERT_CURPAD_LEGAL("pad_swipe");
1082 if (AvARRAY(PL_comppad) != PL_curpad)
1083 Perl_croak(aTHX_ "panic: pad_swipe curpad");
1085 Perl_croak(aTHX_ "panic: pad_swipe po");
1087 DEBUG_X(PerlIO_printf(Perl_debug_log,
1088 "Pad 0x%"UVxf"[0x%"UVxf"] swipe: %ld\n",
1089 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long)po));
1092 SvPADTMP_off(PL_curpad[po]);
1094 SvREFCNT_dec(PL_curpad[po]);
1097 /* if pad tmps aren't shared between ops, then there's no need to
1098 * create a new tmp when an existing op is freed */
1099 #ifdef USE_BROKEN_PAD_RESET
1100 PL_curpad[po] = newSV(0);
1101 SvPADTMP_on(PL_curpad[po]);
1103 PL_curpad[po] = &PL_sv_undef;
1105 if ((I32)po < PL_padix)
1111 =for apidoc pad_reset
1113 Mark all the current temporaries for reuse
1118 /* XXX pad_reset() is currently disabled because it results in serious bugs.
1119 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
1120 * on the stack by OPs that use them, there are several ways to get an alias
1121 * to a shared TARG. Such an alias will change randomly and unpredictably.
1122 * We avoid doing this until we can think of a Better Way.
1125 Perl_pad_reset(pTHX)
1128 #ifdef USE_BROKEN_PAD_RESET
1129 if (AvARRAY(PL_comppad) != PL_curpad)
1130 Perl_croak(aTHX_ "panic: pad_reset curpad");
1132 DEBUG_X(PerlIO_printf(Perl_debug_log,
1133 "Pad 0x%"UVxf"[0x%"UVxf"] reset: padix %ld -> %ld",
1134 PTR2UV(PL_comppad), PTR2UV(PL_curpad),
1135 (long)PL_padix, (long)PL_padix_floor
1139 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
1141 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
1142 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
1143 SvPADTMP_off(PL_curpad[po]);
1145 PL_padix = PL_padix_floor;
1148 PL_pad_reset_pending = FALSE;
1153 =for apidoc pad_tidy
1155 Tidy up a pad after we've finished compiling it:
1156 * remove most stuff from the pads of anonsub prototypes;
1158 * mark tmps as such.
1163 /* XXX DAPM surely most of this stuff should be done properly
1164 * at the right time beforehand, rather than going around afterwards
1165 * cleaning up our mistakes ???
1169 Perl_pad_tidy(pTHX_ padtidy_type type)
1173 ASSERT_CURPAD_ACTIVE("pad_tidy");
1175 /* If this CV has had any 'eval-capable' ops planted in it
1176 * (ie it contains eval '...', //ee, /$var/ or /(?{..})/), Then any
1177 * anon prototypes in the chain of CVs should be marked as cloneable,
1178 * so that for example the eval's CV in C<< sub { eval '$x' } >> gets
1179 * the right CvOUTSIDE.
1180 * If running with -d, *any* sub may potentially have an eval
1181 * excuted within it.
1184 if (PL_cv_has_eval || PL_perldb) {
1186 for (cv = PL_compcv ;cv; cv = CvOUTSIDE(cv)) {
1187 if (cv != PL_compcv && CvCOMPILED(cv))
1188 break; /* no need to mark already-compiled code */
1190 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1191 "Pad clone on cv=0x%"UVxf"\n", PTR2UV(cv)));
1197 /* extend curpad to match namepad */
1198 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
1199 av_store(PL_comppad_name, AvFILLp(PL_comppad), NULL);
1201 if (type == padtidy_SUBCLONE) {
1202 SV * const * const namep = AvARRAY(PL_comppad_name);
1205 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
1208 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
1211 * The only things that a clonable function needs in its
1212 * pad are anonymous subs.
1213 * The rest are created anew during cloning.
1215 if (!((namesv = namep[ix]) != NULL &&
1216 namesv != &PL_sv_undef &&
1217 *SvPVX_const(namesv) == '&'))
1219 SvREFCNT_dec(PL_curpad[ix]);
1220 PL_curpad[ix] = NULL;
1224 else if (type == padtidy_SUB) {
1225 /* XXX DAPM this same bit of code keeps appearing !!! Rationalise? */
1226 AV * const av = newAV(); /* Will be @_ */
1228 av_store(PL_comppad, 0, (SV*)av);
1232 /* XXX DAPM rationalise these two similar branches */
1234 if (type == padtidy_SUB) {
1236 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
1237 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
1239 if (!SvPADMY(PL_curpad[ix]))
1240 SvPADTMP_on(PL_curpad[ix]);
1243 else if (type == padtidy_FORMAT) {
1245 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
1246 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
1247 SvPADTMP_on(PL_curpad[ix]);
1250 PL_curpad = AvARRAY(PL_comppad);
1255 =for apidoc pad_free
1257 Free the SV at offset po in the current pad.
1262 /* XXX DAPM integrate with pad_swipe ???? */
1264 Perl_pad_free(pTHX_ PADOFFSET po)
1267 ASSERT_CURPAD_LEGAL("pad_free");
1270 if (AvARRAY(PL_comppad) != PL_curpad)
1271 Perl_croak(aTHX_ "panic: pad_free curpad");
1273 Perl_croak(aTHX_ "panic: pad_free po");
1275 DEBUG_X(PerlIO_printf(Perl_debug_log,
1276 "Pad 0x%"UVxf"[0x%"UVxf"] free: %ld\n",
1277 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long)po)
1280 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef) {
1281 SvPADTMP_off(PL_curpad[po]);
1283 /* SV could be a shared hash key (eg bugid #19022) */
1285 #ifdef PERL_OLD_COPY_ON_WRITE
1286 !SvIsCOW(PL_curpad[po])
1288 !SvFAKE(PL_curpad[po])
1291 SvREADONLY_off(PL_curpad[po]); /* could be a freed constant */
1294 if ((I32)po < PL_padix)
1301 =for apidoc do_dump_pad
1303 Dump the contents of a padlist
1309 Perl_do_dump_pad(pTHX_ I32 level, PerlIO *file, PADLIST *padlist, int full)
1321 pad_name = (AV*)*av_fetch((AV*)padlist, 0, FALSE);
1322 pad = (AV*)*av_fetch((AV*)padlist, 1, FALSE);
1323 pname = AvARRAY(pad_name);
1324 ppad = AvARRAY(pad);
1325 Perl_dump_indent(aTHX_ level, file,
1326 "PADNAME = 0x%"UVxf"(0x%"UVxf") PAD = 0x%"UVxf"(0x%"UVxf")\n",
1327 PTR2UV(pad_name), PTR2UV(pname), PTR2UV(pad), PTR2UV(ppad)
1330 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
1331 const SV *namesv = pname[ix];
1332 if (namesv && namesv == &PL_sv_undef) {
1337 Perl_dump_indent(aTHX_ level+1, file,
1338 "%2d. 0x%"UVxf"<%lu> FAKE \"%s\" flags=0x%lx index=%lu\n",
1341 (unsigned long) (ppad[ix] ? SvREFCNT(ppad[ix]) : 0),
1342 SvPVX_const(namesv),
1343 (unsigned long)PARENT_FAKELEX_FLAGS(namesv),
1344 (unsigned long)PARENT_PAD_INDEX(namesv)
1348 Perl_dump_indent(aTHX_ level+1, file,
1349 "%2d. 0x%"UVxf"<%lu> (%lu,%lu) \"%s\"\n",
1352 (unsigned long) (ppad[ix] ? SvREFCNT(ppad[ix]) : 0),
1353 (unsigned long)COP_SEQ_RANGE_LOW(namesv),
1354 (unsigned long)COP_SEQ_RANGE_HIGH(namesv),
1359 Perl_dump_indent(aTHX_ level+1, file,
1360 "%2d. 0x%"UVxf"<%lu>\n",
1363 (unsigned long) (ppad[ix] ? SvREFCNT(ppad[ix]) : 0)
1374 dump the contents of a CV
1381 S_cv_dump(pTHX_ const CV *cv, const char *title)
1384 const CV * const outside = CvOUTSIDE(cv);
1385 AV* const padlist = CvPADLIST(cv);
1387 PerlIO_printf(Perl_debug_log,
1388 " %s: CV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
1391 (CvANON(cv) ? "ANON"
1392 : (SvTYPE(cv) == SVt_PVFM) ? "FORMAT"
1393 : (cv == PL_main_cv) ? "MAIN"
1394 : CvUNIQUE(cv) ? "UNIQUE"
1395 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
1398 : CvANON(outside) ? "ANON"
1399 : (outside == PL_main_cv) ? "MAIN"
1400 : CvUNIQUE(outside) ? "UNIQUE"
1401 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
1403 PerlIO_printf(Perl_debug_log,
1404 " PADLIST = 0x%"UVxf"\n", PTR2UV(padlist));
1405 do_dump_pad(1, Perl_debug_log, padlist, 1);
1407 #endif /* DEBUGGING */
1414 =for apidoc cv_clone
1416 Clone a CV: make a new CV which points to the same code etc, but which
1417 has a newly-created pad built by copying the prototype pad and capturing
1424 Perl_cv_clone(pTHX_ CV *proto)
1428 AV* const protopadlist = CvPADLIST(proto);
1429 const AV* const protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
1430 const AV* const protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
1431 SV** const pname = AvARRAY(protopad_name);
1432 SV** const ppad = AvARRAY(protopad);
1433 const I32 fname = AvFILLp(protopad_name);
1434 const I32 fpad = AvFILLp(protopad);
1440 assert(!CvUNIQUE(proto));
1442 /* Since cloneable anon subs can be nested, CvOUTSIDE may point
1443 * to a prototype; we instead want the cloned parent who called us.
1444 * Note that in general for formats, CvOUTSIDE != find_runcv */
1446 outside = CvOUTSIDE(proto);
1447 if (outside && CvCLONE(outside) && ! CvCLONED(outside))
1448 outside = find_runcv(NULL);
1449 depth = CvDEPTH(outside);
1450 assert(depth || SvTYPE(proto) == SVt_PVFM);
1453 assert(CvPADLIST(outside));
1456 SAVESPTR(PL_compcv);
1458 cv = PL_compcv = (CV*)newSV_type(SvTYPE(proto));
1459 CvFLAGS(cv) = CvFLAGS(proto) & ~(CVf_CLONE|CVf_WEAKOUTSIDE);
1463 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto)
1464 : savepv(CvFILE(proto));
1466 CvFILE(cv) = CvFILE(proto);
1468 CvGV(cv) = CvGV(proto);
1469 CvSTASH(cv) = CvSTASH(proto);
1471 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1473 CvSTART(cv) = CvSTART(proto);
1474 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc_simple(outside);
1475 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1478 sv_setpvn((SV*)cv, SvPVX_const(proto), SvCUR(proto));
1480 CvPADLIST(cv) = pad_new(padnew_CLONE|padnew_SAVE);
1482 av_fill(PL_comppad, fpad);
1483 for (ix = fname; ix >= 0; ix--)
1484 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
1486 PL_curpad = AvARRAY(PL_comppad);
1488 outpad = AvARRAY(AvARRAY(CvPADLIST(outside))[depth]);
1490 for (ix = fpad; ix > 0; ix--) {
1491 SV* const namesv = (ix <= fname) ? pname[ix] : NULL;
1493 if (namesv && namesv != &PL_sv_undef) { /* lexical */
1494 if (SvFAKE(namesv)) { /* lexical from outside? */
1495 sv = outpad[PARENT_PAD_INDEX(namesv)];
1497 /* formats may have an inactive parent */
1498 if (SvTYPE(proto) == SVt_PVFM && SvPADSTALE(sv)) {
1499 if (ckWARN(WARN_CLOSURE))
1500 Perl_warner(aTHX_ packWARN(WARN_CLOSURE),
1501 "Variable \"%s\" is not available", SvPVX_const(namesv));
1505 assert(!SvPADSTALE(sv));
1506 SvREFCNT_inc_simple_void_NN(sv);
1510 const char sigil = SvPVX_const(namesv)[0];
1512 sv = SvREFCNT_inc(ppad[ix]);
1513 else if (sigil == '@')
1515 else if (sigil == '%')
1522 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
1523 sv = SvREFCNT_inc_NN(ppad[ix]);
1533 PerlIO_printf(Perl_debug_log, "\nPad CV clone\n");
1534 cv_dump(outside, "Outside");
1535 cv_dump(proto, "Proto");
1542 /* Constant sub () { $x } closing over $x - see lib/constant.pm:
1543 * The prototype was marked as a candiate for const-ization,
1544 * so try to grab the current const value, and if successful,
1545 * turn into a const sub:
1547 SV* const const_sv = op_const_sv(CvSTART(cv), cv);
1550 cv = newCONSTSUB(CvSTASH(proto), NULL, const_sv);
1562 =for apidoc pad_fixup_inner_anons
1564 For any anon CVs in the pad, change CvOUTSIDE of that CV from
1565 old_cv to new_cv if necessary. Needed when a newly-compiled CV has to be
1566 moved to a pre-existing CV struct.
1572 Perl_pad_fixup_inner_anons(pTHX_ PADLIST *padlist, CV *old_cv, CV *new_cv)
1576 AV * const comppad_name = (AV*)AvARRAY(padlist)[0];
1577 AV * const comppad = (AV*)AvARRAY(padlist)[1];
1578 SV ** const namepad = AvARRAY(comppad_name);
1579 SV ** const curpad = AvARRAY(comppad);
1580 PERL_UNUSED_ARG(old_cv);
1582 for (ix = AvFILLp(comppad_name); ix > 0; ix--) {
1583 const SV * const namesv = namepad[ix];
1584 if (namesv && namesv != &PL_sv_undef
1585 && *SvPVX_const(namesv) == '&')
1587 CV * const innercv = (CV*)curpad[ix];
1588 assert(CvWEAKOUTSIDE(innercv));
1589 assert(CvOUTSIDE(innercv) == old_cv);
1590 CvOUTSIDE(innercv) = new_cv;
1597 =for apidoc pad_push
1599 Push a new pad frame onto the padlist, unless there's already a pad at
1600 this depth, in which case don't bother creating a new one. Then give
1601 the new pad an @_ in slot zero.
1607 Perl_pad_push(pTHX_ PADLIST *padlist, int depth)
1610 if (depth > AvFILLp(padlist)) {
1611 SV** const svp = AvARRAY(padlist);
1612 AV* const newpad = newAV();
1613 SV** const oldpad = AvARRAY(svp[depth-1]);
1614 I32 ix = AvFILLp((AV*)svp[1]);
1615 const I32 names_fill = AvFILLp((AV*)svp[0]);
1616 SV** const names = AvARRAY(svp[0]);
1619 for ( ;ix > 0; ix--) {
1620 if (names_fill >= ix && names[ix] != &PL_sv_undef) {
1621 const char sigil = SvPVX_const(names[ix])[0];
1622 if ((SvFLAGS(names[ix]) & SVf_FAKE) || sigil == '&') {
1623 /* outer lexical or anon code */
1624 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
1626 else { /* our own lexical */
1630 else if (sigil == '%')
1634 av_store(newpad, ix, sv);
1638 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
1639 av_store(newpad, ix, SvREFCNT_inc_NN(oldpad[ix]));
1642 /* save temporaries on recursion? */
1643 SV * const sv = newSV(0);
1644 av_store(newpad, ix, sv);
1650 av_store(newpad, 0, (SV*)av);
1653 av_store(padlist, depth, (SV*)newpad);
1654 AvFILLp(padlist) = depth;
1660 Perl_pad_compname_type(pTHX_ const PADOFFSET po)
1663 SV* const * const av = av_fetch(PL_comppad_name, po, FALSE);
1664 if ( SvPAD_TYPED(*av) ) {
1665 return SvSTASH(*av);
1672 * c-indentation-style: bsd
1674 * indent-tabs-mode: t
1677 * ex: set ts=8 sts=4 sw=4 noet: