3 * Copyright (C) 2002, 2003, 2004, 2005, 2006, 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 NV+1..IV inclusive is a range of cop_seq numbers for which the name is
76 valid. For typed lexicals name SV is SVt_PVMG and SvSTASH points at the
77 type. For C<our> lexicals, the type is also SVt_PVGV, with the MAGIC slot
78 pointing at the stash of the associated global (so that duplicate C<our>
79 declarations in the same package can be detected). SvCUR is sometimes
80 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 NVX and IVX to store a cop_seq range, since it is
85 in scope throughout. Instead IVX 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, NVX 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"
115 #define PAD_MAX 999999999
118 void pad_peg(const char* s) {
127 Create a new compiling padlist, saving and updating the various global
128 vars at the same time as creating the pad itself. The following flags
129 can be OR'ed together:
131 padnew_CLONE this pad is for a cloned CV
132 padnew_SAVE save old globals
133 padnew_SAVESUB also save extra stuff for start of sub
139 Perl_pad_new(pTHX_ int flags)
142 AV *padlist, *padname, *pad;
144 ASSERT_CURPAD_LEGAL("pad_new");
146 /* XXX DAPM really need a new SAVEt_PAD which restores all or most
147 * vars (based on flags) rather than storing vals + addresses for
148 * each individually. Also see pad_block_start.
149 * XXX DAPM Try to see whether all these conditionals are required
152 /* save existing state, ... */
154 if (flags & padnew_SAVE) {
156 SAVESPTR(PL_comppad_name);
157 if (! (flags & padnew_CLONE)) {
159 SAVEI32(PL_comppad_name_fill);
160 SAVEI32(PL_min_intro_pending);
161 SAVEI32(PL_max_intro_pending);
162 SAVEI32(PL_cv_has_eval);
163 if (flags & padnew_SAVESUB) {
164 SAVEI32(PL_pad_reset_pending);
168 /* XXX DAPM interestingly, PL_comppad_name_floor never seems to be
169 * saved - check at some pt that this is okay */
171 /* ... create new pad ... */
177 if (flags & padnew_CLONE) {
178 /* XXX DAPM I dont know why cv_clone needs it
179 * doing differently yet - perhaps this separate branch can be
180 * dispensed with eventually ???
183 AV * const a0 = newAV(); /* will be @_ */
185 av_store(pad, 0, (SV*)a0);
189 av_store(pad, 0, NULL);
193 av_store(padlist, 0, (SV*)padname);
194 av_store(padlist, 1, (SV*)pad);
196 /* ... then update state variables */
198 PL_comppad_name = (AV*)(*av_fetch(padlist, 0, FALSE));
199 PL_comppad = (AV*)(*av_fetch(padlist, 1, FALSE));
200 PL_curpad = AvARRAY(PL_comppad);
202 if (! (flags & padnew_CLONE)) {
203 PL_comppad_name_fill = 0;
204 PL_min_intro_pending = 0;
209 DEBUG_X(PerlIO_printf(Perl_debug_log,
210 "Pad 0x%"UVxf"[0x%"UVxf"] new: compcv=0x%"UVxf
211 " name=0x%"UVxf" flags=0x%"UVxf"\n",
212 PTR2UV(PL_comppad), PTR2UV(PL_curpad), PTR2UV(PL_compcv),
213 PTR2UV(padname), (UV)flags
217 return (PADLIST*)padlist;
221 =for apidoc pad_undef
223 Free the padlist associated with a CV.
224 If parts of it happen to be current, we null the relevant
225 PL_*pad* global vars so that we don't have any dangling references left.
226 We also repoint the CvOUTSIDE of any about-to-be-orphaned
227 inner subs to the outer of this cv.
229 (This function should really be called pad_free, but the name was already
236 Perl_pad_undef(pTHX_ CV* cv)
240 const PADLIST * const padlist = CvPADLIST(cv);
242 pad_peg("pad_undef");
245 if (SvIS_FREED(padlist)) /* may be during global destruction */
248 DEBUG_X(PerlIO_printf(Perl_debug_log,
249 "Pad undef: cv=0x%"UVxf" padlist=0x%"UVxf"\n",
250 PTR2UV(cv), PTR2UV(padlist))
253 /* detach any '&' anon children in the pad; if afterwards they
254 * are still live, fix up their CvOUTSIDEs to point to our outside,
256 /* XXX DAPM for efficiency, we should only do this if we know we have
257 * children, or integrate this loop with general cleanup */
259 if (!PL_dirty) { /* don't bother during global destruction */
260 CV * const outercv = CvOUTSIDE(cv);
261 const U32 seq = CvOUTSIDE_SEQ(cv);
262 AV * const comppad_name = (AV*)AvARRAY(padlist)[0];
263 SV ** const namepad = AvARRAY(comppad_name);
264 AV * const comppad = (AV*)AvARRAY(padlist)[1];
265 SV ** const curpad = AvARRAY(comppad);
266 for (ix = AvFILLp(comppad_name); ix > 0; ix--) {
267 SV * const namesv = namepad[ix];
268 if (namesv && namesv != &PL_sv_undef
269 && *SvPVX_const(namesv) == '&')
271 CV * const innercv = (CV*)curpad[ix];
272 U32 inner_rc = SvREFCNT(innercv);
275 SvREFCNT_dec(namesv);
277 if (SvREFCNT(comppad) < 2) { /* allow for /(?{ sub{} })/ */
279 SvREFCNT_dec(innercv);
283 /* in use, not just a prototype */
284 if (inner_rc && (CvOUTSIDE(innercv) == cv)) {
285 assert(CvWEAKOUTSIDE(innercv));
286 /* don't relink to grandfather if he's being freed */
287 if (outercv && SvREFCNT(outercv)) {
288 CvWEAKOUTSIDE_off(innercv);
289 CvOUTSIDE(innercv) = outercv;
290 CvOUTSIDE_SEQ(innercv) = seq;
291 SvREFCNT_inc_simple_void_NN(outercv);
294 CvOUTSIDE(innercv) = NULL;
301 ix = AvFILLp(padlist);
303 const SV* const sv = AvARRAY(padlist)[ix--];
305 if (sv == (SV*)PL_comppad_name)
306 PL_comppad_name = NULL;
307 else if (sv == (SV*)PL_comppad) {
314 SvREFCNT_dec((SV*)CvPADLIST(cv));
315 CvPADLIST(cv) = NULL;
322 =for apidoc pad_add_name
324 Create a new name and associated PADMY SV in the current pad; return the
326 If C<typestash> is valid, the name is for a typed lexical; set the
327 name's stash to that value.
328 If C<ourstash> is valid, it's an our lexical, set the name's
329 OURSTASH to that value
331 If fake, it means we're cloning an existing entry
337 Perl_pad_add_name(pTHX_ const char *name, HV* typestash, HV* ourstash, bool fake, bool state)
340 const PADOFFSET offset = pad_alloc(OP_PADSV, SVs_PADMY);
341 SV* const namesv = newSV(0);
343 ASSERT_CURPAD_ACTIVE("pad_add_name");
346 sv_upgrade(namesv, (ourstash || typestash) ? SVt_PVMG : SVt_PVNV);
347 sv_setpv(namesv, name);
350 SvPAD_TYPED_on(namesv);
351 SvSTASH_set(namesv, (HV*)SvREFCNT_inc_simple_NN((SV*)typestash));
354 SvPAD_OUR_on(namesv);
355 OURSTASH_set(namesv, ourstash);
356 SvREFCNT_inc_simple_void_NN(ourstash);
359 SvPAD_STATE_on(namesv);
362 av_store(PL_comppad_name, offset, namesv);
365 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
366 "Pad addname: %ld \"%s\" FAKE\n", (long)offset, name));
369 /* not yet introduced */
370 SvNV_set(namesv, (NV)PAD_MAX); /* min */
371 SvIV_set(namesv, 0); /* max */
373 if (!PL_min_intro_pending)
374 PL_min_intro_pending = offset;
375 PL_max_intro_pending = offset;
376 /* if it's not a simple scalar, replace with an AV or HV */
377 /* XXX DAPM since slot has been allocated, replace
378 * av_store with PL_curpad[offset] ? */
380 av_store(PL_comppad, offset, (SV*)newAV());
381 else if (*name == '%')
382 av_store(PL_comppad, offset, (SV*)newHV());
383 SvPADMY_on(PL_curpad[offset]);
384 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
385 "Pad addname: %ld \"%s\" new lex=0x%"UVxf"\n",
386 (long)offset, name, PTR2UV(PL_curpad[offset])));
396 =for apidoc pad_alloc
398 Allocate a new my or tmp pad entry. For a my, simply push a null SV onto
399 the end of PL_comppad, but for a tmp, scan the pad from PL_padix upwards
400 for a slot which has no name and no active value.
405 /* XXX DAPM integrate alloc(), add_name() and add_anon(),
406 * or at least rationalise ??? */
407 /* And flag whether the incoming name is UTF8 or 8 bit?
408 Could do this either with the +ve/-ve hack of the HV code, or expanding
409 the flag bits. Either way, this makes proper Unicode safe pad support.
410 Also could change the sv structure to make the NV a union with 2 U32s,
411 so that SvCUR() could stop being overloaded in pad SVs.
416 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
422 PERL_UNUSED_ARG(optype);
423 ASSERT_CURPAD_ACTIVE("pad_alloc");
425 if (AvARRAY(PL_comppad) != PL_curpad)
426 Perl_croak(aTHX_ "panic: pad_alloc");
427 if (PL_pad_reset_pending)
429 if (tmptype & SVs_PADMY) {
430 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
431 retval = AvFILLp(PL_comppad);
434 SV * const * const names = AvARRAY(PL_comppad_name);
435 const SSize_t names_fill = AvFILLp(PL_comppad_name);
438 * "foreach" index vars temporarily become aliases to non-"my"
439 * values. Thus we must skip, not just pad values that are
440 * marked as current pad values, but also those with names.
442 /* HVDS why copy to sv here? we don't seem to use it */
443 if (++PL_padix <= names_fill &&
444 (sv = names[PL_padix]) && sv != &PL_sv_undef)
446 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
447 if (!(SvFLAGS(sv) & (SVs_PADTMP | SVs_PADMY)) &&
448 !IS_PADGV(sv) && !IS_PADCONST(sv))
453 SvFLAGS(sv) |= tmptype;
454 PL_curpad = AvARRAY(PL_comppad);
456 DEBUG_X(PerlIO_printf(Perl_debug_log,
457 "Pad 0x%"UVxf"[0x%"UVxf"] alloc: %ld for %s\n",
458 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long) retval,
459 PL_op_name[optype]));
460 #ifdef DEBUG_LEAKING_SCALARS
461 sv->sv_debug_optype = optype;
462 sv->sv_debug_inpad = 1;
464 return (PADOFFSET)retval;
468 =for apidoc pad_add_anon
470 Add an anon code entry to the current compiling pad
476 Perl_pad_add_anon(pTHX_ SV* sv, OPCODE op_type)
480 SV* const name = newSV(0);
482 sv_upgrade(name, SVt_PVNV);
483 sv_setpvn(name, "&", 1);
486 ix = pad_alloc(op_type, SVs_PADMY);
487 av_store(PL_comppad_name, ix, name);
488 /* XXX DAPM use PL_curpad[] ? */
489 av_store(PL_comppad, ix, sv);
492 /* to avoid ref loops, we never have parent + child referencing each
493 * other simultaneously */
494 if (CvOUTSIDE((CV*)sv)) {
495 assert(!CvWEAKOUTSIDE((CV*)sv));
496 CvWEAKOUTSIDE_on((CV*)sv);
497 SvREFCNT_dec(CvOUTSIDE((CV*)sv));
505 =for apidoc pad_check_dup
507 Check for duplicate declarations: report any of:
508 * a my in the current scope with the same name;
509 * an our (anywhere in the pad) with the same name and the same stash
511 C<is_our> indicates that the name to check is an 'our' declaration
516 /* XXX DAPM integrate this into pad_add_name ??? */
519 Perl_pad_check_dup(pTHX_ const char *name, bool is_our, const HV *ourstash)
525 ASSERT_CURPAD_ACTIVE("pad_check_dup");
526 if (AvFILLp(PL_comppad_name) < 0 || !ckWARN(WARN_MISC))
527 return; /* nothing to check */
529 svp = AvARRAY(PL_comppad_name);
530 top = AvFILLp(PL_comppad_name);
531 /* check the current scope */
532 /* XXX DAPM - why the (I32) cast - shouldn't we ensure they're the same
534 for (off = top; (I32)off > PL_comppad_name_floor; off--) {
535 SV * const sv = svp[off];
537 && sv != &PL_sv_undef
539 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
540 && strEQ(name, SvPVX_const(sv)))
542 if (is_our && (SvPAD_OUR(sv)))
543 break; /* "our" masking "our" */
544 Perl_warner(aTHX_ packWARN(WARN_MISC),
545 "\"%s\" variable %s masks earlier declaration in same %s",
546 (is_our ? "our" : PL_in_my == KEY_my ? "my" : "state"),
548 (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
553 /* check the rest of the pad */
556 SV * const sv = svp[off];
558 && sv != &PL_sv_undef
560 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
561 && OURSTASH(sv) == ourstash
562 && strEQ(name, SvPVX_const(sv)))
564 Perl_warner(aTHX_ packWARN(WARN_MISC),
565 "\"our\" variable %s redeclared", name);
566 if ((I32)off <= PL_comppad_name_floor)
567 Perl_warner(aTHX_ packWARN(WARN_MISC),
568 "\t(Did you mean \"local\" instead of \"our\"?)\n");
571 } while ( off-- > 0 );
577 =for apidoc pad_findmy
579 Given a lexical name, try to find its offset, first in the current pad,
580 or failing that, in the pads of any lexically enclosing subs (including
581 the complications introduced by eval). If the name is found in an outer pad,
582 then a fake entry is added to the current pad.
583 Returns the offset in the current pad, or NOT_IN_PAD on failure.
589 Perl_pad_findmy(pTHX_ const char *name)
598 pad_peg("pad_findmy");
599 offset = pad_findlex(name, PL_compcv, PL_cop_seqmax, 1,
600 NULL, &out_sv, &out_flags);
601 if ((PADOFFSET)offset != NOT_IN_PAD)
604 /* look for an our that's being introduced; this allows
605 * our $foo = 0 unless defined $foo;
606 * to not give a warning. (Yes, this is a hack) */
608 nameav = (AV*)AvARRAY(CvPADLIST(PL_compcv))[0];
609 name_svp = AvARRAY(nameav);
610 for (offset = AvFILLp(nameav); offset > 0; offset--) {
611 const SV * const namesv = name_svp[offset];
612 if (namesv && namesv != &PL_sv_undef
614 && (SvPAD_OUR(namesv))
615 && strEQ(SvPVX_const(namesv), name)
616 && U_32(SvNVX(namesv)) == PAD_MAX /* min */
624 * Returns the offset of a lexical $_, if there is one, at run time.
625 * Used by the UNDERBAR XS macro.
629 Perl_find_rundefsvoffset(pTHX)
634 return pad_findlex("$_", find_runcv(NULL), PL_curcop->cop_seq, 1,
635 NULL, &out_sv, &out_flags);
639 =for apidoc pad_findlex
641 Find a named lexical anywhere in a chain of nested pads. Add fake entries
642 in the inner pads if it's found in an outer one.
644 Returns the offset in the bottom pad of the lex or the fake lex.
645 cv is the CV in which to start the search, and seq is the current cop_seq
646 to match against. If warn is true, print appropriate warnings. The out_*
647 vars return values, and so are pointers to where the returned values
648 should be stored. out_capture, if non-null, requests that the innermost
649 instance of the lexical is captured; out_name_sv is set to the innermost
650 matched namesv or fake namesv; out_flags returns the flags normally
651 associated with the IVX field of a fake namesv.
653 Note that pad_findlex() is recursive; it recurses up the chain of CVs,
654 then comes back down, adding fake entries as it goes. It has to be this way
655 because fake namesvs in anon protoypes have to store in NVX the index into
661 /* Flags set in the SvIVX field of FAKE namesvs */
663 #define PAD_FAKELEX_ANON 1 /* the lex is declared in an ANON, or ... */
664 #define PAD_FAKELEX_MULTI 2 /* the lex can be instantiated multiple times */
666 /* the CV has finished being compiled. This is not a sufficient test for
667 * all CVs (eg XSUBs), but suffices for the CVs found in a lexical chain */
668 #define CvCOMPILED(cv) CvROOT(cv)
670 /* the CV does late binding of its lexicals */
671 #define CvLATE(cv) (CvANON(cv) || SvTYPE(cv) == SVt_PVFM)
675 S_pad_findlex(pTHX_ const char *name, const CV* cv, U32 seq, int warn,
676 SV** out_capture, SV** out_name_sv, int *out_flags)
679 I32 offset, new_offset;
682 const AV * const padlist = CvPADLIST(cv);
686 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
687 "Pad findlex cv=0x%"UVxf" searching \"%s\" seq=%d%s\n",
688 PTR2UV(cv), name, (int)seq, out_capture ? " capturing" : "" ));
690 /* first, search this pad */
692 if (padlist) { /* not an undef CV */
694 const AV * const nameav = (AV*)AvARRAY(padlist)[0];
695 SV * const * const name_svp = AvARRAY(nameav);
697 for (offset = AvFILLp(nameav); offset > 0; offset--) {
698 const SV * const namesv = name_svp[offset];
699 if (namesv && namesv != &PL_sv_undef
700 && strEQ(SvPVX_const(namesv), name))
703 fake_offset = offset; /* in case we don't find a real one */
704 else if ( seq > U_32(SvNVX(namesv)) /* min */
705 && seq <= (U32)SvIVX(namesv)) /* max */
710 if (offset > 0 || fake_offset > 0 ) { /* a match! */
711 if (offset > 0) { /* not fake */
713 *out_name_sv = name_svp[offset]; /* return the namesv */
715 /* set PAD_FAKELEX_MULTI if this lex can have multiple
716 * instances. For now, we just test !CvUNIQUE(cv), but
717 * ideally, we should detect my's declared within loops
718 * etc - this would allow a wider range of 'not stayed
719 * shared' warnings. We also treated alreadly-compiled
720 * lexes as not multi as viewed from evals. */
722 *out_flags = CvANON(cv) ?
724 (!CvUNIQUE(cv) && ! CvCOMPILED(cv))
725 ? PAD_FAKELEX_MULTI : 0;
727 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
728 "Pad findlex cv=0x%"UVxf" matched: offset=%ld (%ld,%ld)\n",
729 PTR2UV(cv), (long)offset, (long)U_32(SvNVX(*out_name_sv)),
730 (long)SvIVX(*out_name_sv)));
732 else { /* fake match */
733 offset = fake_offset;
734 *out_name_sv = name_svp[offset]; /* return the namesv */
735 *out_flags = SvIVX(*out_name_sv);
736 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
737 "Pad findlex cv=0x%"UVxf" matched: offset=%ld flags=0x%lx index=%lu\n",
738 PTR2UV(cv), (long)offset, (unsigned long)*out_flags,
739 (unsigned long)SvNVX(*out_name_sv)
743 /* return the lex? */
748 if (SvPAD_OUR(*out_name_sv)) {
753 /* trying to capture from an anon prototype? */
755 ? CvANON(cv) && CvCLONE(cv) && !CvCLONED(cv)
756 : *out_flags & PAD_FAKELEX_ANON)
758 if (warn && ckWARN(WARN_CLOSURE))
759 Perl_warner(aTHX_ packWARN(WARN_CLOSURE),
760 "Variable \"%s\" is not available", name);
767 if (!CvCOMPILED(cv) && (*out_flags & PAD_FAKELEX_MULTI)
768 && warn && ckWARN(WARN_CLOSURE)) {
770 Perl_warner(aTHX_ packWARN(WARN_CLOSURE),
771 "Variable \"%s\" will not stay shared", name);
774 if (fake_offset && CvANON(cv)
775 && CvCLONE(cv) &&!CvCLONED(cv))
778 /* not yet caught - look further up */
779 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
780 "Pad findlex cv=0x%"UVxf" chasing lex in outer pad\n",
783 (void) pad_findlex(name, CvOUTSIDE(cv),
785 newwarn, out_capture, out_name_sv, out_flags);
790 *out_capture = AvARRAY((AV*)AvARRAY(padlist)[
791 CvDEPTH(cv) ? CvDEPTH(cv) : 1])[offset];
792 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
793 "Pad findlex cv=0x%"UVxf" found lex=0x%"UVxf"\n",
794 PTR2UV(cv), PTR2UV(*out_capture)));
796 if (SvPADSTALE(*out_capture)) {
797 if (ckWARN(WARN_CLOSURE))
798 Perl_warner(aTHX_ packWARN(WARN_CLOSURE),
799 "Variable \"%s\" is not available", name);
805 *out_capture = sv_2mortal((SV*)newAV());
806 else if (*name == '%')
807 *out_capture = sv_2mortal((SV*)newHV());
809 *out_capture = sv_newmortal();
817 /* it's not in this pad - try above */
822 /* out_capture non-null means caller wants us to capture lex; in
823 * addition we capture ourselves unless it's an ANON/format */
824 new_capturep = out_capture ? out_capture :
825 CvLATE(cv) ? NULL : &new_capture;
827 offset = pad_findlex(name, CvOUTSIDE(cv), CvOUTSIDE_SEQ(cv), 1,
828 new_capturep, out_name_sv, out_flags);
829 if ((PADOFFSET)offset == NOT_IN_PAD)
832 /* found in an outer CV. Add appropriate fake entry to this pad */
834 /* don't add new fake entries (via eval) to CVs that we have already
835 * finished compiling, or to undef CVs */
836 if (CvCOMPILED(cv) || !padlist)
837 return 0; /* this dummy (and invalid) value isnt used by the caller */
841 AV * const ocomppad_name = PL_comppad_name;
842 PAD * const ocomppad = PL_comppad;
843 PL_comppad_name = (AV*)AvARRAY(padlist)[0];
844 PL_comppad = (AV*)AvARRAY(padlist)[1];
845 PL_curpad = AvARRAY(PL_comppad);
847 new_offset = pad_add_name(
848 SvPVX_const(*out_name_sv),
849 SvPAD_TYPED(*out_name_sv)
850 ? SvSTASH(*out_name_sv) : NULL,
851 OURSTASH(*out_name_sv),
853 0 /* not a state variable */
856 new_namesv = AvARRAY(PL_comppad_name)[new_offset];
857 SvIV_set(new_namesv, *out_flags);
859 SvNV_set(new_namesv, (NV)0);
860 if (SvPAD_OUR(new_namesv)) {
861 NOOP; /* do nothing */
863 else if (CvLATE(cv)) {
864 /* delayed creation - just note the offset within parent pad */
865 SvNV_set(new_namesv, (NV)offset);
869 /* immediate creation - capture outer value right now */
870 av_store(PL_comppad, new_offset, SvREFCNT_inc(*new_capturep));
871 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
872 "Pad findlex cv=0x%"UVxf" saved captured sv 0x%"UVxf" at offset %ld\n",
873 PTR2UV(cv), PTR2UV(*new_capturep), (long)new_offset));
875 *out_name_sv = new_namesv;
876 *out_flags = SvIVX(new_namesv);
878 PL_comppad_name = ocomppad_name;
879 PL_comppad = ocomppad;
880 PL_curpad = ocomppad ? AvARRAY(ocomppad) : NULL;
890 Get the value at offset po in the current pad.
891 Use macro PAD_SV instead of calling this function directly.
898 Perl_pad_sv(pTHX_ PADOFFSET po)
901 ASSERT_CURPAD_ACTIVE("pad_sv");
904 Perl_croak(aTHX_ "panic: pad_sv po");
905 DEBUG_X(PerlIO_printf(Perl_debug_log,
906 "Pad 0x%"UVxf"[0x%"UVxf"] sv: %ld sv=0x%"UVxf"\n",
907 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long)po, PTR2UV(PL_curpad[po]))
909 return PL_curpad[po];
914 =for apidoc pad_setsv
916 Set the entry at offset po in the current pad to sv.
917 Use the macro PAD_SETSV() rather than calling this function directly.
923 Perl_pad_setsv(pTHX_ PADOFFSET po, SV* sv)
926 ASSERT_CURPAD_ACTIVE("pad_setsv");
928 DEBUG_X(PerlIO_printf(Perl_debug_log,
929 "Pad 0x%"UVxf"[0x%"UVxf"] setsv: %ld sv=0x%"UVxf"\n",
930 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long)po, PTR2UV(sv))
939 =for apidoc pad_block_start
941 Update the pad compilation state variables on entry to a new block
947 * - integrate this in general state-saving routine ???
948 * - combine with the state-saving going on in pad_new ???
949 * - introduce a new SAVE type that does all this in one go ?
953 Perl_pad_block_start(pTHX_ int full)
956 ASSERT_CURPAD_ACTIVE("pad_block_start");
957 SAVEI32(PL_comppad_name_floor);
958 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
960 PL_comppad_name_fill = PL_comppad_name_floor;
961 if (PL_comppad_name_floor < 0)
962 PL_comppad_name_floor = 0;
963 SAVEI32(PL_min_intro_pending);
964 SAVEI32(PL_max_intro_pending);
965 PL_min_intro_pending = 0;
966 SAVEI32(PL_comppad_name_fill);
967 SAVEI32(PL_padix_floor);
968 PL_padix_floor = PL_padix;
969 PL_pad_reset_pending = FALSE;
976 "Introduce" my variables to visible status.
988 ASSERT_CURPAD_ACTIVE("intro_my");
989 if (! PL_min_intro_pending)
990 return PL_cop_seqmax;
992 svp = AvARRAY(PL_comppad_name);
993 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
994 SV * const sv = svp[i];
996 if (sv && sv != &PL_sv_undef && !SvFAKE(sv) && !SvIVX(sv)) {
997 SvIV_set(sv, PAD_MAX); /* Don't know scope end yet. */
998 SvNV_set(sv, (NV)PL_cop_seqmax);
999 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1000 "Pad intromy: %ld \"%s\", (%ld,%ld)\n",
1001 (long)i, SvPVX_const(sv),
1002 (long)U_32(SvNVX(sv)), (long)SvIVX(sv))
1006 PL_min_intro_pending = 0;
1007 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
1008 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1009 "Pad intromy: seq -> %ld\n", (long)(PL_cop_seqmax+1)));
1011 return PL_cop_seqmax++;
1015 =for apidoc pad_leavemy
1017 Cleanup at end of scope during compilation: set the max seq number for
1018 lexicals in this scope and warn of any lexicals that never got introduced.
1024 Perl_pad_leavemy(pTHX)
1028 SV * const * const svp = AvARRAY(PL_comppad_name);
1030 PL_pad_reset_pending = FALSE;
1032 ASSERT_CURPAD_ACTIVE("pad_leavemy");
1033 if (PL_min_intro_pending && PL_comppad_name_fill < PL_min_intro_pending) {
1034 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
1035 const SV * const sv = svp[off];
1036 if (sv && sv != &PL_sv_undef
1037 && !SvFAKE(sv) && ckWARN_d(WARN_INTERNAL))
1038 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
1039 "%"SVf" never introduced",
1043 /* "Deintroduce" my variables that are leaving with this scope. */
1044 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_fill; off--) {
1045 const SV * const sv = svp[off];
1046 if (sv && sv != &PL_sv_undef && !SvFAKE(sv) && SvIVX(sv) == PAD_MAX) {
1047 SvIV_set(sv, PL_cop_seqmax);
1048 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1049 "Pad leavemy: %ld \"%s\", (%ld,%ld)\n",
1050 (long)off, SvPVX_const(sv),
1051 (long)U_32(SvNVX(sv)), (long)SvIVX(sv))
1056 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1057 "Pad leavemy: seq = %ld\n", (long)PL_cop_seqmax));
1062 =for apidoc pad_swipe
1064 Abandon the tmp in the current pad at offset po and replace with a
1071 Perl_pad_swipe(pTHX_ PADOFFSET po, bool refadjust)
1074 ASSERT_CURPAD_LEGAL("pad_swipe");
1077 if (AvARRAY(PL_comppad) != PL_curpad)
1078 Perl_croak(aTHX_ "panic: pad_swipe curpad");
1080 Perl_croak(aTHX_ "panic: pad_swipe po");
1082 DEBUG_X(PerlIO_printf(Perl_debug_log,
1083 "Pad 0x%"UVxf"[0x%"UVxf"] swipe: %ld\n",
1084 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long)po));
1087 SvPADTMP_off(PL_curpad[po]);
1089 SvREFCNT_dec(PL_curpad[po]);
1092 /* if pad tmps aren't shared between ops, then there's no need to
1093 * create a new tmp when an existing op is freed */
1094 #ifdef USE_BROKEN_PAD_RESET
1095 PL_curpad[po] = newSV(0);
1096 SvPADTMP_on(PL_curpad[po]);
1098 PL_curpad[po] = &PL_sv_undef;
1100 if ((I32)po < PL_padix)
1106 =for apidoc pad_reset
1108 Mark all the current temporaries for reuse
1113 /* XXX pad_reset() is currently disabled because it results in serious bugs.
1114 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
1115 * on the stack by OPs that use them, there are several ways to get an alias
1116 * to a shared TARG. Such an alias will change randomly and unpredictably.
1117 * We avoid doing this until we can think of a Better Way.
1120 Perl_pad_reset(pTHX)
1123 #ifdef USE_BROKEN_PAD_RESET
1124 if (AvARRAY(PL_comppad) != PL_curpad)
1125 Perl_croak(aTHX_ "panic: pad_reset curpad");
1127 DEBUG_X(PerlIO_printf(Perl_debug_log,
1128 "Pad 0x%"UVxf"[0x%"UVxf"] reset: padix %ld -> %ld",
1129 PTR2UV(PL_comppad), PTR2UV(PL_curpad),
1130 (long)PL_padix, (long)PL_padix_floor
1134 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
1136 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
1137 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
1138 SvPADTMP_off(PL_curpad[po]);
1140 PL_padix = PL_padix_floor;
1143 PL_pad_reset_pending = FALSE;
1148 =for apidoc pad_tidy
1150 Tidy up a pad after we've finished compiling it:
1151 * remove most stuff from the pads of anonsub prototypes;
1153 * mark tmps as such.
1158 /* XXX DAPM surely most of this stuff should be done properly
1159 * at the right time beforehand, rather than going around afterwards
1160 * cleaning up our mistakes ???
1164 Perl_pad_tidy(pTHX_ padtidy_type type)
1168 ASSERT_CURPAD_ACTIVE("pad_tidy");
1170 /* If this CV has had any 'eval-capable' ops planted in it
1171 * (ie it contains eval '...', //ee, /$var/ or /(?{..})/), Then any
1172 * anon prototypes in the chain of CVs should be marked as cloneable,
1173 * so that for example the eval's CV in C<< sub { eval '$x' } >> gets
1174 * the right CvOUTSIDE.
1175 * If running with -d, *any* sub may potentially have an eval
1176 * excuted within it.
1179 if (PL_cv_has_eval || PL_perldb) {
1181 for (cv = PL_compcv ;cv; cv = CvOUTSIDE(cv)) {
1182 if (cv != PL_compcv && CvCOMPILED(cv))
1183 break; /* no need to mark already-compiled code */
1185 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1186 "Pad clone on cv=0x%"UVxf"\n", PTR2UV(cv)));
1192 /* extend curpad to match namepad */
1193 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
1194 av_store(PL_comppad_name, AvFILLp(PL_comppad), NULL);
1196 if (type == padtidy_SUBCLONE) {
1197 SV * const * const namep = AvARRAY(PL_comppad_name);
1200 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
1203 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
1206 * The only things that a clonable function needs in its
1207 * pad are anonymous subs.
1208 * The rest are created anew during cloning.
1210 if (!((namesv = namep[ix]) != NULL &&
1211 namesv != &PL_sv_undef &&
1212 *SvPVX_const(namesv) == '&'))
1214 SvREFCNT_dec(PL_curpad[ix]);
1215 PL_curpad[ix] = NULL;
1219 else if (type == padtidy_SUB) {
1220 /* XXX DAPM this same bit of code keeps appearing !!! Rationalise? */
1221 AV * const av = newAV(); /* Will be @_ */
1223 av_store(PL_comppad, 0, (SV*)av);
1227 /* XXX DAPM rationalise these two similar branches */
1229 if (type == padtidy_SUB) {
1231 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
1232 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
1234 if (!SvPADMY(PL_curpad[ix]))
1235 SvPADTMP_on(PL_curpad[ix]);
1238 else if (type == padtidy_FORMAT) {
1240 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
1241 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
1242 SvPADTMP_on(PL_curpad[ix]);
1245 PL_curpad = AvARRAY(PL_comppad);
1250 =for apidoc pad_free
1252 Free the SV at offset po in the current pad.
1257 /* XXX DAPM integrate with pad_swipe ???? */
1259 Perl_pad_free(pTHX_ PADOFFSET po)
1262 ASSERT_CURPAD_LEGAL("pad_free");
1265 if (AvARRAY(PL_comppad) != PL_curpad)
1266 Perl_croak(aTHX_ "panic: pad_free curpad");
1268 Perl_croak(aTHX_ "panic: pad_free po");
1270 DEBUG_X(PerlIO_printf(Perl_debug_log,
1271 "Pad 0x%"UVxf"[0x%"UVxf"] free: %ld\n",
1272 PTR2UV(PL_comppad), PTR2UV(PL_curpad), (long)po)
1275 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef) {
1276 SvPADTMP_off(PL_curpad[po]);
1278 /* SV could be a shared hash key (eg bugid #19022) */
1280 #ifdef PERL_OLD_COPY_ON_WRITE
1281 !SvIsCOW(PL_curpad[po])
1283 !SvFAKE(PL_curpad[po])
1286 SvREADONLY_off(PL_curpad[po]); /* could be a freed constant */
1289 if ((I32)po < PL_padix)
1296 =for apidoc do_dump_pad
1298 Dump the contents of a padlist
1304 Perl_do_dump_pad(pTHX_ I32 level, PerlIO *file, PADLIST *padlist, int full)
1316 pad_name = (AV*)*av_fetch((AV*)padlist, 0, FALSE);
1317 pad = (AV*)*av_fetch((AV*)padlist, 1, FALSE);
1318 pname = AvARRAY(pad_name);
1319 ppad = AvARRAY(pad);
1320 Perl_dump_indent(aTHX_ level, file,
1321 "PADNAME = 0x%"UVxf"(0x%"UVxf") PAD = 0x%"UVxf"(0x%"UVxf")\n",
1322 PTR2UV(pad_name), PTR2UV(pname), PTR2UV(pad), PTR2UV(ppad)
1325 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
1326 const SV *namesv = pname[ix];
1327 if (namesv && namesv == &PL_sv_undef) {
1332 Perl_dump_indent(aTHX_ level+1, file,
1333 "%2d. 0x%"UVxf"<%lu> FAKE \"%s\" flags=0x%lx index=%lu\n",
1336 (unsigned long) (ppad[ix] ? SvREFCNT(ppad[ix]) : 0),
1337 SvPVX_const(namesv),
1338 (unsigned long)SvIVX(namesv),
1339 (unsigned long)SvNVX(namesv)
1343 Perl_dump_indent(aTHX_ level+1, file,
1344 "%2d. 0x%"UVxf"<%lu> (%ld,%ld) \"%s\"\n",
1347 (unsigned long) (ppad[ix] ? SvREFCNT(ppad[ix]) : 0),
1348 (long)U_32(SvNVX(namesv)),
1349 (long)SvIVX(namesv),
1354 Perl_dump_indent(aTHX_ level+1, file,
1355 "%2d. 0x%"UVxf"<%lu>\n",
1358 (unsigned long) (ppad[ix] ? SvREFCNT(ppad[ix]) : 0)
1369 dump the contents of a CV
1376 S_cv_dump(pTHX_ const CV *cv, const char *title)
1379 const CV * const outside = CvOUTSIDE(cv);
1380 AV* const padlist = CvPADLIST(cv);
1382 PerlIO_printf(Perl_debug_log,
1383 " %s: CV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
1386 (CvANON(cv) ? "ANON"
1387 : (SvTYPE(cv) == SVt_PVFM) ? "FORMAT"
1388 : (cv == PL_main_cv) ? "MAIN"
1389 : CvUNIQUE(cv) ? "UNIQUE"
1390 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
1393 : CvANON(outside) ? "ANON"
1394 : (outside == PL_main_cv) ? "MAIN"
1395 : CvUNIQUE(outside) ? "UNIQUE"
1396 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
1398 PerlIO_printf(Perl_debug_log,
1399 " PADLIST = 0x%"UVxf"\n", PTR2UV(padlist));
1400 do_dump_pad(1, Perl_debug_log, padlist, 1);
1402 #endif /* DEBUGGING */
1409 =for apidoc cv_clone
1411 Clone a CV: make a new CV which points to the same code etc, but which
1412 has a newly-created pad built by copying the prototype pad and capturing
1419 Perl_cv_clone(pTHX_ CV *proto)
1423 AV* const protopadlist = CvPADLIST(proto);
1424 const AV* const protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
1425 const AV* const protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
1426 SV** const pname = AvARRAY(protopad_name);
1427 SV** const ppad = AvARRAY(protopad);
1428 const I32 fname = AvFILLp(protopad_name);
1429 const I32 fpad = AvFILLp(protopad);
1435 assert(!CvUNIQUE(proto));
1437 /* Since cloneable anon subs can be nested, CvOUTSIDE may point
1438 * to a prototype; we instead want the cloned parent who called us.
1439 * Note that in general for formats, CvOUTSIDE != find_runcv */
1441 outside = CvOUTSIDE(proto);
1442 if (outside && CvCLONE(outside) && ! CvCLONED(outside))
1443 outside = find_runcv(NULL);
1444 depth = CvDEPTH(outside);
1445 assert(depth || SvTYPE(proto) == SVt_PVFM);
1448 assert(CvPADLIST(outside));
1451 SAVESPTR(PL_compcv);
1453 cv = PL_compcv = (CV*)newSV(0);
1454 sv_upgrade((SV *)cv, SvTYPE(proto));
1455 CvFLAGS(cv) = CvFLAGS(proto) & ~(CVf_CLONE|CVf_WEAKOUTSIDE);
1459 CvFILE(cv) = CvISXSUB(proto) ? CvFILE(proto)
1460 : savepv(CvFILE(proto));
1462 CvFILE(cv) = CvFILE(proto);
1464 CvGV(cv) = CvGV(proto);
1465 CvSTASH(cv) = CvSTASH(proto);
1467 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
1469 CvSTART(cv) = CvSTART(proto);
1470 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc_simple(outside);
1471 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(proto);
1474 sv_setpvn((SV*)cv, SvPVX_const(proto), SvCUR(proto));
1476 CvPADLIST(cv) = pad_new(padnew_CLONE|padnew_SAVE);
1478 av_fill(PL_comppad, fpad);
1479 for (ix = fname; ix >= 0; ix--)
1480 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
1482 PL_curpad = AvARRAY(PL_comppad);
1484 outpad = AvARRAY(AvARRAY(CvPADLIST(outside))[depth]);
1486 for (ix = fpad; ix > 0; ix--) {
1487 SV* const namesv = (ix <= fname) ? pname[ix] : NULL;
1489 if (namesv && namesv != &PL_sv_undef) { /* lexical */
1490 if (SvFAKE(namesv)) { /* lexical from outside? */
1491 sv = outpad[(I32)SvNVX(namesv)];
1493 /* formats may have an inactive parent */
1494 if (SvTYPE(proto) == SVt_PVFM && SvPADSTALE(sv)) {
1495 if (ckWARN(WARN_CLOSURE))
1496 Perl_warner(aTHX_ packWARN(WARN_CLOSURE),
1497 "Variable \"%s\" is not available", SvPVX_const(namesv));
1501 assert(!SvPADSTALE(sv));
1502 SvREFCNT_inc_simple_void_NN(sv);
1506 const char sigil = SvPVX_const(namesv)[0];
1508 sv = SvREFCNT_inc(ppad[ix]);
1509 else if (sigil == '@')
1511 else if (sigil == '%')
1518 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
1519 sv = SvREFCNT_inc_NN(ppad[ix]);
1529 PerlIO_printf(Perl_debug_log, "\nPad CV clone\n");
1530 cv_dump(outside, "Outside");
1531 cv_dump(proto, "Proto");
1538 /* Constant sub () { $x } closing over $x - see lib/constant.pm:
1539 * The prototype was marked as a candiate for const-ization,
1540 * so try to grab the current const value, and if successful,
1541 * turn into a const sub:
1543 SV* const const_sv = op_const_sv(CvSTART(cv), cv);
1546 cv = newCONSTSUB(CvSTASH(proto), NULL, const_sv);
1558 =for apidoc pad_fixup_inner_anons
1560 For any anon CVs in the pad, change CvOUTSIDE of that CV from
1561 old_cv to new_cv if necessary. Needed when a newly-compiled CV has to be
1562 moved to a pre-existing CV struct.
1568 Perl_pad_fixup_inner_anons(pTHX_ PADLIST *padlist, CV *old_cv, CV *new_cv)
1572 AV * const comppad_name = (AV*)AvARRAY(padlist)[0];
1573 AV * const comppad = (AV*)AvARRAY(padlist)[1];
1574 SV ** const namepad = AvARRAY(comppad_name);
1575 SV ** const curpad = AvARRAY(comppad);
1576 PERL_UNUSED_ARG(old_cv);
1578 for (ix = AvFILLp(comppad_name); ix > 0; ix--) {
1579 const SV * const namesv = namepad[ix];
1580 if (namesv && namesv != &PL_sv_undef
1581 && *SvPVX_const(namesv) == '&')
1583 CV * const innercv = (CV*)curpad[ix];
1584 assert(CvWEAKOUTSIDE(innercv));
1585 assert(CvOUTSIDE(innercv) == old_cv);
1586 CvOUTSIDE(innercv) = new_cv;
1593 =for apidoc pad_push
1595 Push a new pad frame onto the padlist, unless there's already a pad at
1596 this depth, in which case don't bother creating a new one. Then give
1597 the new pad an @_ in slot zero.
1603 Perl_pad_push(pTHX_ PADLIST *padlist, int depth)
1606 if (depth > AvFILLp(padlist)) {
1607 SV** const svp = AvARRAY(padlist);
1608 AV* const newpad = newAV();
1609 SV** const oldpad = AvARRAY(svp[depth-1]);
1610 I32 ix = AvFILLp((AV*)svp[1]);
1611 const I32 names_fill = AvFILLp((AV*)svp[0]);
1612 SV** const names = AvARRAY(svp[0]);
1615 for ( ;ix > 0; ix--) {
1616 if (names_fill >= ix && names[ix] != &PL_sv_undef) {
1617 const char sigil = SvPVX_const(names[ix])[0];
1618 if ((SvFLAGS(names[ix]) & SVf_FAKE) || sigil == '&') {
1619 /* outer lexical or anon code */
1620 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
1622 else { /* our own lexical */
1626 else if (sigil == '%')
1630 av_store(newpad, ix, sv);
1634 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
1635 av_store(newpad, ix, SvREFCNT_inc_NN(oldpad[ix]));
1638 /* save temporaries on recursion? */
1639 SV * const sv = newSV(0);
1640 av_store(newpad, ix, sv);
1646 av_store(newpad, 0, (SV*)av);
1649 av_store(padlist, depth, (SV*)newpad);
1650 AvFILLp(padlist) = depth;
1656 Perl_pad_compname_type(pTHX_ const PADOFFSET po)
1659 SV* const * const av = av_fetch(PL_comppad_name, po, FALSE);
1660 if ( SvPAD_TYPED(*av) ) {
1661 return SvSTASH(*av);
1668 * c-indentation-style: bsd
1670 * indent-tabs-mode: t
1673 * ex: set ts=8 sts=4 sw=4 noet: