{
    "mode": "man",
    "parameter": "perlintern",
    "section": "1",
    "url": "https://www.chedong.com/phpMan.php/man/perlintern/1/json",
    "generated": "2026-05-30T06:06:20Z",
    "sections": {
        "NAME": {
            "content": "perlintern - autogenerated documentation of purely internal Perl functions\n",
            "subsections": []
        },
        "DESCRIPTION": {
            "content": "This file is the autogenerated documentation of functions in the Perl interpreter that are\ndocumented using Perl's internal documentation format but are not marked as part of the Perl\nAPI.  In other words, they are not for use in extensions!\n\nIt has the same sections as perlapi, though some may be empty.\n",
            "subsections": [
                {
                    "name": "AV Handling",
                    "content": "\"AvFILLp\"\nIf the array \"av\" is empty, this returns -1; otherwise it returns the maximum value of\nthe indices of all the array elements which are currently defined in \"av\".  It does not\nhandle magic, hence the \"p\" private indication in its name.\n\nSSizet  AvFILLp(AV* av)\n"
                },
                {
                    "name": "Callback Functions",
                    "content": "There are only public API items currently in Callback Functions\n"
                }
            ]
        },
        "Casting": {
            "content": "There are only public API items currently in Casting\n",
            "subsections": [
                {
                    "name": "Character case changing",
                    "content": "There are only public API items currently in Character case changing\n"
                },
                {
                    "name": "Character classification",
                    "content": "There are only public API items currently in Character classification\n"
                },
                {
                    "name": "Compiler and Preprocessor information",
                    "content": "There are only public API items currently in Compiler and Preprocessor information\n"
                },
                {
                    "name": "Compiler directives",
                    "content": "There are only public API items currently in Compiler directives\n"
                },
                {
                    "name": "Compile-time scope hooks",
                    "content": "\"BhkENTRY\"\nNOTE: \"BhkENTRY\" is experimental and may change or be removed without notice.\n\nReturn an entry from the BHK structure.  \"which\" is a preprocessor token indicating which\nentry to return.  If the appropriate flag is not set this will return \"NULL\".  The type\nof the return value depends on which entry you ask for.\n\nvoid *  BhkENTRY(BHK *hk, which)\n\n\"BhkFLAGS\"\nNOTE: \"BhkFLAGS\" is experimental and may change or be removed without notice.\n\nReturn the BHK's flags.\n\nU32  BhkFLAGS(BHK *hk)\n\n\"CALLBLOCKHOOKS\"\nNOTE: \"CALLBLOCKHOOKS\" is experimental and may change or be removed without notice.\n\nCall all the registered block hooks for type \"which\".  \"which\" is a preprocessing token;\nthe type of \"arg\" depends on \"which\".\n\nvoid  CALLBLOCKHOOKS(which, arg)\n"
                }
            ]
        },
        "Concurrency": {
            "content": "There are only public API items currently in Concurrency\n",
            "subsections": [
                {
                    "name": "COP Hint Hashes",
                    "content": "There are only public API items currently in COP Hint Hashes\n"
                },
                {
                    "name": "Custom Operators",
                    "content": "\"coreprototype\"\nThis function assigns the prototype of the named core function to \"sv\", or to a new\nmortal SV if \"sv\" is \"NULL\".  It returns the modified \"sv\", or \"NULL\" if the core\nfunction has no prototype.  \"code\" is a code as returned by \"keyword()\".  It must not be\nequal to 0.\n\nSV *  coreprototype(SV *sv, const char *name, const int code,\nint * const opnum)\n"
                },
                {
                    "name": "CV Handling",
                    "content": "\"CvWEAKOUTSIDE\"\nEach CV has a pointer, \"CvOUTSIDE()\", to its lexically enclosing CV (if any).  Because\npointers to anonymous sub prototypes are stored in \"&\" pad slots, it is a possible to get\na circular reference, with the parent pointing to the child and vice-versa.  To avoid the\nensuing memory leak, we do not increment the reference count of the CV pointed to by\n\"CvOUTSIDE\" in the one specific instance that the parent has a \"&\" pad slot pointing back\nto us.  In this case, we set the \"CvWEAKOUTSIDE\" flag in the child.  This allows us to\ndetermine under what circumstances we should decrement the refcount of the parent when\nfreeing the child.\n\nThere is a further complication with non-closure anonymous subs (i.e. those that do not\nrefer to any lexicals outside that sub).  In this case, the anonymous prototype is shared\nrather than being cloned.  This has the consequence that the parent may be freed while\nthere are still active children, e.g.,\n\nBEGIN { $a = sub { eval '$x' } }\n\nIn this case, the BEGIN is freed immediately after execution since there are no active\nreferences to it: the anon sub prototype has \"CvWEAKOUTSIDE\" set since it's not a\nclosure, and $a points to the same CV, so it doesn't contribute to BEGIN's refcount\neither.  When $a is executed, the \"eval '$x'\" causes the chain of \"CvOUTSIDE\"s to be\nfollowed, and the freed BEGIN is accessed.\n\nTo avoid this, whenever a CV and its associated pad is freed, any \"&\" entries in the pad\nare explicitly removed from the pad, and if the refcount of the pointed-to anon sub is\nstill positive, then that child's \"CvOUTSIDE\" is set to point to its grandparent.  This\nwill only occur in the single specific case of a non-closure anon prototype having one or\nmore active references (such as $a above).\n\nOne other thing to consider is that a CV may be merely undefined rather than freed, eg\n\"undef &foo\".  In this case, its refcount may not have reached zero, but we still delete\nits pad and its \"CvROOT\" etc.  Since various children may still have their \"CvOUTSIDE\"\npointing at this undefined CV, we keep its own \"CvOUTSIDE\" for the time being, so that\nthe chain of lexical scopes is unbroken.  For example, the following should print 123:\n\nmy $x = 123;\nsub tmp { sub { eval '$x' } }\nmy $a = tmp();\nundef &tmp;\nprint  $a->();\n\nbool  CvWEAKOUTSIDE(CV *cv)\n\n\"docatch\"\nCheck for the cases 0 or 3 of curenv.jeret, only used inside an eval context.\n\n0 is used as continue inside eval,\n\n3 is used for a die caught by an inner eval - continue inner loop\n\nSee cop.h: jemustcatch, when set at any runlevel to TRUE, means eval ops must establish\na local jmpenv to handle exception traps.\n\nOP*  docatch(Perlppaddrt firstpp)\n"
                }
            ]
        },
        "Debugging": {
            "content": "\"freecbacktrace\"\nDeallocates a backtrace received from getcbacktrace.\n\nvoid  freecbacktrace(Perlcbacktrace* bt)\n\n\"getcbacktrace\"\nCollects the backtrace (aka \"stacktrace\") into a single linear malloced buffer, which the\ncaller must \"Perlfreecbacktrace()\".\n\nScans the frames back by \"depth + skip\", then drops the \"skip\" innermost, returning at\nmost \"depth\" frames.\n\nPerlcbacktrace*  getcbacktrace(int maxdepth, int skip)\n\n\"PLDBsingle\"\nWhen Perl is run in debugging mode, with the -d switch, this SV is a boolean which\nindicates whether subs are being single-stepped.  Single-stepping is automatically turned\non after every step.  This is the C variable which corresponds to Perl's $DB::single\nvariable.  See \"PLDBsub\".\n\nOn threaded perls, each thread has an independent copy of this variable; each initialized\nat creation time with the current value of the creating thread's copy.\n\nSV *  PLDBsingle\n\n\"PLDBsub\"\nWhen Perl is run in debugging mode, with the -d switch, this GV contains the SV which\nholds the name of the sub being debugged.  This is the C variable which corresponds to\nPerl's $DB::sub variable.  See \"PLDBsingle\".\n\nOn threaded perls, each thread has an independent copy of this variable; each initialized\nat creation time with the current value of the creating thread's copy.\n\nGV *  PLDBsub\n\n\"PLDBtrace\"\nTrace variable used when Perl is run in debugging mode, with the -d switch.  This is the\nC variable which corresponds to Perl's $DB::trace variable.  See \"PLDBsingle\".\n\nOn threaded perls, each thread has an independent copy of this variable; each initialized\nat creation time with the current value of the creating thread's copy.\n\nSV *  PLDBtrace\n",
            "subsections": [
                {
                    "name": "Display functions",
                    "content": "There are only public API items currently in Display functions\n"
                },
                {
                    "name": "Embedding and Interpreter Cloning",
                    "content": "\"cvdump\"\ndump the contents of a CV\n\nvoid  cvdump(const CV *cv, const char *title)\n\n\"cvforgetslab\"\nWhen a CV has a reference count on its slab (\"CvSLABBED\"), it is responsible for making\nsure it is freed.  (Hence, no two CVs should ever have a reference count on the same\nslab.)  The CV only needs to reference the slab during compilation.  Once it is compiled\nand \"CvROOT\" attached, it has finished its job, so it can forget the slab.\n\nvoid  cvforgetslab(CV *cv)\n\n\"dodumppad\"\nDump the contents of a padlist\n\nvoid  dodumppad(I32 level, PerlIO *file, PADLIST *padlist,\nint full)\n\n\"padallocname\"\nAllocates a place in the currently-compiling pad (via \"padalloc\" in perlapi) and then\nstores a name for that entry.  \"name\" is adopted and becomes the name entry; it must\nalready contain the name string.  \"typestash\" and \"ourstash\" and the \"padaddSTATE\" flag\nget added to \"name\".  None of the other processing of \"padaddnamepvn\" in perlapi is\ndone.  Returns the offset of the allocated pad slot.\n\nPADOFFSET  padallocname(PADNAME *name, U32 flags, HV *typestash,\nHV *ourstash)\n\n\"padblockstart\"\nUpdate the pad compilation state variables on entry to a new block.\n\nvoid  padblockstart(int full)\n\n\"padcheckdup\"\nCheck for duplicate declarations: report any of:\n\n* a 'my' in the current scope with the same name;\n* an 'our' (anywhere in the pad) with the same name and the\nsame stash as 'ourstash'\n\n\"isour\" indicates that the name to check is an \"our\" declaration.\n\nvoid  padcheckdup(PADNAME *name, U32 flags, const HV *ourstash)\n\n\"padfindlex\"\nFind a named lexical anywhere in a chain of nested pads.  Add fake entries in the inner\npads if it's found in an outer one.\n\nReturns the offset in the bottom pad of the lex or the fake lex.  \"cv\" is the CV in which\nto start the search, and seq is the current \"copseq\" to match against.  If \"warn\" is\ntrue, print appropriate warnings.  The \"out\"* vars return values, and so are pointers to\nwhere the returned values should be stored.  \"outcapture\", if non-null, requests that\nthe innermost instance of the lexical is captured; \"outname\" is set to the innermost\nmatched pad name or fake pad name; \"outflags\" returns the flags normally associated with\nthe \"PARENTFAKELEXFLAGS\" field of a fake pad name.\n\nNote that \"padfindlex()\" is recursive; it recurses up the chain of CVs, then comes back\ndown, adding fake entries as it goes.  It has to be this way because fake names in anon\nprototypes have to store in \"xpadnlow\" the index into the parent pad.\n\nPADOFFSET  padfindlex(const char *namepv, STRLEN namelen,\nU32 flags, const CV* cv, U32 seq, int warn,\nSV outcapture, PADNAME outname,\nint *outflags)\n\n\"padfixupinneranons\"\nFor any anon CVs in the pad, change \"CvOUTSIDE\" of that CV from \"oldcv\" to \"newcv\" if\nnecessary.  Needed when a newly-compiled CV has to be moved to a pre-existing CV struct.\n\nvoid  padfixupinneranons(PADLIST *padlist, CV *oldcv,\nCV *newcv)\n\n\"padfree\"\nFree the SV at offset po in the current pad.\n\nvoid  padfree(PADOFFSET po)\n\n\"padleavemy\"\nCleanup at end of scope during compilation: set the max seq number for lexicals in this\nscope and warn of any lexicals that never got introduced.\n\nOP *  padleavemy()\n\n\"padlistdup\"\nDuplicates a pad.\n\nPADLIST *  padlistdup(PADLIST *srcpad, CLONEPARAMS *param)\n\n\"padnamedup\"\nDuplicates a pad name.\n\nPADNAME *  padnamedup(PADNAME *src, CLONEPARAMS *param)\n\n\"padnamelistdup\"\nDuplicates a pad name list.\n\nPADNAMELIST *  padnamelistdup(PADNAMELIST *srcpad,\nCLONEPARAMS *param)\n\n\"padpush\"\nPush a new pad frame onto the padlist, unless there's already a pad at this depth, in\nwhich case don't bother creating a new one.  Then give the new pad an @ in slot zero.\n\nvoid  padpush(PADLIST *padlist, int depth)\n\n\"padreset\"\nMark all the current temporaries for reuse\n\nvoid  padreset()\n\n\"padsetsv\"\nSet the value at offset \"po\" in the current (compiling or executing) pad.  Use the macro\n\"PADSETSV()\" rather than calling this function directly.\n\nvoid  padsetsv(PADOFFSET po, SV* sv)\n\n\"padsv\"\nGet the value at offset \"po\" in the current (compiling or executing) pad.  Use macro\n\"PADSV\" instead of calling this function directly.\n\nSV*  padsv(PADOFFSET po)\n\n\"padswipe\"\nAbandon the tmp in the current pad at offset \"po\" and replace with a new one.\n\nvoid  padswipe(PADOFFSET po, bool refadjust)\n"
                }
            ]
        },
        "Errno": {
            "content": "\"dSAVEDERRNO\"\nDeclare variables needed to save \"errno\" and any operating system specific error number.\n\nvoid  dSAVEDERRNO\n\n\"dSAVEERRNO\"\nDeclare variables needed to save \"errno\" and any operating system specific error number,\nand save them for optional later restoration by \"RESTOREERRNO\".\n\nvoid  dSAVEERRNO\n\n\"RESTOREERRNO\"\nRestore \"errno\" and any operating system specific error number that was saved by\n\"dSAVEERRNO\" or \"RESTOREERRNO\".\n\nvoid  RESTOREERRNO\n\n\"SAVEERRNO\"\nSave \"errno\" and any operating system specific error number for optional later\nrestoration by \"RESTOREERRNO\".  Requires \"dSAVEDERRNO\" or \"dSAVEERRNO\" in scope.\n\nvoid  SAVEERRNO\n\n\"SETERRNO\"\nSet \"errno\", and on VMS set \"vaxc$errno\".\n\nvoid  SETERRNO(int errcode, int vmserrcode)\n",
            "subsections": [
                {
                    "name": "Exception Handling (simple) Macros",
                    "content": "There are only public API items currently in Exception Handling (simple) Macros\n"
                },
                {
                    "name": "Filesystem configuration values",
                    "content": "There are only public API items currently in Filesystem configuration values\n"
                },
                {
                    "name": "Floating point configuration values",
                    "content": "There are only public API items currently in Floating point configuration values\n"
                }
            ]
        },
        "Formats": {
            "content": "There are only public API items currently in Formats\n",
            "subsections": [
                {
                    "name": "General Configuration",
                    "content": "There are only public API items currently in General Configuration\n"
                },
                {
                    "name": "Global Variables",
                    "content": "There are only public API items currently in Global Variables\n"
                },
                {
                    "name": "GV Handling",
                    "content": "\"gvstashsvpvncached\"\nReturns a pointer to the stash for a specified package, possibly cached.  Implements both\n\"\"gvstashpvn\"\" in perlapi and \"\"gvstashsv\"\" in perlapi.\n\nRequires one of either \"namesv\" or \"namepv\" to be non-null.\n\nIf the flag \"GVCACHEONLY\" is set, return the stash only if found in the cache; see\n\"\"gvstashpvn\"\" in perlapi for details on the other \"flags\".\n\nNote it is strongly preferred for \"namesv\" to be non-null, for performance reasons.\n\nHV*  gvstashsvpvncached(SV *namesv, const char* name,\nU32 namelen, I32 flags)\n\n\"gvtrydowngrade\"\nNOTE: \"gvtrydowngrade\" is experimental and may change or be removed without notice.\n\nIf the typeglob \"gv\" can be expressed more succinctly, by having something other than a\nreal GV in its place in the stash, replace it with the optimised form.  Basic\nrequirements for this are that \"gv\" is a real typeglob, is sufficiently ordinary, and is\nonly referenced from its package.  This function is meant to be used when a GV has been\nlooked up in part to see what was there, causing upgrading, but based on what was found\nit turns out that the real GV isn't required after all.\n\nIf \"gv\" is a completely empty typeglob, it is deleted from the stash.\n\nIf \"gv\" is a typeglob containing only a sufficiently-ordinary constant sub, the typeglob\nis replaced with a scalar-reference placeholder that more compactly represents the same\nthing.\n\nvoid  gvtrydowngrade(GV* gv)\n"
                },
                {
                    "name": "Hook manipulation",
                    "content": "There are only public API items currently in Hook manipulation\n"
                },
                {
                    "name": "HV Handling",
                    "content": "\"hvenameadd\"\nAdds a name to a stash's internal list of effective names.  See \"hvenamedelete\".\n\nThis is called when a stash is assigned to a new location in the symbol table.\n\nvoid  hvenameadd(HV *hv, const char *name, U32 len, U32 flags)\n\n\"hvenamedelete\"\nRemoves a name from a stash's internal list of effective names.  If this is the name\nreturned by \"HvENAME\", then another name in the list will take its place (\"HvENAME\" will\nuse it).\n\nThis is called when a stash is deleted from the symbol table.\n\nvoid  hvenamedelete(HV *hv, const char *name, U32 len,\nU32 flags)\n\n\"refcountedhechain2hv\"\nGenerates and returns a \"HV *\" representing the content of a \"refcountedhe\" chain.\n\"flags\" is currently unused and must be zero.\n\nHV *  refcountedhechain2hv(const struct refcountedhe *c,\nU32 flags)\n\n\"refcountedhefetchpv\"\nLike \"refcountedhefetchpvn\", but takes a nul-terminated string instead of a\nstring/length pair.\n\nSV *  refcountedhefetchpv(const struct refcountedhe *chain,\nconst char *key, U32 hash, U32 flags)\n\n\"refcountedhefetchpvn\"\nSearch along a \"refcountedhe\" chain for an entry with the key specified by \"keypv\" and\n\"keylen\".  If \"flags\" has the \"REFCOUNTEDHEKEYUTF8\" bit set, the key octets are\ninterpreted as UTF-8, otherwise they are interpreted as Latin-1.  \"hash\" is a precomputed\nhash of the key string, or zero if it has not been precomputed.  Returns a mortal scalar\nrepresenting the value associated with the key, or &PLsvplaceholder if there is no\nvalue associated with the key.\n\nSV *  refcountedhefetchpvn(const struct refcountedhe *chain,\nconst char *keypv, STRLEN keylen,\nU32 hash, U32 flags)\n\n\"refcountedhefetchpvs\"\nLike \"refcountedhefetchpvn\", but takes a literal string instead of a string/length\npair, and no precomputed hash.\n\nSV *  refcountedhefetchpvs(const struct refcountedhe *chain,\n\"key\", U32 flags)\n\n\"refcountedhefetchsv\"\nLike \"refcountedhefetchpvn\", but takes a Perl scalar instead of a string/length pair.\n\nSV *  refcountedhefetchsv(const struct refcountedhe *chain,\nSV *key, U32 hash, U32 flags)\n\n\"refcountedhefree\"\nDecrements the reference count of a \"refcountedhe\" by one.  If the reference count\nreaches zero the structure's memory is freed, which (recursively) causes a reduction of\nits parent \"refcountedhe\"'s reference count.  It is safe to pass a null pointer to this\nfunction: no action occurs in this case.\n\nvoid  refcountedhefree(struct refcountedhe *he)\n\n\"refcountedheinc\"\nIncrement the reference count of a \"refcountedhe\".  The pointer to the \"refcountedhe\"\nis also returned.  It is safe to pass a null pointer to this function: no action occurs\nand a null pointer is returned.\n\nstruct refcountedhe *  refcountedheinc(\nstruct refcountedhe *he)\n\n\"refcountedhenewpv\"\nLike \"refcountedhenewpvn\", but takes a nul-terminated string instead of a\nstring/length pair.\n\nstruct refcountedhe *  refcountedhenewpv(\nstruct refcountedhe *parent,\nconst char *key, U32 hash,\nSV *value, U32 flags)\n\n\"refcountedhenewpvn\"\nCreates a new \"refcountedhe\".  This consists of a single key/value pair and a reference\nto an existing \"refcountedhe\" chain (which may be empty), and thus forms a longer chain.\nWhen using the longer chain, the new key/value pair takes precedence over any entry for\nthe same key further along the chain.\n\nThe new key is specified by \"keypv\" and \"keylen\".  If \"flags\" has the\n\"REFCOUNTEDHEKEYUTF8\" bit set, the key octets are interpreted as UTF-8, otherwise they\nare interpreted as Latin-1.  \"hash\" is a precomputed hash of the key string, or zero if\nit has not been precomputed.\n\n\"value\" is the scalar value to store for this key.  \"value\" is copied by this function,\nwhich thus does not take ownership of any reference to it, and later changes to the\nscalar will not be reflected in the value visible in the \"refcountedhe\".  Complex types\nof scalar will not be stored with referential integrity, but will be coerced to strings.\n\"value\" may be either null or &PLsvplaceholder to indicate that no value is to be\nassociated with the key; this, as with any non-null value, takes precedence over the\nexistence of a value for the key further along the chain.\n\n\"parent\" points to the rest of the \"refcountedhe\" chain to be attached to the new\n\"refcountedhe\".  This function takes ownership of one reference to \"parent\", and returns\none reference to the new \"refcountedhe\".\n\nstruct refcountedhe *  refcountedhenewpvn(\nstruct refcountedhe *parent,\nconst char *keypv,\nSTRLEN keylen, U32 hash,\nSV *value, U32 flags)\n\n\"refcountedhenewpvs\"\nLike \"refcountedhenewpvn\", but takes a literal string instead of a string/length pair,\nand no precomputed hash.\n\nstruct refcountedhe *  refcountedhenewpvs(\nstruct refcountedhe *parent,\n\"key\", SV *value, U32 flags)\n\n\"refcountedhenewsv\"\nLike \"refcountedhenewpvn\", but takes a Perl scalar instead of a string/length pair.\n\nstruct refcountedhe *  refcountedhenewsv(\nstruct refcountedhe *parent,\nSV *key, U32 hash, SV *value,\nU32 flags)\n"
                }
            ]
        },
        "Input/Output": {
            "content": "\"PLlastingv\"\nThe GV which was last used for a filehandle input operation.  (\"<FH>\")\n\nOn threaded perls, each thread has an independent copy of this variable; each initialized\nat creation time with the current value of the creating thread's copy.\n\nGV*  PLlastingv\n\n\"PLofsgv\"\nThe glob containing the output field separator - \"*,\" in Perl space.\n\nOn threaded perls, each thread has an independent copy of this variable; each initialized\nat creation time with the current value of the creating thread's copy.\n\nGV*  PLofsgv\n\n\"PLrs\"\nThe input record separator - $/ in Perl space.\n\nOn threaded perls, each thread has an independent copy of this variable; each initialized\nat creation time with the current value of the creating thread's copy.\n\nSV*  PLrs\n\n\"startglob\"\nNOTE: \"startglob\" is experimental and may change or be removed without notice.\n\nFunction called by \"doreadline\" to spawn a glob (or do the glob inside perl on VMS).\nThis code used to be inline, but now perl uses \"File::Glob\" this glob starter is only\nused by miniperl during the build process, or when PERLEXTERNALGLOB is defined.  Moving\nit away shrinks pphot.c; shrinking pphot.c helps speed perl up.\n\nNOTE: \"startglob\" must be explicitly called as \"Perlstartglob\" with an \"aTHX\"\nparameter.\n\nPerlIO*  Perlstartglob(pTHX SV *tmpglob, IO *io)\n",
            "subsections": [
                {
                    "name": "Integer configuration values",
                    "content": "There are only public API items currently in Integer configuration values\n"
                },
                {
                    "name": "Lexer interface",
                    "content": "\"validateproto\"\nNOTE: \"validateproto\" is experimental and may change or be removed without notice.\n\nThis function performs syntax checking on a prototype, \"proto\".  If \"warn\" is true, any\nillegal characters or mismatched brackets will trigger illegalproto warnings, declaring\nthat they were detected in the prototype for \"name\".\n\nThe return value is \"true\" if this is a valid prototype, and \"false\" if it is not,\nregardless of whether \"warn\" was \"true\" or \"false\".\n\nNote that \"NULL\" is a valid \"proto\" and will always return \"true\".\n\nbool  validateproto(SV *name, SV *proto, bool warn,\nbool curstash)\n"
                }
            ]
        },
        "Locales": {
            "content": "There are only public API items currently in Locales\n",
            "subsections": []
        },
        "Magic": {
            "content": "\"magicclearhint\"\nTriggered by a delete from \"%^H\", records the key to \"PLcompiling.cophintshash\".\n\nint  magicclearhint(SV* sv, MAGIC* mg)\n\n\"magicclearhints\"\nTriggered by clearing \"%^H\", resets \"PLcompiling.cophintshash\".\n\nint  magicclearhints(SV* sv, MAGIC* mg)\n\n\"magicmethcall\"\nInvoke a magic method (like FETCH).\n\n\"sv\" and \"mg\" are the tied thingy and the tie magic.\n\n\"meth\" is the name of the method to call.\n\n\"argc\" is the number of args (in addition to $self) to pass to the method.\n\nThe \"flags\" can be:\n\nGDISCARD     invoke method with GDISCARD flag and don't\nreturn a value\nGUNDEFFILL  fill the stack with argc pointers to\nPLsvundef\n\nThe arguments themselves are any values following the \"flags\" argument.\n\nReturns the SV (if any) returned by the method, or \"NULL\" on failure.\n\nNOTE: \"magicmethcall\" must be explicitly called as \"Perlmagicmethcall\" with an \"aTHX\"\nparameter.\n\nSV*  Perlmagicmethcall(pTHX SV *sv, const MAGIC *mg, SV *meth,\nU32 flags, U32 argc, ...)\n\n\"magicsethint\"\nTriggered by a store to \"%^H\", records the key/value pair to\n\"PLcompiling.cophintshash\".  It is assumed that hints aren't storing anything that\nwould need a deep copy.  Maybe we should warn if we find a reference.\n\nint  magicsethint(SV* sv, MAGIC* mg)\n\n\"mglocalize\"\nCopy some of the magic from an existing SV to new localized version of that SV.\nContainer magic (e.g., %ENV, $1, \"tie\") gets copied, value magic doesn't (e.g., \"taint\",\n\"pos\").\n\nIf \"setmagic\" is false then no set magic will be called on the new (empty) SV.  This\ntypically means that assignment will soon follow (e.g. 'local $x = $y'), and that will\nhandle the magic.\n\nvoid  mglocalize(SV* sv, SV* nsv, bool setmagic)\n",
            "subsections": [
                {
                    "name": "Memory Management",
                    "content": "There are only public API items currently in Memory Management\n"
                }
            ]
        },
        "MRO": {
            "content": "\"mrogetlinearisadfs\"\nReturns the Depth-First Search linearization of @ISA the given stash.  The return value\nis a read-only AV*.  \"level\" should be 0 (it is used internally in this function's\nrecursion).\n\nYou are responsible for \"SvREFCNTinc()\" on the return value if you plan to store it\nanywhere semi-permanently (otherwise it might be deleted out from under you the next time\nthe cache is invalidated).\n\nAV*  mrogetlinearisadfs(HV* stash, U32 level)\n\n\"mroisachangedin\"\nTakes the necessary steps (cache invalidations, mostly) when the @ISA of the given\npackage has changed.  Invoked by the \"setisa\" magic, should not need to invoke directly.\n\nvoid  mroisachangedin(HV* stash)\n\n\"mropackagemoved\"\nCall this function to signal to a stash that it has been assigned to another spot in the\nstash hierarchy.  \"stash\" is the stash that has been assigned.  \"oldstash\" is the stash\nit replaces, if any.  \"gv\" is the glob that is actually being assigned to.\n\nThis can also be called with a null first argument to indicate that \"oldstash\" has been\ndeleted.\n\nThis function invalidates isa caches on the old stash, on all subpackages nested inside\nit, and on the subclasses of all those, including non-existent packages that have\ncorresponding entries in \"stash\".\n\nIt also sets the effective names (\"HvENAME\") on all the stashes as appropriate.\n\nIf the \"gv\" is present and is not in the symbol table, then this function simply returns.\nThis checked will be skipped if \"flags & 1\".\n\nvoid  mropackagemoved(HV * const stash, HV * const oldstash,\nconst GV * const gv, U32 flags)\n",
            "subsections": [
                {
                    "name": "Multicall Functions",
                    "content": "There are only public API items currently in Multicall Functions\n"
                },
                {
                    "name": "Numeric Functions",
                    "content": "\"grokatoUV\"\nparse a string, looking for a decimal unsigned integer.\n\nOn entry, \"pv\" points to the beginning of the string; \"valptr\" points to a UV that will\nreceive the converted value, if found; \"endptr\" is either NULL or points to a variable\nthat points to one byte beyond the point in \"pv\" that this routine should examine.  If\n\"endptr\" is NULL, \"pv\" is assumed to be NUL-terminated.\n\nReturns FALSE if \"pv\" doesn't represent a valid unsigned integer value (with no leading\nzeros).  Otherwise it returns TRUE, and sets *valptr to that value.\n\nIf you constrain the portion of \"pv\" that is looked at by this function (by passing a\nnon-NULL \"endptr\"), and if the intial bytes of that portion form a valid value, it will\nreturn TRUE, setting *endptr to the byte following the final digit of the value.  But if\nthere is no constraint at what's looked at, all of \"pv\" must be valid in order for TRUE\nto be returned.  *endptr is unchanged from its value on input if FALSE is returned;\n\nThe only characters this accepts are the decimal digits '0'..'9'.\n\nAs opposed to atoi(3) or strtol(3), \"grokatoUV\" does NOT allow optional leading\nwhitespace, nor negative inputs.  If such features are required, the calling code needs\nto explicitly implement those.\n\nNote that this function returns FALSE for inputs that would overflow a UV, or have\nleading zeros.  Thus a single 0 is accepted, but not 00 nor 01, 002, etc.\n\nBackground: \"atoi\" has severe problems with illegal inputs, it cannot be used for\nincremental parsing, and therefore should be avoided \"atoi\" and \"strtol\" are also\naffected by locale settings, which can also be seen as a bug (global state controlled by\nuser environment).\n\nbool  grokatoUV(const char* pv, UV* valptr, const char endptr)\n\n\"isinfnansv\"\nChecks whether the argument would be either an infinity or \"NaN\" when used as a number,\nbut is careful not to trigger non-numeric or uninitialized warnings.  it assumes the\ncaller has done \"SvGETMAGIC(sv)\" already.\n\nbool  isinfnansv(SV *sv)\n"
                },
                {
                    "name": "Optree construction",
                    "content": "There are only public API items currently in Optree construction\n"
                },
                {
                    "name": "Optree Manipulation Functions",
                    "content": "\"finalizeoptree\"\nThis function finalizes the optree.  Should be called directly after the complete optree\nis built.  It does some additional checking which can't be done in the normal \"ck\"xxx\nfunctions and makes the tree thread-safe.\n\nvoid  finalizeoptree(OP* o)\n\n\"newATTRSUBx\"\nConstruct a Perl subroutine, also performing some surrounding jobs.\n\nThis function is expected to be called in a Perl compilation context, and some aspects of\nthe subroutine are taken from global variables associated with compilation.  In\nparticular, \"PLcompcv\" represents the subroutine that is currently being compiled.  It\nmust be non-null when this function is called, and some aspects of the subroutine being\nconstructed are taken from it.  The constructed subroutine may actually be a reuse of the\n\"PLcompcv\" object, but will not necessarily be so.\n\nIf \"block\" is null then the subroutine will have no body, and for the time being it will\nbe an error to call it.  This represents a forward subroutine declaration such as\n\"sub foo ($$);\".  If \"block\" is non-null then it provides the Perl code of the subroutine\nbody, which will be executed when the subroutine is called.  This body includes any\nargument unwrapping code resulting from a subroutine signature or similar.  The pad use\nof the code must correspond to the pad attached to \"PLcompcv\".  The code is not expected\nto include a \"leavesub\" or \"leavesublv\" op; this function will add such an op.  \"block\"\nis consumed by this function and will become part of the constructed subroutine.\n\n\"proto\" specifies the subroutine's prototype, unless one is supplied as an attribute (see\nbelow).  If \"proto\" is null, then the subroutine will not have a prototype.  If \"proto\"\nis non-null, it must point to a \"const\" op whose value is a string, and the subroutine\nwill have that string as its prototype.  If a prototype is supplied as an attribute, the\nattribute takes precedence over \"proto\", but in that case \"proto\" should preferably be\nnull.  In any case, \"proto\" is consumed by this function.\n\n\"attrs\" supplies attributes to be applied the subroutine.  A handful of attributes take\neffect by built-in means, being applied to \"PLcompcv\" immediately when seen.  Other\nattributes are collected up and attached to the subroutine by this route.  \"attrs\" may be\nnull to supply no attributes, or point to a \"const\" op for a single attribute, or point\nto a \"list\" op whose children apart from the \"pushmark\" are \"const\" ops for one or more\nattributes.  Each \"const\" op must be a string, giving the attribute name optionally\nfollowed by parenthesised arguments, in the manner in which attributes appear in Perl\nsource.  The attributes will be applied to the sub by this function.  \"attrs\" is consumed\nby this function.\n\nIf \"oisgv\" is false and \"o\" is null, then the subroutine will be anonymous.  If\n\"oisgv\" is false and \"o\" is non-null, then \"o\" must point to a \"const\" OP, which will\nbe consumed by this function, and its string value supplies a name for the subroutine.\nThe name may be qualified or unqualified, and if it is unqualified then a default stash\nwill be selected in some manner.  If \"oisgv\" is true, then \"o\" doesn't point to an \"OP\"\nat all, but is instead a cast pointer to a \"GV\" by which the subroutine will be named.\n\nIf there is already a subroutine of the specified name, then the new sub will either\nreplace the existing one in the glob or be merged with the existing one.  A warning may\nbe generated about redefinition.\n\nIf the subroutine has one of a few special names, such as \"BEGIN\" or \"END\", then it will\nbe claimed by the appropriate queue for automatic running of phase-related subroutines.\nIn this case the relevant glob will be left not containing any subroutine, even if it did\ncontain one before.  In the case of \"BEGIN\", the subroutine will be executed and the\nreference to it disposed of before this function returns.\n\nThe function returns a pointer to the constructed subroutine.  If the sub is anonymous\nthen ownership of one counted reference to the subroutine is transferred to the caller.\nIf the sub is named then the caller does not get ownership of a reference.  In most such\ncases, where the sub has a non-phase name, the sub will be alive at the point it is\nreturned by virtue of being contained in the glob that names it.  A phase-named\nsubroutine will usually be alive by virtue of the reference owned by the phase's\nautomatic run queue.  But a \"BEGIN\" subroutine, having already been executed, will quite\nlikely have been destroyed already by the time this function returns, making it erroneous\nfor the caller to make any use of the returned pointer.  It is the caller's\nresponsibility to ensure that it knows which of these situations applies.\n\nCV*  newATTRSUBx(I32 floor, OP *o, OP *proto, OP *attrs,\nOP *block, bool oisgv)\n\n\"newXSlenflags\"\nConstruct an XS subroutine, also performing some surrounding jobs.\n\nThe subroutine will have the entry point \"subaddr\".  It will have the prototype specified\nby the nul-terminated string \"proto\", or no prototype if \"proto\" is null.  The prototype\nstring is copied; the caller can mutate the supplied string afterwards.  If \"filename\" is\nnon-null, it must be a nul-terminated filename, and the subroutine will have its \"CvFILE\"\nset accordingly.  By default \"CvFILE\" is set to point directly to the supplied string,\nwhich must be static.  If \"flags\" has the \"XSDYNAMICFILENAME\" bit set, then a copy of\nthe string will be taken instead.\n\nOther aspects of the subroutine will be left in their default state.  If anything else\nneeds to be done to the subroutine for it to function correctly, it is the caller's\nresponsibility to do that after this function has constructed it.  However, beware of the\nsubroutine potentially being destroyed before this function returns, as described below.\n\nIf \"name\" is null then the subroutine will be anonymous, with its \"CvGV\" referring to an\n\"ANON\" glob.  If \"name\" is non-null then the subroutine will be named accordingly,\nreferenced by the appropriate glob.  \"name\" is a string of length \"len\" bytes giving a\nsigilless symbol name, in UTF-8 if \"flags\" has the \"SVfUTF8\" bit set and in Latin-1\notherwise.  The name may be either qualified or unqualified, with the stash defaulting in\nthe same manner as for \"gvfetchpvnflags\".  \"flags\" may contain flag bits understood by\n\"gvfetchpvnflags\" with the same meaning as they have there, such as \"GVADDWARN\".  The\nsymbol is always added to the stash if necessary, with \"GVADDMULTI\" semantics.\n\nIf there is already a subroutine of the specified name, then the new sub will replace the\nexisting one in the glob.  A warning may be generated about the redefinition.  If the old\nsubroutine was \"CvCONST\" then the decision about whether to warn is influenced by an\nexpectation about whether the new subroutine will become a constant of similar value.\nThat expectation is determined by \"constsvp\".  (Note that the call to this function\ndoesn't make the new subroutine \"CvCONST\" in any case; that is left to the caller.)  If\n\"constsvp\" is null then it indicates that the new subroutine will not become a constant.\nIf \"constsvp\" is non-null then it indicates that the new subroutine will become a\nconstant, and it points to an \"SV*\" that provides the constant value that the subroutine\nwill have.\n\nIf the subroutine has one of a few special names, such as \"BEGIN\" or \"END\", then it will\nbe claimed by the appropriate queue for automatic running of phase-related subroutines.\nIn this case the relevant glob will be left not containing any subroutine, even if it did\ncontain one before.  In the case of \"BEGIN\", the subroutine will be executed and the\nreference to it disposed of before this function returns, and also before its prototype\nis set.  If a \"BEGIN\" subroutine would not be sufficiently constructed by this function\nto be ready for execution then the caller must prevent this happening by giving the\nsubroutine a different name.\n\nThe function returns a pointer to the constructed subroutine.  If the sub is anonymous\nthen ownership of one counted reference to the subroutine is transferred to the caller.\nIf the sub is named then the caller does not get ownership of a reference.  In most such\ncases, where the sub has a non-phase name, the sub will be alive at the point it is\nreturned by virtue of being contained in the glob that names it.  A phase-named\nsubroutine will usually be alive by virtue of the reference owned by the phase's\nautomatic run queue.  But a \"BEGIN\" subroutine, having already been executed, will quite\nlikely have been destroyed already by the time this function returns, making it erroneous\nfor the caller to make any use of the returned pointer.  It is the caller's\nresponsibility to ensure that it knows which of these situations applies.\n\nCV *  newXSlenflags(const char *name, STRLEN len,\nXSUBADDRt subaddr,\nconst char *const filename,\nconst char *const proto, SV constsvp,\nU32 flags)\n\n\"optimizeoptree\"\nThis function applies some optimisations to the optree in top-down order.  It is called\nbefore the peephole optimizer, which processes ops in execution order. Note that\nfinalizeoptree() also does a top-down scan, but is called *after* the peephole\noptimizer.\n\nvoid  optimizeoptree(OP* o)\n\n\"traverseoptree\"\nReturn the next op in a depth-first traversal of the op tree, returning NULL when the\ntraversal is complete.\n\nThe initial call must supply the root of the tree as both top and o.\n\nFor now it's static, but it may be exposed to the API in the future.\n\nOP*  traverseoptree(OP* top, OP* o)\n"
                },
                {
                    "name": "Pack and Unpack",
                    "content": "There are only public API items currently in Pack and Unpack\n"
                },
                {
                    "name": "Pad Data Structures",
                    "content": "\"CXCURPADSAVE\"\nSave the current pad in the given context block structure.\n\nvoid  CXCURPADSAVE(struct context)\n\n\"CXCURPADSV\"\nAccess the SV at offset \"po\" in the saved current pad in the given context block\nstructure (can be used as an lvalue).\n\nSV *  CXCURPADSV(struct context, PADOFFSET po)\n\n\"PADBASESV\"\nGet the value from slot \"po\" in the base (DEPTH=1) pad of a padlist\n\nSV *  PADBASESV(PADLIST padlist, PADOFFSET po)\n\n\"PADCLONEVARS\"\nClone the state variables associated with running and compiling pads.\n\nvoid  PADCLONEVARS(PerlInterpreter *protoperl,\nCLONEPARAMS* param)\n\n\"PADCOMPNAMEFLAGS\"\nReturn the flags for the current compiling pad name at offset \"po\".  Assumes a valid slot\nentry.\n\nU32  PADCOMPNAMEFLAGS(PADOFFSET po)\n\n\"PADCOMPNAMEGEN\"\nThe generation number of the name at offset \"po\" in the current compiling pad (lvalue).\n\nSTRLEN  PADCOMPNAMEGEN(PADOFFSET po)\n\n\"PADCOMPNAMEGENset\"\nSets the generation number of the name at offset \"po\" in the current ling pad (lvalue) to\n\"gen\".\n\nSTRLEN  PADCOMPNAMEGENset(PADOFFSET po, int gen)\n\n\"PADCOMPNAMEOURSTASH\"\nReturn the stash associated with an \"our\" variable.  Assumes the slot entry is a valid\n\"our\" lexical.\n\nHV *  PADCOMPNAMEOURSTASH(PADOFFSET po)\n\n\"PADCOMPNAMEPV\"\nReturn the name of the current compiling pad name at offset \"po\".  Assumes a valid slot\nentry.\n\nchar *  PADCOMPNAMEPV(PADOFFSET po)\n\n\"PADCOMPNAMETYPE\"\nReturn the type (stash) of the current compiling pad name at offset \"po\".  Must be a\nvalid name.  Returns null if not typed.\n\nHV *  PADCOMPNAMETYPE(PADOFFSET po)\n\n\"PadnameIsOUR\"\nWhether this is an \"our\" variable.\n\nbool  PadnameIsOUR(PADNAME * pn)\n\n\"PadnameIsSTATE\"\nWhether this is a \"state\" variable.\n\nbool  PadnameIsSTATE(PADNAME * pn)\n\n\"PadnameOURSTASH\"\nThe stash in which this \"our\" variable was declared.\n\nHV *  PadnameOURSTASH(PADNAME * pn)\n\n\"PadnameOUTER\"\nWhether this entry belongs to an outer pad.  Entries for which this is true are often\nreferred to as 'fake'.\n\nbool  PadnameOUTER(PADNAME * pn)\n\n\"PadnameTYPE\"\nThe stash associated with a typed lexical.  This returns the %Foo:: hash for \"my Foo\n$bar\".\n\nHV *  PadnameTYPE(PADNAME * pn)\n\n\"PADRESTORELOCAL\"\nRestore the old pad saved into the local variable \"opad\" by \"PADSAVELOCAL()\"\n\nvoid  PADRESTORELOCAL(PAD *opad)\n\n\"PADSAVELOCAL\"\nSave the current pad to the local variable \"opad\", then make the current pad equal to\n\"npad\"\n\nvoid  PADSAVELOCAL(PAD *opad, PAD *npad)\n\n\"PADSAVESETNULLPAD\"\nSave the current pad then set it to null.\n\nvoid  PADSAVESETNULLPAD()\n\n\"PADSETSV\"\nSet the slot at offset \"po\" in the current pad to \"sv\"\n\nSV *  PADSETSV(PADOFFSET po, SV* sv)\n\n\"PADSETCUR\"\nSet the current pad to be pad \"n\" in the padlist, saving the previous current pad.  NB\ncurrently this macro expands to a string too long for some compilers, so it's best to\nreplace it with\n\nSAVECOMPPAD();\nPADSETCURNOSAVE(padlist,n);\n\nvoid  PADSETCUR(PADLIST padlist, I32 n)\n\n\"PADSETCURNOSAVE\"\nlike PADSETCUR, but without the save\n\nvoid  PADSETCURNOSAVE(PADLIST padlist, I32 n)\n\n\"PADSV\"\nGet the value at offset \"po\" in the current pad\n\nSV *  PADSV(PADOFFSET po)\n\n\"PADSVl\"\nLightweight and lvalue version of \"PADSV\".  Get or set the value at offset \"po\" in the\ncurrent pad.  Unlike \"PADSV\", does not print diagnostics with -DX.  For internal use\nonly.\n\nSV *  PADSVl(PADOFFSET po)\n\n\"SAVECLEARSV\"\nClear the pointed to pad value on scope exit.  (i.e. the runtime action of \"my\")\n\nvoid  SAVECLEARSV(SV svp)\n\n\"SAVECOMPPAD\"\nsave \"PLcomppad\" and \"PLcurpad\"\n\nvoid  SAVECOMPPAD()\n\n\"SAVEPADSV\"\nSave a pad slot (used to restore after an iteration)\n\nvoid  SAVEPADSV(PADOFFSET po)\n"
                },
                {
                    "name": "Password and Group access",
                    "content": "There are only public API items currently in Password and Group access\n"
                },
                {
                    "name": "Paths to system commands",
                    "content": "There are only public API items currently in Paths to system commands\n"
                },
                {
                    "name": "Prototype information",
                    "content": "There are only public API items currently in Prototype information\n"
                },
                {
                    "name": "REGEXP Functions",
                    "content": "There are only public API items currently in REGEXP Functions\n"
                }
            ]
        },
        "Signals": {
            "content": "There are only public API items currently in Signals\n",
            "subsections": [
                {
                    "name": "Site configuration",
                    "content": "There are only public API items currently in Site configuration\n"
                },
                {
                    "name": "Sockets configuration values",
                    "content": "There are only public API items currently in Sockets configuration values\n"
                },
                {
                    "name": "Source Filters",
                    "content": "There are only public API items currently in Source Filters\n"
                },
                {
                    "name": "Stack Manipulation Macros",
                    "content": "\"djSP\"\nDeclare Just \"SP\".  This is actually identical to \"dSP\", and declares a local copy of\nperl's stack pointer, available via the \"SP\" macro.  See \"\"SP\" in perlapi\".  (Available\nfor backward source code compatibility with the old (Perl 5.005) thread model.)\n\ndjSP();\n\n\"LVRET\"\nTrue if this op will be the return value of an lvalue subroutine\n"
                },
                {
                    "name": "String Handling",
                    "content": "\"delimcpynoescape\"\nCopy a source buffer to a destination buffer, stopping at (but not including) the first\noccurrence in the source of the delimiter byte, \"delim\".  The source is the bytes between\n\"from\" and \"fromend\" - 1.  Similarly, the dest is \"to\" up to \"toend\".\n\nThe number of bytes copied is written to *retlen.\n\nReturns the position of \"delim\" in the \"from\" buffer, but if there is no such occurrence\nbefore \"fromend\", then \"fromend\" is returned, and the entire buffer\n\"from\" .. \"fromend\" - 1 is copied.\n\nIf there is room in the destination available after the copy, an extra terminating safety\n\"NUL\" byte is appended (not included in the returned length).\n\nThe error case is if the destination buffer is not large enough to accommodate everything\nthat should be copied.  In this situation, a value larger than \"toend\" - \"to\" is written\nto *retlen, and as much of the source as fits will be written to the destination.  Not\nhaving room for the safety \"NUL\" is not considered an error.\n\nchar*  delimcpynoescape(char* to, const char* toend,\nconst char* from, const char* fromend,\nconst int delim, I32* retlen)\n\n\"quadmathformatneeded\"\n\"quadmathformatneeded()\" returns true if the \"format\" string seems to contain at least\none non-Q-prefixed \"%[efgaEFGA]\" format specifier, or returns false otherwise.\n\nThe format specifier detection is not complete printf-syntax detection, but it should\ncatch most common cases.\n\nIf true is returned, those arguments should in theory be processed with\n\"quadmathsnprintf()\", but in case there is more than one such format specifier (see\n\"quadmathformatvalid\"), and if there is anything else beyond that one (even just a\nsingle byte), they cannot be processed because \"quadmathsnprintf()\" is very strict,\naccepting only one format spec, and nothing else.  In this case, the code should probably\nfail.\n\nbool  quadmathformatneeded(const char* format)\n\n\"quadmathformatvalid\"\n\"quadmathsnprintf()\" is very strict about its \"format\" string and will fail, returning\n-1, if the format is invalid.  It accepts exactly one format spec.\n\n\"quadmathformatvalid()\" checks that the intended single spec looks sane: begins with\n\"%\", has only one \"%\", ends with \"[efgaEFGA]\", and has \"Q\" before it.  This is not a full\n\"printf syntax check\", just the basics.\n\nReturns true if it is valid, false if not.\n\nSee also \"quadmathformatneeded\".\n\nbool  quadmathformatvalid(const char* format)\n"
                },
                {
                    "name": "SV Flags",
                    "content": "\"SVtINVLIST\"\nType flag for scalars.  See \"svtype\" in perlapi.\n"
                },
                {
                    "name": "SV Handling",
                    "content": "\"PLSv\"\nA scratch pad SV for whatever temporary use you need.  Chiefly used as a fallback by\nmacros on platforms where \"PERLUSEGCCBRACEGROUPS\" in perlapi> is unavailable, and\nwhich would otherwise evaluate their SV parameter more than once.\n\nPLSv\n\n\"sv2bool\"\nThis macro is only used by \"svtrue()\" or its macro equivalent, and only if the latter's\nargument is neither \"SvPOK\", \"SvIOK\" nor \"SvNOK\".  It calls \"sv2boolflags\" with the\n\"SVGMAGIC\" flag.\n\nbool  sv2bool(SV *const sv)\n\n\"sv2boolflags\"\nThis function is only used by \"svtrue()\" and friends,  and only if the latter's argument\nis neither \"SvPOK\", \"SvIOK\" nor \"SvNOK\".  If the flags contain \"SVGMAGIC\", then it does\nan \"mgget()\" first.\n\nbool  sv2boolflags(SV *sv, I32 flags)\n\n\"sv2num\"\nNOTE: \"sv2num\" is experimental and may change or be removed without notice.\n\nReturn an SV with the numeric value of the source SV, doing any necessary reference or\noverload conversion.  The caller is expected to have handled get-magic already.\n\nSV*  sv2num(SV *const sv)\n\n\"sv2pvbytenolen\"\nReturn a pointer to the byte-encoded representation of the SV.  May cause the SV to be\ndowngraded from UTF-8 as a side-effect.\n\nUsually accessed via the \"SvPVbytenolen\" macro.\n\nchar*  sv2pvbytenolen(SV* sv)\n\n\"sv2pvutf8nolen\"\nReturn a pointer to the UTF-8-encoded representation of the SV.  May cause the SV to be\nupgraded to UTF-8 as a side-effect.\n\nUsually accessed via the \"SvPVutf8nolen\" macro.\n\nchar*  sv2pvutf8nolen(SV* sv)\n\n\"sv2pvflags\"\nReturns a pointer to the string value of an SV, and sets *lp to its length.  If flags has\nthe \"SVGMAGIC\" bit set, does an \"mgget()\" first.  Coerces \"sv\" to a string if\nnecessary.  Normally invoked via the \"SvPVflags\" macro.  \"sv2pv()\" and \"sv2pvnomg\"\nusually end up here too.\n\nchar*  sv2pvflags(SV *const sv, STRLEN *const lp,\nconst U32 flags)\n\n\"sv2pvnolen\"\nLike \"sv2pv()\", but doesn't return the length too.  You should usually use the macro\nwrapper \"SvPVnolen(sv)\" instead.\n\nchar*  sv2pvnolen(SV* sv)\n\n\"svaddarena\"\nGiven a chunk of memory, link it to the head of the list of arenas, and split it into a\nlist of free SVs.\n\nvoid  svaddarena(char *const ptr, const U32 size,\nconst U32 flags)\n\n\"svcleanall\"\nDecrement the refcnt of each remaining SV, possibly triggering a cleanup.  This function\nmay have to be called multiple times to free SVs which are in complex self-referential\nhierarchies.\n\nI32  svcleanall()\n\n\"svcleanobjs\"\nAttempt to destroy all objects not yet freed.\n\nvoid  svcleanobjs()\n\n\"svfreearenas\"\nDeallocate the memory used by all arenas.  Note that all the individual SV heads and\nbodies within the arenas must already have been freed.\n\nvoid  svfreearenas()\n\n\"svgrow\"\nExpands the character buffer in the SV.  If necessary, uses \"svunref\" and upgrades the\nSV to \"SVtPV\".  Returns a pointer to the character buffer.  Use the \"SvGROW\" wrapper\ninstead.\n\nchar*  svgrow(SV *const sv, STRLEN newlen)\n\n\"sviv\"\n\"DEPRECATED!\"  It is planned to remove \"sviv\" from a future release of Perl.  Do not use\nit for new code; remove it from existing code.\n\nA private implementation of the \"SvIVx\" macro for compilers which can't cope with complex\nmacro expressions.  Always use the macro instead.\n\nIV  sviv(SV* sv)\n\n\"svnewref\"\nIncrement an SV's reference count.  Use the \"SvREFCNTinc()\" wrapper instead.\n\nSV*  svnewref(SV *const sv)\n\n\"svnv\"\n\"DEPRECATED!\"  It is planned to remove \"svnv\" from a future release of Perl.  Do not use\nit for new code; remove it from existing code.\n\nA private implementation of the \"SvNVx\" macro for compilers which can't cope with complex\nmacro expressions.  Always use the macro instead.\n\nNV  svnv(SV* sv)\n\n\"svpv\"\nUse the \"SvPVnolen\" macro instead\n\nchar*  svpv(SV *sv)\n\n\"svpvbyte\"\nUse \"SvPVbytenolen\" instead.\n\nchar*  svpvbyte(SV *sv)\n\n\"svpvbyten\"\n\"DEPRECATED!\"  It is planned to remove \"svpvbyten\" from a future release of Perl.  Do\nnot use it for new code; remove it from existing code.\n\nA private implementation of the \"SvPVbyte\" macro for compilers which can't cope with\ncomplex macro expressions.  Always use the macro instead.\n\nchar*  svpvbyten(SV *sv, STRLEN *lp)\n\n\"svpvbytenforce\"\nThe backend for the \"SvPVbytexforce\" macro.  Always use the macro instead.  If the SV\ncannot be downgraded from UTF-8, this croaks.\n\nchar*  svpvbytenforce(SV *const sv, STRLEN *const lp)\n\n\"svpvn\"\n\"DEPRECATED!\"  It is planned to remove \"svpvn\" from a future release of Perl.  Do not\nuse it for new code; remove it from existing code.\n\nA private implementation of the \"SvPV\" macro for compilers which can't cope with complex\nmacro expressions.  Always use the macro instead.\n\nchar*  svpvn(SV *sv, STRLEN *lp)\n\n\"svpvnforce\"\nGet a sensible string out of the SV somehow.  A private implementation of the\n\"SvPVforce\" macro for compilers which can't cope with complex macro expressions.  Always\nuse the macro instead.\n\nchar*  svpvnforce(SV* sv, STRLEN* lp)\n\n\"svpvutf8\"\nUse the \"SvPVutf8nolen\" macro instead\n\nchar*  svpvutf8(SV *sv)\n\n\"svpvutf8n\"\n\"DEPRECATED!\"  It is planned to remove \"svpvutf8n\" from a future release of Perl.  Do\nnot use it for new code; remove it from existing code.\n\nA private implementation of the \"SvPVutf8\" macro for compilers which can't cope with\ncomplex macro expressions.  Always use the macro instead.\n\nchar*  svpvutf8n(SV *sv, STRLEN *lp)\n\n\"svpvutf8nforce\"\nThe backend for the \"SvPVutf8xforce\" macro.  Always use the macro instead.\n\nchar*  svpvutf8nforce(SV *const sv, STRLEN *const lp)\n\n\"svtaint\"\nTaint an SV.  Use \"SvTAINTEDon\" instead.\n\nvoid  svtaint(SV* sv)\n\n\"svtainted\"\nTest an SV for taintedness.  Use \"SvTAINTED\" instead.\n\nbool  svtainted(SV *const sv)\n\n\"SvTHINKFIRST\"\nA quick flag check to see whether an \"sv\" should be passed to \"svforcenormal\" to be\n\"downgraded\" before \"SvIVX\" or \"SvPVX\" can be modified directly.\n\nFor example, if your scalar is a reference and you want to modify the \"SvIVX\" slot, you\ncan't just do \"SvROKoff\", as that will leak the referent.\n\nThis is used internally by various sv-modifying functions, such as \"svsetsv\", \"svsetiv\"\nand \"svpvnforce\".\n\nOne case that this does not handle is a gv without SvFAKE set.  After\n\nif (SvTHINKFIRST(gv)) svforcenormal(gv);\n\nit will still be a gv.\n\n\"SvTHINKFIRST\" sometimes produces false positives.  In those cases \"svforcenormal\" does\nnothing.\n\nU32  SvTHINKFIRST(SV *sv)\n\n\"svtrue\"\nReturns true if the SV has a true value by Perl's rules.  Use the \"SvTRUE\" macro instead,\nwhich may call \"svtrue()\" or may instead use an in-line version.\n\nI32  svtrue(SV *const sv)\n\n\"svuntaint\"\nUntaint an SV.  Use \"SvTAINTEDoff\" instead.\n\nvoid  svuntaint(SV *const sv)\n\n\"svuv\"\n\"DEPRECATED!\"  It is planned to remove \"svuv\" from a future release of Perl.  Do not use\nit for new code; remove it from existing code.\n\nA private implementation of the \"SvUVx\" macro for compilers which can't cope with complex\nmacro expressions.  Always use the macro instead.\n\nUV  svuv(SV* sv)\n"
                }
            ]
        },
        "Time": {
            "content": "There are only public API items currently in Time\n",
            "subsections": [
                {
                    "name": "Typedef names",
                    "content": "There are only public API items currently in Typedef names\n"
                },
                {
                    "name": "Unicode Support",
                    "content": "\"bytesfromutf8loc\"\nNOTE: \"bytesfromutf8loc\" is experimental and may change or be removed without notice.\n\nLike \"\"bytesfromutf8\" in perlapi()\", but takes an extra parameter, a pointer to where\nto store the location of the first character in \"s\" that cannot be converted to non-UTF8.\n\nIf that parameter is \"NULL\", this function behaves identically to \"bytesfromutf8\".\n\nOtherwise if *isutf8p is 0 on input, the function behaves identically to\n\"bytesfromutf8\", except it also sets *firstnondowngradable to \"NULL\".\n\nOtherwise, the function returns a newly created \"NUL\"-terminated string containing the\nnon-UTF8 equivalent of the convertible first portion of \"s\".  *lenp is set to its length,\nnot including the terminating \"NUL\".  If the entire input string was converted, *isutf8p\nis set to a FALSE value, and *firstnondowngradable is set to \"NULL\".\n\nOtherwise, *firstnondowngradable is set to point to the first byte of the first\ncharacter in the original string that wasn't converted.  *isutf8p is unchanged.  Note\nthat the new string may have length 0.\n\nAnother way to look at it is, if *firstnondowngradable is non-\"NULL\" and *isutf8p is\nTRUE, this function starts at the beginning of \"s\" and converts as many characters in it\nas possible stopping at the first one it finds that can't be converted to non-UTF-8.\n*firstnondowngradable is set to point to that.  The function returns the portion that\ncould be converted in a newly created \"NUL\"-terminated string, and *lenp is set to its\nlength, not including the terminating \"NUL\".  If the very first character in the original\ncould not be converted, *lenp will be 0, and the new string will contain just a single\n\"NUL\".  If the entire input string was converted, *isutf8p is set to FALSE and\n*firstnondowngradable is set to \"NULL\".\n\nUpon successful return, the number of variants in the converted portion of the string can\nbe computed by having saved the value of *lenp before the call, and subtracting the\nafter-call value of *lenp from it.\n\nU8*  bytesfromutf8loc(const U8 *s, STRLEN *lenp,\nbool *isutf8p,\nconst U8  firstunconverted)\n\n\"finduninitvar\"\nNOTE: \"finduninitvar\" is experimental and may change or be removed without notice.\n\nFind the name of the undefined variable (if any) that caused the operator to issue a \"Use\nof uninitialized value\" warning.  If match is true, only return a name if its value\nmatches \"uninitsv\".  So roughly speaking, if a unary operator (such as \"OPCOS\")\ngenerates a warning, then following the direct child of the op may yield an \"OPPADSV\" or\n\"OPGV\" that gives the name of the undefined variable.  On the other hand, with \"OPADD\"\nthere are two branches to follow, so we only print the variable name if we get an exact\nmatch.  \"descp\" points to a string pointer holding the description of the op.  This may\nbe updated if needed.\n\nThe name is returned as a mortal SV.\n\nAssumes that \"PLop\" is the OP that originally triggered the error, and that\n\"PLcomppad\"/\"PLcurpad\" points to the currently executing pad.\n\nSV*  finduninitvar(const OP *const obase,\nconst SV *const uninitsv, bool match,\nconst char descp)\n\n\"isSCRIPTRUN\"\nReturns a bool as to whether or not the sequence of bytes from \"s\" up to but not\nincluding \"send\" form a \"script run\".  \"utf8target\" is TRUE iff the sequence starting at\n\"s\" is to be treated as UTF-8.  To be precise, except for two degenerate cases given\nbelow, this function returns TRUE iff all code points in it come from any combination of\nthree \"scripts\" given by the Unicode \"Script Extensions\" property: Common, Inherited, and\npossibly one other.  Additionally all decimal digits must come from the same consecutive\nsequence of 10.\n\nFor example, if all the characters in the sequence are Greek, or Common, or Inherited,\nthis function will return TRUE, provided any decimal digits in it are from the same block\nof digits in Common.  (These are the ASCII digits \"0\"..\"9\" and additionally a block for\nfull width forms of these, and several others used in mathematical notation.)   For\nscripts (unlike Greek) that have their own digits defined this will accept either digits\nfrom that set or from one of the Common digit sets, but not a combination of the two.\nSome scripts, such as Arabic, have more than one set of digits.  All digits must come\nfrom the same set for this function to return TRUE.\n\n*retscript, if \"retscript\" is not NULL, will on return of TRUE contain the script\nfound, using the \"SCXenum\" typedef.  Its value will be \"SCXINVALID\" if the function\nreturns FALSE.\n\nIf the sequence is empty, TRUE is returned, but *retscript (if asked for) will be\n\"SCXINVALID\".\n\nIf the sequence contains a single code point which is unassigned to a character in the\nversion of Unicode being used, the function will return TRUE, and the script will be\n\"SCXUnknown\".  Any other combination of unassigned code points in the input sequence\nwill result in the function treating the input as not being a script run.\n\nThe returned script will be \"SCXInherited\" iff all the code points in it are from the\nInherited script.\n\nOtherwise, the returned script will be \"SCXCommon\" iff all the code points in it are\nfrom the Inherited or Common scripts.\n\nbool  isSCRIPTRUN(const U8 *s, const U8 *send,\nconst bool utf8target)\n\n\"isutf8noninvariantstring\"\nReturns TRUE if \"isutf8invariantstring\" in perlapi returns FALSE for the first \"len\"\nbytes of the string \"s\", but they are, nonetheless, legal Perl-extended UTF-8; otherwise\nreturns FALSE.\n\nA TRUE return means that at least one code point represented by the sequence either is a\nwide character not representable as a single byte, or the representation differs\ndepending on whether the sequence is encoded in UTF-8 or not.\n\nSee also \"\"isutf8invariantstring\" in perlapi\", \"\"isutf8string\" in perlapi\"\n\nbool  isutf8noninvariantstring(const U8* const s, STRLEN len)\n\n\"reportuninit\"\nPrint appropriate \"Use of uninitialized variable\" warning.\n\nvoid  reportuninit(const SV *uninitsv)\n\n\"utf8ntouvuni\"\n\"DEPRECATED!\"  It is planned to remove \"utf8ntouvuni\" from a future release of Perl.\nDo not use it for new code; remove it from existing code.\n\nInstead use \"utf8touvchrbuf\" in perlapi, or rarely, \"utf8ntouvchr\" in perlapi.\n\nThis function was useful for code that wanted to handle both EBCDIC and ASCII platforms\nwith Unicode properties, but starting in Perl v5.20, the distinctions between the\nplatforms have mostly been made invisible to most code, so this function is quite\nunlikely to be what you want.  If you do need this precise functionality, use instead\n\"NATIVETOUNI(utf8touvchrbuf(...))\"  or \"NATIVETOUNI(utf8ntouvchr(...))\".\n\nUV  utf8ntouvuni(const U8 *s, STRLEN curlen, STRLEN *retlen,\nU32 flags)\n\n\"utf8touvuni\"\n\"DEPRECATED!\"  It is planned to remove \"utf8touvuni\" from a future release of Perl.  Do\nnot use it for new code; remove it from existing code.\n\nReturns the Unicode code point of the first character in the string \"s\" which is assumed\nto be in UTF-8 encoding; \"retlen\" will be set to the length, in bytes, of that character.\n\nSome, but not all, UTF-8 malformations are detected, and in fact, some malformed input\ncould cause reading beyond the end of the input buffer, which is one reason why this\nfunction is deprecated.  The other is that only in extremely limited circumstances should\nthe Unicode versus native code point be of any interest to you.  See \"utf8touvunibuf\"\nfor alternatives.\n\nIf \"s\" points to one of the detected malformations, and UTF8 warnings are enabled, zero\nis returned and *retlen is set (if \"retlen\" doesn't point to NULL) to -1.  If those\nwarnings are off, the computed value if well-defined (or the Unicode REPLACEMENT\nCHARACTER, if not) is silently returned, and *retlen is set (if \"retlen\" isn't NULL) so\nthat (\"s\" + *retlen) is the next possible position in \"s\" that could begin a non-\nmalformed character.  See \"utf8ntouvchr\" in perlapi for details on when the REPLACEMENT\nCHARACTER is returned.\n\nUV  utf8touvuni(const U8 *s, STRLEN *retlen)\n\n\"utf8touvunibuf\"\n\"DEPRECATED!\"  It is planned to remove \"utf8touvunibuf\" from a future release of Perl.\nDo not use it for new code; remove it from existing code.\n\nOnly in very rare circumstances should code need to be dealing in Unicode (as opposed to\nnative) code points.  In those few cases, use \"NATIVETOUNI(utf8touvchrbuf(...))\"\ninstead.  If you are not absolutely sure this is one of those cases, then assume it isn't\nand use plain \"utf8touvchrbuf\" instead.\n\nReturns the Unicode (not-native) code point of the first character in the string \"s\"\nwhich is assumed to be in UTF-8 encoding; \"send\" points to 1 beyond the end of \"s\".\n\"retlen\" will be set to the length, in bytes, of that character.\n\nIf \"s\" does not point to a well-formed UTF-8 character and UTF8 warnings are enabled,\nzero is returned and *retlen is set (if \"retlen\" isn't NULL) to -1.  If those warnings\nare off, the computed value if well-defined (or the Unicode REPLACEMENT CHARACTER, if\nnot) is silently returned, and *retlen is set (if \"retlen\" isn't NULL) so that\n(\"s\" + *retlen) is the next possible position in \"s\" that could begin a non-malformed\ncharacter.  See \"utf8ntouvchr\" in perlapi for details on when the REPLACEMENT CHARACTER\nis returned.\n\nUV  utf8touvunibuf(const U8 *s, const U8 *send, STRLEN *retlen)\n\n\"uvoffunitoutf8flags\"\nTHIS FUNCTION SHOULD BE USED IN ONLY VERY SPECIALIZED CIRCUMSTANCES.  Instead, Almost all\ncode should use \"uvchrtoutf8\" in perlapi or \"uvchrtoutf8flags\" in perlapi.\n\nThis function is like them, but the input is a strict Unicode (as opposed to native) code\npoint.  Only in very rare circumstances should code not be using the native code point.\n\nFor details, see the description for \"uvchrtoutf8flags\" in perlapi.\n\nU8*  uvoffunitoutf8flags(U8 *d, UV uv, const UV flags)\n\n\"uvunitoutf8flags\"\n\"DEPRECATED!\"  It is planned to remove \"uvunitoutf8flags\" from a future release of\nPerl.  Do not use it for new code; remove it from existing code.\n\nInstead you almost certainly want to use \"uvchrtoutf8\" in perlapi or\n\"uvchrtoutf8flags\" in perlapi.\n\nThis function is a deprecated synonym for \"uvoffunitoutf8flags\", which itself, while\nnot deprecated, should be used only in isolated circumstances.  These functions were\nuseful for code that wanted to handle both EBCDIC and ASCII platforms with Unicode\nproperties, but starting in Perl v5.20, the distinctions between the platforms have\nmostly been made invisible to most code, so this function is quite unlikely to be what\nyou want.\n\nU8*  uvunitoutf8flags(U8 *d, UV uv, UV flags)\n\n\"validutf8touvchr\"\nLike \"\"utf8touvchrbuf\" in perlapi\", but should only be called when it is known that\nthe next character in the input UTF-8 string \"s\" is well-formed (e.g., it passes\n\"\"isUTF8CHAR\" in perlapi\".  Surrogates, non-character code points, and non-Unicode code\npoints are allowed.\n\nUV  validutf8touvchr(const U8 *s, STRLEN *retlen)\n\n\"variantunderutf8count\"\nThis function looks at the sequence of bytes between \"s\" and \"e\", which are assumed to be\nencoded in ASCII/Latin1, and returns how many of them would change should the string be\ntranslated into UTF-8.  Due to the nature of UTF-8, each of these would occupy two bytes\ninstead of the single one in the input string.  Thus, this function returns the precise\nnumber of bytes the string would expand by when translated to UTF-8.\n\nUnlike most of the other functions that have \"utf8\" in their name, the input to this\nfunction is NOT a UTF-8-encoded string.  The function name is slightly odd to emphasize\nthis.\n\nThis function is internal to Perl because khw thinks that any XS code that would want\nthis is probably operating too close to the internals.  Presenting a valid use case could\nchange that.\n\nSee also \"\"isutf8invariantstring\" in perlapi\" and \"\"isutf8invariantstringloc\" in\nperlapi\",\n\nSizet  variantunderutf8count(const U8* const s,\nconst U8* const e)\n"
                },
                {
                    "name": "Utility Functions",
                    "content": "There are only public API items currently in Utility Functions\n"
                }
            ]
        },
        "Versioning": {
            "content": "There are only public API items currently in Versioning\n",
            "subsections": [
                {
                    "name": "Warning and Dieing",
                    "content": "\"PLdowarn\"\nThe C variable that roughly corresponds to Perl's $^W warning variable.  However, $^W is\ntreated as a boolean, whereas \"PLdowarn\" is a collection of flag bits.\n\nOn threaded perls, each thread has an independent copy of this variable; each initialized\nat creation time with the current value of the creating thread's copy.\n\nU8  PLdowarn\n\nXS\nThere are only public API items currently in XS\n"
                },
                {
                    "name": "Undocumented elements",
                    "content": "The following functions are currently undocumented.  If you use one of them, you may wish to\nconsider creating and submitting documentation for it.\n\nabortexecution\naddcptoinvlist\naddrangetoinvlist\nallocLOGOP\nallocmy\namagiccmp\namagiccmpdesc\namagiccmplocale\namagiccmplocaledesc\namagicisenabled\namagicincmp\namagicincmpdesc\namagicncmp\namagicncmpdesc\nappendutf8fromnativebyte\napply\nASCIITONEED\navarylenp\navextendguts\naviterp\navnonelem\navreify\nbindmatch\nbootcoremro\nbootcorePerlIO\nbootcoreUNIVERSAL\nbytedumpstring\ncando\ncasti32\ncastiv\ncastulong\ncastuv\ncheckutf8print\nckanoncode\nckbacktick\nckbitop\nckcmp\nckconcat\nckdefined\nckdelete\nckeach\nckentersubargscore\nckeof\nckeval\nckexec\nckexists\nckftst\nckfun\nckglob\nckgrep\nckindex\nckisa\nckjoin\ncklength\ncklfun\ncklistiob\nckmatch\nckmethod\ncknull\nckopen\nckprototype\nckreadline\nckrefassign\nckrepeat\nckrequire\nckreturn\nckrfun\nckrvconst\ncksassign\nckselect\nckshift\ncksmartmatch\ncksort\nckspair\ncksplit\nckstringify\ncksubr\ncksubstr\ncksvconst\ncktell\ncktrunc\ncktrycatch\nckwarn\nckwarnd\nclosestcop\ncmpchainextend\ncmpchainfinish\ncmpchainstart\ncmpdesc\ncmplocaledesc\ncntrltomnemonic\ncoresubop\ncreateevalscope\ncroakcaller\ncroakmemorywrap\ncroaknomem\ncroakpopstack\ncsighandler\ncsighandler1\ncsighandler3\ncurrentreengine\ncustomopgetfield\ncvckprotolenflags\ncvcloneinto\ncvconstsvorav\ncvgvfromhek\ncvgvset\ncvstashset\ncvundefflags\ncxdump\ncxdup\ncxinc\ncxpopblock\ncxpopeval\ncxpopformat\ncxpopgiven\ncxpoploop\ncxpopsub\ncxpopsubargs\ncxpopsubcommon\ncxpopwhen\ncxpushblock\ncxpusheval\ncxpushformat\ncxpushgiven\ncxpushloopfor\ncxpushloopplain\ncxpushsub\ncxpushtry\ncxpushwhen\ncxtopblock\ndebstackall\ndefelemtarget\ndeleteevalscope\ndespatchsignals\ndieunwind\ndoaexec\ndoaexec5\ndoeof\ndoesutf8overflow\ndoexec\ndoexec3\ndofile\ndogvgvdump\ndogvdump\ndohvdump\ndoingtaint\ndoipcctl\ndoipcget\ndomagicdump\ndomsgrcv\ndomsgsnd\ndoncmp\ndoopen6\ndoopenraw\ndoopdump\ndopmopdump\ndoprint\ndoreadline\ndoseek\ndosemop\ndoshmio\ndosvdump\ndosysseek\ndotell\ndotrans\ndounipropmatch\ndovecget\ndovecset\ndovop\ndrand48initr\ndrand48r\ndtraceprobecall\ndtraceprobeload\ndtraceprobeop\ndtraceprobephase\ndumpallperl\ndumpindent\ndumppacksubsperl\ndumpsubperl\ndumpsvchild\ndumpvindent\ndupwarnings\nemulatecopio\nfindfirstdifferingbytepos\nfindlexicalcv\nfindruncvwhere\nfindscript\nfoldEQlatin1\nfoldEQlatin1s2folded\nfoldEQutf8flags\nforceoutmalformedutf8message\nformaliendigitmsg\nformcptoolargemsg\nfreetiedhvpool\nfreetmps\ngetandcheckbackslashNname\ngetdbsub\ngetdebugopts\ngetdeprecatedpropertymsg\ngetenvlen\ngethashseed\ngetinvlistiteraddr\ngetinvlistoffsetaddr\ngetinvlistpreviousindexaddr\ngetnomodify\ngetopargs\ngetpropdefinition\ngetpropvalues\ngetregclassnonbitmapdata\ngetregexcharsetname\ngetrearg\ngetregclassnonbitmapdata\ngimmeV\ngrokbinocthex\ngrokbslashc\ngrokbslasho\ngrokbslashx\ngvcheck\ngvfetchmethinternal\ngvoverride\ngvsetref\ngvstashpvninternal\nhfreenextentry\nhvbackreferencesp\nhvcommon\nhvcommonkeylen\nhvkillbackrefs\nhvplaceholdersp\nhvpushkv\nhvundefflags\ninitargvsymbols\ninitconstants\ninitdbargs\ninitdebugger\niniti18nl10n\niniti18nl14n\ninitnamedcv\ninituniprops\ninversefolds\ninvert\ninvlistarray\ninvlistclear\ninvlistclone\ninvlistcontents\ninvlistEQ\ninvlistextend\ninvlisthighest\ninvlistisiterating\ninvlistiterfinish\ninvlistiterinit\ninvlistiternext\ninvlistlowest\ninvlistmax\ninvlistpreviousindex\ninvlistsetlen\ninvlistsetpreviousindex\ninvlisttrim\ninvlistarrayinit\ninvlistcontainscp\ninvlistdump\ninvlistintersection\ninvlistintersectionmaybecomplement2nd\ninvlistinvert\ninvlistlen\ninvlistsearch\ninvlistsubtract\ninvlistunion\ninvlistunionmaybecomplement2nd\ninvmapdump\nioclose\nisFFOVERLONG\nisgrapheme\nisinvlist\nisutf8charhelper\nisutf8common\nisutf8overlonggivenstartbyteok\niscurLCcategoryutf8\nisinlocalecategory\nisuniFOO\nisuniperlidcont\nisuniperlidstart\nisutf8FOO\nisutf8perlidcont\nisutf8perlidstart\njmaybe\nkeyword\nkeywordpluginstandard\nlist\nloadcharnames\nlocalize\nlosslessNVtoIV\nmagiccleararylenp\nmagicclearenv\nmagicclearisa\nmagicclearpack\nmagicclearsig\nmagicclearallenv\nmagiccopycallchecker\nmagicexistspack\n"
                }
            ]
        },
        "AUTHORS": {
            "content": "The autodocumentation system was originally added to the Perl core by Benjamin Stuhl.\nDocumentation is by whoever was kind enough to document their functions.\n",
            "subsections": []
        },
        "SEE ALSO": {
            "content": "config.h, perlapi, perlapio, perlcall, perlclib, perlfilter, perlguts, perlinterp, perliol,\nperlmroapi, perlreguts, perlxs\n\n\n\nperl v5.34.0                                 2025-07-25                                PERLINTERN(1)",
            "subsections": []
        }
    },
    "summary": "perlintern - autogenerated documentation of purely internal Perl functions",
    "flags": [],
    "examples": [],
    "see_also": []
}