Gecko [ www.utparral.edu.mx ]

Name	Size	Permission
asn1parse.1	10.95 KB	-rw-r--r--
autopoint.1	1.25 KB	-rw-r--r--
bmp2tiff.1	2.7 KB	-rw-r--r--
bsqldb.1	3.46 KB	-rw-r--r--
bsqlodbc.1	2.44 KB	-rw-r--r--
ca.1	32.7 KB	-rw-r--r--
CA.pl.1	12.08 KB	-rw-r--r--
ciphers.1	37.32 KB	-rw-r--r--
cjpeg.1	13.58 KB	-rw-r--r--
cms.1	31.95 KB	-rw-r--r--
corelist.1	9.57 KB	-rw-r--r--
cpan.1	13.56 KB	-rw-r--r--
c_rehash.1	8.57 KB	-rw-r--r--
crl.1	7.5 KB	-rw-r--r--
crl2pkcs7.1	7.27 KB	-rw-r--r--
curl.1	115.49 KB	-rw-r--r--
curl-config.1	4.1 KB	-rw-r--r--
cwebp.1	12.42 KB	-rw-r--r--
datacopy.1	2.49 KB	-rw-r--r--
dbilogstrip.1	5.25 KB	-r--r--r--
dbiprof.1	8.13 KB	-r--r--r--
dbiproxy.1	9.43 KB	-r--r--r--
defncopy.1	2.7 KB	-rw-r--r--
derb.1	4.8 KB	-rw-r--r--
dgst.1	11.63 KB	-rw-r--r--
dhparam.1	9.1 KB	-rw-r--r--
djpeg.1	7.57 KB	-rw-r--r--
dsa.1	9.78 KB	-rw-r--r--
dsaparam.1	7.82 KB	-rw-r--r--
dwebp.1	4.66 KB	-rw-r--r--
ec.1	10.64 KB	-rw-r--r--
ecparam.1	9.96 KB	-rw-r--r--
enc.1	19.46 KB	-rw-r--r--
enc2xs.1	12.59 KB	-rw-r--r--
encguess.1	6.07 KB	-rw-r--r--
engine.1	7.18 KB	-rw-r--r--
envsubst.1	1.79 KB	-rw-r--r--
errstr.1	4.97 KB	-rw-r--r--
fax2ps.1	4.62 KB	-rw-r--r--
fax2tiff.1	7.78 KB	-rw-r--r--
fisql.1	4.54 KB	-rw-r--r--
flex.1	3.63 KB	-rw-r--r--
freebcp.1	6.12 KB	-rw-r--r--
ftpasswd.1	916 B	-rw-r--r--
ftpcount.1	1.65 KB	-rw-r--r--
ftpmail.1	3.44 KB	-rw-r--r--
ftpquota.1	958 B	-rw-r--r--
ftptop.1	2.16 KB	-rw-r--r--
ftpwho.1	2.15 KB	-rw-r--r--
genbrk.1	2.89 KB	-rw-r--r--
gencfu.1	2.4 KB	-rw-r--r--
gencnval.1	2.34 KB	-rw-r--r--
gendict.1	3.32 KB	-rw-r--r--
gendsa.1	6.96 KB	-rw-r--r--
genpkey.1	15.69 KB	-rw-r--r--
genrb.1	3.82 KB	-rw-r--r--
genrsa.1	8.06 KB	-rw-r--r--
GET.1	9.36 KB	-r--r--r--
gettext.1	2.1 KB	-rw-r--r--
gettextize.1	1.5 KB	-rw-r--r--
gif2tiff.1	2.55 KB	-rw-r--r--
h2load.1	12.65 KB	-rw-r--r--
h2ph.1	7.53 KB	-rw-r--r--
h2xs.1	20.31 KB	-rw-r--r--
HEAD.1	9.36 KB	-r--r--r--
iconv.1	4.13 KB	-rw-r--r--
icu-config.1	7.28 KB	-rw-r--r--
instmodsh.1	4.27 KB	-r--r--r--
jpegtran.1	9.79 KB	-rw-r--r--
json_pp.1	6.88 KB	-rw-r--r--
ldapadd.1	8.66 KB	-rw-r--r--
ldapcompare.1	6.58 KB	-rw-r--r--
ldapdelete.1	6.61 KB	-rw-r--r--
ldapexop.1	6.06 KB	-rw-r--r--
ldapmodify.1	8.66 KB	-rw-r--r--
ldapmodrdn.1	6.78 KB	-rw-r--r--
ldappasswd.1	5.85 KB	-rw-r--r--
ldapsearch.1	13.99 KB	-rw-r--r--
ldapurl.1	4.05 KB	-rw-r--r--
ldapwhoami.1	4.91 KB	-rw-r--r--
libnetcfg.1	5.71 KB	-rw-r--r--
list.1	6.35 KB	-rw-r--r--
lwp-download.1	5.51 KB	-r--r--r--
lwp-mirror.1	4.95 KB	-r--r--r--
lwp-request.1	9.37 KB	-r--r--r--
lwp-rget.1	8.61 KB	-r--r--r--
makeconv.1	3.28 KB	-rw-r--r--
msgattrib.1	4.25 KB	-rw-r--r--
msgcat.1	4.22 KB	-rw-r--r--
msgcmp.1	2.23 KB	-rw-r--r--
msgcomm.1	3.98 KB	-rw-r--r--
msgconv.1	3.12 KB	-rw-r--r--
msgen.1	3.17 KB	-rw-r--r--
msgexec.1	2.1 KB	-rw-r--r--
msgfilter.1	3.67 KB	-rw-r--r--
msgfmt.1	5.93 KB	-rw-r--r--
msggrep.1	5.11 KB	-rw-r--r--
msginit.1	2.6 KB	-rw-r--r--
msgmerge.1	4.9 KB	-rw-r--r--
msgunfmt.1	3.91 KB	-rw-r--r--
msguniq.1	3.86 KB	-rw-r--r--
ngettext.1	2.14 KB	-rw-r--r--
nghttp.1	8.54 KB	-rw-r--r--
nghttpd.1	5.27 KB	-rw-r--r--
nghttpx.1	62.77 KB	-rw-r--r--
nseq.1	6.25 KB	-rw-r--r--
ocsp.1	23.59 KB	-rw-r--r--
openssl.1	21.09 KB	-rw-r--r--
openssl-asn1parse.1	10.95 KB	-rw-r--r--
openssl-ca.1	32.7 KB	-rw-r--r--
openssl-ciphers.1	37.32 KB	-rw-r--r--
openssl-cms.1	31.95 KB	-rw-r--r--
openssl-c_rehash.1	8.57 KB	-rw-r--r--
openssl-crl.1	7.5 KB	-rw-r--r--
openssl-crl2pkcs7.1	7.27 KB	-rw-r--r--
openssl-dgst.1	11.63 KB	-rw-r--r--
openssl-dhparam.1	9.1 KB	-rw-r--r--
openssl-dsa.1	9.78 KB	-rw-r--r--
openssl-dsaparam.1	7.82 KB	-rw-r--r--
openssl-ec.1	10.64 KB	-rw-r--r--
openssl-ecparam.1	9.96 KB	-rw-r--r--
openssl-enc.1	19.46 KB	-rw-r--r--
openssl-engine.1	7.18 KB	-rw-r--r--
openssl-errstr.1	4.97 KB	-rw-r--r--
openssl-gendsa.1	6.96 KB	-rw-r--r--
openssl-genpkey.1	15.69 KB	-rw-r--r--
openssl-genrsa.1	8.06 KB	-rw-r--r--
openssl-list.1	6.35 KB	-rw-r--r--
openssl-nseq.1	6.25 KB	-rw-r--r--
openssl-ocsp.1	23.59 KB	-rw-r--r--
openssl-passwd.1	7.18 KB	-rw-r--r--
openssl-pkcs12.1	17.9 KB	-rw-r--r--
openssl-pkcs7.1	7.11 KB	-rw-r--r--
openssl-pkcs8.1	15.66 KB	-rw-r--r--
openssl-pkey.1	8.81 KB	-rw-r--r--
openssl-pkeyparam.1	6.18 KB	-rw-r--r--
openssl-pkeyutl.1	15.88 KB	-rw-r--r--
openssl-prime.1	5.38 KB	-rw-r--r--
openssl-rand.1	6.68 KB	-rw-r--r--
openssl-rehash.1	8.57 KB	-rw-r--r--
openssl-req.1	29.78 KB	-rw-r--r--
openssl-rsa.1	10.42 KB	-rw-r--r--
openssl-rsautl.1	10.7 KB	-rw-r--r--
openssl-s_client.1	36.29 KB	-rw-r--r--
openssl-sess_id.1	8.86 KB	-rw-r--r--
openssl-smime.1	23.06 KB	-rw-r--r--
openssl-speed.1	7.02 KB	-rw-r--r--
openssl-spkac.1	8.53 KB	-rw-r--r--
openssl-srp.1	5.8 KB	-rw-r--r--
openssl-s_server.1	34.3 KB	-rw-r--r--
openssl-s_time.1	12.1 KB	-rw-r--r--
openssl-storeutl.1	7.48 KB	-rw-r--r--
openssl-ts.1	28.03 KB	-rw-r--r--
openssl-tsget.1	11.17 KB	-rw-r--r--
openssl-verify.1	33.23 KB	-rw-r--r--
openssl-version.1	5.36 KB	-rw-r--r--
openssl-x509.1	37.6 KB	-rw-r--r--
osql.1	2.07 KB	-rw-r--r--
pal2rgb.1	3.23 KB	-rw-r--r--
passwd.1	7.18 KB	-rw-r--r--
pcre-config.1	2.67 KB	-rw-r--r--
pcregrep.1	34.62 KB	-rw-r--r--
pcretest.1	48.1 KB	-rw-r--r--
perl.1	22.94 KB	-rw-r--r--
perl5004delta.1	72.94 KB	-rw-r--r--
perl5005delta.1	46.75 KB	-rw-r--r--
perl5100delta.1	74.08 KB	-rw-r--r--
perl5101delta.1	63.75 KB	-rw-r--r--
perl5120delta.1	114.62 KB	-rw-r--r--
perl5121delta.1	14.79 KB	-rw-r--r--
perl5122delta.1	14.99 KB	-rw-r--r--
perl5123delta.1	8.44 KB	-rw-r--r--
perl5124delta.1	7.97 KB	-rw-r--r--
perl5125delta.1	13.17 KB	-rw-r--r--
perl5140delta.1	172.4 KB	-rw-r--r--
perl5141delta.1	13.13 KB	-rw-r--r--
perl5142delta.1	12.09 KB	-rw-r--r--
perl5143delta.1	12.8 KB	-rw-r--r--
perl5144delta.1	11.68 KB	-rw-r--r--
perl5160delta.1	157 KB	-rw-r--r--
perl5161delta.1	10.71 KB	-rw-r--r--
perl5162delta.1	7.83 KB	-rw-r--r--
perl5163delta.1	8.44 KB	-rw-r--r--
perl5180delta.1	140.84 KB	-rw-r--r--
perl5181delta.1	11.06 KB	-rw-r--r--
perl5182delta.1	9.68 KB	-rw-r--r--
perl5184delta.1	8.88 KB	-rw-r--r--
perl5200delta.1	130.86 KB	-rw-r--r--
perl5201delta.1	15.78 KB	-rw-r--r--
perl5202delta.1	17.12 KB	-rw-r--r--
perl5203delta.1	14.02 KB	-rw-r--r--
perl5220delta.1	150.37 KB	-rw-r--r--
perl5221delta.1	15.59 KB	-rw-r--r--
perl5222delta.1	17.84 KB	-rw-r--r--
perl5223delta.1	13.16 KB	-rw-r--r--
perl5224delta.1	8.87 KB	-rw-r--r--
perl5240delta.1	77.32 KB	-rw-r--r--
perl5241delta.1	12.95 KB	-rw-r--r--
perl5242delta.1	8.54 KB	-rw-r--r--
perl5243delta.1	16.24 KB	-rw-r--r--
perl5244delta.1	8.98 KB	-rw-r--r--
perl5260delta.1	111.52 KB	-rw-r--r--
perl5261delta.1	12.66 KB	-rw-r--r--
perl5262delta.1	12.65 KB	-rw-r--r--
perl5263delta.1	11.33 KB	-rw-r--r--
perl5280delta.1	84.7 KB	-rw-r--r--
perl5281delta.1	9.09 KB	-rw-r--r--
perl5282delta.1	10.84 KB	-rw-r--r--
perl5283delta.1	9.63 KB	-rw-r--r--
perl5300delta.1	49.94 KB	-rw-r--r--
perl5301delta.1	10.21 KB	-rw-r--r--
perl5302delta.1	9.15 KB	-rw-r--r--
perl5303delta.1	9.51 KB	-rw-r--r--
perl5320delta.1	65.25 KB	-rw-r--r--
perl5321delta.1	11.58 KB	-rw-r--r--
perl5340delta.1	44.49 KB	-rw-r--r--
perl5341delta.1	8.27 KB	-rw-r--r--
perl561delta.1	156.54 KB	-rw-r--r--
perl56delta.1	136.21 KB	-rw-r--r--
perl581delta.1	48.95 KB	-rw-r--r--
perl582delta.1	9.06 KB	-rw-r--r--
perl583delta.1	11.52 KB	-rw-r--r--
perl584delta.1	13.05 KB	-rw-r--r--
perl585delta.1	10.35 KB	-rw-r--r--
perl586delta.1	9.2 KB	-rw-r--r--
perl587delta.1	13.86 KB	-rw-r--r--
perl588delta.1	34.69 KB	-rw-r--r--
perl589delta.1	70.59 KB	-rw-r--r--
perl58delta.1	132.11 KB	-rw-r--r--
perlaix.1	26.98 KB	-rw-r--r--
perlamiga.1	11.37 KB	-rw-r--r--
perlandroid.1	12.94 KB	-rw-r--r--
perlapi.1	901.39 KB	-rw-r--r--
perlapio.1	26.41 KB	-rw-r--r--
perlartistic.1	11.5 KB	-rw-r--r--
perlbook.1	14.63 KB	-rw-r--r--
perlboot.1	4.19 KB	-rw-r--r--
perlbot.1	4.2 KB	-rw-r--r--
perlbs2000.1	13.07 KB	-rw-r--r--
perlbug.1	15.89 KB	-rw-r--r--
perlcall.1	66.92 KB	-rw-r--r--
perlcheat.1	8.59 KB	-rw-r--r--
perlclib.1	14.84 KB	-rw-r--r--
perlcn.1	8.21 KB	-rw-r--r--
perlcommunity.1	11.48 KB	-rw-r--r--
perlcygwin.1	34.92 KB	-rw-r--r--
perldata.1	59.36 KB	-rw-r--r--
perldbmfilter.1	9.6 KB	-rw-r--r--
perldebguts.1	51.63 KB	-rw-r--r--
perldebtut.1	29.77 KB	-rw-r--r--
perldebug.1	51.21 KB	-rw-r--r--
perldelta.1	8.26 KB	-rw-r--r--
perldeprecation.1	29.46 KB	-rw-r--r--
perldiag.1	401.65 KB	-rw-r--r--
perldoc.1	15.24 KB	-rw-r--r--
perldocstyle.1	53.28 KB	-rw-r--r--
perldos.1	15.76 KB	-rw-r--r--
perldsc.1	32.83 KB	-rw-r--r--
perldtrace.1	13.28 KB	-rw-r--r--
perlebcdic.1	97.39 KB	-rw-r--r--
perlembed.1	45.84 KB	-rw-r--r--
perlexperiment.1	15.46 KB	-rw-r--r--
perlfaq.1	28.79 KB	-rw-r--r--
perlfaq1.1	19.18 KB	-rw-r--r--
perlfaq2.1	14.29 KB	-rw-r--r--
perlfaq3.1	47.17 KB	-rw-r--r--
perlfaq4.1	109.05 KB	-rw-r--r--
perlfaq5.1	67.54 KB	-rw-r--r--
perlfaq6.1	49.07 KB	-rw-r--r--
perlfaq7.1	46.93 KB	-rw-r--r--
perlfaq8.1	62.56 KB	-rw-r--r--
perlfaq9.1	21.11 KB	-rw-r--r--
perlfilter.1	28.15 KB	-rw-r--r--
perlfork.1	18.88 KB	-rw-r--r--
perlform.1	22.32 KB	-rw-r--r--
perlfreebsd.1	5.63 KB	-rw-r--r--
perlfunc.1	433.03 KB	-rw-r--r--
perlgit.1	38.47 KB	-rw-r--r--
perlglossary.1	160.35 KB	-rw-r--r--
perlgov.1	19.15 KB	-rw-r--r--
perlgpl.1	17.94 KB	-rw-r--r--
perlguts.1	195.97 KB	-rw-r--r--
perlhack.1	52.01 KB	-rw-r--r--
perlhacktips.1	68.2 KB	-rw-r--r--
perlhacktut.1	10.88 KB	-rw-r--r--
perlhaiku.1	5.37 KB	-rw-r--r--
perlhist.1	64.26 KB	-rw-r--r--
perlhpux.1	37.33 KB	-rw-r--r--
perlhurd.1	5.96 KB	-rw-r--r--
perlintern.1	113.25 KB	-rw-r--r--
perlinterp.1	42.17 KB	-rw-r--r--
perlintro.1	28.76 KB	-rw-r--r--
perliol.1	45.31 KB	-rw-r--r--
perlipc.1	81.15 KB	-rw-r--r--
perlirix.1	8.84 KB	-rw-r--r--
perlivp.1	7.07 KB	-rw-r--r--
perljp.1	10.94 KB	-rw-r--r--
perlko.1	12.65 KB	-rw-r--r--
perllexwarn.1	4.29 KB	-rw-r--r--
perllinux.1	6.01 KB	-rw-r--r--
perllocale.1	88.6 KB	-rw-r--r--
perllol.1	14.78 KB	-rw-r--r--
perlmacos.1	4.83 KB	-rw-r--r--
perlmacosx.1	16.85 KB	-rw-r--r--
perlmod.1	33.42 KB	-rw-r--r--
perlmodinstall.1	15.45 KB	-rw-r--r--
perlmodlib.1	102.87 KB	-rw-r--r--
perlmodstyle.1	28.83 KB	-rw-r--r--
perlmroapi.1	7.66 KB	-rw-r--r--
perlnetware.1	10.88 KB	-rw-r--r--
perlnewmod.1	16.12 KB	-rw-r--r--
perlnumber.1	13.46 KB	-rw-r--r--
perlobj.1	44.56 KB	-rw-r--r--
perlootut.1	34.2 KB	-rw-r--r--
perlop.1	176.42 KB	-rw-r--r--
perlopenbsd.1	5.1 KB	-rw-r--r--
perlopentut.1	20.99 KB	-rw-r--r--
perlos2.1	112.91 KB	-rw-r--r--
perlos390.1	22.36 KB	-rw-r--r--
perlos400.1	9.05 KB	-rw-r--r--
perlpacktut.1	62.27 KB	-rw-r--r--
perlperf.1	57.75 KB	-rw-r--r--
perlplan9.1	9.45 KB	-rw-r--r--
perlpod.1	30.4 KB	-rw-r--r--
perlpodspec.1	78.17 KB	-rw-r--r--
perlpodstyle.1	16.93 KB	-rw-r--r--
perlpolicy.1	30.73 KB	-rw-r--r--
perlport.1	102.33 KB	-rw-r--r--
perlpragma.1	9.81 KB	-rw-r--r--
perlqnx.1	11.23 KB	-rw-r--r--
perlre.1	157.04 KB	-rw-r--r--
perlreapi.1	39.56 KB	-rw-r--r--
perlrebackslash.1	42.01 KB	-rw-r--r--
perlrecharclass.1	61.97 KB	-rw-r--r--
perlref.1	42.85 KB	-rw-r--r--
perlreftut.1	24.7 KB	-rw-r--r--
perlreguts.1	47.94 KB	-rw-r--r--
perlrepository.1	4.38 KB	-rw-r--r--
perlrequick.1	26.79 KB	-rw-r--r--
perlreref.1	21.18 KB	-rw-r--r--
perlretut.1	148.4 KB	-rw-r--r--
perlriscos.1	5.32 KB	-rw-r--r--
perlrun.1	68.29 KB	-rw-r--r--
perlsec.1	33.86 KB	-rw-r--r--
perlsecpolicy.1	25.18 KB	-rw-r--r--
perlsolaris.1	36.49 KB	-rw-r--r--
perlsource.1	11.58 KB	-rw-r--r--
perlstyle.1	13.43 KB	-rw-r--r--
perlsub.1	89.54 KB	-rw-r--r--
perlsyn.1	59.69 KB	-rw-r--r--
perlsynology.1	12.64 KB	-rw-r--r--
perlthanks.1	15.89 KB	-rw-r--r--
perlthrtut.1	54.08 KB	-rw-r--r--
perltie.1	49.97 KB	-rw-r--r--
perltoc.1	1.25 MB	-rw-r--r--
perltodo.1	4.29 KB	-rw-r--r--
perltooc.1	4.19 KB	-rw-r--r--
perltoot.1	4.19 KB	-rw-r--r--
perltrap.1	16.35 KB	-rw-r--r--
perltru64.1	13.15 KB	-rw-r--r--
perltw.1	7.99 KB	-rw-r--r--
perlunicode.1	111.26 KB	-rw-r--r--
perlunicook.1	34.47 KB	-rw-r--r--
perlunifaq.1	21.16 KB	-rw-r--r--
perluniintro.1	47.32 KB	-rw-r--r--
perluniprops.1	464.67 KB	-rw-r--r--
perlunitut.1	12.78 KB	-rw-r--r--
perlutil.1	12.01 KB	-rw-r--r--
perlvar.1	103.45 KB	-rw-r--r--
perlvms.1	61.19 KB	-rw-r--r--
perlvos.1	7.87 KB	-rw-r--r--
perlwin32.1	46.69 KB	-rw-r--r--
perlxs.1	101.28 KB	-rw-r--r--
perlxstut.1	62.05 KB	-rw-r--r--
perlxstypemap.1	31.37 KB	-rw-r--r--
piconv.1	7.58 KB	-rw-r--r--
pkcs12.1	17.9 KB	-rw-r--r--
pkcs7.1	7.11 KB	-rw-r--r--
pkcs8.1	15.66 KB	-rw-r--r--
pkey.1	8.81 KB	-rw-r--r--
pkeyparam.1	6.18 KB	-rw-r--r--
pkeyutl.1	15.88 KB	-rw-r--r--
pkgdata.1	6.92 KB	-rw-r--r--
pl2pm.1	4.53 KB	-rw-r--r--
pod2html.1	9.03 KB	-rw-r--r--
pod2man.1	18.18 KB	-rw-r--r--
pod2text.1	13.17 KB	-rw-r--r--
pod2usage.1	6.74 KB	-rw-r--r--
podchecker.1	6.06 KB	-rw-r--r--
POST.1	9.36 KB	-r--r--r--
ppm2tiff.1	2.9 KB	-rw-r--r--
prime.1	5.38 KB	-rw-r--r--
prove.1	20.1 KB	-rw-r--r--
ptar.1	5.02 KB	-rw-r--r--
ptardiff.1	4.86 KB	-rw-r--r--
ptargrep.1	6.01 KB	-rw-r--r--
rand.1	6.68 KB	-rw-r--r--
ras2tiff.1	2.94 KB	-rw-r--r--
raw2tiff.1	5.32 KB	-rw-r--r--
rdjpgcom.1	1.66 KB	-rw-r--r--
recode-sr-latin.1	1.25 KB	-rw-r--r--
rehash.1	8.57 KB	-rw-r--r--
req.1	29.78 KB	-rw-r--r--
rgb2ycbcr.1	3.07 KB	-rw-r--r--
rsa.1	10.42 KB	-rw-r--r--
rsautl.1	10.7 KB	-rw-r--r--
s_client.1	36.29 KB	-rw-r--r--
sess_id.1	8.86 KB	-rw-r--r--
sgi2tiff.1	2.77 KB	-rw-r--r--
shasum.1	7.44 KB	-rw-r--r--
smime.1	23.06 KB	-rw-r--r--
speed.1	7.02 KB	-rw-r--r--
spkac.1	8.53 KB	-rw-r--r--
splain.1	10.63 KB	-rw-r--r--
sqlite3.1	8.72 KB	-rw-r--r--
srp.1	5.8 KB	-rw-r--r--
s_server.1	34.3 KB	-rw-r--r--
s_time.1	12.1 KB	-rw-r--r--
storeutl.1	7.48 KB	-rw-r--r--
streamzip.1	5.07 KB	-r--r--r--
thumbnail.1	2.84 KB	-rw-r--r--
tiff2bw.1	2.74 KB	-rw-r--r--
tiff2pdf.1	6.93 KB	-rw-r--r--
tiff2ps.1	7.08 KB	-rw-r--r--
tiff2rgba.1	3.42 KB	-rw-r--r--
tiffcmp.1	2.78 KB	-rw-r--r--
tiffcp.1	8.56 KB	-rw-r--r--
tiffcrop.1	22.15 KB	-rw-r--r--
tiffdither.1	3.75 KB	-rw-r--r--
tiffdump.1	2.79 KB	-rw-r--r--
tiffgt.1	6.53 KB	-rw-r--r--
tiffinfo.1	2.66 KB	-rw-r--r--
tiffmedian.1	3.31 KB	-rw-r--r--
tiffset.1	2.67 KB	-rw-r--r--
tiffsplit.1	2.12 KB	-rw-r--r--
tiffsv.1	4.05 KB	-rw-r--r--
ts.1	28.03 KB	-rw-r--r--
tsget.1	11.17 KB	-rw-r--r--
tsql.1	3.43 KB	-rw-r--r--
uconv.1	10.28 KB	-rw-r--r--
use-devel-checklib.1	5.12 KB	-r--r--r--
verify.1	33.23 KB	-rw-r--r--
version.1	5.36 KB	-rw-r--r--
wcmgr.1	4.73 KB	-rw-r--r--
webalizer.1	34.96 KB	-rw-r--r--
webazolver.1	34.96 KB	-rw-r--r--
wrjpgcom.1	2.57 KB	-rw-r--r--
x509.1	37.6 KB	-rw-r--r--
xgettext.1	6.35 KB	-rw-r--r--
xml2-config.1	1.15 KB	-rw-r--r--
xmlcatalog.1	7.5 KB	-rw-r--r--
xmllint.1	13.15 KB	-rw-r--r--
xsltproc.1	8.06 KB	-rw-r--r--
xsubpp.1	8.35 KB	-rw-r--r--
zipcmp.1	2.86 KB	-rw-r--r--
zipdetails.1	4.92 KB	-r--r--r--
zipmerge.1	2.89 KB	-rw-r--r--
ziptool.1	7.31 KB	-rw-r--r--

Code Editor : perlintern.1

.\" Automatically generated by Pod::Man 4.14 (Pod::Simple 3.42)
.\"
.\" Standard preamble:
.\" ========================================================================
.de Sp \" Vertical space (when we can't use .PP)
.if t .sp .5v
.if n .sp
..
.de Vb \" Begin verbatim text
.ft CW
.nf
.ne \\$1
..
.de Ve \" End verbatim text
.ft R
.fi
..
.\" Set up some character translations and predefined strings.  \*(-- will
.\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
.\" double quote, and \*(R" will give a right double quote.  \*(C+ will
.\" give a nicer C++.  Capital omega is used to do unbreakable dashes and
.\" therefore won't be available.  \*(C` and \*(C' expand to `' in nroff,
.\" nothing in troff, for use with C<>.
.tr \(*W-
.ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
.ie n \{\
.    ds -- \(*W-
.    ds PI pi
.    if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
.    if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\"  diablo 12 pitch
.    ds L" ""
.    ds R" ""
.    ds C` ""
.    ds C' ""
'br\}
.el\{\
.    ds -- \|\(em\|
.    ds PI \(*p
.    ds L" ``
.    ds R" ''
.    ds C`
.    ds C'
'br\}
.\"
.\" Escape single quotes in literal strings from groff's Unicode transform.
.ie \n(.g .ds Aq \(aq
.el       .ds Aq '
.\"
.\" If the F register is >0, we'll generate index entries on stderr for
.\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
.\" entries marked with X<> in POD.  Of course, you'll have to process the
.\" output yourself in some meaningful fashion.
.\"
.\" Avoid warning from groff about undefined register 'F'.
.de IX
..
.nr rF 0
.if \n(.g .if rF .nr rF 1
.if (\n(rF:(\n(.g==0)) \{\
.    if \nF \{\
.        de IX
.        tm Index:\\$1\t\\n%\t"\\$2"
..
.        if !\nF==2 \{\
.            nr % 0
.            nr F 2
.        \}
.    \}
.\}
.rr rF
.\"
.\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
.\" Fear.  Run.  Save yourself.  No user-serviceable parts.
.    \" fudge factors for nroff and troff
.if n \{\
.    ds #H 0
.    ds #V .8m
.    ds #F .3m
.    ds #[ \f1
.    ds #] \fP
.\}
.if t \{\
.    ds #H ((1u-(\\\\n(.fu%2u))*.13m)
.    ds #V .6m
.    ds #F 0
.    ds #[ \&
.    ds #] \&
.\}
.    \" simple accents for nroff and troff
.if n \{\
.    ds ' \&
.    ds ` \&
.    ds ^ \&
.    ds , \&
.    ds ~ ~
.    ds /
.\}
.if t \{\
.    ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u"
.    ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u'
.    ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u'
.    ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u'
.    ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u'
.    ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u'
.\}
.    \" troff and (daisy-wheel) nroff accents
.ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V'
.ds 8 \h'\*(#H'\(*b\h'-\*(#H'
.ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#]
.ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H'
.ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u'
.ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#]
.ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#]
.ds ae a\h'-(\w'a'u*4/10)'e
.ds Ae A\h'-(\w'A'u*4/10)'E
.    \" corrections for vroff
.if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u'
.if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u'
.    \" for low resolution devices (crt and lpr)
.if \n(.H>23 .if \n(.V>19 \
\{\
.    ds : e
.    ds 8 ss
.    ds o a
.    ds d- d\h'-1'\(ga
.    ds D- D\h'-1'\(hy
.    ds th \o'bp'
.    ds Th \o'LP'
.    ds ae ae
.    ds Ae AE
.\}
.rm #[ #] #H #V #F C
.\" ========================================================================
.\"
.IX Title "PERLINTERN 1"
.TH PERLINTERN 1 "2023-11-25" "perl v5.34.1" "Perl Programmers Reference Guide"
.\" For nroff, turn off justification.  Always turn off hyphenation; it makes
.\" way too many mistakes in technical documents.
.if n .ad l
.nh
.SH "NAME"
perlintern \- autogenerated documentation of purely internal
Perl functions
.SH "DESCRIPTION"
.IX Xref "internal Perl functions interpreter functions"
.IX Header "DESCRIPTION"
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 \s-1API.\s0  In other words,
\&\fBthey are not for use in extensions\fR!
.PP
It has the same sections as perlapi, though some may be empty.
.SH "AV Handling"
.IX Header "AV Handling"
.ie n .IP """AvFILLp""" 4
.el .IP "\f(CWAvFILLp\fR" 4
.IX Xref "AvFILLp"
.IX Item "AvFILLp"
If the array \f(CW\*(C`av\*(C'\fR is empty, this returns \-1; otherwise it returns the maximum
value of the indices of all the array elements which are currently defined in
\&\f(CW\*(C`av\*(C'\fR.  It does not handle magic, hence the \f(CW\*(C`p\*(C'\fR private indication in its name.
.RS 4
.Sp
.Vb 1
\& SSize_t  AvFILLp(AV* av)
.Ve
.RE
.RS 4
.RE
.SH "Callback Functions"
.IX Header "Callback Functions"
There are only public \s-1API\s0 items currently in Callback Functions
.SH "Casting"
.IX Header "Casting"
There are only public \s-1API\s0 items currently in Casting
.SH "Character case changing"
.IX Header "Character case changing"
There are only public \s-1API\s0 items currently in Character case changing
.SH "Character classification"
.IX Header "Character classification"
There are only public \s-1API\s0 items currently in Character classification
.SH "Compiler and Preprocessor information"
.IX Header "Compiler and Preprocessor information"
There are only public \s-1API\s0 items currently in Compiler and Preprocessor information
.SH "Compiler directives"
.IX Header "Compiler directives"
There are only public \s-1API\s0 items currently in Compiler directives
.SH "Compile-time scope hooks"
.IX Header "Compile-time scope hooks"
.ie n .IP """BhkENTRY""" 4
.el .IP "\f(CWBhkENTRY\fR" 4
.IX Xref "BhkENTRY"
.IX Item "BhkENTRY"
\&\s-1NOTE:\s0 \f(CW\*(C`BhkENTRY\*(C'\fR is \fBexperimental\fR and may change or be
removed without notice.
.Sp
Return an entry from the \s-1BHK\s0 structure.  \f(CW\*(C`which\*(C'\fR is a preprocessor token
indicating which entry to return.  If the appropriate flag is not set
this will return \f(CW\*(C`NULL\*(C'\fR.  The type of the return value depends on which
entry you ask for.
.RS 4
.Sp
.Vb 1
\& void *  BhkENTRY(BHK *hk, which)
.Ve
.RE
.RS 4
.RE
.ie n .IP """BhkFLAGS""" 4
.el .IP "\f(CWBhkFLAGS\fR" 4
.IX Xref "BhkFLAGS"
.IX Item "BhkFLAGS"
\&\s-1NOTE:\s0 \f(CW\*(C`BhkFLAGS\*(C'\fR is \fBexperimental\fR and may change or be
removed without notice.
.Sp
Return the \s-1BHK\s0's flags.
.RS 4
.Sp
.Vb 1
\& U32  BhkFLAGS(BHK *hk)
.Ve
.RE
.RS 4
.RE
.ie n .IP """CALL_BLOCK_HOOKS""" 4
.el .IP "\f(CWCALL_BLOCK_HOOKS\fR" 4
.IX Xref "CALL_BLOCK_HOOKS"
.IX Item "CALL_BLOCK_HOOKS"
\&\s-1NOTE:\s0 \f(CW\*(C`CALL_BLOCK_HOOKS\*(C'\fR is \fBexperimental\fR and may change or be
removed without notice.
.Sp
Call all the registered block hooks for type \f(CW\*(C`which\*(C'\fR.  \f(CW\*(C`which\*(C'\fR is a
preprocessing token; the type of \f(CW\*(C`arg\*(C'\fR depends on \f(CW\*(C`which\*(C'\fR.
.RS 4
.Sp
.Vb 1
\& void  CALL_BLOCK_HOOKS(which, arg)
.Ve
.RE
.RS 4
.RE
.SH "Concurrency"
.IX Header "Concurrency"
There are only public \s-1API\s0 items currently in Concurrency
.SH "COP Hint Hashes"
.IX Header "COP Hint Hashes"
There are only public \s-1API\s0 items currently in \s-1COP\s0 Hint Hashes
.SH "Custom Operators"
.IX Header "Custom Operators"
.ie n .IP """core_prototype""" 4
.el .IP "\f(CWcore_prototype\fR" 4
.IX Xref "core_prototype"
.IX Item "core_prototype"
This function assigns the prototype of the named core function to \f(CW\*(C`sv\*(C'\fR, or
to a new mortal \s-1SV\s0 if \f(CW\*(C`sv\*(C'\fR is \f(CW\*(C`NULL\*(C'\fR.  It returns the modified \f(CW\*(C`sv\*(C'\fR, or
\&\f(CW\*(C`NULL\*(C'\fR if the core function has no prototype.  \f(CW\*(C`code\*(C'\fR is a code as returned
by \f(CW\*(C`keyword()\*(C'\fR.  It must not be equal to 0.
.RS 4
.Sp
.Vb 2
\& SV *  core_prototype(SV *sv, const char *name, const int code,
\&                      int * const opnum)
.Ve
.RE
.RS 4
.RE
.SH "CV Handling"
.IX Header "CV Handling"
.ie n .IP """CvWEAKOUTSIDE""" 4
.el .IP "\f(CWCvWEAKOUTSIDE\fR" 4
.IX Xref "CvWEAKOUTSIDE"
.IX Item "CvWEAKOUTSIDE"
Each \s-1CV\s0 has a pointer, \f(CW\*(C`CvOUTSIDE()\*(C'\fR, to its lexically enclosing
\&\s-1CV\s0 (if any).  Because pointers to anonymous sub prototypes are
stored in \f(CW\*(C`&\*(C'\fR 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 \s-1CV\s0
pointed to by \f(CW\*(C`CvOUTSIDE\*(C'\fR in the \fIone specific instance\fR that the parent
has a \f(CW\*(C`&\*(C'\fR pad slot pointing back to us.  In this case, we set the
\&\f(CW\*(C`CvWEAKOUTSIDE\*(C'\fR flag in the child.  This allows us to determine under what
circumstances we should decrement the refcount of the parent when freeing
the child.
.Sp
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, \fIe.g.\fR,
.Sp
.Vb 1
\&    BEGIN { $a = sub { eval \*(Aq$x\*(Aq } }
.Ve
.Sp
In this case, the \s-1BEGIN\s0 is freed immediately after execution since there
are no active references to it: the anon sub prototype has
\&\f(CW\*(C`CvWEAKOUTSIDE\*(C'\fR set since it's not a closure, and \f(CW$a\fR points to the same
\&\s-1CV,\s0 so it doesn't contribute to \s-1BEGIN\s0's refcount either.  When \f(CW$a\fR is
executed, the \f(CW\*(C`eval \*(Aq$x\*(Aq\*(C'\fR causes the chain of \f(CW\*(C`CvOUTSIDE\*(C'\fRs to be followed,
and the freed \s-1BEGIN\s0 is accessed.
.Sp
To avoid this, whenever a \s-1CV\s0 and its associated pad is freed, any
\&\f(CW\*(C`&\*(C'\fR 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 \f(CW\*(C`CvOUTSIDE\*(C'\fR 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 \f(CW$a\fR above).
.Sp
One other thing to consider is that a \s-1CV\s0 may be merely undefined
rather than freed, eg \f(CW\*(C`undef &foo\*(C'\fR.  In this case, its refcount may
not have reached zero, but we still delete its pad and its \f(CW\*(C`CvROOT\*(C'\fR etc.
Since various children may still have their \f(CW\*(C`CvOUTSIDE\*(C'\fR pointing at this
undefined \s-1CV,\s0 we keep its own \f(CW\*(C`CvOUTSIDE\*(C'\fR for the time being, so that
the chain of lexical scopes is unbroken.  For example, the following
should print 123:
.Sp
.Vb 5
\&    my $x = 123;
\&    sub tmp { sub { eval \*(Aq$x\*(Aq } }
\&    my $a = tmp();
\&    undef &tmp;
\&    print  $a\->();
.Ve
.RS 4
.Sp
.Vb 1
\& bool  CvWEAKOUTSIDE(CV *cv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """docatch""" 4
.el .IP "\f(CWdocatch\fR" 4
.IX Xref "docatch"
.IX Item "docatch"
Check for the cases 0 or 3 of cur_env.je_ret, only used inside an eval context.
.Sp
0 is used as continue inside eval,
.Sp
3 is used for a die caught by an inner eval \- continue inner loop
.Sp
See \fIcop.h\fR: je_mustcatch, when set at any runlevel to \s-1TRUE,\s0 means eval ops must
establish a local jmpenv to handle exception traps.
.RS 4
.Sp
.Vb 1
\& OP*  docatch(Perl_ppaddr_t firstpp)
.Ve
.RE
.RS 4
.RE
.SH "Debugging"
.IX Header "Debugging"
.ie n .IP """free_c_backtrace""" 4
.el .IP "\f(CWfree_c_backtrace\fR" 4
.IX Xref "free_c_backtrace"
.IX Item "free_c_backtrace"
Deallocates a backtrace received from get_c_backtrace.
.RS 4
.Sp
.Vb 1
\& void  free_c_backtrace(Perl_c_backtrace* bt)
.Ve
.RE
.RS 4
.RE
.ie n .IP """get_c_backtrace""" 4
.el .IP "\f(CWget_c_backtrace\fR" 4
.IX Xref "get_c_backtrace"
.IX Item "get_c_backtrace"
Collects the backtrace (aka \*(L"stacktrace\*(R") into a single linear
malloced buffer, which the caller \fBmust\fR \f(CW\*(C`Perl_free_c_backtrace()\*(C'\fR.
.Sp
Scans the frames back by \f(CW\*(C`depth\ +\ skip\*(C'\fR, then drops the \f(CW\*(C`skip\*(C'\fR innermost,
returning at most \f(CW\*(C`depth\*(C'\fR frames.
.RS 4
.Sp
.Vb 1
\& Perl_c_backtrace*  get_c_backtrace(int max_depth, int skip)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PL_DBsingle""" 4
.el .IP "\f(CWPL_DBsingle\fR" 4
.IX Xref "PL_DBsingle"
.IX Item "PL_DBsingle"
When Perl is run in debugging mode, with the \fB\-d\fR switch, this \s-1SV\s0 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 \f(CW$DB::single\fR variable.  See
\&\f(CW"PL_DBsub"\fR.
.Sp
On threaded perls, each thread has an independent copy of this variable;
each initialized at creation time with the current value of the creating
thread's copy.
.RS 4
.Sp
.Vb 1
\& SV *  PL_DBsingle
.Ve
.RE
.RS 4
.RE
.ie n .IP """PL_DBsub""" 4
.el .IP "\f(CWPL_DBsub\fR" 4
.IX Xref "PL_DBsub"
.IX Item "PL_DBsub"
When Perl is run in debugging mode, with the \fB\-d\fR switch, this \s-1GV\s0 contains
the \s-1SV\s0 which holds the name of the sub being debugged.  This is the C
variable which corresponds to Perl's \f(CW$DB::sub\fR variable.  See
\&\f(CW"PL_DBsingle"\fR.
.Sp
On threaded perls, each thread has an independent copy of this variable;
each initialized at creation time with the current value of the creating
thread's copy.
.RS 4
.Sp
.Vb 1
\& GV *  PL_DBsub
.Ve
.RE
.RS 4
.RE
.ie n .IP """PL_DBtrace""" 4
.el .IP "\f(CWPL_DBtrace\fR" 4
.IX Xref "PL_DBtrace"
.IX Item "PL_DBtrace"
Trace variable used when Perl is run in debugging mode, with the \fB\-d\fR
switch.  This is the C variable which corresponds to Perl's \f(CW$DB::trace\fR
variable.  See \f(CW"PL_DBsingle"\fR.
.Sp
On threaded perls, each thread has an independent copy of this variable;
each initialized at creation time with the current value of the creating
thread's copy.
.RS 4
.Sp
.Vb 1
\& SV *  PL_DBtrace
.Ve
.RE
.RS 4
.RE
.SH "Display functions"
.IX Header "Display functions"
There are only public \s-1API\s0 items currently in Display functions
.SH "Embedding and Interpreter Cloning"
.IX Header "Embedding and Interpreter Cloning"
.ie n .IP """cv_dump""" 4
.el .IP "\f(CWcv_dump\fR" 4
.IX Xref "cv_dump"
.IX Item "cv_dump"
dump the contents of a \s-1CV\s0
.RS 4
.Sp
.Vb 1
\& void  cv_dump(const CV *cv, const char *title)
.Ve
.RE
.RS 4
.RE
.ie n .IP """cv_forget_slab""" 4
.el .IP "\f(CWcv_forget_slab\fR" 4
.IX Xref "cv_forget_slab"
.IX Item "cv_forget_slab"
When a \s-1CV\s0 has a reference count on its slab (\f(CW\*(C`CvSLABBED\*(C'\fR), it is responsible
for making sure it is freed.  (Hence, no two CVs should ever have a
reference count on the same slab.)  The \s-1CV\s0 only needs to reference the slab
during compilation.  Once it is compiled and \f(CW\*(C`CvROOT\*(C'\fR attached, it has
finished its job, so it can forget the slab.
.RS 4
.Sp
.Vb 1
\& void  cv_forget_slab(CV *cv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """do_dump_pad""" 4
.el .IP "\f(CWdo_dump_pad\fR" 4
.IX Xref "do_dump_pad"
.IX Item "do_dump_pad"
Dump the contents of a padlist
.RS 4
.Sp
.Vb 2
\& void  do_dump_pad(I32 level, PerlIO *file, PADLIST *padlist,
\&                   int full)
.Ve
.RE
.RS 4
.RE
.ie n .IP """pad_alloc_name""" 4
.el .IP "\f(CWpad_alloc_name\fR" 4
.IX Xref "pad_alloc_name"
.IX Item "pad_alloc_name"
Allocates a place in the currently-compiling
pad (via \*(L"pad_alloc\*(R" in perlapi) and
then stores a name for that entry.  \f(CW\*(C`name\*(C'\fR is adopted and
becomes the name entry; it must already contain the name
string.  \f(CW\*(C`typestash\*(C'\fR and \f(CW\*(C`ourstash\*(C'\fR and the \f(CW\*(C`padadd_STATE\*(C'\fR
flag get added to \f(CW\*(C`name\*(C'\fR.  None of the other
processing of \*(L"pad_add_name_pvn\*(R" in perlapi
is done.  Returns the offset of the allocated pad slot.
.RS 4
.Sp
.Vb 2
\& PADOFFSET  pad_alloc_name(PADNAME *name, U32 flags, HV *typestash,
\&                           HV *ourstash)
.Ve
.RE
.RS 4
.RE
.ie n .IP """pad_block_start""" 4
.el .IP "\f(CWpad_block_start\fR" 4
.IX Xref "pad_block_start"
.IX Item "pad_block_start"
Update the pad compilation state variables on entry to a new block.
.RS 4
.Sp
.Vb 1
\& void  pad_block_start(int full)
.Ve
.RE
.RS 4
.RE
.ie n .IP """pad_check_dup""" 4
.el .IP "\f(CWpad_check_dup\fR" 4
.IX Xref "pad_check_dup"
.IX Item "pad_check_dup"
Check for duplicate declarations: report any of:
.Sp
.Vb 3
\&     * a \*(Aqmy\*(Aq in the current scope with the same name;
\&     * an \*(Aqour\*(Aq (anywhere in the pad) with the same name and the
\&       same stash as \*(Aqourstash\*(Aq
.Ve
.Sp
\&\f(CW\*(C`is_our\*(C'\fR indicates that the name to check is an \f(CW"our"\fR declaration.
.RS 4
.Sp
.Vb 1
\& void  pad_check_dup(PADNAME *name, U32 flags, const HV *ourstash)
.Ve
.RE
.RS 4
.RE
.ie n .IP """pad_findlex""" 4
.el .IP "\f(CWpad_findlex\fR" 4
.IX Xref "pad_findlex"
.IX Item "pad_findlex"
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.
.Sp
Returns the offset in the bottom pad of the lex or the fake lex.
\&\f(CW\*(C`cv\*(C'\fR is the \s-1CV\s0 in which to start the search, and seq is the current \f(CW\*(C`cop_seq\*(C'\fR
to match against.  If \f(CW\*(C`warn\*(C'\fR is true, print appropriate warnings.  The \f(CW\*(C`out_\*(C'\fR*
vars return values, and so are pointers to where the returned values
should be stored.  \f(CW\*(C`out_capture\*(C'\fR, if non-null, requests that the innermost
instance of the lexical is captured; \f(CW\*(C`out_name\*(C'\fR is set to the innermost
matched pad name or fake pad name; \f(CW\*(C`out_flags\*(C'\fR returns the flags normally
associated with the \f(CW\*(C`PARENT_FAKELEX_FLAGS\*(C'\fR field of a fake pad name.
.Sp
Note that \f(CW\*(C`pad_findlex()\*(C'\fR 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 names in anon prototypes have to store in \f(CW\*(C`xpadn_low\*(C'\fR the
index into the parent pad.
.RS 4
.Sp
.Vb 4
\& PADOFFSET  pad_findlex(const char *namepv, STRLEN namelen,
\&                        U32 flags, const CV* cv, U32 seq, int warn,
\&                        SV** out_capture, PADNAME** out_name,
\&                        int *out_flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """pad_fixup_inner_anons""" 4
.el .IP "\f(CWpad_fixup_inner_anons\fR" 4
.IX Xref "pad_fixup_inner_anons"
.IX Item "pad_fixup_inner_anons"
For any anon CVs in the pad, change \f(CW\*(C`CvOUTSIDE\*(C'\fR of that \s-1CV\s0 from
\&\f(CW\*(C`old_cv\*(C'\fR to \f(CW\*(C`new_cv\*(C'\fR if necessary.  Needed when a newly-compiled \s-1CV\s0 has to be
moved to a pre-existing \s-1CV\s0 struct.
.RS 4
.Sp
.Vb 2
\& void  pad_fixup_inner_anons(PADLIST *padlist, CV *old_cv,
\&                             CV *new_cv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """pad_free""" 4
.el .IP "\f(CWpad_free\fR" 4
.IX Xref "pad_free"
.IX Item "pad_free"
Free the \s-1SV\s0 at offset po in the current pad.
.RS 4
.Sp
.Vb 1
\& void  pad_free(PADOFFSET po)
.Ve
.RE
.RS 4
.RE
.ie n .IP """pad_leavemy""" 4
.el .IP "\f(CWpad_leavemy\fR" 4
.IX Xref "pad_leavemy"
.IX Item "pad_leavemy"
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.
.RS 4
.Sp
.Vb 1
\& OP *  pad_leavemy()
.Ve
.RE
.RS 4
.RE
.ie n .IP """padlist_dup""" 4
.el .IP "\f(CWpadlist_dup\fR" 4
.IX Xref "padlist_dup"
.IX Item "padlist_dup"
Duplicates a pad.
.RS 4
.Sp
.Vb 1
\& PADLIST *  padlist_dup(PADLIST *srcpad, CLONE_PARAMS *param)
.Ve
.RE
.RS 4
.RE
.ie n .IP """padname_dup""" 4
.el .IP "\f(CWpadname_dup\fR" 4
.IX Xref "padname_dup"
.IX Item "padname_dup"
Duplicates a pad name.
.RS 4
.Sp
.Vb 1
\& PADNAME *  padname_dup(PADNAME *src, CLONE_PARAMS *param)
.Ve
.RE
.RS 4
.RE
.ie n .IP """padnamelist_dup""" 4
.el .IP "\f(CWpadnamelist_dup\fR" 4
.IX Xref "padnamelist_dup"
.IX Item "padnamelist_dup"
Duplicates a pad name list.
.RS 4
.Sp
.Vb 2
\& PADNAMELIST *  padnamelist_dup(PADNAMELIST *srcpad,
\&                                CLONE_PARAMS *param)
.Ve
.RE
.RS 4
.RE
.ie n .IP """pad_push""" 4
.el .IP "\f(CWpad_push\fR" 4
.IX Xref "pad_push"
.IX Item "pad_push"
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 \f(CW@_\fR in slot zero.
.RS 4
.Sp
.Vb 1
\& void  pad_push(PADLIST *padlist, int depth)
.Ve
.RE
.RS 4
.RE
.ie n .IP """pad_reset""" 4
.el .IP "\f(CWpad_reset\fR" 4
.IX Xref "pad_reset"
.IX Item "pad_reset"
Mark all the current temporaries for reuse
.RS 4
.Sp
.Vb 1
\& void  pad_reset()
.Ve
.RE
.RS 4
.RE
.ie n .IP """pad_setsv""" 4
.el .IP "\f(CWpad_setsv\fR" 4
.IX Xref "pad_setsv"
.IX Item "pad_setsv"
Set the value at offset \f(CW\*(C`po\*(C'\fR in the current (compiling or executing) pad.
Use the macro \f(CW\*(C`PAD_SETSV()\*(C'\fR rather than calling this function directly.
.RS 4
.Sp
.Vb 1
\& void  pad_setsv(PADOFFSET po, SV* sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """pad_sv""" 4
.el .IP "\f(CWpad_sv\fR" 4
.IX Xref "pad_sv"
.IX Item "pad_sv"
Get the value at offset \f(CW\*(C`po\*(C'\fR in the current (compiling or executing) pad.
Use macro \f(CW\*(C`PAD_SV\*(C'\fR instead of calling this function directly.
.RS 4
.Sp
.Vb 1
\& SV*  pad_sv(PADOFFSET po)
.Ve
.RE
.RS 4
.RE
.ie n .IP """pad_swipe""" 4
.el .IP "\f(CWpad_swipe\fR" 4
.IX Xref "pad_swipe"
.IX Item "pad_swipe"
Abandon the tmp in the current pad at offset \f(CW\*(C`po\*(C'\fR and replace with a
new one.
.RS 4
.Sp
.Vb 1
\& void  pad_swipe(PADOFFSET po, bool refadjust)
.Ve
.RE
.RS 4
.RE
.SH "Errno"
.IX Header "Errno"
.ie n .IP """dSAVEDERRNO""" 4
.el .IP "\f(CWdSAVEDERRNO\fR" 4
.IX Xref "dSAVEDERRNO"
.IX Item "dSAVEDERRNO"
Declare variables needed to save \f(CW\*(C`errno\*(C'\fR and any operating system
specific error number.
.RS 4
.Sp
.Vb 1
\& void  dSAVEDERRNO
.Ve
.RE
.RS 4
.RE
.ie n .IP """dSAVE_ERRNO""" 4
.el .IP "\f(CWdSAVE_ERRNO\fR" 4
.IX Xref "dSAVE_ERRNO"
.IX Item "dSAVE_ERRNO"
Declare variables needed to save \f(CW\*(C`errno\*(C'\fR and any operating system
specific error number, and save them for optional later restoration
by \f(CW\*(C`RESTORE_ERRNO\*(C'\fR.
.RS 4
.Sp
.Vb 1
\& void  dSAVE_ERRNO
.Ve
.RE
.RS 4
.RE
.ie n .IP """RESTORE_ERRNO""" 4
.el .IP "\f(CWRESTORE_ERRNO\fR" 4
.IX Xref "RESTORE_ERRNO"
.IX Item "RESTORE_ERRNO"
Restore \f(CW\*(C`errno\*(C'\fR and any operating system specific error number that
was saved by \f(CW\*(C`dSAVE_ERRNO\*(C'\fR or \f(CW\*(C`RESTORE_ERRNO\*(C'\fR.
.RS 4
.Sp
.Vb 1
\& void  RESTORE_ERRNO
.Ve
.RE
.RS 4
.RE
.ie n .IP """SAVE_ERRNO""" 4
.el .IP "\f(CWSAVE_ERRNO\fR" 4
.IX Xref "SAVE_ERRNO"
.IX Item "SAVE_ERRNO"
Save \f(CW\*(C`errno\*(C'\fR and any operating system specific error number for
optional later restoration by \f(CW\*(C`RESTORE_ERRNO\*(C'\fR.  Requires
\&\f(CW\*(C`dSAVEDERRNO\*(C'\fR or \f(CW\*(C`dSAVE_ERRNO\*(C'\fR in scope.
.RS 4
.Sp
.Vb 1
\& void  SAVE_ERRNO
.Ve
.RE
.RS 4
.RE
.ie n .IP """SETERRNO""" 4
.el .IP "\f(CWSETERRNO\fR" 4
.IX Xref "SETERRNO"
.IX Item "SETERRNO"
Set \f(CW\*(C`errno\*(C'\fR, and on \s-1VMS\s0 set \f(CW\*(C`vaxc$errno\*(C'\fR.
.RS 4
.Sp
.Vb 1
\& void  SETERRNO(int errcode, int vmserrcode)
.Ve
.RE
.RS 4
.RE
.SH "Exception Handling (simple) Macros"
.IX Header "Exception Handling (simple) Macros"
There are only public \s-1API\s0 items currently in Exception Handling (simple) Macros
.SH "Filesystem configuration values"
.IX Header "Filesystem configuration values"
There are only public \s-1API\s0 items currently in Filesystem configuration values
.SH "Floating point configuration values"
.IX Header "Floating point configuration values"
There are only public \s-1API\s0 items currently in Floating point configuration values
.SH "Formats"
.IX Header "Formats"
There are only public \s-1API\s0 items currently in Formats
.SH "General Configuration"
.IX Header "General Configuration"
There are only public \s-1API\s0 items currently in General Configuration
.SH "Global Variables"
.IX Header "Global Variables"
There are only public \s-1API\s0 items currently in Global Variables
.SH "GV Handling"
.IX Header "GV Handling"
.ie n .IP """gv_stashsvpvn_cached""" 4
.el .IP "\f(CWgv_stashsvpvn_cached\fR" 4
.IX Xref "gv_stashsvpvn_cached"
.IX Item "gv_stashsvpvn_cached"
Returns a pointer to the stash for a specified package, possibly
cached.  Implements both "\f(CW\*(C`gv_stashpvn\*(C'\fR" in perlapi and
"\f(CW\*(C`gv_stashsv\*(C'\fR" in perlapi.
.Sp
Requires one of either \f(CW\*(C`namesv\*(C'\fR or \f(CW\*(C`namepv\*(C'\fR to be non-null.
.Sp
If the flag \f(CW\*(C`GV_CACHE_ONLY\*(C'\fR is set, return the stash only if found in the
cache; see "\f(CW\*(C`gv_stashpvn\*(C'\fR" in perlapi for details on the other \f(CW\*(C`flags\*(C'\fR.
.Sp
Note it is strongly preferred for \f(CW\*(C`namesv\*(C'\fR to be non-null, for performance
reasons.
.RS 4
.Sp
.Vb 2
\& HV*  gv_stashsvpvn_cached(SV *namesv, const char* name,
\&                           U32 namelen, I32 flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """gv_try_downgrade""" 4
.el .IP "\f(CWgv_try_downgrade\fR" 4
.IX Xref "gv_try_downgrade"
.IX Item "gv_try_downgrade"
\&\s-1NOTE:\s0 \f(CW\*(C`gv_try_downgrade\*(C'\fR is \fBexperimental\fR and may change or be
removed without notice.
.Sp
If the typeglob \f(CW\*(C`gv\*(C'\fR can be expressed more succinctly, by having
something other than a real \s-1GV\s0 in its place in the stash, replace it
with the optimised form.  Basic requirements for this are that \f(CW\*(C`gv\*(C'\fR
is a real typeglob, is sufficiently ordinary, and is only referenced
from its package.  This function is meant to be used when a \s-1GV\s0 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 \s-1GV\s0 isn't required after all.
.Sp
If \f(CW\*(C`gv\*(C'\fR is a completely empty typeglob, it is deleted from the stash.
.Sp
If \f(CW\*(C`gv\*(C'\fR 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.
.RS 4
.Sp
.Vb 1
\& void  gv_try_downgrade(GV* gv)
.Ve
.RE
.RS 4
.RE
.SH "Hook manipulation"
.IX Header "Hook manipulation"
There are only public \s-1API\s0 items currently in Hook manipulation
.SH "HV Handling"
.IX Header "HV Handling"
.ie n .IP """hv_ename_add""" 4
.el .IP "\f(CWhv_ename_add\fR" 4
.IX Xref "hv_ename_add"
.IX Item "hv_ename_add"
Adds a name to a stash's internal list of effective names.  See
\&\f(CW"hv_ename_delete"\fR.
.Sp
This is called when a stash is assigned to a new location in the symbol
table.
.RS 4
.Sp
.Vb 1
\& void  hv_ename_add(HV *hv, const char *name, U32 len, U32 flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """hv_ename_delete""" 4
.el .IP "\f(CWhv_ename_delete\fR" 4
.IX Xref "hv_ename_delete"
.IX Item "hv_ename_delete"
Removes a name from a stash's internal list of effective names.  If this is
the name returned by \f(CW\*(C`HvENAME\*(C'\fR, then another name in the list will take
its place (\f(CW\*(C`HvENAME\*(C'\fR will use it).
.Sp
This is called when a stash is deleted from the symbol table.
.RS 4
.Sp
.Vb 2
\& void  hv_ename_delete(HV *hv, const char *name, U32 len,
\&                       U32 flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """refcounted_he_chain_2hv""" 4
.el .IP "\f(CWrefcounted_he_chain_2hv\fR" 4
.IX Xref "refcounted_he_chain_2hv"
.IX Item "refcounted_he_chain_2hv"
Generates and returns a \f(CW\*(C`HV *\*(C'\fR representing the content of a
\&\f(CW\*(C`refcounted_he\*(C'\fR chain.
\&\f(CW\*(C`flags\*(C'\fR is currently unused and must be zero.
.RS 4
.Sp
.Vb 2
\& HV *  refcounted_he_chain_2hv(const struct refcounted_he *c,
\&                               U32 flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """refcounted_he_fetch_pv""" 4
.el .IP "\f(CWrefcounted_he_fetch_pv\fR" 4
.IX Xref "refcounted_he_fetch_pv"
.IX Item "refcounted_he_fetch_pv"
Like \*(L"refcounted_he_fetch_pvn\*(R", but takes a nul-terminated string
instead of a string/length pair.
.RS 4
.Sp
.Vb 2
\& SV *  refcounted_he_fetch_pv(const struct refcounted_he *chain,
\&                              const char *key, U32 hash, U32 flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """refcounted_he_fetch_pvn""" 4
.el .IP "\f(CWrefcounted_he_fetch_pvn\fR" 4
.IX Xref "refcounted_he_fetch_pvn"
.IX Item "refcounted_he_fetch_pvn"
Search along a \f(CW\*(C`refcounted_he\*(C'\fR chain for an entry with the key specified
by \f(CW\*(C`keypv\*(C'\fR and \f(CW\*(C`keylen\*(C'\fR.  If \f(CW\*(C`flags\*(C'\fR has the \f(CW\*(C`REFCOUNTED_HE_KEY_UTF8\*(C'\fR
bit set, the key octets are interpreted as \s-1UTF\-8,\s0 otherwise they
are interpreted as Latin\-1.  \f(CW\*(C`hash\*(C'\fR 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 \f(CW&PL_sv_placeholder\fR
if there is no value associated with the key.
.RS 4
.Sp
.Vb 3
\& SV *  refcounted_he_fetch_pvn(const struct refcounted_he *chain,
\&                               const char *keypv, STRLEN keylen,
\&                               U32 hash, U32 flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """refcounted_he_fetch_pvs""" 4
.el .IP "\f(CWrefcounted_he_fetch_pvs\fR" 4
.IX Xref "refcounted_he_fetch_pvs"
.IX Item "refcounted_he_fetch_pvs"
Like \*(L"refcounted_he_fetch_pvn\*(R", but takes a literal string
instead of a string/length pair, and no precomputed hash.
.RS 4
.Sp
.Vb 2
\& SV *  refcounted_he_fetch_pvs(const struct refcounted_he *chain,
\&                               "key", U32 flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """refcounted_he_fetch_sv""" 4
.el .IP "\f(CWrefcounted_he_fetch_sv\fR" 4
.IX Xref "refcounted_he_fetch_sv"
.IX Item "refcounted_he_fetch_sv"
Like \*(L"refcounted_he_fetch_pvn\*(R", but takes a Perl scalar instead of a
string/length pair.
.RS 4
.Sp
.Vb 2
\& SV *  refcounted_he_fetch_sv(const struct refcounted_he *chain,
\&                              SV *key, U32 hash, U32 flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """refcounted_he_free""" 4
.el .IP "\f(CWrefcounted_he_free\fR" 4
.IX Xref "refcounted_he_free"
.IX Item "refcounted_he_free"
Decrements the reference count of a \f(CW\*(C`refcounted_he\*(C'\fR by one.  If the
reference count reaches zero the structure's memory is freed, which
(recursively) causes a reduction of its parent \f(CW\*(C`refcounted_he\*(C'\fR's
reference count.  It is safe to pass a null pointer to this function:
no action occurs in this case.
.RS 4
.Sp
.Vb 1
\& void  refcounted_he_free(struct refcounted_he *he)
.Ve
.RE
.RS 4
.RE
.ie n .IP """refcounted_he_inc""" 4
.el .IP "\f(CWrefcounted_he_inc\fR" 4
.IX Xref "refcounted_he_inc"
.IX Item "refcounted_he_inc"
Increment the reference count of a \f(CW\*(C`refcounted_he\*(C'\fR.  The pointer to the
\&\f(CW\*(C`refcounted_he\*(C'\fR is also returned.  It is safe to pass a null pointer
to this function: no action occurs and a null pointer is returned.
.RS 4
.Sp
.Vb 2
\& struct refcounted_he *  refcounted_he_inc(
\&                                          struct refcounted_he *he)
.Ve
.RE
.RS 4
.RE
.ie n .IP """refcounted_he_new_pv""" 4
.el .IP "\f(CWrefcounted_he_new_pv\fR" 4
.IX Xref "refcounted_he_new_pv"
.IX Item "refcounted_he_new_pv"
Like \*(L"refcounted_he_new_pvn\*(R", but takes a nul-terminated string instead
of a string/length pair.
.RS 4
.Sp
.Vb 4
\& struct refcounted_he *  refcounted_he_new_pv(
\&                                      struct refcounted_he *parent,
\&                                      const char *key, U32 hash,
\&                                      SV *value, U32 flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """refcounted_he_new_pvn""" 4
.el .IP "\f(CWrefcounted_he_new_pvn\fR" 4
.IX Xref "refcounted_he_new_pvn"
.IX Item "refcounted_he_new_pvn"
Creates a new \f(CW\*(C`refcounted_he\*(C'\fR.  This consists of a single key/value
pair and a reference to an existing \f(CW\*(C`refcounted_he\*(C'\fR 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.
.Sp
The new key is specified by \f(CW\*(C`keypv\*(C'\fR and \f(CW\*(C`keylen\*(C'\fR.  If \f(CW\*(C`flags\*(C'\fR has
the \f(CW\*(C`REFCOUNTED_HE_KEY_UTF8\*(C'\fR bit set, the key octets are interpreted
as \s-1UTF\-8,\s0 otherwise they are interpreted as Latin\-1.  \f(CW\*(C`hash\*(C'\fR is
a precomputed hash of the key string, or zero if it has not been
precomputed.
.Sp
\&\f(CW\*(C`value\*(C'\fR is the scalar value to store for this key.  \f(CW\*(C`value\*(C'\fR 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 \f(CW\*(C`refcounted_he\*(C'\fR.  Complex types of scalar will not
be stored with referential integrity, but will be coerced to strings.
\&\f(CW\*(C`value\*(C'\fR may be either null or \f(CW&PL_sv_placeholder\fR 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.
.Sp
\&\f(CW\*(C`parent\*(C'\fR points to the rest of the \f(CW\*(C`refcounted_he\*(C'\fR chain to be
attached to the new \f(CW\*(C`refcounted_he\*(C'\fR.  This function takes ownership
of one reference to \f(CW\*(C`parent\*(C'\fR, and returns one reference to the new
\&\f(CW\*(C`refcounted_he\*(C'\fR.
.RS 4
.Sp
.Vb 5
\& struct refcounted_he *  refcounted_he_new_pvn(
\&                                      struct refcounted_he *parent,
\&                                      const char *keypv,
\&                                      STRLEN keylen, U32 hash,
\&                                      SV *value, U32 flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """refcounted_he_new_pvs""" 4
.el .IP "\f(CWrefcounted_he_new_pvs\fR" 4
.IX Xref "refcounted_he_new_pvs"
.IX Item "refcounted_he_new_pvs"
Like \*(L"refcounted_he_new_pvn\*(R", but takes a literal string
instead of a string/length pair, and no precomputed hash.
.RS 4
.Sp
.Vb 3
\& struct refcounted_he *  refcounted_he_new_pvs(
\&                                      struct refcounted_he *parent,
\&                                      "key", SV *value, U32 flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """refcounted_he_new_sv""" 4
.el .IP "\f(CWrefcounted_he_new_sv\fR" 4
.IX Xref "refcounted_he_new_sv"
.IX Item "refcounted_he_new_sv"
Like \*(L"refcounted_he_new_pvn\*(R", but takes a Perl scalar instead of a
string/length pair.
.RS 4
.Sp
.Vb 4
\& struct refcounted_he *  refcounted_he_new_sv(
\&                                      struct refcounted_he *parent,
\&                                      SV *key, U32 hash, SV *value,
\&                                      U32 flags)
.Ve
.RE
.RS 4
.RE
.SH "Input/Output"
.IX Header "Input/Output"
.ie n .IP """PL_last_in_gv""" 4
.el .IP "\f(CWPL_last_in_gv\fR" 4
.IX Xref "PL_last_in_gv"
.IX Item "PL_last_in_gv"
The \s-1GV\s0 which was last used for a filehandle input operation.  (\f(CW\*(C`<FH>\*(C'\fR)
.Sp
On threaded perls, each thread has an independent copy of this variable;
each initialized at creation time with the current value of the creating
thread's copy.
.RS 4
.Sp
.Vb 1
\& GV*  PL_last_in_gv
.Ve
.RE
.RS 4
.RE
.ie n .IP """PL_ofsgv""" 4
.el .IP "\f(CWPL_ofsgv\fR" 4
.IX Xref "PL_ofsgv"
.IX Item "PL_ofsgv"
The glob containing the output field separator \- \f(CW\*(C`*,\*(C'\fR in Perl space.
.Sp
On threaded perls, each thread has an independent copy of this variable;
each initialized at creation time with the current value of the creating
thread's copy.
.RS 4
.Sp
.Vb 1
\& GV*  PL_ofsgv
.Ve
.RE
.RS 4
.RE
.ie n .IP """PL_rs""" 4
.el .IP "\f(CWPL_rs\fR" 4
.IX Xref "PL_rs"
.IX Item "PL_rs"
The input record separator \- \f(CW$/\fR in Perl space.
.Sp
On threaded perls, each thread has an independent copy of this variable;
each initialized at creation time with the current value of the creating
thread's copy.
.RS 4
.Sp
.Vb 1
\& SV*  PL_rs
.Ve
.RE
.RS 4
.RE
.ie n .IP """start_glob""" 4
.el .IP "\f(CWstart_glob\fR" 4
.IX Xref "start_glob"
.IX Item "start_glob"
\&\s-1NOTE:\s0 \f(CW\*(C`start_glob\*(C'\fR is \fBexperimental\fR and may change or be
removed without notice.
.Sp
Function called by \f(CW\*(C`do_readline\*(C'\fR to spawn a glob (or do the glob inside
perl on \s-1VMS\s0).  This code used to be inline, but now perl uses \f(CW\*(C`File::Glob\*(C'\fR
this glob starter is only used by miniperl during the build process,
or when \s-1PERL_EXTERNAL_GLOB\s0 is defined.
Moving it away shrinks \fIpp_hot.c\fR; shrinking \fIpp_hot.c\fR helps speed perl up.
.Sp
\&\s-1NOTE:\s0 \f(CW\*(C`start_glob\*(C'\fR must be explicitly called as
\&\f(CW\*(C`Perl_start_glob\*(C'\fR
with an \f(CW\*(C`aTHX_\*(C'\fR parameter.
.RS 4
.Sp
.Vb 1
\& PerlIO*  Perl_start_glob(pTHX_ SV *tmpglob, IO *io)
.Ve
.RE
.RS 4
.RE
.SH "Integer configuration values"
.IX Header "Integer configuration values"
There are only public \s-1API\s0 items currently in Integer configuration values
.SH "Lexer interface"
.IX Header "Lexer interface"
.ie n .IP """validate_proto""" 4
.el .IP "\f(CWvalidate_proto\fR" 4
.IX Xref "validate_proto"
.IX Item "validate_proto"
\&\s-1NOTE:\s0 \f(CW\*(C`validate_proto\*(C'\fR is \fBexperimental\fR and may change or be
removed without notice.
.Sp
This function performs syntax checking on a prototype, \f(CW\*(C`proto\*(C'\fR.
If \f(CW\*(C`warn\*(C'\fR is true, any illegal characters or mismatched brackets
will trigger illegalproto warnings, declaring that they were
detected in the prototype for \f(CW\*(C`name\*(C'\fR.
.Sp
The return value is \f(CW\*(C`true\*(C'\fR if this is a valid prototype, and
\&\f(CW\*(C`false\*(C'\fR if it is not, regardless of whether \f(CW\*(C`warn\*(C'\fR was \f(CW\*(C`true\*(C'\fR or
\&\f(CW\*(C`false\*(C'\fR.
.Sp
Note that \f(CW\*(C`NULL\*(C'\fR is a valid \f(CW\*(C`proto\*(C'\fR and will always return \f(CW\*(C`true\*(C'\fR.
.RS 4
.Sp
.Vb 2
\& bool  validate_proto(SV *name, SV *proto, bool warn,
\&                      bool curstash)
.Ve
.RE
.RS 4
.RE
.SH "Locales"
.IX Header "Locales"
There are only public \s-1API\s0 items currently in Locales
.SH "Magic"
.IX Header "Magic"
.ie n .IP """magic_clearhint""" 4
.el .IP "\f(CWmagic_clearhint\fR" 4
.IX Xref "magic_clearhint"
.IX Item "magic_clearhint"
Triggered by a delete from \f(CW\*(C`%^H\*(C'\fR, records the key to
\&\f(CW\*(C`PL_compiling.cop_hints_hash\*(C'\fR.
.RS 4
.Sp
.Vb 1
\& int  magic_clearhint(SV* sv, MAGIC* mg)
.Ve
.RE
.RS 4
.RE
.ie n .IP """magic_clearhints""" 4
.el .IP "\f(CWmagic_clearhints\fR" 4
.IX Xref "magic_clearhints"
.IX Item "magic_clearhints"
Triggered by clearing \f(CW\*(C`%^H\*(C'\fR, resets \f(CW\*(C`PL_compiling.cop_hints_hash\*(C'\fR.
.RS 4
.Sp
.Vb 1
\& int  magic_clearhints(SV* sv, MAGIC* mg)
.Ve
.RE
.RS 4
.RE
.ie n .IP """magic_methcall""" 4
.el .IP "\f(CWmagic_methcall\fR" 4
.IX Xref "magic_methcall"
.IX Item "magic_methcall"
Invoke a magic method (like \s-1FETCH\s0).
.Sp
\&\f(CW\*(C`sv\*(C'\fR and \f(CW\*(C`mg\*(C'\fR are the tied thingy and the tie magic.
.Sp
\&\f(CW\*(C`meth\*(C'\fR is the name of the method to call.
.Sp
\&\f(CW\*(C`argc\*(C'\fR is the number of args (in addition to \f(CW$self\fR) to pass to the method.
.Sp
The \f(CW\*(C`flags\*(C'\fR can be:
.Sp
.Vb 4
\&    G_DISCARD     invoke method with G_DISCARD flag and don\*(Aqt
\&                  return a value
\&    G_UNDEF_FILL  fill the stack with argc pointers to
\&                  PL_sv_undef
.Ve
.Sp
The arguments themselves are any values following the \f(CW\*(C`flags\*(C'\fR argument.
.Sp
Returns the \s-1SV\s0 (if any) returned by the method, or \f(CW\*(C`NULL\*(C'\fR on failure.
.Sp
\&\s-1NOTE:\s0 \f(CW\*(C`magic_methcall\*(C'\fR must be explicitly called as
\&\f(CW\*(C`Perl_magic_methcall\*(C'\fR
with an \f(CW\*(C`aTHX_\*(C'\fR parameter.
.RS 4
.Sp
.Vb 2
\& SV*  Perl_magic_methcall(pTHX_ SV *sv, const MAGIC *mg, SV *meth,
\&                          U32 flags, U32 argc, ...)
.Ve
.RE
.RS 4
.RE
.ie n .IP """magic_sethint""" 4
.el .IP "\f(CWmagic_sethint\fR" 4
.IX Xref "magic_sethint"
.IX Item "magic_sethint"
Triggered by a store to \f(CW\*(C`%^H\*(C'\fR, records the key/value pair to
\&\f(CW\*(C`PL_compiling.cop_hints_hash\*(C'\fR.  It is assumed that hints aren't storing
anything that would need a deep copy.  Maybe we should warn if we find a
reference.
.RS 4
.Sp
.Vb 1
\& int  magic_sethint(SV* sv, MAGIC* mg)
.Ve
.RE
.RS 4
.RE
.ie n .IP """mg_localize""" 4
.el .IP "\f(CWmg_localize\fR" 4
.IX Xref "mg_localize"
.IX Item "mg_localize"
Copy some of the magic from an existing \s-1SV\s0 to new localized version of that
\&\s-1SV.\s0  Container magic (\fIe.g.\fR, \f(CW%ENV\fR, \f(CW$1\fR, \f(CW\*(C`tie\*(C'\fR)
gets copied, value magic doesn't (\fIe.g.\fR,
\&\f(CW\*(C`taint\*(C'\fR, \f(CW\*(C`pos\*(C'\fR).
.Sp
If \f(CW\*(C`setmagic\*(C'\fR is false then no set magic will be called on the new (empty) \s-1SV.\s0
This typically means that assignment will soon follow (e.g. \f(CW\*(Aqlocal\ $x\ =\ $y\*(Aq\fR),
and that will handle the magic.
.RS 4
.Sp
.Vb 1
\& void  mg_localize(SV* sv, SV* nsv, bool setmagic)
.Ve
.RE
.RS 4
.RE
.SH "Memory Management"
.IX Header "Memory Management"
There are only public \s-1API\s0 items currently in Memory Management
.SH "MRO"
.IX Header "MRO"
.ie n .IP """mro_get_linear_isa_dfs""" 4
.el .IP "\f(CWmro_get_linear_isa_dfs\fR" 4
.IX Xref "mro_get_linear_isa_dfs"
.IX Item "mro_get_linear_isa_dfs"
Returns the Depth-First Search linearization of \f(CW@ISA\fR
the given stash.  The return value is a read-only AV*.
\&\f(CW\*(C`level\*(C'\fR should be 0 (it is used internally in this
function's recursion).
.Sp
You are responsible for \f(CW\*(C`SvREFCNT_inc()\*(C'\fR 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).
.RS 4
.Sp
.Vb 1
\& AV*  mro_get_linear_isa_dfs(HV* stash, U32 level)
.Ve
.RE
.RS 4
.RE
.ie n .IP """mro_isa_changed_in""" 4
.el .IP "\f(CWmro_isa_changed_in\fR" 4
.IX Xref "mro_isa_changed_in"
.IX Item "mro_isa_changed_in"
Takes the necessary steps (cache invalidations, mostly)
when the \f(CW@ISA\fR of the given package has changed.  Invoked
by the \f(CW\*(C`setisa\*(C'\fR magic, should not need to invoke directly.
.RS 4
.Sp
.Vb 1
\& void  mro_isa_changed_in(HV* stash)
.Ve
.RE
.RS 4
.RE
.ie n .IP """mro_package_moved""" 4
.el .IP "\f(CWmro_package_moved\fR" 4
.IX Xref "mro_package_moved"
.IX Item "mro_package_moved"
Call this function to signal to a stash that it has been assigned to
another spot in the stash hierarchy.  \f(CW\*(C`stash\*(C'\fR is the stash that has been
assigned.  \f(CW\*(C`oldstash\*(C'\fR is the stash it replaces, if any.  \f(CW\*(C`gv\*(C'\fR is the glob
that is actually being assigned to.
.Sp
This can also be called with a null first argument to
indicate that \f(CW\*(C`oldstash\*(C'\fR has been deleted.
.Sp
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 \f(CW\*(C`stash\*(C'\fR.
.Sp
It also sets the effective names (\f(CW\*(C`HvENAME\*(C'\fR) on all the stashes as
appropriate.
.Sp
If the \f(CW\*(C`gv\*(C'\fR is present and is not in the symbol table, then this function
simply returns.  This checked will be skipped if \f(CW\*(C`flags & 1\*(C'\fR.
.RS 4
.Sp
.Vb 2
\& void  mro_package_moved(HV * const stash, HV * const oldstash,
\&                         const GV * const gv, U32 flags)
.Ve
.RE
.RS 4
.RE
.SH "Multicall Functions"
.IX Header "Multicall Functions"
There are only public \s-1API\s0 items currently in Multicall Functions
.SH "Numeric Functions"
.IX Header "Numeric Functions"
.ie n .IP """grok_atoUV""" 4
.el .IP "\f(CWgrok_atoUV\fR" 4
.IX Xref "grok_atoUV"
.IX Item "grok_atoUV"
parse a string, looking for a decimal unsigned integer.
.Sp
On entry, \f(CW\*(C`pv\*(C'\fR points to the beginning of the string;
\&\f(CW\*(C`valptr\*(C'\fR points to a \s-1UV\s0 that will receive the converted value, if found;
\&\f(CW\*(C`endptr\*(C'\fR is either \s-1NULL\s0 or points to a variable that points to one byte
beyond the point in \f(CW\*(C`pv\*(C'\fR that this routine should examine.
If \f(CW\*(C`endptr\*(C'\fR is \s-1NULL,\s0 \f(CW\*(C`pv\*(C'\fR is assumed to be NUL-terminated.
.Sp
Returns \s-1FALSE\s0 if \f(CW\*(C`pv\*(C'\fR doesn't represent a valid unsigned integer value (with
no leading zeros).  Otherwise it returns \s-1TRUE,\s0 and sets \f(CW*valptr\fR to that
value.
.Sp
If you constrain the portion of \f(CW\*(C`pv\*(C'\fR that is looked at by this function (by
passing a non-NULL \f(CW\*(C`endptr\*(C'\fR), and if the intial bytes of that portion form a
valid value, it will return \s-1TRUE,\s0 setting \f(CW*endptr\fR to the byte following the
final digit of the value.  But if there is no constraint at what's looked at,
all of \f(CW\*(C`pv\*(C'\fR must be valid in order for \s-1TRUE\s0 to be returned.  \f(CW*endptr\fR is
unchanged from its value on input if \s-1FALSE\s0 is returned;
.Sp
The only characters this accepts are the decimal digits '0'..'9'.
.Sp
As opposed to \fBatoi\fR\|(3) or \fBstrtol\fR\|(3), \f(CW\*(C`grok_atoUV\*(C'\fR does \s-1NOT\s0 allow optional
leading whitespace, nor negative inputs.  If such features are required, the
calling code needs to explicitly implement those.
.Sp
Note that this function returns \s-1FALSE\s0 for inputs that would overflow a \s-1UV,\s0
or have leading zeros.  Thus a single \f(CW0\fR is accepted, but not \f(CW00\fR nor
\&\f(CW01\fR, \f(CW002\fR, \fIetc\fR.
.Sp
Background: \f(CW\*(C`atoi\*(C'\fR has severe problems with illegal inputs, it cannot be
used for incremental parsing, and therefore should be avoided
\&\f(CW\*(C`atoi\*(C'\fR and \f(CW\*(C`strtol\*(C'\fR are also affected by locale settings, which can also be
seen as a bug (global state controlled by user environment).
.RS 4
.Sp
.Vb 1
\& bool  grok_atoUV(const char* pv, UV* valptr, const char** endptr)
.Ve
.RE
.RS 4
.RE
.ie n .IP """isinfnansv""" 4
.el .IP "\f(CWisinfnansv\fR" 4
.IX Xref "isinfnansv"
.IX Item "isinfnansv"
Checks whether the argument would be either an infinity or \f(CW\*(C`NaN\*(C'\fR when used
as a number, but is careful not to trigger non-numeric or uninitialized
warnings.  it assumes the caller has done \f(CW\*(C`SvGETMAGIC(sv)\*(C'\fR already.
.RS 4
.Sp
.Vb 1
\& bool  isinfnansv(SV *sv)
.Ve
.RE
.RS 4
.RE
.SH "Optree construction"
.IX Header "Optree construction"
There are only public \s-1API\s0 items currently in Optree construction
.SH "Optree Manipulation Functions"
.IX Header "Optree Manipulation Functions"
.ie n .IP """finalize_optree""" 4
.el .IP "\f(CWfinalize_optree\fR" 4
.IX Xref "finalize_optree"
.IX Item "finalize_optree"
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 \f(CW\*(C`ck_\*(C'\fRxxx functions and makes
the tree thread-safe.
.RS 4
.Sp
.Vb 1
\& void  finalize_optree(OP* o)
.Ve
.RE
.RS 4
.RE
.ie n .IP """newATTRSUB_x""" 4
.el .IP "\f(CWnewATTRSUB_x\fR" 4
.IX Xref "newATTRSUB_x"
.IX Item "newATTRSUB_x"
Construct a Perl subroutine, also performing some surrounding jobs.
.Sp
This function is expected to be called in a Perl compilation context,
and some aspects of the subroutine are taken from global variables
associated with compilation.  In particular, \f(CW\*(C`PL_compcv\*(C'\fR represents
the subroutine that is currently being compiled.  It must be non-null
when this function is called, and some aspects of the subroutine being
constructed are taken from it.  The constructed subroutine may actually
be a reuse of the \f(CW\*(C`PL_compcv\*(C'\fR object, but will not necessarily be so.
.Sp
If \f(CW\*(C`block\*(C'\fR is null then the subroutine will have no body, and for the
time being it will be an error to call it.  This represents a forward
subroutine declaration such as \f(CW\*(C`sub\ foo\ ($$);\*(C'\fR.  If \f(CW\*(C`block\*(C'\fR is
non-null then it provides the Perl code of the subroutine body, which
will be executed when the subroutine is called.  This body includes
any argument unwrapping code resulting from a subroutine signature or
similar.  The pad use of the code must correspond to the pad attached
to \f(CW\*(C`PL_compcv\*(C'\fR.  The code is not expected to include a \f(CW\*(C`leavesub\*(C'\fR or
\&\f(CW\*(C`leavesublv\*(C'\fR op; this function will add such an op.  \f(CW\*(C`block\*(C'\fR is consumed
by this function and will become part of the constructed subroutine.
.Sp
\&\f(CW\*(C`proto\*(C'\fR specifies the subroutine's prototype, unless one is supplied
as an attribute (see below).  If \f(CW\*(C`proto\*(C'\fR is null, then the subroutine
will not have a prototype.  If \f(CW\*(C`proto\*(C'\fR is non-null, it must point to a
\&\f(CW\*(C`const\*(C'\fR op whose value is a string, and the subroutine will have that
string as its prototype.  If a prototype is supplied as an attribute, the
attribute takes precedence over \f(CW\*(C`proto\*(C'\fR, but in that case \f(CW\*(C`proto\*(C'\fR should
preferably be null.  In any case, \f(CW\*(C`proto\*(C'\fR is consumed by this function.
.Sp
\&\f(CW\*(C`attrs\*(C'\fR supplies attributes to be applied the subroutine.  A handful of
attributes take effect by built-in means, being applied to \f(CW\*(C`PL_compcv\*(C'\fR
immediately when seen.  Other attributes are collected up and attached
to the subroutine by this route.  \f(CW\*(C`attrs\*(C'\fR may be null to supply no
attributes, or point to a \f(CW\*(C`const\*(C'\fR op for a single attribute, or point
to a \f(CW\*(C`list\*(C'\fR op whose children apart from the \f(CW\*(C`pushmark\*(C'\fR are \f(CW\*(C`const\*(C'\fR
ops for one or more attributes.  Each \f(CW\*(C`const\*(C'\fR op must be a string,
giving the attribute name optionally followed by parenthesised arguments,
in the manner in which attributes appear in Perl source.  The attributes
will be applied to the sub by this function.  \f(CW\*(C`attrs\*(C'\fR is consumed by
this function.
.Sp
If \f(CW\*(C`o_is_gv\*(C'\fR is false and \f(CW\*(C`o\*(C'\fR is null, then the subroutine will
be anonymous.  If \f(CW\*(C`o_is_gv\*(C'\fR is false and \f(CW\*(C`o\*(C'\fR is non-null, then \f(CW\*(C`o\*(C'\fR
must point to a \f(CW\*(C`const\*(C'\fR \s-1OP,\s0 which will be consumed by this function,
and its string value supplies a name for the subroutine.  The name may
be qualified or unqualified, and if it is unqualified then a default
stash will be selected in some manner.  If \f(CW\*(C`o_is_gv\*(C'\fR is true, then \f(CW\*(C`o\*(C'\fR
doesn't point to an \f(CW\*(C`OP\*(C'\fR at all, but is instead a cast pointer to a \f(CW\*(C`GV\*(C'\fR
by which the subroutine will be named.
.Sp
If there is already a subroutine of the specified name, then the new
sub will either replace the existing one in the glob or be merged with
the existing one.  A warning may be generated about redefinition.
.Sp
If the subroutine has one of a few special names, such as \f(CW\*(C`BEGIN\*(C'\fR or
\&\f(CW\*(C`END\*(C'\fR, then it will be claimed by the appropriate queue for automatic
running of phase-related subroutines.  In this case the relevant glob will
be left not containing any subroutine, even if it did contain one before.
In the case of \f(CW\*(C`BEGIN\*(C'\fR, the subroutine will be executed and the reference
to it disposed of before this function returns.
.Sp
The function returns a pointer to the constructed subroutine.  If the sub
is anonymous then ownership of one counted reference to the subroutine
is transferred to the caller.  If the sub is named then the caller does
not get ownership of a reference.  In most such cases, where the sub
has a non-phase name, the sub will be alive at the point it is returned
by virtue of being contained in the glob that names it.  A phase-named
subroutine will usually be alive by virtue of the reference owned by the
phase's automatic run queue.  But a \f(CW\*(C`BEGIN\*(C'\fR subroutine, having already
been executed, will quite likely have been destroyed already by the
time this function returns, making it erroneous for the caller to make
any use of the returned pointer.  It is the caller's responsibility to
ensure that it knows which of these situations applies.
.RS 4
.Sp
.Vb 2
\& CV*  newATTRSUB_x(I32 floor, OP *o, OP *proto, OP *attrs,
\&                   OP *block, bool o_is_gv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """newXS_len_flags""" 4
.el .IP "\f(CWnewXS_len_flags\fR" 4
.IX Xref "newXS_len_flags"
.IX Item "newXS_len_flags"
Construct an \s-1XS\s0 subroutine, also performing some surrounding jobs.
.Sp
The subroutine will have the entry point \f(CW\*(C`subaddr\*(C'\fR.  It will have
the prototype specified by the nul-terminated string \f(CW\*(C`proto\*(C'\fR, or
no prototype if \f(CW\*(C`proto\*(C'\fR is null.  The prototype string is copied;
the caller can mutate the supplied string afterwards.  If \f(CW\*(C`filename\*(C'\fR
is non-null, it must be a nul-terminated filename, and the subroutine
will have its \f(CW\*(C`CvFILE\*(C'\fR set accordingly.  By default \f(CW\*(C`CvFILE\*(C'\fR is set to
point directly to the supplied string, which must be static.  If \f(CW\*(C`flags\*(C'\fR
has the \f(CW\*(C`XS_DYNAMIC_FILENAME\*(C'\fR bit set, then a copy of the string will
be taken instead.
.Sp
Other aspects of the subroutine will be left in their default state.
If anything else needs to be done to the subroutine for it to function
correctly, it is the caller's responsibility to do that after this
function has constructed it.  However, beware of the subroutine
potentially being destroyed before this function returns, as described
below.
.Sp
If \f(CW\*(C`name\*(C'\fR is null then the subroutine will be anonymous, with its
\&\f(CW\*(C`CvGV\*(C'\fR referring to an \f(CW\*(C`_\|_ANON_\|_\*(C'\fR glob.  If \f(CW\*(C`name\*(C'\fR is non-null then the
subroutine will be named accordingly, referenced by the appropriate glob.
\&\f(CW\*(C`name\*(C'\fR is a string of length \f(CW\*(C`len\*(C'\fR bytes giving a sigilless symbol name,
in \s-1UTF\-8\s0 if \f(CW\*(C`flags\*(C'\fR has the \f(CW\*(C`SVf_UTF8\*(C'\fR bit set and in Latin\-1 otherwise.
The name may be either qualified or unqualified, with the stash defaulting
in the same manner as for \f(CW\*(C`gv_fetchpvn_flags\*(C'\fR.  \f(CW\*(C`flags\*(C'\fR may contain
flag bits understood by \f(CW\*(C`gv_fetchpvn_flags\*(C'\fR with the same meaning as
they have there, such as \f(CW\*(C`GV_ADDWARN\*(C'\fR.  The symbol is always added to
the stash if necessary, with \f(CW\*(C`GV_ADDMULTI\*(C'\fR semantics.
.Sp
If there is already a subroutine of the specified name, then the new sub
will replace the existing one in the glob.  A warning may be generated
about the redefinition.  If the old subroutine was \f(CW\*(C`CvCONST\*(C'\fR then the
decision about whether to warn is influenced by an expectation about
whether the new subroutine will become a constant of similar value.
That expectation is determined by \f(CW\*(C`const_svp\*(C'\fR.  (Note that the call to
this function doesn't make the new subroutine \f(CW\*(C`CvCONST\*(C'\fR in any case;
that is left to the caller.)  If \f(CW\*(C`const_svp\*(C'\fR is null then it indicates
that the new subroutine will not become a constant.  If \f(CW\*(C`const_svp\*(C'\fR
is non-null then it indicates that the new subroutine will become a
constant, and it points to an \f(CW\*(C`SV*\*(C'\fR that provides the constant value
that the subroutine will have.
.Sp
If the subroutine has one of a few special names, such as \f(CW\*(C`BEGIN\*(C'\fR or
\&\f(CW\*(C`END\*(C'\fR, then it will be claimed by the appropriate queue for automatic
running of phase-related subroutines.  In this case the relevant glob will
be left not containing any subroutine, even if it did contain one before.
In the case of \f(CW\*(C`BEGIN\*(C'\fR, the subroutine will be executed and the reference
to it disposed of before this function returns, and also before its
prototype is set.  If a \f(CW\*(C`BEGIN\*(C'\fR subroutine would not be sufficiently
constructed by this function to be ready for execution then the caller
must prevent this happening by giving the subroutine a different name.
.Sp
The function returns a pointer to the constructed subroutine.  If the sub
is anonymous then ownership of one counted reference to the subroutine
is transferred to the caller.  If the sub is named then the caller does
not get ownership of a reference.  In most such cases, where the sub
has a non-phase name, the sub will be alive at the point it is returned
by virtue of being contained in the glob that names it.  A phase-named
subroutine will usually be alive by virtue of the reference owned by the
phase's automatic run queue.  But a \f(CW\*(C`BEGIN\*(C'\fR subroutine, having already
been executed, will quite likely have been destroyed already by the
time this function returns, making it erroneous for the caller to make
any use of the returned pointer.  It is the caller's responsibility to
ensure that it knows which of these situations applies.
.RS 4
.Sp
.Vb 5
\& CV *  newXS_len_flags(const char *name, STRLEN len,
\&                       XSUBADDR_t subaddr,
\&                       const char *const filename,
\&                       const char *const proto, SV **const_svp,
\&                       U32 flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """optimize_optree""" 4
.el .IP "\f(CWoptimize_optree\fR" 4
.IX Xref "optimize_optree"
.IX Item "optimize_optree"
This function applies some optimisations to the optree in top-down order.
It is called before the peephole optimizer, which processes ops in
execution order. Note that \fBfinalize_optree()\fR also does a top-down scan,
but is called *after* the peephole optimizer.
.RS 4
.Sp
.Vb 1
\& void  optimize_optree(OP* o)
.Ve
.RE
.RS 4
.RE
.ie n .IP """traverse_op_tree""" 4
.el .IP "\f(CWtraverse_op_tree\fR" 4
.IX Xref "traverse_op_tree"
.IX Item "traverse_op_tree"
Return the next op in a depth-first traversal of the op tree,
returning \s-1NULL\s0 when the traversal is complete.
.Sp
The initial call must supply the root of the tree as both top and o.
.Sp
For now it's static, but it may be exposed to the \s-1API\s0 in the future.
.RS 4
.Sp
.Vb 1
\& OP*  traverse_op_tree(OP* top, OP* o)
.Ve
.RE
.RS 4
.RE
.SH "Pack and Unpack"
.IX Header "Pack and Unpack"
There are only public \s-1API\s0 items currently in Pack and Unpack
.SH "Pad Data Structures"
.IX Header "Pad Data Structures"
.ie n .IP """CX_CURPAD_SAVE""" 4
.el .IP "\f(CWCX_CURPAD_SAVE\fR" 4
.IX Xref "CX_CURPAD_SAVE"
.IX Item "CX_CURPAD_SAVE"
Save the current pad in the given context block structure.
.RS 4
.Sp
.Vb 1
\& void  CX_CURPAD_SAVE(struct context)
.Ve
.RE
.RS 4
.RE
.ie n .IP """CX_CURPAD_SV""" 4
.el .IP "\f(CWCX_CURPAD_SV\fR" 4
.IX Xref "CX_CURPAD_SV"
.IX Item "CX_CURPAD_SV"
Access the \s-1SV\s0 at offset \f(CW\*(C`po\*(C'\fR in the saved current pad in the given
context block structure (can be used as an lvalue).
.RS 4
.Sp
.Vb 1
\& SV *  CX_CURPAD_SV(struct context, PADOFFSET po)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PAD_BASE_SV""" 4
.el .IP "\f(CWPAD_BASE_SV\fR" 4
.IX Xref "PAD_BASE_SV"
.IX Item "PAD_BASE_SV"
Get the value from slot \f(CW\*(C`po\*(C'\fR in the base (DEPTH=1) pad of a padlist
.RS 4
.Sp
.Vb 1
\& SV *  PAD_BASE_SV(PADLIST padlist, PADOFFSET po)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PAD_CLONE_VARS""" 4
.el .IP "\f(CWPAD_CLONE_VARS\fR" 4
.IX Xref "PAD_CLONE_VARS"
.IX Item "PAD_CLONE_VARS"
Clone the state variables associated with running and compiling pads.
.RS 4
.Sp
.Vb 2
\& void  PAD_CLONE_VARS(PerlInterpreter *proto_perl,
\&                      CLONE_PARAMS* param)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PAD_COMPNAME_FLAGS""" 4
.el .IP "\f(CWPAD_COMPNAME_FLAGS\fR" 4
.IX Xref "PAD_COMPNAME_FLAGS"
.IX Item "PAD_COMPNAME_FLAGS"
Return the flags for the current compiling pad name
at offset \f(CW\*(C`po\*(C'\fR.  Assumes a valid slot entry.
.RS 4
.Sp
.Vb 1
\& U32  PAD_COMPNAME_FLAGS(PADOFFSET po)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PAD_COMPNAME_GEN""" 4
.el .IP "\f(CWPAD_COMPNAME_GEN\fR" 4
.IX Xref "PAD_COMPNAME_GEN"
.IX Item "PAD_COMPNAME_GEN"
The generation number of the name at offset \f(CW\*(C`po\*(C'\fR in the current
compiling pad (lvalue).
.RS 4
.Sp
.Vb 1
\& STRLEN  PAD_COMPNAME_GEN(PADOFFSET po)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PAD_COMPNAME_GEN_set""" 4
.el .IP "\f(CWPAD_COMPNAME_GEN_set\fR" 4
.IX Xref "PAD_COMPNAME_GEN_set"
.IX Item "PAD_COMPNAME_GEN_set"
Sets the generation number of the name at offset \f(CW\*(C`po\*(C'\fR in the current
ling pad (lvalue) to \f(CW\*(C`gen\*(C'\fR.
.RS 4
.Sp
.Vb 1
\& STRLEN  PAD_COMPNAME_GEN_set(PADOFFSET po, int gen)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PAD_COMPNAME_OURSTASH""" 4
.el .IP "\f(CWPAD_COMPNAME_OURSTASH\fR" 4
.IX Xref "PAD_COMPNAME_OURSTASH"
.IX Item "PAD_COMPNAME_OURSTASH"
Return the stash associated with an \f(CW\*(C`our\*(C'\fR variable.
Assumes the slot entry is a valid \f(CW\*(C`our\*(C'\fR lexical.
.RS 4
.Sp
.Vb 1
\& HV *  PAD_COMPNAME_OURSTASH(PADOFFSET po)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PAD_COMPNAME_PV""" 4
.el .IP "\f(CWPAD_COMPNAME_PV\fR" 4
.IX Xref "PAD_COMPNAME_PV"
.IX Item "PAD_COMPNAME_PV"
Return the name of the current compiling pad name
at offset \f(CW\*(C`po\*(C'\fR.  Assumes a valid slot entry.
.RS 4
.Sp
.Vb 1
\& char *  PAD_COMPNAME_PV(PADOFFSET po)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PAD_COMPNAME_TYPE""" 4
.el .IP "\f(CWPAD_COMPNAME_TYPE\fR" 4
.IX Xref "PAD_COMPNAME_TYPE"
.IX Item "PAD_COMPNAME_TYPE"
Return the type (stash) of the current compiling pad name at offset
\&\f(CW\*(C`po\*(C'\fR.  Must be a valid name.  Returns null if not typed.
.RS 4
.Sp
.Vb 1
\& HV *  PAD_COMPNAME_TYPE(PADOFFSET po)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PadnameIsOUR""" 4
.el .IP "\f(CWPadnameIsOUR\fR" 4
.IX Xref "PadnameIsOUR"
.IX Item "PadnameIsOUR"
Whether this is an \*(L"our\*(R" variable.
.RS 4
.Sp
.Vb 1
\& bool  PadnameIsOUR(PADNAME * pn)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PadnameIsSTATE""" 4
.el .IP "\f(CWPadnameIsSTATE\fR" 4
.IX Xref "PadnameIsSTATE"
.IX Item "PadnameIsSTATE"
Whether this is a \*(L"state\*(R" variable.
.RS 4
.Sp
.Vb 1
\& bool  PadnameIsSTATE(PADNAME * pn)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PadnameOURSTASH""" 4
.el .IP "\f(CWPadnameOURSTASH\fR" 4
.IX Xref "PadnameOURSTASH"
.IX Item "PadnameOURSTASH"
The stash in which this \*(L"our\*(R" variable was declared.
.RS 4
.Sp
.Vb 1
\& HV *  PadnameOURSTASH(PADNAME * pn)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PadnameOUTER""" 4
.el .IP "\f(CWPadnameOUTER\fR" 4
.IX Xref "PadnameOUTER"
.IX Item "PadnameOUTER"
Whether this entry belongs to an outer pad.  Entries for which this is true
are often referred to as 'fake'.
.RS 4
.Sp
.Vb 1
\& bool  PadnameOUTER(PADNAME * pn)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PadnameTYPE""" 4
.el .IP "\f(CWPadnameTYPE\fR" 4
.IX Xref "PadnameTYPE"
.IX Item "PadnameTYPE"
The stash associated with a typed lexical.  This returns the \f(CW%Foo::\fR hash
for \f(CW\*(C`my Foo $bar\*(C'\fR.
.RS 4
.Sp
.Vb 1
\& HV *  PadnameTYPE(PADNAME * pn)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PAD_RESTORE_LOCAL""" 4
.el .IP "\f(CWPAD_RESTORE_LOCAL\fR" 4
.IX Xref "PAD_RESTORE_LOCAL"
.IX Item "PAD_RESTORE_LOCAL"
Restore the old pad saved into the local variable \f(CW\*(C`opad\*(C'\fR by \f(CW\*(C`PAD_SAVE_LOCAL()\*(C'\fR
.RS 4
.Sp
.Vb 1
\& void  PAD_RESTORE_LOCAL(PAD *opad)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PAD_SAVE_LOCAL""" 4
.el .IP "\f(CWPAD_SAVE_LOCAL\fR" 4
.IX Xref "PAD_SAVE_LOCAL"
.IX Item "PAD_SAVE_LOCAL"
Save the current pad to the local variable \f(CW\*(C`opad\*(C'\fR, then make the
current pad equal to \f(CW\*(C`npad\*(C'\fR
.RS 4
.Sp
.Vb 1
\& void  PAD_SAVE_LOCAL(PAD *opad, PAD *npad)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PAD_SAVE_SETNULLPAD""" 4
.el .IP "\f(CWPAD_SAVE_SETNULLPAD\fR" 4
.IX Xref "PAD_SAVE_SETNULLPAD"
.IX Item "PAD_SAVE_SETNULLPAD"
Save the current pad then set it to null.
.RS 4
.Sp
.Vb 1
\& void  PAD_SAVE_SETNULLPAD()
.Ve
.RE
.RS 4
.RE
.ie n .IP """PAD_SETSV""" 4
.el .IP "\f(CWPAD_SETSV\fR" 4
.IX Xref "PAD_SETSV"
.IX Item "PAD_SETSV"
Set the slot at offset \f(CW\*(C`po\*(C'\fR in the current pad to \f(CW\*(C`sv\*(C'\fR
.RS 4
.Sp
.Vb 1
\& SV *  PAD_SETSV(PADOFFSET po, SV* sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PAD_SET_CUR""" 4
.el .IP "\f(CWPAD_SET_CUR\fR" 4
.IX Xref "PAD_SET_CUR"
.IX Item "PAD_SET_CUR"
Set the current pad to be pad \f(CW\*(C`n\*(C'\fR in the padlist, saving
the previous current pad.  \s-1NB\s0 currently this macro expands to a string too
long for some compilers, so it's best to replace it with
.Sp
.Vb 2
\&    SAVECOMPPAD();
\&    PAD_SET_CUR_NOSAVE(padlist,n);
.Ve
.RS 4
.Sp
.Vb 1
\& void  PAD_SET_CUR(PADLIST padlist, I32 n)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PAD_SET_CUR_NOSAVE""" 4
.el .IP "\f(CWPAD_SET_CUR_NOSAVE\fR" 4
.IX Xref "PAD_SET_CUR_NOSAVE"
.IX Item "PAD_SET_CUR_NOSAVE"
like \s-1PAD_SET_CUR,\s0 but without the save
.RS 4
.Sp
.Vb 1
\& void  PAD_SET_CUR_NOSAVE(PADLIST padlist, I32 n)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PAD_SV""" 4
.el .IP "\f(CWPAD_SV\fR" 4
.IX Xref "PAD_SV"
.IX Item "PAD_SV"
Get the value at offset \f(CW\*(C`po\*(C'\fR in the current pad
.RS 4
.Sp
.Vb 1
\& SV *  PAD_SV(PADOFFSET po)
.Ve
.RE
.RS 4
.RE
.ie n .IP """PAD_SVl""" 4
.el .IP "\f(CWPAD_SVl\fR" 4
.IX Xref "PAD_SVl"
.IX Item "PAD_SVl"
Lightweight and lvalue version of \f(CW\*(C`PAD_SV\*(C'\fR.
Get or set the value at offset \f(CW\*(C`po\*(C'\fR in the current pad.
Unlike \f(CW\*(C`PAD_SV\*(C'\fR, does not print diagnostics with \-DX.
For internal use only.
.RS 4
.Sp
.Vb 1
\& SV *  PAD_SVl(PADOFFSET po)
.Ve
.RE
.RS 4
.RE
.ie n .IP """SAVECLEARSV""" 4
.el .IP "\f(CWSAVECLEARSV\fR" 4
.IX Xref "SAVECLEARSV"
.IX Item "SAVECLEARSV"
Clear the pointed to pad value on scope exit.  (i.e. the runtime action of
\&\f(CW\*(C`my\*(C'\fR)
.RS 4
.Sp
.Vb 1
\& void  SAVECLEARSV(SV **svp)
.Ve
.RE
.RS 4
.RE
.ie n .IP """SAVECOMPPAD""" 4
.el .IP "\f(CWSAVECOMPPAD\fR" 4
.IX Xref "SAVECOMPPAD"
.IX Item "SAVECOMPPAD"
save \f(CW\*(C`PL_comppad\*(C'\fR and \f(CW\*(C`PL_curpad\*(C'\fR
.RS 4
.Sp
.Vb 1
\& void  SAVECOMPPAD()
.Ve
.RE
.RS 4
.RE
.ie n .IP """SAVEPADSV""" 4
.el .IP "\f(CWSAVEPADSV\fR" 4
.IX Xref "SAVEPADSV"
.IX Item "SAVEPADSV"
Save a pad slot (used to restore after an iteration)
.RS 4
.Sp
.Vb 1
\& void  SAVEPADSV(PADOFFSET po)
.Ve
.RE
.RS 4
.RE
.SH "Password and Group access"
.IX Header "Password and Group access"
There are only public \s-1API\s0 items currently in Password and Group access
.SH "Paths to system commands"
.IX Header "Paths to system commands"
There are only public \s-1API\s0 items currently in Paths to system commands
.SH "Prototype information"
.IX Header "Prototype information"
There are only public \s-1API\s0 items currently in Prototype information
.SH "REGEXP Functions"
.IX Header "REGEXP Functions"
There are only public \s-1API\s0 items currently in \s-1REGEXP\s0 Functions
.SH "Signals"
.IX Header "Signals"
There are only public \s-1API\s0 items currently in Signals
.SH "Site configuration"
.IX Header "Site configuration"
There are only public \s-1API\s0 items currently in Site configuration
.SH "Sockets configuration values"
.IX Header "Sockets configuration values"
There are only public \s-1API\s0 items currently in Sockets configuration values
.SH "Source Filters"
.IX Header "Source Filters"
There are only public \s-1API\s0 items currently in Source Filters
.SH "Stack Manipulation Macros"
.IX Header "Stack Manipulation Macros"
.ie n .IP """djSP""" 4
.el .IP "\f(CWdjSP\fR" 4
.IX Xref "djSP"
.IX Item "djSP"
Declare Just \f(CW\*(C`SP\*(C'\fR.  This is actually identical to \f(CW\*(C`dSP\*(C'\fR, and declares
a local copy of perl's stack pointer, available via the \f(CW\*(C`SP\*(C'\fR macro.
See \f(CW\*(C`"SP" in perlapi\*(C'\fR.  (Available for backward source code compatibility with
the old (Perl 5.005) thread model.)
.RS 4
.Sp
.Vb 1
\&   djSP();
.Ve
.RE
.RS 4
.RE
.ie n .IP """LVRET""" 4
.el .IP "\f(CWLVRET\fR" 4
.IX Xref "LVRET"
.IX Item "LVRET"
True if this op will be the return value of an lvalue subroutine
.SH "String Handling"
.IX Header "String Handling"
.ie n .IP """delimcpy_no_escape""" 4
.el .IP "\f(CWdelimcpy_no_escape\fR" 4
.IX Xref "delimcpy_no_escape"
.IX Item "delimcpy_no_escape"
Copy a source buffer to a destination buffer, stopping at (but not including)
the first occurrence in the source of the delimiter byte, \f(CW\*(C`delim\*(C'\fR.  The source
is the bytes between \f(CW\*(C`from\*(C'\fR\ and\ \f(CW\*(C`from_end\*(C'\fR\ \-\ 1.  Similarly, the dest is
\&\f(CW\*(C`to\*(C'\fR up to \f(CW\*(C`to_end\*(C'\fR.
.Sp
The number of bytes copied is written to \f(CW*retlen\fR.
.Sp
Returns the position of \f(CW\*(C`delim\*(C'\fR in the \f(CW\*(C`from\*(C'\fR buffer, but if there is no
such occurrence before \f(CW\*(C`from_end\*(C'\fR, then \f(CW\*(C`from_end\*(C'\fR is returned, and the entire
buffer \f(CW\*(C`from\*(C'\fR\ ..\ \f(CW\*(C`from_end\*(C'\fR\ \-\ 1 is copied.
.Sp
If there is room in the destination available after the copy, an extra
terminating safety \f(CW\*(C`NUL\*(C'\fR byte is appended (not included in the returned
length).
.Sp
The error case is if the destination buffer is not large enough to accommodate
everything that should be copied.  In this situation, a value larger than
\&\f(CW\*(C`to_end\*(C'\fR\ \-\ \f(CW\*(C`to\*(C'\fR is written to \f(CW*retlen\fR, and as much of the source as
fits will be written to the destination.  Not having room for the safety \f(CW\*(C`NUL\*(C'\fR
is not considered an error.
.RS 4
.Sp
.Vb 3
\& char*  delimcpy_no_escape(char* to, const char* to_end,
\&                           const char* from, const char* from_end,
\&                           const int delim, I32* retlen)
.Ve
.RE
.RS 4
.RE
.ie n .IP """quadmath_format_needed""" 4
.el .IP "\f(CWquadmath_format_needed\fR" 4
.IX Xref "quadmath_format_needed"
.IX Item "quadmath_format_needed"
\&\f(CW\*(C`quadmath_format_needed()\*(C'\fR returns true if the \f(CW\*(C`format\*(C'\fR string seems to
contain at least one non-Q-prefixed \f(CW\*(C`%[efgaEFGA]\*(C'\fR format specifier,
or returns false otherwise.
.Sp
The format specifier detection is not complete printf-syntax detection,
but it should catch most common cases.
.Sp
If true is returned, those arguments \fBshould\fR in theory be processed
with \f(CW\*(C`quadmath_snprintf()\*(C'\fR, but in case there is more than one such
format specifier (see \*(L"quadmath_format_valid\*(R"), and if there is
anything else beyond that one (even just a single byte), they
\&\fBcannot\fR be processed because \f(CW\*(C`quadmath_snprintf()\*(C'\fR is very strict,
accepting only one format spec, and nothing else.
In this case, the code should probably fail.
.RS 4
.Sp
.Vb 1
\& bool  quadmath_format_needed(const char* format)
.Ve
.RE
.RS 4
.RE
.ie n .IP """quadmath_format_valid""" 4
.el .IP "\f(CWquadmath_format_valid\fR" 4
.IX Xref "quadmath_format_valid"
.IX Item "quadmath_format_valid"
\&\f(CW\*(C`quadmath_snprintf()\*(C'\fR is very strict about its \f(CW\*(C`format\*(C'\fR string and will
fail, returning \-1, if the format is invalid.  It accepts exactly
one format spec.
.Sp
\&\f(CW\*(C`quadmath_format_valid()\*(C'\fR checks that the intended single spec looks
sane: begins with \f(CW\*(C`%\*(C'\fR, has only one \f(CW\*(C`%\*(C'\fR, ends with \f(CW\*(C`[efgaEFGA]\*(C'\fR,
and has \f(CW\*(C`Q\*(C'\fR before it.  This is not a full \*(L"printf syntax check\*(R",
just the basics.
.Sp
Returns true if it is valid, false if not.
.Sp
See also \*(L"quadmath_format_needed\*(R".
.RS 4
.Sp
.Vb 1
\& bool  quadmath_format_valid(const char* format)
.Ve
.RE
.RS 4
.RE
.SH "SV Flags"
.IX Header "SV Flags"
.ie n .IP """SVt_INVLIST""" 4
.el .IP "\f(CWSVt_INVLIST\fR" 4
.IX Xref "SVt_INVLIST"
.IX Item "SVt_INVLIST"
Type flag for scalars.  See \*(L"svtype\*(R" in perlapi.
.SH "SV Handling"
.IX Header "SV Handling"
.ie n .IP """PL_Sv""" 4
.el .IP "\f(CWPL_Sv\fR" 4
.IX Xref "PL_Sv"
.IX Item "PL_Sv"
A scratch pad \s-1SV\s0 for whatever temporary use you need.  Chiefly used as a
fallback by macros on platforms where \*(L"\s-1PERL_USE_GCC_BRACE_GROUPS\*(R"\s0 in perlapi> is
unavailable, and which would otherwise evaluate their \s-1SV\s0 parameter more than
once.
.RS 4
.Sp
.Vb 1
\&   PL_Sv
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_2bool""" 4
.el .IP "\f(CWsv_2bool\fR" 4
.IX Xref "sv_2bool"
.IX Item "sv_2bool"
This macro is only used by \f(CW\*(C`sv_true()\*(C'\fR or its macro equivalent, and only if
the latter's argument is neither \f(CW\*(C`SvPOK\*(C'\fR, \f(CW\*(C`SvIOK\*(C'\fR nor \f(CW\*(C`SvNOK\*(C'\fR.
It calls \f(CW\*(C`sv_2bool_flags\*(C'\fR with the \f(CW\*(C`SV_GMAGIC\*(C'\fR flag.
.RS 4
.Sp
.Vb 1
\& bool  sv_2bool(SV *const sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_2bool_flags""" 4
.el .IP "\f(CWsv_2bool_flags\fR" 4
.IX Xref "sv_2bool_flags"
.IX Item "sv_2bool_flags"
This function is only used by \f(CW\*(C`sv_true()\*(C'\fR and friends,  and only if
the latter's argument is neither \f(CW\*(C`SvPOK\*(C'\fR, \f(CW\*(C`SvIOK\*(C'\fR nor \f(CW\*(C`SvNOK\*(C'\fR.  If the flags
contain \f(CW\*(C`SV_GMAGIC\*(C'\fR, then it does an \f(CW\*(C`mg_get()\*(C'\fR first.
.RS 4
.Sp
.Vb 1
\& bool  sv_2bool_flags(SV *sv, I32 flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_2num""" 4
.el .IP "\f(CWsv_2num\fR" 4
.IX Xref "sv_2num"
.IX Item "sv_2num"
\&\s-1NOTE:\s0 \f(CW\*(C`sv_2num\*(C'\fR is \fBexperimental\fR and may change or be
removed without notice.
.Sp
Return an \s-1SV\s0 with the numeric value of the source \s-1SV,\s0 doing any necessary
reference or overload conversion.  The caller is expected to have handled
get-magic already.
.RS 4
.Sp
.Vb 1
\& SV*  sv_2num(SV *const sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_2pvbyte_nolen""" 4
.el .IP "\f(CWsv_2pvbyte_nolen\fR" 4
.IX Xref "sv_2pvbyte_nolen"
.IX Item "sv_2pvbyte_nolen"
Return a pointer to the byte-encoded representation of the \s-1SV.\s0
May cause the \s-1SV\s0 to be downgraded from \s-1UTF\-8\s0 as a side-effect.
.Sp
Usually accessed via the \f(CW\*(C`SvPVbyte_nolen\*(C'\fR macro.
.RS 4
.Sp
.Vb 1
\& char*  sv_2pvbyte_nolen(SV* sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_2pvutf8_nolen""" 4
.el .IP "\f(CWsv_2pvutf8_nolen\fR" 4
.IX Xref "sv_2pvutf8_nolen"
.IX Item "sv_2pvutf8_nolen"
Return a pointer to the UTF\-8\-encoded representation of the \s-1SV.\s0
May cause the \s-1SV\s0 to be upgraded to \s-1UTF\-8\s0 as a side-effect.
.Sp
Usually accessed via the \f(CW\*(C`SvPVutf8_nolen\*(C'\fR macro.
.RS 4
.Sp
.Vb 1
\& char*  sv_2pvutf8_nolen(SV* sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_2pv_flags""" 4
.el .IP "\f(CWsv_2pv_flags\fR" 4
.IX Xref "sv_2pv_flags"
.IX Item "sv_2pv_flags"
Returns a pointer to the string value of an \s-1SV,\s0 and sets \f(CW*lp\fR to its length.
If flags has the \f(CW\*(C`SV_GMAGIC\*(C'\fR bit set, does an \f(CW\*(C`mg_get()\*(C'\fR first.  Coerces \f(CW\*(C`sv\*(C'\fR to a
string if necessary.  Normally invoked via the \f(CW\*(C`SvPV_flags\*(C'\fR macro.
\&\f(CW\*(C`sv_2pv()\*(C'\fR and \f(CW\*(C`sv_2pv_nomg\*(C'\fR usually end up here too.
.RS 4
.Sp
.Vb 2
\& char*  sv_2pv_flags(SV *const sv, STRLEN *const lp,
\&                     const U32 flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_2pv_nolen""" 4
.el .IP "\f(CWsv_2pv_nolen\fR" 4
.IX Xref "sv_2pv_nolen"
.IX Item "sv_2pv_nolen"
Like \f(CW\*(C`sv_2pv()\*(C'\fR, but doesn't return the length too.  You should usually
use the macro wrapper \f(CW\*(C`SvPV_nolen(sv)\*(C'\fR instead.
.RS 4
.Sp
.Vb 1
\& char*  sv_2pv_nolen(SV* sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_add_arena""" 4
.el .IP "\f(CWsv_add_arena\fR" 4
.IX Xref "sv_add_arena"
.IX Item "sv_add_arena"
Given a chunk of memory, link it to the head of the list of arenas,
and split it into a list of free SVs.
.RS 4
.Sp
.Vb 2
\& void  sv_add_arena(char *const ptr, const U32 size,
\&                    const U32 flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_clean_all""" 4
.el .IP "\f(CWsv_clean_all\fR" 4
.IX Xref "sv_clean_all"
.IX Item "sv_clean_all"
Decrement the refcnt of each remaining \s-1SV,\s0 possibly triggering a
cleanup.  This function may have to be called multiple times to free
SVs which are in complex self-referential hierarchies.
.RS 4
.Sp
.Vb 1
\& I32  sv_clean_all()
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_clean_objs""" 4
.el .IP "\f(CWsv_clean_objs\fR" 4
.IX Xref "sv_clean_objs"
.IX Item "sv_clean_objs"
Attempt to destroy all objects not yet freed.
.RS 4
.Sp
.Vb 1
\& void  sv_clean_objs()
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_free_arenas""" 4
.el .IP "\f(CWsv_free_arenas\fR" 4
.IX Xref "sv_free_arenas"
.IX Item "sv_free_arenas"
Deallocate the memory used by all arenas.  Note that all the individual \s-1SV\s0
heads and bodies within the arenas must already have been freed.
.RS 4
.Sp
.Vb 1
\& void  sv_free_arenas()
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_grow""" 4
.el .IP "\f(CWsv_grow\fR" 4
.IX Xref "sv_grow"
.IX Item "sv_grow"
Expands the character buffer in the \s-1SV.\s0  If necessary, uses \f(CW\*(C`sv_unref\*(C'\fR and
upgrades the \s-1SV\s0 to \f(CW\*(C`SVt_PV\*(C'\fR.  Returns a pointer to the character buffer.
Use the \f(CW\*(C`SvGROW\*(C'\fR wrapper instead.
.RS 4
.Sp
.Vb 1
\& char*  sv_grow(SV *const sv, STRLEN newlen)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_iv""" 4
.el .IP "\f(CWsv_iv\fR" 4
.IX Xref "sv_iv"
.IX Item "sv_iv"
\&\f(CW\*(C`\f(CBDEPRECATED!\f(CW\*(C'\fR  It is planned to remove \f(CW\*(C`sv_iv\*(C'\fR from a
future release of Perl.  Do not use it for new code; remove it from
existing code.
.Sp
A private implementation of the \f(CW\*(C`SvIVx\*(C'\fR macro for compilers which can't
cope with complex macro expressions.  Always use the macro instead.
.RS 4
.Sp
.Vb 1
\& IV  sv_iv(SV* sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_newref""" 4
.el .IP "\f(CWsv_newref\fR" 4
.IX Xref "sv_newref"
.IX Item "sv_newref"
Increment an \s-1SV\s0's reference count.  Use the \f(CW\*(C`SvREFCNT_inc()\*(C'\fR wrapper
instead.
.RS 4
.Sp
.Vb 1
\& SV*  sv_newref(SV *const sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_nv""" 4
.el .IP "\f(CWsv_nv\fR" 4
.IX Xref "sv_nv"
.IX Item "sv_nv"
\&\f(CW\*(C`\f(CBDEPRECATED!\f(CW\*(C'\fR  It is planned to remove \f(CW\*(C`sv_nv\*(C'\fR from a
future release of Perl.  Do not use it for new code; remove it from
existing code.
.Sp
A private implementation of the \f(CW\*(C`SvNVx\*(C'\fR macro for compilers which can't
cope with complex macro expressions.  Always use the macro instead.
.RS 4
.Sp
.Vb 1
\& NV  sv_nv(SV* sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_pv""" 4
.el .IP "\f(CWsv_pv\fR" 4
.IX Xref "sv_pv"
.IX Item "sv_pv"
Use the \f(CW\*(C`SvPV_nolen\*(C'\fR macro instead
.RS 4
.Sp
.Vb 1
\& char*  sv_pv(SV *sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_pvbyte""" 4
.el .IP "\f(CWsv_pvbyte\fR" 4
.IX Xref "sv_pvbyte"
.IX Item "sv_pvbyte"
Use \f(CW\*(C`SvPVbyte_nolen\*(C'\fR instead.
.RS 4
.Sp
.Vb 1
\& char*  sv_pvbyte(SV *sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_pvbyten""" 4
.el .IP "\f(CWsv_pvbyten\fR" 4
.IX Xref "sv_pvbyten"
.IX Item "sv_pvbyten"
\&\f(CW\*(C`\f(CBDEPRECATED!\f(CW\*(C'\fR  It is planned to remove \f(CW\*(C`sv_pvbyten\*(C'\fR from a
future release of Perl.  Do not use it for new code; remove it from
existing code.
.Sp
A private implementation of the \f(CW\*(C`SvPVbyte\*(C'\fR macro for compilers
which can't cope with complex macro expressions.  Always use the macro
instead.
.RS 4
.Sp
.Vb 1
\& char*  sv_pvbyten(SV *sv, STRLEN *lp)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_pvbyten_force""" 4
.el .IP "\f(CWsv_pvbyten_force\fR" 4
.IX Xref "sv_pvbyten_force"
.IX Item "sv_pvbyten_force"
The backend for the \f(CW\*(C`SvPVbytex_force\*(C'\fR macro.  Always use the macro
instead.  If the \s-1SV\s0 cannot be downgraded from \s-1UTF\-8,\s0 this croaks.
.RS 4
.Sp
.Vb 1
\& char*  sv_pvbyten_force(SV *const sv, STRLEN *const lp)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_pvn""" 4
.el .IP "\f(CWsv_pvn\fR" 4
.IX Xref "sv_pvn"
.IX Item "sv_pvn"
\&\f(CW\*(C`\f(CBDEPRECATED!\f(CW\*(C'\fR  It is planned to remove \f(CW\*(C`sv_pvn\*(C'\fR from a
future release of Perl.  Do not use it for new code; remove it from
existing code.
.Sp
A private implementation of the \f(CW\*(C`SvPV\*(C'\fR macro for compilers which can't
cope with complex macro expressions.  Always use the macro instead.
.RS 4
.Sp
.Vb 1
\& char*  sv_pvn(SV *sv, STRLEN *lp)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_pvn_force""" 4
.el .IP "\f(CWsv_pvn_force\fR" 4
.IX Xref "sv_pvn_force"
.IX Item "sv_pvn_force"
Get a sensible string out of the \s-1SV\s0 somehow.
A private implementation of the \f(CW\*(C`SvPV_force\*(C'\fR macro for compilers which
can't cope with complex macro expressions.  Always use the macro instead.
.RS 4
.Sp
.Vb 1
\& char*  sv_pvn_force(SV* sv, STRLEN* lp)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_pvutf8""" 4
.el .IP "\f(CWsv_pvutf8\fR" 4
.IX Xref "sv_pvutf8"
.IX Item "sv_pvutf8"
Use the \f(CW\*(C`SvPVutf8_nolen\*(C'\fR macro instead
.RS 4
.Sp
.Vb 1
\& char*  sv_pvutf8(SV *sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_pvutf8n""" 4
.el .IP "\f(CWsv_pvutf8n\fR" 4
.IX Xref "sv_pvutf8n"
.IX Item "sv_pvutf8n"
\&\f(CW\*(C`\f(CBDEPRECATED!\f(CW\*(C'\fR  It is planned to remove \f(CW\*(C`sv_pvutf8n\*(C'\fR from a
future release of Perl.  Do not use it for new code; remove it from
existing code.
.Sp
A private implementation of the \f(CW\*(C`SvPVutf8\*(C'\fR macro for compilers
which can't cope with complex macro expressions.  Always use the macro
instead.
.RS 4
.Sp
.Vb 1
\& char*  sv_pvutf8n(SV *sv, STRLEN *lp)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_pvutf8n_force""" 4
.el .IP "\f(CWsv_pvutf8n_force\fR" 4
.IX Xref "sv_pvutf8n_force"
.IX Item "sv_pvutf8n_force"
The backend for the \f(CW\*(C`SvPVutf8x_force\*(C'\fR macro.  Always use the macro
instead.
.RS 4
.Sp
.Vb 1
\& char*  sv_pvutf8n_force(SV *const sv, STRLEN *const lp)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_taint""" 4
.el .IP "\f(CWsv_taint\fR" 4
.IX Xref "sv_taint"
.IX Item "sv_taint"
Taint an \s-1SV.\s0  Use \f(CW\*(C`SvTAINTED_on\*(C'\fR instead.
.RS 4
.Sp
.Vb 1
\& void  sv_taint(SV* sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_tainted""" 4
.el .IP "\f(CWsv_tainted\fR" 4
.IX Xref "sv_tainted"
.IX Item "sv_tainted"
Test an \s-1SV\s0 for taintedness.  Use \f(CW\*(C`SvTAINTED\*(C'\fR instead.
.RS 4
.Sp
.Vb 1
\& bool  sv_tainted(SV *const sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """SvTHINKFIRST""" 4
.el .IP "\f(CWSvTHINKFIRST\fR" 4
.IX Xref "SvTHINKFIRST"
.IX Item "SvTHINKFIRST"
A quick flag check to see whether an \f(CW\*(C`sv\*(C'\fR should be passed to \f(CW\*(C`sv_force_normal\*(C'\fR
to be \*(L"downgraded\*(R" before \f(CW\*(C`SvIVX\*(C'\fR or \f(CW\*(C`SvPVX\*(C'\fR can be modified directly.
.Sp
For example, if your scalar is a reference and you want to modify the \f(CW\*(C`SvIVX\*(C'\fR
slot, you can't just do \f(CW\*(C`SvROK_off\*(C'\fR, as that will leak the referent.
.Sp
This is used internally by various sv-modifying functions, such as
\&\f(CW\*(C`sv_setsv\*(C'\fR, \f(CW\*(C`sv_setiv\*(C'\fR and \f(CW\*(C`sv_pvn_force\*(C'\fR.
.Sp
One case that this does not handle is a gv without SvFAKE set.  After
.Sp
.Vb 1
\&    if (SvTHINKFIRST(gv)) sv_force_normal(gv);
.Ve
.Sp
it will still be a gv.
.Sp
\&\f(CW\*(C`SvTHINKFIRST\*(C'\fR sometimes produces false positives.  In those cases
\&\f(CW\*(C`sv_force_normal\*(C'\fR does nothing.
.RS 4
.Sp
.Vb 1
\& U32  SvTHINKFIRST(SV *sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_true""" 4
.el .IP "\f(CWsv_true\fR" 4
.IX Xref "sv_true"
.IX Item "sv_true"
Returns true if the \s-1SV\s0 has a true value by Perl's rules.
Use the \f(CW\*(C`SvTRUE\*(C'\fR macro instead, which may call \f(CW\*(C`sv_true()\*(C'\fR or may
instead use an in-line version.
.RS 4
.Sp
.Vb 1
\& I32  sv_true(SV *const sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_untaint""" 4
.el .IP "\f(CWsv_untaint\fR" 4
.IX Xref "sv_untaint"
.IX Item "sv_untaint"
Untaint an \s-1SV.\s0  Use \f(CW\*(C`SvTAINTED_off\*(C'\fR instead.
.RS 4
.Sp
.Vb 1
\& void  sv_untaint(SV *const sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """sv_uv""" 4
.el .IP "\f(CWsv_uv\fR" 4
.IX Xref "sv_uv"
.IX Item "sv_uv"
\&\f(CW\*(C`\f(CBDEPRECATED!\f(CW\*(C'\fR  It is planned to remove \f(CW\*(C`sv_uv\*(C'\fR from a
future release of Perl.  Do not use it for new code; remove it from
existing code.
.Sp
A private implementation of the \f(CW\*(C`SvUVx\*(C'\fR macro for compilers which can't
cope with complex macro expressions.  Always use the macro instead.
.RS 4
.Sp
.Vb 1
\& UV  sv_uv(SV* sv)
.Ve
.RE
.RS 4
.RE
.SH "Time"
.IX Header "Time"
There are only public \s-1API\s0 items currently in Time
.SH "Typedef names"
.IX Header "Typedef names"
There are only public \s-1API\s0 items currently in Typedef names
.SH "Unicode Support"
.IX Header "Unicode Support"
.ie n .IP """bytes_from_utf8_loc""" 4
.el .IP "\f(CWbytes_from_utf8_loc\fR" 4
.IX Xref "bytes_from_utf8_loc"
.IX Item "bytes_from_utf8_loc"
\&\s-1NOTE:\s0 \f(CW\*(C`bytes_from_utf8_loc\*(C'\fR is \fBexperimental\fR and may change or be
removed without notice.
.Sp
Like \f(CW\*(C`"bytes_from_utf8" in perlapi()\*(C'\fR, but takes an extra parameter, a pointer
to where to store the location of the first character in \f(CW"s"\fR that cannot be
converted to non\-UTF8.
.Sp
If that parameter is \f(CW\*(C`NULL\*(C'\fR, this function behaves identically to
\&\f(CW\*(C`bytes_from_utf8\*(C'\fR.
.Sp
Otherwise if \f(CW*is_utf8p\fR is 0 on input, the function behaves identically to
\&\f(CW\*(C`bytes_from_utf8\*(C'\fR, except it also sets \f(CW*first_non_downgradable\fR to \f(CW\*(C`NULL\*(C'\fR.
.Sp
Otherwise, the function returns a newly created \f(CW\*(C`NUL\*(C'\fR\-terminated string
containing the non\-UTF8 equivalent of the convertible first portion of
\&\f(CW"s"\fR.  \f(CW*lenp\fR is set to its length, not including the terminating \f(CW\*(C`NUL\*(C'\fR.
If the entire input string was converted, \f(CW*is_utf8p\fR is set to a \s-1FALSE\s0 value,
and \f(CW*first_non_downgradable\fR is set to \f(CW\*(C`NULL\*(C'\fR.
.Sp
Otherwise, \f(CW*first_non_downgradable\fR is set to point to the first byte of the
first character in the original string that wasn't converted.  \f(CW*is_utf8p\fR is
unchanged.  Note that the new string may have length 0.
.Sp
Another way to look at it is, if \f(CW*first_non_downgradable\fR is non\-\f(CW\*(C`NULL\*(C'\fR and
\&\f(CW*is_utf8p\fR is \s-1TRUE,\s0 this function starts at the beginning of \f(CW"s"\fR and
converts as many characters in it as possible stopping at the first one it
finds that can't be converted to non\-UTF\-8.  \f(CW*first_non_downgradable\fR is
set to point to that.  The function returns the portion that could be converted
in a newly created \f(CW\*(C`NUL\*(C'\fR\-terminated string, and \f(CW*lenp\fR is set to its length,
not including the terminating \f(CW\*(C`NUL\*(C'\fR.  If the very first character in the
original could not be converted, \f(CW*lenp\fR will be 0, and the new string will
contain just a single \f(CW\*(C`NUL\*(C'\fR.  If the entire input string was converted,
\&\f(CW*is_utf8p\fR is set to \s-1FALSE\s0 and \f(CW*first_non_downgradable\fR is set to \f(CW\*(C`NULL\*(C'\fR.
.Sp
Upon successful return, the number of variants in the converted portion of the
string can be computed by having saved the value of \f(CW*lenp\fR before the call,
and subtracting the after-call value of \f(CW*lenp\fR from it.
.RS 4
.Sp
.Vb 3
\& U8*  bytes_from_utf8_loc(const U8 *s, STRLEN *lenp,
\&                          bool *is_utf8p,
\&                          const U8 ** first_unconverted)
.Ve
.RE
.RS 4
.RE
.ie n .IP """find_uninit_var""" 4
.el .IP "\f(CWfind_uninit_var\fR" 4
.IX Xref "find_uninit_var"
.IX Item "find_uninit_var"
\&\s-1NOTE:\s0 \f(CW\*(C`find_uninit_var\*(C'\fR is \fBexperimental\fR and may change or be
removed without notice.
.Sp
Find the name of the undefined variable (if any) that caused the operator
to issue a \*(L"Use of uninitialized value\*(R" warning.
If match is true, only return a name if its value matches \f(CW\*(C`uninit_sv\*(C'\fR.
So roughly speaking, if a unary operator (such as \f(CW\*(C`OP_COS\*(C'\fR) generates a
warning, then following the direct child of the op may yield an
\&\f(CW\*(C`OP_PADSV\*(C'\fR or \f(CW\*(C`OP_GV\*(C'\fR that gives the name of the undefined variable.  On the
other hand, with \f(CW\*(C`OP_ADD\*(C'\fR there are two branches to follow, so we only print
the variable name if we get an exact match.
\&\f(CW\*(C`desc_p\*(C'\fR points to a string pointer holding the description of the op.
This may be updated if needed.
.Sp
The name is returned as a mortal \s-1SV.\s0
.Sp
Assumes that \f(CW\*(C`PL_op\*(C'\fR is the \s-1OP\s0 that originally triggered the error, and that
\&\f(CW\*(C`PL_comppad\*(C'\fR/\f(CW\*(C`PL_curpad\*(C'\fR points to the currently executing pad.
.RS 4
.Sp
.Vb 3
\& SV*  find_uninit_var(const OP *const obase,
\&                      const SV *const uninit_sv, bool match,
\&                      const char **desc_p)
.Ve
.RE
.RS 4
.RE
.ie n .IP """isSCRIPT_RUN""" 4
.el .IP "\f(CWisSCRIPT_RUN\fR" 4
.IX Xref "isSCRIPT_RUN"
.IX Item "isSCRIPT_RUN"
Returns a bool as to whether or not the sequence of bytes from \f(CW\*(C`s\*(C'\fR up to but
not including \f(CW\*(C`send\*(C'\fR form a \*(L"script run\*(R".  \f(CW\*(C`utf8_target\*(C'\fR is \s-1TRUE\s0 iff the
sequence starting at \f(CW\*(C`s\*(C'\fR is to be treated as \s-1UTF\-8.\s0  To be precise, except for
two degenerate cases given below, this function returns \s-1TRUE\s0 iff all code
points in it come from any combination of three \*(L"scripts\*(R" given by the Unicode
\&\*(L"Script Extensions\*(R" property: Common, Inherited, and possibly one other.
Additionally all decimal digits must come from the same consecutive sequence of
10.
.Sp
For example, if all the characters in the sequence are Greek, or Common, or
Inherited, this function will return \s-1TRUE,\s0 provided any decimal digits in it
are from the same block of digits in Common.  (These are the \s-1ASCII\s0 digits
\&\*(L"0\*(R"..\*(L"9\*(R" and additionally a block for full width forms of these, and several
others used in mathematical notation.)   For scripts (unlike Greek) that have
their own digits defined this will accept either digits from that set or from
one of the Common digit sets, but not a combination of the two.  Some scripts,
such as Arabic, have more than one set of digits.  All digits must come from
the same set for this function to return \s-1TRUE.\s0
.Sp
\&\f(CW*ret_script\fR, if \f(CW\*(C`ret_script\*(C'\fR is not \s-1NULL,\s0 will on return of \s-1TRUE\s0
contain the script found, using the \f(CW\*(C`SCX_enum\*(C'\fR typedef.  Its value will be
\&\f(CW\*(C`SCX_INVALID\*(C'\fR if the function returns \s-1FALSE.\s0
.Sp
If the sequence is empty, \s-1TRUE\s0 is returned, but \f(CW*ret_script\fR (if asked for)
will be \f(CW\*(C`SCX_INVALID\*(C'\fR.
.Sp
If the sequence contains a single code point which is unassigned to a character
in the version of Unicode being used, the function will return \s-1TRUE,\s0 and the
script will be \f(CW\*(C`SCX_Unknown\*(C'\fR.  Any other combination of unassigned code points
in the input sequence will result in the function treating the input as not
being a script run.
.Sp
The returned script will be \f(CW\*(C`SCX_Inherited\*(C'\fR iff all the code points in it are
from the Inherited script.
.Sp
Otherwise, the returned script will be \f(CW\*(C`SCX_Common\*(C'\fR iff all the code points in
it are from the Inherited or Common scripts.
.RS 4
.Sp
.Vb 2
\& bool  isSCRIPT_RUN(const U8 *s, const U8 *send,
\&                    const bool utf8_target)
.Ve
.RE
.RS 4
.RE
.ie n .IP """is_utf8_non_invariant_string""" 4
.el .IP "\f(CWis_utf8_non_invariant_string\fR" 4
.IX Xref "is_utf8_non_invariant_string"
.IX Item "is_utf8_non_invariant_string"
Returns \s-1TRUE\s0 if \*(L"is_utf8_invariant_string\*(R" in perlapi returns \s-1FALSE\s0 for the first
\&\f(CW\*(C`len\*(C'\fR bytes of the string \f(CW\*(C`s\*(C'\fR, but they are, nonetheless, legal Perl-extended
\&\s-1UTF\-8\s0; otherwise returns \s-1FALSE.\s0
.Sp
A \s-1TRUE\s0 return means that at least one code point represented by the sequence
either is a wide character not representable as a single byte, or the
representation differs depending on whether the sequence is encoded in \s-1UTF\-8\s0 or
not.
.Sp
See also
\&\f(CW\*(C`"is_utf8_invariant_string" in perlapi\*(C'\fR,
\&\f(CW\*(C`"is_utf8_string" in perlapi\*(C'\fR
.RS 4
.Sp
.Vb 1
\& bool  is_utf8_non_invariant_string(const U8* const s, STRLEN len)
.Ve
.RE
.RS 4
.RE
.ie n .IP """report_uninit""" 4
.el .IP "\f(CWreport_uninit\fR" 4
.IX Xref "report_uninit"
.IX Item "report_uninit"
Print appropriate \*(L"Use of uninitialized variable\*(R" warning.
.RS 4
.Sp
.Vb 1
\& void  report_uninit(const SV *uninit_sv)
.Ve
.RE
.RS 4
.RE
.ie n .IP """utf8n_to_uvuni""" 4
.el .IP "\f(CWutf8n_to_uvuni\fR" 4
.IX Xref "utf8n_to_uvuni"
.IX Item "utf8n_to_uvuni"
\&\f(CW\*(C`\f(CBDEPRECATED!\f(CW\*(C'\fR  It is planned to remove \f(CW\*(C`utf8n_to_uvuni\*(C'\fR from a
future release of Perl.  Do not use it for new code; remove it from
existing code.
.Sp
Instead use \*(L"utf8_to_uvchr_buf\*(R" in perlapi, or rarely, \*(L"utf8n_to_uvchr\*(R" in perlapi.
.Sp
This function was useful for code that wanted to handle both \s-1EBCDIC\s0 and
\&\s-1ASCII\s0 platforms with Unicode properties, but starting in Perl v5.20, the
distinctions between the platforms have mostly been made invisible to most
code, so this function is quite unlikely to be what you want.  If you do need
this precise functionality, use instead
\&\f(CW\*(C`NATIVE_TO_UNI(utf8_to_uvchr_buf(...))\*(C'\fR
or \f(CW\*(C`NATIVE_TO_UNI(utf8n_to_uvchr(...))\*(C'\fR.
.RS 4
.Sp
.Vb 2
\& UV  utf8n_to_uvuni(const U8 *s, STRLEN curlen, STRLEN *retlen,
\&                    U32 flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """utf8_to_uvuni""" 4
.el .IP "\f(CWutf8_to_uvuni\fR" 4
.IX Xref "utf8_to_uvuni"
.IX Item "utf8_to_uvuni"
\&\f(CW\*(C`\f(CBDEPRECATED!\f(CW\*(C'\fR  It is planned to remove \f(CW\*(C`utf8_to_uvuni\*(C'\fR from a
future release of Perl.  Do not use it for new code; remove it from
existing code.
.Sp
Returns the Unicode code point of the first character in the string \f(CW\*(C`s\*(C'\fR
which is assumed to be in \s-1UTF\-8\s0 encoding; \f(CW\*(C`retlen\*(C'\fR will be set to the
length, in bytes, of that character.
.Sp
Some, but not all, \s-1UTF\-8\s0 malformations are detected, and in fact, some
malformed input could cause reading beyond the end of the input buffer, which
is one reason why this function is deprecated.  The other is that only in
extremely limited circumstances should the Unicode versus native code point be
of any interest to you.  See \*(L"utf8_to_uvuni_buf\*(R" for alternatives.
.Sp
If \f(CW\*(C`s\*(C'\fR points to one of the detected malformations, and \s-1UTF8\s0 warnings are
enabled, zero is returned and \f(CW*retlen\fR is set (if \f(CW\*(C`retlen\*(C'\fR doesn't point to
\&\s-1NULL\s0) to \-1.  If those warnings are off, the computed value if well-defined (or
the Unicode \s-1REPLACEMENT CHARACTER,\s0 if not) is silently returned, and \f(CW*retlen\fR
is set (if \f(CW\*(C`retlen\*(C'\fR isn't \s-1NULL\s0) so that (\f(CW\*(C`s\*(C'\fR\ +\ \f(CW*retlen\fR) is the
next possible position in \f(CW\*(C`s\*(C'\fR that could begin a non-malformed character.
See \*(L"utf8n_to_uvchr\*(R" in perlapi for details on when the \s-1REPLACEMENT CHARACTER\s0 is returned.
.RS 4
.Sp
.Vb 1
\& UV  utf8_to_uvuni(const U8 *s, STRLEN *retlen)
.Ve
.RE
.RS 4
.RE
.ie n .IP """utf8_to_uvuni_buf""" 4
.el .IP "\f(CWutf8_to_uvuni_buf\fR" 4
.IX Xref "utf8_to_uvuni_buf"
.IX Item "utf8_to_uvuni_buf"
\&\f(CW\*(C`\f(CBDEPRECATED!\f(CW\*(C'\fR  It is planned to remove \f(CW\*(C`utf8_to_uvuni_buf\*(C'\fR from a
future release of Perl.  Do not use it for new code; remove it from
existing code.
.Sp
Only in very rare circumstances should code need to be dealing in Unicode
(as opposed to native) code points.  In those few cases, use
\&\f(CW\*(C`NATIVE_TO_UNI(utf8_to_uvchr_buf(...))\*(C'\fR instead.
If you are not absolutely sure this is one of those cases, then assume it isn't
and use plain \f(CW\*(C`utf8_to_uvchr_buf\*(C'\fR instead.
.Sp
Returns the Unicode (not-native) code point of the first character in the
string \f(CW\*(C`s\*(C'\fR which
is assumed to be in \s-1UTF\-8\s0 encoding; \f(CW\*(C`send\*(C'\fR points to 1 beyond the end of \f(CW\*(C`s\*(C'\fR.
\&\f(CW\*(C`retlen\*(C'\fR will be set to the length, in bytes, of that character.
.Sp
If \f(CW\*(C`s\*(C'\fR does not point to a well-formed \s-1UTF\-8\s0 character and \s-1UTF8\s0 warnings are
enabled, zero is returned and \f(CW*retlen\fR is set (if \f(CW\*(C`retlen\*(C'\fR isn't
\&\s-1NULL\s0) to \-1.  If those warnings are off, the computed value if well-defined (or
the Unicode \s-1REPLACEMENT CHARACTER,\s0 if not) is silently returned, and \f(CW*retlen\fR
is set (if \f(CW\*(C`retlen\*(C'\fR isn't \s-1NULL\s0) so that (\f(CW\*(C`s\*(C'\fR\ +\ \f(CW*retlen\fR) is the
next possible position in \f(CW\*(C`s\*(C'\fR that could begin a non-malformed character.
See \*(L"utf8n_to_uvchr\*(R" in perlapi for details on when the \s-1REPLACEMENT CHARACTER\s0 is
returned.
.RS 4
.Sp
.Vb 1
\& UV  utf8_to_uvuni_buf(const U8 *s, const U8 *send, STRLEN *retlen)
.Ve
.RE
.RS 4
.RE
.ie n .IP """uvoffuni_to_utf8_flags""" 4
.el .IP "\f(CWuvoffuni_to_utf8_flags\fR" 4
.IX Xref "uvoffuni_to_utf8_flags"
.IX Item "uvoffuni_to_utf8_flags"
\&\s-1THIS FUNCTION SHOULD BE USED IN ONLY VERY SPECIALIZED CIRCUMSTANCES.\s0
Instead, \fBAlmost all code should use \*(L"uvchr_to_utf8\*(R" in perlapi or
\&\*(L"uvchr_to_utf8_flags\*(R" in perlapi\fR.
.Sp
This function is like them, but the input is a strict Unicode
(as opposed to native) code point.  Only in very rare circumstances should code
not be using the native code point.
.Sp
For details, see the description for \*(L"uvchr_to_utf8_flags\*(R" in perlapi.
.RS 4
.Sp
.Vb 1
\& U8*  uvoffuni_to_utf8_flags(U8 *d, UV uv, const UV flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """uvuni_to_utf8_flags""" 4
.el .IP "\f(CWuvuni_to_utf8_flags\fR" 4
.IX Xref "uvuni_to_utf8_flags"
.IX Item "uvuni_to_utf8_flags"
\&\f(CW\*(C`\f(CBDEPRECATED!\f(CW\*(C'\fR  It is planned to remove \f(CW\*(C`uvuni_to_utf8_flags\*(C'\fR from a
future release of Perl.  Do not use it for new code; remove it from
existing code.
.Sp
Instead you almost certainly want to use \*(L"uvchr_to_utf8\*(R" in perlapi or
\&\*(L"uvchr_to_utf8_flags\*(R" in perlapi.
.Sp
This function is a deprecated synonym for \*(L"uvoffuni_to_utf8_flags\*(R",
which itself, while not deprecated, should be used only in isolated
circumstances.  These functions were useful for code that wanted to handle
both \s-1EBCDIC\s0 and \s-1ASCII\s0 platforms with Unicode properties, but starting in Perl
v5.20, the distinctions between the platforms have mostly been made invisible
to most code, so this function is quite unlikely to be what you want.
.RS 4
.Sp
.Vb 1
\& U8*  uvuni_to_utf8_flags(U8 *d, UV uv, UV flags)
.Ve
.RE
.RS 4
.RE
.ie n .IP """valid_utf8_to_uvchr""" 4
.el .IP "\f(CWvalid_utf8_to_uvchr\fR" 4
.IX Xref "valid_utf8_to_uvchr"
.IX Item "valid_utf8_to_uvchr"
Like \f(CW\*(C`"utf8_to_uvchr_buf" in perlapi\*(C'\fR, but should only be called when it is
known that the next character in the input \s-1UTF\-8\s0 string \f(CW\*(C`s\*(C'\fR is well-formed
(\fIe.g.\fR, it passes \f(CW\*(C`"isUTF8_CHAR" in perlapi\*(C'\fR.  Surrogates, non-character code
points, and non-Unicode code points are allowed.
.RS 4
.Sp
.Vb 1
\& UV  valid_utf8_to_uvchr(const U8 *s, STRLEN *retlen)
.Ve
.RE
.RS 4
.RE
.ie n .IP """variant_under_utf8_count""" 4
.el .IP "\f(CWvariant_under_utf8_count\fR" 4
.IX Xref "variant_under_utf8_count"
.IX Item "variant_under_utf8_count"
This function looks at the sequence of bytes between \f(CW\*(C`s\*(C'\fR and \f(CW\*(C`e\*(C'\fR, which are
assumed to be encoded in ASCII/Latin1, and returns how many of them would
change should the string be translated into \s-1UTF\-8.\s0  Due to the nature of \s-1UTF\-8,\s0
each of these would occupy two bytes instead of the single one in the input
string.  Thus, this function returns the precise number of bytes the string
would expand by when translated to \s-1UTF\-8.\s0
.Sp
Unlike most of the other functions that have \f(CW\*(C`utf8\*(C'\fR in their name, the input
to this function is \s-1NOT\s0 a UTF\-8\-encoded string.  The function name is slightly
\&\fIodd\fR to emphasize this.
.Sp
This function is internal to Perl because khw thinks that any \s-1XS\s0 code that
would want this is probably operating too close to the internals.  Presenting a
valid use case could change that.
.Sp
See also
\&\f(CW\*(C`"is_utf8_invariant_string" in perlapi\*(C'\fR
and
\&\f(CW\*(C`"is_utf8_invariant_string_loc" in perlapi\*(C'\fR,
.RS 4
.Sp
.Vb 2
\& Size_t  variant_under_utf8_count(const U8* const s,
\&                                  const U8* const e)
.Ve
.RE
.RS 4
.RE
.SH "Utility Functions"
.IX Header "Utility Functions"
There are only public \s-1API\s0 items currently in Utility Functions
.SH "Versioning"
.IX Header "Versioning"
There are only public \s-1API\s0 items currently in Versioning
.SH "Warning and Dieing"
.IX Header "Warning and Dieing"
.ie n .IP """PL_dowarn""" 4
.el .IP "\f(CWPL_dowarn\fR" 4
.IX Xref "PL_dowarn"
.IX Item "PL_dowarn"
The C variable that roughly corresponds to Perl's \f(CW$^W\fR warning variable.
However, \f(CW$^W\fR is treated as a boolean, whereas \f(CW\*(C`PL_dowarn\*(C'\fR is a
collection of flag bits.
.Sp
On threaded perls, each thread has an independent copy of this variable;
each initialized at creation time with the current value of the creating
thread's copy.
.RS 4
.Sp
.Vb 1
\& U8  PL_dowarn
.Ve
.RE
.RS 4
.RE
.SH "XS"
.IX Header "XS"
There are only public \s-1API\s0 items currently in \s-1XS\s0
.SH "Undocumented elements"
.IX Header "Undocumented elements"
The following functions are currently undocumented.  If you use
one of them, you may wish to consider creating and submitting
documentation for it.
.PP

.IX Xref "abort_execution add_cp_to_invlist _add_range_to_invlist alloc_LOGOP allocmy amagic_cmp amagic_cmp_desc amagic_cmp_locale amagic_cmp_locale_desc amagic_is_enabled amagic_i_ncmp amagic_i_ncmp_desc amagic_ncmp amagic_ncmp_desc append_utf8_from_native_byte apply ASCII_TO_NEED av_arylen_p av_extend_guts av_iter_p av_nonelem av_reify bind_match boot_core_mro boot_core_PerlIO boot_core_UNIVERSAL _byte_dump_string cando cast_i32 cast_iv cast_ulong cast_uv check_utf8_print ck_anoncode ck_backtick ck_bitop ck_cmp ck_concat ck_defined ck_delete ck_each ck_entersub_args_core ck_eof ck_eval ck_exec ck_exists ck_ftst ck_fun ck_glob ck_grep ck_index ck_isa ck_join ck_length ck_lfun ck_listiob ck_match ck_method ck_null ck_open ck_prototype ck_readline ck_refassign ck_repeat ck_require ck_return ck_rfun ck_rvconst ck_sassign ck_select ck_shift ck_smartmatch ck_sort ck_spair ck_split ck_stringify ck_subr ck_substr ck_svconst ck_tell ck_trunc ck_trycatch ckwarn ckwarn_d closest_cop cmpchain_extend cmpchain_finish cmpchain_start cmp_desc cmp_locale_desc cntrl_to_mnemonic coresub_op create_eval_scope croak_caller croak_memory_wrap croak_no_mem croak_popstack csighandler csighandler1 csighandler3 current_re_engine custom_op_get_field cv_ckproto_len_flags cv_clone_into cv_const_sv_or_av cvgv_from_hek cvgv_set cvstash_set cv_undef_flags cx_dump cx_dup cxinc cx_popblock cx_popeval cx_popformat cx_popgiven cx_poploop cx_popsub cx_popsub_args cx_popsub_common cx_popwhen cx_pushblock cx_pusheval cx_pushformat cx_pushgiven cx_pushloop_for cx_pushloop_plain cx_pushsub cx_pushtry cx_pushwhen cx_topblock deb_stack_all defelem_target delete_eval_scope despatch_signals die_unwind do_aexec do_aexec5 do_eof does_utf8_overflow do_exec do_exec3 dofile do_gvgv_dump do_gv_dump do_hv_dump doing_taint do_ipcctl do_ipcget do_magic_dump do_msgrcv do_msgsnd do_ncmp do_open6 do_open_raw do_op_dump do_pmop_dump do_print do_readline do_seek do_semop do_shmio do_sv_dump do_sysseek do_tell do_trans do_uniprop_match do_vecget do_vecset do_vop drand48_init_r drand48_r dtrace_probe_call dtrace_probe_load dtrace_probe_op dtrace_probe_phase dump_all_perl dump_indent dump_packsubs_perl dump_sub_perl dump_sv_child dump_vindent dup_warnings emulate_cop_io find_first_differing_byte_pos find_lexical_cv find_runcv_where find_script foldEQ_latin1 foldEQ_latin1_s2_folded foldEQ_utf8_flags _force_out_malformed_utf8_message form_alien_digit_msg form_cp_too_large_msg free_tied_hv_pool free_tmps get_and_check_backslash_N_name get_db_sub get_debug_opts get_deprecated_property_msg getenv_len get_hash_seed get_invlist_iter_addr get_invlist_offset_addr get_invlist_previous_index_addr get_no_modify get_opargs get_prop_definition get_prop_values get_regclass_nonbitmap_data get_regex_charset_name get_re_arg get_re_gclass_nonbitmap_data gimme_V grok_bin_oct_hex grok_bslash_c grok_bslash_o grok_bslash_x gv_check gv_fetchmeth_internal gv_override gv_setref gv_stashpvn_internal hfree_next_entry hv_backreferences_p hv_common hv_common_key_len hv_kill_backrefs hv_placeholders_p hv_pushkv hv_undef_flags init_argv_symbols init_constants init_dbargs init_debugger init_i18nl10n init_i18nl14n init_named_cv init_uniprops _inverse_folds invert invlist_array invlist_clear invlist_clone invlist_contents _invlistEQ invlist_extend invlist_highest invlist_is_iterating invlist_iterfinish invlist_iterinit invlist_iternext invlist_lowest invlist_max invlist_previous_index invlist_set_len invlist_set_previous_index invlist_trim _invlist_array_init _invlist_contains_cp _invlist_dump _invlist_intersection _invlist_intersection_maybe_complement_2nd _invlist_invert _invlist_len _invlist_search _invlist_subtract _invlist_union _invlist_union_maybe_complement_2nd invmap_dump io_close isFF_OVERLONG is_grapheme is_invlist is_utf8_char_helper is_utf8_common is_utf8_overlong_given_start_byte_ok _is_cur_LC_category_utf8 _is_in_locale_category _is_uni_FOO _is_uni_perl_idcont _is_uni_perl_idstart _is_utf8_FOO _is_utf8_perl_idcont _is_utf8_perl_idstart jmaybe keyword keyword_plugin_standard list load_charnames localize lossless_NV_to_IV magic_cleararylen_p magic_clearenv magic_clearisa magic_clearpack magic_clearsig magic_clear_all_env magic_copycallchecker magic_existspack magic_freearylen_p magic_freecollxfrm magic_freemglob magic_freeovrld magic_freeutf8 magic_get magic_getarylen magic_getdebugvar magic_getdefelem magic_getnkeys magic_getpack magic_getpos magic_getsig magic_getsubstr magic_gettaint magic_getuvar magic_getvec magic_killbackrefs magic_nextpack magic_regdata_cnt magic_regdatum_get magic_regdatum_set magic_scalarpack magic_set magic_setarylen magic_setcollxfrm magic_setdbline magic_setdebugvar magic_setdefelem magic_setenv magic_setisa magic_setlvref magic_setmglob magic_setnkeys magic_setnonelem magic_setpack magic_setpos magic_setregexp magic_setsig magic_setsubstr magic_settaint magic_setutf8 magic_setuvar magic_setvec magic_set_all_env magic_sizepack magic_wipepack malloced_size malloc_good_size mem_collxfrm mem_log_alloc mem_log_free mem_log_realloc _mem_collxfrm mg_find_mglob mode_from_discipline more_bodies moreswitches mortal_getenv mro_get_private_data mro_meta_dup mro_meta_init multiconcat_stringify multideref_stringify my_atof2 my_atof3 my_attrs my_clearenv my_lstat my_lstat_flags my_memrchr my_mkostemp my_mkostemp_cloexec my_mkstemp my_mkstemp_cloexec my_stat my_stat_flags my_strerror my_unexec NATIVE_TO_NEED newGP newMETHOP_internal newSTUB newSVavdefelem new_warnings_bitfield newXS_deffile _new_invlist _new_invlist_C_array nextargv no_bareword_filehandle noperl_die notify_parser_that_changed_to_utf8 oopsAV oopsHV op_clear op_integerize op_lvalue_flags opmethod_stash op_refcnt_dec op_refcnt_inc op_relocate_sv opslab_force_free opslab_free opslab_free_nopad op_std_init op_unscope package package_version pad_add_weakref padlist_store padname_free PadnameIN_SCOPE padnamelist_free parser_free parser_free_nexttoke_ops parse_unicode_opts path_is_searchable peep PerlIO_restore_errno PerlIO_save_errno PerlLIO_dup2_cloexec PerlLIO_dup_cloexec PerlLIO_open3_cloexec PerlLIO_open_cloexec PerlProc_pipe_cloexec PerlSock_accept_cloexec PerlSock_socketpair_cloexec PerlSock_socket_cloexec perly_sighandler pmruntime POPMARK populate_isa pregfree2 ptr_hash qerror ReANY reentrant_free reentrant_init reentrant_retry reentrant_size re_exec_indentf ref regcurly regdupe_internal regexec_flags regfree_internal reginitcolors reg_named_buff reg_named_buff_all reg_named_buff_exists reg_named_buff_fetch reg_named_buff_firstkey reg_named_buff_iter reg_named_buff_nextkey reg_named_buff_scalar regnext reg_numbered_buff_fetch reg_numbered_buff_length reg_numbered_buff_store regprop reg_qr_package reg_skipcomment reg_temp_copy re_indentf re_intuit_start re_intuit_string re_op_compile report_evil_fh report_redefined_cv report_wrongway_fh re_printf rpeep rsignal_restore rsignal_save runops_debug runops_standard rxres_save same_dirent save_bool save_clearsv save_delete save_destructor save_destructor_x save_freeop save_freepv save_freesv save_I16 save_I32 save_I8 save_int save_iv save_long save_mortalizesv save_pptr save_re_context save_sptr save_strlen save_to_buffer sawparens scalar scalarvoid scan_num scan_str scan_word set_caret_X setfd_cloexec setfd_cloexec_for_nonsysfd setfd_cloexec_or_inhexec_by_sysfdness setfd_inhexec setfd_inhexec_for_sysfd set_numeric_standard set_numeric_underlying set_padlist _setup_canned_invlist should_warn_nl should_we_output_Debug_r sighandler sighandler1 sighandler3 skipspace_flags Slab_Alloc Slab_Free Slab_to_ro Slab_to_rw softref2xv sortsv_flags_impl stack_grow str_to_version sub_crush_depth sv_2iv sv_2pv sv_2uv sv_add_backref sv_buf_to_ro sv_del_backref sv_free2 sv_i_ncmp sv_i_ncmp_desc sv_kill_backrefs sv_len_utf8_nomg sv_magicext_mglob sv_ncmp sv_ncmp_desc sv_only_taint_gmagic sv_or_pv_pos_u2b sv_resetpvn sv_sethek sv_setsv_cow SvTRUE_common sv_unglob sys_init sys_init3 sys_term tied_method tmps_grow_p TOPMARK to_uni_fold to_uni_lower to_uni_title to_uni_upper _to_fold_latin1 _to_uni_fold_flags _to_upper_title_latin1 _to_utf8_fold_flags _to_utf8_lower_flags _to_utf8_title_flags _to_utf8_upper_flags translate_substr_offsets try_amagic_bin try_amagic_un uiv_2buf unlnk unshare_hek utf16_to_utf8 utf16_to_utf8_reversed _utf8n_to_uvchr_msgs_helper utf8_to_uvchr_buf_helper utilize uvoffuni_to_utf8_flags_msgs uvuni_to_utf8 valid_utf8_to_uvuni variant_byte_number varname vivify_defelem vivify_ref wait4pid _warn_problematic_locale was_lvalue_sub watch win32_croak_not_implemented write_to_stderr xs_boot_epilog xs_handshake yyerror yyerror_pv yyerror_pvn yylex yyparse yyquit yyunlex"
.Sp
.Vb 10
\& abort_execution
\& add_cp_to_invlist
\& _add_range_to_invlist
\& alloc_LOGOP
\& allocmy
\& amagic_cmp
\& amagic_cmp_desc
\& amagic_cmp_locale
\& amagic_cmp_locale_desc
\& amagic_is_enabled
\& amagic_i_ncmp
\& amagic_i_ncmp_desc
\& amagic_ncmp
\& amagic_ncmp_desc
\& append_utf8_from_native_byte
\& apply
\& ASCII_TO_NEED
\& av_arylen_p
\& av_extend_guts
\& av_iter_p
\& av_nonelem
\& av_reify
\& bind_match
\& boot_core_mro
\& boot_core_PerlIO
\& boot_core_UNIVERSAL
\& _byte_dump_string
\& cando
\& cast_i32
\& cast_iv
\& cast_ulong
\& cast_uv
\& check_utf8_print
\& ck_anoncode
\& ck_backtick
\& ck_bitop
\& ck_cmp
\& ck_concat
\& ck_defined
\& ck_delete
\& ck_each
\& ck_entersub_args_core
\& ck_eof
\& ck_eval
\& ck_exec
\& ck_exists
\& ck_ftst
\& ck_fun
\& ck_glob
\& ck_grep
\& ck_index
\& ck_isa
\& ck_join
\& ck_length
\& ck_lfun
\& ck_listiob
\& ck_match
\& ck_method
\& ck_null
\& ck_open
\& ck_prototype
\& ck_readline
\& ck_refassign
\& ck_repeat
\& ck_require
\& ck_return
\& ck_rfun
\& ck_rvconst
\& ck_sassign
\& ck_select
\& ck_shift
\& ck_smartmatch
\& ck_sort
\& ck_spair
\& ck_split
\& ck_stringify
\& ck_subr
\& ck_substr
\& ck_svconst
\& ck_tell
\& ck_trunc
\& ck_trycatch
\& ckwarn
\& ckwarn_d
\& closest_cop
\& cmpchain_extend
\& cmpchain_finish
\& cmpchain_start
\& cmp_desc
\& cmp_locale_desc
\& cntrl_to_mnemonic
\& coresub_op
\& create_eval_scope
\& croak_caller
\& croak_memory_wrap
\& croak_no_mem
\& croak_popstack
\& csighandler
\& csighandler1
\& csighandler3
\& current_re_engine
\& custom_op_get_field
\& cv_ckproto_len_flags
\& cv_clone_into
\& cv_const_sv_or_av
\& cvgv_from_hek
\& cvgv_set
\& cvstash_set
\& cv_undef_flags
\& cx_dump
\& cx_dup
\& cxinc
\& cx_popblock
\& cx_popeval
\& cx_popformat
\& cx_popgiven
\& cx_poploop
\& cx_popsub
\& cx_popsub_args
\& cx_popsub_common
\& cx_popwhen
\& cx_pushblock
\& cx_pusheval
\& cx_pushformat
\& cx_pushgiven
\& cx_pushloop_for
\& cx_pushloop_plain
\& cx_pushsub
\& cx_pushtry
\& cx_pushwhen
\& cx_topblock
\& deb_stack_all
\& defelem_target
\& delete_eval_scope
\& despatch_signals
\& die_unwind
\& do_aexec
\& do_aexec5
\& do_eof
\& does_utf8_overflow
\& do_exec
\& do_exec3
\& dofile
\& do_gvgv_dump
\& do_gv_dump
\& do_hv_dump
\& doing_taint
\& do_ipcctl
\& do_ipcget
\& do_magic_dump
\& do_msgrcv
\& do_msgsnd
\& do_ncmp
\& do_open6
\& do_open_raw
\& do_op_dump
\& do_pmop_dump
\& do_print
\& do_readline
\& do_seek
\& do_semop
\& do_shmio
\& do_sv_dump
\& do_sysseek
\& do_tell
\& do_trans
\& do_uniprop_match
\& do_vecget
\& do_vecset
\& do_vop
\& drand48_init_r
\& drand48_r
\& dtrace_probe_call
\& dtrace_probe_load
\& dtrace_probe_op
\& dtrace_probe_phase
\& dump_all_perl
\& dump_indent
\& dump_packsubs_perl
\& dump_sub_perl
\& dump_sv_child
\& dump_vindent
\& dup_warnings
\& emulate_cop_io
\& find_first_differing_byte_pos
\& find_lexical_cv
\& find_runcv_where
\& find_script
\& foldEQ_latin1
\& foldEQ_latin1_s2_folded
\& foldEQ_utf8_flags
\& _force_out_malformed_utf8_message
\& form_alien_digit_msg
\& form_cp_too_large_msg
\& free_tied_hv_pool
\& free_tmps
\& get_and_check_backslash_N_name
\& get_db_sub
\& get_debug_opts
\& get_deprecated_property_msg
\& getenv_len
\& get_hash_seed
\& get_invlist_iter_addr
\& get_invlist_offset_addr
\& get_invlist_previous_index_addr
\& get_no_modify
\& get_opargs
\& get_prop_definition
\& get_prop_values
\& get_regclass_nonbitmap_data
\& get_regex_charset_name
\& get_re_arg
\& get_re_gclass_nonbitmap_data
\& gimme_V
\& grok_bin_oct_hex
\& grok_bslash_c
\& grok_bslash_o
\& grok_bslash_x
\& gv_check
\& gv_fetchmeth_internal
\& gv_override
\& gv_setref
\& gv_stashpvn_internal
\& hfree_next_entry
\& hv_backreferences_p
\& hv_common
\& hv_common_key_len
\& hv_kill_backrefs
\& hv_placeholders_p
\& hv_pushkv
\& hv_undef_flags
\& init_argv_symbols
\& init_constants
\& init_dbargs
\& init_debugger
\& init_i18nl10n
\& init_i18nl14n
\& init_named_cv
\& init_uniprops
\& _inverse_folds
\& invert
\& invlist_array
\& invlist_clear
\& invlist_clone
\& invlist_contents
\& _invlistEQ
\& invlist_extend
\& invlist_highest
\& invlist_is_iterating
\& invlist_iterfinish
\& invlist_iterinit
\& invlist_iternext
\& invlist_lowest
\& invlist_max
\& invlist_previous_index
\& invlist_set_len
\& invlist_set_previous_index
\& invlist_trim
\& _invlist_array_init
\& _invlist_contains_cp
\& _invlist_dump
\& _invlist_intersection
\& _invlist_intersection_maybe_complement_2nd
\& _invlist_invert
\& _invlist_len
\& _invlist_search
\& _invlist_subtract
\& _invlist_union
\& _invlist_union_maybe_complement_2nd
\& invmap_dump
\& io_close
\& isFF_OVERLONG
\& is_grapheme
\& is_invlist
\& is_utf8_char_helper
\& is_utf8_common
\& is_utf8_overlong_given_start_byte_ok
\& _is_cur_LC_category_utf8
\& _is_in_locale_category
\& _is_uni_FOO
\& _is_uni_perl_idcont
\& _is_uni_perl_idstart
\& _is_utf8_FOO
\& _is_utf8_perl_idcont
\& _is_utf8_perl_idstart
\& jmaybe
\& keyword
\& keyword_plugin_standard
\& list
\& load_charnames
\& localize
\& lossless_NV_to_IV
\& magic_cleararylen_p
\& magic_clearenv
\& magic_clearisa
\& magic_clearpack
\& magic_clearsig
\& magic_clear_all_env
\& magic_copycallchecker
\& magic_existspack
.Ve
.SH "AUTHORS"
.IX Header "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.
.SH "SEE ALSO"
.IX Header "SEE ALSO"
\&\fIconfig.h\fR, perlapi, perlapio, perlcall, perlclib, perlfilter, perlguts, perlinterp, perliol, perlmroapi, perlreguts, perlxs

${this.title}

Code Editor : perlintern.1