-*- buffer-read-only: t -*- !!!!!!! DO NOT EDIT THIS FILE !!!!!!! This file is built by autodoc.pl extracting documentation from the C source files. =head1 NAME perlintern - autogenerated documentation of purely B Perl functions =head1 DESCRIPTION X X This file is the autogenerated documentation of functions in the Perl interpreter that are documented using Perl's internal documentation format but are not marked as part of the Perl API. In other words, B! =head1 Compile-time scope hooks =over 8 =item BhkENTRY X Return an entry from the BHK structure. I is a preprocessor token indicating which entry to return. If the appropriate flag is not set this will return NULL. The type of the return value depends on which entry you ask for. NOTE: this function is experimental and may change or be removed without notice. void * BhkENTRY(BHK *hk, which) =for hackers Found in file op.h =item BhkFLAGS X Return the BHK's flags. NOTE: this function is experimental and may change or be removed without notice. U32 BhkFLAGS(BHK *hk) =for hackers Found in file op.h =item CALL_BLOCK_HOOKS X Call all the registered block hooks for type I. I is a preprocessing token; the type of I depends on I. NOTE: this function is experimental and may change or be removed without notice. void CALL_BLOCK_HOOKS(which, arg) =for hackers Found in file op.h =back =head1 CV reference counts and CvOUTSIDE =over 8 =item CvWEAKOUTSIDE X Each CV has a pointer, C, to its lexically enclosing CV (if any). Because pointers to anonymous sub prototypes are stored in C<&> pad slots, it is a possible to get a circular reference, with the parent pointing to the child and vice-versa. To avoid the ensuing memory leak, we do not increment the reference count of the CV pointed to by C in the I that the parent has a C<&> pad slot pointing back to us. In this case, we set the C flag in the child. This allows us to determine under what circumstances we should decrement the refcount of the parent when freeing the child. There is a further complication with non-closure anonymous subs (i.e. those that do not refer to any lexicals outside that sub). In this case, the anonymous prototype is shared rather than being cloned. This has the consequence that the parent may be freed while there are still active children, eg BEGIN { $a = sub { eval '$x' } } In this case, the BEGIN is freed immediately after execution since there are no active references to it: the anon sub prototype has C set since it's not a closure, and $a points to the same CV, so it doesn't contribute to BEGIN's refcount either. When $a is executed, the C causes the chain of Cs to be followed, and the freed BEGIN is accessed. To avoid this, whenever a CV and its associated pad is freed, any C<&> entries in the pad are explicitly removed from the pad, and if the refcount of the pointed-to anon sub is still positive, then that child's C is set to point to its grandparent. This will only occur in the single specific case of a non-closure anon prototype having one or more active references (such as C<$a> above). One other thing to consider is that a CV may be merely undefined rather than freed, eg C. In this case, its refcount may not have reached zero, but we still delete its pad and its C etc. Since various children may still have their C pointing at this undefined CV, we keep its own C for the time being, so that the chain of lexical scopes is unbroken. For example, the following should print 123: my $x = 123; sub tmp { sub { eval '$x' } } my $a = tmp(); undef &tmp; print $a->(); bool CvWEAKOUTSIDE(CV *cv) =for hackers Found in file cv.h =back =head1 Embedding Functions =over 8 =item cv_dump X dump the contents of a CV void cv_dump(CV *cv, const char *title) =for hackers Found in file pad.c =item cv_forget_slab X When a CV has a reference count on its slab (CvSLABBED), it is responsible for making sure it is freed. (Hence, no two CVs should ever have a reference count on the same slab.) The CV only needs to reference the slab during compilation. Once it is compiled and CvROOT attached, it has finished its job, so it can forget the slab. void cv_forget_slab(CV *cv) =for hackers Found in file pad.c =item do_dump_pad X Dump the contents of a padlist void do_dump_pad(I32 level, PerlIO *file, PADLIST *padlist, int full) =for hackers Found in file pad.c =item intro_my X "Introduce" my variables to visible status. This is called during parsing at the end of each statement to make lexical variables visible to subsequent statements. U32 intro_my() =for hackers Found in file pad.c =item padlist_dup X Duplicates a pad. PADLIST * padlist_dup(PADLIST *srcpad, CLONE_PARAMS *param) =for hackers Found in file pad.c =item pad_alloc_name X Allocates a place in the currently-compiling pad (via L) and then stores a name for that entry. I is adopted and becomes the name entry; it must already contain the name string and be sufficiently upgraded. I and I and the C flag get added to I. None of the other processing of L is done. Returns the offset of the allocated pad slot. PADOFFSET pad_alloc_name(SV *namesv, U32 flags, HV *typestash, HV *ourstash) =for hackers Found in file pad.c =item pad_block_start X Update the pad compilation state variables on entry to a new block. void pad_block_start(int full) =for hackers Found in file pad.c =item pad_check_dup X Check for duplicate declarations: report any of: * a my in the current scope with the same name; * an our (anywhere in the pad) with the same name and the same stash as C C indicates that the name to check is an 'our' declaration. void pad_check_dup(SV *name, U32 flags, const HV *ourstash) =for hackers Found in file pad.c =item pad_findlex X Find a named lexical anywhere in a chain of nested pads. Add fake entries in the inner pads if it's found in an outer one. Returns the offset in the bottom pad of the lex or the fake lex. cv is the CV in which to start the search, and seq is the current cop_seq to match against. If warn is true, print appropriate warnings. The out_* vars return values, and so are pointers to where the returned values should be stored. out_capture, if non-null, requests that the innermost instance of the lexical is captured; out_name_sv is set to the innermost matched namesv or fake namesv; out_flags returns the flags normally associated with the IVX field of a fake namesv. Note that pad_findlex() is recursive; it recurses up the chain of CVs, then comes back down, adding fake entries as it goes. It has to be this way because fake namesvs in anon protoypes have to store in xlow the index into the parent pad. PADOFFSET pad_findlex(const char *namepv, STRLEN namelen, U32 flags, const CV* cv, U32 seq, int warn, SV** out_capture, SV** out_name_sv, int *out_flags) =for hackers Found in file pad.c =item pad_fixup_inner_anons X For any anon CVs in the pad, change CvOUTSIDE of that CV from old_cv to new_cv if necessary. Needed when a newly-compiled CV has to be moved to a pre-existing CV struct. void pad_fixup_inner_anons(PADLIST *padlist, CV *old_cv, CV *new_cv) =for hackers Found in file pad.c =item pad_free X Free the SV at offset po in the current pad. void pad_free(PADOFFSET po) =for hackers Found in file pad.c =item pad_leavemy X Cleanup at end of scope during compilation: set the max seq number for lexicals in this scope and warn of any lexicals that never got introduced. void pad_leavemy() =for hackers Found in file pad.c =item pad_push X Push a new pad frame onto the padlist, unless there's already a pad at this depth, in which case don't bother creating a new one. Then give the new pad an @_ in slot zero. void pad_push(PADLIST *padlist, int depth) =for hackers Found in file pad.c =item pad_reset X Mark all the current temporaries for reuse void pad_reset() =for hackers Found in file pad.c =item pad_swipe X Abandon the tmp in the current pad at offset po and replace with a new one. void pad_swipe(PADOFFSET po, bool refadjust) =for hackers Found in file pad.c =back =head1 Functions in file op.c =over 8 =item core_prototype X This function assigns the prototype of the named core function to C, or to a new mortal SV if C is NULL. It returns the modified C, or NULL if the core function has no prototype. C is a code as returned by C. It must not be equal to 0 or -KEY_CORE. SV * core_prototype(SV *sv, const char *name, const int code, int * const opnum) =for hackers Found in file op.c =back =head1 Functions in file pp_ctl.c =over 8 =item docatch X Check for the cases 0 or 3 of cur_env.je_ret, only used inside an eval context. 0 is used as continue inside eval, 3 is used for a die caught by an inner eval - continue inner loop See cop.h: je_mustcatch, when set at any runlevel to TRUE, means eval ops must establish a local jmpenv to handle exception traps. OP* docatch(OP *o) =for hackers Found in file pp_ctl.c =back =head1 GV Functions =over 8 =item gv_try_downgrade X If the typeglob C can be expressed more succinctly, by having something other than a real GV in its place in the stash, replace it with the optimised form. Basic requirements for this are that C is a real typeglob, is sufficiently ordinary, and is only referenced from its package. This function is meant to be used when a GV has been looked up in part to see what was there, causing upgrading, but based on what was found it turns out that the real GV isn't required after all. If C is a completely empty typeglob, it is deleted from the stash. If C is a typeglob containing only a sufficiently-ordinary constant sub, the typeglob is replaced with a scalar-reference placeholder that more compactly represents the same thing. NOTE: this function is experimental and may change or be removed without notice. void gv_try_downgrade(GV* gv) =for hackers Found in file gv.c =back =head1 Hash Manipulation Functions =over 8 =item hv_ename_add X Adds a name to a stash's internal list of effective names. See C. This is called when a stash is assigned to a new location in the symbol table. void hv_ename_add(HV *hv, const char *name, U32 len, U32 flags) =for hackers Found in file hv.c =item hv_ename_delete X Removes a name from a stash's internal list of effective names. If this is the name returned by C, then another name in the list will take its place (C will use it). This is called when a stash is deleted from the symbol table. void hv_ename_delete(HV *hv, const char *name, U32 len, U32 flags) =for hackers Found in file hv.c =item refcounted_he_chain_2hv X Generates and returns a C representing the content of a C chain. I is currently unused and must be zero. HV * refcounted_he_chain_2hv( const struct refcounted_he *c, U32 flags ) =for hackers Found in file hv.c =item refcounted_he_fetch_pv X Like L, but takes a nul-terminated string instead of a string/length pair. SV * refcounted_he_fetch_pv( const struct refcounted_he *chain, const char *key, U32 hash, U32 flags ) =for hackers Found in file hv.c =item refcounted_he_fetch_pvn X Search along a C chain for an entry with the key specified by I and I. If I has the C bit set, the key octets are interpreted as UTF-8, otherwise they are interpreted as Latin-1. I is a precomputed hash of the key string, or zero if it has not been precomputed. Returns a mortal scalar representing the value associated with the key, or C<&PL_sv_placeholder> if there is no value associated with the key. SV * refcounted_he_fetch_pvn( const struct refcounted_he *chain, const char *keypv, STRLEN keylen, U32 hash, U32 flags ) =for hackers Found in file hv.c =item refcounted_he_fetch_pvs X Like L, but takes a literal string instead of a string/length pair, and no precomputed hash. SV * refcounted_he_fetch_pvs( const struct refcounted_he *chain, const char *key, U32 flags ) =for hackers Found in file hv.h =item refcounted_he_fetch_sv X Like L, but takes a Perl scalar instead of a string/length pair. SV * refcounted_he_fetch_sv( const struct refcounted_he *chain, SV *key, U32 hash, U32 flags ) =for hackers Found in file hv.c =item refcounted_he_free X Decrements the reference count of a C by one. If the reference count reaches zero the structure's memory is freed, which (recursively) causes a reduction of its parent C's reference count. It is safe to pass a null pointer to this function: no action occurs in this case. void refcounted_he_free(struct refcounted_he *he) =for hackers Found in file hv.c =item refcounted_he_inc X Increment the reference count of a C. The pointer to the C is also returned. It is safe to pass a null pointer to this function: no action occurs and a null pointer is returned. struct refcounted_he * refcounted_he_inc( struct refcounted_he *he ) =for hackers Found in file hv.c =item refcounted_he_new_pv X Like L, but takes a nul-terminated string instead of a string/length pair. struct refcounted_he * refcounted_he_new_pv( struct refcounted_he *parent, const char *key, U32 hash, SV *value, U32 flags ) =for hackers Found in file hv.c =item refcounted_he_new_pvn X Creates a new C. This consists of a single key/value pair and a reference to an existing C chain (which may be empty), and thus forms a longer chain. When using the longer chain, the new key/value pair takes precedence over any entry for the same key further along the chain. The new key is specified by I and I. If I has the C bit set, the key octets are interpreted as UTF-8, otherwise they are interpreted as Latin-1. I is a precomputed hash of the key string, or zero if it has not been precomputed. I is the scalar value to store for this key. I is copied by this function, which thus does not take ownership of any reference to it, and later changes to the scalar will not be reflected in the value visible in the C. Complex types of scalar will not be stored with referential integrity, but will be coerced to strings. I may be either null or C<&PL_sv_placeholder> to indicate that no value is to be associated with the key; this, as with any non-null value, takes precedence over the existence of a value for the key further along the chain. I points to the rest of the C chain to be attached to the new C. This function takes ownership of one reference to I, and returns one reference to the new C. struct refcounted_he * refcounted_he_new_pvn( struct refcounted_he *parent, const char *keypv, STRLEN keylen, U32 hash, SV *value, U32 flags ) =for hackers Found in file hv.c =item refcounted_he_new_pvs X Like L, but takes a literal string instead of a string/length pair, and no precomputed hash. struct refcounted_he * refcounted_he_new_pvs( struct refcounted_he *parent, const char *key, SV *value, U32 flags ) =for hackers Found in file hv.h =item refcounted_he_new_sv X Like L, but takes a Perl scalar instead of a string/length pair. struct refcounted_he * refcounted_he_new_sv( struct refcounted_he *parent, SV *key, U32 hash, SV *value, U32 flags ) =for hackers Found in file hv.c =back =head1 IO Functions =over 8 =item start_glob X Function called by C to spawn a glob (or do the glob inside perl on VMS). This code used to be inline, but now perl uses C this glob starter is only used by miniperl during the build process. Moving it away shrinks pp_hot.c; shrinking pp_hot.c helps speed perl up. NOTE: this function is experimental and may change or be removed without notice. PerlIO* start_glob(SV *tmpglob, IO *io) =for hackers Found in file doio.c =back =head1 Magical Functions =over 8 =item magic_clearhint X Triggered by a delete from %^H, records the key to C. int magic_clearhint(SV* sv, MAGIC* mg) =for hackers Found in file mg.c =item magic_clearhints X Triggered by clearing %^H, resets C. int magic_clearhints(SV* sv, MAGIC* mg) =for hackers Found in file mg.c =item magic_methcall X Invoke a magic method (like FETCH). C and C are the tied thingy and the tie magic. C is the name of the method to call. C is the number of args (in addition to $self) to pass to the method. The C can be: G_DISCARD invoke method with G_DISCARD flag and don't return a value G_UNDEF_FILL fill the stack with argc pointers to PL_sv_undef The arguments themselves are any values following the C argument. Returns the SV (if any) returned by the method, or NULL on failure. SV* magic_methcall(SV *sv, const MAGIC *mg, const char *meth, U32 flags, U32 argc, ...) =for hackers Found in file mg.c =item magic_sethint X Triggered by a store to %^H, records the key/value pair to C. It is assumed that hints aren't storing anything that would need a deep copy. Maybe we should warn if we find a reference. int magic_sethint(SV* sv, MAGIC* mg) =for hackers Found in file mg.c =item mg_localize X Copy some of the magic from an existing SV to new localized version of that SV. Container magic (eg %ENV, $1, tie) gets copied, value magic doesn't (eg taint, pos). If setmagic is false then no set magic will be called on the new (empty) SV. This typically means that assignment will soon follow (e.g. 'local $x = $y'), and that will handle the magic. void mg_localize(SV* sv, SV* nsv, bool setmagic) =for hackers Found in file mg.c =back =head1 MRO Functions =over 8 =item mro_get_linear_isa_dfs X Returns the Depth-First Search linearization of @ISA the given stash. The return value is a read-only AV*. C should be 0 (it is used internally in this function's recursion). You are responsible for C on the return value if you plan to store it anywhere semi-permanently (otherwise it might be deleted out from under you the next time the cache is invalidated). AV* mro_get_linear_isa_dfs(HV* stash, U32 level) =for hackers Found in file mro.c =item mro_isa_changed_in X Takes the necessary steps (cache invalidations, mostly) when the @ISA of the given package has changed. Invoked by the C magic, should not need to invoke directly. void mro_isa_changed_in(HV* stash) =for hackers Found in file mro.c =item mro_package_moved X Call this function to signal to a stash that it has been assigned to another spot in the stash hierarchy. C is the stash that has been assigned. C is the stash it replaces, if any. C is the glob that is actually being assigned to. This can also be called with a null first argument to indicate that C has been deleted. This function invalidates isa caches on the old stash, on all subpackages nested inside it, and on the subclasses of all those, including non-existent packages that have corresponding entries in C. It also sets the effective names (C) on all the stashes as appropriate. If the C is present and is not in the symbol table, then this function simply returns. This checked will be skipped if C. void mro_package_moved(HV * const stash, HV * const oldstash, const GV * const gv, U32 flags) =for hackers Found in file mro.c =back =head1 Optree Manipulation Functions =over 8 =item finalize_optree X This function finalizes the optree. Should be called directly after the complete optree is built. It does some additional checking which can't be done in the normal ck_xxx functions and makes the tree thread-safe. void finalize_optree(OP* o) =for hackers Found in file op.c =back =head1 Pad Data Structures =over 8 =item CX_CURPAD_SAVE X Save the current pad in the given context block structure. void CX_CURPAD_SAVE(struct context) =for hackers Found in file pad.h =item CX_CURPAD_SV X Access the SV at offset po in the saved current pad in the given context block structure (can be used as an lvalue). SV * CX_CURPAD_SV(struct context, PADOFFSET po) =for hackers Found in file pad.h =item PadnameIsOUR X Whether this is an "our" variable. bool PadnameIsOUR(PADNAME pn) =for hackers Found in file pad.h =item PadnameIsSTATE X Whether this is a "state" variable. bool PadnameIsSTATE(PADNAME pn) =for hackers Found in file pad.h =item PadnameOURSTASH X The stash in which this "our" variable was declared. HV * PadnameOURSTASH() =for hackers Found in file pad.h =item PadnameOUTER X Whether this entry belongs to an outer pad. bool PadnameOUTER(PADNAME pn) =for hackers Found in file pad.h =item PadnameTYPE X The stash associated with a typed lexical. This returns the %Foo:: hash for C. HV * PadnameTYPE(PADNAME pn) =for hackers Found in file pad.h =item PAD_BASE_SV X Get the value from slot C in the base (DEPTH=1) pad of a padlist SV * PAD_BASE_SV(PADLIST padlist, PADOFFSET po) =for hackers Found in file pad.h =item PAD_CLONE_VARS X Clone the state variables associated with running and compiling pads. void PAD_CLONE_VARS(PerlInterpreter *proto_perl, CLONE_PARAMS* param) =for hackers Found in file pad.h =item PAD_COMPNAME_FLAGS X Return the flags for the current compiling pad name at offset C. Assumes a valid slot entry. U32 PAD_COMPNAME_FLAGS(PADOFFSET po) =for hackers Found in file pad.h =item PAD_COMPNAME_GEN X The generation number of the name at offset C in the current compiling pad (lvalue). Note that C is hijacked for this purpose. STRLEN PAD_COMPNAME_GEN(PADOFFSET po) =for hackers Found in file pad.h =item PAD_COMPNAME_GEN_set X Sets the generation number of the name at offset C in the current ling pad (lvalue) to C. Note that C is hijacked for this purpose. STRLEN PAD_COMPNAME_GEN_set(PADOFFSET po, int gen) =for hackers Found in file pad.h =item PAD_COMPNAME_OURSTASH X Return the stash associated with an C variable. Assumes the slot entry is a valid C lexical. HV * PAD_COMPNAME_OURSTASH(PADOFFSET po) =for hackers Found in file pad.h =item PAD_COMPNAME_PV X Return the name of the current compiling pad name at offset C. Assumes a valid slot entry. char * PAD_COMPNAME_PV(PADOFFSET po) =for hackers Found in file pad.h =item PAD_COMPNAME_TYPE X Return the type (stash) of the current compiling pad name at offset C. Must be a valid name. Returns null if not typed. HV * PAD_COMPNAME_TYPE(PADOFFSET po) =for hackers Found in file pad.h =item pad_peg X When PERL_MAD is enabled, this is a small no-op function that gets called at the start of each pad-related function. It can be breakpointed to track all pad operations. The parameter is a string indicating the type of pad operation being performed. NOTE: this function is experimental and may change or be removed without notice. void pad_peg(const char *s) =for hackers Found in file pad.c =item PAD_RESTORE_LOCAL X Restore the old pad saved into the local variable opad by PAD_SAVE_LOCAL() void PAD_RESTORE_LOCAL(PAD *opad) =for hackers Found in file pad.h =item PAD_SAVE_LOCAL X Save the current pad to the local variable opad, then make the current pad equal to npad void PAD_SAVE_LOCAL(PAD *opad, PAD *npad) =for hackers Found in file pad.h =item PAD_SAVE_SETNULLPAD X Save the current pad then set it to null. void PAD_SAVE_SETNULLPAD() =for hackers Found in file pad.h =item PAD_SETSV X Set the slot at offset C in the current pad to C SV * PAD_SETSV(PADOFFSET po, SV* sv) =for hackers Found in file pad.h =item PAD_SET_CUR X Set the current pad to be pad C in the padlist, saving the previous current pad. NB currently this macro expands to a string too long for some compilers, so it's best to replace it with SAVECOMPPAD(); PAD_SET_CUR_NOSAVE(padlist,n); void PAD_SET_CUR(PADLIST padlist, I32 n) =for hackers Found in file pad.h =item PAD_SET_CUR_NOSAVE X like PAD_SET_CUR, but without the save void PAD_SET_CUR_NOSAVE(PADLIST padlist, I32 n) =for hackers Found in file pad.h =item PAD_SV X Get the value at offset C in the current pad void PAD_SV(PADOFFSET po) =for hackers Found in file pad.h =item PAD_SVl X Lightweight and lvalue version of C. Get or set the value at offset C in the current pad. Unlike C, does not print diagnostics with -DX. For internal use only. SV * PAD_SVl(PADOFFSET po) =for hackers Found in file pad.h =item SAVECLEARSV X Clear the pointed to pad value on scope exit. (i.e. the runtime action of 'my') void SAVECLEARSV(SV **svp) =for hackers Found in file pad.h =item SAVECOMPPAD X save PL_comppad and PL_curpad void SAVECOMPPAD() =for hackers Found in file pad.h =item SAVEPADSV X Save a pad slot (used to restore after an iteration) XXX DAPM it would make more sense to make the arg a PADOFFSET void SAVEPADSV(PADOFFSET po) =for hackers Found in file pad.h =back =head1 Per-Interpreter Variables =over 8 =item PL_DBsingle X When Perl is run in debugging mode, with the B<-d> switch, this SV is a boolean which indicates whether subs are being single-stepped. Single-stepping is automatically turned on after every step. This is the C variable which corresponds to Perl's $DB::single variable. See C. SV * PL_DBsingle =for hackers Found in file intrpvar.h =item PL_DBsub X When Perl is run in debugging mode, with the B<-d> switch, this GV contains the SV which holds the name of the sub being debugged. This is the C variable which corresponds to Perl's $DB::sub variable. See C. GV * PL_DBsub =for hackers Found in file intrpvar.h =item PL_DBtrace X Trace variable used when Perl is run in debugging mode, with the B<-d> switch. This is the C variable which corresponds to Perl's $DB::trace variable. See C. SV * PL_DBtrace =for hackers Found in file intrpvar.h =item PL_dowarn X The C variable which corresponds to Perl's $^W warning variable. bool PL_dowarn =for hackers Found in file intrpvar.h =item PL_last_in_gv X The GV which was last used for a filehandle input operation. (C<< >>) GV* PL_last_in_gv =for hackers Found in file intrpvar.h =item PL_ofsgv X The glob containing the output field separator - C<*,> in Perl space. GV* PL_ofsgv =for hackers Found in file intrpvar.h =item PL_rs X The input record separator - C<$/> in Perl space. SV* PL_rs =for hackers Found in file intrpvar.h =back =head1 Stack Manipulation Macros =over 8 =item djSP X Declare Just C. This is actually identical to C, and declares a local copy of perl's stack pointer, available via the C macro. See C. (Available for backward source code compatibility with the old (Perl 5.005) thread model.) djSP; =for hackers Found in file pp.h =item LVRET X True if this op will be the return value of an lvalue subroutine =for hackers Found in file pp.h =back =head1 SV Manipulation Functions =over 8 =item SvTHINKFIRST X A quick flag check to see whether an sv should be passed to sv_force_normal to be "downgraded" before SvIVX or SvPVX can be modified directly. For example, if your scalar is a reference and you want to modify the SvIVX slot, you can't just do SvROK_off, as that will leak the referent. This is used internally by various sv-modifying functions, such as sv_setsv, sv_setiv and sv_pvn_force. One case that this does not handle is a gv without SvFAKE set. After if (SvTHINKFIRST(gv)) sv_force_normal(gv); it will still be a gv. SvTHINKFIRST sometimes produces false positives. In those cases sv_force_normal does nothing. U32 SvTHINKFIRST(SV *sv) =for hackers Found in file sv.h =item sv_add_arena X Given a chunk of memory, link it to the head of the list of arenas, and split it into a list of free SVs. void sv_add_arena(char *const ptr, const U32 size, const U32 flags) =for hackers Found in file sv.c =item sv_clean_all X Decrement the refcnt of each remaining SV, possibly triggering a cleanup. This function may have to be called multiple times to free SVs which are in complex self-referential hierarchies. I32 sv_clean_all() =for hackers Found in file sv.c =item sv_clean_objs X Attempt to destroy all objects not yet freed. void sv_clean_objs() =for hackers Found in file sv.c =item sv_free_arenas X Deallocate the memory used by all arenas. Note that all the individual SV heads and bodies within the arenas must already have been freed. void sv_free_arenas() =for hackers Found in file sv.c =back =head1 SV-Body Allocation =over 8 =item sv_2num X Return an SV with the numeric value of the source SV, doing any necessary reference or overload conversion. You must use the C macro to access this function. NOTE: this function is experimental and may change or be removed without notice. SV* sv_2num(SV *const sv) =for hackers Found in file sv.c =item sv_copypv X Copies a stringified representation of the source SV into the destination SV. Automatically performs any necessary mg_get and coercion of numeric values into strings. Guaranteed to preserve UTF8 flag even from overloaded objects. Similar in nature to sv_2pv[_flags] but operates directly on an SV instead of just the string. Mostly uses sv_2pv_flags to do its work, except when that would lose the UTF-8'ness of the PV. void sv_copypv(SV *const dsv, SV *const ssv) =for hackers Found in file sv.c =item sv_ref X Returns a SV describing what the SV passed in is a reference to. SV* sv_ref(SV *dst, const SV *const sv, const int ob) =for hackers Found in file sv.c =back =head1 Unicode Support =over 8 =item find_uninit_var X Find the name of the undefined variable (if any) that caused the operator to issue a "Use of uninitialized value" warning. If match is true, only return a name if its value matches uninit_sv. So roughly speaking, if a unary operator (such as OP_COS) generates a warning, then following the direct child of the op may yield an OP_PADSV or OP_GV that gives the name of the undefined variable. On the other hand, with OP_ADD there are two branches to follow, so we only print the variable name if we get an exact match. The name is returned as a mortal SV. Assumes that PL_op is the op that originally triggered the error, and that PL_comppad/PL_curpad points to the currently executing pad. NOTE: this function is experimental and may change or be removed without notice. SV* find_uninit_var(const OP *const obase, const SV *const uninit_sv, bool top) =for hackers Found in file sv.c =item report_uninit X Print appropriate "Use of uninitialized variable" warning. void report_uninit(const SV *uninit_sv) =for hackers Found in file sv.c =back =head1 Undocumented functions The following functions are currently undocumented. If you use one of them, you may wish to consider creating and submitting documentation for it. =over =item Perl_croak_memory_wrap X =item Slab_Alloc X =item Slab_Free X =item Slab_to_ro X =item Slab_to_rw X =item _add_range_to_invlist X<_add_range_to_invlist> =item _core_swash_init X<_core_swash_init> =item _get_invlist_len_addr X<_get_invlist_len_addr> =item _get_swash_invlist X<_get_swash_invlist> =item _invlist_array_init X<_invlist_array_init> =item _invlist_contains_cp X<_invlist_contains_cp> =item _invlist_contents X<_invlist_contents> =item _invlist_intersection X<_invlist_intersection> =item _invlist_intersection_maybe_complement_2nd X<_invlist_intersection_maybe_complement_2nd> =item _invlist_invert X<_invlist_invert> =item _invlist_invert_prop X<_invlist_invert_prop> =item _invlist_len X<_invlist_len> =item _invlist_populate_swatch X<_invlist_populate_swatch> =item _invlist_search X<_invlist_search> =item _invlist_subtract X<_invlist_subtract> =item _invlist_union X<_invlist_union> =item _invlist_union_maybe_complement_2nd X<_invlist_union_maybe_complement_2nd> =item _new_invlist X<_new_invlist> =item _swash_inversion_hash X<_swash_inversion_hash> =item _swash_to_invlist X<_swash_to_invlist> =item _to_fold_latin1 X<_to_fold_latin1> =item _to_upper_title_latin1 X<_to_upper_title_latin1> =item aassign_common_vars X =item add_cp_to_invlist X =item addmad X =item alloc_maybe_populate_EXACT X =item allocmy X =item amagic_is_enabled X =item append_madprops X =item apply X =item av_extend_guts X =item av_reify X =item bind_match X =item block_end X =item block_start X =item boot_core_PerlIO X =item boot_core_UNIVERSAL X =item boot_core_mro X =item cando X =item check_utf8_print X =item ck_entersub_args_core X =item compute_EXACTish X =item convert X =item coresub_op X =item create_eval_scope X =item croak_no_mem X =item croak_popstack X =item current_re_engine X =item cv_ckproto_len_flags X =item cv_clone_into X =item cvgv_set X =item cvstash_set X =item deb_stack_all X =item delete_eval_scope X =item die_unwind X =item do_aexec X =item do_aexec5 X =item do_eof X =item do_exec X =item do_exec3 X =item do_execfree X =item do_ipcctl X =item do_ipcget X =item do_msgrcv X =item do_msgsnd X =item do_ncmp X =item do_op_xmldump X =item do_pmop_xmldump X =item do_print X =item do_readline X =item do_seek X =item do_semop X =item do_shmio X =item do_sysseek X =item do_tell X =item do_trans X =item do_vecget X =item do_vecset X =item do_vop X =item dofile X =item dump_all_perl X =item dump_packsubs_perl X =item dump_sub_perl X =item dump_sv_child X =item emulate_cop_io X =item feature_is_enabled X =item find_lexical_cv X =item find_runcv_where X =item find_rundefsv2 X =item find_script X =item free_tied_hv_pool X =item get_and_check_backslash_N_name X =item get_db_sub X =item get_debug_opts X =item get_hash_seed X =item get_invlist_iter_addr X =item get_invlist_previous_index_addr X =item get_invlist_version_id_addr X =item get_invlist_zero_addr X =item get_no_modify X =item get_opargs X =item get_re_arg X =item getenv_len X =item grok_bslash_x X =item hfree_next_entry X =item hv_backreferences_p X =item hv_kill_backrefs X =item hv_undef_flags X =item init_argv_symbols X =item init_constants X =item init_dbargs X =item init_debugger X =item invert X =item invlist_array X =item invlist_clone X =item invlist_highest X =item invlist_is_iterating X =item invlist_iterfinish X =item invlist_iterinit X =item invlist_max X =item invlist_previous_index X =item invlist_set_len X =item invlist_set_previous_index X =item invlist_trim X =item io_close X =item isALNUM_lazy X =item isIDFIRST_lazy X =item is_utf8_char_slow X =item is_utf8_common X =item jmaybe X =item keyword X =item keyword_plugin_standard X =item list X =item localize X =item mad_free X =item madlex X =item madparse X =item magic_clear_all_env X =item magic_cleararylen_p X =item magic_clearenv X =item magic_clearisa X =item magic_clearpack X =item magic_clearsig X =item magic_copycallchecker X =item magic_existspack X =item magic_freearylen_p X =item magic_freeovrld X =item magic_get X =item magic_getarylen X =item magic_getdefelem X =item magic_getnkeys X =item magic_getpack X =item magic_getpos X =item magic_getsig X =item magic_getsubstr X =item magic_gettaint X =item magic_getuvar X =item magic_getvec X =item magic_killbackrefs X =item magic_nextpack X =item magic_regdata_cnt X =item magic_regdatum_get X =item magic_regdatum_set X =item magic_scalarpack X =item magic_set X =item magic_set_all_env X =item magic_setarylen X =item magic_setcollxfrm X =item magic_setdbline X =item magic_setdefelem X =item magic_setenv X =item magic_setisa X =item magic_setmglob X =item magic_setnkeys X =item magic_setpack X =item magic_setpos X =item magic_setregexp X =item magic_setsig X =item magic_setsubstr X =item magic_settaint X =item magic_setutf8 X =item magic_setuvar X =item magic_setvec X =item magic_sizepack X =item magic_wipepack X =item malloc_good_size X =item malloced_size X =item mem_collxfrm X =item mode_from_discipline X =item more_bodies X =item mro_meta_dup X =item mro_meta_init X =item my_attrs X =item my_betoh16 X =item my_betoh32 X =item my_betoh64 X =item my_betohi X =item my_betohl X =item my_betohs X =item my_clearenv X =item my_htobe16 X =item my_htobe32 X =item my_htobe64 X =item my_htobei X =item my_htobel X =item my_htobes X =item my_htole16 X =item my_htole32 X =item my_htole64 X =item my_htolei X =item my_htolel X =item my_htoles X =item my_letoh16 X =item my_letoh32 X =item my_letoh64 X =item my_letohi X =item my_letohl X =item my_letohs X =item my_lstat_flags X =item my_stat_flags X =item my_swabn X =item my_unexec X =item newATTRSUB_flags X =item newGP X =item newMADPROP X =item newMADsv X =item newSTUB X =item newTOKEN X =item newXS_len_flags X =item new_warnings_bitfield X =item nextargv X =item oopsAV X =item oopsHV X =item op_clear X =item op_const_sv X =item op_getmad X =item op_getmad_weak X =item op_integerize X =item op_lvalue_flags X =item op_refcnt_dec X =item op_refcnt_inc X =item op_std_init X =item op_unscope X =item op_xmldump X =item opslab_force_free X =item opslab_free X =item opslab_free_nopad X =item package X =item package_version X =item padlist_store X =item parse_unicode_opts X =item parser_free X =item parser_free_nexttoke_ops X =item peep X =item pmop_xmldump X =item pmruntime X =item populate_isa X =item prepend_madprops X =item qerror X =item re_op_compile X =item reg_named_buff X =item reg_named_buff_iter X =item reg_numbered_buff_fetch X =item reg_numbered_buff_length X =item reg_numbered_buff_store X =item reg_qr_package X =item reg_temp_copy X =item regcurly X =item regpposixcc X =item regprop X =item report_evil_fh X =item report_redefined_cv X =item report_wrongway_fh X =item rpeep X =item rsignal_restore X =item rsignal_save X =item rxres_save X =item same_dirent X =item sawparens X =item scalar X =item scalarvoid X =item sighandler X =item softref2xv X =item sub_crush_depth X =item sv_add_backref X =item sv_catxmlpv X =item sv_catxmlpvn X =item sv_catxmlsv X =item sv_del_backref X =item sv_free2 X =item sv_kill_backrefs X =item sv_len_utf8_nomg X =item sv_mortalcopy_flags X =item sv_resetpvn X =item sv_sethek X =item sv_setsv_cow X =item sv_unglob X =item sv_xmlpeek X =item tied_method X =item token_free X =item token_getmad X =item translate_substr_offsets X =item try_amagic_bin X =item try_amagic_un X =item unshare_hek X =item utilize X =item varname X =item vivify_defelem X =item vivify_ref X =item wait4pid X =item was_lvalue_sub X =item watch X =item win32_croak_not_implemented X =item write_to_stderr X =item xmldump_all X =item xmldump_all_perl X =item xmldump_eval X =item xmldump_form X =item xmldump_indent X =item xmldump_packsubs X =item xmldump_packsubs_perl X =item xmldump_sub X =item xmldump_sub_perl X =item xmldump_vindent X =item xs_apiversion_bootcheck X =item xs_version_bootcheck X =item yyerror X =item yyerror_pv X =item yyerror_pvn X =item yylex X =item yyparse X =item yyunlex X =back =head1 AUTHORS The autodocumentation system was originally added to the Perl core by Benjamin Stuhl. Documentation is by whoever was kind enough to document their functions. =head1 SEE ALSO L, L =cut ex: set ro: