?????????? ????????? - ??????????????? - /home/agenciai/public_html/cd38d8/Storable-3.25-0.zip
???????
PK ��[oB��� � stacksizenu �[��� #!/usr/bin/perl # binary search maximum stack depth for arrays and hashes # and report it to stdout as code to set the limits use Config; use Cwd; use File::Spec; use strict; my $ptrsize = $Config{ptrsize}; my ($bad1, $bad2) = (65001, 25000); sub QUIET () { (defined $ENV{MAKEFLAGS} and $ENV{MAKEFLAGS} =~ /\b(s|silent|quiet)\b/ and !defined($ENV{TRAVIS})) || @ARGV && $ARGV[0] eq "-q" ? 1 : 0 } sub PARALLEL () { if (defined $ENV{MAKEFLAGS} and $ENV{MAKEFLAGS} =~ /\bj\s*(\d+)\b/ and $1 > 1) { return 1; } else { return 0; } } sub is_miniperl { return !defined &DynaLoader::boot_DynaLoader; } if (is_miniperl()) { die "Should not run using miniperl\n"; } my $prefix = ""; if ($^O eq "MSWin32") { # prevent Windows popping up a dialog each time we overflow # the stack require Win32API::File; Win32API::File->import(qw(SetErrorMode SEM_NOGPFAULTERRORBOX SEM_FAILCRITICALERRORS)); SetErrorMode(SEM_NOGPFAULTERRORBOX() | SEM_FAILCRITICALERRORS()); } # the ; here is to ensure system() passes this to the shell elsif (system("ulimit -c 0 ;") == 0) { # try to prevent core dumps $prefix = "ulimit -c 0 ; "; } my $PERL = $^X; if ($^O eq "MSWin32") { require Win32; my ($str, $major, $minor) = Win32::GetOSVersion(); if ($major < 6 || $major == 6 && $minor < 1) { print "# Using defaults for older Win32\n"; write_limits(500, 256); exit; } } my ($n, $good, $bad, $found) = (65000, 100, $bad1, undef); print "# probe for max. stack sizes...\n" unless QUIET; # -I. since we're run before pm_to_blib (which is going to copy the # file we create) and need to load our Storable.pm, not the already # installed Storable.pm my $mblib = ''; if (-d 'blib') { $mblib = '-Mblib -I.'; } elsif (-f "Configure") { $mblib = '-Ilib'; } sub cmd { my ($i, $try, $limit_name) = @_; die unless $i; my $code = "my \$t; \$Storable::$limit_name = -1; $try for 1..$i;dclone(\$t); print qq/ok\n/"; my $q = ($^O eq 'MSWin32') ? '"' : "'"; "$prefix $PERL $mblib -MStorable=dclone -e$q$code$q" } # try more sub good { my $i = shift; # this passed my $j = $i + abs(int(($bad - $i) / 2)); print "# Storable: determining recursion limit: $i passed, try more $j ...\n" unless QUIET; $good = $i; if ($j <= $i) { $found++; } return $j; } # try less sub bad { my $i = shift; # this failed my $j = $i - abs(int(($i - $good) / 2)); print "# Storable: determining recursion limit: $i too big, try less $j ...\n" unless QUIET; $bad = $i; if ($j >= $i) { $j = $good; $found++; } return $j; } sub array_cmd { my $depth = shift; return cmd($depth, '$t=[$t]', 'recursion_limit'); } # first check we can successfully run with a minimum level my $cmd = array_cmd(1); unless ((my $output = `$cmd`) =~ /\bok\b/) { die "Cannot run probe: '$output', aborting...\n"; } unless ($ENV{STORABLE_NOISY}) { # suppress Segmentation fault messages open STDERR, ">", File::Spec->devnull; } while (!$found) { my $cmd = array_cmd($n); #print "$cmd\n" unless $QUIET; if (`$cmd` =~ /\bok\b/) { $n = good($n); } else { $n = bad($n); } } print "# MAX_DEPTH = $n\n" unless QUIET; my $max_depth = $n; ($n, $good, $bad, $found) = (int($n/2), 50, $n, undef); # pack j only since 5.8 my $max = ($] > 5.007 and length(pack "j", 0) < 8) ? ($^O eq 'MSWin32' ? 3000 : 8000) : $max_depth; $n = $max if $n > $max; $bad = $max if $bad > $max; while (!$found) { my $cmd = cmd($n, '$t={1=>$t}', 'recursion_limit_hash'); #print "$cmd\n" unless $QUIET; if (`$cmd` =~ /\bok\b/) { $n = good($n); } else { $n = bad($n); } } if ($max_depth == $bad1-1 and $n == $bad2-1) { # more likely the shell. travis docker ubuntu, mingw e.g. print "# Apparently your system(SHELLSTRING) cannot catch stack overflows\n" unless QUIET; $max_depth = 512; $n = 256; print "MAX_DEPTH = $max_depth\n" unless QUIET; } print "# MAX_DEPTH_HASH = $n\n" unless QUIET; my $max_depth_hash = $n; # Previously this calculation was done in the macro, calculate it here # instead so a user setting of either variable more closely matches # the limits the use sees. # be fairly aggressive in trimming this, smoke testing showed # several apparently random failures here, eg. working in one # configuration, but not in a very similar configuration. $max_depth = int(0.6 * $max_depth); $max_depth_hash = int(0.6 * $max_depth_hash); my $stack_reserve = $^O eq "MSWin32" ? 32 : 16; if ($] ge "5.016" && !($^O eq "cygwin" && $ptrsize == 8)) { $max_depth -= $stack_reserve; $max_depth_hash -= $stack_reserve; } else { # within the exception we need another stack depth to recursively # cleanup the hash $max_depth = ($max_depth >> 1) - $stack_reserve; $max_depth_hash = ($max_depth_hash >> 1) - $stack_reserve * 2; } write_limits($max_depth, $max_depth_hash); sub write_limits { my ($max_depth, $max_depth_hash) = @_; print <<EOS; # bisected by stacksize \$Storable::recursion_limit = $max_depth unless defined \$Storable::recursion_limit; \$Storable::recursion_limit_hash = $max_depth_hash unless defined \$Storable::recursion_limit_hash; EOS } PK ��[ pm_to_blibnu �[��� PK ��[c7�� � Storable.pmnu �[��� # # Copyright (c) 1995-2001, Raphael Manfredi # Copyright (c) 2002-2014 by the Perl 5 Porters # Copyright (c) 2015-2016 cPanel Inc # Copyright (c) 2017 Reini Urban # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # BEGIN { require XSLoader } require Exporter; package Storable; our @ISA = qw(Exporter); our @EXPORT = qw(store retrieve); our @EXPORT_OK = qw( nstore store_fd nstore_fd fd_retrieve freeze nfreeze thaw dclone retrieve_fd lock_store lock_nstore lock_retrieve file_magic read_magic BLESS_OK TIE_OK FLAGS_COMPAT stack_depth stack_depth_hash ); our ($canonical, $forgive_me); BEGIN { our $VERSION = '3.25'; } our $recursion_limit; our $recursion_limit_hash; $recursion_limit = 512 unless defined $recursion_limit; $recursion_limit_hash = 256 unless defined $recursion_limit_hash; use Carp; BEGIN { if (eval { local $SIG{__DIE__}; local @INC = @INC; pop @INC if $INC[-1] eq '.'; require Log::Agent; 1; }) { Log::Agent->import; } # # Use of Log::Agent is optional. If it hasn't imported these subs then # provide a fallback implementation. # unless ($Storable::{logcroak} && *{$Storable::{logcroak}}{CODE}) { *logcroak = \&Carp::croak; } else { # Log::Agent's logcroak always adds a newline to the error it is # given. This breaks refs getting thrown. We can just discard what # it throws (but keep whatever logging it does) and throw the original # args. no warnings 'redefine'; my $logcroak = \&logcroak; *logcroak = sub { my @args = @_; eval { &$logcroak }; Carp::croak(@args); }; } unless ($Storable::{logcarp} && *{$Storable::{logcarp}}{CODE}) { *logcarp = \&Carp::carp; } } # # They might miss :flock in Fcntl # BEGIN { if (eval { require Fcntl; 1 } && exists $Fcntl::EXPORT_TAGS{'flock'}) { Fcntl->import(':flock'); } else { eval q{ sub LOCK_SH () { 1 } sub LOCK_EX () { 2 } }; } } sub CLONE { # clone context under threads Storable::init_perinterp(); } sub BLESS_OK () { 2 } sub TIE_OK () { 4 } sub FLAGS_COMPAT () { BLESS_OK | TIE_OK } # By default restricted hashes are downgraded on earlier perls. $Storable::flags = FLAGS_COMPAT; $Storable::downgrade_restricted = 1; $Storable::accept_future_minor = 1; BEGIN { XSLoader::load('Storable') }; # # Determine whether locking is possible, but only when needed. # sub show_file_magic { print <<EOM; # # To recognize the data files of the Perl module Storable, # the following lines need to be added to the local magic(5) file, # usually either /usr/share/misc/magic or /etc/magic. # 0 string perl-store perl Storable(v0.6) data >4 byte >0 (net-order %d) >>4 byte &01 (network-ordered) >>4 byte =3 (major 1) >>4 byte =2 (major 1) 0 string pst0 perl Storable(v0.7) data >4 byte >0 >>4 byte &01 (network-ordered) >>4 byte =5 (major 2) >>4 byte =4 (major 2) >>5 byte >0 (minor %d) EOM } sub file_magic { require IO::File; my $file = shift; my $fh = IO::File->new; open($fh, "<", $file) || die "Can't open '$file': $!"; binmode($fh); defined(sysread($fh, my $buf, 32)) || die "Can't read from '$file': $!"; close($fh); $file = "./$file" unless $file; # ensure TRUE value return read_magic($buf, $file); } sub read_magic { my($buf, $file) = @_; my %info; my $buflen = length($buf); my $magic; if ($buf =~ s/^(pst0|perl-store)//) { $magic = $1; $info{file} = $file || 1; } else { return undef if $file; $magic = ""; } return undef unless length($buf); my $net_order; if ($magic eq "perl-store" && ord(substr($buf, 0, 1)) > 1) { $info{version} = -1; $net_order = 0; } else { $buf =~ s/(.)//s; my $major = (ord $1) >> 1; return undef if $major > 4; # sanity (assuming we never go that high) $info{major} = $major; $net_order = (ord $1) & 0x01; if ($major > 1) { return undef unless $buf =~ s/(.)//s; my $minor = ord $1; $info{minor} = $minor; $info{version} = "$major.$minor"; $info{version_nv} = sprintf "%d.%03d", $major, $minor; } else { $info{version} = $major; } } $info{version_nv} ||= $info{version}; $info{netorder} = $net_order; unless ($net_order) { return undef unless $buf =~ s/(.)//s; my $len = ord $1; return undef unless length($buf) >= $len; return undef unless $len == 4 || $len == 8; # sanity @info{qw(byteorder intsize longsize ptrsize)} = unpack "a${len}CCC", $buf; (substr $buf, 0, $len + 3) = ''; if ($info{version_nv} >= 2.002) { return undef unless $buf =~ s/(.)//s; $info{nvsize} = ord $1; } } $info{hdrsize} = $buflen - length($buf); return \%info; } sub BIN_VERSION_NV { sprintf "%d.%03d", BIN_MAJOR(), BIN_MINOR(); } sub BIN_WRITE_VERSION_NV { sprintf "%d.%03d", BIN_MAJOR(), BIN_WRITE_MINOR(); } # # store # # Store target object hierarchy, identified by a reference to its root. # The stored object tree may later be retrieved to memory via retrieve. # Returns undef if an I/O error occurred, in which case the file is # removed. # sub store { return _store(\&pstore, @_, 0); } # # nstore # # Same as store, but in network order. # sub nstore { return _store(\&net_pstore, @_, 0); } # # lock_store # # Same as store, but flock the file first (advisory locking). # sub lock_store { return _store(\&pstore, @_, 1); } # # lock_nstore # # Same as nstore, but flock the file first (advisory locking). # sub lock_nstore { return _store(\&net_pstore, @_, 1); } # Internal store to file routine sub _store { my $xsptr = shift; my $self = shift; my ($file, $use_locking) = @_; logcroak "not a reference" unless ref($self); logcroak "wrong argument number" unless @_ == 2; # No @foo in arglist local *FILE; if ($use_locking) { open(FILE, ">>", $file) || logcroak "can't write into $file: $!"; unless (CAN_FLOCK) { logcarp "Storable::lock_store: fcntl/flock emulation broken on $^O"; return undef; } flock(FILE, LOCK_EX) || logcroak "can't get exclusive lock on $file: $!"; truncate FILE, 0; # Unlocking will happen when FILE is closed } else { open(FILE, ">", $file) || logcroak "can't create $file: $!"; } binmode FILE; # Archaic systems... my $da = $@; # Don't mess if called from exception handler my $ret; # Call C routine nstore or pstore, depending on network order eval { $ret = &$xsptr(*FILE, $self) }; # close will return true on success, so the or short-circuits, the () # expression is true, and for that case the block will only be entered # if $@ is true (ie eval failed) # if close fails, it returns false, $ret is altered, *that* is (also) # false, so the () expression is false, !() is true, and the block is # entered. if (!(close(FILE) or undef $ret) || $@) { unlink($file) or warn "Can't unlink $file: $!\n"; } if ($@) { $@ =~ s/\.?\n$/,/ unless ref $@; logcroak $@; } $@ = $da; return $ret; } # # store_fd # # Same as store, but perform on an already opened file descriptor instead. # Returns undef if an I/O error occurred. # sub store_fd { return _store_fd(\&pstore, @_); } # # nstore_fd # # Same as store_fd, but in network order. # sub nstore_fd { my ($self, $file) = @_; return _store_fd(\&net_pstore, @_); } # Internal store routine on opened file descriptor sub _store_fd { my $xsptr = shift; my $self = shift; my ($file) = @_; logcroak "not a reference" unless ref($self); logcroak "too many arguments" unless @_ == 1; # No @foo in arglist my $fd = fileno($file); logcroak "not a valid file descriptor" unless defined $fd; my $da = $@; # Don't mess if called from exception handler my $ret; # Call C routine nstore or pstore, depending on network order eval { $ret = &$xsptr($file, $self) }; logcroak $@ if $@ =~ s/\.?\n$/,/; local $\; print $file ''; # Autoflush the file if wanted $@ = $da; return $ret; } # # freeze # # Store object and its hierarchy in memory and return a scalar # containing the result. # sub freeze { _freeze(\&mstore, @_); } # # nfreeze # # Same as freeze but in network order. # sub nfreeze { _freeze(\&net_mstore, @_); } # Internal freeze routine sub _freeze { my $xsptr = shift; my $self = shift; logcroak "not a reference" unless ref($self); logcroak "too many arguments" unless @_ == 0; # No @foo in arglist my $da = $@; # Don't mess if called from exception handler my $ret; # Call C routine mstore or net_mstore, depending on network order eval { $ret = &$xsptr($self) }; if ($@) { $@ =~ s/\.?\n$/,/ unless ref $@; logcroak $@; } $@ = $da; return $ret ? $ret : undef; } # # retrieve # # Retrieve object hierarchy from disk, returning a reference to the root # object of that tree. # # retrieve(file, flags) # flags include by default BLESS_OK=2 | TIE_OK=4 # with flags=0 or the global $Storable::flags set to 0, no resulting object # will be blessed nor tied. # sub retrieve { _retrieve(shift, 0, @_); } # # lock_retrieve # # Same as retrieve, but with advisory locking. # sub lock_retrieve { _retrieve(shift, 1, @_); } # Internal retrieve routine sub _retrieve { my ($file, $use_locking, $flags) = @_; $flags = $Storable::flags unless defined $flags; my $FILE; open($FILE, "<", $file) || logcroak "can't open $file: $!"; binmode $FILE; # Archaic systems... my $self; my $da = $@; # Could be from exception handler if ($use_locking) { unless (CAN_FLOCK) { logcarp "Storable::lock_store: fcntl/flock emulation broken on $^O"; return undef; } flock($FILE, LOCK_SH) || logcroak "can't get shared lock on $file: $!"; # Unlocking will happen when FILE is closed } eval { $self = pretrieve($FILE, $flags) }; # Call C routine close($FILE); if ($@) { $@ =~ s/\.?\n$/,/ unless ref $@; logcroak $@; } $@ = $da; return $self; } # # fd_retrieve # # Same as retrieve, but perform from an already opened file descriptor instead. # sub fd_retrieve { my ($file, $flags) = @_; $flags = $Storable::flags unless defined $flags; my $fd = fileno($file); logcroak "not a valid file descriptor" unless defined $fd; my $self; my $da = $@; # Could be from exception handler eval { $self = pretrieve($file, $flags) }; # Call C routine if ($@) { $@ =~ s/\.?\n$/,/ unless ref $@; logcroak $@; } $@ = $da; return $self; } sub retrieve_fd { &fd_retrieve } # Backward compatibility # # thaw # # Recreate objects in memory from an existing frozen image created # by freeze. If the frozen image passed is undef, return undef. # # thaw(frozen_obj, flags) # flags include by default BLESS_OK=2 | TIE_OK=4 # with flags=0 or the global $Storable::flags set to 0, no resulting object # will be blessed nor tied. # sub thaw { my ($frozen, $flags) = @_; $flags = $Storable::flags unless defined $flags; return undef unless defined $frozen; my $self; my $da = $@; # Could be from exception handler eval { $self = mretrieve($frozen, $flags) };# Call C routine if ($@) { $@ =~ s/\.?\n$/,/ unless ref $@; logcroak $@; } $@ = $da; return $self; } # # _make_re($re, $flags) # # Internal function used to thaw a regular expression. # my $re_flags; BEGIN { if ($] < 5.010) { $re_flags = qr/\A[imsx]*\z/; } elsif ($] < 5.014) { $re_flags = qr/\A[msixp]*\z/; } elsif ($] < 5.022) { $re_flags = qr/\A[msixpdual]*\z/; } else { $re_flags = qr/\A[msixpdualn]*\z/; } } sub _make_re { my ($re, $flags) = @_; $flags =~ $re_flags or die "regexp flags invalid"; my $qr = eval "qr/\$re/$flags"; die $@ if $@; $qr; } if ($] < 5.012) { eval <<'EOS' sub _regexp_pattern { my $re = "" . shift; $re =~ /\A\(\?([xism]*)(?:-[xism]*)?:(.*)\)\z/s or die "Cannot parse regexp /$re/"; return ($2, $1); } 1 EOS or die "Cannot define _regexp_pattern: $@"; } 1; __END__ =head1 NAME Storable - persistence for Perl data structures =head1 SYNOPSIS use Storable; store \%table, 'file'; $hashref = retrieve('file'); use Storable qw(nstore store_fd nstore_fd freeze thaw dclone); # Network order nstore \%table, 'file'; $hashref = retrieve('file'); # There is NO nretrieve() # Storing to and retrieving from an already opened file store_fd \@array, \*STDOUT; nstore_fd \%table, \*STDOUT; $aryref = fd_retrieve(\*SOCKET); $hashref = fd_retrieve(\*SOCKET); # Serializing to memory $serialized = freeze \%table; %table_clone = %{ thaw($serialized) }; # Deep (recursive) cloning $cloneref = dclone($ref); # Advisory locking use Storable qw(lock_store lock_nstore lock_retrieve) lock_store \%table, 'file'; lock_nstore \%table, 'file'; $hashref = lock_retrieve('file'); =head1 DESCRIPTION The Storable package brings persistence to your Perl data structures containing SCALAR, ARRAY, HASH or REF objects, i.e. anything that can be conveniently stored to disk and retrieved at a later time. It can be used in the regular procedural way by calling C<store> with a reference to the object to be stored, along with the file name where the image should be written. The routine returns C<undef> for I/O problems or other internal error, a true value otherwise. Serious errors are propagated as a C<die> exception. To retrieve data stored to disk, use C<retrieve> with a file name. The objects stored into that file are recreated into memory for you, and a I<reference> to the root object is returned. In case an I/O error occurs while reading, C<undef> is returned instead. Other serious errors are propagated via C<die>. Since storage is performed recursively, you might want to stuff references to objects that share a lot of common data into a single array or hash table, and then store that object. That way, when you retrieve back the whole thing, the objects will continue to share what they originally shared. At the cost of a slight header overhead, you may store to an already opened file descriptor using the C<store_fd> routine, and retrieve from a file via C<fd_retrieve>. Those names aren't imported by default, so you will have to do that explicitly if you need those routines. The file descriptor you supply must be already opened, for read if you're going to retrieve and for write if you wish to store. store_fd(\%table, *STDOUT) || die "can't store to stdout\n"; $hashref = fd_retrieve(*STDIN); You can also store data in network order to allow easy sharing across multiple platforms, or when storing on a socket known to be remotely connected. The routines to call have an initial C<n> prefix for I<network>, as in C<nstore> and C<nstore_fd>. At retrieval time, your data will be correctly restored so you don't have to know whether you're restoring from native or network ordered data. Double values are stored stringified to ensure portability as well, at the slight risk of loosing some precision in the last decimals. When using C<fd_retrieve>, objects are retrieved in sequence, one object (i.e. one recursive tree) per associated C<store_fd>. If you're more from the object-oriented camp, you can inherit from Storable and directly store your objects by invoking C<store> as a method. The fact that the root of the to-be-stored tree is a blessed reference (i.e. an object) is special-cased so that the retrieve does not provide a reference to that object but rather the blessed object reference itself. (Otherwise, you'd get a reference to that blessed object). =head1 MEMORY STORE The Storable engine can also store data into a Perl scalar instead, to later retrieve them. This is mainly used to freeze a complex structure in some safe compact memory place (where it can possibly be sent to another process via some IPC, since freezing the structure also serializes it in effect). Later on, and maybe somewhere else, you can thaw the Perl scalar out and recreate the original complex structure in memory. Surprisingly, the routines to be called are named C<freeze> and C<thaw>. If you wish to send out the frozen scalar to another machine, use C<nfreeze> instead to get a portable image. Note that freezing an object structure and immediately thawing it actually achieves a deep cloning of that structure: dclone(.) = thaw(freeze(.)) Storable provides you with a C<dclone> interface which does not create that intermediary scalar but instead freezes the structure in some internal memory space and then immediately thaws it out. =head1 ADVISORY LOCKING The C<lock_store> and C<lock_nstore> routine are equivalent to C<store> and C<nstore>, except that they get an exclusive lock on the file before writing. Likewise, C<lock_retrieve> does the same as C<retrieve>, but also gets a shared lock on the file before reading. As with any advisory locking scheme, the protection only works if you systematically use C<lock_store> and C<lock_retrieve>. If one side of your application uses C<store> whilst the other uses C<lock_retrieve>, you will get no protection at all. The internal advisory locking is implemented using Perl's flock() routine. If your system does not support any form of flock(), or if you share your files across NFS, you might wish to use other forms of locking by using modules such as LockFile::Simple which lock a file using a filesystem entry, instead of locking the file descriptor. =head1 SPEED The heart of Storable is written in C for decent speed. Extra low-level optimizations have been made when manipulating perl internals, to sacrifice encapsulation for the benefit of greater speed. =head1 CANONICAL REPRESENTATION Normally, Storable stores elements of hashes in the order they are stored internally by Perl, i.e. pseudo-randomly. If you set C<$Storable::canonical> to some C<TRUE> value, Storable will store hashes with the elements sorted by their key. This allows you to compare data structures by comparing their frozen representations (or even the compressed frozen representations), which can be useful for creating lookup tables for complicated queries. Canonical order does not imply network order; those are two orthogonal settings. =head1 CODE REFERENCES Since Storable version 2.05, CODE references may be serialized with the help of L<B::Deparse>. To enable this feature, set C<$Storable::Deparse> to a true value. To enable deserialization, C<$Storable::Eval> should be set to a true value. Be aware that deserialization is done through C<eval>, which is dangerous if the Storable file contains malicious data. You can set C<$Storable::Eval> to a subroutine reference which would be used instead of C<eval>. See below for an example using a L<Safe> compartment for deserialization of CODE references. If C<$Storable::Deparse> and/or C<$Storable::Eval> are set to false values, then the value of C<$Storable::forgive_me> (see below) is respected while serializing and deserializing. =head1 FORWARD COMPATIBILITY This release of Storable can be used on a newer version of Perl to serialize data which is not supported by earlier Perls. By default, Storable will attempt to do the right thing, by C<croak()>ing if it encounters data that it cannot deserialize. However, the defaults can be changed as follows: =over 4 =item utf8 data Perl 5.6 added support for Unicode characters with code points > 255, and Perl 5.8 has full support for Unicode characters in hash keys. Perl internally encodes strings with these characters using utf8, and Storable serializes them as utf8. By default, if an older version of Perl encounters a utf8 value it cannot represent, it will C<croak()>. To change this behaviour so that Storable deserializes utf8 encoded values as the string of bytes (effectively dropping the I<is_utf8> flag) set C<$Storable::drop_utf8> to some C<TRUE> value. This is a form of data loss, because with C<$drop_utf8> true, it becomes impossible to tell whether the original data was the Unicode string, or a series of bytes that happen to be valid utf8. =item restricted hashes Perl 5.8 adds support for restricted hashes, which have keys restricted to a given set, and can have values locked to be read only. By default, when Storable encounters a restricted hash on a perl that doesn't support them, it will deserialize it as a normal hash, silently discarding any placeholder keys and leaving the keys and all values unlocked. To make Storable C<croak()> instead, set C<$Storable::downgrade_restricted> to a C<FALSE> value. To restore the default set it back to some C<TRUE> value. The cperl PERL_PERTURB_KEYS_TOP hash strategy has a known problem with restricted hashes. =item huge objects On 64bit systems some data structures may exceed the 2G (i.e. I32_MAX) limit. On 32bit systems also strings between I32 and U32 (2G-4G). Since Storable 3.00 (not in perl5 core) we are able to store and retrieve these objects, even if perl5 itself is not able to handle them. These are strings longer then 4G, arrays with more then 2G elements and hashes with more then 2G elements. cperl forbids hashes with more than 2G elements, but this fail in cperl then. perl5 itself at least until 5.26 allows it, but cannot iterate over them. Note that creating those objects might cause out of memory exceptions by the operating system before perl has a chance to abort. =item files from future versions of Storable Earlier versions of Storable would immediately croak if they encountered a file with a higher internal version number than the reading Storable knew about. Internal version numbers are increased each time new data types (such as restricted hashes) are added to the vocabulary of the file format. This meant that a newer Storable module had no way of writing a file readable by an older Storable, even if the writer didn't store newer data types. This version of Storable will defer croaking until it encounters a data type in the file that it does not recognize. This means that it will continue to read files generated by newer Storable modules which are careful in what they write out, making it easier to upgrade Storable modules in a mixed environment. The old behaviour of immediate croaking can be re-instated by setting C<$Storable::accept_future_minor> to some C<FALSE> value. =back All these variables have no effect on a newer Perl which supports the relevant feature. =head1 ERROR REPORTING Storable uses the "exception" paradigm, in that it does not try to workaround failures: if something bad happens, an exception is generated from the caller's perspective (see L<Carp> and C<croak()>). Use eval {} to trap those exceptions. When Storable croaks, it tries to report the error via the C<logcroak()> routine from the C<Log::Agent> package, if it is available. Normal errors are reported by having store() or retrieve() return C<undef>. Such errors are usually I/O errors (or truncated stream errors at retrieval). When Storable throws the "Max. recursion depth with nested structures exceeded" error we are already out of stack space. Unfortunately on some earlier perl versions cleaning up a recursive data structure recurses into the free calls, which will lead to stack overflows in the cleanup. This data structure is not properly cleaned up then, it will only be destroyed during global destruction. =head1 WIZARDS ONLY =head2 Hooks Any class may define hooks that will be called during the serialization and deserialization process on objects that are instances of that class. Those hooks can redefine the way serialization is performed (and therefore, how the symmetrical deserialization should be conducted). Since we said earlier: dclone(.) = thaw(freeze(.)) everything we say about hooks should also hold for deep cloning. However, hooks get to know whether the operation is a mere serialization, or a cloning. Therefore, when serializing hooks are involved, dclone(.) <> thaw(freeze(.)) Well, you could keep them in sync, but there's no guarantee it will always hold on classes somebody else wrote. Besides, there is little to gain in doing so: a serializing hook could keep only one attribute of an object, which is probably not what should happen during a deep cloning of that same object. Here is the hooking interface: =over 4 =item C<STORABLE_freeze> I<obj>, I<cloning> The serializing hook, called on the object during serialization. It can be inherited, or defined in the class itself, like any other method. Arguments: I<obj> is the object to serialize, I<cloning> is a flag indicating whether we're in a dclone() or a regular serialization via store() or freeze(). Returned value: A LIST C<($serialized, $ref1, $ref2, ...)> where $serialized is the serialized form to be used, and the optional $ref1, $ref2, etc... are extra references that you wish to let the Storable engine serialize. At deserialization time, you will be given back the same LIST, but all the extra references will be pointing into the deserialized structure. The B<first time> the hook is hit in a serialization flow, you may have it return an empty list. That will signal the Storable engine to further discard that hook for this class and to therefore revert to the default serialization of the underlying Perl data. The hook will again be normally processed in the next serialization. Unless you know better, serializing hook should always say: sub STORABLE_freeze { my ($self, $cloning) = @_; return if $cloning; # Regular default serialization .... } in order to keep reasonable dclone() semantics. =item C<STORABLE_thaw> I<obj>, I<cloning>, I<serialized>, ... The deserializing hook called on the object during deserialization. But wait: if we're deserializing, there's no object yet... right? Wrong: the Storable engine creates an empty one for you. If you know Eiffel, you can view C<STORABLE_thaw> as an alternate creation routine. This means the hook can be inherited like any other method, and that I<obj> is your blessed reference for this particular instance. The other arguments should look familiar if you know C<STORABLE_freeze>: I<cloning> is true when we're part of a deep clone operation, I<serialized> is the serialized string you returned to the engine in C<STORABLE_freeze>, and there may be an optional list of references, in the same order you gave them at serialization time, pointing to the deserialized objects (which have been processed courtesy of the Storable engine). When the Storable engine does not find any C<STORABLE_thaw> hook routine, it tries to load the class by requiring the package dynamically (using the blessed package name), and then re-attempts the lookup. If at that time the hook cannot be located, the engine croaks. Note that this mechanism will fail if you define several classes in the same file, but L<perlmod> warned you. It is up to you to use this information to populate I<obj> the way you want. Returned value: none. =item C<STORABLE_attach> I<class>, I<cloning>, I<serialized> While C<STORABLE_freeze> and C<STORABLE_thaw> are useful for classes where each instance is independent, this mechanism has difficulty (or is incompatible) with objects that exist as common process-level or system-level resources, such as singleton objects, database pools, caches or memoized objects. The alternative C<STORABLE_attach> method provides a solution for these shared objects. Instead of C<STORABLE_freeze> --E<gt> C<STORABLE_thaw>, you implement C<STORABLE_freeze> --E<gt> C<STORABLE_attach> instead. Arguments: I<class> is the class we are attaching to, I<cloning> is a flag indicating whether we're in a dclone() or a regular de-serialization via thaw(), and I<serialized> is the stored string for the resource object. Because these resource objects are considered to be owned by the entire process/system, and not the "property" of whatever is being serialized, no references underneath the object should be included in the serialized string. Thus, in any class that implements C<STORABLE_attach>, the C<STORABLE_freeze> method cannot return any references, and C<Storable> will throw an error if C<STORABLE_freeze> tries to return references. All information required to "attach" back to the shared resource object B<must> be contained B<only> in the C<STORABLE_freeze> return string. Otherwise, C<STORABLE_freeze> behaves as normal for C<STORABLE_attach> classes. Because C<STORABLE_attach> is passed the class (rather than an object), it also returns the object directly, rather than modifying the passed object. Returned value: object of type C<class> =back =head2 Predicates Predicates are not exportable. They must be called by explicitly prefixing them with the Storable package name. =over 4 =item C<Storable::last_op_in_netorder> The C<Storable::last_op_in_netorder()> predicate will tell you whether network order was used in the last store or retrieve operation. If you don't know how to use this, just forget about it. =item C<Storable::is_storing> Returns true if within a store operation (via STORABLE_freeze hook). =item C<Storable::is_retrieving> Returns true if within a retrieve operation (via STORABLE_thaw hook). =back =head2 Recursion With hooks comes the ability to recurse back to the Storable engine. Indeed, hooks are regular Perl code, and Storable is convenient when it comes to serializing and deserializing things, so why not use it to handle the serialization string? There are a few things you need to know, however: =over 4 =item * From Storable 3.05 to 3.13 we probed for the stack recursion limit for references, arrays and hashes to a maximal depth of ~1200-35000, otherwise we might fall into a stack-overflow. On JSON::XS this limit is 512 btw. With references not immediately referencing each other there's no such limit yet, so you might fall into such a stack-overflow segfault. This probing and the checks we performed have some limitations: =over =item * the stack size at build time might be different at run time, eg. the stack size may have been modified with ulimit(1). If it's larger at run time Storable may fail the freeze() or thaw() unnecessarily. If it's larger at build time Storable may segmentation fault when processing a deep structure at run time. =item * the stack size might be different in a thread. =item * array and hash recursion limits are checked separately against the same recursion depth, a frozen structure with a large sequence of nested arrays within many nested hashes may exhaust the processor stack without triggering Storable's recursion protection. =back So these now have simple defaults rather than probing at build-time. You can control the maximum array and hash recursion depths by modifying C<$Storable::recursion_limit> and C<$Storable::recursion_limit_hash> respectively. Either can be set to C<-1> to prevent any depth checks, though this isn't recommended. If you want to test what the limits are, the F<stacksize> tool is included in the C<Storable> distribution. =item * You can create endless loops if the things you serialize via freeze() (for instance) point back to the object we're trying to serialize in the hook. =item * Shared references among objects will not stay shared: if we're serializing the list of object [A, C] where both object A and C refer to the SAME object B, and if there is a serializing hook in A that says freeze(B), then when deserializing, we'll get [A', C'] where A' refers to B', but C' refers to D, a deep clone of B'. The topology was not preserved. =item * The maximal stack recursion limit for your system is returned by C<stack_depth()> and C<stack_depth_hash()>. The hash limit is usually half the size of the array and ref limit, as the Perl hash API is not optimal. =back That's why C<STORABLE_freeze> lets you provide a list of references to serialize. The engine guarantees that those will be serialized in the same context as the other objects, and therefore that shared objects will stay shared. In the above [A, C] example, the C<STORABLE_freeze> hook could return: ("something", $self->{B}) and the B part would be serialized by the engine. In C<STORABLE_thaw>, you would get back the reference to the B' object, deserialized for you. Therefore, recursion should normally be avoided, but is nonetheless supported. =head2 Deep Cloning There is a Clone module available on CPAN which implements deep cloning natively, i.e. without freezing to memory and thawing the result. It is aimed to replace Storable's dclone() some day. However, it does not currently support Storable hooks to redefine the way deep cloning is performed. =head1 Storable magic Yes, there's a lot of that :-) But more precisely, in UNIX systems there's a utility called C<file>, which recognizes data files based on their contents (usually their first few bytes). For this to work, a certain file called F<magic> needs to taught about the I<signature> of the data. Where that configuration file lives depends on the UNIX flavour; often it's something like F</usr/share/misc/magic> or F</etc/magic>. Your system administrator needs to do the updating of the F<magic> file. The necessary signature information is output to STDOUT by invoking Storable::show_file_magic(). Note that the GNU implementation of the C<file> utility, version 3.38 or later, is expected to contain support for recognising Storable files out-of-the-box, in addition to other kinds of Perl files. You can also use the following functions to extract the file header information from Storable images: =over =item $info = Storable::file_magic( $filename ) If the given file is a Storable image return a hash describing it. If the file is readable, but not a Storable image return C<undef>. If the file does not exist or is unreadable then croak. The hash returned has the following elements: =over =item C<version> This returns the file format version. It is a string like "2.7". Note that this version number is not the same as the version number of the Storable module itself. For instance Storable v0.7 create files in format v2.0 and Storable v2.15 create files in format v2.7. The file format version number only increment when additional features that would confuse older versions of the module are added. Files older than v2.0 will have the one of the version numbers "-1", "0" or "1". No minor number was used at that time. =item C<version_nv> This returns the file format version as number. It is a string like "2.007". This value is suitable for numeric comparisons. The constant function C<Storable::BIN_VERSION_NV> returns a comparable number that represents the highest file version number that this version of Storable fully supports (but see discussion of C<$Storable::accept_future_minor> above). The constant C<Storable::BIN_WRITE_VERSION_NV> function returns what file version is written and might be less than C<Storable::BIN_VERSION_NV> in some configurations. =item C<major>, C<minor> This also returns the file format version. If the version is "2.7" then major would be 2 and minor would be 7. The minor element is missing for when major is less than 2. =item C<hdrsize> The is the number of bytes that the Storable header occupies. =item C<netorder> This is TRUE if the image store data in network order. This means that it was created with nstore() or similar. =item C<byteorder> This is only present when C<netorder> is FALSE. It is the $Config{byteorder} string of the perl that created this image. It is a string like "1234" (32 bit little endian) or "87654321" (64 bit big endian). This must match the current perl for the image to be readable by Storable. =item C<intsize>, C<longsize>, C<ptrsize>, C<nvsize> These are only present when C<netorder> is FALSE. These are the sizes of various C datatypes of the perl that created this image. These must match the current perl for the image to be readable by Storable. The C<nvsize> element is only present for file format v2.2 and higher. =item C<file> The name of the file. =back =item $info = Storable::read_magic( $buffer ) =item $info = Storable::read_magic( $buffer, $must_be_file ) The $buffer should be a Storable image or the first few bytes of it. If $buffer starts with a Storable header, then a hash describing the image is returned, otherwise C<undef> is returned. The hash has the same structure as the one returned by Storable::file_magic(). The C<file> element is true if the image is a file image. If the $must_be_file argument is provided and is TRUE, then return C<undef> unless the image looks like it belongs to a file dump. The maximum size of a Storable header is currently 21 bytes. If the provided $buffer is only the first part of a Storable image it should at least be this long to ensure that read_magic() will recognize it as such. =back =head1 EXAMPLES Here are some code samples showing a possible usage of Storable: use Storable qw(store retrieve freeze thaw dclone); %color = ('Blue' => 0.1, 'Red' => 0.8, 'Black' => 0, 'White' => 1); store(\%color, 'mycolors') or die "Can't store %a in mycolors!\n"; $colref = retrieve('mycolors'); die "Unable to retrieve from mycolors!\n" unless defined $colref; printf "Blue is still %lf\n", $colref->{'Blue'}; $colref2 = dclone(\%color); $str = freeze(\%color); printf "Serialization of %%color is %d bytes long.\n", length($str); $colref3 = thaw($str); which prints (on my machine): Blue is still 0.100000 Serialization of %color is 102 bytes long. Serialization of CODE references and deserialization in a safe compartment: =for example begin use Storable qw(freeze thaw); use Safe; use strict; my $safe = new Safe; # because of opcodes used in "use strict": $safe->permit(qw(:default require)); local $Storable::Deparse = 1; local $Storable::Eval = sub { $safe->reval($_[0]) }; my $serialized = freeze(sub { 42 }); my $code = thaw($serialized); $code->() == 42; =for example end =for example_testing is( $code->(), 42 ); =head1 SECURITY WARNING B<Do not accept Storable documents from untrusted sources!> Some features of Storable can lead to security vulnerabilities if you accept Storable documents from untrusted sources with the default flags. Most obviously, the optional (off by default) CODE reference serialization feature allows transfer of code to the deserializing process. Furthermore, any serialized object will cause Storable to helpfully load the module corresponding to the class of the object in the deserializing module. For manipulated module names, this can load almost arbitrary code. Finally, the deserialized object's destructors will be invoked when the objects get destroyed in the deserializing process. Maliciously crafted Storable documents may put such objects in the value of a hash key that is overridden by another key/value pair in the same hash, thus causing immediate destructor execution. To disable blessing objects while thawing/retrieving remove the flag C<BLESS_OK> = 2 from C<$Storable::flags> or set the 2nd argument for thaw/retrieve to 0. To disable tieing data while thawing/retrieving remove the flag C<TIE_OK> = 4 from C<$Storable::flags> or set the 2nd argument for thaw/retrieve to 0. With the default setting of C<$Storable::flags> = 6, creating or destroying random objects, even renamed objects can be controlled by an attacker. See CVE-2015-1592 and its metasploit module. If your application requires accepting data from untrusted sources, you are best off with a less powerful and more-likely safe serialization format and implementation. If your data is sufficiently simple, L<Cpanel::JSON::XS>, L<Data::MessagePack> or L<Sereal> are the best choices and offer maximum interoperability, but note that Sereal is L<unsafe by default|Sereal::Decoder/ROBUSTNESS>. =head1 WARNING If you're using references as keys within your hash tables, you're bound to be disappointed when retrieving your data. Indeed, Perl stringifies references used as hash table keys. If you later wish to access the items via another reference stringification (i.e. using the same reference that was used for the key originally to record the value into the hash table), it will work because both references stringify to the same string. It won't work across a sequence of C<store> and C<retrieve> operations, however, because the addresses in the retrieved objects, which are part of the stringified references, will probably differ from the original addresses. The topology of your structure is preserved, but not hidden semantics like those. On platforms where it matters, be sure to call C<binmode()> on the descriptors that you pass to Storable functions. Storing data canonically that contains large hashes can be significantly slower than storing the same data normally, as temporary arrays to hold the keys for each hash have to be allocated, populated, sorted and freed. Some tests have shown a halving of the speed of storing -- the exact penalty will depend on the complexity of your data. There is no slowdown on retrieval. =head1 REGULAR EXPRESSIONS Storable now has experimental support for storing regular expressions, but there are significant limitations: =over =item * perl 5.8 or later is required. =item * regular expressions with code blocks, ie C</(?{ ... })/> or C</(??{ ... })/> will throw an exception when thawed. =item * regular expression syntax and flags have changed over the history of perl, so a regular expression that you freeze in one version of perl may fail to thaw or behave differently in another version of perl. =item * depending on the version of perl, regular expressions can change in behaviour depending on the context, but later perls will bake that behaviour into the regexp. =back Storable will throw an exception if a frozen regular expression cannot be thawed. =head1 BUGS You can't store GLOB, FORMLINE, etc.... If you can define semantics for those operations, feel free to enhance Storable so that it can deal with them. The store functions will C<croak> if they run into such references unless you set C<$Storable::forgive_me> to some C<TRUE> value. In that case, the fatal message is converted to a warning and some meaningless string is stored instead. Setting C<$Storable::canonical> may not yield frozen strings that compare equal due to possible stringification of numbers. When the string version of a scalar exists, it is the form stored; therefore, if you happen to use your numbers as strings between two freezing operations on the same data structures, you will get different results. When storing doubles in network order, their value is stored as text. However, you should also not expect non-numeric floating-point values such as infinity and "not a number" to pass successfully through a nstore()/retrieve() pair. As Storable neither knows nor cares about character sets (although it does know that characters may be more than eight bits wide), any difference in the interpretation of character codes between a host and a target system is your problem. In particular, if host and target use different code points to represent the characters used in the text representation of floating-point numbers, you will not be able be able to exchange floating-point data, even with nstore(). C<Storable::drop_utf8> is a blunt tool. There is no facility either to return B<all> strings as utf8 sequences, or to attempt to convert utf8 data back to 8 bit and C<croak()> if the conversion fails. Prior to Storable 2.01, no distinction was made between signed and unsigned integers on storing. By default Storable prefers to store a scalars string representation (if it has one) so this would only cause problems when storing large unsigned integers that had never been converted to string or floating point. In other words values that had been generated by integer operations such as logic ops and then not used in any string or arithmetic context before storing. =head2 64 bit data in perl 5.6.0 and 5.6.1 This section only applies to you if you have existing data written out by Storable 2.02 or earlier on perl 5.6.0 or 5.6.1 on Unix or Linux which has been configured with 64 bit integer support (not the default) If you got a precompiled perl, rather than running Configure to build your own perl from source, then it almost certainly does not affect you, and you can stop reading now (unless you're curious). If you're using perl on Windows it does not affect you. Storable writes a file header which contains the sizes of various C language types for the C compiler that built Storable (when not writing in network order), and will refuse to load files written by a Storable not on the same (or compatible) architecture. This check and a check on machine byteorder is needed because the size of various fields in the file are given by the sizes of the C language types, and so files written on different architectures are incompatible. This is done for increased speed. (When writing in network order, all fields are written out as standard lengths, which allows full interworking, but takes longer to read and write) Perl 5.6.x introduced the ability to optional configure the perl interpreter to use C's C<long long> type to allow scalars to store 64 bit integers on 32 bit systems. However, due to the way the Perl configuration system generated the C configuration files on non-Windows platforms, and the way Storable generates its header, nothing in the Storable file header reflected whether the perl writing was using 32 or 64 bit integers, despite the fact that Storable was storing some data differently in the file. Hence Storable running on perl with 64 bit integers will read the header from a file written by a 32 bit perl, not realise that the data is actually in a subtly incompatible format, and then go horribly wrong (possibly crashing) if it encountered a stored integer. This is a design failure. Storable has now been changed to write out and read in a file header with information about the size of integers. It's impossible to detect whether an old file being read in was written with 32 or 64 bit integers (they have the same header) so it's impossible to automatically switch to a correct backwards compatibility mode. Hence this Storable defaults to the new, correct behaviour. What this means is that if you have data written by Storable 1.x running on perl 5.6.0 or 5.6.1 configured with 64 bit integers on Unix or Linux then by default this Storable will refuse to read it, giving the error I<Byte order is not compatible>. If you have such data then you should set C<$Storable::interwork_56_64bit> to a true value to make this Storable read and write files with the old header. You should also migrate your data, or any older perl you are communicating with, to this current version of Storable. If you don't have data written with specific configuration of perl described above, then you do not and should not do anything. Don't set the flag - not only will Storable on an identically configured perl refuse to load them, but Storable a differently configured perl will load them believing them to be correct for it, and then may well fail or crash part way through reading them. =head1 CREDITS Thank you to (in chronological order): Jarkko Hietaniemi <jhi@iki.fi> Ulrich Pfeifer <pfeifer@charly.informatik.uni-dortmund.de> Benjamin A. Holzman <bholzman@earthlink.net> Andrew Ford <A.Ford@ford-mason.co.uk> Gisle Aas <gisle@aas.no> Jeff Gresham <gresham_jeffrey@jpmorgan.com> Murray Nesbitt <murray@activestate.com> Marc Lehmann <pcg@opengroup.org> Justin Banks <justinb@wamnet.com> Jarkko Hietaniemi <jhi@iki.fi> (AGAIN, as perl 5.7.0 Pumpkin!) Salvador Ortiz Garcia <sog@msg.com.mx> Dominic Dunlop <domo@computer.org> Erik Haugan <erik@solbors.no> Benjamin A. Holzman <ben.holzman@grantstreet.com> Reini Urban <rurban@cpan.org> Todd Rinaldo <toddr@cpanel.net> Aaron Crane <arc@cpan.org> for their bug reports, suggestions and contributions. Benjamin Holzman contributed the tied variable support, Andrew Ford contributed the canonical order for hashes, and Gisle Aas fixed a few misunderstandings of mine regarding the perl internals, and optimized the emission of "tags" in the output streams by simply counting the objects instead of tagging them (leading to a binary incompatibility for the Storable image starting at version 0.6--older images are, of course, still properly understood). Murray Nesbitt made Storable thread-safe. Marc Lehmann added overloading and references to tied items support. Benjamin Holzman added a performance improvement for overloaded classes; thanks to Grant Street Group for footing the bill. Reini Urban took over maintenance from p5p, and added security fixes and huge object support. =head1 AUTHOR Storable was written by Raphael Manfredi F<E<lt>Raphael_Manfredi@pobox.comE<gt>> Maintenance is now done by cperl L<http://perl11.org/cperl> Please e-mail us with problems, bug fixes, comments and complaints, although if you have compliments you should send them to Raphael. Please don't e-mail Raphael with problems, as he no longer works on Storable, and your message will be delayed while he forwards it to us. =head1 SEE ALSO L<Clone>. =cut PK ��[���� �� Makefilenu �[��� # This Makefile is for the Storable extension to perl. # # It was generated automatically by MakeMaker version # 7.60 (Revision: 76000) from the contents of # Makefile.PL. Don't edit this file, edit Makefile.PL instead. # # ANY CHANGES MADE HERE WILL BE LOST! # # MakeMaker ARGV: () # # MakeMaker Parameters: # ABSTRACT_FROM => q[Storable.pm] # AUTHOR => [q[Perl 5 Porters]] # BUILD_REQUIRES => { ExtUtils::MakeMaker=>q[6.31] } # CONFIGURE_REQUIRES => { ExtUtils::MakeMaker=>q[6.31] } # DISTNAME => q[Storable] # INSTALLDIRS => q[site] # LICENSE => q[perl] # META_MERGE => { provides=>{ Storable=>{ file=>q[Storable.pm], version=>q[3.25] } }, resources=>{ bugtracker=>q[https://github.com/Perl/perl5/issues] } } # NAME => q[Storable] # PREREQ_PM => { ExtUtils::MakeMaker=>q[6.31], Test::More=>q[0.41], XSLoader=>q[0] } # TEST_REQUIRES => { Test::More=>q[0.41] } # VERSION_FROM => q[Storable.pm] # clean => { FILES=>q[Storable-*] } # dist => { COMPRESS=>q[gzip -f], SUFFIX=>q[gz] } # --- MakeMaker post_initialize section: # --- MakeMaker const_config section: # These definitions are from config.sh (via /usr/lib64/perl5/Config.pm). # They may have been overridden via Makefile.PL or on the command line. AR = ar CC = gcc CCCDLFLAGS = -fPIC CCDLFLAGS = -Wl,--enable-new-dtags -Wl,-z,relro -Wl,--as-needed -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 DLEXT = so DLSRC = dl_dlopen.xs EXE_EXT = FULL_AR = /usr/bin/ar LD = gcc LDDLFLAGS = -lpthread -shared -Wl,-z,relro -Wl,--as-needed -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -L/usr/local/lib -fstack-protector-strong LDFLAGS = -Wl,-z,relro -Wl,--as-needed -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fstack-protector-strong -L/usr/local/lib LIBC = /lib/../lib64/libc.so.6 LIB_EXT = .a OBJ_EXT = .o OSNAME = linux OSVERS = 4.18.0-513.18.1.el8_9.x86_64 RANLIB = : SITELIBEXP = /usr/local/share/perl5/5.32 SITEARCHEXP = /usr/local/lib64/perl5/5.32 SO = so VENDORARCHEXP = /usr/lib64/perl5/vendor_perl VENDORLIBEXP = /usr/share/perl5/vendor_perl # --- MakeMaker constants section: AR_STATIC_ARGS = cr DIRFILESEP = / DFSEP = $(DIRFILESEP) NAME = Storable NAME_SYM = Storable VERSION = 3.25 VERSION_MACRO = VERSION VERSION_SYM = 3_25 DEFINE_VERSION = -D$(VERSION_MACRO)=\"$(VERSION)\" XS_VERSION = 3.25 XS_VERSION_MACRO = XS_VERSION XS_DEFINE_VERSION = -D$(XS_VERSION_MACRO)=\"$(XS_VERSION)\" INST_ARCHLIB = blib/arch INST_SCRIPT = blib/script INST_BIN = blib/bin INST_LIB = blib/lib INST_MAN1DIR = blib/man1 INST_MAN3DIR = blib/man3 MAN1EXT = 1 MAN3EXT = 3pm MAN1SECTION = 1 MAN3SECTION = 3 INSTALLDIRS = site DESTDIR = PREFIX = $(SITEPREFIX) PERLPREFIX = /usr SITEPREFIX = /usr/local VENDORPREFIX = /usr INSTALLPRIVLIB = /usr/share/perl5 DESTINSTALLPRIVLIB = $(DESTDIR)$(INSTALLPRIVLIB) INSTALLSITELIB = /usr/local/share/perl5/5.32 DESTINSTALLSITELIB = $(DESTDIR)$(INSTALLSITELIB) INSTALLVENDORLIB = /usr/share/perl5/vendor_perl DESTINSTALLVENDORLIB = $(DESTDIR)$(INSTALLVENDORLIB) INSTALLARCHLIB = /usr/lib64/perl5 DESTINSTALLARCHLIB = $(DESTDIR)$(INSTALLARCHLIB) INSTALLSITEARCH = /usr/local/lib64/perl5/5.32 DESTINSTALLSITEARCH = $(DESTDIR)$(INSTALLSITEARCH) INSTALLVENDORARCH = /usr/lib64/perl5/vendor_perl DESTINSTALLVENDORARCH = $(DESTDIR)$(INSTALLVENDORARCH) INSTALLBIN = /usr/bin DESTINSTALLBIN = $(DESTDIR)$(INSTALLBIN) INSTALLSITEBIN = /usr/local/bin DESTINSTALLSITEBIN = $(DESTDIR)$(INSTALLSITEBIN) INSTALLVENDORBIN = /usr/bin DESTINSTALLVENDORBIN = $(DESTDIR)$(INSTALLVENDORBIN) INSTALLSCRIPT = /usr/bin DESTINSTALLSCRIPT = $(DESTDIR)$(INSTALLSCRIPT) INSTALLSITESCRIPT = /usr/local/bin DESTINSTALLSITESCRIPT = $(DESTDIR)$(INSTALLSITESCRIPT) INSTALLVENDORSCRIPT = /usr/bin DESTINSTALLVENDORSCRIPT = $(DESTDIR)$(INSTALLVENDORSCRIPT) INSTALLMAN1DIR = /usr/share/man/man1 DESTINSTALLMAN1DIR = $(DESTDIR)$(INSTALLMAN1DIR) INSTALLSITEMAN1DIR = /usr/local/share/man/man1 DESTINSTALLSITEMAN1DIR = $(DESTDIR)$(INSTALLSITEMAN1DIR) INSTALLVENDORMAN1DIR = /usr/share/man/man1 DESTINSTALLVENDORMAN1DIR = $(DESTDIR)$(INSTALLVENDORMAN1DIR) INSTALLMAN3DIR = /usr/share/man/man3 DESTINSTALLMAN3DIR = $(DESTDIR)$(INSTALLMAN3DIR) INSTALLSITEMAN3DIR = /usr/local/share/man/man3 DESTINSTALLSITEMAN3DIR = $(DESTDIR)$(INSTALLSITEMAN3DIR) INSTALLVENDORMAN3DIR = /usr/share/man/man3 DESTINSTALLVENDORMAN3DIR = $(DESTDIR)$(INSTALLVENDORMAN3DIR) PERL_LIB = /usr/share/perl5 PERL_ARCHLIB = /usr/lib64/perl5 PERL_ARCHLIBDEP = /usr/lib64/perl5 LIBPERL_A = libperl.a FIRST_MAKEFILE = Makefile MAKEFILE_OLD = Makefile.old MAKE_APERL_FILE = Makefile.aperl PERLMAINCC = $(CC) PERL_INC = /usr/lib64/perl5/CORE PERL_INCDEP = /usr/lib64/perl5/CORE PERL = "/usr/bin/perl" FULLPERL = "/usr/bin/perl" ABSPERL = $(PERL) PERLRUN = $(PERL) FULLPERLRUN = $(FULLPERL) ABSPERLRUN = $(ABSPERL) PERLRUNINST = $(PERLRUN) "-I$(INST_ARCHLIB)" "-I$(INST_LIB)" FULLPERLRUNINST = $(FULLPERLRUN) "-I$(INST_ARCHLIB)" "-I$(INST_LIB)" ABSPERLRUNINST = $(ABSPERLRUN) "-I$(INST_ARCHLIB)" "-I$(INST_LIB)" PERL_CORE = 0 PERM_DIR = 755 PERM_RW = 644 PERM_RWX = 755 MAKEMAKER = /usr/share/perl5/vendor_perl/ExtUtils/MakeMaker.pm MM_VERSION = 7.60 MM_REVISION = 76000 # FULLEXT = Pathname for extension directory (eg Foo/Bar/Oracle). # BASEEXT = Basename part of FULLEXT. May be just equal FULLEXT. (eg Oracle) # PARENT_NAME = NAME without BASEEXT and no trailing :: (eg Foo::Bar) # DLBASE = Basename part of dynamic library. May be just equal BASEEXT. MAKE = make FULLEXT = Storable BASEEXT = Storable PARENT_NAME = DLBASE = $(BASEEXT) VERSION_FROM = Storable.pm OBJECT = $(BASEEXT)$(OBJ_EXT) LDFROM = $(OBJECT) LINKTYPE = dynamic BOOTDEP = # Handy lists of source code files: XS_FILES = Storable.xs C_FILES = Storable.c O_FILES = Storable.o H_FILES = ppport.h MAN1PODS = MAN3PODS = Storable.pm # Where is the Config information that we are using/depend on CONFIGDEP = $(PERL_ARCHLIBDEP)$(DFSEP)Config.pm $(PERL_INCDEP)$(DFSEP)config.h # Where to build things INST_LIBDIR = $(INST_LIB) INST_ARCHLIBDIR = $(INST_ARCHLIB) INST_AUTODIR = $(INST_LIB)/auto/$(FULLEXT) INST_ARCHAUTODIR = $(INST_ARCHLIB)/auto/$(FULLEXT) INST_STATIC = $(INST_ARCHAUTODIR)/$(BASEEXT)$(LIB_EXT) INST_DYNAMIC = $(INST_ARCHAUTODIR)/$(DLBASE).$(DLEXT) INST_BOOT = $(INST_ARCHAUTODIR)/$(BASEEXT).bs # Extra linker info EXPORT_LIST = PERL_ARCHIVE = PERL_ARCHIVEDEP = PERL_ARCHIVE_AFTER = TO_INST_PM = Storable.pm # --- MakeMaker platform_constants section: MM_Unix_VERSION = 7.60 PERL_MALLOC_DEF = -DPERL_EXTMALLOC_DEF -Dmalloc=Perl_malloc -Dfree=Perl_mfree -Drealloc=Perl_realloc -Dcalloc=Perl_calloc # --- MakeMaker tool_autosplit section: # Usage: $(AUTOSPLITFILE) FileToSplit AutoDirToSplitInto AUTOSPLITFILE = $(ABSPERLRUN) -e 'use AutoSplit; autosplit($$$$ARGV[0], $$$$ARGV[1], 0, 1, 1)' -- # --- MakeMaker tool_xsubpp section: XSUBPPDIR = /usr/share/perl5/vendor_perl/ExtUtils XSUBPP = "$(XSUBPPDIR)$(DFSEP)xsubpp" XSUBPPRUN = $(PERLRUN) $(XSUBPP) XSPROTOARG = XSUBPPDEPS = /usr/share/perl5/ExtUtils/typemap /usr/share/perl5/vendor_perl/ExtUtils$(DFSEP)xsubpp XSUBPPARGS = -typemap '/usr/share/perl5/ExtUtils/typemap' XSUBPP_EXTRA_ARGS = # --- MakeMaker tools_other section: SHELL = /bin/sh CHMOD = chmod CP = cp MV = mv NOOP = $(TRUE) NOECHO = @ RM_F = rm -f RM_RF = rm -rf TEST_F = test -f TOUCH = touch UMASK_NULL = umask 0 DEV_NULL = > /dev/null 2>&1 MKPATH = $(ABSPERLRUN) -MExtUtils::Command -e 'mkpath' -- EQUALIZE_TIMESTAMP = $(ABSPERLRUN) -MExtUtils::Command -e 'eqtime' -- FALSE = false TRUE = true ECHO = echo ECHO_N = echo -n UNINST = 0 VERBINST = 0 MOD_INSTALL = $(ABSPERLRUN) -MExtUtils::Install -e 'install([ from_to => {@ARGV}, verbose => '\''$(VERBINST)'\'', uninstall_shadows => '\''$(UNINST)'\'', dir_mode => '\''$(PERM_DIR)'\'' ]);' -- DOC_INSTALL = $(ABSPERLRUN) -MExtUtils::Command::MM -e 'perllocal_install' -- UNINSTALL = $(ABSPERLRUN) -MExtUtils::Command::MM -e 'uninstall' -- WARN_IF_OLD_PACKLIST = $(ABSPERLRUN) -MExtUtils::Command::MM -e 'warn_if_old_packlist' -- MACROSTART = MACROEND = USEMAKEFILE = -f FIXIN = $(ABSPERLRUN) -MExtUtils::MY -e 'MY->fixin(shift)' -- CP_NONEMPTY = $(ABSPERLRUN) -MExtUtils::Command::MM -e 'cp_nonempty' -- # --- MakeMaker makemakerdflt section: makemakerdflt : all $(NOECHO) $(NOOP) # --- MakeMaker dist section: TAR = tar TARFLAGS = cvf ZIP = zip ZIPFLAGS = -r COMPRESS = gzip -f SUFFIX = .gz SHAR = shar PREOP = $(NOECHO) $(NOOP) POSTOP = $(NOECHO) $(NOOP) TO_UNIX = $(NOECHO) $(NOOP) CI = ci -u RCS_LABEL = rcs -Nv$(VERSION_SYM): -q DIST_CP = best DIST_DEFAULT = tardist DISTNAME = Storable DISTVNAME = Storable-3.25 # --- MakeMaker macro section: # --- MakeMaker depend section: release : dist git tag $(VERSION) cpan-upload $(DISTVNAME).tar$(SUFFIX) git push git push --tags # --- MakeMaker cflags section: CCFLAGS = -D_REENTRANT -D_GNU_SOURCE -O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64-v2 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -fwrapv -fno-strict-aliasing -I/usr/local/include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 OPTIMIZE = -g PERLTYPE = MPOLLUTE = # --- MakeMaker const_loadlibs section: # Storable might depend on some other libraries: # See ExtUtils::Liblist for details # # --- MakeMaker const_cccmd section: CCCMD = $(CC) -c $(PASTHRU_INC) $(INC) \ $(CCFLAGS) $(OPTIMIZE) \ $(PERLTYPE) $(MPOLLUTE) $(DEFINE_VERSION) \ $(XS_DEFINE_VERSION) # --- MakeMaker post_constants section: # --- MakeMaker pasthru section: PASTHRU = LIBPERL_A="$(LIBPERL_A)"\ LINKTYPE="$(LINKTYPE)"\ OPTIMIZE="$(OPTIMIZE)"\ PREFIX="$(PREFIX)"\ PASTHRU_DEFINE='$(DEFINE) $(PASTHRU_DEFINE)'\ PASTHRU_INC='$(INC) $(PASTHRU_INC)' # --- MakeMaker special_targets section: .SUFFIXES : .xs .c .C .cpp .i .s .cxx .cc $(OBJ_EXT) .PHONY: all config static dynamic test linkext manifest blibdirs clean realclean disttest distdir pure_all subdirs clean_subdirs makemakerdflt manifypods realclean_subdirs subdirs_dynamic subdirs_pure_nolink subdirs_static subdirs-test_dynamic subdirs-test_static test_dynamic test_static # --- MakeMaker c_o section: .c.i: gcc -E -c $(PASTHRU_INC) $(INC) \ $(CCFLAGS) $(OPTIMIZE) \ $(PERLTYPE) $(MPOLLUTE) $(DEFINE_VERSION) \ $(XS_DEFINE_VERSION) $(CCCDLFLAGS) "-I$(PERL_INC)" $(PASTHRU_DEFINE) $(DEFINE) $*.c > $*.i .c.s : $(CCCMD) -S $(CCCDLFLAGS) "-I$(PERL_INC)" $(PASTHRU_DEFINE) $(DEFINE) $*.c .c$(OBJ_EXT) : $(CCCMD) $(CCCDLFLAGS) "-I$(PERL_INC)" $(PASTHRU_DEFINE) $(DEFINE) $*.c .cpp$(OBJ_EXT) : $(CCCMD) $(CCCDLFLAGS) "-I$(PERL_INC)" $(PASTHRU_DEFINE) $(DEFINE) $*.cpp .cxx$(OBJ_EXT) : $(CCCMD) $(CCCDLFLAGS) "-I$(PERL_INC)" $(PASTHRU_DEFINE) $(DEFINE) $*.cxx .cc$(OBJ_EXT) : $(CCCMD) $(CCCDLFLAGS) "-I$(PERL_INC)" $(PASTHRU_DEFINE) $(DEFINE) $*.cc .C$(OBJ_EXT) : $(CCCMD) $(CCCDLFLAGS) "-I$(PERL_INC)" $(PASTHRU_DEFINE) $(DEFINE) $*.C # --- MakeMaker xs_c section: .xs.c: $(XSUBPPRUN) $(XSPROTOARG) $(XSUBPPARGS) $(XSUBPP_EXTRA_ARGS) $*.xs > $*.xsc $(MV) $*.xsc $*.c # --- MakeMaker xs_o section: .xs$(OBJ_EXT) : $(XSUBPPRUN) $(XSPROTOARG) $(XSUBPPARGS) $*.xs > $*.xsc $(MV) $*.xsc $*.c $(CCCMD) $(CCCDLFLAGS) "-I$(PERL_INC)" $(PASTHRU_DEFINE) $(DEFINE) $*.c # --- MakeMaker top_targets section: all :: pure_all manifypods $(NOECHO) $(NOOP) pure_all :: config pm_to_blib subdirs linkext $(NOECHO) $(NOOP) subdirs :: $(MYEXTLIB) $(NOECHO) $(NOOP) config :: $(FIRST_MAKEFILE) blibdirs $(NOECHO) $(NOOP) $(O_FILES) : $(H_FILES) help : perldoc ExtUtils::MakeMaker # --- MakeMaker blibdirs section: blibdirs : $(INST_LIBDIR)$(DFSEP).exists $(INST_ARCHLIB)$(DFSEP).exists $(INST_AUTODIR)$(DFSEP).exists $(INST_ARCHAUTODIR)$(DFSEP).exists $(INST_BIN)$(DFSEP).exists $(INST_SCRIPT)$(DFSEP).exists $(INST_MAN1DIR)$(DFSEP).exists $(INST_MAN3DIR)$(DFSEP).exists $(NOECHO) $(NOOP) # Backwards compat with 6.18 through 6.25 blibdirs.ts : blibdirs $(NOECHO) $(NOOP) $(INST_LIBDIR)$(DFSEP).exists :: Makefile.PL $(NOECHO) $(MKPATH) $(INST_LIBDIR) $(NOECHO) $(CHMOD) $(PERM_DIR) $(INST_LIBDIR) $(NOECHO) $(TOUCH) $(INST_LIBDIR)$(DFSEP).exists $(INST_ARCHLIB)$(DFSEP).exists :: Makefile.PL $(NOECHO) $(MKPATH) $(INST_ARCHLIB) $(NOECHO) $(CHMOD) $(PERM_DIR) $(INST_ARCHLIB) $(NOECHO) $(TOUCH) $(INST_ARCHLIB)$(DFSEP).exists $(INST_AUTODIR)$(DFSEP).exists :: Makefile.PL $(NOECHO) $(MKPATH) $(INST_AUTODIR) $(NOECHO) $(CHMOD) $(PERM_DIR) $(INST_AUTODIR) $(NOECHO) $(TOUCH) $(INST_AUTODIR)$(DFSEP).exists $(INST_ARCHAUTODIR)$(DFSEP).exists :: Makefile.PL $(NOECHO) $(MKPATH) $(INST_ARCHAUTODIR) $(NOECHO) $(CHMOD) $(PERM_DIR) $(INST_ARCHAUTODIR) $(NOECHO) $(TOUCH) $(INST_ARCHAUTODIR)$(DFSEP).exists $(INST_BIN)$(DFSEP).exists :: Makefile.PL $(NOECHO) $(MKPATH) $(INST_BIN) $(NOECHO) $(CHMOD) $(PERM_DIR) $(INST_BIN) $(NOECHO) $(TOUCH) $(INST_BIN)$(DFSEP).exists $(INST_SCRIPT)$(DFSEP).exists :: Makefile.PL $(NOECHO) $(MKPATH) $(INST_SCRIPT) $(NOECHO) $(CHMOD) $(PERM_DIR) $(INST_SCRIPT) $(NOECHO) $(TOUCH) $(INST_SCRIPT)$(DFSEP).exists $(INST_MAN1DIR)$(DFSEP).exists :: Makefile.PL $(NOECHO) $(MKPATH) $(INST_MAN1DIR) $(NOECHO) $(CHMOD) $(PERM_DIR) $(INST_MAN1DIR) $(NOECHO) $(TOUCH) $(INST_MAN1DIR)$(DFSEP).exists $(INST_MAN3DIR)$(DFSEP).exists :: Makefile.PL $(NOECHO) $(MKPATH) $(INST_MAN3DIR) $(NOECHO) $(CHMOD) $(PERM_DIR) $(INST_MAN3DIR) $(NOECHO) $(TOUCH) $(INST_MAN3DIR)$(DFSEP).exists # --- MakeMaker linkext section: linkext :: dynamic $(NOECHO) $(NOOP) # --- MakeMaker dlsyms section: # --- MakeMaker dynamic_bs section: BOOTSTRAP = $(BASEEXT).bs # As Mkbootstrap might not write a file (if none is required) # we use touch to prevent make continually trying to remake it. # The DynaLoader only reads a non-empty file. $(BASEEXT).bs : $(FIRST_MAKEFILE) $(BOOTDEP) $(NOECHO) $(ECHO) "Running Mkbootstrap for $(BASEEXT) ($(BSLOADLIBS))" $(NOECHO) $(PERLRUN) \ "-MExtUtils::Mkbootstrap" \ -e "Mkbootstrap('$(BASEEXT)','$(BSLOADLIBS)');" $(NOECHO) $(TOUCH) "$(BASEEXT).bs" $(CHMOD) $(PERM_RW) "$(BASEEXT).bs" $(INST_ARCHAUTODIR)/$(BASEEXT).bs : $(BASEEXT).bs $(INST_ARCHAUTODIR)$(DFSEP).exists $(NOECHO) $(RM_RF) $(INST_ARCHAUTODIR)/$(BASEEXT).bs - $(CP_NONEMPTY) $(BASEEXT).bs $(INST_ARCHAUTODIR)/$(BASEEXT).bs $(PERM_RW) # --- MakeMaker dynamic section: dynamic :: $(FIRST_MAKEFILE) config $(INST_BOOT) $(INST_DYNAMIC) $(NOECHO) $(NOOP) # --- MakeMaker dynamic_lib section: # This section creates the dynamically loadable objects from relevant # objects and possibly $(MYEXTLIB). ARMAYBE = : OTHERLDFLAGS = INST_DYNAMIC_DEP = INST_DYNAMIC_FIX = $(INST_DYNAMIC) : $(OBJECT) $(MYEXTLIB) $(INST_ARCHAUTODIR)$(DFSEP).exists $(EXPORT_LIST) $(PERL_ARCHIVEDEP) $(PERL_ARCHIVE_AFTER) $(INST_DYNAMIC_DEP) $(RM_F) $@ $(LD) $(LDDLFLAGS) $(LDFROM) $(OTHERLDFLAGS) -o $@ $(MYEXTLIB) \ $(PERL_ARCHIVE) $(LDLOADLIBS) -lperl $(PERL_ARCHIVE_AFTER) $(EXPORT_LIST) \ $(INST_DYNAMIC_FIX) $(CHMOD) $(PERM_RWX) $@ # --- MakeMaker static section: ## $(INST_PM) has been moved to the all: target. ## It remains here for awhile to allow for old usage: "make static" static :: $(FIRST_MAKEFILE) $(INST_STATIC) $(NOECHO) $(NOOP) # --- MakeMaker static_lib section: $(INST_STATIC): $(OBJECT) $(MYEXTLIB) $(INST_ARCHAUTODIR)$(DFSEP).exists $(RM_F) "$@" $(FULL_AR) $(AR_STATIC_ARGS) "$@" $(OBJECT) $(RANLIB) "$@" $(CHMOD) $(PERM_RWX) $@ $(NOECHO) $(ECHO) "$(EXTRALIBS)" > $(INST_ARCHAUTODIR)$(DFSEP)extralibs.ld # --- MakeMaker manifypods section: POD2MAN_EXE = $(PERLRUN) "-MExtUtils::Command::MM" -e pod2man "--" POD2MAN = $(POD2MAN_EXE) manifypods : pure_all config \ Storable.pm $(NOECHO) $(POD2MAN) --section=$(MAN3SECTION) --perm_rw=$(PERM_RW) -u \ Storable.pm $(INST_MAN3DIR)/Storable.$(MAN3EXT) # --- MakeMaker processPL section: # --- MakeMaker installbin section: # --- MakeMaker subdirs section: # none # --- MakeMaker clean_subdirs section: clean_subdirs : $(NOECHO) $(NOOP) # --- MakeMaker clean section: # Delete temporary files but do not touch installed files. We don't delete # the Makefile here so a later make realclean still has a makefile to use. clean :: clean_subdirs - $(RM_F) \ $(BASEEXT).bso $(BASEEXT).def \ $(BASEEXT).exp $(BASEEXT).x \ $(BOOTSTRAP) $(INST_ARCHAUTODIR)/extralibs.all \ $(INST_ARCHAUTODIR)/extralibs.ld $(MAKE_APERL_FILE) \ *$(LIB_EXT) *$(OBJ_EXT) \ *perl.core MYMETA.json \ MYMETA.yml Storable.base \ Storable.bs Storable.bso \ Storable.c Storable.def \ Storable.exp Storable.o \ Storable_def.old blibdirs.ts \ core core.*perl.*.? \ core.[0-9] core.[0-9][0-9] \ core.[0-9][0-9][0-9] core.[0-9][0-9][0-9][0-9] \ core.[0-9][0-9][0-9][0-9][0-9] lib$(BASEEXT).def \ mon.out perl \ perl$(EXE_EXT) perl.exe \ perlmain.c pm_to_blib \ pm_to_blib.ts so_locations \ tmon.out - $(RM_RF) \ Storable-* blib $(NOECHO) $(RM_F) $(MAKEFILE_OLD) - $(MV) $(FIRST_MAKEFILE) $(MAKEFILE_OLD) $(DEV_NULL) # --- MakeMaker realclean_subdirs section: # so clean is forced to complete before realclean_subdirs runs realclean_subdirs : clean $(NOECHO) $(NOOP) # --- MakeMaker realclean section: # Delete temporary files (via clean) and also delete dist files realclean purge :: realclean_subdirs - $(RM_F) \ $(FIRST_MAKEFILE) $(MAKEFILE_OLD) \ $(OBJECT) - $(RM_RF) \ $(DISTVNAME) # --- MakeMaker metafile section: metafile : create_distdir $(NOECHO) $(ECHO) Generating META.yml $(NOECHO) $(ECHO) '---' > META_new.yml $(NOECHO) $(ECHO) 'abstract: '\''persistence for Perl data structures'\''' >> META_new.yml $(NOECHO) $(ECHO) 'author:' >> META_new.yml $(NOECHO) $(ECHO) ' - '\''Perl 5 Porters'\''' >> META_new.yml $(NOECHO) $(ECHO) 'build_requires:' >> META_new.yml $(NOECHO) $(ECHO) ' ExtUtils::MakeMaker: '\''6.31'\''' >> META_new.yml $(NOECHO) $(ECHO) ' Test::More: '\''0.41'\''' >> META_new.yml $(NOECHO) $(ECHO) 'configure_requires:' >> META_new.yml $(NOECHO) $(ECHO) ' ExtUtils::MakeMaker: '\''6.31'\''' >> META_new.yml $(NOECHO) $(ECHO) 'dynamic_config: 1' >> META_new.yml $(NOECHO) $(ECHO) 'generated_by: '\''ExtUtils::MakeMaker version 7.60, CPAN::Meta::Converter version 2.150010'\''' >> META_new.yml $(NOECHO) $(ECHO) 'license: perl' >> META_new.yml $(NOECHO) $(ECHO) 'meta-spec:' >> META_new.yml $(NOECHO) $(ECHO) ' url: http://module-build.sourceforge.net/META-spec-v1.4.html' >> META_new.yml $(NOECHO) $(ECHO) ' version: '\''1.4'\''' >> META_new.yml $(NOECHO) $(ECHO) 'name: Storable' >> META_new.yml $(NOECHO) $(ECHO) 'no_index:' >> META_new.yml $(NOECHO) $(ECHO) ' directory:' >> META_new.yml $(NOECHO) $(ECHO) ' - t' >> META_new.yml $(NOECHO) $(ECHO) ' - inc' >> META_new.yml $(NOECHO) $(ECHO) 'provides:' >> META_new.yml $(NOECHO) $(ECHO) ' Storable:' >> META_new.yml $(NOECHO) $(ECHO) ' file: Storable.pm' >> META_new.yml $(NOECHO) $(ECHO) ' version: '\''3.25'\''' >> META_new.yml $(NOECHO) $(ECHO) 'requires:' >> META_new.yml $(NOECHO) $(ECHO) ' XSLoader: '\''0'\''' >> META_new.yml $(NOECHO) $(ECHO) 'resources:' >> META_new.yml $(NOECHO) $(ECHO) ' bugtracker: https://github.com/Perl/perl5/issues' >> META_new.yml $(NOECHO) $(ECHO) 'version: '\''3.25'\''' >> META_new.yml $(NOECHO) $(ECHO) 'x_serialization_backend: '\''CPAN::Meta::YAML version 0.018'\''' >> META_new.yml -$(NOECHO) $(MV) META_new.yml $(DISTVNAME)/META.yml $(NOECHO) $(ECHO) Generating META.json $(NOECHO) $(ECHO) '{' > META_new.json $(NOECHO) $(ECHO) ' "abstract" : "persistence for Perl data structures",' >> META_new.json $(NOECHO) $(ECHO) ' "author" : [' >> META_new.json $(NOECHO) $(ECHO) ' "Perl 5 Porters"' >> META_new.json $(NOECHO) $(ECHO) ' ],' >> META_new.json $(NOECHO) $(ECHO) ' "dynamic_config" : 1,' >> META_new.json $(NOECHO) $(ECHO) ' "generated_by" : "ExtUtils::MakeMaker version 7.60, CPAN::Meta::Converter version 2.150010",' >> META_new.json $(NOECHO) $(ECHO) ' "license" : [' >> META_new.json $(NOECHO) $(ECHO) ' "perl_5"' >> META_new.json $(NOECHO) $(ECHO) ' ],' >> META_new.json $(NOECHO) $(ECHO) ' "meta-spec" : {' >> META_new.json $(NOECHO) $(ECHO) ' "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec",' >> META_new.json $(NOECHO) $(ECHO) ' "version" : 2' >> META_new.json $(NOECHO) $(ECHO) ' },' >> META_new.json $(NOECHO) $(ECHO) ' "name" : "Storable",' >> META_new.json $(NOECHO) $(ECHO) ' "no_index" : {' >> META_new.json $(NOECHO) $(ECHO) ' "directory" : [' >> META_new.json $(NOECHO) $(ECHO) ' "t",' >> META_new.json $(NOECHO) $(ECHO) ' "inc"' >> META_new.json $(NOECHO) $(ECHO) ' ]' >> META_new.json $(NOECHO) $(ECHO) ' },' >> META_new.json $(NOECHO) $(ECHO) ' "prereqs" : {' >> META_new.json $(NOECHO) $(ECHO) ' "build" : {' >> META_new.json $(NOECHO) $(ECHO) ' "requires" : {' >> META_new.json $(NOECHO) $(ECHO) ' "ExtUtils::MakeMaker" : "6.31"' >> META_new.json $(NOECHO) $(ECHO) ' }' >> META_new.json $(NOECHO) $(ECHO) ' },' >> META_new.json $(NOECHO) $(ECHO) ' "configure" : {' >> META_new.json $(NOECHO) $(ECHO) ' "requires" : {' >> META_new.json $(NOECHO) $(ECHO) ' "ExtUtils::MakeMaker" : "6.31"' >> META_new.json $(NOECHO) $(ECHO) ' }' >> META_new.json $(NOECHO) $(ECHO) ' },' >> META_new.json $(NOECHO) $(ECHO) ' "runtime" : {' >> META_new.json $(NOECHO) $(ECHO) ' "requires" : {' >> META_new.json $(NOECHO) $(ECHO) ' "XSLoader" : "0"' >> META_new.json $(NOECHO) $(ECHO) ' }' >> META_new.json $(NOECHO) $(ECHO) ' },' >> META_new.json $(NOECHO) $(ECHO) ' "test" : {' >> META_new.json $(NOECHO) $(ECHO) ' "requires" : {' >> META_new.json $(NOECHO) $(ECHO) ' "Test::More" : "0.41"' >> META_new.json $(NOECHO) $(ECHO) ' }' >> META_new.json $(NOECHO) $(ECHO) ' }' >> META_new.json $(NOECHO) $(ECHO) ' },' >> META_new.json $(NOECHO) $(ECHO) ' "provides" : {' >> META_new.json $(NOECHO) $(ECHO) ' "Storable" : {' >> META_new.json $(NOECHO) $(ECHO) ' "file" : "Storable.pm",' >> META_new.json $(NOECHO) $(ECHO) ' "version" : "3.25"' >> META_new.json $(NOECHO) $(ECHO) ' }' >> META_new.json $(NOECHO) $(ECHO) ' },' >> META_new.json $(NOECHO) $(ECHO) ' "release_status" : "stable",' >> META_new.json $(NOECHO) $(ECHO) ' "resources" : {' >> META_new.json $(NOECHO) $(ECHO) ' "bugtracker" : {' >> META_new.json $(NOECHO) $(ECHO) ' "web" : "https://github.com/Perl/perl5/issues"' >> META_new.json $(NOECHO) $(ECHO) ' }' >> META_new.json $(NOECHO) $(ECHO) ' },' >> META_new.json $(NOECHO) $(ECHO) ' "version" : "3.25",' >> META_new.json $(NOECHO) $(ECHO) ' "x_serialization_backend" : "JSON::PP version 4.06"' >> META_new.json $(NOECHO) $(ECHO) '}' >> META_new.json -$(NOECHO) $(MV) META_new.json $(DISTVNAME)/META.json # --- MakeMaker signature section: signature : cpansign -s # --- MakeMaker dist_basics section: distclean :: realclean distcheck $(NOECHO) $(NOOP) distcheck : $(PERLRUN) "-MExtUtils::Manifest=fullcheck" -e fullcheck skipcheck : $(PERLRUN) "-MExtUtils::Manifest=skipcheck" -e skipcheck manifest : $(PERLRUN) "-MExtUtils::Manifest=mkmanifest" -e mkmanifest veryclean : realclean $(RM_F) *~ */*~ *.orig */*.orig *.bak */*.bak *.old */*.old # --- MakeMaker dist_core section: dist : $(DIST_DEFAULT) $(FIRST_MAKEFILE) $(NOECHO) $(ABSPERLRUN) -l -e 'print '\''Warning: Makefile possibly out of date with $(VERSION_FROM)'\''' \ -e ' if -e '\''$(VERSION_FROM)'\'' and -M '\''$(VERSION_FROM)'\'' < -M '\''$(FIRST_MAKEFILE)'\'';' -- tardist : $(DISTVNAME).tar$(SUFFIX) $(NOECHO) $(NOOP) uutardist : $(DISTVNAME).tar$(SUFFIX) uuencode $(DISTVNAME).tar$(SUFFIX) $(DISTVNAME).tar$(SUFFIX) > $(DISTVNAME).tar$(SUFFIX)_uu $(NOECHO) $(ECHO) 'Created $(DISTVNAME).tar$(SUFFIX)_uu' $(DISTVNAME).tar$(SUFFIX) : distdir $(PREOP) $(TO_UNIX) $(TAR) $(TARFLAGS) $(DISTVNAME).tar $(DISTVNAME) $(RM_RF) $(DISTVNAME) $(COMPRESS) $(DISTVNAME).tar $(NOECHO) $(ECHO) 'Created $(DISTVNAME).tar$(SUFFIX)' $(POSTOP) zipdist : $(DISTVNAME).zip $(NOECHO) $(NOOP) $(DISTVNAME).zip : distdir $(PREOP) $(ZIP) $(ZIPFLAGS) $(DISTVNAME).zip $(DISTVNAME) $(RM_RF) $(DISTVNAME) $(NOECHO) $(ECHO) 'Created $(DISTVNAME).zip' $(POSTOP) shdist : distdir $(PREOP) $(SHAR) $(DISTVNAME) > $(DISTVNAME).shar $(RM_RF) $(DISTVNAME) $(NOECHO) $(ECHO) 'Created $(DISTVNAME).shar' $(POSTOP) # --- MakeMaker distdir section: create_distdir : $(RM_RF) $(DISTVNAME) $(PERLRUN) "-MExtUtils::Manifest=manicopy,maniread" \ -e "manicopy(maniread(),'$(DISTVNAME)', '$(DIST_CP)');" distdir : create_distdir distmeta $(NOECHO) $(NOOP) # --- MakeMaker dist_test section: disttest : distdir cd $(DISTVNAME) && $(ABSPERLRUN) Makefile.PL cd $(DISTVNAME) && $(MAKE) $(PASTHRU) cd $(DISTVNAME) && $(MAKE) test $(PASTHRU) # --- MakeMaker dist_ci section: ci : $(ABSPERLRUN) -MExtUtils::Manifest=maniread -e '@all = sort keys %{ maniread() };' \ -e 'print(qq{Executing $(CI) @all\n});' \ -e 'system(qq{$(CI) @all}) == 0 or die $$!;' \ -e 'print(qq{Executing $(RCS_LABEL) ...\n});' \ -e 'system(qq{$(RCS_LABEL) @all}) == 0 or die $$!;' -- # --- MakeMaker distmeta section: distmeta : create_distdir metafile $(NOECHO) cd $(DISTVNAME) && $(ABSPERLRUN) -MExtUtils::Manifest=maniadd -e 'exit unless -e q{META.yml};' \ -e 'eval { maniadd({q{META.yml} => q{Module YAML meta-data (added by MakeMaker)}}) }' \ -e ' or die "Could not add META.yml to MANIFEST: $${'\''@'\''}"' -- $(NOECHO) cd $(DISTVNAME) && $(ABSPERLRUN) -MExtUtils::Manifest=maniadd -e 'exit unless -f q{META.json};' \ -e 'eval { maniadd({q{META.json} => q{Module JSON meta-data (added by MakeMaker)}}) }' \ -e ' or die "Could not add META.json to MANIFEST: $${'\''@'\''}"' -- # --- MakeMaker distsignature section: distsignature : distmeta $(NOECHO) cd $(DISTVNAME) && $(ABSPERLRUN) -MExtUtils::Manifest=maniadd -e 'eval { maniadd({q{SIGNATURE} => q{Public-key signature (added by MakeMaker)}}) }' \ -e ' or die "Could not add SIGNATURE to MANIFEST: $${'\''@'\''}"' -- $(NOECHO) cd $(DISTVNAME) && $(TOUCH) SIGNATURE cd $(DISTVNAME) && cpansign -s # --- MakeMaker install section: install :: pure_install doc_install $(NOECHO) $(NOOP) install_perl :: pure_perl_install doc_perl_install $(NOECHO) $(NOOP) install_site :: pure_site_install doc_site_install $(NOECHO) $(NOOP) install_vendor :: pure_vendor_install doc_vendor_install $(NOECHO) $(NOOP) pure_install :: pure_$(INSTALLDIRS)_install $(NOECHO) $(NOOP) doc_install :: doc_$(INSTALLDIRS)_install $(NOECHO) $(NOOP) pure__install : pure_site_install $(NOECHO) $(ECHO) INSTALLDIRS not defined, defaulting to INSTALLDIRS=site doc__install : doc_site_install $(NOECHO) $(ECHO) INSTALLDIRS not defined, defaulting to INSTALLDIRS=site pure_perl_install :: all $(NOECHO) $(MOD_INSTALL) \ read "$(PERL_ARCHLIB)/auto/$(FULLEXT)/.packlist" \ write "$(DESTINSTALLARCHLIB)/auto/$(FULLEXT)/.packlist" \ "$(INST_LIB)" "$(DESTINSTALLPRIVLIB)" \ "$(INST_ARCHLIB)" "$(DESTINSTALLARCHLIB)" \ "$(INST_BIN)" "$(DESTINSTALLBIN)" \ "$(INST_SCRIPT)" "$(DESTINSTALLSCRIPT)" \ "$(INST_MAN1DIR)" "$(DESTINSTALLMAN1DIR)" \ "$(INST_MAN3DIR)" "$(DESTINSTALLMAN3DIR)" $(NOECHO) $(WARN_IF_OLD_PACKLIST) \ "$(SITEARCHEXP)/auto/$(FULLEXT)" pure_site_install :: all $(NOECHO) $(MOD_INSTALL) \ read "$(SITEARCHEXP)/auto/$(FULLEXT)/.packlist" \ write "$(DESTINSTALLSITEARCH)/auto/$(FULLEXT)/.packlist" \ "$(INST_LIB)" "$(DESTINSTALLSITELIB)" \ "$(INST_ARCHLIB)" "$(DESTINSTALLSITEARCH)" \ "$(INST_BIN)" "$(DESTINSTALLSITEBIN)" \ "$(INST_SCRIPT)" "$(DESTINSTALLSITESCRIPT)" \ "$(INST_MAN1DIR)" "$(DESTINSTALLSITEMAN1DIR)" \ "$(INST_MAN3DIR)" "$(DESTINSTALLSITEMAN3DIR)" $(NOECHO) $(WARN_IF_OLD_PACKLIST) \ "$(PERL_ARCHLIB)/auto/$(FULLEXT)" pure_vendor_install :: all $(NOECHO) $(MOD_INSTALL) \ read "$(VENDORARCHEXP)/auto/$(FULLEXT)/.packlist" \ write "$(DESTINSTALLVENDORARCH)/auto/$(FULLEXT)/.packlist" \ "$(INST_LIB)" "$(DESTINSTALLVENDORLIB)" \ "$(INST_ARCHLIB)" "$(DESTINSTALLVENDORARCH)" \ "$(INST_BIN)" "$(DESTINSTALLVENDORBIN)" \ "$(INST_SCRIPT)" "$(DESTINSTALLVENDORSCRIPT)" \ "$(INST_MAN1DIR)" "$(DESTINSTALLVENDORMAN1DIR)" \ "$(INST_MAN3DIR)" "$(DESTINSTALLVENDORMAN3DIR)" doc_perl_install :: all $(NOECHO) $(ECHO) Appending installation info to "$(DESTINSTALLARCHLIB)/perllocal.pod" -$(NOECHO) $(MKPATH) "$(DESTINSTALLARCHLIB)" -$(NOECHO) $(DOC_INSTALL) \ "Module" "$(NAME)" \ "installed into" "$(INSTALLPRIVLIB)" \ LINKTYPE "$(LINKTYPE)" \ VERSION "$(VERSION)" \ EXE_FILES "$(EXE_FILES)" \ >> "$(DESTINSTALLARCHLIB)/perllocal.pod" doc_site_install :: all $(NOECHO) $(ECHO) Appending installation info to "$(DESTINSTALLARCHLIB)/perllocal.pod" -$(NOECHO) $(MKPATH) "$(DESTINSTALLARCHLIB)" -$(NOECHO) $(DOC_INSTALL) \ "Module" "$(NAME)" \ "installed into" "$(INSTALLSITELIB)" \ LINKTYPE "$(LINKTYPE)" \ VERSION "$(VERSION)" \ EXE_FILES "$(EXE_FILES)" \ >> "$(DESTINSTALLARCHLIB)/perllocal.pod" doc_vendor_install :: all $(NOECHO) $(ECHO) Appending installation info to "$(DESTINSTALLARCHLIB)/perllocal.pod" -$(NOECHO) $(MKPATH) "$(DESTINSTALLARCHLIB)" -$(NOECHO) $(DOC_INSTALL) \ "Module" "$(NAME)" \ "installed into" "$(INSTALLVENDORLIB)" \ LINKTYPE "$(LINKTYPE)" \ VERSION "$(VERSION)" \ EXE_FILES "$(EXE_FILES)" \ >> "$(DESTINSTALLARCHLIB)/perllocal.pod" uninstall :: uninstall_from_$(INSTALLDIRS)dirs $(NOECHO) $(NOOP) uninstall_from_perldirs :: $(NOECHO) $(UNINSTALL) "$(PERL_ARCHLIB)/auto/$(FULLEXT)/.packlist" uninstall_from_sitedirs :: $(NOECHO) $(UNINSTALL) "$(SITEARCHEXP)/auto/$(FULLEXT)/.packlist" uninstall_from_vendordirs :: $(NOECHO) $(UNINSTALL) "$(VENDORARCHEXP)/auto/$(FULLEXT)/.packlist" # --- MakeMaker force section: # Phony target to force checking subdirectories. FORCE : $(NOECHO) $(NOOP) # --- MakeMaker perldepend section: PERL_HDRS = \ $(PERL_INCDEP)/EXTERN.h \ $(PERL_INCDEP)/INTERN.h \ $(PERL_INCDEP)/XSUB.h \ $(PERL_INCDEP)/av.h \ $(PERL_INCDEP)/bitcount.h \ $(PERL_INCDEP)/charclass_invlists.h \ $(PERL_INCDEP)/config.h \ $(PERL_INCDEP)/cop.h \ $(PERL_INCDEP)/cv.h \ $(PERL_INCDEP)/dosish.h \ $(PERL_INCDEP)/ebcdic_tables.h \ $(PERL_INCDEP)/embed.h \ $(PERL_INCDEP)/embedvar.h \ $(PERL_INCDEP)/fakesdio.h \ $(PERL_INCDEP)/feature.h \ $(PERL_INCDEP)/form.h \ $(PERL_INCDEP)/git_version.h \ $(PERL_INCDEP)/gv.h \ $(PERL_INCDEP)/handy.h \ $(PERL_INCDEP)/hv.h \ $(PERL_INCDEP)/hv_func.h \ $(PERL_INCDEP)/hv_macro.h \ $(PERL_INCDEP)/inline.h \ $(PERL_INCDEP)/intrpvar.h \ $(PERL_INCDEP)/invlist_inline.h \ $(PERL_INCDEP)/iperlsys.h \ $(PERL_INCDEP)/keywords.h \ $(PERL_INCDEP)/l1_char_class_tab.h \ $(PERL_INCDEP)/malloc_ctl.h \ $(PERL_INCDEP)/metaconfig.h \ $(PERL_INCDEP)/mg.h \ $(PERL_INCDEP)/mg_data.h \ $(PERL_INCDEP)/mg_raw.h \ $(PERL_INCDEP)/mg_vtable.h \ $(PERL_INCDEP)/mydtrace.h \ $(PERL_INCDEP)/nostdio.h \ $(PERL_INCDEP)/op.h \ $(PERL_INCDEP)/op_reg_common.h \ $(PERL_INCDEP)/opcode.h \ $(PERL_INCDEP)/opnames.h \ $(PERL_INCDEP)/overload.h \ $(PERL_INCDEP)/pad.h \ $(PERL_INCDEP)/parser.h \ $(PERL_INCDEP)/patchlevel.h \ $(PERL_INCDEP)/perl.h \ $(PERL_INCDEP)/perl_inc_macro.h \ $(PERL_INCDEP)/perl_langinfo.h \ $(PERL_INCDEP)/perlapi.h \ $(PERL_INCDEP)/perldtrace.h \ $(PERL_INCDEP)/perlio.h \ $(PERL_INCDEP)/perliol.h \ $(PERL_INCDEP)/perlsdio.h \ $(PERL_INCDEP)/perlvars.h \ $(PERL_INCDEP)/perly.h \ $(PERL_INCDEP)/pp.h \ $(PERL_INCDEP)/pp_proto.h \ $(PERL_INCDEP)/proto.h \ $(PERL_INCDEP)/reentr.h \ $(PERL_INCDEP)/regcharclass.h \ $(PERL_INCDEP)/regcomp.h \ $(PERL_INCDEP)/regexp.h \ $(PERL_INCDEP)/regnodes.h \ $(PERL_INCDEP)/sbox32_hash.h \ $(PERL_INCDEP)/scope.h \ $(PERL_INCDEP)/stadtx_hash.h \ $(PERL_INCDEP)/sv.h \ $(PERL_INCDEP)/thread.h \ $(PERL_INCDEP)/time64.h \ $(PERL_INCDEP)/time64_config.h \ $(PERL_INCDEP)/uconfig.h \ $(PERL_INCDEP)/uni_keywords.h \ $(PERL_INCDEP)/unicode_constants.h \ $(PERL_INCDEP)/unixish.h \ $(PERL_INCDEP)/utf8.h \ $(PERL_INCDEP)/utfebcdic.h \ $(PERL_INCDEP)/util.h \ $(PERL_INCDEP)/uudmap.h \ $(PERL_INCDEP)/vutil.h \ $(PERL_INCDEP)/warnings.h \ $(PERL_INCDEP)/zaphod32_hash.h $(OBJECT) : $(PERL_HDRS) Storable.c : $(XSUBPPDEPS) # --- MakeMaker makefile section: $(OBJECT) : $(FIRST_MAKEFILE) # We take a very conservative approach here, but it's worth it. # We move Makefile to Makefile.old here to avoid gnu make looping. $(FIRST_MAKEFILE) : Makefile.PL $(CONFIGDEP) $(NOECHO) $(ECHO) "Makefile out-of-date with respect to $?" $(NOECHO) $(ECHO) "Cleaning current config before rebuilding Makefile..." -$(NOECHO) $(RM_F) $(MAKEFILE_OLD) -$(NOECHO) $(MV) $(FIRST_MAKEFILE) $(MAKEFILE_OLD) - $(MAKE) $(USEMAKEFILE) $(MAKEFILE_OLD) clean $(DEV_NULL) $(PERLRUN) Makefile.PL $(NOECHO) $(ECHO) "==> Your Makefile has been rebuilt. <==" $(NOECHO) $(ECHO) "==> Please rerun the $(MAKE) command. <==" $(FALSE) # --- MakeMaker staticmake section: # --- MakeMaker makeaperl section --- MAP_TARGET = perl FULLPERL = "/usr/bin/perl" MAP_PERLINC = "-Iblib/arch" "-Iblib/lib" "-I/usr/lib64/perl5" "-I/usr/share/perl5" $(MAP_TARGET) :: $(MAKE_APERL_FILE) $(MAKE) $(USEMAKEFILE) $(MAKE_APERL_FILE) $@ $(MAKE_APERL_FILE) : static $(FIRST_MAKEFILE) pm_to_blib $(NOECHO) $(ECHO) Writing \"$(MAKE_APERL_FILE)\" for this $(MAP_TARGET) $(NOECHO) $(PERLRUNINST) \ Makefile.PL DIR="" \ MAKEFILE=$(MAKE_APERL_FILE) LINKTYPE=static \ MAKEAPERL=1 NORECURS=1 CCCDLFLAGS= # --- MakeMaker test section: TEST_VERBOSE=0 TEST_TYPE=test_$(LINKTYPE) TEST_FILE = test.pl TEST_FILES = t/*.t TESTDB_SW = -d testdb :: testdb_$(LINKTYPE) $(NOECHO) $(NOOP) test :: $(TEST_TYPE) $(NOECHO) $(NOOP) # Occasionally we may face this degenerate target: test_ : test_dynamic $(NOECHO) $(NOOP) subdirs-test_dynamic :: dynamic pure_all test_dynamic :: subdirs-test_dynamic PERL_DL_NONLAZY=1 $(FULLPERLRUN) "-MExtUtils::Command::MM" "-MTest::Harness" "-e" "undef *Test::Harness::Switches; test_harness($(TEST_VERBOSE), '$(INST_LIB)', '$(INST_ARCHLIB)')" $(TEST_FILES) testdb_dynamic :: dynamic pure_all PERL_DL_NONLAZY=1 $(FULLPERLRUN) $(TESTDB_SW) "-I$(INST_LIB)" "-I$(INST_ARCHLIB)" $(TEST_FILE) subdirs-test_static :: static pure_all test_static :: subdirs-test_static $(MAP_TARGET) PERL_DL_NONLAZY=1 "/home/.cpan/build/Storable-3.25-0/$(MAP_TARGET)" $(MAP_PERLINC) "-MExtUtils::Command::MM" "-MTest::Harness" "-e" "undef *Test::Harness::Switches; test_harness($(TEST_VERBOSE), '$(INST_LIB)', '$(INST_ARCHLIB)')" $(TEST_FILES) testdb_static :: static pure_all $(MAP_TARGET) PERL_DL_NONLAZY=1 "/home/.cpan/build/Storable-3.25-0/$(MAP_TARGET)" $(MAP_PERLINC) "-I$(INST_LIB)" "-I$(INST_ARCHLIB)" $(TEST_FILE) # --- MakeMaker ppd section: # Creates a PPD (Perl Package Description) for a binary distribution. ppd : $(NOECHO) $(ECHO) '<SOFTPKG NAME="Storable" VERSION="3.25">' > Storable.ppd $(NOECHO) $(ECHO) ' <ABSTRACT>persistence for Perl data structures</ABSTRACT>' >> Storable.ppd $(NOECHO) $(ECHO) ' <AUTHOR>Perl 5 Porters</AUTHOR>' >> Storable.ppd $(NOECHO) $(ECHO) ' <IMPLEMENTATION>' >> Storable.ppd $(NOECHO) $(ECHO) ' <REQUIRE NAME="XSLoader::" />' >> Storable.ppd $(NOECHO) $(ECHO) ' <ARCHITECTURE NAME="x86_64-linux-thread-multi-5.32" />' >> Storable.ppd $(NOECHO) $(ECHO) ' <CODEBASE HREF="" />' >> Storable.ppd $(NOECHO) $(ECHO) ' </IMPLEMENTATION>' >> Storable.ppd $(NOECHO) $(ECHO) '</SOFTPKG>' >> Storable.ppd # --- MakeMaker pm_to_blib section: pm_to_blib : $(FIRST_MAKEFILE) $(TO_INST_PM) $(NOECHO) $(ABSPERLRUN) -MExtUtils::Install -e 'pm_to_blib({@ARGV}, '\''$(INST_LIB)/auto'\'', q[$(PM_FILTER)], '\''$(PERM_DIR)'\'')' -- \ 'Storable.pm' '$(INST_LIB)/Storable.pm' $(NOECHO) $(TOUCH) pm_to_blib # --- MakeMaker selfdocument section: # here so even if top_targets is overridden, these will still be defined # gmake will silently still work if any are .PHONY-ed but nmake won't static :: $(NOECHO) $(NOOP) dynamic :: $(NOECHO) $(NOOP) config :: $(NOECHO) $(NOOP) # --- MakeMaker postamble section: # End. PK ��[߿� � META.jsonnu �[��� { "abstract" : "persistence for Perl data structures", "author" : [ "Perl 5 Porters" ], "dynamic_config" : 1, "generated_by" : "ExtUtils::MakeMaker version 7.62, CPAN::Meta::Converter version 2.150010", "license" : [ "perl_5" ], "meta-spec" : { "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec", "version" : 2 }, "name" : "Storable", "no_index" : { "directory" : [ "t", "inc" ] }, "prereqs" : { "build" : { "requires" : { "ExtUtils::MakeMaker" : "6.31" } }, "configure" : { "requires" : { "ExtUtils::MakeMaker" : "6.31" } }, "runtime" : { "requires" : { "XSLoader" : "0" } }, "test" : { "requires" : { "Test::More" : "0.41" } } }, "provides" : { "Storable" : { "file" : "Storable.pm", "version" : "3.25" } }, "release_status" : "stable", "resources" : { "bugtracker" : { "web" : "https://github.com/Perl/perl5/issues" } }, "version" : "3.25", "x_serialization_backend" : "JSON::PP version 4.06" } PK ��[�3o֊M �M ppport.hnu �[��� #if 0 my $void = <<'SKIP'; #endif /* ---------------------------------------------------------------------- ppport.h -- Perl/Pollution/Portability Version 3.63 Automatically created by Devel::PPPort running under perl 5.035004. Do NOT edit this file directly! -- Edit PPPort_pm.PL and the includes in parts/inc/ instead. Use 'perldoc ppport.h' to view the documentation below. ---------------------------------------------------------------------- SKIP =pod =head1 NAME ppport.h - Perl/Pollution/Portability version 3.63 =head1 SYNOPSIS perl ppport.h [options] [source files] Searches current directory for files if no [source files] are given --help show short help --version show version --patch=file write one patch file with changes --copy=suffix write changed copies with suffix --diff=program use diff program and options --compat-version=version provide compatibility with Perl version --cplusplus accept C++ comments --quiet don't output anything except fatal errors --nodiag don't show diagnostics --nohints don't show hints --nochanges don't suggest changes --nofilter don't filter input files --strip strip all script and doc functionality from ppport.h --list-provided list provided API --list-unsupported list API that isn't supported all the way back --api-info=name show Perl API portability information =head1 COMPATIBILITY This version of F<ppport.h> is designed to support operation with Perl installations back to 5.003_07, and has been tested up to 5.35.1. =head1 OPTIONS =head2 --help Display a brief usage summary. =head2 --version Display the version of F<ppport.h>. =head2 --patch=I<file> If this option is given, a single patch file will be created if any changes are suggested. This requires a working diff program to be installed on your system. =head2 --copy=I<suffix> If this option is given, a copy of each file will be saved with the given suffix that contains the suggested changes. This does not require any external programs. Note that this does not automagically add a dot between the original filename and the suffix. If you want the dot, you have to include it in the option argument. If neither C<--patch> or C<--copy> are given, the default is to simply print the diffs for each file. This requires either C<Text::Diff> or a C<diff> program to be installed. =head2 --diff=I<program> Manually set the diff program and options to use. The default is to use C<Text::Diff>, when installed, and output unified context diffs. =head2 --compat-version=I<version> Tell F<ppport.h> to check for compatibility with the given Perl version. The default is to check for compatibility with Perl version 5.003_07. You can use this option to reduce the output of F<ppport.h> if you intend to be backward compatible only down to a certain Perl version. =head2 --cplusplus Usually, F<ppport.h> will detect C++ style comments and replace them with C style comments for portability reasons. Using this option instructs F<ppport.h> to leave C++ comments untouched. =head2 --quiet Be quiet. Don't print anything except fatal errors. =head2 --nodiag Don't output any diagnostic messages. Only portability alerts will be printed. =head2 --nohints Don't output any hints. Hints often contain useful portability notes. Warnings will still be displayed. =head2 --nochanges Don't suggest any changes. Only give diagnostic output and hints unless these are also deactivated. =head2 --nofilter Don't filter the list of input files. By default, files not looking like source code (i.e. not *.xs, *.c, *.cc, *.cpp or *.h) are skipped. =head2 --strip Strip all script and documentation functionality from F<ppport.h>. This reduces the size of F<ppport.h> dramatically and may be useful if you want to include F<ppport.h> in smaller modules without increasing their distribution size too much. The stripped F<ppport.h> will have a C<--unstrip> option that allows you to undo the stripping, but only if an appropriate C<Devel::PPPort> module is installed. =head2 --list-provided Lists the API elements for which compatibility is provided by F<ppport.h>. Also lists if it must be explicitly requested, if it has dependencies, and if there are hints or warnings for it. =head2 --list-unsupported Lists the API elements that are known not to be FULLY supported by F<ppport.h>, and below which version of Perl they probably won't be available or work. By FULLY, we mean that support isn't provided all the way back to the first version of Perl that F<ppport.h> supports at all. =head2 --api-info=I<name> Show portability information for elements matching I<name>. If I<name> is surrounded by slashes, it is interpreted as a regular expression. Normally, only API elements are shown, but if there are no matching API elements but there are some other matching elements, those are shown. This allows you to conveniently find when functions internal to the core implementation were added; only people working on the core are likely to find this last part useful. =head1 DESCRIPTION In order for a Perl extension (XS) module to be as portable as possible across differing versions of Perl itself, certain steps need to be taken. =over 4 =item * Including this header is the first major one. This alone will give you access to a large part of the Perl API that hasn't been available in earlier Perl releases. Use perl ppport.h --list-provided to see which API elements are provided by ppport.h. =item * You should avoid using deprecated parts of the API. For example, using global Perl variables without the C<PL_> prefix is deprecated. Also, some API functions used to have a C<perl_> prefix. Using this form is also deprecated. You can safely use the supported API, as F<ppport.h> will provide wrappers for older Perl versions. =item * Although the purpose of F<ppport.h> is to keep you from having to concern yourself with what version you are running under, there may arise instances where you have to do so. These macros, the same ones as in base Perl, are available to you in all versions, and are what you should use: =over 4 =item C<PERL_VERSION_I<xx>(major, minor, patch)> Returns whether or not the perl currently being compiled has the specified relationship I<xx> to the perl given by the parameters. I<xx> is one of C<EQ>, C<NE>, C<LT>, C<LE>, C<GT>, C<GE>. For example, #if PERL_VERSION_GT(5,24,2) code that will only be compiled on perls after v5.24.2 #else fallback code #endif Note that this is usable in making compile-time decisions You may use the special value '*' for the final number to mean ALL possible values for it. Thus, #if PERL_VERSION_EQ(5,31,'*') means all perls in the 5.31 series. And #if PERL_VERSION_NE(5,24,'*') means all perls EXCEPT 5.24 ones. And #if PERL_VERSION_LE(5,9,'*') is effectively #if PERL_VERSION_LT(5,10,0) =back =item * If you use one of a few functions or variables that were not present in earlier versions of Perl, and that can't be provided using a macro, you have to explicitly request support for these functions by adding one or more C<#define>s in your source code before the inclusion of F<ppport.h>. These functions or variables will be marked C<explicit> in the list shown by C<--list-provided>. Depending on whether you module has a single or multiple files that use such functions or variables, you want either C<static> or global variants. For a C<static> function or variable (used only in a single source file), use: #define NEED_function #define NEED_variable For a global function or variable (used in multiple source files), use: #define NEED_function_GLOBAL #define NEED_variable_GLOBAL Note that you mustn't have more than one global request for the same function or variable in your project. Function / Variable Static Request Global Request ----------------------------------------------------------------------------------------- caller_cx() NEED_caller_cx NEED_caller_cx_GLOBAL ck_warner() NEED_ck_warner NEED_ck_warner_GLOBAL ck_warner_d() NEED_ck_warner_d NEED_ck_warner_d_GLOBAL croak_xs_usage() NEED_croak_xs_usage NEED_croak_xs_usage_GLOBAL die_sv() NEED_die_sv NEED_die_sv_GLOBAL eval_pv() NEED_eval_pv NEED_eval_pv_GLOBAL grok_bin() NEED_grok_bin NEED_grok_bin_GLOBAL grok_hex() NEED_grok_hex NEED_grok_hex_GLOBAL grok_number() NEED_grok_number NEED_grok_number_GLOBAL grok_numeric_radix() NEED_grok_numeric_radix NEED_grok_numeric_radix_GLOBAL grok_oct() NEED_grok_oct NEED_grok_oct_GLOBAL load_module() NEED_load_module NEED_load_module_GLOBAL mess() NEED_mess NEED_mess_GLOBAL mess_nocontext() NEED_mess_nocontext NEED_mess_nocontext_GLOBAL mess_sv() NEED_mess_sv NEED_mess_sv_GLOBAL mg_findext() NEED_mg_findext NEED_mg_findext_GLOBAL my_snprintf() NEED_my_snprintf NEED_my_snprintf_GLOBAL my_sprintf() NEED_my_sprintf NEED_my_sprintf_GLOBAL my_strlcat() NEED_my_strlcat NEED_my_strlcat_GLOBAL my_strlcpy() NEED_my_strlcpy NEED_my_strlcpy_GLOBAL my_strnlen() NEED_my_strnlen NEED_my_strnlen_GLOBAL newCONSTSUB() NEED_newCONSTSUB NEED_newCONSTSUB_GLOBAL newSVpvn_share() NEED_newSVpvn_share NEED_newSVpvn_share_GLOBAL PL_parser NEED_PL_parser NEED_PL_parser_GLOBAL PL_signals NEED_PL_signals NEED_PL_signals_GLOBAL pv_display() NEED_pv_display NEED_pv_display_GLOBAL pv_escape() NEED_pv_escape NEED_pv_escape_GLOBAL pv_pretty() NEED_pv_pretty NEED_pv_pretty_GLOBAL sv_catpvf_mg() NEED_sv_catpvf_mg NEED_sv_catpvf_mg_GLOBAL sv_catpvf_mg_nocontext() NEED_sv_catpvf_mg_nocontext NEED_sv_catpvf_mg_nocontext_GLOBAL sv_setpvf_mg() NEED_sv_setpvf_mg NEED_sv_setpvf_mg_GLOBAL sv_setpvf_mg_nocontext() NEED_sv_setpvf_mg_nocontext NEED_sv_setpvf_mg_nocontext_GLOBAL sv_unmagicext() NEED_sv_unmagicext NEED_sv_unmagicext_GLOBAL utf8_to_uvchr_buf() NEED_utf8_to_uvchr_buf NEED_utf8_to_uvchr_buf_GLOBAL vload_module() NEED_vload_module NEED_vload_module_GLOBAL vmess() NEED_vmess NEED_vmess_GLOBAL warner() NEED_warner NEED_warner_GLOBAL To avoid namespace conflicts, you can change the namespace of the explicitly exported functions / variables using the C<DPPP_NAMESPACE> macro. Just C<#define> the macro before including C<ppport.h>: #define DPPP_NAMESPACE MyOwnNamespace_ #include "ppport.h" The default namespace is C<DPPP_>. =back The good thing is that most of the above can be checked by running F<ppport.h> on your source code. See the next section for details. =head1 EXAMPLES To verify whether F<ppport.h> is needed for your module, whether you should make any changes to your code, and whether any special defines should be used, F<ppport.h> can be run as a Perl script to check your source code. Simply say: perl ppport.h The result will usually be a list of patches suggesting changes that should at least be acceptable, if not necessarily the most efficient solution, or a fix for all possible problems. If you know that your XS module uses features only available in newer Perl releases, if you're aware that it uses C++ comments, and if you want all suggestions as a single patch file, you could use something like this: perl ppport.h --compat-version=5.6.0 --cplusplus --patch=test.diff If you only want your code to be scanned without any suggestions for changes, use: perl ppport.h --nochanges You can specify a different C<diff> program or options, using the C<--diff> option: perl ppport.h --diff='diff -C 10' This would output context diffs with 10 lines of context. If you want to create patched copies of your files instead, use: perl ppport.h --copy=.new To display portability information for the C<newSVpvn> function, use: perl ppport.h --api-info=newSVpvn Since the argument to C<--api-info> can be a regular expression, you can use perl ppport.h --api-info=/_nomg$/ to display portability information for all C<_nomg> functions or perl ppport.h --api-info=/./ to display information for all known API elements. =head1 BUGS Some of the suggested edits and/or generated patches may not compile as-is without tweaking manually. This is generally due to the need for an extra parameter to be added to the call to prevent buffer overflow. If this version of F<ppport.h> is causing failure during the compilation of this module, please check if newer versions of either this module or C<Devel::PPPort> are available on CPAN before sending a bug report. If F<ppport.h> was generated using the latest version of C<Devel::PPPort> and is causing failure of this module, please file a bug report at L<https://github.com/Dual-Life/Devel-PPPort/issues> Please include the following information: =over 4 =item 1. The complete output from running "perl -V" =item 2. This file. =item 3. The name and version of the module you were trying to build. =item 4. A full log of the build that failed. =item 5. Any other information that you think could be relevant. =back For the latest version of this code, please get the C<Devel::PPPort> module from CPAN. =head1 COPYRIGHT Version 3.x, Copyright (c) 2004-2013, Marcus Holland-Moritz. Version 2.x, Copyright (C) 2001, Paul Marquess. Version 1.x, Copyright (C) 1999, Kenneth Albanowski. This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself. =head1 SEE ALSO See L<Devel::PPPort>. =cut # These are tools that must be included in ppport.h. It doesn't work if given # a .pl suffix. # # WARNING: Use only constructs that are legal as far back as D:P handles, as # this is run in the perl version being tested. # What revisions are legal, to be output as-is and converted into a pattern # that matches them precisely my $r_pat = "[57]"; sub format_version { # Given an input version that is acceptable to parse_version(), return a # string of the standard representation of it. my($r,$v,$s) = parse_version(shift); if ($r < 5 || ($r == 5 && $v < 6)) { my $ver = sprintf "%d.%03d", $r, $v; $s > 0 and $ver .= sprintf "_%02d", $s; return $ver; } return sprintf "%d.%d.%d", $r, $v, $s; } sub parse_version { # Returns a triplet, (revision, major, minor) from the input, treated as a # string, which can be in any of several typical formats. my $ver = shift; $ver = "" unless defined $ver; my($r,$v,$s); if ( ($r, $v, $s) = $ver =~ /^([0-9]+)([0-9]{3})([0-9]{3})$/ # 5029010, from the file # names in our # parts/base/ and # parts/todo directories or ($r, $v, $s) = $ver =~ /^([0-9]+)\.([0-9]+)\.([0-9]+)$/ # 5.25.7 or ($r, $v, $s) = $ver =~ /^([0-9]+)\.([0-9]{3})([0-9]{3})$/ # 5.025008, from the # output of $] or ($r, $v, $s) = $ver =~ /^([0-9]+)\.([0-9]{1,3})()$/ # 5.24, 5.004 or ($r, $v, $s) = $ver =~ /^([0-9]+)\.(00[1-5])_?([0-9]{2})$/ # 5.003_07 ) { $s = 0 unless $s; die "Only Perl $r_pat are supported '$ver'\n" unless $r =~ / ^ $r_pat $ /x; die "Invalid version number: $ver\n" if $v >= 1000 || $s >= 1000; return (0 +$r, 0 + $v, 0 + $s); } # For some safety, don't assume something is a version number if it has a # literal dot as one of the three characters. This will have to be fixed # when we reach x.46 (since 46 is ord('.')) if ($ver !~ /\./ && (($r, $v, $s) = $ver =~ /^(.)(.)(.)$/)) # vstring 5.25.7 { $r = ord $r; $v = ord $v; $s = ord $s; die "Only Perl $r_pat are supported '$ver'\n" unless $r =~ / ^ $r_pat $ /x; return ($r, $v, $s); } my $mesg = ""; $mesg = ". (In 5.00x_yz, x must be 1-5.)" if $ver =~ /_/; die "Invalid version number format: '$ver'$mesg\n"; } sub int_parse_version { # Returns integer 7 digit human-readable version, suitable for use in file # names in parts/todo parts/base. return 0 + join "", map { sprintf("%03d", $_) } parse_version(shift); } sub ivers # Shorter name for int_parse_version { return int_parse_version(shift); } sub format_version_line { # Returns a floating point representation of the input version my $version = int_parse_version(shift); $version =~ s/ ^ ( $r_pat ) \B /$1./x; return $version; } BEGIN { if ("$]" < "5.006" ) { # On early perls, the implicit pass by reference doesn't work, so we have # to use the globals to initialize. eval q[sub dictionary_order($$) { _dictionary_order($a, $b) } ]; } elsif ("$]" < "5.022" ) { eval q[sub dictionary_order($$) { _dictionary_order(@_) } ]; } else { eval q[sub dictionary_order :prototype($$) { _dictionary_order(@_) } ]; } } sub _dictionary_order { # Sort caselessly, ignoring punct my ($valid_a, $valid_b) = @_; my ($lc_a, $lc_b); my ($squeezed_a, $squeezed_b); $valid_a = '' unless defined $valid_a; $valid_b = '' unless defined $valid_b; $lc_a = lc $valid_a; $lc_b = lc $valid_b; $squeezed_a = $lc_a; $squeezed_a =~ s/^_+//g; # No leading underscores $squeezed_a =~ s/\B_+\B//g; # No connecting underscores $squeezed_a =~ s/[\W]//g; # No punct $squeezed_b = $lc_b; $squeezed_b =~ s/^_+//g; $squeezed_b =~ s/\B_+\B//g; $squeezed_b =~ s/[\W]//g; return( $squeezed_a cmp $squeezed_b or $lc_a cmp $lc_b or $valid_a cmp $valid_b); } sub sort_api_lines # Sort lines of the form flags|return|name|args... # by 'name' { $a =~ / ^ [^|]* \| [^|]* \| ( [^|]* ) /x; # 3rd field '|' is sep my $a_name = $1; $b =~ / ^ [^|]* \| [^|]* \| ( [^|]* ) /x; my $b_name = $1; return dictionary_order($a_name, $b_name); } 1; use strict; BEGIN { require warnings if "$]" > '5.006' } # Disable broken TRIE-optimization BEGIN { eval '${^RE_TRIE_MAXBUF} = -1' if "$]" >= "5.009004" && "$]" <= "5.009005"} my $VERSION = 3.63; my %opt = ( quiet => 0, diag => 1, hints => 1, changes => 1, cplusplus => 0, filter => 1, strip => 0, version => 0, ); my($ppport) = $0 =~ /([\w.]+)$/; my $LF = '(?:\r\n|[\r\n])'; # line feed my $HS = "[ \t]"; # horizontal whitespace # Never use C comments in this file! my $ccs = '/'.'*'; my $cce = '*'.'/'; my $rccs = quotemeta $ccs; my $rcce = quotemeta $cce; eval { require Getopt::Long; Getopt::Long::GetOptions(\%opt, qw( help quiet diag! filter! hints! changes! cplusplus strip version patch=s copy=s diff=s compat-version=s list-provided list-unsupported api-info=s )) or usage(); }; if ($@ and grep /^-/, @ARGV) { usage() if "@ARGV" =~ /^--?h(?:elp)?$/; die "Getopt::Long not found. Please don't use any options.\n"; } if ($opt{version}) { print "This is $0 $VERSION.\n"; exit 0; } usage() if $opt{help}; strip() if $opt{strip}; $opt{'compat-version'} = 5.003_07 unless exists $opt{'compat-version'}; $opt{'compat-version'} = int_parse_version($opt{'compat-version'}); my $int_min_perl = int_parse_version(5.003_07); # Each element of this hash looks something like: # 'Poison' => { # 'base' => '5.008000', # 'provided' => 1, # 'todo' => '5.003007' # }, my %API = map { /^(\w+)\|([^|]*)\|([^|]*)\|(\w*)$/ ? ( $1 => { ($2 ? ( base => $2 ) : ()), ($3 ? ( todo => $3 ) : ()), (index($4, 'v') >= 0 ? ( varargs => 1 ) : ()), (index($4, 'p') >= 0 ? ( provided => 1 ) : ()), (index($4, 'n') >= 0 ? ( noTHXarg => 1 ) : ()), (index($4, 'c') >= 0 ? ( core_only => 1 ) : ()), (index($4, 'd') >= 0 ? ( deprecated => 1 ) : ()), (index($4, 'i') >= 0 ? ( inaccessible => 1 ) : ()), (index($4, 'x') >= 0 ? ( experimental => 1 ) : ()), (index($4, 'u') >= 0 ? ( undocumented => 1 ) : ()), (index($4, 'o') >= 0 ? ( ppport_fnc => 1 ) : ()), (index($4, 'V') >= 0 ? ( unverified => 1 ) : ()), } ) : die "invalid spec: $_" } qw( ABDAY_1|5.027010||Viu ABDAY_2|5.027010||Viu ABDAY_3|5.027010||Viu ABDAY_4|5.027010||Viu ABDAY_5|5.027010||Viu ABDAY_6|5.027010||Viu ABDAY_7|5.027010||Viu ABMON_10|5.027010||Viu ABMON_11|5.027010||Viu ABMON_12|5.027010||Viu ABMON_1|5.027010||Viu ABMON_2|5.027010||Viu ABMON_3|5.027010||Viu ABMON_4|5.027010||Viu ABMON_5|5.027010||Viu ABMON_6|5.027010||Viu ABMON_7|5.027010||Viu ABMON_8|5.027010||Viu ABMON_9|5.027010||Viu ABORT|5.003007||Viu abort|5.005000||Viu abort_execution|5.025010||Viu accept|5.005000||Viu ACCEPT|5.009005||Viu ACCEPT_t8_p8|5.033003||Viu ACCEPT_t8_pb|5.033003||Viu ACCEPT_tb_p8|5.033003||Viu ACCEPT_tb_pb|5.033003||Viu access|5.005000||Viu add_above_Latin1_folds|5.021001||Viu add_cp_to_invlist|5.013011||Viu add_data|5.005000||Vniu add_multi_match|5.021004||Viu _add_range_to_invlist|5.016000||cViu add_utf16_textfilter|5.011001||Viu adjust_size_and_find_bucket|5.019003||Vniu advance_one_LB|5.023007||Viu advance_one_SB|5.021009||Viu advance_one_WB|5.021009||Viu AHOCORASICK|5.009005||Viu AHOCORASICKC|5.009005||Viu AHOCORASICKC_t8_p8|5.033003||Viu AHOCORASICKC_t8_pb|5.033003||Viu AHOCORASICKC_tb_p8|5.033003||Viu AHOCORASICKC_tb_pb|5.033003||Viu AHOCORASICK_t8_p8|5.033003||Viu AHOCORASICK_t8_pb|5.033003||Viu AHOCORASICK_tb_p8|5.033003||Viu AHOCORASICK_tb_pb|5.033003||Viu alloccopstash|5.017001|5.017001|x alloc_LOGOP|5.025004||xViu allocmy|5.008001||Viu ALLOC_THREAD_KEY|5.005003||Viu ALT_DIGITS|5.027010||Viu amagic_call|5.003007|5.003007|u amagic_cmp|5.009003||Viu amagic_cmp_desc|5.031011||Viu amagic_cmp_locale|5.009003||Viu amagic_cmp_locale_desc|5.031011||Viu amagic_deref_call|5.013007|5.013007|u amagic_i_ncmp|5.009003||Viu amagic_i_ncmp_desc|5.031011||Viu amagic_is_enabled|5.015008||Viu amagic_ncmp|5.009003||Viu amagic_ncmp_desc|5.031011||Viu AMG_CALLun|5.003007||Viu AMG_CALLunary|5.013009||Viu AMGfallNEVER|5.003007||Viu AMGfallNO|5.003007||Viu AMGfallYES|5.003007||Viu AMGf_assign|5.003007||Viu AMGf_noleft|5.003007||Viu AMGf_noright|5.003007||Viu AMGf_numarg|5.021009||Viu AMGf_numeric|5.013002||Viu AMGf_unary|5.003007||Viu AMGf_want_list|5.017002||Viu AM_STR|5.027010||Viu AMT_AMAGIC|5.004000||Viu AMT_AMAGIC_off|5.004000||Viu AMT_AMAGIC_on|5.004000||Viu AMTf_AMAGIC|5.004000||Viu _aMY_CXT|5.009000|5.009000|p aMY_CXT|5.009000|5.009000|p aMY_CXT_|5.009000|5.009000|p anchored_end_shift|5.009005||Viu anchored_offset|5.005000||Viu anchored_substr|5.005000||Viu anchored_utf8|5.008000||Viu ANGSTROM_SIGN|5.017003||Viu anonymise_cv_maybe|5.013003||Viu any_dup|5.006000||Vu ANYOF|5.003007||Viu ANYOF_ALNUM|5.006000||Viu ANYOF_ALNUML|5.004000||Viu ANYOF_ALPHA|5.006000||Viu ANYOF_ALPHANUMERIC|5.017008||Viu ANYOF_ASCII|5.006000||Viu ANYOF_BIT|5.004005||Viu ANYOF_BITMAP|5.006000||Viu ANYOF_BITMAP_BYTE|5.006000||Viu ANYOF_BITMAP_CLEAR|5.006000||Viu ANYOF_BITMAP_CLEARALL|5.007003||Viu ANYOF_BITMAP_SET|5.006000||Viu ANYOF_BITMAP_SETALL|5.007003||Viu ANYOF_BITMAP_SIZE|5.006000||Viu ANYOF_BITMAP_TEST|5.006000||Viu ANYOF_BITMAP_ZERO|5.006000||Viu ANYOF_BLANK|5.006001||Viu ANYOF_CASED|5.017008||Viu ANYOF_CLASS_OR|5.017007||Viu ANYOF_CLASS_SETALL|5.013011||Viu ANYOF_CLASS_TEST_ANY_SET|5.013008||Viu ANYOF_CNTRL|5.006000||Viu ANYOF_COMMON_FLAGS|5.019008||Viu ANYOFD|5.023003||Viu ANYOF_DIGIT|5.006000||Viu ANYOFD_t8_p8|5.033003||Viu ANYOFD_t8_pb|5.033003||Viu ANYOFD_tb_p8|5.033003||Viu ANYOFD_tb_pb|5.033003||Viu ANYOF_FLAGS|5.006000||Viu ANYOF_FLAGS_ALL|5.006000||Viu ANYOF_GRAPH|5.006000||Viu ANYOFH|5.029007||Viu ANYOFHb|5.031001||Viu ANYOFHb_t8_p8|5.033003||Viu ANYOFHb_t8_pb|5.033003||Viu ANYOFHb_tb_p8|5.033003||Viu ANYOFHb_tb_pb|5.033003||Viu ANYOF_HORIZWS|5.009005||Viu ANYOFHr|5.031002||Viu ANYOFHr_t8_p8|5.033003||Viu ANYOFHr_t8_pb|5.033003||Viu ANYOFHr_tb_p8|5.033003||Viu ANYOFHr_tb_pb|5.033003||Viu ANYOFHs|5.031007||Viu ANYOFHs_t8_p8|5.033003||Viu ANYOFHs_t8_pb|5.033003||Viu ANYOFHs_tb_p8|5.033003||Viu ANYOFHs_tb_pb|5.033003||Viu ANYOFH_t8_p8|5.033003||Viu ANYOFH_t8_pb|5.033003||Viu ANYOFH_tb_p8|5.033003||Viu ANYOFH_tb_pb|5.033003||Viu ANYOF_INVERT|5.004000||Viu ANYOFL|5.021008||Viu ANYOFL_FOLD|5.023007||Viu ANYOF_LOCALE_FLAGS|5.019005||Viu ANYOF_LOWER|5.006000||Viu ANYOFL_SHARED_UTF8_LOCALE_fold_HAS_MATCHES_nonfold_REQD|5.023007||Viu ANYOFL_SOME_FOLDS_ONLY_IN_UTF8_LOCALE|5.023007||Viu ANYOFL_t8_p8|5.033003||Viu ANYOFL_t8_pb|5.033003||Viu ANYOFL_tb_p8|5.033003||Viu ANYOFL_tb_pb|5.033003||Viu ANYOFL_UTF8_LOCALE_REQD|5.023007||Viu ANYOFM|5.027009||Viu ANYOF_MATCHES_ALL_ABOVE_BITMAP|5.021004||Viu ANYOF_MATCHES_POSIXL|5.021004||Viu ANYOF_MAX|5.006000||Viu ANYOFM_t8_p8|5.033003||Viu ANYOFM_t8_pb|5.033003||Viu ANYOFM_tb_p8|5.033003||Viu ANYOFM_tb_pb|5.033003||Viu ANYOF_NALNUM|5.006000||Viu ANYOF_NALNUML|5.004000||Viu ANYOF_NALPHA|5.006000||Viu ANYOF_NALPHANUMERIC|5.017008||Viu ANYOF_NASCII|5.006000||Viu ANYOF_NBLANK|5.006001||Viu ANYOF_NCASED|5.017008||Viu ANYOF_NCNTRL|5.006000||Viu ANYOF_NDIGIT|5.006000||Viu ANYOF_NGRAPH|5.006000||Viu ANYOF_NHORIZWS|5.009005||Viu ANYOF_NLOWER|5.006000||Viu ANYOF_NPRINT|5.006000||Viu ANYOF_NPUNCT|5.006000||Viu ANYOF_NSPACE|5.006000||Viu ANYOF_NSPACEL|5.004000||Viu ANYOF_NUPPER|5.006000||Viu ANYOF_NVERTWS|5.009005||Viu ANYOF_NWORDCHAR|5.017005||Viu ANYOF_NXDIGIT|5.006000||Viu ANYOF_ONLY_HAS_BITMAP|5.021004||Viu ANYOFPOSIXL|5.029004||Viu ANYOF_POSIXL_AND|5.019005||Viu ANYOF_POSIXL_CLEAR|5.019005||Viu ANYOF_POSIXL_MAX|5.019005||Viu ANYOF_POSIXL_OR|5.019005||Viu ANYOF_POSIXL_SET|5.019005||Viu ANYOF_POSIXL_SETALL|5.019005||Viu ANYOF_POSIXL_SET_TO_BITMAP|5.029004||Viu ANYOF_POSIXL_SSC_TEST_ALL_SET|5.019009||Viu ANYOF_POSIXL_SSC_TEST_ANY_SET|5.019009||Viu ANYOFPOSIXL_t8_p8|5.033003||Viu ANYOFPOSIXL_t8_pb|5.033003||Viu ANYOFPOSIXL_tb_p8|5.033003||Viu ANYOFPOSIXL_tb_pb|5.033003||Viu ANYOF_POSIXL_TEST|5.019005||Viu ANYOF_POSIXL_TEST_ALL_SET|5.019005||Viu ANYOF_POSIXL_TEST_ANY_SET|5.019005||Viu ANYOF_POSIXL_ZERO|5.019005||Viu ANYOF_PRINT|5.006000||Viu ANYOF_PUNCT|5.006000||Viu ANYOFR|5.031007||Viu ANYOFRb|5.031007||Viu ANYOFRbase|5.031007||Viu ANYOFR_BASE_BITS|5.031007||Viu ANYOFRb_t8_p8|5.033003||Viu ANYOFRb_t8_pb|5.033003||Viu ANYOFRb_tb_p8|5.033003||Viu ANYOFRb_tb_pb|5.033003||Viu ANYOFRdelta|5.031007||Viu ANYOFR_t8_p8|5.033003||Viu ANYOFR_t8_pb|5.033003||Viu ANYOFR_tb_p8|5.033003||Viu ANYOFR_tb_pb|5.033003||Viu ANYOF_SHARED_d_MATCHES_ALL_NON_UTF8_NON_ASCII_non_d_WARN_SUPER|5.023003||Viu ANYOF_SHARED_d_UPPER_LATIN1_UTF8_STRING_MATCHES_non_d_RUNTIME_USER_PROP|5.023006||Viu ANYOF_SPACE|5.006000||Viu ANYOF_SPACEL|5.004000||Viu ANYOF_t8_p8|5.033003||Viu ANYOF_t8_pb|5.033003||Viu ANYOF_tb_p8|5.033003||Viu ANYOF_tb_pb|5.033003||Viu ANYOF_UNIPROP|5.017006||Viu ANYOF_UPPER|5.006000||Viu ANYOF_VERTWS|5.009005||Viu ANYOF_WORDCHAR|5.017005||Viu ANYOF_XDIGIT|5.006000||Viu ao|5.005000||Viu _append_range_to_invlist|5.013010||Viu append_utf8_from_native_byte|5.019004||cVniu apply|5.003007||Viu apply_attrs|5.006000||Viu apply_attrs_my|5.007003||Viu apply_attrs_string|5.006001|5.006001|xu ARCHLIB|5.003007|5.003007|Vn ARCHLIB_EXP|5.003007|5.003007|Vn ARCHNAME|5.004000|5.004000|Vn ARG1|5.003007||Viu ARG1_LOC|5.005000||Viu ARG1_SET|5.005000||Viu ARG2|5.003007||Viu ARG2L|5.009005||Viu ARG2L_LOC|5.009005||Viu ARG2_LOC|5.005000||Viu ARG2L_SET|5.009005||Viu ARG2_SET|5.005000||Viu ARG|5.005000||Viu ARG_LOC|5.005000||Viu ARGp|5.031010||Viu ARGp_LOC|5.031010||Viu ARGp_SET|5.031010||Viu ARG__SET|5.005000||Viu ARG_SET|5.005000||Viu ARGTARG|5.003007||Viu ARG_VALUE|5.005000||Viu argvout_final|5.029006||Viu ASCIIish|5.005003||Viu ASCII_MORE_RESTRICT_PAT_MODS|5.013010||Viu ASCII_RESTRICT_PAT_MOD|5.013009||Viu ASCII_RESTRICT_PAT_MODS|5.013009||Viu ASCII_TO_NATIVE|5.007001||Viu ASCII_TO_NEED|5.019004||dcVnu asctime|5.009000||Viu ASCTIME_R_PROTO|5.008000|5.008000|Vn assert|5.003007||Viu __ASSERT_|5.019007|5.008008|p ASSERT_CURPAD_ACTIVE|5.008001||Viu ASSERT_CURPAD_LEGAL|5.008001||Viu assert_not_glob|5.009004||Viu assert_not_ROK|5.008001||Viu assert_uft8_cache_coherent|5.013003||Viu assignment_type|5.021005||Viu ASSUME|5.019006|5.003007|p atfork_lock|5.007002|5.007002|nu atfork_unlock|5.007002|5.007002|nu aTHX|5.006000|5.003007|p aTHX_|5.006000|5.003007|p aTHXa|5.017006||Viu aTHXo|5.006000||Viu aTHXR||5.003007|ponu aTHXR_||5.003007|ponu aTHXx|5.006000||Viu Atof|5.006000||Viu Atol|5.006000||Viu atoll|5.008000||Viu Atoul|5.006000||Viu AvALLOC|5.003007||Viu AvARRAY|5.003007|5.003007| AvARYLEN|5.003007||Viu av_arylen_p|||cu av_clear|5.003007|5.003007| av_count|5.033001|5.003007|p av_create_and_push|5.009005|5.009005|x av_create_and_unshift_one|5.009005|5.009005|x av_delete|5.006000|5.006000| av_exists|5.006000|5.006000| av_extend|5.003007|5.003007| av_extend_guts|5.017004||Viu av_fetch|5.003007|5.003007| av_fill|5.003007|5.003007| AvFILL|5.003007|5.003007| AvFILLp|5.004005||pcV av_iter_p|||cu av_len|5.003007|5.003007| av_make|5.003007|5.003007| AvMAX|5.003007||Viu av_new_alloc|5.035001|5.035001| av_nonelem|5.027009||Viu av_pop|5.003007|5.003007| av_push|5.003007|5.003007| AvREAL|5.003007||Viu AvREALISH|5.003007||Viu AvREAL_off|5.003007||Viu AvREAL_on|5.003007||Viu AvREAL_only|5.009003||Viu AvREIFY|5.003007||Viu av_reify|5.004004||cViu AvREIFY_off|5.003007||Viu AvREIFY_on|5.003007||Viu AvREIFY_only|5.009003||Viu av_shift|5.003007|5.003007| av_store|5.003007|5.003007| av_tindex|5.017009|5.003007|p av_tindex_skip_len_mg|5.025010||Viu av_top_index|5.017009|5.003007|p av_top_index_skip_len_mg|5.025010||Viu av_undef|5.003007|5.003007| av_unshift|5.003007|5.003007| ax|5.003007|5.003007| backup_one_GCB|5.025003||Viu backup_one_LB|5.023007||Viu backup_one_SB|5.021009||Viu backup_one_WB|5.021009||Viu bad_type_gv|5.019002||Viu bad_type_pv|5.016000||Viu BADVERSION|5.011004||Viu BASEOP|5.003007||Viu BhkDISABLE|5.013003||xV BhkENABLE|5.013003||xV BhkENTRY|5.013003||xVi BhkENTRY_set|5.013003||xV BHKf_bhk_eval|5.013006||Viu BHKf_bhk_post_end|5.013006||Viu BHKf_bhk_pre_end|5.013006||Viu BHKf_bhk_start|5.013006||Viu BhkFLAGS|5.013003||xVi BIN|5.003007|5.003007|Vn bind|5.005000||Viu bind_match|5.003007||Viu BIN_EXP|5.004000|5.004000|Vn BIT_BUCKET|5.003007||Viu BIT_DIGITS|5.004000||Viu BITMAP_BYTE|5.009005||Viu BITMAP_TEST|5.009005||Viu blk_eval|5.003007||Viu blk_format|5.011000||Viu blk_gimme|5.003007||Viu blk_givwhen|5.027008||Viu blk_loop|5.003007||Viu blk_oldcop|5.003007||Viu blk_oldmarksp|5.003007||Viu blk_oldpm|5.003007||Viu blk_oldsaveix|5.023008||Viu blk_oldscopesp|5.003007||Viu blk_oldsp|5.003007||Viu blk_old_tmpsfloor|5.023008||Viu blk_sub|5.003007||Viu blk_u16|5.011000||Viu block_end|5.004000|5.004000| block_gimme|5.004000|5.004000|u blockhook_register|5.013003|5.013003|x block_start|5.004000|5.004000| BmFLAGS|5.009005||Viu BmPREVIOUS|5.003007||Viu BmRARE|5.003007||Viu BmUSEFUL|5.003007||Viu BOL|5.003007||Viu BOL_t8_p8|5.033003||Viu BOL_t8_pb|5.033003||Viu BOL_tb_p8|5.033003||Viu BOL_tb_pb|5.033003||Viu BOM_UTF8|5.025005|5.003007|p BOM_UTF8_FIRST_BYTE|5.019004||Viu BOM_UTF8_TAIL|5.019004||Viu bool|5.003007||Viu boolSV|5.004000|5.003007|p boot_core_mro|5.009005||Viu boot_core_PerlIO|5.007002||Viu boot_core_UNIVERSAL|5.003007||Viu BOUND|5.003007||Viu BOUNDA|5.013009||Viu BOUNDA_t8_p8|5.033003||Viu BOUNDA_t8_pb|5.033003||Viu BOUNDA_tb_p8|5.033003||Viu BOUNDA_tb_pb|5.033003||Viu BOUNDL|5.004000||Viu BOUNDL_t8_p8|5.033003||Viu BOUNDL_t8_pb|5.033003||Viu BOUNDL_tb_p8|5.033003||Viu BOUNDL_tb_pb|5.033003||Viu BOUND_t8_p8|5.033003||Viu BOUND_t8_pb|5.033003||Viu BOUND_tb_p8|5.033003||Viu BOUND_tb_pb|5.033003||Viu BOUNDU|5.013009||Viu BOUNDU_t8_p8|5.033003||Viu BOUNDU_t8_pb|5.033003||Viu BOUNDU_tb_p8|5.033003||Viu BOUNDU_tb_pb|5.033003||Viu BRANCH|5.003007||Viu BRANCHJ|5.005000||Viu BRANCHJ_t8_p8|5.033003||Viu BRANCHJ_t8_pb|5.033003||Viu BRANCHJ_tb_p8|5.033003||Viu BRANCHJ_tb_pb|5.033003||Viu BRANCH_next|5.009005||Viu BRANCH_next_fail|5.009005||Viu BRANCH_next_fail_t8_p8|5.033003||Viu BRANCH_next_fail_t8_pb|5.033003||Viu BRANCH_next_fail_tb_p8|5.033003||Viu BRANCH_next_fail_tb_pb|5.033003||Viu BRANCH_next_t8_p8|5.033003||Viu BRANCH_next_t8_pb|5.033003||Viu BRANCH_next_tb_p8|5.033003||Viu BRANCH_next_tb_pb|5.033003||Viu BRANCH_t8_p8|5.033003||Viu BRANCH_t8_pb|5.033003||Viu BRANCH_tb_p8|5.033003||Viu BRANCH_tb_pb|5.033003||Viu BSD_GETPGRP|5.003007||Viu BSDish|5.008001||Viu BSD_SETPGRP|5.003007||Viu BUFSIZ|5.003007||Viu _byte_dump_string|5.025006||cViu BYTEORDER|5.003007|5.003007|Vn bytes_cmp_utf8|5.013007|5.013007| bytes_from_utf8|5.007001|5.007001|x bytes_from_utf8_loc|5.027001||xcVn bytes_to_utf8|5.006001|5.006001|x call_argv|5.006000|5.003007|p call_atexit|5.006000|5.006000|u CALL_BLOCK_HOOKS|5.013003||xVi CALL_CHECKER_REQUIRE_GV|5.021004|5.021004| caller_cx|5.013005|5.006000|p CALL_FPTR|5.006000||Viu call_list|5.004000|5.004000|u call_method|5.006000|5.003007|p calloc|5.007002|5.007002|n call_pv|5.006000|5.003007|p CALLREGCOMP|5.005000||Viu CALLREGCOMP_ENG|5.009005||Viu CALLREGDUPE|5.009005||Viu CALLREGDUPE_PVT|5.009005||Viu CALLREGEXEC|5.005000||Viu CALLREGFREE|5.006000||Viu CALLREGFREE_PVT|5.009005||Viu CALLREG_INTUIT_START|5.006000||Viu CALLREG_INTUIT_STRING|5.006000||Viu CALLREG_NAMED_BUFF_ALL|5.009005||Viu CALLREG_NAMED_BUFF_CLEAR|5.009005||Viu CALLREG_NAMED_BUFF_COUNT|5.009005||Viu CALLREG_NAMED_BUFF_DELETE|5.009005||Viu CALLREG_NAMED_BUFF_EXISTS|5.009005||Viu CALLREG_NAMED_BUFF_FETCH|5.009005||Viu CALLREG_NAMED_BUFF_FIRSTKEY|5.009005||Viu CALLREG_NAMED_BUFF_NEXTKEY|5.009005||Viu CALLREG_NAMED_BUFF_SCALAR|5.009005||Viu CALLREG_NAMED_BUFF_STORE|5.009005||Viu CALLREG_NUMBUF_FETCH|5.009005||Viu CALLREG_NUMBUF_LENGTH|5.009005||Viu CALLREG_NUMBUF_STORE|5.009005||Viu CALLREG_PACKAGE|5.009005||Viu CALLRUNOPS|5.005000||Viu call_sv|5.006000|5.003007|p CAN64BITHASH|5.027001||Viu CAN_COW_FLAGS|5.009000||Viu CAN_COW_MASK|5.009000||Viu cando|5.003007||Viu CAN_PROTOTYPE|5.003007||Viu C_ARRAY_END|5.013002|5.003007|p C_ARRAY_LENGTH|5.008001|5.003007|p case_100_SBOX32|5.027001||Viu case_101_SBOX32|5.027001||Viu case_102_SBOX32|5.027001||Viu case_103_SBOX32|5.027001||Viu case_104_SBOX32|5.027001||Viu case_105_SBOX32|5.027001||Viu case_106_SBOX32|5.027001||Viu case_107_SBOX32|5.027001||Viu case_108_SBOX32|5.027001||Viu case_109_SBOX32|5.027001||Viu case_10_SBOX32|5.027001||Viu case_110_SBOX32|5.027001||Viu case_111_SBOX32|5.027001||Viu case_112_SBOX32|5.027001||Viu case_113_SBOX32|5.027001||Viu case_114_SBOX32|5.027001||Viu case_115_SBOX32|5.027001||Viu case_116_SBOX32|5.027001||Viu case_117_SBOX32|5.027001||Viu case_118_SBOX32|5.027001||Viu case_119_SBOX32|5.027001||Viu case_11_SBOX32|5.027001||Viu case_120_SBOX32|5.027001||Viu case_121_SBOX32|5.027001||Viu case_122_SBOX32|5.027001||Viu case_123_SBOX32|5.027001||Viu case_124_SBOX32|5.027001||Viu case_125_SBOX32|5.027001||Viu case_126_SBOX32|5.027001||Viu case_127_SBOX32|5.027001||Viu case_128_SBOX32|5.027001||Viu case_129_SBOX32|5.027001||Viu case_12_SBOX32|5.027001||Viu case_130_SBOX32|5.027001||Viu case_131_SBOX32|5.027001||Viu case_132_SBOX32|5.027001||Viu case_133_SBOX32|5.027001||Viu case_134_SBOX32|5.027001||Viu case_135_SBOX32|5.027001||Viu case_136_SBOX32|5.027001||Viu case_137_SBOX32|5.027001||Viu case_138_SBOX32|5.027001||Viu case_139_SBOX32|5.027001||Viu case_13_SBOX32|5.027001||Viu case_140_SBOX32|5.027001||Viu case_141_SBOX32|5.027001||Viu case_142_SBOX32|5.027001||Viu case_143_SBOX32|5.027001||Viu case_144_SBOX32|5.027001||Viu case_145_SBOX32|5.027001||Viu case_146_SBOX32|5.027001||Viu case_147_SBOX32|5.027001||Viu case_148_SBOX32|5.027001||Viu case_149_SBOX32|5.027001||Viu case_14_SBOX32|5.027001||Viu case_150_SBOX32|5.027001||Viu case_151_SBOX32|5.027001||Viu case_152_SBOX32|5.027001||Viu case_153_SBOX32|5.027001||Viu case_154_SBOX32|5.027001||Viu case_155_SBOX32|5.027001||Viu case_156_SBOX32|5.027001||Viu case_157_SBOX32|5.027001||Viu case_158_SBOX32|5.027001||Viu case_159_SBOX32|5.027001||Viu case_15_SBOX32|5.027001||Viu case_160_SBOX32|5.027001||Viu case_161_SBOX32|5.027001||Viu case_162_SBOX32|5.027001||Viu case_163_SBOX32|5.027001||Viu case_164_SBOX32|5.027001||Viu case_165_SBOX32|5.027001||Viu case_166_SBOX32|5.027001||Viu case_167_SBOX32|5.027001||Viu case_168_SBOX32|5.027001||Viu case_169_SBOX32|5.027001||Viu case_16_SBOX32|5.027001||Viu case_170_SBOX32|5.027001||Viu case_171_SBOX32|5.027001||Viu case_172_SBOX32|5.027001||Viu case_173_SBOX32|5.027001||Viu case_174_SBOX32|5.027001||Viu case_175_SBOX32|5.027001||Viu case_176_SBOX32|5.027001||Viu case_177_SBOX32|5.027001||Viu case_178_SBOX32|5.027001||Viu case_179_SBOX32|5.027001||Viu case_17_SBOX32|5.027001||Viu case_180_SBOX32|5.027001||Viu case_181_SBOX32|5.027001||Viu case_182_SBOX32|5.027001||Viu case_183_SBOX32|5.027001||Viu case_184_SBOX32|5.027001||Viu case_185_SBOX32|5.027001||Viu case_186_SBOX32|5.027001||Viu case_187_SBOX32|5.027001||Viu case_188_SBOX32|5.027001||Viu case_189_SBOX32|5.027001||Viu case_18_SBOX32|5.027001||Viu case_190_SBOX32|5.027001||Viu case_191_SBOX32|5.027001||Viu case_192_SBOX32|5.027001||Viu case_193_SBOX32|5.027001||Viu case_194_SBOX32|5.027001||Viu case_195_SBOX32|5.027001||Viu case_196_SBOX32|5.027001||Viu case_197_SBOX32|5.027001||Viu case_198_SBOX32|5.027001||Viu case_199_SBOX32|5.027001||Viu case_19_SBOX32|5.027001||Viu case_1_SBOX32|5.027001||Viu case_200_SBOX32|5.027001||Viu case_201_SBOX32|5.027001||Viu case_202_SBOX32|5.027001||Viu case_203_SBOX32|5.027001||Viu case_204_SBOX32|5.027001||Viu case_205_SBOX32|5.027001||Viu case_206_SBOX32|5.027001||Viu case_207_SBOX32|5.027001||Viu case_208_SBOX32|5.027001||Viu case_209_SBOX32|5.027001||Viu case_20_SBOX32|5.027001||Viu case_210_SBOX32|5.027001||Viu case_211_SBOX32|5.027001||Viu case_212_SBOX32|5.027001||Viu case_213_SBOX32|5.027001||Viu case_214_SBOX32|5.027001||Viu case_215_SBOX32|5.027001||Viu case_216_SBOX32|5.027001||Viu case_217_SBOX32|5.027001||Viu case_218_SBOX32|5.027001||Viu case_219_SBOX32|5.027001||Viu case_21_SBOX32|5.027001||Viu case_220_SBOX32|5.027001||Viu case_221_SBOX32|5.027001||Viu case_222_SBOX32|5.027001||Viu case_223_SBOX32|5.027001||Viu case_224_SBOX32|5.027001||Viu case_225_SBOX32|5.027001||Viu case_226_SBOX32|5.027001||Viu case_227_SBOX32|5.027001||Viu case_228_SBOX32|5.027001||Viu case_229_SBOX32|5.027001||Viu case_22_SBOX32|5.027001||Viu case_230_SBOX32|5.027001||Viu case_231_SBOX32|5.027001||Viu case_232_SBOX32|5.027001||Viu case_233_SBOX32|5.027001||Viu case_234_SBOX32|5.027001||Viu case_235_SBOX32|5.027001||Viu case_236_SBOX32|5.027001||Viu case_237_SBOX32|5.027001||Viu case_238_SBOX32|5.027001||Viu case_239_SBOX32|5.027001||Viu case_23_SBOX32|5.027001||Viu case_240_SBOX32|5.027001||Viu case_241_SBOX32|5.027001||Viu case_242_SBOX32|5.027001||Viu case_243_SBOX32|5.027001||Viu case_244_SBOX32|5.027001||Viu case_245_SBOX32|5.027001||Viu case_246_SBOX32|5.027001||Viu case_247_SBOX32|5.027001||Viu case_248_SBOX32|5.027001||Viu case_249_SBOX32|5.027001||Viu case_24_SBOX32|5.027001||Viu case_250_SBOX32|5.027001||Viu case_251_SBOX32|5.027001||Viu case_252_SBOX32|5.027001||Viu case_253_SBOX32|5.027001||Viu case_254_SBOX32|5.027001||Viu case_255_SBOX32|5.027001||Viu case_256_SBOX32|5.027001||Viu case_25_SBOX32|5.027001||Viu case_26_SBOX32|5.027001||Viu case_27_SBOX32|5.027001||Viu case_28_SBOX32|5.027001||Viu case_29_SBOX32|5.027001||Viu case_2_SBOX32|5.027001||Viu case_30_SBOX32|5.027001||Viu case_31_SBOX32|5.027001||Viu case_32_SBOX32|5.027001||Viu case_33_SBOX32|5.027001||Viu case_34_SBOX32|5.027001||Viu case_35_SBOX32|5.027001||Viu case_36_SBOX32|5.027001||Viu case_37_SBOX32|5.027001||Viu case_38_SBOX32|5.027001||Viu case_39_SBOX32|5.027001||Viu case_3_SBOX32|5.027001||Viu case_40_SBOX32|5.027001||Viu case_41_SBOX32|5.027001||Viu case_42_SBOX32|5.027001||Viu case_43_SBOX32|5.027001||Viu case_44_SBOX32|5.027001||Viu case_45_SBOX32|5.027001||Viu case_46_SBOX32|5.027001||Viu case_47_SBOX32|5.027001||Viu case_48_SBOX32|5.027001||Viu case_49_SBOX32|5.027001||Viu case_4_SBOX32|5.027001||Viu case_50_SBOX32|5.027001||Viu case_51_SBOX32|5.027001||Viu case_52_SBOX32|5.027001||Viu case_53_SBOX32|5.027001||Viu case_54_SBOX32|5.027001||Viu case_55_SBOX32|5.027001||Viu case_56_SBOX32|5.027001||Viu case_57_SBOX32|5.027001||Viu case_58_SBOX32|5.027001||Viu case_59_SBOX32|5.027001||Viu case_5_SBOX32|5.027001||Viu case_60_SBOX32|5.027001||Viu case_61_SBOX32|5.027001||Viu case_62_SBOX32|5.027001||Viu case_63_SBOX32|5.027001||Viu case_64_SBOX32|5.027001||Viu case_65_SBOX32|5.027001||Viu case_66_SBOX32|5.027001||Viu case_67_SBOX32|5.027001||Viu case_68_SBOX32|5.027001||Viu case_69_SBOX32|5.027001||Viu case_6_SBOX32|5.027001||Viu case_70_SBOX32|5.027001||Viu case_71_SBOX32|5.027001||Viu case_72_SBOX32|5.027001||Viu case_73_SBOX32|5.027001||Viu case_74_SBOX32|5.027001||Viu case_75_SBOX32|5.027001||Viu case_76_SBOX32|5.027001||Viu case_77_SBOX32|5.027001||Viu case_78_SBOX32|5.027001||Viu case_79_SBOX32|5.027001||Viu case_7_SBOX32|5.027001||Viu case_80_SBOX32|5.027001||Viu case_81_SBOX32|5.027001||Viu case_82_SBOX32|5.027001||Viu case_83_SBOX32|5.027001||Viu case_84_SBOX32|5.027001||Viu case_85_SBOX32|5.027001||Viu case_86_SBOX32|5.027001||Viu case_87_SBOX32|5.027001||Viu case_88_SBOX32|5.027001||Viu case_89_SBOX32|5.027001||Viu case_8_SBOX32|5.027001||Viu case_90_SBOX32|5.027001||Viu case_91_SBOX32|5.027001||Viu case_92_SBOX32|5.027001||Viu case_93_SBOX32|5.027001||Viu case_94_SBOX32|5.027001||Viu case_95_SBOX32|5.027001||Viu case_96_SBOX32|5.027001||Viu case_97_SBOX32|5.027001||Viu case_98_SBOX32|5.027001||Viu case_99_SBOX32|5.027001||Viu case_9_SBOX32|5.027001||Viu CASE_STD_PMMOD_FLAGS_PARSE_SET|5.009005||Viu CASTFLAGS|5.003007|5.003007|Vn cast_i32|5.006000||cVnu cast_iv|5.006000||cVnu CASTNEGFLOAT|5.003007|5.003007|Vn cast_ulong|5.003007||cVnu cast_uv|5.006000||cVnu CAT2|5.003007|5.003007|Vn CATCH_GET|5.004000||Viu CATCH_SET|5.004000||Viu category_name|5.027008||Vniu cBINOP|5.003007||Viu cBINOPo|5.004005||Viu cBINOPx|5.006000||Viu cBOOL|5.013000|5.003007|p cCOP|5.003007||Viu cCOPo|5.004005||Viu cCOPx|5.006000||Viu C_FAC_POSIX|5.009003||Viu cGVOP_gv|5.006000||Viu cGVOPo_gv|5.006000||Viu cGVOPx_gv|5.006000||Viu change_engine_size|5.029004||Viu CHANGE_MULTICALL_FLAGS|5.018000||Viu CHARBITS|5.011002|5.011002|Vn CHARSET_PAT_MODS|5.013010||Viu chdir|5.005000||Viu checkcomma|5.003007||Viu check_end_shift|5.009005||Viu check_locale_boundary_crossing|5.015006||Viu CHECK_MALLOC_TAINT|5.008001||Viu CHECK_MALLOC_TOO_LATE_FOR|5.008001||Viu check_offset_max|5.005000||Viu check_offset_min|5.005000||Viu check_substr|5.005000||Viu check_type_and_open|5.009003||Viu check_uni|5.003007||Viu check_utf8|5.008000||Viu check_utf8_print|5.013009||Viu child_offset_bits|5.009003||Viu chmod|5.005000||Viu chsize|5.005000||Viu ckDEAD|5.006000||Viu ck_entersub_args_core|||iu ck_entersub_args_list|5.013006|5.013006| ck_entersub_args_proto|5.013006|5.013006| ck_entersub_args_proto_or_list|5.013006|5.013006| ckWARN2|5.006000|5.003007|p ckWARN2_d|5.006000|5.003007|p ckWARN3|5.007003|5.003007|p ckWARN3_d|5.007003|5.003007|p ckWARN4|5.007003|5.003007|p ckWARN4_d|5.007003|5.003007|p ckWARN|5.006000|5.003007|p ckwarn_common|5.011001||Viu ckwarn|||cu ckWARN_d|5.006000|5.003007|p ckwarn_d|||cu ck_warner|5.011001|5.004000|pv ck_warner_d|5.011001|5.004000|pv CLANG_DIAG_IGNORE|5.023006||Viu CLANG_DIAG_IGNORE_DECL|5.027007||Viu CLANG_DIAG_IGNORE_STMT|5.027007||Viu CLANG_DIAG_PRAGMA|5.023006||Viu CLANG_DIAG_RESTORE|5.023006||Viu CLANG_DIAG_RESTORE_DECL|5.027007||Viu CLANG_DIAG_RESTORE_STMT|5.027007||Viu CLASS||5.003007| CLEAR_ARGARRAY|5.006000||Viu clear_defarray|5.023008|5.023008|u clearerr|5.003007||Viu CLEAR_ERRSV|5.025007|5.025007| CLEARFEATUREBITS|5.031006||Viu clear_placeholders|5.009004||xViu clear_special_blocks|5.021003||Viu cLISTOP|5.003007||Viu cLISTOPo|5.004005||Viu cLISTOPx|5.006000||Viu cLOGOP|5.003007||Viu cLOGOPo|5.004005||Viu cLOGOPx|5.006000||Viu CLONEf_CLONE_HOST|5.007002||Viu CLONEf_COPY_STACKS|5.007001||Viu CLONEf_JOIN_IN|5.008001||Viu CLONEf_KEEP_PTR_TABLE|5.007001||Viu clone_params_del|5.013002|5.013002|nu clone_params_new|5.013002|5.013002|nu cLOOP|5.003007||Viu cLOOPo|5.004005||Viu cLOOPx|5.006000||Viu CLOSE|5.003007||Viu close|5.005000||Viu closedir|5.005000||Viu closest_cop|5.007002||Viu CLOSE_t8_p8|5.033003||Viu CLOSE_t8_pb|5.033003||Viu CLOSE_tb_p8|5.033003||Viu CLOSE_tb_pb|5.033003||Viu CLUMP_2IV|5.006000||Viu CLUMP_2UV|5.006000||Viu CLUMP|5.006000||Viu CLUMP_t8_p8|5.033003||Viu CLUMP_t8_pb|5.033003||Viu CLUMP_tb_p8|5.033003||Viu CLUMP_tb_pb|5.033003||Viu cMETHOPx|5.021005||Viu cMETHOPx_meth|5.021005||Viu cMETHOPx_rclass|5.021007||Viu cmpchain_extend|5.031011||Viu cmpchain_finish|5.031011||Viu cmpchain_start|5.031011||Viu cmp_desc|5.031011||Viu cmp_locale_desc|5.031011||Viu cntrl_to_mnemonic|5.021004||cVniu CODESET|5.027010||Viu COMBINING_DOT_ABOVE_UTF8|5.029008||Viu COMBINING_GRAVE_ACCENT_UTF8|5.017004||Viu COMMIT|5.009005||Viu COMMIT_next|5.009005||Viu COMMIT_next_fail|5.009005||Viu COMMIT_next_fail_t8_p8|5.033003||Viu COMMIT_next_fail_t8_pb|5.033003||Viu COMMIT_next_fail_tb_p8|5.033003||Viu COMMIT_next_fail_tb_pb|5.033003||Viu COMMIT_next_t8_p8|5.033003||Viu COMMIT_next_t8_pb|5.033003||Viu COMMIT_next_tb_p8|5.033003||Viu COMMIT_next_tb_pb|5.033003||Viu COMMIT_t8_p8|5.033003||Viu COMMIT_t8_pb|5.033003||Viu COMMIT_tb_p8|5.033003||Viu COMMIT_tb_pb|5.033003||Viu compile_wildcard|5.031010||Viu compute_EXACTish|5.017003||Vniu COND_BROADCAST|5.005000||Viu COND_DESTROY|5.005000||Viu COND_INIT|5.005000||Viu COND_SIGNAL|5.005000||Viu COND_WAIT|5.005000||Viu connect|5.005000||Viu construct_ahocorasick_from_trie|5.021001||Viu CONTINUE_PAT_MOD|5.009005||Viu cop_fetch_label|5.015001|5.015001|x CopFILE|5.006000|5.003007|p CopFILEAV|5.006000|5.003007|p CopFILEAVx|5.009003||Viu CopFILE_free|5.007003||Viu CopFILEGV|5.006000|5.003007|p CopFILEGV_set|5.006000|5.003007|p CopFILE_set|5.006000|5.003007|p CopFILE_setn|5.009005||Viu CopFILESV|5.006000|5.003007|p cop_free|5.006000||Viu cophh_2hv|5.013007|5.013007|x cophh_copy|5.013007|5.013007|x cophh_delete_pv|5.013007|5.013007|x cophh_delete_pvn|5.013007|5.013007|x cophh_delete_pvs|5.013007|5.013007|x cophh_delete_sv|5.013007|5.013007|x COPHH_EXISTS|5.033008||Viu cophh_exists_pv|5.033008|5.033008|x cophh_exists_pvn|5.033008|5.033008|x cophh_exists_pvs|5.033008|5.033008|x cophh_exists_sv|5.033008|5.033008|x cophh_fetch_pv|5.013007|5.013007|x cophh_fetch_pvn|5.013007|5.013007|x cophh_fetch_pvs|5.013007|5.013007|x cophh_fetch_sv|5.013007|5.013007|x cophh_free|5.013007|5.013007|x COPHH_KEY_UTF8|5.013007|5.013007| cophh_new_empty|5.013007|5.013007|x cophh_store_pv|5.013007|5.013007|x cophh_store_pvn|5.013007|5.013007|x cophh_store_pvs|5.013007|5.013007|x cophh_store_sv|5.013007|5.013007|x CopHINTHASH_get|5.013007||Viu CopHINTHASH_set|5.013007||Viu cop_hints_2hv|5.013007|5.013007| cop_hints_exists_pv|5.033008|5.033008| cop_hints_exists_pvn|5.033008|5.033008| cop_hints_exists_pvs|5.033008|5.033008| cop_hints_exists_sv|5.033008|5.033008| cop_hints_fetch_pv|5.013007|5.013007| cop_hints_fetch_pvn|5.013007|5.013007| cop_hints_fetch_pvs|5.013007|5.013007| cop_hints_fetch_sv|5.013007|5.013007| CopHINTS_get|5.009004||Viu CopHINTS_set|5.009004||Viu CopLABEL|5.009005|5.009005| CopLABEL_alloc|5.009005||Viu CopLABEL_len|5.016000|5.016000| CopLABEL_len_flags|5.016000|5.016000| CopLINE|5.006000|5.006000| CopLINE_dec|5.006000||Viu CopLINE_inc|5.006000||Viu CopLINE_set|5.006000||Viu COP_SEQMAX_INC|5.021006||Viu COP_SEQ_RANGE_HIGH|5.009005||Viu COP_SEQ_RANGE_LOW|5.009005||Viu CopSTASH|5.006000|5.003007|p CopSTASH_eq|5.006000|5.003007|p CopSTASH_ne|5.006000||Viu CopSTASHPV|5.006000|5.003007|p CopSTASHPV_set|5.017001|5.017001|p CopSTASH_set|5.006000|5.003007|p cop_store_label|5.015001|5.015001|x Copy|5.003007|5.003007| CopyD|5.009002|5.003007|p core_prototype|5.015002||Vi coresub_op|5.015003||Viu CowREFCNT|5.017007||Viu cPADOP|5.006000||Viu cPADOPo|5.006000||Viu cPADOPx|5.006000||Viu CPERLarg|5.005000||Viu CPERLscope|5.005000|5.003007|pdV cPMOP|5.003007||Viu cPMOPo|5.004005||Viu cPMOPx|5.006000||Viu CPPLAST|5.006000|5.006000|Vn CPPMINUS|5.003007|5.003007|Vn CPPRUN|5.006000|5.006000|Vn CPPSTDIN|5.003007|5.003007|Vn cPVOP|5.003007||Viu cPVOPo|5.004005||Viu cPVOPx|5.006000||Viu create_eval_scope|5.009004||xViu CR_NATIVE|5.019004||Viu CRNCYSTR|5.027010||Viu croak|5.006000|5.003007|v croak_caller|5.025004||vVniu croak_memory_wrap|5.019003||pcVnu croak_nocontext|5.006000||pvVn croak_no_mem|5.017006||Vniu croak_no_modify|5.013003|5.003007|pn croak_popstack|5.017008||cVniu croak_sv|5.013001|5.003007|p croak_xs_usage|5.010001|5.003007|pn cr_textfilter|5.006000||Viu crypt|5.009000||Viu CRYPT_R_PROTO|5.008000|5.008000|Vn CSH|5.003007|5.003007|Vn csighandler1|5.031007||cVnu csighandler3|5.031007||cVnu csighandler|5.008001||cVnu cSVOP|5.003007||Viu cSVOPo|5.004005||Viu cSVOPo_sv|5.006000||Viu cSVOP_sv|5.006000||Viu cSVOPx|5.006000||Viu cSVOPx_sv|5.006000||Viu cSVOPx_svp|5.006000||Viu ctermid|5.009000||Viu CTERMID_R_PROTO|5.008000|5.008000|Vn ctime|5.009000||Viu CTIME_R_PROTO|5.008000|5.008000|Vn Ctl|5.003007||Viu CTYPE256|5.003007||Viu cUNOP|5.003007||Viu cUNOP_AUX|5.021007||Viu cUNOP_AUXo|5.021007||Viu cUNOP_AUXx|5.021007||Viu cUNOPo|5.004005||Viu cUNOPx|5.006000||Viu CURLY|5.003007||Viu CURLY_B_max|5.009005||Viu CURLY_B_max_fail|5.009005||Viu CURLY_B_max_fail_t8_p8|5.033003||Viu CURLY_B_max_fail_t8_pb|5.033003||Viu CURLY_B_max_fail_tb_p8|5.033003||Viu CURLY_B_max_fail_tb_pb|5.033003||Viu CURLY_B_max_t8_p8|5.033003||Viu CURLY_B_max_t8_pb|5.033003||Viu CURLY_B_max_tb_p8|5.033003||Viu CURLY_B_max_tb_pb|5.033003||Viu CURLY_B_min|5.009005||Viu CURLY_B_min_fail|5.009005||Viu CURLY_B_min_fail_t8_p8|5.033003||Viu CURLY_B_min_fail_t8_pb|5.033003||Viu CURLY_B_min_fail_tb_p8|5.033003||Viu CURLY_B_min_fail_tb_pb|5.033003||Viu CURLY_B_min_t8_p8|5.033003||Viu CURLY_B_min_t8_pb|5.033003||Viu CURLY_B_min_tb_p8|5.033003||Viu CURLY_B_min_tb_pb|5.033003||Viu CURLYM|5.005000||Viu CURLYM_A|5.009005||Viu CURLYM_A_fail|5.009005||Viu CURLYM_A_fail_t8_p8|5.033003||Viu CURLYM_A_fail_t8_pb|5.033003||Viu CURLYM_A_fail_tb_p8|5.033003||Viu CURLYM_A_fail_tb_pb|5.033003||Viu CURLYM_A_t8_p8|5.033003||Viu CURLYM_A_t8_pb|5.033003||Viu CURLYM_A_tb_p8|5.033003||Viu CURLYM_A_tb_pb|5.033003||Viu CURLYM_B|5.009005||Viu CURLYM_B_fail|5.009005||Viu CURLYM_B_fail_t8_p8|5.033003||Viu CURLYM_B_fail_t8_pb|5.033003||Viu CURLYM_B_fail_tb_p8|5.033003||Viu CURLYM_B_fail_tb_pb|5.033003||Viu CURLYM_B_t8_p8|5.033003||Viu CURLYM_B_t8_pb|5.033003||Viu CURLYM_B_tb_p8|5.033003||Viu CURLYM_B_tb_pb|5.033003||Viu CURLYM_t8_p8|5.033003||Viu CURLYM_t8_pb|5.033003||Viu CURLYM_tb_p8|5.033003||Viu CURLYM_tb_pb|5.033003||Viu CURLYN|5.005000||Viu CURLYN_t8_p8|5.033003||Viu CURLYN_t8_pb|5.033003||Viu CURLYN_tb_p8|5.033003||Viu CURLYN_tb_pb|5.033003||Viu CURLY_t8_p8|5.033003||Viu CURLY_t8_pb|5.033003||Viu CURLY_tb_p8|5.033003||Viu CURLY_tb_pb|5.033003||Viu CURLYX|5.003007||Viu CURLYX_end|5.009005||Viu CURLYX_end_fail|5.009005||Viu CURLYX_end_fail_t8_p8|5.033003||Viu CURLYX_end_fail_t8_pb|5.033003||Viu CURLYX_end_fail_tb_p8|5.033003||Viu CURLYX_end_fail_tb_pb|5.033003||Viu CURLYX_end_t8_p8|5.033003||Viu CURLYX_end_t8_pb|5.033003||Viu CURLYX_end_tb_p8|5.033003||Viu CURLYX_end_tb_pb|5.033003||Viu CURLYX_t8_p8|5.033003||Viu CURLYX_t8_pb|5.033003||Viu CURLYX_tb_p8|5.033003||Viu CURLYX_tb_pb|5.033003||Viu CURRENT_FEATURE_BUNDLE|5.015007||Viu CURRENT_HINTS|5.015007||Viu current_re_engine|5.017001||cViu curse|5.013009||Viu custom_op_desc|5.007003|5.007003|d custom_op_get_field|5.019006||cViu custom_op_name|5.007003|5.007003|d custom_op_register|5.013007|5.013007| CUTGROUP|5.009005||Viu CUTGROUP_next|5.009005||Viu CUTGROUP_next_fail|5.009005||Viu CUTGROUP_next_fail_t8_p8|5.033003||Viu CUTGROUP_next_fail_t8_pb|5.033003||Viu CUTGROUP_next_fail_tb_p8|5.033003||Viu CUTGROUP_next_fail_tb_pb|5.033003||Viu CUTGROUP_next_t8_p8|5.033003||Viu CUTGROUP_next_t8_pb|5.033003||Viu CUTGROUP_next_tb_p8|5.033003||Viu CUTGROUP_next_tb_pb|5.033003||Viu CUTGROUP_t8_p8|5.033003||Viu CUTGROUP_t8_pb|5.033003||Viu CUTGROUP_tb_p8|5.033003||Viu CUTGROUP_tb_pb|5.033003||Viu CvANON|5.003007||Viu CvANONCONST|5.021008||Viu CvANONCONST_off|5.021008||Viu CvANONCONST_on|5.021008||Viu CvANON_off|5.003007||Viu CvANON_on|5.003007||Viu CvAUTOLOAD|5.015004||Viu CvAUTOLOAD_off|5.015004||Viu CvAUTOLOAD_on|5.015004||Viu cv_ckproto|5.009004||Viu cv_ckproto_len_flags|5.015004||xcViu cv_clone|5.003007|5.003007| CvCLONE|5.003007||Viu CvCLONED|5.003007||Viu CvCLONED_off|5.003007||Viu CvCLONED_on|5.003007||Viu cv_clone_into|5.017004||Viu CvCLONE_off|5.003007||Viu CvCLONE_on|5.003007||Viu CvCONST|5.007001||Viu CvCONST_off|5.007001||Viu CvCONST_on|5.007001||Viu cv_const_sv|5.003007|5.003007|n cv_const_sv_or_av|5.019003||Vniu CvCVGV_RC|5.013003||Viu CvCVGV_RC_off|5.013003||Viu CvCVGV_RC_on|5.013003||Viu CvDEPTH|5.003007|5.003007|nu CvDEPTHunsafe|5.021006||Viu cv_dump|5.006000||Vi CvDYNFILE|5.015002||Viu CvDYNFILE_off|5.015002||Viu CvDYNFILE_on|5.015002||Viu CvEVAL|5.005003||Viu CvEVAL_off|5.005003||Viu CvEVAL_on|5.005003||Viu CVf_ANON|5.003007||Viu CVf_ANONCONST|5.021008||Viu CVf_AUTOLOAD|5.015004||Viu CVf_BUILTIN_ATTRS|5.008000||Viu CVf_CLONE|5.003007||Viu CVf_CLONED|5.003007||Viu CVf_CONST|5.007001||Viu CVf_CVGV_RC|5.013003||Viu CVf_DYNFILE|5.015002||Viu CVf_HASEVAL|5.017002||Viu CvFILE|5.006000||Viu CvFILEGV|5.003007||Viu CvFILE_set_from_cop|5.007002||Viu CVf_ISXSUB|5.009004||Viu CvFLAGS|5.003007||Viu CVf_LEXICAL|5.021004||Viu CVf_LVALUE|5.006000||Viu CVf_METHOD|5.005000||Viu CVf_NAMED|5.017004||Viu CVf_NODEBUG|5.004000||Viu cv_forget_slab|5.017002||Vi CVf_SLABBED|5.017002||Viu CVf_UNIQUE|5.004000||Viu CVf_WEAKOUTSIDE|5.008001||Viu cv_get_call_checker|5.013006|5.013006| cv_get_call_checker_flags|5.027003|5.027003| CvGV|5.003007|5.003007| cvgv_from_hek|||ciu cvgv_set|5.013003||cViu CvGV_set|5.013003||Viu CvHASEVAL|5.017002||Viu CvHASEVAL_off|5.017002||Viu CvHASEVAL_on|5.017002||Viu CvHASGV|5.021004||Viu CvHSCXT|5.021006||Viu CvISXSUB|5.009004||Viu CvISXSUB_off|5.009004||Viu CvISXSUB_on|5.009004||Viu CvLEXICAL|5.021004||Viu CvLEXICAL_off|5.021004||Viu CvLEXICAL_on|5.021004||Viu CvLVALUE|5.006000||Viu CvLVALUE_off|5.006000||Viu CvLVALUE_on|5.006000||Viu CvMETHOD|5.005000||Viu CvMETHOD_off|5.005000||Viu CvMETHOD_on|5.005000||Viu cv_name|5.021005|5.021005| CvNAMED|5.017004||Viu CvNAMED_off|5.017004||Viu CvNAMED_on|5.017004||Viu CvNAME_HEK_set|5.017004||Viu CV_NAME_NOTQUAL|5.021005|5.021005| CvNODEBUG|5.004000||Viu CvNODEBUG_off|5.004000||Viu CvNODEBUG_on|5.004000||Viu CvOUTSIDE|5.003007||Viu CvOUTSIDE_SEQ|5.008001||Viu CvPADLIST|5.008001|5.008001|x CvPADLIST_set|5.021006||Viu CvPROTO|5.015004||Viu CvPROTOLEN|5.015004||Viu CvROOT|5.003007||Viu cv_set_call_checker|5.013006|5.013006| cv_set_call_checker_flags|5.021004|5.021004| CvSLABBED|5.017002||Viu CvSLABBED_off|5.017002||Viu CvSLABBED_on|5.017002||Viu CvSPECIAL|5.005003||Viu CvSPECIAL_off|5.005003||Viu CvSPECIAL_on|5.005003||Viu CvSTART|5.003007||Viu CvSTASH|5.003007|5.003007| cvstash_set|5.013007||cViu CvSTASH_set|5.013007||Viu cv_undef|5.003007|5.003007| cv_undef_flags|5.021004||Viu CV_UNDEF_KEEP_NAME|5.021004||Viu CvUNIQUE|5.004000||Viu CvUNIQUE_off|5.004000||Viu CvUNIQUE_on|5.004000||Viu CvWEAKOUTSIDE|5.008001||Vi CvWEAKOUTSIDE_off|5.008001||Viu CvWEAKOUTSIDE_on|5.008001||Viu CvXSUB|5.003007||Viu CvXSUBANY|5.003007||Viu CX_CUR|5.023008||Viu CX_CURPAD_SAVE|5.008001||Vi CX_CURPAD_SV|5.008001||Vi CX_DEBUG|5.023008||Viu cx_dump|5.003007||cVu cx_dup|5.006000||cVu CxEVALBLOCK|5.033007||Viu CxEVAL_TXT_REFCNTED|5.025007||Viu CxFOREACH|5.009003||Viu CxHASARGS|5.010001||Viu cxinc|5.003007||cVu CXINC|5.003007||Viu CxITERVAR|5.006000||Viu CxLABEL|5.010001||Viu CxLABEL_len|5.016000||Viu CxLABEL_len_flags|5.016000||Viu CX_LEAVE_SCOPE|5.023008||Viu CxLVAL|5.010001||Viu CxMULTICALL|5.009003||Viu CxOLD_IN_EVAL|5.010001||Viu CxOLD_OP_TYPE|5.010001||Viu CxONCE|5.010001||Viu CxPADLOOP|5.006000||Viu CXp_EVALBLOCK|5.033007||Viu CXp_FOR_DEF|5.027008||Viu CXp_FOR_GV|5.023008||Viu CXp_FOR_LVREF|5.021005||Viu CXp_FOR_PAD|5.023008||Viu CXp_HASARGS|5.011000||Viu CXp_MULTICALL|5.009003||Viu CXp_ONCE|5.011000||Viu CX_POP|5.023008||Viu cx_popblock|5.023008||xcVu cx_popeval|5.023008||xcVu cx_popformat|5.023008||xcVu cx_popgiven|5.027008||xcVu cx_poploop|5.023008||xcVu CX_POP_SAVEARRAY|5.023008||Viu cx_popsub|5.023008||xcVu cx_popsub_args|5.023008||xcVu cx_popsub_common|5.023008||xcVu CX_POPSUBST|5.023008||Viu cx_popwhen|5.027008||xcVu CXp_REAL|5.005003||Viu CXp_SUB_RE|5.018000||Viu CXp_SUB_RE_FAKE|5.018000||Viu CXp_TRY|5.033007||Viu CXp_TRYBLOCK|5.006000||Viu cx_pushblock|5.023008||xcVu cx_pusheval|5.023008||xcVu cx_pushformat|5.023008||xcVu cx_pushgiven|5.027008||xcVu cx_pushloop_for|5.023008||xcVu cx_pushloop_plain|5.023008||xcVu cx_pushsub|5.023008||xcVu CX_PUSHSUB_GET_LVALUE_MASK|5.023008||Viu CX_PUSHSUBST|5.023008||Viu cx_pushtry|5.033007||xcVu cx_pushwhen|5.027008||xcVu CxREALEVAL|5.005003||Viu cxstack|5.005000||Viu cxstack_ix|5.005000||Viu cxstack_max|5.005000||Viu CXt_BLOCK|5.003007||Viu CXt_EVAL|5.003007||Viu CXt_FORMAT|5.006000||Viu CXt_GIVEN|5.027008||Viu CXt_LOOP_ARY|5.023008||Viu CXt_LOOP_LAZYIV|5.011000||Viu CXt_LOOP_LAZYSV|5.011000||Viu CXt_LOOP_LIST|5.023008||Viu CXt_LOOP_PLAIN|5.011000||Viu CXt_NULL|5.003007||Viu cx_topblock|5.023008||xcVu CxTRY|5.033007||Viu CxTRYBLOCK|5.006000||Viu CXt_SUB|5.003007||Viu CXt_SUBST|5.003007||Viu CXt_WHEN|5.027008||Viu CxTYPE|5.005003||Viu cx_type|5.009005||Viu CxTYPE_is_LOOP|5.011000||Viu CXTYPEMASK|5.005003||Viu dATARGET|5.003007||Viu dAX|5.007002|5.003007|p dAXMARK|5.009003|5.003007|p DAY_1|5.027010||Viu DAY_2|5.027010||Viu DAY_3|5.027010||Viu DAY_4|5.027010||Viu DAY_5|5.027010||Viu DAY_6|5.027010||Viu DAY_7|5.027010||Viu DB_Hash_t|5.003007|5.003007|Vn DBM_ckFilter|5.008001||Viu DBM_setFilter|5.008001||Viu DB_Prefix_t|5.003007|5.003007|Vn DBVARMG_COUNT|5.021005||Viu DBVARMG_SIGNAL|5.021005||Viu DBVARMG_SINGLE|5.021005||Viu DBVARMG_TRACE|5.021005||Viu DB_VERSION_MAJOR_CFG|5.007002|5.007002|Vn DB_VERSION_MINOR_CFG|5.007002|5.007002|Vn DB_VERSION_PATCH_CFG|5.007002|5.007002|Vn deb|5.007003|5.007003|vu deb_curcv|5.007002||Viu deb_nocontext|5.007003|5.007003|vnu debop|5.005000|5.005000|u debprof|5.005000||Viu debprofdump|5.005000|5.005000|u debstack|5.007003|5.007003|u deb_stack_all|5.008001||Viu deb_stack_n|5.008001||Viu debstackptrs|5.007003|5.007003|u DEBUG|5.003007||Viu DEBUG_A|5.009001||Viu DEBUG_A_FLAG|5.009001||Viu DEBUG_A_TEST|5.009001||Viu DEBUG_B|5.011000||Viu DEBUG_B_FLAG|5.011000||Viu DEBUG_BOTH_FLAGS_TEST|5.033007||Viu DEBUG_B_TEST|5.011000||Viu DEBUG_BUFFERS_r|5.009005||Viu DEBUG_c|5.003007||Viu DEBUG_C|5.009000||Viu DEBUG_c_FLAG|5.007001||Viu DEBUG_C_FLAG|5.009000||Viu DEBUG_COMPILE_r|5.009002||Viu DEBUG_c_TEST|5.007001||Viu DEBUG_C_TEST|5.009000||Viu DEBUG_D|5.003007||Viu DEBUG_DB_RECURSE_FLAG|5.007001||Viu DEBUG_D_FLAG|5.007001||Viu DEBUG_D_TEST|5.007001||Viu DEBUG_DUMP_PRE_OPTIMIZE_r|5.031004||Viu DEBUG_DUMP_r|5.009004||Viu DEBUG_EXECUTE_r|5.009002||Viu DEBUG_EXTRA_r|5.009004||Viu DEBUG_f|5.003007||Viu DEBUG_f_FLAG|5.007001||Viu DEBUG_FLAGS_r|5.009005||Viu DEBUG_f_TEST|5.007001||Viu DEBUG_GPOS_r|5.011000||Viu DEBUG_i|5.025002||Viu DEBUG_i_FLAG|5.025002||Viu DEBUG_INTUIT_r|5.009004||Viu DEBUG_i_TEST|5.025002||Viu DEBUG_J_FLAG|5.007003||Viu DEBUG_J_TEST|5.007003||Viu DEBUG_l|5.003007||Viu DEBUG_L|5.019009||Viu DEBUG_l_FLAG|5.007001||Viu DEBUG_L_FLAG|5.019009||Viu DEBUG_l_TEST|5.007001||Viu DEBUG_L_TEST|5.019009||Viu DEBUG_Lv|5.023003||Viu DEBUG_Lv_TEST|5.023003||Viu DEBUG_m|5.003007||Viu DEBUG_M|5.027008||Viu DEBUG_MASK|5.007001||Viu DEBUG_MATCH_r|5.009004||Viu DEBUG_m_FLAG|5.007001||Viu DEBUG_M_FLAG|5.027008||Viu DEBUG_m_TEST|5.007001||Viu DEBUG_M_TEST|5.027008||Viu DEBUG_o|5.003007||Viu DEBUG_OFFSETS_r|5.009002||Viu DEBUG_o_FLAG|5.007001||Viu DEBUG_OPTIMISE_MORE_r|5.009005||Viu DEBUG_OPTIMISE_r|5.009002||Viu DEBUG_o_TEST|5.007001||Viu DEBUG_P|5.003007||Viu DEBUG_p|5.003007||Viu DEBUG_PARSE_r|5.009004||Viu DEBUG_P_FLAG|5.007001||Viu DEBUG_p_FLAG|5.007001||Viu DEBUG_POST_STMTS|5.033008||Viu DEBUG_PRE_STMTS|5.033008||Viu DEBUG_P_TEST|5.007001||Viu DEBUG_p_TEST|5.007001||Viu DEBUG_Pv|5.013008||Viu DEBUG_Pv_TEST|5.013008||Viu DEBUG_q|5.009001||Viu DEBUG_q_FLAG|5.009001||Viu DEBUG_q_TEST|5.009001||Viu DEBUG_r|5.003007||Viu DEBUG_R|5.007001||Viu DEBUG_R_FLAG|5.007001||Viu DEBUG_r_FLAG|5.007001||Viu DEBUG_R_TEST|5.007001||Viu DEBUG_r_TEST|5.007001||Viu DEBUG_s|5.003007||Viu DEBUG_S|5.017002||Viu DEBUG_SBOX32_HASH|5.027001||Viu DEBUG_SCOPE|5.008001||Viu DEBUG_s_FLAG|5.007001||Viu DEBUG_S_FLAG|5.017002||Viu DEBUG_STACK_r|5.009005||Viu debug_start_match|5.009004||Viu DEBUG_STATE_r|5.009004||Viu DEBUG_s_TEST|5.007001||Viu DEBUG_S_TEST|5.017002||Viu DEBUG_t|5.003007||Viu DEBUG_T|5.007001||Viu DEBUG_TEST_r|5.021005||Viu DEBUG_T_FLAG|5.007001||Viu DEBUG_t_FLAG|5.007001||Viu DEBUG_TOP_FLAG|5.007001||Viu DEBUG_TRIE_COMPILE_MORE_r|5.009002||Viu DEBUG_TRIE_COMPILE_r|5.009002||Viu DEBUG_TRIE_EXECUTE_MORE_r|5.009002||Viu DEBUG_TRIE_EXECUTE_r|5.009002||Viu DEBUG_TRIE_r|5.009002||Viu DEBUG_T_TEST|5.007001||Viu DEBUG_t_TEST|5.007001||Viu DEBUG_u|5.003007||Viu DEBUG_U|5.009005||Viu DEBUG_u_FLAG|5.007001||Viu DEBUG_U_FLAG|5.009005||Viu DEBUG_u_TEST|5.007001||Viu DEBUG_U_TEST|5.009005||Viu DEBUG_Uv|5.009005||Viu DEBUG_Uv_TEST|5.009005||Viu DEBUG_v|5.008001||Viu DEBUG_v_FLAG|5.008001||Viu DEBUG_v_TEST|5.008001||Viu DEBUG_X|5.003007||Viu DEBUG_x|5.003007||Viu DEBUG_X_FLAG|5.007001||Viu DEBUG_x_FLAG|5.007001||Viu DEBUG_X_TEST|5.007001||Viu DEBUG_x_TEST|5.007001||Viu DEBUG_Xv|5.008001||Viu DEBUG_Xv_TEST|5.008001||Viu DEBUG_y|5.031007||Viu DEBUG_y_FLAG|5.031007||Viu DEBUG_y_TEST|5.031007||Viu DEBUG_yv|5.031007||Viu DEBUG_yv_TEST|5.031007||Viu DEBUG_ZAPHOD32_HASH|5.027001||Viu DECLARATION_FOR_LC_NUMERIC_MANIPULATION|5.021010|5.021010|p DECLARE_AND_GET_RE_DEBUG_FLAGS|5.031011||Viu DECLARE_AND_GET_RE_DEBUG_FLAGS_NON_REGEX|5.031011||Viu DEFAULT_INC_EXCLUDES_DOT|5.025011|5.025011|Vn DEFAULT_PAT_MOD|5.013006||Viu defelem_target|5.019002||Viu DEFINE_INC_MACROS|5.027006||Viu DEFINEP|5.009005||Viu DEFINEP_t8_p8|5.033003||Viu DEFINEP_t8_pb|5.033003||Viu DEFINEP_tb_p8|5.033003||Viu DEFINEP_tb_pb|5.033003||Viu DEFSV|5.004005|5.003007|p DEFSV_set|5.010001|5.003007|p delete_eval_scope|5.009004||xViu delimcpy|5.004000|5.004000|n delimcpy_no_escape|5.025005||cVni DEL_NATIVE|5.017010||Viu del_sv|5.005000||Viu DEPENDS_PAT_MOD|5.013009||Viu DEPENDS_PAT_MODS|5.013009||Viu deprecate|5.011001||Viu deprecate_disappears_in|5.025009||Viu deprecate_fatal_in|5.025009||Viu despatch_signals|5.007001||cVu destroy_matcher|5.027008||Viu DETACH|5.005000||Viu dEXT|5.003007||Viu dEXTCONST|5.004000||Viu D_FMT|5.027010||Viu DIE|5.003007||Viu die|5.006000|5.003007|v die_nocontext|5.006000||vVn die_sv|5.013001|5.003007|p die_unwind|5.013001||Viu Direntry_t|5.003007|5.003007|Vn dirp_dup|5.013007|5.013007|u dITEMS|5.007002|5.003007|p div128|5.005000||Viu dJMPENV|5.004000||Viu djSP|5.004005||Vi dMARK|5.003007|5.003007| DM_ARRAY_ISA|5.013002||Viu DM_DELAY|5.003007||Viu DM_EGID|5.003007||Viu DM_EUID|5.003007||Viu DM_GID|5.003007||Viu DM_RGID|5.003007||Viu DM_RUID|5.003007||Viu DM_UID|5.003007||Viu dMULTICALL|5.009003|5.009003| dMY_CXT|5.009000|5.009000|p dMY_CXT_INTERP|5.009003||Viu dMY_CXT_SV|5.007003|5.003007|pV dNOOP|5.006000|5.003007|p do_aexec|5.009003||Viu do_aexec5|5.006000||Viu do_aspawn|5.008000||Vu do_binmode|5.004005|5.004005|du docatch|5.005000||Vi do_chomp|5.003007||Viu do_close|5.003007|5.003007|u do_delete_local|5.011000||Viu do_dump_pad|5.008001||Vi do_eof|5.003007||Viu does_utf8_overflow|5.025006||Vniu doeval_compile|5.023008||Viu do_exec3|5.006000||Viu do_exec|5.009003||Viu dofile|5.005003||Viu dofindlabel|5.003007||Viu doform|5.005000||Viu do_gv_dump|5.006000||cVu do_gvgv_dump|5.006000||cVu do_hv_dump|5.006000||cVu doing_taint|5.008001||cVnu DOINIT|5.003007||Viu do_ipcctl|5.003007||Viu do_ipcget|5.003007||Viu do_join|5.003007|5.003007|u do_magic_dump|5.006000||cVu do_msgrcv|5.003007||Viu do_msgsnd|5.003007||Viu do_ncmp|5.015001||Viu do_oddball|5.006000||Viu dooneliner|5.006000||Viu do_op_dump|5.006000||cVu do_open|5.003007|5.003007|u do_open6|5.019010||xViu do_open9|5.006000|5.006000|du do_openn|5.007001|5.007001|u doopen_pm|5.008001||Viu do_open_raw|5.019010||xViu doparseform|5.005000||Viu do_pmop_dump|5.006000||cVu dopoptoeval|5.003007||Viu dopoptogivenfor|5.027008||Viu dopoptolabel|5.005000||Viu dopoptoloop|5.005000||Viu dopoptosub_at|5.005000||Viu dopoptowhen|5.027008||Viu do_print|5.003007||Viu do_readline|5.003007||Viu doref|5.009003|5.009003|u dORIGMARK|5.003007|5.003007| do_seek|5.003007||Viu do_semop|5.003007||Viu do_shmio|5.003007||Viu DOSISH|5.003007||Viu do_smartmatch|5.027008||Viu do_spawn|5.008000||Vu do_spawn_nowait|5.008000||Vu do_sprintf|5.003007|5.003007|u do_sv_dump|5.006000||cVu do_sysseek|5.004000||Viu do_tell|5.003007||Viu do_trans|5.003007||Viu do_trans_complex|5.006001||Viu do_trans_count|5.006001||Viu do_trans_count_invmap|5.031006||Viu do_trans_invmap|5.031006||Viu do_trans_simple|5.006001||Viu DOUBLE_BIG_ENDIAN|5.021009||Viu DOUBLE_HAS_INF|5.025003|5.025003|Vn DOUBLE_HAS_NAN|5.025003|5.025003|Vn DOUBLE_HAS_NEGATIVE_ZERO|5.025007|5.025007|Vn DOUBLE_HAS_SUBNORMALS|5.025007|5.025007|Vn DOUBLEINFBYTES|5.023000|5.023000|Vn DOUBLE_IS_CRAY_SINGLE_64_BIT|5.025006|5.025006|Vn DOUBLE_IS_IBM_DOUBLE_64_BIT|5.025006|5.025006|Vn DOUBLE_IS_IBM_SINGLE_32_BIT|5.025006|5.025006|Vn DOUBLE_IS_IEEE_754_128_BIT_BIG_ENDIAN|5.021006|5.021006|Vn DOUBLE_IS_IEEE_754_128_BIT_LITTLE_ENDIAN|5.021006|5.021006|Vn DOUBLE_IS_IEEE_754_32_BIT_BIG_ENDIAN|5.021006|5.021006|Vn DOUBLE_IS_IEEE_754_32_BIT_LITTLE_ENDIAN|5.021006|5.021006|Vn DOUBLE_IS_IEEE_754_64_BIT_BIG_ENDIAN|5.021006|5.021006|Vn DOUBLE_IS_IEEE_754_64_BIT_LITTLE_ENDIAN|5.021006|5.021006|Vn DOUBLE_IS_IEEE_754_64_BIT_MIXED_ENDIAN_BE_LE|5.021006|5.021006|Vn DOUBLE_IS_IEEE_754_64_BIT_MIXED_ENDIAN_LE_BE|5.021006|5.021006|Vn DOUBLE_IS_IEEE_FORMAT|5.025003||Viu DOUBLE_IS_UNKNOWN_FORMAT|5.021006|5.021006|Vn DOUBLE_IS_VAX_D_FLOAT|5.025003|5.025003|Vn DOUBLE_IS_VAX_F_FLOAT|5.025003|5.025003|Vn DOUBLE_IS_VAX_FLOAT|5.025003||Viu DOUBLE_IS_VAX_G_FLOAT|5.025003|5.025003|Vn DOUBLEKIND|5.021006|5.021006|Vn DOUBLE_LITTLE_ENDIAN|5.021009||Viu DOUBLEMANTBITS|5.023000|5.023000|Vn DOUBLE_MIX_ENDIAN|5.021009||Viu DOUBLENANBYTES|5.023000|5.023000|Vn DOUBLESIZE|5.005000|5.005000|Vn DOUBLE_STYLE_IEEE|5.025007|5.025007|Vn DOUBLE_VAX_ENDIAN|5.025003||Viu do_uniprop_match|5.031011||cVniu dounwind|5.003007|5.003007|u DO_UTF8|5.006000|5.006000| do_vecget|5.006000||Viu do_vecset|5.003007||Viu do_vop|5.003007||Viu dowantarray|5.003007|5.003007|u dPOPiv|5.003007||Viu dPOPnv|5.003007||Viu dPOPnv_nomg|5.013002||Viu dPOPPOPiirl|5.003007||Viu dPOPPOPnnrl|5.003007||Viu dPOPPOPssrl|5.003007||Viu dPOPss|5.003007||Viu dPOPTOPiirl|5.003007||Viu dPOPTOPiirl_nomg|5.013002||Viu dPOPTOPiirl_ul_nomg|5.013002||Viu dPOPTOPnnrl|5.003007||Viu dPOPTOPnnrl_nomg|5.013002||Viu dPOPTOPssrl|5.003007||Viu dPOPuv|5.004000||Viu dPOPXiirl|5.004000||Viu dPOPXiirl_ul_nomg|5.013002||Viu dPOPXnnrl|5.004000||Viu dPOPXssrl|5.004000||Viu DPTR2FPTR|5.009003||Viu Drand01|5.006000|5.006000| drand48_init_r|||cniu drand48_r|||cniu DRAND48_R_PROTO|5.008000|5.008000|Vn dSAVEDERRNO|5.010001||Vi dSAVE_ERRNO|5.010001||Vi dSP|5.003007|5.003007| dSS_ADD|5.017007||Viu dTARG|5.003007||Viu dTARGET|5.003007|5.003007| dTARGETSTACKED|5.003007||Viu D_T_FMT|5.027010||Viu dTHR|5.004005|5.003007|p dTHX|5.003007|5.003007|p dTHXa|5.006000|5.003007|p dTHX_DEBUGGING|5.027009||Viu dTHXo|5.006000||Viu dTHXoa|5.006001|5.003007|p dTHXR||5.003007|ponu dTHXs|5.007002||Viu dTHXx|5.006000||Viu dTOPiv|5.003007||Viu dTOPnv|5.003007||Viu dTOPss|5.003007||Viu dTOPuv|5.004000||Viu dtrace_probe_call|||ciu dtrace_probe_load|||ciu dtrace_probe_op|||ciu dtrace_probe_phase|||ciu dump_all|5.006000|5.006000| dump_all_perl|5.011000||Viu dump_c_backtrace|5.021001||V dump_eval|5.006000|5.006000|u dump_exec_pos|5.009004||Viu dump_form|5.006000|5.006000|u dump_indent|5.006000||vcVu dump_mstats|5.003007||Vu dump_packsubs|5.006000|5.006000| dump_packsubs_perl|5.011000||Viu dump_regex_sets_structures|5.025006||Viu dump_sub|5.006000|5.006000|u dump_sub_perl|5.011000||Viu dump_sv_child|5.009003||Viu dump_trie|5.009004||Viu dump_trie_interim_list|5.009004||Viu dump_trie_interim_table|5.009004||Viu dumpuntil|5.005000||Viu dump_vindent|5.006000||cVu dUNDERBAR|5.009002|5.003007|p dup2|5.005000||Viu dup|5.005000||Viu dup_attrlist|5.006000||Viu DUP_WARNINGS|5.009004||Viu dup_warnings|||ciu dVAR|5.009003|5.003007|p dXCPT|5.009002|5.003007|p dXSARGS|5.003007|5.003007| dXSBOOTARGSAPIVERCHK|5.021006||Viu dXSBOOTARGSNOVERCHK|5.021006||Viu dXSBOOTARGSXSAPIVERCHK|5.021006||Viu dXSFUNCTION|5.005000||Viu dXSI32|5.003007|5.003007|V dXSTARG|5.006000|5.003007|poVnu dXSUB_SYS|5.003007||Viu edit_distance|5.023008||Vniu EIGHT_BIT_UTF8_TO_NATIVE|5.023003||Viu ELEMENT_RANGE_MATCHES_INVLIST|5.023002||Viu EMBEDMYMALLOC|5.006000||Viu emulate_cop_io|||xciu emulate_setlocale|5.027009||Vniu END|5.003007||Viu END_EXTERN_C|5.005000|5.003007|pV endgrent|5.009000||Viu ENDGRENT_R_HAS_FPTR|5.008000||Viu ENDGRENT_R_PROTO|5.008000|5.008000|Vn endhostent|5.005000||Viu ENDHOSTENT_R_PROTO|5.008000|5.008000|Vn ENDLIKE|5.009005||Viu ENDLIKE_t8_p8|5.033003||Viu ENDLIKE_t8_pb|5.033003||Viu ENDLIKE_tb_p8|5.033003||Viu ENDLIKE_tb_pb|5.033003||Viu endnetent|5.005000||Viu ENDNETENT_R_PROTO|5.008000|5.008000|Vn endprotoent|5.005000||Viu ENDPROTOENT_R_PROTO|5.008000|5.008000|Vn endpwent|5.009000||Viu ENDPWENT_R_HAS_FPTR|5.008000||Viu ENDPWENT_R_PROTO|5.008000|5.008000|Vn endservent|5.005000||Viu ENDSERVENT_R_PROTO|5.008000|5.008000|Vn END_t8_p8|5.033003||Viu END_t8_pb|5.033003||Viu END_tb_p8|5.033003||Viu END_tb_pb|5.033003||Viu ENTER|5.003007|5.003007| ENTER_with_name|5.011002|5.011002| ENV_INIT|5.031011||Viu environ|5.003007||Viu ENV_LOCALE_LOCK|5.031011||Viu ENV_LOCALE_READ_LOCK|5.031011||Viu ENV_LOCALE_READ_UNLOCK|5.031011||Viu ENV_LOCALE_UNLOCK|5.031011||Viu ENV_LOCK|5.031011||Viu ENV_READ_LOCK|5.033005||Viu ENV_READ_UNLOCK|5.033005||Viu ENV_TERM|5.031011||Viu ENV_UNLOCK|5.031011||Viu EOF|5.003007||Viu EOF_NONBLOCK|5.003007|5.003007|Vn EOL|5.003007||Viu EOL_t8_p8|5.033003||Viu EOL_t8_pb|5.033003||Viu EOL_tb_p8|5.033003||Viu EOL_tb_pb|5.033003||Viu EOS|5.005000||Viu EOS_t8_p8|5.033003||Viu EOS_t8_pb|5.033003||Viu EOS_tb_p8|5.033003||Viu EOS_tb_pb|5.033003||Viu ERA|5.027010||Viu ERA_D_FMT|5.027010||Viu ERA_D_T_FMT|5.027010||Viu ERA_T_FMT|5.027010||Viu ERRSV|5.004005|5.003007|p ESC_NATIVE|5.021004||Viu EVAL|5.005000||Viu EVAL_B|5.025010||Viu EVAL_B_fail|5.025010||Viu EVAL_B_fail_t8_p8|5.033003||Viu EVAL_B_fail_t8_pb|5.033003||Viu EVAL_B_fail_tb_p8|5.033003||Viu EVAL_B_fail_tb_pb|5.033003||Viu EVAL_B_t8_p8|5.033003||Viu EVAL_B_t8_pb|5.033003||Viu EVAL_B_tb_p8|5.033003||Viu EVAL_B_tb_pb|5.033003||Viu EVAL_INEVAL|5.006000||Viu EVAL_INREQUIRE|5.007001||Viu EVAL_KEEPERR|5.006000||Viu EVAL_NULL|5.006000||Viu EVAL_postponed_AB|5.025010||Viu EVAL_postponed_AB_fail|5.025010||Viu EVAL_postponed_AB_fail_t8_p8|5.033003||Viu EVAL_postponed_AB_fail_t8_pb|5.033003||Viu EVAL_postponed_AB_fail_tb_p8|5.033003||Viu EVAL_postponed_AB_fail_tb_pb|5.033003||Viu EVAL_postponed_AB_t8_p8|5.033003||Viu EVAL_postponed_AB_t8_pb|5.033003||Viu EVAL_postponed_AB_tb_p8|5.033003||Viu EVAL_postponed_AB_tb_pb|5.033003||Viu eval_pv|5.006000|5.003007|p EVAL_RE_REPARSING|5.017011||Viu eval_sv|5.006000|5.003007|p EVAL_t8_p8|5.033003||Viu EVAL_t8_pb|5.033003||Viu EVAL_tb_p8|5.033003||Viu EVAL_tb_pb|5.033003||Viu EVAL_WARNONLY|5.006000||Viu EXACT|5.004000||Viu EXACTF|5.004000||Viu EXACTFAA|5.027009||Viu EXACTFAA_NO_TRIE|5.027009||Viu EXACTFAA_NO_TRIE_t8_p8|5.033003||Viu EXACTFAA_NO_TRIE_t8_pb|5.033003||Viu EXACTFAA_NO_TRIE_tb_p8|5.033003||Viu EXACTFAA_NO_TRIE_tb_pb|5.033003||Viu EXACTFAA_t8_p8|5.033003||Viu EXACTFAA_t8_pb|5.033003||Viu EXACTFAA_tb_p8|5.033003||Viu EXACTFAA_tb_pb|5.033003||Viu EXACTFL|5.004000||Viu EXACTFL_t8_p8|5.033003||Viu EXACTFL_t8_pb|5.033003||Viu EXACTFL_tb_p8|5.033003||Viu EXACTFL_tb_pb|5.033003||Viu EXACTFLU8|5.021008||Viu EXACTFLU8_t8_p8|5.033003||Viu EXACTFLU8_t8_pb|5.033003||Viu EXACTFLU8_tb_p8|5.033003||Viu EXACTFLU8_tb_pb|5.033003||Viu EXACTF_t8_p8|5.033003||Viu EXACTF_t8_pb|5.033003||Viu EXACTF_tb_p8|5.033003||Viu EXACTF_tb_pb|5.033003||Viu EXACTFU|5.013008||Viu EXACTFUP|5.029007||Viu EXACTFUP_t8_p8|5.033003||Viu EXACTFUP_t8_pb|5.033003||Viu EXACTFUP_tb_p8|5.033003||Viu EXACTFUP_tb_pb|5.033003||Viu EXACTFU_REQ8|5.031006||Viu EXACTFU_REQ8_t8_p8|5.033003||Viu EXACTFU_REQ8_t8_pb|5.033003||Viu EXACTFU_REQ8_tb_p8|5.033003||Viu EXACTFU_REQ8_tb_pb|5.033003||Viu EXACTFU_S_EDGE|5.029007||Viu EXACTFU_S_EDGE_t8_p8|5.033003||Viu EXACTFU_S_EDGE_t8_pb|5.033003||Viu EXACTFU_S_EDGE_tb_p8|5.033003||Viu EXACTFU_S_EDGE_tb_pb|5.033003||Viu EXACTFU_t8_p8|5.033003||Viu EXACTFU_t8_pb|5.033003||Viu EXACTFU_tb_p8|5.033003||Viu EXACTFU_tb_pb|5.033003||Viu EXACTL|5.021008||Viu EXACTL_t8_p8|5.033003||Viu EXACTL_t8_pb|5.033003||Viu EXACTL_tb_p8|5.033003||Viu EXACTL_tb_pb|5.033003||Viu EXACT_REQ8|5.031006||Viu EXACT_REQ8_t8_p8|5.033003||Viu EXACT_REQ8_t8_pb|5.033003||Viu EXACT_REQ8_tb_p8|5.033003||Viu EXACT_REQ8_tb_pb|5.033003||Viu EXACT_t8_p8|5.033003||Viu EXACT_t8_pb|5.033003||Viu EXACT_tb_p8|5.033003||Viu EXACT_tb_pb|5.033003||Viu EXEC_ARGV_CAST|5.007001||Viu exec_failed|5.009004||Viu execl|5.005000||Viu EXEC_PAT_MOD|5.009005||Viu EXEC_PAT_MODS|5.009005||Viu execute_wildcard|5.031010||Viu execv|5.005000||Viu execvp|5.005000||Viu exit|5.005000||Viu EXPECT|5.009004||Viu expect_number|5.007001||Viu EXT|5.003007||Viu EXTCONST|5.004000||Viu EXTEND|5.003007|5.003007| EXTEND_HWM_SET|5.027002||Viu EXTEND_MORTAL|5.004000||Viu EXTEND_SKIP|5.027002||Viu EXTERN_C|5.005000|5.003007|pV EXT_MGVTBL|5.009004||Viu EXT_PAT_MODS|5.009005||Viu EXTRA_SIZE|5.005000||Viu EXTRA_STEP_2ARGS|5.005000||Viu F0convert|5.009003||Vniu FAKE_BIT_BUCKET|5.009005||Viu FAKE_DEFAULT_SIGNAL_HANDLERS|5.009003||Viu FAKE_PERSISTENT_SIGNAL_HANDLERS|5.009003||Viu FALSE|5.003007||Viu FATAL_ABOVE_FF_MSG|5.027010||Viu F_atan2_amg|5.004000||Viu FBMcf_TAIL|5.006000||Viu FBMcf_TAIL_DOLLAR|5.006000||Viu FBMcf_TAIL_DOLLARM|5.006000||Viu FBMcf_TAIL_Z|5.006000||Viu FBMcf_TAIL_z|5.006000||Viu fbm_compile|5.005000|5.005000| fbm_instr|5.005000|5.005000| FBMrf_MULTILINE|5.006000||Viu fclose|5.003007||Viu fcntl|5.006000||Viu FCNTL_CAN_LOCK|5.007001|5.007001|Vn F_cos_amg|5.004000||Viu FD_CLR|5.008000||Viu FD_ISSET|5.008000||Viu fdopen|5.003007||Viu FD_SET|5.008000||Viu fd_set|5.008000||Viu FD_ZERO|5.008000||Viu FEATURE_BAREWORD_FILEHANDLES_BIT|5.033006||Viu FEATURE_BAREWORD_FILEHANDLES_IS_ENABLED|5.033006||Viu FEATURE_BITWISE_BIT|5.031006||Viu FEATURE_BITWISE_IS_ENABLED|5.021009||Viu FEATURE_BUNDLE_510|5.015007||Viu FEATURE_BUNDLE_511|5.015007||Viu FEATURE_BUNDLE_515|5.015007||Viu FEATURE_BUNDLE_523|5.023001||Viu FEATURE_BUNDLE_527|5.027008||Viu FEATURE_BUNDLE_CUSTOM|5.015007||Viu FEATURE_BUNDLE_DEFAULT|5.015007||Viu FEATURE_EVALBYTES_BIT|5.031006||Viu FEATURE_EVALBYTES_IS_ENABLED|5.015007||Viu FEATURE_FC_BIT|5.031006||Viu FEATURE_FC_IS_ENABLED|5.015008||Viu FEATURE_INDIRECT_BIT|5.031010||Viu FEATURE_INDIRECT_IS_ENABLED|5.031010||Viu FEATURE_ISA_BIT|5.031007||Viu FEATURE_ISA_IS_ENABLED|5.031007||Viu FEATURE_IS_ENABLED_MASK|5.031006||Viu FEATURE_MULTIDIMENSIONAL_BIT|5.033001||Viu FEATURE_MULTIDIMENSIONAL_IS_ENABLED|5.033001||Viu FEATURE_MYREF_BIT|5.031006||Viu FEATURE_MYREF_IS_ENABLED|5.025003||Viu FEATURE_POSTDEREF_QQ_BIT|5.031006||Viu FEATURE_POSTDEREF_QQ_IS_ENABLED|5.019005||Viu FEATURE_REFALIASING_BIT|5.031006||Viu FEATURE_REFALIASING_IS_ENABLED|5.021005||Viu FEATURE_SAY_BIT|5.031006||Viu FEATURE_SAY_IS_ENABLED|5.015007||Viu FEATURE_SIGNATURES_BIT|5.031006||Viu FEATURE_SIGNATURES_IS_ENABLED|5.019009||Viu FEATURE_STATE_BIT|5.031006||Viu FEATURE_STATE_IS_ENABLED|5.015007||Viu FEATURE___SUB___BIT|5.031006||Viu FEATURE___SUB___IS_ENABLED|5.015007||Viu FEATURE_SWITCH_BIT|5.031006||Viu FEATURE_SWITCH_IS_ENABLED|5.015007||Viu FEATURE_TRY_BIT|5.033007||Viu FEATURE_TRY_IS_ENABLED|5.033007||Viu FEATURE_UNICODE_BIT|5.031006||Viu FEATURE_UNICODE_IS_ENABLED|5.015007||Viu FEATURE_UNIEVAL_BIT|5.031006||Viu FEATURE_UNIEVAL_IS_ENABLED|5.015007||Viu feof|5.003007||Viu ferror|5.003007||Viu FETCHFEATUREBITSHH|5.031006||Viu F_exp_amg|5.004000||Viu FF_0DECIMAL|5.007001||Viu FF_BLANK|5.003007||Viu FF_CHECKCHOP|5.003007||Viu FF_CHECKNL|5.003007||Viu FF_CHOP|5.003007||Viu FF_DECIMAL|5.003007||Viu FF_END|5.003007||Viu FF_FETCH|5.003007||Viu FF_HALFSPACE|5.003007||Viu FF_ITEM|5.003007||Viu FF_LINEGLOB|5.003007||Viu FF_LINEMARK|5.003007||Viu FF_LINESNGL|5.009001||Viu FF_LITERAL|5.003007||Viu Fflush|5.003007||Viu fflush|5.003007||Viu FFLUSH_NULL|5.006000|5.006000|Vn FF_MORE|5.003007||Viu FF_NEWLINE|5.003007||Viu FF_SKIP|5.003007||Viu FF_SPACE|5.003007||Viu fgetc|5.003007||Viu fgetpos|5.003007||Viu fgets|5.003007||Viu FILE|5.003007||Viu FILE_base|5.007000|5.007000| FILE_bufsiz|5.007000|5.007000| FILE_cnt|5.007000|5.007000| fileno|5.003007||Viu FILE_ptr|5.007000|5.007000| FILL_ADVANCE_NODE_2L_ARG|5.021005||Viu FILL_ADVANCE_NODE|5.005000||Viu FILL_ADVANCE_NODE_ARG|5.005000||Viu FILL_ADVANCE_NODE_ARGp|5.031010||Viu FILL_NODE|5.029004||Viu filter_add|5.003007|5.003007| FILTER_DATA|5.003007||Viu filter_del|5.003007|5.003007|u filter_gets|5.005000||Viu FILTER_ISREADER|5.003007||Viu filter_read|5.003007|5.003007| FILTER_READ|5.003007||Viu finalize_op|5.015002||Viu finalize_optree|5.015002||Vi find_and_forget_pmops|5.009005||Viu find_array_subscript|5.009004||Viu find_beginning|5.005000||Viu find_byclass|5.006000||Viu find_default_stash|5.019004||Viu find_first_differing_byte_pos|5.031007||Vniu find_hash_subscript|5.009004||Viu find_in_my_stash|5.006001||Viu find_lexical_cv|5.019001||Viu find_next_masked|5.027009||Vniu find_runcv|5.008001|5.008001| FIND_RUNCV_level_eq|5.017002||Viu FIND_RUNCV_padid_eq|5.017004||Viu find_runcv_where|5.017002||Viu find_rundefsv|5.013002|5.013002| find_rundefsvoffset|5.009002|5.009002|d find_script|5.004005||Viu find_span_end|5.027009||Vniu find_span_end_mask|5.027009||Vniu find_uninit_var|5.009002||xVi FIRST_NON_ASCII_DECIMAL_DIGIT|5.027007||Viu first_symbol|5.009003||Vniu FITS_IN_8_BITS|5.013005||Viu fixup_errno_string|5.019007||Viu FLAGS|5.013006||Viu FLEXFILENAMES|5.003007|5.003007|Vn float_end_shift|5.009005||Viu float_max_offset|5.005000||Viu float_min_offset|5.005000||Viu float_substr|5.005000||Viu float_utf8|5.008000||Viu flock|5.005000||Viu flockfile|5.003007||Viu F_log_amg|5.004000||Viu FmLINES|5.003007||Viu fold_constants|5.003007||Viu foldEQ|5.013002|5.013002|n foldEQ_latin1|5.013008||cVnu foldEQ_latin1_s2_folded|5.029007||Vniu foldEQ_locale|5.013002|5.013002|n FOLDEQ_LOCALE|5.019009||cV FOLDEQ_S1_ALREADY_FOLDED|5.015004||cV FOLDEQ_S1_FOLDS_SANE|5.021008||cV FOLDEQ_S2_ALREADY_FOLDED|5.015004||cV FOLDEQ_S2_FOLDS_SANE|5.021008||cV foldEQ_utf8|5.013002|5.007003|p foldEQ_utf8_flags|5.013010||cVu FOLDEQ_UTF8_NOMIX_ASCII|5.013010||cV FOLD_FLAGS_FULL|5.015006||Viu FOLD_FLAGS_LOCALE|5.015006||Viu FOLD_FLAGS_NOMIX_ASCII|5.017000||Viu fopen|5.003007||Viu forbid_setid|5.005000||Viu force_ident|5.003007||Viu force_ident_maybe_lex|5.017004||Viu force_list|5.003007||Viu force_next|5.003007||Viu _force_out_malformed_utf8_message|5.025009||cVu force_strict_version|5.011004||Viu force_version|5.005000||Viu force_word|5.003007||Viu forget_pmop|5.017007||Viu form|5.006000|5.004000|v form_alien_digit_msg|5.031009||cViu form_cp_too_large_msg|5.031009||cViu form_nocontext|5.006000||vVn fp_dup|5.007003|5.007003|u Fpos_t|5.003007|5.003007|Vn F_pow_amg|5.004000||Viu FP_PINF|5.021004||Viu FP_QNAN|5.021004||Viu fprintf|5.003007||Viu fprintf_nocontext|5.006000||vdVnu FPTR2DPTR|5.009003||Viu fputc|5.003007||Viu fputs|5.003007||Viu fread|5.003007||Viu free|5.003007||Viu free_and_set_cop_warnings|5.031011||Viu free_c_backtrace|5.021001||Vi FreeOp|5.008001||Viu Free_t|5.003007|5.003007|Vn FREE_THREAD_KEY|5.006001||Viu free_tied_hv_pool|5.008001||Viu FREETMPS|5.003007|5.003007| free_tmps|5.003007||cVu freopen|5.003007||Viu frewind|5.005000||Viu FROM_INTERNAL_SIZE|5.023002||Viu fscanf|5.003007||Viu fseek|5.003007||Viu FSEEKSIZE|5.006000||Viu fsetpos|5.003007||Viu F_sin_amg|5.004000||Viu F_sqrt_amg|5.004000||Viu Fstat|5.003007||Viu fstat|5.005000||Viu ftell|5.003007||Viu ftruncate|5.006000||Viu ftrylockfile|5.003007||Viu FUNCTION|5.009003||Viu funlockfile|5.003007||Viu fwrite1|5.003007||Viu fwrite|5.003007||Viu G_ARRAY|5.003007||Viu GCB_BREAKABLE|5.025003||Viu GCB_EX_then_EM|5.025003||Viu GCB_Maybe_Emoji_NonBreak|5.029002||Viu GCB_NOBREAK|5.025003||Viu GCB_RI_then_RI|5.025003||Viu GCC_DIAG_IGNORE|5.019007||Viu GCC_DIAG_IGNORE_DECL|5.027007||Viu GCC_DIAG_IGNORE_STMT|5.027007||Viu GCC_DIAG_PRAGMA|5.021001||Viu GCC_DIAG_RESTORE|5.019007||Viu GCC_DIAG_RESTORE_DECL|5.027007||Viu GCC_DIAG_RESTORE_STMT|5.027007||Viu Gconvert|5.003007|5.003007| GDBMNDBM_H_USES_PROTOTYPES|5.032001|5.032001|Vn G_DISCARD|5.003007|5.003007| gen_constant_list|5.003007||Viu get_and_check_backslash_N_name|5.017006||cViu get_and_check_backslash_N_name_wrapper|5.029009||Viu get_ANYOF_cp_list_for_ssc|5.019005||Viu get_ANYOFM_contents|5.027009||Viu GETATARGET|5.003007||Viu get_aux_mg|5.011000||Viu get_av|5.006000|5.003007|p getc|5.003007||Viu get_c_backtrace|5.021001||Vi get_c_backtrace_dump|5.021001||V get_context|5.006000|5.006000|nu getc_unlocked|5.003007||Viu get_cv|5.006000|5.003007|p get_cvn_flags|5.009005|5.003007|p get_cvs|5.011000|5.003007|p getcwd_sv|5.007002|5.007002| get_db_sub|||iu get_debug_opts|5.008001||Viu get_deprecated_property_msg|5.031011||cVniu getegid|5.005000||Viu getenv|5.005000||Viu getenv_len|5.006000||Viu GETENV_LOCK|5.033005||Viu GETENV_PRESERVES_OTHER_THREAD|5.033005|5.033005|Vn GETENV_UNLOCK|5.033005||Viu geteuid|5.005000||Viu getgid|5.005000||Viu getgrent|5.009000||Viu GETGRENT_R_HAS_BUFFER|5.008000||Viu GETGRENT_R_HAS_FPTR|5.008000||Viu GETGRENT_R_HAS_PTR|5.008000||Viu GETGRENT_R_PROTO|5.008000|5.008000|Vn getgrgid|5.009000||Viu GETGRGID_R_HAS_BUFFER|5.008000||Viu GETGRGID_R_HAS_PTR|5.008000||Viu GETGRGID_R_PROTO|5.008000|5.008000|Vn getgrnam|5.009000||Viu GETGRNAM_R_HAS_BUFFER|5.008000||Viu GETGRNAM_R_HAS_PTR|5.008000||Viu GETGRNAM_R_PROTO|5.008000|5.008000|Vn get_hash_seed|5.008001||Viu gethostbyaddr|5.005000||Viu GETHOSTBYADDR_R_HAS_BUFFER|5.008000||Viu GETHOSTBYADDR_R_HAS_ERRNO|5.008000||Viu GETHOSTBYADDR_R_HAS_PTR|5.008000||Viu GETHOSTBYADDR_R_PROTO|5.008000|5.008000|Vn gethostbyname|5.005000||Viu GETHOSTBYNAME_R_HAS_BUFFER|5.008000||Viu GETHOSTBYNAME_R_HAS_ERRNO|5.008000||Viu GETHOSTBYNAME_R_HAS_PTR|5.008000||Viu GETHOSTBYNAME_R_PROTO|5.008000|5.008000|Vn gethostent|5.005000||Viu GETHOSTENT_R_HAS_BUFFER|5.008000||Viu GETHOSTENT_R_HAS_ERRNO|5.008000||Viu GETHOSTENT_R_HAS_PTR|5.008000||Viu GETHOSTENT_R_PROTO|5.008000|5.008000|Vn gethostname|5.005000||Viu get_hv|5.006000|5.003007|p get_invlist_iter_addr|5.015001||Vniu get_invlist_offset_addr|5.019002||Vniu get_invlist_previous_index_addr|5.017004||Vniu getlogin|5.005000||Viu GETLOGIN_R_PROTO|5.008000|5.008000|Vn get_mstats|5.006000||Vu getnetbyaddr|5.005000||Viu GETNETBYADDR_R_HAS_BUFFER|5.008000||Viu GETNETBYADDR_R_HAS_ERRNO|5.008000||Viu GETNETBYADDR_R_HAS_PTR|5.008000||Viu GETNETBYADDR_R_PROTO|5.008000|5.008000|Vn getnetbyname|5.005000||Viu GETNETBYNAME_R_HAS_BUFFER|5.008000||Viu GETNETBYNAME_R_HAS_ERRNO|5.008000||Viu GETNETBYNAME_R_HAS_PTR|5.008000||Viu GETNETBYNAME_R_PROTO|5.008000|5.008000|Vn getnetent|5.005000||Viu GETNETENT_R_HAS_BUFFER|5.008000||Viu GETNETENT_R_HAS_ERRNO|5.008000||Viu GETNETENT_R_HAS_PTR|5.008000||Viu GETNETENT_R_PROTO|5.008000|5.008000|Vn get_no_modify|5.005000||Viu get_num|5.008001||Viu get_opargs|5.005000||Viu get_op_descs|5.005000|5.005000|u get_op_names|5.005000|5.005000|u getpeername|5.005000||Viu getpid|5.006000||Viu get_ppaddr|5.006000|5.006000|u get_prop_definition|5.031011||cViu get_prop_values|5.031011||cVniu getprotobyname|5.005000||Viu GETPROTOBYNAME_R_HAS_BUFFER|5.008000||Viu GETPROTOBYNAME_R_HAS_PTR|5.008000||Viu GETPROTOBYNAME_R_PROTO|5.008000|5.008000|Vn getprotobynumber|5.005000||Viu GETPROTOBYNUMBER_R_HAS_BUFFER|5.008000||Viu GETPROTOBYNUMBER_R_HAS_PTR|5.008000||Viu GETPROTOBYNUMBER_R_PROTO|5.008000|5.008000|Vn getprotoent|5.005000||Viu GETPROTOENT_R_HAS_BUFFER|5.008000||Viu GETPROTOENT_R_HAS_PTR|5.008000||Viu GETPROTOENT_R_PROTO|5.008000|5.008000|Vn getpwent|5.009000||Viu GETPWENT_R_HAS_BUFFER|5.008000||Viu GETPWENT_R_HAS_FPTR|5.008000||Viu GETPWENT_R_HAS_PTR|5.008000||Viu GETPWENT_R_PROTO|5.008000|5.008000|Vn getpwnam|5.009000||Viu GETPWNAM_R_HAS_BUFFER|5.008000||Viu GETPWNAM_R_HAS_PTR|5.008000||Viu GETPWNAM_R_PROTO|5.008000|5.008000|Vn getpwuid|5.009000||Viu GETPWUID_R_HAS_PTR|5.008000||Viu GETPWUID_R_PROTO|5.008000|5.008000|Vn get_quantifier_value|5.033006||Viu get_re_arg|||xciu get_re_gclass_nonbitmap_data|5.031011||Viu get_regclass_nonbitmap_data|5.031011||Viu get_regex_charset_name|5.031004||Vniu getservbyname|5.005000||Viu GETSERVBYNAME_R_HAS_BUFFER|5.008000||Viu GETSERVBYNAME_R_HAS_PTR|5.008000||Viu GETSERVBYNAME_R_PROTO|5.008000|5.008000|Vn getservbyport|5.005000||Viu GETSERVBYPORT_R_HAS_BUFFER|5.008000||Viu GETSERVBYPORT_R_HAS_PTR|5.008000||Viu GETSERVBYPORT_R_PROTO|5.008000|5.008000|Vn getservent|5.005000||Viu GETSERVENT_R_HAS_BUFFER|5.008000||Viu GETSERVENT_R_HAS_PTR|5.008000||Viu GETSERVENT_R_PROTO|5.008000|5.008000|Vn getsockname|5.005000||Viu getsockopt|5.005000||Viu getspnam|5.009000||Viu GETSPNAM_R_HAS_BUFFER|5.031011||Viu GETSPNAM_R_HAS_PTR|5.008000||Viu GETSPNAM_R_PROTO|5.008000|5.008000|Vn get_sv|5.006000|5.003007|p GETTARGET|5.003007||Viu GETTARGETSTACKED|5.003007||Viu gettimeofday|5.008000||Viu getuid|5.005000||Viu get_vtbl|5.005003|5.005003|u getw|5.003007||Viu G_EVAL|5.003007|5.003007| G_FAKINGEVAL|5.009004||Viu Gid_t|5.003007|5.003007|Vn Gid_t_f|5.006000|5.006000|Vn Gid_t_sign|5.006000|5.006000|Vn Gid_t_size|5.006000|5.006000|Vn GIMME|5.003007|5.003007|d GIMME_V|5.004000|5.004000| gimme_V|5.031005||xcVu G_KEEPERR|5.003007|5.003007| G_LIST|5.035001|5.003007| glob_2number|5.009004||Viu GLOBAL_PAT_MOD|5.009005||Viu glob_assign_glob|5.009004||Viu G_METHOD|5.006001|5.003007|p G_METHOD_NAMED|5.019002|5.019002| gmtime|5.031011||Viu GMTIME_MAX|5.010001|5.010001|Vn GMTIME_MIN|5.010001|5.010001|Vn GMTIME_R_PROTO|5.008000|5.008000|Vn G_NOARGS|5.003007|5.003007| G_NODEBUG|5.004005||Viu GOSUB|5.009005||Viu GOSUB_t8_p8|5.033003||Viu GOSUB_t8_pb|5.033003||Viu GOSUB_tb_p8|5.033003||Viu GOSUB_tb_pb|5.033003||Viu gp_dup|5.007003|5.007003|u gp_free|5.003007|5.003007|u GPOS|5.004000||Viu GPOS_t8_p8|5.033003||Viu GPOS_t8_pb|5.033003||Viu GPOS_tb_p8|5.033003||Viu GPOS_tb_pb|5.033003||Viu gp_ref|5.003007|5.003007|u GREEK_CAPITAL_LETTER_MU|5.013011||Viu GREEK_SMALL_LETTER_MU|5.013008||Viu G_RE_REPARSING|5.017011||Viu G_RETHROW|5.031002|5.003007|p grok_atoUV|5.021010||cVni grok_bin|5.007003|5.003007|p grok_bin_oct_hex|5.031008||cVu grok_bslash_c|5.013001||cViu grok_bslash_N|5.017003||Viu grok_bslash_o|5.013003||cViu grok_bslash_x|5.017002||cViu grok_hex|5.007003|5.003007|p grok_infnan|5.021004|5.021004| grok_number|5.007002|5.003007|p grok_number_flags|5.021002|5.021002| GROK_NUMERIC_RADIX|5.007002|5.003007|p grok_numeric_radix|5.007002|5.003007|p grok_oct|5.007003|5.003007|p group_end|5.007003||Viu GROUPP|5.005000||Viu GROUPPN|5.031001||Viu GROUPPN_t8_p8|5.033003||Viu GROUPPN_t8_pb|5.033003||Viu GROUPPN_tb_p8|5.033003||Viu GROUPPN_tb_pb|5.033003||Viu GROUPP_t8_p8|5.033003||Viu GROUPP_t8_pb|5.033003||Viu GROUPP_tb_p8|5.033003||Viu GROUPP_tb_pb|5.033003||Viu Groups_t|5.003007|5.003007|Vn GRPASSWD|5.005000|5.005000|Vn G_SCALAR|5.003007|5.003007| G_UNDEF_FILL|5.013001||Viu GV_ADD|5.003007|5.003007| gv_add_by_type|5.011000|5.011000|u GV_ADDMG|5.015003|5.015003| GV_ADDMULTI|5.003007|5.003007| GV_ADDWARN|5.003007|5.003007| Gv_AMG|5.003007||Viu Gv_AMupdate|5.011000|5.011000|u GvASSUMECV|5.003007||Viu GvASSUMECV_off|5.003007||Viu GvASSUMECV_on|5.003007||Viu gv_autoload4|5.004000|5.004000| GV_AUTOLOAD|5.011000||Viu GV_AUTOLOAD_ISMETHOD|5.015004||Viu gv_autoload_pv|5.015004|5.015004|u gv_autoload_pvn|5.015004|5.015004|u gv_autoload_sv|5.015004|5.015004|u GvAV|5.003007|5.003007| gv_AVadd|5.003007|5.003007|u GvAVn|5.003007||Viu GV_CACHE_ONLY|5.021004||Vi gv_check|5.003007||cVu gv_const_sv|5.009003|5.009003| GV_CROAK|5.011000||Viu GvCV|5.003007|5.003007| GvCVGEN|5.003007||Viu GvCV_set|5.013010||Viu GvCVu|5.004000||Viu gv_dump|5.006000|5.006000|u gv_efullname3|5.003007|5.003007|u gv_efullname4|5.006001|5.006001|u gv_efullname|5.003007|5.003007|du GvEGV|5.003007||Viu GvEGVx|5.013000||Viu GvENAME|5.003007||Viu GvENAME_HEK|5.015004||Viu GvENAMELEN|5.015004||Viu GvENAMEUTF8|5.015004||Viu GvESTASH|5.003007||Viu GVf_ASSUMECV|5.003007||Viu gv_fetchfile|5.003007|5.003007| gv_fetchfile_flags|5.009005|5.009005| gv_fetchmeth|5.003007|5.003007| gv_fetchmeth_autoload|5.007003|5.007003| gv_fetchmeth_internal|5.021007||Viu gv_fetchmethod|5.003007|5.003007| gv_fetchmethod_autoload|5.004000|5.004000| gv_fetchmethod_flags|5.015004||Viu gv_fetchmethod_pv_flags|5.015004|5.015004|xu gv_fetchmethod_pvn_flags|5.015004|5.015004|xu gv_fetchmethod_sv_flags|5.015004|5.015004|xu gv_fetchmeth_pv|5.015004|5.015004| gv_fetchmeth_pv_autoload|5.015004|5.015004| gv_fetchmeth_pvn|5.015004|5.015004| gv_fetchmeth_pvn_autoload|5.015004|5.015004| gv_fetchmeth_sv|5.015004|5.015004| gv_fetchmeth_sv_autoload|5.015004|5.015004| gv_fetchpv|5.003007|5.003007| gv_fetchpvn|5.013006|5.013006| gv_fetchpvn_flags|5.009002|5.003007|p gv_fetchpvs|5.009004|5.003007|p gv_fetchsv|5.009002|5.003007|p gv_fetchsv_nomg|5.015003|5.015003| GvFILE|5.006000||Viu GvFILEGV|5.003007||Viu GvFILE_HEK|5.009004||Viu GvFILEx|5.019006||Viu GVf_IMPORTED|5.003007||Viu GVf_IMPORTED_AV|5.003007||Viu GVf_IMPORTED_CV|5.003007||Viu GVf_IMPORTED_HV|5.003007||Viu GVf_IMPORTED_SV|5.003007||Viu GVf_INTRO|5.003007||Viu GvFLAGS|5.003007||Viu GVf_MULTI|5.003007||Viu GvFORM|5.003007||Viu gv_fullname3|5.003007|5.003007|u gv_fullname4|5.006001|5.006001|u gv_fullname|5.003007|5.003007|du GvGP|5.003007||Viu GvGPFLAGS|5.021004||Viu GvGP_set|5.013010||Viu gv_handler|5.007001|5.007001|u GvHV|5.003007|5.003007| gv_HVadd|5.003007|5.003007|u GvHVn|5.003007||Viu GvIMPORTED|5.003007||Viu GvIMPORTED_AV|5.003007||Viu GvIMPORTED_AV_off|5.003007||Viu GvIMPORTED_AV_on|5.003007||Viu GvIMPORTED_CV|5.003007||Viu GvIMPORTED_CV_off|5.003007||Viu GvIMPORTED_CV_on|5.003007||Viu GvIMPORTED_HV|5.003007||Viu GvIMPORTED_HV_off|5.003007||Viu GvIMPORTED_HV_on|5.003007||Viu GvIMPORTED_off|5.003007||Viu GvIMPORTED_on|5.003007||Viu GvIMPORTED_SV|5.003007||Viu GvIMPORTED_SV_off|5.003007||Viu GvIMPORTED_SV_on|5.003007||Viu gv_init|5.003007|5.003007| gv_init_pv|5.015004|5.015004| gv_init_pvn|5.015004|5.003007|p gv_init_sv|5.015004|5.015004| gv_init_svtype|5.015004||Viu GvIN_PAD|5.006000||Viu GvIN_PAD_off|5.006000||Viu GvIN_PAD_on|5.006000||Viu GvINTRO|5.003007||Viu GvINTRO_off|5.003007||Viu GvINTRO_on|5.003007||Viu GvIO|5.003007||Viu gv_IOadd|5.003007|5.003007|u GvIOn|5.003007||Viu GvIOp|5.003007||Viu gv_is_in_main|5.019004||Viu GvLINE|5.003007||Viu gv_magicalize|5.019004||Viu gv_magicalize_isa|5.013005||Viu gv_method_changed|5.017007||Viu GvMULTI|5.003007||Viu GvMULTI_off|5.003007||Viu GvMULTI_on|5.003007||Viu GvNAME|5.003007||Viu GvNAME_get|5.009004||Viu GvNAME_HEK|5.009004||Viu GvNAMELEN|5.003007||Viu GvNAMELEN_get|5.009004||Viu gv_name_set|5.009004|5.009004|u GvNAMEUTF8|5.015004||Viu GV_NOADD_MASK|5.009005||Viu GV_NOADD_NOINIT|5.009003|5.009003| GV_NOEXPAND|5.009003|5.009003| GV_NOINIT|5.004005|5.004005| GV_NO_SVGMAGIC|5.015003|5.015003| GV_NOTQUAL|5.009004|5.009004| GV_NOUNIVERSAL|5.033009||Viu G_VOID|5.004000|5.004000| gv_override|5.019006||Viu GvREFCNT|5.003007||Viu gv_setref|5.021005||Viu GvSTASH|5.003007||Viu gv_stashpv|5.003007|5.003007| gv_stashpvn|5.003007|5.003007|p gv_stashpvn_internal|5.021004||Viu gv_stashpvs|5.009003|5.003007|p gv_stashsv|5.003007|5.003007| gv_stashsvpvn_cached|5.021004||Vi GV_SUPER|5.017004|5.017004| GvSV|5.003007|5.003007| gv_SVadd|5.011000||Vu GvSVn|5.009003|5.003007|p gv_try_downgrade|5.011002||xcVi GvXPVGV|5.003007||Viu G_WANT|5.010001||Viu G_WARN_ALL_MASK|5.006000||Viu G_WARN_ALL_OFF|5.006000||Viu G_WARN_ALL_ON|5.006000||Viu G_WARN_OFF|5.006000||Viu G_WARN_ON|5.006000||Viu G_WARN_ONCE|5.006000||Viu G_WRITING_TO_STDERR|5.013009||Viu handle_named_backref|5.023008||Viu handle_names_wildcard|5.031011||Viu handle_possible_posix|5.023008||Viu handle_regex_sets|5.017009||Viu handle_user_defined_property|5.029008||Viu HAS_ACCEPT4|5.027008|5.027008|Vn HAS_ACCESS|5.006000|5.006000|Vn HAS_ACOSH|5.021004|5.021004|Vn HAS_ALARM|5.003007|5.003007|Vn HAS_ASCTIME_R|5.010000|5.010000|Vn HAS_ASINH|5.021006|5.021006|Vn HAS_ATANH|5.021006|5.021006|Vn HAS_ATOLL|5.006000|5.006000|Vn HASATTRIBUTE_ALWAYS_INLINE|5.031007|5.031007|Vn HASATTRIBUTE_DEPRECATED|5.010001|5.010001|Vn HASATTRIBUTE_FORMAT|5.009003|5.009003|Vn HASATTRIBUTE_MALLOC|5.009003|5.009003|Vn HASATTRIBUTE_NONNULL|5.009003|5.009003|Vn HASATTRIBUTE_NORETURN|5.009003|5.009003|Vn HASATTRIBUTE_PURE|5.009003|5.009003|Vn HASATTRIBUTE_UNUSED|5.009003|5.009003|Vn HASATTRIBUTE_WARN_UNUSED_RESULT|5.009003|5.009003|Vn HAS_BACKTRACE|5.021001|5.021001|Vn HAS_BOOL|5.003007||Viu HAS_BUILTIN_CHOOSE_EXPR|5.009004|5.009004|Vn HAS_BUILTIN_EXPECT|5.010001|5.010001|Vn __has_builtin|||piu HAS_BUILTIN_UNREACHABLE|5.033003||Viu HAS_C99|5.021004||Viu HAS_C99_VARIADIC_MACROS|5.009004|5.009004|Vn HAS_CBRT|5.021006|5.021006|Vn HAS_CF_AUX_TABLES|5.027011||Viu HAS_CHOWN|5.003007|5.003007|Vn HAS_CHROOT|5.003007|5.003007|Vn HAS_CHSIZE|5.004005|5.004005|Vn HAS_CLEARENV|5.009003|5.009003|Vn HAS_COPYSIGN|5.021006|5.021006|Vn HAS_COPYSIGNL|5.008001|5.008001|Vn HAS_CRYPT|5.003007|5.003007|Vn HAS_CRYPT_R|5.010000|5.010000|Vn HAS_CSH|5.005000|5.005000|Vn HAS_CTERMID|5.009005|5.009005|Vn HAS_CTIME_R|5.010000|5.010000|Vn HAS_CUSERID|5.003007|5.003007|Vn HAS_DBMINIT_PROTO|5.032001|5.032001|Vn HAS_DIFFTIME|5.003007|5.003007|Vn HAS_DIRFD|5.007003|5.007003|Vn HAS_DLADDR|5.021001|5.021001|Vn HAS_DLERROR|5.003007|5.003007|Vn HAS_DRAND48_PROTO|5.006000|5.006000|Vn HAS_DRAND48_R|5.010000|5.010000|Vn HAS_DUP2|5.003007|5.003007|Vn HAS_DUP3|5.027008|5.027008|Vn HAS_DUPLOCALE|5.027011|5.027011|Vn HAS_EACCESS|5.006000|5.006000|Vn HAS_ENDGRENT|5.005000|5.005000|Vn HAS_ENDHOSTENT|5.005000|5.005000|Vn HAS_ENDNETENT|5.005000|5.005000|Vn HAS_ENDPROTOENT|5.005000|5.005000|Vn HAS_ENDPWENT|5.005000|5.005000|Vn HAS_ENDSERVENT|5.005000|5.005000|Vn HAS_ERF|5.021006|5.021006|Vn HAS_ERFC|5.021006|5.021006|Vn HAS_EXP2|5.021006|5.021006|Vn HAS_EXPM1|5.021006|5.021006|Vn HAS_FAST_STDIO|5.008001|5.008001|Vn HAS_FCHDIR|5.007002|5.007002|Vn HAS_FCHMOD|5.003007|5.003007|Vn HAS_FCHMODAT|5.027004|5.027004|Vn HAS_FCHOWN|5.003007|5.003007|Vn HAS_FCNTL|5.003007|5.003007|Vn HAS_FDIM|5.021006|5.021006|Vn HAS_FD_SET|5.006000|5.006000|Vn HAS_FEGETROUND|5.021004|5.021004|Vn HAS_FFS|5.035001|5.035001|Vn HAS_FFSL|5.035001|5.035001|Vn HAS_FGETPOS|5.003007|5.003007|Vn HAS_FINITE|5.007003|5.007003|Vn HAS_FINITEL|5.007003|5.007003|Vn HAS_FLOCK|5.003007|5.003007|Vn HAS_FLOCK_PROTO|5.007002|5.007002|Vn HAS_FMA|5.021006|5.021006|Vn HAS_FMAX|5.021006|5.021006|Vn HAS_FMIN|5.021006|5.021006|Vn HAS_FORK|5.003007|5.003007|Vn HAS_FPATHCONF|5.003007|5.003007|Vn HAS_FPCLASSIFY|5.021004|5.021004|Vn HAS_FREELOCALE|5.023009|5.023009|Vn HAS_FREXPL|5.006001|5.006001|Vn HAS_FSEEKO|5.006000|5.006000|Vn HAS_FSETPOS|5.003007|5.003007|Vn HAS_FSTATFS|5.023005|5.023005|Vn HAS_FSTATVFS|5.023005|5.023005|Vn HAS_FSYNC|5.007001|5.007001|Vn HAS_FTELLO|5.006000|5.006000|Vn HAS_FUTIMES|5.009003|5.009003|Vn HAS_GAI_STRERROR|5.025004|5.025004|Vn HAS_GETADDRINFO|5.010001|5.010001|Vn HAS_GETCWD|5.006000|5.006000|Vn HAS_GETGRENT|5.005000|5.005000|Vn HAS_GETGRENT_R|5.010000|5.010000|Vn HAS_GETGRGID_R|5.010000|5.010000|Vn HAS_GETGRNAM_R|5.010000|5.010000|Vn HAS_GETGROUPS|5.003007|5.003007|Vn HAS_GETHOSTBYADDR|5.005000|5.005000|Vn HAS_GETHOSTBYADDR_R|5.010000|5.010000|Vn HAS_GETHOSTBYNAME|5.005000|5.005000|Vn HAS_GETHOSTBYNAME_R|5.010000|5.010000|Vn HAS_GETHOSTENT|5.003007|5.003007|Vn HAS_GETHOSTENT_R|5.010000|5.010000|Vn HAS_GETHOSTNAME|5.006000|5.006000|Vn HAS_GETHOST_PROTOS|5.005000|5.005000|Vn HAS_GETITIMER|5.007001|5.007001|Vn HAS_GETLOGIN|5.003007|5.003007|Vn HAS_GETLOGIN_R|5.010000|5.010000|Vn HAS_GETMNTENT|5.023005|5.023005|Vn HAS_GETNAMEINFO|5.010001|5.010001|Vn HAS_GETNETBYADDR|5.005000|5.005000|Vn HAS_GETNETBYADDR_R|5.010000|5.010000|Vn HAS_GETNETBYNAME|5.005000|5.005000|Vn HAS_GETNETBYNAME_R|5.010000|5.010000|Vn HAS_GETNETENT|5.005000|5.005000|Vn HAS_GETNETENT_R|5.010000|5.010000|Vn HAS_GETNET_PROTOS|5.005000|5.005000|Vn HAS_GETPAGESIZE|5.007001|5.007001|Vn HAS_GETPGID|5.003007|5.003007|Vn HAS_GETPGRP|5.003007|5.003007|Vn HAS_GETPPID|5.003007|5.003007|Vn HAS_GETPRIORITY|5.003007|5.003007|Vn HAS_GETPROTOBYNAME|5.005000|5.005000|Vn HAS_GETPROTOBYNAME_R|5.010000|5.010000|Vn HAS_GETPROTOBYNUMBER|5.005000|5.005000|Vn HAS_GETPROTOBYNUMBER_R|5.010000|5.010000|Vn HAS_GETPROTOENT|5.005000|5.005000|Vn HAS_GETPROTOENT_R|5.010000|5.010000|Vn HAS_GETPROTO_PROTOS|5.005000|5.005000|Vn HAS_GETPWENT|5.005000|5.005000|Vn HAS_GETPWENT_R|5.010000|5.010000|Vn HAS_GETPWNAM_R|5.010000|5.010000|Vn HAS_GETPWUID_R|5.010000|5.010000|Vn HAS_GETSERVBYNAME|5.005000|5.005000|Vn HAS_GETSERVBYNAME_R|5.010000|5.010000|Vn HAS_GETSERVBYPORT|5.005000|5.005000|Vn HAS_GETSERVBYPORT_R|5.010000|5.010000|Vn HAS_GETSERVENT|5.005000|5.005000|Vn HAS_GETSERVENT_R|5.010000|5.010000|Vn HAS_GETSERV_PROTOS|5.005000|5.005000|Vn HAS_GETSPNAM|5.006000|5.006000|Vn HAS_GETSPNAM_R|5.010000|5.010000|Vn HAS_GETTIMEOFDAY|5.004000|5.004000|Vn HAS_GMTIME_R|5.010000|5.010000|Vn HAS_GNULIBC|5.004005|5.004005|Vn HAS_GROUP|5.003007||Viu HAS_HASMNTOPT|5.023005|5.023005|Vn HAS_HTONL|5.003007|5.003007|Vn HAS_HTONS|5.003007|5.003007|Vn HAS_HYPOT|5.021006|5.021006|Vn HAS_ILOGB|5.021006|5.021006|Vn HAS_ILOGBL|5.008001|5.008001|Vn HAS_INET_ATON|5.004000|5.004000|Vn HAS_INETNTOP|5.010001|5.010001|Vn HAS_INETPTON|5.010001|5.010001|Vn HAS_INT64_T|5.006000|5.006000|Vn HAS_IOCTL|5.003007||Viu HAS_IP_MREQ|5.017002|5.017002|Vn HAS_IP_MREQ_SOURCE|5.017004|5.017004|Vn HAS_IPV6_MREQ|5.015008|5.015008|Vn HAS_ISASCII|5.003007|5.003007|Vn HAS_ISBLANK|5.015007|5.015007|Vn HAS_ISFINITE|5.021004|5.021004|Vn HAS_ISINF|5.007003|5.007003|Vn HAS_ISINFL|5.021004|5.021004|Vn HAS_ISLESS|5.031007|5.031007|Vn HAS_ISNAN|5.006001|5.006001|Vn HAS_ISNANL|5.006001|5.006001|Vn HAS_ISNORMAL|5.021006|5.021006|Vn HAS_IVCF_AUX_TABLES|5.027011||Viu HAS_J0|5.021004|5.021004|Vn HAS_J0L|5.021004|5.021004|Vn HAS_KILL|5.003007||Viu HAS_KILLPG|5.003007|5.003007|Vn HAS_LC_AUX_TABLES|5.027011||Viu HAS_LCHOWN|5.005000|5.005000|Vn HAS_LC_MONETARY_2008|5.021005|5.021005|Vn HAS_LDBL_DIG|5.006000|5.006000|Vn HAS_LDEXPL|5.021003|5.021003|Vn HAS_LGAMMA|5.021006|5.021006|Vn HAS_LGAMMA_R|5.021006|5.021006|Vn HAS_LINK|5.003007|5.003007|Vn HAS_LINKAT|5.027004|5.027004|Vn HAS_LLRINT|5.021006|5.021006|Vn HAS_LLRINTL|5.021009|5.021009|Vn HAS_LLROUND|5.021006|5.021006|Vn HAS_LLROUNDL|5.021009|5.021009|Vn HAS_LOCALECONV|5.003007|5.003007|Vn HAS_LOCALTIME_R|5.010000|5.010000|Vn HAS_LOCKF|5.003007|5.003007|Vn HAS_LOG1P|5.021006|5.021006|Vn HAS_LOG2|5.021006|5.021006|Vn HAS_LOGB|5.021006|5.021006|Vn HAS_LONG_DOUBLE|5.005000|5.005000|Vn HAS_LONG_LONG|5.005000|5.005000|Vn HAS_LRINT|5.021006|5.021006|Vn HAS_LRINTL|5.021009|5.021009|Vn HAS_LROUND|5.021006|5.021006|Vn HAS_LROUNDL|5.021009|5.021009|Vn HAS_LSEEK_PROTO|5.006000|5.006000|Vn HAS_LSTAT|5.003007|5.003007|Vn HAS_MADVISE|5.006000|5.006000|Vn HAS_MBLEN|5.003007|5.003007|Vn HAS_MBRLEN|5.027006|5.027006|Vn HAS_MBRTOWC|5.027006|5.027006|Vn HAS_MBSTOWCS|5.003007|5.003007|Vn HAS_MBTOWC|5.003007|5.003007|Vn HAS_MEMMEM|5.024000|5.024000|Vn HAS_MEMRCHR|5.027005|5.027005|Vn HAS_MKDIR|5.003007|5.003007|Vn HAS_MKDTEMP|5.006000|5.006000|Vn HAS_MKFIFO|5.003007|5.003007|Vn HAS_MKOSTEMP|5.027008|5.027008|Vn HAS_MKSTEMP|5.006000|5.006000|Vn HAS_MKSTEMPS|5.006000|5.006000|Vn HAS_MKTIME|5.003007|5.003007|Vn HAS_MMAP|5.006000|5.006000|Vn HAS_MODFL|5.006001|5.006001|Vn HAS_MODFL_PROTO|5.009003|5.009003|Vn HAS_MPROTECT|5.006000|5.006000|Vn HAS_MSG|5.003007|5.003007|Vn HAS_MSYNC|5.006000|5.006000|Vn HAS_MUNMAP|5.006000|5.006000|Vn HAS_NAN|5.021006|5.021006|Vn HAS_NANOSLEEP|5.027006|5.027006|Vn HAS_NEARBYINT|5.021006|5.021006|Vn HAS_NEWLOCALE|5.023009|5.023009|Vn HAS_NEXTAFTER|5.021006|5.021006|Vn HAS_NEXTTOWARD|5.021006|5.021006|Vn HAS_NICE|5.003007|5.003007|Vn HAS_NL_LANGINFO|5.007002|5.007002|Vn HAS_NL_LANGINFO_L|5.035001|5.035001|Vn HAS_NON_INT_BITFIELDS|5.035001|5.035001|Vn HAS_NONLATIN1_FOLD_CLOSURE|5.033005||Viu HAS_NONLATIN1_SIMPLE_FOLD_CLOSURE|5.033005||Viu HAS_NTOHL|5.003007|5.003007|Vn HAS_NTOHS|5.003007|5.003007|Vn HAS_OFF64_T|5.010000|5.010000|Vn HAS_OPEN3|5.003007|5.003007|Vn HAS_OPENAT|5.027004|5.027004|Vn HAS_PASSWD|5.003007||Viu HAS_PATHCONF|5.003007|5.003007|Vn HAS_PAUSE|5.003007|5.003007|Vn HAS_PIPE2|5.027008|5.027008|Vn HAS_PIPE|5.003007|5.003007|Vn HAS_POLL|5.003007|5.003007|Vn HAS_POSIX_2008_LOCALE|5.027003||Viu HAS_PRCTL|5.013000|5.013000|Vn HAS_PRCTL_SET_NAME|5.013000|5.013000|Vn HAS_PROCSELFEXE|5.007003|5.007003|Vn HAS_PTHREAD_ATFORK|5.010000|5.010000|Vn HAS_PTHREAD_ATTR_SETSCOPE|5.008001|5.008001|Vn HAS_PTHREAD_UNCHECKED_GETSPECIFIC_NP|5.007002||Viu HAS_PTHREAD_YIELD|5.009005|5.009005|Vn HAS_PTRDIFF_T|5.021001|5.021001|Vn HAS_QUAD|5.003007|5.003007|Vn HAS_RANDOM_R|5.010000|5.010000|Vn HAS_READDIR|5.003007|5.003007|Vn HAS_READDIR64_R|5.010000|5.010000|Vn HAS_READDIR_R|5.010000|5.010000|Vn HAS_READLINK|5.003007|5.003007|Vn HAS_READV|5.007001|5.007001|Vn HAS_RECVMSG|5.007001|5.007001|Vn HAS_REGCOMP|5.021007|5.021007|Vn HAS_REMAINDER|5.021006|5.021006|Vn HAS_REMQUO|5.021006|5.021006|Vn HAS_RENAME|5.003007|5.003007|Vn HAS_RENAMEAT|5.027004|5.027004|Vn HAS_REWINDDIR|5.003007|5.003007|Vn HAS_RINT|5.021006|5.021006|Vn HAS_RMDIR|5.003007|5.003007|Vn HAS_ROUND|5.021006|5.021006|Vn HAS_SBRK_PROTO|5.007001|5.007001|Vn HAS_SCALBN|5.021006|5.021006|Vn HAS_SCALBNL|5.008001|5.008001|Vn HAS_SCHED_YIELD|5.005000|5.005000|Vn HAS_SCX_AUX_TABLES|5.027008||Viu HAS_SEEKDIR|5.003007|5.003007|Vn HAS_SELECT|5.003007|5.003007|Vn HAS_SEM|5.003007|5.003007|Vn HAS_SENDMSG|5.007001|5.007001|Vn HAS_SETEGID|5.003007|5.003007|Vn HAS_SETEUID|5.003007|5.003007|Vn HAS_SETGRENT|5.005000|5.005000|Vn HAS_SETGROUPS|5.004000|5.004000|Vn HAS_SETHOSTENT|5.005000|5.005000|Vn HAS_SETITIMER|5.007001|5.007001|Vn HAS_SETLINEBUF|5.003007|5.003007|Vn HAS_SETLOCALE|5.003007|5.003007|Vn HAS_SETNETENT|5.005000|5.005000|Vn HAS_SETPGID|5.003007|5.003007|Vn HAS_SETPGRP|5.003007|5.003007|Vn HAS_SETPRIORITY|5.003007|5.003007|Vn HAS_SETPROTOENT|5.005000|5.005000|Vn HAS_SETPWENT|5.005000|5.005000|Vn HAS_SETREGID|5.003007|5.003007|Vn HAS_SETRESGID|5.003007|5.003007|Vn HAS_SETRESGID_PROTO|5.010000|5.010000|Vn HAS_SETRESUID|5.003007|5.003007|Vn HAS_SETRESUID_PROTO|5.010000|5.010000|Vn HAS_SETREUID|5.003007|5.003007|Vn HAS_SETSERVENT|5.005000|5.005000|Vn HAS_SETSID|5.003007|5.003007|Vn HAS_SETVBUF|5.005000|5.005000|Vn HAS_SHM|5.003007|5.003007|Vn HAS_SHMAT_PROTOTYPE|5.003007|5.003007|Vn HAS_SIGACTION|5.003007|5.003007|Vn HAS_SIGINFO_SI_ADDR|5.023008|5.023008|Vn HAS_SIGINFO_SI_BAND|5.023008|5.023008|Vn HAS_SIGINFO_SI_ERRNO|5.023008|5.023008|Vn HAS_SIGINFO_SI_PID|5.023008|5.023008|Vn HAS_SIGINFO_SI_STATUS|5.023008|5.023008|Vn HAS_SIGINFO_SI_UID|5.023008|5.023008|Vn HAS_SIGINFO_SI_VALUE|5.023008|5.023008|Vn HAS_SIGNBIT|5.009005|5.009005|Vn HAS_SIGPROCMASK|5.007001|5.007001|Vn HAS_SIGSETJMP|5.003007|5.003007|Vn HAS_SIN6_SCOPE_ID|5.013009|5.013009|Vn HAS_SKIP_LOCALE_INIT|5.019002||Viu HAS_SNPRINTF|5.009003|5.009003|Vn HAS_SOCKADDR_IN6|5.015008|5.015008|Vn HAS_SOCKADDR_STORAGE|5.032001|5.032001|Vn HAS_SOCKATMARK|5.007001|5.007001|Vn HAS_SOCKATMARK_PROTO|5.007002|5.007002|Vn HAS_SOCKET|5.003007|5.003007|Vn HAS_SOCKETPAIR|5.003007|5.003007|Vn HAS_SQRTL|5.006000|5.006000|Vn HAS_SRAND48_R|5.010000|5.010000|Vn HAS_SRANDOM_R|5.010000|5.010000|Vn HAS_STAT|5.021007|5.021007|Vn HAS_STATIC_INLINE|5.013004|5.013004|Vn HAS_STRCOLL|5.003007|5.003007|Vn HAS_STRERROR_L|5.025002|5.025002|Vn HAS_STRERROR_R|5.010000|5.010000|Vn HAS_STRFTIME|5.007002|5.007002|Vn HAS_STRNLEN|5.027006|5.027006|Vn HAS_STRTOD|5.004000|5.004000|Vn HAS_STRTOD_L|5.027011|5.027011|Vn HAS_STRTOL|5.004000|5.004000|Vn HAS_STRTOLD|5.006000|5.006000|Vn HAS_STRTOLD_L|5.027006|5.027006|Vn HAS_STRTOLL|5.006000|5.006000|Vn HAS_STRTOQ|5.007001|5.007001|Vn HAS_STRTOUL|5.004000|5.004000|Vn HAS_STRTOULL|5.006000|5.006000|Vn HAS_STRTOUQ|5.006000|5.006000|Vn HAS_STRUCT_CMSGHDR|5.007001|5.007001|Vn HAS_STRUCT_MSGHDR|5.007001|5.007001|Vn HAS_STRUCT_STATFS|5.023005|5.023005|Vn HAS_STRUCT_STATFS_F_FLAGS|5.023005|5.023005|Vn HAS_STRXFRM|5.003007|5.003007|Vn HAS_STRXFRM_L|5.035001|5.035001|Vn HAS_SYMLINK|5.003007|5.003007|Vn HAS_SYSCALL|5.003007|5.003007|Vn HAS_SYSCALL_PROTO|5.007002|5.007002|Vn HAS_SYSCONF|5.003007|5.003007|Vn HAS_SYS_ERRLIST|5.003007|5.003007|Vn HAS_SYSTEM|5.003007|5.003007|Vn HAS_TC_AUX_TABLES|5.027011||Viu HAS_TCGETPGRP|5.003007|5.003007|Vn HAS_TCSETPGRP|5.003007|5.003007|Vn HAS_TELLDIR|5.003007|5.003007|Vn HAS_TELLDIR_PROTO|5.006000|5.006000|Vn HAS_TGAMMA|5.021006|5.021006|Vn HAS_THREAD_SAFE_NL_LANGINFO_L|5.027006|5.027006|Vn HAS_TIME|5.008000|5.008000|Vn HAS_TIMEGM|5.010001|5.010001|Vn HAS_TIMES|5.003007|5.003007|Vn HAS_TMPNAM_R|5.010000|5.010000|Vn HAS_TM_TM_GMTOFF|5.008001|5.008001|Vn HAS_TM_TM_ZONE|5.008000|5.008000|Vn HAS_TOWLOWER|5.029009|5.029009|Vn HAS_TOWUPPER|5.029009|5.029009|Vn HAS_TRUNC|5.021006|5.021006|Vn HAS_TRUNCATE|5.003007|5.003007|Vn HAS_TRUNCL|5.021004|5.021004|Vn HAS_TTYNAME_R|5.010000|5.010000|Vn HAS_TZNAME|5.003007|5.003007|Vn HAS_UALARM|5.007001|5.007001|Vn HAS_UC_AUX_TABLES|5.027011||Viu HAS_UMASK|5.003007|5.003007|Vn HAS_UNAME|5.003007|5.003007|Vn HAS_UNLINKAT|5.027004|5.027004|Vn HAS_UNSETENV|5.009003|5.009003|Vn HAS_USELOCALE|5.023009|5.023009|Vn HAS_USLEEP|5.007001|5.007001|Vn HAS_USLEEP_PROTO|5.007002|5.007002|Vn HAS_USTAT|5.023005|5.023005|Vn HAS_UTIME|5.003007||Viu HAS_VSNPRINTF|5.009003|5.009003|Vn HAS_WAIT4|5.003007|5.003007|Vn HAS_WAIT|5.003007||Viu HAS_WAITPID|5.003007|5.003007|Vn HAS_WCRTOMB|5.031007|5.031007|Vn HAS_WCSCMP|5.021001|5.021001|Vn HAS_WCSTOMBS|5.003007|5.003007|Vn HAS_WCSXFRM|5.021001|5.021001|Vn HAS_WCTOMB|5.003007|5.003007|Vn HAS_WRITEV|5.007001|5.007001|Vn he_dup|5.007003|5.007003|u HEf_SVKEY|5.003007|5.003007|p HeHASH|5.003007|5.003007| HEK_BASESIZE|5.004000||Viu hek_dup|5.009000|5.009000|u HeKEY|5.003007|5.003007| HeKEY_hek|5.004000||Viu HeKEY_sv|5.004000||Viu HEKf256|5.015004||Viu HEKf|5.015004||Viu HEKfARG|5.015004||Viu HEK_FLAGS|5.008000||Viu HeKFLAGS|5.008000||Viu HEK_HASH|5.004000||Viu HEK_KEY|5.004000||Viu HeKLEN|5.003007|5.003007| HEK_LEN|5.004000||Viu HeKLEN_UTF8|5.007001||Viu HEK_UTF8|5.007001||Viu HeKUTF8|5.007001||Viu HEK_UTF8_off|5.008000||Viu HEK_UTF8_on|5.008000||Viu HEK_WASUTF8|5.008000||Viu HeKWASUTF8|5.008000||Viu HEK_WASUTF8_off|5.008000||Viu HEK_WASUTF8_on|5.008000||Viu HeNEXT|5.003007||Viu HePV|5.004000|5.004000| HeSVKEY|5.003007|5.003007| HeSVKEY_force|5.003007|5.003007| HeSVKEY_set|5.004000|5.004000| HE_SVSLOT|5.009003||Viu HeUTF8|5.010001|5.008000|p HeVAL|5.003007|5.003007| hfree_next_entry|||iu HIGHEST_ANYOF_HRx_BYTE|5.031002||Viu HIGHEST_CASE_CHANGING_CP|5.033005||Viu HINT_ALL_STRICT|5.033002||Viu HINT_BLOCK_SCOPE|5.003007||Viu HINT_BYTES|5.007002||Viu HINT_EXPLICIT_STRICT_REFS|5.016000||Viu HINT_EXPLICIT_STRICT_SUBS|5.016000||Viu HINT_EXPLICIT_STRICT_VARS|5.016000||Viu HINT_FEATURE_MASK|5.015007||Viu HINT_FEATURE_SHIFT|5.015007||Viu HINT_FILETEST_ACCESS|5.006000||Viu HINT_INTEGER|5.003007||Viu HINT_LEXICAL_IO_IN|5.009005||Viu HINT_LEXICAL_IO_OUT|5.009005||Viu HINT_LOCALE|5.004000||Viu HINT_LOCALE_PARTIAL|5.021001||Viu HINT_LOCALIZE_HH|5.005000||Viu HINT_NEW_BINARY|5.005000||Viu HINT_NEW_FLOAT|5.005000||Viu HINT_NEW_INTEGER|5.005000||Viu HINT_NEW_RE|5.005000||Viu HINT_NEW_STRING|5.005000||Viu HINT_NO_AMAGIC|5.010001||Viu HINT_RE_EVAL|5.005000||Viu HINT_RE_FLAGS|5.013007||Viu HINT_RE_TAINT|5.004005||Viu HINTS_DEFAULT|5.033002||Viu HINT_SORT_STABLE|5.007003||Viu HINT_SORT_UNSTABLE|5.027004||Viu HINTS_REFCNT_INIT|5.009004||Viu HINTS_REFCNT_LOCK|5.009004||Viu HINTS_REFCNT_TERM|5.009004||Viu HINTS_REFCNT_UNLOCK|5.009004||Viu HINT_STRICT_REFS|5.003007||Viu HINT_STRICT_SUBS|5.003007||Viu HINT_STRICT_VARS|5.003007||Viu HINT_UNI_8_BIT|5.011002||Viu HINT_UTF8|5.006000||Viu H_PERL|5.003007||Viu HS_APIVERLEN_MAX|5.021006||Viu HS_CXT|5.021006||Viu HSf_IMP_CXT|5.021006||Viu HSf_NOCHK|5.021006||Viu HSf_POPMARK|5.021006||Viu HSf_SETXSUBFN|5.021006||Viu HS_GETAPIVERLEN|5.021006||Viu HS_GETINTERPSIZE|5.021006||Viu HS_GETXSVERLEN|5.021006||Viu HS_KEY|5.021006||Viu HS_KEYp|5.021006||Viu HSm_APIVERLEN|5.021006||Viu HSm_INTRPSIZE|5.021006||Viu HSm_KEY_MATCH|5.021006||Viu HSm_XSVERLEN|5.021006||Viu hsplit|5.005000||Viu HS_XSVERLEN_MAX|5.021006||Viu htoni|5.003007||Viu htonl|5.003007||Viu htons|5.003007||Viu htovl|5.003007||Viu htovs|5.003007||Viu HvAMAGIC|5.017000||Viu HvAMAGIC_off|5.017000||Viu HvAMAGIC_on|5.017000||Viu HvARRAY|5.003007||Viu hv_assert|5.008009|5.008009| HvAUX|5.009003||Viu HvAUXf_NO_DEREF|5.019010||Viu HvAUXf_SCAN_STASH|5.019010||Viu hv_auxinit|5.009003||Viu hv_auxinit_internal|5.019010||Vniu hv_backreferences_p|||xiu hv_bucket_ratio|5.025003|5.025003|x hv_clear|5.003007|5.003007| hv_clear_placeholders|5.009001|5.009001| hv_common|5.010000||cVu hv_common_key_len|5.010000||cVu hv_copy_hints_hv|5.009004|5.009004| hv_delayfree_ent|5.004000|5.004000|u hv_delete|5.003007|5.003007| HV_DELETE|5.009005||Viu hv_delete_common|5.009001||xViu hv_delete_ent|5.003007|5.003007| hv_deletehek|5.019006||Viu hv_deletes|5.025006||Viu HV_DISABLE_UVAR_XKEY|5.010000||Viu HvEITER|5.003007||Viu HvEITER_get|5.009003||Viu hv_eiter_p|5.009003|5.009003|u hv_eiter_set|5.009003|5.009003|u HvEITER_set|5.009003||Viu HvENAME|5.013007|5.013007| hv_ename_add|5.013007||Vi hv_ename_delete|5.013007||Vi HvENAME_get|5.013007||Viu HvENAME_HEK|5.013007||Viu HvENAME_HEK_NN|5.013007||Viu HvENAMELEN|5.015004|5.015004| HvENAMELEN_get|5.013007||Viu HvENAMEUTF8|5.015004|5.015004| hv_exists|5.003007|5.003007| hv_exists_ent|5.003007|5.003007| hv_existss|5.025006||Viu hv_fetch|5.003007|5.003007| HV_FETCH_EMPTY_HE|5.013007||Viu hv_fetch_ent|5.003007|5.003007| hv_fetchhek|5.019006||Viu HV_FETCH_ISEXISTS|5.009005||Viu HV_FETCH_ISSTORE|5.009005||Viu HV_FETCH_JUST_SV|5.009005||Viu HV_FETCH_LVALUE|5.009005||Viu hv_fetchs|5.009003|5.003007|p HvFILL|5.003007|5.003007| hv_fill|5.013002|5.013002| hv_free_ent|5.004000|5.004000|u hv_free_ent_ret|5.015000||Viu hv_free_entries|5.027002||Viu HvHASKFLAGS|5.008000||Viu HvHASKFLAGS_off|5.008000||Viu HvHASKFLAGS_on|5.008000||Viu HVhek_ENABLEHVKFLAGS|5.008002||Viu HVhek_FREEKEY|5.008000||Viu HVhek_KEYCANONICAL|5.010001||Viu HVhek_MASK|5.008000||Viu HVhek_PLACEHOLD|5.008000||Viu HVhek_UNSHARED|5.009004||Viu HVhek_UTF8|5.008000||Viu HVhek_WASUTF8|5.008000||Viu hv_iterinit|5.003007|5.003007| hv_iterkey|5.003007|5.003007| hv_iterkeysv|5.003007|5.003007| hv_iternext|5.003007|5.003007| hv_iternext_flags|5.008000|5.008000|x hv_iternextsv|5.003007|5.003007| HV_ITERNEXT_WANTPLACEHOLDERS|5.008000|5.008000| hv_iterval|5.003007|5.003007| HvKEYS|5.003007||Viu hv_kill_backrefs|||xiu hv_ksplit|5.003007|5.003007|u HvLASTRAND_get|5.017011||Viu HvLAZYDEL|5.003007||Viu HvLAZYDEL_off|5.003007||Viu HvLAZYDEL_on|5.003007||Viu hv_magic|5.003007|5.003007| hv_magic_check|5.006000||Vniu HvMAX|5.003007||Viu HvMROMETA|5.010001|5.010001| HvNAME|5.003007|5.003007| HvNAME_get|5.009003||pcV HvNAME_HEK|5.009003||Viu HvNAME_HEK_NN|5.013007||Viu HvNAMELEN|5.015004|5.015004| HvNAMELEN_get|5.009003|5.003007|p hv_name_set|5.009003|5.009003|u HV_NAME_SETALL|5.013008||Viu hv_name_sets|5.025006||Viu HvNAMEUTF8|5.015004|5.015004| hv_notallowed|5.008000||Viu HvPLACEHOLDERS|5.007003||Viu hv_placeholders_get|5.009003|5.009003|u HvPLACEHOLDERS_get|5.009003||Viu hv_placeholders_p|||ciu hv_placeholders_set|5.009003|5.009003|u HvPLACEHOLDERS_set|5.009003||Viu hv_pushkv|5.027003||Viu HvRAND_get|5.017011||Viu hv_rand_set|5.018000|5.018000|u HVrhek_delete|5.009004||Viu HVrhek_IV|5.009004||Viu HVrhek_PV|5.009004||Viu HVrhek_PV_UTF8|5.009005||Viu HVrhek_typemask|5.009004||Viu HVrhek_undef|5.009004||Viu HVrhek_UV|5.009004||Viu HvRITER|5.003007||Viu HvRITER_get|5.009003||Viu hv_riter_p|5.009003|5.009003|u hv_riter_set|5.009003|5.009003|u HvRITER_set|5.009003||Viu hv_scalar|5.009001|5.009001| HvSHAREKEYS|5.003007||Viu HvSHAREKEYS_off|5.003007||Viu HvSHAREKEYS_on|5.003007||Viu hv_store|5.003007|5.003007| hv_store_ent|5.003007|5.003007| hv_store_flags|5.008000|5.008000|xu hv_storehek|5.019006||Viu hv_stores|5.009004|5.003007|p HvTOTALKEYS|5.007003||Viu hv_undef|5.003007|5.003007| hv_undef_flags|||ciu HvUSEDKEYS|5.007003||Viu HYPHEN_UTF8|5.017004||Viu I16_MAX|5.003007||Viu I16_MIN|5.003007||Viu I16SIZE|5.006000|5.006000|Vn I16TYPE|5.006000|5.006000|Vn I_32|5.006000|5.003007| I32_MAX|5.003007||Viu I32_MAX_P1|5.007002||Viu I32_MIN|5.003007||Viu I32SIZE|5.006000|5.006000|Vn I32TYPE|5.006000|5.006000|Vn I64SIZE|5.006000|5.006000|Vn I64TYPE|5.006000|5.006000|Vn I8SIZE|5.006000|5.006000|Vn I8_TO_NATIVE|5.015006||Viu I8_TO_NATIVE_UTF8|5.019004||Viu I8TYPE|5.006000|5.006000|Vn I_ARPA_INET|5.005000|5.005000|Vn ibcmp|5.003007|5.003007| ibcmp_locale|5.004000|5.004000| ibcmp_utf8|5.007003|5.007003| I_CRYPT|5.008000|5.008000|Vn I_DBM|5.032001|5.032001|Vn I_DIRENT|5.003007|5.003007|Vn I_DLFCN|5.003007|5.003007|Vn I_EXECINFO|5.021001|5.021001|Vn I_FENV|5.021004|5.021004|Vn IFMATCH|5.003007||Viu IFMATCH_A|5.009005||Viu IFMATCH_A_fail|5.009005||Viu IFMATCH_A_fail_t8_p8|5.033003||Viu IFMATCH_A_fail_t8_pb|5.033003||Viu IFMATCH_A_fail_tb_p8|5.033003||Viu IFMATCH_A_fail_tb_pb|5.033003||Viu IFMATCH_A_t8_p8|5.033003||Viu IFMATCH_A_t8_pb|5.033003||Viu IFMATCH_A_tb_p8|5.033003||Viu IFMATCH_A_tb_pb|5.033003||Viu IFMATCH_t8_p8|5.033003||Viu IFMATCH_t8_pb|5.033003||Viu IFMATCH_tb_p8|5.033003||Viu IFMATCH_tb_pb|5.033003||Viu IFTHEN|5.005000||Viu IFTHEN_t8_p8|5.033003||Viu IFTHEN_t8_pb|5.033003||Viu IFTHEN_tb_p8|5.033003||Viu IFTHEN_tb_pb|5.033003||Viu I_GDBM|5.021007|5.021007|Vn I_GDBMNDBM|5.021007|5.021007|Vn IGNORE_PAT_MOD|5.009005||Viu I_GRP|5.003007|5.003007|Vn I_INTTYPES|5.006000|5.006000|Vn I_LANGINFO|5.007002|5.007002|Vn I_LIMITS|5.003007||Viu ILLEGAL_UTF8_BYTE|5.019004||Viu I_LOCALE|5.003007|5.003007|Vn I_MNTENT|5.023005|5.023005|Vn IN_BYTES|5.007002||Viu incline|5.005000||Viu INCLUDE_PROTOTYPES|5.007001||Viu INCMARK|5.023005||Viu incpush|5.005000||Viu INCPUSH_APPLLIB_EXP|5.027006||Viu INCPUSH_APPLLIB_OLD_EXP|5.027006||Viu INCPUSH_ARCHLIB_EXP|5.027006||Viu incpush_if_exists|5.009003||Viu INCPUSH_PERL5LIB|5.027006||Viu INCPUSH_PERL_OTHERLIBDIRS|5.027006||Viu INCPUSH_PERL_OTHERLIBDIRS_ARCHONLY|5.027006||Viu INCPUSH_PERL_VENDORARCH_EXP|5.027006||Viu INCPUSH_PERL_VENDORLIB_EXP|5.027006||Viu INCPUSH_PERL_VENDORLIB_STEM|5.027006||Viu INCPUSH_PRIVLIB_EXP|5.027006||Viu INCPUSH_SITEARCH_EXP|5.027006||Viu INCPUSH_SITELIB_EXP|5.027006||Viu INCPUSH_SITELIB_STEM|5.027006||Viu incpush_use_sep|5.011000||Viu I_NDBM|5.032001|5.032001|Vn inet_addr|5.005000||Viu I_NETDB|5.005000|5.005000|Vn I_NETINET_IN|5.003007|5.003007|Vn I_NETINET_TCP|5.006000|5.006000|Vn inet_ntoa|5.005000||Viu INFNAN_NV_U8_DECL|5.023000||Viu INFNAN_U8_NV_DECL|5.023000||Viu ingroup|5.003007||Viu INIT|5.003007||Viu init_argv_symbols|5.007003||Viu init_constants|5.017003||Viu init_dbargs|||iu init_debugger|5.005000||Viu init_i18nl10n|5.006000||cVu init_i18nl14n|5.006000||dcVu initialize_invlist_guts|5.029002||Viu init_ids|5.005000||Viu init_interp|5.005000||Viu init_main_stash|5.005000||Viu init_named_cv|5.027010||cViu init_os_extras|5.005000||Viu init_perllib|5.005000||Viu init_postdump_symbols|5.005000||Viu init_predump_symbols|5.005000||Viu init_stacks|5.005000|5.005000|u INIT_THREADS|5.005000||Viu init_tm|5.007002|5.007002|u INIT_TRACK_MEMPOOL|5.009004||Viu init_uniprops|5.027011||Viu IN_LC|5.021001||Viu IN_LC_ALL_COMPILETIME|5.021001||Viu IN_LC_ALL_RUNTIME|5.021001||Viu IN_LC_COMPILETIME|5.021001||Viu IN_LC_PARTIAL_COMPILETIME|5.021001||Viu IN_LC_PARTIAL_RUNTIME|5.021001||Viu IN_LC_RUNTIME|5.021001||Viu IN_LOCALE|5.007002|5.004000|p IN_LOCALE_COMPILETIME|5.007002|5.004000|p IN_LOCALE_RUNTIME|5.007002|5.004000|p IN_PERL_COMPILETIME|5.008001|5.003007|p IN_PERL_RUNTIME|5.008001|5.008001| inplace_aassign|5.015003||Viu inRANGE|5.029010||Viu inRANGE_helper|5.033005||Viu IN_SOME_LOCALE_FORM|5.015008||Viu IN_SOME_LOCALE_FORM_COMPILETIME|5.015008||Viu IN_SOME_LOCALE_FORM_RUNTIME|5.015008||Viu instr|5.003007|5.003007|n INSUBP|5.009005||Viu INSUBP_t8_p8|5.033003||Viu INSUBP_t8_pb|5.033003||Viu INSUBP_tb_p8|5.033003||Viu INSUBP_tb_pb|5.033003||Viu INT16_C|5.003007|5.003007| INT2PTR|5.006000|5.003007|p INT32_C|5.003007|5.003007| INT32_MIN|5.007002||Viu INT64_C|5.023002|5.023002| INT64_MIN|5.007002||Viu INT_64_T|5.011000||Viu INTMAX_C|5.003007|5.003007| INT_PAT_MODS|5.009005||Viu intro_my|5.004000|5.004000| INTSIZE|5.003007|5.003007|Vn intuit_method|5.005000||Viu intuit_more|5.003007||Viu IN_UNI_8_BIT|5.011002||Viu IN_UTF8_CTYPE_LOCALE|5.019009||Viu _inverse_folds|5.027011||cViu invert|5.003007||Viu invlist_array|5.013010||Vniu _invlist_array_init|5.015001||Vniu invlist_clear|5.023009||Viu invlist_clone|5.015001||cViu _invlist_contains_cp|5.017003||Vniu invlist_contents|5.023008||Viu _invlist_dump|5.019003||cViu _invlistEQ|5.023006||cViu invlist_extend|5.013010||Viu invlist_highest|5.017002||Vniu _invlist_intersection|5.015001||Viu _invlist_intersection_maybe_complement_2nd|5.015008||cViu _invlist_invert|5.015001||cViu invlist_is_iterating|5.017008||Vniu invlist_iterfinish|5.017008||Vniu invlist_iterinit|5.015001||Vniu invlist_iternext|5.015001||Vniu _invlist_len|5.017004||Vniu invlist_lowest|5.031007||xVniu invlist_max|5.013010||Vniu invlist_previous_index|5.017004||Vniu invlist_replace_list_destroys_src|5.023009||Viu _invlist_search|5.017003||cVniu invlist_set_len|5.013010||Viu invlist_set_previous_index|5.017004||Vniu _invlist_subtract|5.015001||Viu invlist_trim|5.013010||Vniu _invlist_union|5.015001||cVu _invlist_union_maybe_complement_2nd|5.015008||cViu invmap_dump|5.031006||Viu invoke_exception_hook|5.013001||Viu IoANY|5.006001||Viu IoBOTTOM_GV|5.003007||Viu IoBOTTOM_NAME|5.003007||Viu io_close|5.003007||Viu IOCPARM_LEN|5.003007||Viu ioctl|5.005000||Viu IoDIRP|5.003007||Viu IOf_ARGV|5.003007||Viu IOf_DIDTOP|5.003007||Viu IOf_FAKE_DIRP|5.006000||Viu IOf_FLUSH|5.003007||Viu IoFLAGS|5.003007||Viu IoFMT_GV|5.003007||Viu IoFMT_NAME|5.003007||Viu IOf_NOLINE|5.005003||Viu IOf_START|5.003007||Viu IOf_UNTAINT|5.003007||Viu IoIFP|5.003007||Viu IoLINES|5.003007||Viu IoLINES_LEFT|5.003007||Viu IoOFP|5.003007||Viu IoPAGE|5.003007||Viu IoPAGE_LEN|5.003007||Viu IoTOP_GV|5.003007||Viu IoTOP_NAME|5.003007||Viu IoTYPE|5.003007||Viu IoTYPE_APPEND|5.006001||Viu IoTYPE_CLOSED|5.006001||Viu IoTYPE_IMPLICIT|5.008001||Viu IoTYPE_NUMERIC|5.008001||Viu IoTYPE_PIPE|5.006001||Viu IoTYPE_RDONLY|5.006001||Viu IoTYPE_RDWR|5.006001||Viu IoTYPE_SOCKET|5.006001||Viu IoTYPE_STD|5.006001||Viu IoTYPE_WRONLY|5.006001||Viu I_POLL|5.006000|5.006000|Vn I_PTHREAD|5.005003|5.005003|Vn I_PWD|5.003007|5.003007|Vn isALNUM|5.003007|5.003007|p isALNUM_A|5.031003|5.003007|p isALNUMC|5.006000|5.003007|p isALNUMC_A|5.013006|5.003007|p isALNUMC_L1|5.013006|5.003007|p isALNUMC_LC|5.006000|5.006000| isALNUMC_LC_utf8_safe|5.031007||Viu isALNUMC_LC_uvchr|5.017007|5.017007| isALNUMC_uni|5.017007||Viu isALNUMC_utf8|5.017007||Viu isALNUMC_utf8_safe|5.031007||Viu isALNUM_lazy_if_safe|5.031007||Viu isALNUM_LC|5.004000|5.004000| isALNUM_LC_utf8|5.006000||Viu isALNUM_LC_utf8_safe|5.031007||Viu isALNUM_LC_uvchr|5.007001|5.007001| isALNUMU|5.011005||Viu isALNUM_uni|5.006000||Viu isALNUM_utf8|5.006000||Viu isALNUM_utf8_safe|5.031007||Viu isa_lookup|5.005000||Viu isALPHA|5.003007|5.003007|p isALPHA_A|5.013006|5.003007|p isALPHA_FOLD_EQ|5.021004||Viu isALPHA_FOLD_NE|5.021004||Viu isALPHA_L1|5.013006|5.003007|p isALPHA_LC|5.004000|5.004000| isALPHA_LC_utf8|5.006000||Viu isALPHA_LC_utf8_safe|5.025009|5.006000|p isALPHA_LC_uvchr|5.007001|5.007001| isALPHANUMERIC|5.017008|5.003007|p isALPHANUMERIC_A|5.017008|5.003007|p isALPHANUMERIC_L1|5.017008|5.003007|p isALPHANUMERIC_LC|5.017008|5.004000|p isALPHANUMERIC_LC_utf8|5.017008||Viu isALPHANUMERIC_LC_utf8_safe|5.025009|5.006000|p isALPHANUMERIC_LC_uvchr|5.017008|5.017008| isALPHANUMERIC_uni|5.017008||Viu isALPHANUMERIC_utf8|5.031005|5.031005| isALPHANUMERIC_utf8_safe|5.025009|5.006000|p isALPHANUMERIC_uvchr|5.023009|5.006000|p isALPHAU|5.011005||Viu isALPHA_uni|5.006000||Viu isALPHA_utf8|5.031005|5.031005| isALPHA_utf8_safe|5.025009|5.006000|p isALPHA_uvchr|5.023009|5.006000|p is_an_int|5.005000||Viu is_ANYOF_SYNTHETIC|5.019009||Viu IS_ANYOF_TRIE|5.009005||Viu isASCII|5.006000|5.003007|p isASCII_A|5.013006|5.003007|p isASCII_L1|5.015004|5.003007|p isASCII_LC|5.015008|5.003007|p isASCII_LC_utf8|5.017007||Viu isASCII_LC_utf8_safe|5.025009|5.025009| isASCII_LC_uvchr|5.017007|5.017007| is_ascii_string|5.011000|5.011000|n isASCII_uni|5.006000||Viu isASCII_utf8|5.031005|5.031005| isASCII_utf8_safe|5.025009|5.003007|p isASCII_uvchr|5.023009|5.003007|p isatty|5.005000||Viu ISA_VERSION_OBJ|5.019008||Viu isBLANK|5.006001|5.003007|p isBLANK_A|5.013006|5.003007|p isBLANK_L1|5.013006|5.003007|p isBLANK_LC|5.006001|5.003007|p isBLANK_LC_uni|5.006001||Viu isBLANK_LC_utf8|5.006001||Viu isBLANK_LC_utf8_safe|5.025009|5.006000|p isBLANK_LC_uvchr|5.017007|5.017007| isBLANK_uni|5.006001||Viu isBLANK_utf8|5.031005|5.031005| isBLANK_utf8_safe|5.025009|5.006000|p isBLANK_uvchr|5.023009|5.006000|p isC9_STRICT_UTF8_CHAR|5.025005|5.025005|n is_C9_STRICT_UTF8_CHAR_utf8_no_length_checks|5.025005||Viu is_C9_STRICT_UTF8_CHAR_utf8_no_length_checks_part0|5.025008||Viu is_C9_STRICT_UTF8_CHAR_utf8_no_length_checks_part1|5.025008||Viu is_c9strict_utf8_string|5.025006|5.025006|n is_c9strict_utf8_string_loc|5.025006|5.025006|n is_c9strict_utf8_string_loclen|5.025006|5.025006|n isCHARNAME_CONT|5.011005||Viu isCNTRL|5.006000|5.003007|p isCNTRL_A|5.013006|5.003007|p isCNTRL_L1|5.013006|5.003007|p isCNTRL_LC|5.006000|5.006000| isCNTRL_LC_utf8|5.006000||Viu isCNTRL_LC_utf8_safe|5.025009|5.006000|p isCNTRL_LC_uvchr|5.007001|5.007001| isCNTRL_uni|5.006000||Viu isCNTRL_utf8|5.031005|5.031005| isCNTRL_utf8_safe|5.025009|5.006000|p isCNTRL_uvchr|5.023009|5.006000|p _is_cur_LC_category_utf8|5.021001||cVu isDEBUG_WILDCARD|5.031011||Viu isDIGIT|5.003007|5.003007|p isDIGIT_A|5.013006|5.003007|p isDIGIT_L1|5.013006|5.003007|p isDIGIT_LC|5.004000|5.004000| isDIGIT_LC_utf8|5.006000||Viu isDIGIT_LC_utf8_safe|5.025009|5.006000|p isDIGIT_LC_uvchr|5.007001|5.007001| isDIGIT_uni|5.006000||Viu isDIGIT_utf8|5.031005|5.031005| isDIGIT_utf8_safe|5.025009|5.006000|p isDIGIT_uvchr|5.023009|5.006000|p isEXACTFish|5.033003||Viu isEXACT_REQ8|5.033003||Viu isFF_OVERLONG|5.025007||Vniu is_FOLDS_TO_MULTI_utf8|5.019009||Viu isFOO_lc|5.017007||Viu isFOO_utf8_lc|5.017008||Viu isGCB|5.021009||Viu isGRAPH|5.006000|5.003007|p isGRAPH_A|5.013006|5.003007|p is_grapheme|5.031007||Viu isGRAPH_L1|5.013006|5.003007|p isGRAPH_LC|5.006000|5.006000| isGRAPH_LC_utf8|5.006000||Viu isGRAPH_LC_utf8_safe|5.025009|5.006000|p isGRAPH_LC_uvchr|5.007001|5.007001| isGRAPH_uni|5.006000||Viu isGRAPH_utf8|5.031005|5.031005| isGRAPH_utf8_safe|5.025009|5.006000|p isGRAPH_uvchr|5.023009|5.006000|p isGV|5.003007||Viu isGV_or_RVCV|5.027005||Viu isGV_with_GP|5.009004|5.003007|p isGV_with_GP_off|5.009005||Viu isGV_with_GP_on|5.009005||Viu I_SHADOW|5.006000|5.006000|Vn is_handle_constructor|5.006000||Vniu is_HANGUL_ED_utf8_safe|5.029001||Viu is_HORIZWS_cp_high|5.017006||Viu is_HORIZWS_high|5.017006||Viu isIDCONT|5.017008|5.003007|p isIDCONT_A|5.017008|5.003007|p isIDCONT_L1|5.017008|5.003007|p isIDCONT_LC|5.017008|5.004000|p isIDCONT_LC_utf8|5.017008||Viu isIDCONT_LC_utf8_safe|5.025009|5.006000|p isIDCONT_LC_uvchr|5.017008|5.017008| isIDCONT_uni|5.017008||Viu isIDCONT_utf8|5.031005|5.031005| isIDCONT_utf8_safe|5.025009|5.006000|p isIDCONT_uvchr|5.023009|5.006000|p isIDFIRST|5.003007|5.003007|p isIDFIRST_A|5.013006|5.003007|p isIDFIRST_L1|5.013006|5.003007|p isIDFIRST_lazy_if_safe|5.025009||Viu isIDFIRST_LC|5.004000|5.004000|p isIDFIRST_LC_utf8|5.006000||Viu isIDFIRST_LC_utf8_safe|5.025009|5.006000|p isIDFIRST_LC_uvchr|5.007001|5.007001| isIDFIRST_uni|5.006000||Viu isIDFIRST_utf8|5.031005|5.031005| isIDFIRST_utf8_safe|5.025009|5.006000|p isIDFIRST_uvchr|5.023009|5.006000|p isinfnan|5.021004|5.021004|n isinfnansv|5.021005||Vi _is_in_locale_category|5.021001||cViu IS_IN_SOME_FOLD_L1|5.033005||Viu is_invariant_string|5.021007|5.011000|pn is_invlist|5.029002||Vniu is_LAX_VERSION|5.011004||Viu isLB|5.023007||Viu isLEXWARN_off|5.006000||Viu isLEXWARN_on|5.006000||Viu is_LNBREAK_latin1_safe|5.009005||Viu is_LNBREAK_safe|5.009005||Viu is_LNBREAK_utf8_safe|5.009005||Viu isLOWER|5.003007|5.003007|p isLOWER_A|5.013006|5.003007|p isLOWER_L1|5.013006|5.003007|p isLOWER_LC|5.004000|5.004000| isLOWER_LC_utf8|5.006000||Viu isLOWER_LC_utf8_safe|5.025009|5.006000|p isLOWER_LC_uvchr|5.007001|5.007001| isLOWER_uni|5.006000||Viu isLOWER_utf8|5.031005|5.031005| isLOWER_utf8_safe|5.025009|5.006000|p isLOWER_uvchr|5.023009|5.006000|p is_lvalue_sub|5.007001|5.007001|u isMNEMONIC_CNTRL|5.031009||Viu is_MULTI_CHAR_FOLD_latin1_safe|5.019010||Viu is_MULTI_CHAR_FOLD_utf8_safe|5.019010||Viu is_MULTI_CHAR_FOLD_utf8_safe_part0|5.019010||Viu is_MULTI_CHAR_FOLD_utf8_safe_part1|5.019010||Viu is_MULTI_CHAR_FOLD_utf8_safe_part2|5.025008||Viu is_MULTI_CHAR_FOLD_utf8_safe_part3|5.025008||Viu is_NONCHAR_utf8_safe|5.025005||Viu IS_NON_FINAL_FOLD|5.033005||Viu isnormal|5.021004||Viu IS_NUMBER_GREATER_THAN_UV_MAX|5.007002|5.003007|p IS_NUMBER_INFINITY|5.007002|5.003007|p IS_NUMBER_IN_UV|5.007002|5.003007|p IS_NUMBER_NAN|5.007003|5.003007|p IS_NUMBER_NEG|5.007002|5.003007|p IS_NUMBER_NOT_INT|5.007002|5.003007|p IS_NUMBER_TRAILING|5.021002||Viu IS_NUMERIC_RADIX|5.006000||Viu isOCTAL|5.013005|5.003007|p isOCTAL_A|5.013006|5.003007|p isOCTAL_L1|5.013006|5.003007|p IS_PADCONST|5.006000||Viu IS_PADGV|5.006000||Viu is_PATWS_safe|5.017008||Viu isPOWER_OF_2|5.029006||Viu isPRINT|5.004000|5.003007|p isPRINT_A|5.013006|5.003007|p isPRINT_L1|5.013006|5.003007|p isPRINT_LC|5.004000|5.004000| isPRINT_LC_utf8|5.006000||Viu isPRINT_LC_utf8_safe|5.025009|5.006000|p isPRINT_LC_uvchr|5.007001|5.007001| isPRINT_uni|5.006000||Viu isPRINT_utf8|5.031005|5.031005| isPRINT_utf8_safe|5.025009|5.006000|p isPRINT_uvchr|5.023009|5.006000|p is_PROBLEMATIC_LOCALE_FOLD_cp|5.019009||Viu is_PROBLEMATIC_LOCALE_FOLDEDS_START_cp|5.019009||Viu is_PROBLEMATIC_LOCALE_FOLDEDS_START_utf8|5.019009||Viu is_PROBLEMATIC_LOCALE_FOLD_utf8|5.019009||Viu isPSXSPC|5.006001|5.003007|p isPSXSPC_A|5.013006|5.003007|p isPSXSPC_L1|5.013006|5.003007|p isPSXSPC_LC|5.006001|5.006001| isPSXSPC_LC_utf8|5.006001||Viu isPSXSPC_LC_utf8_safe|5.025009|5.006000|p isPSXSPC_LC_uvchr|5.017007|5.017007| isPSXSPC_uni|5.006001||Viu isPSXSPC_utf8|5.031005|5.031005| isPSXSPC_utf8_safe|5.025009|5.006000|p isPSXSPC_uvchr|5.023009|5.006000|p isPUNCT|5.006000|5.003007|p isPUNCT_A|5.013006|5.003007|p isPUNCT_L1|5.013006|5.003007|p isPUNCT_LC|5.006000|5.006000| isPUNCT_LC_utf8|5.006000||Viu isPUNCT_LC_utf8_safe|5.025009|5.006000|p isPUNCT_LC_uvchr|5.007001|5.007001| isPUNCT_uni|5.006000||Viu isPUNCT_utf8|5.031005|5.031005| isPUNCT_utf8_safe|5.025009|5.006000|p isPUNCT_uvchr|5.023009|5.006000|p is_QUOTEMETA_high|5.017004||Viu is_QUOTEMETA_high_part0|5.021001||Viu is_QUOTEMETA_high_part1|5.021001||Viu isREGEXP|5.017006||Viu IS_SAFE_PATHNAME|5.019004||Viu IS_SAFE_SYSCALL|5.019004|5.019004| is_safe_syscall|5.019004|5.019004| isSB|5.021009||Viu isSCRIPT_RUN|5.027008||cVi isSPACE|5.003007|5.003007|p isSPACE_A|5.013006|5.003007|p isSPACE_L1|5.013006|5.003007|p isSPACE_LC|5.004000|5.004000| isSPACE_LC_utf8|5.006000||Viu isSPACE_LC_utf8_safe|5.025009|5.006000|p isSPACE_LC_uvchr|5.007001|5.007001| isSPACE_uni|5.006000||Viu isSPACE_utf8|5.031005|5.031005| isSPACE_utf8_safe|5.025009|5.006000|p isSPACE_uvchr|5.023009|5.006000|p is_ssc_worth_it|5.021005||Vniu isSTRICT_UTF8_CHAR|5.025005|5.025005|n is_STRICT_UTF8_CHAR_utf8_no_length_checks|5.025005||Viu is_STRICT_UTF8_CHAR_utf8_no_length_checks_part0|5.025005||Viu is_STRICT_UTF8_CHAR_utf8_no_length_checks_part1|5.025005||Viu is_STRICT_UTF8_CHAR_utf8_no_length_checks_part2|5.025008||Viu is_STRICT_UTF8_CHAR_utf8_no_length_checks_part3|5.025008||Viu is_strict_utf8_string|5.025006|5.025006|n is_strict_utf8_string_loc|5.025006|5.025006|n is_strict_utf8_string_loclen|5.025006|5.025006|n is_STRICT_VERSION|5.011004||Viu is_SURROGATE_utf8_safe|5.025005||Viu I_STDARG|5.003007||Viu I_STDBOOL|5.015003|5.015003|Vn I_STDINT|5.021004|5.021004|Vn is_THREE_CHAR_FOLD_HEAD_latin1_safe|5.031007||Viu is_THREE_CHAR_FOLD_HEAD_utf8_safe|5.031007||Viu is_THREE_CHAR_FOLD_latin1_safe|5.031007||Viu is_THREE_CHAR_FOLD_utf8_safe|5.031007||Viu IS_TRIE_AC|5.009005||Viu _is_uni_FOO|5.017008||cVu _is_uni_perl_idcont|5.017008||cVu _is_uni_perl_idstart|5.017007||cVu isUPPER|5.003007|5.003007|p isUPPER_A|5.013006|5.003007|p isUPPER_L1|5.013006|5.003007|p isUPPER_LC|5.004000|5.004000| isUPPER_LC_utf8|5.006000||Viu isUPPER_LC_utf8_safe|5.025009|5.006000|p isUPPER_LC_uvchr|5.007001|5.007001| isUPPER_uni|5.006000||Viu isUPPER_utf8|5.031005|5.031005| isUPPER_utf8_safe|5.025009|5.006000|p isUPPER_uvchr|5.023009|5.006000|p is_utf8_char|5.006000|5.006000|dn IS_UTF8_CHAR|5.009003||Viu isUTF8_CHAR|5.021001|5.006001|pn is_utf8_char_buf|5.015008|5.015008|n isUTF8_CHAR_flags|5.025005|5.025005| is_utf8_char_helper|5.031004||cVnu is_UTF8_CHAR_utf8_no_length_checks|5.021001||Viu is_utf8_common|5.009003||Viu is_utf8_cp_above_31_bits|5.025005||Vniu is_utf8_fixed_width_buf_flags|5.025006|5.025006|n is_utf8_fixed_width_buf_loc_flags|5.025006|5.025006|n is_utf8_fixed_width_buf_loclen_flags|5.025006|5.025006|n _is_utf8_FOO|5.031006||cVu is_utf8_invariant_string|5.025005|5.011000|pn is_utf8_invariant_string_loc|5.027001|5.027001|n is_utf8_non_invariant_string|5.027007||cVni is_utf8_overlong_given_start_byte_ok|5.025006||Vniu _is_utf8_perl_idcont|5.031006||cVu _is_utf8_perl_idstart|5.031006||cVu isUTF8_POSSIBLY_PROBLEMATIC|5.023003||Viu is_utf8_string|5.006001|5.006001|n is_utf8_string_flags|5.025006|5.025006|n is_utf8_string_loc|5.008001|5.008001|n is_utf8_string_loc_flags|5.025006|5.025006|n is_utf8_string_loclen|5.009003|5.009003|n is_utf8_string_loclen_flags|5.025006|5.025006|n is_utf8_valid_partial_char|5.025005|5.025005|n is_utf8_valid_partial_char_flags|5.025005|5.025005|n is_VERTWS_cp_high|5.017006||Viu is_VERTWS_high|5.017006||Viu isVERTWS_uni|5.017006||Viu isVERTWS_utf8|5.017006||Viu isVERTWS_utf8_safe|5.025009||Viu isVERTWS_uvchr|5.023009||Viu isWARNf_on|5.006001||Viu isWARN_on|5.006000||Viu isWARN_ONCE|5.006000||Viu isWB|5.021009||Viu isWORDCHAR|5.013006|5.003007|p isWORDCHAR_A|5.013006|5.003007|p isWORDCHAR_L1|5.013006|5.003007|p isWORDCHAR_lazy_if_safe|5.025009||Viu isWORDCHAR_LC|5.017007|5.004000|p isWORDCHAR_LC_utf8|5.017007||Viu isWORDCHAR_LC_utf8_safe|5.025009|5.006000|p isWORDCHAR_LC_uvchr|5.017007|5.017007| isWORDCHAR_uni|5.017006||Viu isWORDCHAR_utf8|5.031005|5.031005| isWORDCHAR_utf8_safe|5.025009|5.006000|p isWORDCHAR_uvchr|5.023009|5.006000|p isXDIGIT|5.006000|5.003007|p isXDIGIT_A|5.013006|5.003007|p is_XDIGIT_cp_high|5.017006||Viu is_XDIGIT_high|5.017006||Viu isXDIGIT_L1|5.013006|5.003007|p isXDIGIT_LC|5.017007|5.003007|p isXDIGIT_LC_utf8|5.017007||Viu isXDIGIT_LC_utf8_safe|5.025009|5.006000|p isXDIGIT_LC_uvchr|5.017007|5.017007| isXDIGIT_uni|5.006000||Viu isXDIGIT_utf8|5.031005|5.031005| isXDIGIT_utf8_safe|5.025009|5.006000|p isXDIGIT_uvchr|5.023009|5.006000|p is_XPERLSPACE_cp_high|5.017006||Viu is_XPERLSPACE_high|5.017006||Viu I_SYS_DIR|5.003007|5.003007|Vn I_SYS_FILE|5.003007|5.003007|Vn I_SYS_IOCTL|5.003007|5.003007|Vn I_SYSLOG|5.006000|5.006000|Vn I_SYS_MOUNT|5.023005|5.023005|Vn I_SYS_PARAM|5.003007|5.003007|Vn I_SYS_POLL|5.010001|5.010001|Vn I_SYS_RESOURCE|5.003007|5.003007|Vn I_SYS_SELECT|5.003007|5.003007|Vn I_SYS_STAT|5.003007|5.003007|Vn I_SYS_STATFS|5.023005|5.023005|Vn I_SYS_STATVFS|5.023005|5.023005|Vn I_SYS_TIME|5.003007|5.003007|Vn I_SYS_TIMES|5.003007|5.003007|Vn I_SYS_TYPES|5.003007|5.003007|Vn I_SYSUIO|5.006000|5.006000|Vn I_SYS_UN|5.003007|5.003007|Vn I_SYSUTSNAME|5.006000|5.006000|Vn I_SYS_VFS|5.023005|5.023005|Vn I_SYS_WAIT|5.003007|5.003007|Vn items||5.003007| I_TERMIOS|5.003007|5.003007|Vn I_TIME|5.003007|5.003007|Vn I_UNISTD|5.003007|5.003007|Vn I_USTAT|5.023005|5.023005|Vn I_UTIME|5.003007|5.003007|Vn I_V|5.006000|5.003007| IVdf|5.006000|5.003007|poVn IV_DIG|5.006000||Viu IV_IS_QUAD|5.006000||Viu IV_MAX|5.003007|5.003007| IV_MAX_P1|5.007002||Viu IV_MIN|5.003007|5.003007| IVSIZE|5.006000|5.003007|poVn IVTYPE|5.006000|5.003007|poVn I_WCHAR|5.027006|5.027006|Vn I_WCTYPE|5.029009|5.029009|Vn ix||5.003007| I_XLOCALE|5.025004|5.025004|Vn JE_OLD_STACK_HWM_restore|5.027002||Viu JE_OLD_STACK_HWM_save|5.027002||Viu JE_OLD_STACK_HWM_zero|5.027002||Viu jmaybe|5.003007||Viu JMPENV_BOOTSTRAP|5.006000||Viu JMPENV_JUMP|5.004000|5.004000| JMPENV_POP|5.004000||Viu JMPENV_PUSH|5.004000||Viu JOIN|5.005000||Viu join_exact|5.009004||Viu kBINOP|5.003007||Viu kCOP|5.003007||Viu KEEPCOPY_PAT_MOD|5.009005||Viu KEEPCOPY_PAT_MODS|5.009005||Viu KEEPS|5.009005||Viu KEEPS_next|5.009005||Viu KEEPS_next_fail|5.009005||Viu KEEPS_next_fail_t8_p8|5.033003||Viu KEEPS_next_fail_t8_pb|5.033003||Viu KEEPS_next_fail_tb_p8|5.033003||Viu KEEPS_next_fail_tb_pb|5.033003||Viu KEEPS_next_t8_p8|5.033003||Viu KEEPS_next_t8_pb|5.033003||Viu KEEPS_next_tb_p8|5.033003||Viu KEEPS_next_tb_pb|5.033003||Viu KEEPS_t8_p8|5.033003||Viu KEEPS_t8_pb|5.033003||Viu KEEPS_tb_p8|5.033003||Viu KEEPS_tb_pb|5.033003||Viu KELVIN_SIGN|5.017003||Viu KERNEL|5.003007||Viu KEY_abs|5.003007||Viu KEY_accept|5.003007||Viu KEY_alarm|5.003007||Viu KEY_and|5.003007||Viu KEY_atan2|5.003007||Viu KEY_AUTOLOAD|5.003007||Viu KEY_BEGIN|5.003007||Viu KEY_bind|5.003007||Viu KEY_binmode|5.003007||Viu KEY_bless|5.003007||Viu KEY_break|5.027008||Viu KEY_caller|5.003007||Viu KEY_catch|5.033007||Viu KEY_chdir|5.003007||Viu KEY_CHECK|5.006000||Viu KEY_chmod|5.003007||Viu KEY_chomp|5.003007||Viu KEY_chop|5.003007||Viu KEY_chown|5.003007||Viu KEY_chr|5.003007||Viu KEY_chroot|5.003007||Viu KEY_close|5.003007||Viu KEY_closedir|5.003007||Viu KEY_cmp|5.003007||Viu KEY_connect|5.003007||Viu KEY_continue|5.003007||Viu KEY_cos|5.003007||Viu KEY_crypt|5.003007||Viu KEY___DATA|5.003007||Viu KEY_dbmclose|5.003007||Viu KEY_dbmopen|5.003007||Viu KEY_default|5.027008||Viu KEY_defined|5.003007||Viu KEY_delete|5.003007||Viu KEY_DESTROY|5.003007||Viu KEY_die|5.003007||Viu KEY_do|5.003007||Viu KEY_dump|5.003007||Viu KEY_each|5.003007||Viu KEY_else|5.003007||Viu KEY_elsif|5.003007||Viu KEY___END|5.003007||Viu KEY_END|5.003007||Viu KEY_endgrent|5.003007||Viu KEY_endhostent|5.003007||Viu KEY_endnetent|5.003007||Viu KEY_endprotoent|5.003007||Viu KEY_endpwent|5.003007||Viu KEY_endservent|5.003007||Viu KEY_eof|5.003007||Viu KEY_eq|5.003007||Viu KEY_eval|5.003007||Viu KEY_evalbytes|5.015005||Viu KEY_exec|5.003007||Viu KEY_exists|5.003007||Viu KEY_exit|5.003007||Viu KEY_exp|5.003007||Viu KEY_fc|5.015008||Viu KEY_fcntl|5.003007||Viu KEY___FILE|5.003007||Viu KEY_fileno|5.003007||Viu KEY_flock|5.003007||Viu KEY_for|5.003007||Viu KEY_foreach|5.003007||Viu KEY_fork|5.003007||Viu KEY_format|5.003007||Viu KEY_formline|5.003007||Viu KEY_ge|5.003007||Viu KEY_getc|5.003007||Viu KEY_getgrent|5.003007||Viu KEY_getgrgid|5.003007||Viu KEY_getgrnam|5.003007||Viu KEY_gethostbyaddr|5.003007||Viu KEY_gethostbyname|5.003007||Viu KEY_gethostent|5.003007||Viu KEY_getlogin|5.003007||Viu KEY_getnetbyaddr|5.003007||Viu KEY_getnetbyname|5.003007||Viu KEY_getnetent|5.003007||Viu KEY_getpeername|5.003007||Viu KEY_getpgrp|5.003007||Viu KEY_getppid|5.003007||Viu KEY_getpriority|5.003007||Viu KEY_getprotobyname|5.003007||Viu KEY_getprotobynumber|5.003007||Viu KEY_getprotoent|5.003007||Viu KEY_getpwent|5.003007||Viu KEY_getpwnam|5.003007||Viu KEY_getpwuid|5.003007||Viu KEY_getservbyname|5.003007||Viu KEY_getservbyport|5.003007||Viu KEY_getservent|5.003007||Viu KEY_getsockname|5.003007||Viu KEY_getsockopt|5.003007||Viu KEY_getspnam|5.031011||Viu KEY_given|5.009003||Viu KEY_glob|5.003007||Viu KEY_gmtime|5.003007||Viu KEY_goto|5.003007||Viu KEY_grep|5.003007||Viu KEY_gt|5.003007||Viu KEY_hex|5.003007||Viu KEY_if|5.003007||Viu KEY_index|5.003007||Viu KEY_INIT|5.005000||Viu KEY_int|5.003007||Viu KEY_ioctl|5.003007||Viu KEY_isa|5.031007||Viu KEY_join|5.003007||Viu KEY_keys|5.003007||Viu KEY_kill|5.003007||Viu KEY_last|5.003007||Viu KEY_lc|5.003007||Viu KEY_lcfirst|5.003007||Viu KEY_le|5.003007||Viu KEY_length|5.003007||Viu KEY___LINE|5.003007||Viu KEY_link|5.003007||Viu KEY_listen|5.003007||Viu KEY_local|5.003007||Viu KEY_localtime|5.003007||Viu KEY_lock|5.005000||Viu KEY_log|5.003007||Viu KEY_lstat|5.003007||Viu KEY_lt|5.003007||Viu KEY_m|5.003007||Viu KEY_map|5.003007||Viu KEY_mkdir|5.003007||Viu KEY_msgctl|5.003007||Viu KEY_msgget|5.003007||Viu KEY_msgrcv|5.003007||Viu KEY_msgsnd|5.003007||Viu KEY_my|5.003007||Viu KEY_ne|5.003007||Viu KEY_next|5.003007||Viu KEY_no|5.003007||Viu KEY_not|5.003007||Viu KEY_NULL|5.003007||Viu KEY_oct|5.003007||Viu KEY_open|5.003007||Viu KEY_opendir|5.003007||Viu KEY_or|5.003007||Viu KEY_ord|5.003007||Viu KEY_our|5.006000||Viu KEY_pack|5.003007||Viu KEY_package|5.003007||Viu KEY___PACKAGE|5.004000||Viu KEY_pipe|5.003007||Viu KEY_pop|5.003007||Viu KEY_pos|5.003007||Viu KEY_print|5.003007||Viu KEY_printf|5.003007||Viu KEY_prototype|5.003007||Viu KEY_push|5.003007||Viu KEY_q|5.003007||Viu KEY_qq|5.003007||Viu KEY_qr|5.005000||Viu KEY_quotemeta|5.003007||Viu KEY_qw|5.003007||Viu KEY_qx|5.003007||Viu KEY_rand|5.003007||Viu KEY_read|5.003007||Viu KEY_readdir|5.003007||Viu KEY_readline|5.003007||Viu KEY_readlink|5.003007||Viu KEY_readpipe|5.003007||Viu KEY_recv|5.003007||Viu KEY_redo|5.003007||Viu KEY_ref|5.003007||Viu KEY_rename|5.003007||Viu KEY_require|5.003007||Viu KEY_reset|5.003007||Viu KEY_return|5.003007||Viu KEY_reverse|5.003007||Viu KEY_rewinddir|5.003007||Viu KEY_rindex|5.003007||Viu KEY_rmdir|5.003007||Viu KEY_s|5.003007||Viu KEY_say|5.009003||Viu KEY_scalar|5.003007||Viu KEY_seek|5.003007||Viu KEY_seekdir|5.003007||Viu KEY_select|5.003007||Viu KEY_semctl|5.003007||Viu KEY_semget|5.003007||Viu KEY_semop|5.003007||Viu KEY_send|5.003007||Viu KEY_setgrent|5.003007||Viu KEY_sethostent|5.003007||Viu KEY_setnetent|5.003007||Viu KEY_setpgrp|5.003007||Viu KEY_setpriority|5.003007||Viu KEY_setprotoent|5.003007||Viu KEY_setpwent|5.003007||Viu KEY_setservent|5.003007||Viu KEY_setsockopt|5.003007||Viu KEY_shift|5.003007||Viu KEY_shmctl|5.003007||Viu KEY_shmget|5.003007||Viu KEY_shmread|5.003007||Viu KEY_shmwrite|5.003007||Viu KEY_shutdown|5.003007||Viu KEY_sigvar|5.025004||Viu KEY_sin|5.003007||Viu KEY_sleep|5.003007||Viu KEY_socket|5.003007||Viu KEY_socketpair|5.003007||Viu KEY_sort|5.003007||Viu KEY_splice|5.003007||Viu KEY_split|5.003007||Viu KEY_sprintf|5.003007||Viu KEY_sqrt|5.003007||Viu KEY_srand|5.003007||Viu KEY_stat|5.003007||Viu KEY_state|5.009004||Viu KEY_study|5.003007||Viu KEY_sub|5.003007||Viu KEY___SUB|5.015006||Viu KEY_substr|5.003007||Viu KEY_symlink|5.003007||Viu KEY_syscall|5.003007||Viu KEY_sysopen|5.003007||Viu KEY_sysread|5.003007||Viu KEY_sysseek|5.004000||Viu KEY_system|5.003007||Viu KEY_syswrite|5.003007||Viu KEY_tell|5.003007||Viu KEY_telldir|5.003007||Viu KEY_tie|5.003007||Viu KEY_tied|5.003007||Viu KEY_time|5.003007||Viu KEY_times|5.003007||Viu KEY_tr|5.003007||Viu KEY_truncate|5.003007||Viu KEY_try|5.033007||Viu KEY_uc|5.003007||Viu KEY_ucfirst|5.003007||Viu KEY_umask|5.003007||Viu KEY_undef|5.003007||Viu KEY_UNITCHECK|5.009005||Viu KEY_unless|5.003007||Viu KEY_unlink|5.003007||Viu KEY_unpack|5.003007||Viu KEY_unshift|5.003007||Viu KEY_untie|5.003007||Viu KEY_until|5.003007||Viu KEY_use|5.003007||Viu KEY_utime|5.003007||Viu KEY_values|5.003007||Viu KEY_vec|5.003007||Viu KEY_wait|5.003007||Viu KEY_waitpid|5.003007||Viu KEY_wantarray|5.003007||Viu KEY_warn|5.003007||Viu KEY_when|5.027008||Viu KEY_while|5.003007||Viu keyword|5.003007||Viu KEYWORD_PLUGIN_DECLINE|5.011002||Viu KEYWORD_PLUGIN_EXPR|5.011002||Viu KEYWORD_PLUGIN_MUTEX_INIT|5.027006||Viu KEYWORD_PLUGIN_MUTEX_LOCK|5.027006||Viu KEYWORD_PLUGIN_MUTEX_TERM|5.027006||Viu KEYWORD_PLUGIN_MUTEX_UNLOCK|5.027006||Viu keyword_plugin_standard|||iu KEYWORD_PLUGIN_STMT|5.011002||Viu KEY_write|5.003007||Viu KEY_x|5.003007||Viu KEY_xor|5.003007||Viu KEY_y|5.003007||Viu kGVOP_gv|5.006000||Viu kill|5.005000||Viu killpg|5.005000||Viu kLISTOP|5.003007||Viu kLOGOP|5.003007||Viu kLOOP|5.003007||Viu kPADOP|5.006000||Viu kPMOP|5.003007||Viu kPVOP|5.003007||Viu kSVOP|5.003007||Viu kSVOP_sv|5.006000||Viu kUNOP|5.003007||Viu kUNOP_AUX|5.021007||Viu LATIN1_TO_NATIVE|5.019004|5.003007|p LATIN_CAPITAL_LETTER_A_WITH_RING_ABOVE|5.013011||Viu LATIN_CAPITAL_LETTER_A_WITH_RING_ABOVE_NATIVE|5.017004||Viu LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE|5.023002||Viu LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE_UTF8|5.023002||Viu LATIN_CAPITAL_LETTER_SHARP_S|5.014000||Viu LATIN_CAPITAL_LETTER_SHARP_S_UTF8|5.019001||Viu LATIN_CAPITAL_LETTER_Y_WITH_DIAERESIS|5.013011||Viu LATIN_SMALL_LETTER_A_WITH_RING_ABOVE|5.013011||Viu LATIN_SMALL_LETTER_A_WITH_RING_ABOVE_NATIVE|5.017004||Viu LATIN_SMALL_LETTER_DOTLESS_I|5.023002||Viu LATIN_SMALL_LETTER_DOTLESS_I_UTF8|5.023002||Viu LATIN_SMALL_LETTER_LONG_S|5.017003||Viu LATIN_SMALL_LETTER_LONG_S_UTF8|5.019001||Viu LATIN_SMALL_LETTER_SHARP_S|5.011002||Viu LATIN_SMALL_LETTER_SHARP_S_NATIVE|5.017004||Viu LATIN_SMALL_LETTER_SHARP_S_UTF8|5.033003||Viu LATIN_SMALL_LETTER_Y_WITH_DIAERESIS|5.011002||Viu LATIN_SMALL_LETTER_Y_WITH_DIAERESIS_NATIVE|5.017004||Viu LATIN_SMALL_LIGATURE_LONG_S_T|5.019004||Viu LATIN_SMALL_LIGATURE_LONG_S_T_UTF8|5.019004||Viu LATIN_SMALL_LIGATURE_ST|5.019004||Viu LATIN_SMALL_LIGATURE_ST_UTF8|5.019004||Viu LB_BREAKABLE|5.023007||Viu LB_CM_ZWJ_foo|5.025003||Viu LB_HY_or_BA_then_foo|5.023007||Viu LB_NOBREAK|5.023007||Viu LB_NOBREAK_EVEN_WITH_SP_BETWEEN|5.023007||Viu LB_PR_or_PO_then_OP_or_HY|5.023007||Viu LB_RI_then_RI|5.025003||Viu LB_SP_foo|5.023007||Viu LB_SY_or_IS_then_various|5.023007||Viu LB_various_then_PO_or_PR|5.023007||Viu LC_NUMERIC_LOCK|5.027009||pVu LC_NUMERIC_UNLOCK|5.027009||pVu LDBL_DIG|5.006000||Viu LEAVE|5.003007|5.003007| leave_adjust_stacks|5.023008|5.023008|xu leave_scope|5.003007|5.003007|u LEAVE_SCOPE|5.003007||Viu LEAVE_with_name|5.011002|5.011002| LEXACT|5.031005||Viu LEXACT_REQ8|5.031006||Viu LEXACT_REQ8_t8_p8|5.033003||Viu LEXACT_REQ8_t8_pb|5.033003||Viu LEXACT_REQ8_tb_p8|5.033003||Viu LEXACT_REQ8_tb_pb|5.033003||Viu LEXACT_t8_p8|5.033003||Viu LEXACT_t8_pb|5.033003||Viu LEXACT_tb_p8|5.033003||Viu LEXACT_tb_pb|5.033003||Viu lex_bufutf8|5.011002|5.011002|x lex_discard_to|5.011002|5.011002|x LEX_DONT_CLOSE_RSFP|5.015009||Viu LEX_EVALBYTES|5.015005||Viu lex_grow_linestr|5.011002|5.011002|x LEX_IGNORE_UTF8_HINTS|5.015005||Viu LEX_KEEP_PREVIOUS|5.011002|5.011002| lex_next_chunk|5.011002|5.011002|x LEX_NOTPARSING|5.004004||Viu lex_peek_unichar|5.011002|5.011002|x lex_read_space|5.011002|5.011002|x lex_read_to|5.011002|5.011002|x lex_read_unichar|5.011002|5.011002|x lex_start|5.009005|5.009005|x LEX_START_COPIED|5.015005||Viu LEX_START_FLAGS|5.015005||Viu LEX_START_SAME_FILTER|5.014000||Viu lex_stuff_pv|5.013006|5.013006|x lex_stuff_pvn|5.011002|5.011002|x lex_stuff_pvs|5.013005|5.013005|x lex_stuff_sv|5.011002|5.011002|x LEX_STUFF_UTF8|5.011002|5.011002| lex_unstuff|5.011002|5.011002|x LF_NATIVE|5.019004||Viu LIB_INVARG|5.008001||Viu LIBM_LIB_VERSION|5.009003|5.009003|Vn LIKELY|5.009004|5.003007|p link|5.006000||Viu LINKLIST|5.013006|5.013006| list|5.003007||Viu listen|5.005000||Viu listkids|5.003007||Viu LNBREAK|5.009005||Viu LNBREAK_t8_p8|5.033003||Viu LNBREAK_t8_pb|5.033003||Viu LNBREAK_tb_p8|5.033003||Viu LNBREAK_tb_pb|5.033003||Viu load_charnames|5.031010||cViu load_module|5.006000|5.003007|pv load_module_nocontext|5.006000||vVn LOCALECONV_LOCK|5.033005||Viu LOCALECONV_UNLOCK|5.033005||Viu LOCALE_INIT|5.024000||Viu LOCALE_INIT_LC_NUMERIC|5.033005||Viu LOCALE_LOCK|5.024000||Viu LOCALE_PAT_MOD|5.013006||Viu LOCALE_PAT_MODS|5.013006||Viu LOCALE_READ_LOCK|5.033005||Viu LOCALE_READ_UNLOCK|5.033005||Viu LOCALE_TERM|5.024000||Viu LOCALE_TERM_LC_NUMERIC|5.033005||Viu LOCALE_TERM_POSIX_2008|5.033005||Viu LOCALE_UNLOCK|5.024000||Viu localize|5.003007||Viu LOCAL_PATCH_COUNT|5.003007||Viu localtime|5.031011||Viu LOCALTIME_MAX|5.010001|5.010001|Vn LOCALTIME_MIN|5.010001|5.010001|Vn LOCALTIME_R_NEEDS_TZSET|5.010000|5.010000|Vn LOCALTIME_R_PROTO|5.008000|5.008000|Vn LOCK_DOLLARZERO_MUTEX|5.008001||Viu lockf|5.006000||Viu LOCK_LC_NUMERIC_STANDARD|5.021010||poVnu LOCK_NUMERIC_STANDARD|||piu LOC_SED|5.003007|5.003007|Vn LOGICAL|5.005000||Viu LOGICAL_t8_p8|5.033003||Viu LOGICAL_t8_pb|5.033003||Viu LOGICAL_tb_p8|5.033003||Viu LOGICAL_tb_pb|5.033003||Viu LONGDBLINFBYTES|5.023000|5.023000|Vn LONGDBLMANTBITS|5.023000|5.023000|Vn LONGDBLNANBYTES|5.023000|5.023000|Vn LONGDOUBLE_BIG_ENDIAN|5.021009||Viu LONGDOUBLE_DOUBLEDOUBLE|5.021009||Viu LONG_DOUBLE_EQUALS_DOUBLE|5.007001||Viu LONG_DOUBLE_IS_DOUBLE|5.021003|5.021003|Vn LONG_DOUBLE_IS_DOUBLEDOUBLE_128_BIT_BE_BE|5.023006|5.023006|Vn LONG_DOUBLE_IS_DOUBLEDOUBLE_128_BIT_BE_LE|5.023006|5.023006|Vn LONG_DOUBLE_IS_DOUBLEDOUBLE_128_BIT_BIG_ENDIAN|5.021003|5.021003|Vn LONG_DOUBLE_IS_DOUBLEDOUBLE_128_BIT_LE_BE|5.023006|5.023006|Vn LONG_DOUBLE_IS_DOUBLEDOUBLE_128_BIT_LE_LE|5.023006|5.023006|Vn LONG_DOUBLE_IS_DOUBLEDOUBLE_128_BIT_LITTLE_ENDIAN|5.021003|5.021003|Vn LONG_DOUBLE_IS_IEEE_754_128_BIT_BIG_ENDIAN|5.021003|5.021003|Vn LONG_DOUBLE_IS_IEEE_754_128_BIT_LITTLE_ENDIAN|5.021003|5.021003|Vn LONG_DOUBLE_IS_UNKNOWN_FORMAT|5.021003|5.021003|Vn LONG_DOUBLE_IS_VAX_H_FLOAT|5.025004|5.025004|Vn LONG_DOUBLE_IS_X86_80_BIT_BIG_ENDIAN|5.021003|5.021003|Vn LONG_DOUBLE_IS_X86_80_BIT_LITTLE_ENDIAN|5.021003|5.021003|Vn LONG_DOUBLEKIND|5.021003|5.021003|Vn LONGDOUBLE_LITTLE_ENDIAN|5.021009||Viu LONGDOUBLE_MIX_ENDIAN|5.023006||Viu LONG_DOUBLESIZE|5.005000|5.005000|Vn LONG_DOUBLE_STYLE_IEEE|5.025007|5.025007|Vn LONG_DOUBLE_STYLE_IEEE_EXTENDED|5.025007|5.025007|Vn LONGDOUBLE_VAX_ENDIAN|5.025004||Viu LONGDOUBLE_X86_80_BIT|5.021009||Viu LONGJMP|5.005000||Viu longjmp|5.005000||Viu LONGJMP_t8_p8|5.033003||Viu LONGJMP_t8_pb|5.033003||Viu LONGJMP_tb_p8|5.033003||Viu LONGJMP_tb_pb|5.033003||Viu LONGLONGSIZE|5.005000|5.005000|Vn LONGSIZE|5.004000|5.003007|oVn looks_like_bool|5.027008||Viu looks_like_number|5.003007|5.003007| LOOP_PAT_MODS|5.009005||Viu lop|5.005000||Viu lossless_NV_to_IV|5.031001||Vniu LOWEST_ANYOF_HRx_BYTE|5.031002||Viu L_R_TZSET|5.009005|5.009005|Vn lseek|5.005000||Viu LSEEKSIZE|5.006000|5.006000|Vn lstat|5.005000||Viu LvFLAGS|5.015006||Viu LVf_NEG_LEN|5.027001||Viu LVf_NEG_OFF|5.027001||Viu LVf_OUT_OF_RANGE|5.027001||Viu LVRET|5.007001||Vi LvSTARGOFF|5.019004||Viu LvTARG|5.003007||Viu LvTARGLEN|5.003007||Viu LvTARGOFF|5.003007||Viu LvTYPE|5.003007||Viu magic_clear_all_env|5.004001||Viu magic_cleararylen_p|5.017002||Viu magic_clearenv|5.003007||Viu magic_clearhint|5.009004||Vi magic_clearhints|5.011000||Vi magic_clearisa|5.010001||Viu magic_clearpack|5.003007||Viu magic_clearsig|5.003007||Viu magic_copycallchecker|5.017000||Viu magic_dump|5.006000|5.006000|u magic_existspack|5.003007||Viu magic_freearylen_p|5.009003||Viu magic_freecollxfrm|5.033004||Viu magic_freemglob|5.033004||Viu magic_freeovrld|5.007001||Viu magic_freeutf8|5.033004||Viu magic_get|5.003007||Viu magic_getarylen|5.003007||Viu magic_getdebugvar|5.021005||Viu magic_getdefelem|5.004000||Viu magic_getnkeys|5.004005||Viu magic_getpack|5.003007||Viu magic_getpos|5.003007||Viu magic_getsig|5.003007||Viu magic_getsubstr|5.004005||Viu magic_gettaint|5.003007||Viu magic_getuvar|5.003007||Viu magic_getvec|5.004005||Viu magic_killbackrefs|5.006000||Viu magic_methcall1|5.013001||Viu magic_methcall|||vi magic_methpack|5.005000||Viu magic_nextpack|5.003007||Viu magic_regdata_cnt|5.006000||Viu magic_regdatum_get|5.006000||Viu magic_regdatum_set|5.006001||Viu magic_scalarpack|5.009001||Viu magic_set|5.003007||Viu magic_set_all_env|5.004004||Viu magic_setarylen|5.003007||Viu magic_setcollxfrm|5.004000||Viu magic_setdbline|5.003007||Viu magic_setdebugvar|5.021005||Viu magic_setdefelem|5.004000||Viu magic_setenv|5.003007||Viu magic_sethint|5.009004||Vi magic_sethint_feature|5.031007||Viu magic_setisa|5.003007||Viu magic_setlvref|5.021005||Viu magic_setmglob|5.003007||Viu magic_setnkeys|5.003007||Viu magic_setnonelem|5.027009||Viu magic_setpack|5.003007||Viu magic_setpos|5.003007||Viu magic_setregexp|5.008001||Viu magic_setsig|5.003007||Viu magic_setsigall|5.035001||Viu magic_setsubstr|5.003007||Viu magic_settaint|5.003007||Viu magic_setutf8|5.008001||Viu magic_setuvar|5.003007||Viu magic_setvec|5.003007||Viu magic_sizepack|5.005000||Viu magic_wipepack|5.003007||Viu make_exactf_invlist|5.031006||Viu make_matcher|5.027008||Viu make_trie|5.009002||Viu malloc|5.007002|5.007002|n MALLOC_CHECK_TAINT2|5.008001||Viu MALLOC_CHECK_TAINT|5.008001||Viu malloced_size|5.005000||Vniu malloc_good_size|5.010001||Vniu MALLOC_INIT|5.005000||Viu MALLOC_OVERHEAD|5.006000||Viu Malloc_t|5.003007|5.003007|Vn MALLOC_TERM|5.005000||Viu MALLOC_TOO_LATE_FOR|5.008001||Viu MARK|5.003007|5.003007| MARKPOINT|5.009005||Viu MARKPOINT_next|5.009005||Viu MARKPOINT_next_fail|5.009005||Viu MARKPOINT_next_fail_t8_p8|5.033003||Viu MARKPOINT_next_fail_t8_pb|5.033003||Viu MARKPOINT_next_fail_tb_p8|5.033003||Viu MARKPOINT_next_fail_tb_pb|5.033003||Viu MARKPOINT_next_t8_p8|5.033003||Viu MARKPOINT_next_t8_pb|5.033003||Viu MARKPOINT_next_tb_p8|5.033003||Viu MARKPOINT_next_tb_pb|5.033003||Viu MARKPOINT_t8_p8|5.033003||Viu MARKPOINT_t8_pb|5.033003||Viu MARKPOINT_tb_p8|5.033003||Viu MARKPOINT_tb_pb|5.033003||Viu markstack_grow|5.021001|5.021001|u matcher_matches_sv|5.027008||Viu MAX|5.025006||Viu MAX_ANYOF_HRx_BYTE|5.031002||Viu MAXARG|5.003007||Viu MAX_CHARSET_NAME_LENGTH|5.013009||Viu MAX_FEATURE_LEN|5.013010||Viu MAX_FOLD_FROMS|5.029006||Viu MAX_LEGAL_CP|5.029002||Viu MAX_MATCHES|5.033005||Viu MAXO|5.003007||Viu MAXPATHLEN|5.006000||Viu MAX_PORTABLE_UTF8_TWO_BYTE|5.011002||Viu MAX_PRINT_A|5.033005||Viu MAX_RECURSE_EVAL_NOCHANGE_DEPTH|5.009005||Viu MAXSYSFD|5.003007||Viu MAX_UNICODE_UTF8|5.027006||Viu MAX_UNI_KEYWORD_INDEX|5.027011||Viu MAX_UTF8_TWO_BYTE|5.019004||Viu MAYBE_DEREF_GV|5.015003||Viu MAYBE_DEREF_GV_flags|5.015003||Viu MAYBE_DEREF_GV_nomg|5.015003||Viu maybe_multimagic_gv|5.019004||Viu mayberelocate|5.015006||Viu MBLEN_LOCK|5.033005||Viu MBLEN_UNLOCK|5.033005||Viu MBOL|5.003007||Viu MBOL_t8_p8|5.033003||Viu MBOL_t8_pb|5.033003||Viu MBOL_tb_p8|5.033003||Viu MBOL_tb_pb|5.033003||Viu MBTOWC_LOCK|5.033005||Viu MBTOWC_UNLOCK|5.033005||Viu MDEREF_ACTION_MASK|5.021007||Viu MDEREF_AV_gvav_aelem|5.021007||Viu MDEREF_AV_gvsv_vivify_rv2av_aelem|5.021007||Viu MDEREF_AV_padav_aelem|5.021007||Viu MDEREF_AV_padsv_vivify_rv2av_aelem|5.021007||Viu MDEREF_AV_pop_rv2av_aelem|5.021007||Viu MDEREF_AV_vivify_rv2av_aelem|5.021007||Viu MDEREF_FLAG_last|5.021007||Viu MDEREF_HV_gvhv_helem|5.021007||Viu MDEREF_HV_gvsv_vivify_rv2hv_helem|5.021007||Viu MDEREF_HV_padhv_helem|5.021007||Viu MDEREF_HV_padsv_vivify_rv2hv_helem|5.021007||Viu MDEREF_HV_pop_rv2hv_helem|5.021007||Viu MDEREF_HV_vivify_rv2hv_helem|5.021007||Viu MDEREF_INDEX_const|5.021007||Viu MDEREF_INDEX_gvsv|5.021007||Viu MDEREF_INDEX_MASK|5.021007||Viu MDEREF_INDEX_none|5.021007||Viu MDEREF_INDEX_padsv|5.021007||Viu MDEREF_MASK|5.021007||Viu MDEREF_reload|5.021007||Viu MDEREF_SHIFT|5.021007||Viu measure_struct|5.007003||Viu MEM_ALIGNBYTES|5.003007|5.003007|Vn memBEGINPs|5.027006||Viu memBEGINs|5.027006||Viu MEMBER_TO_FPTR|5.006000||Viu memCHRs|5.031008|5.003007|p mem_collxfrm|5.003007||dViu _mem_collxfrm|5.025002||Viu memENDPs|5.027006||Viu memENDs|5.027006||Viu memEQ|5.004000|5.003007|p memEQs|5.009005|5.003007|p memGE|5.025005||Viu memGT|5.025005||Viu memLE|5.025005||Viu MEM_LOG_ALLOC|5.009003||Viu mem_log_alloc|5.024000||Vniu mem_log_common|5.010001||Vniu MEM_LOG_FREE|5.009003||Viu mem_log_free|5.024000||Vniu MEM_LOG_REALLOC|5.009003||Viu mem_log_realloc|5.024000||Vniu memLT|5.025005||Viu memNE|5.004000|5.003007|p memNEs|5.009005|5.003007|p MEM_SIZE|5.003007||Viu MEM_SIZE_MAX|5.009005||Viu MEM_WRAP_CHECK_1|5.009002||Viu MEM_WRAP_CHECK|5.009002||Viu MEM_WRAP_CHECK_s|5.027010||Viu memzero|5.003007|5.003007| MEOL|5.003007||Viu MEOL_t8_p8|5.033003||Viu MEOL_t8_pb|5.033003||Viu MEOL_tb_p8|5.033003||Viu MEOL_tb_pb|5.033003||Viu mess|5.006000|5.004000|pv mess_alloc|5.005000||Viu mess_nocontext|5.006000||pvVn mess_sv|5.013001|5.004000|p MEXTEND|5.003007||Viu mfree|5.007002|5.007002|nu MgBYTEPOS|5.019004||Viu MgBYTEPOS_set|5.019004||Viu mg_clear|5.003007|5.003007| mg_copy|5.003007|5.003007| mg_dup|5.007003|5.007003|u MGf_BYTES|5.019004||Viu MGf_COPY|5.007003||Viu MGf_DUP|5.007003||Viu MGf_GSKIP|5.003007||Viu mg_find|5.003007|5.003007|n mg_findext|5.013008|5.003007|pn mg_find_mglob|5.019002||cViu MGf_LOCAL|5.009003||Viu MGf_MINMATCH|5.003007||Viu MGf_PERSIST|5.021005||Viu mg_free|5.003007|5.003007| mg_freeext|5.027004|5.027004| mg_free_type|5.013006|5.013006| MGf_REFCOUNTED|5.003007||Viu MGf_REQUIRE_GV|5.021004||Viu MGf_TAINTEDDIR|5.003007||Viu mg_get|5.003007|5.003007| mg_length|5.005000|5.005000|d mg_localize|5.009003||Vi mg_magical|5.003007|5.003007|n MgPV|5.003007||Viu MgPV_const|5.009003||Viu MgPV_nolen_const|5.009003||Viu mg_set|5.003007|5.003007| mg_size|5.005000|5.005000|u MgSV|5.033009||Viu MgTAINTEDDIR|5.003007||Viu MgTAINTEDDIR_off|5.004000||Viu MgTAINTEDDIR_on|5.003007||Viu MICRO_SIGN|5.011002||Viu MICRO_SIGN_NATIVE|5.017004||Viu MICRO_SIGN_UTF8|5.033003||Viu MIN|5.025006||Viu mini_mktime|5.007002|5.007002|n MINMOD|5.003007||Viu MINMOD_t8_p8|5.033003||Viu MINMOD_t8_pb|5.033003||Viu MINMOD_tb_p8|5.033003||Viu MINMOD_tb_pb|5.033003||Viu minus_v|5.015006||Viu missingterm|5.005000||Viu MJD_OFFSET_DEBUG|5.009004||Viu Mkdir|5.004000||Viu mkdir|5.005000||Viu mktemp|5.005000||Viu Mmap_t|5.006000|5.006000|Vn mode_from_discipline|5.006000||Viu Mode_t|5.003007|5.003007|Vn modkids|5.003007||Viu MON_10|5.027010||Viu MON_11|5.027010||Viu MON_12|5.027010||Viu MON_1|5.027010||Viu MON_2|5.027010||Viu MON_3|5.027010||Viu MON_4|5.027010||Viu MON_5|5.027010||Viu MON_6|5.027010||Viu MON_7|5.027010||Viu MON_8|5.027010||Viu MON_9|5.027010||Viu more_bodies|||iu more_sv|5.009004||Viu moreswitches|5.003007||cVu mortal_getenv|5.031011||cVnu Move|5.003007|5.003007| MoveD|5.009002|5.003007|p move_proto_attr|5.019005||Viu M_PAT_MODS|5.009005||Viu MPH_BUCKETS|5.027011||Viu MPH_RSHIFT|5.027011||Viu MPH_VALt|5.027011||Viu mPUSHi|5.009002|5.003007|p mPUSHn|5.009002|5.003007|p mPUSHp|5.009002|5.003007|p mPUSHs|5.010001|5.003007|p mPUSHu|5.009002|5.003007|p mro_clean_isarev|5.013007||Viu mro_gather_and_rename|5.013007||Viu mro_get_from_name|5.010001|5.010001|u mro_get_linear_isa|5.009005|5.009005| mro_get_linear_isa_c3|||i mro_get_linear_isa_dfs|5.009005||Vi MRO_GET_PRIVATE_DATA|5.010001|5.010001| mro_get_private_data|||cu mro_isa_changed_in|5.009005||Vi mro_meta_dup|5.009005||Viu mro_meta_init|||ciu mro_method_changed_in|5.009005|5.009005| mro_package_moved|5.013006||Vi mro_register|5.010001|5.010001| mro_set_mro|5.010001|5.010001|u mro_set_private_data|5.010001|5.010001| MSPAGAIN|5.003007||Viu MSVC_DIAG_IGNORE|5.029010||Viu MSVC_DIAG_IGNORE_DECL|5.029010||Viu MSVC_DIAG_IGNORE_STMT|5.029010||Viu MSVC_DIAG_RESTORE|5.029010||Viu MSVC_DIAG_RESTORE_DECL|5.029010||Viu MSVC_DIAG_RESTORE_STMT|5.029010||Viu mul128|5.005000||Viu MULTICALL|5.009003|5.009003| multiconcat_stringify|5.027006||cViu multideref_stringify|5.021009||cViu MULTILINE_PAT_MOD|5.009005||Viu MULTIPLICITY|5.006000|5.006000|Vn MUTABLE_AV|5.010001|5.003007|p MUTABLE_CV|5.010001|5.003007|p MUTABLE_GV|5.010001|5.003007|p MUTABLE_HV|5.010001|5.003007|p MUTABLE_IO|5.010001|5.003007|p MUTABLE_PTR|5.010001|5.003007|p MUTABLE_SV|5.010001|5.003007|p MUTEX_DESTROY|5.005000||Viu MUTEX_INIT|5.005000||Viu MUTEX_INIT_NEEDS_MUTEX_ZEROED|5.005003||Viu MUTEX_LOCK|5.005000||Viu MUTEX_UNLOCK|5.005000||Viu mXPUSHi|5.009002|5.003007|p mXPUSHn|5.009002|5.003007|p mXPUSHp|5.009002|5.003007|p mXPUSHs|5.010001|5.003007|p mXPUSHu|5.009002|5.003007|p my|5.011000||Viu my_atof2|5.029000||cVu my_atof3|5.029000||cVu my_atof|5.006000|5.006000| my_attrs|5.006000||Viu my_binmode|5.006000||Viu my_bytes_to_utf8|5.021009||Vniu my_chsize|5.003007||Vu my_clearenv|5.009003||Viu MY_CXT|5.009000|5.009000|p MY_CXT_CLONE|5.009002|5.009000|p MY_CXT_INDEX|5.009005||Viu MY_CXT_INIT|5.009000|5.009000|p my_cxt_init|5.009000|5.009000|u MY_CXT_INIT_ARG|5.013005||Viu MY_CXT_INIT_INTERP|5.009003||Viu my_dirfd|5.009005|5.009005|nu my_exit|5.003007|5.003007| my_exit_jump|5.005000||Viu my_failure_exit|5.004000|5.004000|u my_fflush_all|5.006000|5.006000|u my_fork|5.007003|5.007003|nu my_kid|5.006000||Viu my_lstat|5.013003||Viu my_lstat_flags|5.013003||cViu my_memrchr|5.027006||Vniu my_mkostemp_cloexec|||niu my_mkostemp|||niu my_mkstemp_cloexec|||niu my_mkstemp|||niu my_nl_langinfo|5.027006||Vniu my_pclose|5.003007|5.003007|u my_popen|5.003007|5.003007|u my_popen_list|5.007001|5.007001|u my_setenv|5.003007|5.003007| my_snprintf|5.009004|5.003007|pvn my_socketpair|5.007003|5.007003|nu my_sprintf|5.009003|5.003007|pdn my_stat|5.013003||Viu my_stat_flags|5.013003||cViu my_strerror|5.021001||Viu my_strftime|5.007002|5.007002| my_strlcat|5.009004|5.003007|pn my_strlcpy|5.009004|5.003007|pn my_strnlen|5.027006|5.003007|pn my_strtod|5.029010|5.029010|n my_unexec|5.003007||Viu my_vsnprintf|5.009004|5.009004|n N0|5.029001||Viu N10|5.029001||Viu N11|5.029001||Viu N1|5.029001||Viu N2|5.029001||Viu N3|5.029001||Viu N4|5.029001||Viu N5|5.029001||Viu N6|5.029001||Viu N7|5.029001||Viu N8|5.029001||Viu N9|5.029001||Viu NAN_COMPARE_BROKEN|5.021005||Viu NANYOFM|5.029005||Viu NANYOFM_t8_p8|5.033003||Viu NANYOFM_t8_pb|5.033003||Viu NANYOFM_tb_p8|5.033003||Viu NANYOFM_tb_pb|5.033003||Viu NATIVE8_TO_UNI|5.011000||Viu NATIVE_BYTE_IS_INVARIANT|5.019004||Viu NATIVE_SKIP|5.019004||Viu NATIVE_TO_ASCII|5.007001||Viu NATIVE_TO_I8|5.015006||Viu NATIVE_TO_LATIN1|5.019004|5.003007|p NATIVE_TO_NEED|5.019004||dcVnu NATIVE_TO_UNI|5.007001|5.003007|p NATIVE_TO_UTF|5.007001||Viu NATIVE_UTF8_TO_I8|5.019004||Viu nBIT_MASK|5.033001||Viu nBIT_UMAX|5.033001||Viu NBOUND|5.003007||Viu NBOUNDA|5.013009||Viu NBOUNDA_t8_p8|5.033003||Viu NBOUNDA_t8_pb|5.033003||Viu NBOUNDA_tb_p8|5.033003||Viu NBOUNDA_tb_pb|5.033003||Viu NBOUNDL|5.004000||Viu NBOUNDL_t8_p8|5.033003||Viu NBOUNDL_t8_pb|5.033003||Viu NBOUNDL_tb_p8|5.033003||Viu NBOUNDL_tb_pb|5.033003||Viu NBOUND_t8_p8|5.033003||Viu NBOUND_t8_pb|5.033003||Viu NBOUND_tb_p8|5.033003||Viu NBOUND_tb_pb|5.033003||Viu NBOUNDU|5.013009||Viu NBOUNDU_t8_p8|5.033003||Viu NBOUNDU_t8_pb|5.033003||Viu NBOUNDU_tb_p8|5.033003||Viu NBOUNDU_tb_pb|5.033003||Viu NBSP_NATIVE|5.021001||Viu NBSP_UTF8|5.021001||Viu NDBM_H_USES_PROTOTYPES|5.032001|5.032001|Vn NDEBUG|5.021007||Viu NEED_PTHREAD_INIT|5.005000||Viu need_utf8|5.009003||Vniu NEED_VA_COPY|5.007001|5.007001|Vn NEGATIVE_INDICES_VAR|5.008001||Viu Netdb_hlen_t|5.005000|5.005000|Vn Netdb_host_t|5.005000|5.005000|Vn Netdb_name_t|5.005000|5.005000|Vn Netdb_net_t|5.005000|5.005000|Vn NETDB_R_OBSOLETE|5.008000||Viu New|5.003007||Viu newANONATTRSUB|5.006000|5.006000|u newANONHASH|5.003007|5.003007|u newANONLIST|5.003007|5.003007|u newANONSUB|5.003007|5.003007|u newASSIGNOP|5.003007|5.003007| newATTRSUB|5.006000|5.006000| newATTRSUB_x|5.019008||cVi newAV|5.003007|5.003007| newAV_alloc_x|5.035001|5.035001| newAV_alloc_xz|5.035001|5.035001| newAVREF|5.003007|5.003007|u newBINOP|5.003007|5.003007| Newc|5.003007||Viu new_collate|5.006000||Viu newCONDOP|5.003007|5.003007| new_constant|||iu newCONSTSUB|5.004005|5.003007|p newCONSTSUB_flags|5.015006|5.015006| new_ctype|5.006000||Viu newCVREF|5.003007|5.003007|u newDEFSVOP|5.021006|5.021006| newFORM|5.003007|5.003007|u newFOROP|5.013007|5.013007| newGIVENOP|5.009003|5.009003| newGIVWHENOP|5.027008||Viu newGP|||xiu newGVgen|5.003007|5.003007|u newGVgen_flags|5.015004|5.015004|u newGVOP|5.003007|5.003007| newGVREF|5.003007|5.003007|u new_he|5.005000||Viu newHV|5.003007|5.003007| newHVhv|5.005000|5.005000|u newHVREF|5.003007|5.003007|u _new_invlist|5.013010||cViu _new_invlist_C_array|5.015008||cViu newIO|5.003007|5.003007|u newLISTOP|5.003007|5.003007| newLOGOP|5.003007|5.003007| new_logop|5.005000||Viu newLOOPEX|5.003007|5.003007| newLOOPOP|5.003007|5.003007| newMETHOP|5.021005|5.021005| newMETHOP_internal|5.021005||Viu newMETHOP_named|5.021005|5.021005| new_msg_hv|5.027009||Viu newMYSUB|5.017004|5.017004|u newNULLLIST|5.003007|5.003007| new_numeric|5.006000||Viu newOP|5.003007|5.003007| NewOp|5.008001||Viu newPADNAMELIST|5.021007|5.021007|xn newPADNAMEouter|5.021007|5.021007|xn newPADNAMEpvn|5.021007|5.021007|xn newPADOP|5.006000||V newPMOP|5.003007|5.003007| newPROG|5.003007|5.003007|u newPVOP|5.003007|5.003007| newRANGE|5.003007|5.003007| newRV|5.003007|5.003007| newRV_inc|5.004000|5.003007|p newRV_noinc|5.004000|5.003007|p newSLICEOP|5.003007|5.003007| new_stackinfo|5.005000|5.005000|u newSTATEOP|5.003007|5.003007| newSTUB|5.017001||Viu newSUB|5.003007|5.003007| newSV|5.003007|5.003007| NEWSV|5.003007||Viu newSVavdefelem|5.019004||Viu newSVhek|5.009003|5.009003| newSViv|5.003007|5.003007| newSVnv|5.006000|5.003007| newSVOP|5.003007|5.003007| newSVpadname|5.017004|5.017004|x newSVpv|5.003007|5.003007| newSVpvf|5.006000|5.004000|v newSVpvf_nocontext|5.006000||vVn newSVpvn|5.004005|5.003007|p newSVpvn_flags|5.010001|5.003007|p newSVpvn_share|5.007001|5.003007|p newSVpvn_utf8|5.010001|5.003007|p newSVpvs|5.009003|5.003007|p newSVpvs_flags|5.010001|5.003007|p newSVpv_share|5.013006|5.013006| newSVpvs_share|5.009003|5.003007|p newSVREF|5.003007|5.003007|u newSVrv|5.003007|5.003007| newSVsv|5.003007|5.003007| newSVsv_flags|5.029009|5.003007|p newSVsv_nomg|5.029009|5.003007|p newSV_type|5.009005|5.003007|p newSVuv|5.006000|5.003007|p newTRYCATCHOP|5.033007|5.033007|x newUNOP|5.003007|5.003007| newUNOP_AUX|5.021007|5.021007| new_version|5.009000|5.009000| NEW_VERSION|5.019008||Viu new_warnings_bitfield|||xciu newWHENOP|5.027008|5.027008| newWHILEOP|5.013007|5.013007| Newx|5.009003|5.003007|p Newxc|5.009003|5.003007|p newXS|5.006000|5.006000| newXS_deffile|5.021006||cViu newXS_flags|5.009004|5.009004|xu newXS_len_flags|5.015006||Vi newXSproto|5.006000|5.006000| Newxz|5.009003|5.003007|p Newz|5.003007||Viu nextargv|5.003007||Viu nextchar|5.005000||Viu NEXT_LINE_CHAR|5.007003||Viu NEXT_OFF|5.005000||Viu NEXTOPER|5.003007||Viu next_symbol|5.007003||Viu ninstr|5.003007|5.003007|n NL_LANGINFO_LOCK|5.033005||Viu NL_LANGINFO_UNLOCK|5.033005||Viu no_bareword_allowed|5.005004||Viu no_bareword_filehandle|5.033006||Viu NOCAPTURE_PAT_MOD|5.021008||Viu NOCAPTURE_PAT_MODS|5.021008||Viu NODE_ALIGN|5.005000||Viu NODE_ALIGN_FILL|5.005000||Viu NODE_STEP_REGNODE|5.005000||Viu NODE_SZ_STR|5.006000||Viu NO_ENV_ARRAY_IN_MAIN|5.009004||Viu NOEXPR|5.027010||Viu NofAMmeth|5.003007||Viu no_fh_allowed|5.003007||Viu NOLINE|5.003007||Viu NO_LOCALE|5.007000||Viu NO_LOCALECONV_MON_THOUSANDS_SEP|5.005000||Viu NONDESTRUCT_PAT_MOD|5.013002||Viu NONDESTRUCT_PAT_MODS|5.013002||Viu NON_OTHER_COUNT|5.033005||Viu no_op|5.003007||Viu NOOP|5.005000|5.003007|p noperl_die|5.021006||vVniu NORETURN_FUNCTION_END|5.009003||Viu NORMAL|5.003007||Viu NOSTR|5.027010||Viu NO_TAINT_SUPPORT|5.017006||Viu not_a_number|5.005000||Viu NOTE3|5.027001||Viu NOTHING|5.003007||Viu NOTHING_t8_p8|5.033003||Viu NOTHING_t8_pb|5.033003||Viu NOTHING_tb_p8|5.033003||Viu NOTHING_tb_pb|5.033003||Viu nothreadhook|5.008000|5.008000| notify_parser_that_changed_to_utf8|5.025010||Viu not_incrementable|5.021002||Viu NOT_IN_PAD|5.005000||Viu NOT_REACHED|5.019006|5.003007|poVnu NPOSIXA|5.017003||Viu NPOSIXA_t8_p8|5.033003||Viu NPOSIXA_t8_pb|5.033003||Viu NPOSIXA_tb_p8|5.033003||Viu NPOSIXA_tb_pb|5.033003||Viu NPOSIXD|5.017003||Viu NPOSIXD_t8_p8|5.033003||Viu NPOSIXD_t8_pb|5.033003||Viu NPOSIXD_tb_p8|5.033003||Viu NPOSIXD_tb_pb|5.033003||Viu NPOSIXL|5.017003||Viu NPOSIXL_t8_p8|5.033003||Viu NPOSIXL_t8_pb|5.033003||Viu NPOSIXL_tb_p8|5.033003||Viu NPOSIXL_tb_pb|5.033003||Viu NPOSIXU|5.017003||Viu NPOSIXU_t8_p8|5.033003||Viu NPOSIXU_t8_pb|5.033003||Viu NPOSIXU_tb_p8|5.033003||Viu NPOSIXU_tb_pb|5.033003||Viu NSIG|5.009003||Viu ntohi|5.003007||Viu ntohl|5.003007||Viu ntohs|5.003007||Viu nuke_stacks|5.005000||Viu Null|5.003007||Viu Nullav|5.003007|5.003007|d Nullch|5.003007|5.003007| Nullcv|5.003007|5.003007|d Nullfp|5.003007||Viu Nullgv|5.003007||Viu Nullhe|5.003007||Viu Nullhek|5.004000||Viu Nullhv|5.003007|5.003007|d Nullop|5.003007||Viu Nullsv|5.003007|5.003007| NUM2PTR|5.006000||pVu NUM_ANYOF_CODE_POINTS|5.021004||Viu NUM_CLASSES|5.029001||Viu num_overflow|5.009001||Vniu NV_BIG_ENDIAN|5.021009||Viu NV_DIG|5.006000||Viu NVef|5.006001|5.003007|poVn NV_EPSILON|5.007003||Viu NVff|5.006001|5.003007|poVn NVgf|5.006001|5.003007|poVn NV_IMPLICIT_BIT|5.021009||Viu NV_INF|5.007003||Viu NV_LITTLE_ENDIAN|5.021009||Viu NVMANTBITS|5.023000|5.023000|Vn NV_MANT_DIG|5.006001||Viu NV_MAX_10_EXP|5.007003||Viu NV_MAX|5.006001||Viu NV_MAX_EXP|5.021003||Viu NV_MIN_10_EXP|5.007003||Viu NV_MIN|5.006001||Viu NV_MIN_EXP|5.021003||Viu NV_MIX_ENDIAN|5.021009||Viu NV_NAN|5.007003||Viu NV_NAN_BITS|5.023000||Viu NV_NAN_IS_QUIET|5.023000||Viu NV_NAN_IS_SIGNALING|5.023000||Viu NV_NAN_PAYLOAD_MASK|5.023000||Viu NV_NAN_PAYLOAD_MASK_IEEE_754_128_BE|5.023000||Viu NV_NAN_PAYLOAD_MASK_IEEE_754_128_LE|5.023000||Viu NV_NAN_PAYLOAD_MASK_IEEE_754_64_BE|5.023000||Viu NV_NAN_PAYLOAD_MASK_IEEE_754_64_LE|5.023000||Viu NV_NAN_PAYLOAD_MASK_SKIP_EIGHT|5.023006||Viu NV_NAN_PAYLOAD_PERM_0_TO_7|5.023000||Viu NV_NAN_PAYLOAD_PERM|5.023000||Viu NV_NAN_PAYLOAD_PERM_7_TO_0|5.023000||Viu NV_NAN_PAYLOAD_PERM_IEEE_754_128_BE|5.023000||Viu NV_NAN_PAYLOAD_PERM_IEEE_754_128_LE|5.023000||Viu NV_NAN_PAYLOAD_PERM_IEEE_754_64_BE|5.023000||Viu NV_NAN_PAYLOAD_PERM_IEEE_754_64_LE|5.023000||Viu NV_NAN_PAYLOAD_PERM_SKIP_EIGHT|5.023006||Viu NV_NAN_QS_BIT|5.023000||Viu NV_NAN_QS_BIT_OFFSET|5.023000||Viu NV_NAN_QS_BIT_SHIFT|5.023000||Viu NV_NAN_QS_BYTE|5.023000||Viu NV_NAN_QS_BYTE_OFFSET|5.023000||Viu NV_NAN_QS_QUIET|5.023000||Viu NV_NAN_QS_SIGNALING|5.023000||Viu NV_NAN_QS_TEST|5.023000||Viu NV_NAN_QS_XOR|5.023000||Viu NV_NAN_SET_QUIET|5.023000||Viu NV_NAN_SET_SIGNALING|5.023000||Viu NV_OVERFLOWS_INTEGERS_AT|5.010001|5.010001|Vn NV_PRESERVES_UV_BITS|5.006001|5.006001|Vn NVSIZE|5.006001|5.006001|Vn NVTYPE|5.006000|5.003007|poVn NV_VAX_ENDIAN|5.025003||Viu NV_WITHIN_IV|5.006000||Viu NV_WITHIN_UV|5.006000||Viu NV_X86_80_BIT|5.025004||Viu NV_ZERO_IS_ALLBITS_ZERO|5.035001|5.035001|Vn OA_AVREF|5.003007||Viu OA_BASEOP|5.005000||Viu OA_BASEOP_OR_UNOP|5.005000||Viu OA_BINOP|5.005000||Viu OA_CLASS_MASK|5.005000||Viu OA_COP|5.005000||Viu OA_CVREF|5.003007||Viu OA_DANGEROUS|5.003007||Viu OA_DEFGV|5.003007||Viu OA_FILEREF|5.003007||Viu OA_FILESTATOP|5.005000||Viu OA_FOLDCONST|5.003007||Viu OA_HVREF|5.003007||Viu OA_LIST|5.003007||Viu OA_LISTOP|5.005000||Viu OA_LOGOP|5.005000||Viu OA_LOOP|5.005000||Viu OA_LOOPEXOP|5.005000||Viu OA_MARK|5.003007||Viu OA_METHOP|5.021005||Viu OA_OPTIONAL|5.003007||Viu OA_OTHERINT|5.003007||Viu OA_PADOP|5.006000||Viu OA_PMOP|5.005000||Viu OA_PVOP_OR_SVOP|5.006000||Viu OA_RETSCALAR|5.003007||Viu OA_SCALAR|5.003007||Viu OA_SCALARREF|5.003007||Viu OASHIFT|5.003007||Viu OA_SVOP|5.005000||Viu OA_TARGET|5.003007||Viu OA_TARGLEX|5.006000||Viu OA_UNOP|5.005000||Viu OA_UNOP_AUX|5.021007||Viu O_BINARY|5.006000||Viu O_CREAT|5.006000||Viu OCSHIFT|5.006000||Viu OCTAL_VALUE|5.019008||Viu Off_t|5.003007|5.003007|Vn Off_t_size|5.006000|5.006000|Vn OFFUNI_IS_INVARIANT|5.023003||Viu OFFUNISKIP|5.019004||Viu ONCE_PAT_MOD|5.009005||Viu ONCE_PAT_MODS|5.009005||Viu oopsAV|5.003007||Viu oopsHV|5.003007||Viu OP|5.003007||Viu op_append_elem|5.013006|5.013006| op_append_list|5.013006|5.013006| opASSIGN|5.003007||Viu OP_BINARY|5.004000||Viu OP_CHECK_MUTEX_INIT|5.015008||Viu OP_CHECK_MUTEX_LOCK|5.015008||Viu OP_CHECK_MUTEX_TERM|5.015008||Viu OP_CHECK_MUTEX_UNLOCK|5.015008||Viu OP_CLASS|5.013007|5.013007| op_class|5.025010|5.025010| op_clear|5.006000||cViu OPCODE|5.003007||Viu op_contextualize|5.013006|5.013006| op_convert_list|5.021006|5.021006| OP_DESC|5.007003|5.007003| op_dump|5.006000|5.006000| OPEN|5.003007||Viu open|5.005000||Viu opendir|5.005000||Viu openn_cleanup|5.019010||Viu openn_setup|5.019010||Viu open_script|5.005000||Viu OPEN_t8_p8|5.033003||Viu OPEN_t8_pb|5.033003||Viu OPEN_tb_p8|5.033003||Viu OPEN_tb_pb|5.033003||Viu OPERAND|5.003007||Viu OPERANDl|5.031005||Viu OPERANDs|5.031005||Viu OPFAIL|5.009005||Viu OPFAIL_t8_p8|5.033003||Viu OPFAIL_t8_pb|5.033003||Viu OPFAIL_tb_p8|5.033003||Viu OPFAIL_tb_pb|5.033003||Viu OPf_FOLDED|5.021007||Viu OPf_KIDS|5.003007|5.003007| OPf_KNOW|5.003007||Viu OPf_LIST|5.003007||Viu OPf_MOD|5.003007||Viu OPf_PARENS|5.003007||Viu op_free|5.003007|5.003007| OP_FREED|5.017002||Viu OPf_REF|5.003007||Viu OPf_SPECIAL|5.003007||Viu OPf_STACKED|5.003007||Viu OPf_WANT|5.004000||Viu OPf_WANT_LIST|5.004000||Viu OPf_WANT_SCALAR|5.004000||Viu OPf_WANT_VOID|5.004000||Viu OP_GIMME|5.004000||Viu OP_GIMME_REVERSE|5.010001||Viu OpHAS_SIBLING|5.021007|5.003007|p op_integerize|5.015003||Viu OP_IS_DIRHOP|5.015003||Viu OP_IS_FILETEST|5.006001||Viu OP_IS_FILETEST_ACCESS|5.008001||Viu OP_IS_INFIX_BIT|5.021009||Viu OP_IS_NUMCOMPARE|5.015003||Viu OP_IS_SOCKET|5.006001||Viu OP_IS_STAT|5.031001||Viu OpLASTSIB_set|5.021011|5.003007|p op_linklist|5.013006|5.013006| op_lvalue|5.013007|5.013007|x op_lvalue_flags|||ciu OP_LVALUE_NO_CROAK|5.015001||Viu OpMAYBESIB_set|5.021011|5.003007|p opmethod_stash|5.021007||Viu OpMORESIB_set|5.021011|5.003007|p OP_NAME|5.007003|5.007003| op_null|5.007002|5.007002| OPpALLOW_FAKE|5.015006||Viu op_parent|5.025001|5.025001|n OPpARG1_MASK|5.021004||Viu OPpARG2_MASK|5.021004||Viu OPpARG3_MASK|5.021004||Viu OPpARG4_MASK|5.021004||Viu OPpARGELEM_AV|5.025004||Viu OPpARGELEM_HV|5.025004||Viu OPpARGELEM_MASK|5.025004||Viu OPpARGELEM_SV|5.025004||Viu OPpASSIGN_BACKWARDS|5.003007||Viu OPpASSIGN_COMMON_AGG|5.023002||Viu OPpASSIGN_COMMON_RC1|5.023002||Viu OPpASSIGN_COMMON_SCALAR|5.023002||Viu OPpASSIGN_CV_TO_GV|5.009003||Viu OPpASSIGN_TRUEBOOL|5.027003||Viu OPpAVHVSWITCH_MASK|5.025006||Viu OPpCONCAT_NESTED|5.027007||Viu OPpCONST_BARE|5.003007||Viu OPpCONST_ENTERED|5.003007||Viu OPpCONST_NOVER|5.009003||Viu OPpCONST_SHORTCIRCUIT|5.009001||Viu OPpCONST_STRICT|5.005004||Viu OPpCOREARGS_DEREF1|5.015003||Viu OPpCOREARGS_DEREF2|5.015003||Viu OPpCOREARGS_PUSHMARK|5.015003||Viu OPpCOREARGS_SCALARMOD|5.015003||Viu OPpDEREF|5.004000||Viu OPpDEREF_AV|5.003007||Viu OPpDEREF_HV|5.003007||Viu OPpDEREF_SV|5.004000||Viu OPpDONT_INIT_GV|5.009003||Viu OPpEARLY_CV|5.006000|5.006000| OPpENTERSUB_AMPER|5.003007|5.003007| OPpENTERSUB_DB|5.003007||Viu OPpENTERSUB_HASTARG|5.006000||Viu OPpENTERSUB_INARGS|5.006000||Viu OPpENTERSUB_LVAL_MASK|5.015001||Viu OPpENTERSUB_NOPAREN|5.005004||Viu OPpEVAL_BYTES|5.015005||Viu OPpEVAL_COPHH|5.015005||Viu OPpEVAL_HAS_HH|5.009003||Viu OPpEVAL_RE_REPARSING|5.017011||Viu OPpEVAL_UNICODE|5.015005||Viu OPpEXISTS_SUB|5.006000||Viu OPpFLIP_LINENUM|5.003007||Viu OPpFT_ACCESS|5.008001||Viu OPpFT_AFTER_t|5.015008||Viu OPpFT_STACKED|5.009001||Viu OPpFT_STACKING|5.015001||Viu OPpHINT_STRICT_REFS|5.021004||Viu OPpHUSH_VMSISH|5.007003||Viu OPpINDEX_BOOLNEG|5.027003||Viu OPpITER_DEF|5.027008||Viu OPpITER_REVERSED|5.009002||Viu OPpKVSLICE|5.027001||Viu OPpLIST_GUESSED|5.003007||Viu OPpLVAL_DEFER|5.004000||Viu OPpLVAL_INTRO|5.003007||Viu OPpLVALUE|5.019006||Viu OPpLVREF_AV|5.021005||Viu OPpLVREF_CV|5.021005||Viu OPpLVREF_ELEM|5.021005||Viu OPpLVREF_HV|5.021005||Viu OPpLVREF_ITER|5.021005||Viu OPpLVREF_SV|5.021005||Viu OPpLVREF_TYPE|5.021005||Viu OPpMAYBE_LVSUB|5.007001||Viu OPpMAYBE_TRUEBOOL|5.017004||Viu OPpMAY_RETURN_CONSTANT|5.009003||Viu OPpMULTICONCAT_APPEND|5.027006||Viu OPpMULTICONCAT_FAKE|5.027006||Viu OPpMULTICONCAT_STRINGIFY|5.027006||Viu OPpMULTIDEREF_DELETE|5.021007||Viu OPpMULTIDEREF_EXISTS|5.021007||Viu OPpOFFBYONE|5.015002||Viu OPpOPEN_IN_CRLF|5.006000||Viu OPpOPEN_IN_RAW|5.006000||Viu OPpOPEN_OUT_CRLF|5.006000||Viu OPpOPEN_OUT_RAW|5.006000||Viu OPpOUR_INTRO|5.006000||Viu OPpPADHV_ISKEYS|5.027003||Viu OPpPADRANGE_COUNTMASK|5.017006||Viu OPpPADRANGE_COUNTSHIFT|5.017006||Viu OPpPAD_STATE|5.009004||Viu OPpPV_IS_UTF8|5.016000||Viu OPpREFCOUNTED|5.006000||Viu OPpREPEAT_DOLIST|5.003007||Viu op_prepend_elem|5.013006|5.013006| OPpREVERSE_INPLACE|5.011002||Viu OPpRV2HV_ISKEYS|5.027003||Viu OPpSLICE|5.004000||Viu OPpSLICEWARNING|5.019004||Viu OPpSORT_DESCEND|5.009002||Viu OPpSORT_INPLACE|5.009001||Viu OPpSORT_INTEGER|5.006000||Viu OPpSORT_NUMERIC|5.006000||Viu OPpSORT_REVERSE|5.006000||Viu OPpSORT_STABLE|5.009003||Viu OPpSORT_UNSTABLE|5.027004||Viu OPpSPLIT_ASSIGN|5.025006||Viu OPpSPLIT_IMPLIM|5.019002||Viu OPpSPLIT_LEX|5.025006||Viu OPpSUBSTR_REPL_FIRST|5.015006||Viu OPpTARGET_MY|5.006000||Viu OPpTRANS_ALL|5.009001||Viu OPpTRANS_CAN_FORCE_UTF8|5.031006||Viu OPpTRANS_COMPLEMENT|5.003007||Viu OPpTRANS_DELETE|5.003007||Viu OPpTRANS_FROM_UTF|5.006000||Viu OPpTRANS_GROWS|5.006000||Viu OPpTRANS_IDENTICAL|5.006000||Viu OPpTRANS_SQUASH|5.003007||Viu OPpTRANS_TO_UTF|5.006000||Viu OPpTRANS_USE_SVOP|5.031006||Viu OPpTRUEBOOL|5.017004||Viu OpREFCNT_dec|5.006000||Viu op_refcnt_dec|||xiu OpREFCNT_inc|5.006000||Viu op_refcnt_inc|||xiu OP_REFCNT_INIT|5.006000||Viu OP_REFCNT_LOCK|5.006000||Viu op_refcnt_lock|5.009002|5.009002|u OpREFCNT_set|5.006000||Viu OP_REFCNT_TERM|5.006000||Viu OP_REFCNT_UNLOCK|5.006000||Viu op_refcnt_unlock|5.009002|5.009002|u op_relocate_sv|5.021005||Viu op_scope|5.013007|5.013007|x OP_SIBLING|5.021002||Viu OpSIBLING|5.021007|5.003007|p op_sibling_splice|5.021002|5.021002|n OpSLAB|5.017002||Viu opslab_force_free|5.017002||Viu opslab_free|5.017002||Viu opslab_free_nopad|5.017002||Viu OpslabREFCNT_dec|5.017002||Viu OpslabREFCNT_dec_padok|5.017002||Viu OpSLOT|5.017002||Viu OPSLOT_HEADER|5.017002||Viu OpSLOToff|5.033001||Viu op_std_init|5.015003||Viu OPTIMIZED|5.005000||Viu OPTIMIZED_t8_p8|5.033003||Viu OPTIMIZED_t8_pb|5.033003||Viu OPTIMIZED_tb_p8|5.033003||Viu OPTIMIZED_tb_pb|5.033003||Viu optimize_op|5.027006||Viu optimize_optree|5.027006||Vi optimize_regclass|5.035001||Viu OP_TYPE_IS|5.019007|5.019007| OP_TYPE_IS_NN|5.019010||Viu OP_TYPE_ISNT|5.019010||Viu OP_TYPE_ISNT_AND_WASNT|5.019010||Viu OP_TYPE_ISNT_AND_WASNT_NN|5.019010||Viu OP_TYPE_ISNT_NN|5.019010||Viu OP_TYPE_IS_OR_WAS|5.019010|5.019010| OP_TYPE_IS_OR_WAS_NN|5.019010||Viu op_unscope|5.017003||xViu O_RDONLY|5.006000||Viu O_RDWR|5.006000||Viu ORIGMARK|5.003007|5.003007| OSNAME|5.003007|5.003007|Vn OSVERS|5.007002|5.007002|Vn O_TEXT|5.006000||Viu OutCopFILE|5.007003||Viu output_non_portable|5.031008||Viu output_posix_warnings|5.029005||Viu O_VMS_DELETEONCLOSE|5.031002||Viu O_WRONLY|5.006000||Viu package|5.003007||Viu package_version|5.011001||Viu pack_cat|5.007003|5.007003|d packlist|5.008001|5.008001| pack_rec|5.008001||Viu packWARN2|5.007003|5.003007|p packWARN3|5.007003|5.003007|p packWARN4|5.007003|5.003007|p packWARN|5.007003|5.003007|p pad_add_anon|5.008001|5.008001| pad_add_name_pv|5.015001|5.015001| pad_add_name_pvn|5.015001|5.015001| pad_add_name_pvs|5.015001|5.015001| pad_add_name_sv|5.015001|5.015001| padadd_NO_DUP_CHECK|5.011002||Viu padadd_OUR|5.011002||Viu padadd_STALEOK|5.017003||Viu padadd_STATE|5.011002||Viu pad_add_weakref|5.021007||Viu pad_alloc|5.003007|5.003007|x pad_alloc_name|5.015001||Vi PadARRAY|5.017004|5.017004|x PAD_BASE_SV|5.008001||Vi pad_block_start|5.008001||Vi pad_check_dup|5.008001||Vi PAD_CLONE_VARS|5.008001||Vi PAD_COMPNAME|5.017004||Viu PAD_COMPNAME_FLAGS|5.008001||Vi PAD_COMPNAME_FLAGS_isOUR|5.009004||Viu PAD_COMPNAME_GEN|5.008001||Vi PAD_COMPNAME_GEN_set|5.009003||Vi PAD_COMPNAME_OURSTASH|5.008001||Vi PAD_COMPNAME_PV|5.008001||Vi PAD_COMPNAME_SV|5.009005||Viu PAD_COMPNAME_TYPE|5.008001||Vi pad_compname_type|5.009003|5.009003|d PAD_FAKELEX_ANON|5.009005||Viu PAD_FAKELEX_MULTI|5.009005||Viu pad_findlex|5.005000||Vi pad_findmy_pv|5.015001|5.015001| pad_findmy_pvn|5.015001|5.015001| pad_findmy_pvs|5.015001|5.015001| pad_findmy_sv|5.015001|5.015001| pad_fixup_inner_anons|5.008001||Vi pad_free|5.003007||Vi pad_leavemy|5.003007||Vi PadlistARRAY|5.017004|5.017004|x padlist_dup|5.013002||Vi PadlistMAX|5.017004|5.017004|x PadlistNAMES|5.017004|5.017004|x PadlistNAMESARRAY|5.017004|5.017004|x PadlistNAMESMAX|5.017004|5.017004|x PadlistREFCNT|5.017004|5.017004|x padlist_store|5.017004||Viu PadMAX|5.017004|5.017004|x padname_dup|5.021007||Vi PadnameFLAGS|5.021007||Viu padname_free|||ciu PADNAME_FROM_PV|5.021007||Viu PadnameIN_SCOPE|5.031004||Vniu PadnameIsOUR|5.017004||Vi PadnameIsSTATE|5.017004||Vi PadnameIsSTATE_on|5.021007||Viu PadnameLEN|5.017004|5.017004|x PadnamelistARRAY|5.017004|5.017004|x padnamelist_dup|5.021007||Vi padnamelist_fetch|5.021007|5.021007|xn padnamelist_free|||ciu PadnamelistMAX|5.017004|5.017004|x PadnamelistMAXNAMED|5.019003||Viu PadnamelistREFCNT|5.021007|5.021007|x PadnamelistREFCNT_dec|5.021007|5.021007|x padnamelist_store|5.021007|5.021007|x PadnameLVALUE|5.021006||Viu PadnameLVALUE_on|5.021006||Viu PadnameOURSTASH|5.017004||Vi PadnameOURSTASH_set|5.021007||Viu PadnameOUTER|5.017004||Vi PadnamePROTOCV|5.021007||Viu PadnamePV|5.017004|5.017004|x PadnameREFCNT|5.021007|5.021007|x PadnameREFCNT_dec|5.021007|5.021007|x PadnameSV|5.017004|5.017004|x PADNAMEt_LVALUE|5.021007||Viu PADNAMEt_OUR|5.021007||Viu PADNAMEt_OUTER|5.021007|5.021007| PADNAMEt_STATE|5.021007||Viu PADNAMEt_TYPED|5.021007||Viu PadnameTYPE|5.017004||Vi PadnameTYPE_set|5.021007||Viu PadnameUTF8|5.017004|5.017004|x pad_new|5.008001|5.008001| padnew_CLONE|5.008001||Viu padnew_SAVE|5.008001||Viu padnew_SAVESUB|5.008001||Viu pad_peg|5.009004||Viu pad_push|5.008001||cVi pad_reset|5.003007||Vi PAD_RESTORE_LOCAL|5.008001||Vi PAD_SAVE_LOCAL|5.008001||Vi PAD_SAVE_SETNULLPAD|5.008001||Vi PAD_SET_CUR|5.008001||Vi PAD_SET_CUR_NOSAVE|5.008002||Vi pad_setsv|5.008001||cV PAD_SETSV|5.008001||Vi pad_sv|5.003007||cV PAD_SV|5.003007||Vi PAD_SVl|5.008001||Vi pad_swipe|5.003007||Vi pad_tidy|5.008001|5.008001|x panic_write2|5.008001||Viu PARENT_FAKELEX_FLAGS|5.009005||Viu PARENT_PAD_INDEX|5.009005||Viu parse_arithexpr|5.013008|5.013008|x parse_barestmt|5.013007|5.013007|x parse_block|5.013007|5.013007|x parse_body|5.006000||Viu parse_fullexpr|5.013008|5.013008|x parse_fullstmt|5.013005|5.013005|x parse_gv_stash_name|5.019004||Viu parse_ident|5.017010||Viu parse_label|5.013007|5.013007|x parse_listexpr|5.013008|5.013008|x parse_lparen_question_flags|5.017009||Viu PARSE_OPTIONAL|5.013007|5.013007| parser_dup|5.009000|5.009000|u parser_free|5.009005||Viu parser_free_nexttoke_ops|5.017006||Viu parse_stmtseq|5.013006|5.013006|x parse_subsignature|5.031003|5.031003|x parse_termexpr|5.013008|5.013008|x parse_unicode_opts|5.008001||Viu parse_uniprop_string|5.027011||Viu PATCHLEVEL|5.003007||Viu path_is_searchable|5.019001||Vniu Pause|5.003007||Viu pause|5.005000||Viu pclose|5.003007||Viu peep|5.003007||Viu pending_ident|5.017004||Viu PERL_ABS|5.008001|5.003007|p Perl_acos|5.021004|5.021004|n perl_alloc|5.003007|5.003007|n PERL_ALLOC_CHECK|5.006000||Viu perl_alloc_using|5.006000||Vnu PERL_ANY_COW|5.017007||Viu PERL_API_REVISION|5.006000||Viu PERL_API_SUBVERSION|5.006000||Viu PERL_API_VERSION|5.006000||Viu PERL_API_VERSION_STRING|5.013004||Viu PERL_ARENA_ROOTS_SIZE|5.009004||Viu PERL_ARENA_SIZE|5.009003||Viu PERL_ARGS_ASSERT_CROAK_XS_USAGE|||ponu Perl_asin|5.021004|5.021004|n Perl_assert|5.011000||Viu perl_assert_ptr|5.027004||Viu PERL_ASYNC_CHECK|5.006000|5.006000| Perl_atan2|5.006000|5.006000|n Perl_atan|5.021004|5.021004|n Perl_atof2|5.006001||Viu Perl_atof|5.006000||Viu PERL_BCDVERSION||5.003007|onu PERL_BISON_VERSION|5.023008||Viu PERL_BITFIELD16|5.010001||Viu PERL_BITFIELD32|5.010001||Viu PERL_BITFIELD8|5.010001||Viu PERL_CALLCONV|5.005002||Viu PERL_CALLCONV_NO_RET|5.017002||Viu Perl_calloc|5.006000||Viu Perl_ceil|5.009001|5.009001|n PERL_CKDEF|5.006000||Viu perl_clone|5.006000||Vn perl_clone_using|5.006000||Vnu perl_construct|5.003007|5.003007|n PERL_COP_SEQMAX|5.013010||Viu PERL_COPY_ON_WRITE|5.023001||Viu Perl_cos|5.006000|5.006000|n Perl_cosh|5.021004|5.021004|n PERL_COUNT_MULTIPLIER|5.027007||Viu Perl_custom_op_xop|5.019006||V PERLDB_ALL|5.004002||Viu PERLDBf_GOTO|5.004005||Viu PERLDBf_INTER|5.004002||Viu PERLDBf_LINE|5.004002||Viu PERLDBf_NAMEANON|5.006000||Viu PERLDBf_NAMEEVAL|5.006000||Viu PERLDBf_NONAME|5.004005||Viu PERLDBf_NOOPT|5.004002||Viu PERLDBf_SAVESRC|5.010001||Viu PERLDBf_SAVESRC_INVALID|5.010001||Viu PERLDBf_SAVESRC_NOSUBS|5.010001||Viu PERLDBf_SINGLE|5.004002||Viu PERLDBf_SUB|5.004002||Viu PERLDBf_SUBLINE|5.004002||Viu PERLDB_GOTO|5.004005||Viu PERLDB_INTER|5.004002||Viu PERLDB_LINE|5.004002||Viu PERLDB_LINE_OR_SAVESRC|5.023002||Viu PERLDB_NAMEANON|5.006000||Viu PERLDB_NAMEEVAL|5.006000||Viu PERLDB_NOOPT|5.004002||Viu PERLDB_SAVESRC|5.010001||Viu PERLDB_SAVESRC_INVALID|5.010001||Viu PERLDB_SAVESRC_NOSUBS|5.010001||Viu PERLDB_SINGLE|5.004002||Viu PERLDB_SUB|5.004002||Viu PERLDB_SUBLINE|5.004002||Viu PERLDB_SUB_NN|5.004005||Viu PERL_DEB2|5.021007||Viu PERL_DEB|5.008001||Viu PERL_DEBUG|5.008001||Viu Perl_debug_log|5.003007||Viu PERL_DEBUG_PAD|5.007003||Viu PERL_DEBUG_PAD_ZERO|5.007003||Viu PERL_DECIMAL_VERSION|5.019008||Viu PERL_DEFAULT_DO_EXEC3_IMPLEMENTATION|5.009003||Viu perl_destruct|5.007003|5.007003|n PerlDir_chdir|5.005000||Viu PerlDir_close|5.005000||Viu PerlDir_mapA|5.006000||Viu PerlDir_mapW|5.006000||Viu PerlDir_mkdir|5.005000||Viu PerlDir_open|5.005000||Viu PerlDir_read|5.005000||Viu PerlDir_rewind|5.005000||Viu PerlDir_rmdir|5.005000||Viu PerlDir_seek|5.005000||Viu PerlDir_tell|5.005000||Viu PERL_DONT_CREATE_GVSV|5.009003||Viu Perl_drand48|5.019004||Viu Perl_drand48_init|5.019004||Viu PERL_DRAND48_QUAD|5.019004||Viu PERL_DTRACE_PROBE_ENTRY|5.023009||Viu PERL_DTRACE_PROBE_FILE_LOADED|5.023009||Viu PERL_DTRACE_PROBE_FILE_LOADING|5.023009||Viu PERL_DTRACE_PROBE_OP|5.023009||Viu PERL_DTRACE_PROBE_PHASE|5.023009||Viu PERL_DTRACE_PROBE_RETURN|5.023009||Viu PERL_EBCDIC_TABLES_H|5.027001||Viu PERL_ENABLE_EXPERIMENTAL_REGEX_OPTIMISATIONS|5.009004||Viu PERL_ENABLE_EXTENDED_TRIE_OPTIMISATION|5.009004||Viu PERL_ENABLE_POSITIVE_ASSERTION_STUDY|5.009005||Viu PERL_ENABLE_TRIE_OPTIMISATION|5.009004||Viu PerlEnv_clearenv|5.006000||Viu PerlEnv_ENVgetenv|5.006000||Viu PerlEnv_ENVgetenv_len|5.006000||Viu PerlEnv_free_childdir|5.006000||Viu PerlEnv_free_childenv|5.006000||Viu PerlEnv_get_childdir|5.006000||Viu PerlEnv_get_childenv|5.006000||Viu PerlEnv_get_child_IO|5.006000||Viu PerlEnv_getenv|5.005000||Viu PerlEnv_getenv_len|5.006000||Viu PerlEnv_lib_path|5.005000||Viu PerlEnv_os_id|5.006000||Viu PerlEnv_putenv|5.005000||Viu PerlEnv_sitelib_path|5.005000||Viu PerlEnv_uname|5.005004||Viu PerlEnv_vendorlib_path|5.006000||Viu Perl_error_log|5.006000||Viu Perl_eval_pv||5.003007|onu Perl_eval_sv||5.003007|onu PERL_EXIT_ABORT|5.019003|5.019003| PERL_EXIT_DESTRUCT_END|5.007003|5.007003| PERL_EXIT_EXPECTED|5.006000|5.006000| PERL_EXIT_WARN|5.019003|5.019003| Perl_exp|5.006000|5.006000|n PERL_FEATURE_H|5.029006||Viu PERL_FILE_IS_ABSOLUTE|5.006000||Viu PERL_FILTER_EXISTS|5.009005||Viu Perl_floor|5.006000|5.006000|n PERL_FLUSHALL_FOR_CHILD|5.006000||Viu Perl_fmod|5.006000|5.006000|n Perl_fp_class|5.007003||Viu Perl_fp_class_denorm|5.007003||Viu Perl_fp_class_inf|5.007003||Viu Perl_fp_class_nan|5.007003||Viu Perl_fp_class_ndenorm|5.007003||Viu Perl_fp_class_ninf|5.007003||Viu Perl_fp_class_nnorm|5.007003||Viu Perl_fp_class_norm|5.007003||Viu Perl_fp_class_nzero|5.007003||Viu Perl_fp_class_pdenorm|5.007003||Viu Perl_fp_class_pinf|5.007003||Viu Perl_fp_class_pnorm|5.007003||Viu Perl_fp_class_pzero|5.007003||Viu Perl_fp_class_qnan|5.007003||Viu Perl_fp_class_snan|5.007003||Viu Perl_fp_class_zero|5.007003||Viu PERL_FPU_INIT|5.007002||Viu PERL_FPU_POST_EXEC|5.008001||Viu PERL_FPU_PRE_EXEC|5.008001||Viu perl_free|5.003007|5.003007|n Perl_free_c_backtrace|5.021001||Viu Perl_frexp|5.006000|5.006000|n PERL_FS_VER_FMT|5.006000||Viu PERL_FS_VERSION|5.010001||Viu PERL_GCC_BRACE_GROUPS_FORBIDDEN|5.008001||Viu PERL_GET_CONTEXT|5.006000||Viu PERL_GET_INTERP|5.006000||Viu PERL_GET_THX|5.006000||Viu PERL_GIT_UNPUSHED_COMMITS|5.010001||Viu PERL_GPROF_MONCONTROL|5.007002||Viu PERL_HANDY_H|5.027001||Viu PERL_HASH|5.003007|5.003007|p PERL_HASH_DEFAULT_HvMAX|5.017011||Viu PERL_HASH_FUNC|5.017006||Viu PERL_HASH_FUNC_SIPHASH13|5.033007||Viu PERL_HASH_FUNC_ZAPHOD32|5.027001||Viu PERL_HASH_INTERNAL|5.008002||Viu PERL_HASH_ITER_BUCKET|5.018000||Viu PERL_HASH_RANDOMIZE_KEYS|5.018000||Viu PERL_HASH_SEED|5.008001||Viu PERL_HASH_SEED_BYTES|5.017006||Viu PERL_HASH_SEED_STATE|5.027001||Viu PERL_HASH_SEED_WORDS|5.033007||Viu PERL_HASH_STATE_BYTES|5.027001||Viu PERL_HASH_STATE_WORDS|5.033007||Viu PERL_HASH_USE_SBOX32_ALSO|5.027001||Viu PERL_HASH_WITH_SEED|5.021001||Viu PERL_HASH_WITH_STATE|5.027001||Viu PERL_HV_ALLOC_AUX_SIZE|5.019010||Viu PERL_HV_ARRAY_ALLOC_BYTES|5.006000||Viu PERL___I|5.009005||Viu PERL_IMPLICIT_CONTEXT|5.006000||Viu PERL_INC_VERSION_LIST|5.035001|5.035001|Vn Perl_internal_drand48|5.027004||Viu PERL_INTERPRETER_SIZE_UPTO_MEMBER|5.010000||Viu PERL_INT_MAX|5.003007|5.003007|p PERL_INT_MIN|5.003007|5.003007|p PERL_INVLIST_INLINE_H|5.029006||Viu PerlIO|5.003007||Viu PerlIO_apply_layers|5.007001|5.007001| PerlIOArg|5.007001||Viu PerlIOBase|5.007001||Viu PerlIO_binmode|5.007001|5.007001| PERLIOBUF_DEFAULT_BUFSIZ|5.013007||Viu PerlIO_canset_cnt|5.003007|5.003007|n PerlIO_clearerr|5.007003|5.007003| PerlIO_close|5.007003|5.007003| PerlIO_context_layers|5.009004|5.009004|u PerlIO_debug|5.007001|5.007001| PERLIO_DUP_CLONE|5.007003||Viu PERLIO_DUP_FD|5.007003||Viu PerlIO_eof|5.007003|5.007003| PerlIO_error|5.007003|5.007003| PerlIO_exportFILE|5.003007|5.003007|n PERLIO_F_APPEND|5.007001|5.007001| PerlIO_fast_gets|5.003007|5.003007|n PERLIO_F_CANREAD|5.007001|5.007001| PERLIO_F_CANWRITE|5.007001|5.007001| PERLIO_F_CLEARED|5.013008||Viu PERLIO_F_CRLF|5.007001|5.007001| PerlIO_fdopen|5.003007|5.003007|n PERLIO_F_EOF|5.007001|5.007001| PERLIO_F_ERROR|5.007001|5.007001| PERLIO_F_FASTGETS|5.007001|5.007001| PerlIO_fileno|5.007003|5.007003| PerlIO_fill|5.007003|5.007003|u PerlIO_findFILE|5.003007|5.003007|n PERLIO_F_LINEBUF|5.007001|5.007001| PerlIO_flush|5.007003|5.007003| PERLIO_F_NOTREG|5.008001||Viu PERLIO_F_OPEN|5.007001|5.007001| PERLIO_F_RDBUF|5.007001|5.007001| PERLIO_F_TEMP|5.007001|5.007001| PERLIO_F_TRUNCATE|5.007001|5.007001| PERLIO_F_TTY|5.007001||Viu PERLIO_F_UNBUF|5.007001|5.007001| PERLIO_FUNCS_CAST|5.009003||pVu PERLIO_FUNCS_DECL|5.009003|5.009003|pVu PERLIO_F_UTF8|5.007001|5.007001| PERLIO_F_WRBUF|5.007001|5.007001| PerlIO_get_base|5.007003|5.007003| PerlIO_get_bufsiz|5.007003|5.007003| PerlIO_getc|5.003007|5.003007|n PerlIO_get_cnt|5.007003|5.007003| PerlIO_getpos|5.003007|5.003007|n PerlIO_get_ptr|5.007003|5.007003| PERLIO_H|5.027001||Viu PerlIO_has_base|5.003007|5.003007|n PerlIO_has_cntptr|5.003007|5.003007|n PerlIO_importFILE|5.003007|5.003007|n PERLIO_INIT|5.009005||Viu PERLIO_K_BUFFERED|5.007001|5.007001| PERLIO_K_CANCRLF|5.007001|5.007001| PERLIO_K_DESTRUCT|5.007001||Viu PERLIO_K_DUMMY|5.007001||Viu PERLIO_K_FASTGETS|5.007001|5.007001| PERLIO_K_MULTIARG|5.007003|5.007003| PERLIO_K_RAW|5.007001|5.007001| PERLIO_K_UTF8|5.007001||Viu PERLIO_LAYERS|5.007001||Viu PERLIOL_H|5.027001||Viu PerlIONext|5.007001||Viu PERLIO_NOT_STDIO|5.003007||Viu PerlIO_open|5.003007|5.003007|n PerlIO_printf|5.006000|5.003007| PerlIO_putc|5.003007|5.003007|n PerlIO_puts|5.003007|5.003007|n PerlIO_read|5.007003|5.007003| PerlIO_releaseFILE|5.003007|5.003007|n PerlIO_reopen|5.003007|5.003007|n PerlIO_restore_errno|5.021006||cViu PerlIO_rewind|5.003007|5.003007|n PerlIO_save_errno|5.021006||cViu PerlIO_seek|5.007003|5.007003| PerlIOSelf|5.007001||Viu PerlIO_set_cnt|5.007003|5.007003| PerlIO_setlinebuf|5.007003|5.007003| PerlIO_setpos|5.003007|5.003007|n PerlIO_set_ptrcnt|5.007003|5.007003| PerlIO_stderr|5.007003|5.007003| PerlIO_stdin|5.007003|5.007003| PerlIO_stdout|5.007003|5.007003| PerlIO_stdoutf|5.006000|5.003007| PERLIO_STDTEXT|5.007001||Viu PerlIO_tell|5.007003|5.007003| PERLIO_TERM|5.009005||Viu PerlIO_ungetc|5.003007|5.003007|n PerlIO_unread|5.007003|5.007003|u PERLIO_USING_CRLF|5.007003||Viu PerlIOValid|5.007003||Viu PerlIO_vprintf|5.003007|5.003007|n PerlIO_write|5.007003|5.007003| Perl_isfinite|5.007003|5.007003|n Perl_isfinitel|5.021004||Viu PERL_IS_GCC|5.032001||Viu Perl_isinf|5.007003|5.007003|n Perl_isnan|5.006001|5.006001|n PERL_IS_SUBWORD_ADDR|5.027007||Viu PERL_JNP_TO_DECIMAL|5.033001||Viu Perl_langinfo|5.027004|5.027004|n PERL_LANGINFO_H|5.027004||Viu PERL_LAST_5_18_0_INTERP_MEMBER|5.017009||Viu Perl_ldexp|5.021003|5.021003|n PerlLIO_access|5.005000||Viu PerlLIO_chmod|5.005000||Viu PerlLIO_chown|5.005000||Viu PerlLIO_chsize|5.005000||Viu PerlLIO_close|5.005000||Viu PerlLIO_dup2|5.005000||Viu PerlLIO_dup2_cloexec|5.027008||Viu PerlLIO_dup|5.005000||Viu PerlLIO_dup_cloexec|5.027008||Viu PerlLIO_flock|5.005000||Viu PerlLIO_fstat|5.005000||Viu PerlLIO_ioctl|5.005000||Viu PerlLIO_isatty|5.005000||Viu PerlLIO_link|5.006000||Viu PerlLIO_lseek|5.005000||Viu PerlLIO_lstat|5.005000||Viu PerlLIO_mktemp|5.005000||Viu PerlLIO_open3|5.005000||Viu PerlLIO_open3_cloexec|5.027008||Viu PerlLIO_open|5.005000||Viu PerlLIO_open_cloexec|5.027008||Viu PerlLIO_read|5.005000||Viu PerlLIO_readlink|5.033005||Viu PerlLIO_rename|5.005000||Viu PerlLIO_setmode|5.005000||Viu PerlLIO_stat|5.005000||Viu PerlLIO_symlink|5.033005||Viu PerlLIO_tmpnam|5.005000||Viu PerlLIO_umask|5.005000||Viu PerlLIO_unlink|5.005000||Viu PerlLIO_utime|5.005000||Viu PerlLIO_write|5.005000||Viu PERL_LOADMOD_DENY|5.006000|5.003007| PERL_LOADMOD_IMPORT_OPS|5.006000|5.003007| PERL_LOADMOD_NOIMPORT|5.006000|5.003007| Perl_log10|5.021004|5.021004|n Perl_log|5.006000|5.006000|n PERL_LONG_MAX|5.003007|5.003007|p PERL_LONG_MIN|5.003007|5.003007|p PERL_MAGIC_arylen|5.007002|5.003007|p PERL_MAGIC_arylen_p|5.009003|5.009003| PERL_MAGIC_backref|5.007002|5.003007|p PERL_MAGIC_bm|5.007002|5.003007|p PERL_MAGIC_checkcall|5.013006|5.013006| PERL_MAGIC_collxfrm|5.007002|5.003007|p PERL_MAGIC_dbfile|5.007002|5.003007|p PERL_MAGIC_dbline|5.007002|5.003007|p PERL_MAGIC_debugvar|5.021005|5.021005| PERL_MAGIC_defelem|5.007002|5.003007|p PERL_MAGIC_env|5.007002|5.003007|p PERL_MAGIC_envelem|5.007002|5.003007|p PERL_MAGIC_ext|5.007002|5.003007|p PERL_MAGIC_fm|5.007002|5.003007|p PERL_MAGIC_glob||5.003007|ponu PERL_MAGIC_hints|5.009004|5.009004| PERL_MAGIC_hintselem|5.009004|5.009004| PERL_MAGIC_isa|5.007002|5.003007|p PERL_MAGIC_isaelem|5.007002|5.003007|p PERL_MAGIC_lvref|5.021005|5.021005| PERL_MAGIC_mutex||5.003007|ponu PERL_MAGIC_nkeys|5.007002|5.003007|p PERL_MAGIC_nonelem|5.027009|5.027009| PERL_MAGIC_overload||5.003007|ponu PERL_MAGIC_overload_elem||5.003007|ponu PERL_MAGIC_overload_table|5.007002|5.003007|p PERL_MAGIC_pos|5.007002|5.003007|p PERL_MAGIC_qr|5.007002|5.003007|p PERL_MAGIC_READONLY_ACCEPTABLE|5.015000||Viu PERL_MAGIC_regdata|5.007002|5.003007|p PERL_MAGIC_regdatum|5.007002|5.003007|p PERL_MAGIC_regex_global|5.007002|5.003007|p PERL_MAGIC_rhash|5.009003|5.009003| PERL_MAGIC_shared|5.007003|5.003007|p PERL_MAGIC_shared_scalar|5.007003|5.003007|p PERL_MAGIC_sig|5.007002|5.003007|p PERL_MAGIC_sigelem|5.007002|5.003007|p PERL_MAGIC_substr|5.007002|5.003007|p PERL_MAGIC_sv|5.007002|5.003007|p PERL_MAGIC_symtab|5.009003|5.009003| PERL_MAGIC_taint|5.007002|5.003007|p PERL_MAGIC_tied|5.007002|5.003007|p PERL_MAGIC_tiedelem|5.007002|5.003007|p PERL_MAGIC_tiedscalar|5.007002|5.003007|p PERL_MAGIC_TYPE_IS_VALUE_MAGIC|5.015000||Viu PERL_MAGIC_TYPE_READONLY_ACCEPTABLE|5.015000||Viu PERL_MAGIC_utf8|5.008001|5.003007|p PERL_MAGIC_UTF8_CACHESIZE|5.008001||Viu PERL_MAGIC_uvar|5.007002|5.003007|p PERL_MAGIC_uvar_elem|5.007003|5.003007|p PERL_MAGIC_VALUE_MAGIC|5.015000||Viu PERL_MAGIC_vec|5.007002|5.003007|p PERL_MAGIC_vstring|5.008001|5.003007|p PERL_MAGIC_VTABLE_MASK|5.015000||Viu Perl_malloc|5.006000||Viu PERL_MALLOC_CTL_H|5.027001||Viu Perl_malloc_good_size|5.010001||Viu PERL_MALLOC_WRAP|5.009002|5.009002|Vn PerlMem_calloc|5.006000||Viu PerlMem_free|5.005000||Viu PerlMem_free_lock|5.006000||Viu PerlMem_get_lock|5.006000||Viu PerlMem_is_locked|5.006000||Viu PerlMem_malloc|5.005000||Viu PERL_MEMORY_DEBUG_HEADER_SIZE|5.019009||Viu PerlMemParse_calloc|5.006000||Viu PerlMemParse_free|5.006000||Viu PerlMemParse_free_lock|5.006000||Viu PerlMemParse_get_lock|5.006000||Viu PerlMemParse_is_locked|5.006000||Viu PerlMemParse_malloc|5.006000||Viu PerlMemParse_realloc|5.006000||Viu PerlMem_realloc|5.005000||Viu PerlMemShared_calloc|5.006000||Viu PerlMemShared_free|5.006000||Viu PerlMemShared_free_lock|5.006000||Viu PerlMemShared_get_lock|5.006000||Viu PerlMemShared_is_locked|5.006000||Viu PerlMemShared_malloc|5.006000||Viu PerlMemShared_realloc|5.006000||Viu Perl_mfree|5.006000||Viu PERL_MG_UFUNC|5.007001||Viu Perl_modf|5.006000|5.006000|n PERL_MULTICONCAT_HEADER_SIZE|5.027006||Viu PERL_MULTICONCAT_IX_LENGTHS|5.027006||Viu PERL_MULTICONCAT_IX_NARGS|5.027006||Viu PERL_MULTICONCAT_IX_PLAIN_LEN|5.027006||Viu PERL_MULTICONCAT_IX_PLAIN_PV|5.027006||Viu PERL_MULTICONCAT_IX_UTF8_LEN|5.027006||Viu PERL_MULTICONCAT_IX_UTF8_PV|5.027006||Viu PERL_MULTICONCAT_MAXARG|5.027006||Viu Perl_my_mkostemp|5.027008||Viu Perl_my_mkstemp|5.027004||Viu PERL_MY_SNPRINTF_GUARDED|5.009004||Viu PERL_MY_SNPRINTF_POST_GUARD|5.021002||Viu PERL_MY_VSNPRINTF_GUARDED|5.009004||Viu PERL_MY_VSNPRINTF_POST_GUARD|5.021002||Viu PERL_NO_DEV_RANDOM|5.009004||Viu PERL_OBJECT_THIS|5.005000||Viu PERL_OP_PARENT|5.025001||Viu PERL_PADNAME_MINIMAL|5.021007||Viu PERL_PADSEQ_INTRO|5.013010||Viu perl_parse|5.006000|5.006000|n PERL_PATCHLEVEL_H_IMPLICIT|5.006000||Viu PERL_PATCHNUM|5.010001||Viu PERL_POISON_EXPR|5.019006||Viu Perl_pow|5.006000|5.006000|n Perl_pp_accept|5.013009||Viu Perl_pp_aelemfast_lex|5.015000||Viu Perl_pp_andassign|5.013009||Viu Perl_pp_avalues|5.013009||Viu Perl_pp_bind|5.013009||Viu Perl_pp_bit_xor|5.013009||Viu Perl_pp_chmod|5.013009||Viu Perl_pp_chomp|5.013009||Viu Perl_pp_connect|5.013009||Viu Perl_pp_cos|5.013009||Viu Perl_pp_custom|5.013009||Viu Perl_pp_dbmclose|5.013009||Viu PERL_PPDEF|5.006000||Viu Perl_pp_dofile|5.013009||Viu Perl_pp_dor|5.013009||Viu Perl_pp_dorassign|5.013009||Viu Perl_pp_dump|5.013009||Viu Perl_pp_egrent|5.013009||Viu Perl_pp_enetent|5.013009||Viu Perl_pp_eprotoent|5.013009||Viu Perl_pp_epwent|5.013009||Viu Perl_pp_eservent|5.013009||Viu Perl_pp_exp|5.013009||Viu Perl_pp_fcntl|5.013009||Viu Perl_pp_ftatime|5.013009||Viu Perl_pp_ftbinary|5.013009||Viu Perl_pp_ftblk|5.013009||Viu Perl_pp_ftchr|5.013009||Viu Perl_pp_ftctime|5.013009||Viu Perl_pp_ftdir|5.013009||Viu Perl_pp_fteexec|5.013009||Viu Perl_pp_fteowned|5.013009||Viu Perl_pp_fteread|5.013009||Viu Perl_pp_ftewrite|5.013009||Viu Perl_pp_ftfile|5.013009||Viu Perl_pp_ftmtime|5.013009||Viu Perl_pp_ftpipe|5.013009||Viu Perl_pp_ftrexec|5.013009||Viu Perl_pp_ftrwrite|5.013009||Viu Perl_pp_ftsgid|5.013009||Viu Perl_pp_ftsize|5.013009||Viu Perl_pp_ftsock|5.013009||Viu Perl_pp_ftsuid|5.013009||Viu Perl_pp_ftsvtx|5.013009||Viu Perl_pp_ftzero|5.013009||Viu Perl_pp_getpeername|5.013009||Viu Perl_pp_getsockname|5.013009||Viu Perl_pp_ggrgid|5.013009||Viu Perl_pp_ggrnam|5.013009||Viu Perl_pp_ghbyaddr|5.013009||Viu Perl_pp_ghbyname|5.013009||Viu Perl_pp_gnbyaddr|5.013009||Viu Perl_pp_gnbyname|5.013009||Viu Perl_pp_gpbyname|5.013009||Viu Perl_pp_gpbynumber|5.013009||Viu Perl_pp_gpwnam|5.013009||Viu Perl_pp_gpwuid|5.013009||Viu Perl_pp_gsbyname|5.013009||Viu Perl_pp_gsbyport|5.013009||Viu Perl_pp_gsockopt|5.013009||Viu Perl_pp_hex|5.013009||Viu Perl_pp_i_postdec|5.006000||Viu Perl_pp_i_postinc|5.006000||Viu Perl_pp_i_predec|5.006000||Viu Perl_pp_i_preinc|5.006000||Viu Perl_pp_keys|5.013009||Viu Perl_pp_kill|5.013009||Viu Perl_pp_lcfirst|5.013009||Viu Perl_pp_lineseq|5.013009||Viu Perl_pp_listen|5.013009||Viu Perl_pp_localtime|5.013009||Viu Perl_pp_log|5.013009||Viu Perl_pp_lstat|5.013009||Viu Perl_pp_mapstart|5.013009||Viu Perl_pp_msgctl|5.013009||Viu Perl_pp_msgget|5.013009||Viu Perl_pp_msgrcv|5.013009||Viu Perl_pp_msgsnd|5.013009||Viu Perl_pp_nbit_xor|5.021009||Viu Perl_pp_orassign|5.013009||Viu Perl_pp_padany|5.013009||Viu Perl_pp_pop|5.013009||Viu Perl_pp_read|5.013009||Viu Perl_pp_recv|5.013009||Viu Perl_pp_regcmaybe|5.013009||Viu Perl_pp_rindex|5.013009||Viu Perl_pp_rv2hv|5.013009||Viu Perl_pp_say|5.013009||Viu Perl_pp_sbit_xor|5.021009||Viu Perl_pp_scalar|5.013009||Viu Perl_pp_schomp|5.013009||Viu Perl_pp_scope|5.013009||Viu Perl_pp_seek|5.013009||Viu Perl_pp_semop|5.013009||Viu Perl_pp_send|5.013009||Viu Perl_pp_sge|5.013009||Viu Perl_pp_sgrent|5.013009||Viu Perl_pp_sgt|5.013009||Viu Perl_pp_shmctl|5.013009||Viu Perl_pp_shmget|5.013009||Viu Perl_pp_shmread|5.013009||Viu Perl_pp_shutdown|5.013009||Viu Perl_pp_slt|5.013009||Viu Perl_pp_snetent|5.013009||Viu Perl_pp_socket|5.013009||Viu Perl_pp_sprotoent|5.013009||Viu Perl_pp_spwent|5.013009||Viu Perl_pp_sqrt|5.013009||Viu Perl_pp_sservent|5.013009||Viu Perl_pp_ssockopt|5.013009||Viu Perl_pp_symlink|5.013009||Viu Perl_pp_transr|5.013009||Viu Perl_pp_unlink|5.013009||Viu Perl_pp_utime|5.013009||Viu Perl_pp_values|5.013009||Viu PERL_PRESERVE_IVUV|5.007001||Viu PERL_PRIeldbl|5.006001|5.006001|Vn PERL_PRIfldbl|5.006000|5.006000|Vn PERL_PRIgldbl|5.006000|5.006000|Vn PerlProc_abort|5.005000||Viu PerlProc_crypt|5.005000||Viu PerlProc_DynaLoad|5.006000||Viu PerlProc_execl|5.005000||Viu PerlProc_execv|5.005000||Viu PerlProc_execvp|5.005000||Viu PerlProc__exit|5.005000||Viu PerlProc_exit|5.005000||Viu PerlProc_fork|5.006000||Viu PerlProc_getegid|5.005000||Viu PerlProc_geteuid|5.005000||Viu PerlProc_getgid|5.005000||Viu PerlProc_getlogin|5.005000||Viu PerlProc_GetOSError|5.006000||Viu PerlProc_getpid|5.006000||Viu PerlProc_gettimeofday|5.008000||Viu PerlProc_getuid|5.005000||Viu PerlProc_kill|5.005000||Viu PerlProc_killpg|5.005000||Viu PerlProc_lasthost|5.007001||Viu PerlProc_longjmp|5.005000||Viu PerlProc_pause|5.005000||Viu PerlProc_pclose|5.005000||Viu PerlProc_pipe|5.005000||Viu PerlProc_pipe_cloexec|5.027008||Viu PerlProc_popen|5.005000||Viu PerlProc_popen_list|5.007001||Viu PerlProc_setgid|5.005000||Viu PerlProc_setjmp|5.005000||Viu PerlProc_setuid|5.005000||Viu PerlProc_signal|5.005000||Viu PerlProc_sleep|5.005000||Viu PerlProc_spawnvp|5.008000||Viu PerlProc_times|5.005000||Viu PerlProc_wait|5.005000||Viu PerlProc_waitpid|5.005000||Viu perl_pthread_mutex_lock|5.023006||Viu perl_pthread_mutex_unlock|5.023006||Viu PERL_PV_ESCAPE_ALL|5.009004|5.003007|p PERL_PV_ESCAPE_DWIM|5.019008||Viu PERL_PV_ESCAPE_FIRSTCHAR|5.009004|5.003007|p PERL_PV_ESCAPE_NOBACKSLASH|5.009004|5.003007|p PERL_PV_ESCAPE_NOCLEAR|5.009004|5.003007|p PERL_PV_ESCAPE_NONASCII|5.013009|5.013009| PERL_PV_ESCAPE_QUOTE|5.009004|5.003007|p PERL_PV_ESCAPE_RE|5.009005|5.003007|p PERL_PV_ESCAPE_UNI|5.009004|5.003007|p PERL_PV_ESCAPE_UNI_DETECT|5.009004|5.003007|p PERL_PV_PRETTY_DUMP|5.009004||pcV PERL_PV_PRETTY_ELLIPSES|5.010000|5.003007|p PERL_PV_PRETTY_EXACTSIZE|5.021005||Viu PERL_PV_PRETTY_LTGT|5.009004|5.003007|p PERL_PV_PRETTY_NOCLEAR|5.010000||pcV PERL_PV_PRETTY_QUOTE|5.009004|5.003007|p PERL_PV_PRETTY_REGPROP|5.009004||pcV PERL_QUAD_MAX|5.003007|5.003007|p PERL_QUAD_MIN|5.003007|5.003007|p PERL_READ_LOCK|5.033005||Viu PERL_READ_UNLOCK|5.033005||Viu Perl_realloc|5.006000||Viu PERL_REENTR_API|5.009005||Viu PERL_REENTR_H|5.027001||Viu PERL_REENTR_USING_ASCTIME_R|5.031011||Viu PERL_REENTR_USING_CRYPT_R|5.031011||Viu PERL_REENTR_USING_CTERMID_R|5.031011||Viu PERL_REENTR_USING_CTIME_R|5.031011||Viu PERL_REENTR_USING_ENDGRENT_R|5.031011||Viu PERL_REENTR_USING_ENDHOSTENT_R|5.031011||Viu PERL_REENTR_USING_ENDNETENT_R|5.031011||Viu PERL_REENTR_USING_ENDPROTOENT_R|5.031011||Viu PERL_REENTR_USING_ENDPWENT_R|5.031011||Viu PERL_REENTR_USING_ENDSERVENT_R|5.031011||Viu PERL_REENTR_USING_GETGRENT_R|5.031011||Viu PERL_REENTR_USING_GETGRGID_R|5.031011||Viu PERL_REENTR_USING_GETGRNAM_R|5.031011||Viu PERL_REENTR_USING_GETHOSTBYADDR_R|5.031011||Viu PERL_REENTR_USING_GETHOSTBYNAME_R|5.031011||Viu PERL_REENTR_USING_GETHOSTENT_R|5.031011||Viu PERL_REENTR_USING_GETLOGIN_R|5.031011||Viu PERL_REENTR_USING_GETNETBYADDR_R|5.031011||Viu PERL_REENTR_USING_GETNETBYNAME_R|5.031011||Viu PERL_REENTR_USING_GETNETENT_R|5.031011||Viu PERL_REENTR_USING_GETPROTOBYNAME_R|5.031011||Viu PERL_REENTR_USING_GETPROTOBYNUMBER_R|5.031011||Viu PERL_REENTR_USING_GETPROTOENT_R|5.031011||Viu PERL_REENTR_USING_GETPWENT_R|5.031011||Viu PERL_REENTR_USING_GETPWNAM_R|5.031011||Viu PERL_REENTR_USING_GETPWUID_R|5.031011||Viu PERL_REENTR_USING_GETSERVBYNAME_R|5.031011||Viu PERL_REENTR_USING_GETSERVBYPORT_R|5.031011||Viu PERL_REENTR_USING_GETSERVENT_R|5.031011||Viu PERL_REENTR_USING_GETSPNAM_R|5.031011||Viu PERL_REENTR_USING_GMTIME_R|5.031011||Viu PERL_REENTR_USING_LOCALTIME_R|5.031011||Viu PERL_REENTR_USING_READDIR64_R|5.031011||Viu PERL_REENTR_USING_READDIR_R|5.031011||Viu PERL_REENTR_USING_SETGRENT_R|5.031011||Viu PERL_REENTR_USING_SETHOSTENT_R|5.031011||Viu PERL_REENTR_USING_SETLOCALE_R|5.031011||Viu PERL_REENTR_USING_SETNETENT_R|5.031011||Viu PERL_REENTR_USING_SETPROTOENT_R|5.031011||Viu PERL_REENTR_USING_SETPWENT_R|5.031011||Viu PERL_REENTR_USING_SETSERVENT_R|5.031011||Viu PERL_REENTR_USING_STRERROR_R|5.031011||Viu PERL_REENTR_USING_TMPNAM_R|5.031011||Viu PERL_REENTR_USING_TTYNAME_R|5.031011||Viu PERL_REGCHARCLASS_H|5.027001||Viu PERL_REGCOMP_H|5.029006||Viu PERL_REGMATCH_SLAB_SLOTS|5.009004||Viu PERL_RELOCATABLE_INC|5.017002|5.017002|Vn PERL_REVISION|5.006000|5.006000|d perl_run|5.003007|5.003007|n PERL_RW_MUTEX_DESTROY|5.033005||Viu PERL_RW_MUTEX_INIT|5.033005||Viu Perl_safesysmalloc_size|5.010001||Viu PERL_SAWAMPERSAND|5.017010||Viu PERL_SCAN_ALLOW_MEDIAL_UNDERSCORES|5.031009||Viu PERL_SCAN_ALLOW_UNDERSCORES|5.007003|5.003007|p PERL_SCAN_DISALLOW_PREFIX|5.007003|5.003007|p PERL_SCAN_GREATER_THAN_UV_MAX|5.007003|5.003007|p PERL_SCAN_NOTIFY_ILLDIGIT|5.031008||Viu PERL_SCAN_SILENT_ILLDIGIT|5.008001|5.003007|p PERL_SCAN_SILENT_NON_PORTABLE|5.015001||Viu PERL_SCAN_SILENT_OVERFLOW|5.031009||Viu PERL_SCAN_TRAILING|5.021002|5.021002| PERL_SCNfldbl|5.006001|5.006001|Vn PERL_SCRIPT_MODE|5.004005||Viu PERL_SEEN_HV_FUNC_H|5.017010||Viu PERL_SEEN_HV_MACRO_H|5.027001||Viu PERL_SET_CONTEXT|5.006000||Viu PERL_SET_INTERP|5.006000||Viu Perl_setlocale|5.027002|5.027002|n PERL_SET_PHASE|5.015001||Viu PERL_SET_THX|5.006000||Viu Perl_sharepvn|5.006000||Viu PERL_SHORT_MAX|5.003007|5.003007|p PERL_SHORT_MIN|5.003007|5.003007|p PERLSI_DESTROY|5.005000||Viu PERLSI_DIEHOOK|5.005000||Viu PERL_SIGNALS_UNSAFE_FLAG|5.008001|5.003007|p Perl_signbit|5.009005|5.009005|xn PERLSI_MAGIC|5.005000||Viu PERLSI_MAIN|5.005000||Viu PERLSI_MULTICALL|5.023000||Viu Perl_sin|5.006000|5.006000|n Perl_sinh|5.021004|5.021004|n PerlSIO_canset_cnt|5.007001||Viu PerlSIO_clearerr|5.007001||Viu PerlSIO_fast_gets|5.007001||Viu PerlSIO_fclose|5.007001||Viu PerlSIO_fdopen|5.007001||Viu PerlSIO_fdupopen|5.007001||Viu PerlSIO_feof|5.007001||Viu PerlSIO_ferror|5.007001||Viu PerlSIO_fflush|5.007001||Viu PerlSIO_fgetc|5.007001||Viu PerlSIO_fgetpos|5.007001||Viu PerlSIO_fgets|5.007001||Viu PerlSIO_fileno|5.007001||Viu PerlSIO_fopen|5.007001||Viu PerlSIO_fputc|5.007001||Viu PerlSIO_fputs|5.007001||Viu PerlSIO_fread|5.007001||Viu PerlSIO_freopen|5.007001||Viu PerlSIO_fseek|5.007001||Viu PerlSIO_fsetpos|5.007001||Viu PerlSIO_ftell|5.007001||Viu PerlSIO_fwrite|5.007001||Viu PerlSIO_get_base|5.007001||Viu PerlSIO_get_bufsiz|5.007001||Viu PerlSIO_get_cnt|5.007001||Viu PerlSIO_get_ptr|5.007001||Viu PerlSIO_has_base|5.007001||Viu PerlSIO_has_cntptr|5.007001||Viu PerlSIO_init|5.007001||Viu PerlSIO_printf|5.007001||Viu PerlSIO_rewind|5.007001||Viu PerlSIO_setbuf|5.007001||Viu PerlSIO_set_cnt|5.007001||Viu PerlSIO_setlinebuf|5.007001||Viu PerlSIO_set_ptr|5.007001||Viu PerlSIO_setvbuf|5.007001||Viu PerlSIO_stderr|5.007001||Viu PerlSIO_stdin|5.007001||Viu PerlSIO_stdout|5.007001||Viu PerlSIO_stdoutf|5.007001||Viu PerlSIO_tmpfile|5.007001||Viu PerlSIO_ungetc|5.007001||Viu PERLSI_OVERLOAD|5.005000||Viu PerlSIO_vprintf|5.007001||Viu PERL_SIPHASH_FNC|5.025008||Viu PERLSI_REGCOMP|5.031011||Viu PERLSI_REQUIRE|5.005000||Viu PERLSI_SIGNAL|5.005000||Viu PERLSI_SORT|5.005000||Viu PERLSI_UNDEF|5.005000||Viu PERLSI_UNKNOWN|5.005000||Viu PERLSI_WARNHOOK|5.005000||Viu PERL_SMALL_MACRO_BUFFER|5.023008||Viu PERL_SNPRINTF_CHECK|5.021002||Viu PerlSock_accept|5.005000||Viu PerlSock_accept_cloexec|5.027008||Viu PerlSock_bind|5.005000||Viu PerlSock_closesocket|5.006000||Viu PerlSock_connect|5.005000||Viu PerlSock_endhostent|5.005000||Viu PerlSock_endnetent|5.005000||Viu PerlSock_endprotoent|5.005000||Viu PerlSock_endservent|5.005000||Viu PerlSock_gethostbyaddr|5.005000||Viu PerlSock_gethostbyname|5.005000||Viu PerlSock_gethostent|5.005000||Viu PerlSock_gethostname|5.005000||Viu PerlSock_getnetbyaddr|5.005000||Viu PerlSock_getnetbyname|5.005000||Viu PerlSock_getnetent|5.005000||Viu PerlSock_getpeername|5.005000||Viu PerlSock_getprotobyname|5.005000||Viu PerlSock_getprotobynumber|5.005000||Viu PerlSock_getprotoent|5.005000||Viu PerlSock_getservbyname|5.005000||Viu PerlSock_getservbyport|5.005000||Viu PerlSock_getservent|5.005000||Viu PerlSock_getsockname|5.005000||Viu PerlSock_getsockopt|5.005000||Viu PerlSock_htonl|5.005000||Viu PerlSock_htons|5.005000||Viu PerlSock_inet_addr|5.005000||Viu PerlSock_inet_ntoa|5.005000||Viu PerlSock_listen|5.005000||Viu PerlSock_ntohl|5.005000||Viu PerlSock_ntohs|5.005000||Viu PerlSock_recv|5.005000||Viu PerlSock_recvfrom|5.005000||Viu PerlSock_select|5.005000||Viu PerlSock_send|5.005000||Viu PerlSock_sendto|5.005000||Viu PerlSock_sethostent|5.005000||Viu PerlSock_setnetent|5.005000||Viu PerlSock_setprotoent|5.005000||Viu PerlSock_setservent|5.005000||Viu PerlSock_setsockopt|5.005000||Viu PerlSock_shutdown|5.005000||Viu PERL_SOCKS_NEED_PROTOTYPES|5.007001||Viu PerlSock_socket|5.005000||Viu PerlSock_socket_cloexec|5.027008||Viu PerlSock_socketpair|5.005000||Viu PerlSock_socketpair_cloexec|5.027008||Viu Perl_sqrt|5.006000|5.006000|n PERL_STACK_OVERFLOW_CHECK|5.006000||Viu PERL_STATIC_FORCE_INLINE|5.031011||Viu PERL_STATIC_FORCE_INLINE_NO_RET|5.031011||Viu PERL_STATIC_INLINE|5.013004|5.013004|Vn PERL_STATIC_INLINE_NO_RET|5.017005||Viu PERL_STATIC_NO_RET|5.017005||Viu PERL_STRLEN_EXPAND_SHIFT|5.013004||Viu PERL_STRLEN_ROUNDUP|5.009003||Viu PERL_STRLEN_ROUNDUP_QUANTUM|5.009003||Viu Perl_strtod|5.021004||Viu PERL_SUB_DEPTH_WARN|5.010001||Viu PERL_SUBVERSION|5.006000|5.003007|d PERL_SYS_FPU_INIT|5.021005||Viu PERL_SYS_INIT3|5.006000|5.006000| PERL_SYS_INIT3_BODY|5.010000||Viu PERL_SYS_INIT|5.003007|5.003007| PERL_SYS_INIT_BODY|5.010000||Viu PERL_SYS_TERM|5.003007|5.003007| PERL_SYS_TERM_BODY|5.010000||Viu Perl_tan|5.021004|5.021004|n Perl_tanh|5.021004|5.021004|n PERL_TARGETARCH|5.007002|5.007002|Vn PERL_TIME64_CONFIG_H|5.027001||Viu PERL_TIME64_H|5.027001||Viu PERL_TRACK_MEMPOOL|5.009003||Viu PERL_TSA|5.023006||Viu PERL_TSA_ACQUIRE|5.023006||Viu PERL_TSA_ACTIVE|5.023006||Viu PERL_TSA_CAPABILITY|5.023006||Viu PERL_TSA_EXCLUDES|5.023006||Viu PERL_TSA_GUARDED_BY|5.023006||Viu PERL_TSA_NO_TSA|5.023006||Viu PERL_TSA_PT_GUARDED_BY|5.023006||Viu PERL_TSA_RELEASE|5.023006||Viu PERL_TSA_REQUIRES|5.023006||Viu PERL_UCHAR_MAX|5.003007|5.003007|p PERL_UCHAR_MIN|5.003007|5.003007|p PERL_UINT_MAX|5.003007|5.003007|p PERL_UINT_MIN|5.003007|5.003007|p PERL_ULONG_MAX|5.003007|5.003007|p PERL_ULONG_MIN|5.003007|5.003007|p PERL_UNICODE_ALL_FLAGS|5.008001||Viu PERL_UNICODE_ARGV|5.008001||Viu PERL_UNICODE_ARGV_FLAG|5.008001||Viu PERL_UNICODE_CONSTANTS_H|5.027001||Viu PERL_UNICODE_DEFAULT_FLAGS|5.008001||Viu PERL_UNICODE_IN|5.008001||Viu PERL_UNICODE_IN_FLAG|5.008001||Viu PERL_UNICODE_INOUT|5.008001||Viu PERL_UNICODE_INOUT_FLAG|5.008001||Viu PERL_UNICODE_LOCALE|5.008001||Viu PERL_UNICODE_LOCALE_FLAG|5.008001||Viu PERL_UNICODE_MAX|5.007003||Viu PERL_UNICODE_OUT|5.008001||Viu PERL_UNICODE_OUT_FLAG|5.008001||Viu PERL_UNICODE_STD|5.008001||Viu PERL_UNICODE_STDERR|5.008001||Viu PERL_UNICODE_STDERR_FLAG|5.008001||Viu PERL_UNICODE_STD_FLAG|5.008001||Viu PERL_UNICODE_STDIN|5.008001||Viu PERL_UNICODE_STDIN_FLAG|5.008001||Viu PERL_UNICODE_STDOUT|5.008001||Viu PERL_UNICODE_STDOUT_FLAG|5.008001||Viu PERL_UNICODE_UTF8CACHEASSERT|5.009004||Viu PERL_UNICODE_UTF8CACHEASSERT_FLAG|5.009004||Viu PERL_UNICODE_WIDESYSCALLS|5.008001||Viu PERL_UNICODE_WIDESYSCALLS_FLAG|5.008001||Viu PERL_UNLOCK_HOOK|5.009004||Viu PERL_UNUSED_ARG|5.009003|5.003007|p PERL_UNUSED_CONTEXT|5.009004|5.003007|p PERL_UNUSED_DECL|5.007002|5.003007|p PERL_UNUSED_RESULT|5.021001|5.003007|p PERL_UNUSED_VAR|5.007002|5.003007|p PERL_UQUAD_MAX|5.003007|5.003007|p PERL_UQUAD_MIN|5.003007|5.003007|p PERL_USE_DEVEL|5.010001|5.010001|Vn PERL_USE_GCC_BRACE_GROUPS|5.009004|5.003007|pV PERL_USES_PL_PIDSTATUS|5.009003||Viu PERL_USHORT_MAX|5.003007|5.003007|p PERL_USHORT_MIN|5.003007|5.003007|p PERL_UTF8_H|5.027001||Viu PERL_UTIL_H|5.025012||Viu Perl_va_copy|5.007001||Viu PERLVAR|5.005000||Viu PERLVARA|5.006000||Viu PERLVARI|5.005000||Viu PERL_VARIANTS_WORD_MASK|5.027007||Viu PERLVARIC|5.005000||Viu PERL_VERSION|5.006000|5.003007|d PERL_VERSION_EQ|5.033001||p PERL_VERSION_GE|5.033001|5.003007|p PERL_VERSION_GT|5.033001|5.003007|p PERL_VERSION_LE|5.033001|5.003007|p PERL_VERSION_LT|5.033001|5.003007|p PERL_VERSION_MAJOR|5.033001||Viu PERL_VERSION_MINOR|5.033001||Viu PERL_VERSION_NE|5.033001||p PERL_VERSION_PATCH|5.033001||Viu PERL_VERSION_STRING|5.010001||Viu PERL_WAIT_FOR_CHILDREN|5.006000||Viu Perl_Warn_Bit|5.033003||Viu Perl_warner_nocontext||5.004000|ponu PERL_WARNHOOK_FATAL|5.009004||Viu Perl_Warn_Off|5.033003||Viu PERL_WORD_BOUNDARY_MASK|5.027007||Viu PERL_WORDSIZE|5.027007||Viu PERL_WRITE_LOCK|5.033005||Viu PERL_WRITE_MSG_TO_CONSOLE|5.007003||Viu PERL_WRITE_UNLOCK|5.033005||Viu PERL_XSUB_H|5.027001||Viu perly_sighandler|5.031007||cVnu PHOSTNAME|5.006000|5.006000|Vn pidgone|5.003007||Viu Pid_t|5.005000|5.005000|Vn pipe|5.005000||Viu PIPE_OPEN_MODE|5.008002||Viu PIPESOCK_MODE|5.008001||Viu PL_AboveLatin1|5.015008||Viu PL_amagic_generation|5.005000||Viu PL_an|5.005000||Viu PL_argvgv|5.005000||Viu PL_argvoutgv|5.005000||Viu PL_argvout_stack|5.006000||Viu PL_Assigned_invlist|5.025009||Viu PL_basetime|5.005000||Viu PL_beginav|5.005000||Viu PL_beginav_save|5.006001||Viu PL_blockhooks|5.013003||Viu PL_body_arenas|5.009004||Viu PL_body_roots|5.009003||Viu PL_bodytarget|5.005000||Viu PL_breakable_sub_gen|5.010001||Viu PL_bufend||5.003007|ponu PL_bufptr||5.003007|ponu PL_CCC_non0_non230|5.029008||Viu PL_check|5.009003|5.006000| PL_checkav|5.006000||Viu PL_checkav_save|5.008001||Viu PL_chopset|5.005000||Viu PL_clocktick|5.008001||Viu PL_collation_ix|5.005000||Viu PL_collation_name|5.005000||Viu PL_collation_standard|5.005000||Viu PL_collxfrm_base|5.005000||Viu PL_collxfrm_mult|5.005000||Viu PL_colors|5.005000||Viu PL_colorset|5.005000||Viu PL_compcv|5.005000||Viu PL_compiling|5.005000|5.003007|poVnu PL_comppad|5.008001|5.008001|x PL_comppad_name|5.017004|5.017004|x PL_comppad_name_fill|5.005000||Viu PL_comppad_name_floor|5.005000||Viu PL_constpadix|5.021004||Viu PL_copline||5.003007|ponu PL_cop_seqmax|5.005000||Viu PL_cshlen|5.005000||Viu PL_curcop|5.004005|5.003007|p PL_curcopdb|5.005000||Viu PL_curlocales|5.027009||Viu PL_curpad|5.005000|5.005000|x PL_curpm|5.005000||Viu PL_curpm_under|5.025007||Viu PL_curstack|5.005000||Viu PL_curstackinfo|5.005000||Viu PL_curstash|5.004005|5.003007|p PL_curstname|5.005000||Viu PL_custom_op_descs|5.007003||Viu PL_custom_op_names|5.007003||Viu PL_custom_ops|5.013007||Viu PL_cv_has_eval|5.009000||Viu PL_dbargs|5.005000||Viu PL_DBcontrol|5.021005||Viu PL_DBcv|5.005000||Viu PL_DBgv|5.005000||Viu PL_DBline|5.005000||Viu PL_DBsignal|5.005000|5.003007|poVnu PL_DBsignal_iv|5.021005||Viu PL_DBsingle|5.005000||pV PL_DBsingle_iv|5.021005||Viu PL_DBsub|5.005000||pV PL_DBtrace|5.005000||pV PL_DBtrace_iv|5.021005||Viu PL_debstash|5.005000|5.003007|poVnu PL_debug|5.005000||Viu PL_debug_pad|5.007003||Viu PL_defgv|5.004005|5.003007|p PL_def_layerlist|5.007003||Viu PL_defoutgv|5.005000||Viu PL_defstash|5.005000||Viu PL_delaymagic|5.005000||Viu PL_delaymagic_egid|5.015008||Viu PL_delaymagic_euid|5.015008||Viu PL_delaymagic_gid|5.015008||Viu PL_delaymagic_uid|5.015008||Viu PL_destroyhook|5.010000||Viu PL_diehook|5.005000|5.003007|poVnu PL_Dir|5.006000||Viu PL_dirty|5.005000|5.003007|poVnu PL_doswitches|5.005000||Viu PL_dowarn|5.005000||pV PL_dumper_fd|5.009003||Viu PL_dumpindent|5.006000||Viu PL_dump_re_max_len|5.023008||Viu PL_efloatbuf|5.006000||Viu PL_efloatsize|5.006000||Viu PL_E_FORMAT_PRECISION|5.029000||Viu PL_encoding|5.007003||Viu PL_endav|5.005000||Viu PL_Env|5.006000||Viu PL_envgv|5.005000||Viu PL_errgv|5.004005|5.003007|p PL_error_count||5.003007|ponu PL_errors|5.006000||Viu PL_e_script|5.005000||Viu PL_eval_root|5.005000||Viu PL_evalseq|5.005000||Viu PL_eval_start|5.005000||Viu PL_exit_flags|5.006000|5.006000| PL_exitlist|5.005000||Viu PL_exitlistlen|5.005000||Viu PL_expect||5.003007|ponu PL_fdpid|5.005000||Viu PL_filemode|5.005000||Viu PL_firstgv|5.005000||Viu PL_forkprocess|5.005000||Viu PL_formtarget|5.005000||Viu PL_GCB_invlist|5.021009||Viu PL_generation|5.005000||Viu PL_gensym|5.005000||Viu PL_globalstash|5.005000||Viu PL_globhook|5.015005||Viu PL_hash_rand_bits|5.017010||Viu PL_HASH_RAND_BITS_ENABLED|5.018000||Viu PL_hash_rand_bits_enabled|5.018000||Viu PL_hash_seed|5.033007||Viu PL_hash_state|5.033007||Viu PL_HasMultiCharFold|5.017005||Viu PL_hexdigit||5.003007|pn PL_hintgv|5.005000||Viu PL_hints|5.005000|5.003007|poVnu PL_hv_fetch_ent_mh|5.005000||Viu PL_incgv|5.005000||Viu PL_in_clean_all|5.005000||Viu PL_in_clean_objs|5.005000||Viu PL_in_eval|5.005000||Viu PL_initav|5.005000||Viu PL_in_load_module|5.008001||Viu PL_in_my||5.003007|ponu PL_in_my_stash||5.005000|ponu PL_inplace|5.005000||Viu PL_in_some_fold|5.029007||Viu PL_internal_random_state|5.027004||Viu PL_in_utf8_COLLATE_locale|5.025002||Viu PL_in_utf8_CTYPE_locale|5.019009||Viu PL_in_utf8_turkic_locale|5.029008||Viu PL_isarev|5.009005||Viu PL_keyword_plugin|5.011002|5.011002|x PL_known_layers|5.007003||Viu PL_langinfo_buf|5.027004||Viu PL_langinfo_bufsize|5.027004||Viu PL_lastfd|5.005000||Viu PL_lastgotoprobe|5.005000||Viu PL_last_in_gv|5.005000||Vi PL_laststatval|5.005000|5.003007|poVnu PL_laststype|5.005000||Viu PL_Latin1|5.015008||Viu PL_LB_invlist|5.023007||Viu PL_lc_numeric_mutex_depth|5.027009||Viu PL_lex_state||5.003007|ponu PL_lex_stuff||5.003007|ponu PL_linestr||5.003007|ponu PL_LIO|5.006000||Viu PL_locale_utf8ness|5.027009||Viu PL_localizing|5.005000||Viu PL_localpatches|5.005000||Viu PL_lockhook|5.007003||Viu PL_main_cv|5.005000||Viu PL_main_root|5.005000||Viu PL_mainstack|5.005000||Viu PL_main_start|5.005000||Viu PL_markstack|5.005000||Viu PL_markstack_max|5.005000||Viu PL_markstack_ptr|5.005000||Viu PL_max_intro_pending|5.005000||Viu PL_maxo|5.005000||Viu PL_maxsysfd|5.005000|5.005000| PL_mbrlen_ps|5.031010||Viu PL_mbrtowc_ps|5.031010||Viu PL_Mem|5.006000||Viu PL_mem_log|5.033005||Viu PL_memory_debug_header|5.009004||Viu PL_MemParse|5.006000||Viu PL_MemShared|5.006000||Viu PL_mess_sv|5.005000|5.004000|poVnu PL_min_intro_pending|5.005000||Viu PL_minus_a|5.005000||Viu PL_minus_c|5.005000||Viu PL_minus_E|5.009003||Viu PL_minus_F|5.005000||Viu PL_minus_l|5.005000||Viu PL_minus_n|5.005000||Viu PL_minus_p|5.005000||Viu PL_modcount|5.005000||Viu PL_modglobal|5.005000|5.005000| PL_multideref_pc|5.021007||Viu PL_my_cxt_list|5.009003||Viu PL_my_cxt_size|5.009003||Viu PL_na|5.004005|5.003007|p PL_nomemok|5.005000||Viu PL_no_modify||5.003007|ponu PL_numeric_name|5.005000||Viu PL_numeric_radix_sv|5.007002||Viu PL_numeric_standard|5.005000||Viu PL_numeric_underlying|5.027006||Viu PL_numeric_underlying_is_standard|5.027009||Viu PL_ofsgv|5.011000||Vi PL_oldname|5.005000||Viu PL_op|5.005000||Viu PL_op_exec_cnt|5.019002||Viu PL_opfreehook|5.011000|5.011000| PL_op_mask|5.005000||Viu PL_origalen|5.005000||Viu PL_origargc|5.005000||Viu PL_origargv|5.005000||Viu PL_origenviron|5.005000||Viu PL_origfilename|5.005000||Viu PL_ors_sv|5.007001||Viu PL_osname|5.005000||Viu PL_padix|5.005000||Viu PL_padix_floor|5.005000||Viu PL_padlist_generation|5.021007||Viu PL_padname_const|5.021007||Viu PL_padname_undef|5.021007||Viu PL_pad_reset_pending|5.005000||Viu PL_parser|5.009005|5.003007|p PL_patchlevel|5.005000||Viu PL_peepp|5.007003|5.007003| PL_perldb|5.005000|5.003007|poVnu PL_perl_destruct_level|5.004005|5.003007|p PL_perlio|5.007003||Viu PL_phase|5.013007|5.013007| PL_pidstatus|5.005000||Viu PL_Posix_ptrs|5.029000||Viu PL_ppaddr||5.003007|ponu PL_preambleav|5.005000||Viu PL_Private_Use|5.029009||Viu PL_Proc|5.006000||Viu PL_profiledata|5.005000||Viu PL_psig_name|5.006000||Viu PL_psig_pend|5.007001||Viu PL_psig_ptr|5.006000||Viu PL_ptr_table|5.006000||Viu PL_random_state|5.019004||Viu PL_RANDOM_STATE_TYPE|5.019004||Viu PL_reentrant_buffer|5.007002||Viu PL_reentrant_retint|5.008001||Viu PL_reg_curpm|5.006000||Viu PL_regex_pad|5.007002||Viu PL_regex_padav|5.007002||Viu PL_registered_mros|5.010001||Viu PL_regmatch_slab|5.009004||Viu PL_regmatch_state|5.009004||Viu PL_replgv|5.005000||Viu PL_restartjmpenv|5.013001||Viu PL_restartop|5.005000|5.005000| PL_rpeepp|5.013005|5.013005| PL_rs|5.005000||Vi PL_rsfp||5.003007|ponu PL_rsfp_filters||5.003007|ponu PL_runops|5.006000|5.006000| PL_savebegin|5.007003||Viu PL_savestack|5.005000||Viu PL_savestack_ix|5.005000||Viu PL_savestack_max|5.005000||Viu PL_sawampersand|5.005000||Viu PL_SB_invlist|5.021009||Viu PL_scopestack|5.005000||Viu PL_scopestack_ix|5.005000||Viu PL_scopestack_max|5.005000||Viu PL_scopestack_name|5.011002||Viu PL_SCX_invlist|5.027008||Viu PL_secondgv|5.005000||Viu PL_setlocale_buf|5.027009||Viu PL_setlocale_bufsize|5.027009||Viu PL_sharehook|5.007003||Viu PL_sighandler1p|5.031007||Viu PL_sighandler3p|5.031007||Viu PL_sighandlerp|5.005000||Viu PL_signalhook|5.013002||Viu PL_signals|5.008001|5.003007|poVnu PL_sig_pending|5.007001||Viu PL_Sock|5.006000||Viu PL_sortcop|5.005000||Viu PL_sortstash|5.005000||Viu PL_splitstr|5.005000||Viu PL_srand_called|5.006000||Viu PL_stack_base|5.005000|5.003007|poVnu PL_stack_max|5.005000||Viu PL_stack_sp|5.005000|5.003007|poVnu PL_start_env|5.005000||Viu PL_stashcache|5.008001||Viu PL_stashpad|5.017001||Viu PL_stashpadix|5.017001||Viu PL_stashpadmax|5.017001||Viu PL_statcache|5.005000|5.003007|poVnu PL_statgv|5.005000||Viu PL_statname|5.005000||Viu PL_statusvalue|5.005000||Viu PL_statusvalue_posix|5.009003||Viu PL_statusvalue_vms|5.005000||Viu PL_stderrgv|5.006000||Viu PL_stdingv|5.005000|5.003007|poVnu PL_StdIO|5.006000||Viu PL_strtab|5.005000||Viu PL_strxfrm_is_behaved|5.025002||Viu PL_strxfrm_max_cp|5.025002||Viu PL_strxfrm_NUL_replacement|5.025008||Viu PL_sub_generation|5.005000||Viu PL_subline|5.005000||Viu PL_subname|5.005000||Viu PL_Sv|5.005000||pcV PL_sv_arenaroot|5.005000|5.003007|poVnu PL_sv_consts|5.019002||Viu PL_sv_count|5.005000||Viu PL_sv_immortals|5.027003||Viu PL_sv_no|5.004005|5.003007|p PL_sv_root|5.005000||Viu PL_sv_serial|5.010001||Viu PL_sv_undef|5.004005|5.003007|p PL_sv_yes|5.004005|5.003007|p PL_sv_zero|5.027003|5.027003| PL_sys_intern|5.005000||Viu PL_tainted|5.005000|5.003007|poVnu PL_tainting|5.005000|5.003007|poVnu PL_taint_warn|5.007003||Viu PL_threadhook|5.008000||Viu PL_tmps_floor|5.005000||Viu PL_tmps_ix|5.005000||Viu PL_tmps_max|5.005000||Viu PL_tmps_stack|5.005000||Viu PL_tokenbuf||5.003007|ponu PL_top_env|5.005000||Viu PL_toptarget|5.005000||Viu PL_TR_SPECIAL_HANDLING_UTF8|5.031006||Viu PL_underlying_numeric_obj|5.027009||Viu PL_unicode|5.008001||Viu PL_unitcheckav|5.009005||Viu PL_unitcheckav_save|5.009005||Viu PL_unlockhook|5.007003||Viu PL_unsafe|5.005000||Viu PL_UpperLatin1|5.019005||Viu PLUS|5.003007||Viu PLUS_t8_p8|5.033003||Viu PLUS_t8_pb|5.033003||Viu PLUS_tb_p8|5.033003||Viu PLUS_tb_pb|5.033003||Viu PL_utf8cache|5.009004||Viu PL_utf8_charname_begin|5.017006||Viu PL_utf8_charname_continue|5.017006||Viu PL_utf8_foldclosures|5.013007||Viu PL_utf8_idcont|5.008000||Viu PL_utf8_idstart|5.008000||Viu PL_utf8locale|5.008001||Viu PL_utf8_mark|5.006000||Viu PL_utf8_perl_idcont|5.017008||Viu PL_utf8_perl_idstart|5.015004||Viu PL_utf8_tofold|5.007003||Viu PL_utf8_tolower|5.006000||Viu PL_utf8_tosimplefold|5.027011||Viu PL_utf8_totitle|5.006000||Viu PL_utf8_toupper|5.006000||Viu PL_utf8_xidcont|5.013010||Viu PL_utf8_xidstart|5.013010||Viu PL_vtbl_arylen|5.015000||Viu PL_vtbl_arylen_p|5.015000||Viu PL_vtbl_backref|5.015000||Viu PL_vtbl_bm|5.015000||Viu PL_vtbl_checkcall|5.017000||Viu PL_vtbl_collxfrm|5.015000||Viu PL_vtbl_dbline|5.015000||Viu PL_vtbl_debugvar|5.021005||Viu PL_vtbl_defelem|5.015000||Viu PL_vtbl_env|5.015000||Viu PL_vtbl_envelem|5.015000||Viu PL_vtbl_fm|5.015000||Viu PL_vtbl_hints|5.015000||Viu PL_vtbl_hintselem|5.015000||Viu PL_vtbl_isa|5.015000||Viu PL_vtbl_isaelem|5.015000||Viu PL_vtbl_lvref|5.021005||Viu PL_vtbl_mglob|5.015000||Viu PL_vtbl_nkeys|5.015000||Viu PL_vtbl_nonelem|5.027009||Viu PL_vtbl_ovrld|5.015000||Viu PL_vtbl_pack|5.015000||Viu PL_vtbl_packelem|5.015000||Viu PL_vtbl_pos|5.015000||Viu PL_vtbl_regdata|5.015000||Viu PL_vtbl_regdatum|5.015000||Viu PL_vtbl_regexp|5.015000||Viu PL_vtbl_sig|5.035001||Viu PL_vtbl_sigelem|5.015000||Viu PL_vtbl_substr|5.015000||Viu PL_vtbl_sv|5.015000||Viu PL_vtbl_taint|5.015000||Viu PL_vtbl_utf8|5.015000||Viu PL_vtbl_uvar|5.015000||Viu PL_vtbl_vec|5.015000||Viu PL_warnhook|5.005000||Viu PL_warn_locale|5.021008||Viu PL_watchaddr|5.006000||Viu PL_watchok|5.006000||Viu PL_WB_invlist|5.021009||Viu PL_wcrtomb_ps|5.031010||Viu PL_XPosix_ptrs|5.017008||Viu PL_Xpv|5.005000|5.003007|poVnu PL_xsubfilename|5.021006||Viu pm_description|5.009004||Viu PMf_BASE_SHIFT|5.013004||Viu PMf_CHARSET|5.017011||Viu PMf_CODELIST_PRIVATE|5.017001||Viu PMf_CONST|5.003007||Viu PMf_CONTINUE|5.004000||Viu PMf_EVAL|5.003007||Viu PMf_EXTENDED|5.003007||Viu PMf_EXTENDED_MORE|5.021005||Viu PMf_FOLD|5.003007||Viu PMf_GLOBAL|5.003007||Viu PMf_HAS_CV|5.017001||Viu PMf_HAS_ERROR|5.025010||Viu PMf_IS_QR|5.017001||Viu PMf_KEEP|5.003007||Viu PMf_KEEPCOPY|5.009005||Viu PMf_MULTILINE|5.003007||Viu PMf_NOCAPTURE|5.021008||Viu PMf_NONDESTRUCT|5.013002||Viu PMf_ONCE|5.003007||Viu PMf_RETAINT|5.004005||Viu PMf_SINGLELINE|5.003007||Viu PMf_SPLIT|5.017011||Viu PMf_STRICT|5.021008||Viu PMf_USED|5.009005||Viu PMf_USE_RE_EVAL|5.017001||Viu PMf_WILDCARD|5.031010||Viu PM_GETRE|5.007002||Viu pmop_dump|5.006000|5.006000|u PmopSTASH|5.007001||Viu PmopSTASHPV|5.007001||Viu PmopSTASHPV_set|5.007001||Viu PmopSTASH_set|5.007001||Viu pmruntime|5.003007||Viu PM_SETRE|5.007002||Viu PM_STR|5.027010||Viu pmtrans|5.003007||Viu pMY_CXT|5.009000|5.009000|p _pMY_CXT||5.009000|p pMY_CXT_||5.009000|p PNf|5.021007||Viu PNfARG|5.021007||Viu Poison|5.008000|5.003007|p PoisonFree|5.009004|5.003007|p PoisonNew|5.009004|5.003007|p PoisonPADLIST|5.021006||Viu PoisonWith|5.009004|5.003007|p popen|5.003007||Viu POPi|5.003007|5.003007| POPl|5.003007|5.003007| POPMARK|5.003007||cViu POP_MULTICALL|5.009003|5.009003| POPn|5.006000|5.003007| POPp|5.003007|5.003007| POPpbytex|5.007001|5.007001| POPpconstx|5.009003||Viu POPpx|5.005003|5.005003| POPs|5.003007|5.003007| pop_scope|5.003007|5.003007|u POPSTACK|5.005000||Viu POPSTACK_TO|5.005000||Viu POPu|5.004000|5.004000| POPul|5.006000|5.006000| populate_ANYOF_from_invlist|5.019005||Viu populate_isa|||viu POSIXA|5.017003||Viu POSIXA_t8_p8|5.033003||Viu POSIXA_t8_pb|5.033003||Viu POSIXA_tb_p8|5.033003||Viu POSIXA_tb_pb|5.033003||Viu POSIX_CC_COUNT|5.017008||Viu POSIXD|5.017003||Viu POSIXD_t8_p8|5.033003||Viu POSIXD_t8_pb|5.033003||Viu POSIXD_tb_p8|5.033003||Viu POSIXD_tb_pb|5.033003||Viu POSIXL|5.017003||Viu POSIXL_CLEAR|5.029004||Viu POSIXL_SET|5.029004||Viu POSIXL_t8_p8|5.033003||Viu POSIXL_t8_pb|5.033003||Viu POSIXL_tb_p8|5.033003||Viu POSIXL_tb_pb|5.033003||Viu POSIXL_TEST|5.029004||Viu POSIXL_ZERO|5.029004||Viu POSIXU|5.017003||Viu POSIXU_t8_p8|5.033003||Viu POSIXU_t8_pb|5.033003||Viu POSIXU_tb_p8|5.033003||Viu POSIXU_tb_pb|5.033003||Viu PP|5.003007||Viu pregcomp|5.009005|5.009005| pregexec|5.003007|5.003007| PREGf_ANCH|5.019009||Viu PREGf_ANCH_GPOS|5.019009||Viu PREGf_ANCH_MBOL|5.019009||Viu PREGf_ANCH_SBOL|5.019009||Viu PREGf_CUTGROUP_SEEN|5.009005||Viu PREGf_GPOS_FLOAT|5.019009||Viu PREGf_GPOS_SEEN|5.019009||Viu PREGf_IMPLICIT|5.009005||Viu PREGf_NAUGHTY|5.009005||Viu PREGf_NOSCAN|5.019009||Viu PREGf_RECURSE_SEEN|5.023009||Viu pregfree2|5.011000||cVu pregfree|5.003007|5.003007|u PREGf_SKIP|5.009005||Viu PREGf_USE_RE_EVAL|5.017001||Viu PREGf_VERBARG_SEEN|5.009005||Viu prepare_SV_for_RV|5.010001||Viu prescan_version|5.011004|5.011004| PRESCAN_VERSION|5.019008||Viu PREVOPER|5.003007||Viu PREV_RANGE_MATCHES_INVLIST|5.023002||Viu printbuf|5.009004||Viu print_bytes_for_locale|5.027002||Viu print_collxfrm_input_and_return|5.025004||Viu printf|5.003007||Viu PRINTF_FORMAT_NULL_OK|5.009005|5.009005|Vn printf_nocontext|5.007001|5.007001|vdnu PRIVLIB|5.003007|5.003007|Vn PRIVLIB_EXP|5.003007|5.003007|Vn PRIVSHIFT|5.003007||Viu process_special_blocks|5.009005||Viu PROCSELFEXE_PATH|5.007003|5.007003|Vn PRUNE|5.009005||Viu PRUNE_t8_p8|5.033003||Viu PRUNE_t8_pb|5.033003||Viu PRUNE_tb_p8|5.033003||Viu PRUNE_tb_pb|5.033003||Viu PSEUDO|5.009004||Viu PSEUDO_t8_p8|5.033003||Viu PSEUDO_t8_pb|5.033003||Viu PSEUDO_tb_p8|5.033003||Viu PSEUDO_tb_pb|5.033003||Viu pthread_addr_t|5.005000||Viu PTHREAD_ATFORK|5.007002||Viu pthread_attr_init|5.006000||Viu PTHREAD_ATTR_SETDETACHSTATE|5.006000||Viu pthread_condattr_default|5.005000||Viu PTHREAD_CREATE|5.006000||Viu pthread_create|5.008001||Viu PTHREAD_CREATE_JOINABLE|5.005000||Viu PTHREAD_GETSPECIFIC|5.007002||Viu PTHREAD_GETSPECIFIC_INT|5.006000||Viu pthread_key_create|5.005000||Viu pthread_keycreate|5.008001||Viu pthread_mutexattr_default|5.005000||Viu pthread_mutexattr_init|5.005000||Viu pthread_mutexattr_settype|5.005000||Viu pTHX_12|5.019010||Viu pTHX_1|5.006000||Viu pTHX_2|5.006000||Viu pTHX_3|5.006000||Viu pTHX_4|5.006000||Viu pTHX|5.006000|5.003007|p pTHX_5|5.009003||Viu pTHX_6|5.009003||Viu pTHX_7|5.009003||Viu pTHX_8|5.009003||Viu pTHX_9|5.009003||Viu pTHX_||5.003007|p pTHX__FORMAT|5.009002||Viu pTHX_FORMAT|5.009002||Viu pTHXo|5.006000||Viu pTHX__VALUE|5.009002||Viu pTHX_VALUE|5.009002||Viu pTHXx|5.006000||Viu PTR2IV|5.006000|5.003007|p PTR2nat|5.009003|5.003007|p PTR2NV|5.006000|5.003007|p PTR2ul|5.007001|5.003007|p PTR2UV|5.006000|5.003007|p Ptrdiff_t|5.029003||Viu ptr_hash|5.017010||Vniu PTRSIZE|5.005000|5.005000|Vn ptr_table_clear|5.009005|5.009005|du ptr_table_fetch|5.009005|5.009005|u ptr_table_find|5.009004||Vniu ptr_table_free|5.009005|5.009005|u ptr_table_new|5.009005|5.009005|u ptr_table_split|5.009005|5.009005|u ptr_table_store|5.009005|5.009005|u PTRV|5.006000|5.003007|poVnu PUSHi|5.003007|5.003007| PUSHMARK|5.003007|5.003007| PUSHmortal|5.009002|5.003007|p PUSH_MULTICALL|5.011000|5.011000| PUSH_MULTICALL_FLAGS|5.018000||Viu PUSHn|5.006000|5.003007| PUSHp|5.003007|5.003007| PUSHs|5.003007|5.003007| push_scope|5.003007|5.003007|u PUSHSTACK|5.005000||Viu PUSHSTACKi|5.005000||Viu PUSHSTACK_INIT_HWM|5.027002||Viu PUSHTARG|5.003007||Viu PUSHu|5.004000|5.003007|p PUTBACK|5.003007|5.003007| putc|5.003007||Viu put_charclass_bitmap_innards|5.021004||Viu put_charclass_bitmap_innards_common|5.023008||Viu put_charclass_bitmap_innards_invlist|5.023008||Viu put_code_point|5.021004||Viu putc_unlocked|5.003007||Viu putenv|5.005000||Viu put_range|5.019009||Viu putw|5.003007||Viu pv_display|5.006000|5.003007|p pv_escape|5.009004|5.003007|p pv_pretty|5.009004|5.003007|p pv_uni_display|5.007003|5.007003| pWARN_ALL|5.006000||Viu pWARN_NONE|5.006000||Viu pWARN_STD|5.006000||Viu PWGECOS|5.004005|5.004005|Vn PWPASSWD|5.005000|5.005000|Vn qerror|5.006000||cViu QR_PAT_MODS|5.009005||Viu QUAD_IS_INT|5.006000|5.006000|Vn QUAD_IS___INT64|5.015003|5.015003|Vn QUAD_IS_INT64_T|5.006000|5.006000|Vn QUAD_IS_LONG|5.006000|5.006000|Vn QUAD_IS_LONG_LONG|5.006000|5.006000|Vn QUADKIND|5.006000|5.006000|Vn quadmath_format_needed|5.021004||Vni quadmath_format_valid|5.031007||Vni Quad_t|5.003007|5.003007|Vn QUESTION_MARK_CTRL|5.021001||Viu RADIXCHAR|5.027010||Viu RANDBITS|5.003007|5.003007|Vn RANDOM_R_PROTO|5.008000|5.008000|Vn Rand_seed_t|5.006000|5.006000|Vn RANGE_INDICATOR|5.031006||Viu rck_elide_nothing|5.032001||Viu RD_NODATA|5.003007|5.003007|Vn read|5.005000||Viu readdir|5.005000||Viu readdir64|5.009000||Viu READDIR64_R_PROTO|5.008000|5.008000|Vn READDIR_R_PROTO|5.008000|5.008000|Vn READ_XDIGIT|5.017006|5.017006| realloc|5.007002|5.007002|n ReANY|5.017006||cVnu re_compile|5.009005|5.009005|u RE_COMPILE_RECURSION_INIT|5.029009||Viu RE_COMPILE_RECURSION_LIMIT|5.029009||Viu re_croak|||iu recv|5.006000||Viu recvfrom|5.005000||Viu RE_DEBUG_COMPILE_DUMP|5.009004||Viu RE_DEBUG_COMPILE_FLAGS|5.009005||Viu RE_DEBUG_COMPILE_MASK|5.009004||Viu RE_DEBUG_COMPILE_OPTIMISE|5.009004||Viu RE_DEBUG_COMPILE_PARSE|5.009004||Viu RE_DEBUG_COMPILE_TEST|5.021005||Viu RE_DEBUG_COMPILE_TRIE|5.009004||Viu RE_DEBUG_EXECUTE_INTUIT|5.009004||Viu RE_DEBUG_EXECUTE_MASK|5.009004||Viu RE_DEBUG_EXECUTE_MATCH|5.009004||Viu RE_DEBUG_EXECUTE_TRIE|5.009004||Viu RE_DEBUG_EXTRA_BUFFERS|5.009005||Viu RE_DEBUG_EXTRA_DUMP_PRE_OPTIMIZE|5.031004||Viu RE_DEBUG_EXTRA_GPOS|5.011000||Viu RE_DEBUG_EXTRA_MASK|5.009004||Viu RE_DEBUG_EXTRA_OFFDEBUG|5.009005||Viu RE_DEBUG_EXTRA_OFFSETS|5.009004||Viu RE_DEBUG_EXTRA_OPTIMISE|5.009005||Viu RE_DEBUG_EXTRA_STACK|5.009005||Viu RE_DEBUG_EXTRA_STATE|5.009004||Viu RE_DEBUG_EXTRA_TRIE|5.009004||Viu RE_DEBUG_EXTRA_WILDCARD|5.031011||Viu RE_DEBUG_FLAG|5.009004||Viu RE_DEBUG_FLAGS|5.009002||Viu re_dup_guts|5.011000|5.011000| reentrant_free|5.008000||cVu reentrant_init|5.008000||cVu REENTRANT_PROTO_B_B|5.008000||Viu REENTRANT_PROTO_B_BI|5.008000||Viu REENTRANT_PROTO_B_BW|5.008000||Viu REENTRANT_PROTO_B_CCD|5.008000||Viu REENTRANT_PROTO_B_CCS|5.008000||Viu REENTRANT_PROTO_B_IBI|5.008000||Viu REENTRANT_PROTO_B_IBW|5.008000||Viu REENTRANT_PROTO_B_SB|5.008000||Viu REENTRANT_PROTO_B_SBI|5.008000||Viu REENTRANT_PROTO_I_BI|5.008000||Viu REENTRANT_PROTO_I_BW|5.008000||Viu REENTRANT_PROTO_I_CCSBWR|5.008000||Viu REENTRANT_PROTO_I_CCSD|5.008000||Viu REENTRANT_PROTO_I_CII|5.008000||Viu REENTRANT_PROTO_I_CIISD|5.008000||Viu REENTRANT_PROTO_I_CSBI|5.008000||Viu REENTRANT_PROTO_I_CSBIR|5.008000||Viu REENTRANT_PROTO_I_CSBWR|5.008000||Viu REENTRANT_PROTO_I_CSBWRE|5.008000||Viu REENTRANT_PROTO_I_CSD|5.008000||Viu REENTRANT_PROTO_I_CWISBWRE|5.008000||Viu REENTRANT_PROTO_I_CWISD|5.008000||Viu REENTRANT_PROTO_I_D|5.008000||Viu REENTRANT_PROTO_I_H|5.008000||Viu REENTRANT_PROTO_I_IBI|5.008000||Viu REENTRANT_PROTO_I_IBW|5.008000||Viu REENTRANT_PROTO_I_ICBI|5.008000||Viu REENTRANT_PROTO_I_ICSBWR|5.008000||Viu REENTRANT_PROTO_I_ICSD|5.008000||Viu REENTRANT_PROTO_I_ID|5.008000||Viu REENTRANT_PROTO_I_IISD|5.008000||Viu REENTRANT_PROTO_I_ISBWR|5.008000||Viu REENTRANT_PROTO_I_ISD|5.008000||Viu REENTRANT_PROTO_I_LISBI|5.008000||Viu REENTRANT_PROTO_I_LISD|5.008000||Viu REENTRANT_PROTO_I_SB|5.008000||Viu REENTRANT_PROTO_I_SBI|5.008000||Viu REENTRANT_PROTO_I_SBIE|5.008000||Viu REENTRANT_PROTO_I_SBIH|5.008000||Viu REENTRANT_PROTO_I_SBIR|5.008000||Viu REENTRANT_PROTO_I_SBWR|5.008000||Viu REENTRANT_PROTO_I_SBWRE|5.008000||Viu REENTRANT_PROTO_I_SD|5.008000||Viu REENTRANT_PROTO_I_TISD|5.008000||Viu REENTRANT_PROTO_I_TS|5.008000||Viu REENTRANT_PROTO_I_TSBI|5.008000||Viu REENTRANT_PROTO_I_TSBIR|5.008000||Viu REENTRANT_PROTO_I_TSBWR|5.008000||Viu REENTRANT_PROTO_I_TsISBWRE|5.008001||Viu REENTRANT_PROTO_I_TSR|5.008000||Viu REENTRANT_PROTO_I_UISBWRE|5.008000||Viu REENTRANT_PROTO_I_uISBWRE|5.008001||Viu REENTRANT_PROTO_S_CBI|5.008000||Viu REENTRANT_PROTO_S_CCSBI|5.008000||Viu REENTRANT_PROTO_S_CIISBIE|5.008000||Viu REENTRANT_PROTO_S_CSBI|5.008000||Viu REENTRANT_PROTO_S_CSBIE|5.008000||Viu REENTRANT_PROTO_S_CWISBIE|5.008000||Viu REENTRANT_PROTO_S_CWISBWIE|5.008000||Viu REENTRANT_PROTO_S_ICSBI|5.008000||Viu REENTRANT_PROTO_S_ISBI|5.008000||Viu REENTRANT_PROTO_S_LISBI|5.008000||Viu REENTRANT_PROTO_S_SBI|5.008000||Viu REENTRANT_PROTO_S_SBIE|5.008000||Viu REENTRANT_PROTO_S_SBW|5.008000||Viu REENTRANT_PROTO_S_TISBI|5.008000||Viu REENTRANT_PROTO_S_TS|5.031011||Viu REENTRANT_PROTO_S_TSBI|5.008000||Viu REENTRANT_PROTO_S_TSBIE|5.008000||Viu REENTRANT_PROTO_S_TWISBIE|5.008000||Viu REENTRANT_PROTO_V_D|5.008000||Viu REENTRANT_PROTO_V_H|5.008000||Viu REENTRANT_PROTO_V_ID|5.008000||Viu reentrant_retry|5.008000||vcVnu reentrant_size|5.008000||cVu REENTR_MEMZERO|5.009003||Viu re_exec_indentf|5.023009||vViu REF|5.003007||Viu ref|5.009003||Viu ref_array_or_hash|5.027008||Viu refcounted_he_chain_2hv|5.013007||cVi REFCOUNTED_HE_EXISTS|5.015007||Viu refcounted_he_fetch_pv|5.013007||cVi refcounted_he_fetch_pvn|5.013007||cVi refcounted_he_fetch_pvs|5.013007||Vi refcounted_he_fetch_sv|5.013007||cVi refcounted_he_free|5.013007||cVi refcounted_he_inc|5.013007||cVi REFCOUNTED_HE_KEY_UTF8|5.013007||Viu refcounted_he_new_pv|5.013007||cVi refcounted_he_new_pvn|5.013007||cVi refcounted_he_new_pvs|5.013007||Vi refcounted_he_new_sv|5.013007||cVi refcounted_he_value|5.009004||Viu REFF|5.004001||Viu REFFA|5.013010||Viu REFFAN|5.031001||Viu REFFAN_t8_p8|5.033003||Viu REFFAN_t8_pb|5.033003||Viu REFFAN_tb_p8|5.033003||Viu REFFAN_tb_pb|5.033003||Viu REFFA_t8_p8|5.033003||Viu REFFA_t8_pb|5.033003||Viu REFFA_tb_p8|5.033003||Viu REFFA_tb_pb|5.033003||Viu REFFL|5.004001||Viu REFFLN|5.031001||Viu REFFLN_t8_p8|5.033003||Viu REFFLN_t8_pb|5.033003||Viu REFFLN_tb_p8|5.033003||Viu REFFLN_tb_pb|5.033003||Viu REFFL_t8_p8|5.033003||Viu REFFL_t8_pb|5.033003||Viu REFFL_tb_p8|5.033003||Viu REFFL_tb_pb|5.033003||Viu REFFN|5.031001||Viu REFFN_t8_p8|5.033003||Viu REFFN_t8_pb|5.033003||Viu REFFN_tb_p8|5.033003||Viu REFFN_tb_pb|5.033003||Viu REFF_t8_p8|5.033003||Viu REFF_t8_pb|5.033003||Viu REFF_tb_p8|5.033003||Viu REFF_tb_pb|5.033003||Viu REFFU|5.013008||Viu REFFUN|5.031001||Viu REFFUN_t8_p8|5.033003||Viu REFFUN_t8_pb|5.033003||Viu REFFUN_tb_p8|5.033003||Viu REFFUN_tb_pb|5.033003||Viu REFFU_t8_p8|5.033003||Viu REFFU_t8_pb|5.033003||Viu REFFU_tb_p8|5.033003||Viu REFFU_tb_pb|5.033003||Viu REF_HE_KEY|5.009005||Viu refkids|5.003007||Viu REFN|5.031001||Viu REFN_t8_p8|5.033003||Viu REFN_t8_pb|5.033003||Viu REFN_tb_p8|5.033003||Viu REFN_tb_pb|5.033003||Viu REF_t8_p8|5.033003||Viu REF_t8_pb|5.033003||Viu REF_tb_p8|5.033003||Viu REF_tb_pb|5.033003||Viu refto|5.005000||Viu reg2Lanode|5.021005||Viu reg|5.005000||Viu reganode|5.005000||Viu REG_ANY|5.006000||Viu REG_ANY_t8_p8|5.033003||Viu REG_ANY_t8_pb|5.033003||Viu REG_ANY_tb_p8|5.033003||Viu REG_ANY_tb_pb|5.033003||Viu regatom|5.005000||Viu regbranch|5.005000||Viu reg_check_named_buff_matched|5.009005||Vniu regclass|5.005000||Viu regcppop|5.005000||Viu regcppush|5.005000||Viu regcp_restore|5.025006||Viu regcurly|5.013010||cVniu REG_CUTGROUP_SEEN|5.019009||Viu regdump|5.005000|5.005000|u regdump_extflags|5.009005||Viu regdump_intflags|5.019002||Viu regdupe_internal|5.009005||cVu regexec_flags|5.005000||cVu REGEX_SET|5.031010||Viu regex_set_precedence|5.021010||Vniu REGEX_SET_t8_p8|5.033003||Viu REGEX_SET_t8_pb|5.033003||Viu REGEX_SET_tb_p8|5.033003||Viu REGEX_SET_tb_pb|5.033003||Viu REG_EXTFLAGS_NAME_SIZE|5.020000||Viu regfree_internal|5.009005||cVu REG_GPOS_SEEN|5.019009||Viu reghop3|5.007001||Vniu reghop4|5.009005||Vniu reghopmaybe3|5.007001||Vniu reginclass|5.005000||Viu REG_INFTY|5.004005||Viu reginitcolors|5.006000||cVu reginsert|5.005000||Viu REG_INTFLAGS_NAME_SIZE|5.020000||Viu register|5.003007||Viu REG_LOOKBEHIND_SEEN|5.019009||Viu REG_MAGIC|5.006000||Viu regmatch|5.005000||Viu REGMATCH_STATE_MAX|5.009005||Viu reg_named_buff|5.009005||cViu reg_named_buff_all|5.009005||cVu reg_named_buff_exists|5.009005||cVu reg_named_buff_fetch|5.009005||cVu reg_named_buff_firstkey|5.009005||cVu reg_named_buff_iter|5.009005||cViu reg_named_buff_nextkey|5.009005||cVu reg_named_buff_scalar|5.009005||cVu regnext|5.003007||cVu reg_node|5.005000||Viu regnode_guts|5.021005||Viu REGNODE_MAX|5.009004||Viu REGNODE_SIMPLE|5.013002||Viu REGNODE_VARIES|5.013002||Viu reg_numbered_buff_fetch|5.009005||cViu reg_numbered_buff_length|5.009005||cViu reg_numbered_buff_store|5.009005||cViu regpiece|5.005000||Viu regpnode|5.031010||Viu regprop|5.003007||Viu reg_qr_package|5.009005||cViu REG_RECURSE_SEEN|5.019009||Viu regrepeat|5.005000||Viu REG_RUN_ON_COMMENT_SEEN|5.019009||Viu reg_scan_name|5.009005||Viu reg_skipcomment|5.009005||Vniu regtail|5.005000||Viu regtail_study|5.009004||Viu reg_temp_copy|5.009005||cViu REG_TOP_LEVEL_BRANCHES_SEEN|5.019009||Viu regtry|5.005000||Viu REG_UNBOUNDED_QUANTIFIER_SEEN|5.019009||Viu REG_UNFOLDED_MULTI_SEEN|5.019009||Viu REG_VERBARG_SEEN|5.019009||Viu REG_ZERO_LEN_SEEN|5.019009||Viu re_indentf|5.023009||vViu re_intuit_start|5.006000||cVu re_intuit_string|5.006000||cVu rename|5.005000||Viu Renew|5.003007|5.003007| Renewc|5.003007|5.003007| RENUM|5.005000||Viu RENUM_t8_p8|5.033003||Viu RENUM_t8_pb|5.033003||Viu RENUM_tb_p8|5.033003||Viu RENUM_tb_pb|5.033003||Viu re_op_compile|5.017001||Viu repeatcpy|5.003007|5.003007|nu REPLACEMENT_CHARACTER_UTF8|5.025005|5.003007|p report_evil_fh|5.006001||Viu report_redefined_cv|5.015006||Viu report_uninit|5.006000||cVi report_wrongway_fh|5.013009||Viu re_printf|5.023009||vViu RE_PV_COLOR_DECL|5.009004||Viu RE_PV_QUOTED_DECL|5.009004||Viu require_pv|5.006000|5.006000| require_tie_mod|5.009005||Viu ReREFCNT_dec|5.005000||Viu ReREFCNT_inc|5.005000||Viu RESTORE_ERRNO|5.010001||Vi RESTORE_LC_NUMERIC|5.021010|5.021010|p restore_magic|5.009003||Viu restore_switched_locale|5.027009||Viu RE_SV_DUMPLEN|5.009004||Viu RE_SV_ESCAPE|5.009004||Viu RE_SV_TAIL|5.009004||Viu RETPUSHNO|5.003007||Viu RETPUSHUNDEF|5.003007||Viu RETPUSHYES|5.003007||Viu RE_TRACK_PATTERN_OFFSETS|5.009005||Viu RE_TRIE_MAXBUF_INIT|5.009002||Viu RE_TRIE_MAXBUF_NAME|5.009002||Viu RETSETNO|5.003007||Viu RETSETTARG|5.021009||Viu RETSETUNDEF|5.003007||Viu RETSETYES|5.003007||Viu RETURN|5.003007||Viu RETURNOP|5.003007||Viu RETURNX|5.003007||Viu RETVAL|5.003007|5.003007|V rewind|5.003007||Viu rewinddir|5.005000||Viu REXEC_CHECKED|5.005000||Viu REXEC_COPY_SKIP_POST|5.017004||Viu REXEC_COPY_SKIP_PRE|5.017004||Viu REXEC_COPY_STR|5.005000||Viu REXEC_FAIL_ON_UNDERFLOW|5.019003||Viu REXEC_IGNOREPOS|5.006000||Viu REXEC_NOT_FIRST|5.006000||Viu REXEC_SCREAM|5.006000||Viu rmdir|5.005000||Viu RMS_DIR|5.008001||Viu RMS_FAC|5.008001||Viu RMS_FEX|5.008001||Viu RMS_FNF|5.008001||Viu RMS_IFI|5.008001||Viu RMS_ISI|5.008001||Viu RMS_PRV|5.008001||Viu rninstr|5.003007|5.003007|n ROTL32|5.017010||Viu ROTL64|5.017010||Viu ROTL_UV|5.017010||Viu ROTR32|5.027001||Viu ROTR64|5.027001||Viu ROTR_UV|5.027001||Viu rpeep|5.013005||Viu rsignal|5.004000|5.004000| rsignal_restore|5.004000||Viu rsignal_save|5.004000||Viu rsignal_state|5.004000|5.004000|u RsPARA|5.003007||Viu RsRECORD|5.005000||Viu RsSIMPLE|5.003007||Viu RsSNARF|5.003007||Viu run_body|5.006000||Viu runops_debug|5.005000||cVu RUNOPS_DEFAULT|5.005000||Viu runops_standard|5.005000||cVu run_user_filter|5.009003||Viu rv2cv_op_cv|5.013006|5.013006| RV2CVOPCV_FLAG_MASK|5.021004||Viu RV2CVOPCV_MARK_EARLY|5.013006|5.013006| RV2CVOPCV_MAYBE_NAME_GV|5.021004||Viu RV2CVOPCV_RETURN_NAME_GV|5.013006|5.013006| RV2CVOPCV_RETURN_STUB|5.021004||Viu rvpv_dup|5.007003|5.007003|u RX_ANCHORED_SUBSTR|5.010001||Viu RX_ANCHORED_UTF8|5.010001||Viu RXapif_ALL|5.009005||Viu RXapif_CLEAR|5.009005||Viu RXapif_DELETE|5.009005||Viu RXapif_EXISTS|5.009005||Viu RXapif_FETCH|5.009005||Viu RXapif_FIRSTKEY|5.009005||Viu RXapif_NEXTKEY|5.009005||Viu RXapif_ONE|5.009005||Viu RXapif_REGNAME|5.009005||Viu RXapif_REGNAMES|5.009005||Viu RXapif_REGNAMES_COUNT|5.009005||Viu RXapif_SCALAR|5.009005||Viu RXapif_STORE|5.009005||Viu RX_BUFF_IDX_CARET_FULLMATCH|5.017004||Viu RX_BUFF_IDX_CARET_POSTMATCH|5.017004||Viu RX_BUFF_IDX_CARET_PREMATCH|5.017004||Viu RX_BUFF_IDX_FULLMATCH|5.009005||Viu RX_BUFF_IDX_POSTMATCH|5.009005||Viu RX_BUFF_IDX_PREMATCH|5.009005||Viu RX_CHECK_SUBSTR|5.010001||Viu RX_COMPFLAGS|5.017011||Viu RX_ENGINE|5.010001||Viu RX_EXTFLAGS|5.010001||Viu RXf_BASE_SHIFT|5.013004||Viu RXf_CHECK_ALL|5.009005||Viu RXf_COPY_DONE|5.009005||Viu RXf_EVAL_SEEN|5.009005||Viu RXf_INTUIT_TAIL|5.009005||Viu RXf_IS_ANCHORED|5.019009||Viu RX_FLOAT_SUBSTR|5.010001||Viu RX_FLOAT_UTF8|5.010001||Viu RXf_MATCH_UTF8|5.009005||Viu RXf_NO_INPLACE_SUBST|5.017011||Viu RXf_NULL|5.010000||Viu RXf_PMf_CHARSET|5.013009||Viu RXf_PMf_COMPILETIME|5.009005||Viu RXf_PMf_EXTENDED|5.009005||Viu RXf_PMf_EXTENDED_MORE|5.021005||Viu RXf_PMf_FLAGCOPYMASK|5.017011||Viu RXf_PMf_FOLD|5.009005||Viu RXf_PMf_KEEPCOPY|5.009005||Viu RXf_PMf_MULTILINE|5.009005||Viu RXf_PMf_NOCAPTURE|5.021008||Viu RXf_PMf_SINGLELINE|5.009005||Viu RXf_PMf_SPLIT|5.017011||Viu RXf_PMf_STD_PMMOD|5.009005||Viu RXf_PMf_STD_PMMOD_SHIFT|5.010001||Viu RXf_PMf_STRICT|5.021008||Viu RXf_SKIPWHITE|5.009005||Viu RXf_SPLIT|5.009005||Viu RXf_START_ONLY|5.009005||Viu RXf_TAINTED|5.009005||Viu RXf_TAINTED_SEEN|5.009005||Viu RXf_UNBOUNDED_QUANTIFIER_SEEN|5.019009||Viu RXf_USE_INTUIT|5.009005||Viu RXf_USE_INTUIT_ML|5.009005||Viu RXf_USE_INTUIT_NOML|5.009005||Viu RXf_WHITE|5.009005||Viu RX_GOFS|5.010001||Viu RXi_GET|5.009005||Viu RXi_GET_DECL|5.009005||Viu RX_INTFLAGS|5.019009||Viu RXi_SET|5.009005||Viu RX_ISTAINTED|5.017006||Viu RX_LASTCLOSEPAREN|5.010001||Viu RX_LASTPAREN|5.010001||Viu RX_MATCH_COPIED|5.006000||Viu RX_MATCH_COPIED_off|5.006000||Viu RX_MATCH_COPIED_on|5.006000||Viu RX_MATCH_COPIED_set|5.006000||Viu RX_MATCH_COPY_FREE|5.009000||Viu RX_MATCH_TAINTED|5.005000||Viu RX_MATCH_TAINTED_off|5.005000||Viu RX_MATCH_TAINTED_on|5.005000||Viu RX_MATCH_TAINTED_set|5.005000||Viu RX_MATCH_UTF8|5.008001||Viu RX_MATCH_UTF8_off|5.008001||Viu RX_MATCH_UTF8_on|5.008001||Viu RX_MATCH_UTF8_set|5.008001||Viu RX_MINLEN|5.010001||Viu RX_MINLENRET|5.010001||Viu RX_NPARENS|5.010001||Viu RX_OFFS|5.010001||Viu RXp_COMPFLAGS|5.017011||Viu RXp_ENGINE|5.027003||Viu RXp_EXTFLAGS|5.010001||Viu RXp_GOFS|5.027003||Viu RXp_HAS_CUTGROUP|5.027003||Viu RXp_INTFLAGS|5.019009||Viu RXp_ISTAINTED|5.027003||Viu RXp_MATCH_COPIED|5.010001||Viu RXp_MATCH_COPIED_off|5.010001||Viu RXp_MATCH_COPIED_on|5.010001||Viu RXp_MATCH_COPY_FREE|5.027003||Viu RXp_MATCH_TAINTED|5.010001||Viu RXp_MATCH_TAINTED_off|5.027003||Viu RXp_MATCH_TAINTED_on|5.017008||Viu RXp_MATCH_UTF8|5.010001||Viu RXp_MATCH_UTF8_off|5.027003||Viu RXp_MATCH_UTF8_on|5.027003||Viu RXp_MATCH_UTF8_set|5.027003||Viu RXp_MINLEN|5.027003||Viu RXp_MINLENRET|5.027003||Viu RXp_NPARENS|5.027003||Viu RXp_OFFS|5.027003||Viu RXp_PAREN_NAMES|5.010001||Viu RX_PRECOMP|5.010001||Viu RX_PRECOMP_const|5.010001||Viu RX_PRELEN|5.010001||Viu RXp_SAVED_COPY|5.027003||Viu RXp_SUBBEG|5.027003||Viu RXp_SUBOFFSET|5.027003||Viu RXp_ZERO_LEN|5.027003||Viu RX_REFCNT|5.010001||Viu rxres_free|5.004000||Viu rxres_restore|5.004000||Viu rxres_save|5.004000||Viu RX_SAVED_COPY|5.011000||Viu RX_SUBBEG|5.010001||Viu RX_SUBCOFFSET|5.017004||Viu RX_SUBLEN|5.010001||Viu RX_SUBOFFSET|5.017004||Viu RX_TAINT_on|5.017006||Viu RX_UTF8|5.010001||Viu RX_WRAPLEN|5.010001||Viu RX_WRAPPED|5.010001||Viu RX_WRAPPED_const|5.011000||Viu RX_ZERO_LEN|5.019003||Viu safecalloc|5.003007||Viu Safefree|5.003007|5.003007| safefree|5.003007||Viu safemalloc|5.003007||Viu saferealloc|5.003007||Viu safesyscalloc|5.006000|5.006000|n safesysfree|5.006000|5.006000|n safesysmalloc|5.006000|5.006000|n safesysrealloc|5.006000|5.006000|n SAFE_TRIE_NODENUM|5.009002||Viu same_dirent|5.003007||Viu SANE_ERRSV|5.031003|5.031003| SANY|5.003007||Viu SANY_t8_p8|5.033003||Viu SANY_t8_pb|5.033003||Viu SANY_tb_p8|5.033003||Viu SANY_tb_pb|5.033003||Viu save_adelete|5.011000|5.011000|u SAVEADELETE|5.011000||Viu save_aelem|5.004005|5.004005|u save_aelem_flags|5.011000|5.011000|u save_alloc|5.006000|5.006000|u save_aptr|5.003007|5.003007| save_ary|5.003007|5.003007| SAVEBOOL|5.008001|5.008001| save_bool|5.008001||cVu save_clearsv|5.003007||cVu SAVECLEARSV|5.003007||Vi SAVECOMPILEWARNINGS|5.009004||Viu SAVECOMPPAD|5.006000||Vi SAVECOPFILE|5.006000||Viu SAVECOPFILE_FREE|5.006001||Viu SAVECOPLINE|5.006000||Viu SAVECOPSTASH_FREE|5.006001||Viu SAVE_DEFSV|5.004005|5.003007|p SAVEDELETE|5.003007|5.003007| save_delete|5.003007||cVu save_destructor|5.003007||cVu SAVEDESTRUCTOR|5.006000|5.006000| SAVEDESTRUCTOR_X|5.006000|5.006000| save_destructor_x|5.006000||cVu SAVE_ERRNO|5.010001||Vi SAVEFEATUREBITS|5.031006||Viu SAVEf_KEEPOLDELEM|5.011000||Viu SAVEFREECOPHH|5.013007||Viu SAVEFREEOP|5.010001|5.010001| save_freeop|5.010001||cVu SAVEFREEPADNAME|5.021007||Viu SAVEFREEPV|5.003007|5.003007| save_freepv|5.010001||cVu SAVEFREESV|5.003007|5.003007| save_freesv|5.010001||cVu SAVEf_SETMAGIC|5.011000||Viu SAVEGENERICPV|5.006001||Viu save_generic_pvref|5.006001|5.006001|u SAVEGENERICSV|5.005003||Viu save_generic_svref|5.005003|5.005003|u save_gp|5.004000|5.004000| save_hash|5.003007|5.003007| save_hdelete|5.011000|5.011000|u SAVEHDELETE|5.011000||Viu save_hek_flags|5.008000||Vniu save_helem|5.004005|5.004005|u save_helem_flags|5.011000|5.011000|u SAVEHINTS|5.005000||Viu save_hints|5.010001|5.010001|u save_hptr|5.003007|5.003007| SAVEI16|5.004000|5.004000| save_I16|5.004000||cVu SAVEI32|5.003007|5.003007| save_I32|5.003007||cVu SAVEI8|5.006000|5.006000| save_I8|5.006000||cVu SAVEINT|5.003007|5.003007| save_int|5.003007||cVu save_item|5.003007|5.003007| SAVEIV|5.003007|5.003007| save_iv|5.004000||cVu save_lines|5.005000||Viu save_list|5.003007|5.003007|d SAVELONG|5.003007|5.003007| save_long|5.003007||dcVu save_magic_flags|5.019002||Viu SAVE_MASK|5.013001||Viu SAVEMORTALIZESV|5.007001|5.007001| save_mortalizesv|5.010001||cVu save_nogv|5.003007|5.003007|du SAVEOP|5.005000||Viu save_op|5.010001|5.010001|u save_padsv_and_mortalize|5.010001|5.010001|u SAVEPADSVANDMORTALIZE|5.010001||Viu SAVEPADSV|||i SAVEPARSER|5.009005||Viu SAVEPPTR|5.003007|5.003007| save_pptr|5.003007||cVu save_pushi32ptr|5.010001|5.010001|u save_pushptr|5.010001|5.010001|u save_pushptri32ptr|5.010001||Viu save_pushptrptr|5.010001|5.010001|u savepv|5.003007|5.003007| savepvn|5.003007|5.003007| savepvs|5.009003|5.009003| save_re_context|5.006000||cVu save_scalar|5.003007|5.003007| save_scalar_at|5.005000||Viu save_set_svflags|5.009000|5.009000|u SAVESETSVFLAGS|5.009000||Viu savesharedpv|5.007003|5.007003| SAVESHAREDPV|5.007003||Viu savesharedpvn|5.009005|5.009005| save_shared_pvref|5.007003|5.007003|u savesharedpvs|5.013006|5.013006| savesharedsvpv|5.013006|5.013006| SAVESPTR|5.003007|5.003007| save_sptr|5.003007||cVu savestack_grow|5.003007|5.003007|u savestack_grow_cnt|5.008001|5.008001|u SAVESTACK_POS|5.004000|5.004000| save_strlen|5.019004||cViu savesvpv|5.009002|5.009002| save_svref|5.003007|5.003007| SAVESWITCHSTACK|5.009002||Viu SAVEt_ADELETE|5.011000||Viu SAVEt_AELEM|5.004005||Viu SAVEt_ALLOC|5.006000||Viu SAVEt_APTR|5.003007||Viu SAVEt_AV|5.003007||Viu SAVEt_BOOL|5.008001||Viu SAVEt_CLEARPADRANGE|5.017006||Viu SAVEt_CLEARSV|5.003007||Viu SAVEt_COMPILE_WARNINGS|5.009004||Viu SAVEt_COMPPAD|5.006000||Viu SAVEt_DELETE|5.003007||Viu SAVEt_DESTRUCTOR|5.003007||Viu SAVEt_DESTRUCTOR_X|5.006000||Viu SAVEt_FREECOPHH|5.013007||Viu SAVEt_FREEOP|5.003007||Viu SAVEt_FREEPADNAME|5.021007||Viu SAVEt_FREEPV|5.003007||Viu SAVEt_FREESV|5.003007||Viu SAVEt_GENERIC_PVREF|5.006001||Viu SAVEt_GENERIC_SVREF|5.005003||Viu SAVEt_GP|5.003007||Viu SAVEt_GVSLOT|5.017007||Viu SAVEt_GVSV|5.013005||Viu SAVEt_HELEM|5.004005||Viu SAVEt_HINTS|5.005000||Viu SAVEt_HINTS_HH|5.033001||Viu SAVEt_HPTR|5.003007||Viu SAVEt_HV|5.003007||Viu SAVEt_I16|5.004000||Viu SAVEt_I32|5.003007||Viu SAVEt_I32_SMALL|5.013001||Viu SAVEt_I8|5.006000||Viu SAVE_TIGHT_SHIFT|5.013001||Viu SAVEt_INT|5.003007||Viu SAVEt_INT_SMALL|5.013001||Viu SAVEt_ITEM|5.003007||Viu SAVEt_IV|5.003007||Viu SAVEt_LONG|5.003007||Viu SAVEt_MORTALIZESV|5.007001||Viu SAVETMPS|5.003007|5.003007| savetmps|5.023008|5.023008|xu SAVEt_NSTAB|5.003007||Viu save_to_buffer|5.027004||Vniu SAVEt_OP|5.005000||Viu SAVEt_PADSV_AND_MORTALIZE|5.010001||Viu SAVEt_PARSER|5.009005||Viu SAVEt_PPTR|5.003007||Viu SAVEt_READONLY_OFF|5.019002||Viu SAVEt_REGCONTEXT|5.003007||Viu SAVEt_SAVESWITCHSTACK|5.009002||Viu SAVEt_SET_SVFLAGS|5.009000||Viu SAVEt_SHARED_PVREF|5.007003||Viu SAVEt_SPTR|5.003007||Viu SAVEt_STACK_POS|5.004000||Viu SAVEt_STRLEN|5.019004||Viu SAVEt_STRLEN_SMALL|5.033005||Viu SAVEt_SV|5.003007||Viu SAVEt_SVREF|5.003007||Viu SAVEt_TMPSFLOOR|5.023008||Viu SAVEt_VPTR|5.006000||Viu save_vptr|5.006000|5.006000|u SAVEVPTR|5.006000||Viu SAWAMPERSAND_LEFT|5.017004||Viu SAWAMPERSAND_MIDDLE|5.017004||Viu SAWAMPERSAND_RIGHT|5.017004||Viu sawparens|5.003007||Viu sb_dstr|5.003007||Viu sb_iters|5.003007||Viu sb_m|5.003007||Viu sb_maxiters|5.003007||Viu SBOL|5.003007||Viu SBOL_t8_p8|5.033003||Viu SBOL_t8_pb|5.033003||Viu SBOL_tb_p8|5.033003||Viu SBOL_tb_pb|5.033003||Viu sb_orig|5.003007||Viu SBOX32_CHURN_ROUNDS|5.027001||Viu SBOX32_MAX_LEN|5.027001||Viu SBOX32_MIX3|5.027001||Viu SBOX32_MIX4|5.027001||Viu SBOX32_SCRAMBLE32|5.027001||Viu SBOX32_SKIP_MASK|5.027001||Viu SBOX32_STATE_BITS|5.027001||Viu SBOX32_STATE_BYTES|5.027001||Viu SBOX32_STATE_WORDS|5.027001||Viu SBOX32_STATIC_INLINE|5.027001||Viu SBOX32_WARN2|5.027001||Viu SBOX32_WARN3|5.027001||Viu SBOX32_WARN4|5.027001||Viu SBOX32_WARN5|5.027001||Viu SBOX32_WARN6|5.027001||Viu sb_rflags|5.006000||Viu sb_rx|5.003007||Viu sb_rxres|5.004000||Viu sb_rxtainted|5.004000||Viu sb_s|5.003007||Viu sb_strend|5.003007||Viu sb_targ|5.003007||Viu scalar|5.003007||Viu scalarboolean|5.005000||Viu scalarkids|5.003007||Viu scalar_mod_type|5.006000||Vniu scalarvoid|5.003007||Viu scan_bin|5.006000|5.006000| scan_commit|5.005000||Viu scan_const|5.003007||Viu SCAN_DEF|5.003007||Viu scan_formline|5.003007||Viu scan_heredoc|5.003007||Viu scan_hex|5.006000|5.003007| scan_ident|5.003007||Viu scan_inputsymbol|5.003007||Viu scan_num|5.003007||cVu scan_oct|5.006000|5.003007| scan_pat|5.003007||Viu SCAN_REPL|5.003007||Viu scan_str|5.003007||xcViu scan_subst|5.003007||Viu SCAN_TR|5.003007||Viu scan_trans|5.003007||Viu scan_version|5.009001|5.009001| SCAN_VERSION|5.019008||Viu scan_vstring|5.009005|5.009005|u scan_word|5.003007||xcViu SCHED_YIELD|5.006000|5.006000|Vn SCOPE_SAVES_SIGNAL_MASK|5.007001||Viu search_const|5.010001||Viu seed|5.008001|5.008001|u seedDrand01|5.006000|5.006000| SEEK_CUR|5.003007||Viu seekdir|5.005000||Viu SEEK_END|5.003007||Viu SEEK_SET|5.003007||Viu select|5.005000||Viu Select_fd_set_t|5.003007|5.003007|Vn SELECT_MIN_BITS|5.005003|5.005003|Vn Semctl|5.004005||Viu semun|5.006000||Viu send|5.005000||Viu sendto|5.005000||Viu SEOL|5.003007||Viu SEOL_t8_p8|5.033003||Viu SEOL_t8_pb|5.033003||Viu SEOL_tb_p8|5.033003||Viu SEOL_tb_pb|5.033003||Viu sequence_num|5.009003||Viu set_ANYOF_arg|5.019005||Viu set_ANYOF_SYNTHETIC|5.019009||Viu setbuf|5.003007||Viu set_caret_X|5.019006||Viu set_context|5.006000|5.006000|nu setdefout|5.003007|5.003007| SETERRNO|5.003007||Vi setfd_cloexec|5.027008||Vniu setfd_cloexec_for_nonsysfd|5.027008||Viu setfd_cloexec_or_inhexec_by_sysfdness|5.027008||Viu setfd_inhexec|5.027008||Vniu setfd_inhexec_for_sysfd|5.027008||Viu setgid|5.005000||Viu setgrent|5.009000||Viu SETGRENT_R_HAS_FPTR|5.008000||Viu SETGRENT_R_PROTO|5.008000|5.008000|Vn sethostent|5.005000||Viu SETHOSTENT_R_PROTO|5.008000|5.008000|Vn SETi|5.003007||Viu setjmp|5.005000||Viu setlinebuf|5.005000||Viu setlocale|5.009000||Viu setlocale_debug_string|5.027002||Vniu SETLOCALE_LOCK|5.033005||Viu SETLOCALE_R_PROTO|5.008000|5.008000|Vn SETLOCALE_UNLOCK|5.033005||Viu SET_MARK_OFFSET|5.006000||Viu setmode|5.005000||Viu SETn|5.003007||Viu setnetent|5.005000||Viu SETNETENT_R_PROTO|5.008000|5.008000|Vn set_numeric_radix|5.006000||Viu SET_NUMERIC_STANDARD|5.004000||Viu set_numeric_standard|5.006000||cViu SET_NUMERIC_UNDERLYING|5.021010||Viu set_numeric_underlying|5.027006||cViu SETp|5.003007||Viu set_padlist|5.021006||cVniu setprotoent|5.005000||Viu SETPROTOENT_R_PROTO|5.008000|5.008000|Vn setpwent|5.009000||Viu SETPWENT_R_HAS_FPTR|5.008000||Viu SETPWENT_R_PROTO|5.008000|5.008000|Vn set_regex_pv|5.029004||Viu setregid|5.003007||Viu setreuid|5.003007||Viu SETs|5.003007||Viu setservent|5.005000||Viu SETSERVENT_R_PROTO|5.008000|5.008000|Vn setsockopt|5.005000||Viu setSTR_LEN|5.031005||Viu SET_SVANY_FOR_BODYLESS_IV|5.023008||Viu SET_SVANY_FOR_BODYLESS_NV|5.023008||Viu SETTARG|5.003007||Viu SET_THR|5.005000||Viu SET_THREAD_SELF|5.005003||Viu SETu|5.004000||Viu setuid|5.005000||Viu _setup_canned_invlist|5.019008||cViu setvbuf|5.003007||Viu share_hek|5.004000|5.004000|u share_hek_flags|5.008000||Viu share_hek_hek|5.009003||Viu sharepvn|5.005000||Viu SHARP_S_SKIP|5.007003||Viu Shmat_t|5.003007|5.003007|Vn SHORTSIZE|5.004000|5.004000|Vn should_warn_nl|5.021001||Vniu should_we_output_Debug_r|5.031011||Viu SH_PATH|5.003007|5.003007|Vn shutdown|5.005000||Viu si_dup|5.007003|5.007003|u S_IEXEC|5.006000||Viu S_IFIFO|5.011000||Viu S_IFMT|5.003007||Viu SIGABRT|5.003007||Viu sighandler1|5.031007||Vniu sighandler3|5.031007||Vniu sighandler|5.003007||Vniu SIGILL|5.003007||Viu Sigjmp_buf|5.003007|5.003007|Vn Siglongjmp|5.003007|5.003007| signal|5.005000||Viu Signal_t|5.003007|5.003007|Vn SIG_NAME|5.003007|5.003007|Vn SIG_NUM|5.003007|5.003007|Vn Sigsetjmp|5.003007|5.003007| SIG_SIZE|5.007001|5.007001|Vn simplify_sort|5.006000||Viu SINGLE_PAT_MOD|5.009005||Viu SIPHASH_SEED_STATE|5.027001||Viu SIPROUND|5.017006||Viu S_IREAD|5.006000||Viu S_IRGRP|5.003007||Viu S_IROTH|5.003007||Viu S_IRUSR|5.003007||Viu S_IRWXG|5.006000||Viu S_IRWXO|5.006000||Viu S_IRWXU|5.006000||Viu S_ISBLK|5.003007||Viu S_ISCHR|5.003007||Viu S_ISDIR|5.003007||Viu S_ISFIFO|5.003007||Viu S_ISGID|5.003007||Viu S_ISLNK|5.003007||Viu S_ISREG|5.003007||Viu S_ISSOCK|5.003007||Viu S_ISUID|5.003007||Viu SITEARCH|5.003007|5.003007|Vn SITEARCH_EXP|5.003007|5.003007|Vn SITELIB|5.003007|5.003007|Vn SITELIB_EXP|5.003007|5.003007|Vn SITELIB_STEM|5.006000|5.006000|Vn S_IWGRP|5.003007||Viu S_IWOTH|5.003007||Viu S_IWRITE|5.006000||Viu S_IWUSR|5.003007||Viu S_IXGRP|5.003007||Viu S_IXOTH|5.003007||Viu S_IXUSR|5.003007||Viu SIZE_ALIGN|5.005000||Viu Size_t|5.003007|5.003007|Vn Size_t_MAX|5.021003||Viu Size_t_size|5.006000|5.006000|Vn SKIP|5.009005||Viu SKIP_next|5.009005||Viu SKIP_next_fail|5.009005||Viu SKIP_next_fail_t8_p8|5.033003||Viu SKIP_next_fail_t8_pb|5.033003||Viu SKIP_next_fail_tb_p8|5.033003||Viu SKIP_next_fail_tb_pb|5.033003||Viu SKIP_next_t8_p8|5.033003||Viu SKIP_next_t8_pb|5.033003||Viu SKIP_next_tb_p8|5.033003||Viu SKIP_next_tb_pb|5.033003||Viu skipspace_flags|5.019002||xcViu SKIP_t8_p8|5.033003||Viu SKIP_t8_pb|5.033003||Viu SKIP_tb_p8|5.033003||Viu SKIP_tb_pb|5.033003||Viu skip_to_be_ignored_text|5.023004||Viu Slab_Alloc|5.006000||cViu Slab_Free|5.007003||cViu Slab_to_ro|5.017002||Viu Slab_to_rw|5.009005||Viu sleep|5.005000||Viu SLOPPYDIVIDE|5.003007||Viu socket|5.005000||Viu SOCKET_OPEN_MODE|5.008002||Viu socketpair|5.005000||Viu Sock_size_t|5.006000|5.006000|Vn softref2xv|||iu sortcv|5.009003||Viu sortcv_stacked|5.009003||Viu sortcv_xsub|5.009003||Viu sortsv|5.007003|5.007003| sortsv_flags|5.009003|5.009003| sortsv_flags_impl|5.031011||Viu SP|5.003007|5.003007| space_join_names_mortal|5.009004||Viu SPAGAIN|5.003007|5.003007| S_PAT_MODS|5.009005||Viu specialWARN|5.006000||Viu SRAND48_R_PROTO|5.008000|5.008000|Vn SRANDOM_R_PROTO|5.008000|5.008000|Vn SRCLOSE|5.027008||Viu SRCLOSE_t8_p8|5.033003||Viu SRCLOSE_t8_pb|5.033003||Viu SRCLOSE_tb_p8|5.033003||Viu SRCLOSE_tb_pb|5.033003||Viu SROPEN|5.027008||Viu SROPEN_t8_p8|5.033003||Viu SROPEN_t8_pb|5.033003||Viu SROPEN_tb_p8|5.033003||Viu SROPEN_tb_pb|5.033003||Viu SS_ACCVIO|5.008001||Viu SS_ADD_BOOL|5.017007||Viu SS_ADD_DPTR|5.017007||Viu SS_ADD_DXPTR|5.017007||Viu SS_ADD_END|5.017007||Viu SS_ADD_INT|5.017007||Viu SS_ADD_IV|5.017007||Viu SS_ADD_LONG|5.017007||Viu SS_ADD_PTR|5.017007||Viu SS_ADD_UV|5.017007||Viu SS_BUFFEROVF|5.021009||Viu ssc_add_range|5.019005||Viu ssc_and|5.019005||Viu ssc_anything|5.019005||Viu ssc_clear_locale|5.019005||Vniu ssc_cp_and|5.019005||Viu ssc_finalize|5.019005||Viu SSCHECK|5.003007||Viu ssc_init|5.019005||Viu ssc_intersection|5.019005||Viu ssc_is_anything|5.019005||Vniu ssc_is_cp_posixl_init|5.019005||Vniu SSC_MATCHES_EMPTY_STRING|5.021004||Viu ssc_or|5.019005||Viu ssc_union|5.019005||Viu SS_DEVOFFLINE|5.008001||Viu ss_dup|5.007003|5.007003|u SSGROW|5.008001||Viu SS_IVCHAN|5.008001||Viu SSize_t|5.003007|5.003007|Vn SSize_t_MAX|5.019004||Viu SS_MAXPUSH|5.017007||Viu SSNEW|5.006000||Viu SSNEWa|5.006000||Viu SSNEWat|5.007001||Viu SSNEWt|5.007001||Viu SS_NOPRIV|5.021001||Viu SS_NORMAL|5.008001||Viu SSPOPBOOL|5.008001||Viu SSPOPDPTR|5.003007||Viu SSPOPDXPTR|5.006000||Viu SSPOPINT|5.003007||Viu SSPOPIV|5.003007||Viu SSPOPLONG|5.003007||Viu SSPOPPTR|5.003007||Viu SSPOPUV|5.013001||Viu SSPTR|5.006000||Viu SSPTRt|5.007001||Viu SSPUSHBOOL|5.008001||Viu SSPUSHDPTR|5.003007||Viu SSPUSHDXPTR|5.006000||Viu SSPUSHINT|5.003007||Viu SSPUSHIV|5.003007||Viu SSPUSHLONG|5.003007||Viu SSPUSHPTR|5.003007||Viu SSPUSHUV|5.013001||Viu ST|5.003007|5.003007| stack_grow|5.003007||cVu STANDARD_C|5.003007||Viu STAR|5.003007||Viu STAR_t8_p8|5.033003||Viu STAR_t8_pb|5.033003||Viu STAR_tb_p8|5.033003||Viu STAR_tb_pb|5.033003||Viu START_EXTERN_C|5.005000|5.003007|pV start_glob|||xi START_MY_CXT|5.010000|5.010000|p STARTPERL|5.003007|5.003007|Vn start_subparse|5.004000|5.003007|pu StashHANDLER|5.007001||Viu Stat|5.003007||Viu stat|5.005000||Viu STATIC|5.005000||Viu STATIC_ASSERT_1|5.021007||Viu STATIC_ASSERT_2|5.021007||Viu STATIC_ASSERT_DECL|5.027001||Viu STATIC_ASSERT_STMT|5.021007||Viu Stat_t|5.004005||Viu STATUS_ALL_FAILURE|5.004000||Viu STATUS_ALL_SUCCESS|5.004000||Viu STATUS_CURRENT|5.004000||Viu STATUS_EXIT|5.009003||Viu STATUS_EXIT_SET|5.009003||Viu STATUS_NATIVE|5.004000||Viu STATUS_NATIVE_CHILD_SET|5.009003||Viu STATUS_UNIX|5.009003||Viu STATUS_UNIX_EXIT_SET|5.009003||Viu STATUS_UNIX_SET|5.009003||Viu STDCHAR|5.003007|5.003007|Vn stderr|5.003007||Viu stdin|5.003007||Viu STDIO_PTR_LVAL_SETS_CNT|5.007001|5.007001|Vn STDIO_PTR_LVALUE|5.006000|5.006000|Vn STDIO_STREAM_ARRAY|5.006000|5.006000|Vn stdize_locale|5.007001||Viu stdout|5.003007||Viu stdoutf|5.005000||Viu STD_PAT_MODS|5.009005||Viu STD_PMMOD_FLAGS_CLEAR|5.013006||Viu ST_INO_SIGN|5.015002|5.015002|Vn ST_INO_SIZE|5.015002|5.015002|Vn STMT_END|5.003007|5.003007|pV STMT_START|5.003007|5.003007|pV STOREFEATUREBITSHH|5.031006||Viu STORE_LC_NUMERIC_FORCE_TO_UNDERLYING|5.021010|5.021010| STORE_LC_NUMERIC_SET_STANDARD|5.027009||pVu STORE_LC_NUMERIC_SET_TO_NEEDED|5.021010|5.021010| STORE_LC_NUMERIC_SET_TO_NEEDED_IN|5.031003|5.031003| STORE_NUMERIC_SET_STANDARD|||piu strBEGINs|5.027006||Viu strEQ|5.003007|5.003007| Strerror|5.003007||Viu strerror|5.009000||Viu STRERROR_R_PROTO|5.008000|5.008000|Vn strGE|5.003007|5.003007| strGT|5.003007|5.003007| STRING|5.006000||Viu STRINGIFY|5.003007|5.003007|Vn STRINGl|5.031005||Viu STRINGs|5.031005||Viu strip_return|5.009003||Viu strLE|5.003007|5.003007| STR_LEN|5.006000||Viu STRLEN|5.027001||Viu STR_LENl|5.031005||Viu STR_LENs|5.031005||Viu strLT|5.003007|5.003007| strNE|5.003007|5.003007| strnEQ|5.003007|5.003007| strnNE|5.003007|5.003007| STR_SZ|5.006000||Viu Strtod|5.029010|5.029010|n Strtol|5.006000|5.006000|n strtoll|5.006000||Viu Strtoul|5.006000|5.006000|n strtoull|5.006000||Viu str_to_version|5.006000||cVu StructCopy|5.003007|5.003007|V STRUCT_OFFSET|5.004000||Viu STRUCT_SV|5.007001||Viu STR_WITH_LEN|5.009003|5.003007|pV study_chunk|5.005000||Viu sub_crush_depth|5.004000||Viu sublex_done|5.005000||Viu sublex_push|5.005000||Viu sublex_start|5.005000||Viu SUBST_TAINT_BOOLRET|5.013010||Viu SUBST_TAINT_PAT|5.013010||Viu SUBST_TAINT_REPL|5.013010||Viu SUBST_TAINT_RETAINT|5.013010||Viu SUBST_TAINT_STR|5.013010||Viu SUBVERSION|5.003007||Viu SUCCEED|5.003007||Viu SUCCEED_t8_p8|5.033003||Viu SUCCEED_t8_pb|5.033003||Viu SUCCEED_tb_p8|5.033003||Viu SUCCEED_tb_pb|5.033003||Viu SUSPEND|5.005000||Viu SUSPEND_t8_p8|5.033003||Viu SUSPEND_t8_pb|5.033003||Viu SUSPEND_tb_p8|5.033003||Viu SUSPEND_tb_pb|5.033003||Viu sv_2bool|5.013006||cV sv_2bool_flags|5.013006||cV sv_2bool_nomg|5.017002||Viu sv_2cv|5.003007|5.003007| sv_2io|5.003007|5.003007| sv_2iuv_common|5.009004||Viu sv_2iuv_non_preserve|5.007001||Viu sv_2iv|5.009001||cVu sv_2iv_flags|5.009001|5.009001| sv_2mortal|5.003007|5.003007| sv_2num|5.010000||xVi sv_2nv|5.013001||Viu sv_2nv_flags|5.013001|5.013001| sv_2pv|5.005000||cVu sv_2pvbyte|5.006000|5.003007|p sv_2pvbyte_flags|5.031004|5.031004|u sv_2pvbyte_nolen|5.009003||pcV sv_2pv_flags|5.007002||pcV sv_2pv_nolen|5.009003||pcV sv_2pv_nomg|5.007002||Viu sv_2pvutf8|5.006000|5.006000| sv_2pvutf8_flags|5.031004|5.031004|u sv_2pvutf8_nolen|5.009003||cV sv_2uv|5.009001||pcVu sv_2uv_flags|5.009001|5.009001| sv_add_arena|5.003007||Vi sv_add_backref|||iu SvAMAGIC|5.003007||Viu SvAMAGIC_off|5.031004|5.031004|nu SvAMAGIC_on|5.031004|5.031004|nu SvANY|5.003007||Viu sv_backoff|5.003007|5.003007|n sv_bless|5.003007|5.003007| sv_buf_to_ro|5.019008||Viu sv_buf_to_rw|5.019008||Viu SvCANCOW|5.017007||Viu SvCANEXISTDELETE|5.011000||Viu SV_CATBYTES|5.021005|5.021005| sv_cat_decode|5.008001|5.008001| sv_cathek|5.021004||Viu sv_catpv|5.003007|5.003007| sv_catpvf|5.006000|5.004000|v sv_catpv_flags|5.013006|5.013006| sv_catpvf_mg|5.006000|5.004000|pv sv_catpvf_mg_nocontext|5.006000||pvVn sv_catpvf_nocontext|5.006000||vVn sv_catpv_mg|5.004005|5.003007|p sv_catpvn|5.003007|5.003007| sv_catpvn_flags|5.007002|5.007002| sv_catpvn_mg|5.004005|5.003007|p sv_catpvn_nomg|5.007002|5.003007|p sv_catpvn_nomg_maybeutf8|5.017005||Viu sv_catpvn_nomg_utf8_upgrade|5.017002||Viu sv_catpv_nomg|5.013006|5.013006| sv_catpvs|5.009003|5.003007|p sv_catpvs_flags|5.013006|5.013006| sv_catpvs_mg|5.013006|5.013006| sv_catpvs_nomg|5.013006|5.013006| sv_catsv|5.003007|5.003007| sv_catsv_flags|5.007002|5.007002| sv_catsv_mg|5.004005|5.003007|p sv_catsv_nomg|5.007002|5.003007|p SV_CATUTF8|5.021005|5.021005| sv_catxmlpvs|5.013006||Viu SV_CHECK_THINKFIRST|5.008001||Viu SV_CHECK_THINKFIRST_COW_DROP|5.009000||Viu sv_chop|5.003007|5.003007| sv_clean_all|5.003007||Vi sv_clean_objs|5.003007||Vi sv_clear|5.003007|5.003007| sv_cmp|5.003007|5.003007| sv_cmp_flags|5.013006|5.013006| sv_cmp_locale|5.004000|5.004000| sv_cmp_locale_flags|5.013006|5.013006| sv_collxfrm|5.013006||V sv_collxfrm_flags|5.013006|5.013006| SvCOMPILED|5.003007||Viu SvCOMPILED_off|5.003007||Viu SvCOMPILED_on|5.003007||Viu SV_CONST|5.019002||Viu SV_CONST_BINMODE|5.019002||Viu SV_CONST_CLEAR|5.019002||Viu SV_CONST_CLOSE|5.019002||Viu SV_CONST_DELETE|5.019002||Viu SV_CONST_DESTROY|5.019002||Viu SV_CONST_EOF|5.019002||Viu SV_CONST_EXISTS|5.019002||Viu SV_CONST_EXTEND|5.019002||Viu SV_CONST_FETCH|5.019002||Viu SV_CONST_FETCHSIZE|5.019002||Viu SV_CONST_FILENO|5.019002||Viu SV_CONST_FIRSTKEY|5.019002||Viu SV_CONST_GETC|5.019002||Viu SV_CONST_NEXTKEY|5.019002||Viu SV_CONST_OPEN|5.019002||Viu SV_CONST_POP|5.019002||Viu SV_CONST_PRINT|5.019002||Viu SV_CONST_PRINTF|5.019002||Viu SV_CONST_PUSH|5.019002||Viu SV_CONST_READ|5.019002||Viu SV_CONST_READLINE|5.019002||Viu SV_CONST_RETURN|5.009003|5.003007|poVnu SV_CONST_SCALAR|5.019002||Viu SV_CONSTS_COUNT|5.019002||Viu SV_CONST_SEEK|5.019002||Viu SV_CONST_SHIFT|5.019002||Viu SV_CONST_SPLICE|5.019002||Viu SV_CONST_STORE|5.019002||Viu SV_CONST_STORESIZE|5.019002||Viu SV_CONST_TELL|5.019002||Viu SV_CONST_TIEARRAY|5.019002||Viu SV_CONST_TIEHANDLE|5.019002||Viu SV_CONST_TIEHASH|5.019002||Viu SV_CONST_TIESCALAR|5.019002||Viu SV_CONST_UNSHIFT|5.019002||Viu SV_CONST_UNTIE|5.019002||Viu SV_CONST_WRITE|5.019002||Viu sv_copypv|5.007003|5.007003| sv_copypv_flags|5.017002|5.017002| sv_copypv_nomg|5.017002|5.017002| SV_COW_DROP_PV|5.008001|5.003007|p SV_COW_OTHER_PVS|5.009005||Viu SV_COW_REFCNT_MAX|5.017007||Viu SV_COW_SHARED_HASH_KEYS|5.009005|5.003007|poVnu SvCUR|5.003007|5.003007| SvCUR_set|5.003007|5.003007| sv_dec|5.003007|5.003007| sv_dec_nomg|5.013002|5.013002| sv_del_backref|5.006000||cViu sv_derived_from|5.004000|5.004000| sv_derived_from_pv|5.015004|5.015004| sv_derived_from_pvn|5.015004|5.015004| sv_derived_from_sv|5.015004|5.015004| sv_derived_from_svpvn|5.031006||Viu sv_destroyable|5.010000|5.010000| SvDESTROYABLE|5.010000||Viu sv_display|5.021002||Viu SV_DO_COW_SVSETSV|5.009005||Viu sv_does|5.009004|5.009004| sv_does_pv|5.015004|5.015004| sv_does_pvn|5.015004|5.015004| sv_does_sv|5.015004|5.015004| sv_dump|5.003007|5.003007| sv_dup|5.007003|5.007003|u sv_dup_common|5.013002||Viu sv_dup_inc|5.013002|5.013002|u sv_dup_inc_multiple|5.011000||Viu SvEND|5.003007|5.003007| SvEND_set|5.003007||Viu SvENDx|5.003007||Viu sv_eq|5.003007|5.003007| sv_eq_flags|5.013006|5.013006| sv_exp_grow|5.009003||Viu SVf256|5.008001||Viu SVf32|5.009002||Viu SVf|5.006000|5.003007|p SvFAKE|5.003007||Viu SvFAKE_off|5.003007||Viu SvFAKE_on|5.003007||Viu SVf_AMAGIC|5.003007||Viu SVfARG|5.009005|5.003007|p SVf_BREAK|5.003007||Viu SVf_FAKE|5.003007||Viu SVf_IOK|5.003007||Viu SVf_IsCOW|5.017006||Viu SVf_IVisUV|5.006000||Viu SvFLAGS|5.003007||Viu SVf_NOK|5.003007||Viu SVf_OK|5.003007||Viu SVf_OOK|5.003007||Viu sv_force_normal|5.006000|5.006000| sv_force_normal_flags|5.007001|5.007001| SV_FORCE_UTF8_UPGRADE|5.011000|5.011000| SVf_POK|5.003007||Viu SVf_PROTECT|5.021005||Viu SVf_READONLY|5.003007||Viu sv_free2|||xciu sv_free|5.003007|5.003007| sv_free_arenas|5.003007||Vi SVf_ROK|5.003007||Viu SVf_THINKFIRST|5.003007||Viu SVf_UTF8|5.006000|5.003007|p SvGAMAGIC|5.006001|5.006001| sv_get_backrefs|5.021008|5.021008|xn SvGETMAGIC|5.004005|5.003007|p sv_gets|5.003007|5.003007| SvGID|5.019001||Viu SV_GMAGIC|5.007002|5.003007|p SvGMAGICAL|5.003007||Viu SvGMAGICAL_off|5.003007||Viu SvGMAGICAL_on|5.003007||Viu SvGROW|5.003007|5.003007| sv_grow|5.003007||cV Sv_Grow|5.003007||Viu SvGROW_mutable|5.009003||Viu SV_HAS_TRAILING_NUL|5.009004|5.003007|p SV_IMMEDIATE_UNREF|5.007001|5.003007|p SvIMMORTAL|5.004000||Viu SvIMMORTAL_INTERP|5.027003||Viu SvIMMORTAL_TRUE|5.027003||Viu sv_inc|5.003007|5.003007| sv_i_ncmp|5.009003||Viu sv_i_ncmp_desc|5.031011||Viu sv_inc_nomg|5.013002|5.013002| sv_insert|5.003007|5.003007| sv_insert_flags|5.010001|5.010001| SvIOK|5.003007|5.003007| SvIOK_nog|5.017002||Viu SvIOK_nogthink|5.017002||Viu SvIOK_notUV|5.006000|5.006000| SvIOK_off|5.003007|5.003007| SvIOK_on|5.003007|5.003007| SvIOK_only|5.003007|5.003007| SvIOK_only_UV|5.006000|5.006000| SvIOKp|5.003007|5.003007| SvIOKp_on|5.003007||Viu SvIOK_UV|5.006000|5.006000| sv_isa|5.003007|5.003007| sv_isa_sv|5.031007|5.031007|x SvIsCOW|5.008003|5.008003| SvIsCOW_shared_hash|5.008003|5.008003| SvIS_FREED|5.009003||Viu sv_isobject|5.003007|5.003007| SvIV|5.003007|5.003007| sv_iv|5.005000||dcV SvIV_nomg|5.009001|5.003007|p SvIV_please|5.007001||Viu SvIV_please_nomg|5.013002||Viu SvIV_set|5.003007|5.003007| SvIVX|5.003007|5.003007| SvIVx|5.003007|5.003007| SvIVXx|5.003007||Viu sv_kill_backrefs|||xiu sv_len|5.003007|5.003007| SvLEN|5.003007|5.003007| SvLEN_set|5.003007|5.003007| sv_len_utf8|5.006000|5.006000|p sv_len_utf8_nomg|5.017004||pViu SvLENx|5.003007||Viu SvLOCK|5.007003|5.007003| sv_magic|5.003007|5.003007| SvMAGIC|5.003007||Viu SvMAGICAL|5.003007||Viu SvMAGICAL_off|5.003007||Viu SvMAGICAL_on|5.003007||Viu sv_magicext|5.007003|5.007003| sv_magicext_mglob|5.019002||cViu sv_magic_portable||5.004000|pou SvMAGIC_set|5.009003|5.003007|p sv_mortalcopy|5.003007|5.003007| sv_mortalcopy_flags|5.017005|5.003007|p SV_MUTABLE_RETURN|5.009003|5.003007|poVnu sv_ncmp|5.009003||Viu sv_ncmp_desc|5.031011||Viu sv_newmortal|5.003007|5.003007| sv_newref|5.003007||cV SvNIOK|5.003007|5.003007| SvNIOK_nog|5.017002||Viu SvNIOK_nogthink|5.017002||Viu SvNIOK_off|5.003007|5.003007| SvNIOKp|5.003007|5.003007| SvNOK|5.003007|5.003007| SvNOK_nog|5.017002||Viu SvNOK_nogthink|5.017002||Viu SvNOK_off|5.003007|5.003007| SvNOK_on|5.003007|5.003007| SvNOK_only|5.003007|5.003007| SvNOKp|5.003007|5.003007| SvNOKp_on|5.003007||Viu sv_nolocking|5.007003|5.007003|d sv_nosharing|5.007003|5.007003| SV_NOSTEAL|5.009002|5.003007|p sv_nounlocking|5.007003|5.007003|d sv_nv|5.005000||dcV SvNV|5.006000|5.003007| SvNV_nomg|5.013002|5.003007|p SvNV_set|5.006000|5.003007| SvNVX|5.006000|5.003007| SvNVx|5.006000|5.003007| SvNVXx|5.003007||Viu SvOBJECT|5.003007||Viu SvOBJECT_off|5.003007||Viu SvOBJECT_on|5.003007||Viu SvOK|5.003007|5.003007| SvOK_off|5.003007||Viu SvOK_off_exc_UV|5.006000||Viu SvOKp|5.003007||Viu sv_only_taint_gmagic|5.021010||Vniu SvOOK|5.003007|5.003007| SvOOK_off|5.003007|5.003007| SvOOK_offset|5.011000|5.011000| SvOOK_on|5.003007||Viu sv_or_pv_len_utf8|5.017005||Viu sv_or_pv_pos_u2b|5.019004||Viu SvOURSTASH|5.009005||Viu SvOURSTASH_set|5.009005||Viu SvPADMY|5.003007||Viu SvPADMY_on|5.003007||Viu SVpad_OUR|5.006000||Viu SvPAD_OUR|5.009004||Viu SvPAD_OUR_on|5.009004||Viu SvPADSTALE|5.009000||Viu SvPADSTALE_off|5.009000||Viu SvPADSTALE_on|5.009000||Viu SVpad_STATE|5.009004||Viu SvPAD_STATE|5.009004||Viu SvPAD_STATE_on|5.009004||Viu SvPADTMP|5.003007||Viu SvPADTMP_off|5.003007||Viu SvPADTMP_on|5.003007||Viu SVpad_TYPED|5.007002||Viu SvPAD_TYPED|5.009004||Viu SvPAD_TYPED_on|5.009004||Viu SVpav_REAL|5.009003||Viu SVpav_REIFY|5.009003||Viu SvPCS_IMPORTED|5.009005||Viu SvPCS_IMPORTED_off|5.009005||Viu SvPCS_IMPORTED_on|5.009005||Viu SvPEEK|5.003007||Viu sv_peek|5.005000|5.005000|u SVpgv_GP|5.009005||Viu SVphv_CLONEABLE|5.009003||Viu SVphv_HASKFLAGS|5.008000||Viu SVphv_LAZYDEL|5.003007||Viu SVphv_SHAREKEYS|5.003007||Viu SVp_IOK|5.003007||Viu SVp_NOK|5.003007||Viu SvPOK|5.003007|5.003007| SvPOK_byte_nog|5.017002||Viu SvPOK_byte_nogthink|5.017002||Viu SvPOK_byte_pure_nogthink|5.017003||Viu SvPOK_nog|5.017002||Viu SvPOK_nogthink|5.017002||Viu SvPOK_off|5.003007|5.003007| SvPOK_on|5.003007|5.003007| SvPOK_only|5.003007|5.003007| SvPOK_only_UTF8|5.006000|5.006000| SvPOKp|5.003007|5.003007| SvPOKp_on|5.003007||Viu SvPOK_pure_nogthink|5.017003||Viu SvPOK_utf8_nog|5.017002||Viu SvPOK_utf8_nogthink|5.017002||Viu SvPOK_utf8_pure_nogthink|5.017003||Viu sv_pos_b2u|5.006000|5.006000| sv_pos_b2u_flags|5.019003|5.019003| sv_pos_b2u_midway|5.009004||Viu sv_pos_u2b|5.006000|5.006000| sv_pos_u2b_cached|5.009004||Viu sv_pos_u2b_flags|5.011005|5.011005| sv_pos_u2b_forwards|5.009004||Vniu sv_pos_u2b_midway|5.009004||Vniu SVp_POK|5.003007||Viu SVprv_PCS_IMPORTED|5.009005||Viu SVprv_WEAKREF|5.006000||Viu SVp_SCREAM|5.003007||Viu SvPV|5.003007|5.003007| sv_pv|5.008000||cV SvPVbyte|5.006000|5.003007|p sv_pvbyte|5.008000||cV SvPVbyte_force|5.009002|5.009002| sv_pvbyten|5.006000||dcV sv_pvbyten_force|5.006000||cV SvPVbyte_nolen|5.006000|5.006000| SvPVbyte_nomg|5.031004|5.031004| SvPVbyte_or_null|5.031004|5.031004| SvPVbyte_or_null_nomg|5.031004|5.031004| SvPVbytex|5.006000|5.006000| SvPVbytex_force|5.006000|5.006000| SvPVbytex_nolen|5.009003|5.009003| SvPVCLEAR|5.025006|5.025006|p SvPV_const|5.009003|5.003007|p SvPV_flags|5.007002|5.003007|p SvPV_flags_const|5.009003|5.003007|p SvPV_flags_const_nolen|5.009003||pVu SvPV_flags_mutable|5.009003|5.003007|p SvPV_force|5.003007|5.003007|p SvPV_force_flags|5.007002|5.003007|p SvPV_force_flags_mutable|5.009003|5.003007|p SvPV_force_flags_nolen|5.009003|5.003007|p SvPV_force_mutable|5.009003|5.003007|p SvPV_force_nolen|5.009003|5.003007|p SvPV_force_nomg|5.007002|5.003007|p SvPV_force_nomg_nolen|5.009003|5.003007|p SvPV_free|5.009003|5.009003| SvPV_mutable|5.009003|5.003007|p sv_pvn|5.004000||dcV sv_pvn_force|5.005000||cV sv_pvn_force_flags|5.007002|5.003007|p sv_pvn_force_nomg|5.007002||Viu sv_pvn_nomg|5.007003|5.005000|pdu SvPV_nolen|5.006000|5.003007|p SvPV_nolen_const|5.009003|5.003007|p SvPV_nomg|5.007002|5.003007|p SvPV_nomg_const|5.009003|5.003007|p SvPV_nomg_const_nolen|5.009003|5.003007|p SvPV_nomg_nolen|5.013007|5.003007|p SvPV_renew|5.009003|5.003007|p SvPV_set|5.003007|5.003007| SvPV_shrink_to_cur|5.009003||Viu SvPVutf8|5.006000|5.006000| sv_pvutf8|5.008000||cV SvPVutf8_force|5.006000|5.006000| sv_pvutf8n|5.006000||dcV sv_pvutf8n_force|5.006000||cV SvPVutf8_nolen|5.006000|5.006000| SvPVutf8_nomg|5.031004|5.031004| SvPVutf8_or_null|5.031004|5.031004| SvPVutf8_or_null_nomg|5.031004|5.031004| SvPVutf8x|5.006000|5.006000| SvPVutf8x_force|5.006000|5.006000| SvPVX|5.003007|5.003007| SvPVx|5.003007|5.003007| SvPVX_const|5.009003|5.003007|p SvPVx_const|5.009003|5.009003| SvPVx_force|5.005000|5.005000| SvPVX_mutable|5.009003|5.003007|p SvPVx_nolen|5.009003|5.009003| SvPVx_nolen_const|5.009003|5.003007|p SvPVXtrue|5.017002||Viu SvPVXx|5.003007|5.003007| SvREADONLY|5.003007|5.003007| SvREADONLY_off|5.003007|5.003007| SvREADONLY_on|5.003007|5.003007| sv_recode_to_utf8|5.007003|5.007003| sv_ref|5.015004|5.015004| SvREFCNT|5.003007|5.003007| SvREFCNT_dec|5.003007|5.003007| SvREFCNT_dec_NN|5.017007|5.017007| SvREFCNT_IMMORTAL|5.017008||Viu SvREFCNT_inc|5.003007|5.003007|pn SvREFCNT_inc_NN|5.009004|5.003007|pn SvREFCNT_inc_simple|5.009004|5.003007|pn SvREFCNT_inc_simple_NN|5.009004|5.003007|pn SvREFCNT_inc_simple_void|5.009004|5.003007|pn SvREFCNT_inc_simple_void_NN|5.009004|5.003007|pn SvREFCNT_inc_void|5.009004|5.003007|pn SvREFCNT_inc_void_NN|5.009004|5.003007|pn sv_reftype|5.003007|5.003007| sv_replace|5.003007|5.003007| sv_report_used|5.003007|5.003007| sv_reset|5.003007|5.003007| sv_resetpvn|5.017005||Viu SvRMAGICAL|5.003007||Viu SvRMAGICAL_off|5.003007||Viu SvRMAGICAL_on|5.003007||Viu SvROK|5.003007|5.003007| SvROK_off|5.003007|5.003007| SvROK_on|5.003007|5.003007| SvRV|5.003007|5.003007| SvRV_const|5.010001||Viu SvRV_set|5.009003|5.003007|p sv_rvunweaken|5.027004|5.027004| sv_rvweaken|5.006000|5.006000| SvRVx|5.003007||Viu SvRX|5.009005|5.003007|p SvRXOK|5.009005|5.003007|p SV_SAVED_COPY|5.009005||Viu SvSCREAM|5.003007||Viu SvSCREAM_off|5.003007||Viu SvSCREAM_on|5.003007||Viu sv_setgid|5.019001||Viu sv_sethek|5.015004||cViu sv_setiv|5.003007|5.003007| sv_setiv_mg|5.004005|5.003007|p SvSETMAGIC|5.003007|5.003007| SvSetMagicSV|5.004000|5.004000| SvSetMagicSV_nosteal|5.004000|5.004000| sv_setnv|5.006000|5.003007| sv_setnv_mg|5.006000|5.003007|p sv_setpv|5.003007|5.003007| sv_setpv_bufsize|5.025006|5.025006| sv_setpvf|5.006000|5.004000|v sv_setpvf_mg|5.006000|5.004000|pv sv_setpvf_mg_nocontext|5.006000||pvVn sv_setpvf_nocontext|5.006000||vVn sv_setpviv|5.008001|5.008001|d sv_setpviv_mg|5.008001|5.008001|d sv_setpv_mg|5.004005|5.003007|p sv_setpvn|5.003007|5.003007| sv_setpvn_mg|5.004005|5.003007|p sv_setpvs|5.009004|5.003007|p sv_setpvs_mg|5.013006|5.013006| sv_setref_iv|5.003007|5.003007| sv_setref_nv|5.006000|5.003007| sv_setref_pv|5.003007|5.003007| sv_setref_pvn|5.003007|5.003007| sv_setref_pvs|5.013006|5.013006| sv_setref_uv|5.007001|5.007001| sv_setsv|5.003007|5.003007| SvSetSV|5.003007|5.003007| sv_setsv_cow|5.009000||xcViu sv_setsv_flags|5.007002|5.003007|p sv_setsv_mg|5.004005|5.003007|p sv_setsv_nomg|5.007002|5.003007|p SvSetSV_nosteal|5.004000|5.004000| sv_setuid|5.019001||Viu sv_set_undef|5.025008|5.025008| sv_setuv|5.004000|5.003007|p sv_setuv_mg|5.004005|5.003007|p SVs_GMG|5.003007||Viu SvSHARE|5.007003|5.007003| SvSHARED_HASH|5.009003|5.003007|p SvSHARED_HEK_FROM_PV|5.009003||Viu SV_SKIP_OVERLOAD|5.013001||Viu SV_SMAGIC|5.009003|5.003007|p SvSMAGICAL|5.003007||Viu SvSMAGICAL_off|5.003007||Viu SvSMAGICAL_on|5.003007||Viu SVs_OBJECT|5.003007||Viu SVs_PADMY|5.003007||Viu SVs_PADSTALE|5.009000|5.009000| SVs_PADTMP|5.003007||Viu SVs_RMG|5.003007||Viu SVs_SMG|5.003007||Viu SvSTASH|5.003007|5.003007| SvSTASH_set|5.009003|5.003007|p SVs_TEMP|5.003007|5.003007| sv_string_from_errnum|5.027003|5.027003| SvTAIL|5.003007||Viu SvTAINT|5.003007|5.003007| sv_taint|5.009003||cV SvTAINTED|5.004000|5.004000| sv_tainted|5.004000||cV SvTAINTED_off|5.004000|5.004000| SvTAINTED_on|5.004000|5.004000| SvTEMP|5.003007||Viu SvTEMP_off|5.003007||Viu SvTEMP_on|5.003007||Viu SVt_FIRST|5.021005||Viu SvTHINKFIRST|5.003007||Vi SvTIED_mg|5.005003||Viu SvTIED_obj|5.005003|5.005003| SVt_INVLIST|||c SVt_IV|5.003007|5.003007| SVt_MASK|5.015001||Viu SVt_NULL|5.003007|5.003007| SVt_NV|5.003007|5.003007| SVt_PV|5.003007|5.003007| SVt_PVAV|5.003007|5.003007| SVt_PVBM|5.009005||Viu SVt_PVCV|5.003007|5.003007| SVt_PVFM|5.003007|5.003007| SVt_PVGV|5.003007|5.003007| SVt_PVHV|5.003007|5.003007| SVt_PVIO|5.003007|5.003007| SVt_PVIV|5.003007|5.003007| SVt_PVLV|5.003007|5.003007| SVt_PVMG|5.003007|5.003007| SVt_PVNV|5.003007|5.003007| SVt_REGEXP|5.011000|5.011000| SvTRUE|5.003007|5.003007| sv_true|5.005000||cV SvTRUE_common|5.033005||cVu SvTRUE_NN|5.017007|5.017007| SvTRUE_nomg|5.013006|5.003007|p SvTRUE_nomg_NN|5.017007|5.017007| SvTRUEx|5.003007|5.003007| SvTRUEx_nomg|5.017002||Viu SVt_RV|5.011000||Viu SvTYPE|5.003007|5.003007| SVTYPEMASK|5.003007||Viu SvUID|5.019001||Viu SV_UNDEF_RETURNS_NULL|5.011000||Viu sv_unglob|5.005000||Viu sv_uni_display|5.007003|5.007003| SvUNLOCK|5.007003|5.007003| sv_unmagic|5.003007|5.003007| sv_unmagicext|5.013008|5.003007|p sv_unref|5.003007|5.003007| sv_unref_flags|5.007001|5.007001| sv_untaint|5.004000||cV SvUOK|5.007001|5.006000|p SvUOK_nog|5.017002||Viu SvUOK_nogthink|5.017002||Viu sv_upgrade|5.003007|5.003007| SvUPGRADE|5.003007|5.003007| sv_usepvn|5.003007|5.003007| sv_usepvn_flags|5.009004|5.009004| sv_usepvn_mg|5.004005|5.003007|p SvUTF8|5.006000|5.003007|p sv_utf8_decode|5.006000|5.006000| sv_utf8_downgrade|5.006000|5.006000| sv_utf8_downgrade_flags|5.031004|5.031004| sv_utf8_downgrade_nomg|5.031004|5.031004| sv_utf8_encode|5.006000|5.006000| SV_UTF8_NO_ENCODING|5.008001|5.003007|pd SvUTF8_off|5.006000|5.006000| SvUTF8_on|5.006000|5.006000| sv_utf8_upgrade|5.007001|5.007001| sv_utf8_upgrade_flags|5.007002|5.007002| sv_utf8_upgrade_flags_grow|5.011000|5.011000| sv_utf8_upgrade_nomg|5.007002|5.007002| SvUV|5.004000|5.003007|p sv_uv|5.005000||pdcV SvUV_nomg|5.009001|5.003007|p SvUV_set|5.009003|5.003007|p SvUVX|5.004000|5.003007|p SvUVx|5.004000|5.003007|p SvUVXx|5.004000|5.003007|pd SvVALID|5.003007||Viu sv_vcatpvf|5.006000|5.004000|p sv_vcatpvf_mg|5.006000|5.004000|p sv_vcatpvfn|5.004000|5.004000| sv_vcatpvfn_flags|5.017002|5.017002| SvVOK|5.008001|5.008001| sv_vsetpvf|5.006000|5.004000|p sv_vsetpvf_mg|5.006000|5.004000|p sv_vsetpvfn|5.004000|5.004000| SvVSTRING_mg|5.009004|5.003007|p SvWEAKREF|5.006000||Viu SvWEAKREF_off|5.006000||Viu SvWEAKREF_on|5.006000||Viu swallow_bom|5.006001||Viu switch_category_locale_to_template|5.027009||Viu SWITCHSTACK|5.003007||Viu switch_to_global_locale|5.027009|5.003007|pn sync_locale|5.027009|5.003007|pn sys_init3|||cnu sys_init|||cnu sys_intern_clear|5.006001||Vu sys_intern_dup|5.006000||Vu sys_intern_init|5.006001||Vu SYSTEM_GMTIME_MAX|5.011000||Viu SYSTEM_GMTIME_MIN|5.011000||Viu SYSTEM_LOCALTIME_MAX|5.011000||Viu SYSTEM_LOCALTIME_MIN|5.011000||Viu sys_term|||cnu TAIL|5.005000||Viu TAIL_t8_p8|5.033003||Viu TAIL_t8_pb|5.033003||Viu TAIL_tb_p8|5.033003||Viu TAIL_tb_pb|5.033003||Viu TAINT|5.004000||Viu taint_env|5.003007|5.003007|u TAINT_ENV|5.003007||Viu TAINT_get|5.017006||Viu TAINT_IF|5.003007||Viu TAINTING_get|5.017006||Viu TAINTING_set|5.017006||Viu TAINT_NOT|5.003007||Viu taint_proper|5.003007|5.003007|u TAINT_PROPER|5.003007||Viu TAINT_set|5.017006||Viu TAINT_WARN_get|5.017006||Viu TAINT_WARN_set|5.017006||Viu TARG|5.003007|5.003007| TARGi|5.023005||Viu TARGn|5.023005||Viu TARGu|5.023005||Viu telldir|5.005000||Viu T_FMT|5.027010||Viu T_FMT_AMPM|5.027010||Viu THIS|5.003007|5.003007|V THOUSEP|5.027010||Viu THR|5.005000||Viu THREAD_CREATE_NEEDS_STACK|5.007002||Viu thread_locale_init|5.027009|5.027009|xnu thread_locale_term|5.027009|5.027009|xnu THREAD_RET_TYPE|5.005000||Viu tied_method|5.013009||vViu TIED_METHOD_ARGUMENTS_ON_STACK|5.013009||Viu TIED_METHOD_MORTALIZE_NOT_NEEDED|5.013009||Viu TIED_METHOD_SAY|5.013009||Viu times|5.005000||Viu Time_t|5.003007|5.003007|Vn Timeval|5.004000|5.004000|Vn TM|5.011000||Viu tmpfile|5.003007||Viu tmpnam|5.005000||Viu TMPNAM_R_PROTO|5.008000|5.008000|Vn tmps_grow_p|5.021005||cViu to_byte_substr|5.008000||Viu toCTRL|5.004000||Viu toFOLD|5.019001|5.019001| toFOLD_A|5.019001||Viu _to_fold_latin1|5.015005||cVniu toFOLD_LC|5.019001||Viu toFOLD_uni|5.007003||Viu toFOLD_utf8|5.031005|5.031005| toFOLD_utf8_safe|5.025009|5.006000|p toFOLD_uvchr|5.023009|5.006000|p TO_INTERNAL_SIZE|5.023002||Viu tokenize_use|5.009003||Viu tokeq|5.005000||Viu tokereport|5.007001||Viu toLOWER|5.003007|5.003007| toLOWER_A|5.019001|5.019001| toLOWER_L1|5.019001|5.019001| toLOWER_LATIN1|5.013006|5.011002| to_lower_latin1|5.015005||Vniu toLOWER_LC|5.004000|5.004000| toLOWER_uni|5.006000||Viu toLOWER_utf8|5.031005|5.031005| toLOWER_utf8_safe|5.025009|5.006000|p toLOWER_uvchr|5.023009|5.006000|p too_few_arguments_pv|5.016000||Viu TOO_LATE_FOR|5.008001||Viu too_many_arguments_pv|5.016000||Viu TOPi|5.003007||Viu TOPl|5.003007||Viu TOPm1s|5.007001||Viu TOPMARK|5.003007||cViu TOPn|5.003007||Viu TOPp1s|5.007001||Viu TOPp|5.003007||Viu TOPpx|5.005003||Viu TOPs|5.003007||Viu TOPu|5.004000||Viu TOPul|5.006000||Viu toTITLE|5.019001|5.019001| toTITLE_A|5.019001||Viu toTITLE_uni|5.006000||Viu toTITLE_utf8|5.031005|5.031005| toTITLE_utf8_safe|5.025009|5.006000|p toTITLE_uvchr|5.023009|5.006000|p to_uni_fold|5.014000||cVu _to_uni_fold_flags|5.014000||cVu to_uni_lower|5.006000||cVu to_uni_title|5.006000||cVu to_uni_upper|5.006000||cVu toUPPER|5.003007|5.003007| toUPPER_A|5.019001||Viu toUPPER_LATIN1_MOD|5.011002||Viu toUPPER_LC|5.004000||Viu _to_upper_title_latin1|5.015005||Viu toUPPER_uni|5.006000||Viu toUPPER_utf8|5.031005|5.031005| toUPPER_utf8_safe|5.025009|5.006000|p toUPPER_uvchr|5.023009|5.006000|p _to_utf8_case|5.023006||Viu _to_utf8_fold_flags|5.014000||cVu _to_utf8_lower_flags|5.015006||cVu to_utf8_substr|5.008000||Viu _to_utf8_title_flags|5.015006||cVu _to_utf8_upper_flags|5.015006||cVu translate_substr_offsets|5.015006||Vniu traverse_op_tree|5.029008||Vi TR_DELETE|5.031006||Viu TRIE|5.009002||Viu TRIE_BITMAP|5.009004||Viu TRIE_BITMAP_BYTE|5.009004||Viu TRIE_BITMAP_CLEAR|5.009004||Viu TRIE_BITMAP_SET|5.009004||Viu TRIE_BITMAP_TEST|5.009004||Viu TRIEC|5.009004||Viu TRIE_CHARCOUNT|5.009004||Viu TRIEC_t8_p8|5.033003||Viu TRIEC_t8_pb|5.033003||Viu TRIEC_tb_p8|5.033003||Viu TRIEC_tb_pb|5.033003||Viu TRIE_next|5.009005||Viu TRIE_next_fail|5.009005||Viu TRIE_next_fail_t8_p8|5.033003||Viu TRIE_next_fail_t8_pb|5.033003||Viu TRIE_next_fail_tb_p8|5.033003||Viu TRIE_next_fail_tb_pb|5.033003||Viu TRIE_next_t8_p8|5.033003||Viu TRIE_next_t8_pb|5.033003||Viu TRIE_next_tb_p8|5.033003||Viu TRIE_next_tb_pb|5.033003||Viu TRIE_NODEIDX|5.009002||Viu TRIE_NODENUM|5.009002||Viu TRIE_t8_p8|5.033003||Viu TRIE_t8_pb|5.033003||Viu TRIE_tb_p8|5.033003||Viu TRIE_tb_pb|5.033003||Viu TRIE_WORDS_OFFSET|5.009005||Viu TR_OOB|5.031006||Viu TR_R_EMPTY|5.031006||Viu TR_SPECIAL_HANDLING|5.031006||Viu TRUE|5.003007||Viu truncate|5.006000||Viu TR_UNLISTED|5.031006||Viu TR_UNMAPPED|5.031006||Viu try_amagic_bin|||ciu tryAMAGICbin_MG|5.013002||Viu try_amagic_un|||ciu tryAMAGICunDEREF|5.006000||Viu tryAMAGICun_MG|5.013002||Viu tryAMAGICunTARGETlist|5.017002||Viu TS_W32_BROKEN_LOCALECONV|5.027010||Viu tTHX|5.009003||Viu ttyname|5.009000||Viu TTYNAME_R_PROTO|5.008000|5.008000|Vn turkic_fc|5.029008||Viu turkic_lc|5.029008||Viu turkic_uc|5.029008||Viu TWO_BYTE_UTF8_TO_NATIVE|5.019004||Viu TWO_BYTE_UTF8_TO_UNI|5.013008||Viu TYPE_CHARS|5.004000||Viu TYPE_DIGITS|5.004000||Viu U16|5.027001||Viu U16_MAX|5.003007||Viu U16_MIN|5.003007||Viu U16SIZE|5.006000|5.006000|Vn U16TYPE|5.006000|5.006000|Vn U_32|5.007002|5.007002| U32|5.027001||Viu U32_ALIGNMENT_REQUIRED|5.007001|5.007001|Vn U32_MAX|5.003007||Viu U32_MAX_P1|5.007002||Viu U32_MAX_P1_HALF|5.007002||Viu U32_MIN|5.003007||Viu U32SIZE|5.006000|5.006000|Vn U32TYPE|5.006000|5.006000|Vn U64|5.023002||Viu U64SIZE|5.006000|5.006000|Vn U64TYPE|5.006000|5.006000|Vn U8|5.027001||Viu U8_MAX|5.003007||Viu U8_MIN|5.003007||Viu U8SIZE|5.006000|5.006000|Vn U8TO16_LE|5.017010||Viu U8TO32_LE|5.017010||Viu U8TO64_LE|5.017006||Viu U8TYPE|5.006000|5.006000|Vn UCHARAT|5.003007||Viu U_I|5.003007||Viu Uid_t|5.003007|5.003007|Vn Uid_t_f|5.006000|5.006000|Vn Uid_t_sign|5.006000|5.006000|Vn Uid_t_size|5.006000|5.006000|Vn UINT16_C|5.003007|5.003007| UINT32_C|5.003007|5.003007| UINT32_MIN|5.006000||Viu UINT64_C|5.023002|5.023002| UINT64_MIN|5.006000||Viu UINTMAX_C|5.003007|5.003007| uiv_2buf|5.009003||Vniu U_L|5.003007||Viu umask|5.005000||Viu uname|5.005004||Viu UNDERBAR|5.009002|5.003007|p unexpected_non_continuation_text|5.025006||Viu ungetc|5.003007||Viu UNI_age_values_index|5.029009||Viu UNI_AHEX|5.029002||Viu UNI_ahex_values_index|5.029009||Viu UNI_ALNUM|5.029002||Viu UNI_ALPHA|5.029002||Viu UNI_ALPHABETIC|5.029002||Viu UNI_alpha_values_index|5.029009||Viu UNI_ASCIIHEXDIGIT|5.029002||Viu UNI_BASICLATIN|5.029002||Viu UNI_bc_values_index|5.029009||Viu UNI_bidic_values_index|5.029009||Viu UNI_bidim_values_index|5.029009||Viu UNI_BLANK|5.029002||Viu UNI_blk_values_index|5.029009||Viu UNI_bpt_values_index|5.029009||Viu UNI_cased_values_index|5.029009||Viu UNI_CC|5.029002||Viu UNI_ccc_values_index|5.029009||Viu UNI_ce_values_index|5.029009||Viu UNI_ci_values_index|5.029009||Viu UNI_CNTRL|5.029002||Viu UNICODE_ALLOW_ABOVE_IV_MAX|5.031006||Viu UNICODE_ALLOW_ANY|5.007003||Viu UNICODE_ALLOW_SUPER|5.007003||Viu UNICODE_ALLOW_SURROGATE|5.007003||Viu UNICODE_BYTE_ORDER_MARK|5.008000||Viu UNICODE_DISALLOW_ABOVE_31_BIT|5.023006|5.023006| UNICODE_DISALLOW_ILLEGAL_C9_INTERCHANGE|5.025005|5.025005| UNICODE_DISALLOW_ILLEGAL_INTERCHANGE|5.013009|5.013009| UNICODE_DISALLOW_NONCHAR|5.013009|5.013009| UNICODE_DISALLOW_PERL_EXTENDED|5.027002|5.027002| UNICODE_DISALLOW_SUPER|5.013009|5.013009| UNICODE_DISALLOW_SURROGATE|5.013009|5.013009| UNICODE_DOT_DOT_VERSION|5.023002||Viu UNICODE_DOT_VERSION|5.023002||Viu UNICODE_GOT_NONCHAR|5.027009||Viu UNICODE_GOT_PERL_EXTENDED|5.027009||Viu UNICODE_GOT_SUPER|5.027009||Viu UNICODE_GOT_SURROGATE|5.027009||Viu UNICODE_GREEK_CAPITAL_LETTER_SIGMA|5.007003||Viu UNICODE_GREEK_SMALL_LETTER_FINAL_SIGMA|5.007003||Viu UNICODE_GREEK_SMALL_LETTER_SIGMA|5.007003||Viu UNICODE_IS_32_CONTIGUOUS_NONCHARS|5.023006||Viu UNICODE_IS_BYTE_ORDER_MARK|5.007001||Viu UNICODE_IS_END_PLANE_NONCHAR_GIVEN_NOT_SUPER|5.023006||Viu UNICODE_IS_NONCHAR|5.013009||Viu UNICODE_IS_PERL_EXTENDED|5.027002||Viu UNICODE_IS_REPLACEMENT|5.007001||Viu UNICODE_IS_SUPER|5.013009||Viu UNICODE_IS_SURROGATE|5.007001||Viu UNICODE_MAJOR_VERSION|5.023002||Viu UNICODE_PAT_MOD|5.013006||Viu UNICODE_PAT_MODS|5.013006||Viu UNICODE_REPLACEMENT|5.007001|5.003007|p UNICODE_SURROGATE_FIRST|5.007001||Viu UNICODE_SURROGATE_LAST|5.007001||Viu UNICODE_WARN_ABOVE_31_BIT|5.023006|5.023006| UNICODE_WARN_ILLEGAL_C9_INTERCHANGE|5.025005|5.025005| UNICODE_WARN_ILLEGAL_INTERCHANGE|5.013009|5.013009| UNICODE_WARN_NONCHAR|5.013009|5.013009| UNICODE_WARN_PERL_EXTENDED|5.027002|5.027002| UNICODE_WARN_SUPER|5.013009|5.013009| UNICODE_WARN_SURROGATE|5.013009|5.013009| UNI_compex_values_index|5.029009||Viu UNI_CONTROL|5.029002||Viu UNI_cwcf_values_index|5.029009||Viu UNI_cwcm_values_index|5.029009||Viu UNI_cwkcf_values_index|5.029009||Viu UNI_cwl_values_index|5.029009||Viu UNI_cwt_values_index|5.029009||Viu UNI_cwu_values_index|5.029009||Viu UNI_dash_values_index|5.029009||Viu UNI_DECIMALNUMBER|5.029002||Viu UNI_dep_values_index|5.029009||Viu UNI_dia_values_index|5.029009||Viu UNI_DIGIT|5.029002||Viu UNI_DISPLAY_BACKSLASH|5.007003|5.007003| UNI_DISPLAY_BACKSPACE|5.031009|5.031009| UNI_DISPLAY_ISPRINT|5.007003|5.007003| UNI_DISPLAY_QQ|5.007003|5.007003| UNI_DISPLAY_REGEX|5.007003|5.007003| UNI_di_values_index|5.029009||Viu UNI_dt_values_index|5.029009||Viu UNI_ea_values_index|5.029009||Viu UNI_ebase_values_index|5.031010||Viu UNI_ecomp_values_index|5.031010||Viu UNI_emod_values_index|5.031010||Viu UNI_emoji_values_index|5.031010||Viu UNI_epres_values_index|5.031010||Viu UNI_extpict_values_index|5.031010||Viu UNI_ext_values_index|5.029009||Viu UNI_gcb_values_index|5.029009||Viu UNI_gc_values_index|5.029009||Viu UNI_GRAPH|5.029002||Viu UNI_grbase_values_index|5.029009||Viu UNI_grext_values_index|5.029009||Viu UNI_HEX|5.029002||Viu UNI_HEXDIGIT|5.029002||Viu UNI_hex_values_index|5.029009||Viu UNI_HORIZSPACE|5.029002||Viu UNI_hst_values_index|5.029009||Viu UNI_HYPHEN|5.029002||Viu UNI_hyphen_values_index|5.029009||Viu UNI_idc_values_index|5.029009||Viu UNI_identifierstatus_values_index|5.031010||Viu UNI_identifiertype_values_index|5.031010||Viu UNI_ideo_values_index|5.029009||Viu UNI_idsb_values_index|5.029009||Viu UNI_idst_values_index|5.029009||Viu UNI_ids_values_index|5.029009||Viu UNI_inpc_values_index|5.029009||Viu UNI_insc_values_index|5.029009||Viu UNI_in_values_index|5.029009||Viu UNI_IS_INVARIANT|5.007001||Viu UNI_jg_values_index|5.029009||Viu UNI_joinc_values_index|5.029009||Viu UNI_jt_values_index|5.029009||Viu UNI_L|5.029002||Viu UNI_L_AMP|5.029002||Viu UNI_LB__SG|5.029002||Viu UNI_lb_values_index|5.029009||Viu UNI_LC|5.029002||Viu UNI_LL|5.029002||Viu UNI_loe_values_index|5.029009||Viu UNI_LOWER|5.029002||Viu UNI_LOWERCASE|5.029002||Viu UNI_lower_values_index|5.029009||Viu UNI_LT|5.029002||Viu UNI_LU|5.029002||Viu UNI_math_values_index|5.029009||Viu UNI_nchar_values_index|5.029009||Viu UNI_ND|5.029002||Viu UNI_nfcqc_values_index|5.029009||Viu UNI_nfdqc_values_index|5.029009||Viu UNI_nfkcqc_values_index|5.029009||Viu UNI_nfkdqc_values_index|5.029009||Viu UNI_nt_values_index|5.029009||Viu UNI_nv_values_index|5.029009||Viu UNI_patsyn_values_index|5.029009||Viu UNI_patws_values_index|5.029009||Viu UNI_pcm_values_index|5.029009||Viu UNI_PERLSPACE|5.029002||Viu UNI_PERLWORD|5.029002||Viu UNI_PRINT|5.029002||Viu UNI_qmark_values_index|5.029009||Viu UNI_radical_values_index|5.029009||Viu UNI_ri_values_index|5.029009||Viu UNI_sb_values_index|5.029009||Viu UNI_sc_values_index|5.029009||Viu UNI_scx_values_index|5.029009||Viu UNI_sd_values_index|5.029009||Viu UNISKIP|5.007001||Viu UNI_SPACE|5.029002||Viu UNI_SPACEPERL|5.029002||Viu UNI_sterm_values_index|5.029009||Viu UNI_term_values_index|5.029009||Viu UNI_TITLECASE|5.029002||Viu UNI_TITLECASELETTER|5.029002||Viu UNI_TO_NATIVE|5.007001|5.003007|p UNI_uideo_values_index|5.029009||Viu UNI_UPPER|5.029002||Viu UNI_UPPERCASE|5.029002||Viu UNI_upper_values_index|5.029009||Viu UNI_vo_values_index|5.029009||Viu UNI_vs_values_index|5.029009||Viu UNI_wb_values_index|5.029009||Viu UNI_WHITESPACE|5.029002||Viu UNI_WORD|5.029002||Viu UNI_WSPACE|5.029002||Viu UNI_wspace_values_index|5.029009||Viu UNI_XDIGIT|5.029002||Viu UNI_xidc_values_index|5.029009||Viu UNI_xids_values_index|5.029009||Viu UNI_XPERLSPACE|5.029002||Viu UNKNOWN_ERRNO_MSG|5.019007||Viu UNLESSM|5.003007||Viu UNLESSM_t8_p8|5.033003||Viu UNLESSM_t8_pb|5.033003||Viu UNLESSM_tb_p8|5.033003||Viu UNLESSM_tb_pb|5.033003||Viu UNLIKELY|5.009004|5.003007|p UNLINK|5.003007||Viu unlink|5.005000||Viu unlnk|5.003007||cVu UNLOCK_DOLLARZERO_MUTEX|5.008001||Viu UNLOCK_LC_NUMERIC_STANDARD|5.021010||poVnu UNLOCK_NUMERIC_STANDARD|||piu UNOP_AUX_item_sv|5.021007||Viu unpack_rec|5.008001||Viu unpack_str|5.007003|5.007003|d unpackstring|5.008001|5.008001| unpackWARN1|5.007003||Viu unpackWARN2|5.007003||Viu unpackWARN3|5.007003||Viu unpackWARN4|5.007003||Viu unreferenced_to_tmp_stack|5.013002||Viu unshare_hek|5.004000||Viu unshare_hek_or_pvn|5.008000||Viu unsharepvn|5.003007|5.003007|u unwind_handler_stack|5.009003||Viu update_debugger_info|5.009005||Viu upg_version|5.009005|5.009005| UPG_VERSION|5.019008||Viu Uquad_t|5.006000|5.006000|Vn U_S|5.003007||Viu usage|5.005000||Viu USE_64_BIT_ALL|5.006000|5.006000|Vn USE_64_BIT_INT|5.006000|5.006000|Vn USE_64_BIT_RAWIO|5.006000||Viu USE_64_BIT_STDIO|5.006000||Viu USE_BSDPGRP|5.003007||Viu USE_C_BACKTRACE|5.035001|5.035001|Vn USE_DYNAMIC_LOADING|5.003007|5.003007|Vn USE_ENVIRON_ARRAY|5.007001||Viu USE_GRENT_BUFFER|5.008000||Viu USE_GRENT_FPTR|5.008000||Viu USE_GRENT_PTR|5.008000||Viu USE_HASH_SEED|5.008001||Viu USE_HOSTENT_BUFFER|5.008000||Viu USE_HOSTENT_ERRNO|5.008000||Viu USE_HOSTENT_PTR|5.008000||Viu USE_ITHREADS|5.010000|5.010000|Vn USE_LARGE_FILES|5.006000|5.006000|Vn USE_LEFT|5.004000||Viu USE_LOCALE|5.004000||Viu USE_LOCALE_ADDRESS|5.027009||Viu USE_LOCALE_COLLATE|5.004000||Viu USE_LOCALE_CTYPE|5.004000||Viu USE_LOCALE_IDENTIFICATION|5.027009||Viu USE_LOCALE_MEASUREMENT|5.027009||Viu USE_LOCALE_MESSAGES|5.019002||Viu USE_LOCALE_MONETARY|5.019002||Viu USE_LOCALE_NUMERIC|5.004000||Viu USE_LOCALE_PAPER|5.027009||Viu USE_LOCALE_SYNTAX|5.033001||Viu USE_LOCALE_TELEPHONE|5.027009||Viu USE_LOCALE_TIME|5.021002||Viu USE_LOCALE_TOD|5.033001||Viu USEMYBINMODE|5.006000||Viu USE_NETENT_BUFFER|5.008000||Viu USE_NETENT_ERRNO|5.008000||Viu USE_NETENT_PTR|5.008000||Viu USE_PERL_ATOF|5.008000||Viu USE_PERLIO|5.007001|5.007001|Vn USE_PERL_PERTURB_KEYS|5.018000||Viu USE_POSIX_2008_LOCALE|5.027003||Viu USE_PROTOENT_BUFFER|5.008000||Viu USE_PROTOENT_PTR|5.008000||Viu USE_PWENT_BUFFER|5.008000||Viu USE_PWENT_FPTR|5.008000||Viu USE_PWENT_PTR|5.008000||Viu USE_REENTRANT_API|5.007003||Viu USER_PROP_MUTEX_INIT|5.029008||Viu USER_PROP_MUTEX_LOCK|5.029008||Viu USER_PROP_MUTEX_TERM|5.029008||Viu USER_PROP_MUTEX_UNLOCK|5.029008||Viu USE_SEMCTL_SEMID_DS|5.004005|5.004005|Vn USE_SEMCTL_SEMUN|5.004005|5.004005|Vn USE_SERVENT_BUFFER|5.008000||Viu USE_SERVENT_PTR|5.008000||Viu USE_SPENT_BUFFER|5.031011||Viu USE_SPENT_PTR|5.008000||Viu USE_STAT_BLOCKS|5.005003|5.005003|Vn USE_STAT_RDEV|5.003007||Viu USE_STDIO|5.003007||Viu USE_STDIO_BASE|5.006000|5.006000|Vn USE_STDIO_PTR|5.006000|5.006000|Vn USE_SYSTEM_GMTIME|5.011000||Viu USE_SYSTEM_LOCALTIME|5.011000||Viu USE_THREADS|5.006000|5.006000|Vn USE_THREAD_SAFE_LOCALE|5.025004||Viu USE_TM64|5.011000||Viu USE_UTF8_IN_NAMES|5.007003||Viu utf16_textfilter|5.011001||Viu utf16_to_utf8|5.006000||cViu utf16_to_utf8_reversed|5.006000||cViu UTF8_ACCUMULATE|5.007001||Viu UTF8_ALLOW_ANY|5.007001||Viu UTF8_ALLOW_ANYUV|5.007001||Viu UTF8_ALLOW_CONTINUATION|5.007001||Viu UTF8_ALLOW_DEFAULT|5.009004||Viu UTF8_ALLOW_EMPTY|5.007001||Viu UTF8_ALLOW_FE_FF|5.027009||Viu UTF8_ALLOW_FFFF|5.007001||Viu UTF8_ALLOW_LONG|5.007001||Viu UTF8_ALLOW_LONG_AND_ITS_VALUE|5.025009||Viu UTF8_ALLOW_NON_CONTINUATION|5.007001||Viu UTF8_ALLOW_OVERFLOW|5.025009||Viu UTF8_ALLOW_SHORT|5.007001||Viu UTF8_ALLOW_SURROGATE|5.007001||Viu UTF8_CHECK_ONLY|5.007001|5.007001| UTF8_CHK_SKIP|5.031006|5.006000|p UTF8_DISALLOW_ABOVE_31_BIT|5.023006||Viu UTF8_DISALLOW_FE_FF|5.013009||Viu UTF8_DISALLOW_ILLEGAL_C9_INTERCHANGE|5.025005|5.025005| UTF8_DISALLOW_ILLEGAL_INTERCHANGE|5.013009|5.013009| UTF8_DISALLOW_NONCHAR|5.013009|5.013009| UTF8_DISALLOW_PERL_EXTENDED|5.027002|5.027002| UTF8_DISALLOW_SUPER|5.013009|5.013009| UTF8_DISALLOW_SURROGATE|5.013009|5.013009| utf8_distance|5.006000|5.006000| UTF8_EIGHT_BIT_HI|5.007001||Viu UTF8_EIGHT_BIT_LO|5.007001||Viu UTF8f|5.019001|5.003007|p UTF8fARG|5.019002|5.003007|p UTF8_GOT_ABOVE_31_BIT|5.025006||Viu UTF8_GOT_CONTINUATION|5.025006|5.025006| UTF8_GOT_EMPTY|5.025006|5.025006| UTF8_GOT_LONG|5.025006|5.025006| UTF8_GOT_NONCHAR|5.025006|5.025006| UTF8_GOT_NON_CONTINUATION|5.025006|5.025006| UTF8_GOT_OVERFLOW|5.025006|5.025006| UTF8_GOT_PERL_EXTENDED|5.027002|5.027002| UTF8_GOT_SHORT|5.025006|5.025006| UTF8_GOT_SUPER|5.025006|5.025006| UTF8_GOT_SURROGATE|5.025006|5.025006| utf8_hop|5.006000|5.006000|n utf8_hop_back|5.025007|5.025007|n utf8_hop_forward|5.025007|5.025007|n utf8_hop_safe|5.025007|5.025007|n UTF8_IS_ABOVE_LATIN1|5.017004||Viu UTF8_IS_ABOVE_LATIN1_START|5.023003||Viu UTF8_IS_CONTINUATION|5.007001||Viu UTF8_IS_CONTINUED|5.007001||Viu UTF8_IS_DOWNGRADEABLE_START|5.007001||Viu UTF8_IS_INVARIANT|5.007001|5.003007|p UTF8_IS_NEXT_CHAR_DOWNGRADEABLE|5.017006||Viu UTF8_IS_NONCHAR|5.023002|5.023002| UTF8_IS_NONCHAR_GIVEN_THAT_NON_SUPER_AND_GE_PROBLEMATIC|5.013009||Viu UTF8_IS_REPLACEMENT|5.017000||Viu UTF8_IS_START|5.007001||Viu UTF8_IS_START_base|5.031007||Viu UTF8_IS_SUPER|5.023002|5.023002| UTF8_IS_SURROGATE|5.023002|5.023002| utf8_length|5.007001|5.007001| UTF8_MAXBYTES|5.009002|5.006000|p UTF8_MAXBYTES_CASE|5.009002|5.003007|p UTF8_MAX_FOLD_CHAR_EXPAND|5.013009||Viu UTF8_MAXLEN|5.006000||Viu utf8_mg_len_cache_update|5.013003||Viu utf8_mg_pos_cache_update|5.009004||Viu utf8n_to_uvchr|5.007001|5.007001|n utf8n_to_uvchr_error|5.025006|5.025006|n utf8n_to_uvchr_msgs|5.027009|5.027009|n _utf8n_to_uvchr_msgs_helper|5.029001||cVnu utf8n_to_uvuni|5.007001||dcV UTF8_SAFE_SKIP|5.029009|5.006000|p UTF8SKIP|5.006000|5.006000| UTF8_SKIP|5.023002|5.006000|p utf8_to_bytes|5.006001|5.006001|x utf8_to_uvchr|5.007001|5.006001|pd utf8_to_uvchr_buf|5.015009|5.006001|p utf8_to_uvchr_buf_helper|5.031004||cVu utf8_to_uvuni|5.007001||dcV utf8_to_uvuni_buf|5.015009||dcV UTF8_TWO_BYTE_HI|5.011002||Viu UTF8_TWO_BYTE_HI_nocast|5.011002||Viu UTF8_TWO_BYTE_LO|5.011002||Viu UTF8_TWO_BYTE_LO_nocast|5.011002||Viu UTF8_WARN_ABOVE_31_BIT|5.023006||Viu UTF8_WARN_FE_FF|5.013009||Viu UTF8_WARN_ILLEGAL_C9_INTERCHANGE|5.025005|5.025005| UTF8_WARN_ILLEGAL_INTERCHANGE|5.013009|5.013009| UTF8_WARN_NONCHAR|5.013009|5.013009| UTF8_WARN_PERL_EXTENDED|5.027002|5.027002| UTF8_WARN_SUPER|5.013009|5.013009| UTF8_WARN_SURROGATE|5.013009|5.013009| UTF_ACCUMULATION_SHIFT|5.007001||Viu UTF_CONTINUATION_MARK|5.007001||Viu UTF_CONTINUATION_MASK|5.007001||Viu UTF_IS_CONTINUATION_MASK|5.023006||Viu UTF_MIN_ABOVE_LATIN1_BYTE|5.031006||Viu UTF_MIN_START_BYTE|5.031006||Viu UTF_START_MARK|5.007001||Viu UTF_START_MASK|5.007001||Viu UTF_TO_NATIVE|5.007001||Viu utilize|5.003007||Viu utime|5.005000||Viu U_V|5.006000|5.003007| UVCHR_IS_INVARIANT|5.019004|5.003007|p UVCHR_SKIP|5.022000|5.003007|p uvchr_to_utf8|5.007001|5.007001| uvchr_to_utf8_flags|5.007003|5.007003| uvchr_to_utf8_flags_msgs|5.027009|5.027009| UV_DIG|5.006000||Viu UVf|5.010000|5.010000|d UV_IS_QUAD|5.006000||Viu UV_MAX|5.003007|5.003007| UV_MAX_P1|5.007002||Viu UV_MAX_P1_HALF|5.007002||Viu UV_MIN|5.003007|5.003007| UVof|5.006000|5.003007|poVn uvoffuni_to_utf8_flags|5.027009||cV uvoffuni_to_utf8_flags_msgs|5.027009||cVu UVSIZE|5.006000|5.003007|poVn UVTYPE|5.006000|5.003007|poVn UVuf|5.006000|5.003007|poVn uvuni_to_utf8|5.019004||cVu uvuni_to_utf8_flags|5.007003||dcV UVxf|5.006000|5.003007|poVn UVXf|5.007001|5.007001|poVn VAL_EAGAIN|5.003007|5.003007|Vn validate_proto|5.019002||xcVi validate_suid|||iu valid_utf8_to_uvchr|5.015009||cVn valid_utf8_to_uvuni|5.015009||dcVu VAL_O_NONBLOCK|5.003007|5.003007|Vn variant_byte_number|5.031004||cVnu variant_under_utf8_count|5.027007||Vni varname|5.009003||Viu vcmp|5.009000|5.009000| VCMP|5.019008||Viu vcroak|5.006000|5.006000| vdeb|5.007003|5.007003|u VERB|5.009005||Viu VERB_t8_p8|5.033003||Viu VERB_t8_pb|5.033003||Viu VERB_tb_p8|5.033003||Viu VERB_tb_pb|5.033003||Viu vform|5.006000|5.006000| vfprintf|5.003007||Viu visit|5.005000||Viu vivify_defelem|5.004000||cViu vivify_ref|5.004000||Viu vload_module|5.006000|5.003007|p vmess|5.006000|5.004000|p vnewSVpvf|5.006000|5.004000|p vnormal|5.009002|5.009002| VNORMAL|5.019008||Viu vnumify|5.009000|5.009000| VNUMIFY|5.019008||Viu voidnonfinal|||iu VOL|5.003007||Viu vstringify|5.009000|5.009000| VSTRINGIFY|5.019008||Viu VTBL_amagic|5.005003||Viu VTBL_amagicelem|5.005003||Viu VTBL_arylen|5.005003||Viu VTBL_bm|5.005003||Viu VTBL_collxfrm|5.005003||Viu VTBL_dbline|5.005003||Viu VTBL_defelem|5.005003||Viu VTBL_env|5.005003||Viu VTBL_envelem|5.005003||Viu VTBL_fm|5.005003||Viu VTBL_glob|5.005003||Viu VTBL_isa|5.005003||Viu VTBL_isaelem|5.005003||Viu VTBL_mglob|5.005003||Viu VTBL_nkeys|5.005003||Viu VTBL_pack|5.005003||Viu VTBL_packelem|5.005003||Viu VTBL_pos|5.005003||Viu VTBL_regdata|5.006000||Viu VTBL_regdatum|5.006000||Viu VTBL_regexp|5.005003||Viu VTBL_sigelem|5.005003||Viu VTBL_substr|5.005003||Viu VTBL_sv|5.005003||Viu VTBL_taint|5.005003||Viu VTBL_uvar|5.005003||Viu VTBL_vec|5.005003||Viu vTHX|5.006000||Viu VT_NATIVE|5.021004||Viu vtohl|5.003007||Viu vtohs|5.003007||Viu VUTIL_REPLACE_CORE|5.019008||Viu vverify|5.009003|5.009003| VVERIFY|5.019008||Viu vwarn|5.006000|5.006000| vwarner|5.006000|5.004000|p wait4pid|5.003007||Viu wait|5.005000||Viu want_vtbl_bm|5.015000||Viu want_vtbl_fm|5.015000||Viu warn|5.006000|5.003007|v WARN_ALL|5.006000|5.003007|p WARN_ALLstring|5.006000||Viu WARN_AMBIGUOUS|5.006000|5.003007|p WARN_ASSERTIONS||5.003007|ponu WARN_BAREWORD|5.006000|5.003007|p WARN_CLOSED|5.006000|5.003007|p WARN_CLOSURE|5.006000|5.003007|p WARN_DEBUGGING|5.006000|5.003007|p WARN_DEPRECATED|5.006000|5.003007|p WARN_DIGIT|5.006000|5.003007|p warner|5.006000|5.004000|pv warner_nocontext|5.006000||vVn WARN_EXEC|5.006000|5.003007|p WARN_EXITING|5.006000|5.003007|p WARN_EXPERIMENTAL|5.017004|5.017004| WARN_EXPERIMENTAL__ALPHA_ASSERTIONS|5.027009|5.027009| WARN_EXPERIMENTAL__BITWISE|5.021009|5.021009| WARN_EXPERIMENTAL__CONST_ATTR|5.021008|5.021008| WARN_EXPERIMENTAL__DECLARED_REFS|5.025003|5.025003| WARN_EXPERIMENTAL__ISA|5.031007|5.031007| WARN_EXPERIMENTAL__LEXICAL_SUBS|5.017005|5.017005| WARN_EXPERIMENTAL__POSTDEREF|5.019005|5.019005| WARN_EXPERIMENTAL__PRIVATE_USE|5.029009|5.029009| WARN_EXPERIMENTAL__REFALIASING|5.021005|5.021005| WARN_EXPERIMENTAL__REGEX_SETS|5.017008|5.017008| WARN_EXPERIMENTAL__RE_STRICT|5.021008|5.021008| WARN_EXPERIMENTAL__SCRIPT_RUN|5.027008|5.027008| WARN_EXPERIMENTAL__SIGNATURES|5.019009|5.019009| WARN_EXPERIMENTAL__SMARTMATCH|5.017011|5.017011| WARN_EXPERIMENTAL__TRY|5.033007|5.033007| WARN_EXPERIMENTAL__UNIPROP_WILDCARDS|5.029009|5.029009| WARN_EXPERIMENTAL__VLB|5.029009|5.029009| WARN_EXPERIMENTAL__WIN32_PERLIO|5.021001|5.021001| WARN_GLOB|5.006000|5.003007|p WARN_ILLEGALPROTO|5.011004|5.011004| WARN_IMPRECISION|5.011000|5.011000| WARN_INPLACE|5.006000|5.003007|p WARN_INTERNAL|5.006000|5.003007|p WARN_IO|5.006000|5.003007|p WARN_LAYER|5.008000|5.003007|p WARN_LOCALE|5.021006|5.021006| WARN_MALLOC|5.006000|5.003007|p WARN_MISC|5.006000|5.003007|p WARN_MISSING|5.021002|5.021002| WARN_NEWLINE|5.006000|5.003007|p warn_nocontext|5.006000||pvVn WARN_NONCHAR|5.013010|5.013010| WARN_NONEstring|5.006000||Viu WARN_NON_UNICODE|5.013010|5.013010| WARN_NUMERIC|5.006000|5.003007|p WARN_ONCE|5.006000|5.003007|p warn_on_first_deprecated_use|5.025009||Viu WARN_OVERFLOW|5.006000|5.003007|p WARN_PACK|5.006000|5.003007|p WARN_PARENTHESIS|5.006000|5.003007|p WARN_PIPE|5.006000|5.003007|p WARN_PORTABLE|5.006000|5.003007|p WARN_PRECEDENCE|5.006000|5.003007|p WARN_PRINTF|5.006000|5.003007|p _warn_problematic_locale|5.021008||cVniu WARN_PROTOTYPE|5.006000|5.003007|p WARN_QW|5.006000|5.003007|p WARN_RECURSION|5.006000|5.003007|p WARN_REDEFINE|5.006000|5.003007|p WARN_REDUNDANT|5.021002|5.021002| WARN_REGEXP|5.006000|5.003007|p WARN_RESERVED|5.006000|5.003007|p WARN_SEMICOLON|5.006000|5.003007|p WARN_SEVERE|5.006000|5.003007|p WARN_SHADOW|5.027007|5.027007| WARNshift|5.011001||Viu WARN_SIGNAL|5.006000|5.003007|p WARNsize|5.006000||Viu WARN_SUBSTR|5.006000|5.003007|p WARN_SURROGATE|5.013010|5.013010| warn_sv|5.013001|5.003007|p WARN_SYNTAX|5.006000|5.003007|p WARN_SYSCALLS|5.019004|5.019004| WARN_TAINT|5.006000|5.003007|p WARN_THREADS|5.008000|5.003007|p WARN_UNINITIALIZED|5.006000|5.003007|p WARN_UNOPENED|5.006000|5.003007|p WARN_UNPACK|5.006000|5.003007|p WARN_UNTIE|5.006000|5.003007|p WARN_UTF8|5.006000|5.003007|p WARN_VOID|5.006000|5.003007|p was_lvalue_sub|||ciu watch|5.003007||Viu WB_BREAKABLE|5.023008||Viu WB_DQ_then_HL|5.023008||Viu WB_Ex_or_FO_or_ZWJ_then_foo|5.025003||Viu WB_HL_then_DQ|5.023008||Viu WB_hs_then_hs|5.023008||Viu WB_LE_or_HL_then_MB_or_ML_or_SQ|5.023008||Viu WB_MB_or_ML_or_SQ_then_LE_or_HL|5.023008||Viu WB_MB_or_MN_or_SQ_then_NU|5.023008||Viu WB_NOBREAK|5.023008||Viu WB_NU_then_MB_or_MN_or_SQ|5.023008||Viu WB_RI_then_RI|5.025003||Viu WCTOMB_LOCK|5.033005||Viu WCTOMB_UNLOCK|5.033005||Viu WEXITSTATUS|5.008001||Viu what_MULTI_CHAR_FOLD_latin1_safe|5.033005||Viu what_MULTI_CHAR_FOLD_utf8_safe|5.033005||Viu what_MULTI_CHAR_FOLD_utf8_safe_part0|5.033005||Viu what_MULTI_CHAR_FOLD_utf8_safe_part1|5.033005||Viu what_MULTI_CHAR_FOLD_utf8_safe_part2|5.033005||Viu what_MULTI_CHAR_FOLD_utf8_safe_part3|5.033005||Viu what_MULTI_CHAR_FOLD_utf8_safe_part4|5.033005||Viu what_MULTI_CHAR_FOLD_utf8_safe_part5|5.033005||Viu what_MULTI_CHAR_FOLD_utf8_safe_part6|5.033005||Viu what_MULTI_CHAR_FOLD_utf8_safe_part7|5.033005||Viu whichsig|5.003007|5.003007| whichsig_pv|5.015004|5.015004| whichsig_pvn|5.015004|5.015004| whichsig_sv|5.015004|5.015004| WHILEM|5.003007||Viu WHILEM_A_max|5.009005||Viu WHILEM_A_max_fail|5.009005||Viu WHILEM_A_max_fail_t8_p8|5.033003||Viu WHILEM_A_max_fail_t8_pb|5.033003||Viu WHILEM_A_max_fail_tb_p8|5.033003||Viu WHILEM_A_max_fail_tb_pb|5.033003||Viu WHILEM_A_max_t8_p8|5.033003||Viu WHILEM_A_max_t8_pb|5.033003||Viu WHILEM_A_max_tb_p8|5.033003||Viu WHILEM_A_max_tb_pb|5.033003||Viu WHILEM_A_min|5.009005||Viu WHILEM_A_min_fail|5.009005||Viu WHILEM_A_min_fail_t8_p8|5.033003||Viu WHILEM_A_min_fail_t8_pb|5.033003||Viu WHILEM_A_min_fail_tb_p8|5.033003||Viu WHILEM_A_min_fail_tb_pb|5.033003||Viu WHILEM_A_min_t8_p8|5.033003||Viu WHILEM_A_min_t8_pb|5.033003||Viu WHILEM_A_min_tb_p8|5.033003||Viu WHILEM_A_min_tb_pb|5.033003||Viu WHILEM_A_pre|5.009005||Viu WHILEM_A_pre_fail|5.009005||Viu WHILEM_A_pre_fail_t8_p8|5.033003||Viu WHILEM_A_pre_fail_t8_pb|5.033003||Viu WHILEM_A_pre_fail_tb_p8|5.033003||Viu WHILEM_A_pre_fail_tb_pb|5.033003||Viu WHILEM_A_pre_t8_p8|5.033003||Viu WHILEM_A_pre_t8_pb|5.033003||Viu WHILEM_A_pre_tb_p8|5.033003||Viu WHILEM_A_pre_tb_pb|5.033003||Viu WHILEM_B_max|5.009005||Viu WHILEM_B_max_fail|5.009005||Viu WHILEM_B_max_fail_t8_p8|5.033003||Viu WHILEM_B_max_fail_t8_pb|5.033003||Viu WHILEM_B_max_fail_tb_p8|5.033003||Viu WHILEM_B_max_fail_tb_pb|5.033003||Viu WHILEM_B_max_t8_p8|5.033003||Viu WHILEM_B_max_t8_pb|5.033003||Viu WHILEM_B_max_tb_p8|5.033003||Viu WHILEM_B_max_tb_pb|5.033003||Viu WHILEM_B_min|5.009005||Viu WHILEM_B_min_fail|5.009005||Viu WHILEM_B_min_fail_t8_p8|5.033003||Viu WHILEM_B_min_fail_t8_pb|5.033003||Viu WHILEM_B_min_fail_tb_p8|5.033003||Viu WHILEM_B_min_fail_tb_pb|5.033003||Viu WHILEM_B_min_t8_p8|5.033003||Viu WHILEM_B_min_t8_pb|5.033003||Viu WHILEM_B_min_tb_p8|5.033003||Viu WHILEM_B_min_tb_pb|5.033003||Viu WHILEM_t8_p8|5.033003||Viu WHILEM_t8_pb|5.033003||Viu WHILEM_tb_p8|5.033003||Viu WHILEM_tb_pb|5.033003||Viu WIDEST_UTYPE|5.015004|5.003007|poVnu WIFEXITED|5.008001||Viu WIFSIGNALED|5.008001||Viu WIFSTOPPED|5.008001||Viu win32_croak_not_implemented|5.017006||Vniu WIN32SCK_IS_STDSCK|5.007001||Viu win32_setlocale|5.027006||Viu withinCOUNT|5.031004||Viu withinCOUNT_KNOWN_VALID|5.033005||Viu WITH_LC_NUMERIC_SET_TO_NEEDED|5.031003|5.031003| WITH_LC_NUMERIC_SET_TO_NEEDED_IN|5.031003|5.031003| with_queued_errors|5.013001||Viu with_tp_UTF8ness|5.033003||Viu WNOHANG|5.008001||Viu wrap_keyword_plugin|5.027006|5.027006|x wrap_op_checker|5.015008|5.015008| write|5.005000||Viu write_to_stderr|5.008001||Viu WSTOPSIG|5.008001||Viu WTERMSIG|5.008001||Viu WUNTRACED|5.008001||Viu XCPT_CATCH|5.009002|5.003007|p XCPT_RETHROW|5.009002|5.003007|p XCPT_TRY_END|5.009002|5.003007|p XCPT_TRY_START|5.009002|5.003007|p XDIGIT_VALUE|5.019008||Viu XHvTOTALKEYS|5.007003||Viu xio_any|5.006001||Viu xio_dirp|5.006001||Viu xiv_iv|5.009003||Viu xlv_targoff|5.019004||Viu XopDISABLE|5.013007|5.013007|V XOPd_xop_class|5.013007||Viu XOPd_xop_desc|5.013007||Viu XOPd_xop_name|5.013007||Viu XOPd_xop_peep|5.013007||Viu XopENABLE|5.013007|5.013007|V XopENTRY|5.013007|5.013007|V XopENTRYCUSTOM|5.019006|5.013007|V XopENTRY_set|5.013007|5.013007|V XopFLAGS|5.013007|5.013007| XOPf_xop_class|5.013007||Viu XOPf_xop_desc|5.013007||Viu XOPf_xop_name|5.013007||Viu XOPf_xop_peep|5.013007||Viu XORSHIFT128_set|5.027001||Viu XORSHIFT96_set|5.027001||Viu XPUSHi|5.003007|5.003007| XPUSHmortal|5.009002|5.003007|p XPUSHn|5.006000|5.003007| XPUSHp|5.003007|5.003007| XPUSHs|5.003007|5.003007| XPUSHTARG|5.003007||Viu XPUSHu|5.004000|5.003007|p XPUSHundef|5.006000||Viu xpv_len|5.017006||Viu XS|5.003007|5.003007|Vu XSANY|5.003007||Viu XS_APIVERSION_BOOTCHECK|5.013004|5.013004| XS_APIVERSION_POPMARK_BOOTCHECK|5.021006||Viu XS_APIVERSION_SETXSUBFN_POPMARK_BOOTCHECK|5.021006||Viu xs_boot_epilog|5.021006||cViu XS_BOTHVERSION_BOOTCHECK|5.021006||Viu XS_BOTHVERSION_POPMARK_BOOTCHECK|5.021006||Viu XS_BOTHVERSION_SETXSUBFN_POPMARK_BOOTCHECK|5.021006||Viu XS_DYNAMIC_FILENAME|5.009004||Viu XS_EXTERNAL|5.015002|5.015002|Vu xs_handshake|||vcniu XSINTERFACE_CVT|5.005000||Viu XSINTERFACE_CVT_ANON|5.010000||Viu XSINTERFACE_FUNC|5.005000||Viu XSINTERFACE_FUNC_SET|5.005000||Viu XS_INTERNAL|5.015002|5.015002|Vu XSprePUSH|5.006000|5.003007|poVnu XSPROTO|5.010000|5.003007|pVu XSRETURN|5.003007|5.003007|p XSRETURN_EMPTY|5.003007|5.003007| XSRETURN_IV|5.003007|5.003007| XSRETURN_NO|5.003007|5.003007| XSRETURN_NV|5.006000|5.003007| XSRETURN_PV|5.003007|5.003007| XSRETURN_PVN|5.006000||Viu XSRETURN_UNDEF|5.003007|5.003007| XSRETURN_UV|5.008001|5.003007|p XSRETURN_YES|5.003007|5.003007| XS_SETXSUBFN_POPMARK|5.021006||Viu XST_mIV|5.003007|5.003007| XST_mNO|5.003007|5.003007| XST_mNV|5.006000|5.003007| XST_mPV|5.003007|5.003007| XST_mPVN|5.006000||Viu XST_mUNDEF|5.003007|5.003007| XST_mUV|5.008001|5.003007|p XST_mYES|5.003007|5.003007| XS_VERSION|5.003007|5.003007| XS_VERSION_BOOTCHECK|5.003007|5.003007| xs_version_bootcheck|||iu XTENDED_PAT_MOD|5.009005||Viu xuv_uv|5.009003||Viu YESEXPR|5.027010||Viu YESSTR|5.027010||Viu YIELD|5.005000||Viu YYDEBUG|5.025006||Viu YYEMPTY|5.009005||Viu yyerror|5.003007||Viu yyerror_pv|5.016000||Viu yyerror_pvn|5.016000||Viu yylex|5.003007||cViu yyparse|5.003007||Viu yyquit|5.025010||Viu YYSTYPE_IS_DECLARED|5.009001||Viu YYSTYPE_IS_TRIVIAL|5.009001||Viu YYTOKENTYPE|5.009001||Viu yyunlex|5.013005||Viu yywarn|5.003007||Viu ZAPHOD32_FINALIZE|5.027001||Viu ZAPHOD32_MIX|5.027001||Viu ZAPHOD32_SCRAMBLE32|5.027001||Viu ZAPHOD32_STATIC_INLINE|5.027001||Viu ZAPHOD32_WARN2|5.027001||Viu ZAPHOD32_WARN3|5.027001||Viu ZAPHOD32_WARN4|5.027001||Viu ZAPHOD32_WARN5|5.027001||Viu ZAPHOD32_WARN6|5.027001||Viu Zero|5.003007|5.003007| ZeroD|5.009002|5.003007|p ); if (exists $opt{'list-unsupported'}) { my $f; for $f (sort dictionary_order keys %API) { next if $API{$f}{core_only}; next if $API{$f}{beyond_depr}; next if $API{$f}{inaccessible}; next if $API{$f}{experimental}; next unless $API{$f}{todo}; next if int_parse_version($API{$f}{todo}) <= $int_min_perl; my $repeat = 40 - length($f); $repeat = 0 if $repeat < 0; print "$f ", '.'x $repeat, " ", format_version($API{$f}{todo}), "\n"; } exit 0; } # Scan for hints, possible replacement candidates, etc. my(%replace, %need, %hints, %warnings, %depends); my $replace = 0; my($hint, $define, $function); sub find_api { BEGIN { 'warnings'->unimport('uninitialized') if "$]" > '5.006' } my $code = shift; $code =~ s{ / (?: \*[^*]*\*+(?:[^$ccs][^*]*\*+)* / | /[^\r\n]*) | "[^"\\]*(?:\\.[^"\\]*)*" | '[^'\\]*(?:\\.[^'\\]*)*' }{}egsx; grep { exists $API{$_} } $code =~ /(\w+)/mg; } while (<DATA>) { if ($hint) { # Here, we are in the middle of accumulating a hint or warning. my $end_of_hint = 0; # A line containing a comment end marker closes the hint. Remove that # marker for processing below. if (s/\s*$rcce(.*?)\s*$//) { die "Nothing can follow the end of comment in '$_'\n" if length $1 > 0; $end_of_hint = 1; } # Set $h to the hash of which type. my $h = $hint->[0] eq 'Hint' ? \%hints : \%warnings; # Ignore any leading and trailing white space, and an optional star comment # continuation marker, then place the meat of the line into $1 m/^\s*(?:\*\s*)?(.*?)\s*$/; # Add the meat of this line to the hash value of each API element it # applies to for (@{$hint->[1]}) { $h->{$_} ||= ''; # avoid the warning older perls generate $h->{$_} .= "$1\n"; } # If the line had a comment close, we are through with this hint undef $hint if $end_of_hint; next; } # Set up $hint if this is the beginning of a Hint: or Warning: # These are from a multi-line C comment in the file, with the first line # looking like (a space has been inserted because this file can't have C # comment markers in it): # / * Warning: PL_expect, PL_copline, PL_rsfp # # $hint becomes # [ # 'Warning', # [ # 'PL_expect', # 'PL_copline', # 'PL_rsfp', # ], # ] if (m{^\s*$rccs\s+(Hint|Warning):\s+(\w+(?:,?\s+\w+)*)\s*$}) { $hint = [$1, [split /,?\s+/, $2]]; next; } if ($define) { # If in the middle of a definition... # append a continuation line ending with backslash. if ($define->[1] =~ /\\$/) { $define->[1] .= $_; } else { # Otherwise this line ends the definition, make foo depend on bar # (and what bar depends on) if its not one of ppp's own constructs if (exists $API{$define->[0]} && $define->[1] !~ /^DPPP_\(/) { my @n = find_api($define->[1]); push @{$depends{$define->[0]}}, @n if @n } undef $define; } } # For '#define foo bar' or '#define foo(a,b,c) bar', $define becomes a # reference to [ foo, bar ] $define = [$1, $2] if m{^\s*#\s*define\s+(\w+)(?:\([^)]*\))?\s+(.*)}; if ($function) { if (/^}/) { if (exists $API{$function->[0]}) { my @n = find_api($function->[1]); push @{$depends{$function->[0]}}, @n if @n } undef $function; } else { $function->[1] .= $_; } } $function = [$1, ''] if m{^DPPP_\(my_(\w+)\)}; # Set $replace to the number given for lines that look like # / * Replace: \d+ * / # Thus setting it to 1 starts a region where replacements are automatically # done, and setting it to 0 ends that region. $replace = $1 if m{^\s*$rccs\s+Replace:\s+(\d+)\s+$rcce\s*$}; # Add bar => foo to %replace for lines like '#define foo bar in a region # where $replace is non-zero $replace{$2} = $1 if $replace and m{^\s*#\s*define\s+(\w+)(?:\([^)]*\))?\s+(\w+)}; # Add bar => foo to %replace for lines like '#define foo bar / * Replace * / $replace{$2} = $1 if m{^\s*#\s*define\s+(\w+)(?:\([^)]*\))?\s+(\w+).*$rccs\s+Replace\s+$rcce}; # Add foo => bar to %replace for lines like / * Replace foo with bar * / $replace{$1} = $2 if m{^\s*$rccs\s+Replace (\w+) with (\w+.*?)\s+$rcce\s*$}; # For lines like / * foo, bar depends on baz, bat * / # create a list of the elements on the rhs, and make that list apply to each # element in the lhs, which becomes a key in \%depends. if (m{^\s*$rccs\s+(\w+(\s*,\s*\w+)*)\s+depends\s+on\s+(\w+(\s*,\s*\w+)*)\s+$rcce\s*$}) { my @deps = map { s/\s+//g; $_ } split /,/, $3; my $d; for $d (map { s/\s+//g; $_ } split /,/, $1) { push @{$depends{$d}}, @deps; } } $need{$1} = 1 if m{^#if\s+defined\(NEED_(\w+)(?:_GLOBAL)?\)}; } for (values %depends) { my %seen; $_ = [sort dictionary_order grep !$seen{$_}++, @$_]; } if (exists $opt{'api-info'}) { my $f; my $count = 0; my $match = $opt{'api-info'} =~ m!^/(.*)/$! ? $1 : "^\Q$opt{'api-info'}\E\$"; # Sort the names, and split into two classes; one for things that are part of # the API; a second for things that aren't. my @ok_to_use; my @shouldnt_use; for $f (sort dictionary_order keys %API) { next unless $f =~ /$match/; my $base = int_parse_version($API{$f}{base}) if $API{$f}{base}; if ($base && ! $API{$f}{inaccessible} && ! $API{$f}{core_only}) { push @ok_to_use, $f; } else { push @shouldnt_use, $f; } } # We normally suppress non-API items. But if the search matched no API # items, output the non-ones. This allows someone to get the info for an # item if they ask for it specifically enough, but doesn't normally clutter # the output with irrelevant results. @ok_to_use = @shouldnt_use unless @ok_to_use; for $f (@ok_to_use) { print "\n=== $f ===\n"; my $info = 0; my $base; $base = int_parse_version($API{$f}{base}) if $API{$f}{base}; my $todo; $todo = int_parse_version($API{$f}{todo}) if $API{$f}{todo}; # Output information if ($base) { my $with_or= ""; if ( $base <= $int_min_perl || ( (! $API{$f}{provided} && ! $todo) || ($todo && $todo >= $base))) { $with_or= " with or"; } my $Supported = ($API{$f}{undocumented}) ? 'Available' : 'Supported'; print "\n$Supported at least since perl-", format_version($base), ",$with_or without $ppport."; if ($API{$f}{unverified}) { print "\nThis information is based on inspection of the source code", " and has not been\n", "verified by successful compilation."; } print "\n"; $info++; } if ($API{$f}{provided} || $todo) { print "\nThis is only supported by $ppport, and NOT by perl versions going forward.\n" unless $base; if ($todo) { if (! $base || $todo < $base) { my $additionally = ""; $additionally .= " additionally" if $base; print "$ppport$additionally provides support at least back to perl-", format_version($todo), ".\n"; } } elsif (! $base || $base > $int_min_perl) { if (exists $depends{$f}) { my $max = 0; for (@{$depends{$f}}) { $max = int_parse_version($API{$_}{todo}) if $API{$_}{todo} && $API{$_}{todo} > $max; # XXX What to assume unspecified values are? This effectively makes them MIN_PERL } $todo = $max if $max; } print "\n$ppport provides support for this, but ironically, does not", " currently know,\n", "for this report, the minimum version it supports for this"; if ($API{$f}{undocumented}) { print " and many things\n", "it provides that are implemented as macros and aren't", " documented. You can\n", "help by submitting a documentation patch"; } print ".\n"; if ($todo) { if ($todo <= $int_min_perl) { print "It may very well be supported all the way back to ", format_version(5.003_07), ".\n"; } else { print "But given the things $f depends on, it's a good", " guess that it isn't\n", "supported prior to ", format_version($todo), ".\n"; } } } } if ($API{$f}{provided}) { print "Support needs to be explicitly requested by #define NEED_$f\n", "(or #define NEED_${f}_GLOBAL).\n" if exists $need{$f}; $info++; } if ($base || ! $API{$f}{ppport_fnc}) { my $email = "Send email to perl5-porters\@perl.org if you need to have this functionality.\n"; if ($API{$f}{inaccessible}) { print "\nThis is not part of the public API, and may not even be accessible to XS code.\n"; $info++; } elsif ($API{$f}{core_only}) { print "\nThis is not part of the public API, and should not be used by XS code.\n"; $info++; } elsif ($API{$f}{deprecated}) { print "\nThis is deprecated and should not be used. Convert existing uses.\n"; $info++; } elsif ($API{$f}{experimental}) { print "\nThe API for this is unstable and should not be used by XS code.\n", $email; $info++; } elsif ($API{$f}{undocumented}) { print "\nSince this is undocumented, the API should be considered unstable.\n"; if ($API{$f}{provided}) { print "Consider bringing this up on the list: perl5-porters\@perl.org.\n"; } else { print "It may be that this is not intended for XS use, or it may just be\n", "that no one has gotten around to documenting it.\n", $email; } $info++; } unless ($info) { print "No portability information available. Check your spelling; or", " this could be\na bug in Devel::PPPort. To report an issue:\n", "https://github.com/Dual-Life/Devel-PPPort/issues/new\n"; } } print "\nDepends on: ", join(', ', @{$depends{$f}}), ".\n" if exists $depends{$f}; if (exists $hints{$f} || exists $warnings{$f}) { print "\n$hints{$f}" if exists $hints{$f}; print "\nWARNING:\n$warnings{$f}" if exists $warnings{$f}; $info++; } $count++; } $count or print "\nFound no API matching '$opt{'api-info'}'."; print "\n"; exit 0; } if (exists $opt{'list-provided'}) { my $f; for $f (sort dictionary_order keys %API) { next unless $API{$f}{provided}; my @flags; push @flags, 'explicit' if exists $need{$f}; push @flags, 'depend' if exists $depends{$f}; push @flags, 'hint' if exists $hints{$f}; push @flags, 'warning' if exists $warnings{$f}; my $flags = @flags ? ' ['.join(', ', @flags).']' : ''; print "$f$flags\n"; } exit 0; } my @files; my @srcext = qw( .xs .c .h .cc .cpp -c.inc -xs.inc ); my $srcext = join '|', map { quotemeta $_ } @srcext; if (@ARGV) { my %seen; for (@ARGV) { if (-e) { if (-f) { push @files, $_ unless $seen{$_}++; } else { warn "'$_' is not a file.\n" } } else { my @new = grep { -f } glob $_ or warn "'$_' does not exist.\n"; push @files, grep { !$seen{$_}++ } @new; } } } else { eval { require File::Find; File::Find::find(sub { $File::Find::name =~ /($srcext)$/i and push @files, $File::Find::name; }, '.'); }; if ($@) { @files = map { glob "*$_" } @srcext; } } if (!@ARGV || $opt{filter}) { my(@in, @out); my %xsc = map { /(.*)\.xs$/ ? ("$1.c" => 1, "$1.cc" => 1) : () } @files; for (@files) { my $out = exists $xsc{$_} || /\b\Q$ppport\E$/i || !/($srcext)$/i; push @{ $out ? \@out : \@in }, $_; } if (@ARGV && @out) { warning("Skipping the following files (use --nofilter to avoid this):\n| ", join "\n| ", @out); } @files = @in; } die "No input files given!\n" unless @files; my(%files, %global, %revreplace); %revreplace = reverse %replace; my $filename; my $patch_opened = 0; for $filename (@files) { unless (open IN, "<$filename") { warn "Unable to read from $filename: $!\n"; next; } info("Scanning $filename ..."); my $c = do { local $/; <IN> }; close IN; my %file = (orig => $c, changes => 0); # Temporarily remove C/XS comments and strings from the code my @ccom; $c =~ s{ ( ^$HS*\#$HS*include\b[^\r\n]+\b(?:\Q$ppport\E|XSUB\.h)\b[^\r\n]* | ^$HS*\#$HS*(?:define|elif|if(?:def)?)\b[^\r\n]* ) | ( ^$HS*\#[^\r\n]* | "[^"\\]*(?:\\.[^"\\]*)*" | '[^'\\]*(?:\\.[^'\\]*)*' | / (?: \*[^*]*\*+(?:[^$ccs][^*]*\*+)* / | /[^\r\n]* ) ) }{ defined $2 and push @ccom, $2; defined $1 ? $1 : "$ccs$#ccom$cce" }mgsex; $file{ccom} = \@ccom; $file{code} = $c; $file{has_inc_ppport} = $c =~ /^$HS*#$HS*include[^\r\n]+\b\Q$ppport\E\b/m; my $func; for $func (keys %API) { my $match = $func; $match .= "|$revreplace{$func}" if exists $revreplace{$func}; if ($c =~ /\b(?:Perl_)?($match)\b/) { $file{uses_replace}{$1}++ if exists $revreplace{$func} && $1 eq $revreplace{$func}; $file{uses_Perl}{$func}++ if $c =~ /\bPerl_$func\b/; if (exists $API{$func}{provided}) { $file{uses_provided}{$func}++; if ( ! exists $API{$func}{base} || int_parse_version($API{$func}{base}) > $opt{'compat-version'}) { $file{uses}{$func}++; my @deps = rec_depend($func); if (@deps) { $file{uses_deps}{$func} = \@deps; for (@deps) { $file{uses}{$_} = 0 unless exists $file{uses}{$_}; } } for ($func, @deps) { $file{needs}{$_} = 'static' if exists $need{$_}; } } } if ( exists $API{$func}{todo} && int_parse_version($API{$func}{todo}) > $opt{'compat-version'}) { if ($c =~ /\b$func\b/) { $file{uses_todo}{$func}++; } } } } while ($c =~ /^$HS*#$HS*define$HS+(NEED_(\w+?)(_GLOBAL)?)\b/mg) { if (exists $need{$2}) { $file{defined $3 ? 'needed_global' : 'needed_static'}{$2}++; } else { warning("Possibly wrong #define $1 in $filename") } } for (qw(uses needs uses_todo needed_global needed_static)) { for $func (keys %{$file{$_}}) { push @{$global{$_}{$func}}, $filename; } } $files{$filename} = \%file; } # Globally resolve NEED_'s my $need; for $need (keys %{$global{needs}}) { if (@{$global{needs}{$need}} > 1) { my @targets = @{$global{needs}{$need}}; my @t = grep $files{$_}{needed_global}{$need}, @targets; @targets = @t if @t; @t = grep /\.xs$/i, @targets; @targets = @t if @t; my $target = shift @targets; $files{$target}{needs}{$need} = 'global'; for (@{$global{needs}{$need}}) { $files{$_}{needs}{$need} = 'extern' if $_ ne $target; } } } for $filename (@files) { exists $files{$filename} or next; info("=== Analyzing $filename ==="); my %file = %{$files{$filename}}; my $func; my $c = $file{code}; my $warnings = 0; for $func (sort dictionary_order keys %{$file{uses_Perl}}) { if ($API{$func}{varargs}) { unless ($API{$func}{noTHXarg}) { my $changes = ($c =~ s{\b(Perl_$func\s*\(\s*)(?!aTHX_?)(\)|[^\s)]*\))} { $1 . ($2 eq ')' ? 'aTHX' : 'aTHX_ ') . $2 }ge); if ($changes) { warning("Doesn't pass interpreter argument aTHX to Perl_$func"); $file{changes} += $changes; } } } else { warning("Uses Perl_$func instead of $func"); $file{changes} += ($c =~ s{\bPerl_$func(\s*)\((\s*aTHX_?)?\s*} {$func$1(}g); } } for $func (sort dictionary_order keys %{$file{uses_replace}}) { warning("Uses $func instead of $replace{$func}"); $file{changes} += ($c =~ s/\b$func\b/$replace{$func}/g); } for $func (sort dictionary_order keys %{$file{uses_provided}}) { if ($file{uses}{$func}) { if (exists $file{uses_deps}{$func}) { diag("Uses $func, which depends on ", join(', ', @{$file{uses_deps}{$func}})); } else { diag("Uses $func"); } } $warnings += (hint($func) || 0); } unless ($opt{quiet}) { for $func (sort dictionary_order keys %{$file{uses_todo}}) { next if int_parse_version($API{$func}{todo}) <= $int_min_perl; print "*** WARNING: Uses $func, which may not be portable below perl ", format_version($API{$func}{todo}), ", even with '$ppport'\n"; $warnings++; } } for $func (sort dictionary_order keys %{$file{needed_static}}) { my $message = ''; if (not exists $file{uses}{$func}) { $message = "No need to define NEED_$func if $func is never used"; } elsif (exists $file{needs}{$func} && $file{needs}{$func} ne 'static') { $message = "No need to define NEED_$func when already needed globally"; } if ($message) { diag($message); $file{changes} += ($c =~ s/^$HS*#$HS*define$HS+NEED_$func\b.*$LF//mg); } } for $func (sort dictionary_order keys %{$file{needed_global}}) { my $message = ''; if (not exists $global{uses}{$func}) { $message = "No need to define NEED_${func}_GLOBAL if $func is never used"; } elsif (exists $file{needs}{$func}) { if ($file{needs}{$func} eq 'extern') { $message = "No need to define NEED_${func}_GLOBAL when already needed globally"; } elsif ($file{needs}{$func} eq 'static') { $message = "No need to define NEED_${func}_GLOBAL when only used in this file"; } } if ($message) { diag($message); $file{changes} += ($c =~ s/^$HS*#$HS*define$HS+NEED_${func}_GLOBAL\b.*$LF//mg); } } $file{needs_inc_ppport} = keys %{$file{uses}}; if ($file{needs_inc_ppport}) { my $pp = ''; for $func (sort dictionary_order keys %{$file{needs}}) { my $type = $file{needs}{$func}; next if $type eq 'extern'; my $suffix = $type eq 'global' ? '_GLOBAL' : ''; unless (exists $file{"needed_$type"}{$func}) { if ($type eq 'global') { diag("Files [@{$global{needs}{$func}}] need $func, adding global request"); } else { diag("File needs $func, adding static request"); } $pp .= "#define NEED_$func$suffix\n"; } } if ($pp && ($c =~ s/^(?=$HS*#$HS*define$HS+NEED_\w+)/$pp/m)) { $pp = ''; $file{changes}++; } unless ($file{has_inc_ppport}) { diag("Needs to include '$ppport'"); $pp .= qq(#include "$ppport"\n) } if ($pp) { $file{changes} += ($c =~ s/^($HS*#$HS*define$HS+NEED_\w+.*?)^/$1$pp/ms) || ($c =~ s/^(?=$HS*#$HS*include.*\Q$ppport\E)/$pp/m) || ($c =~ s/^($HS*#$HS*include.*XSUB.*\s*?)^/$1$pp/m) || ($c =~ s/^/$pp/); } } else { if ($file{has_inc_ppport}) { diag("No need to include '$ppport'"); $file{changes} += ($c =~ s/^$HS*?#$HS*include.*\Q$ppport\E.*?$LF//m); } } # put back in our C comments my $ix; my $cppc = 0; my @ccom = @{$file{ccom}}; for $ix (0 .. $#ccom) { if (!$opt{cplusplus} && $ccom[$ix] =~ s!^//!!) { $cppc++; $file{changes} += $c =~ s/$rccs$ix$rcce/$ccs$ccom[$ix] $cce/; } else { $c =~ s/$rccs$ix$rcce/$ccom[$ix]/; } } if ($cppc) { my $s = $cppc != 1 ? 's' : ''; warning("Uses $cppc C++ style comment$s, which is not portable"); } my $s = $warnings != 1 ? 's' : ''; my $warn = $warnings ? " ($warnings warning$s)" : ''; info("Analysis completed$warn"); if ($file{changes}) { if (exists $opt{copy}) { my $newfile = "$filename$opt{copy}"; if (-e $newfile) { error("'$newfile' already exists, refusing to write copy of '$filename'"); } else { local *F; if (open F, ">$newfile") { info("Writing copy of '$filename' with changes to '$newfile'"); print F $c; close F; } else { error("Cannot open '$newfile' for writing: $!"); } } } elsif (exists $opt{patch} || $opt{changes}) { if (exists $opt{patch}) { unless ($patch_opened) { if (open PATCH, ">$opt{patch}") { $patch_opened = 1; } else { error("Cannot open '$opt{patch}' for writing: $!"); delete $opt{patch}; $opt{changes} = 1; goto fallback; } } mydiff(\*PATCH, $filename, $c); } else { fallback: info("Suggested changes:"); mydiff(\*STDOUT, $filename, $c); } } else { my $s = $file{changes} == 1 ? '' : 's'; info("$file{changes} potentially required change$s detected"); } } else { info("Looks good"); } } close PATCH if $patch_opened; exit 0; sub try_use { eval "use @_;"; return $@ eq '' } sub mydiff { local *F = shift; my($file, $str) = @_; my $diff; if (exists $opt{diff}) { $diff = run_diff($opt{diff}, $file, $str); } if (!defined $diff and try_use('Text::Diff')) { $diff = Text::Diff::diff($file, \$str, { STYLE => 'Unified' }); $diff = <<HEADER . $diff; --- $file +++ $file.patched HEADER } if (!defined $diff) { $diff = run_diff('diff -u', $file, $str); } if (!defined $diff) { $diff = run_diff('diff', $file, $str); } if (!defined $diff) { error("Cannot generate a diff. Please install Text::Diff or use --copy."); return; } print F $diff; } sub run_diff { my($prog, $file, $str) = @_; my $tmp = 'dppptemp'; my $suf = 'aaa'; my $diff = ''; local *F; while (-e "$tmp.$suf") { $suf++ } $tmp = "$tmp.$suf"; if (open F, ">$tmp") { print F $str; close F; if (open F, "$prog $file $tmp |") { while (<F>) { s/\Q$tmp\E/$file.patched/; $diff .= $_; } close F; unlink $tmp; return $diff; } unlink $tmp; } else { error("Cannot open '$tmp' for writing: $!"); } return undef; } sub rec_depend { my($func, $seen) = @_; return () unless exists $depends{$func}; $seen = {%{$seen||{}}}; return () if $seen->{$func}++; my %s; grep !$s{$_}++, map { ($_, rec_depend($_, $seen)) } @{$depends{$func}}; } sub info { $opt{quiet} and return; print @_, "\n"; } sub diag { $opt{quiet} and return; $opt{diag} and print @_, "\n"; } sub warning { $opt{quiet} and return; print "*** ", @_, "\n"; } sub error { print "*** ERROR: ", @_, "\n"; } my %given_hints; my %given_warnings; sub hint { $opt{quiet} and return; my $func = shift; my $rv = 0; if (exists $warnings{$func} && !$given_warnings{$func}++) { my $warn = $warnings{$func}; $warn =~ s!^!*** !mg; print "*** WARNING: $func\n", $warn; $rv++; } if ($opt{hints} && exists $hints{$func} && !$given_hints{$func}++) { my $hint = $hints{$func}; $hint =~ s/^/ /mg; print " --- hint for $func ---\n", $hint; } $rv || 0; } sub usage { my($usage) = do { local(@ARGV,$/)=($0); <> } =~ /^=head\d$HS+SYNOPSIS\s*^(.*?)\s*^=/ms; my %M = ( 'I' => '*' ); $usage =~ s/^\s*perl\s+\S+/$^X $0/; $usage =~ s/([A-Z])<([^>]+)>/$M{$1}$2$M{$1}/g; print <<ENDUSAGE; Usage: $usage See perldoc $0 for details. ENDUSAGE exit 2; } sub strip { my $self = do { local(@ARGV,$/)=($0); <> }; my($copy) = $self =~ /^=head\d\s+COPYRIGHT\s*^(.*?)^=\w+/ms; $copy =~ s/^(?=\S+)/ /gms; $self =~ s/^$HS+Do NOT edit.*?(?=^-)/$copy/ms; $self =~ s/^SKIP.*(?=^__DATA__)/SKIP if (\@ARGV && \$ARGV[0] eq '--unstrip') { eval { require Devel::PPPort }; \$@ and die "Cannot require Devel::PPPort, please install.\\n"; if (eval \$Devel::PPPort::VERSION < $VERSION) { die "$0 was originally generated with Devel::PPPort $VERSION.\\n" . "Your Devel::PPPort is only version \$Devel::PPPort::VERSION.\\n" . "Please install a newer version, or --unstrip will not work.\\n"; } Devel::PPPort::WriteFile(\$0); exit 0; } print <<END; Sorry, but this is a stripped version of \$0. To be able to use its original script and doc functionality, please try to regenerate this file using: \$^X \$0 --unstrip END /ms; my($pl, $c) = $self =~ /(.*^__DATA__)(.*)/ms; $c =~ s{ / (?: \*[^*]*\*+(?:[^$ccs][^*]*\*+)* / | /[^\r\n]*) | ( "[^"\\]*(?:\\.[^"\\]*)*" | '[^'\\]*(?:\\.[^'\\]*)*' ) | ($HS+) }{ defined $2 ? ' ' : ($1 || '') }gsex; $c =~ s!\s+$!!mg; $c =~ s!^$LF!!mg; $c =~ s!^\s*#\s*!#!mg; $c =~ s!^\s+!!mg; open OUT, ">$0" or die "cannot strip $0: $!\n"; print OUT "$pl$c\n"; exit 0; } __DATA__ */ #ifndef _P_P_PORTABILITY_H_ #define _P_P_PORTABILITY_H_ #ifndef DPPP_NAMESPACE # define DPPP_NAMESPACE DPPP_ #endif #define DPPP_CAT2(x,y) CAT2(x,y) #define DPPP_(name) DPPP_CAT2(DPPP_NAMESPACE, name) #define D_PPP_RELEASE_DATE 1625616000 /* 2021-07-07 */ #if ! defined(PERL_REVISION) && ! defined(PERL_VERSION_MAJOR) # if ! defined(__PATCHLEVEL_H_INCLUDED__) \ && ! ( defined(PATCHLEVEL) && defined(SUBVERSION)) # define PERL_PATCHLEVEL_H_IMPLICIT # include <patchlevel.h> # endif # if ! defined(PERL_VERSION) \ && ! defined(PERL_VERSION_MAJOR) \ && ( ! defined(SUBVERSION) || ! defined(PATCHLEVEL) ) # include <could_not_find_Perl_patchlevel.h> # endif #endif #ifdef PERL_VERSION_MAJOR # define D_PPP_MAJOR PERL_VERSION_MAJOR #elif defined(PERL_REVISION) # define D_PPP_MAJOR PERL_REVISION #else # define D_PPP_MAJOR 5 #endif #ifdef PERL_VERSION_MINOR # define D_PPP_MINOR PERL_VERSION_MINOR #elif defined(PERL_VERSION) # define D_PPP_MINOR PERL_VERSION #elif defined(PATCHLEVEL) # define D_PPP_MINOR PATCHLEVEL # define PERL_VERSION PATCHLEVEL /* back-compat */ #else # error Could not find a source for PERL_VERSION_MINOR #endif #ifdef PERL_VERSION_PATCH # define D_PPP_PATCH PERL_VERSION_PATCH #elif defined(PERL_SUBVERSION) # define D_PPP_PATCH PERL_SUBVERSION #elif defined(SUBVERSION) # define D_PPP_PATCH SUBVERSION # define PERL_SUBVERSION SUBVERSION /* back-compat */ #else # error Could not find a source for PERL_VERSION_PATCH #endif #if D_PPP_MAJOR < 5 || D_PPP_MAJOR == 6 # error Devel::PPPort works only on Perl 5, Perl 7, ... #elif D_PPP_MAJOR != 5 /* Perl 7 and above: the old forms are deprecated, set up so that they * assume Perl 5, and will make this look like 5.201.201. * * 201 is used so will be well above anything that would come from a 5 * series if we unexpectedly have to continue it, but still gives plenty of * room, up to 255, of numbers that will fit into a byte in case there is * something else unforeseen */ # undef PERL_REVISION # undef PERL_VERSION # undef PERL_SUBVERSION # define D_PPP_REVISION 5 # define D_PPP_VERSION 201 # define D_PPP_SUBVERSION 201 # if (defined(__clang__) /* _Pragma here doesn't work with gcc */ \ && ( (defined(__STDC_VERSION__) && __STDC_VERSION__ >= 199901L) \ || defined(_STDC_C99) \ || defined(__c99))) # define D_PPP_STRINGIFY(x) #x # define D_PPP_deprecate(xyz) _Pragma(D_PPP_STRINGIFY(GCC warning(D_PPP_STRINGIFY(xyz) " is deprecated"))) # define PERL_REVISION (D_PPP_REVISION D_PPP_deprecate(PERL_REVISION)) # define PERL_VERSION (D_PPP_REVISION D_PPP_deprecate(PERL_VERSION)) # define PERL_SUBVERSION (D_PPP_SUBVERSION D_PPP_deprecate(PERL_SUBVERSION)) # else # define PERL_REVISION D_PPP_REVISION # define PERL_VERSION D_PPP_REVISION # define PERL_SUBVERSION D_PPP_SUBVERSION # endif #endif /* Warning: PERL_PATCHLEVEL PATCHLEVEL SUBVERSION PERL_REVISION PERL_VERSION * PERL_SUBVERSION PERL_BCDVERSION * * You should be using PERL_VERSION_xy(maj,min,ptch) instead of this, where xy * is one of EQ, NE, LE, GT, LT, GE */ /* Replace PERL_PATCHLEVEL with PERL_VERSION_xy(5,a,b) (where xy is EQ,LT,GT...) */ /* Replace PATCHLEVEL with PERL_VERSION_xy(5,a,b) (where xy is EQ,LT,GT...) */ /* Replace SUBVERSION with PERL_VERSION_xy(5,a,b) (where xy is EQ,LT,GT...) */ /* Replace PERL_REVISION with PERL_VERSION_xy(a,b,c) (where xy is EQ,LT,GT...) */ /* Replace PERL_VERSION with PERL_VERSION_xy(5,a,b) (where xy is EQ,LT,GT...) */ /* Replace PERL_SUBVERSION with PERL_VERSION_xy(5,a,b) (where xy is EQ,LT,GT...) */ /* Replace PERL_BCDVERSION with PERL_VERSION_xy(5,a,b) (where xy is EQ,LT,GT...) */ #define D_PPP_DEC2BCD(dec) ((((dec)/100)<<8)|((((dec)%100)/10)<<4)|((dec)%10)) #define D_PPP_JNP_TO_BCD(j,n,p) ((D_PPP_DEC2BCD(j)<<24)|(D_PPP_DEC2BCD(n)<<12)|D_PPP_DEC2BCD(p)) #define PERL_BCDVERSION D_PPP_JNP_TO_BCD(D_PPP_MAJOR, \ D_PPP_MINOR, \ D_PPP_PATCH) /* These differ from the versions outside D:P in using PERL_BCDVERSION instead * of PERL_DECIMAL_VERSION. The formats printing in this module assume BCD, so * always use it */ #undef PERL_VERSION_EQ #undef PERL_VERSION_NE #undef PERL_VERSION_LT #undef PERL_VERSION_GE #undef PERL_VERSION_LE #undef PERL_VERSION_GT /* N.B. These don't work if the patch number is 42 or 92, as those are what '*' * is in ASCII and EBCDIC respectively */ #ifndef PERL_VERSION_EQ # define PERL_VERSION_EQ(j,n,p) \ (((p) == '*') ? ( (j) == D_PPP_VERSION_MAJOR \ && (n) == D_PPP_VERSION_MINOR) \ : (PERL_BCDVERSION == D_PPP_JNP_TO_BCD(j,n,p))) #endif #ifndef PERL_VERSION_NE # define PERL_VERSION_NE(j,n,p) (! PERL_VERSION_EQ(j,n,p)) #endif #ifndef PERL_VERSION_LT # define PERL_VERSION_LT(j,n,p) /* p=='*' means _LT(j,n,0) */ \ (PERL_BCDVERSION < D_PPP_JNP_TO_BCD( (j), \ (n), \ (((p) == '*') ? 0 : (p)))) #endif #ifndef PERL_VERSION_GE # define PERL_VERSION_GE(j,n,p) (! PERL_VERSION_LT(j,n,p)) #endif #ifndef PERL_VERSION_LE # define PERL_VERSION_LE(j,n,p) /* p=='*' means _LT(j,n+1,0) */ \ (PERL_BCDVERSION < D_PPP_JNP_TO_BCD( (j), \ (((p) == '*') ? ((n)+1) : (n)), \ (((p) == '*') ? 0 : (p)))) #endif #ifndef PERL_VERSION_GT # define PERL_VERSION_GT(j,n,p) (! PERL_VERSION_LE(j,n,p)) #endif #ifndef dTHR # define dTHR dNOOP #endif #ifndef dTHX # define dTHX dNOOP #endif /* Hint: dTHX For pre-5.6.0 thread compatibility, instead use dTHXR, available only through ppport.h */ #ifndef dTHXa # define dTHXa(x) dNOOP #endif #ifndef pTHX # define pTHX void #endif #ifndef pTHX_ # define pTHX_ #endif #ifndef aTHX # define aTHX #endif /* Hint: aTHX For pre-5.6.0 thread compatibility, instead use aTHXR, available only through ppport.h */ #ifndef aTHX_ # define aTHX_ #endif /* Hint: aTHX_ For pre-5.6.0 thread compatibility, instead use aTHXR_, available only through ppport.h */ #if (PERL_BCDVERSION < 0x5006000) # ifdef USE_THREADS # define aTHXR thr # define aTHXR_ thr, # else # define aTHXR # define aTHXR_ # endif # define dTHXR dTHR #else # define aTHXR aTHX # define aTHXR_ aTHX_ # define dTHXR dTHX #endif #ifndef dTHXoa # define dTHXoa(x) dTHXa(x) #endif #ifdef I_LIMITS # include <limits.h> #endif #ifndef PERL_UCHAR_MIN # define PERL_UCHAR_MIN ((unsigned char)0) #endif #ifndef PERL_UCHAR_MAX # ifdef UCHAR_MAX # define PERL_UCHAR_MAX ((unsigned char)UCHAR_MAX) # else # ifdef MAXUCHAR # define PERL_UCHAR_MAX ((unsigned char)MAXUCHAR) # else # define PERL_UCHAR_MAX ((unsigned char)~(unsigned)0) # endif # endif #endif #ifndef PERL_USHORT_MIN # define PERL_USHORT_MIN ((unsigned short)0) #endif #ifndef PERL_USHORT_MAX # ifdef USHORT_MAX # define PERL_USHORT_MAX ((unsigned short)USHORT_MAX) # else # ifdef MAXUSHORT # define PERL_USHORT_MAX ((unsigned short)MAXUSHORT) # else # ifdef USHRT_MAX # define PERL_USHORT_MAX ((unsigned short)USHRT_MAX) # else # define PERL_USHORT_MAX ((unsigned short)~(unsigned)0) # endif # endif # endif #endif #ifndef PERL_SHORT_MAX # ifdef SHORT_MAX # define PERL_SHORT_MAX ((short)SHORT_MAX) # else # ifdef MAXSHORT /* Often used in <values.h> */ # define PERL_SHORT_MAX ((short)MAXSHORT) # else # ifdef SHRT_MAX # define PERL_SHORT_MAX ((short)SHRT_MAX) # else # define PERL_SHORT_MAX ((short) (PERL_USHORT_MAX >> 1)) # endif # endif # endif #endif #ifndef PERL_SHORT_MIN # ifdef SHORT_MIN # define PERL_SHORT_MIN ((short)SHORT_MIN) # else # ifdef MINSHORT # define PERL_SHORT_MIN ((short)MINSHORT) # else # ifdef SHRT_MIN # define PERL_SHORT_MIN ((short)SHRT_MIN) # else # define PERL_SHORT_MIN (-PERL_SHORT_MAX - ((3 & -1) == 3)) # endif # endif # endif #endif #ifndef PERL_UINT_MAX # ifdef UINT_MAX # define PERL_UINT_MAX ((unsigned int)UINT_MAX) # else # ifdef MAXUINT # define PERL_UINT_MAX ((unsigned int)MAXUINT) # else # define PERL_UINT_MAX (~(unsigned int)0) # endif # endif #endif #ifndef PERL_UINT_MIN # define PERL_UINT_MIN ((unsigned int)0) #endif #ifndef PERL_INT_MAX # ifdef INT_MAX # define PERL_INT_MAX ((int)INT_MAX) # else # ifdef MAXINT /* Often used in <values.h> */ # define PERL_INT_MAX ((int)MAXINT) # else # define PERL_INT_MAX ((int)(PERL_UINT_MAX >> 1)) # endif # endif #endif #ifndef PERL_INT_MIN # ifdef INT_MIN # define PERL_INT_MIN ((int)INT_MIN) # else # ifdef MININT # define PERL_INT_MIN ((int)MININT) # else # define PERL_INT_MIN (-PERL_INT_MAX - ((3 & -1) == 3)) # endif # endif #endif #ifndef PERL_ULONG_MAX # ifdef ULONG_MAX # define PERL_ULONG_MAX ((unsigned long)ULONG_MAX) # else # ifdef MAXULONG # define PERL_ULONG_MAX ((unsigned long)MAXULONG) # else # define PERL_ULONG_MAX (~(unsigned long)0) # endif # endif #endif #ifndef PERL_ULONG_MIN # define PERL_ULONG_MIN ((unsigned long)0L) #endif #ifndef PERL_LONG_MAX # ifdef LONG_MAX # define PERL_LONG_MAX ((long)LONG_MAX) # else # ifdef MAXLONG # define PERL_LONG_MAX ((long)MAXLONG) # else # define PERL_LONG_MAX ((long) (PERL_ULONG_MAX >> 1)) # endif # endif #endif #ifndef PERL_LONG_MIN # ifdef LONG_MIN # define PERL_LONG_MIN ((long)LONG_MIN) # else # ifdef MINLONG # define PERL_LONG_MIN ((long)MINLONG) # else # define PERL_LONG_MIN (-PERL_LONG_MAX - ((3 & -1) == 3)) # endif # endif #endif #if defined(HAS_QUAD) && (defined(convex) || defined(uts)) # ifndef PERL_UQUAD_MAX # ifdef ULONGLONG_MAX # define PERL_UQUAD_MAX ((unsigned long long)ULONGLONG_MAX) # else # ifdef MAXULONGLONG # define PERL_UQUAD_MAX ((unsigned long long)MAXULONGLONG) # else # define PERL_UQUAD_MAX (~(unsigned long long)0) # endif # endif # endif # ifndef PERL_UQUAD_MIN # define PERL_UQUAD_MIN ((unsigned long long)0L) # endif # ifndef PERL_QUAD_MAX # ifdef LONGLONG_MAX # define PERL_QUAD_MAX ((long long)LONGLONG_MAX) # else # ifdef MAXLONGLONG # define PERL_QUAD_MAX ((long long)MAXLONGLONG) # else # define PERL_QUAD_MAX ((long long) (PERL_UQUAD_MAX >> 1)) # endif # endif # endif # ifndef PERL_QUAD_MIN # ifdef LONGLONG_MIN # define PERL_QUAD_MIN ((long long)LONGLONG_MIN) # else # ifdef MINLONGLONG # define PERL_QUAD_MIN ((long long)MINLONGLONG) # else # define PERL_QUAD_MIN (-PERL_QUAD_MAX - ((3 & -1) == 3)) # endif # endif # endif #endif /* This is based on code from 5.003 perl.h */ #ifdef HAS_QUAD # ifdef cray #ifndef IVTYPE # define IVTYPE int #endif #ifndef IV_MIN # define IV_MIN PERL_INT_MIN #endif #ifndef IV_MAX # define IV_MAX PERL_INT_MAX #endif #ifndef UV_MIN # define UV_MIN PERL_UINT_MIN #endif #ifndef UV_MAX # define UV_MAX PERL_UINT_MAX #endif # ifdef INTSIZE #ifndef IVSIZE # define IVSIZE INTSIZE #endif # endif # else # if defined(convex) || defined(uts) #ifndef IVTYPE # define IVTYPE long long #endif #ifndef IV_MIN # define IV_MIN PERL_QUAD_MIN #endif #ifndef IV_MAX # define IV_MAX PERL_QUAD_MAX #endif #ifndef UV_MIN # define UV_MIN PERL_UQUAD_MIN #endif #ifndef UV_MAX # define UV_MAX PERL_UQUAD_MAX #endif # ifdef LONGLONGSIZE #ifndef IVSIZE # define IVSIZE LONGLONGSIZE #endif # endif # else #ifndef IVTYPE # define IVTYPE long #endif #ifndef IV_MIN # define IV_MIN PERL_LONG_MIN #endif #ifndef IV_MAX # define IV_MAX PERL_LONG_MAX #endif #ifndef UV_MIN # define UV_MIN PERL_ULONG_MIN #endif #ifndef UV_MAX # define UV_MAX PERL_ULONG_MAX #endif # ifdef LONGSIZE #ifndef IVSIZE # define IVSIZE LONGSIZE #endif # endif # endif # endif #ifndef IVSIZE # define IVSIZE 8 #endif #ifndef LONGSIZE # define LONGSIZE 8 #endif #ifndef PERL_QUAD_MIN # define PERL_QUAD_MIN IV_MIN #endif #ifndef PERL_QUAD_MAX # define PERL_QUAD_MAX IV_MAX #endif #ifndef PERL_UQUAD_MIN # define PERL_UQUAD_MIN UV_MIN #endif #ifndef PERL_UQUAD_MAX # define PERL_UQUAD_MAX UV_MAX #endif #else #ifndef IVTYPE # define IVTYPE long #endif #ifndef LONGSIZE # define LONGSIZE 4 #endif #ifndef IV_MIN # define IV_MIN PERL_LONG_MIN #endif #ifndef IV_MAX # define IV_MAX PERL_LONG_MAX #endif #ifndef UV_MIN # define UV_MIN PERL_ULONG_MIN #endif #ifndef UV_MAX # define UV_MAX PERL_ULONG_MAX #endif #endif #ifndef IVSIZE # ifdef LONGSIZE # define IVSIZE LONGSIZE # else # define IVSIZE 4 /* A bold guess, but the best we can make. */ # endif #endif #ifndef UVTYPE # define UVTYPE unsigned IVTYPE #endif #ifndef UVSIZE # define UVSIZE IVSIZE #endif #ifndef PERL_SIGNALS_UNSAFE_FLAG #define PERL_SIGNALS_UNSAFE_FLAG 0x0001 #if (PERL_BCDVERSION < 0x5008000) # define D_PPP_PERL_SIGNALS_INIT PERL_SIGNALS_UNSAFE_FLAG #else # define D_PPP_PERL_SIGNALS_INIT 0 #endif #if defined(NEED_PL_signals) static U32 DPPP_(my_PL_signals) = D_PPP_PERL_SIGNALS_INIT; #elif defined(NEED_PL_signals_GLOBAL) U32 DPPP_(my_PL_signals) = D_PPP_PERL_SIGNALS_INIT; #else extern U32 DPPP_(my_PL_signals); #endif #define PL_signals DPPP_(my_PL_signals) #endif /* Hint: PL_ppaddr * Calling an op via PL_ppaddr requires passing a context argument * for threaded builds. Since the context argument is different for * 5.005 perls, you can use aTHXR (supplied by ppport.h), which will * automatically be defined as the correct argument. */ #if (PERL_BCDVERSION <= 0x5005005) /* Replace: 1 */ # define PL_ppaddr ppaddr # define PL_no_modify no_modify /* Replace: 0 */ #endif #if (PERL_BCDVERSION <= 0x5004005) /* Replace: 1 */ # define PL_DBsignal DBsignal # define PL_DBsingle DBsingle # define PL_DBsub DBsub # define PL_DBtrace DBtrace # define PL_Sv Sv # define PL_Xpv Xpv # define PL_bufend bufend # define PL_bufptr bufptr # define PL_compiling compiling # define PL_copline copline # define PL_curcop curcop # define PL_curstash curstash # define PL_debstash debstash # define PL_defgv defgv # define PL_diehook diehook # define PL_dirty dirty # define PL_dowarn dowarn # define PL_errgv errgv # define PL_error_count error_count # define PL_expect expect # define PL_hexdigit hexdigit # define PL_hints hints # define PL_in_my in_my # define PL_laststatval laststatval # define PL_lex_state lex_state # define PL_lex_stuff lex_stuff # define PL_linestr linestr # define PL_na na # define PL_perl_destruct_level perl_destruct_level # define PL_perldb perldb # define PL_rsfp_filters rsfp_filters # define PL_rsfp rsfp # define PL_stack_base stack_base # define PL_stack_sp stack_sp # define PL_statcache statcache # define PL_stdingv stdingv # define PL_sv_arenaroot sv_arenaroot # define PL_sv_no sv_no # define PL_sv_undef sv_undef # define PL_sv_yes sv_yes # define PL_tainted tainted # define PL_tainting tainting # define PL_tokenbuf tokenbuf # define PL_mess_sv mess_sv /* Replace: 0 */ #endif /* Warning: PL_parser * For perl versions earlier than 5.9.5, this is an always * non-NULL dummy. Also, it cannot be dereferenced. Don't * use it if you can avoid it, and unless you absolutely know * what you're doing. * If you always check that PL_parser is non-NULL, you can * define DPPP_PL_parser_NO_DUMMY to avoid the creation of * a dummy parser structure. */ #if (PERL_BCDVERSION >= 0x5009005) # ifdef DPPP_PL_parser_NO_DUMMY # define D_PPP_my_PL_parser_var(var) ((PL_parser ? PL_parser : \ (croak("panic: PL_parser == NULL in %s:%d", \ __FILE__, __LINE__), (yy_parser *) NULL))->var) # else # ifdef DPPP_PL_parser_NO_DUMMY_WARNING # define D_PPP_parser_dummy_warning(var) # else # define D_PPP_parser_dummy_warning(var) \ warn("warning: dummy PL_" #var " used in %s:%d", __FILE__, __LINE__), # endif # define D_PPP_my_PL_parser_var(var) ((PL_parser ? PL_parser : \ (D_PPP_parser_dummy_warning(var) &DPPP_(dummy_PL_parser)))->var) #if defined(NEED_PL_parser) static yy_parser DPPP_(dummy_PL_parser); #elif defined(NEED_PL_parser_GLOBAL) yy_parser DPPP_(dummy_PL_parser); #else extern yy_parser DPPP_(dummy_PL_parser); #endif # endif /* PL_expect, PL_copline, PL_rsfp, PL_rsfp_filters, PL_linestr, PL_bufptr, PL_bufend, PL_lex_state, PL_lex_stuff, PL_tokenbuf depends on PL_parser */ /* Warning: PL_expect, PL_copline, PL_rsfp, PL_rsfp_filters, PL_linestr, PL_bufptr, PL_bufend, PL_lex_state, PL_lex_stuff, PL_tokenbuf * Do not use this variable unless you know exactly what you're * doing. It is internal to the perl parser and may change or even * be removed in the future. As of perl 5.9.5, you have to check * for (PL_parser != NULL) for this variable to have any effect. * An always non-NULL PL_parser dummy is provided for earlier * perl versions. * If PL_parser is NULL when you try to access this variable, a * dummy is being accessed instead and a warning is issued unless * you define DPPP_PL_parser_NO_DUMMY_WARNING. * If DPPP_PL_parser_NO_DUMMY is defined, the code trying to access * this variable will croak with a panic message. */ # define PL_expect D_PPP_my_PL_parser_var(expect) # define PL_copline D_PPP_my_PL_parser_var(copline) # define PL_rsfp D_PPP_my_PL_parser_var(rsfp) # define PL_rsfp_filters D_PPP_my_PL_parser_var(rsfp_filters) # define PL_linestr D_PPP_my_PL_parser_var(linestr) # define PL_bufptr D_PPP_my_PL_parser_var(bufptr) # define PL_bufend D_PPP_my_PL_parser_var(bufend) # define PL_lex_state D_PPP_my_PL_parser_var(lex_state) # define PL_lex_stuff D_PPP_my_PL_parser_var(lex_stuff) # define PL_tokenbuf D_PPP_my_PL_parser_var(tokenbuf) # define PL_in_my D_PPP_my_PL_parser_var(in_my) # define PL_in_my_stash D_PPP_my_PL_parser_var(in_my_stash) # define PL_error_count D_PPP_my_PL_parser_var(error_count) #else /* ensure that PL_parser != NULL and cannot be dereferenced */ # define PL_parser ((void *) 1) #endif #if (PERL_BCDVERSION <= 0x5003022) # undef start_subparse # if (PERL_BCDVERSION < 0x5003022) #ifndef start_subparse # define start_subparse(a, b) Perl_start_subparse() #endif # else #ifndef start_subparse # define start_subparse(a, b) Perl_start_subparse(b) #endif # endif #if (PERL_BCDVERSION < 0x5003007) foo #endif #endif /* newCONSTSUB from IO.xs is in the core starting with 5.004_63 */ #if (PERL_BCDVERSION < 0x5004063) && (PERL_BCDVERSION != 0x5004005) /* And before that, we need to make sure this gets compiled for the functions * that rely on it */ #define NEED_newCONSTSUB #if defined(NEED_newCONSTSUB) static CV * DPPP_(my_newCONSTSUB)(HV * stash, const char * name, SV * sv); static #else extern CV * DPPP_(my_newCONSTSUB)(HV * stash, const char * name, SV * sv); #endif #if defined(NEED_newCONSTSUB) || defined(NEED_newCONSTSUB_GLOBAL) #ifdef newCONSTSUB # undef newCONSTSUB #endif #define newCONSTSUB(a,b,c) DPPP_(my_newCONSTSUB)(aTHX_ a,b,c) #define Perl_newCONSTSUB DPPP_(my_newCONSTSUB) /* This is just a trick to avoid a dependency of newCONSTSUB on PL_parser */ /* (There's no PL_parser in perl < 5.005, so this is completely safe) */ #define D_PPP_PL_copline PL_copline CV * DPPP_(my_newCONSTSUB)(HV *stash, const char *name, SV *sv) { CV *cv; U32 oldhints = PL_hints; HV *old_cop_stash = PL_curcop->cop_stash; HV *old_curstash = PL_curstash; line_t oldline = PL_curcop->cop_line; PL_curcop->cop_line = D_PPP_PL_copline; PL_hints &= ~HINT_BLOCK_SCOPE; if (stash) PL_curstash = PL_curcop->cop_stash = stash; cv = newSUB( start_subparse(FALSE, 0), newSVOP(OP_CONST, 0, newSVpv((char *) name, 0)), newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */ newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv)) ); PL_hints = oldhints; PL_curcop->cop_stash = old_cop_stash; PL_curstash = old_curstash; PL_curcop->cop_line = oldline; return cv; } #endif #endif #ifndef PERL_MAGIC_sv # define PERL_MAGIC_sv '\0' #endif #ifndef PERL_MAGIC_overload # define PERL_MAGIC_overload 'A' #endif #ifndef PERL_MAGIC_overload_elem # define PERL_MAGIC_overload_elem 'a' #endif #ifndef PERL_MAGIC_overload_table # define PERL_MAGIC_overload_table 'c' #endif #ifndef PERL_MAGIC_bm # define PERL_MAGIC_bm 'B' #endif #ifndef PERL_MAGIC_regdata # define PERL_MAGIC_regdata 'D' #endif #ifndef PERL_MAGIC_regdatum # define PERL_MAGIC_regdatum 'd' #endif #ifndef PERL_MAGIC_env # define PERL_MAGIC_env 'E' #endif #ifndef PERL_MAGIC_envelem # define PERL_MAGIC_envelem 'e' #endif #ifndef PERL_MAGIC_fm # define PERL_MAGIC_fm 'f' #endif #ifndef PERL_MAGIC_regex_global # define PERL_MAGIC_regex_global 'g' #endif #ifndef PERL_MAGIC_isa # define PERL_MAGIC_isa 'I' #endif #ifndef PERL_MAGIC_isaelem # define PERL_MAGIC_isaelem 'i' #endif #ifndef PERL_MAGIC_nkeys # define PERL_MAGIC_nkeys 'k' #endif #ifndef PERL_MAGIC_dbfile # define PERL_MAGIC_dbfile 'L' #endif #ifndef PERL_MAGIC_dbline # define PERL_MAGIC_dbline 'l' #endif #ifndef PERL_MAGIC_mutex # define PERL_MAGIC_mutex 'm' #endif #ifndef PERL_MAGIC_shared # define PERL_MAGIC_shared 'N' #endif #ifndef PERL_MAGIC_shared_scalar # define PERL_MAGIC_shared_scalar 'n' #endif #ifndef PERL_MAGIC_collxfrm # define PERL_MAGIC_collxfrm 'o' #endif #ifndef PERL_MAGIC_tied # define PERL_MAGIC_tied 'P' #endif #ifndef PERL_MAGIC_tiedelem # define PERL_MAGIC_tiedelem 'p' #endif #ifndef PERL_MAGIC_tiedscalar # define PERL_MAGIC_tiedscalar 'q' #endif #ifndef PERL_MAGIC_qr # define PERL_MAGIC_qr 'r' #endif #ifndef PERL_MAGIC_sig # define PERL_MAGIC_sig 'S' #endif #ifndef PERL_MAGIC_sigelem # define PERL_MAGIC_sigelem 's' #endif #ifndef PERL_MAGIC_taint # define PERL_MAGIC_taint 't' #endif #ifndef PERL_MAGIC_uvar # define PERL_MAGIC_uvar 'U' #endif #ifndef PERL_MAGIC_uvar_elem # define PERL_MAGIC_uvar_elem 'u' #endif #ifndef PERL_MAGIC_vstring # define PERL_MAGIC_vstring 'V' #endif #ifndef PERL_MAGIC_vec # define PERL_MAGIC_vec 'v' #endif #ifndef PERL_MAGIC_utf8 # define PERL_MAGIC_utf8 'w' #endif #ifndef PERL_MAGIC_substr # define PERL_MAGIC_substr 'x' #endif #ifndef PERL_MAGIC_defelem # define PERL_MAGIC_defelem 'y' #endif #ifndef PERL_MAGIC_glob # define PERL_MAGIC_glob '*' #endif #ifndef PERL_MAGIC_arylen # define PERL_MAGIC_arylen '#' #endif #ifndef PERL_MAGIC_pos # define PERL_MAGIC_pos '.' #endif #ifndef PERL_MAGIC_backref # define PERL_MAGIC_backref '<' #endif #ifndef PERL_MAGIC_ext # define PERL_MAGIC_ext '~' #endif #ifndef cBOOL # define cBOOL(cbool) ((cbool) ? (bool)1 : (bool)0) #endif #ifndef OpHAS_SIBLING # define OpHAS_SIBLING(o) (cBOOL((o)->op_sibling)) #endif #ifndef OpSIBLING # define OpSIBLING(o) (0 + (o)->op_sibling) #endif #ifndef OpMORESIB_set # define OpMORESIB_set(o, sib) ((o)->op_sibling = (sib)) #endif #ifndef OpLASTSIB_set # define OpLASTSIB_set(o, parent) ((o)->op_sibling = NULL) #endif #ifndef OpMAYBESIB_set # define OpMAYBESIB_set(o, sib, parent) ((o)->op_sibling = (sib)) #endif #ifndef HEf_SVKEY # define HEf_SVKEY -2 #endif #if defined(DEBUGGING) && !defined(__COVERITY__) #ifndef __ASSERT_ # define __ASSERT_(statement) assert(statement), #endif #else #ifndef __ASSERT_ # define __ASSERT_(statement) #endif #endif #ifndef __has_builtin # define __has_builtin(x) 0 #endif #if __has_builtin(__builtin_unreachable) # define D_PPP_HAS_BUILTIN_UNREACHABLE #elif (defined(__GNUC__) && ( __GNUC__ > 4 \ || __GNUC__ == 4 && __GNUC_MINOR__ >= 5)) # define D_PPP_HAS_BUILTIN_UNREACHABLE #endif #ifndef ASSUME # ifdef DEBUGGING # define ASSUME(x) assert(x) # elif defined(_MSC_VER) # define ASSUME(x) __assume(x) # elif defined(__ARMCC_VERSION) # define ASSUME(x) __promise(x) # elif defined(D_PPP_HAS_BUILTIN_UNREACHABLE) # define ASSUME(x) ((x) ? (void) 0 : __builtin_unreachable()) # else # define ASSUME(x) assert(x) # endif #endif #ifndef NOT_REACHED # ifdef D_PPP_HAS_BUILTIN_UNREACHABLE # define NOT_REACHED \ STMT_START { \ ASSUME(!"UNREACHABLE"); __builtin_unreachable(); \ } STMT_END # elif ! defined(__GNUC__) && (defined(__sun) || defined(__hpux)) # define NOT_REACHED # else # define NOT_REACHED ASSUME(!"UNREACHABLE") # endif #endif #ifndef WIDEST_UTYPE # ifdef QUADKIND # ifdef U64TYPE # define WIDEST_UTYPE U64TYPE # else # define WIDEST_UTYPE unsigned Quad_t # endif # else # define WIDEST_UTYPE U32 # endif #endif /* These could become provided if/when they become part of the public API */ #ifndef withinCOUNT # define withinCOUNT(c, l, n) \ (((WIDEST_UTYPE) (((c)) - ((l) | 0))) <= (((WIDEST_UTYPE) ((n) | 0)))) #endif #ifndef inRANGE # define inRANGE(c, l, u) \ ( (sizeof(c) == sizeof(U8)) ? withinCOUNT(((U8) (c)), (l), ((u) - (l))) \ : (sizeof(c) == sizeof(U32)) ? withinCOUNT(((U32) (c)), (l), ((u) - (l))) \ : (withinCOUNT(((WIDEST_UTYPE) (c)), (l), ((u) - (l))))) #endif /* The '| 0' part ensures a compiler error if c is not integer (like e.g., a * pointer) */ #undef FITS_IN_8_BITS /* handy.h version uses a core-only constant */ #ifndef FITS_IN_8_BITS # define FITS_IN_8_BITS(c) ( (sizeof(c) == 1) \ || !(((WIDEST_UTYPE)((c) | 0)) & ~0xFF)) #endif /* Create the macro for "is'macro'_utf8_safe(s, e)". For code points below * 256, it calls the equivalent _L1 macro by converting the UTF-8 to code * point. That is so that it can automatically get the bug fixes done in this * file. */ #define D_PPP_IS_GENERIC_UTF8_SAFE(s, e, macro) \ (((e) - (s)) <= 0 \ ? 0 \ : UTF8_IS_INVARIANT((s)[0]) \ ? is ## macro ## _L1((s)[0]) \ : (((e) - (s)) < UTF8SKIP(s)) \ ? 0 \ : UTF8_IS_DOWNGRADEABLE_START((s)[0]) \ /* The cast in the line below is only to silence warnings */ \ ? is ## macro ## _L1((WIDEST_UTYPE) LATIN1_TO_NATIVE( \ UTF8_ACCUMULATE(NATIVE_UTF8_TO_I8((s)[0]) \ & UTF_START_MASK(2), \ (s)[1]))) \ : is ## macro ## _utf8(s)) /* Create the macro for "is'macro'_LC_utf8_safe(s, e)". For code points below * 256, it calls the equivalent _L1 macro by converting the UTF-8 to code * point. That is so that it can automatically get the bug fixes done in this * file. */ #define D_PPP_IS_GENERIC_LC_UTF8_SAFE(s, e, macro) \ (((e) - (s)) <= 0 \ ? 0 \ : UTF8_IS_INVARIANT((s)[0]) \ ? is ## macro ## _LC((s)[0]) \ : (((e) - (s)) < UTF8SKIP(s)) \ ? 0 \ : UTF8_IS_DOWNGRADEABLE_START((s)[0]) \ /* The cast in the line below is only to silence warnings */ \ ? is ## macro ## _LC((WIDEST_UTYPE) LATIN1_TO_NATIVE( \ UTF8_ACCUMULATE(NATIVE_UTF8_TO_I8((s)[0]) \ & UTF_START_MASK(2), \ (s)[1]))) \ : is ## macro ## _utf8(s)) /* A few of the early functions are broken. For these and the non-LC case, * machine generated code is substituted. But that code doesn't work for * locales. This is just like the above macro, but at the end, we call the * macro we've generated for the above 255 case, which is correct since locale * isn't involved. This will generate extra code to handle the 0-255 inputs, * but hopefully it will be optimized out by the C compiler. But just in case * it isn't, this macro is only used on the few versions that are broken */ #define D_PPP_IS_GENERIC_LC_UTF8_SAFE_BROKEN(s, e, macro) \ (((e) - (s)) <= 0 \ ? 0 \ : UTF8_IS_INVARIANT((s)[0]) \ ? is ## macro ## _LC((s)[0]) \ : (((e) - (s)) < UTF8SKIP(s)) \ ? 0 \ : UTF8_IS_DOWNGRADEABLE_START((s)[0]) \ /* The cast in the line below is only to silence warnings */ \ ? is ## macro ## _LC((WIDEST_UTYPE) LATIN1_TO_NATIVE( \ UTF8_ACCUMULATE(NATIVE_UTF8_TO_I8((s)[0]) \ & UTF_START_MASK(2), \ (s)[1]))) \ : is ## macro ## _utf8_safe(s, e)) #ifndef SvRX # define SvRX(rv) (SvROK((rv)) ? (SvMAGICAL(SvRV((rv))) ? (mg_find(SvRV((rv)), PERL_MAGIC_qr) ? mg_find(SvRV((rv)), PERL_MAGIC_qr)->mg_obj : NULL) : NULL) : NULL) #endif #ifndef SvRXOK # define SvRXOK(sv) (!!SvRX(sv)) #endif #ifndef PERL_UNUSED_DECL # ifdef HASATTRIBUTE # if (defined(__GNUC__) && defined(__cplusplus)) || defined(__INTEL_COMPILER) # define PERL_UNUSED_DECL # else # define PERL_UNUSED_DECL __attribute__((unused)) # endif # else # define PERL_UNUSED_DECL # endif #endif #ifndef PERL_UNUSED_ARG # if defined(lint) && defined(S_SPLINT_S) /* www.splint.org */ # include <note.h> # define PERL_UNUSED_ARG(x) NOTE(ARGUNUSED(x)) # else # define PERL_UNUSED_ARG(x) ((void)x) # endif #endif #ifndef PERL_UNUSED_VAR # define PERL_UNUSED_VAR(x) ((void)x) #endif #ifndef PERL_UNUSED_CONTEXT # ifdef USE_ITHREADS # define PERL_UNUSED_CONTEXT PERL_UNUSED_ARG(my_perl) # else # define PERL_UNUSED_CONTEXT # endif #endif #ifndef PERL_UNUSED_RESULT # if defined(__GNUC__) && defined(HASATTRIBUTE_WARN_UNUSED_RESULT) # define PERL_UNUSED_RESULT(v) STMT_START { __typeof__(v) z = (v); (void)sizeof(z); } STMT_END # else # define PERL_UNUSED_RESULT(v) ((void)(v)) # endif #endif #ifndef NOOP # define NOOP /*EMPTY*/(void)0 #endif #ifndef dNOOP # define dNOOP extern int /*@unused@*/ Perl___notused PERL_UNUSED_DECL #endif #ifndef NVTYPE # if defined(USE_LONG_DOUBLE) && defined(HAS_LONG_DOUBLE) # define NVTYPE long double # else # define NVTYPE double # endif typedef NVTYPE NV; #endif #ifndef INT2PTR # if (IVSIZE == PTRSIZE) && (UVSIZE == PTRSIZE) # define PTRV UV # define INT2PTR(any,d) (any)(d) # else # if PTRSIZE == LONGSIZE # define PTRV unsigned long # else # define PTRV unsigned # endif # define INT2PTR(any,d) (any)(PTRV)(d) # endif #endif #ifndef PTR2ul # if PTRSIZE == LONGSIZE # define PTR2ul(p) (unsigned long)(p) # else # define PTR2ul(p) INT2PTR(unsigned long,p) # endif #endif #ifndef PTR2nat # define PTR2nat(p) (PTRV)(p) #endif #ifndef NUM2PTR # define NUM2PTR(any,d) (any)PTR2nat(d) #endif #ifndef PTR2IV # define PTR2IV(p) INT2PTR(IV,p) #endif #ifndef PTR2UV # define PTR2UV(p) INT2PTR(UV,p) #endif #ifndef PTR2NV # define PTR2NV(p) NUM2PTR(NV,p) #endif #undef START_EXTERN_C #undef END_EXTERN_C #undef EXTERN_C #ifdef __cplusplus # define START_EXTERN_C extern "C" { # define END_EXTERN_C } # define EXTERN_C extern "C" #else # define START_EXTERN_C # define END_EXTERN_C # define EXTERN_C extern #endif #if (PERL_BCDVERSION < 0x5004000) || defined(PERL_GCC_PEDANTIC) # ifndef PERL_GCC_BRACE_GROUPS_FORBIDDEN #ifndef PERL_GCC_BRACE_GROUPS_FORBIDDEN # define PERL_GCC_BRACE_GROUPS_FORBIDDEN #endif # endif #endif #if defined(__GNUC__) && !defined(PERL_GCC_BRACE_GROUPS_FORBIDDEN) && !defined(__cplusplus) # ifndef PERL_USE_GCC_BRACE_GROUPS # define PERL_USE_GCC_BRACE_GROUPS # endif #endif #undef STMT_START #undef STMT_END #if defined(VOIDFLAGS) && defined(PERL_USE_GCC_BRACE_GROUPS) # define STMT_START (void)( /* gcc supports ``({ STATEMENTS; })'' */ # define STMT_END ) #else # if defined(VOIDFLAGS) && (VOIDFLAGS) && (defined(sun) || defined(__sun__)) && !defined(__GNUC__) # define STMT_START if (1) # define STMT_END else (void)0 # else # define STMT_START do # define STMT_END while (0) # endif #endif #ifndef boolSV # define boolSV(b) ((b) ? &PL_sv_yes : &PL_sv_no) #endif /* DEFSV appears first in 5.004_56 */ #ifndef DEFSV # define DEFSV GvSV(PL_defgv) #endif #ifndef SAVE_DEFSV # define SAVE_DEFSV SAVESPTR(GvSV(PL_defgv)) #endif #ifndef DEFSV_set # define DEFSV_set(sv) (DEFSV = (sv)) #endif /* Older perls (<=5.003) lack AvFILLp */ #ifndef AvFILLp # define AvFILLp AvFILL #endif #ifndef av_tindex # define av_tindex AvFILL #endif #ifndef av_top_index # define av_top_index AvFILL #endif #ifndef av_count # define av_count(av) (AvFILL(av)+1) #endif #ifndef ERRSV # define ERRSV get_sv("@",FALSE) #endif /* Hint: gv_stashpvn * This function's backport doesn't support the length parameter, but * rather ignores it. Portability can only be ensured if the length * parameter is used for speed reasons, but the length can always be * correctly computed from the string argument. */ #ifndef gv_stashpvn # define gv_stashpvn(str,len,create) gv_stashpv(str,create) #endif /* Replace: 1 */ #ifndef get_cv # define get_cv perl_get_cv #endif #ifndef get_sv # define get_sv perl_get_sv #endif #ifndef get_av # define get_av perl_get_av #endif #ifndef get_hv # define get_hv perl_get_hv #endif /* Replace: 0 */ #ifndef dUNDERBAR # define dUNDERBAR dNOOP #endif #ifndef UNDERBAR # define UNDERBAR DEFSV #endif #ifndef dAX # define dAX I32 ax = MARK - PL_stack_base + 1 #endif #ifndef dITEMS # define dITEMS I32 items = SP - MARK #endif #ifndef dXSTARG # define dXSTARG SV * targ = sv_newmortal() #endif #ifndef dAXMARK # define dAXMARK I32 ax = POPMARK; \ SV ** const mark = PL_stack_base + ax++ #endif #ifndef XSprePUSH # define XSprePUSH (sp = PL_stack_base + ax - 1) #endif #if (PERL_BCDVERSION < 0x5005000) # undef XSRETURN # define XSRETURN(off) \ STMT_START { \ PL_stack_sp = PL_stack_base + ax + ((off) - 1); \ return; \ } STMT_END #endif #ifndef XSPROTO # define XSPROTO(name) void name(pTHX_ CV* cv) #endif #ifndef SVfARG # define SVfARG(p) ((void*)(p)) #endif #ifndef PERL_ABS # define PERL_ABS(x) ((x) < 0 ? -(x) : (x)) #endif #ifndef dVAR # define dVAR dNOOP #endif #ifndef SVf # define SVf "_" #endif #ifndef CPERLscope # define CPERLscope(x) x #endif #ifndef PERL_HASH # define PERL_HASH(hash,str,len) \ STMT_START { \ const char *s_PeRlHaSh = str; \ I32 i_PeRlHaSh = len; \ U32 hash_PeRlHaSh = 0; \ while (i_PeRlHaSh--) \ hash_PeRlHaSh = hash_PeRlHaSh * 33 + *s_PeRlHaSh++; \ (hash) = hash_PeRlHaSh; \ } STMT_END #endif #ifndef PERLIO_FUNCS_DECL # ifdef PERLIO_FUNCS_CONST # define PERLIO_FUNCS_DECL(funcs) const PerlIO_funcs funcs # define PERLIO_FUNCS_CAST(funcs) (PerlIO_funcs*)(funcs) # else # define PERLIO_FUNCS_DECL(funcs) PerlIO_funcs funcs # define PERLIO_FUNCS_CAST(funcs) (funcs) # endif #endif /* provide these typedefs for older perls */ #if (PERL_BCDVERSION < 0x5009003) # ifdef ARGSproto typedef OP* (CPERLscope(*Perl_ppaddr_t))(ARGSproto); # else typedef OP* (CPERLscope(*Perl_ppaddr_t))(pTHX); # endif typedef OP* (CPERLscope(*Perl_check_t)) (pTHX_ OP*); #endif /* On versions without NATIVE_TO_ASCII, only ASCII is supported */ #if defined(EBCDIC) && defined(NATIVE_TO_ASCI) #ifndef NATIVE_TO_LATIN1 # define NATIVE_TO_LATIN1(c) NATIVE_TO_ASCII(c) #endif #ifndef LATIN1_TO_NATIVE # define LATIN1_TO_NATIVE(c) ASCII_TO_NATIVE(c) #endif #ifndef NATIVE_TO_UNI # define NATIVE_TO_UNI(c) ((c) > 255 ? (c) : NATIVE_TO_LATIN1(c)) #endif #ifndef UNI_TO_NATIVE # define UNI_TO_NATIVE(c) ((c) > 255 ? (c) : LATIN1_TO_NATIVE(c)) #endif #else #ifndef NATIVE_TO_LATIN1 # define NATIVE_TO_LATIN1(c) (c) #endif #ifndef LATIN1_TO_NATIVE # define LATIN1_TO_NATIVE(c) (c) #endif #ifndef NATIVE_TO_UNI # define NATIVE_TO_UNI(c) (c) #endif #ifndef UNI_TO_NATIVE # define UNI_TO_NATIVE(c) (c) #endif #endif /* Warning: LATIN1_TO_NATIVE, NATIVE_TO_LATIN1 NATIVE_TO_UNI UNI_TO_NATIVE EBCDIC is not supported on versions earlier than 5.7.1 */ /* The meaning of this changed; use the modern version */ #undef isPSXSPC #undef isPSXSPC_A #undef isPSXSPC_L1 /* Hint: isPSXSPC, isPSXSPC_A, isPSXSPC_L1, isPSXSPC_utf8_safe This is equivalent to the corresponding isSPACE-type macro. On perls before 5.18, this matched a vertical tab and SPACE didn't. But the ppport.h SPACE version does match VT in all perl releases. Since VT's are extremely rarely found in real-life files, this difference effectively doesn't matter */ /* Hint: isSPACE, isSPACE_A, isSPACE_L1, isSPACE_utf8_safe Until Perl 5.18, this did not match the vertical tab (VT). The ppport.h version does match it in all perl releases. Since VT's are extremely rarely found in real-life files, this difference effectively doesn't matter */ #ifdef EBCDIC /* This is the first version where these macros are fully correct on EBCDIC * platforms. Relying on the C library functions, as earlier releases did, * causes problems with locales */ # if (PERL_BCDVERSION < 0x5022000) # undef isALNUM # undef isALNUM_A # undef isALNUM_L1 # undef isALNUMC # undef isALNUMC_A # undef isALNUMC_L1 # undef isALPHA # undef isALPHA_A # undef isALPHA_L1 # undef isALPHANUMERIC # undef isALPHANUMERIC_A # undef isALPHANUMERIC_L1 # undef isASCII # undef isASCII_A # undef isASCII_L1 # undef isBLANK # undef isBLANK_A # undef isBLANK_L1 # undef isCNTRL # undef isCNTRL_A # undef isCNTRL_L1 # undef isDIGIT # undef isDIGIT_A # undef isDIGIT_L1 # undef isGRAPH # undef isGRAPH_A # undef isGRAPH_L1 # undef isIDCONT # undef isIDCONT_A # undef isIDCONT_L1 # undef isIDFIRST # undef isIDFIRST_A # undef isIDFIRST_L1 # undef isLOWER # undef isLOWER_A # undef isLOWER_L1 # undef isOCTAL # undef isOCTAL_A # undef isOCTAL_L1 # undef isPRINT # undef isPRINT_A # undef isPRINT_L1 # undef isPUNCT # undef isPUNCT_A # undef isPUNCT_L1 # undef isSPACE # undef isSPACE_A # undef isSPACE_L1 # undef isUPPER # undef isUPPER_A # undef isUPPER_L1 # undef isWORDCHAR # undef isWORDCHAR_A # undef isWORDCHAR_L1 # undef isXDIGIT # undef isXDIGIT_A # undef isXDIGIT_L1 # endif #ifndef isASCII # define isASCII(c) (isCNTRL(c) || isPRINT(c)) #endif /* The below is accurate for all EBCDIC code pages supported by * all the versions of Perl overridden by this */ #ifndef isCNTRL # define isCNTRL(c) ( (c) == '\0' || (c) == '\a' || (c) == '\b' \ || (c) == '\f' || (c) == '\n' || (c) == '\r' \ || (c) == '\t' || (c) == '\v' \ || ((c) <= 3 && (c) >= 1) /* SOH, STX, ETX */ \ || (c) == 7 /* U+7F DEL */ \ || ((c) <= 0x13 && (c) >= 0x0E) /* SO, SI */ \ /* DLE, DC[1-3] */ \ || (c) == 0x18 /* U+18 CAN */ \ || (c) == 0x19 /* U+19 EOM */ \ || ((c) <= 0x1F && (c) >= 0x1C) /* [FGRU]S */ \ || (c) == 0x26 /* U+17 ETB */ \ || (c) == 0x27 /* U+1B ESC */ \ || (c) == 0x2D /* U+05 ENQ */ \ || (c) == 0x2E /* U+06 ACK */ \ || (c) == 0x32 /* U+16 SYN */ \ || (c) == 0x37 /* U+04 EOT */ \ || (c) == 0x3C /* U+14 DC4 */ \ || (c) == 0x3D /* U+15 NAK */ \ || (c) == 0x3F /* U+1A SUB */ \ ) #endif #if '^' == 106 /* EBCDIC POSIX-BC */ # define D_PPP_OUTLIER_CONTROL 0x5F #else /* EBCDIC 1047 037 */ # define D_PPP_OUTLIER_CONTROL 0xFF #endif /* The controls are everything below blank, plus one outlier */ #ifndef isCNTRL_L1 # define isCNTRL_L1(c) ((WIDEST_UTYPE) (c) < ' ' \ || (WIDEST_UTYPE) (c) == D_PPP_OUTLIER_CONTROL) #endif /* The ordering of the tests in this and isUPPER are to exclude most characters * early */ #ifndef isLOWER # define isLOWER(c) ( (c) >= 'a' && (c) <= 'z' \ && ( (c) <= 'i' \ || ((c) >= 'j' && (c) <= 'r') \ || (c) >= 's')) #endif #ifndef isUPPER # define isUPPER(c) ( (c) >= 'A' && (c) <= 'Z' \ && ( (c) <= 'I' \ || ((c) >= 'J' && (c) <= 'R') \ || (c) >= 'S')) #endif #else /* Above is EBCDIC; below is ASCII */ # if (PERL_BCDVERSION < 0x5004000) /* The implementation of these in older perl versions can give wrong results if * the C program locale is set to other than the C locale */ # undef isALNUM # undef isALNUM_A # undef isALPHA # undef isALPHA_A # undef isDIGIT # undef isDIGIT_A # undef isIDFIRST # undef isIDFIRST_A # undef isLOWER # undef isLOWER_A # undef isUPPER # undef isUPPER_A # endif # if (PERL_BCDVERSION == 0x5007000) /* this perl made space GRAPH */ # undef isGRAPH # endif # if (PERL_BCDVERSION < 0x5008000) /* earlier perls omitted DEL */ # undef isCNTRL # endif # if (PERL_BCDVERSION < 0x5010000) /* earlier perls included all of the isSPACE() characters, which is wrong. The * version provided by Devel::PPPort always overrides an existing buggy * version. */ # undef isPRINT # undef isPRINT_A # endif # if (PERL_BCDVERSION < 0x5014000) /* earlier perls always returned true if the parameter was a signed char */ # undef isASCII # undef isASCII_A # endif # if (PERL_BCDVERSION < 0x5017008) /* earlier perls didn't include PILCROW, SECTION SIGN */ # undef isPUNCT_L1 # endif # if (PERL_BCDVERSION < 0x5013007) /* khw didn't investigate why this failed */ # undef isALNUMC_L1 #endif # if (PERL_BCDVERSION < 0x5020000) /* earlier perls didn't include \v */ # undef isSPACE # undef isSPACE_A # undef isSPACE_L1 # endif #ifndef isASCII # define isASCII(c) ((WIDEST_UTYPE) (c) <= 127) #endif #ifndef isCNTRL # define isCNTRL(c) ((WIDEST_UTYPE) (c) < ' ' || (c) == 127) #endif #ifndef isCNTRL_L1 # define isCNTRL_L1(c) ( (WIDEST_UTYPE) (c) < ' ' \ || inRANGE((c), 0x7F, 0x9F)) #endif #ifndef isLOWER # define isLOWER(c) inRANGE((c), 'a', 'z') #endif #ifndef isUPPER # define isUPPER(c) inRANGE((c), 'A', 'Z') #endif #endif /* Below are definitions common to EBCDIC and ASCII */ #ifndef isASCII_L1 # define isASCII_L1(c) isASCII(c) #endif #ifndef isASCII_LC # define isASCII_LC(c) isASCII(c) #endif #ifndef isALNUM # define isALNUM(c) isWORDCHAR(c) #endif #ifndef isALNUMC # define isALNUMC(c) isALPHANUMERIC(c) #endif #ifndef isALNUMC_L1 # define isALNUMC_L1(c) isALPHANUMERIC_L1(c) #endif #ifndef isALPHA # define isALPHA(c) (isUPPER(c) || isLOWER(c)) #endif #ifndef isALPHA_L1 # define isALPHA_L1(c) (isUPPER_L1(c) || isLOWER_L1(c)) #endif #ifndef isALPHANUMERIC # define isALPHANUMERIC(c) (isALPHA(c) || isDIGIT(c)) #endif #ifndef isALPHANUMERIC_L1 # define isALPHANUMERIC_L1(c) (isALPHA_L1(c) || isDIGIT(c)) #endif #ifndef isALPHANUMERIC_LC # define isALPHANUMERIC_LC(c) (isALPHA_LC(c) || isDIGIT_LC(c)) #endif #ifndef isBLANK # define isBLANK(c) ((c) == ' ' || (c) == '\t') #endif #ifndef isBLANK_L1 # define isBLANK_L1(c) ( isBLANK(c) \ || ( FITS_IN_8_BITS(c) \ && NATIVE_TO_LATIN1((U8) c) == 0xA0)) #endif #ifndef isBLANK_LC # define isBLANK_LC(c) isBLANK(c) #endif #ifndef isDIGIT # define isDIGIT(c) inRANGE(c, '0', '9') #endif #ifndef isDIGIT_L1 # define isDIGIT_L1(c) isDIGIT(c) #endif #ifndef isGRAPH # define isGRAPH(c) (isWORDCHAR(c) || isPUNCT(c)) #endif #ifndef isGRAPH_L1 # define isGRAPH_L1(c) ( isPRINT_L1(c) \ && (c) != ' ' \ && NATIVE_TO_LATIN1((U8) c) != 0xA0) #endif #ifndef isIDCONT # define isIDCONT(c) isWORDCHAR(c) #endif #ifndef isIDCONT_L1 # define isIDCONT_L1(c) isWORDCHAR_L1(c) #endif #ifndef isIDCONT_LC # define isIDCONT_LC(c) isWORDCHAR_LC(c) #endif #ifndef isIDFIRST # define isIDFIRST(c) (isALPHA(c) || (c) == '_') #endif #ifndef isIDFIRST_L1 # define isIDFIRST_L1(c) (isALPHA_L1(c) || (U8) (c) == '_') #endif #ifndef isIDFIRST_LC # define isIDFIRST_LC(c) (isALPHA_LC(c) || (U8) (c) == '_') #endif #ifndef isLOWER_L1 # define isLOWER_L1(c) ( isLOWER(c) \ || ( FITS_IN_8_BITS(c) \ && ( ( NATIVE_TO_LATIN1((U8) c) >= 0xDF \ && NATIVE_TO_LATIN1((U8) c) != 0xF7) \ || NATIVE_TO_LATIN1((U8) c) == 0xAA \ || NATIVE_TO_LATIN1((U8) c) == 0xBA \ || NATIVE_TO_LATIN1((U8) c) == 0xB5))) #endif #ifndef isOCTAL # define isOCTAL(c) (((WIDEST_UTYPE)((c)) & ~7) == '0') #endif #ifndef isOCTAL_L1 # define isOCTAL_L1(c) isOCTAL(c) #endif #ifndef isPRINT # define isPRINT(c) (isGRAPH(c) || (c) == ' ') #endif #ifndef isPRINT_L1 # define isPRINT_L1(c) (FITS_IN_8_BITS(c) && ! isCNTRL_L1(c)) #endif #ifndef isPSXSPC # define isPSXSPC(c) isSPACE(c) #endif #ifndef isPSXSPC_L1 # define isPSXSPC_L1(c) isSPACE_L1(c) #endif #ifndef isPUNCT # define isPUNCT(c) ( (c) == '-' || (c) == '!' || (c) == '"' \ || (c) == '#' || (c) == '$' || (c) == '%' \ || (c) == '&' || (c) == '\'' || (c) == '(' \ || (c) == ')' || (c) == '*' || (c) == '+' \ || (c) == ',' || (c) == '.' || (c) == '/' \ || (c) == ':' || (c) == ';' || (c) == '<' \ || (c) == '=' || (c) == '>' || (c) == '?' \ || (c) == '@' || (c) == '[' || (c) == '\\' \ || (c) == ']' || (c) == '^' || (c) == '_' \ || (c) == '`' || (c) == '{' || (c) == '|' \ || (c) == '}' || (c) == '~') #endif #ifndef isPUNCT_L1 # define isPUNCT_L1(c) ( isPUNCT(c) \ || ( FITS_IN_8_BITS(c) \ && ( NATIVE_TO_LATIN1((U8) c) == 0xA1 \ || NATIVE_TO_LATIN1((U8) c) == 0xA7 \ || NATIVE_TO_LATIN1((U8) c) == 0xAB \ || NATIVE_TO_LATIN1((U8) c) == 0xB6 \ || NATIVE_TO_LATIN1((U8) c) == 0xB7 \ || NATIVE_TO_LATIN1((U8) c) == 0xBB \ || NATIVE_TO_LATIN1((U8) c) == 0xBF))) #endif #ifndef isSPACE # define isSPACE(c) ( isBLANK(c) || (c) == '\n' || (c) == '\r' \ || (c) == '\v' || (c) == '\f') #endif #ifndef isSPACE_L1 # define isSPACE_L1(c) ( isSPACE(c) \ || (FITS_IN_8_BITS(c) \ && ( NATIVE_TO_LATIN1((U8) c) == 0x85 \ || NATIVE_TO_LATIN1((U8) c) == 0xA0))) #endif #ifndef isUPPER_L1 # define isUPPER_L1(c) ( isUPPER(c) \ || (FITS_IN_8_BITS(c) \ && ( NATIVE_TO_LATIN1((U8) c) >= 0xC0 \ && NATIVE_TO_LATIN1((U8) c) <= 0xDE \ && NATIVE_TO_LATIN1((U8) c) != 0xD7))) #endif #ifndef isWORDCHAR # define isWORDCHAR(c) (isALPHANUMERIC(c) || (c) == '_') #endif #ifndef isWORDCHAR_L1 # define isWORDCHAR_L1(c) (isIDFIRST_L1(c) || isDIGIT(c)) #endif #ifndef isWORDCHAR_LC # define isWORDCHAR_LC(c) (isIDFIRST_LC(c) || isDIGIT_LC(c)) #endif #ifndef isXDIGIT # define isXDIGIT(c) ( isDIGIT(c) \ || inRANGE((c), 'a', 'f') \ || inRANGE((c), 'A', 'F')) #endif #ifndef isXDIGIT_L1 # define isXDIGIT_L1(c) isXDIGIT(c) #endif #ifndef isXDIGIT_LC # define isXDIGIT_LC(c) isxdigit(c) #endif #ifndef isALNUM_A # define isALNUM_A(c) isALNUM(c) #endif #ifndef isALNUMC_A # define isALNUMC_A(c) isALNUMC(c) #endif #ifndef isALPHA_A # define isALPHA_A(c) isALPHA(c) #endif #ifndef isALPHANUMERIC_A # define isALPHANUMERIC_A(c) isALPHANUMERIC(c) #endif #ifndef isASCII_A # define isASCII_A(c) isASCII(c) #endif #ifndef isBLANK_A # define isBLANK_A(c) isBLANK(c) #endif #ifndef isCNTRL_A # define isCNTRL_A(c) isCNTRL(c) #endif #ifndef isDIGIT_A # define isDIGIT_A(c) isDIGIT(c) #endif #ifndef isGRAPH_A # define isGRAPH_A(c) isGRAPH(c) #endif #ifndef isIDCONT_A # define isIDCONT_A(c) isIDCONT(c) #endif #ifndef isIDFIRST_A # define isIDFIRST_A(c) isIDFIRST(c) #endif #ifndef isLOWER_A # define isLOWER_A(c) isLOWER(c) #endif #ifndef isOCTAL_A # define isOCTAL_A(c) isOCTAL(c) #endif #ifndef isPRINT_A # define isPRINT_A(c) isPRINT(c) #endif #ifndef isPSXSPC_A # define isPSXSPC_A(c) isPSXSPC(c) #endif #ifndef isPUNCT_A # define isPUNCT_A(c) isPUNCT(c) #endif #ifndef isSPACE_A # define isSPACE_A(c) isSPACE(c) #endif #ifndef isUPPER_A # define isUPPER_A(c) isUPPER(c) #endif #ifndef isWORDCHAR_A # define isWORDCHAR_A(c) isWORDCHAR(c) #endif #ifndef isXDIGIT_A # define isXDIGIT_A(c) isXDIGIT(c) #endif #ifndef isASCII_utf8_safe # define isASCII_utf8_safe(s,e) (((e) - (s)) <= 0 ? 0 : isASCII(*(s))) #endif #ifndef isASCII_uvchr # define isASCII_uvchr(c) (FITS_IN_8_BITS(c) ? isASCII_L1(c) : 0) #endif #if (PERL_BCDVERSION >= 0x5006000) # ifdef isALPHA_uni /* If one defined, all are; this is just an exemplar */ # define D_PPP_is_ctype(upper, lower, c) \ (FITS_IN_8_BITS(c) \ ? is ## upper ## _L1(c) \ : is ## upper ## _uni((UV) (c))) /* _uni is old synonym */ # else # define D_PPP_is_ctype(upper, lower, c) \ (FITS_IN_8_BITS(c) \ ? is ## upper ## _L1(c) \ : is_uni_ ## lower((UV) (c))) /* is_uni_ is even older */ # endif #ifndef isALPHA_uvchr # define isALPHA_uvchr(c) D_PPP_is_ctype(ALPHA, alpha, c) #endif #ifndef isALPHANUMERIC_uvchr # define isALPHANUMERIC_uvchr(c) (isALPHA_uvchr(c) || isDIGIT_uvchr(c)) #endif # ifdef is_uni_blank #ifndef isBLANK_uvchr # define isBLANK_uvchr(c) D_PPP_is_ctype(BLANK, blank, c) #endif # else #ifndef isBLANK_uvchr # define isBLANK_uvchr(c) (FITS_IN_8_BITS(c) \ ? isBLANK_L1(c) \ : ( (UV) (c) == 0x1680 /* Unicode 3.0 */ \ || inRANGE((UV) (c), 0x2000, 0x200A) \ || (UV) (c) == 0x202F /* Unicode 3.0 */\ || (UV) (c) == 0x205F /* Unicode 3.2 */\ || (UV) (c) == 0x3000)) #endif # endif #ifndef isCNTRL_uvchr # define isCNTRL_uvchr(c) D_PPP_is_ctype(CNTRL, cntrl, c) #endif #ifndef isDIGIT_uvchr # define isDIGIT_uvchr(c) D_PPP_is_ctype(DIGIT, digit, c) #endif #ifndef isGRAPH_uvchr # define isGRAPH_uvchr(c) D_PPP_is_ctype(GRAPH, graph, c) #endif #ifndef isIDCONT_uvchr # define isIDCONT_uvchr(c) isWORDCHAR_uvchr(c) #endif #ifndef isIDFIRST_uvchr # define isIDFIRST_uvchr(c) D_PPP_is_ctype(IDFIRST, idfirst, c) #endif #ifndef isLOWER_uvchr # define isLOWER_uvchr(c) D_PPP_is_ctype(LOWER, lower, c) #endif #ifndef isPRINT_uvchr # define isPRINT_uvchr(c) D_PPP_is_ctype(PRINT, print, c) #endif #ifndef isPSXSPC_uvchr # define isPSXSPC_uvchr(c) isSPACE_uvchr(c) #endif #ifndef isPUNCT_uvchr # define isPUNCT_uvchr(c) D_PPP_is_ctype(PUNCT, punct, c) #endif #ifndef isSPACE_uvchr # define isSPACE_uvchr(c) D_PPP_is_ctype(SPACE, space, c) #endif #ifndef isUPPER_uvchr # define isUPPER_uvchr(c) D_PPP_is_ctype(UPPER, upper, c) #endif #ifndef isXDIGIT_uvchr # define isXDIGIT_uvchr(c) D_PPP_is_ctype(XDIGIT, xdigit, c) #endif #ifndef isWORDCHAR_uvchr # define isWORDCHAR_uvchr(c) (FITS_IN_8_BITS(c) \ ? isWORDCHAR_L1(c) : isALPHANUMERIC_uvchr(c)) #endif #ifndef isALPHA_utf8_safe # define isALPHA_utf8_safe(s,e) D_PPP_IS_GENERIC_UTF8_SAFE(s, e, ALPHA) #endif # ifdef isALPHANUMERIC_utf8 #ifndef isALPHANUMERIC_utf8_safe # define isALPHANUMERIC_utf8_safe(s,e) \ D_PPP_IS_GENERIC_UTF8_SAFE(s, e, ALPHANUMERIC) #endif # else #ifndef isALPHANUMERIC_utf8_safe # define isALPHANUMERIC_utf8_safe(s,e) \ (isALPHA_utf8_safe(s,e) || isDIGIT_utf8_safe(s,e)) #endif # endif /* This was broken before 5.18, and just use this instead of worrying about * which releases the official works on */ # if 'A' == 65 #ifndef isBLANK_utf8_safe # define isBLANK_utf8_safe(s,e) \ ( ( LIKELY((e) > (s)) ) ? /* Machine generated */ \ ( ( 0x09 == ((const U8*)s)[0] || 0x20 == ((const U8*)s)[0] ) ? 1 \ : ( LIKELY(((e) - (s)) >= UTF8SKIP(s)) ) ? \ ( ( 0xC2 == ((const U8*)s)[0] ) ? \ ( ( 0xA0 == ((const U8*)s)[1] ) ? 2 : 0 ) \ : ( 0xE1 == ((const U8*)s)[0] ) ? \ ( ( ( 0x9A == ((const U8*)s)[1] ) && ( 0x80 == ((const U8*)s)[2] ) ) ? 3 : 0 )\ : ( 0xE2 == ((const U8*)s)[0] ) ? \ ( ( 0x80 == ((const U8*)s)[1] ) ? \ ( ( inRANGE(((const U8*)s)[2], 0x80, 0x8A ) || 0xAF == ((const U8*)s)[2] ) ? 3 : 0 )\ : ( ( 0x81 == ((const U8*)s)[1] ) && ( 0x9F == ((const U8*)s)[2] ) ) ? 3 : 0 )\ : ( ( ( 0xE3 == ((const U8*)s)[0] ) && ( 0x80 == ((const U8*)s)[1] ) ) && ( 0x80 == ((const U8*)s)[2] ) ) ? 3 : 0 )\ : 0 ) \ : 0 ) #endif # elif 'A' == 193 && '^' == 95 /* EBCDIC 1047 */ #ifndef isBLANK_utf8_safe # define isBLANK_utf8_safe(s,e) \ ( ( LIKELY((e) > (s)) ) ? \ ( ( 0x05 == ((const U8*)s)[0] || 0x40 == ((const U8*)s)[0] ) ? 1 \ : ( LIKELY(((e) - (s)) >= UTF8SKIP(s)) ) ? \ ( ( 0x80 == ((const U8*)s)[0] ) ? \ ( ( 0x41 == ((const U8*)s)[1] ) ? 2 : 0 ) \ : ( 0xBC == ((const U8*)s)[0] ) ? \ ( ( ( 0x63 == ((const U8*)s)[1] ) && ( 0x41 == ((const U8*)s)[2] ) ) ? 3 : 0 )\ : ( 0xCA == ((const U8*)s)[0] ) ? \ ( ( 0x41 == ((const U8*)s)[1] ) ? \ ( ( inRANGE(((const U8*)s)[2], 0x41, 0x4A ) || 0x51 == ((const U8*)s)[2] ) ? 3 : 0 )\ : ( 0x42 == ((const U8*)s)[1] ) ? \ ( ( 0x56 == ((const U8*)s)[2] ) ? 3 : 0 ) \ : ( ( 0x43 == ((const U8*)s)[1] ) && ( 0x73 == ((const U8*)s)[2] ) ) ? 3 : 0 )\ : ( ( ( 0xCE == ((const U8*)s)[0] ) && ( 0x41 == ((const U8*)s)[1] ) ) && ( 0x41 == ((const U8*)s)[2] ) ) ? 3 : 0 )\ : 0 ) \ : 0 ) #endif # elif 'A' == 193 && '^' == 176 /* EBCDIC 037 */ #ifndef isBLANK_utf8_safe # define isBLANK_utf8_safe(s,e) \ ( ( LIKELY((e) > (s)) ) ? \ ( ( 0x05 == ((const U8*)s)[0] || 0x40 == ((const U8*)s)[0] ) ? 1 \ : ( LIKELY(((e) - (s)) >= UTF8SKIP(s)) ) ? \ ( ( 0x78 == ((const U8*)s)[0] ) ? \ ( ( 0x41 == ((const U8*)s)[1] ) ? 2 : 0 ) \ : ( 0xBD == ((const U8*)s)[0] ) ? \ ( ( ( 0x62 == ((const U8*)s)[1] ) && ( 0x41 == ((const U8*)s)[2] ) ) ? 3 : 0 )\ : ( 0xCA == ((const U8*)s)[0] ) ? \ ( ( 0x41 == ((const U8*)s)[1] ) ? \ ( ( inRANGE(((const U8*)s)[2], 0x41, 0x4A ) || 0x51 == ((const U8*)s)[2] ) ? 3 : 0 )\ : ( 0x42 == ((const U8*)s)[1] ) ? \ ( ( 0x56 == ((const U8*)s)[2] ) ? 3 : 0 ) \ : ( ( 0x43 == ((const U8*)s)[1] ) && ( 0x72 == ((const U8*)s)[2] ) ) ? 3 : 0 )\ : ( ( ( 0xCE == ((const U8*)s)[0] ) && ( 0x41 == ((const U8*)s)[1] ) ) && ( 0x41 == ((const U8*)s)[2] ) ) ? 3 : 0 )\ : 0 ) \ : 0 ) #endif # else # error Unknown character set # endif #ifndef isCNTRL_utf8_safe # define isCNTRL_utf8_safe(s,e) D_PPP_IS_GENERIC_UTF8_SAFE(s, e, CNTRL) #endif #ifndef isDIGIT_utf8_safe # define isDIGIT_utf8_safe(s,e) D_PPP_IS_GENERIC_UTF8_SAFE(s, e, DIGIT) #endif #ifndef isGRAPH_utf8_safe # define isGRAPH_utf8_safe(s,e) D_PPP_IS_GENERIC_UTF8_SAFE(s, e, GRAPH) #endif # ifdef isIDCONT_utf8 #ifndef isIDCONT_utf8_safe # define isIDCONT_utf8_safe(s,e) D_PPP_IS_GENERIC_UTF8_SAFE(s, e, IDCONT) #endif # else #ifndef isIDCONT_utf8_safe # define isIDCONT_utf8_safe(s,e) isWORDCHAR_utf8_safe(s,e) #endif # endif #ifndef isIDFIRST_utf8_safe # define isIDFIRST_utf8_safe(s,e) D_PPP_IS_GENERIC_UTF8_SAFE(s, e, IDFIRST) #endif #ifndef isLOWER_utf8_safe # define isLOWER_utf8_safe(s,e) D_PPP_IS_GENERIC_UTF8_SAFE(s, e, LOWER) #endif #ifndef isPRINT_utf8_safe # define isPRINT_utf8_safe(s,e) D_PPP_IS_GENERIC_UTF8_SAFE(s, e, PRINT) #endif # undef isPSXSPC_utf8_safe /* Use the modern definition */ #ifndef isPSXSPC_utf8_safe # define isPSXSPC_utf8_safe(s,e) isSPACE_utf8_safe(s,e) #endif #ifndef isPUNCT_utf8_safe # define isPUNCT_utf8_safe(s,e) D_PPP_IS_GENERIC_UTF8_SAFE(s, e, PUNCT) #endif #ifndef isSPACE_utf8_safe # define isSPACE_utf8_safe(s,e) D_PPP_IS_GENERIC_UTF8_SAFE(s, e, SPACE) #endif #ifndef isUPPER_utf8_safe # define isUPPER_utf8_safe(s,e) D_PPP_IS_GENERIC_UTF8_SAFE(s, e, UPPER) #endif # ifdef isWORDCHAR_utf8 #ifndef isWORDCHAR_utf8_safe # define isWORDCHAR_utf8_safe(s,e) D_PPP_IS_GENERIC_UTF8_SAFE(s, e, WORDCHAR) #endif # else #ifndef isWORDCHAR_utf8_safe # define isWORDCHAR_utf8_safe(s,e) \ (isALPHANUMERIC_utf8_safe(s,e) || (*(s)) == '_') #endif # endif /* This was broken before 5.12, and just use this instead of worrying about * which releases the official works on */ # if 'A' == 65 #ifndef isXDIGIT_utf8_safe # define isXDIGIT_utf8_safe(s,e) \ ( ( LIKELY((e) > (s)) ) ? \ ( ( inRANGE(((const U8*)s)[0], 0x30, 0x39 ) || inRANGE(((const U8*)s)[0], 0x41, 0x46 ) || inRANGE(((const U8*)s)[0], 0x61, 0x66 ) ) ? 1\ : ( ( LIKELY(((e) - (s)) >= UTF8SKIP(s)) ) && ( 0xEF == ((const U8*)s)[0] ) ) ? ( ( 0xBC == ((const U8*)s)[1] ) ?\ ( ( inRANGE(((const U8*)s)[2], 0x90, 0x99 ) || inRANGE(((const U8*)s)[2], 0xA1, 0xA6 ) ) ? 3 : 0 )\ : ( ( 0xBD == ((const U8*)s)[1] ) && ( inRANGE(((const U8*)s)[2], 0x81, 0x86 ) ) ) ? 3 : 0 ) : 0 )\ : 0 ) #endif # elif 'A' == 193 && '^' == 95 /* EBCDIC 1047 */ #ifndef isXDIGIT_utf8_safe # define isXDIGIT_utf8_safe(s,e) \ ( ( LIKELY((e) > (s)) ) ? \ ( ( inRANGE(((const U8*)s)[0], 0x81, 0x86 ) || inRANGE(((const U8*)s)[0], 0xC1, 0xC6 ) || inRANGE(((const U8*)s)[0], 0xF0, 0xF9 ) ) ? 1\ : ( ( ( LIKELY(((e) - (s)) >= UTF8SKIP(s)) ) && ( 0xDD == ((const U8*)s)[0] ) ) && ( 0x73 == ((const U8*)s)[1] ) ) ? ( ( 0x67 == ((const U8*)s)[2] ) ?\ ( ( inRANGE(((const U8*)s)[3], 0x57, 0x59 ) || inRANGE(((const U8*)s)[3], 0x62, 0x68 ) ) ? 4 : 0 )\ : ( ( inRANGE(((const U8*)s)[2], 0x68, 0x69 ) ) && ( inRANGE(((const U8*)s)[3], 0x42, 0x47 ) ) ) ? 4 : 0 ) : 0 )\ : 0 ) #endif # elif 'A' == 193 && '^' == 176 /* EBCDIC 037 */ #ifndef isXDIGIT_utf8_safe # define isXDIGIT_utf8_safe(s,e) \ ( ( LIKELY((e) > (s)) ) ? \ ( ( inRANGE(((const U8*)s)[0], 0x81, 0x86 ) || inRANGE(((const U8*)s)[0], 0xC1, 0xC6 ) || inRANGE(((const U8*)s)[0], 0xF0, 0xF9 ) ) ? 1\ : ( ( ( LIKELY(((e) - (s)) >= UTF8SKIP(s)) ) && ( 0xDD == ((const U8*)s)[0] ) ) && ( 0x72 == ((const U8*)s)[1] ) ) ? ( ( 0x66 == ((const U8*)s)[2] ) ?\ ( ( inRANGE(((const U8*)s)[3], 0x57, 0x59 ) || 0x5F == ((const U8*)s)[3] || inRANGE(((const U8*)s)[3], 0x62, 0x67 ) ) ? 4 : 0 )\ : ( ( inRANGE(((const U8*)s)[2], 0x67, 0x68 ) ) && ( inRANGE(((const U8*)s)[3], 0x42, 0x47 ) ) ) ? 4 : 0 ) : 0 )\ : 0 ) #endif # else # error Unknown character set # endif #ifndef isALPHA_LC_utf8_safe # define isALPHA_LC_utf8_safe(s,e) D_PPP_IS_GENERIC_LC_UTF8_SAFE(s, e, ALPHA) #endif # ifdef isALPHANUMERIC_utf8 #ifndef isALPHANUMERIC_LC_utf8_safe # define isALPHANUMERIC_LC_utf8_safe(s,e) \ D_PPP_IS_GENERIC_LC_UTF8_SAFE(s, e, ALPHANUMERIC) #endif # else #ifndef isALPHANUMERIC_LC_utf8_safe # define isALPHANUMERIC_LC_utf8_safe(s,e) \ (isALPHA_LC_utf8_safe(s,e) || isDIGIT_LC_utf8_safe(s,e)) #endif # endif #ifndef isBLANK_LC_utf8_safe # define isBLANK_LC_utf8_safe(s,e) \ D_PPP_IS_GENERIC_LC_UTF8_SAFE_BROKEN(s, e, BLANK) #endif #ifndef isCNTRL_LC_utf8_safe # define isCNTRL_LC_utf8_safe(s,e) D_PPP_IS_GENERIC_LC_UTF8_SAFE(s, e, CNTRL) #endif #ifndef isDIGIT_LC_utf8_safe # define isDIGIT_LC_utf8_safe(s,e) D_PPP_IS_GENERIC_LC_UTF8_SAFE(s, e, DIGIT) #endif #ifndef isGRAPH_LC_utf8_safe # define isGRAPH_LC_utf8_safe(s,e) D_PPP_IS_GENERIC_LC_UTF8_SAFE(s, e, GRAPH) #endif # ifdef isIDCONT_utf8 #ifndef isIDCONT_LC_utf8_safe # define isIDCONT_LC_utf8_safe(s,e) D_PPP_IS_GENERIC_LC_UTF8_SAFE(s, e, IDCONT) #endif # else #ifndef isIDCONT_LC_utf8_safe # define isIDCONT_LC_utf8_safe(s,e) isWORDCHAR_LC_utf8_safe(s,e) #endif # endif #ifndef isIDFIRST_LC_utf8_safe # define isIDFIRST_LC_utf8_safe(s,e) D_PPP_IS_GENERIC_LC_UTF8_SAFE(s, e, IDFIRST) #endif #ifndef isLOWER_LC_utf8_safe # define isLOWER_LC_utf8_safe(s,e) D_PPP_IS_GENERIC_LC_UTF8_SAFE(s, e, LOWER) #endif #ifndef isPRINT_LC_utf8_safe # define isPRINT_LC_utf8_safe(s,e) D_PPP_IS_GENERIC_LC_UTF8_SAFE(s, e, PRINT) #endif # undef isPSXSPC_LC_utf8_safe /* Use the modern definition */ #ifndef isPSXSPC_LC_utf8_safe # define isPSXSPC_LC_utf8_safe(s,e) isSPACE_LC_utf8_safe(s,e) #endif #ifndef isPUNCT_LC_utf8_safe # define isPUNCT_LC_utf8_safe(s,e) D_PPP_IS_GENERIC_LC_UTF8_SAFE(s, e, PUNCT) #endif #ifndef isSPACE_LC_utf8_safe # define isSPACE_LC_utf8_safe(s,e) D_PPP_IS_GENERIC_LC_UTF8_SAFE(s, e, SPACE) #endif #ifndef isUPPER_LC_utf8_safe # define isUPPER_LC_utf8_safe(s,e) D_PPP_IS_GENERIC_LC_UTF8_SAFE(s, e, UPPER) #endif # ifdef isWORDCHAR_utf8 #ifndef isWORDCHAR_LC_utf8_safe # define isWORDCHAR_LC_utf8_safe(s,e) D_PPP_IS_GENERIC_LC_UTF8_SAFE(s, e, WORDCHAR) #endif # else #ifndef isWORDCHAR_LC_utf8_safe # define isWORDCHAR_LC_utf8_safe(s,e) \ (isALPHANUMERIC_LC_utf8_safe(s,e) || (*(s)) == '_') #endif # endif #ifndef isXDIGIT_LC_utf8_safe # define isXDIGIT_LC_utf8_safe(s,e) \ D_PPP_IS_GENERIC_LC_UTF8_SAFE_BROKEN(s, e, XDIGIT) #endif /* Warning: isALPHANUMERIC_utf8_safe, isALPHA_utf8_safe, isASCII_utf8_safe, * isBLANK_utf8_safe, isCNTRL_utf8_safe, isDIGIT_utf8_safe, isGRAPH_utf8_safe, * isIDCONT_utf8_safe, isIDFIRST_utf8_safe, isLOWER_utf8_safe, * isPRINT_utf8_safe, isPSXSPC_utf8_safe, isPUNCT_utf8_safe, isSPACE_utf8_safe, * isUPPER_utf8_safe, isWORDCHAR_utf8_safe, isWORDCHAR_utf8_safe, * isXDIGIT_utf8_safe, * isALPHANUMERIC_LC_utf8_safe, isALPHA_LC_utf8_safe, isASCII_LC_utf8_safe, * isBLANK_LC_utf8_safe, isCNTRL_LC_utf8_safe, isDIGIT_LC_utf8_safe, * isGRAPH_LC_utf8_safe, isIDCONT_LC_utf8_safe, isIDFIRST_LC_utf8_safe, * isLOWER_LC_utf8_safe, isPRINT_LC_utf8_safe, isPSXSPC_LC_utf8_safe, * isPUNCT_LC_utf8_safe, isSPACE_LC_utf8_safe, isUPPER_LC_utf8_safe, * isWORDCHAR_LC_utf8_safe, isWORDCHAR_LC_utf8_safe, isXDIGIT_LC_utf8_safe, * isALPHANUMERIC_uvchr, isALPHA_uvchr, isASCII_uvchr, isBLANK_uvchr, * isCNTRL_uvchr, isDIGIT_uvchr, isGRAPH_uvchr, isIDCONT_uvchr, * isIDFIRST_uvchr, isLOWER_uvchr, isPRINT_uvchr, isPSXSPC_uvchr, * isPUNCT_uvchr, isSPACE_uvchr, isUPPER_uvchr, isWORDCHAR_uvchr, * isWORDCHAR_uvchr, isXDIGIT_uvchr * * The UTF-8 handling is buggy in early Perls, and this can give inaccurate * results for code points above 0xFF, until the implementation started * settling down in 5.12 and 5.14 */ #endif #define D_PPP_TOO_SHORT_MSG "Malformed UTF-8 character starting with:" \ " \\x%02x (too short; %d bytes available, need" \ " %d)\n" /* Perls starting here had a new API which handled multi-character results */ #if (PERL_BCDVERSION >= 0x5007003) #ifndef toLOWER_uvchr # define toLOWER_uvchr(c, s, l) UNI_TO_NATIVE(to_uni_lower(NATIVE_TO_UNI(c), s, l)) #endif #ifndef toUPPER_uvchr # define toUPPER_uvchr(c, s, l) UNI_TO_NATIVE(to_uni_upper(NATIVE_TO_UNI(c), s, l)) #endif #ifndef toTITLE_uvchr # define toTITLE_uvchr(c, s, l) UNI_TO_NATIVE(to_uni_title(NATIVE_TO_UNI(c), s, l)) #endif #ifndef toFOLD_uvchr # define toFOLD_uvchr(c, s, l) UNI_TO_NATIVE(to_uni_fold( NATIVE_TO_UNI(c), s, l)) #endif # if (PERL_BCDVERSION != 0x5015006) /* Just this version is broken */ /* Prefer the macro to the function */ # if defined toLOWER_utf8 # define D_PPP_TO_LOWER_CALLEE(s,r,l) toLOWER_utf8(s,r,l) # else # define D_PPP_TO_LOWER_CALLEE(s,r,l) to_utf8_lower(s,r,l) # endif # if defined toTITLE_utf8 # define D_PPP_TO_TITLE_CALLEE(s,r,l) toTITLE_utf8(s,r,l) # else # define D_PPP_TO_TITLE_CALLEE(s,r,l) to_utf8_title(s,r,l) # endif # if defined toUPPER_utf8 # define D_PPP_TO_UPPER_CALLEE(s,r,l) toUPPER_utf8(s,r,l) # else # define D_PPP_TO_UPPER_CALLEE(s,r,l) to_utf8_upper(s,r,l) # endif # if defined toFOLD_utf8 # define D_PPP_TO_FOLD_CALLEE(s,r,l) toFOLD_utf8(s,r,l) # else # define D_PPP_TO_FOLD_CALLEE(s,r,l) to_utf8_fold(s,r,l) # endif # else /* Below is 5.15.6, which failed to make the macros available # outside of core, so we have to use the 'Perl_' form. khw # decided it was easier to just handle this case than have to # document the exception, and make an exception in the tests below # */ # define D_PPP_TO_LOWER_CALLEE(s,r,l) \ Perl__to_utf8_lower_flags(aTHX_ s, r, l, 0, NULL) # define D_PPP_TO_TITLE_CALLEE(s,r,l) \ Perl__to_utf8_title_flags(aTHX_ s, r, l, 0, NULL) # define D_PPP_TO_UPPER_CALLEE(s,r,l) \ Perl__to_utf8_upper_flags(aTHX_ s, r, l, 0, NULL) # define D_PPP_TO_FOLD_CALLEE(s,r,l) \ Perl__to_utf8_fold_flags(aTHX_ s, r, l, FOLD_FLAGS_FULL, NULL) # endif /* The actual implementation of the backported macros. If too short, croak, * otherwise call the original that doesn't have an upper limit parameter */ # define D_PPP_GENERIC_MULTI_ARG_TO(name, s, e,r,l) \ (((((e) - (s)) <= 0) \ /* We could just do nothing, but modern perls croak */ \ ? (croak("Attempting case change on zero length string"), \ 0) /* So looks like it returns something, and will compile */ \ : ((e) - (s)) < UTF8SKIP(s)) \ ? (croak(D_PPP_TOO_SHORT_MSG, \ s[0], (int) ((e) - (s)), (int) UTF8SKIP(s)), \ 0) \ : D_PPP_TO_ ## name ## _CALLEE(s,r,l)) #ifndef toUPPER_utf8_safe # define toUPPER_utf8_safe(s,e,r,l) \ D_PPP_GENERIC_MULTI_ARG_TO(UPPER,s,e,r,l) #endif #ifndef toLOWER_utf8_safe # define toLOWER_utf8_safe(s,e,r,l) \ D_PPP_GENERIC_MULTI_ARG_TO(LOWER,s,e,r,l) #endif #ifndef toTITLE_utf8_safe # define toTITLE_utf8_safe(s,e,r,l) \ D_PPP_GENERIC_MULTI_ARG_TO(TITLE,s,e,r,l) #endif #ifndef toFOLD_utf8_safe # define toFOLD_utf8_safe(s,e,r,l) \ D_PPP_GENERIC_MULTI_ARG_TO(FOLD,s,e,r,l) #endif #elif (PERL_BCDVERSION >= 0x5006000) /* Here we have UTF-8 support, but using the original API where the case * changing functions merely returned the changed code point; hence they * couldn't handle multi-character results. */ # ifdef uvchr_to_utf8 # define D_PPP_UV_TO_UTF8 uvchr_to_utf8 # else # define D_PPP_UV_TO_UTF8 uv_to_utf8 # endif /* Get the utf8 of the case changed value, and store its length; then have * to re-calculate the changed case value in order to return it */ # define D_PPP_GENERIC_SINGLE_ARG_TO_UVCHR(name, c, s, l) \ (*(l) = (D_PPP_UV_TO_UTF8(s, \ UNI_TO_NATIVE(to_uni_ ## name(NATIVE_TO_UNI(c)))) - (s)), \ UNI_TO_NATIVE(to_uni_ ## name(NATIVE_TO_UNI(c)))) #ifndef toLOWER_uvchr # define toLOWER_uvchr(c, s, l) \ D_PPP_GENERIC_SINGLE_ARG_TO_UVCHR(lower, c, s, l) #endif #ifndef toUPPER_uvchr # define toUPPER_uvchr(c, s, l) \ D_PPP_GENERIC_SINGLE_ARG_TO_UVCHR(upper, c, s, l) #endif #ifndef toTITLE_uvchr # define toTITLE_uvchr(c, s, l) \ D_PPP_GENERIC_SINGLE_ARG_TO_UVCHR(title, c, s, l) #endif #ifndef toFOLD_uvchr # define toFOLD_uvchr(c, s, l) toLOWER_uvchr(c, s, l) #endif # define D_PPP_GENERIC_SINGLE_ARG_TO_UTF8(name, s, e, r, l) \ (((((e) - (s)) <= 0) \ ? (croak("Attempting case change on zero length string"), \ 0) /* So looks like it returns something, and will compile */ \ : ((e) - (s)) < UTF8SKIP(s)) \ ? (croak(D_PPP_TOO_SHORT_MSG, \ s[0], (int) ((e) - (s)), (int) UTF8SKIP(s)), \ 0) \ /* Get the changed code point and store its UTF-8 */ \ : D_PPP_UV_TO_UTF8(r, to_utf8_ ## name(s)), \ /* Then store its length, and re-get code point for return */ \ *(l) = UTF8SKIP(r), to_utf8_ ## name(r)) /* Warning: toUPPER_utf8_safe, toLOWER_utf8_safe, toTITLE_utf8_safe, * toUPPER_uvchr, toLOWER_uvchr, toTITLE_uvchr The UTF-8 case changing operations had bugs before around 5.12 or 5.14; this backport does not correct them. In perls before 7.3, multi-character case changing is not implemented; this backport uses the simple case changes available in those perls. */ #ifndef toUPPER_utf8_safe # define toUPPER_utf8_safe(s,e,r,l) \ D_PPP_GENERIC_SINGLE_ARG_TO_UTF8(upper, s, e, r, l) #endif #ifndef toLOWER_utf8_safe # define toLOWER_utf8_safe(s,e,r,l) \ D_PPP_GENERIC_SINGLE_ARG_TO_UTF8(lower, s, e, r, l) #endif #ifndef toTITLE_utf8_safe # define toTITLE_utf8_safe(s,e,r,l) \ D_PPP_GENERIC_SINGLE_ARG_TO_UTF8(title, s, e, r, l) #endif /* Warning: toFOLD_utf8_safe, toFOLD_uvchr The UTF-8 case changing operations had bugs before around 5.12 or 5.14; this backport does not correct them. In perls before 7.3, case folding is not implemented; instead, this backport substitutes simple (not multi-character, which isn't available) lowercasing. This gives the correct result in most, but not all, instances */ #ifndef toFOLD_utf8_safe # define toFOLD_utf8_safe(s,e,r,l) toLOWER_utf8_safe(s,e,r,l) #endif #endif /* Until we figure out how to support this in older perls... */ #if (PERL_BCDVERSION >= 0x5008000) #ifndef HeUTF8 # define HeUTF8(he) ((HeKLEN(he) == HEf_SVKEY) ? \ SvUTF8(HeKEY_sv(he)) : \ (U32)HeKUTF8(he)) #endif #endif #ifndef C_ARRAY_LENGTH # define C_ARRAY_LENGTH(a) (sizeof(a)/sizeof((a)[0])) #endif #ifndef C_ARRAY_END # define C_ARRAY_END(a) ((a) + C_ARRAY_LENGTH(a)) #endif #ifndef LIKELY # define LIKELY(x) (x) #endif #ifndef UNLIKELY # define UNLIKELY(x) (x) #endif #ifndef MUTABLE_PTR #if defined(PERL_USE_GCC_BRACE_GROUPS) # define MUTABLE_PTR(p) ({ void *_p = (p); _p; }) #else # define MUTABLE_PTR(p) ((void *) (p)) #endif #endif #ifndef MUTABLE_AV # define MUTABLE_AV(p) ((AV *)MUTABLE_PTR(p)) #endif #ifndef MUTABLE_CV # define MUTABLE_CV(p) ((CV *)MUTABLE_PTR(p)) #endif #ifndef MUTABLE_GV # define MUTABLE_GV(p) ((GV *)MUTABLE_PTR(p)) #endif #ifndef MUTABLE_HV # define MUTABLE_HV(p) ((HV *)MUTABLE_PTR(p)) #endif #ifndef MUTABLE_IO # define MUTABLE_IO(p) ((IO *)MUTABLE_PTR(p)) #endif #ifndef MUTABLE_SV # define MUTABLE_SV(p) ((SV *)MUTABLE_PTR(p)) #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(vnewSVpvf) #if defined(PERL_USE_GCC_BRACE_GROUPS) # define vnewSVpvf(pat, args) ({ SV *_sv = newSV(0); sv_vsetpvfn(_sv, (pat), strlen((pat)), (args), Null(SV**), 0, Null(bool*)); _sv; }) #else # define vnewSVpvf(pat, args) ((PL_Sv = newSV(0)), sv_vsetpvfn(PL_Sv, (pat), strlen((pat)), (args), Null(SV**), 0, Null(bool*)), PL_Sv) #endif #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(sv_vcatpvf) # define sv_vcatpvf(sv, pat, args) sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*)) #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(sv_vsetpvf) # define sv_vsetpvf(sv, pat, args) sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*)) #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(sv_catpvf_mg) #if defined(NEED_sv_catpvf_mg) static void DPPP_(my_sv_catpvf_mg)(pTHX_ SV * const sv, const char * const pat, ...); static #else extern void DPPP_(my_sv_catpvf_mg)(pTHX_ SV * const sv, const char * const pat, ...); #endif #if defined(NEED_sv_catpvf_mg) || defined(NEED_sv_catpvf_mg_GLOBAL) #define Perl_sv_catpvf_mg DPPP_(my_sv_catpvf_mg) void DPPP_(my_sv_catpvf_mg)(pTHX_ SV * const sv, const char * const pat, ...) { va_list args; va_start(args, pat); sv_vcatpvfn(sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*)); SvSETMAGIC(sv); va_end(args); } #endif #endif #ifdef PERL_IMPLICIT_CONTEXT #if (PERL_BCDVERSION >= 0x5004000) && !defined(sv_catpvf_mg_nocontext) #if defined(NEED_sv_catpvf_mg_nocontext) static void DPPP_(my_sv_catpvf_mg_nocontext)(SV * const sv, const char * const pat, ...); static #else extern void DPPP_(my_sv_catpvf_mg_nocontext)(SV * const sv, const char * const pat, ...); #endif #if defined(NEED_sv_catpvf_mg_nocontext) || defined(NEED_sv_catpvf_mg_nocontext_GLOBAL) #define sv_catpvf_mg_nocontext DPPP_(my_sv_catpvf_mg_nocontext) #define Perl_sv_catpvf_mg_nocontext DPPP_(my_sv_catpvf_mg_nocontext) void DPPP_(my_sv_catpvf_mg_nocontext)(SV * const sv, const char * const pat, ...) { dTHX; va_list args; va_start(args, pat); sv_vcatpvfn(sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*)); SvSETMAGIC(sv); va_end(args); } #endif #endif #endif /* sv_catpvf_mg depends on sv_catpvf_mg_nocontext */ #ifndef sv_catpvf_mg # ifdef PERL_IMPLICIT_CONTEXT # define sv_catpvf_mg Perl_sv_catpvf_mg_nocontext # else # define sv_catpvf_mg Perl_sv_catpvf_mg # endif #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(sv_vcatpvf_mg) # define sv_vcatpvf_mg(sv, pat, args) \ STMT_START { \ sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*)); \ SvSETMAGIC(sv); \ } STMT_END #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(sv_setpvf_mg) #if defined(NEED_sv_setpvf_mg) static void DPPP_(my_sv_setpvf_mg)(pTHX_ SV * const sv, const char * const pat, ...); static #else extern void DPPP_(my_sv_setpvf_mg)(pTHX_ SV * const sv, const char * const pat, ...); #endif #if defined(NEED_sv_setpvf_mg) || defined(NEED_sv_setpvf_mg_GLOBAL) #define Perl_sv_setpvf_mg DPPP_(my_sv_setpvf_mg) void DPPP_(my_sv_setpvf_mg)(pTHX_ SV * const sv, const char * const pat, ...) { va_list args; va_start(args, pat); sv_vsetpvfn(sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*)); SvSETMAGIC(sv); va_end(args); } #endif #endif #ifdef PERL_IMPLICIT_CONTEXT #if (PERL_BCDVERSION >= 0x5004000) && !defined(sv_setpvf_mg_nocontext) #if defined(NEED_sv_setpvf_mg_nocontext) static void DPPP_(my_sv_setpvf_mg_nocontext)(SV * const sv, const char * const pat, ...); static #else extern void DPPP_(my_sv_setpvf_mg_nocontext)(SV * const sv, const char * const pat, ...); #endif #if defined(NEED_sv_setpvf_mg_nocontext) || defined(NEED_sv_setpvf_mg_nocontext_GLOBAL) #define sv_setpvf_mg_nocontext DPPP_(my_sv_setpvf_mg_nocontext) #define Perl_sv_setpvf_mg_nocontext DPPP_(my_sv_setpvf_mg_nocontext) void DPPP_(my_sv_setpvf_mg_nocontext)(SV * const sv, const char * const pat, ...) { dTHX; va_list args; va_start(args, pat); sv_vsetpvfn(sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*)); SvSETMAGIC(sv); va_end(args); } #endif #endif #endif /* sv_setpvf_mg depends on sv_setpvf_mg_nocontext */ #ifndef sv_setpvf_mg # ifdef PERL_IMPLICIT_CONTEXT # define sv_setpvf_mg Perl_sv_setpvf_mg_nocontext # else # define sv_setpvf_mg Perl_sv_setpvf_mg # endif #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(sv_vsetpvf_mg) # define sv_vsetpvf_mg(sv, pat, args) \ STMT_START { \ sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*)); \ SvSETMAGIC(sv); \ } STMT_END #endif /* Hint: sv_2pv_nolen * Use the SvPV_nolen() or SvPV_nolen_const() macros instead of sv_2pv_nolen(). */ #ifndef sv_2pv_nolen # define sv_2pv_nolen(sv) SvPV_nolen(sv) #endif #ifdef SvPVbyte /* Hint: SvPVbyte * Does not work in perl-5.6.1, ppport.h implements a version * borrowed from perl-5.7.3. */ #if (PERL_BCDVERSION < 0x5007000) #ifndef sv_2pvbyte # define sv_2pvbyte(sv, lp) (sv_utf8_downgrade((sv), 0), SvPV((sv), *(lp))) #endif /* Hint: sv_2pvbyte * Use the SvPVbyte() macro instead of sv_2pvbyte(). */ /* Replace sv_2pvbyte with SvPVbyte */ #undef SvPVbyte #define SvPVbyte(sv, lp) \ ((SvFLAGS(sv) & (SVf_POK|SVf_UTF8)) == (SVf_POK) \ ? ((lp = SvCUR(sv)), SvPVX(sv)) : sv_2pvbyte(sv, &lp)) #endif #else # define SvPVbyte SvPV # define sv_2pvbyte sv_2pv #endif #ifndef sv_2pvbyte_nolen # define sv_2pvbyte_nolen(sv) sv_2pv_nolen(sv) #endif /* Hint: sv_pvn * Always use the SvPV() macro instead of sv_pvn(). */ /* Replace sv_pvn with SvPV */ /* Hint: sv_pvn_force * Always use the SvPV_force() macro instead of sv_pvn_force(). */ /* Replace sv_pvn_force with SvPV_force */ /* If these are undefined, they're not handled by the core anyway */ #ifndef SV_IMMEDIATE_UNREF # define SV_IMMEDIATE_UNREF 0 #endif #ifndef SV_GMAGIC # define SV_GMAGIC 0 #endif #ifndef SV_COW_DROP_PV # define SV_COW_DROP_PV 0 #endif #ifndef SV_UTF8_NO_ENCODING # define SV_UTF8_NO_ENCODING 0 #endif #ifndef SV_CONST_RETURN # define SV_CONST_RETURN 0 #endif #ifndef SV_MUTABLE_RETURN # define SV_MUTABLE_RETURN 0 #endif #ifndef SV_SMAGIC # define SV_SMAGIC 0 #endif #ifndef SV_HAS_TRAILING_NUL # define SV_HAS_TRAILING_NUL 0 #endif #ifndef SV_COW_SHARED_HASH_KEYS # define SV_COW_SHARED_HASH_KEYS 0 #endif #if defined(PERL_USE_GCC_BRACE_GROUPS) #ifndef sv_2pv_flags # define sv_2pv_flags(sv, lp, flags) ({ SV *_sv = (sv); const I32 _flags = (flags); STRLEN *_lp = lp; _lp = _lp ? : &PL_na; (!(_flags & SV_GMAGIC) && SvGMAGICAL(_sv)) ? ({ char *_pv; SvGMAGICAL_off(_sv); _pv = sv_2pv(_sv, _lp); SvGMAGICAL_on(_sv); _pv; }) : sv_2pv(_sv, _lp); }) #endif #ifndef sv_pvn_force_flags # define sv_pvn_force_flags(sv, lp, flags) ({ SV *_sv = (sv); const I32 _flags = (flags); STRLEN *_lp = lp; _lp = _lp ? : &PL_na; (!(_flags & SV_GMAGIC) && SvGMAGICAL(_sv)) ? ({ char *_pv; SvGMAGICAL_off(_sv); _pv = sv_pvn_force(_sv, _lp); SvGMAGICAL_on(_sv); _pv; }) : sv_pvn_force(_sv, _lp); }) #endif #else #ifndef sv_2pv_flags # define sv_2pv_flags(sv, lp, flags) ((PL_Sv = (sv)), (!((flags) & SV_GMAGIC) && SvGMAGICAL(PL_Sv)) ? (SvGMAGICAL_off(PL_Sv), (PL_Xpv = (XPV *)sv_2pv(PL_Sv, (lp) ? (lp) : &PL_na)), SvGMAGICAL_on(PL_Sv), (char *)PL_Xpv) : sv_2pv(PL_Sv, (lp) ? (lp) : &PL_na)) #endif #ifndef sv_pvn_force_flags # define sv_pvn_force_flags(sv, lp, flags) ((PL_Sv = (sv)), (!((flags) & SV_GMAGIC) && SvGMAGICAL(PL_Sv)) ? (SvGMAGICAL_off(PL_Sv), (PL_Xpv = (XPV *)sv_pvn_force(PL_Sv, (lp) ? (lp) : &PL_na)), SvGMAGICAL_on(PL_Sv), (char *)PL_Xpv) : sv_pvn_force(PL_Sv, (lp) ? (lp) : &PL_na)) #endif #endif #if (PERL_BCDVERSION < 0x5008008) || ( (PERL_BCDVERSION >= 0x5009000) && (PERL_BCDVERSION < 0x5009003) ) # define D_PPP_SVPV_NOLEN_LP_ARG &PL_na #else # define D_PPP_SVPV_NOLEN_LP_ARG 0 #endif #ifndef SvPV_const # define SvPV_const(sv, lp) SvPV_flags_const(sv, lp, SV_GMAGIC) #endif #ifndef SvPV_mutable # define SvPV_mutable(sv, lp) SvPV_flags_mutable(sv, lp, SV_GMAGIC) #endif #ifndef SvPV_flags # define SvPV_flags(sv, lp, flags) \ ((SvFLAGS(sv) & (SVf_POK)) == SVf_POK \ ? ((lp = SvCUR(sv)), SvPVX(sv)) : sv_2pv_flags(sv, &lp, flags)) #endif #ifndef SvPV_flags_const # define SvPV_flags_const(sv, lp, flags) \ ((SvFLAGS(sv) & (SVf_POK)) == SVf_POK \ ? ((lp = SvCUR(sv)), SvPVX_const(sv)) : \ (const char*) sv_2pv_flags(sv, &lp, flags|SV_CONST_RETURN)) #endif #ifndef SvPV_flags_const_nolen # define SvPV_flags_const_nolen(sv, flags) \ ((SvFLAGS(sv) & (SVf_POK)) == SVf_POK \ ? SvPVX_const(sv) : \ (const char*) sv_2pv_flags(sv, D_PPP_SVPV_NOLEN_LP_ARG, flags|SV_CONST_RETURN)) #endif #ifndef SvPV_flags_mutable # define SvPV_flags_mutable(sv, lp, flags) \ ((SvFLAGS(sv) & (SVf_POK)) == SVf_POK \ ? ((lp = SvCUR(sv)), SvPVX_mutable(sv)) : \ sv_2pv_flags(sv, &lp, flags|SV_MUTABLE_RETURN)) #endif #ifndef SvPV_force # define SvPV_force(sv, lp) SvPV_force_flags(sv, lp, SV_GMAGIC) #endif #ifndef SvPV_force_nolen # define SvPV_force_nolen(sv) SvPV_force_flags_nolen(sv, SV_GMAGIC) #endif #ifndef SvPV_force_mutable # define SvPV_force_mutable(sv, lp) SvPV_force_flags_mutable(sv, lp, SV_GMAGIC) #endif #ifndef SvPV_force_nomg # define SvPV_force_nomg(sv, lp) SvPV_force_flags(sv, lp, 0) #endif #ifndef SvPV_force_nomg_nolen # define SvPV_force_nomg_nolen(sv) SvPV_force_flags_nolen(sv, 0) #endif #ifndef SvPV_force_flags # define SvPV_force_flags(sv, lp, flags) \ ((SvFLAGS(sv) & (SVf_POK|SVf_THINKFIRST)) == SVf_POK \ ? ((lp = SvCUR(sv)), SvPVX(sv)) : sv_pvn_force_flags(sv, &lp, flags)) #endif #ifndef SvPV_force_flags_nolen # define SvPV_force_flags_nolen(sv, flags) \ ((SvFLAGS(sv) & (SVf_POK|SVf_THINKFIRST)) == SVf_POK \ ? SvPVX(sv) : sv_pvn_force_flags(sv, D_PPP_SVPV_NOLEN_LP_ARG, flags)) #endif #ifndef SvPV_force_flags_mutable # define SvPV_force_flags_mutable(sv, lp, flags) \ ((SvFLAGS(sv) & (SVf_POK|SVf_THINKFIRST)) == SVf_POK \ ? ((lp = SvCUR(sv)), SvPVX_mutable(sv)) \ : sv_pvn_force_flags(sv, &lp, flags|SV_MUTABLE_RETURN)) #endif #ifndef SvPV_nolen # define SvPV_nolen(sv) \ ((SvFLAGS(sv) & (SVf_POK)) == SVf_POK \ ? SvPVX(sv) : sv_2pv_flags(sv, D_PPP_SVPV_NOLEN_LP_ARG, SV_GMAGIC)) #endif #ifndef SvPV_nolen_const # define SvPV_nolen_const(sv) \ ((SvFLAGS(sv) & (SVf_POK)) == SVf_POK \ ? SvPVX_const(sv) : sv_2pv_flags(sv, D_PPP_SVPV_NOLEN_LP_ARG, SV_GMAGIC|SV_CONST_RETURN)) #endif # if defined(PERL_USE_GCC_BRACE_GROUPS) #ifndef SvPVx_nolen_const # define SvPVx_nolen_const(sv) ({SV *sV_ = (sv); SvPV_nolen_const(sV_); }) #endif # else #ifndef SvPVx_nolen_const # define SvPVx_nolen_const(sv) (PL_Sv = sv, SvPV_nolen_const(PL_Sv)) #endif # endif #ifndef SvPV_nomg # define SvPV_nomg(sv, lp) SvPV_flags(sv, lp, 0) #endif #ifndef SvPV_nomg_const # define SvPV_nomg_const(sv, lp) SvPV_flags_const(sv, lp, 0) #endif #ifndef SvPV_nomg_const_nolen # define SvPV_nomg_const_nolen(sv) SvPV_flags_const_nolen(sv, 0) #endif #ifndef SvPV_nomg_nolen # define SvPV_nomg_nolen(sv) ((SvFLAGS(sv) & (SVf_POK)) == SVf_POK \ ? SvPVX(sv) : sv_2pv_flags(sv, D_PPP_SVPV_NOLEN_LP_ARG, 0)) #endif #ifndef SvPV_renew # define SvPV_renew(sv,n) STMT_START { SvLEN_set(sv, n); \ SvPV_set((sv), (char *) saferealloc( \ (Malloc_t)SvPVX(sv), (MEM_SIZE)((n)))); \ } STMT_END #endif #ifndef SvPVCLEAR # define SvPVCLEAR(sv) sv_setpvs((sv), "") #endif #ifndef WARN_ALL # define WARN_ALL 0 #endif #ifndef WARN_CLOSURE # define WARN_CLOSURE 1 #endif #ifndef WARN_DEPRECATED # define WARN_DEPRECATED 2 #endif #ifndef WARN_EXITING # define WARN_EXITING 3 #endif #ifndef WARN_GLOB # define WARN_GLOB 4 #endif #ifndef WARN_IO # define WARN_IO 5 #endif #ifndef WARN_CLOSED # define WARN_CLOSED 6 #endif #ifndef WARN_EXEC # define WARN_EXEC 7 #endif #ifndef WARN_LAYER # define WARN_LAYER 8 #endif #ifndef WARN_NEWLINE # define WARN_NEWLINE 9 #endif #ifndef WARN_PIPE # define WARN_PIPE 10 #endif #ifndef WARN_UNOPENED # define WARN_UNOPENED 11 #endif #ifndef WARN_MISC # define WARN_MISC 12 #endif #ifndef WARN_NUMERIC # define WARN_NUMERIC 13 #endif #ifndef WARN_ONCE # define WARN_ONCE 14 #endif #ifndef WARN_OVERFLOW # define WARN_OVERFLOW 15 #endif #ifndef WARN_PACK # define WARN_PACK 16 #endif #ifndef WARN_PORTABLE # define WARN_PORTABLE 17 #endif #ifndef WARN_RECURSION # define WARN_RECURSION 18 #endif #ifndef WARN_REDEFINE # define WARN_REDEFINE 19 #endif #ifndef WARN_REGEXP # define WARN_REGEXP 20 #endif #ifndef WARN_SEVERE # define WARN_SEVERE 21 #endif #ifndef WARN_DEBUGGING # define WARN_DEBUGGING 22 #endif #ifndef WARN_INPLACE # define WARN_INPLACE 23 #endif #ifndef WARN_INTERNAL # define WARN_INTERNAL 24 #endif #ifndef WARN_MALLOC # define WARN_MALLOC 25 #endif #ifndef WARN_SIGNAL # define WARN_SIGNAL 26 #endif #ifndef WARN_SUBSTR # define WARN_SUBSTR 27 #endif #ifndef WARN_SYNTAX # define WARN_SYNTAX 28 #endif #ifndef WARN_AMBIGUOUS # define WARN_AMBIGUOUS 29 #endif #ifndef WARN_BAREWORD # define WARN_BAREWORD 30 #endif #ifndef WARN_DIGIT # define WARN_DIGIT 31 #endif #ifndef WARN_PARENTHESIS # define WARN_PARENTHESIS 32 #endif #ifndef WARN_PRECEDENCE # define WARN_PRECEDENCE 33 #endif #ifndef WARN_PRINTF # define WARN_PRINTF 34 #endif #ifndef WARN_PROTOTYPE # define WARN_PROTOTYPE 35 #endif #ifndef WARN_QW # define WARN_QW 36 #endif #ifndef WARN_RESERVED # define WARN_RESERVED 37 #endif #ifndef WARN_SEMICOLON # define WARN_SEMICOLON 38 #endif #ifndef WARN_TAINT # define WARN_TAINT 39 #endif #ifndef WARN_THREADS # define WARN_THREADS 40 #endif #ifndef WARN_UNINITIALIZED # define WARN_UNINITIALIZED 41 #endif #ifndef WARN_UNPACK # define WARN_UNPACK 42 #endif #ifndef WARN_UNTIE # define WARN_UNTIE 43 #endif #ifndef WARN_UTF8 # define WARN_UTF8 44 #endif #ifndef WARN_VOID # define WARN_VOID 45 #endif #ifndef WARN_ASSERTIONS # define WARN_ASSERTIONS 46 #endif #ifndef packWARN # define packWARN(a) (a) #endif #ifndef packWARN2 # define packWARN2(a,b) (packWARN(a) << 8 | (b)) #endif #ifndef packWARN3 # define packWARN3(a,b,c) (packWARN2(a,b) << 8 | (c)) #endif #ifndef packWARN4 # define packWARN4(a,b,c,d) (packWARN3(a,b,c) << 8 | (d)) #endif #ifndef ckWARN # ifdef G_WARN_ON # define ckWARN(a) (PL_dowarn & G_WARN_ON) # else # define ckWARN(a) PL_dowarn # endif #endif #ifndef ckWARN2 # define ckWARN2(a,b) (ckWARN(a) || ckWARN(b)) #endif #ifndef ckWARN3 # define ckWARN3(a,b,c) (ckWARN(c) || ckWARN2(a,b)) #endif #ifndef ckWARN4 # define ckWARN4(a,b,c,d) (ckWARN(d) || ckWARN3(a,b,c)) #endif #ifndef ckWARN_d # ifdef isLEXWARN_off # define ckWARN_d(a) (isLEXWARN_off || ckWARN(a)) # else # define ckWARN_d(a) 1 # endif #endif #ifndef ckWARN2_d # define ckWARN2_d(a,b) (ckWARN_d(a) || ckWARN_d(b)) #endif #ifndef ckWARN3_d # define ckWARN3_d(a,b,c) (ckWARN_d(c) || ckWARN2_d(a,b)) #endif #ifndef ckWARN4_d # define ckWARN4_d(a,b,c,d) (ckWARN_d(d) || ckWARN3_d(a,b,c)) #endif #ifndef vwarner # define vwarner(err, pat, argsp) \ STMT_START { SV *sv; \ PERL_UNUSED_ARG(err); \ sv = vnewSVpvf(pat, argsp); \ sv_2mortal(sv); \ warn("%s", SvPV_nolen(sv)); \ } STMT_END #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(warner) # if defined(NEED_warner) static void DPPP_(my_warner)(U32 err, const char * pat, ...); static #else extern void DPPP_(my_warner)(U32 err, const char * pat, ...); #endif #if defined(NEED_warner) || defined(NEED_warner_GLOBAL) #define Perl_warner DPPP_(my_warner) void DPPP_(my_warner)(U32 err, const char *pat, ...) { va_list args; va_start(args, pat); vwarner(err, pat, &args); va_end(args); } # define warner Perl_warner # define Perl_warner_nocontext Perl_warner # endif #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(ck_warner) # if defined(NEED_ck_warner) static void DPPP_(my_ck_warner)(pTHX_ U32 err, const char * pat, ...); static #else extern void DPPP_(my_ck_warner)(pTHX_ U32 err, const char * pat, ...); #endif #if defined(NEED_ck_warner) || defined(NEED_ck_warner_GLOBAL) #define Perl_ck_warner DPPP_(my_ck_warner) void DPPP_(my_ck_warner)(pTHX_ U32 err, const char *pat, ...) { va_list args; if ( ! ckWARN((err ) & 0xFF) && ! ckWARN((err >> 8) & 0xFF) && ! ckWARN((err >> 16) & 0xFF) && ! ckWARN((err >> 24) & 0xFF)) { return; } va_start(args, pat); vwarner(err, pat, &args); va_end(args); } # define ck_warner Perl_ck_warner # endif #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(ck_warner_d) # if defined(NEED_ck_warner_d) static void DPPP_(my_ck_warner_d)(pTHX_ U32 err, const char * pat, ...); static #else extern void DPPP_(my_ck_warner_d)(pTHX_ U32 err, const char * pat, ...); #endif #if defined(NEED_ck_warner_d) || defined(NEED_ck_warner_d_GLOBAL) #define Perl_ck_warner_d DPPP_(my_ck_warner_d) void DPPP_(my_ck_warner_d)(pTHX_ U32 err, const char *pat, ...) { va_list args; if ( ! ckWARN_d((err ) & 0xFF) && ! ckWARN_d((err >> 8) & 0xFF) && ! ckWARN_d((err >> 16) & 0xFF) && ! ckWARN_d((err >> 24) & 0xFF)) { return; } va_start(args, pat); vwarner(err, pat, &args); va_end(args); } # define ck_warner_d Perl_ck_warner_d # endif #endif #ifndef IVdf # if IVSIZE == LONGSIZE # define IVdf "ld" # define UVuf "lu" # define UVof "lo" # define UVxf "lx" # define UVXf "lX" # elif IVSIZE == INTSIZE # define IVdf "d" # define UVuf "u" # define UVof "o" # define UVxf "x" # define UVXf "X" # else # error "cannot define IV/UV formats" # endif #endif #ifndef NVef # if defined(USE_LONG_DOUBLE) && defined(HAS_LONG_DOUBLE) && \ defined(PERL_PRIfldbl) && (PERL_BCDVERSION != 0x5006000) /* Not very likely, but let's try anyway. */ # define NVef PERL_PRIeldbl # define NVff PERL_PRIfldbl # define NVgf PERL_PRIgldbl # else # define NVef "e" # define NVff "f" # define NVgf "g" # endif #endif #ifndef sv_setuv # define sv_setuv(sv, uv) \ STMT_START { \ UV TeMpUv = uv; \ if (TeMpUv <= IV_MAX) \ sv_setiv(sv, TeMpUv); \ else \ sv_setnv(sv, (double)TeMpUv); \ } STMT_END #endif #ifndef newSVuv # define newSVuv(uv) ((uv) <= IV_MAX ? newSViv((IV)uv) : newSVnv((NV)uv)) #endif #if defined(PERL_USE_GCC_BRACE_GROUPS) #ifndef sv_2uv # define sv_2uv(sv) ({ SV *_sv = (sv); (UV) (SvNOK(_sv) ? SvNV(_sv) : sv_2nv(_sv)); }) #endif #else #ifndef sv_2uv # define sv_2uv(sv) ((PL_Sv = (sv)), (UV) (SvNOK(PL_Sv) ? SvNV(PL_Sv) : sv_2nv(PL_Sv))) #endif #endif #ifndef SvUVX # define SvUVX(sv) ((UV)SvIVX(sv)) #endif #ifndef SvUVXx # define SvUVXx(sv) SvUVX(sv) #endif #ifndef SvUV # define SvUV(sv) (SvIOK(sv) ? SvUVX(sv) : sv_2uv(sv)) #endif #if defined(PERL_USE_GCC_BRACE_GROUPS) #ifndef SvUVx # define SvUVx(sv) ({ SV *_sv = (sv)); SvUV(_sv); }) #endif #else #ifndef SvUVx # define SvUVx(sv) ((PL_Sv = (sv)), SvUV(PL_Sv)) #endif #endif /* Hint: sv_uv * Always use the SvUVx() macro instead of sv_uv(). */ /* Replace sv_uv with SvUVx */ #ifndef sv_uv # define sv_uv(sv) SvUVx(sv) #endif #if !defined(SvUOK) && defined(SvIOK_UV) # define SvUOK(sv) SvIOK_UV(sv) #endif #ifndef XST_mUV # define XST_mUV(i,v) (ST(i) = sv_2mortal(newSVuv(v)) ) #endif #ifndef XSRETURN_UV # define XSRETURN_UV(v) STMT_START { XST_mUV(0,v); XSRETURN(1); } STMT_END #endif #ifndef PUSHu # define PUSHu(u) STMT_START { sv_setuv(TARG, (UV)(u)); PUSHTARG; } STMT_END #endif #ifndef XPUSHu # define XPUSHu(u) STMT_START { sv_setuv(TARG, (UV)(u)); XPUSHTARG; } STMT_END #endif #if !defined(my_strnlen) #if defined(NEED_my_strnlen) static Size_t DPPP_(my_my_strnlen)(const char * str, Size_t maxlen); static #else extern Size_t DPPP_(my_my_strnlen)(const char * str, Size_t maxlen); #endif #if defined(NEED_my_strnlen) || defined(NEED_my_strnlen_GLOBAL) #define my_strnlen DPPP_(my_my_strnlen) #define Perl_my_strnlen DPPP_(my_my_strnlen) Size_t DPPP_(my_my_strnlen)(const char *str, Size_t maxlen) { const char *p = str; while(maxlen-- && *p) p++; return p - str; } #endif #endif #ifdef HAS_MEMCMP #ifndef memNE # define memNE(s1,s2,l) (memcmp(s1,s2,l)) #endif #ifndef memEQ # define memEQ(s1,s2,l) (!memcmp(s1,s2,l)) #endif #else #ifndef memNE # define memNE(s1,s2,l) (bcmp(s1,s2,l)) #endif #ifndef memEQ # define memEQ(s1,s2,l) (!bcmp(s1,s2,l)) #endif #endif #ifndef memEQs # define memEQs(s1, l, s2) \ (sizeof(s2)-1 == l && memEQ(s1, (s2 ""), (sizeof(s2)-1))) #endif #ifndef memNEs # define memNEs(s1, l, s2) !memEQs(s1, l, s2) #endif #ifndef memCHRs # define memCHRs(s, c) ((const char *) memchr("" s "" , c, sizeof(s)-1)) #endif #ifndef MoveD # define MoveD(s,d,n,t) memmove((char*)(d),(char*)(s), (n) * sizeof(t)) #endif #ifndef CopyD # define CopyD(s,d,n,t) memcpy((char*)(d),(char*)(s), (n) * sizeof(t)) #endif #ifdef HAS_MEMSET #ifndef ZeroD # define ZeroD(d,n,t) memzero((char*)(d), (n) * sizeof(t)) #endif #else #ifndef ZeroD # define ZeroD(d,n,t) ((void)memzero((char*)(d), (n) * sizeof(t)), d) #endif #endif #ifndef PoisonWith # define PoisonWith(d,n,t,b) (void)memset((char*)(d), (U8)(b), (n) * sizeof(t)) #endif #ifndef PoisonNew # define PoisonNew(d,n,t) PoisonWith(d,n,t,0xAB) #endif #ifndef PoisonFree # define PoisonFree(d,n,t) PoisonWith(d,n,t,0xEF) #endif #ifndef Poison # define Poison(d,n,t) PoisonFree(d,n,t) #endif #ifndef Newx # define Newx(v,n,t) New(0,v,n,t) #endif #ifndef Newxc # define Newxc(v,n,t,c) Newc(0,v,n,t,c) #endif #ifndef Newxz # define Newxz(v,n,t) Newz(0,v,n,t) #endif #ifdef NEED_mess_sv #define NEED_mess #endif #ifdef NEED_mess #define NEED_mess_nocontext #define NEED_vmess #endif #ifndef croak_sv #if (PERL_BCDVERSION >= 0x5007003) || ( (PERL_BCDVERSION >= 0x5006001) && (PERL_BCDVERSION < 0x5007000) ) # if ( (PERL_BCDVERSION >= 0x5008000) && (PERL_BCDVERSION < 0x5008009) ) || ( (PERL_BCDVERSION >= 0x5009000) && (PERL_BCDVERSION < 0x5010001) ) # define D_PPP_FIX_UTF8_ERRSV_FOR_SV(sv) \ STMT_START { \ SV *_errsv = ERRSV; \ SvFLAGS(_errsv) = (SvFLAGS(_errsv) & ~SVf_UTF8) | \ (SvFLAGS(sv) & SVf_UTF8); \ } STMT_END # else # define D_PPP_FIX_UTF8_ERRSV_FOR_SV(sv) STMT_START {} STMT_END # endif # define croak_sv(sv) \ STMT_START { \ SV *_sv = (sv); \ if (SvROK(_sv)) { \ sv_setsv(ERRSV, _sv); \ croak(NULL); \ } else { \ D_PPP_FIX_UTF8_ERRSV_FOR_SV(_sv); \ croak("%" SVf, SVfARG(_sv)); \ } \ } STMT_END #elif (PERL_BCDVERSION >= 0x5004000) # define croak_sv(sv) croak("%" SVf, SVfARG(sv)) #else # define croak_sv(sv) croak("%s", SvPV_nolen(sv)) #endif #endif #ifndef die_sv #if defined(NEED_die_sv) static OP * DPPP_(my_die_sv)(pTHX_ SV * baseex); static #else extern OP * DPPP_(my_die_sv)(pTHX_ SV * baseex); #endif #if defined(NEED_die_sv) || defined(NEED_die_sv_GLOBAL) #ifdef die_sv # undef die_sv #endif #define die_sv(a) DPPP_(my_die_sv)(aTHX_ a) #define Perl_die_sv DPPP_(my_die_sv) OP * DPPP_(my_die_sv)(pTHX_ SV *baseex) { croak_sv(baseex); return (OP *)NULL; } #endif #endif #ifndef warn_sv #if (PERL_BCDVERSION >= 0x5004000) # define warn_sv(sv) warn("%" SVf, SVfARG(sv)) #else # define warn_sv(sv) warn("%s", SvPV_nolen(sv)) #endif #endif #if ! defined vmess && (PERL_BCDVERSION >= 0x5004000) # if defined(NEED_vmess) static SV * DPPP_(my_vmess)(pTHX_ const char * pat, va_list * args); static #else extern SV * DPPP_(my_vmess)(pTHX_ const char * pat, va_list * args); #endif #if defined(NEED_vmess) || defined(NEED_vmess_GLOBAL) #ifdef vmess # undef vmess #endif #define vmess(a,b) DPPP_(my_vmess)(aTHX_ a,b) #define Perl_vmess DPPP_(my_vmess) SV* DPPP_(my_vmess)(pTHX_ const char* pat, va_list* args) { mess(pat, args); return PL_mess_sv; } # endif #endif #if (PERL_BCDVERSION < 0x5006000) && (PERL_BCDVERSION >= 0x5004000) #undef mess #endif #if !defined(mess_nocontext) && !defined(Perl_mess_nocontext) && (PERL_BCDVERSION >= 0x5004000) #if defined(NEED_mess_nocontext) static SV * DPPP_(my_mess_nocontext)(const char * pat, ...); static #else extern SV * DPPP_(my_mess_nocontext)(const char * pat, ...); #endif #if defined(NEED_mess_nocontext) || defined(NEED_mess_nocontext_GLOBAL) #define mess_nocontext DPPP_(my_mess_nocontext) #define Perl_mess_nocontext DPPP_(my_mess_nocontext) SV* DPPP_(my_mess_nocontext)(const char* pat, ...) { dTHX; SV *sv; va_list args; va_start(args, pat); sv = vmess(pat, &args); va_end(args); return sv; } #endif #endif #ifndef mess #if defined(NEED_mess) static SV * DPPP_(my_mess)(pTHX_ const char * pat, ...); static #else extern SV * DPPP_(my_mess)(pTHX_ const char * pat, ...); #endif #if defined(NEED_mess) || defined(NEED_mess_GLOBAL) #define Perl_mess DPPP_(my_mess) SV* DPPP_(my_mess)(pTHX_ const char* pat, ...) { SV *sv; va_list args; va_start(args, pat); sv = vmess(pat, &args); va_end(args); return sv; } #ifdef mess_nocontext #define mess mess_nocontext #else #define mess Perl_mess_nocontext #endif #endif #endif #if ! defined mess_sv && (PERL_BCDVERSION >= 0x5004000) #if defined(NEED_mess_sv) static SV * DPPP_(my_mess_sv)(pTHX_ SV * basemsg, bool consume); static #else extern SV * DPPP_(my_mess_sv)(pTHX_ SV * basemsg, bool consume); #endif #if defined(NEED_mess_sv) || defined(NEED_mess_sv_GLOBAL) #ifdef mess_sv # undef mess_sv #endif #define mess_sv(a,b) DPPP_(my_mess_sv)(aTHX_ a,b) #define Perl_mess_sv DPPP_(my_mess_sv) SV * DPPP_(my_mess_sv)(pTHX_ SV *basemsg, bool consume) { SV *tmp; SV *ret; if (SvPOK(basemsg) && SvCUR(basemsg) && *(SvEND(basemsg)-1) == '\n') { if (consume) return basemsg; ret = mess(""); SvSetSV_nosteal(ret, basemsg); return ret; } if (consume) { sv_catsv(basemsg, mess("")); return basemsg; } ret = mess(""); tmp = newSVsv(ret); SvSetSV_nosteal(ret, basemsg); sv_catsv(ret, tmp); sv_dec(tmp); return ret; } #endif #endif #ifndef warn_nocontext #define warn_nocontext warn #endif #ifndef croak_nocontext #define croak_nocontext croak #endif #ifndef croak_no_modify #define croak_no_modify() croak_nocontext("%s", PL_no_modify) #define Perl_croak_no_modify() croak_no_modify() #endif #ifndef croak_memory_wrap #if (PERL_BCDVERSION >= 0x5009002) || ( (PERL_BCDVERSION >= 0x5008006) && (PERL_BCDVERSION < 0x5009000) ) # define croak_memory_wrap() croak_nocontext("%s", PL_memory_wrap) #else # define croak_memory_wrap() croak_nocontext("panic: memory wrap") #endif #endif #ifndef croak_xs_usage #if defined(NEED_croak_xs_usage) static void DPPP_(my_croak_xs_usage)(const CV * const cv, const char * const params); static #else extern void DPPP_(my_croak_xs_usage)(const CV * const cv, const char * const params); #endif #if defined(NEED_croak_xs_usage) || defined(NEED_croak_xs_usage_GLOBAL) #define croak_xs_usage DPPP_(my_croak_xs_usage) #define Perl_croak_xs_usage DPPP_(my_croak_xs_usage) #ifndef PERL_ARGS_ASSERT_CROAK_XS_USAGE #define PERL_ARGS_ASSERT_CROAK_XS_USAGE assert(cv); assert(params) void DPPP_(my_croak_xs_usage)(const CV *const cv, const char *const params) { dTHX; const GV *const gv = CvGV(cv); PERL_ARGS_ASSERT_CROAK_XS_USAGE; if (gv) { const char *const gvname = GvNAME(gv); const HV *const stash = GvSTASH(gv); const char *const hvname = stash ? HvNAME(stash) : NULL; if (hvname) croak("Usage: %s::%s(%s)", hvname, gvname, params); else croak("Usage: %s(%s)", gvname, params); } else { /* Pants. I don't think that it should be possible to get here. */ croak("Usage: CODE(0x%" UVxf ")(%s)", PTR2UV(cv), params); } } #endif #endif #endif #ifndef mPUSHs # define mPUSHs(s) PUSHs(sv_2mortal(s)) #endif #ifndef PUSHmortal # define PUSHmortal PUSHs(sv_newmortal()) #endif #ifndef mPUSHp # define mPUSHp(p,l) sv_setpvn(PUSHmortal, (p), (l)) #endif #ifndef mPUSHn # define mPUSHn(n) sv_setnv(PUSHmortal, (NV)(n)) #endif #ifndef mPUSHi # define mPUSHi(i) sv_setiv(PUSHmortal, (IV)(i)) #endif #ifndef mPUSHu # define mPUSHu(u) sv_setuv(PUSHmortal, (UV)(u)) #endif #ifndef mXPUSHs # define mXPUSHs(s) XPUSHs(sv_2mortal(s)) #endif #ifndef XPUSHmortal # define XPUSHmortal XPUSHs(sv_newmortal()) #endif #ifndef mXPUSHp # define mXPUSHp(p,l) STMT_START { EXTEND(sp,1); sv_setpvn(PUSHmortal, (p), (l)); } STMT_END #endif #ifndef mXPUSHn # define mXPUSHn(n) STMT_START { EXTEND(sp,1); sv_setnv(PUSHmortal, (NV)(n)); } STMT_END #endif #ifndef mXPUSHi # define mXPUSHi(i) STMT_START { EXTEND(sp,1); sv_setiv(PUSHmortal, (IV)(i)); } STMT_END #endif #ifndef mXPUSHu # define mXPUSHu(u) STMT_START { EXTEND(sp,1); sv_setuv(PUSHmortal, (UV)(u)); } STMT_END #endif /* Replace: 1 */ #ifndef call_sv # define call_sv perl_call_sv #endif #ifndef call_pv # define call_pv perl_call_pv #endif #ifndef call_argv # define call_argv perl_call_argv #endif #ifndef call_method # define call_method perl_call_method #endif #ifndef eval_sv # define eval_sv perl_eval_sv #endif #if (PERL_BCDVERSION >= 0x5003098) && (PERL_BCDVERSION < 0x5006000) #ifndef eval_pv # define eval_pv perl_eval_pv #endif #endif /* Replace: 0 */ #if (PERL_BCDVERSION < 0x5006000) #ifndef Perl_eval_sv # define Perl_eval_sv perl_eval_sv #endif #if (PERL_BCDVERSION >= 0x5003098) #ifndef Perl_eval_pv # define Perl_eval_pv perl_eval_pv #endif #endif #endif #ifndef G_LIST # define G_LIST G_ARRAY /* Replace */ #endif #ifndef PERL_LOADMOD_DENY # define PERL_LOADMOD_DENY 0x1 #endif #ifndef PERL_LOADMOD_NOIMPORT # define PERL_LOADMOD_NOIMPORT 0x2 #endif #ifndef PERL_LOADMOD_IMPORT_OPS # define PERL_LOADMOD_IMPORT_OPS 0x4 #endif #if defined(PERL_USE_GCC_BRACE_GROUPS) # define D_PPP_CROAK_IF_ERROR(cond) ({ SV *_errsv; ((cond) && (_errsv = ERRSV) && (SvROK(_errsv) || SvTRUE(_errsv)) && (croak_sv(_errsv), 1)); }) #else # define D_PPP_CROAK_IF_ERROR(cond) ((cond) && (SvROK(ERRSV) || SvTRUE(ERRSV)) && (croak_sv(ERRSV), 1)) #endif #ifndef G_METHOD # define G_METHOD 64 # ifdef call_sv # undef call_sv # endif # if (PERL_BCDVERSION < 0x5006000) # define call_sv(sv, flags) ((flags) & G_METHOD ? perl_call_method((char *) SvPV_nolen_const(sv), \ (flags) & ~G_METHOD) : perl_call_sv(sv, flags)) # else # define call_sv(sv, flags) ((flags) & G_METHOD ? Perl_call_method(aTHX_ (char *) SvPV_nolen_const(sv), \ (flags) & ~G_METHOD) : Perl_call_sv(aTHX_ sv, flags)) # endif #endif #ifndef G_RETHROW # define G_RETHROW 8192 # ifdef eval_sv # undef eval_sv # endif # if defined(PERL_USE_GCC_BRACE_GROUPS) # define eval_sv(sv, flags) ({ I32 _flags = (flags); I32 _ret = Perl_eval_sv(aTHX_ sv, (_flags & ~G_RETHROW)); D_PPP_CROAK_IF_ERROR(_flags & G_RETHROW); _ret; }) # else # define eval_sv(sv, flags) ((PL_na = Perl_eval_sv(aTHX_ sv, ((flags) & ~G_RETHROW))), D_PPP_CROAK_IF_ERROR((flags) & G_RETHROW), (I32)PL_na) # endif #endif /* Older Perl versions have broken croak_on_error=1 */ #if (PERL_BCDVERSION < 0x5031002) # ifdef eval_pv # undef eval_pv # if defined(PERL_USE_GCC_BRACE_GROUPS) # define eval_pv(p, croak_on_error) ({ SV *_sv = Perl_eval_pv(aTHX_ p, 0); D_PPP_CROAK_IF_ERROR(croak_on_error); _sv; }) # else # define eval_pv(p, croak_on_error) ((PL_Sv = Perl_eval_pv(aTHX_ p, 0)), D_PPP_CROAK_IF_ERROR(croak_on_error), PL_Sv) # endif # endif #endif /* This is backport for Perl 5.3.97d and older which do not provide perl_eval_pv */ #ifndef eval_pv #if defined(NEED_eval_pv) static SV * DPPP_(my_eval_pv)(const char * p, I32 croak_on_error); static #else extern SV * DPPP_(my_eval_pv)(const char * p, I32 croak_on_error); #endif #if defined(NEED_eval_pv) || defined(NEED_eval_pv_GLOBAL) #ifdef eval_pv # undef eval_pv #endif #define eval_pv(a,b) DPPP_(my_eval_pv)(aTHX_ a,b) #define Perl_eval_pv DPPP_(my_eval_pv) SV* DPPP_(my_eval_pv)(const char *p, I32 croak_on_error) { dSP; SV* sv = newSVpv(p, 0); PUSHMARK(sp); eval_sv(sv, G_SCALAR); SvREFCNT_dec(sv); SPAGAIN; sv = POPs; PUTBACK; D_PPP_CROAK_IF_ERROR(croak_on_error); return sv; } #endif #endif #if ! defined(vload_module) && defined(start_subparse) #if defined(NEED_vload_module) static void DPPP_(my_vload_module)(U32 flags, SV * name, SV * ver, va_list * args); static #else extern void DPPP_(my_vload_module)(U32 flags, SV * name, SV * ver, va_list * args); #endif #if defined(NEED_vload_module) || defined(NEED_vload_module_GLOBAL) #ifdef vload_module # undef vload_module #endif #define vload_module(a,b,c,d) DPPP_(my_vload_module)(aTHX_ a,b,c,d) #define Perl_vload_module DPPP_(my_vload_module) void DPPP_(my_vload_module)(U32 flags, SV *name, SV *ver, va_list *args) { dTHR; dVAR; OP *veop, *imop; OP * const modname = newSVOP(OP_CONST, 0, name); /* 5.005 has a somewhat hacky force_normal that doesn't croak on SvREADONLY() if PL_compiling is true. Current perls take care in ck_require() to correctly turn off SvREADONLY before calling force_normal_flags(). This seems a better fix than fudging PL_compiling */ SvREADONLY_off(((SVOP*)modname)->op_sv); modname->op_private |= OPpCONST_BARE; if (ver) { veop = newSVOP(OP_CONST, 0, ver); } else veop = NULL; if (flags & PERL_LOADMOD_NOIMPORT) { imop = sawparens(newNULLLIST()); } else if (flags & PERL_LOADMOD_IMPORT_OPS) { imop = va_arg(*args, OP*); } else { SV *sv; imop = NULL; sv = va_arg(*args, SV*); while (sv) { imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv)); sv = va_arg(*args, SV*); } } { const line_t ocopline = PL_copline; COP * const ocurcop = PL_curcop; const int oexpect = PL_expect; utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0), #if (PERL_BCDVERSION > 0x5003000) veop, #endif modname, imop); PL_expect = oexpect; PL_copline = ocopline; PL_curcop = ocurcop; } } #endif #endif #ifndef load_module #if defined(NEED_load_module) static void DPPP_(my_load_module)(U32 flags, SV * name, SV * ver, ...); static #else extern void DPPP_(my_load_module)(U32 flags, SV * name, SV * ver, ...); #endif #if defined(NEED_load_module) || defined(NEED_load_module_GLOBAL) #ifdef load_module # undef load_module #endif #define load_module DPPP_(my_load_module) #define Perl_load_module DPPP_(my_load_module) void DPPP_(my_load_module)(U32 flags, SV *name, SV *ver, ...) { va_list args; va_start(args, ver); vload_module(flags, name, ver, &args); va_end(args); } #endif #endif #ifndef newRV_inc # define newRV_inc(sv) newRV(sv) /* Replace */ #endif #ifndef newRV_noinc #if defined(PERL_USE_GCC_BRACE_GROUPS) # define newRV_noinc(sv) ({ SV *_sv = (SV *)newRV((sv)); SvREFCNT_dec((sv)); _sv; }) #else # define newRV_noinc(sv) ((PL_Sv = (SV *)newRV((sv))), SvREFCNT_dec((sv)), PL_Sv) #endif #endif /* * Boilerplate macros for initializing and accessing interpreter-local * data from C. All statics in extensions should be reworked to use * this, if you want to make the extension thread-safe. See ext/re/re.xs * for an example of the use of these macros. * * Code that uses these macros is responsible for the following: * 1. #define MY_CXT_KEY to a unique string, e.g. "DynaLoader_guts" * 2. Declare a typedef named my_cxt_t that is a structure that contains * all the data that needs to be interpreter-local. * 3. Use the START_MY_CXT macro after the declaration of my_cxt_t. * 4. Use the MY_CXT_INIT macro such that it is called exactly once * (typically put in the BOOT: section). * 5. Use the members of the my_cxt_t structure everywhere as * MY_CXT.member. * 6. Use the dMY_CXT macro (a declaration) in all the functions that * access MY_CXT. */ #if defined(MULTIPLICITY) || defined(PERL_OBJECT) || \ defined(PERL_CAPI) || defined(PERL_IMPLICIT_CONTEXT) #ifndef START_MY_CXT /* This must appear in all extensions that define a my_cxt_t structure, * right after the definition (i.e. at file scope). The non-threads * case below uses it to declare the data as static. */ #define START_MY_CXT #if (PERL_BCDVERSION < 0x5004068) /* Fetches the SV that keeps the per-interpreter data. */ #define dMY_CXT_SV \ SV *my_cxt_sv = get_sv(MY_CXT_KEY, FALSE) #else /* >= perl5.004_68 */ #define dMY_CXT_SV \ SV *my_cxt_sv = *hv_fetch(PL_modglobal, MY_CXT_KEY, \ sizeof(MY_CXT_KEY)-1, TRUE) #endif /* < perl5.004_68 */ /* This declaration should be used within all functions that use the * interpreter-local data. */ #define dMY_CXT \ dMY_CXT_SV; \ my_cxt_t *my_cxtp = INT2PTR(my_cxt_t*,SvUV(my_cxt_sv)) /* Creates and zeroes the per-interpreter data. * (We allocate my_cxtp in a Perl SV so that it will be released when * the interpreter goes away.) */ #define MY_CXT_INIT \ dMY_CXT_SV; \ /* newSV() allocates one more than needed */ \ my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1));\ Zero(my_cxtp, 1, my_cxt_t); \ sv_setuv(my_cxt_sv, PTR2UV(my_cxtp)) /* This macro must be used to access members of the my_cxt_t structure. * e.g. MYCXT.some_data */ #define MY_CXT (*my_cxtp) /* Judicious use of these macros can reduce the number of times dMY_CXT * is used. Use is similar to pTHX, aTHX etc. */ #define pMY_CXT my_cxt_t *my_cxtp #define pMY_CXT_ pMY_CXT, #define _pMY_CXT ,pMY_CXT #define aMY_CXT my_cxtp #define aMY_CXT_ aMY_CXT, #define _aMY_CXT ,aMY_CXT #endif /* START_MY_CXT */ #ifndef MY_CXT_CLONE /* Clones the per-interpreter data. */ #define MY_CXT_CLONE \ dMY_CXT_SV; \ my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1));\ Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t);\ sv_setuv(my_cxt_sv, PTR2UV(my_cxtp)) #endif #else /* single interpreter */ #ifndef START_MY_CXT #define START_MY_CXT static my_cxt_t my_cxt; #define dMY_CXT_SV dNOOP #define dMY_CXT dNOOP #define MY_CXT_INIT NOOP #define MY_CXT my_cxt #define pMY_CXT void #define pMY_CXT_ #define _pMY_CXT #define aMY_CXT #define aMY_CXT_ #define _aMY_CXT #endif /* START_MY_CXT */ #ifndef MY_CXT_CLONE #define MY_CXT_CLONE NOOP #endif #endif #ifndef SvREFCNT_inc # ifdef PERL_USE_GCC_BRACE_GROUPS # define SvREFCNT_inc(sv) \ ({ \ SV * const _sv = (SV*)(sv); \ if (_sv) \ (SvREFCNT(_sv))++; \ _sv; \ }) # else # define SvREFCNT_inc(sv) \ ((PL_Sv=(SV*)(sv)) ? (++(SvREFCNT(PL_Sv)),PL_Sv) : NULL) # endif #endif #ifndef SvREFCNT_inc_simple # ifdef PERL_USE_GCC_BRACE_GROUPS # define SvREFCNT_inc_simple(sv) \ ({ \ if (sv) \ (SvREFCNT(sv))++; \ (SV *)(sv); \ }) # else # define SvREFCNT_inc_simple(sv) \ ((sv) ? (SvREFCNT(sv)++,(SV*)(sv)) : NULL) # endif #endif #ifndef SvREFCNT_inc_NN # ifdef PERL_USE_GCC_BRACE_GROUPS # define SvREFCNT_inc_NN(sv) \ ({ \ SV * const _sv = (SV*)(sv); \ SvREFCNT(_sv)++; \ _sv; \ }) # else # define SvREFCNT_inc_NN(sv) \ (PL_Sv=(SV*)(sv),++(SvREFCNT(PL_Sv)),PL_Sv) # endif #endif #ifndef SvREFCNT_inc_void # ifdef PERL_USE_GCC_BRACE_GROUPS # define SvREFCNT_inc_void(sv) \ ({ \ SV * const _sv = (SV*)(sv); \ if (_sv) \ (void)(SvREFCNT(_sv)++); \ }) # else # define SvREFCNT_inc_void(sv) \ (void)((PL_Sv=(SV*)(sv)) ? ++(SvREFCNT(PL_Sv)) : 0) # endif #endif #ifndef SvREFCNT_inc_simple_void # define SvREFCNT_inc_simple_void(sv) STMT_START { if (sv) SvREFCNT(sv)++; } STMT_END #endif #ifndef SvREFCNT_inc_simple_NN # define SvREFCNT_inc_simple_NN(sv) (++SvREFCNT(sv), (SV*)(sv)) #endif #ifndef SvREFCNT_inc_void_NN # define SvREFCNT_inc_void_NN(sv) (void)(++SvREFCNT((SV*)(sv))) #endif #ifndef SvREFCNT_inc_simple_void_NN # define SvREFCNT_inc_simple_void_NN(sv) (void)(++SvREFCNT((SV*)(sv))) #endif #ifndef newSV_type #if defined(PERL_USE_GCC_BRACE_GROUPS) # define newSV_type(t) ({ SV *_sv = newSV(0); sv_upgrade(_sv, (t)); _sv; }) #else # define newSV_type(t) ((PL_Sv = newSV(0)), sv_upgrade(PL_Sv, (t)), PL_Sv) #endif #endif #if (PERL_BCDVERSION < 0x5006000) # define D_PPP_CONSTPV_ARG(x) ((char *) (x)) #else # define D_PPP_CONSTPV_ARG(x) (x) #endif #ifndef newSVpvn # define newSVpvn(data,len) ((data) \ ? ((len) ? newSVpv((data), (len)) : newSVpv("", 0)) \ : newSV(0)) #endif #ifndef newSVpvn_utf8 # define newSVpvn_utf8(s, len, u) newSVpvn_flags((s), (len), (u) ? SVf_UTF8 : 0) #endif #ifndef SVf_UTF8 # define SVf_UTF8 0 #endif #ifndef newSVpvn_flags #if defined(PERL_USE_GCC_BRACE_GROUPS) # define newSVpvn_flags(s, len, flags) ({ SV *_sv = newSVpvn(D_PPP_CONSTPV_ARG((s)), (len)); SvFLAGS(_sv) |= ((flags) & SVf_UTF8); ((flags) & SVs_TEMP) ? sv_2mortal(_sv) : _sv; }) #else # define newSVpvn_flags(s, len, flags) ((PL_Sv = newSVpvn(D_PPP_CONSTPV_ARG((s)), (len))), SvFLAGS(PL_Sv) |= ((flags) & SVf_UTF8), (((flags) & SVs_TEMP) ? sv_2mortal(PL_Sv) : PL_Sv)) #endif #endif #ifndef SV_NOSTEAL # define SV_NOSTEAL 16 #endif #if ( (PERL_BCDVERSION >= 0x5007003) && (PERL_BCDVERSION < 0x5008007) ) || ( (PERL_BCDVERSION >= 0x5009000) && (PERL_BCDVERSION < 0x5009002) ) #undef sv_setsv_flags #if defined(PERL_USE_GCC_BRACE_GROUPS) #define sv_setsv_flags(dstr, sstr, flags) \ STMT_START { \ if (((flags) & SV_NOSTEAL) && (sstr) && (SvFLAGS((SV *)(sstr)) & SVs_TEMP)) { \ SvTEMP_off((SV *)(sstr)); \ Perl_sv_setsv_flags(aTHX_ (dstr), (sstr), (flags) & ~SV_NOSTEAL); \ SvTEMP_on((SV *)(sstr)); \ } else { \ Perl_sv_setsv_flags(aTHX_ (dstr), (sstr), (flags) & ~SV_NOSTEAL); \ } \ } STMT_END #else ( \ (((flags) & SV_NOSTEAL) && (sstr) && (SvFLAGS((SV *)(sstr)) & SVs_TEMP)) ? ( \ SvTEMP_off((SV *)(sstr)), \ Perl_sv_setsv_flags(aTHX_ (dstr), (sstr), (flags) & ~SV_NOSTEAL), \ SvTEMP_on((SV *)(sstr)), \ 1 \ ) : ( \ Perl_sv_setsv_flags(aTHX_ (dstr), (sstr), (flags) & ~SV_NOSTEAL), \ 1 \ ) \ ) #endif #endif #if defined(PERL_USE_GCC_BRACE_GROUPS) #ifndef sv_setsv_flags # define sv_setsv_flags(dstr, sstr, flags) \ STMT_START { \ if (((flags) & SV_NOSTEAL) && (sstr) && (SvFLAGS((SV *)(sstr)) & SVs_TEMP)) { \ SvTEMP_off((SV *)(sstr)); \ if (!((flags) & SV_GMAGIC) && (sstr) && SvGMAGICAL((SV *)(sstr))) { \ SvGMAGICAL_off((SV *)(sstr)); \ sv_setsv((dstr), (sstr)); \ SvGMAGICAL_on((SV *)(sstr)); \ } else { \ sv_setsv((dstr), (sstr)); \ } \ SvTEMP_on((SV *)(sstr)); \ } else { \ if (!((flags) & SV_GMAGIC) && (sstr) && SvGMAGICAL((SV *)(sstr))) { \ SvGMAGICAL_off((SV *)(sstr)); \ sv_setsv((dstr), (sstr)); \ SvGMAGICAL_on((SV *)(sstr)); \ } else { \ sv_setsv((dstr), (sstr)); \ } \ } \ } STMT_END #endif #else #ifndef sv_setsv_flags # define sv_setsv_flags(dstr, sstr, flags) \ ( \ (((flags) & SV_NOSTEAL) && (sstr) && (SvFLAGS((SV *)(sstr)) & SVs_TEMP)) ? ( \ SvTEMP_off((SV *)(sstr)), \ (!((flags) & SV_GMAGIC) && (sstr) && SvGMAGICAL((SV *)(sstr))) ? ( \ SvGMAGICAL_off((SV *)(sstr)), \ sv_setsv((dstr), (sstr)), \ SvGMAGICAL_on((SV *)(sstr)), \ 1 \ ) : ( \ sv_setsv((dstr), (sstr)), \ 1 \ ), \ SvTEMP_on((SV *)(sstr)), \ 1 \ ) : ( \ (!((flags) & SV_GMAGIC) && (sstr) && SvGMAGICAL((SV *)(sstr))) ? ( \ SvGMAGICAL_off((SV *)(sstr)), \ sv_setsv((dstr), (sstr)), \ SvGMAGICAL_on((SV *)(sstr)), \ 1 \ ) : ( \ sv_setsv((dstr), (sstr)), \ 1 \ ) \ ) \ ) #endif #endif #if defined(PERL_USE_GCC_BRACE_GROUPS) #ifndef newSVsv_flags # define newSVsv_flags(sv, flags) ({ SV *_sv = newSV(0); sv_setsv_flags(_sv, (sv), (flags)); _sv; }) #endif #else #ifndef newSVsv_flags # define newSVsv_flags(sv, flags) ((PL_Sv = newSV(0)), sv_setsv_flags(PL_Sv, (sv), (flags)), PL_Sv) #endif #endif #ifndef newSVsv_nomg # define newSVsv_nomg(sv) newSVsv_flags((sv), SV_NOSTEAL) #endif #if (PERL_BCDVERSION >= 0x5017005) #ifndef sv_mortalcopy_flags # define sv_mortalcopy_flags(sv, flags) Perl_sv_mortalcopy_flags(aTHX_ (sv), (flags)) #endif #else #ifndef sv_mortalcopy_flags # define sv_mortalcopy_flags(sv, flags) sv_2mortal(newSVsv_flags((sv), (flags))) #endif #endif #ifndef SvMAGIC_set # define SvMAGIC_set(sv, val) \ STMT_START { assert(SvTYPE(sv) >= SVt_PVMG); \ (((XPVMG*) SvANY(sv))->xmg_magic = (val)); } STMT_END #endif #if (PERL_BCDVERSION < 0x5009003) #ifndef SvPVX_const # define SvPVX_const(sv) ((const char*) (0 + SvPVX(sv))) #endif #ifndef SvPVX_mutable # define SvPVX_mutable(sv) (0 + SvPVX(sv)) #endif #ifndef SvRV_set # define SvRV_set(sv, val) \ STMT_START { assert(SvTYPE(sv) >= SVt_RV); \ (((XRV*) SvANY(sv))->xrv_rv = (val)); } STMT_END #endif #else #ifndef SvPVX_const # define SvPVX_const(sv) ((const char*)((sv)->sv_u.svu_pv)) #endif #ifndef SvPVX_mutable # define SvPVX_mutable(sv) ((sv)->sv_u.svu_pv) #endif #ifndef SvRV_set # define SvRV_set(sv, val) \ STMT_START { assert(SvTYPE(sv) >= SVt_RV); \ ((sv)->sv_u.svu_rv = (val)); } STMT_END #endif #endif #ifndef SvSTASH_set # define SvSTASH_set(sv, val) \ STMT_START { assert(SvTYPE(sv) >= SVt_PVMG); \ (((XPVMG*) SvANY(sv))->xmg_stash = (val)); } STMT_END #endif #if (PERL_BCDVERSION < 0x5004000) #ifndef SvUV_set # define SvUV_set(sv, val) \ STMT_START { assert(SvTYPE(sv) == SVt_IV || SvTYPE(sv) >= SVt_PVIV); \ (((XPVIV*) SvANY(sv))->xiv_iv = (IV) (val)); } STMT_END #endif #else #ifndef SvUV_set # define SvUV_set(sv, val) \ STMT_START { assert(SvTYPE(sv) == SVt_IV || SvTYPE(sv) >= SVt_PVIV); \ (((XPVUV*) SvANY(sv))->xuv_uv = (val)); } STMT_END #endif #endif /* Hint: newSVpvn_share * The SVs created by this function only mimic the behaviour of * shared PVs without really being shared. Only use if you know * what you're doing. */ #ifndef newSVpvn_share #if defined(NEED_newSVpvn_share) static SV * DPPP_(my_newSVpvn_share)(pTHX_ const char * s, I32 len, U32 hash); static #else extern SV * DPPP_(my_newSVpvn_share)(pTHX_ const char * s, I32 len, U32 hash); #endif #if defined(NEED_newSVpvn_share) || defined(NEED_newSVpvn_share_GLOBAL) #ifdef newSVpvn_share # undef newSVpvn_share #endif #define newSVpvn_share(a,b,c) DPPP_(my_newSVpvn_share)(aTHX_ a,b,c) #define Perl_newSVpvn_share DPPP_(my_newSVpvn_share) SV * DPPP_(my_newSVpvn_share)(pTHX_ const char *s, I32 len, U32 hash) { SV *sv; if (len < 0) len = -len; if (!hash) PERL_HASH(hash, (char*) s, len); sv = newSVpvn((char *) s, len); sv_upgrade(sv, SVt_PVIV); SvIVX(sv) = hash; SvREADONLY_on(sv); SvPOK_on(sv); return sv; } #endif #endif #ifndef SvSHARED_HASH # define SvSHARED_HASH(sv) (0 + SvUVX(sv)) #endif #ifndef HvNAME_get # define HvNAME_get(hv) HvNAME(hv) #endif #ifndef HvNAMELEN_get # define HvNAMELEN_get(hv) (HvNAME_get(hv) ? (I32)strlen(HvNAME_get(hv)) : 0) #endif #if (PERL_BCDVERSION >= 0x5009002) && (PERL_BCDVERSION <= 0x5009003) /* 5.9.2 and 5.9.3 ignore the length param */ #undef gv_fetchpvn_flags #endif #ifdef GV_NOADD_MASK # define D_PPP_GV_NOADD_MASK GV_NOADD_MASK #else # define D_PPP_GV_NOADD_MASK 0xE0 #endif #ifndef gv_fetchpvn_flags # define gv_fetchpvn_flags(name, len, flags, sv_type) gv_fetchpv(SvPVX(sv_2mortal(newSVpvn((name), (len)))), ((flags) & D_PPP_GV_NOADD_MASK) ? FALSE : TRUE, (I32)(sv_type)) #endif #ifndef GvSVn # define GvSVn(gv) GvSV(gv) #endif #ifndef isGV_with_GP # define isGV_with_GP(gv) isGV(gv) #endif #ifndef gv_fetchsv # define gv_fetchsv(name, flags, svt) gv_fetchpv(SvPV_nolen_const(name), flags, svt) #endif #ifndef get_cvn_flags # define get_cvn_flags(name, namelen, flags) get_cv(name, flags) #endif #ifndef gv_init_pvn # define gv_init_pvn(gv, stash, ptr, len, flags) gv_init(gv, stash, ptr, len, flags & GV_ADDMULTI ? TRUE : FALSE) #endif /* concatenating with "" ensures that only literal strings are accepted as argument * note that STR_WITH_LEN() can't be used as argument to macros or functions that * under some configurations might be macros */ #ifndef STR_WITH_LEN # define STR_WITH_LEN(s) (s ""), (sizeof(s)-1) #endif #ifndef newSVpvs # define newSVpvs(str) newSVpvn(str "", sizeof(str) - 1) #endif #ifndef newSVpvs_flags # define newSVpvs_flags(str, flags) newSVpvn_flags(str "", sizeof(str) - 1, flags) #endif #ifndef newSVpvs_share # define newSVpvs_share(str) newSVpvn_share(str "", sizeof(str) - 1, 0) #endif #ifndef sv_catpvs # define sv_catpvs(sv, str) sv_catpvn(sv, str "", sizeof(str) - 1) #endif #ifndef sv_setpvs # define sv_setpvs(sv, str) sv_setpvn(sv, str "", sizeof(str) - 1) #endif #ifndef hv_fetchs # define hv_fetchs(hv, key, lval) hv_fetch(hv, key "", sizeof(key) - 1, lval) #endif #ifndef hv_stores # define hv_stores(hv, key, val) hv_store(hv, key "", sizeof(key) - 1, val, 0) #endif #ifndef gv_fetchpvs # define gv_fetchpvs(name, flags, svt) gv_fetchpvn_flags(name "", sizeof(name) - 1, flags, svt) #endif #ifndef gv_stashpvs # define gv_stashpvs(name, flags) gv_stashpvn(name "", sizeof(name) - 1, flags) #endif #ifndef get_cvs # define get_cvs(name, flags) get_cvn_flags(name "", sizeof(name)-1, flags) #endif #ifndef SvGETMAGIC # define SvGETMAGIC(x) STMT_START { if (SvGMAGICAL(x)) mg_get(x); } STMT_END #endif /* That's the best we can do... */ #ifndef sv_catpvn_nomg # define sv_catpvn_nomg sv_catpvn #endif #ifndef sv_catsv_nomg # define sv_catsv_nomg sv_catsv #endif #ifndef sv_setsv_nomg # define sv_setsv_nomg sv_setsv #endif #ifndef sv_pvn_nomg # define sv_pvn_nomg sv_pvn #endif #ifdef SVf_IVisUV #if defined(PERL_USE_GCC_BRACE_GROUPS) #ifndef SvIV_nomg # define SvIV_nomg(sv) (!SvGMAGICAL((sv)) ? SvIV((sv)) : ({ SV *_sviv = sv_mortalcopy_flags((sv), SV_NOSTEAL); IV _iv = SvIV(_sviv); SvFLAGS((sv)) = (SvFLAGS((sv)) & ~SVf_IVisUV) | (SvFLAGS(_sviv) & SVf_IVisUV); _iv; })) #endif #ifndef SvUV_nomg # define SvUV_nomg(sv) (!SvGMAGICAL((sv)) ? SvUV((sv)) : ({ SV *_svuv = sv_mortalcopy_flags((sv), SV_NOSTEAL); UV _uv = SvUV(_svuv); SvFLAGS((sv)) = (SvFLAGS((sv)) & ~SVf_IVisUV) | (SvFLAGS(_svuv) & SVf_IVisUV); _uv; })) #endif #else #ifndef SvIV_nomg # define SvIV_nomg(sv) (!SvGMAGICAL((sv)) ? SvIV((sv)) : ((PL_Sv = sv_mortalcopy_flags((sv), SV_NOSTEAL)), sv_upgrade(PL_Sv, SVt_PVIV), (SvIVX(PL_Sv) = SvIV(PL_Sv)), (SvFLAGS((sv)) = (SvFLAGS((sv)) & ~SVf_IVisUV) | (SvFLAGS(PL_Sv) & SVf_IVisUV)), SvIVX(PL_Sv))) #endif #ifndef SvUV_nomg # define SvUV_nomg(sv) (!SvGMAGICAL((sv)) ? SvIV((sv)) : ((PL_Sv = sv_mortalcopy_flags((sv), SV_NOSTEAL)), sv_upgrade(PL_Sv, SVt_PVIV), (SvUVX(PL_Sv) = SvUV(PL_Sv)), (SvFLAGS((sv)) = (SvFLAGS((sv)) & ~SVf_IVisUV) | (SvFLAGS(PL_Sv) & SVf_IVisUV)), SvUVX(PL_Sv))) #endif #endif #else #ifndef SvIV_nomg # define SvIV_nomg(sv) (!SvGMAGICAL((sv)) ? SvIV((sv)) : SvIVx(sv_mortalcopy_flags((sv), SV_NOSTEAL))) #endif #ifndef SvUV_nomg # define SvUV_nomg(sv) (!SvGMAGICAL((sv)) ? SvUV((sv)) : SvUVx(sv_mortalcopy_flags((sv), SV_NOSTEAL))) #endif #endif #ifndef SvNV_nomg # define SvNV_nomg(sv) (!SvGMAGICAL((sv)) ? SvNV((sv)) : SvNVx(sv_mortalcopy_flags((sv), SV_NOSTEAL))) #endif #ifndef SvTRUE_nomg # define SvTRUE_nomg(sv) (!SvGMAGICAL((sv)) ? SvTRUE((sv)) : SvTRUEx(sv_mortalcopy_flags((sv), SV_NOSTEAL))) #endif #ifndef sv_catpv_mg # define sv_catpv_mg(sv, ptr) \ STMT_START { \ SV *TeMpSv = sv; \ sv_catpv(TeMpSv,ptr); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_catpvn_mg # define sv_catpvn_mg(sv, ptr, len) \ STMT_START { \ SV *TeMpSv = sv; \ sv_catpvn(TeMpSv,ptr,len); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_catsv_mg # define sv_catsv_mg(dsv, ssv) \ STMT_START { \ SV *TeMpSv = dsv; \ sv_catsv(TeMpSv,ssv); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_setiv_mg # define sv_setiv_mg(sv, i) \ STMT_START { \ SV *TeMpSv = sv; \ sv_setiv(TeMpSv,i); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_setnv_mg # define sv_setnv_mg(sv, num) \ STMT_START { \ SV *TeMpSv = sv; \ sv_setnv(TeMpSv,num); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_setpv_mg # define sv_setpv_mg(sv, ptr) \ STMT_START { \ SV *TeMpSv = sv; \ sv_setpv(TeMpSv,ptr); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_setpvn_mg # define sv_setpvn_mg(sv, ptr, len) \ STMT_START { \ SV *TeMpSv = sv; \ sv_setpvn(TeMpSv,ptr,len); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_setsv_mg # define sv_setsv_mg(dsv, ssv) \ STMT_START { \ SV *TeMpSv = dsv; \ sv_setsv(TeMpSv,ssv); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_setuv_mg # define sv_setuv_mg(sv, i) \ STMT_START { \ SV *TeMpSv = sv; \ sv_setuv(TeMpSv,i); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_usepvn_mg # define sv_usepvn_mg(sv, ptr, len) \ STMT_START { \ SV *TeMpSv = sv; \ sv_usepvn(TeMpSv,ptr,len); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef SvVSTRING_mg # define SvVSTRING_mg(sv) (SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_vstring) : NULL) #endif /* Hint: sv_magic_portable * This is a compatibility function that is only available with * Devel::PPPort. It is NOT in the perl core. * Its purpose is to mimic the 5.8.0 behaviour of sv_magic() when * it is being passed a name pointer with namlen == 0. In that * case, perl 5.8.0 and later store the pointer, not a copy of it. * The compatibility can be provided back to perl 5.004. With * earlier versions, the code will not compile. */ #if (PERL_BCDVERSION < 0x5004000) /* code that uses sv_magic_portable will not compile */ #elif (PERL_BCDVERSION < 0x5008000) # define sv_magic_portable(sv, obj, how, name, namlen) \ STMT_START { \ SV *SvMp_sv = (sv); \ char *SvMp_name = (char *) (name); \ I32 SvMp_namlen = (namlen); \ if (SvMp_name && SvMp_namlen == 0) \ { \ MAGIC *mg; \ sv_magic(SvMp_sv, obj, how, 0, 0); \ mg = SvMAGIC(SvMp_sv); \ mg->mg_len = -42; /* XXX: this is the tricky part */ \ mg->mg_ptr = SvMp_name; \ } \ else \ { \ sv_magic(SvMp_sv, obj, how, SvMp_name, SvMp_namlen); \ } \ } STMT_END #else # define sv_magic_portable(a, b, c, d, e) sv_magic(a, b, c, d, e) #endif #if !defined(mg_findext) #if defined(NEED_mg_findext) static MAGIC * DPPP_(my_mg_findext)(const SV * sv, int type, const MGVTBL * vtbl); static #else extern MAGIC * DPPP_(my_mg_findext)(const SV * sv, int type, const MGVTBL * vtbl); #endif #if defined(NEED_mg_findext) || defined(NEED_mg_findext_GLOBAL) #define mg_findext DPPP_(my_mg_findext) #define Perl_mg_findext DPPP_(my_mg_findext) MAGIC * DPPP_(my_mg_findext)(const SV * sv, int type, const MGVTBL *vtbl) { if (sv) { MAGIC *mg; #ifdef AvPAD_NAMELIST assert(!(SvTYPE(sv) == SVt_PVAV && AvPAD_NAMELIST(sv))); #endif for (mg = SvMAGIC (sv); mg; mg = mg->mg_moremagic) { if (mg->mg_type == type && mg->mg_virtual == vtbl) return mg; } } return NULL; } #endif #endif #if !defined(sv_unmagicext) #if defined(NEED_sv_unmagicext) static int DPPP_(my_sv_unmagicext)(pTHX_ SV * const sv, const int type, MGVTBL * vtbl); static #else extern int DPPP_(my_sv_unmagicext)(pTHX_ SV * const sv, const int type, MGVTBL * vtbl); #endif #if defined(NEED_sv_unmagicext) || defined(NEED_sv_unmagicext_GLOBAL) #ifdef sv_unmagicext # undef sv_unmagicext #endif #define sv_unmagicext(a,b,c) DPPP_(my_sv_unmagicext)(aTHX_ a,b,c) #define Perl_sv_unmagicext DPPP_(my_sv_unmagicext) int DPPP_(my_sv_unmagicext)(pTHX_ SV *const sv, const int type, MGVTBL *vtbl) { MAGIC* mg; MAGIC** mgp; if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv)) return 0; mgp = &(SvMAGIC(sv)); for (mg = *mgp; mg; mg = *mgp) { const MGVTBL* const virt = mg->mg_virtual; if (mg->mg_type == type && virt == vtbl) { *mgp = mg->mg_moremagic; if (virt && virt->svt_free) virt->svt_free(aTHX_ sv, mg); if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) { if (mg->mg_len > 0) Safefree(mg->mg_ptr); else if (mg->mg_len == HEf_SVKEY) /* Questionable on older perls... */ SvREFCNT_dec(MUTABLE_SV(mg->mg_ptr)); else if (mg->mg_type == PERL_MAGIC_utf8) Safefree(mg->mg_ptr); } if (mg->mg_flags & MGf_REFCOUNTED) SvREFCNT_dec(mg->mg_obj); Safefree(mg); } else mgp = &mg->mg_moremagic; } if (SvMAGIC(sv)) { if (SvMAGICAL(sv)) /* if we're under save_magic, wait for restore_magic; */ mg_magical(sv); /* else fix the flags now */ } else { SvMAGICAL_off(sv); SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_IOK|SVp_NOK|SVp_POK)) >> PRIVSHIFT; } return 0; } #endif #endif #ifdef USE_ITHREADS #ifndef CopFILE # define CopFILE(c) ((c)->cop_file) #endif #ifndef CopFILEGV # define CopFILEGV(c) (CopFILE(c) ? gv_fetchfile(CopFILE(c)) : Nullgv) #endif #ifndef CopFILE_set # define CopFILE_set(c,pv) ((c)->cop_file = savepv(pv)) #endif #ifndef CopFILESV # define CopFILESV(c) (CopFILE(c) ? GvSV(gv_fetchfile(CopFILE(c))) : Nullsv) #endif #ifndef CopFILEAV # define CopFILEAV(c) (CopFILE(c) ? GvAV(gv_fetchfile(CopFILE(c))) : Nullav) #endif #ifndef CopSTASHPV # define CopSTASHPV(c) ((c)->cop_stashpv) #endif #ifndef CopSTASHPV_set # define CopSTASHPV_set(c,pv) ((c)->cop_stashpv = ((pv) ? savepv(pv) : Nullch)) #endif #ifndef CopSTASH # define CopSTASH(c) (CopSTASHPV(c) ? gv_stashpv(CopSTASHPV(c),GV_ADD) : Nullhv) #endif #ifndef CopSTASH_set # define CopSTASH_set(c,hv) CopSTASHPV_set(c, (hv) ? HvNAME(hv) : Nullch) #endif #ifndef CopSTASH_eq # define CopSTASH_eq(c,hv) ((hv) && (CopSTASHPV(c) == HvNAME(hv) \ || (CopSTASHPV(c) && HvNAME(hv) \ && strEQ(CopSTASHPV(c), HvNAME(hv))))) #endif #else #ifndef CopFILEGV # define CopFILEGV(c) ((c)->cop_filegv) #endif #ifndef CopFILEGV_set # define CopFILEGV_set(c,gv) ((c)->cop_filegv = (GV*)SvREFCNT_inc(gv)) #endif #ifndef CopFILE_set # define CopFILE_set(c,pv) CopFILEGV_set((c), gv_fetchfile(pv)) #endif #ifndef CopFILESV # define CopFILESV(c) (CopFILEGV(c) ? GvSV(CopFILEGV(c)) : Nullsv) #endif #ifndef CopFILEAV # define CopFILEAV(c) (CopFILEGV(c) ? GvAV(CopFILEGV(c)) : Nullav) #endif #ifndef CopFILE # define CopFILE(c) (CopFILESV(c) ? SvPVX(CopFILESV(c)) : Nullch) #endif #ifndef CopSTASH # define CopSTASH(c) ((c)->cop_stash) #endif #ifndef CopSTASH_set # define CopSTASH_set(c,hv) ((c)->cop_stash = (hv)) #endif #ifndef CopSTASHPV # define CopSTASHPV(c) (CopSTASH(c) ? HvNAME(CopSTASH(c)) : Nullch) #endif #ifndef CopSTASHPV_set # define CopSTASHPV_set(c,pv) CopSTASH_set((c), gv_stashpv(pv,GV_ADD)) #endif #ifndef CopSTASH_eq # define CopSTASH_eq(c,hv) (CopSTASH(c) == (hv)) #endif #endif /* USE_ITHREADS */ #if (PERL_BCDVERSION >= 0x5006000) #ifndef caller_cx # if defined(NEED_caller_cx) || defined(NEED_caller_cx_GLOBAL) static I32 DPPP_dopoptosub_at(const PERL_CONTEXT *cxstk, I32 startingblock) { I32 i; for (i = startingblock; i >= 0; i--) { const PERL_CONTEXT * const cx = &cxstk[i]; switch (CxTYPE(cx)) { default: continue; case CXt_EVAL: case CXt_SUB: case CXt_FORMAT: return i; } } return i; } # endif # if defined(NEED_caller_cx) static const PERL_CONTEXT * DPPP_(my_caller_cx)(pTHX_ I32 level, const PERL_CONTEXT * * dbcxp); static #else extern const PERL_CONTEXT * DPPP_(my_caller_cx)(pTHX_ I32 level, const PERL_CONTEXT * * dbcxp); #endif #if defined(NEED_caller_cx) || defined(NEED_caller_cx_GLOBAL) #ifdef caller_cx # undef caller_cx #endif #define caller_cx(a,b) DPPP_(my_caller_cx)(aTHX_ a,b) #define Perl_caller_cx DPPP_(my_caller_cx) const PERL_CONTEXT * DPPP_(my_caller_cx)(pTHX_ I32 level, const PERL_CONTEXT **dbcxp) { I32 cxix = DPPP_dopoptosub_at(cxstack, cxstack_ix); const PERL_CONTEXT *cx; const PERL_CONTEXT *ccstack = cxstack; const PERL_SI *top_si = PL_curstackinfo; for (;;) { /* we may be in a higher stacklevel, so dig down deeper */ while (cxix < 0 && top_si->si_type != PERLSI_MAIN) { top_si = top_si->si_prev; ccstack = top_si->si_cxstack; cxix = DPPP_dopoptosub_at(ccstack, top_si->si_cxix); } if (cxix < 0) return NULL; /* caller() should not report the automatic calls to &DB::sub */ if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 && ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub)) level++; if (!level--) break; cxix = DPPP_dopoptosub_at(ccstack, cxix - 1); } cx = &ccstack[cxix]; if (dbcxp) *dbcxp = cx; if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) { const I32 dbcxix = DPPP_dopoptosub_at(ccstack, cxix - 1); /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the field below is defined for any cx. */ /* caller() should not report the automatic calls to &DB::sub */ if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub)) cx = &ccstack[dbcxix]; } return cx; } # endif #endif /* caller_cx */ #endif /* 5.6.0 */ #ifndef IN_PERL_COMPILETIME # define IN_PERL_COMPILETIME (PL_curcop == &PL_compiling) #endif #ifndef IN_LOCALE_RUNTIME # define IN_LOCALE_RUNTIME (PL_curcop->op_private & HINT_LOCALE) #endif #ifndef IN_LOCALE_COMPILETIME # define IN_LOCALE_COMPILETIME (PL_hints & HINT_LOCALE) #endif #ifndef IN_LOCALE # define IN_LOCALE (IN_PERL_COMPILETIME ? IN_LOCALE_COMPILETIME : IN_LOCALE_RUNTIME) #endif #ifndef IS_NUMBER_IN_UV # define IS_NUMBER_IN_UV 0x01 #endif #ifndef IS_NUMBER_GREATER_THAN_UV_MAX # define IS_NUMBER_GREATER_THAN_UV_MAX 0x02 #endif #ifndef IS_NUMBER_NOT_INT # define IS_NUMBER_NOT_INT 0x04 #endif #ifndef IS_NUMBER_NEG # define IS_NUMBER_NEG 0x08 #endif #ifndef IS_NUMBER_INFINITY # define IS_NUMBER_INFINITY 0x10 #endif #ifndef IS_NUMBER_NAN # define IS_NUMBER_NAN 0x20 #endif #ifndef GROK_NUMERIC_RADIX # define GROK_NUMERIC_RADIX(sp, send) grok_numeric_radix(sp, send) #endif #ifndef PERL_SCAN_GREATER_THAN_UV_MAX # define PERL_SCAN_GREATER_THAN_UV_MAX 0x02 #endif #ifndef PERL_SCAN_SILENT_ILLDIGIT # define PERL_SCAN_SILENT_ILLDIGIT 0x04 #endif #ifndef PERL_SCAN_ALLOW_UNDERSCORES # define PERL_SCAN_ALLOW_UNDERSCORES 0x01 #endif #ifndef PERL_SCAN_DISALLOW_PREFIX # define PERL_SCAN_DISALLOW_PREFIX 0x02 #endif #ifndef grok_numeric_radix #if defined(NEED_grok_numeric_radix) static bool DPPP_(my_grok_numeric_radix)(pTHX_ const char * * sp, const char * send); static #else extern bool DPPP_(my_grok_numeric_radix)(pTHX_ const char * * sp, const char * send); #endif #if defined(NEED_grok_numeric_radix) || defined(NEED_grok_numeric_radix_GLOBAL) #ifdef grok_numeric_radix # undef grok_numeric_radix #endif #define grok_numeric_radix(a,b) DPPP_(my_grok_numeric_radix)(aTHX_ a,b) #define Perl_grok_numeric_radix DPPP_(my_grok_numeric_radix) bool DPPP_(my_grok_numeric_radix)(pTHX_ const char **sp, const char *send) { #ifdef USE_LOCALE_NUMERIC #ifdef PL_numeric_radix_sv if (PL_numeric_radix_sv && IN_LOCALE) { STRLEN len; char* radix = SvPV(PL_numeric_radix_sv, len); if (*sp + len <= send && memEQ(*sp, radix, len)) { *sp += len; return TRUE; } } #else /* older perls don't have PL_numeric_radix_sv so the radix * must manually be requested from locale.h */ #include <locale.h> dTHR; /* needed for older threaded perls */ struct lconv *lc = localeconv(); char *radix = lc->decimal_point; if (radix && IN_LOCALE) { STRLEN len = strlen(radix); if (*sp + len <= send && memEQ(*sp, radix, len)) { *sp += len; return TRUE; } } #endif #endif /* USE_LOCALE_NUMERIC */ /* always try "." if numeric radix didn't match because * we may have data from different locales mixed */ if (*sp < send && **sp == '.') { ++*sp; return TRUE; } return FALSE; } #endif #endif #ifndef grok_number #if defined(NEED_grok_number) static int DPPP_(my_grok_number)(pTHX_ const char * pv, STRLEN len, UV * valuep); static #else extern int DPPP_(my_grok_number)(pTHX_ const char * pv, STRLEN len, UV * valuep); #endif #if defined(NEED_grok_number) || defined(NEED_grok_number_GLOBAL) #ifdef grok_number # undef grok_number #endif #define grok_number(a,b,c) DPPP_(my_grok_number)(aTHX_ a,b,c) #define Perl_grok_number DPPP_(my_grok_number) int DPPP_(my_grok_number)(pTHX_ const char *pv, STRLEN len, UV *valuep) { const char *s = pv; const char *send = pv + len; const UV max_div_10 = UV_MAX / 10; const char max_mod_10 = UV_MAX % 10; int numtype = 0; int sawinf = 0; int sawnan = 0; while (s < send && isSPACE(*s)) s++; if (s == send) { return 0; } else if (*s == '-') { s++; numtype = IS_NUMBER_NEG; } else if (*s == '+') s++; if (s == send) return 0; /* next must be digit or the radix separator or beginning of infinity */ if (isDIGIT(*s)) { /* UVs are at least 32 bits, so the first 9 decimal digits cannot overflow. */ UV value = *s - '0'; /* This construction seems to be more optimiser friendly. (without it gcc does the isDIGIT test and the *s - '0' separately) With it gcc on arm is managing 6 instructions (6 cycles) per digit. In theory the optimiser could deduce how far to unroll the loop before checking for overflow. */ if (++s < send) { int digit = *s - '0'; if (digit >= 0 && digit <= 9) { value = value * 10 + digit; if (++s < send) { digit = *s - '0'; if (digit >= 0 && digit <= 9) { value = value * 10 + digit; if (++s < send) { digit = *s - '0'; if (digit >= 0 && digit <= 9) { value = value * 10 + digit; if (++s < send) { digit = *s - '0'; if (digit >= 0 && digit <= 9) { value = value * 10 + digit; if (++s < send) { digit = *s - '0'; if (digit >= 0 && digit <= 9) { value = value * 10 + digit; if (++s < send) { digit = *s - '0'; if (digit >= 0 && digit <= 9) { value = value * 10 + digit; if (++s < send) { digit = *s - '0'; if (digit >= 0 && digit <= 9) { value = value * 10 + digit; if (++s < send) { digit = *s - '0'; if (digit >= 0 && digit <= 9) { value = value * 10 + digit; if (++s < send) { /* Now got 9 digits, so need to check each time for overflow. */ digit = *s - '0'; while (digit >= 0 && digit <= 9 && (value < max_div_10 || (value == max_div_10 && digit <= max_mod_10))) { value = value * 10 + digit; if (++s < send) digit = *s - '0'; else break; } if (digit >= 0 && digit <= 9 && (s < send)) { /* value overflowed. skip the remaining digits, don't worry about setting *valuep. */ do { s++; } while (s < send && isDIGIT(*s)); numtype |= IS_NUMBER_GREATER_THAN_UV_MAX; goto skip_value; } } } } } } } } } } } } } } } } } } numtype |= IS_NUMBER_IN_UV; if (valuep) *valuep = value; skip_value: if (GROK_NUMERIC_RADIX(&s, send)) { numtype |= IS_NUMBER_NOT_INT; while (s < send && isDIGIT(*s)) /* optional digits after the radix */ s++; } } else if (GROK_NUMERIC_RADIX(&s, send)) { numtype |= IS_NUMBER_NOT_INT | IS_NUMBER_IN_UV; /* valuep assigned below */ /* no digits before the radix means we need digits after it */ if (s < send && isDIGIT(*s)) { do { s++; } while (s < send && isDIGIT(*s)); if (valuep) { /* integer approximation is valid - it's 0. */ *valuep = 0; } } else return 0; } else if (*s == 'I' || *s == 'i') { s++; if (s == send || (*s != 'N' && *s != 'n')) return 0; s++; if (s == send || (*s != 'F' && *s != 'f')) return 0; s++; if (s < send && (*s == 'I' || *s == 'i')) { s++; if (s == send || (*s != 'N' && *s != 'n')) return 0; s++; if (s == send || (*s != 'I' && *s != 'i')) return 0; s++; if (s == send || (*s != 'T' && *s != 't')) return 0; s++; if (s == send || (*s != 'Y' && *s != 'y')) return 0; s++; } sawinf = 1; } else if (*s == 'N' || *s == 'n') { /* XXX TODO: There are signaling NaNs and quiet NaNs. */ s++; if (s == send || (*s != 'A' && *s != 'a')) return 0; s++; if (s == send || (*s != 'N' && *s != 'n')) return 0; s++; sawnan = 1; } else return 0; if (sawinf) { numtype &= IS_NUMBER_NEG; /* Keep track of sign */ numtype |= IS_NUMBER_INFINITY | IS_NUMBER_NOT_INT; } else if (sawnan) { numtype &= IS_NUMBER_NEG; /* Keep track of sign */ numtype |= IS_NUMBER_NAN | IS_NUMBER_NOT_INT; } else if (s < send) { /* we can have an optional exponent part */ if (*s == 'e' || *s == 'E') { /* The only flag we keep is sign. Blow away any "it's UV" */ numtype &= IS_NUMBER_NEG; numtype |= IS_NUMBER_NOT_INT; s++; if (s < send && (*s == '-' || *s == '+')) s++; if (s < send && isDIGIT(*s)) { do { s++; } while (s < send && isDIGIT(*s)); } else return 0; } } while (s < send && isSPACE(*s)) s++; if (s >= send) return numtype; if (len == 10 && memEQ(pv, "0 but true", 10)) { if (valuep) *valuep = 0; return IS_NUMBER_IN_UV; } return 0; } #endif #endif /* * The grok_* routines have been modified to use warn() instead of * Perl_warner(). Also, 'hexdigit' was the former name of PL_hexdigit, * which is why the stack variable has been renamed to 'xdigit'. */ #ifndef grok_bin #if defined(NEED_grok_bin) static UV DPPP_(my_grok_bin)(pTHX_ const char * start, STRLEN * len_p, I32 * flags, NV * result); static #else extern UV DPPP_(my_grok_bin)(pTHX_ const char * start, STRLEN * len_p, I32 * flags, NV * result); #endif #if defined(NEED_grok_bin) || defined(NEED_grok_bin_GLOBAL) #ifdef grok_bin # undef grok_bin #endif #define grok_bin(a,b,c,d) DPPP_(my_grok_bin)(aTHX_ a,b,c,d) #define Perl_grok_bin DPPP_(my_grok_bin) UV DPPP_(my_grok_bin)(pTHX_ const char *start, STRLEN *len_p, I32 *flags, NV *result) { const char *s = start; STRLEN len = *len_p; UV value = 0; NV value_nv = 0; const UV max_div_2 = UV_MAX / 2; bool allow_underscores = *flags & PERL_SCAN_ALLOW_UNDERSCORES; bool overflowed = FALSE; if (!(*flags & PERL_SCAN_DISALLOW_PREFIX)) { /* strip off leading b or 0b. for compatibility silently suffer "b" and "0b" as valid binary numbers. */ if (len >= 1) { if (s[0] == 'b') { s++; len--; } else if (len >= 2 && s[0] == '0' && s[1] == 'b') { s+=2; len-=2; } } } for (; len-- && *s; s++) { char bit = *s; if (bit == '0' || bit == '1') { /* Write it in this wonky order with a goto to attempt to get the compiler to make the common case integer-only loop pretty tight. With gcc seems to be much straighter code than old scan_bin. */ redo: if (!overflowed) { if (value <= max_div_2) { value = (value << 1) | (bit - '0'); continue; } /* Bah. We're just overflowed. */ warn("Integer overflow in binary number"); overflowed = TRUE; value_nv = (NV) value; } value_nv *= 2.0; /* If an NV has not enough bits in its mantissa to * represent a UV this summing of small low-order numbers * is a waste of time (because the NV cannot preserve * the low-order bits anyway): we could just remember when * did we overflow and in the end just multiply value_nv by the * right amount. */ value_nv += (NV)(bit - '0'); continue; } if (bit == '_' && len && allow_underscores && (bit = s[1]) && (bit == '0' || bit == '1')) { --len; ++s; goto redo; } if (!(*flags & PERL_SCAN_SILENT_ILLDIGIT)) warn("Illegal binary digit '%c' ignored", *s); break; } if ( ( overflowed && value_nv > 4294967295.0) #if UVSIZE > 4 || (!overflowed && value > 0xffffffff ) #endif ) { warn("Binary number > 0b11111111111111111111111111111111 non-portable"); } *len_p = s - start; if (!overflowed) { *flags = 0; return value; } *flags = PERL_SCAN_GREATER_THAN_UV_MAX; if (result) *result = value_nv; return UV_MAX; } #endif #endif #ifndef grok_hex #if defined(NEED_grok_hex) static UV DPPP_(my_grok_hex)(pTHX_ const char * start, STRLEN * len_p, I32 * flags, NV * result); static #else extern UV DPPP_(my_grok_hex)(pTHX_ const char * start, STRLEN * len_p, I32 * flags, NV * result); #endif #if defined(NEED_grok_hex) || defined(NEED_grok_hex_GLOBAL) #ifdef grok_hex # undef grok_hex #endif #define grok_hex(a,b,c,d) DPPP_(my_grok_hex)(aTHX_ a,b,c,d) #define Perl_grok_hex DPPP_(my_grok_hex) UV DPPP_(my_grok_hex)(pTHX_ const char *start, STRLEN *len_p, I32 *flags, NV *result) { const char *s = start; STRLEN len = *len_p; UV value = 0; NV value_nv = 0; const UV max_div_16 = UV_MAX / 16; bool allow_underscores = *flags & PERL_SCAN_ALLOW_UNDERSCORES; bool overflowed = FALSE; const char *xdigit; if (!(*flags & PERL_SCAN_DISALLOW_PREFIX)) { /* strip off leading x or 0x. for compatibility silently suffer "x" and "0x" as valid hex numbers. */ if (len >= 1) { if (s[0] == 'x') { s++; len--; } else if (len >= 2 && s[0] == '0' && s[1] == 'x') { s+=2; len-=2; } } } for (; len-- && *s; s++) { xdigit = strchr((char *) PL_hexdigit, *s); if (xdigit) { /* Write it in this wonky order with a goto to attempt to get the compiler to make the common case integer-only loop pretty tight. With gcc seems to be much straighter code than old scan_hex. */ redo: if (!overflowed) { if (value <= max_div_16) { value = (value << 4) | ((xdigit - PL_hexdigit) & 15); continue; } warn("Integer overflow in hexadecimal number"); overflowed = TRUE; value_nv = (NV) value; } value_nv *= 16.0; /* If an NV has not enough bits in its mantissa to * represent a UV this summing of small low-order numbers * is a waste of time (because the NV cannot preserve * the low-order bits anyway): we could just remember when * did we overflow and in the end just multiply value_nv by the * right amount of 16-tuples. */ value_nv += (NV)((xdigit - PL_hexdigit) & 15); continue; } if (*s == '_' && len && allow_underscores && s[1] && (xdigit = strchr((char *) PL_hexdigit, s[1]))) { --len; ++s; goto redo; } if (!(*flags & PERL_SCAN_SILENT_ILLDIGIT)) warn("Illegal hexadecimal digit '%c' ignored", *s); break; } if ( ( overflowed && value_nv > 4294967295.0) #if UVSIZE > 4 || (!overflowed && value > 0xffffffff ) #endif ) { warn("Hexadecimal number > 0xffffffff non-portable"); } *len_p = s - start; if (!overflowed) { *flags = 0; return value; } *flags = PERL_SCAN_GREATER_THAN_UV_MAX; if (result) *result = value_nv; return UV_MAX; } #endif #endif #ifndef grok_oct #if defined(NEED_grok_oct) static UV DPPP_(my_grok_oct)(pTHX_ const char * start, STRLEN * len_p, I32 * flags, NV * result); static #else extern UV DPPP_(my_grok_oct)(pTHX_ const char * start, STRLEN * len_p, I32 * flags, NV * result); #endif #if defined(NEED_grok_oct) || defined(NEED_grok_oct_GLOBAL) #ifdef grok_oct # undef grok_oct #endif #define grok_oct(a,b,c,d) DPPP_(my_grok_oct)(aTHX_ a,b,c,d) #define Perl_grok_oct DPPP_(my_grok_oct) UV DPPP_(my_grok_oct)(pTHX_ const char *start, STRLEN *len_p, I32 *flags, NV *result) { const char *s = start; STRLEN len = *len_p; UV value = 0; NV value_nv = 0; const UV max_div_8 = UV_MAX / 8; bool allow_underscores = *flags & PERL_SCAN_ALLOW_UNDERSCORES; bool overflowed = FALSE; for (; len-- && *s; s++) { /* gcc 2.95 optimiser not smart enough to figure that this subtraction out front allows slicker code. */ int digit = *s - '0'; if (digit >= 0 && digit <= 7) { /* Write it in this wonky order with a goto to attempt to get the compiler to make the common case integer-only loop pretty tight. */ redo: if (!overflowed) { if (value <= max_div_8) { value = (value << 3) | digit; continue; } /* Bah. We're just overflowed. */ warn("Integer overflow in octal number"); overflowed = TRUE; value_nv = (NV) value; } value_nv *= 8.0; /* If an NV has not enough bits in its mantissa to * represent a UV this summing of small low-order numbers * is a waste of time (because the NV cannot preserve * the low-order bits anyway): we could just remember when * did we overflow and in the end just multiply value_nv by the * right amount of 8-tuples. */ value_nv += (NV)digit; continue; } if (digit == ('_' - '0') && len && allow_underscores && (digit = s[1] - '0') && (digit >= 0 && digit <= 7)) { --len; ++s; goto redo; } /* Allow \octal to work the DWIM way (that is, stop scanning * as soon as non-octal characters are seen, complain only iff * someone seems to want to use the digits eight and nine). */ if (digit == 8 || digit == 9) { if (!(*flags & PERL_SCAN_SILENT_ILLDIGIT)) warn("Illegal octal digit '%c' ignored", *s); } break; } if ( ( overflowed && value_nv > 4294967295.0) #if UVSIZE > 4 || (!overflowed && value > 0xffffffff ) #endif ) { warn("Octal number > 037777777777 non-portable"); } *len_p = s - start; if (!overflowed) { *flags = 0; return value; } *flags = PERL_SCAN_GREATER_THAN_UV_MAX; if (result) *result = value_nv; return UV_MAX; } #endif #endif #if !defined(my_snprintf) #if defined(NEED_my_snprintf) static int DPPP_(my_my_snprintf)(char * buffer, const Size_t len, const char * format, ...); static #else extern int DPPP_(my_my_snprintf)(char * buffer, const Size_t len, const char * format, ...); #endif #if defined(NEED_my_snprintf) || defined(NEED_my_snprintf_GLOBAL) #define my_snprintf DPPP_(my_my_snprintf) #define Perl_my_snprintf DPPP_(my_my_snprintf) int DPPP_(my_my_snprintf)(char *buffer, const Size_t len, const char *format, ...) { dTHX; int retval; va_list ap; va_start(ap, format); #ifdef HAS_VSNPRINTF retval = vsnprintf(buffer, len, format, ap); #else retval = vsprintf(buffer, format, ap); #endif va_end(ap); if (retval < 0 || (len > 0 && (Size_t)retval >= len)) Perl_croak(aTHX_ "panic: my_snprintf buffer overflow"); return retval; } #endif #endif #if !defined(my_sprintf) #if defined(NEED_my_sprintf) static int DPPP_(my_my_sprintf)(char * buffer, const char * pat, ...); static #else extern int DPPP_(my_my_sprintf)(char * buffer, const char * pat, ...); #endif #if defined(NEED_my_sprintf) || defined(NEED_my_sprintf_GLOBAL) #define my_sprintf DPPP_(my_my_sprintf) /* Warning: my_sprintf It's safer to use my_snprintf instead */ /* Replace my_sprintf with my_snprintf */ int DPPP_(my_my_sprintf)(char *buffer, const char* pat, ...) { va_list args; va_start(args, pat); vsprintf(buffer, pat, args); va_end(args); return strlen(buffer); } #endif #endif #ifdef NO_XSLOCKS # ifdef dJMPENV # define dXCPT dJMPENV; int rEtV = 0 # define XCPT_TRY_START JMPENV_PUSH(rEtV); if (rEtV == 0) # define XCPT_TRY_END JMPENV_POP; # define XCPT_CATCH if (rEtV != 0) # define XCPT_RETHROW JMPENV_JUMP(rEtV) # else # define dXCPT Sigjmp_buf oldTOP; int rEtV = 0 # define XCPT_TRY_START Copy(top_env, oldTOP, 1, Sigjmp_buf); rEtV = Sigsetjmp(top_env, 1); if (rEtV == 0) # define XCPT_TRY_END Copy(oldTOP, top_env, 1, Sigjmp_buf); # define XCPT_CATCH if (rEtV != 0) # define XCPT_RETHROW Siglongjmp(top_env, rEtV) # endif #endif #if !defined(my_strlcat) #if defined(NEED_my_strlcat) static Size_t DPPP_(my_my_strlcat)(char * dst, const char * src, Size_t size); static #else extern Size_t DPPP_(my_my_strlcat)(char * dst, const char * src, Size_t size); #endif #if defined(NEED_my_strlcat) || defined(NEED_my_strlcat_GLOBAL) #define my_strlcat DPPP_(my_my_strlcat) #define Perl_my_strlcat DPPP_(my_my_strlcat) Size_t DPPP_(my_my_strlcat)(char *dst, const char *src, Size_t size) { Size_t used, length, copy; used = strlen(dst); length = strlen(src); if (size > 0 && used < size - 1) { copy = (length >= size - used) ? size - used - 1 : length; memcpy(dst + used, src, copy); dst[used + copy] = '\0'; } return used + length; } #endif #endif #if !defined(my_strlcpy) #if defined(NEED_my_strlcpy) static Size_t DPPP_(my_my_strlcpy)(char * dst, const char * src, Size_t size); static #else extern Size_t DPPP_(my_my_strlcpy)(char * dst, const char * src, Size_t size); #endif #if defined(NEED_my_strlcpy) || defined(NEED_my_strlcpy_GLOBAL) #define my_strlcpy DPPP_(my_my_strlcpy) #define Perl_my_strlcpy DPPP_(my_my_strlcpy) Size_t DPPP_(my_my_strlcpy)(char *dst, const char *src, Size_t size) { Size_t length, copy; length = strlen(src); if (size > 0) { copy = (length >= size) ? size - 1 : length; memcpy(dst, src, copy); dst[copy] = '\0'; } return length; } #endif #endif #ifdef SVf_UTF8 #ifndef SvUTF8 # define SvUTF8(sv) (SvFLAGS(sv) & SVf_UTF8) #endif #endif #if (PERL_BCDVERSION == 0x5019001) /* 5.19.1 does not have UTF8fARG, only broken UTF8f */ #undef UTF8f #endif #ifdef SVf_UTF8 #ifndef UTF8f # define UTF8f SVf #endif #ifndef UTF8fARG # define UTF8fARG(u,l,p) newSVpvn_flags((p), (l), ((u) ? SVf_UTF8 : 0) | SVs_TEMP) #endif #endif #define D_PPP_MIN(a,b) (((a) <= (b)) ? (a) : (b)) #ifndef UNICODE_REPLACEMENT # define UNICODE_REPLACEMENT 0xFFFD #endif #ifdef UTF8_MAXLEN #ifndef UTF8_MAXBYTES # define UTF8_MAXBYTES UTF8_MAXLEN #endif #endif #ifndef UTF_START_MARK # define UTF_START_MARK(len) \ (((len) > 7) ? 0xFF : (0xFF & (0xFE << (7-(len))))) #endif /* On non-EBCDIC was valid for some releases earlier than this, but easier to * just do one check */ #if (PERL_BCDVERSION < 0x5018000) # undef UTF8_MAXBYTES_CASE #endif #if 'A' == 65 # define D_PPP_BYTE_INFO_BITS 6 /* 6 bits meaningful in continuation bytes */ #ifndef UTF8_MAXBYTES_CASE # define UTF8_MAXBYTES_CASE 13 #endif #else # define D_PPP_BYTE_INFO_BITS 5 /* 5 bits meaningful in continuation bytes */ #ifndef UTF8_MAXBYTES_CASE # define UTF8_MAXBYTES_CASE 15 #endif #endif #ifndef UTF_ACCUMULATION_SHIFT # define UTF_ACCUMULATION_SHIFT D_PPP_BYTE_INFO_BITS #endif #ifdef NATIVE_TO_UTF #ifndef NATIVE_UTF8_TO_I8 # define NATIVE_UTF8_TO_I8(c) NATIVE_TO_UTF(c) #endif #else /* System doesn't support EBCDIC */ #ifndef NATIVE_UTF8_TO_I8 # define NATIVE_UTF8_TO_I8(c) (c) #endif #endif #ifdef UTF_TO_NATIVE #ifndef I8_TO_NATIVE_UTF8 # define I8_TO_NATIVE_UTF8(c) UTF_TO_NATIVE(c) #endif #else /* System doesn't support EBCDIC */ #ifndef I8_TO_NATIVE_UTF8 # define I8_TO_NATIVE_UTF8(c) (c) #endif #endif #ifndef UTF_START_MASK # define UTF_START_MASK(len) \ (((len) >= 7) ? 0x00 : (0x1F >> ((len)-2))) #endif #ifndef UTF_IS_CONTINUATION_MASK # define UTF_IS_CONTINUATION_MASK \ ((U8) (0xFF << UTF_ACCUMULATION_SHIFT)) #endif #ifndef UTF_CONTINUATION_MARK # define UTF_CONTINUATION_MARK \ (UTF_IS_CONTINUATION_MASK & 0xB0) #endif #ifndef UTF_MIN_START_BYTE # define UTF_MIN_START_BYTE \ ((UTF_CONTINUATION_MARK >> UTF_ACCUMULATION_SHIFT) | UTF_START_MARK(2)) #endif #ifndef UTF_MIN_ABOVE_LATIN1_BYTE # define UTF_MIN_ABOVE_LATIN1_BYTE \ ((0x100 >> UTF_ACCUMULATION_SHIFT) | UTF_START_MARK(2)) #endif #if (PERL_BCDVERSION < 0x5007000) /* Was the complement of what should have been */ # undef UTF8_IS_DOWNGRADEABLE_START #endif #ifndef UTF8_IS_DOWNGRADEABLE_START # define UTF8_IS_DOWNGRADEABLE_START(c) \ inRANGE(NATIVE_UTF8_TO_I8(c), \ UTF_MIN_START_BYTE, UTF_MIN_ABOVE_LATIN1_BYTE - 1) #endif #ifndef UTF_CONTINUATION_MASK # define UTF_CONTINUATION_MASK \ ((U8) ((1U << UTF_ACCUMULATION_SHIFT) - 1)) #endif #ifndef UTF8_ACCUMULATE # define UTF8_ACCUMULATE(base, added) \ (((base) << UTF_ACCUMULATION_SHIFT) \ | ((NATIVE_UTF8_TO_I8(added)) \ & UTF_CONTINUATION_MASK)) #endif #ifndef UTF8_ALLOW_ANYUV # define UTF8_ALLOW_ANYUV 0 #endif #ifndef UTF8_ALLOW_EMPTY # define UTF8_ALLOW_EMPTY 0x0001 #endif #ifndef UTF8_ALLOW_CONTINUATION # define UTF8_ALLOW_CONTINUATION 0x0002 #endif #ifndef UTF8_ALLOW_NON_CONTINUATION # define UTF8_ALLOW_NON_CONTINUATION 0x0004 #endif #ifndef UTF8_ALLOW_SHORT # define UTF8_ALLOW_SHORT 0x0008 #endif #ifndef UTF8_ALLOW_LONG # define UTF8_ALLOW_LONG 0x0010 #endif #ifndef UTF8_ALLOW_OVERFLOW # define UTF8_ALLOW_OVERFLOW 0x0080 #endif #ifndef UTF8_ALLOW_ANY # define UTF8_ALLOW_ANY ( UTF8_ALLOW_CONTINUATION \ |UTF8_ALLOW_NON_CONTINUATION \ |UTF8_ALLOW_SHORT \ |UTF8_ALLOW_LONG \ |UTF8_ALLOW_OVERFLOW) #endif #if defined UTF8SKIP /* Don't use official versions because they use MIN, which may not be available */ #undef UTF8_SAFE_SKIP #undef UTF8_CHK_SKIP #ifndef UTF8_SAFE_SKIP # define UTF8_SAFE_SKIP(s, e) ( \ ((((e) - (s)) <= 0) \ ? 0 \ : D_PPP_MIN(((e) - (s)), UTF8SKIP(s)))) #endif #ifndef UTF8_CHK_SKIP # define UTF8_CHK_SKIP(s) \ (s[0] == '\0' ? 1 : ((U8) D_PPP_MIN(my_strnlen((char *) (s), UTF8SKIP(s)), \ UTF8SKIP(s)))) #endif /* UTF8_CHK_SKIP depends on my_strnlen */ #ifndef UTF8_SKIP # define UTF8_SKIP(s) UTF8SKIP(s) #endif #endif #if 'A' == 65 #ifndef UTF8_IS_INVARIANT # define UTF8_IS_INVARIANT(c) isASCII(c) #endif #else #ifndef UTF8_IS_INVARIANT # define UTF8_IS_INVARIANT(c) (isASCII(c) || isCNTRL_L1(c)) #endif #endif #ifndef UVCHR_IS_INVARIANT # define UVCHR_IS_INVARIANT(c) UTF8_IS_INVARIANT(c) #endif #ifdef UVCHR_IS_INVARIANT # if 'A' != 65 || UVSIZE < 8 /* 32 bit platform, which includes UTF-EBCDIC on the releases this is * backported to */ # define D_PPP_UVCHR_SKIP_UPPER(c) 7 # else # define D_PPP_UVCHR_SKIP_UPPER(c) \ (((WIDEST_UTYPE) (c)) < \ (((WIDEST_UTYPE) 1) << (6 * D_PPP_BYTE_INFO_BITS)) ? 7 : 13) # endif #ifndef UVCHR_SKIP # define UVCHR_SKIP(c) \ UVCHR_IS_INVARIANT(c) ? 1 : \ (WIDEST_UTYPE) (c) < (32 * (1U << ( D_PPP_BYTE_INFO_BITS))) ? 2 : \ (WIDEST_UTYPE) (c) < (16 * (1U << (2 * D_PPP_BYTE_INFO_BITS))) ? 3 : \ (WIDEST_UTYPE) (c) < ( 8 * (1U << (3 * D_PPP_BYTE_INFO_BITS))) ? 4 : \ (WIDEST_UTYPE) (c) < ( 4 * (1U << (4 * D_PPP_BYTE_INFO_BITS))) ? 5 : \ (WIDEST_UTYPE) (c) < ( 2 * (1U << (5 * D_PPP_BYTE_INFO_BITS))) ? 6 : \ D_PPP_UVCHR_SKIP_UPPER(c) #endif #endif #ifdef is_ascii_string #ifndef is_invariant_string # define is_invariant_string(s,l) is_ascii_string(s,l) #endif #ifndef is_utf8_invariant_string # define is_utf8_invariant_string(s,l) is_ascii_string(s,l) #endif /* Hint: is_ascii_string, is_invariant_string is_utf8_invariant_string() does the same thing and is preferred because its name is more accurate as to what it does */ #endif #ifdef ibcmp_utf8 #ifndef foldEQ_utf8 # define foldEQ_utf8(s1,pe1,l1,u1,s2,pe2,l2,u2) \ cBOOL(! ibcmp_utf8(s1,pe1,l1,u1,s2,pe2,l2,u2)) #endif #endif #if defined(is_utf8_string) && defined(UTF8SKIP) #ifndef isUTF8_CHAR # define isUTF8_CHAR(s, e) ( \ (e) <= (s) || ! is_utf8_string(s, UTF8_SAFE_SKIP(s, e)) \ ? 0 \ : UTF8SKIP(s)) #endif #endif #if 'A' == 65 #ifndef BOM_UTF8 # define BOM_UTF8 "\xEF\xBB\xBF" #endif #ifndef REPLACEMENT_CHARACTER_UTF8 # define REPLACEMENT_CHARACTER_UTF8 "\xEF\xBF\xBD" #endif #elif '^' == 95 #ifndef BOM_UTF8 # define BOM_UTF8 "\xDD\x73\x66\x73" #endif #ifndef REPLACEMENT_CHARACTER_UTF8 # define REPLACEMENT_CHARACTER_UTF8 "\xDD\x73\x73\x71" #endif #elif '^' == 176 #ifndef BOM_UTF8 # define BOM_UTF8 "\xDD\x72\x65\x72" #endif #ifndef REPLACEMENT_CHARACTER_UTF8 # define REPLACEMENT_CHARACTER_UTF8 "\xDD\x72\x72\x70" #endif #else # error Unknown character set #endif #if (PERL_BCDVERSION < 0x5031004) /* Versions prior to this accepted things that are now considered * malformations, and didn't return -1 on error with warnings enabled * */ # undef utf8_to_uvchr_buf #endif /* This implementation brings modern, generally more restricted standards to * utf8_to_uvchr_buf. Some of these are security related, and clearly must * be done. But its arguable that the others need not, and hence should not. * The reason they're here is that a module that intends to play with the * latest perls should be able to work the same in all releases. An example is * that perl no longer accepts any UV for a code point, but limits them to * IV_MAX or below. This is for future internal use of the larger code points. * If it turns out that some of these changes are breaking code that isn't * intended to work with modern perls, the tighter restrictions could be * relaxed. khw thinks this is unlikely, but has been wrong in the past. */ /* 5.6.0 is the first release with UTF-8, and we don't implement this function * there due to its likely lack of still being in use, and the underlying * implementation is very different from later ones, without the later * safeguards, so would require extra work to deal with */ #if (PERL_BCDVERSION >= 0x5006001) && ! defined(utf8_to_uvchr_buf) /* Choose which underlying implementation to use. At least one must be * present or the perl is too early to handle this function */ # if defined(utf8n_to_uvchr) || defined(utf8_to_uvchr) || defined(utf8_to_uv) # if defined(utf8n_to_uvchr) /* This is the preferred implementation */ # define D_PPP_utf8_to_uvchr_buf_callee utf8n_to_uvchr # elif /* Must be at least 5.6.1 from #if above; \ If have both regular and _simple, regular has all args */ \ defined(utf8_to_uv) && defined(utf8_to_uv_simple) # define D_PPP_utf8_to_uvchr_buf_callee utf8_to_uv # elif defined(utf8_to_uvchr) /* The below won't work well on error input */ # define D_PPP_utf8_to_uvchr_buf_callee(s, curlen, retlen, flags) \ utf8_to_uvchr((U8 *)(s), (retlen)) # else # define D_PPP_utf8_to_uvchr_buf_callee(s, curlen, retlen, flags) \ utf8_to_uv((U8 *)(s), (retlen)) # endif # endif # if defined(NEED_utf8_to_uvchr_buf) static UV DPPP_(my_utf8_to_uvchr_buf)(pTHX_ const U8 * s, const U8 * send, STRLEN * retlen); static #else extern UV DPPP_(my_utf8_to_uvchr_buf)(pTHX_ const U8 * s, const U8 * send, STRLEN * retlen); #endif #if defined(NEED_utf8_to_uvchr_buf) || defined(NEED_utf8_to_uvchr_buf_GLOBAL) #ifdef utf8_to_uvchr_buf # undef utf8_to_uvchr_buf #endif #define utf8_to_uvchr_buf(a,b,c) DPPP_(my_utf8_to_uvchr_buf)(aTHX_ a,b,c) #define Perl_utf8_to_uvchr_buf DPPP_(my_utf8_to_uvchr_buf) UV DPPP_(my_utf8_to_uvchr_buf)(pTHX_ const U8 *s, const U8 *send, STRLEN *retlen) { UV ret; STRLEN curlen; bool overflows = 0; const U8 *cur_s = s; const bool do_warnings = ckWARN_d(WARN_UTF8); # if (PERL_BCDVERSION < 0x5026000) && ! defined(EBCDIC) STRLEN overflow_length = 0; # endif if (send > s) { curlen = send - s; } else { assert(0); /* Modern perls die under this circumstance */ curlen = 0; if (! do_warnings) { /* Handle empty here if no warnings needed */ if (retlen) *retlen = 0; return UNICODE_REPLACEMENT; } } # if (PERL_BCDVERSION < 0x5026000) && ! defined(EBCDIC) /* Perl did not properly detect overflow for much of its history on * non-EBCDIC platforms, often returning an overlong value which may or may * not have been tolerated in the call. Also, earlier versions, when they * did detect overflow, may have disallowed it completely. Modern ones can * replace it with the REPLACEMENT CHARACTER, depending on calling * parameters. Therefore detect it ourselves in releases it was * problematic in. */ if (curlen > 0 && UNLIKELY(*s >= 0xFE)) { /* First, on a 32-bit machine the first byte being at least \xFE * automatically is overflow, as it indicates something requiring more * than 31 bits */ if (sizeof(ret) < 8) { overflows = 1; overflow_length = (*s == 0xFE) ? 7 : 13; } else { const U8 highest[] = /* 2*63-1 */ "\xFF\x80\x87\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF"; const U8 *cur_h = highest; for (cur_s = s; cur_s < send; cur_s++, cur_h++) { if (UNLIKELY(*cur_s == *cur_h)) { continue; } /* If this byte is larger than the corresponding highest UTF-8 * byte, the sequence overflows; otherwise the byte is less * than (as we handled the equality case above), and so the * sequence doesn't overflow */ overflows = *cur_s > *cur_h; break; } /* Here, either we set the bool and broke out of the loop, or got * to the end and all bytes are the same which indicates it doesn't * overflow. If it did overflow, it would be this number of bytes * */ overflow_length = 13; } } if (UNLIKELY(overflows)) { ret = 0; if (! do_warnings && retlen) { *retlen = overflow_length; } } else # endif /* < 5.26 */ /* Here, we are either in a release that properly detects overflow, or * we have checked for overflow and the next statement is executing as * part of the above conditional where we know we don't have overflow. * * The modern versions allow anything that evaluates to a legal UV, but * not overlongs nor an empty input */ ret = D_PPP_utf8_to_uvchr_buf_callee( (U8 *) /* Early perls: no const */ s, curlen, retlen, (UTF8_ALLOW_ANYUV & ~(UTF8_ALLOW_LONG|UTF8_ALLOW_EMPTY))); # if (PERL_BCDVERSION >= 0x5026000) && (PERL_BCDVERSION < 0x5028000) /* But actually, more modern versions restrict the UV to being no more than * what an IV can hold, so it could still have gotten it wrong about * overflowing. */ if (UNLIKELY(ret > IV_MAX)) { overflows = 1; } # endif if (UNLIKELY(overflows)) { if (! do_warnings) { if (retlen) { *retlen = D_PPP_MIN(*retlen, UTF8SKIP(s)); *retlen = D_PPP_MIN(*retlen, curlen); } return UNICODE_REPLACEMENT; } else { /* We use the error message in use from 5.8-5.26 */ Perl_warner(aTHX_ packWARN(WARN_UTF8), "Malformed UTF-8 character (overflow at 0x%" UVxf ", byte 0x%02x, after start byte 0x%02x)", ret, *cur_s, *s); if (retlen) { *retlen = (STRLEN) -1; } return 0; } } /* Here, did not overflow, but if it failed for some other reason, and * warnings are off, to emulate the behavior of the real utf8_to_uvchr(), * try again, allowing anything. (Note a return of 0 is ok if the input * was '\0') */ if (UNLIKELY(ret == 0 && (curlen == 0 || *s != '\0'))) { /* If curlen is 0, we already handled the case where warnings are * disabled, so this 'if' will be true, and so later on, we know that * 's' is dereferencible */ if (do_warnings) { if (retlen) { *retlen = (STRLEN) -1; } } else { ret = D_PPP_utf8_to_uvchr_buf_callee( (U8 *) /* Early perls: no const */ s, curlen, retlen, UTF8_ALLOW_ANY); /* Override with the REPLACEMENT character, as that is what the * modern version of this function returns */ ret = UNICODE_REPLACEMENT; # if (PERL_BCDVERSION < 0x5016000) /* Versions earlier than this don't necessarily return the proper * length. It should not extend past the end of string, nor past * what the first byte indicates the length is, nor past the * continuation characters */ if (retlen && (IV) *retlen >= 0) { unsigned int i = 1; *retlen = D_PPP_MIN(*retlen, curlen); *retlen = D_PPP_MIN(*retlen, UTF8SKIP(s)); do { # ifdef UTF8_IS_CONTINUATION if (! UTF8_IS_CONTINUATION(s[i])) # else /* Versions without the above don't support EBCDIC anyway */ if (s[i] < 0x80 || s[i] > 0xBF) # endif { *retlen = i; break; } } while (++i < *retlen); } # endif } } return ret; } # endif #endif #if defined(UTF8SKIP) && defined(utf8_to_uvchr_buf) #undef utf8_to_uvchr /* Always redefine this unsafe function so that it refuses to read past a NUL, making it much less likely to read off the end of the buffer. A NUL indicates the start of the next character anyway. If the input isn't NUL-terminated, the function remains unsafe, as it always has been. */ #ifndef utf8_to_uvchr # define utf8_to_uvchr(s, lp) \ ((*(s) == '\0') \ ? utf8_to_uvchr_buf(s,((s)+1), lp) /* Handle single NUL specially */ \ : utf8_to_uvchr_buf(s, (s) + UTF8_CHK_SKIP(s), (lp))) #endif #endif /* Hint: utf8_to_uvchr Use utf8_to_uvchr_buf() instead. But ONLY if you KNOW the upper bound of the input string (not resorting to using UTF8SKIP, etc., to infer it). The backported utf8_to_uvchr() will do a better job to prevent most cases of trying to read beyond the end of the buffer */ /* Replace utf8_to_uvchr with utf8_to_uvchr_buf */ #ifdef sv_len_utf8 /* Older Perl versions have broken sv_len_utf8() when passed sv does not have SVf_UTF8 flag set */ /* Also note that SvGETMAGIC() may change presence of SVf_UTF8 flag */ # if (PERL_BCDVERSION < 0x5017005) # undef sv_len_utf8 # if defined(PERL_USE_GCC_BRACE_GROUPS) # define sv_len_utf8_nomg(sv) ({ SV *_sv2 = (sv); (SvUTF8(_sv2) ? Perl_sv_len_utf8(aTHX_ (!SvGMAGICAL(_sv2) ? _sv2 : sv_mortalcopy_flags(_sv2, SV_NOSTEAL))) : ({ STRLEN _len; SvPV_nomg(_sv2, _len); _len; })); }) # define sv_len_utf8(sv) ({ SV *_sv1 = (sv); SvGETMAGIC(_sv1); sv_len_utf8_nomg(_sv1); }) # else # define sv_len_utf8_nomg(sv) (PL_Sv = (sv), (SvUTF8(PL_Sv) ? Perl_sv_len_utf8(aTHX_ (!SvGMAGICAL(PL_Sv) ? PL_Sv : sv_mortalcopy_flags(PL_Sv, SV_NOSTEAL))) : (SvPV_nomg(PL_Sv, PL_na), PL_na))) # define sv_len_utf8(sv) (PL_Sv = (sv), SvGETMAGIC(PL_Sv), sv_len_utf8_nomg(PL_Sv)) # endif # endif # if defined(PERL_USE_GCC_BRACE_GROUPS) #ifndef sv_len_utf8_nomg # define sv_len_utf8_nomg(sv) ({ SV *_sv = (sv); sv_len_utf8(!SvGMAGICAL(_sv) ? _sv : sv_mortalcopy_flags(_sv, SV_NOSTEAL)); }) #endif # else #ifndef sv_len_utf8_nomg # define sv_len_utf8_nomg(sv) ((PL_Sv = (sv)), sv_len_utf8(!SvGMAGICAL(PL_Sv) ? PL_Sv : sv_mortalcopy_flags(PL_Sv, SV_NOSTEAL))) #endif # endif #endif #ifndef PERL_PV_ESCAPE_QUOTE # define PERL_PV_ESCAPE_QUOTE 0x0001 #endif #ifndef PERL_PV_PRETTY_QUOTE # define PERL_PV_PRETTY_QUOTE PERL_PV_ESCAPE_QUOTE #endif #ifndef PERL_PV_PRETTY_ELLIPSES # define PERL_PV_PRETTY_ELLIPSES 0x0002 #endif #ifndef PERL_PV_PRETTY_LTGT # define PERL_PV_PRETTY_LTGT 0x0004 #endif #ifndef PERL_PV_ESCAPE_FIRSTCHAR # define PERL_PV_ESCAPE_FIRSTCHAR 0x0008 #endif #ifndef PERL_PV_ESCAPE_UNI # define PERL_PV_ESCAPE_UNI 0x0100 #endif #ifndef PERL_PV_ESCAPE_UNI_DETECT # define PERL_PV_ESCAPE_UNI_DETECT 0x0200 #endif #ifndef PERL_PV_ESCAPE_ALL # define PERL_PV_ESCAPE_ALL 0x1000 #endif #ifndef PERL_PV_ESCAPE_NOBACKSLASH # define PERL_PV_ESCAPE_NOBACKSLASH 0x2000 #endif #ifndef PERL_PV_ESCAPE_NOCLEAR # define PERL_PV_ESCAPE_NOCLEAR 0x4000 #endif #ifndef PERL_PV_ESCAPE_RE # define PERL_PV_ESCAPE_RE 0x8000 #endif #ifndef PERL_PV_PRETTY_NOCLEAR # define PERL_PV_PRETTY_NOCLEAR PERL_PV_ESCAPE_NOCLEAR #endif #ifndef PERL_PV_PRETTY_DUMP # define PERL_PV_PRETTY_DUMP PERL_PV_PRETTY_ELLIPSES|PERL_PV_PRETTY_QUOTE #endif #ifndef PERL_PV_PRETTY_REGPROP # define PERL_PV_PRETTY_REGPROP PERL_PV_PRETTY_ELLIPSES|PERL_PV_PRETTY_LTGT|PERL_PV_ESCAPE_RE #endif /* Hint: pv_escape * Note that unicode functionality is only backported to * those perl versions that support it. For older perl * versions, the implementation will fall back to bytes. */ #ifndef pv_escape #if defined(NEED_pv_escape) static char * DPPP_(my_pv_escape)(pTHX_ SV * dsv, char const * const str, const STRLEN count, const STRLEN max, STRLEN * const escaped, const U32 flags); static #else extern char * DPPP_(my_pv_escape)(pTHX_ SV * dsv, char const * const str, const STRLEN count, const STRLEN max, STRLEN * const escaped, const U32 flags); #endif #if defined(NEED_pv_escape) || defined(NEED_pv_escape_GLOBAL) #ifdef pv_escape # undef pv_escape #endif #define pv_escape(a,b,c,d,e,f) DPPP_(my_pv_escape)(aTHX_ a,b,c,d,e,f) #define Perl_pv_escape DPPP_(my_pv_escape) char * DPPP_(my_pv_escape)(pTHX_ SV *dsv, char const * const str, const STRLEN count, const STRLEN max, STRLEN * const escaped, const U32 flags) { const char esc = flags & PERL_PV_ESCAPE_RE ? '%' : '\\'; const char dq = flags & PERL_PV_ESCAPE_QUOTE ? '"' : esc; char octbuf[32] = "%123456789ABCDF"; STRLEN wrote = 0; STRLEN chsize = 0; STRLEN readsize = 1; #if defined(is_utf8_string) && defined(utf8_to_uvchr_buf) bool isuni = flags & PERL_PV_ESCAPE_UNI ? 1 : 0; #endif const char *pv = str; const char * const end = pv + count; octbuf[0] = esc; if (!(flags & PERL_PV_ESCAPE_NOCLEAR)) sv_setpvs(dsv, ""); #if defined(is_utf8_string) && defined(utf8_to_uvchr_buf) if ((flags & PERL_PV_ESCAPE_UNI_DETECT) && is_utf8_string((U8*)pv, count)) isuni = 1; #endif for (; pv < end && (!max || wrote < max) ; pv += readsize) { const UV u = #if defined(is_utf8_string) && defined(utf8_to_uvchr_buf) isuni ? utf8_to_uvchr_buf((U8*)pv, end, &readsize) : #endif (U8)*pv; const U8 c = (U8)u & 0xFF; if (u > 255 || (flags & PERL_PV_ESCAPE_ALL)) { if (flags & PERL_PV_ESCAPE_FIRSTCHAR) chsize = my_snprintf(octbuf, sizeof octbuf, "%" UVxf, u); else chsize = my_snprintf(octbuf, sizeof octbuf, "%cx{%" UVxf "}", esc, u); } else if (flags & PERL_PV_ESCAPE_NOBACKSLASH) { chsize = 1; } else { if (c == dq || c == esc || !isPRINT(c)) { chsize = 2; switch (c) { case '\\' : /* fallthrough */ case '%' : if (c == esc) octbuf[1] = esc; else chsize = 1; break; case '\v' : octbuf[1] = 'v'; break; case '\t' : octbuf[1] = 't'; break; case '\r' : octbuf[1] = 'r'; break; case '\n' : octbuf[1] = 'n'; break; case '\f' : octbuf[1] = 'f'; break; case '"' : if (dq == '"') octbuf[1] = '"'; else chsize = 1; break; default: chsize = my_snprintf(octbuf, sizeof octbuf, pv < end && isDIGIT((U8)*(pv+readsize)) ? "%c%03o" : "%c%o", esc, c); } } else { chsize = 1; } } if (max && wrote + chsize > max) { break; } else if (chsize > 1) { sv_catpvn(dsv, octbuf, chsize); wrote += chsize; } else { char tmp[2]; my_snprintf(tmp, sizeof tmp, "%c", c); sv_catpvn(dsv, tmp, 1); wrote++; } if (flags & PERL_PV_ESCAPE_FIRSTCHAR) break; } if (escaped != NULL) *escaped= pv - str; return SvPVX(dsv); } #endif #endif #ifndef pv_pretty #if defined(NEED_pv_pretty) static char * DPPP_(my_pv_pretty)(pTHX_ SV * dsv, char const * const str, const STRLEN count, const STRLEN max, char const * const start_color, char const * const end_color, const U32 flags); static #else extern char * DPPP_(my_pv_pretty)(pTHX_ SV * dsv, char const * const str, const STRLEN count, const STRLEN max, char const * const start_color, char const * const end_color, const U32 flags); #endif #if defined(NEED_pv_pretty) || defined(NEED_pv_pretty_GLOBAL) #ifdef pv_pretty # undef pv_pretty #endif #define pv_pretty(a,b,c,d,e,f,g) DPPP_(my_pv_pretty)(aTHX_ a,b,c,d,e,f,g) #define Perl_pv_pretty DPPP_(my_pv_pretty) char * DPPP_(my_pv_pretty)(pTHX_ SV *dsv, char const * const str, const STRLEN count, const STRLEN max, char const * const start_color, char const * const end_color, const U32 flags) { const U8 dq = (flags & PERL_PV_PRETTY_QUOTE) ? '"' : '%'; STRLEN escaped; if (!(flags & PERL_PV_PRETTY_NOCLEAR)) sv_setpvs(dsv, ""); if (dq == '"') sv_catpvs(dsv, "\""); else if (flags & PERL_PV_PRETTY_LTGT) sv_catpvs(dsv, "<"); if (start_color != NULL) sv_catpv(dsv, D_PPP_CONSTPV_ARG(start_color)); pv_escape(dsv, str, count, max, &escaped, flags | PERL_PV_ESCAPE_NOCLEAR); if (end_color != NULL) sv_catpv(dsv, D_PPP_CONSTPV_ARG(end_color)); if (dq == '"') sv_catpvs(dsv, "\""); else if (flags & PERL_PV_PRETTY_LTGT) sv_catpvs(dsv, ">"); if ((flags & PERL_PV_PRETTY_ELLIPSES) && escaped < count) sv_catpvs(dsv, "..."); return SvPVX(dsv); } #endif #endif #ifndef pv_display #if defined(NEED_pv_display) static char * DPPP_(my_pv_display)(pTHX_ SV * dsv, const char * pv, STRLEN cur, STRLEN len, STRLEN pvlim); static #else extern char * DPPP_(my_pv_display)(pTHX_ SV * dsv, const char * pv, STRLEN cur, STRLEN len, STRLEN pvlim); #endif #if defined(NEED_pv_display) || defined(NEED_pv_display_GLOBAL) #ifdef pv_display # undef pv_display #endif #define pv_display(a,b,c,d,e) DPPP_(my_pv_display)(aTHX_ a,b,c,d,e) #define Perl_pv_display DPPP_(my_pv_display) char * DPPP_(my_pv_display)(pTHX_ SV *dsv, const char *pv, STRLEN cur, STRLEN len, STRLEN pvlim) { pv_pretty(dsv, pv, cur, pvlim, NULL, NULL, PERL_PV_PRETTY_DUMP); if (len > cur && pv[cur] == '\0') sv_catpvs(dsv, "\\0"); return SvPVX(dsv); } #endif #endif #if PERL_VERSION_LT(5,27,9) #ifndef LC_NUMERIC_LOCK # define LC_NUMERIC_LOCK #endif #ifndef LC_NUMERIC_UNLOCK # define LC_NUMERIC_UNLOCK #endif # if PERL_VERSION_LT(5,19,0) # undef STORE_LC_NUMERIC_SET_STANDARD # undef RESTORE_LC_NUMERIC # undef DECLARATION_FOR_LC_NUMERIC_MANIPULATION # ifdef USE_LOCALE #ifndef DECLARATION_FOR_LC_NUMERIC_MANIPULATION # define DECLARATION_FOR_LC_NUMERIC_MANIPULATION char *LoC_ #endif #ifndef STORE_NUMERIC_SET_STANDARD # define STORE_NUMERIC_SET_STANDARD() \ LoC_ = savepv(setlocale(LC_NUMERIC, NULL)); \ SAVEFREEPV(LoC_); \ setlocale(LC_NUMERIC, "C"); #endif #ifndef RESTORE_LC_NUMERIC # define RESTORE_LC_NUMERIC() \ setlocale(LC_NUMERIC, LoC_); #endif # else #ifndef DECLARATION_FOR_LC_NUMERIC_MANIPULATION # define DECLARATION_FOR_LC_NUMERIC_MANIPULATION #endif #ifndef STORE_LC_NUMERIC_SET_STANDARD # define STORE_LC_NUMERIC_SET_STANDARD() #endif #ifndef RESTORE_LC_NUMERIC # define RESTORE_LC_NUMERIC() #endif # endif # endif #endif #ifndef LOCK_NUMERIC_STANDARD # define LOCK_NUMERIC_STANDARD() #endif #ifndef UNLOCK_NUMERIC_STANDARD # define UNLOCK_NUMERIC_STANDARD() #endif /* The names of these changed in 5.28 */ #ifndef LOCK_LC_NUMERIC_STANDARD # define LOCK_LC_NUMERIC_STANDARD LOCK_NUMERIC_STANDARD #endif #ifndef UNLOCK_LC_NUMERIC_STANDARD # define UNLOCK_LC_NUMERIC_STANDARD UNLOCK_NUMERIC_STANDARD #endif /* If this doesn't exist, it's not needed, so is void noop */ #ifndef switch_to_global_locale # define switch_to_global_locale() #endif /* Originally, this didn't return a value, but in perls like that, the value * should always be TRUE. Add a return to Perl_sync_locale() when it's * available. And actually do a sync when its not, if locales are available on * this system. */ #ifdef sync_locale # if (PERL_BCDVERSION < 0x5027009) # if (PERL_BCDVERSION >= 0x5021003) # undef sync_locale # define sync_locale() (Perl_sync_locale(aTHX), 1) # elif defined(sync_locale) /* These should only be the 5.20 maints*/ # undef sync_locale /* Just copy their defn and return 1 */ # define sync_locale() (new_ctype(setlocale(LC_CTYPE, NULL)), \ new_collate(setlocale(LC_COLLATE, NULL)), \ set_numeric_local(), \ new_numeric(setlocale(LC_NUMERIC, NULL)), \ 1) # elif defined(new_ctype) && defined(LC_CTYPE) # define sync_locale() (new_ctype(setlocale(LC_CTYPE, NULL)), 1) # endif # endif #endif #ifndef sync_locale # define sync_locale() 1 #endif #endif /* _P_P_PORTABILITY_H_ */ /* End of File ppport.h */ PK ��[�R�� � t/regexp.tnu �[��� #!perl -w use strict; use Storable "dclone"; use Test::More; my $version = int(($]-5)*1000); $version >= 8 or plan skip_all => "regexps not supported before 5.8"; my @tests; while (<DATA>) { chomp; next if /^\s*#/ || !/\S/; my ($range, $code, $match, $name) = split /\s*;\s*/; defined $name or die "Bad test line"; my $ascii_only = $range =~ s/A//; next if $ascii_only and ord("A") != 65; if ($range =~ /^(\d+)-$/) { next if $version < $1 } elsif ($range =~ /^-(\d+)$/) { next if $version > $1 } elsif ($range =~ /^(\d+)-(\d+)$/) { next if $version < $1 || $version > $2; } elsif ($range ne "-") { die "Invalid version range $range for $name"; } my @match = split /\s*,\s*/, $match; for my $m (@match) { my $not = $m =~ s/^!//; my $cmatch = eval $m; die if $@; push @tests, [ $code, $not, $cmatch, $m, $name ]; } } plan tests => 10 + 3*scalar(@tests); SKIP: { $version >= 14 && $version < 20 or skip "p introduced in 5.14, pointless from 5.20", 4; my $q1 = eval "qr/b/p"; my $q2 = eval "qr/b/"; my $c1 = dclone($q1); my $c2 = dclone($q2); ok("abc" =~ $c1, "abc matches $c1"); is(${^PREMATCH}, "a", "check p worked"); ok("cba" =~ $c2, "cba matches $c2"); isnt(${^PREMATCH}, "c", "check no p worked"); } SKIP: { $version >= 24 or skip "n introduced in 5.22", 4; my $c1 = dclone(eval "qr/(\\w)/"); my $c2 = dclone(eval "qr/(\\w)/n"); ok("a" =~ $c1, "a matches $c1"); is($1, "a", "check capturing preserved"); ok("b" =~ $c2, "b matches $c2"); isnt($1, "b", "check non-capturing preserved"); } SKIP: { $version >= 8 or skip "Cannot retrieve before 5.8", 1; my $x; my $re = qr/a(?{ $x = 1 })/; use re 'eval'; ok(!eval { dclone($re) }, "should fail to clone, even with use re 'eval'"); } is(ref(dclone(bless qr//, "Foo")), "Foo", "check reblessed regexps"); for my $test (@tests) { my ($code, $not, $match, $matchc, $name) = @$test; my $qr = eval $code; die "Could not compile $code: $@" if $@; if ($not) { unlike($match, $qr, "$name: pre(not) match $matchc"); } else { like($match, $qr, "$name: prematch $matchc"); } my $qr2 = dclone($qr); if ($not) { unlike($match, $qr2, "$name: (not) match $matchc"); } else { like($match, $qr2, "$name: match $matchc"); } # this is unlikely to be a problem, but make sure regexps are frozen sanely # as part of a data structure my $a2 = dclone([ $qr ]); if ($not) { unlike($match, $a2->[0], "$name: (not) match $matchc (array)"); } else { like($match, $a2->[0], "$name: match $matchc (array)"); } } __DATA__ # semi-colon separated: # perl version range; regexp qr; match string; name # - version range is PERL_VERSION, ie 22 for 5.22 as from-to with both from # and to optional (so "-" is all versions. # - match string is , separated match strings # - if a match string starts with ! it mustn't match, otherwise it must # spaces around the commas ignored. # The initial "!" is stripped and the remainder treated as perl code to define # the string to (not) be matched -; qr/foo/ ; "foo",!"fob" ; simple -; qr/foo/i ; "foo","FOO",!"fob" ; simple case insensitive -; qr/f o o/x ; "foo", !"f o o" ; /x -; qr(a/b) ; "a/b" ; alt quotes A-; qr(\x2E) ; ".", !"a" ; \x2E - hex meta -; qr/\./ ; "." , !"a" ; \. - backslash meta 8- ; qr/\x{100}/ ; "\x{100}" ; simple unicode A12- ; qr/fss/i ; "f\xDF\x{101}" ; case insensive unicode promoted A22-; qr/fss/ui ; "f\xDF" ; case insensitive unicode SS /iu A22-; qr/fss/aai ; !"f\xDF" ; case insensitive unicode SS /iaa A22-; qr/f\w/a ; "fo", !"f\xff" ; simple /a flag PK ��[ ���l l t/hugeids.tnu �[��� #!./perl # We do all of the work in child processes here to ensure that any # memory used is released immediately. # These tests use ridiculous amounts of memory and CPU. use strict; use warnings; use Config; use Storable qw(store_fd retrieve_fd nstore_fd); use Test::More; use File::Temp qw(tempfile); use File::Spec; BEGIN { plan skip_all => 'Storable was not built' if $ENV{PERL_CORE} && $Config{'extensions'} !~ /\b Storable \b/x; plan skip_all => 'Need 64-bit pointers for this test' if $Config{ptrsize} < 8 and $] > 5.013; plan skip_all => 'Need 64-bit int for this test on older versions' if $Config{uvsize} < 8 and $] < 5.013; plan skip_all => 'Need ~8 GiB memory for this test, set PERL_TEST_MEMORY >= 8' if !$ENV{PERL_TEST_MEMORY} || $ENV{PERL_TEST_MEMORY} < 8; plan skip_all => 'These tests are slow, set PERL_RUN_SLOW_TESTS' unless $ENV{PERL_RUN_SLOW_TESTS}; plan skip_all => "Need fork for this test", unless $Config{d_fork}; } find_exe("gzip") or plan skip_all => "Need gzip for this test"; find_exe("gunzip") or plan skip_all => "Need gunzip for this test"; plan tests => 12; my $skips = $ENV{PERL_STORABLE_SKIP_ID_TEST} || ''; my $keeps = $ENV{PERL_STORABLE_KEEP_ID_TEST}; freeze_thaw_test ( name => "object ids between 2G and 4G", freeze => \&make_2g_data, thaw => \&check_2g_data, id => "2g", memory => 34, ); freeze_thaw_test ( name => "object ids over 4G", freeze => \&make_4g_data, thaw => \&check_4g_data, id => "4g", memory => 70, ); freeze_thaw_test ( name => "hook object ids over 4G", freeze => \&make_hook_data, thaw => \&check_hook_data, id => "hook4g", memory => 70, ); # not really an id test, but the infrastructure here makes tests # easier freeze_thaw_test ( name => "network store large PV", freeze => \&make_net_large_pv, thaw => \&check_net_large_pv, id => "netlargepv", memory => 8, ); freeze_thaw_test ( name => "hook store with 2g data", freeze => \&make_2g_hook_data, thaw => \&check_2g_hook_data, id => "hook2gdata", memory => 4, ); freeze_thaw_test ( name => "hook store with 4g data", freeze => \&make_4g_hook_data, thaw => \&check_4g_hook_data, id => "hook4gdata", memory => 8, ); sub freeze_thaw_test { my %opts = @_; my $freeze = $opts{freeze} or die "Missing freeze"; my $thaw = $opts{thaw} or die "Missing thaw"; my $id = $opts{id} or die "Missing id"; my $name = $opts{name} or die "Missing name"; my $memory = $opts{memory} or die "Missing memory"; my $todo_thaw = $opts{todo_thaw} || ""; SKIP: { # IPC::Run would be handy here $ENV{PERL_TEST_MEMORY} >= $memory or skip "Not enough memory to test $name", 2; $skips =~ /\b\Q$id\E\b/ and skip "You requested test $name ($id) be skipped", 2; defined $keeps && $keeps !~ /\b\Q$id\E\b/ and skip "You didn't request test $name ($id)", 2; my $stored; if (defined(my $pid = open(my $fh, "-|"))) { unless ($pid) { # child open my $cfh, "|-", "gzip" or die "Cannot pipe to gzip: $!"; binmode $cfh; $freeze->($cfh); exit; } # parent $stored = do { local $/; <$fh> }; close $fh; } else { skip "$name: Cannot fork for freeze", 2; } ok($stored, "$name: we got output data") or skip "$name: skipping thaw test", 1; my ($tfh, $tname) = tempfile(); #my $tname = "$id.store.gz"; #open my $tfh, ">", $tname or die; #binmode $tfh; print $tfh $stored; close $tfh; if (defined(my $pid = open(my $fh, "-|"))) { unless ($pid) { # child open my $bfh, "-|", "gunzip <$tname" or die "Cannot pipe from gunzip: $!"; binmode $bfh; $thaw->($bfh); exit; } my $out = do { local $/; <$fh> }; chomp $out; local $TODO = $todo_thaw; is($out, "OK", "$name: check result"); } else { skip "$name: Cannot fork for thaw", 1; } } } sub make_2g_data { my ($fh) = @_; my @x; my $y = 1; my $z = 2; my $g2 = 0x80000000; $x[0] = \$y; $x[$g2] = \$y; $x[$g2+1] = \$z; $x[$g2+2] = \$z; store_fd(\@x, $fh); } sub check_2g_data { my ($fh) = @_; my $x = retrieve_fd($fh); my $g2 = 0x80000000; $x->[0] == $x->[$g2] or die "First entry mismatch"; $x->[$g2+1] == $x->[$g2+2] or die "2G+ entry mismatch"; print "OK"; } sub make_4g_data { my ($fh) = @_; my @x; my $y = 1; my $z = 2; my $g4 = 2*0x80000000; $x[0] = \$y; $x[$g4] = \$y; $x[$g4+1] = \$z; $x[$g4+2] = \$z; store_fd(\@x, $fh); } sub check_4g_data { my ($fh) = @_; my $x = retrieve_fd($fh); my $g4 = 2*0x80000000; $x->[0] == $x->[$g4] or die "First entry mismatch"; $x->[$g4+1] == $x->[$g4+2] or die "4G+ entry mismatch"; ${$x->[$g4+1]} == 2 or die "Incorrect value in 4G+ entry"; print "OK"; } sub make_hook_data { my ($fh) = @_; my @x; my $y = HookLargeIds->new(101, { name => "one" }); my $z = HookLargeIds->new(201, { name => "two" }); my $g4 = 2*0x8000_0000; $x[0] = $y; $x[$g4] = $y; $x[$g4+1] = $z; $x[$g4+2] = $z; store_fd(\@x, $fh); } sub check_hook_data { my ($fh) = @_; my $x = retrieve_fd($fh); my $g4 = 2*0x8000_0000; my $y = $x->[$g4+1]; $y = $x->[$g4+1]; $y->id == 201 or die "Incorrect id in 4G+ object"; ref($y->data) eq 'HASH' or die "data isn't a ref"; $y->data->{name} eq "two" or die "data name not 'one'"; print "OK"; } sub make_net_large_pv { my ($fh) = @_; my $x = "x"; # avoid constant folding making a 4G scalar my $g4 = 2*0x80000000; my $y = $x x ($g4 + 5); nstore_fd(\$y, $fh); } sub check_net_large_pv { my ($fh) = @_; my $x = retrieve_fd($fh); my $g4 = 2*0x80000000; ref $x && ref($x) eq "SCALAR" or die "Not a scalar ref ", ref $x; length($$x) == $g4+5 or die "Incorect length"; print "OK"; } sub make_2g_hook_data { my ($fh) = @_; my $g2 = 0x80000000; my $x = HookLargeData->new($g2); store_fd($x, $fh); } sub check_2g_hook_data { my ($fh) = @_; my $x = retrieve_fd($fh); my $g2 = 0x80000000; $x->size == $g2 or die "Size incorrect ", $x->size; print "OK"; } sub make_4g_hook_data { my ($fh) = @_; my $g2 = 0x80000000; my $g4 = 2 * $g2; my $x = HookLargeData->new($g4+1); store_fd($x, $fh); } sub check_4g_hook_data { my ($fh) = @_; my $x = retrieve_fd($fh); my $g2 = 0x80000000; my $g4 = 2 * $g2; $x->size == $g4+1 or die "Size incorrect ", $x->size; print "OK"; } sub find_exe { my ($exe) = @_; $exe .= $Config{_exe}; my @path = split /\Q$Config{path_sep}/, $ENV{PATH}; for my $dir (@path) { my $abs = File::Spec->catfile($dir, $exe); -x $abs and return $abs; } } package HookLargeIds; sub new { my $class = shift; my ($id, $data) = @_; return bless { id => $id, data => $data }, $class; } sub STORABLE_freeze { #print STDERR "freeze called\n"; #Devel::Peek::Dump($_[0]); return $_[0]->id, $_[0]->data; } sub STORABLE_thaw { my ($self, $cloning, $ser, $data) = @_; #Devel::Peek::Dump(\@_); #print STDERR "thaw called\n"; #Devel::Peek::Dump($self); $self->{id} = $ser+0; $self->{data} = $data; } sub id { $_[0]{id}; } sub data { $_[0]{data}; } package HookLargeData; sub new { my ($class, $size) = @_; return bless { size => $size }, $class; } sub STORABLE_freeze { return "x" x $_[0]{size}; } sub STORABLE_thaw { my ($self, $cloning, $ser) = @_; $self->{size} = length $ser; } sub size { $_[0]{size}; } PK ��[�p�յ � t/threads.tnu �[��� # as of 2.09 on win32 Storable w/threads dies with "free to wrong # pool" since it uses the same context for different threads. since # win32 perl implementation allocates a different memory pool for each # thread using the a memory pool from one thread to allocate memory # for another thread makes win32 perl very unhappy # # but the problem exists everywhere, not only on win32 perl , it's # just hard to catch it deterministically - since the same context is # used if two or more threads happen to change the state of the # context in the middle of the operation, and those operations aren't # atomic per thread, bad things including data loss and corrupted data # can happen. # # this has been solved in 2.10 by adding a Storable::CLONE which calls # Storable::init_perinterp() to create a new context for each new # thread when it starts sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } unless ($Config{'useithreads'} and eval { require threads; 1 }) { print "1..0 # Skip: no threads\n"; exit 0; } if ($] eq "5.008" || $] eq "5.010000") { print "1..0 # Skip: threads unreliable in perl-$]\n"; exit 0; } # - is \W, so can't use \b at start. Negative look ahead and look behind # works at start/end of string, or where preceded/followed by spaces if ($] == 5.008002 and eval q{ $Config{'ccflags'} =~ /(?<!\S)-DDEBUGGING(?!\S)/ }) { # Bug caused by change 21610, fixed by change 21849 print "1..0 # Skip: tickles bug in threads combined with -DDEBUGGING on 5.8.2\n"; exit 0; } } use Test::More; use strict; use threads; use Storable qw(nfreeze); plan tests => 2; threads->new(\&sub1); $_->join() for threads->list(); ok 1; sub sub1 { nfreeze {}; ok 1; } PK ��[Xl�m� � t/recurse.tnu �[��� #!./perl # # Copyright (c) 1995-2000, Raphael Manfredi # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # use Config; sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use Storable qw(freeze thaw dclone); $Storable::flags = Storable::FLAGS_COMPAT; use Test::More tests => 39; package OBJ_REAL; use Storable qw(freeze thaw); @x = ('a', 1); sub make { bless [], shift } sub STORABLE_freeze { my $self = shift; my $cloning = shift; die "STORABLE_freeze" unless Storable::is_storing; return (freeze(\@x), $self); } sub STORABLE_thaw { my $self = shift; my $cloning = shift; my ($x, $obj) = @_; die "STORABLE_thaw #1" unless $obj eq $self; my $len = length $x; my $a = thaw $x; die "STORABLE_thaw #2" unless ref $a eq 'ARRAY'; die "STORABLE_thaw #3" unless @$a == 2 && $a->[0] eq 'a' && $a->[1] == 1; @$self = @$a; die "STORABLE_thaw #4" unless Storable::is_retrieving; } package OBJ_SYNC; @x = ('a', 1); sub make { bless {}, shift } sub STORABLE_freeze { my $self = shift; my ($cloning) = @_; return if $cloning; return ("", \@x, $self); } sub STORABLE_thaw { my $self = shift; my ($cloning, $undef, $a, $obj) = @_; die "STORABLE_thaw #1" unless $obj eq $self; die "STORABLE_thaw #2" unless ref $a eq 'ARRAY' || @$a != 2; $self->{ok} = $self; } package OBJ_SYNC2; use Storable qw(dclone); sub make { my $self = bless {}, shift; my ($ext) = @_; $self->{sync} = OBJ_SYNC->make; $self->{ext} = $ext; return $self; } sub STORABLE_freeze { my $self = shift; my %copy = %$self; my $r = \%copy; my $t = dclone($r->{sync}); return ("", [$t, $self->{ext}], $r, $self, $r->{ext}); } sub STORABLE_thaw { my $self = shift; my ($cloning, $undef, $a, $r, $obj, $ext) = @_; die "STORABLE_thaw #1" unless $obj eq $self; die "STORABLE_thaw #2" unless ref $a eq 'ARRAY'; die "STORABLE_thaw #3" unless ref $r eq 'HASH'; die "STORABLE_thaw #4" unless $a->[1] == $r->{ext}; $self->{ok} = $self; ($self->{sync}, $self->{ext}) = @$a; } package OBJ_REAL2; use Storable qw(freeze thaw); $MAX = 20; $recursed = 0; $hook_called = 0; sub make { bless [], shift } sub STORABLE_freeze { my $self = shift; $hook_called++; return (freeze($self), $self) if ++$recursed < $MAX; return ("no", $self); } sub STORABLE_thaw { my $self = shift; my $cloning = shift; my ($x, $obj) = @_; die "STORABLE_thaw #1" unless $obj eq $self; $self->[0] = thaw($x) if $x ne "no"; $recursed--; } package main; my $real = OBJ_REAL->make; my $x = freeze $real; isnt($x, undef); my $y = thaw $x; is(ref $y, 'OBJ_REAL'); is($y->[0], 'a'); is($y->[1], 1); my $sync = OBJ_SYNC->make; $x = freeze $sync; isnt($x, undef); $y = thaw $x; is(ref $y, 'OBJ_SYNC'); is($y->{ok}, $y); my $ext = [1, 2]; $sync = OBJ_SYNC2->make($ext); $x = freeze [$sync, $ext]; isnt($x, undef); my $z = thaw $x; $y = $z->[0]; is(ref $y, 'OBJ_SYNC2'); is($y->{ok}, $y); is(ref $y->{sync}, 'OBJ_SYNC'); is($y->{ext}, $z->[1]); $real = OBJ_REAL2->make; $x = freeze $real; isnt($x, undef); is($OBJ_REAL2::recursed, $OBJ_REAL2::MAX); is($OBJ_REAL2::hook_called, $OBJ_REAL2::MAX); $y = thaw $x; is(ref $y, 'OBJ_REAL2'); is($OBJ_REAL2::recursed, 0); $x = dclone $real; isnt($x, undef); is(ref $x, 'OBJ_REAL2'); is($OBJ_REAL2::recursed, 0); is($OBJ_REAL2::hook_called, 2 * $OBJ_REAL2::MAX); is(Storable::is_storing, ''); is(Storable::is_retrieving, ''); # # The following was a test-case that Salvador Ortiz Garcia <sog@msg.com.mx> # sent me, along with a proposed fix. # package Foo; sub new { my $class = shift; my $dat = shift; return bless {dat => $dat}, $class; } package Bar; sub new { my $class = shift; return bless { a => 'dummy', b => [ Foo->new(1), Foo->new(2), # Second instance of a Foo ] }, $class; } sub STORABLE_freeze { my($self,$clonning) = @_; return "$self->{a}", $self->{b}; } sub STORABLE_thaw { my($self,$clonning,$dummy,$o) = @_; $self->{a} = $dummy; $self->{b} = $o; } package main; my $bar = new Bar; my $bar2 = thaw freeze $bar; is(ref($bar2), 'Bar'); is(ref($bar->{b}[0]), 'Foo'); is(ref($bar->{b}[1]), 'Foo'); is(ref($bar2->{b}[0]), 'Foo'); is(ref($bar2->{b}[1]), 'Foo'); # # The following attempts to make sure blessed objects are blessed ASAP # at retrieve time. # package CLASS_1; sub make { my $self = bless {}, shift; return $self; } package CLASS_2; sub make { my $self = bless {}, shift; my ($o) = @_; $self->{c1} = CLASS_1->make(); $self->{o} = $o; $self->{c3} = bless CLASS_1->make(), "CLASS_3"; $o->set_c2($self); return $self; } sub STORABLE_freeze { my($self, $clonning) = @_; return "", $self->{c1}, $self->{c3}, $self->{o}; } sub STORABLE_thaw { my($self, $clonning, $frozen, $c1, $c3, $o) = @_; main::is(ref $self, "CLASS_2"); main::is(ref $c1, "CLASS_1"); main::is(ref $c3, "CLASS_3"); main::is(ref $o, "CLASS_OTHER"); $self->{c1} = $c1; $self->{c3} = $c3; } package CLASS_OTHER; sub make { my $self = bless {}, shift; return $self; } sub set_c2 { $_[0]->{c2} = $_[1] } # # Is the reference count of the extra references returned from a # STORABLE_freeze hook correct? [ID 20020601.005 (#9436)] # package Foo2; sub new { my $self = bless {}, $_[0]; $self->{freezed} = "$self"; return $self; } sub DESTROY { my $self = shift; $::refcount_ok = 1 unless "$self" eq $self->{freezed}; } package Foo3; sub new { bless {}, $_[0]; } sub STORABLE_freeze { my $obj = shift; return ("", $obj, Foo2->new); } sub STORABLE_thaw { } # Not really used package main; my $o = CLASS_OTHER->make(); my $c2 = CLASS_2->make($o); my $so = thaw freeze $o; our $refcount_ok = 0; thaw freeze(Foo3->new); is($refcount_ok, 1, "check refcount"); # Check stack overflows [cpan #97526] # JSON::XS limits this to 512. # Small 64bit systems fail with 1200 (c++ debugging), with gcc 3000. # Optimized 64bit allows up to 33.000 recursion depth. # with asan the limit is 255 though. local $Storable::recursion_limit = 30; local $Storable::recursion_limit_hash = 20; sub MAX_DEPTH () { Storable::stack_depth() } sub MAX_DEPTH_HASH () { Storable::stack_depth_hash() } { my $t; print "# max depth ", MAX_DEPTH, "\n"; $t = [$t] for 1 .. MAX_DEPTH; dclone $t; pass "can nest ".MAX_DEPTH." array refs"; } { my $t; $t = {1=>$t} for 1 .. MAX_DEPTH_HASH-10; dclone $t; pass "can nest ".(MAX_DEPTH_HASH)." hash refs"; } { my (@t); push @t, [{}] for 1..5000; #diag 'trying simple array[5000] stack overflow, no recursion'; dclone \@t; is $@, '', 'No simple array[5000] stack overflow #257'; } eval { my $t; $t = [$t] for 1 .. MAX_DEPTH*2; eval { note('trying catching recursive aref stack overflow') }; dclone $t; }; like $@, qr/Max\. recursion depth with nested structures exceeded/, 'Caught aref stack overflow '.MAX_DEPTH*2; if ($ENV{APPVEYOR} and length(pack "p", "") >= 8) { # TODO: need to repro this fail on a small machine. ok(1, "skip dclone of big hash"); } else { eval { my $t; # 35.000 will cause appveyor 64bit windows to fail earlier $t = {1=>$t} for 1 .. MAX_DEPTH * 2; eval { note('trying catching recursive href stack overflow') }; dclone $t; }; like $@, qr/Max\. recursion depth with nested structures exceeded/, 'Caught href stack overflow '.MAX_DEPTH_HASH*2; } { # perl #133326 my @tt; #$Storable::DEBUGME=1; for (1..16000) { my $t = [[[]]]; push @tt, $t; } ok(eval { dclone \@tt; 1 }, "low depth structure shouldn't be treated as nested"); } PK ��[�k�� � t/interwork56.tnu �[��� #!./perl -w # # Copyright 2002, Larry Wall. # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # # I ought to keep this test easily backwards compatible to 5.004, so no # qr//; # This test checks whether the kludge to interwork with 5.6 Storables compiled # on Unix systems with IV as long long works. sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } unless ($Config{ivsize} and $Config{ivsize} > $Config{longsize}) { print "1..0 # Skip: Your IVs are no larger than your longs\n"; exit 0; } } use Storable qw(freeze thaw); use strict; use Test::More tests=>30; our (%tests); { local $/ = "\n\nend\n"; while (<DATA>) { next unless /\S/s; unless (/begin ([0-7]{3}) ([^\n]*)\n(.*)$/s) { s/\n.*//s; warn "Dodgy data in section starting '$_'"; next; } next unless oct $1 == ord 'A'; # Skip ASCII on EBCDIC, and vice versa my $data = unpack 'u', $3; $tests{$2} = $data; } } # perl makes easy things easy, and hard things possible: my $test = freeze \'Hell'; my $header = Storable::read_magic ($test); is ($header->{byteorder}, $Config{byteorder}, "header's byteorder and Config.pm's should agree"); my $result = eval {thaw $test}; isa_ok ($result, 'SCALAR', "Check thawing test data"); is ($@, '', "causes no errors"); is ($$result, 'Hell', 'and gives the expected data'); my $kingdom = $Config{byteorder} =~ /23/ ? "Lillput" : "Belfuscu"; my $name = join ',', $kingdom, @$header{qw(intsize longsize ptrsize nvsize)}; SKIP: { my $real_thing = $tests{$name}; if (!defined $real_thing) { print << "EOM"; # No test data for Storable 1.x for: # # byteorder '$Config{byteorder}' # sizeof(int) $$header{intsize} # sizeof(long) $$header{longsize} # sizeof(char *) $$header{ptrsize} # sizeof(NV) $$header{nvsize} # If you have Storable 1.x built with perl 5.6.x on this platform, please # make_56_interwork.pl to generate test data, and append the test data to # this test. # You may find that make_56_interwork.pl reports that your platform has no # interworking problems, in which case you need do nothing. EOM skip "# No 1.x test file", 9; } my $result = eval {thaw $real_thing}; is ($result, undef, "By default should not be able to thaw"); like ($@, qr/Byte order is not compatible/, "because the header byte order strings differ"); local $Storable::interwork_56_64bit = 1; $result = eval {thaw $real_thing}; isa_ok ($result, 'ARRAY', "With flag should now thaw"); is ($@, '', "with no errors"); # However, as the file is written with Storable pre 2.01, it's a known # bug that large (positive) UVs become IVs my $value = (~0 ^ (~0 >> 1) ^ 2); is (@$result, 4, "4 elements in array"); like ($$result[0], qr/^This file was written with [0-9.]+ on perl [0-9.]+\z/, "1st element"); is ($$result[1], "$kingdom was correct", "2nd element"); cmp_ok ($$result[2] ^ $value, '==', 0, "3rd element") or printf "# expected %#X, got %#X\n", $value, $$result[2]; is ($$result[3], "The End", "4th element"); } $result = eval {thaw $test}; isa_ok ($result, 'SCALAR', "CHORUS: check thawing test data"); is ($@, '', " causes no errors"); is ($$result, 'Hell', " and gives the expected data"); my $test_kludge; { local $Storable::interwork_56_64bit = 1; $test_kludge = freeze \'Heck'; } my $header_kludge = Storable::read_magic ($test_kludge); cmp_ok (length ($header_kludge->{byteorder}), '==', $Config{longsize}, "With 5.6 interwork kludge byteorder string should be same size as long" ); $result = eval {thaw $test_kludge}; is ($result, undef, "By default should not be able to thaw"); like ($@, qr/Byte order is not compatible/, "because the header byte order strings differ"); $result = eval {thaw $test}; isa_ok ($result, 'SCALAR', "CHORUS: check thawing test data"); is ($@, '', " causes no errors"); is ($$result, 'Hell', " and gives the expected data"); { local $Storable::interwork_56_64bit = 1; $result = eval {thaw $test_kludge}; isa_ok ($result, 'SCALAR', "should be able to thaw kludge data"); is ($@, '', "with no errors"); is ($$result, 'Heck', "and gives expected data"); $result = eval {thaw $test}; is ($result, undef, "But now can't thaw real data"); like ($@, qr/Byte order is not compatible/, "because the header byte order strings differ"); } # All together now: $result = eval {thaw $test}; isa_ok ($result, 'SCALAR', "CHORUS: check thawing test data"); is ($@, '', " causes no errors"); is ($$result, 'Hell', " and gives the expected data"); __END__ # A whole run of 1.1.14 freeze data, uuencoded. The "mode bits" are the octal # value of 'A', the "file name" is the test name. Use make_56_interwork.pl # with a copy of Storable 1.X generate these. # byteorder '1234' # sizeof(int) 4 # sizeof(long) 4 # sizeof(char *) 4 # sizeof(NV) 8 begin 101 Lillput,4,4,4,8 M!`0$,3(S-`0$!`@"!`````HQ5&AI<R!F:6QE('=A<R!W<FET=&5N('=I=&@@ M,2XP,30@;VX@<&5R;"`U+C`P-C`P,0H33&EL;'!U="!W87,@8V]R<F5C=`8" 0````````@`H'5&AE($5N9``` end # byteorder '4321' # sizeof(int) 4 # sizeof(long) 4 # sizeof(char *) 4 # sizeof(NV) 8 begin 101 Belfuscu,4,4,4,8 M!`0$-#,R,00$!`@"````!`HQ5&AI<R!F:6QE('=A<R!W<FET=&5N('=I=&@@ M,2XP,30@;VX@<&5R;"`U+C`P-C`P,0H40F5L9G5S8W4@=V%S(&-O<G)E8W0& 1@`````````(*!U1H92!%;F0` end # byteorder '1234' # sizeof(int) 4 # sizeof(long) 4 # sizeof(char *) 4 # sizeof(NV) 12 begin 101 Lillput,4,4,4,12 M!`0$,3(S-`0$!`P"!`````HQ5&AI<R!F:6QE('=A<R!W<FET=&5N('=I=&@@ M,2XP,30@;VX@<&5R;"`U+C`P-C`P,0H33&EL;'!U="!W87,@8V]R<F5C=`8" 0````````@`H'5&AE($5N9``` end PK ��[���fm m t/tied_reify.tnu �[��� use Test::More tests => 1; package dumb_thing; use strict; use warnings; use Tie::Array; use Carp; use base 'Tie::StdArray'; sub TIEARRAY { my $class = shift; my $this = bless [], $class; my $that = shift; @$this = @$that; $this; } package main; use strict; use warnings; use Storable qw(freeze thaw); my $x = [1,2,3,4]; broken($x); # ties $x broken( thaw( freeze($x) ) ); # since 5.16 fails with "Cannot tie unreifiable array" sub broken { my $w = shift; tie @$_, dumb_thing => $_ for $w; } # fails since 5.16 ok 1, 'Does not fail with "Cannot tie unreifiable array" RT#84705'; PK ��[���� � t/make_overload.plnu �[��� #!/usr/local/bin/perl -w use strict; use Storable qw(nfreeze); use HAS_OVERLOAD; my $o = HAS_OVERLOAD->make("snow"); my $f = nfreeze \$o; my $uu = pack 'u', $f; print $uu; PK ��[��o� � t/utf8.tnu �[��� #!./perl -w # # Copyright (c) 1995-2000, Raphael Manfredi # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use strict; use Storable qw(thaw freeze); use Test::More tests => 6; my $x = chr(1234); is($x, ${thaw freeze \$x}); # Long scalar $x = join '', map {chr $_} (0..1023); is($x, ${thaw freeze \$x}); # Char in the range 127-255 (probably) in utf8. This just won't work for # EBCDIC for early Perls. $x = ($] lt 5.007_003) ? chr(175) : chr(utf8::unicode_to_native(175)) . chr (256); chop $x; is($x, ${thaw freeze \$x}); # Storable needs to cope if a frozen string happens to be internal utf8 # encoded $x = chr 256; my $data = freeze \$x; is($x, ${thaw $data}); $data .= chr 256; chop $data; is($x, ${thaw $data}); $data .= chr 256; # This definitely isn't valid eval {thaw $data}; like($@, qr/corrupt.*characters outside/); PK ��[���=� � t/huge.tnu �[��� #!./perl use strict; use warnings; use Config; use Storable qw(dclone); use Test::More; BEGIN { plan skip_all => 'Storable was not built' if $ENV{PERL_CORE} && $Config{'extensions'} !~ /\b Storable \b/x; plan skip_all => 'Need 64-bit pointers for this test' if $Config{ptrsize} < 8 and $] > 5.013; plan skip_all => 'Need 64-bit int for this test on older versions' if $Config{uvsize} < 8 and $] < 5.013; plan skip_all => 'Need ~4 GiB memory for this test, set PERL_TEST_MEMORY > 4' if !$ENV{PERL_TEST_MEMORY} || $ENV{PERL_TEST_MEMORY} < 4; } # Just too big to fit in an I32. my $huge = int(2 ** 31); # v5.24.1c/v5.25.1c switched to die earlier with "Too many elements", # which is much safer. my $has_too_many = ($Config{usecperl} and (($] >= 5.024001 and $] < 5.025000) or $] >= 5.025001)) ? 1 : 0; # These overlarge sizes are enabled only since Storable 3.00 and some # cases need cperl support. Perl5 (as of 5.24) has some internal # problems with >I32 sizes, which only cperl has fixed. # perl5 is not yet 2GB safe, esp. with hashes. # string len (xpv_cur): STRLEN (ptrsize>=8) # array size (xav_max): SSize_t (I32/I64) (ptrsize>=8) # hash size (xhv_keys): # IV - 5.12 (ivsize>=8) # STRLEN 5.14 - 5.24 (size_t: U32/U64) # SSize_t 5.22c - 5.24c (I32/I64) # U32 5.25c - # hash key: I32 my @cases = ( ['huge string', sub { my $s = 'x' x $huge; \$s }], ['array with huge element', sub { my $s = 'x' x $huge; [$s] }], ['hash with huge value', sub { my $s = 'x' x $huge; +{ foo => $s } }], # There's no huge key, limited to I32. ) if $Config{ptrsize} > 4; # An array with a huge number of elements requires several gigabytes of # virtual memory. On darwin it is evtl killed. if ($Config{ptrsize} > 4 and !$has_too_many) { # needs 20-55G virtual memory, 4.6M heap and several minutes on a fast machine if ($ENV{PERL_TEST_MEMORY} >= 55) { push @cases, [ 'huge array', sub { my @x; $x[$huge] = undef; \@x } ]; } else { diag "skip huge array, need PERL_TEST_MEMORY >= 55"; } } # A hash with a huge number of keys would require tens of gigabytes of # memory, which doesn't seem like a good idea even for this test file. # Unfortunately even older 32bit perls do allow this. if (!$has_too_many) { # needs >90G virtual mem, and is evtl. killed if ($ENV{PERL_TEST_MEMORY} >= 96) { # number of keys >I32. impossible to handle with perl5, but Storable can. push @cases, ['huge hash', sub { my %x = (0 .. $huge); \%x } ]; } else { diag "skip huge hash, need PERL_TEST_MEMORY >= 96"; } } plan tests => 2 * scalar @cases; for (@cases) { my ($desc, $build) = @$_; diag "building test input: $desc"; my ($input, $exn, $clone); diag "these huge subtests need a lot of memory and time!" if $desc eq 'huge array'; $input = $build->(); diag "running test: $desc"; $exn = $@ if !eval { $clone = dclone($input); 1 }; is($exn, undef, "$desc no exception"); is_deeply($input, $clone, "$desc cloned"); #ok($clone, "$desc cloned"); # Ensure the huge objects are freed right now: undef $input; undef $clone; } PK ��[ݸf* * t/blessed.tnu �[��� #!./perl # # Copyright (c) 1995-2000, Raphael Manfredi # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # BEGIN { # Do this as the very first thing, in order to avoid problems with the # PADTMP flag on pre-5.19.3 threaded Perls. On those Perls, compiling # code that contains a constant-folded canonical truth value breaks # the ability to take a reference to that canonical truth value later. $::false = 0; %::immortals = ( 'u' => \undef, 'y' => \!$::false, 'n' => \!!$::false, ); } sub BEGIN { if ($ENV{PERL_CORE}) { chdir 'dist/Storable' if -d 'dist/Storable'; @INC = ('../../lib', 't'); } else { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; } require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use Test::More; use Storable qw(freeze thaw store retrieve fd_retrieve); %::weird_refs = (REF => \(my $aref = []), VSTRING => \(my $vstring = v1.2.3), 'long VSTRING' => \(my $lvstring = eval "v" . 0 x 300), LVALUE => \(my $substr = substr((my $str = "foo"), 0, 3))); my $test = 13; my $tests = $test + 41 + (2 * 6 * keys %::immortals) + (3 * keys %::weird_refs); plan(tests => $tests); package SHORT_NAME; sub make { bless [], shift } package SHORT_NAME_WITH_HOOK; sub make { bless [], shift } sub STORABLE_freeze { my $self = shift; return ("", $self); } sub STORABLE_thaw { my $self = shift; my $cloning = shift; my ($x, $obj) = @_; die "STORABLE_thaw" unless $obj eq $self; } package main; # Still less than 256 bytes, so long classname logic not fully exercised # Identifier too long - 5.004 # parser.h: char tokenbuf[256]: cperl5.24 => 1024 my $m = ($Config{usecperl} and $] >= 5.024) ? 56 : 14; my $longname = "LONG_NAME_" . ('xxxxxxxxxxxxx::' x $m) . "final"; eval <<EOC; package $longname; \@ISA = ("SHORT_NAME"); EOC is($@, ''); eval <<EOC; package ${longname}_WITH_HOOK; \@ISA = ("SHORT_NAME_WITH_HOOK"); EOC is($@, ''); # Construct a pool of objects my @pool; for (my $i = 0; $i < 10; $i++) { push(@pool, SHORT_NAME->make); push(@pool, SHORT_NAME_WITH_HOOK->make); push(@pool, $longname->make); push(@pool, "${longname}_WITH_HOOK"->make); } my $x = freeze \@pool; pass("Freeze didn't crash"); my $y = thaw $x; is(ref $y, 'ARRAY'); is(scalar @{$y}, @pool); is(ref $y->[0], 'SHORT_NAME'); is(ref $y->[1], 'SHORT_NAME_WITH_HOOK'); is(ref $y->[2], $longname); is(ref $y->[3], "${longname}_WITH_HOOK"); my $good = 1; for (my $i = 0; $i < 10; $i++) { do { $good = 0; last } unless ref $y->[4*$i] eq 'SHORT_NAME'; do { $good = 0; last } unless ref $y->[4*$i+1] eq 'SHORT_NAME_WITH_HOOK'; do { $good = 0; last } unless ref $y->[4*$i+2] eq $longname; do { $good = 0; last } unless ref $y->[4*$i+3] eq "${longname}_WITH_HOOK"; } is($good, 1); { my $blessed_ref = bless \\[1,2,3], 'Foobar'; my $x = freeze $blessed_ref; my $y = thaw $x; is(ref $y, 'Foobar'); is($$$y->[0], 1); } package RETURNS_IMMORTALS; sub make { my $self = shift; bless [@_], $self } sub STORABLE_freeze { # Some reference some number of times. my $self = shift; my ($what, $times) = @$self; return ("$what$times", ($::immortals{$what}) x $times); } sub STORABLE_thaw { my $self = shift; my $cloning = shift; my ($x, @refs) = @_; my ($what, $times) = $x =~ /(.)(\d+)/; die "'$x' didn't match" unless defined $times; main::is(scalar @refs, $times); my $expect = $::immortals{$what}; die "'$x' did not give a reference" unless ref $expect; my $fail; foreach (@refs) { $fail++ if $_ != $expect; } main::is($fail, undef); } package main; # XXX Failed tests: 15, 27, 39 with 5.12 and 5.10 threaded. # 15: 1 fail (y x 1), 27: 2 fail (y x 2), 39: 3 fail (y x 3) # $Storable::DEBUGME = 1; my $count; foreach $count (1..3) { my $immortal; foreach $immortal (keys %::immortals) { print "# $immortal x $count\n"; my $i = RETURNS_IMMORTALS->make ($immortal, $count); my $f = freeze ($i); TODO: { # ref sv_true is not always sv_true, at least in older threaded perls. local $TODO = "Some 5.10/12 do not preserve ref identity with freeze \\(1 == 1)" if !defined($f) and $] < 5.013 and $] > 5.009 and $immortal eq 'y'; isnt($f, undef); } my $t = thaw $f; pass("thaw didn't crash"); } } # Test automatic require of packages to find thaw hook. package HAS_HOOK; $loaded_count = 0; $thawed_count = 0; sub make { bless []; } sub STORABLE_freeze { my $self = shift; return ''; } package main; my $f = freeze (HAS_HOOK->make); is($HAS_HOOK::loaded_count, 0); is($HAS_HOOK::thawed_count, 0); my $t = thaw $f; is($HAS_HOOK::loaded_count, 1); is($HAS_HOOK::thawed_count, 1); isnt($t, undef); is(ref $t, 'HAS_HOOK'); delete $INC{"HAS_HOOK.pm"}; delete $HAS_HOOK::{STORABLE_thaw}; $t = thaw $f; is($HAS_HOOK::loaded_count, 2); is($HAS_HOOK::thawed_count, 2); isnt($t, undef); is(ref $t, 'HAS_HOOK'); { package STRESS_THE_STACK; my $stress; sub make { bless []; } sub no_op { 0; } sub STORABLE_freeze { my $self = shift; ++$freeze_count; return no_op(1..(++$stress * 2000)) ? die "can't happen" : ''; } sub STORABLE_thaw { my $self = shift; ++$thaw_count; no_op(1..(++$stress * 2000)) && die "can't happen"; return; } } $STRESS_THE_STACK::freeze_count = 0; $STRESS_THE_STACK::thaw_count = 0; $f = freeze (STRESS_THE_STACK->make); is($STRESS_THE_STACK::freeze_count, 1); is($STRESS_THE_STACK::thaw_count, 0); $t = thaw $f; is($STRESS_THE_STACK::freeze_count, 1); is($STRESS_THE_STACK::thaw_count, 1); isnt($t, undef); is(ref $t, 'STRESS_THE_STACK'); my $file = "storable-testfile.$$"; die "Temporary file '$file' already exists" if -e $file; END { while (-f $file) {unlink $file or die "Can't unlink '$file': $!" }} $STRESS_THE_STACK::freeze_count = 0; $STRESS_THE_STACK::thaw_count = 0; store (STRESS_THE_STACK->make, $file); is($STRESS_THE_STACK::freeze_count, 1); is($STRESS_THE_STACK::thaw_count, 0); $t = retrieve ($file); is($STRESS_THE_STACK::freeze_count, 1); is($STRESS_THE_STACK::thaw_count, 1); isnt($t, undef); is(ref $t, 'STRESS_THE_STACK'); { package ModifyARG112358; sub STORABLE_freeze { $_[0] = "foo"; } my $o= {str=>bless {}}; my $f= ::freeze($o); ::is ref $o->{str}, __PACKAGE__, 'assignment to $_[0] in STORABLE_freeze does not corrupt things'; } # [perl #113880] { { package WeirdRefHook; sub STORABLE_freeze { () } $INC{'WeirdRefHook.pm'} = __FILE__; } for my $weird (keys %weird_refs) { my $obj = $weird_refs{$weird}; bless $obj, 'WeirdRefHook'; my $frozen; my $success = eval { $frozen = freeze($obj); 1 }; ok($success, "can freeze $weird objects") || diag("freezing failed: $@"); my $thawn = thaw($frozen); # is_deeply ignores blessings is ref $thawn, ref $obj, "get the right blessing back for $weird"; if ($weird =~ 'VSTRING') { # It is not just Storable that did not support vstrings. :-) # See https://rt.cpan.org/Ticket/Display.html?id=78678 my $newver = "version"->can("new") ? sub { "version"->new(shift) } : sub { "" }; if (!ok $$thawn eq $$obj && &$newver($$thawn) eq &$newver($$obj), "get the right value back" ) { diag "$$thawn vs $$obj"; diag &$newver($$thawn) eq &$newver($$obj) if &$newver(1); } } else { is_deeply($thawn, $obj, "get the right value back"); } } } { # [perl #118551] { package RT118551; sub new { my $class = shift; my $string = shift; die 'Bad data' unless defined $string; my $self = { string => $string }; return bless $self, $class; } sub STORABLE_freeze { my $self = shift; my $cloning = shift; return if $cloning; return ($self->{string}); } sub STORABLE_attach { my $class = shift; my $cloning = shift; my $string = shift; return $class->new($string); } } my $x = [ RT118551->new('a'), RT118551->new('') ]; $y = freeze($x); ok(eval {thaw($y)}, "empty serialized") or diag $@; # <-- dies here with "Bad data" } { { package FreezeHookDies; sub STORABLE_freeze { die ${$_[0]} } package ThawHookDies; sub STORABLE_freeze { my ($self, $cloning) = @_; my $tmp = $$self; return "a", \$tmp; } sub STORABLE_thaw { my ($self, $cloning, $str, $obj) = @_; die $$obj; } } my $x = bless \(my $tmpx = "Foo"), "FreezeHookDies"; my $y = bless \(my $tmpy = []), "FreezeHookDies"; ok(!eval { store($x, "store$$"); 1 }, "store of hook which throws no NL died"); ok(!eval { store($y, "store$$"); 1 }, "store of hook which throws ref died"); ok(!eval { freeze($x); 1 }, "freeze of hook which throws no NL died"); ok(!eval { freeze($y); 1 }, "freeze of hook which throws ref died"); ok(!eval { dclone($x); 1 }, "dclone of hook which throws no NL died"); ok(!eval { dclone($y); 1 }, "dclone of hook which throws ref died"); my $ostr = bless \(my $tmpstr = "Foo"), "ThawHookDies"; my $oref = bless \(my $tmpref = []), "ThawHookDies"; ok(store($ostr, "store$$"), "save throw Foo on thaw"); ok(!eval { retrieve("store$$"); 1 }, "retrieve of throw Foo on thaw died"); open FH, "<", "store$$" or die; binmode FH; ok(!eval { fd_retrieve(*FH); 1 }, "fd_retrieve of throw Foo on thaw died"); ok(!ref $@, "right thing thrown"); close FH; ok(store($oref, "store$$"), "save throw ref on thaw"); ok(!eval { retrieve("store$$"); 1 }, "retrieve of throw ref on thaw died"); open FH, "<", "store$$" or die; binmode FH; ok(!eval { fd_retrieve(*FH); 1 }, "fd_retrieve of throw [] on thaw died"); ok(ref $@, "right thing thrown"); close FH; my $strdata = freeze($ostr); ok(!eval { thaw($strdata); 1 }, "thaw of throw Foo on thaw died"); ok(!ref $@, "and a string thrown"); my $refdata = freeze($oref); ok(!eval { thaw($refdata); 1 }, "thaw of throw [] on thaw died"); ok(ref $@, "and a ref thrown"); unlink("store$$"); } PK ��[�rL� � t/compat06.tnu �[��� #!./perl # # Copyright (c) 1995-2000, Raphael Manfredi # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use Test::More tests => 8; use Storable qw(freeze nfreeze thaw); package TIED_HASH; sub TIEHASH { my $self = bless {}, shift; return $self; } sub FETCH { my $self = shift; my ($key) = @_; $main::hash_fetch++; return $self->{$key}; } sub STORE { my $self = shift; my ($key, $val) = @_; $self->{$key} = $val; } package SIMPLE; sub make { my $self = bless [], shift; my ($x) = @_; $self->[0] = $x; return $self; } package ROOT; sub make { my $self = bless {}, shift; my $h = tie %hash, TIED_HASH; $self->{h} = $h; $self->{ref} = \%hash; my @pool; for (my $i = 0; $i < 5; $i++) { push(@pool, SIMPLE->make($i)); } $self->{obj} = \@pool; my @a = ('string', $h, $self); $self->{a} = \@a; $self->{num} = [1, 0, -3, -3.14159, 456, 4.5]; $h->{key1} = 'val1'; $h->{key2} = 'val2'; return $self; }; sub num { $_[0]->{num} } sub h { $_[0]->{h} } sub ref { $_[0]->{ref} } sub obj { $_[0]->{obj} } package main; my $is_EBCDIC = (ord('A') == 193) ? 1 : 0; my $r = ROOT->make; my $data = ''; if (!$is_EBCDIC) { # ASCII machine while (<DATA>) { next if /^#/; $data .= unpack("u", $_); } } else { while (<DATA>) { next if /^#$/; # skip comments next if /^#\s+/; # skip comments next if /^[^#]/; # skip uuencoding for ASCII machines s/^#//; # prepare uuencoded data for EBCDIC machines $data .= unpack("u", $_); } } my $expected_length = $is_EBCDIC ? 217 : 278; is(length $data, $expected_length); my $y = thaw($data); isnt($y, undef); is(ref $y, 'ROOT'); $Storable::canonical = 1; # Prevent "used once" warning $Storable::canonical = 1; # Allow for long double string conversions. $y->{num}->[3] += 0; $r->{num}->[3] += 0; is(nfreeze($y), nfreeze($r)); is($y->ref->{key1}, 'val1'); is($y->ref->{key2}, 'val2'); is($hash_fetch, 2); my $num = $r->num; my $ok = 1; for (my $i = 0; $i < @$num; $i++) { do { $ok = 0; last } unless $num->[$i] == $y->num->[$i]; } is($ok, 1); __END__ # # using Storable-0.6@11, output of: print pack("u", nfreeze(ROOT->make)); # original size: 278 bytes # M`P,````%!`(````&"(%8"(!8"'U8"@@M,RXQ-#$U.5@)```!R%@*`S0N-5A8 M6`````-N=6T$`P````(*!'9A;#%8````!&ME>3$*!'9A;#)8````!&ME>3)B M"51)141?2$%32%A8`````6@$`@````,*!G-T<FEN9U@$``````I8!``````` M6%A8`````6$$`@````4$`@````$(@%AB!E-)35!,15A8!`(````!"(%88@93 M24U03$586`0"`````0B"6&(&4TE-4$Q%6%@$`@````$(@UAB!E-)35!,15A8 M!`(````!"(188@9324U03$586%A8`````V]B:@0,!``````*6%A8`````W)E (9F($4D]/5%@` # # using Storable-0.6@11, output of: print '#' . pack("u", nfreeze(ROOT->make)); # on OS/390 (cp 1047) original size: 217 bytes # #M!0,1!-G6UN,#````!00,!!$)X\G%Q&W(P>+(`P````(*!*6!D_$````$DH6H #M\0H$I8&3\@````22A:CR`````YF%A@0"````!@B!"(`(?0H(8/-+\?3Q]?D) #M```!R`H#]$OU`````Y6DE`0"````!001!N+)U-?3Q0(````!"(`$$@("```` #M`0B!!!("`@````$(@@02`@(````!"(,$$@("`````0B$`````Y:"D00````` #E!`````&(!`(````#"@:BHYF)E8<$``````0$```````````!@0`` PK ��[d)�i5 5 t/robust.tnu �[��� #!/usr/bin/perl # This test script checks that Storable will load properly if someone # is incorrectly messing with %INC to hide Log::Agent. No, no-one should # really be doing this, but, then, it *used* to work! use Test::More; plan tests => 1; $INC{'Log/Agent.pm'} = '#ignore#'; require Storable; pass; PK ��[���� � t/weak.tnu �[��� #!./perl -w # # Copyright 2004, Larry Wall. # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # sub BEGIN { # This lets us distribute Test::More in t/ unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } if ($Config{extensions} !~ /\bList\/Util\b/) { print "1..0 # Skip: List::Util was not built\n"; exit 0; } require Scalar::Util; Scalar::Util->import(qw(weaken isweak)); if (grep { /weaken/ } @Scalar::Util::EXPORT_FAIL) { print("1..0 # Skip: No support for weaken in Scalar::Util\n"); exit 0; } } use Test::More 'no_plan'; use Storable qw (store retrieve freeze thaw nstore nfreeze dclone); require 'testlib.pl'; our $file; use strict; # $Storable::flags = Storable::FLAGS_COMPAT; sub tester { my ($contents, $sub, $testersub, $what) = @_; # Test that if we re-write it, everything still works: my $clone = &$sub ($contents); is ($@, "", "There should be no error extracting for $what"); &$testersub ($clone, $what); } my $r = {}; my $s1 = [$r, $r]; weaken $s1->[1]; ok (isweak($s1->[1]), "element 1 is a weak reference"); my $s0 = [$r, $r]; weaken $s0->[0]; ok (isweak($s0->[0]), "element 0 is a weak reference"); my $w = [$r]; weaken $w->[0]; ok (isweak($w->[0]), "element 0 is a weak reference"); package OVERLOADED; use overload '""' => sub { $_[0][0] }; package main; $a = bless [77], 'OVERLOADED'; my $o = [$a, $a]; weaken $o->[0]; ok (isweak($o->[0]), "element 0 is a weak reference"); my @tests = ( [$s1, sub { my ($clone, $what) = @_; isa_ok($clone,'ARRAY'); isa_ok($clone->[0],'HASH'); isa_ok($clone->[1],'HASH'); ok(!isweak $clone->[0], "Element 0 isn't weak"); ok(isweak $clone->[1], "Element 1 is weak"); } ], # The weak reference needs to hang around long enough for other stuff to # be able to make references to it. So try it second. [$s0, sub { my ($clone, $what) = @_; isa_ok($clone,'ARRAY'); isa_ok($clone->[0],'HASH'); isa_ok($clone->[1],'HASH'); ok(isweak $clone->[0], "Element 0 is weak"); ok(!isweak $clone->[1], "Element 1 isn't weak"); } ], [$w, sub { my ($clone, $what) = @_; isa_ok($clone,'ARRAY'); if ($what eq 'nothing') { # We're the original, so we're still a weakref to a hash isa_ok($clone->[0],'HASH'); ok(isweak $clone->[0], "Element 0 is weak"); } else { is($clone->[0],undef); } } ], [$o, sub { my ($clone, $what) = @_; isa_ok($clone,'ARRAY'); isa_ok($clone->[0],'OVERLOADED'); isa_ok($clone->[1],'OVERLOADED'); ok(isweak $clone->[0], "Element 0 is weak"); ok(!isweak $clone->[1], "Element 1 isn't weak"); is ("$clone->[0]", 77, "Element 0 stringifies to 77"); is ("$clone->[1]", 77, "Element 1 stringifies to 77"); } ], ); foreach (@tests) { my ($input, $testsub) = @$_; tester($input, sub {return shift}, $testsub, 'nothing'); ok (defined store($input, $file)); # Read the contents into memory: my $contents = slurp ($file); tester($contents, \&store_and_retrieve, $testsub, 'file'); # And now try almost everything again with a Storable string my $stored = freeze $input; tester($stored, \&freeze_and_thaw, $testsub, 'string'); ok (defined nstore($input, $file)); tester($contents, \&store_and_retrieve, $testsub, 'network file'); $stored = nfreeze $input; tester($stored, \&freeze_and_thaw, $testsub, 'network string'); } { # [perl #134179] sv_upgrade from type 7 down to type 1 my $foo = [qr//,[]]; weaken($foo->[1][0][0] = $foo->[1]); my $out = dclone($foo); # croaked here is_deeply($out, $foo, "check they match"); } PK ��[��bQ? ? t/downgrade.tnu �[��� #!./perl -w # # Copyright 2002, Larry Wall. # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # # I ought to keep this test easily backwards compatible to 5.004, so no # qr//; # This test checks downgrade behaviour on pre-5.8 perls when new 5.8 features # are encountered. sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use Test::More; use Storable 'thaw'; use strict; our (%U_HASH, $UTF8_CROAK, $RESTRICTED_CROAK); our @RESTRICT_TESTS = ('Locked hash', 'Locked hash placeholder', 'Locked keys', 'Locked keys placeholder', ); our %R_HASH = (perl => 'rules'); if ($] > 5.007002) { # This is cheating. "\xdf" in Latin 1 is beta S, so will match \w if it # is stored in utf8, not bytes. # "\xdf" is y diaresis in EBCDIC (except for cp875, but so far no-one seems # to use that) which has exactly the same properties for \w # So the tests happen to pass. my $utf8 = "Schlo\xdf" . chr 256; chop $utf8; # \xe5 is V in EBCDIC. That doesn't have the same properties w.r.t. \w as # an a circumflex, so we need to be explicit. # and its these very properties we're trying to test - an edge case # involving whether scalars are being stored in bytes or in utf8. my $a_circumflex = (ord ('A') == 193 ? "\x47" : "\xe5"); %U_HASH = (map {$_, $_} 'castle', "ch${a_circumflex}teau", $utf8, chr 0x57CE); plan tests => 169; } else { plan tests => 59; } $UTF8_CROAK = "/^Cannot retrieve UTF8 data in non-UTF8 perl/"; $RESTRICTED_CROAK = "/^Cannot retrieve restricted hash/"; my %tests; { local $/ = "\n\nend\n"; while (<DATA>) { next unless /\S/s; unless (/begin ([0-7]{3}) ([^\n]*)\n(.*)$/s) { s/\n.*//s; warn "Dodgy data in section starting '$_'"; next; } next unless oct $1 == ord 'A'; # Skip ASCII on EBCDIC, and vice versa my $data = unpack 'u', $3; $tests{$2} = $data; } } # use Data::Dumper; $Data::Dumper::Useqq = 1; print Dumper \%tests; sub thaw_hash { my ($name, $expected) = @_; my $hash = eval {thaw $tests{$name}}; is ($@, '', "Thawed $name without error?"); isa_ok ($hash, 'HASH'); ok (defined $hash && eq_hash($hash, $expected), "And it is the hash we expected?"); $hash; } sub thaw_scalar { my ($name, $expected, $bug) = @_; my $scalar = eval {thaw $tests{$name}}; is ($@, '', "Thawed $name without error?"); isa_ok ($scalar, 'SCALAR', "Thawed $name?"); is ($$scalar, $expected, "And it is the data we expected?"); $scalar; } sub thaw_fail { my ($name, $expected) = @_; my $thing = eval {thaw $tests{$name}}; is ($thing, undef, "Thawed $name failed as expected?"); like ($@, $expected, "Error as predicted?"); } sub test_locked_hash { my $hash = shift; my @keys = keys %$hash; my ($key, $value) = each %$hash; eval {$hash->{$key} = reverse $value}; like( $@, "/^Modification of a read-only value attempted/", 'trying to change a locked key' ); is ($hash->{$key}, $value, "hash should not change?"); eval {$hash->{use} = 'perl'}; like( $@, "/^Attempt to access disallowed key 'use' in a restricted hash/", 'trying to add another key' ); ok (eq_array([keys %$hash], \@keys), "Still the same keys?"); } sub test_restricted_hash { my $hash = shift; my @keys = keys %$hash; my ($key, $value) = each %$hash; eval {$hash->{$key} = reverse $value}; is( $@, '', 'trying to change a restricted key' ); is ($hash->{$key}, reverse ($value), "hash should change"); eval {$hash->{use} = 'perl'}; like( $@, "/^Attempt to access disallowed key 'use' in a restricted hash/", 'trying to add another key' ); ok (eq_array([keys %$hash], \@keys), "Still the same keys?"); } sub test_placeholder { my $hash = shift; eval {$hash->{rules} = 42}; is ($@, '', 'No errors'); is ($hash->{rules}, 42, "New value added"); } sub test_newkey { my $hash = shift; eval {$hash->{nms} = "http://nms-cgi.sourceforge.net/"}; is ($@, '', 'No errors'); is ($hash->{nms}, "http://nms-cgi.sourceforge.net/", "New value added"); } # $Storable::DEBUGME = 1; thaw_hash ('Hash with utf8 flag but no utf8 keys', \%R_HASH); if (eval "use Hash::Util; 1") { print "# We have Hash::Util, so test that the restricted hashes in <DATA> are valid\n"; for $Storable::downgrade_restricted (0, 1, undef, "cheese") { my $hash = thaw_hash ('Locked hash', \%R_HASH); test_locked_hash ($hash); $hash = thaw_hash ('Locked hash placeholder', \%R_HASH); test_locked_hash ($hash); test_placeholder ($hash); $hash = thaw_hash ('Locked keys', \%R_HASH); test_restricted_hash ($hash); $hash = thaw_hash ('Locked keys placeholder', \%R_HASH); test_restricted_hash ($hash); test_placeholder ($hash); } } else { print "# We don't have Hash::Util, so test that the restricted hashes downgrade\n"; my $hash = thaw_hash ('Locked hash', \%R_HASH); test_newkey ($hash); $hash = thaw_hash ('Locked hash placeholder', \%R_HASH); test_newkey ($hash); $hash = thaw_hash ('Locked keys', \%R_HASH); test_newkey ($hash); $hash = thaw_hash ('Locked keys placeholder', \%R_HASH); test_newkey ($hash); local $Storable::downgrade_restricted = 0; thaw_fail ('Locked hash', $RESTRICTED_CROAK); thaw_fail ('Locked hash placeholder', $RESTRICTED_CROAK); thaw_fail ('Locked keys', $RESTRICTED_CROAK); thaw_fail ('Locked keys placeholder', $RESTRICTED_CROAK); } print "# We have utf8 scalars, so test that the utf8 scalars in <DATA> are valid\n"; thaw_scalar ('Short 8 bit utf8 data', "\xDF", 1); thaw_scalar ('Long 8 bit utf8 data', "\xDF" x 256, 1); thaw_scalar ('Short 24 bit utf8 data', chr 0xC0FFEE); thaw_scalar ('Long 24 bit utf8 data', chr (0xC0FFEE) x 256); if ($] > 5.007002) { print "# We have utf8 hashes, so test that the utf8 hashes in <DATA> are valid\n"; my $hash = thaw_hash ('Hash with utf8 keys', \%U_HASH); my $a_circumflex = (ord ('A') == 193 ? "\x47" : "\xe5"); for (keys %$hash) { my $l = 0 + /^\w+$/; my $r = 0 + $hash->{$_} =~ /^\w+$/; cmp_ok ($l, '==', $r, sprintf "key length %d", length $_); cmp_ok ($l, '==', $_ eq "ch${a_circumflex}teau" ? 0 : 1); } if (eval "use Hash::Util; 1") { print "# We have Hash::Util, so test that the restricted utf8 hash is valid\n"; my $hash = thaw_hash ('Locked hash with utf8 keys', \%U_HASH); for (keys %$hash) { my $l = 0 + /^\w+$/; my $r = 0 + $hash->{$_} =~ /^\w+$/; cmp_ok ($l, '==', $r, sprintf "key length %d", length $_); cmp_ok ($l, '==', $_ eq "ch${a_circumflex}teau" ? 0 : 1); } test_locked_hash ($hash); } else { print "# We don't have Hash::Util, so test that the utf8 hash downgrades\n"; fail ("You can't get here [perl version $]]. This is a bug in the test. # Please send the output of perl -V to perlbug\@perl.org"); } } else { print "# We don't have utf8 hashes, so test that the utf8 hashes downgrade\n"; thaw_fail ('Hash with utf8 keys', $UTF8_CROAK); thaw_fail ('Locked hash with utf8 keys', $UTF8_CROAK); local $Storable::drop_utf8 = 1; my $expect = thaw $tests{"Hash with utf8 keys for 5.6"}; thaw_hash ('Hash with utf8 keys', $expect); #foreach (keys %$expect) { print "'$_':\t'$expect->{$_}'\n"; } #foreach (keys %$got) { print "'$_':\t'$got->{$_}'\n"; } if (eval "use Hash::Util; 1") { print "# We have Hash::Util, so test that the restricted hashes in <DATA> are valid\n"; fail ("You can't get here [perl version $]]. This is a bug in the test. # Please send the output of perl -V to perlbug\@perl.org"); } else { print "# We don't have Hash::Util, so test that the restricted hashes downgrade\n"; my $hash = thaw_hash ('Locked hash with utf8 keys', $expect); test_newkey ($hash); local $Storable::downgrade_restricted = 0; thaw_fail ('Locked hash with utf8 keys', $RESTRICTED_CROAK); # Which croak comes first is a bit of an implementation issue :-) local $Storable::drop_utf8 = 0; thaw_fail ('Locked hash with utf8 keys', $RESTRICTED_CROAK); } } __END__ # A whole run of 2.x nfreeze data, uuencoded. The "mode bits" are the octal # value of 'A', the "file name" is the test name. Use make_downgrade.pl to # generate these. begin 101 Locked hash 8!049`0````$*!7)U;&5S!`````1P97)L end begin 101 Locked hash placeholder C!049`0````(*!7)U;&5S!`````1P97)L#A0````%<G5L97,` end begin 101 Locked keys 8!049`0````$*!7)U;&5S``````1P97)L end begin 101 Locked keys placeholder C!049`0````(*!7)U;&5S``````1P97)L#A0````%<G5L97,` end begin 101 Short 8 bit utf8 data &!047`L.? end begin 101 Short 8 bit utf8 data as bytes &!04*`L.? end begin 101 Long 8 bit utf8 data M!048```"`,.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.? MPY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_# MG\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.? MPY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_# MG\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.? MPY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_# MG\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.? MPY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_# MG\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.? MPY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_# MG\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.? 8PY_#G\.?PY_#G\.?PY_#G\.?PY_#G\.? end begin 101 Short 24 bit utf8 data )!047!?BPC[^N end begin 101 Short 24 bit utf8 data as bytes )!04*!?BPC[^N end begin 101 Long 24 bit utf8 data M!048```%`/BPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ MOZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N^+"/ ;OZ[XL(^_KOBPC[^N^+"/OZ[XL(^_KOBPC[^N end begin 101 Hash with utf8 flag but no utf8 keys 8!049``````$*!7)U;&5S``````1P97)L end begin 101 Hash with utf8 keys M!049``````0*!F-A<W1L90`````&8V%S=&QE"@=C:.5T96%U``````=C:.5T D96%U%P/EGXX!`````^6?CA<'4V-H;&_#GP(````&4V-H;&_? end begin 101 Locked hash with utf8 keys M!049`0````0*!F-A<W1L900````&8V%S=&QE"@=C:.5T96%U!`````=C:.5T D96%U%P/EGXX%`````^6?CA<'4V-H;&_#GP8````&4V-H;&_? end begin 101 Hash with utf8 keys for 5.6 M!049``````0*!F-A<W1L90`````&8V%S=&QE"@=C:.5T96%U``````=C:.5T D96%U%P/EGXX``````^6?CA<'4V-H;&_#GP(````&4V-H;&_? end begin 301 Locked hash 8!049`0````$*!9FDDX6B!`````27A9F3 end begin 301 Locked hash placeholder C!049`0````(.%`````69I).%H@H%F:23A:($````!)>%F9,` end begin 301 Locked keys 8!049`0````$*!9FDDX6B``````27A9F3 end begin 301 Locked keys placeholder C!049`0````(.%`````69I).%H@H%F:23A:(`````!)>%F9,` end begin 301 Short 8 bit utf8 data &!047`HMS end begin 301 Short 8 bit utf8 data as bytes &!04*`HMS end begin 301 Long 8 bit utf8 data M!048```"`(MSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMS MBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+ M<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMS MBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+ M<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMS MBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+ M<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMS MBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+ M<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMS MBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+ M<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMS 8BW.+<XMSBW.+<XMSBW.+<XMSBW.+<XMS end begin 301 Short 24 bit utf8 data *!047!OM30G-S50`` end begin 301 Short 24 bit utf8 data as bytes *!04*!OM30G-S50`` end begin 301 Long 24 bit utf8 data M!048```&`/M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S M5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S M5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S M5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S M5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S M5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S M5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S M5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S M5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S M5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S M5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S M5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S M5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S M5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S M5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S M5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S M5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M3 M0G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S5?M30G-S -5?M30G-S5?M30G-S50`` end begin 301 Hash with utf8 flag but no utf8 keys 8!049``````$*!9FDDX6B``````27A9F3 end begin 301 Hash with utf8 keys M!049``````0*!X.(1Z.%@:0`````!X.(1Z.%@:0*!H.!HJ.3A0`````&@X&B FHY.%%P3<9')5`0````3<9')5%P?B@XB3EHMS`@````;B@XB3EM\` end begin 301 Locked hash with utf8 keys M!049`0````0*!X.(1Z.%@:0$````!X.(1Z.%@:0*!H.!HJ.3A00````&@X&B FHY.%%P3<9')5!0````3<9')5%P?B@XB3EHMS!@````;B@XB3EM\` end begin 301 Hash with utf8 keys for 5.6 M!049``````0*!H.!HJ.3A0`````&@X&BHY.%"@>#B$>CA8&D``````>#B$>C FA8&D%P?B@XB3EHMS`@````;B@XB3EM\7!-QD<E4`````!-QD<E4` end PK ��[_��R R t/HAS_HOOK.pmnu �[��� package HAS_HOOK; sub STORABLE_thaw { ++$thawed_count; } ++$loaded_count; 1; PK ��[�5�� � t/attach_errors.tnu �[��� #!./perl -w # # Copyright 2005, Adam Kennedy. # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # # Man, blessed.t scared the hell out of me. For a second there I thought # I'd lose Test::More... # This file tests several known-error cases relating to STORABLE_attach, in # which Storable should (correctly) throw errors. sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use Test::More tests => 40; use Storable (); ##################################################################### # Error 1 # # Classes that implement STORABLE_thaw _cannot_ have references # returned by their STORABLE_freeze method. When they do, Storable # should throw an exception # Good Case - should not die { my $goodfreeze = bless {}, 'My::GoodFreeze'; my $frozen = undef; eval { $frozen = Storable::freeze( $goodfreeze ); }; ok( ! $@, 'Storable does not die when STORABLE_freeze does not return references' ); ok( $frozen, 'Storable freezes to a string successfully' ); package My::GoodFreeze; sub STORABLE_freeze { my ($self, $clone) = @_; # Illegally include a reference in this return return (''); } sub STORABLE_attach { my ($class, $clone, $string) = @_; return bless { }, 'My::GoodFreeze'; } } # Error Case - should die on freeze { my $badfreeze = bless {}, 'My::BadFreeze'; eval { Storable::freeze( $badfreeze ); }; ok( $@, 'Storable dies correctly when STORABLE_freeze returns a reference' ); # Check for a unique substring of the error message ok( $@ =~ /cannot return references/, 'Storable dies with the expected error' ); package My::BadFreeze; sub STORABLE_freeze { my ($self, $clone) = @_; # Illegally include a reference in this return return ('', []); } sub STORABLE_attach { my ($class, $clone, $string) = @_; return bless { }, 'My::BadFreeze'; } } ##################################################################### # Error 2 # # If, for some reason, a STORABLE_attach object is accidentally stored # with references, this should be checked and an error should be thrown. # Good Case - should not die { my $goodthaw = bless {}, 'My::GoodThaw'; my $frozen = undef; eval { $frozen = Storable::freeze( $goodthaw ); }; ok( $frozen, 'Storable freezes to a string as expected' ); my $thawed = eval { Storable::thaw( $frozen ); }; isa_ok( $thawed, 'My::GoodThaw' ); is( $thawed->{foo}, 'bar', 'My::GoodThaw thawed correctly as expected' ); package My::GoodThaw; sub STORABLE_freeze { my ($self, $clone) = @_; return (''); } sub STORABLE_attach { my ($class, $clone, $string) = @_; return bless { 'foo' => 'bar' }, 'My::GoodThaw'; } } # Bad Case - should die on thaw { # Create the frozen string normally my $badthaw = bless { }, 'My::BadThaw'; my $frozen = undef; eval { $frozen = Storable::freeze( $badthaw ); }; ok( $frozen, 'BadThaw was frozen with references correctly' ); # Set up the error condition by deleting the normal STORABLE_thaw, # and creating a STORABLE_attach. *My::BadThaw::STORABLE_attach = *My::BadThaw::STORABLE_thaw; *My::BadThaw::STORABLE_attach = *My::BadThaw::STORABLE_thaw; # Suppress a warning delete ${'My::BadThaw::'}{STORABLE_thaw}; # Trigger the error condition my $thawed = undef; eval { $thawed = Storable::thaw( $frozen ); }; ok( $@, 'My::BadThaw object dies when thawing as expected' ); # Check for a snippet from the error message ok( $@ =~ /unexpected references/, 'Dies with the expected error message' ); package My::BadThaw; sub STORABLE_freeze { my ($self, $clone) = @_; return ('', []); } # Start with no STORABLE_attach method so we can get a # frozen object-containing-a-reference into the freeze string. sub STORABLE_thaw { my ($class, $clone, $string) = @_; return bless { 'foo' => 'bar' }, 'My::BadThaw'; } } ##################################################################### # Error 3 # # Die if what is returned by STORABLE_attach is not something of that class # Good Case - should not die { my $goodattach = bless { }, 'My::GoodAttach'; my $frozen = Storable::freeze( $goodattach ); ok( $frozen, 'My::GoodAttach return as expected' ); my $thawed = eval { Storable::thaw( $frozen ); }; isa_ok( $thawed, 'My::GoodAttach' ); is( ref($thawed), 'My::GoodAttach::Subclass', 'The slightly-tricky good "returns a subclass" case returns as expected' ); package My::GoodAttach; sub STORABLE_freeze { my ($self, $cloning) = @_; return (''); } sub STORABLE_attach { my ($class, $cloning, $string) = @_; return bless { }, 'My::GoodAttach::Subclass'; } package My::GoodAttach::Subclass; BEGIN { @ISA = 'My::GoodAttach'; } } # Good case - multiple references to the same object should be attached properly { my $obj = bless { id => 111 }, 'My::GoodAttach::MultipleReferences'; my $arr = [$obj]; push @$arr, $obj; my $frozen = Storable::freeze($arr); ok( $frozen, 'My::GoodAttach return as expected' ); my $thawed = eval { Storable::thaw( $frozen ); }; isa_ok( $thawed->[0], 'My::GoodAttach::MultipleReferences' ); isa_ok( $thawed->[1], 'My::GoodAttach::MultipleReferences' ); is($thawed->[0], $thawed->[1], 'References to the same object are attached properly'); is($thawed->[1]{id}, $obj->{id}, 'Object with multiple references attached properly'); package My::GoodAttach::MultipleReferences; sub STORABLE_freeze { my ($obj) = @_; $obj->{id} } sub STORABLE_attach { my ($class, $cloning, $id) = @_; bless { id => $id }, $class; } } # Bad Cases - die on thaw { my $returnvalue = undef; # Create and freeze the object my $badattach = bless { }, 'My::BadAttach'; my $frozen = Storable::freeze( $badattach ); ok( $frozen, 'BadAttach freezes as expected' ); # Try a number of different return values, all of which # should cause Storable to die. my @badthings = ( undef, '', 1, [], {}, \"foo", (bless { }, 'Foo'), ); foreach ( @badthings ) { $returnvalue = $_; my $thawed = undef; eval { $thawed = Storable::thaw( $frozen ); }; ok( $@, 'BadAttach dies on thaw' ); ok( $@ =~ /STORABLE_attach did not return a My::BadAttach object/, 'BadAttach dies on thaw with the expected error message' ); is( $thawed, undef, 'Double checking $thawed was not set' ); } package My::BadAttach; sub STORABLE_freeze { my ($self, $cloning) = @_; return (''); } sub STORABLE_attach { my ($class, $cloning, $string) = @_; return $returnvalue; } } PK ��[�.�F F t/flags.tnu �[��� #!./perl use Test::More tests => 16; use Storable (); use warnings; use strict; package TEST; sub make { my $pkg = shift; return bless { a => 1, b => 2 }, $pkg; } package TIED_HASH; sub TIEHASH { my $pkg = shift; return bless { a => 1, b => 2 }, $pkg; } sub FETCH { my ($self, $key) = @_; return $self->{$key}; } sub STORE { my ($self, $key, $value) = @_; $self->{$key} = $value; } sub FIRSTKEY { my $self = shift; keys %$self; return each %$self; } sub NEXTKEY { my $self = shift; return each %{$self}; } sub EXISTS { my ($self, $key) = @_; return exists $self->{$key}; } package main; { my $obj = TEST->make; is_deeply($obj, { a => 1, b => 2 }, "object contains correct data"); my $frozen = Storable::freeze($obj); my ($t1, $t2) = Storable::thaw($frozen); { no warnings 'once'; local $Storable::flags = Storable::FLAGS_COMPAT(); $t2 = Storable::thaw($frozen); } is_deeply($t1, $t2, "objects contain matching data"); is(ref $t1, 'TEST', "default object is blessed"); is(ref $t2, 'TEST', "compat object is blessed into correct class"); my $t3 = Storable::thaw($frozen, Storable::FLAGS_COMPAT()); is_deeply($t2, $t3, "objects contain matching data (explicit test)"); is(ref $t3, 'TEST', "compat object is blessed into correct class (explicit test)"); my $t4 = Storable::thaw($frozen, Storable::BLESS_OK()); is_deeply($t2, $t3, "objects contain matching data (explicit test for bless)"); is(ref $t3, 'TEST', "compat object is blessed into correct class (explicit test for bless)"); { no warnings 'once'; local $Storable::flags = Storable::FLAGS_COMPAT(); my $t5 = Storable::thaw($frozen, 0); my $t6 = Storable::thaw($frozen, Storable::TIE_OK()); is_deeply($t1, $t5, "objects contain matching data"); is_deeply($t1, $t6, "objects contain matching data for TIE_OK"); is(ref $t5, 'HASH', "default object is unblessed"); is(ref $t6, 'HASH', "TIE_OK object is unblessed"); } } { tie my %hash, 'TIED_HASH'; ok(tied %hash, "hash is tied"); my $obj = { bow => \%hash }; my $frozen = Storable::freeze($obj); my $t1 = Storable::thaw($frozen, Storable::FLAGS_COMPAT()); my $t2 = eval { Storable::thaw($frozen); }; ok(!$@, "trying to thaw a tied value succeeds"); ok(tied %{$t1->{bow}}, "compat object is tied"); is(ref tied %{$t1->{bow}}, 'TIED_HASH', "compat object is tied into correct class"); } PK ��[��~PT T t/overload.tnu �[��� #!./perl # # Copyright (c) 1995-2000, Raphael Manfredi # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use Storable qw(freeze thaw); $Storable::flags = Storable::FLAGS_COMPAT; use Test::More tests => 19; package OVERLOADED; use overload '""' => sub { $_[0][0] }; package main; $a = bless [77], OVERLOADED; $b = thaw freeze $a; is(ref $b, 'OVERLOADED'); is("$b", "77"); $c = thaw freeze \$a; is(ref $c, 'REF'); is(ref $$c, 'OVERLOADED'); is("$$c", "77"); $d = thaw freeze [$a, $a]; is("$d->[0]", "77"); $d->[0][0]++; is("$d->[1]", "78"); package REF_TO_OVER; sub make { my $self = bless {}, shift; my ($over) = @_; $self->{over} = $over; return $self; } package OVER; use overload '+' => \&plus, '""' => sub { ref $_[0] }; sub plus { return 314; } sub make { my $self = bless {}, shift; my $ref = REF_TO_OVER->make($self); $self->{ref} = $ref; return $self; } package main; $a = OVER->make(); $b = thaw freeze $a; is(ref $b, 'OVER'); is($a + $a, 314); is(ref $b->{ref}, 'REF_TO_OVER'); is("$b->{ref}->{over}", "$b"); is($b + $b, 314); # nfreeze data generated by make_overload.pl my $f = ''; if (ord ('A') == 193) { # EBCDIC. $f = unpack 'u', q{7!084$0S(P>)MUN7%V=/6P<0*!**5EJ8`}; }else { $f = unpack 'u', q{7!084$0Q(05-?3U9%4DQ/040*!'-N;W<`}; } # see note at the end of do_retrieve in Storable.xs about why this test has to # use a reference to an overloaded reference, rather than just a reference. my $t = eval {thaw $f}; print "# $@" if $@; is($@, ""); is(ref ($t), 'REF'); is(ref ($$t), 'HAS_OVERLOAD'); is($$$t, 'snow'); #--- # blessed reference to overloaded object. { my $a = bless [88], 'OVERLOADED'; my $c = thaw freeze bless \$a, 'main'; is(ref $c, 'main'); is(ref $$c, 'OVERLOADED'); is("$$c", "88"); } 1; PK ��["���[ [ t/make_downgrade.plnu �[��� #!/usr/local/bin/perl -w use strict; use 5.007003; use Hash::Util qw(lock_hash unlock_hash lock_keys); use Storable qw(nfreeze); # If this looks like a hack, it's probably because it is :-) sub uuencode_it { my ($data, $name) = @_; my $frozen = nfreeze $data; my $uu = pack 'u', $frozen; printf "begin %3o $name\n", ord 'A'; print $uu; print "\nend\n\n"; } my %hash = (perl=>"rules"); lock_hash %hash; uuencode_it (\%hash, "Locked hash"); unlock_hash %hash; lock_keys %hash, 'perl', 'rules'; lock_hash %hash; uuencode_it (\%hash, "Locked hash placeholder"); unlock_hash %hash; lock_keys %hash, 'perl'; uuencode_it (\%hash, "Locked keys"); unlock_hash %hash; lock_keys %hash, 'perl', 'rules'; uuencode_it (\%hash, "Locked keys placeholder"); unlock_hash %hash; my $utf8 = "\x{DF}\x{100}"; chop $utf8; uuencode_it (\$utf8, "Short 8 bit utf8 data"); my $utf8b = $utf8; utf8::encode ($utf8b); uuencode_it (\$utf8b, "Short 8 bit utf8 data as bytes"); $utf8 x= 256; uuencode_it (\$utf8, "Long 8 bit utf8 data"); $utf8 = "\x{C0FFEE}"; uuencode_it (\$utf8, "Short 24 bit utf8 data"); $utf8b = $utf8; utf8::encode ($utf8b); uuencode_it (\$utf8b, "Short 24 bit utf8 data as bytes"); $utf8 x= 256; uuencode_it (\$utf8, "Long 24 bit utf8 data"); # Hash which has the utf8 bit set, but no longer has any utf8 keys my %uhash = ("\x{100}", "gone", "perl", "rules"); delete $uhash{"\x{100}"}; # use Devel::Peek; Dump \%uhash; uuencode_it (\%uhash, "Hash with utf8 flag but no utf8 keys"); $utf8 = "Schlo\xdf" . chr 256; chop $utf8; my $a_circumflex = (ord ('A') == 193 ? "\x47" : "\xe5"); %uhash = (map {$_, $_} 'castle', "ch${a_circumflex}teau", $utf8, "\x{57CE}"); uuencode_it (\%uhash, "Hash with utf8 keys"); lock_hash %uhash; uuencode_it (\%uhash, "Locked hash with utf8 keys"); my %pre58; while (my ($key, $val) = each %uhash) { # hash keys are always stored downgraded to bytes if possible, with a flag # to say "promote back to utf8" # Whereas scalars are stored as is. utf8::encode ($key) if ord $key > 256; $pre58{$key} = $val; } uuencode_it (\%pre58, "Hash with utf8 keys for 5.6"); PK ��[��@�� � t/tied_store.tnu �[��� #!./perl sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use Storable (); use Test::More tests => 3; our $f; package TIED_HASH; sub TIEHASH { bless({}, $_[0]) } sub STORE { $f = Storable::freeze(\$_[2]); 1; } package TIED_ARRAY; sub TIEARRAY { bless({}, $_[0]) } sub STORE { $f = Storable::freeze(\$_[2]); 1; } package TIED_SCALAR; sub TIESCALAR { bless({}, $_[0]) } sub STORE { $f = Storable::freeze(\$_[1]); 1; } package main; my($s, @a, %h); tie $s, "TIED_SCALAR"; tie @a, "TIED_ARRAY"; tie %h, "TIED_HASH"; $f = undef; $s = 111; is $f, Storable::freeze(\111); $f = undef; $a[3] = 222; is $f, Storable::freeze(\222); $f = undef; $h{foo} = 333; is $f, Storable::freeze(\333); 1; PK ��[���y y t/HAS_ATTACH.pmnu �[��� package HAS_ATTACH; sub STORABLE_attach { ++$attached_count; return bless [], 'HAS_ATTACH'; } ++$loaded_count; 1; PK ��[fSn1� � t/croak.tnu �[��� #!./perl -w # Please keep this test this simple. (ie just one test.) # There's some sort of not-croaking properly problem in Storable when built # with 5.005_03. This test shows it up, whereas malice.t does not. # In particular, don't use Test; as this covers up the problem. sub BEGIN { if ($ENV{PERL_CORE}) { require Config; import Config; %Config=%Config if 0; # cease -w if ($Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } } use strict; BEGIN { die "Oi! No! Don't change this test so that Carp is used before Storable" if defined &Carp::carp; } use Storable qw(freeze thaw); print "1..2\n"; for my $test (1,2) { eval {thaw "\xFF\xFF"}; if ($@ =~ /Storable binary image v127.255 more recent than I am \(v2\.\d+\)/) { print "ok $test\n"; } else { chomp $@; print "not ok $test # Expected a meaningful croak. Got '$@'\n"; } } PK ��[�4��� � t/tied_hook.tnu �[��� #!./perl # # Copyright (c) 1995-2000, Raphael Manfredi # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } require 'st-dump.pl'; } use Storable qw(freeze thaw); $Storable::flags = Storable::FLAGS_COMPAT; use Test::More tests => 28; ($scalar_fetch, $array_fetch, $hash_fetch) = (0, 0, 0); package TIED_HASH; sub TIEHASH { my $self = bless {}, shift; return $self; } sub FETCH { my $self = shift; my ($key) = @_; $main::hash_fetch++; return $self->{$key}; } sub STORE { my $self = shift; my ($key, $value) = @_; $self->{$key} = $value; } sub FIRSTKEY { my $self = shift; scalar keys %{$self}; return each %{$self}; } sub NEXTKEY { my $self = shift; return each %{$self}; } sub STORABLE_freeze { my $self = shift; $main::hash_hook1++; return join(":", keys %$self) . ";" . join(":", values %$self); } sub STORABLE_thaw { my ($self, $cloning, $frozen) = @_; my ($keys, $values) = split(/;/, $frozen); my @keys = split(/:/, $keys); my @values = split(/:/, $values); for (my $i = 0; $i < @keys; $i++) { $self->{$keys[$i]} = $values[$i]; } $main::hash_hook2++; } package TIED_ARRAY; sub TIEARRAY { my $self = bless [], shift; return $self; } sub FETCH { my $self = shift; my ($idx) = @_; $main::array_fetch++; return $self->[$idx]; } sub STORE { my $self = shift; my ($idx, $value) = @_; $self->[$idx] = $value; } sub FETCHSIZE { my $self = shift; return @{$self}; } sub STORABLE_freeze { my $self = shift; $main::array_hook1++; return join(":", @$self); } sub STORABLE_thaw { my ($self, $cloning, $frozen) = @_; @$self = split(/:/, $frozen); $main::array_hook2++; } package TIED_SCALAR; sub TIESCALAR { my $scalar; my $self = bless \$scalar, shift; return $self; } sub FETCH { my $self = shift; $main::scalar_fetch++; return $$self; } sub STORE { my $self = shift; my ($value) = @_; $$self = $value; } sub STORABLE_freeze { my $self = shift; $main::scalar_hook1++; return $$self; } sub STORABLE_thaw { my ($self, $cloning, $frozen) = @_; $$self = $frozen; $main::scalar_hook2++; } package main; $a = 'toto'; $b = \$a; $c = tie %hash, TIED_HASH; $d = tie @array, TIED_ARRAY; tie $scalar, TIED_SCALAR; $scalar = 'foo'; $hash{'attribute'} = 'plain value'; $array[0] = \$scalar; $array[1] = $c; $array[2] = \@array; $array[3] = "plaine scalaire"; @tied = (\$scalar, \@array, \%hash); %a = ('key', 'value', 1, 0, $a, $b, 'cvar', \$a, 'scalarref', \$scalar); @a = ('first', 3, -4, -3.14159, 456, 4.5, $d, \$d, $b, \$a, $a, $c, \$c, \%a, \@array, \%hash, \@tied); my $f = freeze(\@a); isnt($f, undef); $dumped = &dump(\@a); isnt($dumped, undef); $root = thaw($f); isnt($root, undef); $got = &dump($root); isnt($got, undef); isnt($got, $dumped); # our hooks did not handle refs in array $g = freeze($root); is(length $f, length $g); # Ensure the tied items in the retrieved image work @old = ($scalar_fetch, $array_fetch, $hash_fetch); @tied = ($tscalar, $tarray, $thash) = @{$root->[$#{$root}]}; @type = qw(SCALAR ARRAY HASH); is(ref tied $$tscalar, 'TIED_SCALAR'); is(ref tied @$tarray, 'TIED_ARRAY'); is(ref tied %$thash, 'TIED_HASH'); @new = ($$tscalar, $tarray->[0], $thash->{'attribute'}); @new = ($scalar_fetch, $array_fetch, $hash_fetch); # Tests 10..15 for ($i = 0; $i < @new; $i++) { is($new[$i], $old[$i] + 1); # Tests 10,12,14 is(ref $tied[$i], $type[$i]); # Tests 11,13,15 } is($$tscalar, 'foo'); is($tarray->[3], 'plaine scalaire'); is($thash->{'attribute'}, 'plain value'); # Ensure hooks were called is($scalar_hook1, 2); is($scalar_hook2, 1); is($array_hook1, 2); is($array_hook2, 1); is($hash_hook1, 2); is($hash_hook2, 1); # # And now for the "blessed ref to tied hash" with "store hook" test... # my $bc = bless \%hash, 'FOO'; # FOO does not exist -> no hook my $bx = thaw freeze $bc; is(ref $bx, 'FOO'); my $old_hash_fetch = $hash_fetch; my $v = $bx->{attribute}; is($hash_fetch, $old_hash_fetch + 1, 'Still tied'); package TIED_HASH_REF; sub STORABLE_freeze { my ($self, $cloning) = @_; return if $cloning; return('ref lost'); } sub STORABLE_thaw { my ($self, $cloning, $data) = @_; return if $cloning; } package main; $bc = bless \%hash, 'TIED_HASH_REF'; $bx = thaw freeze $bc; is(ref $bx, 'TIED_HASH_REF'); $old_hash_fetch = $hash_fetch; $v = $bx->{attribute}; is($hash_fetch, $old_hash_fetch + 1, 'Still tied'); PK ��[I�� � t/HAS_OVERLOAD.pmnu �[��� package HAS_OVERLOAD; use overload '""' => sub { ${$_[0]} }, fallback => 1; sub make { my $package = shift; my $value = shift; bless \$value, $package; } ++$loaded_count; 1; PK ��[Nڥz t/lock.tnu �[��� #!./perl # # Copyright (c) 1995-2000, Raphael Manfredi # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } require 'st-dump.pl'; } use Test::More; use Storable qw(lock_store lock_retrieve); unless (&Storable::CAN_FLOCK) { plan(skip_all => "fcntl/flock emulation broken on this platform"); } plan(tests => 5); @a = ('first', undef, 3, -4, -3.14159, 456, 4.5); # # We're just ensuring things work, we're not validating locking. # isnt(lock_store(\@a, "store$$"), undef); my $dumped = &dump(\@a); isnt($dumped, undef); $root = lock_retrieve("store$$"); is(ref $root, 'ARRAY'); is(scalar @a, scalar @$root); is(&dump($root), $dumped); END { 1 while unlink "store$$" } PK ��[����� � t/restrict.tnu �[��� #!./perl -w # # Copyright 2002, Larry Wall. # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; if ($ENV{PERL_CORE}){ require Config; if ($Config::Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } else { if (!eval "require Hash::Util") { if ($@ =~ /Can\'t locate Hash\/Util\.pm in \@INC/s) { print "1..0 # Skip: No Hash::Util:\n"; exit 0; } else { die; } } unshift @INC, 't'; } } use Storable qw(dclone freeze thaw); use Hash::Util qw(lock_hash unlock_value lock_keys); use Config; $Storable::DEBUGME = $ENV{STORABLE_DEBUGME}; use Test::More tests => (!$Storable::DEBUGME && $Config{usecperl} ? 105 : 304); my %hash = (question => '?', answer => 42, extra => 'junk', undef => undef); lock_hash %hash; unlock_value %hash, 'answer'; unlock_value %hash, 'extra'; delete $hash{'extra'}; my $test; package Restrict_Test; sub me_second { return (undef, $_[0]); } package main; sub freeze_thaw { my $temp = freeze $_[0]; return thaw $temp; } sub testit { my $hash = shift; my $cloner = shift; my $copy = &$cloner($hash); my @in_keys = sort keys %$hash; my @out_keys = sort keys %$copy; is("@in_keys", "@out_keys", "keys match after deep clone"); # $copy = $hash; # used in initial debug of the tests is(Internals::SvREADONLY(%$copy), 1, "cloned hash restricted?"); is(Internals::SvREADONLY($copy->{question}), 1, "key 'question' not locked in copy?"); is(Internals::SvREADONLY($copy->{answer}), '', "key 'answer' not locked in copy?"); eval { $copy->{extra} = 15 } ; is($@, '', "Can assign to reserved key 'extra'?"); eval { $copy->{nono} = 7 } ; isnt($@, '', "Can not assign to invalid key 'nono'?"); is(exists $copy->{undef}, 1, "key 'undef' exists"); is($copy->{undef}, undef, "value for key 'undef' is undefined"); } for $Storable::canonical (0, 1) { for my $cloner (\&dclone, \&freeze_thaw) { print "# \$Storable::canonical = $Storable::canonical\n"; testit (\%hash, $cloner); my $object = \%hash; # bless {}, "Restrict_Test"; my %hash2; $hash2{"k$_"} = "v$_" for 0..16; lock_hash %hash2; for (0..16) { unlock_value %hash2, "k$_"; delete $hash2{"k$_"}; } my $copy = &$cloner(\%hash2); for (0..16) { my $k = "k$_"; eval { $copy->{$k} = undef } ; is($@, '', "Can assign to reserved key '$k'?"); } my %hv; $hv{a} = __PACKAGE__; lock_keys %hv; my $hv2 = &$cloner(\%hv); ok eval { $$hv2{a} = 70 }, 'COWs do not become read-only'; } } # [perl #73972] # broken again with cperl PERL_PERTURB_KEYS_TOP. SKIP: { skip "TODO restricted Storable hashes broken with PERL_PERTURB_KEYS_TOP", 1 if !$Storable::DEBUGME && $Config{usecperl}; for my $n (1..100) { my @keys = map { "FOO$_" } (1..$n); my $hash1 = {}; lock_keys(%$hash1, @keys); my $hash2 = dclone($hash1); my $success; $success = eval { $hash2->{$_} = 'test' for @keys; 1 }; my $err = $@; ok($success, "can store in all of the $n restricted slots") || diag("failed with $@"); $success = !eval { $hash2->{a} = 'test'; 1 }; ok($success, "the hash is still restricted"); } } PK ��[^�g� � t/attach_singleton.tnu �[��� #!./perl -w # # Copyright 2005, Adam Kennedy. # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # # Tests freezing/thawing structures containing Singleton objects, # which should see both structs pointing to the same object. sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use Test::More tests => 16; use Storable (); # Get the singleton my $object = My::Singleton->new; isa_ok( $object, 'My::Singleton' ); # Confirm (for the record) that the class is actually a Singleton my $object2 = My::Singleton->new; isa_ok( $object2, 'My::Singleton' ); is( "$object", "$object2", 'Class is a singleton' ); ############ # Main Tests my $struct = [ 1, $object, 3 ]; # Freeze the struct my $frozen = Storable::freeze( $struct ); ok( (defined($frozen) and ! ref($frozen) and length($frozen)), 'freeze returns a string' ); # Thaw the struct my $thawed = Storable::thaw( $frozen ); # Now it should look exactly like the original is_deeply( $struct, $thawed, 'Struct superficially looks like the original' ); # ... EXCEPT that the Singleton should be the same instance of the object is( "$struct->[1]", "$thawed->[1]", 'Singleton thaws correctly' ); # We can also test this empirically $struct->[1]->{value} = 'Goodbye cruel world!'; is_deeply( $struct, $thawed, 'Empiric testing confirms correct behaviour' ); $struct = [ $object, $object ]; $frozen = Storable::freeze($struct); $thawed = Storable::thaw($frozen); is("$thawed->[0]", "$thawed->[1]", "Multiple Singletons thaw correctly"); # End Tests ########### package My::Singleton; my $SINGLETON = undef; sub new { $SINGLETON or $SINGLETON = bless { value => 'Hello World!' }, $_[0]; } sub STORABLE_freeze { my $self = shift; # We don't actually need to return anything, but provide a null string # to avoid the null-list-return behaviour. return ('foo'); } sub STORABLE_attach { my ($class, $clone, $string) = @_; Test::More::ok( ! ref $class, 'STORABLE_attach passed class, and not an object' ); Test::More::is( $class, 'My::Singleton', 'STORABLE_attach is passed the correct class name' ); Test::More::is( $clone, 0, 'We are not in a dclone' ); Test::More::is( $string, 'foo', 'STORABLE_attach gets the string back' ); # Get the Singleton object and return it return $class->new; } PK ��[��V4� � t/sig_die.tnu �[��� #!./perl # # Copyright (c) 2002 Slaven Rezic # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use strict; use Test::More tests => 1; my @warns; $SIG{__WARN__} = sub { push @warns, shift }; $SIG{__DIE__} = sub { require Carp; warn Carp::longmess(); warn "Evil die!" }; require Storable; Storable::dclone({foo => "bar"}); is(join("", @warns), "", "__DIE__ is not evil here"); PK ��["�� t/CVE-2015-1592.tnu �[��� #!/usr/bin/perl use strict; use warnings; use Test::More; use Storable qw(freeze thaw); plan tests => 1; # this original worked with the packaged exploit, but that # triggers virus scanners, so test for the behaviour instead my $x = bless \(my $y = "mt-config.cgi"), "CGITempFile"; my $frozen = freeze($x); { my $warnings = ''; local $SIG{__WARN__} = sub { $warnings .= "@_" }; thaw($frozen); like($warnings, qr/SECURITY: Movable-Type CVE-2015-1592 Storable metasploit attack/, 'Detect CVE-2015-1592'); } PK ��[�-��4 �4 t/file_magic.tnu �[��� #!perl -w BEGIN { unshift @INC, 't/compat' if $] < 5.006002; }; use strict; use Test::More; use Storable qw(store nstore); use Config qw(%Config); # The @tests array below was create by the following program my $dummy = <<'EOT'; use Storable; use Data::Dump qw(dump); print "my \@tests = (\n"; for my $f (<data_*>) { print " [\n"; print " " . dump(substr(`cat $f`, 0, 32) . "...") , ",\n"; my $x = dump(Storable::file_magic($f)); $x =~ s/^/ /gm; print "$x,\n"; print " ],\n"; } print ");\n"; EOT my @tests = ( [ "perl-store\x041234\4\4\4\xD4\xC2\32\b\3\13\0\0\0v\b\xC5\32\b...", { byteorder => 1234, file => "data_perl-5.006001_i686-linux-thread-multi_Storable-0.1.le32", hdrsize => 18, intsize => 4, longsize => 4, netorder => 0, ptrsize => 4, version => -1, version_nv => -1, }, ], [ "perl-store\0\x041234\4\4\4\x8Co\34\b\3\13\0\0\0v\x94v\34...", { byteorder => 1234, file => "data_perl-5.006001_i686-linux-thread-multi_Storable-0.4_07.le32", hdrsize => 19, intsize => 4, longsize => 4, major => 0, netorder => 0, ptrsize => 4, version => 0, version_nv => 0, }, ], [ "perl-store\1\x8Co\34\b\3\0\0\0\13v\x94v\34\b\1\0\0\4\0\0\0...", { file => "data_perl-5.006001_i686-linux-thread-multi_Storable-0.4_07.neutral", hdrsize => 11, major => 0, netorder => 1, version => 0, version_nv => 0, }, ], [ "pst0\2\x041234\4\4\4\3\13\0\0\0\1\0\4\0\0\0\0\0\0\0\0\0\0\0...", { byteorder => 1234, file => "data_perl-5.006001_i686-linux-thread-multi_Storable-0.604.le32", hdrsize => 13, intsize => 4, longsize => 4, major => 1, netorder => 0, ptrsize => 4, version => 1, version_nv => 1, }, ], [ "pst0\3\3\0\0\0\13\1\0\0\4\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0...", { file => "data_perl-5.006001_i686-linux-thread-multi_Storable-0.604.neutral", hdrsize => 5, major => 1, netorder => 1, version => 1, version_nv => 1, }, ], [ "pst0\4\0\x041234\4\4\4\3\13\0\0\0\1\0\4\0\0\0\0\0\0\0\0\0\0...", { byteorder => 1234, file => "data_perl-5.006001_i686-linux-thread-multi_Storable-0.700.le32", hdrsize => 14, intsize => 4, longsize => 4, major => 2, minor => 0, netorder => 0, ptrsize => 4, version => "2.0", version_nv => "2.000", }, ], [ "pst0\5\0\3\0\0\0\13\1\0\0\4\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0...", { file => "data_perl-5.006001_i686-linux-thread-multi_Storable-0.700.neutral", hdrsize => 6, major => 2, minor => 0, netorder => 1, version => "2.0", version_nv => "2.000", }, ], [ "pst0\4\4\x041234\4\4\4\x08\3\13\0\0\0\1\0\4\0\0\0\0\0\0\0\0\0...", { byteorder => 1234, file => "data_perl-5.006001_i686-linux-thread-multi_Storable-1.012.le32", hdrsize => 15, intsize => 4, longsize => 4, major => 2, minor => 4, netorder => 0, nvsize => 8, ptrsize => 4, version => "2.4", version_nv => "2.004", }, ], [ "pst0\4\3\x044321\4\4\4\x08\3\0\0\0\13\1\0\0\4\0\0\0\0\0\0\0\0...", { byteorder => 4321, file => "data_perl-5.006001_IA64.ARCHREV_0-thread-multi_Storable-1.006.be32", hdrsize => 15, intsize => 4, longsize => 4, major => 2, minor => 3, netorder => 0, nvsize => 8, ptrsize => 4, version => "2.3", version_nv => "2.003", }, ], [ "pst0\5\3\3\0\0\0\13\1\0\0\4\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0...", { file => "data_perl-5.006001_IA64.ARCHREV_0-thread-multi_Storable-1.006.neutral", hdrsize => 6, major => 2, minor => 3, netorder => 1, version => "2.3", version_nv => "2.003", }, ], [ "pst0\4\4\x044321\4\4\4\x08\3\0\0\0\13\1\0\0\4\0\0\0\0\0\0\0\0...", { byteorder => 4321, file => "data_perl-5.006001_IA64.ARCHREV_0-thread-multi_Storable-1.012.be32", hdrsize => 15, intsize => 4, longsize => 4, major => 2, minor => 4, netorder => 0, nvsize => 8, ptrsize => 4, version => "2.4", version_nv => "2.004", }, ], [ "pst0\5\4\3\0\0\0\13\1\0\0\4\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0...", { file => "data_perl-5.006001_IA64.ARCHREV_0-thread-multi_Storable-1.012.neutral", hdrsize => 6, major => 2, minor => 4, netorder => 1, version => "2.4", version_nv => "2.004", }, ], [ "pst0\4\6\x044321\4\4\4\x08\3\0\0\0\13\n\n4294967296...", { byteorder => 4321, file => "data_perl-5.008001_darwin-thread-multi-2level_Storable-2.08.be32", hdrsize => 15, intsize => 4, longsize => 4, major => 2, minor => 6, netorder => 0, nvsize => 8, ptrsize => 4, version => "2.6", version_nv => "2.006", }, ], [ "pst0\5\6\3\0\0\0\13\n\n4294967296\0\0\0\bfour_...", { file => "data_perl-5.008001_darwin-thread-multi-2level_Storable-2.08.neutral", hdrsize => 6, major => 2, minor => 6, netorder => 1, version => "2.6", version_nv => "2.006", }, ], [ "pst0\4\6\x044321\4\4\4\x08\3\0\0\0\13\4\3\0\0\0\0\0\0\0\nem...", { byteorder => 4321, file => "data_perl-5.008003_PA-RISC1.1-thread-multi_Storable-2.09.be32", hdrsize => 15, intsize => 4, longsize => 4, major => 2, minor => 6, netorder => 0, nvsize => 8, ptrsize => 4, version => "2.6", version_nv => "2.006", }, ], [ "pst0\5\6\3\0\0\0\13\4\3\0\0\0\0\0\0\0\nempty_hash\n...", { file => "data_perl-5.008003_PA-RISC1.1-thread-multi_Storable-2.09.neutral", hdrsize => 6, major => 2, minor => 6, netorder => 1, version => "2.6", version_nv => "2.006", }, ], [ "pst0\4\6\x0812345678\4\4\4\x08\3\13\0\0\0\4\3\0\0\0\0\n\0...", { byteorder => 12_345_678, file => "data_perl-5.008004_i86pc-solaris-64int_Storable-2.12.le64", hdrsize => 19, intsize => 4, longsize => 4, major => 2, minor => 6, netorder => 0, nvsize => 8, ptrsize => 4, version => "2.6", version_nv => "2.006", }, ], [ "pst0\4\6\x041234\4\4\4\x08\3\13\0\0\0\4\3\0\0\0\0\n\0\0\0em...", { byteorder => 1234, file => "data_perl-5.008006_i686-linux-thread-multi_Storable-2.13.le32", hdrsize => 15, intsize => 4, longsize => 4, major => 2, minor => 6, netorder => 0, nvsize => 8, ptrsize => 4, version => "2.6", version_nv => "2.006", }, ], [ "pst0\4\6\x0887654321\4\x08\x08\x08\3\0\0\0\13\4\3\0\0\0\0\0\0...", { byteorder => 87_654_321, file => "data_perl-5.008007_IA64.ARCHREV_0-thread-multi-LP64_Storable-2.13.be64", hdrsize => 19, intsize => 4, longsize => 8, major => 2, minor => 6, netorder => 0, nvsize => 8, ptrsize => 8, version => "2.6", version_nv => "2.006", }, ], [ "pst0\4\x07\x0812345678\4\x08\x08\x08\3\13\0\0\0\4\3\0\0\0\0\n\0...", { byteorder => 12_345_678, file => "data_perl-5.008007_x86-solaris-thread-multi-64_Storable-2.15.le64", hdrsize => 19, intsize => 4, longsize => 8, major => 2, minor => 7, netorder => 0, nvsize => 8, ptrsize => 8, version => "2.7", version_nv => "2.007", }, ], [ "pst0\5\x07\3\0\0\0\13\4\3\0\0\0\0\0\0\0\nempty_hash\n...", { file => "data_perl-5.008007_x86-solaris-thread-multi-64_Storable-2.15.neutral", hdrsize => 6, major => 2, minor => 7, netorder => 1, version => "2.7", version_nv => "2.007", }, ], [ "pst0\4\5\x041234\4\4\4\x08\3\13\0\0\0\4\3\0\0\0\0\n\0\0\0em...", { byteorder => 1234, file => "data_perl-5.008_i686-linux-thread-multi_Storable-2.04.le32", hdrsize => 15, intsize => 4, longsize => 4, major => 2, minor => 5, netorder => 0, nvsize => 8, ptrsize => 4, version => "2.5", version_nv => "2.005", }, ], [ "pst0\5\5\3\0\0\0\13\4\3\0\0\0\0\0\0\0\nempty_hash\n...", { file => "data_perl-5.008_i686-linux-thread-multi_Storable-2.04.neutral", hdrsize => 6, major => 2, minor => 5, netorder => 1, version => "2.5", version_nv => "2.005", }, ], [ "pst0\4\x07\x041234\4\4\4\x08\3\13\0\0\0\4\3\0\0\0\0\n\0\0\0em...", { byteorder => 1234, file => "data_perl-5.009003_i686-linux_Storable-2.15.le32", hdrsize => 15, intsize => 4, longsize => 4, major => 2, minor => 7, netorder => 0, nvsize => 8, ptrsize => 4, version => "2.7", version_nv => "2.007", }, ], ); plan tests => 31 + 2 * @tests; my $file = "xx-$$.pst"; is(eval { Storable::file_magic($file) }, undef, "empty file give undef"); like($@, qq{/^Can't open '\Q$file\E':/}, "...and croaks"); is(Storable::file_magic(__FILE__), undef, "not an image"); store({}, $file); { my $info = Storable::file_magic($file); unlink($file); ok($info, "got info"); is($info->{file}, $file, "file set"); is($info->{hdrsize}, 11 + length($Config{byteorder}), "hdrsize"); like($info->{version}, q{/^2\.\d+$/}, "sane version"); is($info->{version_nv}, Storable::BIN_WRITE_VERSION_NV, "version_nv match"); is($info->{major}, 2, "sane major"); ok($info->{minor}, "have minor"); ok($info->{minor} >= Storable::BIN_WRITE_MINOR, "large enough minor"); ok(!$info->{netorder}, "no netorder"); my %attrs = ( nvsize => 5.006, ptrsize => 5.005, map {$_ => 5.004} qw(byteorder intsize longsize) ); for my $attr (keys %attrs) { SKIP: { skip "attribute $attr not available on this version of Perl", 1 if $attrs{$attr} > $]; is($info->{$attr}, $Config{$attr}, "$attr match Config"); } } } nstore({}, $file); { my $info = Storable::file_magic($file); unlink($file); ok($info, "got info"); is($info->{file}, $file, "file set"); is($info->{hdrsize}, 6, "hdrsize"); like($info->{version}, q{/^2\.\d+$/}, "sane version"); is($info->{version_nv}, Storable::BIN_WRITE_VERSION_NV, "version_nv match"); is($info->{major}, 2, "sane major"); ok($info->{minor}, "have minor"); ok($info->{minor} >= Storable::BIN_WRITE_MINOR, "large enough minor"); ok($info->{netorder}, "no netorder"); for (qw(byteorder intsize longsize ptrsize nvsize)) { ok(!exists $info->{$_}, "no $_"); } } for my $test (@tests) { my($data, $expected) = @$test; open(FH, '>', $file) || die "Can't create $file: $!"; binmode(FH); print FH $data; close(FH) || die "Can't write $file: $!"; my $name = $expected->{file}; $expected->{file} = $file; my $info = Storable::file_magic($file); unlink($file); is_deeply($info, $expected, "file_magic $name"); $expected->{file} = 1; is_deeply(Storable::read_magic($data), $expected, "read magic $name"); } PK ��[ y|8 8 t/freeze.tnu �[��� #!./perl # # Copyright (c) 1995-2000, Raphael Manfredi # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } require 'st-dump.pl'; } use Storable qw(freeze nfreeze thaw); $Storable::flags = Storable::FLAGS_COMPAT; use Test::More tests => 21; $a = 'toto'; $b = \$a; $c = bless {}, CLASS; $c->{attribute} = $b; $d = {}; $e = []; $d->{'a'} = $e; $e->[0] = $d; %a = ('key', 'value', 1, 0, $a, $b, 'cvar', \$c); @a = ('first', undef, 3, -4, -3.14159, 456, 4.5, $d, \$d, \$e, $e, $b, \$a, $a, $c, \$c, \%a); my $f1 = freeze(\@a); isnt($f1, undef); $dumped = &dump(\@a); isnt($dumped, undef); $root = thaw($f1); isnt($root, undef); $got = &dump($root); isnt($got, undef); is($got, $dumped); package FOO; @ISA = qw(Storable); sub make { my $self = bless {}; $self->{key} = \%main::a; return $self; }; package main; $foo = FOO->make; my $f2 = $foo->freeze; isnt($f2, undef); my $f3 = $foo->nfreeze; isnt($f3, undef); $root3 = thaw($f3); isnt($root3, undef); is(&dump($foo), &dump($root3)); $root = thaw($f2); is(&dump($foo), &dump($root)); is(&dump($root3), &dump($root)); $other = freeze($root); is(length$other, length $f2); $root2 = thaw($other); is(&dump($root2), &dump($root)); $VAR1 = [ 'method', 1, 'prepare', 'SELECT table_name, table_owner, num_rows FROM iitables where table_owner != \'$ingres\' and table_owner != \'DBA\'' ]; $x = nfreeze($VAR1); $VAR2 = thaw($x); is($VAR2->[3], $VAR1->[3]); # Test the workaround for LVALUE bug in perl 5.004_04 -- from Gisle Aas sub foo { $_[0] = 1 } $foo = []; foo($foo->[1]); eval { freeze($foo) }; is($@, ''); # Test cleanup bug found by Claudio Garcia -- RAM, 08/06/2001 my $thaw_me = 'asdasdasdasd'; eval { my $thawed = thaw $thaw_me; }; isnt($@, ''); my %to_be_frozen = (foo => 'bar'); my $frozen; eval { $frozen = freeze \%to_be_frozen; }; is($@, ''); freeze {}; eval { thaw $thaw_me }; eval { $frozen = freeze { foo => {} } }; is($@, ''); thaw $frozen; # used to segfault here pass("Didn't segfault"); SKIP: { my (@a, @b); eval ' $a = []; $#$a = 2; $a->[1] = undef; $b = thaw freeze $a; @a = map { ~~ exists $a->[$_] } 0 .. $#$a; @b = map { ~~ exists $b->[$_] } 0 .. $#$b; '; is($@, ''); is("@a", "@b"); } PK ��[���c� � t/compat01.tnu �[��� #!perl -w BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } use Config; if ($Config{byteorder} ne "1234") { print "1..0 # Skip: Test only works for 32 bit little-ending machines\n"; exit 0; } } use strict; use Storable qw(retrieve); use Test::More; my $file = "xx-$$.pst"; my @dumps = ( # some sample dumps of the hash { one => 1 } "perl-store\x041234\4\4\4\x94y\22\b\3\1\0\0\0vxz\22\b\1\1\0\0\x001Xk\3\0\0\0oneX", # 0.1 "perl-store\0\x041234\4\4\4\x94y\22\b\3\1\0\0\0vxz\22\b\b\x81Xk\3\0\0\0oneX", # 0.4@7 ); plan(tests => 3 * @dumps); my $testno; for my $dump (@dumps) { $testno++; open(FH, '>', $file) || die "Can't create $file: $!"; binmode(FH); print FH $dump; close(FH) || die "Can't write $file: $!"; my $data = eval { retrieve($file) }; is($@, '', "No errors for $file"); is(ref $data, 'HASH', "Got HASH for $file"); is($data->{one}, 1, "Got data for $file"); unlink($file); } PK ��[-��h h t/st-dump.plnu �[��� # # Copyright (c) 1995-2000, Raphael Manfredi # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # package dump; use Carp; %dump = ( 'SCALAR' => 'dump_scalar', 'LVALUE' => 'dump_scalar', 'ARRAY' => 'dump_array', 'HASH' => 'dump_hash', 'REF' => 'dump_ref', ); # Given an object, dump its transitive data closure sub main::dump { my ($object) = @_; croak "Not a reference!" unless ref($object); local %dumped; local %object; local $count = 0; local $dumped = ''; &recursive_dump($object, 1); return $dumped; } # This is the root recursive dumping routine that may indirectly be # called by one of the routine it calls... # The link parameter is set to false when the reference passed to # the routine is an internal temporary variable, implying the object's # address is not to be dumped in the %dumped table since it's not a # user-visible object. sub recursive_dump { my ($object, $link) = @_; # Get something like SCALAR(0x...) or TYPE=SCALAR(0x...). # Then extract the bless, ref and address parts of that string. my $what = "$object"; # Stringify my ($bless, $ref, $addr) = $what =~ /^(\w+)=(\w+)\((0x.*)\)$/; ($ref, $addr) = $what =~ /^(\w+)\((0x.*)\)$/ unless $bless; # Special case for references to references. When stringified, # they appear as being scalars. However, ref() correctly pinpoints # them as being references indirections. And that's it. $ref = 'REF' if ref($object) eq 'REF'; # Make sure the object has not been already dumped before. # We don't want to duplicate data. Retrieval will know how to # relink from the previously seen object. if ($link && $dumped{$addr}++) { my $num = $object{$addr}; $dumped .= "OBJECT #$num seen\n"; return; } my $objcount = $count++; $object{$addr} = $objcount; # Call the appropriate dumping routine based on the reference type. # If the referenced was blessed, we bless it once the object is dumped. # The retrieval code will perform the same on the last object retrieved. croak "Unknown simple type '$ref'" unless defined $dump{$ref}; &{$dump{$ref}}($object); # Dump object &bless($bless) if $bless; # Mark it as blessed, if necessary $dumped .= "OBJECT $objcount\n"; } # Indicate that current object is blessed sub bless { my ($class) = @_; $dumped .= "BLESS $class\n"; } # Dump single scalar sub dump_scalar { my ($sref) = @_; my $scalar = $$sref; unless (defined $scalar) { $dumped .= "UNDEF\n"; return; } my $len = length($scalar); $dumped .= "SCALAR len=$len $scalar\n"; } # Dump array sub dump_array { my ($aref) = @_; my $items = 0 + @{$aref}; $dumped .= "ARRAY items=$items\n"; foreach $item (@{$aref}) { unless (defined $item) { $dumped .= 'ITEM_UNDEF' . "\n"; next; } $dumped .= 'ITEM '; &recursive_dump(\$item, 1); } } # Dump hash table sub dump_hash { my ($href) = @_; my $items = scalar(keys %{$href}); $dumped .= "HASH items=$items\n"; foreach $key (sort keys %{$href}) { $dumped .= 'KEY '; &recursive_dump(\$key, undef); unless (defined $href->{$key}) { $dumped .= 'VALUE_UNDEF' . "\n"; next; } $dumped .= 'VALUE '; &recursive_dump(\$href->{$key}, 1); } } # Dump reference to reference sub dump_ref { my ($rref) = @_; my $deref = $$rref; # Follow reference to reference $dumped .= 'REF '; &recursive_dump($deref, 1); # $dref is a reference } 1; PK ��[1��o t/retrieve.tnu �[��� #!./perl # # Copyright (c) 1995-2000, Raphael Manfredi # Copyright (c) 2017, cPanel Inc # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # sub BEGIN { unshift @INC, 'dist/Storable/t' if $ENV{PERL_CORE} and -d 'dist/Storable/t'; unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } require 'st-dump.pl'; } use Storable qw(store retrieve nstore); use Test::More tests => 20; $a = 'toto'; $b = \$a; $c = bless {}, CLASS; $c->{attribute} = 'attrval'; %a = ('key', 'value', 1, 0, $a, $b, 'cvar', \$c); @a = ('first', '', undef, 3, -4, -3.14159, 456, 4.5, $b, \$a, $a, $c, \$c, \%a); isnt(store(\@a, "store$$"), undef); is(Storable::last_op_in_netorder(), ''); isnt(nstore(\@a, 'nstore'), undef); is(Storable::last_op_in_netorder(), 1); is(Storable::last_op_in_netorder(), 1); $root = retrieve("store$$"); isnt($root, undef); is(Storable::last_op_in_netorder(), ''); $nroot = retrieve('nstore'); isnt($root, undef); is(Storable::last_op_in_netorder(), 1); $d1 = &dump($root); isnt($d1, undef); $d2 = &dump($nroot); isnt($d2, undef); is($d1, $d2); # Make sure empty string is defined at retrieval time isnt($root->[1], undef); is(length $root->[1], 0); # $Storable::DEBUGME = 1; { # len>I32: todo patch the storable image number into the strings, fake 2.10 # $Storable::BIN_MINOR my $retrieve_blessed = "\x04\x0a\x08\x31\x32\x33\x34\x35\x36\x37\x38\x04\x08\x08\x08\x11\xff\x49\x6e\x74\xff\x72\x6e\x61\x6c\x73\x02\x00\x00\x00\x00"; my $x = eval { Storable::mretrieve($retrieve_blessed); }; # Long integer or Double size or Byte order is not compatible like($@, qr/^(Corrupted classname length|.* is not compatible|panic: malloc)/, "RT #130635 $@"); is($x, undef, 'and undef result'); } { # len>I32 my $retrieve_hook = "\x04\x0a\x08\x31\x32\x33\x34\x35\x36\x37\x38\x04\x08\x08\x08\x13\x04\x49\xfe\xf4\xff\x72\x6e\x61\x6c\x73\x02\x00\x00\x00\x00"; my $x = eval { Storable::mretrieve($retrieve_hook); }; like($@, qr/^(Corrupted classname length|.* is not compatible|panic: malloc)/, "$@"); is($x, undef, 'and undef result'); } SKIP: { # this can allocate a lot of memory, only do that if the testers tells us we can # the test allocates 2GB, but other memory is allocated too, so we want # at least 3 $ENV{PERL_TEST_MEMORY} && $ENV{PERL_TEST_MEMORY} >= 3 or skip "over 2GB memory needed for this test", 2; # len<I32, len>127: stack overflow my $retrieve_hook = "\x04\x0a\x08\x31\x32\x33\x34\x35\x36\x37\x38\x04\x08\x08\x08\x13\x04\x49\xfe\xf4\x7f\x72\x6e\x61\x6c\x73\x02\x00\x00\x00\x00"; my $x = eval { Storable::mretrieve($retrieve_hook); }; is($?, 0, "no stack overflow in retrieve_hook()"); is($x, undef, 'either out of mem or normal error (malloc 2GB)'); } END { 1 while unlink("store$$", 'nstore') } PK ��[���: : t/utf8hash.tnu �[��� #!./perl sub BEGIN { if ($] < 5.007) { print "1..0 # Skip: no utf8 hash key support\n"; exit 0; } unshift @INC, 't'; require Config; import Config; if ($ENV{PERL_CORE}){ if($Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } } use strict; our $DEBUGME = shift || 0; use Storable qw(store nstore retrieve thaw freeze); { no warnings; $Storable::DEBUGME = ($DEBUGME > 1); } # Better than no plan, because I was getting out of memory errors, at which # point Test::More tidily prints up 1..79 as if I meant to finish there. use Test::More tests=>144; use bytes (); my %utf8hash; $Storable::flags = Storable::FLAGS_COMPAT; $Storable::canonical = $Storable::canonical; # Shut up a used only once warning. for $Storable::canonical (0, 1) { # first we generate a nasty hash which keys include both utf8 # on and off with identical PVs no utf8; # we have a naked 8-bit byte below (in Latin 1, anyway) # In Latin 1 -ese the below ord() should end up 0xc0 (192), # in EBCDIC 0x64 (100). Both should end up being UTF-8/UTF-EBCDIC. my @ords = ( ord("�"), # LATIN CAPITAL LETTER A WITH GRAVE 0x3000, #IDEOGRAPHIC SPACE ); foreach my $i (@ords){ my $u = chr($i); utf8::upgrade($u); # warn sprintf "%d,%d", bytes::length($u), is_utf8($u); my $b = chr($i); utf8::encode($b); # warn sprintf "%d,%d" ,bytes::length($b), is_utf8($b); isnt($u, $b, "equivalence - with utf8flag"); $utf8hash{$u} = $utf8hash{$b} = $i; } sub nkeys($){ my $href = shift; return scalar keys %$href; } my $nk; is($nk = nkeys(\%utf8hash), scalar(@ords)*2, "nasty hash generated (nkeys=$nk)"); # now let the show begin! my $thawed = thaw(freeze(\%utf8hash)); is($nk = nkeys($thawed), nkeys(\%utf8hash), "scalar keys \%{\$thawed} (nkeys=$nk)"); for my $k (sort keys %$thawed){ is($utf8hash{$k}, $thawed->{$k}, "frozen item chr($utf8hash{$k})"); } my $storage = "utfhash.po"; # po = perl object! my $retrieved; ok((nstore \%utf8hash, $storage), "nstore to $storage"); ok(($retrieved = retrieve($storage)), "retrieve from $storage"); is($nk = nkeys($retrieved), nkeys(\%utf8hash), "scalar keys \%{\$retrieved} (nkeys=$nk)"); for my $k (sort keys %$retrieved){ is($utf8hash{$k}, $retrieved->{$k}, "nstored item chr($utf8hash{$k})"); } unlink $storage; ok((store \%utf8hash, $storage), "store to $storage"); ok(($retrieved = retrieve($storage)), "retrieve from $storage"); is($nk = nkeys($retrieved), nkeys(\%utf8hash), "scalar keys \%{\$retrieved} (nkeys=$nk)"); for my $k (sort keys %$retrieved){ is($utf8hash{$k}, $retrieved->{$k}, "stored item chr($utf8hash{$k})"); } $DEBUGME or unlink $storage; # On the premis that more tests are good, here are NWC's tests: package Hash_Test; sub me_second { return (undef, $_[0]); } package main; my $utf8 = "Schlo\xdf" . chr 256; chop $utf8; # Set this to 1 to test the test by bypassing Storable. my $bypass = 0; sub class_test { my ($object, $package) = @_; unless ($package) { is ref $object, 'HASH', "$object is unblessed"; return; } isa_ok ($object, $package); my ($garbage, $copy) = eval {$object->me_second}; is $@, "", "check it has correct method"; cmp_ok $copy, '==', $object, "and that it returns the same object"; } # Thanks to Dan Kogai for the Kanji for "castle" (which he informs me also # means 'a city' in Mandarin). my %hash = (map {$_, $_} 'castle', "ch\xe5teau", $utf8, "\x{57CE}"); for my $package ('', 'Hash_Test') { # Run through and sanity check these. if ($package) { bless \%hash, $package; } for (keys %hash) { my $l = 0 + /^\w+$/; my $r = 0 + $hash{$_} =~ /^\w+$/; cmp_ok ($l, '==', $r); } # Grr. This cperl mode thinks that ${ is a punctuation variable. # I presume it's punishment for using xemacs rather than emacs. Or OS/2 :-) my $copy = $bypass ? \%hash : ${thaw freeze \\%hash}; class_test ($copy, $package); for (keys %$copy) { my $l = 0 + /^\w+$/; my $r = 0 + $copy->{$_} =~ /^\w+$/; cmp_ok ($l, '==', $r, sprintf "key length %d", length $_); } my $bytes = my $char = chr 27182; utf8::encode ($bytes); my $orig = {$char => 1}; if ($package) { bless $orig, $package; } my $just_utf8 = $bypass ? $orig : ${thaw freeze \$orig}; class_test ($just_utf8, $package); cmp_ok (scalar keys %$just_utf8, '==', 1, "1 key in utf8?"); cmp_ok ($just_utf8->{$char}, '==', 1, "utf8 key present?"); ok (!exists $just_utf8->{$bytes}, "bytes key absent?"); $orig = {$bytes => 1}; if ($package) { bless $orig, $package; } my $just_bytes = $bypass ? $orig : ${thaw freeze \$orig}; class_test ($just_bytes, $package); cmp_ok (scalar keys %$just_bytes, '==', 1, "1 key in bytes?"); cmp_ok ($just_bytes->{$bytes}, '==', 1, "bytes key present?"); ok (!exists $just_bytes->{$char}, "utf8 key absent?"); die sprintf "Both have length %d, which is crazy", length $char if length $char == length $bytes; $orig = {$bytes => length $bytes, $char => length $char}; if ($package) { bless $orig, $package; } my $both = $bypass ? $orig : ${thaw freeze \$orig}; class_test ($both, $package); cmp_ok (scalar keys %$both, '==', 2, "2 keys?"); cmp_ok ($both->{$bytes}, '==', length $bytes, "bytes key present?"); cmp_ok ($both->{$char}, '==', length $char, "utf8 key present?"); } } PK ��[��ZE+ + t/code.tnu �[��� #!./perl # # Copyright (c) 2002 Slaven Rezic # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use strict; BEGIN { if (!eval q{ use Test::More; use B::Deparse 0.61; use 5.006; 1; }) { print "1..0 # skip: tests only work with B::Deparse 0.61 and at least perl 5.6.0\n"; exit; } require File::Spec; if ($File::Spec::VERSION < 0.8) { print "1..0 # Skip: newer File::Spec needed\n"; exit 0; } } BEGIN { plan tests => 63 } use Storable qw(retrieve store nstore freeze nfreeze thaw dclone); use Safe; #$Storable::DEBUGME = 1; our ($freezed, $thawed, @obj, @res, $blessed_code); $blessed_code = bless sub { "blessed" }, "Some::Package"; { package Another::Package; sub foo { __PACKAGE__ } } { no strict; # to make the life for Safe->reval easier sub code { "JAPH" } } local *FOO; @obj = ([\&code, # code reference sub { 6*7 }, $blessed_code, # blessed code reference \&Another::Package::foo, # code in another package sub ($$;$) { 0 }, # prototypes sub { print "test\n" }, \&Storable::_store, # large scalar ], {"a" => sub { "srt" }, "b" => \&code}, sub { ord("a")-ord("7") }, \&code, \&dclone, # XS function sub { open FOO, '<', "/" }, ); $Storable::Deparse = 1; $Storable::Eval = 1; ###################################################################### # Test freeze & thaw $freezed = freeze $obj[0]; $thawed = thaw $freezed; is($thawed->[0]->(), "JAPH"); is($thawed->[1]->(), 42); is($thawed->[2]->(), "blessed"); is($thawed->[3]->(), "Another::Package"); is(prototype($thawed->[4]), prototype($obj[0]->[4])); ###################################################################### $freezed = freeze $obj[1]; $thawed = thaw $freezed; is($thawed->{"a"}->(), "srt"); is($thawed->{"b"}->(), "JAPH"); ###################################################################### $freezed = freeze $obj[2]; $thawed = thaw $freezed; is($thawed->(), (ord "A") == 193 ? -118 : 42); ###################################################################### $freezed = freeze $obj[3]; $thawed = thaw $freezed; is($thawed->(), "JAPH"); ###################################################################### eval { $freezed = freeze $obj[4] }; like($@, qr/The result of B::Deparse::coderef2text was empty/); ###################################################################### # Test dclone my $new_sub = dclone($obj[2]); is($new_sub->(), $obj[2]->()); ###################################################################### # Test retrieve & store store $obj[0], "store$$"; # $Storable::DEBUGME = 1; $thawed = retrieve "store$$"; is($thawed->[0]->(), "JAPH"); is($thawed->[1]->(), 42); is($thawed->[2]->(), "blessed"); is($thawed->[3]->(), "Another::Package"); is(prototype($thawed->[4]), prototype($obj[0]->[4])); ###################################################################### nstore $obj[0], "store$$"; $thawed = retrieve "store$$"; unlink "store$$"; is($thawed->[0]->(), "JAPH"); is($thawed->[1]->(), 42); is($thawed->[2]->(), "blessed"); is($thawed->[3]->(), "Another::Package"); is(prototype($thawed->[4]), prototype($obj[0]->[4])); ###################################################################### # Security with # $Storable::Eval # $Storable::Deparse { local $Storable::Eval = 0; for my $i (0 .. 1) { $freezed = freeze $obj[$i]; $@ = ""; eval { $thawed = thaw $freezed }; like($@, qr/Can\'t eval/); } } { local $Storable::Deparse = 0; for my $i (0 .. 1) { $@ = ""; eval { $freezed = freeze $obj[$i] }; like($@, qr/Can\'t store CODE items/); } } { local $Storable::Eval = 0; local $Storable::forgive_me = 1; for my $i (0 .. 4) { $freezed = freeze $obj[0]->[$i]; $@ = ""; eval { $thawed = thaw $freezed }; is($@, ""); like($$thawed, qr/^sub/); } } { local $Storable::Deparse = 0; local $Storable::forgive_me = 1; my $devnull = File::Spec->devnull; open(SAVEERR, ">&STDERR"); open(STDERR, '>', $devnull) or ( print SAVEERR "Unable to redirect STDERR: $!\n" and exit(1) ); eval { $freezed = freeze $obj[0]->[0] }; open(STDERR, ">&SAVEERR"); is($@, ""); isnt($freezed, ''); } { my $safe = new Safe; local $Storable::Eval = sub { $safe->reval(shift) }; $freezed = freeze $obj[0]->[0]; $@ = ""; eval { $thawed = thaw $freezed }; is($@, ""); is($thawed->(), "JAPH"); $freezed = freeze $obj[0]->[6]; eval { $thawed = thaw $freezed }; # The "Code sub ..." error message only appears if Log::Agent is installed like($@, qr/(trapped|Code sub)/); if (0) { # Disable or fix this test if the internal representation of Storable # changes. skip("no malicious storable file check", 1); } else { # Construct malicious storable code $freezed = nfreeze $obj[0]->[0]; my $bad_code = ';open FOO, "/badfile"'; # 5th byte is (short) length of scalar my $len = ord(substr($freezed, 4, 1)); substr($freezed, 4, 1, chr($len+length($bad_code))); substr($freezed, -1, 0, $bad_code); $@ = ""; eval { $thawed = thaw $freezed }; like($@, qr/(trapped|Code sub)/); } } { my $safe = new Safe; # because of opcodes used in "use strict": $safe->permit(qw(:default require caller)); local $Storable::Eval = sub { $safe->reval(shift) }; $freezed = freeze $obj[0]->[1]; $@ = ""; eval { $thawed = thaw $freezed }; is($@, ""); is($thawed->(), 42); } { { package MySafe; sub new { bless {}, shift } sub reval { my $source = $_[1]; # Here you can apply some nifty regexpes to ensure the # safeness of the source code. my $coderef = eval $source; $coderef; } } my $safe = new MySafe; local $Storable::Eval = sub { $safe->reval($_[0]) }; $freezed = freeze $obj[0]; eval { $thawed = thaw $freezed }; is($@, ""); if ($@ ne "") { fail() for (1..5); } else { is($thawed->[0]->(), "JAPH"); is($thawed->[1]->(), 42); is($thawed->[2]->(), "blessed"); is($thawed->[3]->(), "Another::Package"); is(prototype($thawed->[4]), prototype($obj[0]->[4])); } } { # Check internal "seen" code my $short_sub = sub { "short sub" }; # for SX_SCALAR # for SX_LSCALAR my $long_sub_code = 'sub { "' . "x"x255 . '" }'; my $long_sub = eval $long_sub_code; die $@ if $@; my $sclr = \1; local $Storable::Deparse = 1; local $Storable::Eval = 1; for my $sub ($short_sub, $long_sub) { my $res; $res = thaw freeze [$sub, $sub]; is(int($res->[0]), int($res->[1])); $res = thaw freeze [$sclr, $sub, $sub, $sclr]; is(int($res->[0]), int($res->[3])); is(int($res->[1]), int($res->[2])); $res = thaw freeze [$sub, $sub, $sclr, $sclr]; is(int($res->[0]), int($res->[1])); is(int($res->[2]), int($res->[3])); } } { my @text = ("hello", "\x{a3}", "\x{a3} \x{2234}", "\x{2234}\x{2234}"); for my $text(@text) { my $res = (thaw freeze eval "sub {'" . $text . "'}")->(); ok($res eq $text); } } PK ��[� 1 t/forgive.tnu �[��� #!./perl # # Copyright (c) 1995-2000, Raphael Manfredi # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # # Original Author: Ulrich Pfeifer # (C) Copyright 1997, Universitat Dortmund, all rights reserved. # sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use Storable qw(store retrieve); use Test::More; # problems with 5.00404 when in an BEGIN block, so this is defined here if (!eval { require File::Spec; 1 } || $File::Spec::VERSION < 0.8) { plan(skip_all => "File::Spec 0.8 needed"); # Mention $File::Spec::VERSION again, as 5.00503's harness seems to have # warnings on. exit $File::Spec::VERSION; } plan(tests => 8); *GLOB = *GLOB; # peacify -w my $bad = ['foo', \*GLOB, 'bar']; my $result; eval {$result = store ($bad , "store$$")}; is($result, undef); isnt($@, ''); $Storable::forgive_me=1; my $devnull = File::Spec->devnull; open(SAVEERR, ">&STDERR"); open(STDERR, '>', $devnull) or ( print SAVEERR "Unable to redirect STDERR: $!\n" and exit(1) ); eval {$result = store ($bad , "store$$")}; open(STDERR, ">&SAVEERR"); isnt($result, undef); is($@, ''); my $ret = retrieve("store$$"); isnt($ret, undef); is($ret->[0], 'foo'); is($ret->[2], 'bar'); is(ref $ret->[1], 'SCALAR'); END { 1 while unlink "store$$" } PK ��[߁�� � t/store.tnu �[��� #!./perl # # Copyright (c) 1995-2000, Raphael Manfredi # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } require 'st-dump.pl'; } # $Storable::DEBUGME = 1; use Storable qw(store retrieve store_fd nstore_fd fd_retrieve); use Test::More tests => 25; $a = 'toto'; $b = \$a; $c = bless {}, CLASS; $c->{attribute} = 'attrval'; %a = ('key', 'value', 1, 0, $a, $b, 'cvar', \$c); @a = ('first', undef, 3, -4, -3.14159, 456, 4.5, $b, \$a, $a, $c, \$c, \%a); isnt(store(\@a, "store$$"), undef); $dumped = &dump(\@a); isnt($dumped, undef); $root = retrieve("store$$"); isnt($root, undef); $got = &dump($root); isnt($got, undef); is($got, $dumped); 1 while unlink "store$$"; package FOO; @ISA = qw(Storable); sub make { my $self = bless {}; $self->{key} = \%main::a; return $self; }; package main; $foo = FOO->make; isnt($foo->store("store$$"), undef); isnt(open(OUT, '>>', "store$$"), undef); binmode OUT; isnt(store_fd(\@a, ::OUT), undef); isnt(nstore_fd($foo, ::OUT), undef); isnt(nstore_fd(\%a, ::OUT), undef); isnt(close(OUT), undef); isnt(open(OUT, "store$$"), undef); $r = fd_retrieve(::OUT); isnt($r, undef); is(&dump($r), &dump($foo)); $r = fd_retrieve(::OUT); isnt($r, undef); is(&dump($r), &dump(\@a)); $r = fd_retrieve(main::OUT); isnt($r, undef); is(&dump($r), &dump($foo)); $r = fd_retrieve(::OUT); isnt($r, undef); is(&dump($r), &dump(\%a)); eval { $r = fd_retrieve(::OUT); }; isnt($@, ''); { my %test = ( old_retrieve_array => "\x70\x73\x74\x30\x01\x0a\x02\x02\x02\x02\x00\x3d\x08\x84\x08\x85\x08\x06\x04\x00\x00\x01\x1b", old_retrieve_hash => "\x70\x73\x74\x30\x01\x0a\x03\x00\xe8\x03\x00\x00\x81\x00\x00\x00\x01\x61", retrieve_code => "\x70\x73\x74\x30\x05\x0a\x19\xf0\x00\xff\xe8\x03\x1a\x0a\x0e\x01", ); for my $k (sort keys %test) { open my $fh, '<', \$test{$k}; eval { Storable::fd_retrieve($fh); }; is($?, 0, 'RT 130098: no segfault in Storable::fd_retrieve()'); } } { my $frozen = "\x70\x73\x74\x30\x04\x0a\x08\x31\x32\x33\x34\x35\x36\x37\x38\x04\x08\x08\x08\x03\xff\x00\x00\x00\x19\x08\xff\x00\x00\x00\x08\x08\xf9\x16\x16\x13\x16\x10\x10\x10\xff\x15\x16\x16\x16\x1e\x16\x16\x16\x16\x16\x16\x16\x16\x16\x16\x13\xf0\x16\x16\x16\xfe\x16\x41\x41\x41\x41\xe8\x03\x41\x41\x41\x41\x41\x41\x41\x41\x51\x41\xa9\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xb8\xac\xac\xac\xac\xac\xac\xac\xac\x9a\xac\xac\xac\xac\xac\xac\xac\xac\xac\x93\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\x00\x64\xac\xa8\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\xac\x2c\xac\x41\x41\x41\x41\x41\x41\x41\x41\x41\x00\x80\x41\x80\x41\x41\x41\x41\x41\x41\x51\x41\xac\xac\xac"; open my $fh, '<', \$frozen; eval { Storable::fd_retrieve($fh); }; pass('RT 130635: no stack smashing error when retrieving hook'); } close OUT or die "Could not close: $!"; END { 1 while unlink "store$$" } PK ��[����M M t/leaks.tnu �[��� #!./perl use Test::More; use Storable (); BEGIN { eval "use Test::LeakTrace"; plan 'skip_all' => 'Test::LeakTrace required for this tests' if $@; } plan 'tests' => 1; { my $c = My::Simple->new; my $d; my $freezed = Storable::freeze($c); no_leaks_ok { $d = Storable::thaw($freezed); undef $d; }; package My::Simple; sub new { my ($class, $arg) = @_; bless {t=>$arg}, $class; } sub STORABLE_freeze { return "abcderfgh"; } sub STORABLE_attach { my ($class, $c, $serialized) = @_; return $class->new($serialized); } } { # [cpan #97316] package TestClass; sub new { my $class = shift; return bless({}, $class); } sub STORABLE_freeze { die; } package main; my $obj = TestClass->new; eval { freeze($obj); }; } PK ��[� �$ $ t/just_plain_nasty.tnu �[��� #!/usr/bin/perl # This is a test suite to cover all the nasty and horrible data # structures that cause bizarre corner cases. # Everyone's invited! :-D sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use strict; BEGIN { if (!eval q{ use Test::More; use B::Deparse 0.61; use 5.006; 1; }) { print "1..0 # skip: tests only work with B::Deparse 0.61 and at least perl 5.6.0\n"; exit; } require File::Spec; if ($File::Spec::VERSION < 0.8) { print "1..0 # Skip: newer File::Spec needed\n"; exit 0; } } use Storable qw(freeze thaw); $Storable::flags = Storable::FLAGS_COMPAT; #$Storable::DEBUGME = 1; BEGIN { plan tests => 34; } { package Banana; use overload '<=>' => \&compare, '==' => \&equal, '""' => \&real, fallback => 1; sub compare { return int(rand(3))-1 }; sub equal { return 1 if rand(1) > 0.5 } sub real { return "keep it so" } } my (@a); for my $dbun (1, 0) { # dbun - don't be utterly nasty - being utterly # nasty means having a reference to the object # directly within itself. otherwise it's in the # second array. my $nasty = [ ($a[0] = bless [ ], "Banana"), ($a[1] = [ ]), ]; $a[$dbun]->[0] = $a[0]; is(ref($nasty), "ARRAY", "Sanity found (now to play with it :->)"); $Storable::Deparse = $Storable::Deparse = 1; $Storable::Eval = $Storable::Eval = 1; headit("circular overload 1 - freeze"); my $icicle = freeze $nasty; #print $icicle; # cat -ve recommended :) headit("circular overload 1 - thaw"); my $oh_dear = thaw $icicle; is(ref($oh_dear), "ARRAY", "dclone - circular overload"); is($oh_dear->[0], "keep it so", "amagic ok 1"); is($oh_dear->[$dbun]->[0], "keep it so", "amagic ok 2"); headit("closure dclone - freeze"); $icicle = freeze sub { "two" }; #print $icicle; headit("closure dclone - thaw"); my $sub2 = thaw $icicle; is($sub2->(), "two", "closures getting dcloned OK"); headit("circular overload, after closure - freeze"); #use Data::Dumper; #print Dumper $nasty; $icicle = freeze $nasty; #print $icicle; headit("circular overload, after closure - thaw"); $oh_dear = thaw $icicle; is(ref($oh_dear), "ARRAY", "dclone - after a closure dclone"); is($oh_dear->[0], "keep it so", "amagic ok 1"); is($oh_dear->[$dbun]->[0], "keep it so", "amagic ok 2"); push @{$nasty}, sub { print "Goodbye, cruel world.\n" }; headit("closure freeze AFTER circular overload"); #print Dumper $nasty; $icicle = freeze $nasty; #print $icicle; headit("circular thaw AFTER circular overload"); $oh_dear = thaw $icicle; is(ref($oh_dear), "ARRAY", "dclone - before a closure dclone"); is($oh_dear->[0], "keep it so", "amagic ok 1"); is($oh_dear->[$dbun]->[0], "keep it so", "amagic ok 2"); @{$nasty} = @{$nasty}[0, 2, 1]; headit("closure freeze BETWEEN circular overload"); #print Dumper $nasty; $icicle = freeze $nasty; #print $icicle; headit("circular thaw BETWEEN circular overload"); $oh_dear = thaw $icicle; is(ref($oh_dear), "ARRAY", "dclone - between a closure dclone"); is($oh_dear->[0], "keep it so", "amagic ok 1"); is($oh_dear->[$dbun?2:0]->[0], "keep it so", "amagic ok 2"); @{$nasty} = @{$nasty}[1, 0, 2]; headit("closure freeze BEFORE circular overload"); #print Dumper $nasty; $icicle = freeze $nasty; #print $icicle; headit("circular thaw BEFORE circular overload"); $oh_dear = thaw $icicle; is(ref($oh_dear), "ARRAY", "dclone - after a closure dclone"); is($oh_dear->[1], "keep it so", "amagic ok 1"); is($oh_dear->[$dbun+1]->[0], "keep it so", "amagic ok 2"); } sub headit { return; # comment out to get headings - useful for scanning # output with $Storable::DEBUGME = 1 my $title = shift; my $size_left = (66 - length($title)) >> 1; my $size_right = (67 - length($title)) >> 1; print "# ".("-" x $size_left). " $title " .("-" x $size_right)."\n"; } PK ��[��;� � t/make_56_interwork.plnu �[��� #!/usr/bin/perl -w use strict; use Config; use Storable qw(freeze thaw); # Lilliput decreed that eggs should be eaten small end first. # Belfuscu welcomed the rebels who wanted to eat big end first. my $kingdom = $Config{byteorder} =~ /23/ ? "Lillput" : "Belfuscu"; my $frozen = freeze ["This file was written with $Storable::VERSION on perl $]", "$kingdom was correct", (~0 ^ (~0 >> 1) ^ 2), "The End"]; my $ivsize = $Config{ivsize} || $Config{longsize}; my $storesize = unpack 'xxC', $frozen; my $storebyteorder = unpack "xxxA$storesize", $frozen; if ($Config{byteorder} eq $storebyteorder) { my $ivtype = $Config{ivtype} || 'long'; print <<"EOM"; You only need to run this generator program where Config.pm's byteorder string is not the same length as the size of IVs. This length difference should only happen on perl 5.6.x configured with IVs as long long on Unix, OS/2 or any platform that runs the Configure stript (ie not MS Windows) This is perl $], sizeof(long) is $Config{longsize}, IVs are '$ivtype', sizeof(IV) is $ivsize, byteorder is '$Config{byteorder}', Storable $Storable::VERSION writes a byteorder of '$storebyteorder' EOM exit; # Grr ' } my ($i, $l, $p, $n) = unpack "xxxx${storesize}CCCC", $frozen; print <<"EOM"; # byteorder '$storebyteorder' # sizeof(int) $i # sizeof(long) $l # sizeof(char *) $p # sizeof(NV) $n EOM my $uu = pack 'u', $frozen; printf "begin %3o $kingdom,$i,$l,$p,$n\n", ord 'A'; print $uu; print "\nend\n\n"; PK ��[�S�� � t/attach.tnu �[��� #!./perl -w # # This file tests that Storable correctly uses STORABLE_attach hooks sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use Test::More tests => 3; use Storable (); { my $destruct_cnt = 0; my $obj = bless {data => 'ok'}, 'My::WithDestructor'; my $target = Storable::thaw( Storable::freeze( $obj ) ); is( $target->{data}, 'ok', 'We got correct object after freeze/thaw' ); is( $destruct_cnt, 0, 'No tmp objects created by Storable' ); undef $obj; undef $target; is( $destruct_cnt, 2, 'Only right objects destroyed at the end' ); package My::WithDestructor; sub STORABLE_freeze { my ($self, $clone) = @_; return $self->{data}; } sub STORABLE_attach { my ($class, $clone, $string) = @_; return bless {data => $string}, 'My::WithDestructor'; } sub DESTROY { $destruct_cnt++; } } PK ��[ԑ�-n n t/destroy.tnu �[��� # [perl #118139] crash in global destruction when accessing the freed cxt. use Test::More tests => 1; use Storable; BEGIN { store {}, "foo"; } package foo; sub new { return bless {} } DESTROY { open FH, '<', "foo" or die $!; eval { Storable::pretrieve(*FH); }; close FH or die $!; unlink "foo"; } package main; # print "# $^X\n"; $x = foo->new(); ok(1); PK ��[ t��_ _ t/testlib.plnu �[��� #!perl -w use strict; our $file = "storable-testfile.$$"; die "Temporary file '$file' already exists" if -e $file; END { while (-f $file) {unlink $file or die "Can't unlink '$file': $!" }} use Storable qw (store retrieve freeze thaw nstore nfreeze); sub slurp { my $file = shift; local (*FH, $/); open FH, "<", $file or die "Can't open '$file': $!"; binmode FH; my $contents = <FH>; die "Can't read $file: $!" unless defined $contents; return $contents; } sub store_and_retrieve { my $data = shift; unlink $file or die "Can't unlink '$file': $!"; local *FH; open FH, ">", $file or die "Can't open '$file': $!"; binmode FH; print FH $data or die "Can't print to '$file': $!"; close FH or die "Can't close '$file': $!"; return eval {retrieve $file}; } sub freeze_and_thaw { my $data = shift; return eval {thaw $data}; } 1; PK ��[���� � t/canonical.tnu �[��� #!./perl # # Copyright (c) 1995-2000, Raphael Manfredi # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use Storable qw(freeze thaw dclone); our ($debugging, $verbose); use Test::More tests => 8; # Uncomment the following line to get a dump of the constructed data structure # (you may want to reduce the size of the hashes too) # $debugging = 1; $hashsize = 100; $maxhash2size = 100; $maxarraysize = 100; # Use Digest::MD5 if its available to make random string keys eval { require Digest::MD5; }; $gotmd5 = !$@; note "Will use Digest::MD5" if $gotmd5; # Use Data::Dumper if debugging and it is available to create an ASCII dump if ($debugging) { eval { require "Data/Dumper.pm" }; $gotdd = !$@; } @fixed_strings = ("January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December" ); # Build some arbitrarily complex data structure starting with a top level hash # (deeper levels contain scalars, references to hashes or references to arrays); for (my $i = 0; $i < $hashsize; $i++) { my($k) = int(rand(1_000_000)); $k = Digest::MD5::md5_hex($k) if $gotmd5 and int(rand(2)); $a1{$k} = { key => "$k", "value" => $i }; # A third of the elements are references to further hashes if (int(rand(1.5))) { my($hash2) = {}; my($hash2size) = int(rand($maxhash2size)); while ($hash2size--) { my($k2) = $k . $i . int(rand(100)); $hash2->{$k2} = $fixed_strings[rand(int(@fixed_strings))]; } $a1{$k}->{value} = $hash2; } # A further third are references to arrays elsif (int(rand(2))) { my($arr_ref) = []; my($arraysize) = int(rand($maxarraysize)); while ($arraysize--) { push(@$arr_ref, $fixed_strings[rand(int(@fixed_strings))]); } $a1{$k}->{value} = $arr_ref; } } print STDERR Data::Dumper::Dumper(\%a1) if ($verbose and $gotdd); # Copy the hash, element by element in order of the keys foreach $k (sort keys %a1) { $a2{$k} = { key => "$k", "value" => $a1{$k}->{value} }; } # Deep clone the hash $a3 = dclone(\%a1); # In canonical mode the frozen representation of each of the hashes # should be identical $Storable::canonical = 1; $x1 = freeze(\%a1); $x2 = freeze(\%a2); $x3 = freeze($a3); cmp_ok(length $x1, '>', $hashsize); # sanity check is(length $x1, length $x2); # idem is($x1, $x2); is($x1, $x3); # In normal mode it is exceedingly unlikely that the frozen # representations of all the hashes will be the same (normally the hash # elements are frozen in the order they are stored internally, # i.e. pseudo-randomly). $Storable::canonical = 0; $x1 = freeze(\%a1); $x2 = freeze(\%a2); $x3 = freeze($a3); # Two out of three the same may be a coincidence, all three the same # is much, much more unlikely. Still it could happen, so this test # may report a false negative. ok(($x1 ne $x2) || ($x1 ne $x3)); # Ensure refs to "undef" values are properly shared # Same test as in t/dclone.t to ensure the "canonical" code is also correct my $hash; push @{$$hash{''}}, \$$hash{a}; is($$hash{''}[0], \$$hash{a}); my $cloned = dclone(dclone($hash)); is($$cloned{''}[0], \$$cloned{a}); $$cloned{a} = "blah"; is($$cloned{''}[0], \$$cloned{a}); PK ��[U�8 t/dclone.tnu �[��� #!./perl # # Copyright (c) 1995-2000, Raphael Manfredi # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } require 'st-dump.pl'; } use Storable qw(dclone); use Test::More tests => 14; $a = 'toto'; $b = \$a; $c = bless {}, CLASS; $c->{attribute} = 'attrval'; %a = ('key', 'value', 1, 0, $a, $b, 'cvar', \$c); @a = ('first', undef, 3, -4, -3.14159, 456, 4.5, $b, \$a, $a, $c, \$c, \%a); my $aref = dclone(\@a); isnt($aref, undef); $dumped = &dump(\@a); isnt($dumped, undef); $got = &dump($aref); isnt($got, undef); is($got, $dumped); package FOO; @ISA = qw(Storable); sub make { my $self = bless {}; $self->{key} = \%main::a; return $self; }; package main; $foo = FOO->make; my $r = $foo->dclone; isnt($r, undef); is(&dump($foo), &dump($r)); # Ensure refs to "undef" values are properly shared during cloning my $hash; push @{$$hash{''}}, \$$hash{a}; is($$hash{''}[0], \$$hash{a}); my $cloned = dclone(dclone($hash)); is($$cloned{''}[0], \$$cloned{a}); $$cloned{a} = "blah"; is($$cloned{''}[0], \$$cloned{a}); # [ID 20020221.007 (#8624)] SEGV in Storable with empty string scalar object package TestString; sub new { my ($type, $string) = @_; return bless(\$string, $type); } package main; my $empty_string_obj = TestString->new(''); my $clone = dclone($empty_string_obj); # If still here after the dclone the fix (#17543) worked. is(ref $clone, ref $empty_string_obj); is($$clone, $$empty_string_obj); is($$clone, ''); SKIP: { # Do not fail if Tie::Hash and/or Tie::StdHash is not available skip 'No Tie::StdHash available', 2 unless eval { require Tie::Hash; scalar keys %Tie::StdHash:: }; skip 'This version of perl has problems with Tie::StdHash', 2 if $] eq "5.008"; tie my %tie, "Tie::StdHash" or die $!; $tie{array} = [1,2,3,4]; $tie{hash} = {1,2,3,4}; my $clone_array = dclone $tie{array}; is("@$clone_array", "@{$tie{array}}"); my $clone_hash = dclone $tie{hash}; is($clone_hash->{1}, $tie{hash}{1}); } PK ��[4pI�V) V) t/malice.tnu �[��� #!./perl -w # # Copyright 2002, Larry Wall. # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # # I'm trying to keep this test easily backwards compatible to 5.004, so no # qr//; # This test tries to craft malicious data to test out as many different # error traps in Storable as possible # It also acts as a test for read_header sub BEGIN { # This lets us distribute Test::More in t/ unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use strict; our $byteorder = $Config{byteorder}; our $file_magic_str = 'pst0'; our $other_magic = 7 + length $byteorder; our $network_magic = 2; our $major = 2; our $minor = 11; our $minor_write = $] >= 5.019 ? 11 : $] > 5.008 ? 9 : $] > 5.005_50 ? 8 : 4; use Test::More; # If it's 5.7.3 or later the hash will be stored with flags, which is # 2 extra bytes. There are 2 * 2 * 2 tests per byte in the body and header # common to normal and network order serialised objects (hence the 8) # There are only 2 * 2 tests per byte in the parts of the header not present # for network order, and 2 tests per byte on the 'pst0' "magic number" only # present in files, but not in things store()ed to memory our $fancy = ($] > 5.007 ? 2 : 0); plan tests => 372 + length ($byteorder) * 4 + $fancy * 8; use Storable qw (store retrieve freeze thaw nstore nfreeze); require 'testlib.pl'; our $file; # The chr 256 is a hack to force the hash to always have the utf8 keys flag # set on 5.7.3 and later. Otherwise the test fails if run with -Mutf8 because # only there does the hash has the flag on, and hence only there is it stored # as a flagged hash, which is 2 bytes longer my %hash = (perl => 'rules', chr 256, ''); delete $hash{chr 256}; sub test_hash { my $clone = shift; is (ref $clone, "HASH", "Get hash back"); is (scalar keys %$clone, 1, "with 1 key"); is ((keys %$clone)[0], "perl", "which is correct"); is ($clone->{perl}, "rules", "Got expected value when looking up key in clone"); } sub test_header { my ($header, $isfile, $isnetorder) = @_; is (!!$header->{file}, !!$isfile, "is file"); is ($header->{major}, $major, "major number"); is ($header->{minor}, $minor_write, "minor number"); is (!!$header->{netorder}, !!$isnetorder, "is network order"); if ($isnetorder) { # Network order header has no sizes } else { is ($header->{byteorder}, $byteorder, "byte order"); is ($header->{intsize}, $Config{intsize}, "int size"); is ($header->{longsize}, $Config{longsize}, "long size"); SKIP: { skip ("No \$Config{prtsize} on this perl version ($])", 1) unless defined $Config{ptrsize}; is ($header->{ptrsize}, $Config{ptrsize}, "long size"); } is ($header->{nvsize}, $Config{nvsize} || $Config{doublesize} || 8, "nv size"); # 5.00405 doesn't even have doublesize in config. } } sub test_truncated { my ($data, $sub, $magic_len, $what) = @_; for my $i (0 .. length ($data) - 1) { my $short = substr $data, 0, $i; # local $Storable::DEBUGME = 1; my $clone = &$sub($short); is (defined ($clone), '', "truncated $what to $i should fail"); if ($i < $magic_len) { like ($@, "/^Magic number checking on storable $what failed/", "Should croak with magic number warning"); } else { is ($@, "", "Should not set \$\@"); } } } sub test_corrupt { my ($data, $sub, $what, $name) = @_; my $clone = &$sub($data); local $Test::Builder::Level = $Test::Builder::Level + 1; is (defined ($clone), '', "$name $what should fail"); like ($@, $what, $name); } sub test_things { my ($contents, $sub, $what, $isnetwork) = @_; my $isfile = $what eq 'file'; my $file_magic = $isfile ? length $file_magic_str : 0; my $header = Storable::read_magic ($contents); test_header ($header, $isfile, $isnetwork); # Test that if we re-write it, everything still works: my $clone = &$sub ($contents); is ($@, "", "There should be no error"); test_hash ($clone); # Now lets check the short version: test_truncated ($contents, $sub, $file_magic + ($isnetwork ? $network_magic : $other_magic), $what); my $copy; if ($isfile) { $copy = $contents; substr ($copy, 0, 4) = 'iron'; test_corrupt ($copy, $sub, "/^File is not a perl storable/", "magic number"); } $copy = $contents; # Needs to be more than 1, as we're already coding a spread of 1 minor version # number on writes (2.5, 2.4). May increase to 2 if we figure we can do 2.3 # on 5.005_03 (No utf8). # 4 allows for a small safety margin # Which we've now exhausted given that Storable 2.25 is writing 2.8 # (Joke: # Question: What is the value of pi? # Mathematician answers "It's pi, isn't it" # Physicist answers "3.1, within experimental error" # Engineer answers "Well, allowing for a small safety margin, 18" # ) my $minor6 = $header->{minor} + 6; substr ($copy, $file_magic + 1, 1) = chr $minor6; { # Now by default newer minor version numbers are not a pain. $clone = &$sub($copy); is ($@, "", "by default no error on higher minor"); test_hash ($clone); local $Storable::accept_future_minor = 0; test_corrupt ($copy, $sub, "/^Storable binary image v$header->{major}\.$minor6 more recent than I am \\(v$header->{major}\.$minor\\)/", "higher minor"); } $copy = $contents; my $major1 = $header->{major} + 1; substr ($copy, $file_magic, 1) = chr 2*$major1; test_corrupt ($copy, $sub, "/^Storable binary image v$major1\.$header->{minor} more recent than I am \\(v$header->{major}\.$minor\\)/", "higher major"); # Continue messing with the previous copy my $minor1 = $header->{minor} - 1; substr ($copy, $file_magic + 1, 1) = chr $minor1; test_corrupt ($copy, $sub, "/^Storable binary image v$major1\.$minor1 more recent than I am \\(v$header->{major}\.$minor\\)/", "higher major, lower minor"); my $where; if (!$isnetwork) { # All these are omitted from the network order header. # I'm not sure if it's correct to omit the byte size stuff. $copy = $contents; substr ($copy, $file_magic + 3, length $header->{byteorder}) = reverse $header->{byteorder}; test_corrupt ($copy, $sub, "/^Byte order is not compatible/", "byte order"); $where = $file_magic + 3 + length $header->{byteorder}; foreach (['intsize', "Integer"], ['longsize', "Long integer"], ['ptrsize', "Pointer"], ['nvsize', "Double"]) { my ($key, $name) = @$_; $copy = $contents; substr ($copy, $where++, 1) = chr 0; test_corrupt ($copy, $sub, "/^$name size is not compatible/", "$name size"); } } else { $where = $file_magic + $network_magic; } # Just the header and a tag 255. As 33 is currently the highest tag, this # is "unexpected" $copy = substr ($contents, 0, $where) . chr 255; test_corrupt ($copy, $sub, "/^Corrupted storable $what \\(binary v$header->{major}.$header->{minor}\\)/", "bogus tag"); # Now drop the minor version number substr ($copy, $file_magic + 1, 1) = chr $minor1; test_corrupt ($copy, $sub, "/^Corrupted storable $what \\(binary v$header->{major}.$minor1\\)/", "bogus tag, minor less 1"); # Now increase the minor version number substr ($copy, $file_magic + 1, 1) = chr $minor6; # local $Storable::DEBUGME = 1; # This is the delayed croak test_corrupt ($copy, $sub, "/^Storable binary image v$header->{major}.$minor6 contains data of type 255. This Storable is v$header->{major}.$minor and can only handle data types up to 33/", "bogus tag, minor plus 4"); # And check again that this croak is not delayed: { # local $Storable::DEBUGME = 1; local $Storable::accept_future_minor = 0; test_corrupt ($copy, $sub, "/^Storable binary image v$header->{major}\.$minor6 more recent than I am \\(v$header->{major}\.$minor\\)/", "higher minor"); } } ok (defined store(\%hash, $file), "store() returned defined value"); my $expected = 20 + length ($file_magic_str) + $other_magic + $fancy; my $length = -s $file; die "Don't seem to have written file '$file' as I can't get its length: $!" unless defined $file; die "Expected file to be $expected bytes (sizeof long is $Config{longsize}) but it is $length" unless $length == $expected; # Read the contents into memory: my $contents = slurp ($file); # Test the original direct from disk my $clone = retrieve $file; test_hash ($clone); # Then test it. test_things($contents, \&store_and_retrieve, 'file'); # And now try almost everything again with a Storable string my $stored = freeze \%hash; test_things($stored, \&freeze_and_thaw, 'string'); # Network order. unlink $file or die "Can't unlink '$file': $!"; ok (defined nstore(\%hash, $file), "nstore() returned defined value"); $expected = 20 + length ($file_magic_str) + $network_magic + $fancy; $length = -s $file; die "Don't seem to have written file '$file' as I can't get its length: $!" unless defined $file; die "Expected file to be $expected bytes (sizeof long is $Config{longsize}) but it is $length" unless $length == $expected; # Read the contents into memory: $contents = slurp ($file); # Test the original direct from disk $clone = retrieve $file; test_hash ($clone); # Then test it. test_things($contents, \&store_and_retrieve, 'file', 1); # And now try almost everything again with a Storable string $stored = nfreeze \%hash; test_things($stored, \&freeze_and_thaw, 'string', 1); # Test that the bug fixed by #20587 doesn't affect us under some older # Perl. AMS 20030901 { chop(my $a = chr(0xDF).chr(256)); my %a = (chr(0xDF) => 1); $a{$a}++; freeze \%a; # If we were built with -DDEBUGGING, the assert() should have killed # us, which will probably alert the user that something went wrong. ok(1); } # Unusual in that the empty string is stored with an SX_LSCALAR marker my $hash = store_and_retrieve("pst0\5\6\3\0\0\0\1\1\0\0\0\0\0\0\0\5empty"); ok(!$@, "no exception"); is(ref($hash), "HASH", "got a hash"); is($hash->{empty}, "", "got empty element"); PK ��[��t t t/tied_items.tnu �[��� #!./perl # # Copyright (c) 1995-2000, Raphael Manfredi # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # # # Tests ref to items in tied hash/array structures. # sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } $^W = 0; use Storable qw(dclone); use Test::More tests => 8; $Storable::flags = Storable::FLAGS_COMPAT; $h_fetches = 0; sub H::TIEHASH { bless \(my $x), "H" } sub H::FETCH { $h_fetches++; $_[1] - 70 } tie %h, "H"; $ref = \$h{77}; $ref2 = dclone $ref; is($h_fetches, 0); is($$ref2, $$ref); is($$ref2, 7); is($h_fetches, 2); $a_fetches = 0; sub A::TIEARRAY { bless \(my $x), "A" } sub A::FETCH { $a_fetches++; $_[1] - 70 } tie @a, "A"; $ref = \$a[78]; $ref2 = dclone $ref; is($a_fetches, 0); is($$ref2, $$ref); is($$ref2, 8); # a bug in 5.12 and earlier caused an extra FETCH is($a_fetches, $] < 5.013 ? 3 : 2); PK ��[ne G: : t/integer.tnu �[��� #!./perl -w # # Copyright 2002, Larry Wall. # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # # I ought to keep this test easily backwards compatible to 5.004, so no # qr//; # This test checks downgrade behaviour on pre-5.8 perls when new 5.8 features # are encountered. sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use Test::More; use Storable qw (dclone store retrieve freeze thaw nstore nfreeze); use strict; my $max_uv = ~0; my $max_uv_m1 = ~0 ^ 1; # Express it in this way so as not to use any addition, as 5.6 maths would # do this in NVs on 64 bit machines, and we're overflowing IVs so can't use # use integer. my $max_iv_p1 = $max_uv ^ ($max_uv >> 1); my $lots_of_9C = do { my $temp = sprintf "%#x", ~0; $temp =~ s/ff/9c/g; local $^W; eval $temp; }; my $max_iv = ~0 >> 1; my $min_iv = do {use integer; -$max_iv-1}; # 2s complement assumption my @processes = (["dclone", \&do_clone], ["freeze/thaw", \&freeze_and_thaw], ["nfreeze/thaw", \&nfreeze_and_thaw], ["store/retrieve", \&store_and_retrieve], ["nstore/retrieve", \&nstore_and_retrieve], ); my @numbers = (# IV bounds of 8 bits -1, 0, 1, -127, -128, -129, 42, 126, 127, 128, 129, 254, 255, 256, 257, # IV bounds of 32 bits -2147483647, -2147483648, -2147483649, 2147483646, 2147483647, 2147483648, # IV bounds $min_iv, do {use integer; $min_iv + 1}, do {use integer; $max_iv - 1}, $max_iv, # UV bounds at 32 bits 0x7FFFFFFF, 0x80000000, 0x80000001, 0xFFFFFFFF, 0xDEADBEEF, # UV bounds $max_iv_p1, $max_uv_m1, $max_uv, $lots_of_9C, # NV-UV conversion 2559831922.0, ); plan tests => @processes * @numbers * 5; my $file = "integer.$$"; die "Temporary file '$file' already exists" if -e $file; END { while (-f $file) {unlink $file or die "Can't unlink '$file': $!" }} sub do_clone { my $data = shift; my $copy = eval {dclone $data}; is ($@, '', 'Should be no error dcloning'); ok (1, "dlcone is only 1 process, not 2"); return $copy; } sub freeze_and_thaw { my $data = shift; my $frozen = eval {freeze $data}; is ($@, '', 'Should be no error freezing'); my $copy = eval {thaw $frozen}; is ($@, '', 'Should be no error thawing'); return $copy; } sub nfreeze_and_thaw { my $data = shift; my $frozen = eval {nfreeze $data}; is ($@, '', 'Should be no error nfreezing'); my $copy = eval {thaw $frozen}; is ($@, '', 'Should be no error thawing'); return $copy; } sub store_and_retrieve { my $data = shift; my $frozen = eval {store $data, $file}; is ($@, '', 'Should be no error storing'); my $copy = eval {retrieve $file}; is ($@, '', 'Should be no error retrieving'); return $copy; } sub nstore_and_retrieve { my $data = shift; my $frozen = eval {nstore $data, $file}; is ($@, '', 'Should be no error storing'); my $copy = eval {retrieve $file}; is ($@, '', 'Should be no error retrieving'); return $copy; } foreach (@processes) { my ($process, $sub) = @$_; foreach my $number (@numbers) { # as $number is an alias into @numbers, we don't want any side effects of # conversion macros affecting later runs, so pass a copy to Storable: my $copy1 = my $copy2 = my $copy0 = $number; my $copy_s = &$sub (\$copy0); if (is (ref $copy_s, "SCALAR", "got back a scalar ref?")) { # Test inside use integer to see if the bit pattern is identical # and outside to see if the sign is right. # On 5.8 we don't need this trickery anymore. # We really do need 2 copies here, as conversion may have side effect # bugs. In particular, I know that this happens: # perl5.00503 -le '$a = "-2147483649"; $a & 0; print $a; print $a+1' # -2147483649 # 2147483648 my $copy_s1 = my $copy_s2 = $$copy_s; # On 5.8 can do this with a straight ==, due to the integer/float maths # on 5.6 can't do this with # my $eq = do {use integer; $copy_s1 == $copy1} && $copy_s1 == $copy1; # because on builds with IV as long long it tickles bugs. # (Uncomment it and the Devel::Peek line below to see the messed up # state of the scalar, with PV showing the correct string for the # number, and IV holding a bogus value which has been truncated to 32 bits # So, check the bit patterns are identical, and check that the sign is the # same. This works on all the versions in all the sizes. # $eq = && (($copy_s1 <=> 0) == ($copy1 <=> 0)); # Split this into 2 tests, to cater for 5.005_03 # Aargh. Even this doesn't work because 5.6.x sends values with (same # number of decimal digits as ~0 + 1) via atof. So ^ is getting strings # cast to doubles cast to integers. And that truncates low order bits. # my $bit = ok (($copy_s1 ^ $copy1) == 0, "$process $copy1 (bitpattern)"); # Oh well; at least the parser gets it right. :-) my $copy_s3 = eval $copy_s1; die "Was supposed to have number $copy_s3, got error $@" unless defined $copy_s3; my $bit = ok (($copy_s3 ^ $copy1) == 0, "$process $copy1 (bitpattern)"); my $sign = ok (($copy_s2 <=> 0) == ($copy2 <=> 0), "$process $copy1 (sign)"); unless ($bit and $sign) { printf "# Passed in %s (%#x, %i)\n# got back '%s' (%#x, %i)\n", $copy1, $copy1, $copy1, $copy_s1, $copy_s1, $copy_s1; # use Devel::Peek; Dump $number; Dump $copy1; Dump $copy_s1; } # unless ($bit) { use Devel::Peek; Dump $copy_s1; Dump $$copy_s; } } else { fail ("$process $copy1"); fail ("$process $copy1"); } } } PK ��[6��� � t/circular_hook.tnu �[��� #!./perl -w # # Copyright 2005, Adam Kennedy. # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # # Man, blessed.t scared the hell out of me. For a second there I thought # I'd lose Test::More... # This file tests several known-error cases relating to STORABLE_attach, in # which Storable should (correctly) throw errors. sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } } use Storable (); use Test::More tests => 9; my $ddd = bless { }, 'Foo'; my $eee = bless { Bar => $ddd }, 'Bar'; $ddd->{Foo} = $eee; my $array = [ $ddd ]; my $string = Storable::freeze( $array ); my $thawed = Storable::thaw( $string ); # is_deeply infinite loops in circulars, so do it manually # is_deeply( $array, $thawed, 'Circular hooked objects work' ); is( ref($thawed), 'ARRAY', 'Top level ARRAY' ); is( scalar(@$thawed), 1, 'ARRAY contains one element' ); isa_ok( $thawed->[0], 'Foo' ); is( scalar(keys %{$thawed->[0]}), 1, 'Foo contains one element' ); isa_ok( $thawed->[0]->{Foo}, 'Bar' ); is( scalar(keys %{$thawed->[0]->{Foo}}), 1, 'Bar contains one element' ); isa_ok( $thawed->[0]->{Foo}->{Bar}, 'Foo' ); is( $thawed->[0], $thawed->[0]->{Foo}->{Bar}, 'Circular is... well... circular' ); # Make sure the thawing went the way we expected is_deeply( \@Foo::order, [ 'Bar', 'Foo' ], 'thaw order is correct (depth first)' ); package Foo; @order = (); sub STORABLE_freeze { my ($self, $clone) = @_; my $class = ref $self; # print "# Freezing $class\n"; return ($class, $self->{$class}); } sub STORABLE_thaw { my ($self, $clone, $string, @refs) = @_; my $class = ref $self; # print "# Thawing $class\n"; $self->{$class} = shift @refs; push @order, $class; return; } package Bar; BEGIN { @ISA = 'Foo'; } 1; PK ��[�R�� � t/tied.tnu �[��� #!./perl # # Copyright (c) 1995-2000, Raphael Manfredi # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # sub BEGIN { unshift @INC, 't'; unshift @INC, 't/compat' if $] < 5.006002; require Config; import Config; if ($ENV{PERL_CORE} and $Config{'extensions'} !~ /\bStorable\b/) { print "1..0 # Skip: Storable was not built\n"; exit 0; } require 'st-dump.pl'; } use Storable qw(freeze thaw); $Storable::flags = Storable::FLAGS_COMPAT; use Test::More tests => 25; ($scalar_fetch, $array_fetch, $hash_fetch) = (0, 0, 0); package TIED_HASH; sub TIEHASH { my $self = bless {}, shift; return $self; } sub FETCH { my $self = shift; my ($key) = @_; $main::hash_fetch++; return $self->{$key}; } sub STORE { my $self = shift; my ($key, $value) = @_; $self->{$key} = $value; } sub FIRSTKEY { my $self = shift; scalar keys %{$self}; return each %{$self}; } sub NEXTKEY { my $self = shift; return each %{$self}; } package TIED_ARRAY; sub TIEARRAY { my $self = bless [], shift; return $self; } sub FETCH { my $self = shift; my ($idx) = @_; $main::array_fetch++; return $self->[$idx]; } sub STORE { my $self = shift; my ($idx, $value) = @_; $self->[$idx] = $value; } sub FETCHSIZE { my $self = shift; return @{$self}; } package TIED_SCALAR; sub TIESCALAR { my $scalar; my $self = bless \$scalar, shift; return $self; } sub FETCH { my $self = shift; $main::scalar_fetch++; return $$self; } sub STORE { my $self = shift; my ($value) = @_; $$self = $value; } package FAULT; $fault = 0; sub TIESCALAR { my $pkg = shift; return bless [@_], $pkg; } sub FETCH { my $self = shift; my ($href, $key) = @$self; $fault++; untie $href->{$key}; return $href->{$key} = 1; } package main; $a = 'toto'; $b = \$a; $c = tie %hash, TIED_HASH; $d = tie @array, TIED_ARRAY; tie $scalar, TIED_SCALAR; #$scalar = 'foo'; #$hash{'attribute'} = \$d; #$array[0] = $c; #$array[1] = \$scalar; ### If I say ### $hash{'attribute'} = $d; ### below, then dump() incorrectly dumps the hash value as a string the second ### time it is reached. I have not investigated enough to tell whether it's ### a bug in my dump() routine or in the Perl tieing mechanism. $scalar = 'foo'; $hash{'attribute'} = 'plain value'; $array[0] = \$scalar; $array[1] = $c; $array[2] = \@array; @tied = (\$scalar, \@array, \%hash); %a = ('key', 'value', 1, 0, $a, $b, 'cvar', \$a, 'scalarref', \$scalar); @a = ('first', 3, -4, -3.14159, 456, 4.5, $d, \$d, $b, \$a, $a, $c, \$c, \%a, \@array, \%hash, \@tied); my $f = freeze(\@a); isnt($f, undef); $dumped = &dump(\@a); isnt($dumped, undef); $root = thaw($f); isnt($root, undef); $got = &dump($root); isnt($got, undef); ### Used to see the manifestation of the bug documented above. ### print "original: $dumped"; ### print "--------\n"; ### print "got: $got"; ### print "--------\n"; is($got, $dumped); $g = freeze($root); is(length $f, length $g); # Ensure the tied items in the retrieved image work @old = ($scalar_fetch, $array_fetch, $hash_fetch); @tied = ($tscalar, $tarray, $thash) = @{$root->[$#{$root}]}; @type = qw(SCALAR ARRAY HASH); is(ref tied $$tscalar, 'TIED_SCALAR'); is(ref tied @$tarray, 'TIED_ARRAY'); is(ref tied %$thash, 'TIED_HASH'); @new = ($$tscalar, $tarray->[0], $thash->{'attribute'}); @new = ($scalar_fetch, $array_fetch, $hash_fetch); # Tests 10..15 for ($i = 0; $i < @new; $i++) { is($new[$i], $old[$i] + 1); is(ref $tied[$i], $type[$i]); } # Check undef ties my $h = {}; tie $h->{'x'}, 'FAULT', $h, 'x'; my $hf = freeze($h); isnt($hf, undef); is($FAULT::fault, 0); is($h->{'x'}, 1); is($FAULT::fault, 1); my $ht = thaw($hf); isnt($ht, undef); is($ht->{'x'}, 1); is($FAULT::fault, 2); { package P; use Storable qw(freeze thaw); our ($a, $b); $b = "not ok "; sub TIESCALAR { bless \$a } sub FETCH { "ok " } tie $a, P; my $r = thaw freeze \$a; $b = $$r; main::is($b, "ok "); } { # blessed ref to tied object should be thawed blessed my @a; tie @a, TIED_ARRAY; my $r = bless \@a, 'FOO99'; my $f = freeze($r); my $t = thaw($f); isnt($t, undef); like("$t", qr/^FOO99=ARRAY/); } PK ��[��(א א Storable.xsnu �[��� /* -*- c-basic-offset: 4 -*- * * Fast store and retrieve mechanism. * * Copyright (c) 1995-2000, Raphael Manfredi * Copyright (c) 2016, 2017 cPanel Inc * Copyright (c) 2017 Reini Urban * * You may redistribute only under the same terms as Perl 5, as specified * in the README file that comes with the distribution. * */ #define PERL_NO_GET_CONTEXT /* we want efficiency */ #include <EXTERN.h> #include <perl.h> #include <XSUB.h> #ifndef PERL_VERSION_LT # if !defined(PERL_VERSION) || !defined(PERL_REVISION) || ( PERL_REVISION == 5 && ( PERL_VERSION < 10 || (PERL_VERSION == 10 && PERL_SUBVERSION < 1) ) ) # define NEED_PL_parser # define NEED_sv_2pv_flags # define NEED_load_module # define NEED_vload_module # define NEED_newCONSTSUB # define NEED_newSVpvn_flags # define NEED_newRV_noinc # endif #include "ppport.h" /* handle old perls */ #endif #ifdef DEBUGGING #define DEBUGME /* Debug mode, turns assertions on as well */ #define DASSERT /* Assertion mode */ #endif /* * Earlier versions of perl might be used, we can't assume they have the latest! */ /* perl <= 5.8.2 needs this */ #ifndef SvIsCOW # define SvIsCOW(sv) 0 #endif #ifndef HvRITER_set # define HvRITER_set(hv,r) (HvRITER(hv) = r) #endif #ifndef HvEITER_set # define HvEITER_set(hv,r) (HvEITER(hv) = r) #endif #ifndef HvRITER_get # define HvRITER_get HvRITER #endif #ifndef HvEITER_get # define HvEITER_get HvEITER #endif #ifndef HvPLACEHOLDERS_get # define HvPLACEHOLDERS_get HvPLACEHOLDERS #endif #ifndef HvTOTALKEYS # define HvTOTALKEYS(hv) HvKEYS(hv) #endif /* 5.6 */ #ifndef HvUSEDKEYS # define HvUSEDKEYS(hv) HvKEYS(hv) #endif #ifdef SVf_IsCOW # define SvTRULYREADONLY(sv) SvREADONLY(sv) #else # define SvTRULYREADONLY(sv) (SvREADONLY(sv) && !SvIsCOW(sv)) #endif #ifndef strEQc # define strEQc(s,c) memEQ(s, ("" c ""), sizeof(c)) #endif #if defined(HAS_FLOCK) || defined(FCNTL_CAN_LOCK) && defined(HAS_LOCKF) #define CAN_FLOCK &PL_sv_yes #else #define CAN_FLOCK &PL_sv_no #endif #ifdef DEBUGME #ifndef DASSERT #define DASSERT #endif /* * TRACEME() will only output things when the $Storable::DEBUGME is true, * using the value traceme cached in the context. * * * TRACEMED() directly looks at the variable, for use before traceme has been * updated. */ #define TRACEME(x) \ STMT_START { \ if (cxt->traceme) \ { PerlIO_stdoutf x; PerlIO_stdoutf("\n"); } \ } STMT_END #define TRACEMED(x) \ STMT_START { \ if (SvTRUE(get_sv("Storable::DEBUGME", GV_ADD))) \ { PerlIO_stdoutf x; PerlIO_stdoutf("\n"); } \ } STMT_END #define INIT_TRACEME \ STMT_START { \ cxt->traceme = SvTRUE(get_sv("Storable::DEBUGME", GV_ADD)); \ } STMT_END #else #define TRACEME(x) #define TRACEMED(x) #define INIT_TRACEME #endif /* DEBUGME */ #ifdef DASSERT #define ASSERT(x,y) \ STMT_START { \ if (!(x)) { \ PerlIO_stdoutf("ASSERT FAILED (\"%s\", line %d): ", \ __FILE__, (int)__LINE__); \ PerlIO_stdoutf y; PerlIO_stdoutf("\n"); \ } \ } STMT_END #else #define ASSERT(x,y) #endif /* * Type markers. */ #define C(x) ((char) (x)) /* For markers with dynamic retrieval handling */ #define SX_OBJECT C(0) /* Already stored object */ #define SX_LSCALAR C(1) /* Scalar (large binary) follows (length, data) */ #define SX_ARRAY C(2) /* Array forthcoming (size, item list) */ #define SX_HASH C(3) /* Hash forthcoming (size, key/value pair list) */ #define SX_REF C(4) /* Reference to object forthcoming */ #define SX_UNDEF C(5) /* Undefined scalar */ #define SX_INTEGER C(6) /* Integer forthcoming */ #define SX_DOUBLE C(7) /* Double forthcoming */ #define SX_BYTE C(8) /* (signed) byte forthcoming */ #define SX_NETINT C(9) /* Integer in network order forthcoming */ #define SX_SCALAR C(10) /* Scalar (binary, small) follows (length, data) */ #define SX_TIED_ARRAY C(11) /* Tied array forthcoming */ #define SX_TIED_HASH C(12) /* Tied hash forthcoming */ #define SX_TIED_SCALAR C(13) /* Tied scalar forthcoming */ #define SX_SV_UNDEF C(14) /* Perl's immortal PL_sv_undef */ #define SX_SV_YES C(15) /* Perl's immortal PL_sv_yes */ #define SX_SV_NO C(16) /* Perl's immortal PL_sv_no */ #define SX_BLESS C(17) /* Object is blessed */ #define SX_IX_BLESS C(18) /* Object is blessed, classname given by index */ #define SX_HOOK C(19) /* Stored via hook, user-defined */ #define SX_OVERLOAD C(20) /* Overloaded reference */ #define SX_TIED_KEY C(21) /* Tied magic key forthcoming */ #define SX_TIED_IDX C(22) /* Tied magic index forthcoming */ #define SX_UTF8STR C(23) /* UTF-8 string forthcoming (small) */ #define SX_LUTF8STR C(24) /* UTF-8 string forthcoming (large) */ #define SX_FLAG_HASH C(25) /* Hash with flags forthcoming (size, flags, key/flags/value triplet list) */ #define SX_CODE C(26) /* Code references as perl source code */ #define SX_WEAKREF C(27) /* Weak reference to object forthcoming */ #define SX_WEAKOVERLOAD C(28) /* Overloaded weak reference */ #define SX_VSTRING C(29) /* vstring forthcoming (small) */ #define SX_LVSTRING C(30) /* vstring forthcoming (large) */ #define SX_SVUNDEF_ELEM C(31) /* array element set to &PL_sv_undef */ #define SX_REGEXP C(32) /* Regexp */ #define SX_LOBJECT C(33) /* Large object: string, array or hash (size >2G) */ #define SX_LAST C(34) /* invalid. marker only */ /* * Those are only used to retrieve "old" pre-0.6 binary images. */ #define SX_ITEM 'i' /* An array item introducer */ #define SX_IT_UNDEF 'I' /* Undefined array item */ #define SX_KEY 'k' /* A hash key introducer */ #define SX_VALUE 'v' /* A hash value introducer */ #define SX_VL_UNDEF 'V' /* Undefined hash value */ /* * Those are only used to retrieve "old" pre-0.7 binary images */ #define SX_CLASS 'b' /* Object is blessed, class name length <255 */ #define SX_LG_CLASS 'B' /* Object is blessed, class name length >255 */ #define SX_STORED 'X' /* End of object */ /* * Limits between short/long length representation. */ #define LG_SCALAR 255 /* Large scalar length limit */ #define LG_BLESS 127 /* Large classname bless limit */ /* * Operation types */ #define ST_STORE 0x1 /* Store operation */ #define ST_RETRIEVE 0x2 /* Retrieval operation */ #define ST_CLONE 0x4 /* Deep cloning operation */ /* * The following structure is used for hash table key retrieval. Since, when * retrieving objects, we'll be facing blessed hash references, it's best * to pre-allocate that buffer once and resize it as the need arises, never * freeing it (keys will be saved away someplace else anyway, so even large * keys are not enough a motivation to reclaim that space). * * This structure is also used for memory store/retrieve operations which * happen in a fixed place before being malloc'ed elsewhere if persistence * is required. Hence the aptr pointer. */ struct extendable { char *arena; /* Will hold hash key strings, resized as needed */ STRLEN asiz; /* Size of aforementioned buffer */ char *aptr; /* Arena pointer, for in-place read/write ops */ char *aend; /* First invalid address */ }; /* * At store time: * A hash table records the objects which have already been stored. * Those are referred to as SX_OBJECT in the file, and their "tag" (i.e. * an arbitrary sequence number) is used to identify them. * * At retrieve time: * An array table records the objects which have already been retrieved, * as seen by the tag determined by counting the objects themselves. The * reference to that retrieved object is kept in the table, and is returned * when an SX_OBJECT is found bearing that same tag. * * The same processing is used to record "classname" for blessed objects: * indexing by a hash at store time, and via an array at retrieve time. */ typedef unsigned long stag_t; /* Used by pre-0.6 binary format */ /* * Make the tag type 64-bit on 64-bit platforms. * * If the tag number is low enough it's stored as a 32-bit value, but * with very large arrays and hashes it's possible to go over 2**32 * scalars. */ typedef STRLEN ntag_t; /* used for where_is_undef - marks an unset value */ #define UNSET_NTAG_T (~(ntag_t)0) /* * The following "thread-safe" related defines were contributed by * Murray Nesbitt <murray@activestate.com> and integrated by RAM, who * only renamed things a little bit to ensure consistency with surrounding * code. -- RAM, 14/09/1999 * * The original patch suffered from the fact that the stcxt_t structure * was global. Murray tried to minimize the impact on the code as much as * possible. * * Starting with 0.7, Storable can be re-entrant, via the STORABLE_xxx hooks * on objects. Therefore, the notion of context needs to be generalized, * threading or not. */ #define MY_VERSION "Storable(" XS_VERSION ")" /* * Conditional UTF8 support. * */ #define STORE_UTF8STR(pv, len) STORE_PV_LEN(pv, len, SX_UTF8STR, SX_LUTF8STR) #define HAS_UTF8_SCALARS #ifdef HeKUTF8 #define HAS_UTF8_HASHES #define HAS_UTF8_ALL #else /* 5.6 perl has utf8 scalars but not hashes */ #endif #ifndef HAS_UTF8_ALL #define UTF8_CROAK() CROAK(("Cannot retrieve UTF8 data in non-UTF8 perl")) #endif #ifndef SvWEAKREF #define WEAKREF_CROAK() CROAK(("Cannot retrieve weak references in this perl")) #endif #ifndef SvVOK #define VSTRING_CROAK() CROAK(("Cannot retrieve vstring in this perl")) #endif #ifdef HvPLACEHOLDERS #define HAS_RESTRICTED_HASHES #else #define HVhek_PLACEHOLD 0x200 #define RESTRICTED_HASH_CROAK() CROAK(("Cannot retrieve restricted hash")) #endif #ifdef HvHASKFLAGS #define HAS_HASH_KEY_FLAGS #endif #ifdef ptr_table_new #define USE_PTR_TABLE #endif /* do we need/want to clear padding on NVs? */ #if defined(LONG_DOUBLEKIND) && defined(USE_LONG_DOUBLE) # if LONG_DOUBLEKIND == LONG_DOUBLE_IS_X86_80_BIT_LITTLE_ENDIAN || \ LONG_DOUBLEKIND == LONG_DOUBLE_IS_X86_80_BIT_BIG_ENDIAN # define NV_PADDING (NVSIZE - 10) # else # define NV_PADDING 0 # endif #else /* This is kind of a guess - it means we'll get an unneeded clear on 128-bit NV but an upgraded perl will fix that */ # if NVSIZE > 8 # define NV_CLEAR # endif # define NV_PADDING 0 #endif typedef union { NV nv; U8 bytes[sizeof(NV)]; } NV_bytes; /* Needed for 32bit with lengths > 2G - 4G, and 64bit */ #if PTRSIZE > 4 #define HAS_U64 #endif /* * Fields s_tainted and s_dirty are prefixed with s_ because Perl's include * files remap tainted and dirty when threading is enabled. That's bad for * perl to remap such common words. -- RAM, 29/09/00 */ struct stcxt; typedef struct stcxt { int entry; /* flags recursion */ int optype; /* type of traversal operation */ /* which objects have been seen, store time. tags are numbers, which are cast to (SV *) and stored directly */ #ifdef USE_PTR_TABLE /* use pseen if we have ptr_tables. We have to store tag+1, because tag numbers start at 0, and we can't store (SV *) 0 in a ptr_table without it being confused for a fetch lookup failure. */ struct ptr_tbl *pseen; /* Still need hseen for the 0.6 file format code. */ #endif HV *hseen; AV *hook_seen; /* which SVs were returned by STORABLE_freeze() */ AV *aseen; /* which objects have been seen, retrieve time */ ntag_t where_is_undef; /* index in aseen of PL_sv_undef */ HV *hclass; /* which classnames have been seen, store time */ AV *aclass; /* which classnames have been seen, retrieve time */ HV *hook; /* cache for hook methods per class name */ IV tagnum; /* incremented at store time for each seen object */ IV classnum; /* incremented at store time for each seen classname */ int netorder; /* true if network order used */ int s_tainted; /* true if input source is tainted, at retrieve time */ int forgive_me; /* whether to be forgiving... */ int deparse; /* whether to deparse code refs */ SV *eval; /* whether to eval source code */ int canonical; /* whether to store hashes sorted by key */ #ifndef HAS_RESTRICTED_HASHES int derestrict; /* whether to downgrade restricted hashes */ #endif #ifndef HAS_UTF8_ALL int use_bytes; /* whether to bytes-ify utf8 */ #endif int accept_future_minor; /* croak immediately on future minor versions? */ int s_dirty; /* context is dirty due to CROAK() -- can be cleaned */ int membuf_ro; /* true means membuf is read-only and msaved is rw */ struct extendable keybuf; /* for hash key retrieval */ struct extendable membuf; /* for memory store/retrieve operations */ struct extendable msaved; /* where potentially valid mbuf is saved */ PerlIO *fio; /* where I/O are performed, NULL for memory */ int ver_major; /* major of version for retrieved object */ int ver_minor; /* minor of version for retrieved object */ SV *(**retrieve_vtbl)(pTHX_ struct stcxt *, const char *); /* retrieve dispatch table */ SV *prev; /* contexts chained backwards in real recursion */ SV *my_sv; /* the blessed scalar who's SvPVX() I am */ /* recur_sv: A hashref of hashrefs or arrayref of arrayrefs is actually a chain of four SVs, eg for an array ref containing an array ref: RV -> AV (element) -> RV -> AV To make this depth appear natural from a perl level we only want to count this as two levels, so store_ref() stores it's RV into recur_sv and store_array()/store_hash() will only count that level if the AV/HV *isn't* recur_sv. We can't just have store_hash()/store_array() not count that level, since it's possible for XS code to store an AV or HV directly as an element (though perl code trying to access such an object will generally croak.) */ SV *recur_sv; /* check only one recursive SV */ int in_retrieve_overloaded; /* performance hack for retrieving overloaded objects */ int flags; /* controls whether to bless or tie objects */ IV recur_depth; /* avoid stack overflows RT #97526 */ IV max_recur_depth; /* limit for recur_depth */ IV max_recur_depth_hash; /* limit for recur_depth for hashes */ #ifdef DEBUGME int traceme; /* TRACEME() produces output */ #endif } stcxt_t; #define RECURSION_TOO_DEEP() \ (cxt->max_recur_depth != -1 && ++cxt->recur_depth > cxt->max_recur_depth) /* There's cases where we need to check whether the hash recursion limit has been reached without bumping the recursion levels, so the hash check doesn't bump the depth. */ #define RECURSION_TOO_DEEP_HASH() \ (cxt->max_recur_depth_hash != -1 && cxt->recur_depth > cxt->max_recur_depth_hash) #define MAX_DEPTH_ERROR "Max. recursion depth with nested structures exceeded" static int storable_free(pTHX_ SV *sv, MAGIC* mg); static MGVTBL vtbl_storable = { NULL, /* get */ NULL, /* set */ NULL, /* len */ NULL, /* clear */ storable_free, #ifdef MGf_COPY NULL, /* copy */ #endif #ifdef MGf_DUP NULL, /* dup */ #endif #ifdef MGf_LOCAL NULL /* local */ #endif }; /* From Digest::MD5. */ #ifndef sv_magicext # define sv_magicext(sv, obj, type, vtbl, name, namlen) \ THX_sv_magicext(aTHX_ sv, obj, type, vtbl, name, namlen) static MAGIC *THX_sv_magicext(pTHX_ SV *sv, SV *obj, int type, MGVTBL const *vtbl, char const *name, I32 namlen) { MAGIC *mg; if (obj || namlen) /* exceeded intended usage of this reserve implementation */ return NULL; Newxz(mg, 1, MAGIC); mg->mg_virtual = (MGVTBL*)vtbl; mg->mg_type = type; mg->mg_ptr = (char *)name; mg->mg_len = -1; (void) SvUPGRADE(sv, SVt_PVMG); mg->mg_moremagic = SvMAGIC(sv); SvMAGIC_set(sv, mg); SvMAGICAL_off(sv); mg_magical(sv); return mg; } #endif #define NEW_STORABLE_CXT_OBJ(cxt) \ STMT_START { \ SV *self = newSV(sizeof(stcxt_t) - 1); \ SV *my_sv = newRV_noinc(self); \ sv_magicext(self, NULL, PERL_MAGIC_ext, &vtbl_storable, NULL, 0); \ cxt = (stcxt_t *)SvPVX(self); \ Zero(cxt, 1, stcxt_t); \ cxt->my_sv = my_sv; \ } STMT_END #if defined(MULTIPLICITY) || defined(PERL_OBJECT) || defined(PERL_CAPI) #define dSTCXT_SV \ SV *perinterp_sv = *hv_fetch(PL_modglobal, \ MY_VERSION, sizeof(MY_VERSION)-1, TRUE) #define dSTCXT_PTR(T,name) \ T name = ((perinterp_sv \ && SvIOK(perinterp_sv) && SvIVX(perinterp_sv) \ ? (T)SvPVX(SvRV(INT2PTR(SV*,SvIVX(perinterp_sv)))) : (T) 0)) #define dSTCXT \ dSTCXT_SV; \ dSTCXT_PTR(stcxt_t *, cxt) #define INIT_STCXT \ dSTCXT; \ NEW_STORABLE_CXT_OBJ(cxt); \ assert(perinterp_sv); \ sv_setiv(perinterp_sv, PTR2IV(cxt->my_sv)) #define SET_STCXT(x) \ STMT_START { \ dSTCXT_SV; \ sv_setiv(perinterp_sv, PTR2IV(x->my_sv)); \ } STMT_END #else /* !MULTIPLICITY && !PERL_OBJECT && !PERL_CAPI */ static stcxt_t *Context_ptr = NULL; #define dSTCXT stcxt_t *cxt = Context_ptr #define SET_STCXT(x) Context_ptr = x #define INIT_STCXT \ dSTCXT; \ NEW_STORABLE_CXT_OBJ(cxt); \ SET_STCXT(cxt) #endif /* MULTIPLICITY || PERL_OBJECT || PERL_CAPI */ /* * KNOWN BUG: * Croaking implies a memory leak, since we don't use setjmp/longjmp * to catch the exit and free memory used during store or retrieve * operations. This is not too difficult to fix, but I need to understand * how Perl does it, and croaking is exceptional anyway, so I lack the * motivation to do it. * * The current workaround is to mark the context as dirty when croaking, * so that data structures can be freed whenever we renter Storable code * (but only *then*: it's a workaround, not a fix). * * This is also imperfect, because we don't really know how far they trapped * the croak(), and when we were recursing, we won't be able to clean anything * but the topmost context stacked. */ #define CROAK(x) STMT_START { cxt->s_dirty = 1; croak x; } STMT_END /* * End of "thread-safe" related definitions. */ /* * LOW_32BITS * * Keep only the low 32 bits of a pointer (used for tags, which are not * really pointers). */ #if PTRSIZE <= 4 #define LOW_32BITS(x) ((I32) (x)) #else #define LOW_32BITS(x) ((I32) ((STRLEN) (x) & 0xffffffffUL)) #endif /* * PTR2TAG(x) * * Convert a pointer into an ntag_t. */ #define PTR2TAG(x) ((ntag_t)(x)) #define TAG2PTR(x, type) ((y)(x)) /* * oI, oS, oC * * Hack for Crays, where sizeof(I32) == 8, and which are big-endians. * Used in the WLEN and RLEN macros. */ #if INTSIZE > 4 #define oI(x) ((I32 *) ((char *) (x) + 4)) #define oS(x) ((x) - 4) #define oL(x) (x) #define oC(x) (x = 0) #define CRAY_HACK #else #define oI(x) (x) #define oS(x) (x) #define oL(x) (x) #define oC(x) #endif /* * key buffer handling */ #define kbuf (cxt->keybuf).arena #define ksiz (cxt->keybuf).asiz #define KBUFINIT() \ STMT_START { \ if (!kbuf) { \ TRACEME(("** allocating kbuf of 128 bytes")); \ New(10003, kbuf, 128, char); \ ksiz = 128; \ } \ } STMT_END #define KBUFCHK(x) \ STMT_START { \ if (x >= ksiz) { \ if (x >= I32_MAX) \ CROAK(("Too large size > I32_MAX")); \ TRACEME(("** extending kbuf to %d bytes (had %d)", \ (int)(x+1), (int)ksiz)); \ Renew(kbuf, x+1, char); \ ksiz = x+1; \ } \ } STMT_END /* * memory buffer handling */ #define mbase (cxt->membuf).arena #define msiz (cxt->membuf).asiz #define mptr (cxt->membuf).aptr #define mend (cxt->membuf).aend #define MGROW (1 << 13) #define MMASK (MGROW - 1) #define round_mgrow(x) \ ((STRLEN) (((STRLEN) (x) + MMASK) & ~MMASK)) #define trunc_int(x) \ ((STRLEN) ((STRLEN) (x) & ~(sizeof(int)-1))) #define int_aligned(x) \ ((STRLEN)(x) == trunc_int(x)) #define MBUF_INIT(x) \ STMT_START { \ if (!mbase) { \ TRACEME(("** allocating mbase of %d bytes", MGROW)); \ New(10003, mbase, (int)MGROW, char); \ msiz = (STRLEN)MGROW; \ } \ mptr = mbase; \ if (x) \ mend = mbase + x; \ else \ mend = mbase + msiz; \ } STMT_END #define MBUF_TRUNC(x) mptr = mbase + x #define MBUF_SIZE() (mptr - mbase) /* * MBUF_SAVE_AND_LOAD * MBUF_RESTORE * * Those macros are used in do_retrieve() to save the current memory * buffer into cxt->msaved, before MBUF_LOAD() can be used to retrieve * data from a string. */ #define MBUF_SAVE_AND_LOAD(in) \ STMT_START { \ ASSERT(!cxt->membuf_ro, ("mbase not already saved")); \ cxt->membuf_ro = 1; \ TRACEME(("saving mbuf")); \ StructCopy(&cxt->membuf, &cxt->msaved, struct extendable); \ MBUF_LOAD(in); \ } STMT_END #define MBUF_RESTORE() \ STMT_START { \ ASSERT(cxt->membuf_ro, ("mbase is read-only")); \ cxt->membuf_ro = 0; \ TRACEME(("restoring mbuf")); \ StructCopy(&cxt->msaved, &cxt->membuf, struct extendable); \ } STMT_END /* * Use SvPOKp(), because SvPOK() fails on tainted scalars. * See store_scalar() for other usage of this workaround. */ #define MBUF_LOAD(v) \ STMT_START { \ ASSERT(cxt->membuf_ro, ("mbase is read-only")); \ if (!SvPOKp(v)) \ CROAK(("Not a scalar string")); \ mptr = mbase = SvPV(v, msiz); \ mend = mbase + msiz; \ } STMT_END #define MBUF_XTEND(x) \ STMT_START { \ STRLEN nsz = (STRLEN) round_mgrow((x)+msiz); \ STRLEN offset = mptr - mbase; \ ASSERT(!cxt->membuf_ro, ("mbase is not read-only")); \ TRACEME(("** extending mbase from %lu to %lu bytes (wants %lu new)", \ (unsigned long)msiz, (unsigned long)nsz, (unsigned long)(x))); \ Renew(mbase, nsz, char); \ msiz = nsz; \ mptr = mbase + offset; \ mend = mbase + nsz; \ } STMT_END #define MBUF_CHK(x) \ STMT_START { \ if ((mptr + (x)) > mend) \ MBUF_XTEND(x); \ } STMT_END #define MBUF_GETC(x) \ STMT_START { \ if (mptr < mend) \ x = (int) (unsigned char) *mptr++; \ else \ return (SV *) 0; \ } STMT_END #ifdef CRAY_HACK #define MBUF_GETINT(x) \ STMT_START { \ oC(x); \ if ((mptr + 4) <= mend) { \ memcpy(oI(&x), mptr, 4); \ mptr += 4; \ } else \ return (SV *) 0; \ } STMT_END #else #define MBUF_GETINT(x) \ STMT_START { \ if ((mptr + sizeof(int)) <= mend) { \ if (int_aligned(mptr)) \ x = *(int *) mptr; \ else \ memcpy(&x, mptr, sizeof(int)); \ mptr += sizeof(int); \ } else \ return (SV *) 0; \ } STMT_END #endif #define MBUF_READ(x,s) \ STMT_START { \ if ((mptr + (s)) <= mend) { \ memcpy(x, mptr, s); \ mptr += s; \ } else \ return (SV *) 0; \ } STMT_END #define MBUF_SAFEREAD(x,s,z) \ STMT_START { \ if ((mptr + (s)) <= mend) { \ memcpy(x, mptr, s); \ mptr += s; \ } else { \ sv_free(z); \ return (SV *) 0; \ } \ } STMT_END #define MBUF_SAFEPVREAD(x,s,z) \ STMT_START { \ if ((mptr + (s)) <= mend) { \ memcpy(x, mptr, s); \ mptr += s; \ } else { \ Safefree(z); \ return (SV *) 0; \ } \ } STMT_END #define MBUF_PUTC(c) \ STMT_START { \ if (mptr < mend) \ *mptr++ = (char) c; \ else { \ MBUF_XTEND(1); \ *mptr++ = (char) c; \ } \ } STMT_END #ifdef CRAY_HACK #define MBUF_PUTINT(i) \ STMT_START { \ MBUF_CHK(4); \ memcpy(mptr, oI(&i), 4); \ mptr += 4; \ } STMT_END #else #define MBUF_PUTINT(i) \ STMT_START { \ MBUF_CHK(sizeof(int)); \ if (int_aligned(mptr)) \ *(int *) mptr = i; \ else \ memcpy(mptr, &i, sizeof(int)); \ mptr += sizeof(int); \ } STMT_END #endif #define MBUF_PUTLONG(l) \ STMT_START { \ MBUF_CHK(8); \ memcpy(mptr, &l, 8); \ mptr += 8; \ } STMT_END #define MBUF_WRITE(x,s) \ STMT_START { \ MBUF_CHK(s); \ memcpy(mptr, x, s); \ mptr += s; \ } STMT_END /* * Possible return values for sv_type(). */ #define svis_REF 0 #define svis_SCALAR 1 #define svis_ARRAY 2 #define svis_HASH 3 #define svis_TIED 4 #define svis_TIED_ITEM 5 #define svis_CODE 6 #define svis_REGEXP 7 #define svis_OTHER 8 /* * Flags for SX_HOOK. */ #define SHF_TYPE_MASK 0x03 #define SHF_LARGE_CLASSLEN 0x04 #define SHF_LARGE_STRLEN 0x08 #define SHF_LARGE_LISTLEN 0x10 #define SHF_IDX_CLASSNAME 0x20 #define SHF_NEED_RECURSE 0x40 #define SHF_HAS_LIST 0x80 /* * Types for SX_HOOK (last 2 bits in flags). */ #define SHT_SCALAR 0 #define SHT_ARRAY 1 #define SHT_HASH 2 #define SHT_EXTRA 3 /* Read extra byte for type */ /* * The following are held in the "extra byte"... */ #define SHT_TSCALAR 4 /* 4 + 0 -- tied scalar */ #define SHT_TARRAY 5 /* 4 + 1 -- tied array */ #define SHT_THASH 6 /* 4 + 2 -- tied hash */ /* * per hash flags for flagged hashes */ #define SHV_RESTRICTED 0x01 /* * per key flags for flagged hashes */ #define SHV_K_UTF8 0x01 #define SHV_K_WASUTF8 0x02 #define SHV_K_LOCKED 0x04 #define SHV_K_ISSV 0x08 #define SHV_K_PLACEHOLDER 0x10 /* * flags to allow blessing and/or tieing data the data we load */ #define FLAG_BLESS_OK 2 #define FLAG_TIE_OK 4 /* * Flags for SX_REGEXP. */ #define SHR_U32_RE_LEN 0x01 /* * Before 0.6, the magic string was "perl-store" (binary version number 0). * * Since 0.6 introduced many binary incompatibilities, the magic string has * been changed to "pst0" to allow an old image to be properly retrieved by * a newer Storable, but ensure a newer image cannot be retrieved with an * older version. * * At 0.7, objects are given the ability to serialize themselves, and the * set of markers is extended, backward compatibility is not jeopardized, * so the binary version number could have remained unchanged. To correctly * spot errors if a file making use of 0.7-specific extensions is given to * 0.6 for retrieval, the binary version was moved to "2". And I'm introducing * a "minor" version, to better track this kind of evolution from now on. * */ static const char old_magicstr[] = "perl-store"; /* Magic number before 0.6 */ static const char magicstr[] = "pst0"; /* Used as a magic number */ #define MAGICSTR_BYTES 'p','s','t','0' #define OLDMAGICSTR_BYTES 'p','e','r','l','-','s','t','o','r','e' /* 5.6.x introduced the ability to have IVs as long long. However, Configure still defined BYTEORDER based on the size of a long. Storable uses the BYTEORDER value as part of the header, but doesn't explicitly store sizeof(IV) anywhere in the header. Hence on 5.6.x built with IV as long long on a platform that uses Configure (ie most things except VMS and Windows) headers are identical for the different IV sizes, despite the files containing some fields based on sizeof(IV) Erk. Broken-ness. 5.8 is consistent - the following redefinition kludge is only needed on 5.6.x, but the interwork is needed on 5.8 while data survives in files with the 5.6 header. */ #if defined (IVSIZE) && (IVSIZE == 8) && (LONGSIZE == 4) #ifndef NO_56_INTERWORK_KLUDGE #define USE_56_INTERWORK_KLUDGE #endif #if BYTEORDER == 0x1234 #undef BYTEORDER #define BYTEORDER 0x12345678 #else #if BYTEORDER == 0x4321 #undef BYTEORDER #define BYTEORDER 0x87654321 #endif #endif #endif #if BYTEORDER == 0x1234 #define BYTEORDER_BYTES '1','2','3','4' #else #if BYTEORDER == 0x12345678 #define BYTEORDER_BYTES '1','2','3','4','5','6','7','8' #ifdef USE_56_INTERWORK_KLUDGE #define BYTEORDER_BYTES_56 '1','2','3','4' #endif #else #if BYTEORDER == 0x87654321 #define BYTEORDER_BYTES '8','7','6','5','4','3','2','1' #ifdef USE_56_INTERWORK_KLUDGE #define BYTEORDER_BYTES_56 '4','3','2','1' #endif #else #if BYTEORDER == 0x4321 #define BYTEORDER_BYTES '4','3','2','1' #else #error Unknown byteorder. Please append your byteorder to Storable.xs #endif #endif #endif #endif #ifndef INT32_MAX # define INT32_MAX 2147483647 #endif #if IVSIZE > 4 && !defined(INT64_MAX) # define INT64_MAX 9223372036854775807LL #endif static const char byteorderstr[] = {BYTEORDER_BYTES, 0}; #ifdef USE_56_INTERWORK_KLUDGE static const char byteorderstr_56[] = {BYTEORDER_BYTES_56, 0}; #endif #define STORABLE_BIN_MAJOR 2 /* Binary major "version" */ #define STORABLE_BIN_MINOR 11 /* Binary minor "version" */ #if !defined (SvVOK) /* * Perl 5.6.0-5.8.0 can do weak references, but not vstring magic. */ #define STORABLE_BIN_WRITE_MINOR 8 #elif PERL_VERSION_GE(5,19,0) /* Perl 5.19 takes away the special meaning of PL_sv_undef in arrays. */ /* With 3.x we added LOBJECT */ #define STORABLE_BIN_WRITE_MINOR 11 #else #define STORABLE_BIN_WRITE_MINOR 9 #endif #if PERL_VERSION_LT(5,8,1) #define PL_sv_placeholder PL_sv_undef #endif /* * Useful store shortcuts... */ /* * Note that if you put more than one mark for storing a particular * type of thing, *and* in the retrieve_foo() function you mark both * the thingy's you get off with SEEN(), you *must* increase the * tagnum with cxt->tagnum++ along with this macro! * - samv 20Jan04 */ #define PUTMARK(x) \ STMT_START { \ if (!cxt->fio) \ MBUF_PUTC(x); \ else if (PerlIO_putc(cxt->fio, x) == EOF) \ return -1; \ } STMT_END #define WRITE_I32(x) \ STMT_START { \ ASSERT(sizeof(x) == sizeof(I32), ("writing an I32")); \ if (!cxt->fio) \ MBUF_PUTINT(x); \ else if (PerlIO_write(cxt->fio, oI(&x), \ oS(sizeof(x))) != oS(sizeof(x))) \ return -1; \ } STMT_END #define WRITE_U64(x) \ STMT_START { \ ASSERT(sizeof(x) == sizeof(UV), ("writing an UV")); \ if (!cxt->fio) \ MBUF_PUTLONG(x); \ else if (PerlIO_write(cxt->fio, oL(&x), \ oS(sizeof(x))) != oS(sizeof(x))) \ return -1; \ } STMT_END #ifdef HAS_HTONL #define WLEN(x) \ STMT_START { \ ASSERT(sizeof(x) == sizeof(int), ("WLEN writing an int")); \ if (cxt->netorder) { \ int y = (int) htonl(x); \ if (!cxt->fio) \ MBUF_PUTINT(y); \ else if (PerlIO_write(cxt->fio,oI(&y),oS(sizeof(y))) != oS(sizeof(y))) \ return -1; \ } else { \ if (!cxt->fio) \ MBUF_PUTINT(x); \ else if (PerlIO_write(cxt->fio,oI(&x), \ oS(sizeof(x))) != oS(sizeof(x))) \ return -1; \ } \ } STMT_END # ifdef HAS_U64 #define W64LEN(x) \ STMT_START { \ ASSERT(sizeof(x) == 8, ("W64LEN writing a U64")); \ if (cxt->netorder) { \ U32 buf[2]; \ buf[1] = htonl(x & 0xffffffffUL); \ buf[0] = htonl(x >> 32); \ if (!cxt->fio) \ MBUF_PUTLONG(buf); \ else if (PerlIO_write(cxt->fio, buf, \ sizeof(buf)) != sizeof(buf)) \ return -1; \ } else { \ if (!cxt->fio) \ MBUF_PUTLONG(x); \ else if (PerlIO_write(cxt->fio,oI(&x), \ oS(sizeof(x))) != oS(sizeof(x))) \ return -1; \ } \ } STMT_END # else #define W64LEN(x) CROAK(("No 64bit UVs")) # endif #else #define WLEN(x) WRITE_I32(x) #ifdef HAS_U64 #define W64LEN(x) WRITE_U64(x) #else #define W64LEN(x) CROAK(("no 64bit UVs")) #endif #endif #define WRITE(x,y) \ STMT_START { \ if (!cxt->fio) \ MBUF_WRITE(x,y); \ else if (PerlIO_write(cxt->fio, x, y) != (SSize_t)y) \ return -1; \ } STMT_END #define STORE_PV_LEN(pv, len, small, large) \ STMT_START { \ if (len <= LG_SCALAR) { \ int ilen = (int) len; \ unsigned char clen = (unsigned char) len; \ PUTMARK(small); \ PUTMARK(clen); \ if (len) \ WRITE(pv, ilen); \ } else if (sizeof(len) > 4 && len > INT32_MAX) { \ PUTMARK(SX_LOBJECT); \ PUTMARK(large); \ W64LEN(len); \ WRITE(pv, len); \ } else { \ int ilen = (int) len; \ PUTMARK(large); \ WLEN(ilen); \ WRITE(pv, ilen); \ } \ } STMT_END #define STORE_SCALAR(pv, len) STORE_PV_LEN(pv, len, SX_SCALAR, SX_LSCALAR) /* * Store &PL_sv_undef in arrays without recursing through store(). We * actually use this to represent nonexistent elements, for historical * reasons. */ #define STORE_SV_UNDEF() \ STMT_START { \ cxt->tagnum++; \ PUTMARK(SX_SV_UNDEF); \ } STMT_END /* * Useful retrieve shortcuts... */ #define GETCHAR() \ (cxt->fio ? PerlIO_getc(cxt->fio) \ : (mptr >= mend ? EOF : (int) *mptr++)) #define GETMARK(x) \ STMT_START { \ if (!cxt->fio) \ MBUF_GETC(x); \ else if ((int) (x = PerlIO_getc(cxt->fio)) == EOF) \ return (SV *) 0; \ } STMT_END #define READ_I32(x) \ STMT_START { \ ASSERT(sizeof(x) == sizeof(I32), ("reading an I32")); \ oC(x); \ if (!cxt->fio) \ MBUF_GETINT(x); \ else if (PerlIO_read(cxt->fio, oI(&x), \ oS(sizeof(x))) != oS(sizeof(x))) \ return (SV *) 0; \ } STMT_END #ifdef HAS_NTOHL #define RLEN(x) \ STMT_START { \ oC(x); \ if (!cxt->fio) \ MBUF_GETINT(x); \ else if (PerlIO_read(cxt->fio, oI(&x), \ oS(sizeof(x))) != oS(sizeof(x))) \ return (SV *) 0; \ if (cxt->netorder) \ x = (int) ntohl(x); \ } STMT_END #else #define RLEN(x) READ_I32(x) #endif #define READ(x,y) \ STMT_START { \ if (!cxt->fio) \ MBUF_READ(x, y); \ else if (PerlIO_read(cxt->fio, x, y) != (SSize_t)y) \ return (SV *) 0; \ } STMT_END #define SAFEREAD(x,y,z) \ STMT_START { \ if (!cxt->fio) \ MBUF_SAFEREAD(x,y,z); \ else if (PerlIO_read(cxt->fio, x, y) != (SSize_t)y) { \ sv_free(z); \ return (SV *) 0; \ } \ } STMT_END #define SAFEPVREAD(x,y,z) \ STMT_START { \ if (!cxt->fio) \ MBUF_SAFEPVREAD(x,y,z); \ else if (PerlIO_read(cxt->fio, x, y) != y) { \ Safefree(z); \ return (SV *) 0; \ } \ } STMT_END #ifdef HAS_U64 # if defined(HAS_NTOHL) # define Sntohl(x) ntohl(x) # elif BYTEORDER == 0x87654321 || BYTEORDER == 0x4321 # define Sntohl(x) (x) # else static U32 Sntohl(U32 x) { return (((U8) x) << 24) + ((x & 0xFF00) << 8) + ((x & 0xFF0000) >> 8) + ((x & 0xFF000000) >> 24); } # endif # define READ_U64(x) \ STMT_START { \ ASSERT(sizeof(x) == 8, ("R64LEN reading a U64")); \ if (cxt->netorder) { \ U32 buf[2]; \ READ((void *)buf, sizeof(buf)); \ (x) = ((UV)Sntohl(buf[0]) << 32) + Sntohl(buf[1]); \ } \ else { \ READ(&(x), sizeof(x)); \ } \ } STMT_END #endif /* * SEEN() is used at retrieve time, to remember where object 'y', bearing a * given tag 'tagnum', has been retrieved. Next time we see an SX_OBJECT marker, * we'll therefore know where it has been retrieved and will be able to * share the same reference, as in the original stored memory image. * * We also need to bless objects ASAP for hooks (which may compute "ref $x" * on the objects given to STORABLE_thaw and expect that to be defined), and * also for overloaded objects (for which we might not find the stash if the * object is not blessed yet--this might occur for overloaded objects that * refer to themselves indirectly: if we blessed upon return from a sub * retrieve(), the SX_OBJECT marker we'd found could not have overloading * restored on it because the underlying object would not be blessed yet!). * * To achieve that, the class name of the last retrieved object is passed down * recursively, and the first SEEN() call for which the class name is not NULL * will bless the object. * * i should be true iff sv is immortal (ie PL_sv_yes, PL_sv_no or PL_sv_undef) * * SEEN0() is a short-cut where stash is always NULL. * * The _NN variants dont check for y being null */ #define SEEN0_NN(y,i) \ STMT_START { \ if (av_store(cxt->aseen, cxt->tagnum++, i ? (SV*)(y) \ : SvREFCNT_inc(y)) == 0) \ return (SV *) 0; \ TRACEME(("aseen(#%d) = 0x%" UVxf " (refcnt=%d)", \ (int)cxt->tagnum-1, \ PTR2UV(y), (int)SvREFCNT(y)-1)); \ } STMT_END #define SEEN0(y,i) \ STMT_START { \ if (!y) \ return (SV *) 0; \ SEEN0_NN(y,i); \ } STMT_END #define SEEN_NN(y,stash,i) \ STMT_START { \ SEEN0_NN(y,i); \ if (stash) \ BLESS((SV *)(y), (HV *)(stash)); \ } STMT_END #define SEEN(y,stash,i) \ STMT_START { \ if (!y) \ return (SV *) 0; \ SEEN_NN(y,stash, i); \ } STMT_END /* * Bless 's' in 'p', via a temporary reference, required by sv_bless(). * "A" magic is added before the sv_bless for overloaded classes, this avoids * an expensive call to S_reset_amagic in sv_bless. */ #define BLESS(s,stash) \ STMT_START { \ SV *ref; \ if (cxt->flags & FLAG_BLESS_OK) { \ TRACEME(("blessing 0x%" UVxf " in %s", PTR2UV(s), \ HvNAME_get(stash))); \ ref = newRV_noinc(s); \ if (cxt->in_retrieve_overloaded && Gv_AMG(stash)) { \ cxt->in_retrieve_overloaded = 0; \ SvAMAGIC_on(ref); \ } \ (void) sv_bless(ref, stash); \ SvRV_set(ref, NULL); \ SvREFCNT_dec(ref); \ } \ else { \ TRACEME(("not blessing 0x%" UVxf " in %s", PTR2UV(s), \ (HvNAME_get(stash)))); \ } \ } STMT_END /* * sort (used in store_hash) - conditionally use qsort when * sortsv is not available ( <= 5.6.1 ). */ #if PERL_VERSION_LT(5,7,0) #if defined(USE_ITHREADS) #define STORE_HASH_SORT \ ENTER; { \ PerlInterpreter *orig_perl = PERL_GET_CONTEXT; \ SAVESPTR(orig_perl); \ PERL_SET_CONTEXT(aTHX); \ qsort((char *) AvARRAY(av), len, sizeof(SV *), sortcmp);\ } LEAVE; #else /* ! USE_ITHREADS */ #define STORE_HASH_SORT \ qsort((char *) AvARRAY(av), len, sizeof(SV *), sortcmp); #endif /* USE_ITHREADS */ #else /* PERL >= 5.7.0 */ #define STORE_HASH_SORT \ sortsv(AvARRAY(av), len, Perl_sv_cmp); #endif /* PERL_VERSION_LT(5,7,0) */ static int store(pTHX_ stcxt_t *cxt, SV *sv); static SV *retrieve(pTHX_ stcxt_t *cxt, const char *cname); #define UNSEE() \ STMT_START { \ av_pop(cxt->aseen); \ cxt->tagnum--; \ } STMT_END /* * Dynamic dispatching table for SV store. */ static int store_ref(pTHX_ stcxt_t *cxt, SV *sv); static int store_scalar(pTHX_ stcxt_t *cxt, SV *sv); static int store_array(pTHX_ stcxt_t *cxt, AV *av); static int store_hash(pTHX_ stcxt_t *cxt, HV *hv); static int store_tied(pTHX_ stcxt_t *cxt, SV *sv); static int store_tied_item(pTHX_ stcxt_t *cxt, SV *sv); static int store_code(pTHX_ stcxt_t *cxt, CV *cv); static int store_regexp(pTHX_ stcxt_t *cxt, SV *sv); static int store_other(pTHX_ stcxt_t *cxt, SV *sv); static int store_blessed(pTHX_ stcxt_t *cxt, SV *sv, int type, HV *pkg); typedef int (*sv_store_t)(pTHX_ stcxt_t *cxt, SV *sv); static const sv_store_t sv_store[] = { (sv_store_t)store_ref, /* svis_REF */ (sv_store_t)store_scalar, /* svis_SCALAR */ (sv_store_t)store_array, /* svis_ARRAY */ (sv_store_t)store_hash, /* svis_HASH */ (sv_store_t)store_tied, /* svis_TIED */ (sv_store_t)store_tied_item,/* svis_TIED_ITEM */ (sv_store_t)store_code, /* svis_CODE */ (sv_store_t)store_regexp, /* svis_REGEXP */ (sv_store_t)store_other, /* svis_OTHER */ }; #define SV_STORE(x) (*sv_store[x]) /* * Dynamic dispatching tables for SV retrieval. */ static SV *retrieve_lscalar(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_lutf8str(pTHX_ stcxt_t *cxt, const char *cname); static SV *old_retrieve_array(pTHX_ stcxt_t *cxt, const char *cname); static SV *old_retrieve_hash(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_ref(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_undef(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_integer(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_double(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_byte(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_netint(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_scalar(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_utf8str(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_tied_array(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_tied_hash(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_tied_scalar(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_other(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_lobject(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_regexp(pTHX_ stcxt_t *cxt, const char *cname); /* helpers for U64 lobjects */ static SV *get_lstring(pTHX_ stcxt_t *cxt, UV len, int isutf8, const char *cname); #ifdef HAS_U64 static SV *get_larray(pTHX_ stcxt_t *cxt, UV len, const char *cname); static SV *get_lhash(pTHX_ stcxt_t *cxt, UV len, int hash_flags, const char *cname); static int store_lhash(pTHX_ stcxt_t *cxt, HV *hv, unsigned char hash_flags); #endif static int store_hentry(pTHX_ stcxt_t *cxt, HV* hv, UV i, HEK *hek, SV *val, unsigned char hash_flags); typedef SV* (*sv_retrieve_t)(pTHX_ stcxt_t *cxt, const char *name); static const sv_retrieve_t sv_old_retrieve[] = { 0, /* SX_OBJECT -- entry unused dynamically */ (sv_retrieve_t)retrieve_lscalar, /* SX_LSCALAR */ (sv_retrieve_t)old_retrieve_array, /* SX_ARRAY -- for pre-0.6 binaries */ (sv_retrieve_t)old_retrieve_hash, /* SX_HASH -- for pre-0.6 binaries */ (sv_retrieve_t)retrieve_ref, /* SX_REF */ (sv_retrieve_t)retrieve_undef, /* SX_UNDEF */ (sv_retrieve_t)retrieve_integer, /* SX_INTEGER */ (sv_retrieve_t)retrieve_double, /* SX_DOUBLE */ (sv_retrieve_t)retrieve_byte, /* SX_BYTE */ (sv_retrieve_t)retrieve_netint, /* SX_NETINT */ (sv_retrieve_t)retrieve_scalar, /* SX_SCALAR */ (sv_retrieve_t)retrieve_tied_array, /* SX_TIED_ARRAY */ (sv_retrieve_t)retrieve_tied_hash, /* SX_TIED_HASH */ (sv_retrieve_t)retrieve_tied_scalar,/* SX_TIED_SCALAR */ (sv_retrieve_t)retrieve_other, /* SX_SV_UNDEF not supported */ (sv_retrieve_t)retrieve_other, /* SX_SV_YES not supported */ (sv_retrieve_t)retrieve_other, /* SX_SV_NO not supported */ (sv_retrieve_t)retrieve_other, /* SX_BLESS not supported */ (sv_retrieve_t)retrieve_other, /* SX_IX_BLESS not supported */ (sv_retrieve_t)retrieve_other, /* SX_HOOK not supported */ (sv_retrieve_t)retrieve_other, /* SX_OVERLOADED not supported */ (sv_retrieve_t)retrieve_other, /* SX_TIED_KEY not supported */ (sv_retrieve_t)retrieve_other, /* SX_TIED_IDX not supported */ (sv_retrieve_t)retrieve_other, /* SX_UTF8STR not supported */ (sv_retrieve_t)retrieve_other, /* SX_LUTF8STR not supported */ (sv_retrieve_t)retrieve_other, /* SX_FLAG_HASH not supported */ (sv_retrieve_t)retrieve_other, /* SX_CODE not supported */ (sv_retrieve_t)retrieve_other, /* SX_WEAKREF not supported */ (sv_retrieve_t)retrieve_other, /* SX_WEAKOVERLOAD not supported */ (sv_retrieve_t)retrieve_other, /* SX_VSTRING not supported */ (sv_retrieve_t)retrieve_other, /* SX_LVSTRING not supported */ (sv_retrieve_t)retrieve_other, /* SX_SVUNDEF_ELEM not supported */ (sv_retrieve_t)retrieve_other, /* SX_REGEXP */ (sv_retrieve_t)retrieve_other, /* SX_LOBJECT not supported */ (sv_retrieve_t)retrieve_other, /* SX_LAST */ }; static SV *retrieve_hook_common(pTHX_ stcxt_t *cxt, const char *cname, int large); static SV *retrieve_array(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_hash(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_sv_undef(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_sv_yes(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_sv_no(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_blessed(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_idx_blessed(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_hook(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_overloaded(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_tied_key(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_tied_idx(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_flag_hash(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_code(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_weakref(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_weakoverloaded(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_vstring(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_lvstring(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_svundef_elem(pTHX_ stcxt_t *cxt, const char *cname); static const sv_retrieve_t sv_retrieve[] = { 0, /* SX_OBJECT -- entry unused dynamically */ (sv_retrieve_t)retrieve_lscalar, /* SX_LSCALAR */ (sv_retrieve_t)retrieve_array, /* SX_ARRAY */ (sv_retrieve_t)retrieve_hash, /* SX_HASH */ (sv_retrieve_t)retrieve_ref, /* SX_REF */ (sv_retrieve_t)retrieve_undef, /* SX_UNDEF */ (sv_retrieve_t)retrieve_integer, /* SX_INTEGER */ (sv_retrieve_t)retrieve_double, /* SX_DOUBLE */ (sv_retrieve_t)retrieve_byte, /* SX_BYTE */ (sv_retrieve_t)retrieve_netint, /* SX_NETINT */ (sv_retrieve_t)retrieve_scalar, /* SX_SCALAR */ (sv_retrieve_t)retrieve_tied_array, /* SX_TIED_ARRAY */ (sv_retrieve_t)retrieve_tied_hash, /* SX_TIED_HASH */ (sv_retrieve_t)retrieve_tied_scalar,/* SX_TIED_SCALAR */ (sv_retrieve_t)retrieve_sv_undef, /* SX_SV_UNDEF */ (sv_retrieve_t)retrieve_sv_yes, /* SX_SV_YES */ (sv_retrieve_t)retrieve_sv_no, /* SX_SV_NO */ (sv_retrieve_t)retrieve_blessed, /* SX_BLESS */ (sv_retrieve_t)retrieve_idx_blessed,/* SX_IX_BLESS */ (sv_retrieve_t)retrieve_hook, /* SX_HOOK */ (sv_retrieve_t)retrieve_overloaded, /* SX_OVERLOAD */ (sv_retrieve_t)retrieve_tied_key, /* SX_TIED_KEY */ (sv_retrieve_t)retrieve_tied_idx, /* SX_TIED_IDX */ (sv_retrieve_t)retrieve_utf8str, /* SX_UTF8STR */ (sv_retrieve_t)retrieve_lutf8str, /* SX_LUTF8STR */ (sv_retrieve_t)retrieve_flag_hash, /* SX_HASH */ (sv_retrieve_t)retrieve_code, /* SX_CODE */ (sv_retrieve_t)retrieve_weakref, /* SX_WEAKREF */ (sv_retrieve_t)retrieve_weakoverloaded,/* SX_WEAKOVERLOAD */ (sv_retrieve_t)retrieve_vstring, /* SX_VSTRING */ (sv_retrieve_t)retrieve_lvstring, /* SX_LVSTRING */ (sv_retrieve_t)retrieve_svundef_elem,/* SX_SVUNDEF_ELEM */ (sv_retrieve_t)retrieve_regexp, /* SX_REGEXP */ (sv_retrieve_t)retrieve_lobject, /* SX_LOBJECT */ (sv_retrieve_t)retrieve_other, /* SX_LAST */ }; #define RETRIEVE(c,x) ((x) >= SX_LAST ? retrieve_other : *(c)->retrieve_vtbl[x]) static SV *mbuf2sv(pTHX); /*** *** Context management. ***/ /* * init_perinterp * * Called once per "thread" (interpreter) to initialize some global context. */ static void init_perinterp(pTHX) { INIT_STCXT; INIT_TRACEME; cxt->netorder = 0; /* true if network order used */ cxt->forgive_me = -1; /* whether to be forgiving... */ cxt->accept_future_minor = -1; /* would otherwise occur too late */ } /* * reset_context * * Called at the end of every context cleaning, to perform common reset * operations. */ static void reset_context(stcxt_t *cxt) { cxt->entry = 0; cxt->s_dirty = 0; cxt->recur_sv = NULL; cxt->recur_depth = 0; cxt->optype &= ~(ST_STORE|ST_RETRIEVE); /* Leave ST_CLONE alone */ } /* * init_store_context * * Initialize a new store context for real recursion. */ static void init_store_context(pTHX_ stcxt_t *cxt, PerlIO *f, int optype, int network_order) { INIT_TRACEME; TRACEME(("init_store_context")); cxt->netorder = network_order; cxt->forgive_me = -1; /* Fetched from perl if needed */ cxt->deparse = -1; /* Idem */ cxt->eval = NULL; /* Idem */ cxt->canonical = -1; /* Idem */ cxt->tagnum = -1; /* Reset tag numbers */ cxt->classnum = -1; /* Reset class numbers */ cxt->fio = f; /* Where I/O are performed */ cxt->optype = optype; /* A store, or a deep clone */ cxt->entry = 1; /* No recursion yet */ /* * The 'hseen' table is used to keep track of each SV stored and their * associated tag numbers is special. It is "abused" because the * values stored are not real SV, just integers cast to (SV *), * which explains the freeing below. * * It is also one possible bottleneck to achieve good storing speed, * so the "shared keys" optimization is turned off (unlikely to be * of any use here), and the hash table is "pre-extended". Together, * those optimizations increase the throughput by 12%. */ #ifdef USE_PTR_TABLE cxt->pseen = ptr_table_new(); cxt->hseen = 0; #else cxt->hseen = newHV(); /* Table where seen objects are stored */ HvSHAREKEYS_off(cxt->hseen); #endif /* * The following does not work well with perl5.004_04, and causes * a core dump later on, in a completely unrelated spot, which * makes me think there is a memory corruption going on. * * Calling hv_ksplit(hseen, HBUCKETS) instead of manually hacking * it below does not make any difference. It seems to work fine * with perl5.004_68 but given the probable nature of the bug, * that does not prove anything. * * It's a shame because increasing the amount of buckets raises * store() throughput by 5%, but until I figure this out, I can't * allow for this to go into production. * * It is reported fixed in 5.005, hence the #if. */ #define HBUCKETS 4096 /* Buckets for %hseen */ #ifndef USE_PTR_TABLE HvMAX(cxt->hseen) = HBUCKETS - 1; /* keys %hseen = $HBUCKETS; */ #endif /* * The 'hclass' hash uses the same settings as 'hseen' above, but it is * used to assign sequential tags (numbers) to class names for blessed * objects. * * We turn the shared key optimization on. */ cxt->hclass = newHV(); /* Where seen classnames are stored */ HvMAX(cxt->hclass) = HBUCKETS - 1; /* keys %hclass = $HBUCKETS; */ /* * The 'hook' hash table is used to keep track of the references on * the STORABLE_freeze hook routines, when found in some class name. * * It is assumed that the inheritance tree will not be changed during * storing, and that no new method will be dynamically created by the * hooks. */ cxt->hook = newHV(); /* Table where hooks are cached */ /* * The 'hook_seen' array keeps track of all the SVs returned by * STORABLE_freeze hooks for us to serialize, so that they are not * reclaimed until the end of the serialization process. Each SV is * only stored once, the first time it is seen. */ cxt->hook_seen = newAV(); /* Lists SVs returned by STORABLE_freeze */ cxt->max_recur_depth = SvIV(get_sv("Storable::recursion_limit", GV_ADD)); cxt->max_recur_depth_hash = SvIV(get_sv("Storable::recursion_limit_hash", GV_ADD)); } /* * clean_store_context * * Clean store context by */ static void clean_store_context(pTHX_ stcxt_t *cxt) { HE *he; TRACEMED(("clean_store_context")); ASSERT(cxt->optype & ST_STORE, ("was performing a store()")); /* * Insert real values into hashes where we stored faked pointers. */ #ifndef USE_PTR_TABLE if (cxt->hseen) { hv_iterinit(cxt->hseen); while ((he = hv_iternext(cxt->hseen))) /* Extra () for -Wall */ HeVAL(he) = &PL_sv_undef; } #endif if (cxt->hclass) { hv_iterinit(cxt->hclass); while ((he = hv_iternext(cxt->hclass))) /* Extra () for -Wall */ HeVAL(he) = &PL_sv_undef; } /* * And now dispose of them... * * The surrounding if() protection has been added because there might be * some cases where this routine is called more than once, during * exceptional events. This was reported by Marc Lehmann when Storable * is executed from mod_perl, and the fix was suggested by him. * -- RAM, 20/12/2000 */ #ifdef USE_PTR_TABLE if (cxt->pseen) { struct ptr_tbl *pseen = cxt->pseen; cxt->pseen = 0; ptr_table_free(pseen); } assert(!cxt->hseen); #else if (cxt->hseen) { HV *hseen = cxt->hseen; cxt->hseen = 0; hv_undef(hseen); sv_free((SV *) hseen); } #endif if (cxt->hclass) { HV *hclass = cxt->hclass; cxt->hclass = 0; hv_undef(hclass); sv_free((SV *) hclass); } if (cxt->hook) { HV *hook = cxt->hook; cxt->hook = 0; hv_undef(hook); sv_free((SV *) hook); } if (cxt->hook_seen) { AV *hook_seen = cxt->hook_seen; cxt->hook_seen = 0; av_undef(hook_seen); sv_free((SV *) hook_seen); } cxt->forgive_me = -1; /* Fetched from perl if needed */ cxt->deparse = -1; /* Idem */ if (cxt->eval) { SvREFCNT_dec(cxt->eval); } cxt->eval = NULL; /* Idem */ cxt->canonical = -1; /* Idem */ reset_context(cxt); } /* * init_retrieve_context * * Initialize a new retrieve context for real recursion. */ static void init_retrieve_context(pTHX_ stcxt_t *cxt, int optype, int is_tainted) { INIT_TRACEME; TRACEME(("init_retrieve_context")); /* * The hook hash table is used to keep track of the references on * the STORABLE_thaw hook routines, when found in some class name. * * It is assumed that the inheritance tree will not be changed during * storing, and that no new method will be dynamically created by the * hooks. */ cxt->hook = newHV(); /* Caches STORABLE_thaw */ #ifdef USE_PTR_TABLE cxt->pseen = 0; #endif /* * If retrieving an old binary version, the cxt->retrieve_vtbl variable * was set to sv_old_retrieve. We'll need a hash table to keep track of * the correspondence between the tags and the tag number used by the * new retrieve routines. */ cxt->hseen = (((void*)cxt->retrieve_vtbl == (void*)sv_old_retrieve) ? newHV() : 0); cxt->aseen = newAV(); /* Where retrieved objects are kept */ cxt->where_is_undef = UNSET_NTAG_T; /* Special case for PL_sv_undef */ cxt->aclass = newAV(); /* Where seen classnames are kept */ cxt->tagnum = 0; /* Have to count objects... */ cxt->classnum = 0; /* ...and class names as well */ cxt->optype = optype; cxt->s_tainted = is_tainted; cxt->entry = 1; /* No recursion yet */ #ifndef HAS_RESTRICTED_HASHES cxt->derestrict = -1; /* Fetched from perl if needed */ #endif #ifndef HAS_UTF8_ALL cxt->use_bytes = -1; /* Fetched from perl if needed */ #endif cxt->accept_future_minor = -1;/* Fetched from perl if needed */ cxt->in_retrieve_overloaded = 0; cxt->max_recur_depth = SvIV(get_sv("Storable::recursion_limit", GV_ADD)); cxt->max_recur_depth_hash = SvIV(get_sv("Storable::recursion_limit_hash", GV_ADD)); } /* * clean_retrieve_context * * Clean retrieve context by */ static void clean_retrieve_context(pTHX_ stcxt_t *cxt) { TRACEMED(("clean_retrieve_context")); ASSERT(cxt->optype & ST_RETRIEVE, ("was performing a retrieve()")); if (cxt->aseen) { AV *aseen = cxt->aseen; cxt->aseen = 0; av_undef(aseen); sv_free((SV *) aseen); } cxt->where_is_undef = UNSET_NTAG_T; if (cxt->aclass) { AV *aclass = cxt->aclass; cxt->aclass = 0; av_undef(aclass); sv_free((SV *) aclass); } if (cxt->hook) { HV *hook = cxt->hook; cxt->hook = 0; hv_undef(hook); sv_free((SV *) hook); } if (cxt->hseen) { HV *hseen = cxt->hseen; cxt->hseen = 0; hv_undef(hseen); sv_free((SV *) hseen); /* optional HV, for backward compat. */ } #ifndef HAS_RESTRICTED_HASHES cxt->derestrict = -1; /* Fetched from perl if needed */ #endif #ifndef HAS_UTF8_ALL cxt->use_bytes = -1; /* Fetched from perl if needed */ #endif cxt->accept_future_minor = -1; /* Fetched from perl if needed */ cxt->in_retrieve_overloaded = 0; reset_context(cxt); } /* * clean_context * * A workaround for the CROAK bug: cleanup the last context. */ static void clean_context(pTHX_ stcxt_t *cxt) { TRACEMED(("clean_context")); ASSERT(cxt->s_dirty, ("dirty context")); if (cxt->membuf_ro) MBUF_RESTORE(); ASSERT(!cxt->membuf_ro, ("mbase is not read-only")); if (cxt->optype & ST_RETRIEVE) clean_retrieve_context(aTHX_ cxt); else if (cxt->optype & ST_STORE) clean_store_context(aTHX_ cxt); else reset_context(cxt); ASSERT(!cxt->s_dirty, ("context is clean")); ASSERT(cxt->entry == 0, ("context is reset")); } /* * allocate_context * * Allocate a new context and push it on top of the parent one. * This new context is made globally visible via SET_STCXT(). */ static stcxt_t *allocate_context(pTHX_ stcxt_t *parent_cxt) { stcxt_t *cxt; ASSERT(!parent_cxt->s_dirty, ("parent context clean")); NEW_STORABLE_CXT_OBJ(cxt); TRACEMED(("allocate_context")); cxt->prev = parent_cxt->my_sv; SET_STCXT(cxt); ASSERT(!cxt->s_dirty, ("clean context")); return cxt; } /* * free_context * * Free current context, which cannot be the "root" one. * Make the context underneath globally visible via SET_STCXT(). */ static void free_context(pTHX_ stcxt_t *cxt) { stcxt_t *prev = (stcxt_t *)(cxt->prev ? SvPVX(SvRV(cxt->prev)) : 0); TRACEMED(("free_context")); ASSERT(!cxt->s_dirty, ("clean context")); ASSERT(prev, ("not freeing root context")); assert(prev); SvREFCNT_dec(cxt->my_sv); SET_STCXT(prev); ASSERT(cxt, ("context not void")); } /*** *** Predicates. ***/ /* these two functions are currently only used within asserts */ #ifdef DASSERT /* * is_storing * * Tells whether we're in the middle of a store operation. */ static int is_storing(pTHX) { dSTCXT; return cxt->entry && (cxt->optype & ST_STORE); } /* * is_retrieving * * Tells whether we're in the middle of a retrieve operation. */ static int is_retrieving(pTHX) { dSTCXT; return cxt->entry && (cxt->optype & ST_RETRIEVE); } #endif /* * last_op_in_netorder * * Returns whether last operation was made using network order. * * This is typically out-of-band information that might prove useful * to people wishing to convert native to network order data when used. */ static int last_op_in_netorder(pTHX) { dSTCXT; assert(cxt); return cxt->netorder; } /*** *** Hook lookup and calling routines. ***/ /* * pkg_fetchmeth * * A wrapper on gv_fetchmethod_autoload() which caches results. * * Returns the routine reference as an SV*, or null if neither the package * nor its ancestors know about the method. */ static SV *pkg_fetchmeth(pTHX_ HV *cache, HV *pkg, const char *method) { GV *gv; SV *sv; const char *hvname = HvNAME_get(pkg); #ifdef DEBUGME dSTCXT; #endif /* * The following code is the same as the one performed by UNIVERSAL::can * in the Perl core. */ gv = gv_fetchmethod_autoload(pkg, method, FALSE); if (gv && isGV(gv)) { sv = newRV_inc((SV*) GvCV(gv)); TRACEME(("%s->%s: 0x%" UVxf, hvname, method, PTR2UV(sv))); } else { sv = newSVsv(&PL_sv_undef); TRACEME(("%s->%s: not found", hvname, method)); } /* * Cache the result, ignoring failure: if we can't store the value, * it just won't be cached. */ (void) hv_store(cache, hvname, strlen(hvname), sv, 0); return SvOK(sv) ? sv : (SV *) 0; } /* * pkg_hide * * Force cached value to be undef: hook ignored even if present. */ static void pkg_hide(pTHX_ HV *cache, HV *pkg, const char *method) { const char *hvname = HvNAME_get(pkg); PERL_UNUSED_ARG(method); (void) hv_store(cache, hvname, strlen(hvname), newSVsv(&PL_sv_undef), 0); } /* * pkg_uncache * * Discard cached value: a whole fetch loop will be retried at next lookup. */ static void pkg_uncache(pTHX_ HV *cache, HV *pkg, const char *method) { const char *hvname = HvNAME_get(pkg); PERL_UNUSED_ARG(method); (void) hv_delete(cache, hvname, strlen(hvname), G_DISCARD); } /* * pkg_can * * Our own "UNIVERSAL::can", which caches results. * * Returns the routine reference as an SV*, or null if the object does not * know about the method. */ static SV *pkg_can(pTHX_ HV *cache, HV *pkg, const char *method) { SV **svh; SV *sv; const char *hvname = HvNAME_get(pkg); #ifdef DEBUGME dSTCXT; #endif TRACEME(("pkg_can for %s->%s", hvname, method)); /* * Look into the cache to see whether we already have determined * where the routine was, if any. * * NOTA BENE: we don't use 'method' at all in our lookup, since we know * that only one hook (i.e. always the same) is cached in a given cache. */ svh = hv_fetch(cache, hvname, strlen(hvname), FALSE); if (svh) { sv = *svh; if (!SvOK(sv)) { TRACEME(("cached %s->%s: not found", hvname, method)); return (SV *) 0; } else { TRACEME(("cached %s->%s: 0x%" UVxf, hvname, method, PTR2UV(sv))); return sv; } } TRACEME(("not cached yet")); return pkg_fetchmeth(aTHX_ cache, pkg, method); /* Fetch and cache */ } /* * scalar_call * * Call routine as obj->hook(av) in scalar context. * Propagates the single returned value if not called in void context. */ static SV *scalar_call(pTHX_ SV *obj, SV *hook, int cloning, AV *av, I32 flags) { dSP; int count; SV *sv = 0; #ifdef DEBUGME dSTCXT; #endif TRACEME(("scalar_call (cloning=%d)", cloning)); ENTER; SAVETMPS; PUSHMARK(sp); XPUSHs(obj); XPUSHs(sv_2mortal(newSViv(cloning))); /* Cloning flag */ if (av) { SV **ary = AvARRAY(av); SSize_t cnt = AvFILLp(av) + 1; SSize_t i; XPUSHs(ary[0]); /* Frozen string */ for (i = 1; i < cnt; i++) { TRACEME(("pushing arg #%d (0x%" UVxf ")...", (int)i, PTR2UV(ary[i]))); XPUSHs(sv_2mortal(newRV_inc(ary[i]))); } } PUTBACK; TRACEME(("calling...")); count = call_sv(hook, flags); /* Go back to Perl code */ TRACEME(("count = %d", count)); SPAGAIN; if (count) { sv = POPs; SvREFCNT_inc(sv); /* We're returning it, must stay alive! */ } PUTBACK; FREETMPS; LEAVE; return sv; } /* * array_call * * Call routine obj->hook(cloning) in list context. * Returns the list of returned values in an array. */ static AV *array_call(pTHX_ SV *obj, SV *hook, int cloning) { dSP; int count; AV *av; int i; #ifdef DEBUGME dSTCXT; #endif TRACEME(("array_call (cloning=%d)", cloning)); ENTER; SAVETMPS; PUSHMARK(sp); XPUSHs(obj); /* Target object */ XPUSHs(sv_2mortal(newSViv(cloning))); /* Cloning flag */ PUTBACK; count = call_sv(hook, G_ARRAY); /* Go back to Perl code */ SPAGAIN; av = newAV(); for (i = count - 1; i >= 0; i--) { SV *sv = POPs; av_store(av, i, SvREFCNT_inc(sv)); } PUTBACK; FREETMPS; LEAVE; return av; } #if PERL_VERSION_LT(5,15,0) static void cleanup_recursive_av(pTHX_ AV* av) { SSize_t i = AvFILLp(av); SV** arr = AvARRAY(av); if (SvMAGICAL(av)) return; while (i >= 0) { if (arr[i]) { #if PERL_VERSION_LT(5,14,0) arr[i] = NULL; #else SvREFCNT_dec(arr[i]); #endif } i--; } } #ifndef SvREFCNT_IMMORTAL #ifdef DEBUGGING /* exercise the immortal resurrection code in sv_free2() */ # define SvREFCNT_IMMORTAL 1000 #else # define SvREFCNT_IMMORTAL ((~(U32)0)/2) #endif #endif static void cleanup_recursive_hv(pTHX_ HV* hv) { SSize_t i = HvTOTALKEYS(hv); HE** arr = HvARRAY(hv); if (SvMAGICAL(hv)) return; while (i >= 0) { if (arr[i]) { SvREFCNT(HeVAL(arr[i])) = SvREFCNT_IMMORTAL; arr[i] = NULL; /* let it leak. too dangerous to clean it up here */ } i--; } #if PERL_VERSION_LT(5,8,0) ((XPVHV*)SvANY(hv))->xhv_array = NULL; #else HvARRAY(hv) = NULL; #endif HvTOTALKEYS(hv) = 0; } static void cleanup_recursive_rv(pTHX_ SV* sv) { if (sv && SvROK(sv)) SvREFCNT_dec(SvRV(sv)); } static void cleanup_recursive_data(pTHX_ SV* sv) { if (SvTYPE(sv) == SVt_PVAV) { cleanup_recursive_av(aTHX_ (AV*)sv); } else if (SvTYPE(sv) == SVt_PVHV) { cleanup_recursive_hv(aTHX_ (HV*)sv); } else { cleanup_recursive_rv(aTHX_ sv); } } #endif /* * known_class * * Lookup the class name in the 'hclass' table and either assign it a new ID * or return the existing one, by filling in 'classnum'. * * Return true if the class was known, false if the ID was just generated. */ static int known_class(pTHX_ stcxt_t *cxt, char *name, /* Class name */ int len, /* Name length */ I32 *classnum) { SV **svh; HV *hclass = cxt->hclass; TRACEME(("known_class (%s)", name)); /* * Recall that we don't store pointers in this hash table, but tags. * Therefore, we need LOW_32BITS() to extract the relevant parts. */ svh = hv_fetch(hclass, name, len, FALSE); if (svh) { *classnum = LOW_32BITS(*svh); return TRUE; } /* * Unknown classname, we need to record it. */ cxt->classnum++; if (!hv_store(hclass, name, len, INT2PTR(SV*, cxt->classnum), 0)) CROAK(("Unable to record new classname")); *classnum = cxt->classnum; return FALSE; } /*** *** Specific store routines. ***/ /* * store_ref * * Store a reference. * Layout is SX_REF <object> or SX_OVERLOAD <object>. */ static int store_ref(pTHX_ stcxt_t *cxt, SV *sv) { int retval; int is_weak = 0; TRACEME(("store_ref (0x%" UVxf ")", PTR2UV(sv))); /* * Follow reference, and check if target is overloaded. */ #ifdef SvWEAKREF if (SvWEAKREF(sv)) is_weak = 1; TRACEME(("ref (0x%" UVxf ") is%s weak", PTR2UV(sv), is_weak ? "" : "n't")); #endif sv = SvRV(sv); if (SvOBJECT(sv)) { HV *stash = (HV *) SvSTASH(sv); if (stash && Gv_AMG(stash)) { TRACEME(("ref (0x%" UVxf ") is overloaded", PTR2UV(sv))); PUTMARK(is_weak ? SX_WEAKOVERLOAD : SX_OVERLOAD); } else PUTMARK(is_weak ? SX_WEAKREF : SX_REF); } else PUTMARK(is_weak ? SX_WEAKREF : SX_REF); cxt->recur_sv = sv; TRACEME((">ref recur_depth %" IVdf ", recur_sv (0x%" UVxf ") max %" IVdf, cxt->recur_depth, PTR2UV(cxt->recur_sv), cxt->max_recur_depth)); if (RECURSION_TOO_DEEP()) { #if PERL_VERSION_LT(5,15,0) cleanup_recursive_data(aTHX_ (SV*)sv); #endif CROAK((MAX_DEPTH_ERROR)); } retval = store(aTHX_ cxt, sv); if (cxt->max_recur_depth != -1 && cxt->recur_depth > 0) { TRACEME(("<ref recur_depth --%" IVdf, cxt->recur_depth)); --cxt->recur_depth; } return retval; } /* * store_scalar * * Store a scalar. * * Layout is SX_LSCALAR <length> <data>, SX_SCALAR <length> <data> or SX_UNDEF. * SX_LUTF8STR and SX_UTF8STR are used for UTF-8 strings. * The <data> section is omitted if <length> is 0. * * For vstrings, the vstring portion is stored first with * SX_LVSTRING <length> <data> or SX_VSTRING <length> <data>, followed by * SX_(L)SCALAR or SX_(L)UTF8STR with the actual PV. * * If integer or double, the layout is SX_INTEGER <data> or SX_DOUBLE <data>. * Small integers (within [-127, +127]) are stored as SX_BYTE <byte>. * * For huge strings use SX_LOBJECT SX_type SX_U64 <type> <data> */ static int store_scalar(pTHX_ stcxt_t *cxt, SV *sv) { IV iv; char *pv; STRLEN len; U32 flags = SvFLAGS(sv); /* "cc -O" may put it in register */ TRACEME(("store_scalar (0x%" UVxf ")", PTR2UV(sv))); /* * For efficiency, break the SV encapsulation by peaking at the flags * directly without using the Perl macros to avoid dereferencing * sv->sv_flags each time we wish to check the flags. */ if (!(flags & SVf_OK)) { /* !SvOK(sv) */ if (sv == &PL_sv_undef) { TRACEME(("immortal undef")); PUTMARK(SX_SV_UNDEF); } else { TRACEME(("undef at 0x%" UVxf, PTR2UV(sv))); PUTMARK(SX_UNDEF); } return 0; } /* * Always store the string representation of a scalar if it exists. * Gisle Aas provided me with this test case, better than a long speach: * * perl -MDevel::Peek -le '$a="abc"; $a+0; Dump($a)' * SV = PVNV(0x80c8520) * REFCNT = 1 * FLAGS = (NOK,POK,pNOK,pPOK) * IV = 0 * NV = 0 * PV = 0x80c83d0 "abc"\0 * CUR = 3 * LEN = 4 * * Write SX_SCALAR, length, followed by the actual data. * * Otherwise, write an SX_BYTE, SX_INTEGER or an SX_DOUBLE as * appropriate, followed by the actual (binary) data. A double * is written as a string if network order, for portability. * * NOTE: instead of using SvNOK(sv), we test for SvNOKp(sv). * The reason is that when the scalar value is tainted, the SvNOK(sv) * value is false. * * The test for a read-only scalar with both POK and NOK set is meant * to quickly detect &PL_sv_yes and &PL_sv_no without having to pay the * address comparison for each scalar we store. */ #define SV_MAYBE_IMMORTAL (SVf_READONLY|SVf_POK|SVf_NOK) if ((flags & SV_MAYBE_IMMORTAL) == SV_MAYBE_IMMORTAL) { if (sv == &PL_sv_yes) { TRACEME(("immortal yes")); PUTMARK(SX_SV_YES); } else if (sv == &PL_sv_no) { TRACEME(("immortal no")); PUTMARK(SX_SV_NO); } else { pv = SvPV(sv, len); /* We know it's SvPOK */ goto string; /* Share code below */ } } else if (flags & SVf_POK) { /* public string - go direct to string read. */ goto string_readlen; } else if ( #if PERL_VERSION_LT(5,7,0) /* For 5.6 and earlier NV flag trumps IV flag, so only use integer direct if NV flag is off. */ (flags & (SVf_NOK | SVf_IOK)) == SVf_IOK #else /* 5.7 rules are that if IV public flag is set, IV value is as good, if not better, than NV value. */ flags & SVf_IOK #endif ) { iv = SvIV(sv); /* * Will come here from below with iv set if double is an integer. */ integer: /* Sorry. This isn't in 5.005_56 (IIRC) or earlier. */ #ifdef SVf_IVisUV /* Need to do this out here, else 0xFFFFFFFF becomes iv of -1 * (for example) and that ends up in the optimised small integer * case. */ if ((flags & SVf_IVisUV) && SvUV(sv) > IV_MAX) { TRACEME(("large unsigned integer as string, value = %" UVuf, SvUV(sv))); goto string_readlen; } #endif /* * Optimize small integers into a single byte, otherwise store as * a real integer (converted into network order if they asked). */ if (iv >= -128 && iv <= 127) { unsigned char siv = (unsigned char) (iv + 128); /* [0,255] */ PUTMARK(SX_BYTE); PUTMARK(siv); TRACEME(("small integer stored as %d", (int)siv)); } else if (cxt->netorder) { #ifndef HAS_HTONL TRACEME(("no htonl, fall back to string for integer")); goto string_readlen; #else I32 niv; #if IVSIZE > 4 if ( #ifdef SVf_IVisUV /* Sorry. This isn't in 5.005_56 (IIRC) or earlier. */ ((flags & SVf_IVisUV) && SvUV(sv) > (UV)0x7FFFFFFF) || #endif (iv > (IV)0x7FFFFFFF) || (iv < -(IV)0x80000000)) { /* Bigger than 32 bits. */ TRACEME(("large network order integer as string, value = %" IVdf, iv)); goto string_readlen; } #endif niv = (I32) htonl((I32) iv); TRACEME(("using network order")); PUTMARK(SX_NETINT); WRITE_I32(niv); #endif } else { PUTMARK(SX_INTEGER); WRITE(&iv, sizeof(iv)); } TRACEME(("ok (integer 0x%" UVxf ", value = %" IVdf ")", PTR2UV(sv), iv)); } else if (flags & SVf_NOK) { NV_bytes nv; #ifdef NV_CLEAR /* if we can't tell if there's padding, clear the whole NV and hope the compiler leaves the padding alone */ Zero(&nv, 1, NV_bytes); #endif #if PERL_VERSION_LT(5,7,0) nv.nv = SvNV(sv); /* * Watch for number being an integer in disguise. */ if (nv.nv == (NV) (iv = I_V(nv.nv))) { TRACEME(("double %" NVff " is actually integer %" IVdf, nv, iv)); goto integer; /* Share code above */ } #else SvIV_please(sv); if (SvIOK_notUV(sv)) { iv = SvIV(sv); goto integer; /* Share code above */ } nv.nv = SvNV(sv); #endif if (cxt->netorder) { TRACEME(("double %" NVff " stored as string", nv.nv)); goto string_readlen; /* Share code below */ } #if NV_PADDING Zero(nv.bytes + NVSIZE - NV_PADDING, NV_PADDING, char); #endif PUTMARK(SX_DOUBLE); WRITE(&nv, sizeof(nv)); TRACEME(("ok (double 0x%" UVxf ", value = %" NVff ")", PTR2UV(sv), nv.nv)); } else if (flags & (SVp_POK | SVp_NOK | SVp_IOK)) { #ifdef SvVOK MAGIC *mg; #endif UV wlen; /* For 64-bit machines */ string_readlen: pv = SvPV(sv, len); /* * Will come here from above if it was readonly, POK and NOK but * neither &PL_sv_yes nor &PL_sv_no. */ string: #ifdef SvVOK if (SvMAGICAL(sv) && (mg = mg_find(sv, 'V'))) { /* The macro passes this by address, not value, and a lot of called code assumes that it's 32 bits without checking. */ const SSize_t len = mg->mg_len; /* we no longer accept vstrings over I32_SIZE-1, so don't emit them, also, older Storables handle them badly. */ if (len >= I32_MAX) { CROAK(("vstring too large to freeze")); } STORE_PV_LEN((const char *)mg->mg_ptr, len, SX_VSTRING, SX_LVSTRING); } #endif wlen = (Size_t)len; if (SvUTF8 (sv)) STORE_UTF8STR(pv, wlen); else STORE_SCALAR(pv, wlen); TRACEME(("ok (scalar 0x%" UVxf " '%s', length = %" UVuf ")", PTR2UV(sv), len >= 2048 ? "<string too long>" : SvPVX(sv), (UV)len)); } else { CROAK(("Can't determine type of %s(0x%" UVxf ")", sv_reftype(sv, FALSE), PTR2UV(sv))); } return 0; /* Ok, no recursion on scalars */ } /* * store_array * * Store an array. * * Layout is SX_ARRAY <size> followed by each item, in increasing index order. * Each item is stored as <object>. */ static int store_array(pTHX_ stcxt_t *cxt, AV *av) { SV **sav; UV len = av_len(av) + 1; UV i; int ret; SV *const recur_sv = cxt->recur_sv; TRACEME(("store_array (0x%" UVxf ")", PTR2UV(av))); #ifdef HAS_U64 if (len > 0x7fffffffu) { /* * Large array by emitting SX_LOBJECT 1 U64 data */ PUTMARK(SX_LOBJECT); PUTMARK(SX_ARRAY); W64LEN(len); TRACEME(("lobject size = %lu", (unsigned long)len)); } else #endif { /* * Normal array by emitting SX_ARRAY, followed by the array length. */ I32 l = (I32)len; PUTMARK(SX_ARRAY); WLEN(l); TRACEME(("size = %d", (int)l)); } TRACEME((">array recur_depth %" IVdf ", recur_sv (0x%" UVxf ") max %" IVdf, cxt->recur_depth, PTR2UV(cxt->recur_sv), cxt->max_recur_depth)); if (recur_sv != (SV*)av) { if (RECURSION_TOO_DEEP()) { /* with <= 5.14 it recurses in the cleanup also, needing 2x stack size */ #if PERL_VERSION_LT(5,15,0) cleanup_recursive_data(aTHX_ (SV*)av); #endif CROAK((MAX_DEPTH_ERROR)); } } /* * Now store each item recursively. */ for (i = 0; i < len; i++) { sav = av_fetch(av, i, 0); if (!sav) { TRACEME(("(#%d) nonexistent item", (int)i)); STORE_SV_UNDEF(); continue; } #if PERL_VERSION_GE(5,19,0) /* In 5.19.3 and up, &PL_sv_undef can actually be stored in * an array; it no longer represents nonexistent elements. * Historically, we have used SX_SV_UNDEF in arrays for * nonexistent elements, so we use SX_SVUNDEF_ELEM for * &PL_sv_undef itself. */ if (*sav == &PL_sv_undef) { TRACEME(("(#%d) undef item", (int)i)); cxt->tagnum++; PUTMARK(SX_SVUNDEF_ELEM); continue; } #endif TRACEME(("(#%d) item", (int)i)); if ((ret = store(aTHX_ cxt, *sav))) /* Extra () for -Wall */ return ret; } if (recur_sv != (SV*)av) { assert(cxt->max_recur_depth == -1 || cxt->recur_depth > 0); if (cxt->max_recur_depth != -1 && cxt->recur_depth > 0) { TRACEME(("<array recur_depth --%" IVdf, cxt->recur_depth)); --cxt->recur_depth; } } TRACEME(("ok (array)")); return 0; } #if PERL_VERSION_LT(5,7,0) /* * sortcmp * * Sort two SVs * Borrowed from perl source file pp_ctl.c, where it is used by pp_sort. */ static int sortcmp(const void *a, const void *b) { #if defined(USE_ITHREADS) dTHX; #endif /* USE_ITHREADS */ return sv_cmp(*(SV * const *) a, *(SV * const *) b); } #endif /* PERL_VERSION_LT(5,7,0) */ /* * store_hash * * Store a hash table. * * For a "normal" hash (not restricted, no utf8 keys): * * Layout is SX_HASH <size> followed by each key/value pair, in random order. * Values are stored as <object>. * Keys are stored as <length> <data>, the <data> section being omitted * if length is 0. * * For a "fancy" hash (restricted or utf8 keys): * * Layout is SX_FLAG_HASH <size> <hash flags> followed by each key/value pair, * in random order. * Values are stored as <object>. * Keys are stored as <flags> <length> <data>, the <data> section being omitted * if length is 0. * Currently the only hash flag is "restricted" * Key flags are as for hv.h */ static int store_hash(pTHX_ stcxt_t *cxt, HV *hv) { dVAR; UV len = (UV)HvTOTALKEYS(hv); Size_t i; int ret = 0; I32 riter; HE *eiter; int flagged_hash = ((SvREADONLY(hv) #ifdef HAS_HASH_KEY_FLAGS || HvHASKFLAGS(hv) #endif ) ? 1 : 0); unsigned char hash_flags = (SvREADONLY(hv) ? SHV_RESTRICTED : 0); SV * const recur_sv = cxt->recur_sv; /* * Signal hash by emitting SX_HASH, followed by the table length. * Max number of keys per perl version: * IV - 5.12 * STRLEN 5.14 - 5.24 (size_t: U32/U64) * SSize_t 5.22c - 5.24c (I32/I64) * U32 5.25c - */ if (len > 0x7fffffffu) { /* keys > I32_MAX */ /* * Large hash: SX_LOBJECT type hashflags? U64 data * * Stupid limitation: * Note that perl5 can store more than 2G keys, but only iterate * over 2G max. (cperl can) * We need to manually iterate over it then, unsorted. * But until perl itself cannot do that, skip that. */ TRACEME(("lobject size = %lu", (unsigned long)len)); #ifdef HAS_U64 PUTMARK(SX_LOBJECT); if (flagged_hash) { PUTMARK(SX_FLAG_HASH); PUTMARK(hash_flags); } else { PUTMARK(SX_HASH); } W64LEN(len); return store_lhash(aTHX_ cxt, hv, hash_flags); #else /* <5.12 you could store larger hashes, but cannot iterate over them. So we reject them, it's a bug. */ CROAK(("Cannot store large objects on a 32bit system")); #endif } else { I32 l = (I32)len; if (flagged_hash) { TRACEME(("store_hash (0x%" UVxf ") (flags %x)", PTR2UV(hv), (unsigned int)hash_flags)); PUTMARK(SX_FLAG_HASH); PUTMARK(hash_flags); } else { TRACEME(("store_hash (0x%" UVxf ")", PTR2UV(hv))); PUTMARK(SX_HASH); } WLEN(l); TRACEME(("size = %d, used = %d", (int)l, (int)HvUSEDKEYS(hv))); } TRACEME((">hash recur_depth %" IVdf ", recur_sv (0x%" UVxf ") max %" IVdf, cxt->recur_depth, PTR2UV(cxt->recur_sv), cxt->max_recur_depth_hash)); if (recur_sv != (SV*)hv && cxt->max_recur_depth_hash != -1) { ++cxt->recur_depth; } if (RECURSION_TOO_DEEP_HASH()) { #if PERL_VERSION_LT(5,15,0) cleanup_recursive_data(aTHX_ (SV*)hv); #endif CROAK((MAX_DEPTH_ERROR)); } /* * Save possible iteration state via each() on that table. * * Note that perl as of 5.24 *can* store more than 2G keys, but *not* * iterate over it. * Lengths of hash keys are also limited to I32, which is good. */ riter = HvRITER_get(hv); eiter = HvEITER_get(hv); hv_iterinit(hv); /* * Now store each item recursively. * * If canonical is defined to some true value then store each * key/value pair in sorted order otherwise the order is random. * Canonical order is irrelevant when a deep clone operation is performed. * * Fetch the value from perl only once per store() operation, and only * when needed. */ if ( !(cxt->optype & ST_CLONE) && (cxt->canonical == 1 || (cxt->canonical < 0 && (cxt->canonical = (SvTRUE(get_sv("Storable::canonical", GV_ADD)) ? 1 : 0)))) ) { /* * Storing in order, sorted by key. * Run through the hash, building up an array of keys in a * mortal array, sort the array and then run through the * array. */ AV *av = newAV(); av_extend (av, len); TRACEME(("using canonical order")); for (i = 0; i < len; i++) { #ifdef HAS_RESTRICTED_HASHES HE *he = hv_iternext_flags(hv, HV_ITERNEXT_WANTPLACEHOLDERS); #else HE *he = hv_iternext(hv); #endif av_store(av, i, hv_iterkeysv(he)); } STORE_HASH_SORT; for (i = 0; i < len; i++) { #ifdef HAS_RESTRICTED_HASHES int placeholders = (int)HvPLACEHOLDERS_get(hv); #endif unsigned char flags = 0; char *keyval; STRLEN keylen_tmp; I32 keylen; SV *key = av_shift(av); /* This will fail if key is a placeholder. Track how many placeholders we have, and error if we "see" too many. */ HE *he = hv_fetch_ent(hv, key, 0, 0); SV *val; if (he) { if (!(val = HeVAL(he))) { /* Internal error, not I/O error */ return 1; } } else { #ifdef HAS_RESTRICTED_HASHES /* Should be a placeholder. */ if (placeholders-- < 0) { /* This should not happen - number of retrieves should be identical to number of placeholders. */ return 1; } /* Value is never needed, and PL_sv_undef is more space efficient to store. */ val = &PL_sv_undef; ASSERT (flags == 0, ("Flags not 0 but %d", (int)flags)); flags = SHV_K_PLACEHOLDER; #else return 1; #endif } /* * Store value first. */ TRACEME(("(#%d) value 0x%" UVxf, (int)i, PTR2UV(val))); if ((ret = store(aTHX_ cxt, val))) /* Extra () for -Wall, grr... */ goto out; /* * Write key string. * Keys are written after values to make sure retrieval * can be optimal in terms of memory usage, where keys are * read into a fixed unique buffer called kbuf. * See retrieve_hash() for details. */ /* Implementation of restricted hashes isn't nicely abstracted: */ if ((hash_flags & SHV_RESTRICTED) && SvTRULYREADONLY(val)) { flags |= SHV_K_LOCKED; } keyval = SvPV(key, keylen_tmp); keylen = keylen_tmp; if (SvUTF8(key)) { const char *keysave = keyval; bool is_utf8 = TRUE; /* Just casting the &klen to (STRLEN) won't work well if STRLEN and I32 are of different widths. --jhi */ keyval = (char*)bytes_from_utf8((U8*)keyval, &keylen_tmp, &is_utf8); /* If we were able to downgrade here, then than means that we have a key which only had chars 0-255, but was utf8 encoded. */ if (keyval != keysave) { keylen = keylen_tmp; flags |= SHV_K_WASUTF8; } else { /* keylen_tmp can't have changed, so no need to assign back to keylen. */ flags |= SHV_K_UTF8; } } if (flagged_hash) { PUTMARK(flags); TRACEME(("(#%d) key '%s' flags %x %u", (int)i, keyval, flags, *keyval)); } else { /* This is a workaround for a bug in 5.8.0 that causes the HEK_WASUTF8 flag to be set on an HEK without the hash being marked as having key flags. We just cross our fingers and drop the flag. AMS 20030901 */ assert (flags == 0 || flags == SHV_K_WASUTF8); TRACEME(("(#%d) key '%s'", (int)i, keyval)); } WLEN(keylen); if (keylen) WRITE(keyval, keylen); if (flags & SHV_K_WASUTF8) Safefree (keyval); } /* * Free up the temporary array */ av_undef(av); sv_free((SV *) av); } else { /* * Storing in "random" order (in the order the keys are stored * within the hash). This is the default and will be faster! */ for (i = 0; i < len; i++) { #ifdef HV_ITERNEXT_WANTPLACEHOLDERS HE *he = hv_iternext_flags(hv, HV_ITERNEXT_WANTPLACEHOLDERS); #else HE *he = hv_iternext(hv); #endif SV *val = (he ? hv_iterval(hv, he) : 0); if (val == 0) return 1; /* Internal error, not I/O error */ if ((ret = store_hentry(aTHX_ cxt, hv, i, HeKEY_hek(he), val, hash_flags))) goto out; } } TRACEME(("ok (hash 0x%" UVxf ")", PTR2UV(hv))); out: assert(cxt->max_recur_depth_hash != -1 && cxt->recur_depth > 0); TRACEME(("<hash recur_depth --%" IVdf , cxt->recur_depth)); if (cxt->max_recur_depth_hash != -1 && recur_sv != (SV*)hv && cxt->recur_depth > 0) { --cxt->recur_depth; } HvRITER_set(hv, riter); /* Restore hash iterator state */ HvEITER_set(hv, eiter); return ret; } static int store_hentry(pTHX_ stcxt_t *cxt, HV* hv, UV i, HEK *hek, SV *val, unsigned char hash_flags) { int ret = 0; int flagged_hash = ((SvREADONLY(hv) #ifdef HAS_HASH_KEY_FLAGS || HvHASKFLAGS(hv) #endif ) ? 1 : 0); /* Implementation of restricted hashes isn't nicely abstracted: */ unsigned char flags = (((hash_flags & SHV_RESTRICTED) && SvTRULYREADONLY(val)) ? SHV_K_LOCKED : 0); #ifndef DEBUGME PERL_UNUSED_ARG(i); #endif if (val == &PL_sv_placeholder) { flags |= SHV_K_PLACEHOLDER; val = &PL_sv_undef; } /* * Store value first. */ TRACEME(("(#%d) value 0x%" UVxf, (int)i, PTR2UV(val))); { I32 len = HEK_LEN(hek); SV *key_sv = NULL; char *key = 0; if ((ret = store(aTHX_ cxt, val))) return ret; if (len == HEf_SVKEY) { /* This is somewhat sick, but the internal APIs are * such that XS code could put one of these in * a regular hash. * Maybe we should be capable of storing one if * found. */ key_sv = (SV *)HEK_KEY(hek); flags |= SHV_K_ISSV; } else { /* Regular string key. */ #ifdef HAS_HASH_KEY_FLAGS if (HEK_UTF8(hek)) flags |= SHV_K_UTF8; if (HEK_WASUTF8(hek)) flags |= SHV_K_WASUTF8; #endif key = HEK_KEY(hek); } /* * Write key string. * Keys are written after values to make sure retrieval * can be optimal in terms of memory usage, where keys are * read into a fixed unique buffer called kbuf. * See retrieve_hash() for details. */ if (flagged_hash) { PUTMARK(flags); TRACEME(("(#%d) key '%s' flags %x", (int)i, key, flags)); } else { /* This is a workaround for a bug in 5.8.0 that causes the HEK_WASUTF8 flag to be set on an HEK without the hash being marked as having key flags. We just cross our fingers and drop the flag. AMS 20030901 */ assert (flags == 0 || flags == SHV_K_WASUTF8); TRACEME(("(#%d) key '%s'", (int)i, key)); } if (flags & SHV_K_ISSV) { if ((ret = store(aTHX_ cxt, key_sv))) return ret; } else { WLEN(len); if (len) WRITE(key, len); } } return ret; } #ifdef HAS_U64 /* * store_lhash * * Store a overlong hash table, with >2G keys, which we cannot iterate * over with perl5. xhv_eiter is only I32 there. (only cperl can) * and we also do not want to sort it. * So we walk the buckets and chains manually. * * type, len and flags are already written. */ static int store_lhash(pTHX_ stcxt_t *cxt, HV *hv, unsigned char hash_flags) { dVAR; int ret = 0; Size_t i; UV ix = 0; HE** array; #ifdef DEBUGME UV len = (UV)HvTOTALKEYS(hv); #endif SV * const recur_sv = cxt->recur_sv; if (hash_flags) { TRACEME(("store_lhash (0x%" UVxf ") (flags %x)", PTR2UV(hv), (int) hash_flags)); } else { TRACEME(("store_lhash (0x%" UVxf ")", PTR2UV(hv))); } TRACEME(("size = %" UVuf ", used = %" UVuf, len, (UV)HvUSEDKEYS(hv))); TRACEME(("recur_depth %" IVdf ", recur_sv (0x%" UVxf ")", cxt->recur_depth, PTR2UV(cxt->recur_sv))); if (recur_sv != (SV*)hv && cxt->max_recur_depth_hash != -1) { ++cxt->recur_depth; } if (RECURSION_TOO_DEEP_HASH()) { #if PERL_VERSION_LT(5,15,0) cleanup_recursive_data(aTHX_ (SV*)hv); #endif CROAK((MAX_DEPTH_ERROR)); } array = HvARRAY(hv); for (i = 0; i <= (Size_t)HvMAX(hv); i++) { HE* entry = array[i]; while (entry) { SV* val = hv_iterval(hv, entry); if ((ret = store_hentry(aTHX_ cxt, hv, ix++, HeKEY_hek(entry), val, hash_flags))) return ret; entry = HeNEXT(entry); } } if (recur_sv != (SV*)hv && cxt->max_recur_depth_hash != -1 && cxt->recur_depth > 0) { TRACEME(("recur_depth --%" IVdf, cxt->recur_depth)); --cxt->recur_depth; } assert(ix == len); return ret; } #endif /* * store_code * * Store a code reference. * * Layout is SX_CODE <length> followed by a scalar containing the perl * source code of the code reference. */ static int store_code(pTHX_ stcxt_t *cxt, CV *cv) { dSP; STRLEN len; STRLEN count, reallen; SV *text, *bdeparse; TRACEME(("store_code (0x%" UVxf ")", PTR2UV(cv))); if ( cxt->deparse == 0 || (cxt->deparse < 0 && !(cxt->deparse = SvTRUE(get_sv("Storable::Deparse", GV_ADD)) ? 1 : 0)) ) { return store_other(aTHX_ cxt, (SV*)cv); } /* * Require B::Deparse. At least B::Deparse 0.61 is needed for * blessed code references. */ /* Ownership of both SVs is passed to load_module, which frees them. */ load_module(PERL_LOADMOD_NOIMPORT, newSVpvs("B::Deparse"), newSVnv(0.61)); SPAGAIN; ENTER; SAVETMPS; /* * create the B::Deparse object */ PUSHMARK(sp); XPUSHs(newSVpvs_flags("B::Deparse", SVs_TEMP)); PUTBACK; count = call_method("new", G_SCALAR); SPAGAIN; if (count != 1) CROAK(("Unexpected return value from B::Deparse::new\n")); bdeparse = POPs; /* * call the coderef2text method */ PUSHMARK(sp); XPUSHs(bdeparse); /* XXX is this already mortal? */ XPUSHs(sv_2mortal(newRV_inc((SV*)cv))); PUTBACK; count = call_method("coderef2text", G_SCALAR); SPAGAIN; if (count != 1) CROAK(("Unexpected return value from B::Deparse::coderef2text\n")); text = POPs; len = SvCUR(text); reallen = strlen(SvPV_nolen(text)); /* * Empty code references or XS functions are deparsed as * "(prototype) ;" or ";". */ if (len == 0 || *(SvPV_nolen(text)+reallen-1) == ';') { CROAK(("The result of B::Deparse::coderef2text was empty - maybe you're trying to serialize an XS function?\n")); } /* * Signal code by emitting SX_CODE. */ PUTMARK(SX_CODE); cxt->tagnum++; /* necessary, as SX_CODE is a SEEN() candidate */ TRACEME(("size = %d", (int)len)); TRACEME(("code = %s", SvPV_nolen(text))); /* * Now store the source code. */ if(SvUTF8 (text)) STORE_UTF8STR(SvPV_nolen(text), len); else STORE_SCALAR(SvPV_nolen(text), len); FREETMPS; LEAVE; TRACEME(("ok (code)")); return 0; } #if PERL_VERSION_LT(5,8,0) # define PERL_MAGIC_qr 'r' /* precompiled qr// regex */ # define BFD_Svs_SMG_OR_RMG SVs_RMG #elif PERL_VERSION_GE(5,8,1) # define BFD_Svs_SMG_OR_RMG SVs_SMG # define MY_PLACEHOLDER PL_sv_placeholder #else # define BFD_Svs_SMG_OR_RMG SVs_RMG # define MY_PLACEHOLDER PL_sv_undef #endif static int get_regexp(pTHX_ stcxt_t *cxt, SV* sv, SV **re, SV **flags) { dSP; SV* rv; #if PERL_VERSION_GE(5,12,0) CV *cv = get_cv("re::regexp_pattern", 0); #else CV *cv = get_cv("Storable::_regexp_pattern", 0); #endif I32 count; assert(cv); ENTER; SAVETMPS; rv = sv_2mortal((SV*)newRV_inc(sv)); PUSHMARK(sp); XPUSHs(rv); PUTBACK; /* optimize to call the XS directly later */ count = call_sv((SV*)cv, G_ARRAY); SPAGAIN; if (count < 2) CROAK(("re::regexp_pattern returned only %d results", (int)count)); *flags = POPs; SvREFCNT_inc(*flags); *re = POPs; SvREFCNT_inc(*re); PUTBACK; FREETMPS; LEAVE; return 1; } static int store_regexp(pTHX_ stcxt_t *cxt, SV *sv) { SV *re = NULL; SV *flags = NULL; const char *re_pv; const char *flags_pv; STRLEN re_len; STRLEN flags_len; U8 op_flags = 0; if (!get_regexp(aTHX_ cxt, sv, &re, &flags)) return -1; re_pv = SvPV(re, re_len); flags_pv = SvPV(flags, flags_len); if (re_len > 0xFF) { op_flags |= SHR_U32_RE_LEN; } PUTMARK(SX_REGEXP); PUTMARK(op_flags); if (op_flags & SHR_U32_RE_LEN) { U32 re_len32 = re_len; WLEN(re_len32); } else PUTMARK(re_len); WRITE(re_pv, re_len); PUTMARK(flags_len); WRITE(flags_pv, flags_len); return 0; } /* * store_tied * * When storing a tied object (be it a tied scalar, array or hash), we lay out * a special mark, followed by the underlying tied object. For instance, when * dealing with a tied hash, we store SX_TIED_HASH <hash object>, where * <hash object> stands for the serialization of the tied hash. */ static int store_tied(pTHX_ stcxt_t *cxt, SV *sv) { MAGIC *mg; SV *obj = NULL; int ret = 0; int svt = SvTYPE(sv); char mtype = 'P'; TRACEME(("store_tied (0x%" UVxf ")", PTR2UV(sv))); /* * We have a small run-time penalty here because we chose to factorise * all tieds objects into the same routine, and not have a store_tied_hash, * a store_tied_array, etc... * * Don't use a switch() statement, as most compilers don't optimize that * well for 2/3 values. An if() else if() cascade is just fine. We put * tied hashes first, as they are the most likely beasts. */ if (svt == SVt_PVHV) { TRACEME(("tied hash")); PUTMARK(SX_TIED_HASH); /* Introduces tied hash */ } else if (svt == SVt_PVAV) { TRACEME(("tied array")); PUTMARK(SX_TIED_ARRAY); /* Introduces tied array */ } else { TRACEME(("tied scalar")); PUTMARK(SX_TIED_SCALAR); /* Introduces tied scalar */ mtype = 'q'; } if (!(mg = mg_find(sv, mtype))) CROAK(("No magic '%c' found while storing tied %s", mtype, (svt == SVt_PVHV) ? "hash" : (svt == SVt_PVAV) ? "array" : "scalar")); /* * The mg->mg_obj found by mg_find() above actually points to the * underlying tied Perl object implementation. For instance, if the * original SV was that of a tied array, then mg->mg_obj is an AV. * * Note that we store the Perl object as-is. We don't call its FETCH * method along the way. At retrieval time, we won't call its STORE * method either, but the tieing magic will be re-installed. In itself, * that ensures that the tieing semantics are preserved since further * accesses on the retrieved object will indeed call the magic methods... */ /* [#17040] mg_obj is NULL for scalar self-ties. AMS 20030416 */ obj = mg->mg_obj ? mg->mg_obj : newSV(0); if ((ret = store(aTHX_ cxt, obj))) return ret; TRACEME(("ok (tied)")); return 0; } /* * store_tied_item * * Stores a reference to an item within a tied structure: * * . \$h{key}, stores both the (tied %h) object and 'key'. * . \$a[idx], stores both the (tied @a) object and 'idx'. * * Layout is therefore either: * SX_TIED_KEY <object> <key> * SX_TIED_IDX <object> <index> */ static int store_tied_item(pTHX_ stcxt_t *cxt, SV *sv) { MAGIC *mg; int ret; TRACEME(("store_tied_item (0x%" UVxf ")", PTR2UV(sv))); if (!(mg = mg_find(sv, 'p'))) CROAK(("No magic 'p' found while storing reference to tied item")); /* * We discriminate between \$h{key} and \$a[idx] via mg_ptr. */ if (mg->mg_ptr) { TRACEME(("store_tied_item: storing a ref to a tied hash item")); PUTMARK(SX_TIED_KEY); TRACEME(("store_tied_item: storing OBJ 0x%" UVxf, PTR2UV(mg->mg_obj))); if ((ret = store(aTHX_ cxt, mg->mg_obj))) /* Extra () for -Wall, grr... */ return ret; TRACEME(("store_tied_item: storing PTR 0x%" UVxf, PTR2UV(mg->mg_ptr))); if ((ret = store(aTHX_ cxt, (SV *) mg->mg_ptr))) /* Idem, for -Wall */ return ret; } else { I32 idx = mg->mg_len; TRACEME(("store_tied_item: storing a ref to a tied array item ")); PUTMARK(SX_TIED_IDX); TRACEME(("store_tied_item: storing OBJ 0x%" UVxf, PTR2UV(mg->mg_obj))); if ((ret = store(aTHX_ cxt, mg->mg_obj))) /* Idem, for -Wall */ return ret; TRACEME(("store_tied_item: storing IDX %d", (int)idx)); WLEN(idx); } TRACEME(("ok (tied item)")); return 0; } /* * store_hook -- dispatched manually, not via sv_store[] * * The blessed SV is serialized by a hook. * * Simple Layout is: * * SX_HOOK <flags> <len> <classname> <len2> <str> [<len3> <object-IDs>] * * where <flags> indicates how long <len>, <len2> and <len3> are, whether * the trailing part [] is present, the type of object (scalar, array or hash). * There is also a bit which says how the classname is stored between: * * <len> <classname> * <index> * * and when the <index> form is used (classname already seen), the "large * classname" bit in <flags> indicates how large the <index> is. * * The serialized string returned by the hook is of length <len2> and comes * next. It is an opaque string for us. * * Those <len3> object IDs which are listed last represent the extra references * not directly serialized by the hook, but which are linked to the object. * * When recursion is mandated to resolve object-IDs not yet seen, we have * instead, with <header> being flags with bits set to indicate the object type * and that recursion was indeed needed: * * SX_HOOK <header> <object> <header> <object> <flags> * * that same header being repeated between serialized objects obtained through * recursion, until we reach flags indicating no recursion, at which point * we know we've resynchronized with a single layout, after <flags>. * * When storing a blessed ref to a tied variable, the following format is * used: * * SX_HOOK <flags> <extra> ... [<len3> <object-IDs>] <magic object> * * The first <flags> indication carries an object of type SHT_EXTRA, and the * real object type is held in the <extra> flag. At the very end of the * serialization stream, the underlying magic object is serialized, just like * any other tied variable. */ static int store_hook( pTHX_ stcxt_t *cxt, SV *sv, int type, HV *pkg, SV *hook) { I32 len; char *classname; STRLEN len2; SV *ref; AV *av; SV **ary; IV count; /* really len3 + 1 */ unsigned char flags; char *pv; int i; int recursed = 0; /* counts recursion */ int obj_type; /* object type, on 2 bits */ I32 classnum; int ret; int clone = cxt->optype & ST_CLONE; char mtype = '\0'; /* for blessed ref to tied structures */ unsigned char eflags = '\0'; /* used when object type is SHT_EXTRA */ #ifdef HAS_U64 int need_large_oids = 0; #endif TRACEME(("store_hook, classname \"%s\", tagged #%d", HvNAME_get(pkg), (int)cxt->tagnum)); /* * Determine object type on 2 bits. */ switch (type) { case svis_REF: case svis_SCALAR: obj_type = SHT_SCALAR; break; case svis_ARRAY: obj_type = SHT_ARRAY; break; case svis_HASH: obj_type = SHT_HASH; break; case svis_TIED: /* * Produced by a blessed ref to a tied data structure, $o in the * following Perl code. * * my %h; * tie %h, 'FOO'; * my $o = bless \%h, 'BAR'; * * Signal the tie-ing magic by setting the object type as SHT_EXTRA * (since we have only 2 bits in <flags> to store the type), and an * <extra> byte flag will be emitted after the FIRST <flags> in the * stream, carrying what we put in 'eflags'. */ obj_type = SHT_EXTRA; switch (SvTYPE(sv)) { case SVt_PVHV: eflags = (unsigned char) SHT_THASH; mtype = 'P'; break; case SVt_PVAV: eflags = (unsigned char) SHT_TARRAY; mtype = 'P'; break; default: eflags = (unsigned char) SHT_TSCALAR; mtype = 'q'; break; } break; default: CROAK(("Unexpected object type (%d) in store_hook()", type)); } flags = SHF_NEED_RECURSE | obj_type; classname = HvNAME_get(pkg); len = strlen(classname); /* * To call the hook, we need to fake a call like: * * $object->STORABLE_freeze($cloning); * * but we don't have the $object here. For instance, if $object is * a blessed array, what we have in 'sv' is the array, and we can't * call a method on those. * * Therefore, we need to create a temporary reference to the object and * make the call on that reference. */ TRACEME(("about to call STORABLE_freeze on class %s", classname)); ref = newRV_inc(sv); /* Temporary reference */ av = array_call(aTHX_ ref, hook, clone); /* @a = $object->STORABLE_freeze($c) */ SvREFCNT_dec(ref); /* Reclaim temporary reference */ count = AvFILLp(av) + 1; TRACEME(("store_hook, array holds %" IVdf " items", count)); /* * If they return an empty list, it means they wish to ignore the * hook for this class (and not just this instance -- that's for them * to handle if they so wish). * * Simply disable the cached entry for the hook (it won't be recomputed * since it's present in the cache) and recurse to store_blessed(). */ if (!count) { /* free empty list returned by the hook */ av_undef(av); sv_free((SV *) av); /* * They must not change their mind in the middle of a serialization. */ if (hv_fetch(cxt->hclass, classname, len, FALSE)) CROAK(("Too late to ignore hooks for %s class \"%s\"", (cxt->optype & ST_CLONE) ? "cloning" : "storing", classname)); pkg_hide(aTHX_ cxt->hook, pkg, "STORABLE_freeze"); ASSERT(!pkg_can(aTHX_ cxt->hook, pkg, "STORABLE_freeze"), ("hook invisible")); TRACEME(("ignoring STORABLE_freeze in class \"%s\"", classname)); return store_blessed(aTHX_ cxt, sv, type, pkg); } /* * Get frozen string. */ ary = AvARRAY(av); pv = SvPV(ary[0], len2); /* We can't use pkg_can here because it only caches one method per * package */ { GV* gv = gv_fetchmethod_autoload(pkg, "STORABLE_attach", FALSE); if (gv && isGV(gv)) { if (count > 1) CROAK(("Freeze cannot return references if %s class is using STORABLE_attach", classname)); goto check_done; } } #ifdef HAS_U64 if (count > I32_MAX) { CROAK(("Too many references returned by STORABLE_freeze()")); } #endif /* * If they returned more than one item, we need to serialize some * extra references if not already done. * * Loop over the array, starting at position #1, and for each item, * ensure it is a reference, serialize it if not already done, and * replace the entry with the tag ID of the corresponding serialized * object. * * We CHEAT by not calling av_fetch() and read directly within the * array, for speed. */ for (i = 1; i < count; i++) { #ifdef USE_PTR_TABLE char *fake_tag; #else SV **svh; #endif SV *rsv = ary[i]; SV *xsv; SV *tag; AV *av_hook = cxt->hook_seen; if (!SvROK(rsv)) CROAK(("Item #%d returned by STORABLE_freeze " "for %s is not a reference", (int)i, classname)); xsv = SvRV(rsv); /* Follow ref to know what to look for */ /* * Look in hseen and see if we have a tag already. * Serialize entry if not done already, and get its tag. */ #ifdef USE_PTR_TABLE /* Fakery needed because ptr_table_fetch returns zero for a failure, whereas the existing code assumes that it can safely store a tag zero. So for ptr_tables we store tag+1 */ if ((fake_tag = (char *)ptr_table_fetch(cxt->pseen, xsv))) goto sv_seen; /* Avoid moving code too far to the right */ #else if ((svh = hv_fetch(cxt->hseen, (char *) &xsv, sizeof(xsv), FALSE))) goto sv_seen; /* Avoid moving code too far to the right */ #endif TRACEME(("listed object %d at 0x%" UVxf " is unknown", i-1, PTR2UV(xsv))); /* * We need to recurse to store that object and get it to be known * so that we can resolve the list of object-IDs at retrieve time. * * The first time we do this, we need to emit the proper header * indicating that we recursed, and what the type of object is (the * object we're storing via a user-hook). Indeed, during retrieval, * we'll have to create the object before recursing to retrieve the * others, in case those would point back at that object. */ /* [SX_HOOK] <flags> [<extra>] <object>*/ if (!recursed++) { #ifdef HAS_U64 if (len2 > INT32_MAX) PUTMARK(SX_LOBJECT); #endif PUTMARK(SX_HOOK); PUTMARK(flags); if (obj_type == SHT_EXTRA) PUTMARK(eflags); } else PUTMARK(flags); if ((ret = store(aTHX_ cxt, xsv))) /* Given by hook for us to store */ return ret; #ifdef USE_PTR_TABLE fake_tag = (char *)ptr_table_fetch(cxt->pseen, xsv); if (!fake_tag) CROAK(("Could not serialize item #%d from hook in %s", (int)i, classname)); #else svh = hv_fetch(cxt->hseen, (char *) &xsv, sizeof(xsv), FALSE); if (!svh) CROAK(("Could not serialize item #%d from hook in %s", (int)i, classname)); #endif /* * It was the first time we serialized 'xsv'. * * Keep this SV alive until the end of the serialization: if we * disposed of it right now by decrementing its refcount, and it was * a temporary value, some next temporary value allocated during * another STORABLE_freeze might take its place, and we'd wrongly * assume that new SV was already serialized, based on its presence * in cxt->hseen. * * Therefore, push it away in cxt->hook_seen. */ av_store(av_hook, AvFILLp(av_hook)+1, SvREFCNT_inc(xsv)); sv_seen: /* * Dispose of the REF they returned. If we saved the 'xsv' away * in the array of returned SVs, that will not cause the underlying * referenced SV to be reclaimed. */ ASSERT(SvREFCNT(xsv) > 1, ("SV will survive disposal of its REF")); SvREFCNT_dec(rsv); /* Dispose of reference */ /* * Replace entry with its tag (not a real SV, so no refcnt increment) */ #ifdef USE_PTR_TABLE tag = (SV *)--fake_tag; #else tag = *svh; #endif ary[i] = tag; TRACEME(("listed object %d at 0x%" UVxf " is tag #%" UVuf, i-1, PTR2UV(xsv), PTR2UV(tag))); #ifdef HAS_U64 if ((U32)PTR2TAG(tag) != PTR2TAG(tag)) need_large_oids = 1; #endif } /* * Allocate a class ID if not already done. * * This needs to be done after the recursion above, since at retrieval * time, we'll see the inner objects first. Many thanks to * Salvador Ortiz Garcia <sog@msg.com.mx> who spot that bug and * proposed the right fix. -- RAM, 15/09/2000 */ check_done: if (!known_class(aTHX_ cxt, classname, len, &classnum)) { TRACEME(("first time we see class %s, ID = %d", classname, (int)classnum)); classnum = -1; /* Mark: we must store classname */ } else { TRACEME(("already seen class %s, ID = %d", classname, (int)classnum)); } /* * Compute leading flags. */ flags = obj_type; if (((classnum == -1) ? len : classnum) > LG_SCALAR) flags |= SHF_LARGE_CLASSLEN; if (classnum != -1) flags |= SHF_IDX_CLASSNAME; if (len2 > LG_SCALAR) flags |= SHF_LARGE_STRLEN; if (count > 1) flags |= SHF_HAS_LIST; if (count > (LG_SCALAR + 1)) flags |= SHF_LARGE_LISTLEN; #ifdef HAS_U64 if (need_large_oids) flags |= SHF_LARGE_LISTLEN; #endif /* * We're ready to emit either serialized form: * * SX_HOOK <flags> <len> <classname> <len2> <str> [<len3> <object-IDs>] * SX_HOOK <flags> <index> <len2> <str> [<len3> <object-IDs>] * * If we recursed, the SX_HOOK has already been emitted. */ TRACEME(("SX_HOOK (recursed=%d) flags=0x%x " "class=%" IVdf " len=%" IVdf " len2=%" IVdf " len3=%" IVdf, recursed, flags, (IV)classnum, (IV)len, (IV)len2, count-1)); /* SX_HOOK <flags> [<extra>] */ if (!recursed) { #ifdef HAS_U64 if (len2 > INT32_MAX) PUTMARK(SX_LOBJECT); #endif PUTMARK(SX_HOOK); PUTMARK(flags); if (obj_type == SHT_EXTRA) PUTMARK(eflags); } else PUTMARK(flags); /* <len> <classname> or <index> */ if (flags & SHF_IDX_CLASSNAME) { if (flags & SHF_LARGE_CLASSLEN) WLEN(classnum); else { unsigned char cnum = (unsigned char) classnum; PUTMARK(cnum); } } else { if (flags & SHF_LARGE_CLASSLEN) WLEN(len); else { unsigned char clen = (unsigned char) len; PUTMARK(clen); } WRITE(classname, len); /* Final \0 is omitted */ } /* <len2> <frozen-str> */ #ifdef HAS_U64 if (len2 > INT32_MAX) { W64LEN(len2); } else #endif if (flags & SHF_LARGE_STRLEN) { U32 wlen2 = len2; /* STRLEN might be 8 bytes */ WLEN(wlen2); /* Must write an I32 for 64-bit machines */ } else { unsigned char clen = (unsigned char) len2; PUTMARK(clen); } if (len2) WRITE(pv, (SSize_t)len2); /* Final \0 is omitted */ /* [<len3> <object-IDs>] */ if (flags & SHF_HAS_LIST) { int len3 = count - 1; if (flags & SHF_LARGE_LISTLEN) { #ifdef HAS_U64 int tlen3 = need_large_oids ? -len3 : len3; WLEN(tlen3); #else WLEN(len3); #endif } else { unsigned char clen = (unsigned char) len3; PUTMARK(clen); } /* * NOTA BENE, for 64-bit machines: the ary[i] below does not yield a * real pointer, rather a tag number, well under the 32-bit limit. * Which is wrong... if we have more than 2**32 SVs we can get ids over * the 32-bit limit. */ for (i = 1; i < count; i++) { #ifdef HAS_U64 if (need_large_oids) { ntag_t tag = PTR2TAG(ary[i]); W64LEN(tag); TRACEME(("object %d, tag #%" UVuf, i-1, (UV)tag)); } else #endif { I32 tagval = htonl(LOW_32BITS(ary[i])); WRITE_I32(tagval); TRACEME(("object %d, tag #%d", i-1, ntohl(tagval))); } } } /* * Free the array. We need extra care for indices after 0, since they * don't hold real SVs but integers cast. */ if (count > 1) AvFILLp(av) = 0; /* Cheat, nothing after 0 interests us */ av_undef(av); sv_free((SV *) av); /* * If object was tied, need to insert serialization of the magic object. */ if (obj_type == SHT_EXTRA) { MAGIC *mg; if (!(mg = mg_find(sv, mtype))) { int svt = SvTYPE(sv); CROAK(("No magic '%c' found while storing ref to tied %s with hook", mtype, (svt == SVt_PVHV) ? "hash" : (svt == SVt_PVAV) ? "array" : "scalar")); } TRACEME(("handling the magic object 0x%" UVxf " part of 0x%" UVxf, PTR2UV(mg->mg_obj), PTR2UV(sv))); /* * [<magic object>] */ if ((ret = store(aTHX_ cxt, mg->mg_obj))) return ret; } return 0; } /* * store_blessed -- dispatched manually, not via sv_store[] * * Check whether there is a STORABLE_xxx hook defined in the class or in one * of its ancestors. If there is, then redispatch to store_hook(); * * Otherwise, the blessed SV is stored using the following layout: * * SX_BLESS <flag> <len> <classname> <object> * * where <flag> indicates whether <len> is stored on 0 or 4 bytes, depending * on the high-order bit in flag: if 1, then length follows on 4 bytes. * Otherwise, the low order bits give the length, thereby giving a compact * representation for class names less than 127 chars long. * * Each <classname> seen is remembered and indexed, so that the next time * an object in the blessed in the same <classname> is stored, the following * will be emitted: * * SX_IX_BLESS <flag> <index> <object> * * where <index> is the classname index, stored on 0 or 4 bytes depending * on the high-order bit in flag (same encoding as above for <len>). */ static int store_blessed( pTHX_ stcxt_t *cxt, SV *sv, int type, HV *pkg) { SV *hook; char *classname; I32 len; I32 classnum; TRACEME(("store_blessed, type %d, class \"%s\"", type, HvNAME_get(pkg))); /* * Look for a hook for this blessed SV and redirect to store_hook() * if needed. */ hook = pkg_can(aTHX_ cxt->hook, pkg, "STORABLE_freeze"); if (hook) return store_hook(aTHX_ cxt, sv, type, pkg, hook); /* * This is a blessed SV without any serialization hook. */ classname = HvNAME_get(pkg); len = strlen(classname); TRACEME(("blessed 0x%" UVxf " in %s, no hook: tagged #%d", PTR2UV(sv), classname, (int)cxt->tagnum)); /* * Determine whether it is the first time we see that class name (in which * case it will be stored in the SX_BLESS form), or whether we already * saw that class name before (in which case the SX_IX_BLESS form will be * used). */ if (known_class(aTHX_ cxt, classname, len, &classnum)) { TRACEME(("already seen class %s, ID = %d", classname, (int)classnum)); PUTMARK(SX_IX_BLESS); if (classnum <= LG_BLESS) { unsigned char cnum = (unsigned char) classnum; PUTMARK(cnum); } else { unsigned char flag = (unsigned char) 0x80; PUTMARK(flag); WLEN(classnum); } } else { TRACEME(("first time we see class %s, ID = %d", classname, (int)classnum)); PUTMARK(SX_BLESS); if (len <= LG_BLESS) { unsigned char clen = (unsigned char) len; PUTMARK(clen); } else { unsigned char flag = (unsigned char) 0x80; PUTMARK(flag); WLEN(len); /* Don't BER-encode, this should be rare */ } WRITE(classname, len); /* Final \0 is omitted */ } /* * Now emit the <object> part. */ return SV_STORE(type)(aTHX_ cxt, sv); } /* * store_other * * We don't know how to store the item we reached, so return an error condition. * (it's probably a GLOB, some CODE reference, etc...) * * If they defined the 'forgive_me' variable at the Perl level to some * true value, then don't croak, just warn, and store a placeholder string * instead. */ static int store_other(pTHX_ stcxt_t *cxt, SV *sv) { STRLEN len; char buf[80]; TRACEME(("store_other")); /* * Fetch the value from perl only once per store() operation. */ if ( cxt->forgive_me == 0 || (cxt->forgive_me < 0 && !(cxt->forgive_me = SvTRUE (get_sv("Storable::forgive_me", GV_ADD)) ? 1 : 0)) ) CROAK(("Can't store %s items", sv_reftype(sv, FALSE))); warn("Can't store item %s(0x%" UVxf ")", sv_reftype(sv, FALSE), PTR2UV(sv)); /* * Store placeholder string as a scalar instead... */ (void) sprintf(buf, "You lost %s(0x%" UVxf ")%c", sv_reftype(sv, FALSE), PTR2UV(sv), (char) 0); len = strlen(buf); if (len < 80) STORE_SCALAR(buf, len); TRACEME(("ok (dummy \"%s\", length = %" IVdf ")", buf, (IV) len)); return 0; } /*** *** Store driving routines ***/ /* * sv_type * * WARNING: partially duplicates Perl's sv_reftype for speed. * * Returns the type of the SV, identified by an integer. That integer * may then be used to index the dynamic routine dispatch table. */ static int sv_type(pTHX_ SV *sv) { switch (SvTYPE(sv)) { case SVt_NULL: #if PERL_VERSION_LT(5,11,0) case SVt_IV: #endif case SVt_NV: /* * No need to check for ROK, that can't be set here since there * is no field capable of hodling the xrv_rv reference. */ return svis_SCALAR; case SVt_PV: #if PERL_VERSION_LT(5,11,0) case SVt_RV: #else case SVt_IV: #endif case SVt_PVIV: case SVt_PVNV: /* * Starting from SVt_PV, it is possible to have the ROK flag * set, the pointer to the other SV being either stored in * the xrv_rv (in the case of a pure SVt_RV), or as the * xpv_pv field of an SVt_PV and its heirs. * * However, those SV cannot be magical or they would be an * SVt_PVMG at least. */ return SvROK(sv) ? svis_REF : svis_SCALAR; case SVt_PVMG: #if PERL_VERSION_LT(5,11,0) if ((SvFLAGS(sv) & (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG)) == (SVs_OBJECT|BFD_Svs_SMG_OR_RMG) && mg_find(sv, PERL_MAGIC_qr)) { return svis_REGEXP; } #endif case SVt_PVLV: /* Workaround for perl5.004_04 "LVALUE" bug */ if ((SvFLAGS(sv) & (SVs_GMG|SVs_SMG|SVs_RMG)) == (SVs_GMG|SVs_SMG|SVs_RMG) && (mg_find(sv, 'p'))) return svis_TIED_ITEM; /* FALL THROUGH */ #if PERL_VERSION_LT(5,9,0) case SVt_PVBM: #endif if ((SvFLAGS(sv) & (SVs_GMG|SVs_SMG|SVs_RMG)) == (SVs_GMG|SVs_SMG|SVs_RMG) && (mg_find(sv, 'q'))) return svis_TIED; return SvROK(sv) ? svis_REF : svis_SCALAR; case SVt_PVAV: if (SvRMAGICAL(sv) && (mg_find(sv, 'P'))) return svis_TIED; return svis_ARRAY; case SVt_PVHV: if (SvRMAGICAL(sv) && (mg_find(sv, 'P'))) return svis_TIED; return svis_HASH; case SVt_PVCV: return svis_CODE; #if PERL_VERSION_GE(5,9,0) /* case SVt_INVLIST: */ #endif #if PERL_VERSION_GE(5,11,0) case SVt_REGEXP: return svis_REGEXP; #endif default: break; } return svis_OTHER; } /* * store * * Recursively store objects pointed to by the sv to the specified file. * * Layout is <content> or SX_OBJECT <tagnum> if we reach an already stored * object (one for which storage has started -- it may not be over if we have * a self-referenced structure). This data set forms a stored <object>. */ static int store(pTHX_ stcxt_t *cxt, SV *sv) { SV **svh; int ret; int type; #ifdef USE_PTR_TABLE struct ptr_tbl *pseen = cxt->pseen; #else HV *hseen = cxt->hseen; #endif TRACEME(("store (0x%" UVxf ")", PTR2UV(sv))); /* * If object has already been stored, do not duplicate data. * Simply emit the SX_OBJECT marker followed by its tag data. * The tag is always written in network order. * * NOTA BENE, for 64-bit machines: the "*svh" below does not yield a * real pointer, rather a tag number (watch the insertion code below). * That means it probably safe to assume it is well under the 32-bit * limit, and makes the truncation safe. * -- RAM, 14/09/1999 */ #ifdef USE_PTR_TABLE svh = (SV **)ptr_table_fetch(pseen, sv); #else svh = hv_fetch(hseen, (char *) &sv, sizeof(sv), FALSE); #endif if (svh) { ntag_t tagval; if (sv == &PL_sv_undef) { /* We have seen PL_sv_undef before, but fake it as if we have not. Not the simplest solution to making restricted hashes work on 5.8.0, but it does mean that repeated references to the one true undef will take up less space in the output file. */ /* Need to jump past the next hv_store, because on the second store of undef the old hash value will be SvREFCNT_dec()ed, and as Storable cheats horribly by storing non-SVs in the hash a SEGV will ensure. Need to increase the tag number so that the receiver has no idea what games we're up to. This special casing doesn't affect hooks that store undef, as the hook routine does its own lookup into hseen. Also this means that any references back to PL_sv_undef (from the pathological case of hooks storing references to it) will find the seen hash entry for the first time, as if we didn't have this hackery here. (That hseen lookup works even on 5.8.0 because it's a key of &PL_sv_undef and a value which is a tag number, not a value which is PL_sv_undef.) */ cxt->tagnum++; type = svis_SCALAR; goto undef_special_case; } #ifdef USE_PTR_TABLE tagval = PTR2TAG(((char *)svh)-1); #else tagval = PTR2TAG(*svh); #endif #ifdef HAS_U64 /* older versions of Storable streat the tag as a signed value used in an array lookup, corrupting the data structure. Ensure only a newer Storable will be able to parse this tag id if it's over the 2G mark. */ if (tagval > I32_MAX) { TRACEME(("object 0x%" UVxf " seen as #%" UVuf, PTR2UV(sv), (UV)tagval)); PUTMARK(SX_LOBJECT); PUTMARK(SX_OBJECT); W64LEN(tagval); return 0; } else #endif { I32 ltagval; ltagval = htonl((I32)tagval); TRACEME(("object 0x%" UVxf " seen as #%d", PTR2UV(sv), ntohl(ltagval))); PUTMARK(SX_OBJECT); WRITE_I32(ltagval); return 0; } } /* * Allocate a new tag and associate it with the address of the sv being * stored, before recursing... * * In order to avoid creating new SvIVs to hold the tagnum we just * cast the tagnum to an SV pointer and store that in the hash. This * means that we must clean up the hash manually afterwards, but gives * us a 15% throughput increase. * */ cxt->tagnum++; #ifdef USE_PTR_TABLE ptr_table_store(pseen, sv, INT2PTR(SV*, 1 + cxt->tagnum)); #else if (!hv_store(hseen, (char *) &sv, sizeof(sv), INT2PTR(SV*, cxt->tagnum), 0)) return -1; #endif /* * Store 'sv' and everything beneath it, using appropriate routine. * Abort immediately if we get a non-zero status back. */ type = sv_type(aTHX_ sv); undef_special_case: TRACEME(("storing 0x%" UVxf " tag #%d, type %d...", PTR2UV(sv), (int)cxt->tagnum, (int)type)); if (SvOBJECT(sv)) { HV *pkg = SvSTASH(sv); ret = store_blessed(aTHX_ cxt, sv, type, pkg); } else ret = SV_STORE(type)(aTHX_ cxt, sv); TRACEME(("%s (stored 0x%" UVxf ", refcnt=%d, %s)", ret ? "FAILED" : "ok", PTR2UV(sv), (int)SvREFCNT(sv), sv_reftype(sv, FALSE))); return ret; } /* * magic_write * * Write magic number and system information into the file. * Layout is <magic> <network> [<len> <byteorder> <sizeof int> <sizeof long> * <sizeof ptr>] where <len> is the length of the byteorder hexa string. * All size and lengths are written as single characters here. * * Note that no byte ordering info is emitted when <network> is true, since * integers will be emitted in network order in that case. */ static int magic_write(pTHX_ stcxt_t *cxt) { /* * Starting with 0.6, the "use_network_order" byte flag is also used to * indicate the version number of the binary image, encoded in the upper * bits. The bit 0 is always used to indicate network order. */ /* * Starting with 0.7, a full byte is dedicated to the minor version of * the binary format, which is incremented only when new markers are * introduced, for instance, but when backward compatibility is preserved. */ /* Make these at compile time. The WRITE() macro is sufficiently complex that it saves about 200 bytes doing it this way and only using it once. */ static const unsigned char network_file_header[] = { MAGICSTR_BYTES, (STORABLE_BIN_MAJOR << 1) | 1, STORABLE_BIN_WRITE_MINOR }; static const unsigned char file_header[] = { MAGICSTR_BYTES, (STORABLE_BIN_MAJOR << 1) | 0, STORABLE_BIN_WRITE_MINOR, /* sizeof the array includes the 0 byte at the end: */ (char) sizeof (byteorderstr) - 1, BYTEORDER_BYTES, (unsigned char) sizeof(int), (unsigned char) sizeof(long), (unsigned char) sizeof(char *), (unsigned char) sizeof(NV) }; #ifdef USE_56_INTERWORK_KLUDGE static const unsigned char file_header_56[] = { MAGICSTR_BYTES, (STORABLE_BIN_MAJOR << 1) | 0, STORABLE_BIN_WRITE_MINOR, /* sizeof the array includes the 0 byte at the end: */ (char) sizeof (byteorderstr_56) - 1, BYTEORDER_BYTES_56, (unsigned char) sizeof(int), (unsigned char) sizeof(long), (unsigned char) sizeof(char *), (unsigned char) sizeof(NV) }; #endif const unsigned char *header; SSize_t length; TRACEME(("magic_write on fd=%d", cxt->fio ? PerlIO_fileno(cxt->fio) : -1)); if (cxt->netorder) { header = network_file_header; length = sizeof (network_file_header); } else { #ifdef USE_56_INTERWORK_KLUDGE if (SvTRUE(get_sv("Storable::interwork_56_64bit", GV_ADD))) { header = file_header_56; length = sizeof (file_header_56); } else #endif { header = file_header; length = sizeof (file_header); } } if (!cxt->fio) { /* sizeof the array includes the 0 byte at the end. */ header += sizeof (magicstr) - 1; length -= sizeof (magicstr) - 1; } WRITE( (unsigned char*) header, length); if (!cxt->netorder) { TRACEME(("ok (magic_write byteorder = 0x%lx [%d], I%d L%d P%d D%d)", (unsigned long) BYTEORDER, (int) sizeof (byteorderstr) - 1, (int) sizeof(int), (int) sizeof(long), (int) sizeof(char *), (int) sizeof(NV))); } return 0; } /* * do_store * * Common code for store operations. * * When memory store is requested (f = NULL) and a non null SV* is given in * 'res', it is filled with a new SV created out of the memory buffer. * * It is required to provide a non-null 'res' when the operation type is not * dclone() and store() is performed to memory. */ static int do_store(pTHX_ PerlIO *f, SV *sv, int optype, int network_order, SV **res) { dSTCXT; int status; ASSERT(!(f == 0 && !(optype & ST_CLONE)) || res, ("must supply result SV pointer for real recursion to memory")); TRACEMED(("do_store (optype=%d, netorder=%d)", optype, network_order)); optype |= ST_STORE; /* * Workaround for CROAK leak: if they enter with a "dirty" context, * free up memory for them now. */ assert(cxt); if (cxt->s_dirty) clean_context(aTHX_ cxt); /* * Now that STORABLE_xxx hooks exist, it is possible that they try to * re-enter store() via the hooks. We need to stack contexts. */ if (cxt->entry) cxt = allocate_context(aTHX_ cxt); INIT_TRACEME; cxt->entry++; ASSERT(cxt->entry == 1, ("starting new recursion")); ASSERT(!cxt->s_dirty, ("clean context")); /* * Ensure sv is actually a reference. From perl, we called something * like: * pstore(aTHX_ FILE, \@array); * so we must get the scalar value behind that reference. */ if (!SvROK(sv)) CROAK(("Not a reference")); sv = SvRV(sv); /* So follow it to know what to store */ /* * If we're going to store to memory, reset the buffer. */ if (!f) MBUF_INIT(0); /* * Prepare context and emit headers. */ init_store_context(aTHX_ cxt, f, optype, network_order); if (-1 == magic_write(aTHX_ cxt)) /* Emit magic and ILP info */ return 0; /* Error */ /* * Recursively store object... */ ASSERT(is_storing(aTHX), ("within store operation")); status = store(aTHX_ cxt, sv); /* Just do it! */ /* * If they asked for a memory store and they provided an SV pointer, * make an SV string out of the buffer and fill their pointer. * * When asking for ST_REAL, it's MANDATORY for the caller to provide * an SV, since context cleanup might free the buffer if we did recurse. * (unless caller is dclone(), which is aware of that). */ if (!cxt->fio && res) *res = mbuf2sv(aTHX); TRACEME(("do_store returns %d", status)); /* * Final cleanup. * * The "root" context is never freed, since it is meant to be always * handy for the common case where no recursion occurs at all (i.e. * we enter store() outside of any Storable code and leave it, period). * We know it's the "root" context because there's nothing stacked * underneath it. * * OPTIMIZATION: * * When deep cloning, we don't free the context: doing so would force * us to copy the data in the memory buffer. Sicne we know we're * about to enter do_retrieve... */ clean_store_context(aTHX_ cxt); if (cxt->prev && !(cxt->optype & ST_CLONE)) free_context(aTHX_ cxt); return status == 0; } /*** *** Memory stores. ***/ /* * mbuf2sv * * Build a new SV out of the content of the internal memory buffer. */ static SV *mbuf2sv(pTHX) { dSTCXT; assert(cxt); return newSVpv(mbase, MBUF_SIZE()); } /*** *** Specific retrieve callbacks. ***/ /* * retrieve_other * * Return an error via croak, since it is not possible that we get here * under normal conditions, when facing a file produced via pstore(). */ static SV *retrieve_other(pTHX_ stcxt_t *cxt, const char *cname) { PERL_UNUSED_ARG(cname); if ( cxt->ver_major != STORABLE_BIN_MAJOR && cxt->ver_minor != STORABLE_BIN_MINOR ) { CROAK(("Corrupted storable %s (binary v%d.%d), current is v%d.%d", cxt->fio ? "file" : "string", cxt->ver_major, cxt->ver_minor, STORABLE_BIN_MAJOR, STORABLE_BIN_MINOR)); } else { CROAK(("Corrupted storable %s (binary v%d.%d)", cxt->fio ? "file" : "string", cxt->ver_major, cxt->ver_minor)); } return (SV *) 0; /* Just in case */ } /* * retrieve_idx_blessed * * Layout is SX_IX_BLESS <index> <object> with SX_IX_BLESS already read. * <index> can be coded on either 1 or 5 bytes. */ static SV *retrieve_idx_blessed(pTHX_ stcxt_t *cxt, const char *cname) { I32 idx; const char *classname; SV **sva; SV *sv; PERL_UNUSED_ARG(cname); TRACEME(("retrieve_idx_blessed (#%d)", (int)cxt->tagnum)); ASSERT(!cname, ("no bless-into class given here, got %s", cname)); GETMARK(idx); /* Index coded on a single char? */ if (idx & 0x80) RLEN(idx); /* * Fetch classname in 'aclass' */ sva = av_fetch(cxt->aclass, idx, FALSE); if (!sva) CROAK(("Class name #%" IVdf " should have been seen already", (IV) idx)); classname = SvPVX(*sva); /* We know it's a PV, by construction */ TRACEME(("class ID %d => %s", (int)idx, classname)); /* * Retrieve object and bless it. */ sv = retrieve(aTHX_ cxt, classname); /* First SV which is SEEN will be blessed */ return sv; } /* * retrieve_blessed * * Layout is SX_BLESS <len> <classname> <object> with SX_BLESS already read. * <len> can be coded on either 1 or 5 bytes. */ static SV *retrieve_blessed(pTHX_ stcxt_t *cxt, const char *cname) { U32 len; SV *sv; char buf[LG_BLESS + 1]; /* Avoid malloc() if possible */ char *classname = buf; char *malloced_classname = NULL; PERL_UNUSED_ARG(cname); TRACEME(("retrieve_blessed (#%d)", (int)cxt->tagnum)); ASSERT(!cname, ("no bless-into class given here, got %s", cname)); /* * Decode class name length and read that name. * * Short classnames have two advantages: their length is stored on one * single byte, and the string can be read on the stack. */ GETMARK(len); /* Length coded on a single char? */ if (len & 0x80) { RLEN(len); TRACEME(("** allocating %ld bytes for class name", (long)len+1)); if (len > I32_MAX) CROAK(("Corrupted classname length %lu", (long)len)); PL_nomemok = TRUE; /* handle error by ourselves */ New(10003, classname, len+1, char); PL_nomemok = FALSE; if (!classname) CROAK(("Out of memory with len %ld", (long)len)); PL_nomemok = FALSE; malloced_classname = classname; } SAFEPVREAD(classname, (I32)len, malloced_classname); classname[len] = '\0'; /* Mark string end */ /* * It's a new classname, otherwise it would have been an SX_IX_BLESS. */ TRACEME(("new class name \"%s\" will bear ID = %d", classname, (int)cxt->classnum)); if (!av_store(cxt->aclass, cxt->classnum++, newSVpvn(classname, len))) { Safefree(malloced_classname); return (SV *) 0; } /* * Retrieve object and bless it. */ sv = retrieve(aTHX_ cxt, classname); /* First SV which is SEEN will be blessed */ if (malloced_classname) Safefree(malloced_classname); return sv; } /* * retrieve_hook * * Layout: SX_HOOK <flags> <len> <classname> <len2> <str> [<len3> <object-IDs>] * with leading mark already read, as usual. * * When recursion was involved during serialization of the object, there * is an unknown amount of serialized objects after the SX_HOOK mark. Until * we reach a <flags> marker with the recursion bit cleared. * * If the first <flags> byte contains a type of SHT_EXTRA, then the real type * is held in the <extra> byte, and if the object is tied, the serialized * magic object comes at the very end: * * SX_HOOK <flags> <extra> ... [<len3> <object-IDs>] <magic object> * * This means the STORABLE_thaw hook will NOT get a tied variable during its * processing (since we won't have seen the magic object by the time the hook * is called). See comments below for why it was done that way. */ static SV *retrieve_hook_common(pTHX_ stcxt_t *cxt, const char *cname, int large) { U32 len; char buf[LG_BLESS + 1]; /* Avoid malloc() if possible */ char *classname = buf; unsigned int flags; STRLEN len2; SV *frozen; I32 len3 = 0; AV *av = 0; SV *hook; SV *sv; SV *rv; GV *attach; HV *stash; int obj_type; int clone = cxt->optype & ST_CLONE; char mtype = '\0'; unsigned int extra_type = 0; #ifdef HAS_U64 int has_large_oids = 0; #endif PERL_UNUSED_ARG(cname); TRACEME(("retrieve_hook (#%d)", (int)cxt->tagnum)); ASSERT(!cname, ("no bless-into class given here, got %s", cname)); #ifndef HAS_U64 assert(!large); PERL_UNUSED_ARG(large); #endif /* * Read flags, which tell us about the type, and whether we need * to recurse. */ GETMARK(flags); /* * Create the (empty) object, and mark it as seen. * * This must be done now, because tags are incremented, and during * serialization, the object tag was affected before recursion could * take place. */ obj_type = flags & SHF_TYPE_MASK; switch (obj_type) { case SHT_SCALAR: sv = newSV(0); break; case SHT_ARRAY: sv = (SV *) newAV(); break; case SHT_HASH: sv = (SV *) newHV(); break; case SHT_EXTRA: /* * Read <extra> flag to know the type of the object. * Record associated magic type for later. */ GETMARK(extra_type); switch (extra_type) { case SHT_TSCALAR: sv = newSV(0); mtype = 'q'; break; case SHT_TARRAY: sv = (SV *) newAV(); mtype = 'P'; break; case SHT_THASH: sv = (SV *) newHV(); mtype = 'P'; break; default: return retrieve_other(aTHX_ cxt, 0);/* Let it croak */ } break; default: return retrieve_other(aTHX_ cxt, 0); /* Let it croak */ } SEEN0_NN(sv, 0); /* Don't bless yet */ /* * Whilst flags tell us to recurse, do so. * * We don't need to remember the addresses returned by retrieval, because * all the references will be obtained through indirection via the object * tags in the object-ID list. * * We need to decrement the reference count for these objects * because, if the user doesn't save a reference to them in the hook, * they must be freed when this context is cleaned. */ while (flags & SHF_NEED_RECURSE) { TRACEME(("retrieve_hook recursing...")); rv = retrieve(aTHX_ cxt, 0); if (!rv) return (SV *) 0; SvREFCNT_dec(rv); TRACEME(("retrieve_hook back with rv=0x%" UVxf, PTR2UV(rv))); GETMARK(flags); } if (flags & SHF_IDX_CLASSNAME) { SV **sva; I32 idx; /* * Fetch index from 'aclass' */ if (flags & SHF_LARGE_CLASSLEN) RLEN(idx); else GETMARK(idx); sva = av_fetch(cxt->aclass, idx, FALSE); if (!sva) CROAK(("Class name #%" IVdf " should have been seen already", (IV) idx)); classname = SvPVX(*sva); /* We know it's a PV, by construction */ TRACEME(("class ID %d => %s", (int)idx, classname)); } else { /* * Decode class name length and read that name. * * NOTA BENE: even if the length is stored on one byte, we don't read * on the stack. Just like retrieve_blessed(), we limit the name to * LG_BLESS bytes. This is an arbitrary decision. */ char *malloced_classname = NULL; if (flags & SHF_LARGE_CLASSLEN) RLEN(len); else GETMARK(len); TRACEME(("** allocating %ld bytes for class name", (long)len+1)); if (len > I32_MAX) /* security */ CROAK(("Corrupted classname length %lu", (long)len)); else if (len > LG_BLESS) { /* security: signed len */ PL_nomemok = TRUE; /* handle error by ourselves */ New(10003, classname, len+1, char); PL_nomemok = FALSE; if (!classname) CROAK(("Out of memory with len %u", (unsigned)len+1)); malloced_classname = classname; } SAFEPVREAD(classname, (I32)len, malloced_classname); classname[len] = '\0'; /* Mark string end */ /* * Record new classname. */ if (!av_store(cxt->aclass, cxt->classnum++, newSVpvn(classname, len))) { Safefree(malloced_classname); return (SV *) 0; } } TRACEME(("class name: %s", classname)); /* * Decode user-frozen string length and read it in an SV. * * For efficiency reasons, we read data directly into the SV buffer. * To understand that code, read retrieve_scalar() */ #ifdef HAS_U64 if (large) { READ_U64(len2); } else #endif if (flags & SHF_LARGE_STRLEN) { U32 len32; RLEN(len32); len2 = len32; } else GETMARK(len2); frozen = NEWSV(10002, len2 ? len2 : 1); if (len2) { SAFEREAD(SvPVX(frozen), len2, frozen); } SvCUR_set(frozen, len2); *SvEND(frozen) = '\0'; (void) SvPOK_only(frozen); /* Validates string pointer */ if (cxt->s_tainted) /* Is input source tainted? */ SvTAINT(frozen); TRACEME(("frozen string: %d bytes", (int)len2)); /* * Decode object-ID list length, if present. */ if (flags & SHF_HAS_LIST) { if (flags & SHF_LARGE_LISTLEN) { RLEN(len3); if (len3 < 0) { #ifdef HAS_U64 ++has_large_oids; len3 = -len3; #else CROAK(("Large object ids in hook data not supported on 32-bit platforms")); #endif } } else GETMARK(len3); if (len3) { av = newAV(); av_extend(av, len3 + 1); /* Leave room for [0] */ AvFILLp(av) = len3; /* About to be filled anyway */ } } TRACEME(("has %d object IDs to link", (int)len3)); /* * Read object-ID list into array. * Because we pre-extended it, we can cheat and fill it manually. * * We read object tags and we can convert them into SV* on the fly * because we know all the references listed in there (as tags) * have been already serialized, hence we have a valid correspondence * between each of those tags and the recreated SV. */ if (av) { SV **ary = AvARRAY(av); int i; for (i = 1; i <= len3; i++) { /* We leave [0] alone */ ntag_t tag; SV **svh; SV *xsv; #ifdef HAS_U64 if (has_large_oids) { READ_U64(tag); } else { U32 tmp; READ_I32(tmp); tag = ntohl(tmp); } #else READ_I32(tag); tag = ntohl(tag); #endif svh = av_fetch(cxt->aseen, tag, FALSE); if (!svh) { if (tag == cxt->where_is_undef) { /* av_fetch uses PL_sv_undef internally, hence this somewhat gruesome hack. */ xsv = &PL_sv_undef; svh = &xsv; } else { CROAK(("Object #%" IVdf " should have been retrieved already", (IV) tag)); } } xsv = *svh; ary[i] = SvREFCNT_inc(xsv); } } /* * Look up the STORABLE_attach hook * If blessing is disabled, just return what we've got. */ if (!(cxt->flags & FLAG_BLESS_OK)) { TRACEME(("skipping bless because flags is %d", cxt->flags)); return sv; } /* * Bless the object and look up the STORABLE_thaw hook. */ stash = gv_stashpv(classname, GV_ADD); /* Handle attach case; again can't use pkg_can because it only * caches one method */ attach = gv_fetchmethod_autoload(stash, "STORABLE_attach", FALSE); if (attach && isGV(attach)) { SV* attached; SV* attach_hook = newRV_inc((SV*) GvCV(attach)); if (av) CROAK(("STORABLE_attach called with unexpected references")); av = newAV(); av_extend(av, 1); AvFILLp(av) = 0; AvARRAY(av)[0] = SvREFCNT_inc(frozen); rv = newSVpv(classname, 0); attached = scalar_call(aTHX_ rv, attach_hook, clone, av, G_SCALAR); /* Free memory after a call */ SvREFCNT_dec(rv); SvREFCNT_dec(frozen); av_undef(av); sv_free((SV *) av); SvREFCNT_dec(attach_hook); if (attached && SvROK(attached) && sv_derived_from(attached, classname) ) { UNSEE(); /* refcnt of unneeded sv is 2 at this point (one from newHV, second from SEEN call) */ SvREFCNT_dec(sv); SvREFCNT_dec(sv); /* we need to free RV but preserve value that RV point to */ sv = SvRV(attached); SEEN0_NN(sv, 0); SvRV_set(attached, NULL); SvREFCNT_dec(attached); if (!(flags & SHF_IDX_CLASSNAME) && classname != buf) Safefree(classname); return sv; } CROAK(("STORABLE_attach did not return a %s object", classname)); } /* * Bless the object and look up the STORABLE_thaw hook. */ BLESS(sv, stash); hook = pkg_can(aTHX_ cxt->hook, stash, "STORABLE_thaw"); if (!hook) { /* * Hook not found. Maybe they did not require the module where this * hook is defined yet? * * If the load below succeeds, we'll be able to find the hook. * Still, it only works reliably when each class is defined in a * file of its own. */ TRACEME(("No STORABLE_thaw defined for objects of class %s", classname)); TRACEME(("Going to load module '%s'", classname)); load_module(PERL_LOADMOD_NOIMPORT, newSVpv(classname, 0), Nullsv); /* * We cache results of pkg_can, so we need to uncache before attempting * the lookup again. */ pkg_uncache(aTHX_ cxt->hook, SvSTASH(sv), "STORABLE_thaw"); hook = pkg_can(aTHX_ cxt->hook, SvSTASH(sv), "STORABLE_thaw"); if (!hook) CROAK(("No STORABLE_thaw defined for objects of class %s " "(even after a \"require %s;\")", classname, classname)); } /* * If we don't have an 'av' yet, prepare one. * Then insert the frozen string as item [0]. */ if (!av) { av = newAV(); av_extend(av, 1); AvFILLp(av) = 0; } AvARRAY(av)[0] = SvREFCNT_inc(frozen); /* * Call the hook as: * * $object->STORABLE_thaw($cloning, $frozen, @refs); * * where $object is our blessed (empty) object, $cloning is a boolean * telling whether we're running a deep clone, $frozen is the frozen * string the user gave us in his serializing hook, and @refs, which may * be empty, is the list of extra references he returned along for us * to serialize. * * In effect, the hook is an alternate creation routine for the class, * the object itself being already created by the runtime. */ TRACEME(("calling STORABLE_thaw on %s at 0x%" UVxf " (%" IVdf " args)", classname, PTR2UV(sv), (IV) AvFILLp(av) + 1)); rv = newRV_inc(sv); (void) scalar_call(aTHX_ rv, hook, clone, av, G_SCALAR|G_DISCARD); SvREFCNT_dec(rv); /* * Final cleanup. */ SvREFCNT_dec(frozen); av_undef(av); sv_free((SV *) av); if (!(flags & SHF_IDX_CLASSNAME) && classname != buf) Safefree(classname); /* * If we had an <extra> type, then the object was not as simple, and * we need to restore extra magic now. */ if (!extra_type) return sv; TRACEME(("retrieving magic object for 0x%" UVxf "...", PTR2UV(sv))); rv = retrieve(aTHX_ cxt, 0); /* Retrieve <magic object> */ TRACEME(("restoring the magic object 0x%" UVxf " part of 0x%" UVxf, PTR2UV(rv), PTR2UV(sv))); switch (extra_type) { case SHT_TSCALAR: sv_upgrade(sv, SVt_PVMG); break; case SHT_TARRAY: sv_upgrade(sv, SVt_PVAV); AvREAL_off((AV *)sv); break; case SHT_THASH: sv_upgrade(sv, SVt_PVHV); break; default: CROAK(("Forgot to deal with extra type %d", extra_type)); break; } /* * Adding the magic only now, well after the STORABLE_thaw hook was called * means the hook cannot know it deals with an object whose variable is * tied. But this is happening when retrieving $o in the following case: * * my %h; * tie %h, 'FOO'; * my $o = bless \%h, 'BAR'; * * The 'BAR' class is NOT the one where %h is tied into. Therefore, as * far as the 'BAR' class is concerned, the fact that %h is not a REAL * hash but a tied one should not matter at all, and remain transparent. * This means the magic must be restored by Storable AFTER the hook is * called. * * That looks very reasonable to me, but then I've come up with this * after a bug report from David Nesting, who was trying to store such * an object and caused Storable to fail. And unfortunately, it was * also the easiest way to retrofit support for blessed ref to tied objects * into the existing design. -- RAM, 17/02/2001 */ sv_magic(sv, rv, mtype, (char *)NULL, 0); SvREFCNT_dec(rv); /* Undo refcnt inc from sv_magic() */ return sv; } static SV *retrieve_hook(pTHX_ stcxt_t *cxt, const char *cname) { return retrieve_hook_common(aTHX_ cxt, cname, FALSE); } /* * retrieve_ref * * Retrieve reference to some other scalar. * Layout is SX_REF <object>, with SX_REF already read. */ static SV *retrieve_ref(pTHX_ stcxt_t *cxt, const char *cname) { SV *rv; SV *sv; HV *stash; TRACEME(("retrieve_ref (#%d)", (int)cxt->tagnum)); /* * We need to create the SV that holds the reference to the yet-to-retrieve * object now, so that we may record the address in the seen table. * Otherwise, if the object to retrieve references us, we won't be able * to resolve the SX_OBJECT we'll see at that point! Hence we cannot * do the retrieve first and use rv = newRV(sv) since it will be too late * for SEEN() recording. */ rv = NEWSV(10002, 0); if (cname) stash = gv_stashpv(cname, GV_ADD); else stash = 0; SEEN_NN(rv, stash, 0); /* Will return if rv is null */ sv = retrieve(aTHX_ cxt, 0);/* Retrieve <object> */ if (!sv) return (SV *) 0; /* Failed */ /* * WARNING: breaks RV encapsulation. * * Now for the tricky part. We have to upgrade our existing SV, so that * it is now an RV on sv... Again, we cheat by duplicating the code * held in newSVrv(), since we already got our SV from retrieve(). * * We don't say: * * SvRV(rv) = SvREFCNT_inc(sv); * * here because the reference count we got from retrieve() above is * already correct: if the object was retrieved from the file, then * its reference count is one. Otherwise, if it was retrieved via * an SX_OBJECT indication, a ref count increment was done. */ if (cname) { /* No need to do anything, as rv will already be PVMG. */ assert (SvTYPE(rv) == SVt_RV || SvTYPE(rv) >= SVt_PV); } else { sv_upgrade(rv, SVt_RV); } SvRV_set(rv, sv); /* $rv = \$sv */ SvROK_on(rv); /*if (cxt->entry && ++cxt->ref_cnt > MAX_REF_CNT) { CROAK(("Max. recursion depth with nested refs exceeded")); }*/ TRACEME(("ok (retrieve_ref at 0x%" UVxf ")", PTR2UV(rv))); return rv; } /* * retrieve_weakref * * Retrieve weak reference to some other scalar. * Layout is SX_WEAKREF <object>, with SX_WEAKREF already read. */ static SV *retrieve_weakref(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv; TRACEME(("retrieve_weakref (#%d)", (int)cxt->tagnum)); sv = retrieve_ref(aTHX_ cxt, cname); if (sv) { #ifdef SvWEAKREF sv_rvweaken(sv); #else WEAKREF_CROAK(); #endif } return sv; } /* * retrieve_overloaded * * Retrieve reference to some other scalar with overloading. * Layout is SX_OVERLOAD <object>, with SX_OVERLOAD already read. */ static SV *retrieve_overloaded(pTHX_ stcxt_t *cxt, const char *cname) { SV *rv; SV *sv; HV *stash; TRACEME(("retrieve_overloaded (#%d)", (int)cxt->tagnum)); /* * Same code as retrieve_ref(), duplicated to avoid extra call. */ rv = NEWSV(10002, 0); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(rv, stash, 0); /* Will return if rv is null */ cxt->in_retrieve_overloaded = 1; /* so sv_bless doesn't call S_reset_amagic */ sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */ cxt->in_retrieve_overloaded = 0; if (!sv) return (SV *) 0; /* Failed */ /* * WARNING: breaks RV encapsulation. */ SvUPGRADE(rv, SVt_RV); SvRV_set(rv, sv); /* $rv = \$sv */ SvROK_on(rv); /* * Restore overloading magic. */ stash = SvTYPE(sv) ? (HV *) SvSTASH (sv) : 0; if (!stash) { CROAK(("Cannot restore overloading on %s(0x%" UVxf ") (package <unknown>)", sv_reftype(sv, FALSE), PTR2UV(sv))); } if (!Gv_AMG(stash)) { const char *package = HvNAME_get(stash); TRACEME(("No overloading defined for package %s", package)); TRACEME(("Going to load module '%s'", package)); load_module(PERL_LOADMOD_NOIMPORT, newSVpv(package, 0), Nullsv); if (!Gv_AMG(stash)) { CROAK(("Cannot restore overloading on %s(0x%" UVxf ") (package %s) (even after a \"require %s;\")", sv_reftype(sv, FALSE), PTR2UV(sv), package, package)); } } SvAMAGIC_on(rv); TRACEME(("ok (retrieve_overloaded at 0x%" UVxf ")", PTR2UV(rv))); return rv; } /* * retrieve_weakoverloaded * * Retrieve weak overloaded reference to some other scalar. * Layout is SX_WEAKOVERLOADED <object>, with SX_WEAKOVERLOADED already read. */ static SV *retrieve_weakoverloaded(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv; TRACEME(("retrieve_weakoverloaded (#%d)", (int)cxt->tagnum)); sv = retrieve_overloaded(aTHX_ cxt, cname); if (sv) { #ifdef SvWEAKREF sv_rvweaken(sv); #else WEAKREF_CROAK(); #endif } return sv; } /* * retrieve_tied_array * * Retrieve tied array * Layout is SX_TIED_ARRAY <object>, with SX_TIED_ARRAY already read. */ static SV *retrieve_tied_array(pTHX_ stcxt_t *cxt, const char *cname) { SV *tv; SV *sv; HV *stash; TRACEME(("retrieve_tied_array (#%d)", (int)cxt->tagnum)); if (!(cxt->flags & FLAG_TIE_OK)) { CROAK(("Tying is disabled.")); } tv = NEWSV(10002, 0); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(tv, stash, 0); /* Will return if tv is null */ sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */ if (!sv) return (SV *) 0; /* Failed */ sv_upgrade(tv, SVt_PVAV); sv_magic(tv, sv, 'P', (char *)NULL, 0); SvREFCNT_dec(sv); /* Undo refcnt inc from sv_magic() */ TRACEME(("ok (retrieve_tied_array at 0x%" UVxf ")", PTR2UV(tv))); return tv; } /* * retrieve_tied_hash * * Retrieve tied hash * Layout is SX_TIED_HASH <object>, with SX_TIED_HASH already read. */ static SV *retrieve_tied_hash(pTHX_ stcxt_t *cxt, const char *cname) { SV *tv; SV *sv; HV *stash; TRACEME(("retrieve_tied_hash (#%d)", (int)cxt->tagnum)); if (!(cxt->flags & FLAG_TIE_OK)) { CROAK(("Tying is disabled.")); } tv = NEWSV(10002, 0); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(tv, stash, 0); /* Will return if tv is null */ sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */ if (!sv) return (SV *) 0; /* Failed */ sv_upgrade(tv, SVt_PVHV); sv_magic(tv, sv, 'P', (char *)NULL, 0); SvREFCNT_dec(sv); /* Undo refcnt inc from sv_magic() */ TRACEME(("ok (retrieve_tied_hash at 0x%" UVxf ")", PTR2UV(tv))); return tv; } /* * retrieve_tied_scalar * * Retrieve tied scalar * Layout is SX_TIED_SCALAR <object>, with SX_TIED_SCALAR already read. */ static SV *retrieve_tied_scalar(pTHX_ stcxt_t *cxt, const char *cname) { SV *tv; SV *sv, *obj = NULL; HV *stash; TRACEME(("retrieve_tied_scalar (#%d)", (int)cxt->tagnum)); if (!(cxt->flags & FLAG_TIE_OK)) { CROAK(("Tying is disabled.")); } tv = NEWSV(10002, 0); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(tv, stash, 0); /* Will return if rv is null */ sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */ if (!sv) { return (SV *) 0; /* Failed */ } else if (SvTYPE(sv) != SVt_NULL) { obj = sv; } sv_upgrade(tv, SVt_PVMG); sv_magic(tv, obj, 'q', (char *)NULL, 0); if (obj) { /* Undo refcnt inc from sv_magic() */ SvREFCNT_dec(obj); } TRACEME(("ok (retrieve_tied_scalar at 0x%" UVxf ")", PTR2UV(tv))); return tv; } /* * retrieve_tied_key * * Retrieve reference to value in a tied hash. * Layout is SX_TIED_KEY <object> <key>, with SX_TIED_KEY already read. */ static SV *retrieve_tied_key(pTHX_ stcxt_t *cxt, const char *cname) { SV *tv; SV *sv; SV *key; HV *stash; TRACEME(("retrieve_tied_key (#%d)", (int)cxt->tagnum)); if (!(cxt->flags & FLAG_TIE_OK)) { CROAK(("Tying is disabled.")); } tv = NEWSV(10002, 0); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(tv, stash, 0); /* Will return if tv is null */ sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */ if (!sv) return (SV *) 0; /* Failed */ key = retrieve(aTHX_ cxt, 0); /* Retrieve <key> */ if (!key) return (SV *) 0; /* Failed */ sv_upgrade(tv, SVt_PVMG); sv_magic(tv, sv, 'p', (char *)key, HEf_SVKEY); SvREFCNT_dec(key); /* Undo refcnt inc from sv_magic() */ SvREFCNT_dec(sv); /* Undo refcnt inc from sv_magic() */ return tv; } /* * retrieve_tied_idx * * Retrieve reference to value in a tied array. * Layout is SX_TIED_IDX <object> <idx>, with SX_TIED_IDX already read. */ static SV *retrieve_tied_idx(pTHX_ stcxt_t *cxt, const char *cname) { SV *tv; SV *sv; HV *stash; I32 idx; TRACEME(("retrieve_tied_idx (#%d)", (int)cxt->tagnum)); if (!(cxt->flags & FLAG_TIE_OK)) { CROAK(("Tying is disabled.")); } tv = NEWSV(10002, 0); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(tv, stash, 0); /* Will return if tv is null */ sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */ if (!sv) return (SV *) 0; /* Failed */ RLEN(idx); /* Retrieve <idx> */ sv_upgrade(tv, SVt_PVMG); sv_magic(tv, sv, 'p', (char *)NULL, idx); SvREFCNT_dec(sv); /* Undo refcnt inc from sv_magic() */ return tv; } /* * get_lstring * * Helper to read a string */ static SV *get_lstring(pTHX_ stcxt_t *cxt, UV len, int isutf8, const char *cname) { SV *sv; HV *stash; TRACEME(("get_lstring (#%d), len = %" UVuf, (int)cxt->tagnum, len)); /* * Allocate an empty scalar of the suitable length. */ sv = NEWSV(10002, len); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 0); /* Associate this new scalar with tag "tagnum" */ if (len == 0) { SvPVCLEAR(sv); return sv; } /* * WARNING: duplicates parts of sv_setpv and breaks SV data encapsulation. * * Now, for efficiency reasons, read data directly inside the SV buffer, * and perform the SV final settings directly by duplicating the final * work done by sv_setpv. Since we're going to allocate lots of scalars * this way, it's worth the hassle and risk. */ SAFEREAD(SvPVX(sv), len, sv); SvCUR_set(sv, len); /* Record C string length */ *SvEND(sv) = '\0'; /* Ensure it's null terminated anyway */ (void) SvPOK_only(sv); /* Validate string pointer */ if (cxt->s_tainted) /* Is input source tainted? */ SvTAINT(sv); /* External data cannot be trusted */ /* Check for CVE-215-1592 */ if (cname && len == 13 && strEQc(cname, "CGITempFile") && strEQc(SvPVX(sv), "mt-config.cgi")) { #if defined(USE_CPERL) && defined(WARN_SECURITY) Perl_warn_security(aTHX_ "Movable-Type CVE-2015-1592 Storable metasploit attack"); #else Perl_warn(aTHX_ "SECURITY: Movable-Type CVE-2015-1592 Storable metasploit attack"); #endif } if (isutf8) { TRACEME(("large utf8 string len %" UVuf " '%s'", len, len >= 2048 ? "<string too long>" : SvPVX(sv))); #ifdef HAS_UTF8_SCALARS SvUTF8_on(sv); #else if (cxt->use_bytes < 0) cxt->use_bytes = (SvTRUE(get_sv("Storable::drop_utf8", GV_ADD)) ? 1 : 0); if (cxt->use_bytes == 0) UTF8_CROAK(); #endif } else { TRACEME(("large string len %" UVuf " '%s'", len, len >= 2048 ? "<string too long>" : SvPVX(sv))); } TRACEME(("ok (get_lstring at 0x%" UVxf ")", PTR2UV(sv))); return sv; } /* * retrieve_lscalar * * Retrieve defined long (string) scalar. * * Layout is SX_LSCALAR <length> <data>, with SX_LSCALAR already read. * The scalar is "long" in that <length> is larger than LG_SCALAR so it * was not stored on a single byte, but in 4 bytes. For strings longer than * 4 byte (>2GB) see retrieve_lobject. */ static SV *retrieve_lscalar(pTHX_ stcxt_t *cxt, const char *cname) { U32 len; RLEN(len); return get_lstring(aTHX_ cxt, len, 0, cname); } /* * retrieve_scalar * * Retrieve defined short (string) scalar. * * Layout is SX_SCALAR <length> <data>, with SX_SCALAR already read. * The scalar is "short" so <length> is single byte. If it is 0, there * is no <data> section. */ static SV *retrieve_scalar(pTHX_ stcxt_t *cxt, const char *cname) { int len; /*SV *sv; HV *stash;*/ GETMARK(len); TRACEME(("retrieve_scalar (#%d), len = %d", (int)cxt->tagnum, len)); return get_lstring(aTHX_ cxt, (UV)len, 0, cname); } /* * retrieve_utf8str * * Like retrieve_scalar(), but tag result as utf8. * If we're retrieving UTF8 data in a non-UTF8 perl, croaks. */ static SV *retrieve_utf8str(pTHX_ stcxt_t *cxt, const char *cname) { int len; /*SV *sv;*/ TRACEME(("retrieve_utf8str")); GETMARK(len); return get_lstring(aTHX_ cxt, (UV)len, 1, cname); } /* * retrieve_lutf8str * * Like retrieve_lscalar(), but tag result as utf8. * If we're retrieving UTF8 data in a non-UTF8 perl, croaks. */ static SV *retrieve_lutf8str(pTHX_ stcxt_t *cxt, const char *cname) { U32 len; TRACEME(("retrieve_lutf8str")); RLEN(len); return get_lstring(aTHX_ cxt, (UV)len, 1, cname); } /* * retrieve_vstring * * Retrieve a vstring, and then retrieve the stringy scalar following it, * attaching the vstring to the scalar via magic. * If we're retrieving a vstring in a perl without vstring magic, croaks. * * The vstring layout mirrors an SX_SCALAR string: * SX_VSTRING <length> <data> with SX_VSTRING already read. */ static SV *retrieve_vstring(pTHX_ stcxt_t *cxt, const char *cname) { #ifdef SvVOK char s[256]; int len; SV *sv; GETMARK(len); TRACEME(("retrieve_vstring (#%d), len = %d", (int)cxt->tagnum, len)); READ(s, len); sv = retrieve(aTHX_ cxt, cname); if (!sv) return (SV *) 0; /* Failed */ sv_magic(sv,NULL,PERL_MAGIC_vstring,s,len); /* 5.10.0 and earlier seem to need this */ SvRMAGICAL_on(sv); TRACEME(("ok (retrieve_vstring at 0x%" UVxf ")", PTR2UV(sv))); return sv; #else VSTRING_CROAK(); return Nullsv; #endif } /* * retrieve_lvstring * * Like retrieve_vstring, but for longer vstrings. */ static SV *retrieve_lvstring(pTHX_ stcxt_t *cxt, const char *cname) { #ifdef SvVOK char *s; U32 len; SV *sv; RLEN(len); TRACEME(("retrieve_lvstring (#%d), len = %" UVuf, (int)cxt->tagnum, (UV)len)); /* Since we'll no longer produce such large vstrings, reject them here too. */ if (len >= I32_MAX) { CROAK(("vstring too large to fetch")); } New(10003, s, len+1, char); SAFEPVREAD(s, (I32)len, s); sv = retrieve(aTHX_ cxt, cname); if (!sv) { Safefree(s); return (SV *) 0; /* Failed */ } sv_magic(sv,NULL,PERL_MAGIC_vstring,s,len); /* 5.10.0 and earlier seem to need this */ SvRMAGICAL_on(sv); Safefree(s); TRACEME(("ok (retrieve_lvstring at 0x%" UVxf ")", PTR2UV(sv))); return sv; #else VSTRING_CROAK(); return Nullsv; #endif } /* * retrieve_integer * * Retrieve defined integer. * Layout is SX_INTEGER <data>, whith SX_INTEGER already read. */ static SV *retrieve_integer(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv; HV *stash; IV iv; TRACEME(("retrieve_integer (#%d)", (int)cxt->tagnum)); READ(&iv, sizeof(iv)); sv = newSViv(iv); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 0); /* Associate this new scalar with tag "tagnum" */ TRACEME(("integer %" IVdf, iv)); TRACEME(("ok (retrieve_integer at 0x%" UVxf ")", PTR2UV(sv))); return sv; } /* * retrieve_lobject * * Retrieve overlong scalar, array or hash. * Layout is SX_LOBJECT type U64_len ... */ static SV *retrieve_lobject(pTHX_ stcxt_t *cxt, const char *cname) { int type; #ifdef HAS_U64 UV len; SV *sv; int hash_flags = 0; #endif TRACEME(("retrieve_lobject (#%d)", (int)cxt->tagnum)); GETMARK(type); TRACEME(("object type %d", type)); #ifdef HAS_U64 if (type == SX_FLAG_HASH) { /* we write the flags immediately after the op. I could have changed the writer, but this may allow someone to recover data they're already frozen, though such a very large hash seems unlikely. */ GETMARK(hash_flags); } else if (type == SX_HOOK) { return retrieve_hook_common(aTHX_ cxt, cname, TRUE); } READ_U64(len); TRACEME(("wlen %" UVuf, len)); switch (type) { case SX_OBJECT: { /* not a large object, just a large index */ SV **svh = av_fetch(cxt->aseen, len, FALSE); if (!svh) CROAK(("Object #%" UVuf " should have been retrieved already", len)); sv = *svh; TRACEME(("had retrieved #%" UVuf " at 0x%" UVxf, len, PTR2UV(sv))); SvREFCNT_inc(sv); } break; case SX_LSCALAR: sv = get_lstring(aTHX_ cxt, len, 0, cname); break; case SX_LUTF8STR: sv = get_lstring(aTHX_ cxt, len, 1, cname); break; case SX_ARRAY: sv = get_larray(aTHX_ cxt, len, cname); break; /* <5.12 you could store larger hashes, but cannot iterate over them. So we reject them, it's a bug. */ case SX_FLAG_HASH: sv = get_lhash(aTHX_ cxt, len, hash_flags, cname); break; case SX_HASH: sv = get_lhash(aTHX_ cxt, len, 0, cname); break; default: CROAK(("Unexpected type %d in retrieve_lobject\n", type)); } TRACEME(("ok (retrieve_lobject at 0x%" UVxf ")", PTR2UV(sv))); return sv; #else PERL_UNUSED_ARG(cname); /* previously this (brokenly) checked the length value and only failed if the length was over 4G. Since this op should only occur with objects over 4GB (or 2GB) we can just reject it. */ CROAK(("Invalid large object op for this 32bit system")); #endif } /* * retrieve_netint * * Retrieve defined integer in network order. * Layout is SX_NETINT <data>, whith SX_NETINT already read. */ static SV *retrieve_netint(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv; HV *stash; I32 iv; TRACEME(("retrieve_netint (#%d)", (int)cxt->tagnum)); READ_I32(iv); #ifdef HAS_NTOHL sv = newSViv((int) ntohl(iv)); TRACEME(("network integer %d", (int) ntohl(iv))); #else sv = newSViv(iv); TRACEME(("network integer (as-is) %d", iv)); #endif stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 0); /* Associate this new scalar with tag "tagnum" */ TRACEME(("ok (retrieve_netint at 0x%" UVxf ")", PTR2UV(sv))); return sv; } /* * retrieve_double * * Retrieve defined double. * Layout is SX_DOUBLE <data>, whith SX_DOUBLE already read. */ static SV *retrieve_double(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv; HV *stash; NV nv; TRACEME(("retrieve_double (#%d)", (int)cxt->tagnum)); READ(&nv, sizeof(nv)); sv = newSVnv(nv); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 0); /* Associate this new scalar with tag "tagnum" */ TRACEME(("double %" NVff, nv)); TRACEME(("ok (retrieve_double at 0x%" UVxf ")", PTR2UV(sv))); return sv; } /* * retrieve_byte * * Retrieve defined byte (small integer within the [-128, +127] range). * Layout is SX_BYTE <data>, whith SX_BYTE already read. */ static SV *retrieve_byte(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv; HV *stash; int siv; #ifdef _MSC_VER /* MSVC 2017 doesn't handle the AIX workaround well */ int tmp; #else signed char tmp; /* Workaround for AIX cc bug --H.Merijn Brand */ #endif TRACEME(("retrieve_byte (#%d)", (int)cxt->tagnum)); GETMARK(siv); TRACEME(("small integer read as %d", (unsigned char) siv)); tmp = (unsigned char) siv - 128; sv = newSViv(tmp); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 0); /* Associate this new scalar with tag "tagnum" */ TRACEME(("byte %d", tmp)); TRACEME(("ok (retrieve_byte at 0x%" UVxf ")", PTR2UV(sv))); return sv; } /* * retrieve_undef * * Return the undefined value. */ static SV *retrieve_undef(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv; HV *stash; TRACEME(("retrieve_undef")); sv = newSV(0); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 0); return sv; } /* * retrieve_sv_undef * * Return the immortal undefined value. */ static SV *retrieve_sv_undef(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv = &PL_sv_undef; HV *stash; TRACEME(("retrieve_sv_undef")); /* Special case PL_sv_undef, as av_fetch uses it internally to mark deleted elements, and will return NULL (fetch failed) whenever it is fetched. */ if (cxt->where_is_undef == UNSET_NTAG_T) { cxt->where_is_undef = cxt->tagnum; } stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 1); return sv; } /* * retrieve_sv_yes * * Return the immortal yes value. */ static SV *retrieve_sv_yes(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv = &PL_sv_yes; HV *stash; TRACEME(("retrieve_sv_yes")); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 1); return sv; } /* * retrieve_sv_no * * Return the immortal no value. */ static SV *retrieve_sv_no(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv = &PL_sv_no; HV *stash; TRACEME(("retrieve_sv_no")); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 1); return sv; } /* * retrieve_svundef_elem * * Return &PL_sv_placeholder, representing &PL_sv_undef in an array. This * is a bit of a hack, but we already use SX_SV_UNDEF to mean a nonexistent * element, for historical reasons. */ static SV *retrieve_svundef_elem(pTHX_ stcxt_t *cxt, const char *cname) { TRACEME(("retrieve_svundef_elem")); /* SEEN reads the contents of its SV argument, which we are not supposed to do with &PL_sv_placeholder. */ SEEN_NN(&PL_sv_undef, cname, 1); return &PL_sv_placeholder; } /* * retrieve_array * * Retrieve a whole array. * Layout is SX_ARRAY <size> followed by each item, in increasing index order. * Each item is stored as <object>. * * When we come here, SX_ARRAY has been read already. */ static SV *retrieve_array(pTHX_ stcxt_t *cxt, const char *cname) { I32 len, i; AV *av; SV *sv; HV *stash; bool seen_null = FALSE; TRACEME(("retrieve_array (#%d)", (int)cxt->tagnum)); /* * Read length, and allocate array, then pre-extend it. */ RLEN(len); TRACEME(("size = %d", (int)len)); av = newAV(); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(av, stash, 0); /* Will return if array not allocated nicely */ if (len) av_extend(av, len); else return (SV *) av; /* No data follow if array is empty */ /* * Now get each item in turn... */ for (i = 0; i < len; i++) { TRACEME(("(#%d) item", (int)i)); sv = retrieve(aTHX_ cxt, 0); /* Retrieve item */ if (!sv) return (SV *) 0; if (sv == &PL_sv_undef) { seen_null = TRUE; continue; } if (sv == &PL_sv_placeholder) sv = &PL_sv_undef; if (av_store(av, i, sv) == 0) return (SV *) 0; } if (seen_null) av_fill(av, len-1); TRACEME(("ok (retrieve_array at 0x%" UVxf ")", PTR2UV(av))); return (SV *) av; } #ifdef HAS_U64 /* internal method with len already read */ static SV *get_larray(pTHX_ stcxt_t *cxt, UV len, const char *cname) { UV i; AV *av; SV *sv; HV *stash; bool seen_null = FALSE; TRACEME(("get_larray (#%d) %lu", (int)cxt->tagnum, (unsigned long)len)); /* * allocate array, then pre-extend it. */ av = newAV(); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(av, stash, 0); /* Will return if array not allocated nicely */ assert(len); av_extend(av, len); /* * Now get each item in turn... */ for (i = 0; i < len; i++) { TRACEME(("(#%d) item", (int)i)); sv = retrieve(aTHX_ cxt, 0); /* Retrieve item */ if (!sv) return (SV *) 0; if (sv == &PL_sv_undef) { seen_null = TRUE; continue; } if (sv == &PL_sv_placeholder) sv = &PL_sv_undef; if (av_store(av, i, sv) == 0) return (SV *) 0; } if (seen_null) av_fill(av, len-1); TRACEME(("ok (get_larray at 0x%" UVxf ")", PTR2UV(av))); return (SV *) av; } /* * get_lhash * * Retrieve a overlong hash table. * <len> is already read. What follows is each key/value pair, in random order. * Keys are stored as <length> <data>, the <data> section being omitted * if length is 0. * Values are stored as <object>. * */ static SV *get_lhash(pTHX_ stcxt_t *cxt, UV len, int hash_flags, const char *cname) { UV size; UV i; HV *hv; SV *sv; HV *stash; TRACEME(("get_lhash (#%d)", (int)cxt->tagnum)); #ifdef HAS_RESTRICTED_HASHES PERL_UNUSED_ARG(hash_flags); #else if (hash_flags & SHV_RESTRICTED) { if (cxt->derestrict < 0) cxt->derestrict = (SvTRUE (get_sv("Storable::downgrade_restricted", GV_ADD)) ? 1 : 0); if (cxt->derestrict == 0) RESTRICTED_HASH_CROAK(); } #endif TRACEME(("size = %lu", (unsigned long)len)); hv = newHV(); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(hv, stash, 0); /* Will return if table not allocated properly */ if (len == 0) return (SV *) hv; /* No data follow if table empty */ TRACEME(("split %lu", (unsigned long)len+1)); hv_ksplit(hv, len+1); /* pre-extend hash to save multiple splits */ /* * Now get each key/value pair in turn... */ for (i = 0; i < len; i++) { /* * Get value first. */ TRACEME(("(#%d) value", (int)i)); sv = retrieve(aTHX_ cxt, 0); if (!sv) return (SV *) 0; /* * Get key. * Since we're reading into kbuf, we must ensure we're not * recursing between the read and the hv_store() where it's used. * Hence the key comes after the value. */ RLEN(size); /* Get key size */ KBUFCHK((STRLEN)size); /* Grow hash key read pool if needed */ if (size) READ(kbuf, size); kbuf[size] = '\0'; /* Mark string end, just in case */ TRACEME(("(#%d) key '%s'", (int)i, kbuf)); /* * Enter key/value pair into hash table. */ if (hv_store(hv, kbuf, (U32) size, sv, 0) == 0) return (SV *) 0; } TRACEME(("ok (get_lhash at 0x%" UVxf ")", PTR2UV(hv))); return (SV *) hv; } #endif /* * retrieve_hash * * Retrieve a whole hash table. * Layout is SX_HASH <size> followed by each key/value pair, in random order. * Keys are stored as <length> <data>, the <data> section being omitted * if length is 0. * Values are stored as <object>. * * When we come here, SX_HASH has been read already. */ static SV *retrieve_hash(pTHX_ stcxt_t *cxt, const char *cname) { I32 len; I32 size; I32 i; HV *hv; SV *sv; HV *stash; TRACEME(("retrieve_hash (#%d)", (int)cxt->tagnum)); /* * Read length, allocate table. */ RLEN(len); TRACEME(("size = %d", (int)len)); hv = newHV(); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(hv, stash, 0); /* Will return if table not allocated properly */ if (len == 0) return (SV *) hv; /* No data follow if table empty */ TRACEME(("split %d", (int)len+1)); hv_ksplit(hv, len+1); /* pre-extend hash to save multiple splits */ /* * Now get each key/value pair in turn... */ for (i = 0; i < len; i++) { /* * Get value first. */ TRACEME(("(#%d) value", (int)i)); sv = retrieve(aTHX_ cxt, 0); if (!sv) return (SV *) 0; /* * Get key. * Since we're reading into kbuf, we must ensure we're not * recursing between the read and the hv_store() where it's used. * Hence the key comes after the value. */ RLEN(size); /* Get key size */ KBUFCHK((STRLEN)size); /* Grow hash key read pool if needed */ if (size) READ(kbuf, size); kbuf[size] = '\0'; /* Mark string end, just in case */ TRACEME(("(#%d) key '%s'", (int)i, kbuf)); /* * Enter key/value pair into hash table. */ if (hv_store(hv, kbuf, (U32) size, sv, 0) == 0) return (SV *) 0; } TRACEME(("ok (retrieve_hash at 0x%" UVxf ")", PTR2UV(hv))); return (SV *) hv; } /* * retrieve_hash * * Retrieve a whole hash table. * Layout is SX_HASH <size> followed by each key/value pair, in random order. * Keys are stored as <length> <data>, the <data> section being omitted * if length is 0. * Values are stored as <object>. * * When we come here, SX_HASH has been read already. */ static SV *retrieve_flag_hash(pTHX_ stcxt_t *cxt, const char *cname) { dVAR; I32 len; I32 size; I32 i; HV *hv; SV *sv; HV *stash; int hash_flags; GETMARK(hash_flags); TRACEME(("retrieve_flag_hash (#%d)", (int)cxt->tagnum)); /* * Read length, allocate table. */ #ifndef HAS_RESTRICTED_HASHES if (hash_flags & SHV_RESTRICTED) { if (cxt->derestrict < 0) cxt->derestrict = (SvTRUE (get_sv("Storable::downgrade_restricted", GV_ADD)) ? 1 : 0); if (cxt->derestrict == 0) RESTRICTED_HASH_CROAK(); } #endif RLEN(len); TRACEME(("size = %d, flags = %d", (int)len, hash_flags)); hv = newHV(); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(hv, stash, 0); /* Will return if table not allocated properly */ if (len == 0) return (SV *) hv; /* No data follow if table empty */ TRACEME(("split %d", (int)len+1)); hv_ksplit(hv, len+1); /* pre-extend hash to save multiple splits */ /* * Now get each key/value pair in turn... */ for (i = 0; i < len; i++) { int flags; int store_flags = 0; /* * Get value first. */ TRACEME(("(#%d) value", (int)i)); sv = retrieve(aTHX_ cxt, 0); if (!sv) return (SV *) 0; GETMARK(flags); #ifdef HAS_RESTRICTED_HASHES if ((hash_flags & SHV_RESTRICTED) && (flags & SHV_K_LOCKED)) SvREADONLY_on(sv); #endif if (flags & SHV_K_ISSV) { /* XXX you can't set a placeholder with an SV key. Then again, you can't get an SV key. Without messing around beyond what the API is supposed to do. */ SV *keysv; TRACEME(("(#%d) keysv, flags=%d", (int)i, flags)); keysv = retrieve(aTHX_ cxt, 0); if (!keysv) return (SV *) 0; if (!hv_store_ent(hv, keysv, sv, 0)) return (SV *) 0; } else { /* * Get key. * Since we're reading into kbuf, we must ensure we're not * recursing between the read and the hv_store() where it's used. * Hence the key comes after the value. */ if (flags & SHV_K_PLACEHOLDER) { SvREFCNT_dec (sv); sv = &PL_sv_placeholder; store_flags |= HVhek_PLACEHOLD; } if (flags & SHV_K_UTF8) { #ifdef HAS_UTF8_HASHES store_flags |= HVhek_UTF8; #else if (cxt->use_bytes < 0) cxt->use_bytes = (SvTRUE(get_sv("Storable::drop_utf8", GV_ADD)) ? 1 : 0); if (cxt->use_bytes == 0) UTF8_CROAK(); #endif } #ifdef HAS_UTF8_HASHES if (flags & SHV_K_WASUTF8) store_flags |= HVhek_WASUTF8; #endif RLEN(size); /* Get key size */ KBUFCHK((STRLEN)size);/* Grow hash key read pool if needed */ if (size) READ(kbuf, size); kbuf[size] = '\0'; /* Mark string end, just in case */ TRACEME(("(#%d) key '%s' flags %X store_flags %X", (int)i, kbuf, flags, store_flags)); /* * Enter key/value pair into hash table. */ #ifdef HAS_RESTRICTED_HASHES if (hv_store_flags(hv, kbuf, size, sv, 0, store_flags) == 0) return (SV *) 0; #else if (!(store_flags & HVhek_PLACEHOLD)) if (hv_store(hv, kbuf, size, sv, 0) == 0) return (SV *) 0; #endif } } #ifdef HAS_RESTRICTED_HASHES if (hash_flags & SHV_RESTRICTED) SvREADONLY_on(hv); #endif TRACEME(("ok (retrieve_hash at 0x%" UVxf ")", PTR2UV(hv))); return (SV *) hv; } /* * retrieve_code * * Return a code reference. */ static SV *retrieve_code(pTHX_ stcxt_t *cxt, const char *cname) { dSP; I32 type, count; IV tagnum; SV *cv; SV *sv, *text, *sub, *errsv; HV *stash; TRACEME(("retrieve_code (#%d)", (int)cxt->tagnum)); /* * Insert dummy SV in the aseen array so that we don't screw * up the tag numbers. We would just make the internal * scalar an untagged item in the stream, but * retrieve_scalar() calls SEEN(). So we just increase the * tag number. */ tagnum = cxt->tagnum; sv = newSViv(0); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 0); /* * Retrieve the source of the code reference * as a small or large scalar */ GETMARK(type); switch (type) { case SX_SCALAR: text = retrieve_scalar(aTHX_ cxt, cname); break; case SX_LSCALAR: text = retrieve_lscalar(aTHX_ cxt, cname); break; case SX_UTF8STR: text = retrieve_utf8str(aTHX_ cxt, cname); break; case SX_LUTF8STR: text = retrieve_lutf8str(aTHX_ cxt, cname); break; default: CROAK(("Unexpected type %d in retrieve_code\n", (int)type)); } if (!text) { CROAK(("Unable to retrieve code\n")); } /* * prepend "sub " to the source */ sub = newSVpvs("sub "); if (SvUTF8(text)) SvUTF8_on(sub); sv_catpv(sub, SvPV_nolen(text)); /* XXX no sv_catsv! */ SvREFCNT_dec(text); /* * evaluate the source to a code reference and use the CV value */ if (cxt->eval == NULL) { cxt->eval = get_sv("Storable::Eval", GV_ADD); SvREFCNT_inc(cxt->eval); } if (!SvTRUE(cxt->eval)) { if (cxt->forgive_me == 0 || (cxt->forgive_me < 0 && !(cxt->forgive_me = SvTRUE (get_sv("Storable::forgive_me", GV_ADD)) ? 1 : 0)) ) { CROAK(("Can't eval, please set $Storable::Eval to a true value")); } else { sv = newSVsv(sub); /* fix up the dummy entry... */ av_store(cxt->aseen, tagnum, SvREFCNT_inc(sv)); return sv; } } ENTER; SAVETMPS; errsv = get_sv("@", GV_ADD); SvPVCLEAR(errsv); /* clear $@ */ if (SvROK(cxt->eval) && SvTYPE(SvRV(cxt->eval)) == SVt_PVCV) { PUSHMARK(sp); XPUSHs(sv_2mortal(newSVsv(sub))); PUTBACK; count = call_sv(cxt->eval, G_SCALAR); if (count != 1) CROAK(("Unexpected return value from $Storable::Eval callback\n")); } else { eval_sv(sub, G_SCALAR); } SPAGAIN; cv = POPs; PUTBACK; if (SvTRUE(errsv)) { CROAK(("code %s caused an error: %s", SvPV_nolen(sub), SvPV_nolen(errsv))); } if (cv && SvROK(cv) && SvTYPE(SvRV(cv)) == SVt_PVCV) { sv = SvRV(cv); } else { CROAK(("code %s did not evaluate to a subroutine reference\n", SvPV_nolen(sub))); } SvREFCNT_inc(sv); /* XXX seems to be necessary */ SvREFCNT_dec(sub); FREETMPS; LEAVE; /* fix up the dummy entry... */ av_store(cxt->aseen, tagnum, SvREFCNT_inc(sv)); return sv; } static SV *retrieve_regexp(pTHX_ stcxt_t *cxt, const char *cname) { #if PERL_VERSION_GE(5,8,0) int op_flags; U32 re_len; STRLEN flags_len; SV *re; SV *flags; SV *re_ref; SV *sv; dSP; I32 count; HV *stash; ENTER; SAVETMPS; GETMARK(op_flags); if (op_flags & SHR_U32_RE_LEN) { RLEN(re_len); } else GETMARK(re_len); re = sv_2mortal(NEWSV(10002, re_len ? re_len : 1)); READ(SvPVX(re), re_len); SvCUR_set(re, re_len); *SvEND(re) = '\0'; SvPOK_only(re); GETMARK(flags_len); flags = sv_2mortal(NEWSV(10002, flags_len ? flags_len : 1)); READ(SvPVX(flags), flags_len); SvCUR_set(flags, flags_len); *SvEND(flags) = '\0'; SvPOK_only(flags); PUSHMARK(SP); XPUSHs(re); XPUSHs(flags); PUTBACK; count = call_pv("Storable::_make_re", G_SCALAR); SPAGAIN; if (count != 1) CROAK(("Bad count %d calling _make_re", (int)count)); re_ref = POPs; PUTBACK; if (!SvROK(re_ref)) CROAK(("_make_re didn't return a reference")); sv = SvRV(re_ref); SvREFCNT_inc(sv); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 0); FREETMPS; LEAVE; return sv; #else CROAK(("retrieve_regexp does not work with 5.6 or earlier")); #endif } /* * old_retrieve_array * * Retrieve a whole array in pre-0.6 binary format. * * Layout is SX_ARRAY <size> followed by each item, in increasing index order. * Each item is stored as SX_ITEM <object> or SX_IT_UNDEF for "holes". * * When we come here, SX_ARRAY has been read already. */ static SV *old_retrieve_array(pTHX_ stcxt_t *cxt, const char *cname) { I32 len; I32 i; AV *av; SV *sv; int c; PERL_UNUSED_ARG(cname); TRACEME(("old_retrieve_array (#%d)", (int)cxt->tagnum)); /* * Read length, and allocate array, then pre-extend it. */ RLEN(len); TRACEME(("size = %d", (int)len)); av = newAV(); SEEN0_NN(av, 0); /* Will return if array not allocated nicely */ if (len) av_extend(av, len); else return (SV *) av; /* No data follow if array is empty */ /* * Now get each item in turn... */ for (i = 0; i < len; i++) { GETMARK(c); if (c == SX_IT_UNDEF) { TRACEME(("(#%d) undef item", (int)i)); continue; /* av_extend() already filled us with undef */ } if (c != SX_ITEM) (void) retrieve_other(aTHX_ cxt, 0);/* Will croak out */ TRACEME(("(#%d) item", (int)i)); sv = retrieve(aTHX_ cxt, 0); /* Retrieve item */ if (!sv) return (SV *) 0; if (av_store(av, i, sv) == 0) return (SV *) 0; } TRACEME(("ok (old_retrieve_array at 0x%" UVxf ")", PTR2UV(av))); return (SV *) av; } /* * old_retrieve_hash * * Retrieve a whole hash table in pre-0.6 binary format. * * Layout is SX_HASH <size> followed by each key/value pair, in random order. * Keys are stored as SX_KEY <length> <data>, the <data> section being omitted * if length is 0. * Values are stored as SX_VALUE <object> or SX_VL_UNDEF for "holes". * * When we come here, SX_HASH has been read already. */ static SV *old_retrieve_hash(pTHX_ stcxt_t *cxt, const char *cname) { I32 len; I32 size; I32 i; HV *hv; SV *sv = (SV *) 0; int c; SV *sv_h_undef = (SV *) 0; /* hv_store() bug */ PERL_UNUSED_ARG(cname); TRACEME(("old_retrieve_hash (#%d)", (int)cxt->tagnum)); /* * Read length, allocate table. */ RLEN(len); TRACEME(("size = %d", (int)len)); hv = newHV(); SEEN0_NN(hv, 0); /* Will return if table not allocated properly */ if (len == 0) return (SV *) hv; /* No data follow if table empty */ TRACEME(("split %d", (int)len+1)); hv_ksplit(hv, len+1); /* pre-extend hash to save multiple splits */ /* * Now get each key/value pair in turn... */ for (i = 0; i < len; i++) { /* * Get value first. */ GETMARK(c); if (c == SX_VL_UNDEF) { TRACEME(("(#%d) undef value", (int)i)); /* * Due to a bug in hv_store(), it's not possible to pass * &PL_sv_undef to hv_store() as a value, otherwise the * associated key will not be creatable any more. -- RAM, 14/01/97 */ if (!sv_h_undef) sv_h_undef = newSVsv(&PL_sv_undef); sv = SvREFCNT_inc(sv_h_undef); } else if (c == SX_VALUE) { TRACEME(("(#%d) value", (int)i)); sv = retrieve(aTHX_ cxt, 0); if (!sv) return (SV *) 0; } else (void) retrieve_other(aTHX_ cxt, 0); /* Will croak out */ /* * Get key. * Since we're reading into kbuf, we must ensure we're not * recursing between the read and the hv_store() where it's used. * Hence the key comes after the value. */ GETMARK(c); if (c != SX_KEY) (void) retrieve_other(aTHX_ cxt, 0); /* Will croak out */ RLEN(size); /* Get key size */ KBUFCHK((STRLEN)size); /* Grow hash key read pool if needed */ if (size) READ(kbuf, size); kbuf[size] = '\0'; /* Mark string end, just in case */ TRACEME(("(#%d) key '%s'", (int)i, kbuf)); /* * Enter key/value pair into hash table. */ if (hv_store(hv, kbuf, (U32) size, sv, 0) == 0) return (SV *) 0; } TRACEME(("ok (retrieve_hash at 0x%" UVxf ")", PTR2UV(hv))); return (SV *) hv; } /*** *** Retrieval engine. ***/ /* * magic_check * * Make sure the stored data we're trying to retrieve has been produced * on an ILP compatible system with the same byteorder. It croaks out in * case an error is detected. [ILP = integer-long-pointer sizes] * Returns null if error is detected, &PL_sv_undef otherwise. * * Note that there's no byte ordering info emitted when network order was * used at store time. */ static SV *magic_check(pTHX_ stcxt_t *cxt) { /* The worst case for a malicious header would be old magic (which is longer), major, minor, byteorder length byte of 255, 255 bytes of garbage, sizeof int, long, pointer, NV. So the worse of that we can read is 255 bytes of garbage plus 4. Err, I am assuming 8 bit bytes here. Please file a bug report if you're compiling perl on a system with chars that are larger than 8 bits. (Even Crays aren't *that* perverse). */ unsigned char buf[4 + 255]; unsigned char *current; int c; int length; int use_network_order; int use_NV_size; int old_magic = 0; int version_major; int version_minor = 0; TRACEME(("magic_check")); /* * The "magic number" is only for files, not when freezing in memory. */ if (cxt->fio) { /* This includes the '\0' at the end. I want to read the extra byte, which is usually going to be the major version number. */ STRLEN len = sizeof(magicstr); STRLEN old_len; READ(buf, (SSize_t)(len)); /* Not null-terminated */ /* Point at the byte after the byte we read. */ current = buf + --len; /* Do the -- outside of macros. */ if (memNE(buf, magicstr, len)) { /* * Try to read more bytes to check for the old magic number, which * was longer. */ TRACEME(("trying for old magic number")); old_len = sizeof(old_magicstr) - 1; READ(current + 1, (SSize_t)(old_len - len)); if (memNE(buf, old_magicstr, old_len)) CROAK(("File is not a perl storable")); old_magic++; current = buf + old_len; } use_network_order = *current; } else { GETMARK(use_network_order); } /* * Starting with 0.6, the "use_network_order" byte flag is also used to * indicate the version number of the binary, and therefore governs the * setting of sv_retrieve_vtbl. See magic_write(). */ if (old_magic && use_network_order > 1) { /* 0.1 dump - use_network_order is really byte order length */ version_major = -1; } else { version_major = use_network_order >> 1; } cxt->retrieve_vtbl = (SV*(**)(pTHX_ stcxt_t *cxt, const char *cname)) (version_major > 0 ? sv_retrieve : sv_old_retrieve); TRACEME(("magic_check: netorder = 0x%x", use_network_order)); /* * Starting with 0.7 (binary major 2), a full byte is dedicated to the * minor version of the protocol. See magic_write(). */ if (version_major > 1) GETMARK(version_minor); cxt->ver_major = version_major; cxt->ver_minor = version_minor; TRACEME(("binary image version is %d.%d", version_major, version_minor)); /* * Inter-operability sanity check: we can't retrieve something stored * using a format more recent than ours, because we have no way to * know what has changed, and letting retrieval go would mean a probable * failure reporting a "corrupted" storable file. */ if ( version_major > STORABLE_BIN_MAJOR || (version_major == STORABLE_BIN_MAJOR && version_minor > STORABLE_BIN_MINOR) ) { int croak_now = 1; TRACEME(("but I am version is %d.%d", STORABLE_BIN_MAJOR, STORABLE_BIN_MINOR)); if (version_major == STORABLE_BIN_MAJOR) { TRACEME(("cxt->accept_future_minor is %d", cxt->accept_future_minor)); if (cxt->accept_future_minor < 0) cxt->accept_future_minor = (SvTRUE(get_sv("Storable::accept_future_minor", GV_ADD)) ? 1 : 0); if (cxt->accept_future_minor == 1) croak_now = 0; /* Don't croak yet. */ } if (croak_now) { CROAK(("Storable binary image v%d.%d more recent than I am (v%d.%d)", version_major, version_minor, STORABLE_BIN_MAJOR, STORABLE_BIN_MINOR)); } } /* * If they stored using network order, there's no byte ordering * information to check. */ if ((cxt->netorder = (use_network_order & 0x1))) /* Extra () for -Wall */ return &PL_sv_undef; /* No byte ordering info */ /* In C truth is 1, falsehood is 0. Very convenient. */ use_NV_size = version_major >= 2 && version_minor >= 2; if (version_major >= 0) { GETMARK(c); } else { c = use_network_order; } length = c + 3 + use_NV_size; READ(buf, length); /* Not null-terminated */ TRACEME(("byte order '%.*s' %d", c, buf, c)); #ifdef USE_56_INTERWORK_KLUDGE /* No point in caching this in the context as we only need it once per retrieve, and we need to recheck it each read. */ if (SvTRUE(get_sv("Storable::interwork_56_64bit", GV_ADD))) { if ((c != (sizeof (byteorderstr_56) - 1)) || memNE(buf, byteorderstr_56, c)) CROAK(("Byte order is not compatible")); } else #endif { if ((c != (sizeof (byteorderstr) - 1)) || memNE(buf, byteorderstr, c)) CROAK(("Byte order is not compatible")); } current = buf + c; /* sizeof(int) */ if ((int) *current++ != sizeof(int)) CROAK(("Integer size is not compatible")); /* sizeof(long) */ if ((int) *current++ != sizeof(long)) CROAK(("Long integer size is not compatible")); /* sizeof(char *) */ if ((int) *current != sizeof(char *)) CROAK(("Pointer size is not compatible")); if (use_NV_size) { /* sizeof(NV) */ if ((int) *++current != sizeof(NV)) CROAK(("Double size is not compatible")); } return &PL_sv_undef; /* OK */ } /* * retrieve * * Recursively retrieve objects from the specified file and return their * root SV (which may be an AV or an HV for what we care). * Returns null if there is a problem. */ static SV *retrieve(pTHX_ stcxt_t *cxt, const char *cname) { int type; SV **svh; SV *sv; TRACEME(("retrieve")); /* * Grab address tag which identifies the object if we are retrieving * an older format. Since the new binary format counts objects and no * longer explicitly tags them, we must keep track of the correspondence * ourselves. * * The following section will disappear one day when the old format is * no longer supported, hence the final "goto" in the "if" block. */ if (cxt->hseen) { /* Retrieving old binary */ stag_t tag; if (cxt->netorder) { I32 nettag; READ(&nettag, sizeof(I32)); /* Ordered sequence of I32 */ tag = (stag_t) nettag; } else READ(&tag, sizeof(stag_t)); /* Original address of the SV */ GETMARK(type); if (type == SX_OBJECT) { I32 tagn; svh = hv_fetch(cxt->hseen, (char *) &tag, sizeof(tag), FALSE); if (!svh) CROAK(("Old tag 0x%" UVxf " should have been mapped already", (UV) tag)); tagn = SvIV(*svh); /* Mapped tag number computed earlier below */ /* * The following code is common with the SX_OBJECT case below. */ svh = av_fetch(cxt->aseen, tagn, FALSE); if (!svh) CROAK(("Object #%" IVdf " should have been retrieved already", (IV) tagn)); sv = *svh; TRACEME(("has retrieved #%d at 0x%" UVxf, (int)tagn, PTR2UV(sv))); SvREFCNT_inc(sv); /* One more reference to this same sv */ return sv; /* The SV pointer where object was retrieved */ } /* * Map new object, but don't increase tagnum. This will be done * by each of the retrieve_* functions when they call SEEN(). * * The mapping associates the "tag" initially present with a unique * tag number. See test for SX_OBJECT above to see how this is perused. */ if (!hv_store(cxt->hseen, (char *) &tag, sizeof(tag), newSViv(cxt->tagnum), 0)) return (SV *) 0; goto first_time; } /* * Regular post-0.6 binary format. */ GETMARK(type); TRACEME(("retrieve type = %d", type)); /* * Are we dealing with an object we should have already retrieved? */ if (type == SX_OBJECT) { I32 tag; READ_I32(tag); tag = ntohl(tag); #ifndef HAS_U64 /* A 32-bit system can't have over 2**31 objects anyway */ if (tag < 0) CROAK(("Object #%" IVdf " out of range", (IV)tag)); #endif /* Older versions of Storable on with 64-bit support on 64-bit systems can produce values above the 2G boundary (or wrapped above the 4G boundary, which we can't do much about), treat those as unsigned. This same commit stores tag ids over the 2G boundary as long tags since older Storables will mis-handle them as short tags. */ svh = av_fetch(cxt->aseen, (U32)tag, FALSE); if (!svh) CROAK(("Object #%" IVdf " should have been retrieved already", (IV) tag)); sv = *svh; TRACEME(("had retrieved #%d at 0x%" UVxf, (int)tag, PTR2UV(sv))); SvREFCNT_inc(sv); /* One more reference to this same sv */ return sv; /* The SV pointer where object was retrieved */ } else if (type >= SX_LAST && cxt->ver_minor > STORABLE_BIN_MINOR) { if (cxt->accept_future_minor < 0) cxt->accept_future_minor = (SvTRUE(get_sv("Storable::accept_future_minor", GV_ADD)) ? 1 : 0); if (cxt->accept_future_minor == 1) { CROAK(("Storable binary image v%d.%d contains data of type %d. " "This Storable is v%d.%d and can only handle data types up to %d", cxt->ver_major, cxt->ver_minor, type, STORABLE_BIN_MAJOR, STORABLE_BIN_MINOR, SX_LAST - 1)); } } first_time: /* Will disappear when support for old format is dropped */ /* * Okay, first time through for this one. */ sv = RETRIEVE(cxt, type)(aTHX_ cxt, cname); if (!sv) return (SV *) 0; /* Failed */ /* * Old binary formats (pre-0.7). * * Final notifications, ended by SX_STORED may now follow. * Currently, the only pertinent notification to apply on the * freshly retrieved object is either: * SX_CLASS <char-len> <classname> for short classnames. * SX_LG_CLASS <int-len> <classname> for larger one (rare!). * Class name is then read into the key buffer pool used by * hash table key retrieval. */ if (cxt->ver_major < 2) { while ((type = GETCHAR()) != SX_STORED) { I32 len; HV* stash; switch (type) { case SX_CLASS: GETMARK(len); /* Length coded on a single char */ break; case SX_LG_CLASS: /* Length coded on a regular integer */ RLEN(len); break; case EOF: default: return (SV *) 0; /* Failed */ } KBUFCHK((STRLEN)len); /* Grow buffer as necessary */ if (len) READ(kbuf, len); kbuf[len] = '\0'; /* Mark string end */ stash = gv_stashpvn(kbuf, len, GV_ADD); BLESS(sv, stash); } } TRACEME(("ok (retrieved 0x%" UVxf ", refcnt=%d, %s)", PTR2UV(sv), (int)SvREFCNT(sv) - 1, sv_reftype(sv, FALSE))); return sv; /* Ok */ } /* * do_retrieve * * Retrieve data held in file and return the root object. * Common routine for pretrieve and mretrieve. */ static SV *do_retrieve( pTHX_ PerlIO *f, SV *in, int optype, int flags) { dSTCXT; SV *sv; int is_tainted; /* Is input source tainted? */ int pre_06_fmt = 0; /* True with pre Storable 0.6 formats */ TRACEMED(("do_retrieve (optype = 0x%x, flags=0x%x)", (unsigned)optype, (unsigned)flags)); optype |= ST_RETRIEVE; cxt->flags = flags; /* * Sanity assertions for retrieve dispatch tables. */ ASSERT(sizeof(sv_old_retrieve) == sizeof(sv_retrieve), ("old and new retrieve dispatch table have same size")); ASSERT(sv_old_retrieve[(int)SX_LAST] == retrieve_other, ("SX_LAST entry correctly initialized in old dispatch table")); ASSERT(sv_retrieve[(int)SX_LAST] == retrieve_other, ("SX_LAST entry correctly initialized in new dispatch table")); /* * Workaround for CROAK leak: if they enter with a "dirty" context, * free up memory for them now. */ assert(cxt); if (cxt->s_dirty) clean_context(aTHX_ cxt); /* * Now that STORABLE_xxx hooks exist, it is possible that they try to * re-enter retrieve() via the hooks. */ if (cxt->entry) { cxt = allocate_context(aTHX_ cxt); cxt->flags = flags; } INIT_TRACEME; cxt->entry++; ASSERT(cxt->entry == 1, ("starting new recursion")); ASSERT(!cxt->s_dirty, ("clean context")); /* * Prepare context. * * Data is loaded into the memory buffer when f is NULL, unless 'in' is * also NULL, in which case we're expecting the data to already lie * in the buffer (dclone case). */ KBUFINIT(); /* Allocate hash key reading pool once */ if (!f && in) { #ifdef SvUTF8_on if (SvUTF8(in)) { STRLEN length; const char *orig = SvPV(in, length); char *asbytes; /* This is quite deliberate. I want the UTF8 routines to encounter the '\0' which perl adds at the end of all scalars, so that any new string also has this. */ STRLEN klen_tmp = length + 1; bool is_utf8 = TRUE; /* Just casting the &klen to (STRLEN) won't work well if STRLEN and I32 are of different widths. --jhi */ asbytes = (char*)bytes_from_utf8((U8*)orig, &klen_tmp, &is_utf8); if (is_utf8) { CROAK(("Frozen string corrupt - contains characters outside 0-255")); } if (asbytes != orig) { /* String has been converted. There is no need to keep any reference to the old string. */ in = sv_newmortal(); /* We donate the SV the malloc()ed string bytes_from_utf8 returned us. */ SvUPGRADE(in, SVt_PV); SvPOK_on(in); SvPV_set(in, asbytes); SvLEN_set(in, klen_tmp); SvCUR_set(in, klen_tmp - 1); } } #endif MBUF_SAVE_AND_LOAD(in); } /* * Magic number verifications. * * This needs to be done before calling init_retrieve_context() * since the format indication in the file are necessary to conduct * some of the initializations. */ cxt->fio = f; /* Where I/O are performed */ if (!magic_check(aTHX_ cxt)) CROAK(("Magic number checking on storable %s failed", cxt->fio ? "file" : "string")); TRACEME(("data stored in %s format", cxt->netorder ? "net order" : "native")); /* * Check whether input source is tainted, so that we don't wrongly * taint perfectly good values... * * We assume file input is always tainted. If both 'f' and 'in' are * NULL, then we come from dclone, and tainted is already filled in * the context. That's a kludge, but the whole dclone() thing is * already quite a kludge anyway! -- RAM, 15/09/2000. */ is_tainted = f ? 1 : (in ? SvTAINTED(in) : cxt->s_tainted); TRACEME(("input source is %s", is_tainted ? "tainted" : "trusted")); init_retrieve_context(aTHX_ cxt, optype, is_tainted); ASSERT(is_retrieving(aTHX), ("within retrieve operation")); sv = retrieve(aTHX_ cxt, 0); /* Recursively retrieve object, get root SV */ /* * Final cleanup. */ if (!f && in) MBUF_RESTORE(); pre_06_fmt = cxt->hseen != NULL; /* Before we clean context */ /* * The "root" context is never freed. */ clean_retrieve_context(aTHX_ cxt); if (cxt->prev) /* This context was stacked */ free_context(aTHX_ cxt); /* It was not the "root" context */ /* * Prepare returned value. */ if (!sv) { TRACEMED(("retrieve ERROR")); return &PL_sv_undef; /* Something went wrong, return undef */ } TRACEMED(("retrieve got %s(0x%" UVxf ")", sv_reftype(sv, FALSE), PTR2UV(sv))); /* * Backward compatibility with Storable-0.5@9 (which we know we * are retrieving if hseen is non-null): don't create an extra RV * for objects since we special-cased it at store time. * * Build a reference to the SV returned by pretrieve even if it is * already one and not a scalar, for consistency reasons. */ if (pre_06_fmt) { /* Was not handling overloading by then */ SV *rv; TRACEMED(("fixing for old formats -- pre 0.6")); if (sv_type(aTHX_ sv) == svis_REF && (rv = SvRV(sv)) && SvOBJECT(rv)) { TRACEME(("ended do_retrieve() with an object -- pre 0.6")); return sv; } } /* * If reference is overloaded, restore behaviour. * * NB: minor glitch here: normally, overloaded refs are stored specially * so that we can croak when behaviour cannot be re-installed, and also * avoid testing for overloading magic at each reference retrieval. * * Unfortunately, the root reference is implicitly stored, so we must * check for possible overloading now. Furthermore, if we don't restore * overloading, we cannot croak as if the original ref was, because we * have no way to determine whether it was an overloaded ref or not in * the first place. * * It's a pity that overloading magic is attached to the rv, and not to * the underlying sv as blessing is. */ if (SvOBJECT(sv)) { HV *stash = (HV *) SvSTASH(sv); SV *rv = newRV_noinc(sv); if (stash && Gv_AMG(stash)) { SvAMAGIC_on(rv); TRACEMED(("restored overloading on root reference")); } TRACEMED(("ended do_retrieve() with an object")); return rv; } TRACEMED(("regular do_retrieve() end")); return newRV_noinc(sv); } /* * pretrieve * * Retrieve data held in file and return the root object, undef on error. */ static SV *pretrieve(pTHX_ PerlIO *f, IV flag) { TRACEMED(("pretrieve")); return do_retrieve(aTHX_ f, Nullsv, 0, (int)flag); } /* * mretrieve * * Retrieve data held in scalar and return the root object, undef on error. */ static SV *mretrieve(pTHX_ SV *sv, IV flag) { TRACEMED(("mretrieve")); return do_retrieve(aTHX_ (PerlIO*) 0, sv, 0, (int)flag); } /*** *** Deep cloning ***/ /* * dclone * * Deep clone: returns a fresh copy of the original referenced SV tree. * * This is achieved by storing the object in memory and restoring from * there. Not that efficient, but it should be faster than doing it from * pure perl anyway. */ static SV *dclone(pTHX_ SV *sv) { dSTCXT; STRLEN size; stcxt_t *real_context; SV *out; TRACEMED(("dclone")); /* * Workaround for CROAK leak: if they enter with a "dirty" context, * free up memory for them now. */ assert(cxt); if (cxt->s_dirty) clean_context(aTHX_ cxt); /* * Tied elements seem to need special handling. */ if ((SvTYPE(sv) == SVt_PVLV #if PERL_VERSION_LT(5,8,0) || SvTYPE(sv) == SVt_PVMG #endif ) && (SvFLAGS(sv) & (SVs_GMG|SVs_SMG|SVs_RMG)) == (SVs_GMG|SVs_SMG|SVs_RMG) && mg_find(sv, 'p')) { mg_get(sv); } /* * do_store() optimizes for dclone by not freeing its context, should * we need to allocate one because we're deep cloning from a hook. */ if (!do_store(aTHX_ (PerlIO*) 0, sv, ST_CLONE, FALSE, (SV**) 0)) return &PL_sv_undef; /* Error during store */ /* * Because of the above optimization, we have to refresh the context, * since a new one could have been allocated and stacked by do_store(). */ { dSTCXT; real_context = cxt; } /* Sub-block needed for macro */ cxt = real_context; /* And we need this temporary... */ /* * Now, 'cxt' may refer to a new context. */ assert(cxt); ASSERT(!cxt->s_dirty, ("clean context")); ASSERT(!cxt->entry, ("entry will not cause new context allocation")); size = MBUF_SIZE(); TRACEME(("dclone stored %ld bytes", (long)size)); MBUF_INIT(size); /* * Since we're passing do_retrieve() both a NULL file and sv, we need * to pre-compute the taintedness of the input by setting cxt->tainted * to whatever state our own input string was. -- RAM, 15/09/2000 * * do_retrieve() will free non-root context. */ cxt->s_tainted = SvTAINTED(sv); out = do_retrieve(aTHX_ (PerlIO*) 0, Nullsv, ST_CLONE, FLAG_BLESS_OK | FLAG_TIE_OK); TRACEMED(("dclone returns 0x%" UVxf, PTR2UV(out))); return out; } /*** *** Glue with perl. ***/ /* * The Perl IO GV object distinguishes between input and output for sockets * but not for plain files. To allow Storable to transparently work on * plain files and sockets transparently, we have to ask xsubpp to fetch the * right object for us. Hence the OutputStream and InputStream declarations. * * Before perl 5.004_05, those entries in the standard typemap are not * defined in perl include files, so we do that here. */ #ifndef OutputStream #define OutputStream PerlIO * #define InputStream PerlIO * #endif /* !OutputStream */ static int storable_free(pTHX_ SV *sv, MAGIC* mg) { stcxt_t *cxt = (stcxt_t *)SvPVX(sv); PERL_UNUSED_ARG(mg); #ifdef USE_PTR_TABLE if (cxt->pseen) ptr_table_free(cxt->pseen); #endif if (kbuf) Safefree(kbuf); if (!cxt->membuf_ro && mbase) Safefree(mbase); if (cxt->membuf_ro && (cxt->msaved).arena) Safefree((cxt->msaved).arena); return 0; } MODULE = Storable PACKAGE = Storable PROTOTYPES: ENABLE BOOT: { HV *stash = gv_stashpvn("Storable", 8, GV_ADD); newCONSTSUB(stash, "BIN_MAJOR", newSViv(STORABLE_BIN_MAJOR)); newCONSTSUB(stash, "BIN_MINOR", newSViv(STORABLE_BIN_MINOR)); newCONSTSUB(stash, "BIN_WRITE_MINOR", newSViv(STORABLE_BIN_WRITE_MINOR)); newCONSTSUB(stash, "CAN_FLOCK", CAN_FLOCK); init_perinterp(aTHX); gv_fetchpv("Storable::drop_utf8", GV_ADDMULTI, SVt_PV); #ifdef DEBUGME /* Only disable the used only once warning if we are in debugging mode. */ gv_fetchpv("Storable::DEBUGME", GV_ADDMULTI, SVt_PV); #endif #ifdef USE_56_INTERWORK_KLUDGE gv_fetchpv("Storable::interwork_56_64bit", GV_ADDMULTI, SVt_PV); #endif } void init_perinterp() CODE: init_perinterp(aTHX); # pstore # # Store the transitive data closure of given object to disk. # Returns undef on error, a true value otherwise. # net_pstore # # Same as pstore(), but network order is used for integers and doubles are # emitted as strings. SV * pstore(f,obj) OutputStream f SV* obj ALIAS: net_pstore = 1 PPCODE: RETVAL = do_store(aTHX_ f, obj, 0, ix, (SV **)0) ? &PL_sv_yes : &PL_sv_undef; /* do_store() can reallocate the stack, so need a sequence point to ensure that ST(0) knows about it. Hence using two statements. */ ST(0) = RETVAL; XSRETURN(1); # mstore # # Store the transitive data closure of given object to memory. # Returns undef on error, a scalar value containing the data otherwise. # net_mstore # # Same as mstore(), but network order is used for integers and doubles are # emitted as strings. SV * mstore(obj) SV* obj ALIAS: net_mstore = 1 CODE: RETVAL = &PL_sv_undef; if (!do_store(aTHX_ (PerlIO*) 0, obj, 0, ix, &RETVAL)) RETVAL = &PL_sv_undef; OUTPUT: RETVAL SV * pretrieve(f, flag = 6) InputStream f IV flag CODE: RETVAL = pretrieve(aTHX_ f, flag); OUTPUT: RETVAL SV * mretrieve(sv, flag = 6) SV* sv IV flag CODE: RETVAL = mretrieve(aTHX_ sv, flag); OUTPUT: RETVAL SV * dclone(sv) SV* sv CODE: RETVAL = dclone(aTHX_ sv); OUTPUT: RETVAL void last_op_in_netorder() ALIAS: is_storing = ST_STORE is_retrieving = ST_RETRIEVE PREINIT: bool result; CODE: if (ix) { dSTCXT; assert(cxt); result = cxt->entry && (cxt->optype & ix) ? TRUE : FALSE; } else { result = !!last_op_in_netorder(aTHX); } ST(0) = boolSV(result); IV stack_depth() CODE: RETVAL = SvIV(get_sv("Storable::recursion_limit", GV_ADD)); OUTPUT: RETVAL IV stack_depth_hash() CODE: RETVAL = SvIV(get_sv("Storable::recursion_limit_hash", GV_ADD)); OUTPUT: RETVAL PK ��[�f=�� � Storable.cnu �[��� /* * This file was generated automatically by ExtUtils::ParseXS version 3.40 from the * contents of Storable.xs. Do not edit this file, edit Storable.xs instead. * * ANY CHANGES MADE HERE WILL BE LOST! * */ #line 1 "Storable.xs" /* -*- c-basic-offset: 4 -*- * * Fast store and retrieve mechanism. * * Copyright (c) 1995-2000, Raphael Manfredi * Copyright (c) 2016, 2017 cPanel Inc * Copyright (c) 2017 Reini Urban * * You may redistribute only under the same terms as Perl 5, as specified * in the README file that comes with the distribution. * */ #define PERL_NO_GET_CONTEXT /* we want efficiency */ #include <EXTERN.h> #include <perl.h> #include <XSUB.h> #ifndef PERL_VERSION_LT # if !defined(PERL_VERSION) || !defined(PERL_REVISION) || ( PERL_REVISION == 5 && ( PERL_VERSION < 10 || (PERL_VERSION == 10 && PERL_SUBVERSION < 1) ) ) # define NEED_PL_parser # define NEED_sv_2pv_flags # define NEED_load_module # define NEED_vload_module # define NEED_newCONSTSUB # define NEED_newSVpvn_flags # define NEED_newRV_noinc # endif #include "ppport.h" /* handle old perls */ #endif #ifdef DEBUGGING #define DEBUGME /* Debug mode, turns assertions on as well */ #define DASSERT /* Assertion mode */ #endif /* * Earlier versions of perl might be used, we can't assume they have the latest! */ /* perl <= 5.8.2 needs this */ #ifndef SvIsCOW # define SvIsCOW(sv) 0 #endif #ifndef HvRITER_set # define HvRITER_set(hv,r) (HvRITER(hv) = r) #endif #ifndef HvEITER_set # define HvEITER_set(hv,r) (HvEITER(hv) = r) #endif #ifndef HvRITER_get # define HvRITER_get HvRITER #endif #ifndef HvEITER_get # define HvEITER_get HvEITER #endif #ifndef HvPLACEHOLDERS_get # define HvPLACEHOLDERS_get HvPLACEHOLDERS #endif #ifndef HvTOTALKEYS # define HvTOTALKEYS(hv) HvKEYS(hv) #endif /* 5.6 */ #ifndef HvUSEDKEYS # define HvUSEDKEYS(hv) HvKEYS(hv) #endif #ifdef SVf_IsCOW # define SvTRULYREADONLY(sv) SvREADONLY(sv) #else # define SvTRULYREADONLY(sv) (SvREADONLY(sv) && !SvIsCOW(sv)) #endif #ifndef strEQc # define strEQc(s,c) memEQ(s, ("" c ""), sizeof(c)) #endif #if defined(HAS_FLOCK) || defined(FCNTL_CAN_LOCK) && defined(HAS_LOCKF) #define CAN_FLOCK &PL_sv_yes #else #define CAN_FLOCK &PL_sv_no #endif #ifdef DEBUGME #ifndef DASSERT #define DASSERT #endif /* * TRACEME() will only output things when the $Storable::DEBUGME is true, * using the value traceme cached in the context. * * * TRACEMED() directly looks at the variable, for use before traceme has been * updated. */ #define TRACEME(x) \ STMT_START { \ if (cxt->traceme) \ { PerlIO_stdoutf x; PerlIO_stdoutf("\n"); } \ } STMT_END #define TRACEMED(x) \ STMT_START { \ if (SvTRUE(get_sv("Storable::DEBUGME", GV_ADD))) \ { PerlIO_stdoutf x; PerlIO_stdoutf("\n"); } \ } STMT_END #define INIT_TRACEME \ STMT_START { \ cxt->traceme = SvTRUE(get_sv("Storable::DEBUGME", GV_ADD)); \ } STMT_END #else #define TRACEME(x) #define TRACEMED(x) #define INIT_TRACEME #endif /* DEBUGME */ #ifdef DASSERT #define ASSERT(x,y) \ STMT_START { \ if (!(x)) { \ PerlIO_stdoutf("ASSERT FAILED (\"%s\", line %d): ", \ __FILE__, (int)__LINE__); \ PerlIO_stdoutf y; PerlIO_stdoutf("\n"); \ } \ } STMT_END #else #define ASSERT(x,y) #endif /* * Type markers. */ #define C(x) ((char) (x)) /* For markers with dynamic retrieval handling */ #define SX_OBJECT C(0) /* Already stored object */ #define SX_LSCALAR C(1) /* Scalar (large binary) follows (length, data) */ #define SX_ARRAY C(2) /* Array forthcoming (size, item list) */ #define SX_HASH C(3) /* Hash forthcoming (size, key/value pair list) */ #define SX_REF C(4) /* Reference to object forthcoming */ #define SX_UNDEF C(5) /* Undefined scalar */ #define SX_INTEGER C(6) /* Integer forthcoming */ #define SX_DOUBLE C(7) /* Double forthcoming */ #define SX_BYTE C(8) /* (signed) byte forthcoming */ #define SX_NETINT C(9) /* Integer in network order forthcoming */ #define SX_SCALAR C(10) /* Scalar (binary, small) follows (length, data) */ #define SX_TIED_ARRAY C(11) /* Tied array forthcoming */ #define SX_TIED_HASH C(12) /* Tied hash forthcoming */ #define SX_TIED_SCALAR C(13) /* Tied scalar forthcoming */ #define SX_SV_UNDEF C(14) /* Perl's immortal PL_sv_undef */ #define SX_SV_YES C(15) /* Perl's immortal PL_sv_yes */ #define SX_SV_NO C(16) /* Perl's immortal PL_sv_no */ #define SX_BLESS C(17) /* Object is blessed */ #define SX_IX_BLESS C(18) /* Object is blessed, classname given by index */ #define SX_HOOK C(19) /* Stored via hook, user-defined */ #define SX_OVERLOAD C(20) /* Overloaded reference */ #define SX_TIED_KEY C(21) /* Tied magic key forthcoming */ #define SX_TIED_IDX C(22) /* Tied magic index forthcoming */ #define SX_UTF8STR C(23) /* UTF-8 string forthcoming (small) */ #define SX_LUTF8STR C(24) /* UTF-8 string forthcoming (large) */ #define SX_FLAG_HASH C(25) /* Hash with flags forthcoming (size, flags, key/flags/value triplet list) */ #define SX_CODE C(26) /* Code references as perl source code */ #define SX_WEAKREF C(27) /* Weak reference to object forthcoming */ #define SX_WEAKOVERLOAD C(28) /* Overloaded weak reference */ #define SX_VSTRING C(29) /* vstring forthcoming (small) */ #define SX_LVSTRING C(30) /* vstring forthcoming (large) */ #define SX_SVUNDEF_ELEM C(31) /* array element set to &PL_sv_undef */ #define SX_REGEXP C(32) /* Regexp */ #define SX_LOBJECT C(33) /* Large object: string, array or hash (size >2G) */ #define SX_LAST C(34) /* invalid. marker only */ /* * Those are only used to retrieve "old" pre-0.6 binary images. */ #define SX_ITEM 'i' /* An array item introducer */ #define SX_IT_UNDEF 'I' /* Undefined array item */ #define SX_KEY 'k' /* A hash key introducer */ #define SX_VALUE 'v' /* A hash value introducer */ #define SX_VL_UNDEF 'V' /* Undefined hash value */ /* * Those are only used to retrieve "old" pre-0.7 binary images */ #define SX_CLASS 'b' /* Object is blessed, class name length <255 */ #define SX_LG_CLASS 'B' /* Object is blessed, class name length >255 */ #define SX_STORED 'X' /* End of object */ /* * Limits between short/long length representation. */ #define LG_SCALAR 255 /* Large scalar length limit */ #define LG_BLESS 127 /* Large classname bless limit */ /* * Operation types */ #define ST_STORE 0x1 /* Store operation */ #define ST_RETRIEVE 0x2 /* Retrieval operation */ #define ST_CLONE 0x4 /* Deep cloning operation */ /* * The following structure is used for hash table key retrieval. Since, when * retrieving objects, we'll be facing blessed hash references, it's best * to pre-allocate that buffer once and resize it as the need arises, never * freeing it (keys will be saved away someplace else anyway, so even large * keys are not enough a motivation to reclaim that space). * * This structure is also used for memory store/retrieve operations which * happen in a fixed place before being malloc'ed elsewhere if persistence * is required. Hence the aptr pointer. */ struct extendable { char *arena; /* Will hold hash key strings, resized as needed */ STRLEN asiz; /* Size of aforementioned buffer */ char *aptr; /* Arena pointer, for in-place read/write ops */ char *aend; /* First invalid address */ }; /* * At store time: * A hash table records the objects which have already been stored. * Those are referred to as SX_OBJECT in the file, and their "tag" (i.e. * an arbitrary sequence number) is used to identify them. * * At retrieve time: * An array table records the objects which have already been retrieved, * as seen by the tag determined by counting the objects themselves. The * reference to that retrieved object is kept in the table, and is returned * when an SX_OBJECT is found bearing that same tag. * * The same processing is used to record "classname" for blessed objects: * indexing by a hash at store time, and via an array at retrieve time. */ typedef unsigned long stag_t; /* Used by pre-0.6 binary format */ /* * Make the tag type 64-bit on 64-bit platforms. * * If the tag number is low enough it's stored as a 32-bit value, but * with very large arrays and hashes it's possible to go over 2**32 * scalars. */ typedef STRLEN ntag_t; /* used for where_is_undef - marks an unset value */ #define UNSET_NTAG_T (~(ntag_t)0) /* * The following "thread-safe" related defines were contributed by * Murray Nesbitt <murray@activestate.com> and integrated by RAM, who * only renamed things a little bit to ensure consistency with surrounding * code. -- RAM, 14/09/1999 * * The original patch suffered from the fact that the stcxt_t structure * was global. Murray tried to minimize the impact on the code as much as * possible. * * Starting with 0.7, Storable can be re-entrant, via the STORABLE_xxx hooks * on objects. Therefore, the notion of context needs to be generalized, * threading or not. */ #define MY_VERSION "Storable(" XS_VERSION ")" /* * Conditional UTF8 support. * */ #define STORE_UTF8STR(pv, len) STORE_PV_LEN(pv, len, SX_UTF8STR, SX_LUTF8STR) #define HAS_UTF8_SCALARS #ifdef HeKUTF8 #define HAS_UTF8_HASHES #define HAS_UTF8_ALL #else /* 5.6 perl has utf8 scalars but not hashes */ #endif #ifndef HAS_UTF8_ALL #define UTF8_CROAK() CROAK(("Cannot retrieve UTF8 data in non-UTF8 perl")) #endif #ifndef SvWEAKREF #define WEAKREF_CROAK() CROAK(("Cannot retrieve weak references in this perl")) #endif #ifndef SvVOK #define VSTRING_CROAK() CROAK(("Cannot retrieve vstring in this perl")) #endif #ifdef HvPLACEHOLDERS #define HAS_RESTRICTED_HASHES #else #define HVhek_PLACEHOLD 0x200 #define RESTRICTED_HASH_CROAK() CROAK(("Cannot retrieve restricted hash")) #endif #ifdef HvHASKFLAGS #define HAS_HASH_KEY_FLAGS #endif #ifdef ptr_table_new #define USE_PTR_TABLE #endif /* do we need/want to clear padding on NVs? */ #if defined(LONG_DOUBLEKIND) && defined(USE_LONG_DOUBLE) # if LONG_DOUBLEKIND == LONG_DOUBLE_IS_X86_80_BIT_LITTLE_ENDIAN || \ LONG_DOUBLEKIND == LONG_DOUBLE_IS_X86_80_BIT_BIG_ENDIAN # define NV_PADDING (NVSIZE - 10) # else # define NV_PADDING 0 # endif #else /* This is kind of a guess - it means we'll get an unneeded clear on 128-bit NV but an upgraded perl will fix that */ # if NVSIZE > 8 # define NV_CLEAR # endif # define NV_PADDING 0 #endif typedef union { NV nv; U8 bytes[sizeof(NV)]; } NV_bytes; /* Needed for 32bit with lengths > 2G - 4G, and 64bit */ #if PTRSIZE > 4 #define HAS_U64 #endif /* * Fields s_tainted and s_dirty are prefixed with s_ because Perl's include * files remap tainted and dirty when threading is enabled. That's bad for * perl to remap such common words. -- RAM, 29/09/00 */ struct stcxt; typedef struct stcxt { int entry; /* flags recursion */ int optype; /* type of traversal operation */ /* which objects have been seen, store time. tags are numbers, which are cast to (SV *) and stored directly */ #ifdef USE_PTR_TABLE /* use pseen if we have ptr_tables. We have to store tag+1, because tag numbers start at 0, and we can't store (SV *) 0 in a ptr_table without it being confused for a fetch lookup failure. */ struct ptr_tbl *pseen; /* Still need hseen for the 0.6 file format code. */ #endif HV *hseen; AV *hook_seen; /* which SVs were returned by STORABLE_freeze() */ AV *aseen; /* which objects have been seen, retrieve time */ ntag_t where_is_undef; /* index in aseen of PL_sv_undef */ HV *hclass; /* which classnames have been seen, store time */ AV *aclass; /* which classnames have been seen, retrieve time */ HV *hook; /* cache for hook methods per class name */ IV tagnum; /* incremented at store time for each seen object */ IV classnum; /* incremented at store time for each seen classname */ int netorder; /* true if network order used */ int s_tainted; /* true if input source is tainted, at retrieve time */ int forgive_me; /* whether to be forgiving... */ int deparse; /* whether to deparse code refs */ SV *eval; /* whether to eval source code */ int canonical; /* whether to store hashes sorted by key */ #ifndef HAS_RESTRICTED_HASHES int derestrict; /* whether to downgrade restricted hashes */ #endif #ifndef HAS_UTF8_ALL int use_bytes; /* whether to bytes-ify utf8 */ #endif int accept_future_minor; /* croak immediately on future minor versions? */ int s_dirty; /* context is dirty due to CROAK() -- can be cleaned */ int membuf_ro; /* true means membuf is read-only and msaved is rw */ struct extendable keybuf; /* for hash key retrieval */ struct extendable membuf; /* for memory store/retrieve operations */ struct extendable msaved; /* where potentially valid mbuf is saved */ PerlIO *fio; /* where I/O are performed, NULL for memory */ int ver_major; /* major of version for retrieved object */ int ver_minor; /* minor of version for retrieved object */ SV *(**retrieve_vtbl)(pTHX_ struct stcxt *, const char *); /* retrieve dispatch table */ SV *prev; /* contexts chained backwards in real recursion */ SV *my_sv; /* the blessed scalar who's SvPVX() I am */ /* recur_sv: A hashref of hashrefs or arrayref of arrayrefs is actually a chain of four SVs, eg for an array ref containing an array ref: RV -> AV (element) -> RV -> AV To make this depth appear natural from a perl level we only want to count this as two levels, so store_ref() stores it's RV into recur_sv and store_array()/store_hash() will only count that level if the AV/HV *isn't* recur_sv. We can't just have store_hash()/store_array() not count that level, since it's possible for XS code to store an AV or HV directly as an element (though perl code trying to access such an object will generally croak.) */ SV *recur_sv; /* check only one recursive SV */ int in_retrieve_overloaded; /* performance hack for retrieving overloaded objects */ int flags; /* controls whether to bless or tie objects */ IV recur_depth; /* avoid stack overflows RT #97526 */ IV max_recur_depth; /* limit for recur_depth */ IV max_recur_depth_hash; /* limit for recur_depth for hashes */ #ifdef DEBUGME int traceme; /* TRACEME() produces output */ #endif } stcxt_t; #define RECURSION_TOO_DEEP() \ (cxt->max_recur_depth != -1 && ++cxt->recur_depth > cxt->max_recur_depth) /* There's cases where we need to check whether the hash recursion limit has been reached without bumping the recursion levels, so the hash check doesn't bump the depth. */ #define RECURSION_TOO_DEEP_HASH() \ (cxt->max_recur_depth_hash != -1 && cxt->recur_depth > cxt->max_recur_depth_hash) #define MAX_DEPTH_ERROR "Max. recursion depth with nested structures exceeded" static int storable_free(pTHX_ SV *sv, MAGIC* mg); static MGVTBL vtbl_storable = { NULL, /* get */ NULL, /* set */ NULL, /* len */ NULL, /* clear */ storable_free, #ifdef MGf_COPY NULL, /* copy */ #endif #ifdef MGf_DUP NULL, /* dup */ #endif #ifdef MGf_LOCAL NULL /* local */ #endif }; /* From Digest::MD5. */ #ifndef sv_magicext # define sv_magicext(sv, obj, type, vtbl, name, namlen) \ THX_sv_magicext(aTHX_ sv, obj, type, vtbl, name, namlen) static MAGIC *THX_sv_magicext(pTHX_ SV *sv, SV *obj, int type, MGVTBL const *vtbl, char const *name, I32 namlen) { MAGIC *mg; if (obj || namlen) /* exceeded intended usage of this reserve implementation */ return NULL; Newxz(mg, 1, MAGIC); mg->mg_virtual = (MGVTBL*)vtbl; mg->mg_type = type; mg->mg_ptr = (char *)name; mg->mg_len = -1; (void) SvUPGRADE(sv, SVt_PVMG); mg->mg_moremagic = SvMAGIC(sv); SvMAGIC_set(sv, mg); SvMAGICAL_off(sv); mg_magical(sv); return mg; } #endif #define NEW_STORABLE_CXT_OBJ(cxt) \ STMT_START { \ SV *self = newSV(sizeof(stcxt_t) - 1); \ SV *my_sv = newRV_noinc(self); \ sv_magicext(self, NULL, PERL_MAGIC_ext, &vtbl_storable, NULL, 0); \ cxt = (stcxt_t *)SvPVX(self); \ Zero(cxt, 1, stcxt_t); \ cxt->my_sv = my_sv; \ } STMT_END #if defined(MULTIPLICITY) || defined(PERL_OBJECT) || defined(PERL_CAPI) #define dSTCXT_SV \ SV *perinterp_sv = *hv_fetch(PL_modglobal, \ MY_VERSION, sizeof(MY_VERSION)-1, TRUE) #define dSTCXT_PTR(T,name) \ T name = ((perinterp_sv \ && SvIOK(perinterp_sv) && SvIVX(perinterp_sv) \ ? (T)SvPVX(SvRV(INT2PTR(SV*,SvIVX(perinterp_sv)))) : (T) 0)) #define dSTCXT \ dSTCXT_SV; \ dSTCXT_PTR(stcxt_t *, cxt) #define INIT_STCXT \ dSTCXT; \ NEW_STORABLE_CXT_OBJ(cxt); \ assert(perinterp_sv); \ sv_setiv(perinterp_sv, PTR2IV(cxt->my_sv)) #define SET_STCXT(x) \ STMT_START { \ dSTCXT_SV; \ sv_setiv(perinterp_sv, PTR2IV(x->my_sv)); \ } STMT_END #else /* !MULTIPLICITY && !PERL_OBJECT && !PERL_CAPI */ static stcxt_t *Context_ptr = NULL; #define dSTCXT stcxt_t *cxt = Context_ptr #define SET_STCXT(x) Context_ptr = x #define INIT_STCXT \ dSTCXT; \ NEW_STORABLE_CXT_OBJ(cxt); \ SET_STCXT(cxt) #endif /* MULTIPLICITY || PERL_OBJECT || PERL_CAPI */ /* * KNOWN BUG: * Croaking implies a memory leak, since we don't use setjmp/longjmp * to catch the exit and free memory used during store or retrieve * operations. This is not too difficult to fix, but I need to understand * how Perl does it, and croaking is exceptional anyway, so I lack the * motivation to do it. * * The current workaround is to mark the context as dirty when croaking, * so that data structures can be freed whenever we renter Storable code * (but only *then*: it's a workaround, not a fix). * * This is also imperfect, because we don't really know how far they trapped * the croak(), and when we were recursing, we won't be able to clean anything * but the topmost context stacked. */ #define CROAK(x) STMT_START { cxt->s_dirty = 1; croak x; } STMT_END /* * End of "thread-safe" related definitions. */ /* * LOW_32BITS * * Keep only the low 32 bits of a pointer (used for tags, which are not * really pointers). */ #if PTRSIZE <= 4 #define LOW_32BITS(x) ((I32) (x)) #else #define LOW_32BITS(x) ((I32) ((STRLEN) (x) & 0xffffffffUL)) #endif /* * PTR2TAG(x) * * Convert a pointer into an ntag_t. */ #define PTR2TAG(x) ((ntag_t)(x)) #define TAG2PTR(x, type) ((y)(x)) /* * oI, oS, oC * * Hack for Crays, where sizeof(I32) == 8, and which are big-endians. * Used in the WLEN and RLEN macros. */ #if INTSIZE > 4 #define oI(x) ((I32 *) ((char *) (x) + 4)) #define oS(x) ((x) - 4) #define oL(x) (x) #define oC(x) (x = 0) #define CRAY_HACK #else #define oI(x) (x) #define oS(x) (x) #define oL(x) (x) #define oC(x) #endif /* * key buffer handling */ #define kbuf (cxt->keybuf).arena #define ksiz (cxt->keybuf).asiz #define KBUFINIT() \ STMT_START { \ if (!kbuf) { \ TRACEME(("** allocating kbuf of 128 bytes")); \ New(10003, kbuf, 128, char); \ ksiz = 128; \ } \ } STMT_END #define KBUFCHK(x) \ STMT_START { \ if (x >= ksiz) { \ if (x >= I32_MAX) \ CROAK(("Too large size > I32_MAX")); \ TRACEME(("** extending kbuf to %d bytes (had %d)", \ (int)(x+1), (int)ksiz)); \ Renew(kbuf, x+1, char); \ ksiz = x+1; \ } \ } STMT_END /* * memory buffer handling */ #define mbase (cxt->membuf).arena #define msiz (cxt->membuf).asiz #define mptr (cxt->membuf).aptr #define mend (cxt->membuf).aend #define MGROW (1 << 13) #define MMASK (MGROW - 1) #define round_mgrow(x) \ ((STRLEN) (((STRLEN) (x) + MMASK) & ~MMASK)) #define trunc_int(x) \ ((STRLEN) ((STRLEN) (x) & ~(sizeof(int)-1))) #define int_aligned(x) \ ((STRLEN)(x) == trunc_int(x)) #define MBUF_INIT(x) \ STMT_START { \ if (!mbase) { \ TRACEME(("** allocating mbase of %d bytes", MGROW)); \ New(10003, mbase, (int)MGROW, char); \ msiz = (STRLEN)MGROW; \ } \ mptr = mbase; \ if (x) \ mend = mbase + x; \ else \ mend = mbase + msiz; \ } STMT_END #define MBUF_TRUNC(x) mptr = mbase + x #define MBUF_SIZE() (mptr - mbase) /* * MBUF_SAVE_AND_LOAD * MBUF_RESTORE * * Those macros are used in do_retrieve() to save the current memory * buffer into cxt->msaved, before MBUF_LOAD() can be used to retrieve * data from a string. */ #define MBUF_SAVE_AND_LOAD(in) \ STMT_START { \ ASSERT(!cxt->membuf_ro, ("mbase not already saved")); \ cxt->membuf_ro = 1; \ TRACEME(("saving mbuf")); \ StructCopy(&cxt->membuf, &cxt->msaved, struct extendable); \ MBUF_LOAD(in); \ } STMT_END #define MBUF_RESTORE() \ STMT_START { \ ASSERT(cxt->membuf_ro, ("mbase is read-only")); \ cxt->membuf_ro = 0; \ TRACEME(("restoring mbuf")); \ StructCopy(&cxt->msaved, &cxt->membuf, struct extendable); \ } STMT_END /* * Use SvPOKp(), because SvPOK() fails on tainted scalars. * See store_scalar() for other usage of this workaround. */ #define MBUF_LOAD(v) \ STMT_START { \ ASSERT(cxt->membuf_ro, ("mbase is read-only")); \ if (!SvPOKp(v)) \ CROAK(("Not a scalar string")); \ mptr = mbase = SvPV(v, msiz); \ mend = mbase + msiz; \ } STMT_END #define MBUF_XTEND(x) \ STMT_START { \ STRLEN nsz = (STRLEN) round_mgrow((x)+msiz); \ STRLEN offset = mptr - mbase; \ ASSERT(!cxt->membuf_ro, ("mbase is not read-only")); \ TRACEME(("** extending mbase from %lu to %lu bytes (wants %lu new)", \ (unsigned long)msiz, (unsigned long)nsz, (unsigned long)(x))); \ Renew(mbase, nsz, char); \ msiz = nsz; \ mptr = mbase + offset; \ mend = mbase + nsz; \ } STMT_END #define MBUF_CHK(x) \ STMT_START { \ if ((mptr + (x)) > mend) \ MBUF_XTEND(x); \ } STMT_END #define MBUF_GETC(x) \ STMT_START { \ if (mptr < mend) \ x = (int) (unsigned char) *mptr++; \ else \ return (SV *) 0; \ } STMT_END #ifdef CRAY_HACK #define MBUF_GETINT(x) \ STMT_START { \ oC(x); \ if ((mptr + 4) <= mend) { \ memcpy(oI(&x), mptr, 4); \ mptr += 4; \ } else \ return (SV *) 0; \ } STMT_END #else #define MBUF_GETINT(x) \ STMT_START { \ if ((mptr + sizeof(int)) <= mend) { \ if (int_aligned(mptr)) \ x = *(int *) mptr; \ else \ memcpy(&x, mptr, sizeof(int)); \ mptr += sizeof(int); \ } else \ return (SV *) 0; \ } STMT_END #endif #define MBUF_READ(x,s) \ STMT_START { \ if ((mptr + (s)) <= mend) { \ memcpy(x, mptr, s); \ mptr += s; \ } else \ return (SV *) 0; \ } STMT_END #define MBUF_SAFEREAD(x,s,z) \ STMT_START { \ if ((mptr + (s)) <= mend) { \ memcpy(x, mptr, s); \ mptr += s; \ } else { \ sv_free(z); \ return (SV *) 0; \ } \ } STMT_END #define MBUF_SAFEPVREAD(x,s,z) \ STMT_START { \ if ((mptr + (s)) <= mend) { \ memcpy(x, mptr, s); \ mptr += s; \ } else { \ Safefree(z); \ return (SV *) 0; \ } \ } STMT_END #define MBUF_PUTC(c) \ STMT_START { \ if (mptr < mend) \ *mptr++ = (char) c; \ else { \ MBUF_XTEND(1); \ *mptr++ = (char) c; \ } \ } STMT_END #ifdef CRAY_HACK #define MBUF_PUTINT(i) \ STMT_START { \ MBUF_CHK(4); \ memcpy(mptr, oI(&i), 4); \ mptr += 4; \ } STMT_END #else #define MBUF_PUTINT(i) \ STMT_START { \ MBUF_CHK(sizeof(int)); \ if (int_aligned(mptr)) \ *(int *) mptr = i; \ else \ memcpy(mptr, &i, sizeof(int)); \ mptr += sizeof(int); \ } STMT_END #endif #define MBUF_PUTLONG(l) \ STMT_START { \ MBUF_CHK(8); \ memcpy(mptr, &l, 8); \ mptr += 8; \ } STMT_END #define MBUF_WRITE(x,s) \ STMT_START { \ MBUF_CHK(s); \ memcpy(mptr, x, s); \ mptr += s; \ } STMT_END /* * Possible return values for sv_type(). */ #define svis_REF 0 #define svis_SCALAR 1 #define svis_ARRAY 2 #define svis_HASH 3 #define svis_TIED 4 #define svis_TIED_ITEM 5 #define svis_CODE 6 #define svis_REGEXP 7 #define svis_OTHER 8 /* * Flags for SX_HOOK. */ #define SHF_TYPE_MASK 0x03 #define SHF_LARGE_CLASSLEN 0x04 #define SHF_LARGE_STRLEN 0x08 #define SHF_LARGE_LISTLEN 0x10 #define SHF_IDX_CLASSNAME 0x20 #define SHF_NEED_RECURSE 0x40 #define SHF_HAS_LIST 0x80 /* * Types for SX_HOOK (last 2 bits in flags). */ #define SHT_SCALAR 0 #define SHT_ARRAY 1 #define SHT_HASH 2 #define SHT_EXTRA 3 /* Read extra byte for type */ /* * The following are held in the "extra byte"... */ #define SHT_TSCALAR 4 /* 4 + 0 -- tied scalar */ #define SHT_TARRAY 5 /* 4 + 1 -- tied array */ #define SHT_THASH 6 /* 4 + 2 -- tied hash */ /* * per hash flags for flagged hashes */ #define SHV_RESTRICTED 0x01 /* * per key flags for flagged hashes */ #define SHV_K_UTF8 0x01 #define SHV_K_WASUTF8 0x02 #define SHV_K_LOCKED 0x04 #define SHV_K_ISSV 0x08 #define SHV_K_PLACEHOLDER 0x10 /* * flags to allow blessing and/or tieing data the data we load */ #define FLAG_BLESS_OK 2 #define FLAG_TIE_OK 4 /* * Flags for SX_REGEXP. */ #define SHR_U32_RE_LEN 0x01 /* * Before 0.6, the magic string was "perl-store" (binary version number 0). * * Since 0.6 introduced many binary incompatibilities, the magic string has * been changed to "pst0" to allow an old image to be properly retrieved by * a newer Storable, but ensure a newer image cannot be retrieved with an * older version. * * At 0.7, objects are given the ability to serialize themselves, and the * set of markers is extended, backward compatibility is not jeopardized, * so the binary version number could have remained unchanged. To correctly * spot errors if a file making use of 0.7-specific extensions is given to * 0.6 for retrieval, the binary version was moved to "2". And I'm introducing * a "minor" version, to better track this kind of evolution from now on. * */ static const char old_magicstr[] = "perl-store"; /* Magic number before 0.6 */ static const char magicstr[] = "pst0"; /* Used as a magic number */ #define MAGICSTR_BYTES 'p','s','t','0' #define OLDMAGICSTR_BYTES 'p','e','r','l','-','s','t','o','r','e' /* 5.6.x introduced the ability to have IVs as long long. However, Configure still defined BYTEORDER based on the size of a long. Storable uses the BYTEORDER value as part of the header, but doesn't explicitly store sizeof(IV) anywhere in the header. Hence on 5.6.x built with IV as long long on a platform that uses Configure (ie most things except VMS and Windows) headers are identical for the different IV sizes, despite the files containing some fields based on sizeof(IV) Erk. Broken-ness. 5.8 is consistent - the following redefinition kludge is only needed on 5.6.x, but the interwork is needed on 5.8 while data survives in files with the 5.6 header. */ #if defined (IVSIZE) && (IVSIZE == 8) && (LONGSIZE == 4) #ifndef NO_56_INTERWORK_KLUDGE #define USE_56_INTERWORK_KLUDGE #endif #if BYTEORDER == 0x1234 #undef BYTEORDER #define BYTEORDER 0x12345678 #else #if BYTEORDER == 0x4321 #undef BYTEORDER #define BYTEORDER 0x87654321 #endif #endif #endif #if BYTEORDER == 0x1234 #define BYTEORDER_BYTES '1','2','3','4' #else #if BYTEORDER == 0x12345678 #define BYTEORDER_BYTES '1','2','3','4','5','6','7','8' #ifdef USE_56_INTERWORK_KLUDGE #define BYTEORDER_BYTES_56 '1','2','3','4' #endif #else #if BYTEORDER == 0x87654321 #define BYTEORDER_BYTES '8','7','6','5','4','3','2','1' #ifdef USE_56_INTERWORK_KLUDGE #define BYTEORDER_BYTES_56 '4','3','2','1' #endif #else #if BYTEORDER == 0x4321 #define BYTEORDER_BYTES '4','3','2','1' #else #error Unknown byteorder. Please append your byteorder to Storable.xs #endif #endif #endif #endif #ifndef INT32_MAX # define INT32_MAX 2147483647 #endif #if IVSIZE > 4 && !defined(INT64_MAX) # define INT64_MAX 9223372036854775807LL #endif static const char byteorderstr[] = {BYTEORDER_BYTES, 0}; #ifdef USE_56_INTERWORK_KLUDGE static const char byteorderstr_56[] = {BYTEORDER_BYTES_56, 0}; #endif #define STORABLE_BIN_MAJOR 2 /* Binary major "version" */ #define STORABLE_BIN_MINOR 11 /* Binary minor "version" */ #if !defined (SvVOK) /* * Perl 5.6.0-5.8.0 can do weak references, but not vstring magic. */ #define STORABLE_BIN_WRITE_MINOR 8 #elif PERL_VERSION_GE(5,19,0) /* Perl 5.19 takes away the special meaning of PL_sv_undef in arrays. */ /* With 3.x we added LOBJECT */ #define STORABLE_BIN_WRITE_MINOR 11 #else #define STORABLE_BIN_WRITE_MINOR 9 #endif #if PERL_VERSION_LT(5,8,1) #define PL_sv_placeholder PL_sv_undef #endif /* * Useful store shortcuts... */ /* * Note that if you put more than one mark for storing a particular * type of thing, *and* in the retrieve_foo() function you mark both * the thingy's you get off with SEEN(), you *must* increase the * tagnum with cxt->tagnum++ along with this macro! * - samv 20Jan04 */ #define PUTMARK(x) \ STMT_START { \ if (!cxt->fio) \ MBUF_PUTC(x); \ else if (PerlIO_putc(cxt->fio, x) == EOF) \ return -1; \ } STMT_END #define WRITE_I32(x) \ STMT_START { \ ASSERT(sizeof(x) == sizeof(I32), ("writing an I32")); \ if (!cxt->fio) \ MBUF_PUTINT(x); \ else if (PerlIO_write(cxt->fio, oI(&x), \ oS(sizeof(x))) != oS(sizeof(x))) \ return -1; \ } STMT_END #define WRITE_U64(x) \ STMT_START { \ ASSERT(sizeof(x) == sizeof(UV), ("writing an UV")); \ if (!cxt->fio) \ MBUF_PUTLONG(x); \ else if (PerlIO_write(cxt->fio, oL(&x), \ oS(sizeof(x))) != oS(sizeof(x))) \ return -1; \ } STMT_END #ifdef HAS_HTONL #define WLEN(x) \ STMT_START { \ ASSERT(sizeof(x) == sizeof(int), ("WLEN writing an int")); \ if (cxt->netorder) { \ int y = (int) htonl(x); \ if (!cxt->fio) \ MBUF_PUTINT(y); \ else if (PerlIO_write(cxt->fio,oI(&y),oS(sizeof(y))) != oS(sizeof(y))) \ return -1; \ } else { \ if (!cxt->fio) \ MBUF_PUTINT(x); \ else if (PerlIO_write(cxt->fio,oI(&x), \ oS(sizeof(x))) != oS(sizeof(x))) \ return -1; \ } \ } STMT_END # ifdef HAS_U64 #define W64LEN(x) \ STMT_START { \ ASSERT(sizeof(x) == 8, ("W64LEN writing a U64")); \ if (cxt->netorder) { \ U32 buf[2]; \ buf[1] = htonl(x & 0xffffffffUL); \ buf[0] = htonl(x >> 32); \ if (!cxt->fio) \ MBUF_PUTLONG(buf); \ else if (PerlIO_write(cxt->fio, buf, \ sizeof(buf)) != sizeof(buf)) \ return -1; \ } else { \ if (!cxt->fio) \ MBUF_PUTLONG(x); \ else if (PerlIO_write(cxt->fio,oI(&x), \ oS(sizeof(x))) != oS(sizeof(x))) \ return -1; \ } \ } STMT_END # else #define W64LEN(x) CROAK(("No 64bit UVs")) # endif #else #define WLEN(x) WRITE_I32(x) #ifdef HAS_U64 #define W64LEN(x) WRITE_U64(x) #else #define W64LEN(x) CROAK(("no 64bit UVs")) #endif #endif #define WRITE(x,y) \ STMT_START { \ if (!cxt->fio) \ MBUF_WRITE(x,y); \ else if (PerlIO_write(cxt->fio, x, y) != (SSize_t)y) \ return -1; \ } STMT_END #define STORE_PV_LEN(pv, len, small, large) \ STMT_START { \ if (len <= LG_SCALAR) { \ int ilen = (int) len; \ unsigned char clen = (unsigned char) len; \ PUTMARK(small); \ PUTMARK(clen); \ if (len) \ WRITE(pv, ilen); \ } else if (sizeof(len) > 4 && len > INT32_MAX) { \ PUTMARK(SX_LOBJECT); \ PUTMARK(large); \ W64LEN(len); \ WRITE(pv, len); \ } else { \ int ilen = (int) len; \ PUTMARK(large); \ WLEN(ilen); \ WRITE(pv, ilen); \ } \ } STMT_END #define STORE_SCALAR(pv, len) STORE_PV_LEN(pv, len, SX_SCALAR, SX_LSCALAR) /* * Store &PL_sv_undef in arrays without recursing through store(). We * actually use this to represent nonexistent elements, for historical * reasons. */ #define STORE_SV_UNDEF() \ STMT_START { \ cxt->tagnum++; \ PUTMARK(SX_SV_UNDEF); \ } STMT_END /* * Useful retrieve shortcuts... */ #define GETCHAR() \ (cxt->fio ? PerlIO_getc(cxt->fio) \ : (mptr >= mend ? EOF : (int) *mptr++)) #define GETMARK(x) \ STMT_START { \ if (!cxt->fio) \ MBUF_GETC(x); \ else if ((int) (x = PerlIO_getc(cxt->fio)) == EOF) \ return (SV *) 0; \ } STMT_END #define READ_I32(x) \ STMT_START { \ ASSERT(sizeof(x) == sizeof(I32), ("reading an I32")); \ oC(x); \ if (!cxt->fio) \ MBUF_GETINT(x); \ else if (PerlIO_read(cxt->fio, oI(&x), \ oS(sizeof(x))) != oS(sizeof(x))) \ return (SV *) 0; \ } STMT_END #ifdef HAS_NTOHL #define RLEN(x) \ STMT_START { \ oC(x); \ if (!cxt->fio) \ MBUF_GETINT(x); \ else if (PerlIO_read(cxt->fio, oI(&x), \ oS(sizeof(x))) != oS(sizeof(x))) \ return (SV *) 0; \ if (cxt->netorder) \ x = (int) ntohl(x); \ } STMT_END #else #define RLEN(x) READ_I32(x) #endif #define READ(x,y) \ STMT_START { \ if (!cxt->fio) \ MBUF_READ(x, y); \ else if (PerlIO_read(cxt->fio, x, y) != (SSize_t)y) \ return (SV *) 0; \ } STMT_END #define SAFEREAD(x,y,z) \ STMT_START { \ if (!cxt->fio) \ MBUF_SAFEREAD(x,y,z); \ else if (PerlIO_read(cxt->fio, x, y) != (SSize_t)y) { \ sv_free(z); \ return (SV *) 0; \ } \ } STMT_END #define SAFEPVREAD(x,y,z) \ STMT_START { \ if (!cxt->fio) \ MBUF_SAFEPVREAD(x,y,z); \ else if (PerlIO_read(cxt->fio, x, y) != y) { \ Safefree(z); \ return (SV *) 0; \ } \ } STMT_END #ifdef HAS_U64 # if defined(HAS_NTOHL) # define Sntohl(x) ntohl(x) # elif BYTEORDER == 0x87654321 || BYTEORDER == 0x4321 # define Sntohl(x) (x) # else static U32 Sntohl(U32 x) { return (((U8) x) << 24) + ((x & 0xFF00) << 8) + ((x & 0xFF0000) >> 8) + ((x & 0xFF000000) >> 24); } # endif # define READ_U64(x) \ STMT_START { \ ASSERT(sizeof(x) == 8, ("R64LEN reading a U64")); \ if (cxt->netorder) { \ U32 buf[2]; \ READ((void *)buf, sizeof(buf)); \ (x) = ((UV)Sntohl(buf[0]) << 32) + Sntohl(buf[1]); \ } \ else { \ READ(&(x), sizeof(x)); \ } \ } STMT_END #endif /* * SEEN() is used at retrieve time, to remember where object 'y', bearing a * given tag 'tagnum', has been retrieved. Next time we see an SX_OBJECT marker, * we'll therefore know where it has been retrieved and will be able to * share the same reference, as in the original stored memory image. * * We also need to bless objects ASAP for hooks (which may compute "ref $x" * on the objects given to STORABLE_thaw and expect that to be defined), and * also for overloaded objects (for which we might not find the stash if the * object is not blessed yet--this might occur for overloaded objects that * refer to themselves indirectly: if we blessed upon return from a sub * retrieve(), the SX_OBJECT marker we'd found could not have overloading * restored on it because the underlying object would not be blessed yet!). * * To achieve that, the class name of the last retrieved object is passed down * recursively, and the first SEEN() call for which the class name is not NULL * will bless the object. * * i should be true iff sv is immortal (ie PL_sv_yes, PL_sv_no or PL_sv_undef) * * SEEN0() is a short-cut where stash is always NULL. * * The _NN variants dont check for y being null */ #define SEEN0_NN(y,i) \ STMT_START { \ if (av_store(cxt->aseen, cxt->tagnum++, i ? (SV*)(y) \ : SvREFCNT_inc(y)) == 0) \ return (SV *) 0; \ TRACEME(("aseen(#%d) = 0x%" UVxf " (refcnt=%d)", \ (int)cxt->tagnum-1, \ PTR2UV(y), (int)SvREFCNT(y)-1)); \ } STMT_END #define SEEN0(y,i) \ STMT_START { \ if (!y) \ return (SV *) 0; \ SEEN0_NN(y,i); \ } STMT_END #define SEEN_NN(y,stash,i) \ STMT_START { \ SEEN0_NN(y,i); \ if (stash) \ BLESS((SV *)(y), (HV *)(stash)); \ } STMT_END #define SEEN(y,stash,i) \ STMT_START { \ if (!y) \ return (SV *) 0; \ SEEN_NN(y,stash, i); \ } STMT_END /* * Bless 's' in 'p', via a temporary reference, required by sv_bless(). * "A" magic is added before the sv_bless for overloaded classes, this avoids * an expensive call to S_reset_amagic in sv_bless. */ #define BLESS(s,stash) \ STMT_START { \ SV *ref; \ if (cxt->flags & FLAG_BLESS_OK) { \ TRACEME(("blessing 0x%" UVxf " in %s", PTR2UV(s), \ HvNAME_get(stash))); \ ref = newRV_noinc(s); \ if (cxt->in_retrieve_overloaded && Gv_AMG(stash)) { \ cxt->in_retrieve_overloaded = 0; \ SvAMAGIC_on(ref); \ } \ (void) sv_bless(ref, stash); \ SvRV_set(ref, NULL); \ SvREFCNT_dec(ref); \ } \ else { \ TRACEME(("not blessing 0x%" UVxf " in %s", PTR2UV(s), \ (HvNAME_get(stash)))); \ } \ } STMT_END /* * sort (used in store_hash) - conditionally use qsort when * sortsv is not available ( <= 5.6.1 ). */ #if PERL_VERSION_LT(5,7,0) #if defined(USE_ITHREADS) #define STORE_HASH_SORT \ ENTER; { \ PerlInterpreter *orig_perl = PERL_GET_CONTEXT; \ SAVESPTR(orig_perl); \ PERL_SET_CONTEXT(aTHX); \ qsort((char *) AvARRAY(av), len, sizeof(SV *), sortcmp);\ } LEAVE; #else /* ! USE_ITHREADS */ #define STORE_HASH_SORT \ qsort((char *) AvARRAY(av), len, sizeof(SV *), sortcmp); #endif /* USE_ITHREADS */ #else /* PERL >= 5.7.0 */ #define STORE_HASH_SORT \ sortsv(AvARRAY(av), len, Perl_sv_cmp); #endif /* PERL_VERSION_LT(5,7,0) */ static int store(pTHX_ stcxt_t *cxt, SV *sv); static SV *retrieve(pTHX_ stcxt_t *cxt, const char *cname); #define UNSEE() \ STMT_START { \ av_pop(cxt->aseen); \ cxt->tagnum--; \ } STMT_END /* * Dynamic dispatching table for SV store. */ static int store_ref(pTHX_ stcxt_t *cxt, SV *sv); static int store_scalar(pTHX_ stcxt_t *cxt, SV *sv); static int store_array(pTHX_ stcxt_t *cxt, AV *av); static int store_hash(pTHX_ stcxt_t *cxt, HV *hv); static int store_tied(pTHX_ stcxt_t *cxt, SV *sv); static int store_tied_item(pTHX_ stcxt_t *cxt, SV *sv); static int store_code(pTHX_ stcxt_t *cxt, CV *cv); static int store_regexp(pTHX_ stcxt_t *cxt, SV *sv); static int store_other(pTHX_ stcxt_t *cxt, SV *sv); static int store_blessed(pTHX_ stcxt_t *cxt, SV *sv, int type, HV *pkg); typedef int (*sv_store_t)(pTHX_ stcxt_t *cxt, SV *sv); static const sv_store_t sv_store[] = { (sv_store_t)store_ref, /* svis_REF */ (sv_store_t)store_scalar, /* svis_SCALAR */ (sv_store_t)store_array, /* svis_ARRAY */ (sv_store_t)store_hash, /* svis_HASH */ (sv_store_t)store_tied, /* svis_TIED */ (sv_store_t)store_tied_item,/* svis_TIED_ITEM */ (sv_store_t)store_code, /* svis_CODE */ (sv_store_t)store_regexp, /* svis_REGEXP */ (sv_store_t)store_other, /* svis_OTHER */ }; #define SV_STORE(x) (*sv_store[x]) /* * Dynamic dispatching tables for SV retrieval. */ static SV *retrieve_lscalar(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_lutf8str(pTHX_ stcxt_t *cxt, const char *cname); static SV *old_retrieve_array(pTHX_ stcxt_t *cxt, const char *cname); static SV *old_retrieve_hash(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_ref(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_undef(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_integer(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_double(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_byte(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_netint(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_scalar(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_utf8str(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_tied_array(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_tied_hash(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_tied_scalar(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_other(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_lobject(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_regexp(pTHX_ stcxt_t *cxt, const char *cname); /* helpers for U64 lobjects */ static SV *get_lstring(pTHX_ stcxt_t *cxt, UV len, int isutf8, const char *cname); #ifdef HAS_U64 static SV *get_larray(pTHX_ stcxt_t *cxt, UV len, const char *cname); static SV *get_lhash(pTHX_ stcxt_t *cxt, UV len, int hash_flags, const char *cname); static int store_lhash(pTHX_ stcxt_t *cxt, HV *hv, unsigned char hash_flags); #endif static int store_hentry(pTHX_ stcxt_t *cxt, HV* hv, UV i, HEK *hek, SV *val, unsigned char hash_flags); typedef SV* (*sv_retrieve_t)(pTHX_ stcxt_t *cxt, const char *name); static const sv_retrieve_t sv_old_retrieve[] = { 0, /* SX_OBJECT -- entry unused dynamically */ (sv_retrieve_t)retrieve_lscalar, /* SX_LSCALAR */ (sv_retrieve_t)old_retrieve_array, /* SX_ARRAY -- for pre-0.6 binaries */ (sv_retrieve_t)old_retrieve_hash, /* SX_HASH -- for pre-0.6 binaries */ (sv_retrieve_t)retrieve_ref, /* SX_REF */ (sv_retrieve_t)retrieve_undef, /* SX_UNDEF */ (sv_retrieve_t)retrieve_integer, /* SX_INTEGER */ (sv_retrieve_t)retrieve_double, /* SX_DOUBLE */ (sv_retrieve_t)retrieve_byte, /* SX_BYTE */ (sv_retrieve_t)retrieve_netint, /* SX_NETINT */ (sv_retrieve_t)retrieve_scalar, /* SX_SCALAR */ (sv_retrieve_t)retrieve_tied_array, /* SX_TIED_ARRAY */ (sv_retrieve_t)retrieve_tied_hash, /* SX_TIED_HASH */ (sv_retrieve_t)retrieve_tied_scalar,/* SX_TIED_SCALAR */ (sv_retrieve_t)retrieve_other, /* SX_SV_UNDEF not supported */ (sv_retrieve_t)retrieve_other, /* SX_SV_YES not supported */ (sv_retrieve_t)retrieve_other, /* SX_SV_NO not supported */ (sv_retrieve_t)retrieve_other, /* SX_BLESS not supported */ (sv_retrieve_t)retrieve_other, /* SX_IX_BLESS not supported */ (sv_retrieve_t)retrieve_other, /* SX_HOOK not supported */ (sv_retrieve_t)retrieve_other, /* SX_OVERLOADED not supported */ (sv_retrieve_t)retrieve_other, /* SX_TIED_KEY not supported */ (sv_retrieve_t)retrieve_other, /* SX_TIED_IDX not supported */ (sv_retrieve_t)retrieve_other, /* SX_UTF8STR not supported */ (sv_retrieve_t)retrieve_other, /* SX_LUTF8STR not supported */ (sv_retrieve_t)retrieve_other, /* SX_FLAG_HASH not supported */ (sv_retrieve_t)retrieve_other, /* SX_CODE not supported */ (sv_retrieve_t)retrieve_other, /* SX_WEAKREF not supported */ (sv_retrieve_t)retrieve_other, /* SX_WEAKOVERLOAD not supported */ (sv_retrieve_t)retrieve_other, /* SX_VSTRING not supported */ (sv_retrieve_t)retrieve_other, /* SX_LVSTRING not supported */ (sv_retrieve_t)retrieve_other, /* SX_SVUNDEF_ELEM not supported */ (sv_retrieve_t)retrieve_other, /* SX_REGEXP */ (sv_retrieve_t)retrieve_other, /* SX_LOBJECT not supported */ (sv_retrieve_t)retrieve_other, /* SX_LAST */ }; static SV *retrieve_hook_common(pTHX_ stcxt_t *cxt, const char *cname, int large); static SV *retrieve_array(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_hash(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_sv_undef(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_sv_yes(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_sv_no(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_blessed(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_idx_blessed(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_hook(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_overloaded(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_tied_key(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_tied_idx(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_flag_hash(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_code(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_weakref(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_weakoverloaded(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_vstring(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_lvstring(pTHX_ stcxt_t *cxt, const char *cname); static SV *retrieve_svundef_elem(pTHX_ stcxt_t *cxt, const char *cname); static const sv_retrieve_t sv_retrieve[] = { 0, /* SX_OBJECT -- entry unused dynamically */ (sv_retrieve_t)retrieve_lscalar, /* SX_LSCALAR */ (sv_retrieve_t)retrieve_array, /* SX_ARRAY */ (sv_retrieve_t)retrieve_hash, /* SX_HASH */ (sv_retrieve_t)retrieve_ref, /* SX_REF */ (sv_retrieve_t)retrieve_undef, /* SX_UNDEF */ (sv_retrieve_t)retrieve_integer, /* SX_INTEGER */ (sv_retrieve_t)retrieve_double, /* SX_DOUBLE */ (sv_retrieve_t)retrieve_byte, /* SX_BYTE */ (sv_retrieve_t)retrieve_netint, /* SX_NETINT */ (sv_retrieve_t)retrieve_scalar, /* SX_SCALAR */ (sv_retrieve_t)retrieve_tied_array, /* SX_TIED_ARRAY */ (sv_retrieve_t)retrieve_tied_hash, /* SX_TIED_HASH */ (sv_retrieve_t)retrieve_tied_scalar,/* SX_TIED_SCALAR */ (sv_retrieve_t)retrieve_sv_undef, /* SX_SV_UNDEF */ (sv_retrieve_t)retrieve_sv_yes, /* SX_SV_YES */ (sv_retrieve_t)retrieve_sv_no, /* SX_SV_NO */ (sv_retrieve_t)retrieve_blessed, /* SX_BLESS */ (sv_retrieve_t)retrieve_idx_blessed,/* SX_IX_BLESS */ (sv_retrieve_t)retrieve_hook, /* SX_HOOK */ (sv_retrieve_t)retrieve_overloaded, /* SX_OVERLOAD */ (sv_retrieve_t)retrieve_tied_key, /* SX_TIED_KEY */ (sv_retrieve_t)retrieve_tied_idx, /* SX_TIED_IDX */ (sv_retrieve_t)retrieve_utf8str, /* SX_UTF8STR */ (sv_retrieve_t)retrieve_lutf8str, /* SX_LUTF8STR */ (sv_retrieve_t)retrieve_flag_hash, /* SX_HASH */ (sv_retrieve_t)retrieve_code, /* SX_CODE */ (sv_retrieve_t)retrieve_weakref, /* SX_WEAKREF */ (sv_retrieve_t)retrieve_weakoverloaded,/* SX_WEAKOVERLOAD */ (sv_retrieve_t)retrieve_vstring, /* SX_VSTRING */ (sv_retrieve_t)retrieve_lvstring, /* SX_LVSTRING */ (sv_retrieve_t)retrieve_svundef_elem,/* SX_SVUNDEF_ELEM */ (sv_retrieve_t)retrieve_regexp, /* SX_REGEXP */ (sv_retrieve_t)retrieve_lobject, /* SX_LOBJECT */ (sv_retrieve_t)retrieve_other, /* SX_LAST */ }; #define RETRIEVE(c,x) ((x) >= SX_LAST ? retrieve_other : *(c)->retrieve_vtbl[x]) static SV *mbuf2sv(pTHX); /*** *** Context management. ***/ /* * init_perinterp * * Called once per "thread" (interpreter) to initialize some global context. */ static void init_perinterp(pTHX) { INIT_STCXT; INIT_TRACEME; cxt->netorder = 0; /* true if network order used */ cxt->forgive_me = -1; /* whether to be forgiving... */ cxt->accept_future_minor = -1; /* would otherwise occur too late */ } /* * reset_context * * Called at the end of every context cleaning, to perform common reset * operations. */ static void reset_context(stcxt_t *cxt) { cxt->entry = 0; cxt->s_dirty = 0; cxt->recur_sv = NULL; cxt->recur_depth = 0; cxt->optype &= ~(ST_STORE|ST_RETRIEVE); /* Leave ST_CLONE alone */ } /* * init_store_context * * Initialize a new store context for real recursion. */ static void init_store_context(pTHX_ stcxt_t *cxt, PerlIO *f, int optype, int network_order) { INIT_TRACEME; TRACEME(("init_store_context")); cxt->netorder = network_order; cxt->forgive_me = -1; /* Fetched from perl if needed */ cxt->deparse = -1; /* Idem */ cxt->eval = NULL; /* Idem */ cxt->canonical = -1; /* Idem */ cxt->tagnum = -1; /* Reset tag numbers */ cxt->classnum = -1; /* Reset class numbers */ cxt->fio = f; /* Where I/O are performed */ cxt->optype = optype; /* A store, or a deep clone */ cxt->entry = 1; /* No recursion yet */ /* * The 'hseen' table is used to keep track of each SV stored and their * associated tag numbers is special. It is "abused" because the * values stored are not real SV, just integers cast to (SV *), * which explains the freeing below. * * It is also one possible bottleneck to achieve good storing speed, * so the "shared keys" optimization is turned off (unlikely to be * of any use here), and the hash table is "pre-extended". Together, * those optimizations increase the throughput by 12%. */ #ifdef USE_PTR_TABLE cxt->pseen = ptr_table_new(); cxt->hseen = 0; #else cxt->hseen = newHV(); /* Table where seen objects are stored */ HvSHAREKEYS_off(cxt->hseen); #endif /* * The following does not work well with perl5.004_04, and causes * a core dump later on, in a completely unrelated spot, which * makes me think there is a memory corruption going on. * * Calling hv_ksplit(hseen, HBUCKETS) instead of manually hacking * it below does not make any difference. It seems to work fine * with perl5.004_68 but given the probable nature of the bug, * that does not prove anything. * * It's a shame because increasing the amount of buckets raises * store() throughput by 5%, but until I figure this out, I can't * allow for this to go into production. * * It is reported fixed in 5.005, hence the #if. */ #define HBUCKETS 4096 /* Buckets for %hseen */ #ifndef USE_PTR_TABLE HvMAX(cxt->hseen) = HBUCKETS - 1; /* keys %hseen = $HBUCKETS; */ #endif /* * The 'hclass' hash uses the same settings as 'hseen' above, but it is * used to assign sequential tags (numbers) to class names for blessed * objects. * * We turn the shared key optimization on. */ cxt->hclass = newHV(); /* Where seen classnames are stored */ HvMAX(cxt->hclass) = HBUCKETS - 1; /* keys %hclass = $HBUCKETS; */ /* * The 'hook' hash table is used to keep track of the references on * the STORABLE_freeze hook routines, when found in some class name. * * It is assumed that the inheritance tree will not be changed during * storing, and that no new method will be dynamically created by the * hooks. */ cxt->hook = newHV(); /* Table where hooks are cached */ /* * The 'hook_seen' array keeps track of all the SVs returned by * STORABLE_freeze hooks for us to serialize, so that they are not * reclaimed until the end of the serialization process. Each SV is * only stored once, the first time it is seen. */ cxt->hook_seen = newAV(); /* Lists SVs returned by STORABLE_freeze */ cxt->max_recur_depth = SvIV(get_sv("Storable::recursion_limit", GV_ADD)); cxt->max_recur_depth_hash = SvIV(get_sv("Storable::recursion_limit_hash", GV_ADD)); } /* * clean_store_context * * Clean store context by */ static void clean_store_context(pTHX_ stcxt_t *cxt) { HE *he; TRACEMED(("clean_store_context")); ASSERT(cxt->optype & ST_STORE, ("was performing a store()")); /* * Insert real values into hashes where we stored faked pointers. */ #ifndef USE_PTR_TABLE if (cxt->hseen) { hv_iterinit(cxt->hseen); while ((he = hv_iternext(cxt->hseen))) /* Extra () for -Wall */ HeVAL(he) = &PL_sv_undef; } #endif if (cxt->hclass) { hv_iterinit(cxt->hclass); while ((he = hv_iternext(cxt->hclass))) /* Extra () for -Wall */ HeVAL(he) = &PL_sv_undef; } /* * And now dispose of them... * * The surrounding if() protection has been added because there might be * some cases where this routine is called more than once, during * exceptional events. This was reported by Marc Lehmann when Storable * is executed from mod_perl, and the fix was suggested by him. * -- RAM, 20/12/2000 */ #ifdef USE_PTR_TABLE if (cxt->pseen) { struct ptr_tbl *pseen = cxt->pseen; cxt->pseen = 0; ptr_table_free(pseen); } assert(!cxt->hseen); #else if (cxt->hseen) { HV *hseen = cxt->hseen; cxt->hseen = 0; hv_undef(hseen); sv_free((SV *) hseen); } #endif if (cxt->hclass) { HV *hclass = cxt->hclass; cxt->hclass = 0; hv_undef(hclass); sv_free((SV *) hclass); } if (cxt->hook) { HV *hook = cxt->hook; cxt->hook = 0; hv_undef(hook); sv_free((SV *) hook); } if (cxt->hook_seen) { AV *hook_seen = cxt->hook_seen; cxt->hook_seen = 0; av_undef(hook_seen); sv_free((SV *) hook_seen); } cxt->forgive_me = -1; /* Fetched from perl if needed */ cxt->deparse = -1; /* Idem */ if (cxt->eval) { SvREFCNT_dec(cxt->eval); } cxt->eval = NULL; /* Idem */ cxt->canonical = -1; /* Idem */ reset_context(cxt); } /* * init_retrieve_context * * Initialize a new retrieve context for real recursion. */ static void init_retrieve_context(pTHX_ stcxt_t *cxt, int optype, int is_tainted) { INIT_TRACEME; TRACEME(("init_retrieve_context")); /* * The hook hash table is used to keep track of the references on * the STORABLE_thaw hook routines, when found in some class name. * * It is assumed that the inheritance tree will not be changed during * storing, and that no new method will be dynamically created by the * hooks. */ cxt->hook = newHV(); /* Caches STORABLE_thaw */ #ifdef USE_PTR_TABLE cxt->pseen = 0; #endif /* * If retrieving an old binary version, the cxt->retrieve_vtbl variable * was set to sv_old_retrieve. We'll need a hash table to keep track of * the correspondence between the tags and the tag number used by the * new retrieve routines. */ cxt->hseen = (((void*)cxt->retrieve_vtbl == (void*)sv_old_retrieve) ? newHV() : 0); cxt->aseen = newAV(); /* Where retrieved objects are kept */ cxt->where_is_undef = UNSET_NTAG_T; /* Special case for PL_sv_undef */ cxt->aclass = newAV(); /* Where seen classnames are kept */ cxt->tagnum = 0; /* Have to count objects... */ cxt->classnum = 0; /* ...and class names as well */ cxt->optype = optype; cxt->s_tainted = is_tainted; cxt->entry = 1; /* No recursion yet */ #ifndef HAS_RESTRICTED_HASHES cxt->derestrict = -1; /* Fetched from perl if needed */ #endif #ifndef HAS_UTF8_ALL cxt->use_bytes = -1; /* Fetched from perl if needed */ #endif cxt->accept_future_minor = -1;/* Fetched from perl if needed */ cxt->in_retrieve_overloaded = 0; cxt->max_recur_depth = SvIV(get_sv("Storable::recursion_limit", GV_ADD)); cxt->max_recur_depth_hash = SvIV(get_sv("Storable::recursion_limit_hash", GV_ADD)); } /* * clean_retrieve_context * * Clean retrieve context by */ static void clean_retrieve_context(pTHX_ stcxt_t *cxt) { TRACEMED(("clean_retrieve_context")); ASSERT(cxt->optype & ST_RETRIEVE, ("was performing a retrieve()")); if (cxt->aseen) { AV *aseen = cxt->aseen; cxt->aseen = 0; av_undef(aseen); sv_free((SV *) aseen); } cxt->where_is_undef = UNSET_NTAG_T; if (cxt->aclass) { AV *aclass = cxt->aclass; cxt->aclass = 0; av_undef(aclass); sv_free((SV *) aclass); } if (cxt->hook) { HV *hook = cxt->hook; cxt->hook = 0; hv_undef(hook); sv_free((SV *) hook); } if (cxt->hseen) { HV *hseen = cxt->hseen; cxt->hseen = 0; hv_undef(hseen); sv_free((SV *) hseen); /* optional HV, for backward compat. */ } #ifndef HAS_RESTRICTED_HASHES cxt->derestrict = -1; /* Fetched from perl if needed */ #endif #ifndef HAS_UTF8_ALL cxt->use_bytes = -1; /* Fetched from perl if needed */ #endif cxt->accept_future_minor = -1; /* Fetched from perl if needed */ cxt->in_retrieve_overloaded = 0; reset_context(cxt); } /* * clean_context * * A workaround for the CROAK bug: cleanup the last context. */ static void clean_context(pTHX_ stcxt_t *cxt) { TRACEMED(("clean_context")); ASSERT(cxt->s_dirty, ("dirty context")); if (cxt->membuf_ro) MBUF_RESTORE(); ASSERT(!cxt->membuf_ro, ("mbase is not read-only")); if (cxt->optype & ST_RETRIEVE) clean_retrieve_context(aTHX_ cxt); else if (cxt->optype & ST_STORE) clean_store_context(aTHX_ cxt); else reset_context(cxt); ASSERT(!cxt->s_dirty, ("context is clean")); ASSERT(cxt->entry == 0, ("context is reset")); } /* * allocate_context * * Allocate a new context and push it on top of the parent one. * This new context is made globally visible via SET_STCXT(). */ static stcxt_t *allocate_context(pTHX_ stcxt_t *parent_cxt) { stcxt_t *cxt; ASSERT(!parent_cxt->s_dirty, ("parent context clean")); NEW_STORABLE_CXT_OBJ(cxt); TRACEMED(("allocate_context")); cxt->prev = parent_cxt->my_sv; SET_STCXT(cxt); ASSERT(!cxt->s_dirty, ("clean context")); return cxt; } /* * free_context * * Free current context, which cannot be the "root" one. * Make the context underneath globally visible via SET_STCXT(). */ static void free_context(pTHX_ stcxt_t *cxt) { stcxt_t *prev = (stcxt_t *)(cxt->prev ? SvPVX(SvRV(cxt->prev)) : 0); TRACEMED(("free_context")); ASSERT(!cxt->s_dirty, ("clean context")); ASSERT(prev, ("not freeing root context")); assert(prev); SvREFCNT_dec(cxt->my_sv); SET_STCXT(prev); ASSERT(cxt, ("context not void")); } /*** *** Predicates. ***/ /* these two functions are currently only used within asserts */ #ifdef DASSERT /* * is_storing * * Tells whether we're in the middle of a store operation. */ static int is_storing(pTHX) { dSTCXT; return cxt->entry && (cxt->optype & ST_STORE); } /* * is_retrieving * * Tells whether we're in the middle of a retrieve operation. */ static int is_retrieving(pTHX) { dSTCXT; return cxt->entry && (cxt->optype & ST_RETRIEVE); } #endif /* * last_op_in_netorder * * Returns whether last operation was made using network order. * * This is typically out-of-band information that might prove useful * to people wishing to convert native to network order data when used. */ static int last_op_in_netorder(pTHX) { dSTCXT; assert(cxt); return cxt->netorder; } /*** *** Hook lookup and calling routines. ***/ /* * pkg_fetchmeth * * A wrapper on gv_fetchmethod_autoload() which caches results. * * Returns the routine reference as an SV*, or null if neither the package * nor its ancestors know about the method. */ static SV *pkg_fetchmeth(pTHX_ HV *cache, HV *pkg, const char *method) { GV *gv; SV *sv; const char *hvname = HvNAME_get(pkg); #ifdef DEBUGME dSTCXT; #endif /* * The following code is the same as the one performed by UNIVERSAL::can * in the Perl core. */ gv = gv_fetchmethod_autoload(pkg, method, FALSE); if (gv && isGV(gv)) { sv = newRV_inc((SV*) GvCV(gv)); TRACEME(("%s->%s: 0x%" UVxf, hvname, method, PTR2UV(sv))); } else { sv = newSVsv(&PL_sv_undef); TRACEME(("%s->%s: not found", hvname, method)); } /* * Cache the result, ignoring failure: if we can't store the value, * it just won't be cached. */ (void) hv_store(cache, hvname, strlen(hvname), sv, 0); return SvOK(sv) ? sv : (SV *) 0; } /* * pkg_hide * * Force cached value to be undef: hook ignored even if present. */ static void pkg_hide(pTHX_ HV *cache, HV *pkg, const char *method) { const char *hvname = HvNAME_get(pkg); PERL_UNUSED_ARG(method); (void) hv_store(cache, hvname, strlen(hvname), newSVsv(&PL_sv_undef), 0); } /* * pkg_uncache * * Discard cached value: a whole fetch loop will be retried at next lookup. */ static void pkg_uncache(pTHX_ HV *cache, HV *pkg, const char *method) { const char *hvname = HvNAME_get(pkg); PERL_UNUSED_ARG(method); (void) hv_delete(cache, hvname, strlen(hvname), G_DISCARD); } /* * pkg_can * * Our own "UNIVERSAL::can", which caches results. * * Returns the routine reference as an SV*, or null if the object does not * know about the method. */ static SV *pkg_can(pTHX_ HV *cache, HV *pkg, const char *method) { SV **svh; SV *sv; const char *hvname = HvNAME_get(pkg); #ifdef DEBUGME dSTCXT; #endif TRACEME(("pkg_can for %s->%s", hvname, method)); /* * Look into the cache to see whether we already have determined * where the routine was, if any. * * NOTA BENE: we don't use 'method' at all in our lookup, since we know * that only one hook (i.e. always the same) is cached in a given cache. */ svh = hv_fetch(cache, hvname, strlen(hvname), FALSE); if (svh) { sv = *svh; if (!SvOK(sv)) { TRACEME(("cached %s->%s: not found", hvname, method)); return (SV *) 0; } else { TRACEME(("cached %s->%s: 0x%" UVxf, hvname, method, PTR2UV(sv))); return sv; } } TRACEME(("not cached yet")); return pkg_fetchmeth(aTHX_ cache, pkg, method); /* Fetch and cache */ } /* * scalar_call * * Call routine as obj->hook(av) in scalar context. * Propagates the single returned value if not called in void context. */ static SV *scalar_call(pTHX_ SV *obj, SV *hook, int cloning, AV *av, I32 flags) { dSP; int count; SV *sv = 0; #ifdef DEBUGME dSTCXT; #endif TRACEME(("scalar_call (cloning=%d)", cloning)); ENTER; SAVETMPS; PUSHMARK(sp); XPUSHs(obj); XPUSHs(sv_2mortal(newSViv(cloning))); /* Cloning flag */ if (av) { SV **ary = AvARRAY(av); SSize_t cnt = AvFILLp(av) + 1; SSize_t i; XPUSHs(ary[0]); /* Frozen string */ for (i = 1; i < cnt; i++) { TRACEME(("pushing arg #%d (0x%" UVxf ")...", (int)i, PTR2UV(ary[i]))); XPUSHs(sv_2mortal(newRV_inc(ary[i]))); } } PUTBACK; TRACEME(("calling...")); count = call_sv(hook, flags); /* Go back to Perl code */ TRACEME(("count = %d", count)); SPAGAIN; if (count) { sv = POPs; SvREFCNT_inc(sv); /* We're returning it, must stay alive! */ } PUTBACK; FREETMPS; LEAVE; return sv; } /* * array_call * * Call routine obj->hook(cloning) in list context. * Returns the list of returned values in an array. */ static AV *array_call(pTHX_ SV *obj, SV *hook, int cloning) { dSP; int count; AV *av; int i; #ifdef DEBUGME dSTCXT; #endif TRACEME(("array_call (cloning=%d)", cloning)); ENTER; SAVETMPS; PUSHMARK(sp); XPUSHs(obj); /* Target object */ XPUSHs(sv_2mortal(newSViv(cloning))); /* Cloning flag */ PUTBACK; count = call_sv(hook, G_ARRAY); /* Go back to Perl code */ SPAGAIN; av = newAV(); for (i = count - 1; i >= 0; i--) { SV *sv = POPs; av_store(av, i, SvREFCNT_inc(sv)); } PUTBACK; FREETMPS; LEAVE; return av; } #if PERL_VERSION_LT(5,15,0) static void cleanup_recursive_av(pTHX_ AV* av) { SSize_t i = AvFILLp(av); SV** arr = AvARRAY(av); if (SvMAGICAL(av)) return; while (i >= 0) { if (arr[i]) { #if PERL_VERSION_LT(5,14,0) arr[i] = NULL; #else SvREFCNT_dec(arr[i]); #endif } i--; } } #ifndef SvREFCNT_IMMORTAL #ifdef DEBUGGING /* exercise the immortal resurrection code in sv_free2() */ # define SvREFCNT_IMMORTAL 1000 #else # define SvREFCNT_IMMORTAL ((~(U32)0)/2) #endif #endif static void cleanup_recursive_hv(pTHX_ HV* hv) { SSize_t i = HvTOTALKEYS(hv); HE** arr = HvARRAY(hv); if (SvMAGICAL(hv)) return; while (i >= 0) { if (arr[i]) { SvREFCNT(HeVAL(arr[i])) = SvREFCNT_IMMORTAL; arr[i] = NULL; /* let it leak. too dangerous to clean it up here */ } i--; } #if PERL_VERSION_LT(5,8,0) ((XPVHV*)SvANY(hv))->xhv_array = NULL; #else HvARRAY(hv) = NULL; #endif HvTOTALKEYS(hv) = 0; } static void cleanup_recursive_rv(pTHX_ SV* sv) { if (sv && SvROK(sv)) SvREFCNT_dec(SvRV(sv)); } static void cleanup_recursive_data(pTHX_ SV* sv) { if (SvTYPE(sv) == SVt_PVAV) { cleanup_recursive_av(aTHX_ (AV*)sv); } else if (SvTYPE(sv) == SVt_PVHV) { cleanup_recursive_hv(aTHX_ (HV*)sv); } else { cleanup_recursive_rv(aTHX_ sv); } } #endif /* * known_class * * Lookup the class name in the 'hclass' table and either assign it a new ID * or return the existing one, by filling in 'classnum'. * * Return true if the class was known, false if the ID was just generated. */ static int known_class(pTHX_ stcxt_t *cxt, char *name, /* Class name */ int len, /* Name length */ I32 *classnum) { SV **svh; HV *hclass = cxt->hclass; TRACEME(("known_class (%s)", name)); /* * Recall that we don't store pointers in this hash table, but tags. * Therefore, we need LOW_32BITS() to extract the relevant parts. */ svh = hv_fetch(hclass, name, len, FALSE); if (svh) { *classnum = LOW_32BITS(*svh); return TRUE; } /* * Unknown classname, we need to record it. */ cxt->classnum++; if (!hv_store(hclass, name, len, INT2PTR(SV*, cxt->classnum), 0)) CROAK(("Unable to record new classname")); *classnum = cxt->classnum; return FALSE; } /*** *** Specific store routines. ***/ /* * store_ref * * Store a reference. * Layout is SX_REF <object> or SX_OVERLOAD <object>. */ static int store_ref(pTHX_ stcxt_t *cxt, SV *sv) { int retval; int is_weak = 0; TRACEME(("store_ref (0x%" UVxf ")", PTR2UV(sv))); /* * Follow reference, and check if target is overloaded. */ #ifdef SvWEAKREF if (SvWEAKREF(sv)) is_weak = 1; TRACEME(("ref (0x%" UVxf ") is%s weak", PTR2UV(sv), is_weak ? "" : "n't")); #endif sv = SvRV(sv); if (SvOBJECT(sv)) { HV *stash = (HV *) SvSTASH(sv); if (stash && Gv_AMG(stash)) { TRACEME(("ref (0x%" UVxf ") is overloaded", PTR2UV(sv))); PUTMARK(is_weak ? SX_WEAKOVERLOAD : SX_OVERLOAD); } else PUTMARK(is_weak ? SX_WEAKREF : SX_REF); } else PUTMARK(is_weak ? SX_WEAKREF : SX_REF); cxt->recur_sv = sv; TRACEME((">ref recur_depth %" IVdf ", recur_sv (0x%" UVxf ") max %" IVdf, cxt->recur_depth, PTR2UV(cxt->recur_sv), cxt->max_recur_depth)); if (RECURSION_TOO_DEEP()) { #if PERL_VERSION_LT(5,15,0) cleanup_recursive_data(aTHX_ (SV*)sv); #endif CROAK((MAX_DEPTH_ERROR)); } retval = store(aTHX_ cxt, sv); if (cxt->max_recur_depth != -1 && cxt->recur_depth > 0) { TRACEME(("<ref recur_depth --%" IVdf, cxt->recur_depth)); --cxt->recur_depth; } return retval; } /* * store_scalar * * Store a scalar. * * Layout is SX_LSCALAR <length> <data>, SX_SCALAR <length> <data> or SX_UNDEF. * SX_LUTF8STR and SX_UTF8STR are used for UTF-8 strings. * The <data> section is omitted if <length> is 0. * * For vstrings, the vstring portion is stored first with * SX_LVSTRING <length> <data> or SX_VSTRING <length> <data>, followed by * SX_(L)SCALAR or SX_(L)UTF8STR with the actual PV. * * If integer or double, the layout is SX_INTEGER <data> or SX_DOUBLE <data>. * Small integers (within [-127, +127]) are stored as SX_BYTE <byte>. * * For huge strings use SX_LOBJECT SX_type SX_U64 <type> <data> */ static int store_scalar(pTHX_ stcxt_t *cxt, SV *sv) { IV iv; char *pv; STRLEN len; U32 flags = SvFLAGS(sv); /* "cc -O" may put it in register */ TRACEME(("store_scalar (0x%" UVxf ")", PTR2UV(sv))); /* * For efficiency, break the SV encapsulation by peaking at the flags * directly without using the Perl macros to avoid dereferencing * sv->sv_flags each time we wish to check the flags. */ if (!(flags & SVf_OK)) { /* !SvOK(sv) */ if (sv == &PL_sv_undef) { TRACEME(("immortal undef")); PUTMARK(SX_SV_UNDEF); } else { TRACEME(("undef at 0x%" UVxf, PTR2UV(sv))); PUTMARK(SX_UNDEF); } return 0; } /* * Always store the string representation of a scalar if it exists. * Gisle Aas provided me with this test case, better than a long speach: * * perl -MDevel::Peek -le '$a="abc"; $a+0; Dump($a)' * SV = PVNV(0x80c8520) * REFCNT = 1 * FLAGS = (NOK,POK,pNOK,pPOK) * IV = 0 * NV = 0 * PV = 0x80c83d0 "abc"\0 * CUR = 3 * LEN = 4 * * Write SX_SCALAR, length, followed by the actual data. * * Otherwise, write an SX_BYTE, SX_INTEGER or an SX_DOUBLE as * appropriate, followed by the actual (binary) data. A double * is written as a string if network order, for portability. * * NOTE: instead of using SvNOK(sv), we test for SvNOKp(sv). * The reason is that when the scalar value is tainted, the SvNOK(sv) * value is false. * * The test for a read-only scalar with both POK and NOK set is meant * to quickly detect &PL_sv_yes and &PL_sv_no without having to pay the * address comparison for each scalar we store. */ #define SV_MAYBE_IMMORTAL (SVf_READONLY|SVf_POK|SVf_NOK) if ((flags & SV_MAYBE_IMMORTAL) == SV_MAYBE_IMMORTAL) { if (sv == &PL_sv_yes) { TRACEME(("immortal yes")); PUTMARK(SX_SV_YES); } else if (sv == &PL_sv_no) { TRACEME(("immortal no")); PUTMARK(SX_SV_NO); } else { pv = SvPV(sv, len); /* We know it's SvPOK */ goto string; /* Share code below */ } } else if (flags & SVf_POK) { /* public string - go direct to string read. */ goto string_readlen; } else if ( #if PERL_VERSION_LT(5,7,0) /* For 5.6 and earlier NV flag trumps IV flag, so only use integer direct if NV flag is off. */ (flags & (SVf_NOK | SVf_IOK)) == SVf_IOK #else /* 5.7 rules are that if IV public flag is set, IV value is as good, if not better, than NV value. */ flags & SVf_IOK #endif ) { iv = SvIV(sv); /* * Will come here from below with iv set if double is an integer. */ integer: /* Sorry. This isn't in 5.005_56 (IIRC) or earlier. */ #ifdef SVf_IVisUV /* Need to do this out here, else 0xFFFFFFFF becomes iv of -1 * (for example) and that ends up in the optimised small integer * case. */ if ((flags & SVf_IVisUV) && SvUV(sv) > IV_MAX) { TRACEME(("large unsigned integer as string, value = %" UVuf, SvUV(sv))); goto string_readlen; } #endif /* * Optimize small integers into a single byte, otherwise store as * a real integer (converted into network order if they asked). */ if (iv >= -128 && iv <= 127) { unsigned char siv = (unsigned char) (iv + 128); /* [0,255] */ PUTMARK(SX_BYTE); PUTMARK(siv); TRACEME(("small integer stored as %d", (int)siv)); } else if (cxt->netorder) { #ifndef HAS_HTONL TRACEME(("no htonl, fall back to string for integer")); goto string_readlen; #else I32 niv; #if IVSIZE > 4 if ( #ifdef SVf_IVisUV /* Sorry. This isn't in 5.005_56 (IIRC) or earlier. */ ((flags & SVf_IVisUV) && SvUV(sv) > (UV)0x7FFFFFFF) || #endif (iv > (IV)0x7FFFFFFF) || (iv < -(IV)0x80000000)) { /* Bigger than 32 bits. */ TRACEME(("large network order integer as string, value = %" IVdf, iv)); goto string_readlen; } #endif niv = (I32) htonl((I32) iv); TRACEME(("using network order")); PUTMARK(SX_NETINT); WRITE_I32(niv); #endif } else { PUTMARK(SX_INTEGER); WRITE(&iv, sizeof(iv)); } TRACEME(("ok (integer 0x%" UVxf ", value = %" IVdf ")", PTR2UV(sv), iv)); } else if (flags & SVf_NOK) { NV_bytes nv; #ifdef NV_CLEAR /* if we can't tell if there's padding, clear the whole NV and hope the compiler leaves the padding alone */ Zero(&nv, 1, NV_bytes); #endif #if PERL_VERSION_LT(5,7,0) nv.nv = SvNV(sv); /* * Watch for number being an integer in disguise. */ if (nv.nv == (NV) (iv = I_V(nv.nv))) { TRACEME(("double %" NVff " is actually integer %" IVdf, nv, iv)); goto integer; /* Share code above */ } #else SvIV_please(sv); if (SvIOK_notUV(sv)) { iv = SvIV(sv); goto integer; /* Share code above */ } nv.nv = SvNV(sv); #endif if (cxt->netorder) { TRACEME(("double %" NVff " stored as string", nv.nv)); goto string_readlen; /* Share code below */ } #if NV_PADDING Zero(nv.bytes + NVSIZE - NV_PADDING, NV_PADDING, char); #endif PUTMARK(SX_DOUBLE); WRITE(&nv, sizeof(nv)); TRACEME(("ok (double 0x%" UVxf ", value = %" NVff ")", PTR2UV(sv), nv.nv)); } else if (flags & (SVp_POK | SVp_NOK | SVp_IOK)) { #ifdef SvVOK MAGIC *mg; #endif UV wlen; /* For 64-bit machines */ string_readlen: pv = SvPV(sv, len); /* * Will come here from above if it was readonly, POK and NOK but * neither &PL_sv_yes nor &PL_sv_no. */ string: #ifdef SvVOK if (SvMAGICAL(sv) && (mg = mg_find(sv, 'V'))) { /* The macro passes this by address, not value, and a lot of called code assumes that it's 32 bits without checking. */ const SSize_t len = mg->mg_len; /* we no longer accept vstrings over I32_SIZE-1, so don't emit them, also, older Storables handle them badly. */ if (len >= I32_MAX) { CROAK(("vstring too large to freeze")); } STORE_PV_LEN((const char *)mg->mg_ptr, len, SX_VSTRING, SX_LVSTRING); } #endif wlen = (Size_t)len; if (SvUTF8 (sv)) STORE_UTF8STR(pv, wlen); else STORE_SCALAR(pv, wlen); TRACEME(("ok (scalar 0x%" UVxf " '%s', length = %" UVuf ")", PTR2UV(sv), len >= 2048 ? "<string too long>" : SvPVX(sv), (UV)len)); } else { CROAK(("Can't determine type of %s(0x%" UVxf ")", sv_reftype(sv, FALSE), PTR2UV(sv))); } return 0; /* Ok, no recursion on scalars */ } /* * store_array * * Store an array. * * Layout is SX_ARRAY <size> followed by each item, in increasing index order. * Each item is stored as <object>. */ static int store_array(pTHX_ stcxt_t *cxt, AV *av) { SV **sav; UV len = av_len(av) + 1; UV i; int ret; SV *const recur_sv = cxt->recur_sv; TRACEME(("store_array (0x%" UVxf ")", PTR2UV(av))); #ifdef HAS_U64 if (len > 0x7fffffffu) { /* * Large array by emitting SX_LOBJECT 1 U64 data */ PUTMARK(SX_LOBJECT); PUTMARK(SX_ARRAY); W64LEN(len); TRACEME(("lobject size = %lu", (unsigned long)len)); } else #endif { /* * Normal array by emitting SX_ARRAY, followed by the array length. */ I32 l = (I32)len; PUTMARK(SX_ARRAY); WLEN(l); TRACEME(("size = %d", (int)l)); } TRACEME((">array recur_depth %" IVdf ", recur_sv (0x%" UVxf ") max %" IVdf, cxt->recur_depth, PTR2UV(cxt->recur_sv), cxt->max_recur_depth)); if (recur_sv != (SV*)av) { if (RECURSION_TOO_DEEP()) { /* with <= 5.14 it recurses in the cleanup also, needing 2x stack size */ #if PERL_VERSION_LT(5,15,0) cleanup_recursive_data(aTHX_ (SV*)av); #endif CROAK((MAX_DEPTH_ERROR)); } } /* * Now store each item recursively. */ for (i = 0; i < len; i++) { sav = av_fetch(av, i, 0); if (!sav) { TRACEME(("(#%d) nonexistent item", (int)i)); STORE_SV_UNDEF(); continue; } #if PERL_VERSION_GE(5,19,0) /* In 5.19.3 and up, &PL_sv_undef can actually be stored in * an array; it no longer represents nonexistent elements. * Historically, we have used SX_SV_UNDEF in arrays for * nonexistent elements, so we use SX_SVUNDEF_ELEM for * &PL_sv_undef itself. */ if (*sav == &PL_sv_undef) { TRACEME(("(#%d) undef item", (int)i)); cxt->tagnum++; PUTMARK(SX_SVUNDEF_ELEM); continue; } #endif TRACEME(("(#%d) item", (int)i)); if ((ret = store(aTHX_ cxt, *sav))) /* Extra () for -Wall */ return ret; } if (recur_sv != (SV*)av) { assert(cxt->max_recur_depth == -1 || cxt->recur_depth > 0); if (cxt->max_recur_depth != -1 && cxt->recur_depth > 0) { TRACEME(("<array recur_depth --%" IVdf, cxt->recur_depth)); --cxt->recur_depth; } } TRACEME(("ok (array)")); return 0; } #if PERL_VERSION_LT(5,7,0) /* * sortcmp * * Sort two SVs * Borrowed from perl source file pp_ctl.c, where it is used by pp_sort. */ static int sortcmp(const void *a, const void *b) { #if defined(USE_ITHREADS) dTHX; #endif /* USE_ITHREADS */ return sv_cmp(*(SV * const *) a, *(SV * const *) b); } #endif /* PERL_VERSION_LT(5,7,0) */ /* * store_hash * * Store a hash table. * * For a "normal" hash (not restricted, no utf8 keys): * * Layout is SX_HASH <size> followed by each key/value pair, in random order. * Values are stored as <object>. * Keys are stored as <length> <data>, the <data> section being omitted * if length is 0. * * For a "fancy" hash (restricted or utf8 keys): * * Layout is SX_FLAG_HASH <size> <hash flags> followed by each key/value pair, * in random order. * Values are stored as <object>. * Keys are stored as <flags> <length> <data>, the <data> section being omitted * if length is 0. * Currently the only hash flag is "restricted" * Key flags are as for hv.h */ static int store_hash(pTHX_ stcxt_t *cxt, HV *hv) { dVAR; UV len = (UV)HvTOTALKEYS(hv); Size_t i; int ret = 0; I32 riter; HE *eiter; int flagged_hash = ((SvREADONLY(hv) #ifdef HAS_HASH_KEY_FLAGS || HvHASKFLAGS(hv) #endif ) ? 1 : 0); unsigned char hash_flags = (SvREADONLY(hv) ? SHV_RESTRICTED : 0); SV * const recur_sv = cxt->recur_sv; /* * Signal hash by emitting SX_HASH, followed by the table length. * Max number of keys per perl version: * IV - 5.12 * STRLEN 5.14 - 5.24 (size_t: U32/U64) * SSize_t 5.22c - 5.24c (I32/I64) * U32 5.25c - */ if (len > 0x7fffffffu) { /* keys > I32_MAX */ /* * Large hash: SX_LOBJECT type hashflags? U64 data * * Stupid limitation: * Note that perl5 can store more than 2G keys, but only iterate * over 2G max. (cperl can) * We need to manually iterate over it then, unsorted. * But until perl itself cannot do that, skip that. */ TRACEME(("lobject size = %lu", (unsigned long)len)); #ifdef HAS_U64 PUTMARK(SX_LOBJECT); if (flagged_hash) { PUTMARK(SX_FLAG_HASH); PUTMARK(hash_flags); } else { PUTMARK(SX_HASH); } W64LEN(len); return store_lhash(aTHX_ cxt, hv, hash_flags); #else /* <5.12 you could store larger hashes, but cannot iterate over them. So we reject them, it's a bug. */ CROAK(("Cannot store large objects on a 32bit system")); #endif } else { I32 l = (I32)len; if (flagged_hash) { TRACEME(("store_hash (0x%" UVxf ") (flags %x)", PTR2UV(hv), (unsigned int)hash_flags)); PUTMARK(SX_FLAG_HASH); PUTMARK(hash_flags); } else { TRACEME(("store_hash (0x%" UVxf ")", PTR2UV(hv))); PUTMARK(SX_HASH); } WLEN(l); TRACEME(("size = %d, used = %d", (int)l, (int)HvUSEDKEYS(hv))); } TRACEME((">hash recur_depth %" IVdf ", recur_sv (0x%" UVxf ") max %" IVdf, cxt->recur_depth, PTR2UV(cxt->recur_sv), cxt->max_recur_depth_hash)); if (recur_sv != (SV*)hv && cxt->max_recur_depth_hash != -1) { ++cxt->recur_depth; } if (RECURSION_TOO_DEEP_HASH()) { #if PERL_VERSION_LT(5,15,0) cleanup_recursive_data(aTHX_ (SV*)hv); #endif CROAK((MAX_DEPTH_ERROR)); } /* * Save possible iteration state via each() on that table. * * Note that perl as of 5.24 *can* store more than 2G keys, but *not* * iterate over it. * Lengths of hash keys are also limited to I32, which is good. */ riter = HvRITER_get(hv); eiter = HvEITER_get(hv); hv_iterinit(hv); /* * Now store each item recursively. * * If canonical is defined to some true value then store each * key/value pair in sorted order otherwise the order is random. * Canonical order is irrelevant when a deep clone operation is performed. * * Fetch the value from perl only once per store() operation, and only * when needed. */ if ( !(cxt->optype & ST_CLONE) && (cxt->canonical == 1 || (cxt->canonical < 0 && (cxt->canonical = (SvTRUE(get_sv("Storable::canonical", GV_ADD)) ? 1 : 0)))) ) { /* * Storing in order, sorted by key. * Run through the hash, building up an array of keys in a * mortal array, sort the array and then run through the * array. */ AV *av = newAV(); av_extend (av, len); TRACEME(("using canonical order")); for (i = 0; i < len; i++) { #ifdef HAS_RESTRICTED_HASHES HE *he = hv_iternext_flags(hv, HV_ITERNEXT_WANTPLACEHOLDERS); #else HE *he = hv_iternext(hv); #endif av_store(av, i, hv_iterkeysv(he)); } STORE_HASH_SORT; for (i = 0; i < len; i++) { #ifdef HAS_RESTRICTED_HASHES int placeholders = (int)HvPLACEHOLDERS_get(hv); #endif unsigned char flags = 0; char *keyval; STRLEN keylen_tmp; I32 keylen; SV *key = av_shift(av); /* This will fail if key is a placeholder. Track how many placeholders we have, and error if we "see" too many. */ HE *he = hv_fetch_ent(hv, key, 0, 0); SV *val; if (he) { if (!(val = HeVAL(he))) { /* Internal error, not I/O error */ return 1; } } else { #ifdef HAS_RESTRICTED_HASHES /* Should be a placeholder. */ if (placeholders-- < 0) { /* This should not happen - number of retrieves should be identical to number of placeholders. */ return 1; } /* Value is never needed, and PL_sv_undef is more space efficient to store. */ val = &PL_sv_undef; ASSERT (flags == 0, ("Flags not 0 but %d", (int)flags)); flags = SHV_K_PLACEHOLDER; #else return 1; #endif } /* * Store value first. */ TRACEME(("(#%d) value 0x%" UVxf, (int)i, PTR2UV(val))); if ((ret = store(aTHX_ cxt, val))) /* Extra () for -Wall, grr... */ goto out; /* * Write key string. * Keys are written after values to make sure retrieval * can be optimal in terms of memory usage, where keys are * read into a fixed unique buffer called kbuf. * See retrieve_hash() for details. */ /* Implementation of restricted hashes isn't nicely abstracted: */ if ((hash_flags & SHV_RESTRICTED) && SvTRULYREADONLY(val)) { flags |= SHV_K_LOCKED; } keyval = SvPV(key, keylen_tmp); keylen = keylen_tmp; if (SvUTF8(key)) { const char *keysave = keyval; bool is_utf8 = TRUE; /* Just casting the &klen to (STRLEN) won't work well if STRLEN and I32 are of different widths. --jhi */ keyval = (char*)bytes_from_utf8((U8*)keyval, &keylen_tmp, &is_utf8); /* If we were able to downgrade here, then than means that we have a key which only had chars 0-255, but was utf8 encoded. */ if (keyval != keysave) { keylen = keylen_tmp; flags |= SHV_K_WASUTF8; } else { /* keylen_tmp can't have changed, so no need to assign back to keylen. */ flags |= SHV_K_UTF8; } } if (flagged_hash) { PUTMARK(flags); TRACEME(("(#%d) key '%s' flags %x %u", (int)i, keyval, flags, *keyval)); } else { /* This is a workaround for a bug in 5.8.0 that causes the HEK_WASUTF8 flag to be set on an HEK without the hash being marked as having key flags. We just cross our fingers and drop the flag. AMS 20030901 */ assert (flags == 0 || flags == SHV_K_WASUTF8); TRACEME(("(#%d) key '%s'", (int)i, keyval)); } WLEN(keylen); if (keylen) WRITE(keyval, keylen); if (flags & SHV_K_WASUTF8) Safefree (keyval); } /* * Free up the temporary array */ av_undef(av); sv_free((SV *) av); } else { /* * Storing in "random" order (in the order the keys are stored * within the hash). This is the default and will be faster! */ for (i = 0; i < len; i++) { #ifdef HV_ITERNEXT_WANTPLACEHOLDERS HE *he = hv_iternext_flags(hv, HV_ITERNEXT_WANTPLACEHOLDERS); #else HE *he = hv_iternext(hv); #endif SV *val = (he ? hv_iterval(hv, he) : 0); if (val == 0) return 1; /* Internal error, not I/O error */ if ((ret = store_hentry(aTHX_ cxt, hv, i, HeKEY_hek(he), val, hash_flags))) goto out; } } TRACEME(("ok (hash 0x%" UVxf ")", PTR2UV(hv))); out: assert(cxt->max_recur_depth_hash != -1 && cxt->recur_depth > 0); TRACEME(("<hash recur_depth --%" IVdf , cxt->recur_depth)); if (cxt->max_recur_depth_hash != -1 && recur_sv != (SV*)hv && cxt->recur_depth > 0) { --cxt->recur_depth; } HvRITER_set(hv, riter); /* Restore hash iterator state */ HvEITER_set(hv, eiter); return ret; } static int store_hentry(pTHX_ stcxt_t *cxt, HV* hv, UV i, HEK *hek, SV *val, unsigned char hash_flags) { int ret = 0; int flagged_hash = ((SvREADONLY(hv) #ifdef HAS_HASH_KEY_FLAGS || HvHASKFLAGS(hv) #endif ) ? 1 : 0); /* Implementation of restricted hashes isn't nicely abstracted: */ unsigned char flags = (((hash_flags & SHV_RESTRICTED) && SvTRULYREADONLY(val)) ? SHV_K_LOCKED : 0); #ifndef DEBUGME PERL_UNUSED_ARG(i); #endif if (val == &PL_sv_placeholder) { flags |= SHV_K_PLACEHOLDER; val = &PL_sv_undef; } /* * Store value first. */ TRACEME(("(#%d) value 0x%" UVxf, (int)i, PTR2UV(val))); { I32 len = HEK_LEN(hek); SV *key_sv = NULL; char *key = 0; if ((ret = store(aTHX_ cxt, val))) return ret; if (len == HEf_SVKEY) { /* This is somewhat sick, but the internal APIs are * such that XS code could put one of these in * a regular hash. * Maybe we should be capable of storing one if * found. */ key_sv = (SV *)HEK_KEY(hek); flags |= SHV_K_ISSV; } else { /* Regular string key. */ #ifdef HAS_HASH_KEY_FLAGS if (HEK_UTF8(hek)) flags |= SHV_K_UTF8; if (HEK_WASUTF8(hek)) flags |= SHV_K_WASUTF8; #endif key = HEK_KEY(hek); } /* * Write key string. * Keys are written after values to make sure retrieval * can be optimal in terms of memory usage, where keys are * read into a fixed unique buffer called kbuf. * See retrieve_hash() for details. */ if (flagged_hash) { PUTMARK(flags); TRACEME(("(#%d) key '%s' flags %x", (int)i, key, flags)); } else { /* This is a workaround for a bug in 5.8.0 that causes the HEK_WASUTF8 flag to be set on an HEK without the hash being marked as having key flags. We just cross our fingers and drop the flag. AMS 20030901 */ assert (flags == 0 || flags == SHV_K_WASUTF8); TRACEME(("(#%d) key '%s'", (int)i, key)); } if (flags & SHV_K_ISSV) { if ((ret = store(aTHX_ cxt, key_sv))) return ret; } else { WLEN(len); if (len) WRITE(key, len); } } return ret; } #ifdef HAS_U64 /* * store_lhash * * Store a overlong hash table, with >2G keys, which we cannot iterate * over with perl5. xhv_eiter is only I32 there. (only cperl can) * and we also do not want to sort it. * So we walk the buckets and chains manually. * * type, len and flags are already written. */ static int store_lhash(pTHX_ stcxt_t *cxt, HV *hv, unsigned char hash_flags) { dVAR; int ret = 0; Size_t i; UV ix = 0; HE** array; #ifdef DEBUGME UV len = (UV)HvTOTALKEYS(hv); #endif SV * const recur_sv = cxt->recur_sv; if (hash_flags) { TRACEME(("store_lhash (0x%" UVxf ") (flags %x)", PTR2UV(hv), (int) hash_flags)); } else { TRACEME(("store_lhash (0x%" UVxf ")", PTR2UV(hv))); } TRACEME(("size = %" UVuf ", used = %" UVuf, len, (UV)HvUSEDKEYS(hv))); TRACEME(("recur_depth %" IVdf ", recur_sv (0x%" UVxf ")", cxt->recur_depth, PTR2UV(cxt->recur_sv))); if (recur_sv != (SV*)hv && cxt->max_recur_depth_hash != -1) { ++cxt->recur_depth; } if (RECURSION_TOO_DEEP_HASH()) { #if PERL_VERSION_LT(5,15,0) cleanup_recursive_data(aTHX_ (SV*)hv); #endif CROAK((MAX_DEPTH_ERROR)); } array = HvARRAY(hv); for (i = 0; i <= (Size_t)HvMAX(hv); i++) { HE* entry = array[i]; while (entry) { SV* val = hv_iterval(hv, entry); if ((ret = store_hentry(aTHX_ cxt, hv, ix++, HeKEY_hek(entry), val, hash_flags))) return ret; entry = HeNEXT(entry); } } if (recur_sv != (SV*)hv && cxt->max_recur_depth_hash != -1 && cxt->recur_depth > 0) { TRACEME(("recur_depth --%" IVdf, cxt->recur_depth)); --cxt->recur_depth; } assert(ix == len); return ret; } #endif /* * store_code * * Store a code reference. * * Layout is SX_CODE <length> followed by a scalar containing the perl * source code of the code reference. */ static int store_code(pTHX_ stcxt_t *cxt, CV *cv) { dSP; STRLEN len; STRLEN count, reallen; SV *text, *bdeparse; TRACEME(("store_code (0x%" UVxf ")", PTR2UV(cv))); if ( cxt->deparse == 0 || (cxt->deparse < 0 && !(cxt->deparse = SvTRUE(get_sv("Storable::Deparse", GV_ADD)) ? 1 : 0)) ) { return store_other(aTHX_ cxt, (SV*)cv); } /* * Require B::Deparse. At least B::Deparse 0.61 is needed for * blessed code references. */ /* Ownership of both SVs is passed to load_module, which frees them. */ load_module(PERL_LOADMOD_NOIMPORT, newSVpvs("B::Deparse"), newSVnv(0.61)); SPAGAIN; ENTER; SAVETMPS; /* * create the B::Deparse object */ PUSHMARK(sp); XPUSHs(newSVpvs_flags("B::Deparse", SVs_TEMP)); PUTBACK; count = call_method("new", G_SCALAR); SPAGAIN; if (count != 1) CROAK(("Unexpected return value from B::Deparse::new\n")); bdeparse = POPs; /* * call the coderef2text method */ PUSHMARK(sp); XPUSHs(bdeparse); /* XXX is this already mortal? */ XPUSHs(sv_2mortal(newRV_inc((SV*)cv))); PUTBACK; count = call_method("coderef2text", G_SCALAR); SPAGAIN; if (count != 1) CROAK(("Unexpected return value from B::Deparse::coderef2text\n")); text = POPs; len = SvCUR(text); reallen = strlen(SvPV_nolen(text)); /* * Empty code references or XS functions are deparsed as * "(prototype) ;" or ";". */ if (len == 0 || *(SvPV_nolen(text)+reallen-1) == ';') { CROAK(("The result of B::Deparse::coderef2text was empty - maybe you're trying to serialize an XS function?\n")); } /* * Signal code by emitting SX_CODE. */ PUTMARK(SX_CODE); cxt->tagnum++; /* necessary, as SX_CODE is a SEEN() candidate */ TRACEME(("size = %d", (int)len)); TRACEME(("code = %s", SvPV_nolen(text))); /* * Now store the source code. */ if(SvUTF8 (text)) STORE_UTF8STR(SvPV_nolen(text), len); else STORE_SCALAR(SvPV_nolen(text), len); FREETMPS; LEAVE; TRACEME(("ok (code)")); return 0; } #if PERL_VERSION_LT(5,8,0) # define PERL_MAGIC_qr 'r' /* precompiled qr// regex */ # define BFD_Svs_SMG_OR_RMG SVs_RMG #elif PERL_VERSION_GE(5,8,1) # define BFD_Svs_SMG_OR_RMG SVs_SMG # define MY_PLACEHOLDER PL_sv_placeholder #else # define BFD_Svs_SMG_OR_RMG SVs_RMG # define MY_PLACEHOLDER PL_sv_undef #endif static int get_regexp(pTHX_ stcxt_t *cxt, SV* sv, SV **re, SV **flags) { dSP; SV* rv; #if PERL_VERSION_GE(5,12,0) CV *cv = get_cv("re::regexp_pattern", 0); #else CV *cv = get_cv("Storable::_regexp_pattern", 0); #endif I32 count; assert(cv); ENTER; SAVETMPS; rv = sv_2mortal((SV*)newRV_inc(sv)); PUSHMARK(sp); XPUSHs(rv); PUTBACK; /* optimize to call the XS directly later */ count = call_sv((SV*)cv, G_ARRAY); SPAGAIN; if (count < 2) CROAK(("re::regexp_pattern returned only %d results", (int)count)); *flags = POPs; SvREFCNT_inc(*flags); *re = POPs; SvREFCNT_inc(*re); PUTBACK; FREETMPS; LEAVE; return 1; } static int store_regexp(pTHX_ stcxt_t *cxt, SV *sv) { SV *re = NULL; SV *flags = NULL; const char *re_pv; const char *flags_pv; STRLEN re_len; STRLEN flags_len; U8 op_flags = 0; if (!get_regexp(aTHX_ cxt, sv, &re, &flags)) return -1; re_pv = SvPV(re, re_len); flags_pv = SvPV(flags, flags_len); if (re_len > 0xFF) { op_flags |= SHR_U32_RE_LEN; } PUTMARK(SX_REGEXP); PUTMARK(op_flags); if (op_flags & SHR_U32_RE_LEN) { U32 re_len32 = re_len; WLEN(re_len32); } else PUTMARK(re_len); WRITE(re_pv, re_len); PUTMARK(flags_len); WRITE(flags_pv, flags_len); return 0; } /* * store_tied * * When storing a tied object (be it a tied scalar, array or hash), we lay out * a special mark, followed by the underlying tied object. For instance, when * dealing with a tied hash, we store SX_TIED_HASH <hash object>, where * <hash object> stands for the serialization of the tied hash. */ static int store_tied(pTHX_ stcxt_t *cxt, SV *sv) { MAGIC *mg; SV *obj = NULL; int ret = 0; int svt = SvTYPE(sv); char mtype = 'P'; TRACEME(("store_tied (0x%" UVxf ")", PTR2UV(sv))); /* * We have a small run-time penalty here because we chose to factorise * all tieds objects into the same routine, and not have a store_tied_hash, * a store_tied_array, etc... * * Don't use a switch() statement, as most compilers don't optimize that * well for 2/3 values. An if() else if() cascade is just fine. We put * tied hashes first, as they are the most likely beasts. */ if (svt == SVt_PVHV) { TRACEME(("tied hash")); PUTMARK(SX_TIED_HASH); /* Introduces tied hash */ } else if (svt == SVt_PVAV) { TRACEME(("tied array")); PUTMARK(SX_TIED_ARRAY); /* Introduces tied array */ } else { TRACEME(("tied scalar")); PUTMARK(SX_TIED_SCALAR); /* Introduces tied scalar */ mtype = 'q'; } if (!(mg = mg_find(sv, mtype))) CROAK(("No magic '%c' found while storing tied %s", mtype, (svt == SVt_PVHV) ? "hash" : (svt == SVt_PVAV) ? "array" : "scalar")); /* * The mg->mg_obj found by mg_find() above actually points to the * underlying tied Perl object implementation. For instance, if the * original SV was that of a tied array, then mg->mg_obj is an AV. * * Note that we store the Perl object as-is. We don't call its FETCH * method along the way. At retrieval time, we won't call its STORE * method either, but the tieing magic will be re-installed. In itself, * that ensures that the tieing semantics are preserved since further * accesses on the retrieved object will indeed call the magic methods... */ /* [#17040] mg_obj is NULL for scalar self-ties. AMS 20030416 */ obj = mg->mg_obj ? mg->mg_obj : newSV(0); if ((ret = store(aTHX_ cxt, obj))) return ret; TRACEME(("ok (tied)")); return 0; } /* * store_tied_item * * Stores a reference to an item within a tied structure: * * . \$h{key}, stores both the (tied %h) object and 'key'. * . \$a[idx], stores both the (tied @a) object and 'idx'. * * Layout is therefore either: * SX_TIED_KEY <object> <key> * SX_TIED_IDX <object> <index> */ static int store_tied_item(pTHX_ stcxt_t *cxt, SV *sv) { MAGIC *mg; int ret; TRACEME(("store_tied_item (0x%" UVxf ")", PTR2UV(sv))); if (!(mg = mg_find(sv, 'p'))) CROAK(("No magic 'p' found while storing reference to tied item")); /* * We discriminate between \$h{key} and \$a[idx] via mg_ptr. */ if (mg->mg_ptr) { TRACEME(("store_tied_item: storing a ref to a tied hash item")); PUTMARK(SX_TIED_KEY); TRACEME(("store_tied_item: storing OBJ 0x%" UVxf, PTR2UV(mg->mg_obj))); if ((ret = store(aTHX_ cxt, mg->mg_obj))) /* Extra () for -Wall, grr... */ return ret; TRACEME(("store_tied_item: storing PTR 0x%" UVxf, PTR2UV(mg->mg_ptr))); if ((ret = store(aTHX_ cxt, (SV *) mg->mg_ptr))) /* Idem, for -Wall */ return ret; } else { I32 idx = mg->mg_len; TRACEME(("store_tied_item: storing a ref to a tied array item ")); PUTMARK(SX_TIED_IDX); TRACEME(("store_tied_item: storing OBJ 0x%" UVxf, PTR2UV(mg->mg_obj))); if ((ret = store(aTHX_ cxt, mg->mg_obj))) /* Idem, for -Wall */ return ret; TRACEME(("store_tied_item: storing IDX %d", (int)idx)); WLEN(idx); } TRACEME(("ok (tied item)")); return 0; } /* * store_hook -- dispatched manually, not via sv_store[] * * The blessed SV is serialized by a hook. * * Simple Layout is: * * SX_HOOK <flags> <len> <classname> <len2> <str> [<len3> <object-IDs>] * * where <flags> indicates how long <len>, <len2> and <len3> are, whether * the trailing part [] is present, the type of object (scalar, array or hash). * There is also a bit which says how the classname is stored between: * * <len> <classname> * <index> * * and when the <index> form is used (classname already seen), the "large * classname" bit in <flags> indicates how large the <index> is. * * The serialized string returned by the hook is of length <len2> and comes * next. It is an opaque string for us. * * Those <len3> object IDs which are listed last represent the extra references * not directly serialized by the hook, but which are linked to the object. * * When recursion is mandated to resolve object-IDs not yet seen, we have * instead, with <header> being flags with bits set to indicate the object type * and that recursion was indeed needed: * * SX_HOOK <header> <object> <header> <object> <flags> * * that same header being repeated between serialized objects obtained through * recursion, until we reach flags indicating no recursion, at which point * we know we've resynchronized with a single layout, after <flags>. * * When storing a blessed ref to a tied variable, the following format is * used: * * SX_HOOK <flags> <extra> ... [<len3> <object-IDs>] <magic object> * * The first <flags> indication carries an object of type SHT_EXTRA, and the * real object type is held in the <extra> flag. At the very end of the * serialization stream, the underlying magic object is serialized, just like * any other tied variable. */ static int store_hook( pTHX_ stcxt_t *cxt, SV *sv, int type, HV *pkg, SV *hook) { I32 len; char *classname; STRLEN len2; SV *ref; AV *av; SV **ary; IV count; /* really len3 + 1 */ unsigned char flags; char *pv; int i; int recursed = 0; /* counts recursion */ int obj_type; /* object type, on 2 bits */ I32 classnum; int ret; int clone = cxt->optype & ST_CLONE; char mtype = '\0'; /* for blessed ref to tied structures */ unsigned char eflags = '\0'; /* used when object type is SHT_EXTRA */ #ifdef HAS_U64 int need_large_oids = 0; #endif TRACEME(("store_hook, classname \"%s\", tagged #%d", HvNAME_get(pkg), (int)cxt->tagnum)); /* * Determine object type on 2 bits. */ switch (type) { case svis_REF: case svis_SCALAR: obj_type = SHT_SCALAR; break; case svis_ARRAY: obj_type = SHT_ARRAY; break; case svis_HASH: obj_type = SHT_HASH; break; case svis_TIED: /* * Produced by a blessed ref to a tied data structure, $o in the * following Perl code. * * my %h; * tie %h, 'FOO'; * my $o = bless \%h, 'BAR'; * * Signal the tie-ing magic by setting the object type as SHT_EXTRA * (since we have only 2 bits in <flags> to store the type), and an * <extra> byte flag will be emitted after the FIRST <flags> in the * stream, carrying what we put in 'eflags'. */ obj_type = SHT_EXTRA; switch (SvTYPE(sv)) { case SVt_PVHV: eflags = (unsigned char) SHT_THASH; mtype = 'P'; break; case SVt_PVAV: eflags = (unsigned char) SHT_TARRAY; mtype = 'P'; break; default: eflags = (unsigned char) SHT_TSCALAR; mtype = 'q'; break; } break; default: CROAK(("Unexpected object type (%d) in store_hook()", type)); } flags = SHF_NEED_RECURSE | obj_type; classname = HvNAME_get(pkg); len = strlen(classname); /* * To call the hook, we need to fake a call like: * * $object->STORABLE_freeze($cloning); * * but we don't have the $object here. For instance, if $object is * a blessed array, what we have in 'sv' is the array, and we can't * call a method on those. * * Therefore, we need to create a temporary reference to the object and * make the call on that reference. */ TRACEME(("about to call STORABLE_freeze on class %s", classname)); ref = newRV_inc(sv); /* Temporary reference */ av = array_call(aTHX_ ref, hook, clone); /* @a = $object->STORABLE_freeze($c) */ SvREFCNT_dec(ref); /* Reclaim temporary reference */ count = AvFILLp(av) + 1; TRACEME(("store_hook, array holds %" IVdf " items", count)); /* * If they return an empty list, it means they wish to ignore the * hook for this class (and not just this instance -- that's for them * to handle if they so wish). * * Simply disable the cached entry for the hook (it won't be recomputed * since it's present in the cache) and recurse to store_blessed(). */ if (!count) { /* free empty list returned by the hook */ av_undef(av); sv_free((SV *) av); /* * They must not change their mind in the middle of a serialization. */ if (hv_fetch(cxt->hclass, classname, len, FALSE)) CROAK(("Too late to ignore hooks for %s class \"%s\"", (cxt->optype & ST_CLONE) ? "cloning" : "storing", classname)); pkg_hide(aTHX_ cxt->hook, pkg, "STORABLE_freeze"); ASSERT(!pkg_can(aTHX_ cxt->hook, pkg, "STORABLE_freeze"), ("hook invisible")); TRACEME(("ignoring STORABLE_freeze in class \"%s\"", classname)); return store_blessed(aTHX_ cxt, sv, type, pkg); } /* * Get frozen string. */ ary = AvARRAY(av); pv = SvPV(ary[0], len2); /* We can't use pkg_can here because it only caches one method per * package */ { GV* gv = gv_fetchmethod_autoload(pkg, "STORABLE_attach", FALSE); if (gv && isGV(gv)) { if (count > 1) CROAK(("Freeze cannot return references if %s class is using STORABLE_attach", classname)); goto check_done; } } #ifdef HAS_U64 if (count > I32_MAX) { CROAK(("Too many references returned by STORABLE_freeze()")); } #endif /* * If they returned more than one item, we need to serialize some * extra references if not already done. * * Loop over the array, starting at position #1, and for each item, * ensure it is a reference, serialize it if not already done, and * replace the entry with the tag ID of the corresponding serialized * object. * * We CHEAT by not calling av_fetch() and read directly within the * array, for speed. */ for (i = 1; i < count; i++) { #ifdef USE_PTR_TABLE char *fake_tag; #else SV **svh; #endif SV *rsv = ary[i]; SV *xsv; SV *tag; AV *av_hook = cxt->hook_seen; if (!SvROK(rsv)) CROAK(("Item #%d returned by STORABLE_freeze " "for %s is not a reference", (int)i, classname)); xsv = SvRV(rsv); /* Follow ref to know what to look for */ /* * Look in hseen and see if we have a tag already. * Serialize entry if not done already, and get its tag. */ #ifdef USE_PTR_TABLE /* Fakery needed because ptr_table_fetch returns zero for a failure, whereas the existing code assumes that it can safely store a tag zero. So for ptr_tables we store tag+1 */ if ((fake_tag = (char *)ptr_table_fetch(cxt->pseen, xsv))) goto sv_seen; /* Avoid moving code too far to the right */ #else if ((svh = hv_fetch(cxt->hseen, (char *) &xsv, sizeof(xsv), FALSE))) goto sv_seen; /* Avoid moving code too far to the right */ #endif TRACEME(("listed object %d at 0x%" UVxf " is unknown", i-1, PTR2UV(xsv))); /* * We need to recurse to store that object and get it to be known * so that we can resolve the list of object-IDs at retrieve time. * * The first time we do this, we need to emit the proper header * indicating that we recursed, and what the type of object is (the * object we're storing via a user-hook). Indeed, during retrieval, * we'll have to create the object before recursing to retrieve the * others, in case those would point back at that object. */ /* [SX_HOOK] <flags> [<extra>] <object>*/ if (!recursed++) { #ifdef HAS_U64 if (len2 > INT32_MAX) PUTMARK(SX_LOBJECT); #endif PUTMARK(SX_HOOK); PUTMARK(flags); if (obj_type == SHT_EXTRA) PUTMARK(eflags); } else PUTMARK(flags); if ((ret = store(aTHX_ cxt, xsv))) /* Given by hook for us to store */ return ret; #ifdef USE_PTR_TABLE fake_tag = (char *)ptr_table_fetch(cxt->pseen, xsv); if (!fake_tag) CROAK(("Could not serialize item #%d from hook in %s", (int)i, classname)); #else svh = hv_fetch(cxt->hseen, (char *) &xsv, sizeof(xsv), FALSE); if (!svh) CROAK(("Could not serialize item #%d from hook in %s", (int)i, classname)); #endif /* * It was the first time we serialized 'xsv'. * * Keep this SV alive until the end of the serialization: if we * disposed of it right now by decrementing its refcount, and it was * a temporary value, some next temporary value allocated during * another STORABLE_freeze might take its place, and we'd wrongly * assume that new SV was already serialized, based on its presence * in cxt->hseen. * * Therefore, push it away in cxt->hook_seen. */ av_store(av_hook, AvFILLp(av_hook)+1, SvREFCNT_inc(xsv)); sv_seen: /* * Dispose of the REF they returned. If we saved the 'xsv' away * in the array of returned SVs, that will not cause the underlying * referenced SV to be reclaimed. */ ASSERT(SvREFCNT(xsv) > 1, ("SV will survive disposal of its REF")); SvREFCNT_dec(rsv); /* Dispose of reference */ /* * Replace entry with its tag (not a real SV, so no refcnt increment) */ #ifdef USE_PTR_TABLE tag = (SV *)--fake_tag; #else tag = *svh; #endif ary[i] = tag; TRACEME(("listed object %d at 0x%" UVxf " is tag #%" UVuf, i-1, PTR2UV(xsv), PTR2UV(tag))); #ifdef HAS_U64 if ((U32)PTR2TAG(tag) != PTR2TAG(tag)) need_large_oids = 1; #endif } /* * Allocate a class ID if not already done. * * This needs to be done after the recursion above, since at retrieval * time, we'll see the inner objects first. Many thanks to * Salvador Ortiz Garcia <sog@msg.com.mx> who spot that bug and * proposed the right fix. -- RAM, 15/09/2000 */ check_done: if (!known_class(aTHX_ cxt, classname, len, &classnum)) { TRACEME(("first time we see class %s, ID = %d", classname, (int)classnum)); classnum = -1; /* Mark: we must store classname */ } else { TRACEME(("already seen class %s, ID = %d", classname, (int)classnum)); } /* * Compute leading flags. */ flags = obj_type; if (((classnum == -1) ? len : classnum) > LG_SCALAR) flags |= SHF_LARGE_CLASSLEN; if (classnum != -1) flags |= SHF_IDX_CLASSNAME; if (len2 > LG_SCALAR) flags |= SHF_LARGE_STRLEN; if (count > 1) flags |= SHF_HAS_LIST; if (count > (LG_SCALAR + 1)) flags |= SHF_LARGE_LISTLEN; #ifdef HAS_U64 if (need_large_oids) flags |= SHF_LARGE_LISTLEN; #endif /* * We're ready to emit either serialized form: * * SX_HOOK <flags> <len> <classname> <len2> <str> [<len3> <object-IDs>] * SX_HOOK <flags> <index> <len2> <str> [<len3> <object-IDs>] * * If we recursed, the SX_HOOK has already been emitted. */ TRACEME(("SX_HOOK (recursed=%d) flags=0x%x " "class=%" IVdf " len=%" IVdf " len2=%" IVdf " len3=%" IVdf, recursed, flags, (IV)classnum, (IV)len, (IV)len2, count-1)); /* SX_HOOK <flags> [<extra>] */ if (!recursed) { #ifdef HAS_U64 if (len2 > INT32_MAX) PUTMARK(SX_LOBJECT); #endif PUTMARK(SX_HOOK); PUTMARK(flags); if (obj_type == SHT_EXTRA) PUTMARK(eflags); } else PUTMARK(flags); /* <len> <classname> or <index> */ if (flags & SHF_IDX_CLASSNAME) { if (flags & SHF_LARGE_CLASSLEN) WLEN(classnum); else { unsigned char cnum = (unsigned char) classnum; PUTMARK(cnum); } } else { if (flags & SHF_LARGE_CLASSLEN) WLEN(len); else { unsigned char clen = (unsigned char) len; PUTMARK(clen); } WRITE(classname, len); /* Final \0 is omitted */ } /* <len2> <frozen-str> */ #ifdef HAS_U64 if (len2 > INT32_MAX) { W64LEN(len2); } else #endif if (flags & SHF_LARGE_STRLEN) { U32 wlen2 = len2; /* STRLEN might be 8 bytes */ WLEN(wlen2); /* Must write an I32 for 64-bit machines */ } else { unsigned char clen = (unsigned char) len2; PUTMARK(clen); } if (len2) WRITE(pv, (SSize_t)len2); /* Final \0 is omitted */ /* [<len3> <object-IDs>] */ if (flags & SHF_HAS_LIST) { int len3 = count - 1; if (flags & SHF_LARGE_LISTLEN) { #ifdef HAS_U64 int tlen3 = need_large_oids ? -len3 : len3; WLEN(tlen3); #else WLEN(len3); #endif } else { unsigned char clen = (unsigned char) len3; PUTMARK(clen); } /* * NOTA BENE, for 64-bit machines: the ary[i] below does not yield a * real pointer, rather a tag number, well under the 32-bit limit. * Which is wrong... if we have more than 2**32 SVs we can get ids over * the 32-bit limit. */ for (i = 1; i < count; i++) { #ifdef HAS_U64 if (need_large_oids) { ntag_t tag = PTR2TAG(ary[i]); W64LEN(tag); TRACEME(("object %d, tag #%" UVuf, i-1, (UV)tag)); } else #endif { I32 tagval = htonl(LOW_32BITS(ary[i])); WRITE_I32(tagval); TRACEME(("object %d, tag #%d", i-1, ntohl(tagval))); } } } /* * Free the array. We need extra care for indices after 0, since they * don't hold real SVs but integers cast. */ if (count > 1) AvFILLp(av) = 0; /* Cheat, nothing after 0 interests us */ av_undef(av); sv_free((SV *) av); /* * If object was tied, need to insert serialization of the magic object. */ if (obj_type == SHT_EXTRA) { MAGIC *mg; if (!(mg = mg_find(sv, mtype))) { int svt = SvTYPE(sv); CROAK(("No magic '%c' found while storing ref to tied %s with hook", mtype, (svt == SVt_PVHV) ? "hash" : (svt == SVt_PVAV) ? "array" : "scalar")); } TRACEME(("handling the magic object 0x%" UVxf " part of 0x%" UVxf, PTR2UV(mg->mg_obj), PTR2UV(sv))); /* * [<magic object>] */ if ((ret = store(aTHX_ cxt, mg->mg_obj))) return ret; } return 0; } /* * store_blessed -- dispatched manually, not via sv_store[] * * Check whether there is a STORABLE_xxx hook defined in the class or in one * of its ancestors. If there is, then redispatch to store_hook(); * * Otherwise, the blessed SV is stored using the following layout: * * SX_BLESS <flag> <len> <classname> <object> * * where <flag> indicates whether <len> is stored on 0 or 4 bytes, depending * on the high-order bit in flag: if 1, then length follows on 4 bytes. * Otherwise, the low order bits give the length, thereby giving a compact * representation for class names less than 127 chars long. * * Each <classname> seen is remembered and indexed, so that the next time * an object in the blessed in the same <classname> is stored, the following * will be emitted: * * SX_IX_BLESS <flag> <index> <object> * * where <index> is the classname index, stored on 0 or 4 bytes depending * on the high-order bit in flag (same encoding as above for <len>). */ static int store_blessed( pTHX_ stcxt_t *cxt, SV *sv, int type, HV *pkg) { SV *hook; char *classname; I32 len; I32 classnum; TRACEME(("store_blessed, type %d, class \"%s\"", type, HvNAME_get(pkg))); /* * Look for a hook for this blessed SV and redirect to store_hook() * if needed. */ hook = pkg_can(aTHX_ cxt->hook, pkg, "STORABLE_freeze"); if (hook) return store_hook(aTHX_ cxt, sv, type, pkg, hook); /* * This is a blessed SV without any serialization hook. */ classname = HvNAME_get(pkg); len = strlen(classname); TRACEME(("blessed 0x%" UVxf " in %s, no hook: tagged #%d", PTR2UV(sv), classname, (int)cxt->tagnum)); /* * Determine whether it is the first time we see that class name (in which * case it will be stored in the SX_BLESS form), or whether we already * saw that class name before (in which case the SX_IX_BLESS form will be * used). */ if (known_class(aTHX_ cxt, classname, len, &classnum)) { TRACEME(("already seen class %s, ID = %d", classname, (int)classnum)); PUTMARK(SX_IX_BLESS); if (classnum <= LG_BLESS) { unsigned char cnum = (unsigned char) classnum; PUTMARK(cnum); } else { unsigned char flag = (unsigned char) 0x80; PUTMARK(flag); WLEN(classnum); } } else { TRACEME(("first time we see class %s, ID = %d", classname, (int)classnum)); PUTMARK(SX_BLESS); if (len <= LG_BLESS) { unsigned char clen = (unsigned char) len; PUTMARK(clen); } else { unsigned char flag = (unsigned char) 0x80; PUTMARK(flag); WLEN(len); /* Don't BER-encode, this should be rare */ } WRITE(classname, len); /* Final \0 is omitted */ } /* * Now emit the <object> part. */ return SV_STORE(type)(aTHX_ cxt, sv); } /* * store_other * * We don't know how to store the item we reached, so return an error condition. * (it's probably a GLOB, some CODE reference, etc...) * * If they defined the 'forgive_me' variable at the Perl level to some * true value, then don't croak, just warn, and store a placeholder string * instead. */ static int store_other(pTHX_ stcxt_t *cxt, SV *sv) { STRLEN len; char buf[80]; TRACEME(("store_other")); /* * Fetch the value from perl only once per store() operation. */ if ( cxt->forgive_me == 0 || (cxt->forgive_me < 0 && !(cxt->forgive_me = SvTRUE (get_sv("Storable::forgive_me", GV_ADD)) ? 1 : 0)) ) CROAK(("Can't store %s items", sv_reftype(sv, FALSE))); warn("Can't store item %s(0x%" UVxf ")", sv_reftype(sv, FALSE), PTR2UV(sv)); /* * Store placeholder string as a scalar instead... */ (void) sprintf(buf, "You lost %s(0x%" UVxf ")%c", sv_reftype(sv, FALSE), PTR2UV(sv), (char) 0); len = strlen(buf); if (len < 80) STORE_SCALAR(buf, len); TRACEME(("ok (dummy \"%s\", length = %" IVdf ")", buf, (IV) len)); return 0; } /*** *** Store driving routines ***/ /* * sv_type * * WARNING: partially duplicates Perl's sv_reftype for speed. * * Returns the type of the SV, identified by an integer. That integer * may then be used to index the dynamic routine dispatch table. */ static int sv_type(pTHX_ SV *sv) { switch (SvTYPE(sv)) { case SVt_NULL: #if PERL_VERSION_LT(5,11,0) case SVt_IV: #endif case SVt_NV: /* * No need to check for ROK, that can't be set here since there * is no field capable of hodling the xrv_rv reference. */ return svis_SCALAR; case SVt_PV: #if PERL_VERSION_LT(5,11,0) case SVt_RV: #else case SVt_IV: #endif case SVt_PVIV: case SVt_PVNV: /* * Starting from SVt_PV, it is possible to have the ROK flag * set, the pointer to the other SV being either stored in * the xrv_rv (in the case of a pure SVt_RV), or as the * xpv_pv field of an SVt_PV and its heirs. * * However, those SV cannot be magical or they would be an * SVt_PVMG at least. */ return SvROK(sv) ? svis_REF : svis_SCALAR; case SVt_PVMG: #if PERL_VERSION_LT(5,11,0) if ((SvFLAGS(sv) & (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG)) == (SVs_OBJECT|BFD_Svs_SMG_OR_RMG) && mg_find(sv, PERL_MAGIC_qr)) { return svis_REGEXP; } #endif case SVt_PVLV: /* Workaround for perl5.004_04 "LVALUE" bug */ if ((SvFLAGS(sv) & (SVs_GMG|SVs_SMG|SVs_RMG)) == (SVs_GMG|SVs_SMG|SVs_RMG) && (mg_find(sv, 'p'))) return svis_TIED_ITEM; /* FALL THROUGH */ #if PERL_VERSION_LT(5,9,0) case SVt_PVBM: #endif if ((SvFLAGS(sv) & (SVs_GMG|SVs_SMG|SVs_RMG)) == (SVs_GMG|SVs_SMG|SVs_RMG) && (mg_find(sv, 'q'))) return svis_TIED; return SvROK(sv) ? svis_REF : svis_SCALAR; case SVt_PVAV: if (SvRMAGICAL(sv) && (mg_find(sv, 'P'))) return svis_TIED; return svis_ARRAY; case SVt_PVHV: if (SvRMAGICAL(sv) && (mg_find(sv, 'P'))) return svis_TIED; return svis_HASH; case SVt_PVCV: return svis_CODE; #if PERL_VERSION_GE(5,9,0) /* case SVt_INVLIST: */ #endif #if PERL_VERSION_GE(5,11,0) case SVt_REGEXP: return svis_REGEXP; #endif default: break; } return svis_OTHER; } /* * store * * Recursively store objects pointed to by the sv to the specified file. * * Layout is <content> or SX_OBJECT <tagnum> if we reach an already stored * object (one for which storage has started -- it may not be over if we have * a self-referenced structure). This data set forms a stored <object>. */ static int store(pTHX_ stcxt_t *cxt, SV *sv) { SV **svh; int ret; int type; #ifdef USE_PTR_TABLE struct ptr_tbl *pseen = cxt->pseen; #else HV *hseen = cxt->hseen; #endif TRACEME(("store (0x%" UVxf ")", PTR2UV(sv))); /* * If object has already been stored, do not duplicate data. * Simply emit the SX_OBJECT marker followed by its tag data. * The tag is always written in network order. * * NOTA BENE, for 64-bit machines: the "*svh" below does not yield a * real pointer, rather a tag number (watch the insertion code below). * That means it probably safe to assume it is well under the 32-bit * limit, and makes the truncation safe. * -- RAM, 14/09/1999 */ #ifdef USE_PTR_TABLE svh = (SV **)ptr_table_fetch(pseen, sv); #else svh = hv_fetch(hseen, (char *) &sv, sizeof(sv), FALSE); #endif if (svh) { ntag_t tagval; if (sv == &PL_sv_undef) { /* We have seen PL_sv_undef before, but fake it as if we have not. Not the simplest solution to making restricted hashes work on 5.8.0, but it does mean that repeated references to the one true undef will take up less space in the output file. */ /* Need to jump past the next hv_store, because on the second store of undef the old hash value will be SvREFCNT_dec()ed, and as Storable cheats horribly by storing non-SVs in the hash a SEGV will ensure. Need to increase the tag number so that the receiver has no idea what games we're up to. This special casing doesn't affect hooks that store undef, as the hook routine does its own lookup into hseen. Also this means that any references back to PL_sv_undef (from the pathological case of hooks storing references to it) will find the seen hash entry for the first time, as if we didn't have this hackery here. (That hseen lookup works even on 5.8.0 because it's a key of &PL_sv_undef and a value which is a tag number, not a value which is PL_sv_undef.) */ cxt->tagnum++; type = svis_SCALAR; goto undef_special_case; } #ifdef USE_PTR_TABLE tagval = PTR2TAG(((char *)svh)-1); #else tagval = PTR2TAG(*svh); #endif #ifdef HAS_U64 /* older versions of Storable streat the tag as a signed value used in an array lookup, corrupting the data structure. Ensure only a newer Storable will be able to parse this tag id if it's over the 2G mark. */ if (tagval > I32_MAX) { TRACEME(("object 0x%" UVxf " seen as #%" UVuf, PTR2UV(sv), (UV)tagval)); PUTMARK(SX_LOBJECT); PUTMARK(SX_OBJECT); W64LEN(tagval); return 0; } else #endif { I32 ltagval; ltagval = htonl((I32)tagval); TRACEME(("object 0x%" UVxf " seen as #%d", PTR2UV(sv), ntohl(ltagval))); PUTMARK(SX_OBJECT); WRITE_I32(ltagval); return 0; } } /* * Allocate a new tag and associate it with the address of the sv being * stored, before recursing... * * In order to avoid creating new SvIVs to hold the tagnum we just * cast the tagnum to an SV pointer and store that in the hash. This * means that we must clean up the hash manually afterwards, but gives * us a 15% throughput increase. * */ cxt->tagnum++; #ifdef USE_PTR_TABLE ptr_table_store(pseen, sv, INT2PTR(SV*, 1 + cxt->tagnum)); #else if (!hv_store(hseen, (char *) &sv, sizeof(sv), INT2PTR(SV*, cxt->tagnum), 0)) return -1; #endif /* * Store 'sv' and everything beneath it, using appropriate routine. * Abort immediately if we get a non-zero status back. */ type = sv_type(aTHX_ sv); undef_special_case: TRACEME(("storing 0x%" UVxf " tag #%d, type %d...", PTR2UV(sv), (int)cxt->tagnum, (int)type)); if (SvOBJECT(sv)) { HV *pkg = SvSTASH(sv); ret = store_blessed(aTHX_ cxt, sv, type, pkg); } else ret = SV_STORE(type)(aTHX_ cxt, sv); TRACEME(("%s (stored 0x%" UVxf ", refcnt=%d, %s)", ret ? "FAILED" : "ok", PTR2UV(sv), (int)SvREFCNT(sv), sv_reftype(sv, FALSE))); return ret; } /* * magic_write * * Write magic number and system information into the file. * Layout is <magic> <network> [<len> <byteorder> <sizeof int> <sizeof long> * <sizeof ptr>] where <len> is the length of the byteorder hexa string. * All size and lengths are written as single characters here. * * Note that no byte ordering info is emitted when <network> is true, since * integers will be emitted in network order in that case. */ static int magic_write(pTHX_ stcxt_t *cxt) { /* * Starting with 0.6, the "use_network_order" byte flag is also used to * indicate the version number of the binary image, encoded in the upper * bits. The bit 0 is always used to indicate network order. */ /* * Starting with 0.7, a full byte is dedicated to the minor version of * the binary format, which is incremented only when new markers are * introduced, for instance, but when backward compatibility is preserved. */ /* Make these at compile time. The WRITE() macro is sufficiently complex that it saves about 200 bytes doing it this way and only using it once. */ static const unsigned char network_file_header[] = { MAGICSTR_BYTES, (STORABLE_BIN_MAJOR << 1) | 1, STORABLE_BIN_WRITE_MINOR }; static const unsigned char file_header[] = { MAGICSTR_BYTES, (STORABLE_BIN_MAJOR << 1) | 0, STORABLE_BIN_WRITE_MINOR, /* sizeof the array includes the 0 byte at the end: */ (char) sizeof (byteorderstr) - 1, BYTEORDER_BYTES, (unsigned char) sizeof(int), (unsigned char) sizeof(long), (unsigned char) sizeof(char *), (unsigned char) sizeof(NV) }; #ifdef USE_56_INTERWORK_KLUDGE static const unsigned char file_header_56[] = { MAGICSTR_BYTES, (STORABLE_BIN_MAJOR << 1) | 0, STORABLE_BIN_WRITE_MINOR, /* sizeof the array includes the 0 byte at the end: */ (char) sizeof (byteorderstr_56) - 1, BYTEORDER_BYTES_56, (unsigned char) sizeof(int), (unsigned char) sizeof(long), (unsigned char) sizeof(char *), (unsigned char) sizeof(NV) }; #endif const unsigned char *header; SSize_t length; TRACEME(("magic_write on fd=%d", cxt->fio ? PerlIO_fileno(cxt->fio) : -1)); if (cxt->netorder) { header = network_file_header; length = sizeof (network_file_header); } else { #ifdef USE_56_INTERWORK_KLUDGE if (SvTRUE(get_sv("Storable::interwork_56_64bit", GV_ADD))) { header = file_header_56; length = sizeof (file_header_56); } else #endif { header = file_header; length = sizeof (file_header); } } if (!cxt->fio) { /* sizeof the array includes the 0 byte at the end. */ header += sizeof (magicstr) - 1; length -= sizeof (magicstr) - 1; } WRITE( (unsigned char*) header, length); if (!cxt->netorder) { TRACEME(("ok (magic_write byteorder = 0x%lx [%d], I%d L%d P%d D%d)", (unsigned long) BYTEORDER, (int) sizeof (byteorderstr) - 1, (int) sizeof(int), (int) sizeof(long), (int) sizeof(char *), (int) sizeof(NV))); } return 0; } /* * do_store * * Common code for store operations. * * When memory store is requested (f = NULL) and a non null SV* is given in * 'res', it is filled with a new SV created out of the memory buffer. * * It is required to provide a non-null 'res' when the operation type is not * dclone() and store() is performed to memory. */ static int do_store(pTHX_ PerlIO *f, SV *sv, int optype, int network_order, SV **res) { dSTCXT; int status; ASSERT(!(f == 0 && !(optype & ST_CLONE)) || res, ("must supply result SV pointer for real recursion to memory")); TRACEMED(("do_store (optype=%d, netorder=%d)", optype, network_order)); optype |= ST_STORE; /* * Workaround for CROAK leak: if they enter with a "dirty" context, * free up memory for them now. */ assert(cxt); if (cxt->s_dirty) clean_context(aTHX_ cxt); /* * Now that STORABLE_xxx hooks exist, it is possible that they try to * re-enter store() via the hooks. We need to stack contexts. */ if (cxt->entry) cxt = allocate_context(aTHX_ cxt); INIT_TRACEME; cxt->entry++; ASSERT(cxt->entry == 1, ("starting new recursion")); ASSERT(!cxt->s_dirty, ("clean context")); /* * Ensure sv is actually a reference. From perl, we called something * like: * pstore(aTHX_ FILE, \@array); * so we must get the scalar value behind that reference. */ if (!SvROK(sv)) CROAK(("Not a reference")); sv = SvRV(sv); /* So follow it to know what to store */ /* * If we're going to store to memory, reset the buffer. */ if (!f) MBUF_INIT(0); /* * Prepare context and emit headers. */ init_store_context(aTHX_ cxt, f, optype, network_order); if (-1 == magic_write(aTHX_ cxt)) /* Emit magic and ILP info */ return 0; /* Error */ /* * Recursively store object... */ ASSERT(is_storing(aTHX), ("within store operation")); status = store(aTHX_ cxt, sv); /* Just do it! */ /* * If they asked for a memory store and they provided an SV pointer, * make an SV string out of the buffer and fill their pointer. * * When asking for ST_REAL, it's MANDATORY for the caller to provide * an SV, since context cleanup might free the buffer if we did recurse. * (unless caller is dclone(), which is aware of that). */ if (!cxt->fio && res) *res = mbuf2sv(aTHX); TRACEME(("do_store returns %d", status)); /* * Final cleanup. * * The "root" context is never freed, since it is meant to be always * handy for the common case where no recursion occurs at all (i.e. * we enter store() outside of any Storable code and leave it, period). * We know it's the "root" context because there's nothing stacked * underneath it. * * OPTIMIZATION: * * When deep cloning, we don't free the context: doing so would force * us to copy the data in the memory buffer. Sicne we know we're * about to enter do_retrieve... */ clean_store_context(aTHX_ cxt); if (cxt->prev && !(cxt->optype & ST_CLONE)) free_context(aTHX_ cxt); return status == 0; } /*** *** Memory stores. ***/ /* * mbuf2sv * * Build a new SV out of the content of the internal memory buffer. */ static SV *mbuf2sv(pTHX) { dSTCXT; assert(cxt); return newSVpv(mbase, MBUF_SIZE()); } /*** *** Specific retrieve callbacks. ***/ /* * retrieve_other * * Return an error via croak, since it is not possible that we get here * under normal conditions, when facing a file produced via pstore(). */ static SV *retrieve_other(pTHX_ stcxt_t *cxt, const char *cname) { PERL_UNUSED_ARG(cname); if ( cxt->ver_major != STORABLE_BIN_MAJOR && cxt->ver_minor != STORABLE_BIN_MINOR ) { CROAK(("Corrupted storable %s (binary v%d.%d), current is v%d.%d", cxt->fio ? "file" : "string", cxt->ver_major, cxt->ver_minor, STORABLE_BIN_MAJOR, STORABLE_BIN_MINOR)); } else { CROAK(("Corrupted storable %s (binary v%d.%d)", cxt->fio ? "file" : "string", cxt->ver_major, cxt->ver_minor)); } return (SV *) 0; /* Just in case */ } /* * retrieve_idx_blessed * * Layout is SX_IX_BLESS <index> <object> with SX_IX_BLESS already read. * <index> can be coded on either 1 or 5 bytes. */ static SV *retrieve_idx_blessed(pTHX_ stcxt_t *cxt, const char *cname) { I32 idx; const char *classname; SV **sva; SV *sv; PERL_UNUSED_ARG(cname); TRACEME(("retrieve_idx_blessed (#%d)", (int)cxt->tagnum)); ASSERT(!cname, ("no bless-into class given here, got %s", cname)); GETMARK(idx); /* Index coded on a single char? */ if (idx & 0x80) RLEN(idx); /* * Fetch classname in 'aclass' */ sva = av_fetch(cxt->aclass, idx, FALSE); if (!sva) CROAK(("Class name #%" IVdf " should have been seen already", (IV) idx)); classname = SvPVX(*sva); /* We know it's a PV, by construction */ TRACEME(("class ID %d => %s", (int)idx, classname)); /* * Retrieve object and bless it. */ sv = retrieve(aTHX_ cxt, classname); /* First SV which is SEEN will be blessed */ return sv; } /* * retrieve_blessed * * Layout is SX_BLESS <len> <classname> <object> with SX_BLESS already read. * <len> can be coded on either 1 or 5 bytes. */ static SV *retrieve_blessed(pTHX_ stcxt_t *cxt, const char *cname) { U32 len; SV *sv; char buf[LG_BLESS + 1]; /* Avoid malloc() if possible */ char *classname = buf; char *malloced_classname = NULL; PERL_UNUSED_ARG(cname); TRACEME(("retrieve_blessed (#%d)", (int)cxt->tagnum)); ASSERT(!cname, ("no bless-into class given here, got %s", cname)); /* * Decode class name length and read that name. * * Short classnames have two advantages: their length is stored on one * single byte, and the string can be read on the stack. */ GETMARK(len); /* Length coded on a single char? */ if (len & 0x80) { RLEN(len); TRACEME(("** allocating %ld bytes for class name", (long)len+1)); if (len > I32_MAX) CROAK(("Corrupted classname length %lu", (long)len)); PL_nomemok = TRUE; /* handle error by ourselves */ New(10003, classname, len+1, char); PL_nomemok = FALSE; if (!classname) CROAK(("Out of memory with len %ld", (long)len)); PL_nomemok = FALSE; malloced_classname = classname; } SAFEPVREAD(classname, (I32)len, malloced_classname); classname[len] = '\0'; /* Mark string end */ /* * It's a new classname, otherwise it would have been an SX_IX_BLESS. */ TRACEME(("new class name \"%s\" will bear ID = %d", classname, (int)cxt->classnum)); if (!av_store(cxt->aclass, cxt->classnum++, newSVpvn(classname, len))) { Safefree(malloced_classname); return (SV *) 0; } /* * Retrieve object and bless it. */ sv = retrieve(aTHX_ cxt, classname); /* First SV which is SEEN will be blessed */ if (malloced_classname) Safefree(malloced_classname); return sv; } /* * retrieve_hook * * Layout: SX_HOOK <flags> <len> <classname> <len2> <str> [<len3> <object-IDs>] * with leading mark already read, as usual. * * When recursion was involved during serialization of the object, there * is an unknown amount of serialized objects after the SX_HOOK mark. Until * we reach a <flags> marker with the recursion bit cleared. * * If the first <flags> byte contains a type of SHT_EXTRA, then the real type * is held in the <extra> byte, and if the object is tied, the serialized * magic object comes at the very end: * * SX_HOOK <flags> <extra> ... [<len3> <object-IDs>] <magic object> * * This means the STORABLE_thaw hook will NOT get a tied variable during its * processing (since we won't have seen the magic object by the time the hook * is called). See comments below for why it was done that way. */ static SV *retrieve_hook_common(pTHX_ stcxt_t *cxt, const char *cname, int large) { U32 len; char buf[LG_BLESS + 1]; /* Avoid malloc() if possible */ char *classname = buf; unsigned int flags; STRLEN len2; SV *frozen; I32 len3 = 0; AV *av = 0; SV *hook; SV *sv; SV *rv; GV *attach; HV *stash; int obj_type; int clone = cxt->optype & ST_CLONE; char mtype = '\0'; unsigned int extra_type = 0; #ifdef HAS_U64 int has_large_oids = 0; #endif PERL_UNUSED_ARG(cname); TRACEME(("retrieve_hook (#%d)", (int)cxt->tagnum)); ASSERT(!cname, ("no bless-into class given here, got %s", cname)); #ifndef HAS_U64 assert(!large); PERL_UNUSED_ARG(large); #endif /* * Read flags, which tell us about the type, and whether we need * to recurse. */ GETMARK(flags); /* * Create the (empty) object, and mark it as seen. * * This must be done now, because tags are incremented, and during * serialization, the object tag was affected before recursion could * take place. */ obj_type = flags & SHF_TYPE_MASK; switch (obj_type) { case SHT_SCALAR: sv = newSV(0); break; case SHT_ARRAY: sv = (SV *) newAV(); break; case SHT_HASH: sv = (SV *) newHV(); break; case SHT_EXTRA: /* * Read <extra> flag to know the type of the object. * Record associated magic type for later. */ GETMARK(extra_type); switch (extra_type) { case SHT_TSCALAR: sv = newSV(0); mtype = 'q'; break; case SHT_TARRAY: sv = (SV *) newAV(); mtype = 'P'; break; case SHT_THASH: sv = (SV *) newHV(); mtype = 'P'; break; default: return retrieve_other(aTHX_ cxt, 0);/* Let it croak */ } break; default: return retrieve_other(aTHX_ cxt, 0); /* Let it croak */ } SEEN0_NN(sv, 0); /* Don't bless yet */ /* * Whilst flags tell us to recurse, do so. * * We don't need to remember the addresses returned by retrieval, because * all the references will be obtained through indirection via the object * tags in the object-ID list. * * We need to decrement the reference count for these objects * because, if the user doesn't save a reference to them in the hook, * they must be freed when this context is cleaned. */ while (flags & SHF_NEED_RECURSE) { TRACEME(("retrieve_hook recursing...")); rv = retrieve(aTHX_ cxt, 0); if (!rv) return (SV *) 0; SvREFCNT_dec(rv); TRACEME(("retrieve_hook back with rv=0x%" UVxf, PTR2UV(rv))); GETMARK(flags); } if (flags & SHF_IDX_CLASSNAME) { SV **sva; I32 idx; /* * Fetch index from 'aclass' */ if (flags & SHF_LARGE_CLASSLEN) RLEN(idx); else GETMARK(idx); sva = av_fetch(cxt->aclass, idx, FALSE); if (!sva) CROAK(("Class name #%" IVdf " should have been seen already", (IV) idx)); classname = SvPVX(*sva); /* We know it's a PV, by construction */ TRACEME(("class ID %d => %s", (int)idx, classname)); } else { /* * Decode class name length and read that name. * * NOTA BENE: even if the length is stored on one byte, we don't read * on the stack. Just like retrieve_blessed(), we limit the name to * LG_BLESS bytes. This is an arbitrary decision. */ char *malloced_classname = NULL; if (flags & SHF_LARGE_CLASSLEN) RLEN(len); else GETMARK(len); TRACEME(("** allocating %ld bytes for class name", (long)len+1)); if (len > I32_MAX) /* security */ CROAK(("Corrupted classname length %lu", (long)len)); else if (len > LG_BLESS) { /* security: signed len */ PL_nomemok = TRUE; /* handle error by ourselves */ New(10003, classname, len+1, char); PL_nomemok = FALSE; if (!classname) CROAK(("Out of memory with len %u", (unsigned)len+1)); malloced_classname = classname; } SAFEPVREAD(classname, (I32)len, malloced_classname); classname[len] = '\0'; /* Mark string end */ /* * Record new classname. */ if (!av_store(cxt->aclass, cxt->classnum++, newSVpvn(classname, len))) { Safefree(malloced_classname); return (SV *) 0; } } TRACEME(("class name: %s", classname)); /* * Decode user-frozen string length and read it in an SV. * * For efficiency reasons, we read data directly into the SV buffer. * To understand that code, read retrieve_scalar() */ #ifdef HAS_U64 if (large) { READ_U64(len2); } else #endif if (flags & SHF_LARGE_STRLEN) { U32 len32; RLEN(len32); len2 = len32; } else GETMARK(len2); frozen = NEWSV(10002, len2 ? len2 : 1); if (len2) { SAFEREAD(SvPVX(frozen), len2, frozen); } SvCUR_set(frozen, len2); *SvEND(frozen) = '\0'; (void) SvPOK_only(frozen); /* Validates string pointer */ if (cxt->s_tainted) /* Is input source tainted? */ SvTAINT(frozen); TRACEME(("frozen string: %d bytes", (int)len2)); /* * Decode object-ID list length, if present. */ if (flags & SHF_HAS_LIST) { if (flags & SHF_LARGE_LISTLEN) { RLEN(len3); if (len3 < 0) { #ifdef HAS_U64 ++has_large_oids; len3 = -len3; #else CROAK(("Large object ids in hook data not supported on 32-bit platforms")); #endif } } else GETMARK(len3); if (len3) { av = newAV(); av_extend(av, len3 + 1); /* Leave room for [0] */ AvFILLp(av) = len3; /* About to be filled anyway */ } } TRACEME(("has %d object IDs to link", (int)len3)); /* * Read object-ID list into array. * Because we pre-extended it, we can cheat and fill it manually. * * We read object tags and we can convert them into SV* on the fly * because we know all the references listed in there (as tags) * have been already serialized, hence we have a valid correspondence * between each of those tags and the recreated SV. */ if (av) { SV **ary = AvARRAY(av); int i; for (i = 1; i <= len3; i++) { /* We leave [0] alone */ ntag_t tag; SV **svh; SV *xsv; #ifdef HAS_U64 if (has_large_oids) { READ_U64(tag); } else { U32 tmp; READ_I32(tmp); tag = ntohl(tmp); } #else READ_I32(tag); tag = ntohl(tag); #endif svh = av_fetch(cxt->aseen, tag, FALSE); if (!svh) { if (tag == cxt->where_is_undef) { /* av_fetch uses PL_sv_undef internally, hence this somewhat gruesome hack. */ xsv = &PL_sv_undef; svh = &xsv; } else { CROAK(("Object #%" IVdf " should have been retrieved already", (IV) tag)); } } xsv = *svh; ary[i] = SvREFCNT_inc(xsv); } } /* * Look up the STORABLE_attach hook * If blessing is disabled, just return what we've got. */ if (!(cxt->flags & FLAG_BLESS_OK)) { TRACEME(("skipping bless because flags is %d", cxt->flags)); return sv; } /* * Bless the object and look up the STORABLE_thaw hook. */ stash = gv_stashpv(classname, GV_ADD); /* Handle attach case; again can't use pkg_can because it only * caches one method */ attach = gv_fetchmethod_autoload(stash, "STORABLE_attach", FALSE); if (attach && isGV(attach)) { SV* attached; SV* attach_hook = newRV_inc((SV*) GvCV(attach)); if (av) CROAK(("STORABLE_attach called with unexpected references")); av = newAV(); av_extend(av, 1); AvFILLp(av) = 0; AvARRAY(av)[0] = SvREFCNT_inc(frozen); rv = newSVpv(classname, 0); attached = scalar_call(aTHX_ rv, attach_hook, clone, av, G_SCALAR); /* Free memory after a call */ SvREFCNT_dec(rv); SvREFCNT_dec(frozen); av_undef(av); sv_free((SV *) av); SvREFCNT_dec(attach_hook); if (attached && SvROK(attached) && sv_derived_from(attached, classname) ) { UNSEE(); /* refcnt of unneeded sv is 2 at this point (one from newHV, second from SEEN call) */ SvREFCNT_dec(sv); SvREFCNT_dec(sv); /* we need to free RV but preserve value that RV point to */ sv = SvRV(attached); SEEN0_NN(sv, 0); SvRV_set(attached, NULL); SvREFCNT_dec(attached); if (!(flags & SHF_IDX_CLASSNAME) && classname != buf) Safefree(classname); return sv; } CROAK(("STORABLE_attach did not return a %s object", classname)); } /* * Bless the object and look up the STORABLE_thaw hook. */ BLESS(sv, stash); hook = pkg_can(aTHX_ cxt->hook, stash, "STORABLE_thaw"); if (!hook) { /* * Hook not found. Maybe they did not require the module where this * hook is defined yet? * * If the load below succeeds, we'll be able to find the hook. * Still, it only works reliably when each class is defined in a * file of its own. */ TRACEME(("No STORABLE_thaw defined for objects of class %s", classname)); TRACEME(("Going to load module '%s'", classname)); load_module(PERL_LOADMOD_NOIMPORT, newSVpv(classname, 0), Nullsv); /* * We cache results of pkg_can, so we need to uncache before attempting * the lookup again. */ pkg_uncache(aTHX_ cxt->hook, SvSTASH(sv), "STORABLE_thaw"); hook = pkg_can(aTHX_ cxt->hook, SvSTASH(sv), "STORABLE_thaw"); if (!hook) CROAK(("No STORABLE_thaw defined for objects of class %s " "(even after a \"require %s;\")", classname, classname)); } /* * If we don't have an 'av' yet, prepare one. * Then insert the frozen string as item [0]. */ if (!av) { av = newAV(); av_extend(av, 1); AvFILLp(av) = 0; } AvARRAY(av)[0] = SvREFCNT_inc(frozen); /* * Call the hook as: * * $object->STORABLE_thaw($cloning, $frozen, @refs); * * where $object is our blessed (empty) object, $cloning is a boolean * telling whether we're running a deep clone, $frozen is the frozen * string the user gave us in his serializing hook, and @refs, which may * be empty, is the list of extra references he returned along for us * to serialize. * * In effect, the hook is an alternate creation routine for the class, * the object itself being already created by the runtime. */ TRACEME(("calling STORABLE_thaw on %s at 0x%" UVxf " (%" IVdf " args)", classname, PTR2UV(sv), (IV) AvFILLp(av) + 1)); rv = newRV_inc(sv); (void) scalar_call(aTHX_ rv, hook, clone, av, G_SCALAR|G_DISCARD); SvREFCNT_dec(rv); /* * Final cleanup. */ SvREFCNT_dec(frozen); av_undef(av); sv_free((SV *) av); if (!(flags & SHF_IDX_CLASSNAME) && classname != buf) Safefree(classname); /* * If we had an <extra> type, then the object was not as simple, and * we need to restore extra magic now. */ if (!extra_type) return sv; TRACEME(("retrieving magic object for 0x%" UVxf "...", PTR2UV(sv))); rv = retrieve(aTHX_ cxt, 0); /* Retrieve <magic object> */ TRACEME(("restoring the magic object 0x%" UVxf " part of 0x%" UVxf, PTR2UV(rv), PTR2UV(sv))); switch (extra_type) { case SHT_TSCALAR: sv_upgrade(sv, SVt_PVMG); break; case SHT_TARRAY: sv_upgrade(sv, SVt_PVAV); AvREAL_off((AV *)sv); break; case SHT_THASH: sv_upgrade(sv, SVt_PVHV); break; default: CROAK(("Forgot to deal with extra type %d", extra_type)); break; } /* * Adding the magic only now, well after the STORABLE_thaw hook was called * means the hook cannot know it deals with an object whose variable is * tied. But this is happening when retrieving $o in the following case: * * my %h; * tie %h, 'FOO'; * my $o = bless \%h, 'BAR'; * * The 'BAR' class is NOT the one where %h is tied into. Therefore, as * far as the 'BAR' class is concerned, the fact that %h is not a REAL * hash but a tied one should not matter at all, and remain transparent. * This means the magic must be restored by Storable AFTER the hook is * called. * * That looks very reasonable to me, but then I've come up with this * after a bug report from David Nesting, who was trying to store such * an object and caused Storable to fail. And unfortunately, it was * also the easiest way to retrofit support for blessed ref to tied objects * into the existing design. -- RAM, 17/02/2001 */ sv_magic(sv, rv, mtype, (char *)NULL, 0); SvREFCNT_dec(rv); /* Undo refcnt inc from sv_magic() */ return sv; } static SV *retrieve_hook(pTHX_ stcxt_t *cxt, const char *cname) { return retrieve_hook_common(aTHX_ cxt, cname, FALSE); } /* * retrieve_ref * * Retrieve reference to some other scalar. * Layout is SX_REF <object>, with SX_REF already read. */ static SV *retrieve_ref(pTHX_ stcxt_t *cxt, const char *cname) { SV *rv; SV *sv; HV *stash; TRACEME(("retrieve_ref (#%d)", (int)cxt->tagnum)); /* * We need to create the SV that holds the reference to the yet-to-retrieve * object now, so that we may record the address in the seen table. * Otherwise, if the object to retrieve references us, we won't be able * to resolve the SX_OBJECT we'll see at that point! Hence we cannot * do the retrieve first and use rv = newRV(sv) since it will be too late * for SEEN() recording. */ rv = NEWSV(10002, 0); if (cname) stash = gv_stashpv(cname, GV_ADD); else stash = 0; SEEN_NN(rv, stash, 0); /* Will return if rv is null */ sv = retrieve(aTHX_ cxt, 0);/* Retrieve <object> */ if (!sv) return (SV *) 0; /* Failed */ /* * WARNING: breaks RV encapsulation. * * Now for the tricky part. We have to upgrade our existing SV, so that * it is now an RV on sv... Again, we cheat by duplicating the code * held in newSVrv(), since we already got our SV from retrieve(). * * We don't say: * * SvRV(rv) = SvREFCNT_inc(sv); * * here because the reference count we got from retrieve() above is * already correct: if the object was retrieved from the file, then * its reference count is one. Otherwise, if it was retrieved via * an SX_OBJECT indication, a ref count increment was done. */ if (cname) { /* No need to do anything, as rv will already be PVMG. */ assert (SvTYPE(rv) == SVt_RV || SvTYPE(rv) >= SVt_PV); } else { sv_upgrade(rv, SVt_RV); } SvRV_set(rv, sv); /* $rv = \$sv */ SvROK_on(rv); /*if (cxt->entry && ++cxt->ref_cnt > MAX_REF_CNT) { CROAK(("Max. recursion depth with nested refs exceeded")); }*/ TRACEME(("ok (retrieve_ref at 0x%" UVxf ")", PTR2UV(rv))); return rv; } /* * retrieve_weakref * * Retrieve weak reference to some other scalar. * Layout is SX_WEAKREF <object>, with SX_WEAKREF already read. */ static SV *retrieve_weakref(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv; TRACEME(("retrieve_weakref (#%d)", (int)cxt->tagnum)); sv = retrieve_ref(aTHX_ cxt, cname); if (sv) { #ifdef SvWEAKREF sv_rvweaken(sv); #else WEAKREF_CROAK(); #endif } return sv; } /* * retrieve_overloaded * * Retrieve reference to some other scalar with overloading. * Layout is SX_OVERLOAD <object>, with SX_OVERLOAD already read. */ static SV *retrieve_overloaded(pTHX_ stcxt_t *cxt, const char *cname) { SV *rv; SV *sv; HV *stash; TRACEME(("retrieve_overloaded (#%d)", (int)cxt->tagnum)); /* * Same code as retrieve_ref(), duplicated to avoid extra call. */ rv = NEWSV(10002, 0); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(rv, stash, 0); /* Will return if rv is null */ cxt->in_retrieve_overloaded = 1; /* so sv_bless doesn't call S_reset_amagic */ sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */ cxt->in_retrieve_overloaded = 0; if (!sv) return (SV *) 0; /* Failed */ /* * WARNING: breaks RV encapsulation. */ SvUPGRADE(rv, SVt_RV); SvRV_set(rv, sv); /* $rv = \$sv */ SvROK_on(rv); /* * Restore overloading magic. */ stash = SvTYPE(sv) ? (HV *) SvSTASH (sv) : 0; if (!stash) { CROAK(("Cannot restore overloading on %s(0x%" UVxf ") (package <unknown>)", sv_reftype(sv, FALSE), PTR2UV(sv))); } if (!Gv_AMG(stash)) { const char *package = HvNAME_get(stash); TRACEME(("No overloading defined for package %s", package)); TRACEME(("Going to load module '%s'", package)); load_module(PERL_LOADMOD_NOIMPORT, newSVpv(package, 0), Nullsv); if (!Gv_AMG(stash)) { CROAK(("Cannot restore overloading on %s(0x%" UVxf ") (package %s) (even after a \"require %s;\")", sv_reftype(sv, FALSE), PTR2UV(sv), package, package)); } } SvAMAGIC_on(rv); TRACEME(("ok (retrieve_overloaded at 0x%" UVxf ")", PTR2UV(rv))); return rv; } /* * retrieve_weakoverloaded * * Retrieve weak overloaded reference to some other scalar. * Layout is SX_WEAKOVERLOADED <object>, with SX_WEAKOVERLOADED already read. */ static SV *retrieve_weakoverloaded(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv; TRACEME(("retrieve_weakoverloaded (#%d)", (int)cxt->tagnum)); sv = retrieve_overloaded(aTHX_ cxt, cname); if (sv) { #ifdef SvWEAKREF sv_rvweaken(sv); #else WEAKREF_CROAK(); #endif } return sv; } /* * retrieve_tied_array * * Retrieve tied array * Layout is SX_TIED_ARRAY <object>, with SX_TIED_ARRAY already read. */ static SV *retrieve_tied_array(pTHX_ stcxt_t *cxt, const char *cname) { SV *tv; SV *sv; HV *stash; TRACEME(("retrieve_tied_array (#%d)", (int)cxt->tagnum)); if (!(cxt->flags & FLAG_TIE_OK)) { CROAK(("Tying is disabled.")); } tv = NEWSV(10002, 0); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(tv, stash, 0); /* Will return if tv is null */ sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */ if (!sv) return (SV *) 0; /* Failed */ sv_upgrade(tv, SVt_PVAV); sv_magic(tv, sv, 'P', (char *)NULL, 0); SvREFCNT_dec(sv); /* Undo refcnt inc from sv_magic() */ TRACEME(("ok (retrieve_tied_array at 0x%" UVxf ")", PTR2UV(tv))); return tv; } /* * retrieve_tied_hash * * Retrieve tied hash * Layout is SX_TIED_HASH <object>, with SX_TIED_HASH already read. */ static SV *retrieve_tied_hash(pTHX_ stcxt_t *cxt, const char *cname) { SV *tv; SV *sv; HV *stash; TRACEME(("retrieve_tied_hash (#%d)", (int)cxt->tagnum)); if (!(cxt->flags & FLAG_TIE_OK)) { CROAK(("Tying is disabled.")); } tv = NEWSV(10002, 0); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(tv, stash, 0); /* Will return if tv is null */ sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */ if (!sv) return (SV *) 0; /* Failed */ sv_upgrade(tv, SVt_PVHV); sv_magic(tv, sv, 'P', (char *)NULL, 0); SvREFCNT_dec(sv); /* Undo refcnt inc from sv_magic() */ TRACEME(("ok (retrieve_tied_hash at 0x%" UVxf ")", PTR2UV(tv))); return tv; } /* * retrieve_tied_scalar * * Retrieve tied scalar * Layout is SX_TIED_SCALAR <object>, with SX_TIED_SCALAR already read. */ static SV *retrieve_tied_scalar(pTHX_ stcxt_t *cxt, const char *cname) { SV *tv; SV *sv, *obj = NULL; HV *stash; TRACEME(("retrieve_tied_scalar (#%d)", (int)cxt->tagnum)); if (!(cxt->flags & FLAG_TIE_OK)) { CROAK(("Tying is disabled.")); } tv = NEWSV(10002, 0); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(tv, stash, 0); /* Will return if rv is null */ sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */ if (!sv) { return (SV *) 0; /* Failed */ } else if (SvTYPE(sv) != SVt_NULL) { obj = sv; } sv_upgrade(tv, SVt_PVMG); sv_magic(tv, obj, 'q', (char *)NULL, 0); if (obj) { /* Undo refcnt inc from sv_magic() */ SvREFCNT_dec(obj); } TRACEME(("ok (retrieve_tied_scalar at 0x%" UVxf ")", PTR2UV(tv))); return tv; } /* * retrieve_tied_key * * Retrieve reference to value in a tied hash. * Layout is SX_TIED_KEY <object> <key>, with SX_TIED_KEY already read. */ static SV *retrieve_tied_key(pTHX_ stcxt_t *cxt, const char *cname) { SV *tv; SV *sv; SV *key; HV *stash; TRACEME(("retrieve_tied_key (#%d)", (int)cxt->tagnum)); if (!(cxt->flags & FLAG_TIE_OK)) { CROAK(("Tying is disabled.")); } tv = NEWSV(10002, 0); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(tv, stash, 0); /* Will return if tv is null */ sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */ if (!sv) return (SV *) 0; /* Failed */ key = retrieve(aTHX_ cxt, 0); /* Retrieve <key> */ if (!key) return (SV *) 0; /* Failed */ sv_upgrade(tv, SVt_PVMG); sv_magic(tv, sv, 'p', (char *)key, HEf_SVKEY); SvREFCNT_dec(key); /* Undo refcnt inc from sv_magic() */ SvREFCNT_dec(sv); /* Undo refcnt inc from sv_magic() */ return tv; } /* * retrieve_tied_idx * * Retrieve reference to value in a tied array. * Layout is SX_TIED_IDX <object> <idx>, with SX_TIED_IDX already read. */ static SV *retrieve_tied_idx(pTHX_ stcxt_t *cxt, const char *cname) { SV *tv; SV *sv; HV *stash; I32 idx; TRACEME(("retrieve_tied_idx (#%d)", (int)cxt->tagnum)); if (!(cxt->flags & FLAG_TIE_OK)) { CROAK(("Tying is disabled.")); } tv = NEWSV(10002, 0); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(tv, stash, 0); /* Will return if tv is null */ sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */ if (!sv) return (SV *) 0; /* Failed */ RLEN(idx); /* Retrieve <idx> */ sv_upgrade(tv, SVt_PVMG); sv_magic(tv, sv, 'p', (char *)NULL, idx); SvREFCNT_dec(sv); /* Undo refcnt inc from sv_magic() */ return tv; } /* * get_lstring * * Helper to read a string */ static SV *get_lstring(pTHX_ stcxt_t *cxt, UV len, int isutf8, const char *cname) { SV *sv; HV *stash; TRACEME(("get_lstring (#%d), len = %" UVuf, (int)cxt->tagnum, len)); /* * Allocate an empty scalar of the suitable length. */ sv = NEWSV(10002, len); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 0); /* Associate this new scalar with tag "tagnum" */ if (len == 0) { SvPVCLEAR(sv); return sv; } /* * WARNING: duplicates parts of sv_setpv and breaks SV data encapsulation. * * Now, for efficiency reasons, read data directly inside the SV buffer, * and perform the SV final settings directly by duplicating the final * work done by sv_setpv. Since we're going to allocate lots of scalars * this way, it's worth the hassle and risk. */ SAFEREAD(SvPVX(sv), len, sv); SvCUR_set(sv, len); /* Record C string length */ *SvEND(sv) = '\0'; /* Ensure it's null terminated anyway */ (void) SvPOK_only(sv); /* Validate string pointer */ if (cxt->s_tainted) /* Is input source tainted? */ SvTAINT(sv); /* External data cannot be trusted */ /* Check for CVE-215-1592 */ if (cname && len == 13 && strEQc(cname, "CGITempFile") && strEQc(SvPVX(sv), "mt-config.cgi")) { #if defined(USE_CPERL) && defined(WARN_SECURITY) Perl_warn_security(aTHX_ "Movable-Type CVE-2015-1592 Storable metasploit attack"); #else Perl_warn(aTHX_ "SECURITY: Movable-Type CVE-2015-1592 Storable metasploit attack"); #endif } if (isutf8) { TRACEME(("large utf8 string len %" UVuf " '%s'", len, len >= 2048 ? "<string too long>" : SvPVX(sv))); #ifdef HAS_UTF8_SCALARS SvUTF8_on(sv); #else if (cxt->use_bytes < 0) cxt->use_bytes = (SvTRUE(get_sv("Storable::drop_utf8", GV_ADD)) ? 1 : 0); if (cxt->use_bytes == 0) UTF8_CROAK(); #endif } else { TRACEME(("large string len %" UVuf " '%s'", len, len >= 2048 ? "<string too long>" : SvPVX(sv))); } TRACEME(("ok (get_lstring at 0x%" UVxf ")", PTR2UV(sv))); return sv; } /* * retrieve_lscalar * * Retrieve defined long (string) scalar. * * Layout is SX_LSCALAR <length> <data>, with SX_LSCALAR already read. * The scalar is "long" in that <length> is larger than LG_SCALAR so it * was not stored on a single byte, but in 4 bytes. For strings longer than * 4 byte (>2GB) see retrieve_lobject. */ static SV *retrieve_lscalar(pTHX_ stcxt_t *cxt, const char *cname) { U32 len; RLEN(len); return get_lstring(aTHX_ cxt, len, 0, cname); } /* * retrieve_scalar * * Retrieve defined short (string) scalar. * * Layout is SX_SCALAR <length> <data>, with SX_SCALAR already read. * The scalar is "short" so <length> is single byte. If it is 0, there * is no <data> section. */ static SV *retrieve_scalar(pTHX_ stcxt_t *cxt, const char *cname) { int len; /*SV *sv; HV *stash;*/ GETMARK(len); TRACEME(("retrieve_scalar (#%d), len = %d", (int)cxt->tagnum, len)); return get_lstring(aTHX_ cxt, (UV)len, 0, cname); } /* * retrieve_utf8str * * Like retrieve_scalar(), but tag result as utf8. * If we're retrieving UTF8 data in a non-UTF8 perl, croaks. */ static SV *retrieve_utf8str(pTHX_ stcxt_t *cxt, const char *cname) { int len; /*SV *sv;*/ TRACEME(("retrieve_utf8str")); GETMARK(len); return get_lstring(aTHX_ cxt, (UV)len, 1, cname); } /* * retrieve_lutf8str * * Like retrieve_lscalar(), but tag result as utf8. * If we're retrieving UTF8 data in a non-UTF8 perl, croaks. */ static SV *retrieve_lutf8str(pTHX_ stcxt_t *cxt, const char *cname) { U32 len; TRACEME(("retrieve_lutf8str")); RLEN(len); return get_lstring(aTHX_ cxt, (UV)len, 1, cname); } /* * retrieve_vstring * * Retrieve a vstring, and then retrieve the stringy scalar following it, * attaching the vstring to the scalar via magic. * If we're retrieving a vstring in a perl without vstring magic, croaks. * * The vstring layout mirrors an SX_SCALAR string: * SX_VSTRING <length> <data> with SX_VSTRING already read. */ static SV *retrieve_vstring(pTHX_ stcxt_t *cxt, const char *cname) { #ifdef SvVOK char s[256]; int len; SV *sv; GETMARK(len); TRACEME(("retrieve_vstring (#%d), len = %d", (int)cxt->tagnum, len)); READ(s, len); sv = retrieve(aTHX_ cxt, cname); if (!sv) return (SV *) 0; /* Failed */ sv_magic(sv,NULL,PERL_MAGIC_vstring,s,len); /* 5.10.0 and earlier seem to need this */ SvRMAGICAL_on(sv); TRACEME(("ok (retrieve_vstring at 0x%" UVxf ")", PTR2UV(sv))); return sv; #else VSTRING_CROAK(); return Nullsv; #endif } /* * retrieve_lvstring * * Like retrieve_vstring, but for longer vstrings. */ static SV *retrieve_lvstring(pTHX_ stcxt_t *cxt, const char *cname) { #ifdef SvVOK char *s; U32 len; SV *sv; RLEN(len); TRACEME(("retrieve_lvstring (#%d), len = %" UVuf, (int)cxt->tagnum, (UV)len)); /* Since we'll no longer produce such large vstrings, reject them here too. */ if (len >= I32_MAX) { CROAK(("vstring too large to fetch")); } New(10003, s, len+1, char); SAFEPVREAD(s, (I32)len, s); sv = retrieve(aTHX_ cxt, cname); if (!sv) { Safefree(s); return (SV *) 0; /* Failed */ } sv_magic(sv,NULL,PERL_MAGIC_vstring,s,len); /* 5.10.0 and earlier seem to need this */ SvRMAGICAL_on(sv); Safefree(s); TRACEME(("ok (retrieve_lvstring at 0x%" UVxf ")", PTR2UV(sv))); return sv; #else VSTRING_CROAK(); return Nullsv; #endif } /* * retrieve_integer * * Retrieve defined integer. * Layout is SX_INTEGER <data>, whith SX_INTEGER already read. */ static SV *retrieve_integer(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv; HV *stash; IV iv; TRACEME(("retrieve_integer (#%d)", (int)cxt->tagnum)); READ(&iv, sizeof(iv)); sv = newSViv(iv); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 0); /* Associate this new scalar with tag "tagnum" */ TRACEME(("integer %" IVdf, iv)); TRACEME(("ok (retrieve_integer at 0x%" UVxf ")", PTR2UV(sv))); return sv; } /* * retrieve_lobject * * Retrieve overlong scalar, array or hash. * Layout is SX_LOBJECT type U64_len ... */ static SV *retrieve_lobject(pTHX_ stcxt_t *cxt, const char *cname) { int type; #ifdef HAS_U64 UV len; SV *sv; int hash_flags = 0; #endif TRACEME(("retrieve_lobject (#%d)", (int)cxt->tagnum)); GETMARK(type); TRACEME(("object type %d", type)); #ifdef HAS_U64 if (type == SX_FLAG_HASH) { /* we write the flags immediately after the op. I could have changed the writer, but this may allow someone to recover data they're already frozen, though such a very large hash seems unlikely. */ GETMARK(hash_flags); } else if (type == SX_HOOK) { return retrieve_hook_common(aTHX_ cxt, cname, TRUE); } READ_U64(len); TRACEME(("wlen %" UVuf, len)); switch (type) { case SX_OBJECT: { /* not a large object, just a large index */ SV **svh = av_fetch(cxt->aseen, len, FALSE); if (!svh) CROAK(("Object #%" UVuf " should have been retrieved already", len)); sv = *svh; TRACEME(("had retrieved #%" UVuf " at 0x%" UVxf, len, PTR2UV(sv))); SvREFCNT_inc(sv); } break; case SX_LSCALAR: sv = get_lstring(aTHX_ cxt, len, 0, cname); break; case SX_LUTF8STR: sv = get_lstring(aTHX_ cxt, len, 1, cname); break; case SX_ARRAY: sv = get_larray(aTHX_ cxt, len, cname); break; /* <5.12 you could store larger hashes, but cannot iterate over them. So we reject them, it's a bug. */ case SX_FLAG_HASH: sv = get_lhash(aTHX_ cxt, len, hash_flags, cname); break; case SX_HASH: sv = get_lhash(aTHX_ cxt, len, 0, cname); break; default: CROAK(("Unexpected type %d in retrieve_lobject\n", type)); } TRACEME(("ok (retrieve_lobject at 0x%" UVxf ")", PTR2UV(sv))); return sv; #else PERL_UNUSED_ARG(cname); /* previously this (brokenly) checked the length value and only failed if the length was over 4G. Since this op should only occur with objects over 4GB (or 2GB) we can just reject it. */ CROAK(("Invalid large object op for this 32bit system")); #endif } /* * retrieve_netint * * Retrieve defined integer in network order. * Layout is SX_NETINT <data>, whith SX_NETINT already read. */ static SV *retrieve_netint(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv; HV *stash; I32 iv; TRACEME(("retrieve_netint (#%d)", (int)cxt->tagnum)); READ_I32(iv); #ifdef HAS_NTOHL sv = newSViv((int) ntohl(iv)); TRACEME(("network integer %d", (int) ntohl(iv))); #else sv = newSViv(iv); TRACEME(("network integer (as-is) %d", iv)); #endif stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 0); /* Associate this new scalar with tag "tagnum" */ TRACEME(("ok (retrieve_netint at 0x%" UVxf ")", PTR2UV(sv))); return sv; } /* * retrieve_double * * Retrieve defined double. * Layout is SX_DOUBLE <data>, whith SX_DOUBLE already read. */ static SV *retrieve_double(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv; HV *stash; NV nv; TRACEME(("retrieve_double (#%d)", (int)cxt->tagnum)); READ(&nv, sizeof(nv)); sv = newSVnv(nv); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 0); /* Associate this new scalar with tag "tagnum" */ TRACEME(("double %" NVff, nv)); TRACEME(("ok (retrieve_double at 0x%" UVxf ")", PTR2UV(sv))); return sv; } /* * retrieve_byte * * Retrieve defined byte (small integer within the [-128, +127] range). * Layout is SX_BYTE <data>, whith SX_BYTE already read. */ static SV *retrieve_byte(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv; HV *stash; int siv; #ifdef _MSC_VER /* MSVC 2017 doesn't handle the AIX workaround well */ int tmp; #else signed char tmp; /* Workaround for AIX cc bug --H.Merijn Brand */ #endif TRACEME(("retrieve_byte (#%d)", (int)cxt->tagnum)); GETMARK(siv); TRACEME(("small integer read as %d", (unsigned char) siv)); tmp = (unsigned char) siv - 128; sv = newSViv(tmp); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 0); /* Associate this new scalar with tag "tagnum" */ TRACEME(("byte %d", tmp)); TRACEME(("ok (retrieve_byte at 0x%" UVxf ")", PTR2UV(sv))); return sv; } /* * retrieve_undef * * Return the undefined value. */ static SV *retrieve_undef(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv; HV *stash; TRACEME(("retrieve_undef")); sv = newSV(0); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 0); return sv; } /* * retrieve_sv_undef * * Return the immortal undefined value. */ static SV *retrieve_sv_undef(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv = &PL_sv_undef; HV *stash; TRACEME(("retrieve_sv_undef")); /* Special case PL_sv_undef, as av_fetch uses it internally to mark deleted elements, and will return NULL (fetch failed) whenever it is fetched. */ if (cxt->where_is_undef == UNSET_NTAG_T) { cxt->where_is_undef = cxt->tagnum; } stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 1); return sv; } /* * retrieve_sv_yes * * Return the immortal yes value. */ static SV *retrieve_sv_yes(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv = &PL_sv_yes; HV *stash; TRACEME(("retrieve_sv_yes")); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 1); return sv; } /* * retrieve_sv_no * * Return the immortal no value. */ static SV *retrieve_sv_no(pTHX_ stcxt_t *cxt, const char *cname) { SV *sv = &PL_sv_no; HV *stash; TRACEME(("retrieve_sv_no")); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 1); return sv; } /* * retrieve_svundef_elem * * Return &PL_sv_placeholder, representing &PL_sv_undef in an array. This * is a bit of a hack, but we already use SX_SV_UNDEF to mean a nonexistent * element, for historical reasons. */ static SV *retrieve_svundef_elem(pTHX_ stcxt_t *cxt, const char *cname) { TRACEME(("retrieve_svundef_elem")); /* SEEN reads the contents of its SV argument, which we are not supposed to do with &PL_sv_placeholder. */ SEEN_NN(&PL_sv_undef, cname, 1); return &PL_sv_placeholder; } /* * retrieve_array * * Retrieve a whole array. * Layout is SX_ARRAY <size> followed by each item, in increasing index order. * Each item is stored as <object>. * * When we come here, SX_ARRAY has been read already. */ static SV *retrieve_array(pTHX_ stcxt_t *cxt, const char *cname) { I32 len, i; AV *av; SV *sv; HV *stash; bool seen_null = FALSE; TRACEME(("retrieve_array (#%d)", (int)cxt->tagnum)); /* * Read length, and allocate array, then pre-extend it. */ RLEN(len); TRACEME(("size = %d", (int)len)); av = newAV(); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(av, stash, 0); /* Will return if array not allocated nicely */ if (len) av_extend(av, len); else return (SV *) av; /* No data follow if array is empty */ /* * Now get each item in turn... */ for (i = 0; i < len; i++) { TRACEME(("(#%d) item", (int)i)); sv = retrieve(aTHX_ cxt, 0); /* Retrieve item */ if (!sv) return (SV *) 0; if (sv == &PL_sv_undef) { seen_null = TRUE; continue; } if (sv == &PL_sv_placeholder) sv = &PL_sv_undef; if (av_store(av, i, sv) == 0) return (SV *) 0; } if (seen_null) av_fill(av, len-1); TRACEME(("ok (retrieve_array at 0x%" UVxf ")", PTR2UV(av))); return (SV *) av; } #ifdef HAS_U64 /* internal method with len already read */ static SV *get_larray(pTHX_ stcxt_t *cxt, UV len, const char *cname) { UV i; AV *av; SV *sv; HV *stash; bool seen_null = FALSE; TRACEME(("get_larray (#%d) %lu", (int)cxt->tagnum, (unsigned long)len)); /* * allocate array, then pre-extend it. */ av = newAV(); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(av, stash, 0); /* Will return if array not allocated nicely */ assert(len); av_extend(av, len); /* * Now get each item in turn... */ for (i = 0; i < len; i++) { TRACEME(("(#%d) item", (int)i)); sv = retrieve(aTHX_ cxt, 0); /* Retrieve item */ if (!sv) return (SV *) 0; if (sv == &PL_sv_undef) { seen_null = TRUE; continue; } if (sv == &PL_sv_placeholder) sv = &PL_sv_undef; if (av_store(av, i, sv) == 0) return (SV *) 0; } if (seen_null) av_fill(av, len-1); TRACEME(("ok (get_larray at 0x%" UVxf ")", PTR2UV(av))); return (SV *) av; } /* * get_lhash * * Retrieve a overlong hash table. * <len> is already read. What follows is each key/value pair, in random order. * Keys are stored as <length> <data>, the <data> section being omitted * if length is 0. * Values are stored as <object>. * */ static SV *get_lhash(pTHX_ stcxt_t *cxt, UV len, int hash_flags, const char *cname) { UV size; UV i; HV *hv; SV *sv; HV *stash; TRACEME(("get_lhash (#%d)", (int)cxt->tagnum)); #ifdef HAS_RESTRICTED_HASHES PERL_UNUSED_ARG(hash_flags); #else if (hash_flags & SHV_RESTRICTED) { if (cxt->derestrict < 0) cxt->derestrict = (SvTRUE (get_sv("Storable::downgrade_restricted", GV_ADD)) ? 1 : 0); if (cxt->derestrict == 0) RESTRICTED_HASH_CROAK(); } #endif TRACEME(("size = %lu", (unsigned long)len)); hv = newHV(); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(hv, stash, 0); /* Will return if table not allocated properly */ if (len == 0) return (SV *) hv; /* No data follow if table empty */ TRACEME(("split %lu", (unsigned long)len+1)); hv_ksplit(hv, len+1); /* pre-extend hash to save multiple splits */ /* * Now get each key/value pair in turn... */ for (i = 0; i < len; i++) { /* * Get value first. */ TRACEME(("(#%d) value", (int)i)); sv = retrieve(aTHX_ cxt, 0); if (!sv) return (SV *) 0; /* * Get key. * Since we're reading into kbuf, we must ensure we're not * recursing between the read and the hv_store() where it's used. * Hence the key comes after the value. */ RLEN(size); /* Get key size */ KBUFCHK((STRLEN)size); /* Grow hash key read pool if needed */ if (size) READ(kbuf, size); kbuf[size] = '\0'; /* Mark string end, just in case */ TRACEME(("(#%d) key '%s'", (int)i, kbuf)); /* * Enter key/value pair into hash table. */ if (hv_store(hv, kbuf, (U32) size, sv, 0) == 0) return (SV *) 0; } TRACEME(("ok (get_lhash at 0x%" UVxf ")", PTR2UV(hv))); return (SV *) hv; } #endif /* * retrieve_hash * * Retrieve a whole hash table. * Layout is SX_HASH <size> followed by each key/value pair, in random order. * Keys are stored as <length> <data>, the <data> section being omitted * if length is 0. * Values are stored as <object>. * * When we come here, SX_HASH has been read already. */ static SV *retrieve_hash(pTHX_ stcxt_t *cxt, const char *cname) { I32 len; I32 size; I32 i; HV *hv; SV *sv; HV *stash; TRACEME(("retrieve_hash (#%d)", (int)cxt->tagnum)); /* * Read length, allocate table. */ RLEN(len); TRACEME(("size = %d", (int)len)); hv = newHV(); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(hv, stash, 0); /* Will return if table not allocated properly */ if (len == 0) return (SV *) hv; /* No data follow if table empty */ TRACEME(("split %d", (int)len+1)); hv_ksplit(hv, len+1); /* pre-extend hash to save multiple splits */ /* * Now get each key/value pair in turn... */ for (i = 0; i < len; i++) { /* * Get value first. */ TRACEME(("(#%d) value", (int)i)); sv = retrieve(aTHX_ cxt, 0); if (!sv) return (SV *) 0; /* * Get key. * Since we're reading into kbuf, we must ensure we're not * recursing between the read and the hv_store() where it's used. * Hence the key comes after the value. */ RLEN(size); /* Get key size */ KBUFCHK((STRLEN)size); /* Grow hash key read pool if needed */ if (size) READ(kbuf, size); kbuf[size] = '\0'; /* Mark string end, just in case */ TRACEME(("(#%d) key '%s'", (int)i, kbuf)); /* * Enter key/value pair into hash table. */ if (hv_store(hv, kbuf, (U32) size, sv, 0) == 0) return (SV *) 0; } TRACEME(("ok (retrieve_hash at 0x%" UVxf ")", PTR2UV(hv))); return (SV *) hv; } /* * retrieve_hash * * Retrieve a whole hash table. * Layout is SX_HASH <size> followed by each key/value pair, in random order. * Keys are stored as <length> <data>, the <data> section being omitted * if length is 0. * Values are stored as <object>. * * When we come here, SX_HASH has been read already. */ static SV *retrieve_flag_hash(pTHX_ stcxt_t *cxt, const char *cname) { dVAR; I32 len; I32 size; I32 i; HV *hv; SV *sv; HV *stash; int hash_flags; GETMARK(hash_flags); TRACEME(("retrieve_flag_hash (#%d)", (int)cxt->tagnum)); /* * Read length, allocate table. */ #ifndef HAS_RESTRICTED_HASHES if (hash_flags & SHV_RESTRICTED) { if (cxt->derestrict < 0) cxt->derestrict = (SvTRUE (get_sv("Storable::downgrade_restricted", GV_ADD)) ? 1 : 0); if (cxt->derestrict == 0) RESTRICTED_HASH_CROAK(); } #endif RLEN(len); TRACEME(("size = %d, flags = %d", (int)len, hash_flags)); hv = newHV(); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(hv, stash, 0); /* Will return if table not allocated properly */ if (len == 0) return (SV *) hv; /* No data follow if table empty */ TRACEME(("split %d", (int)len+1)); hv_ksplit(hv, len+1); /* pre-extend hash to save multiple splits */ /* * Now get each key/value pair in turn... */ for (i = 0; i < len; i++) { int flags; int store_flags = 0; /* * Get value first. */ TRACEME(("(#%d) value", (int)i)); sv = retrieve(aTHX_ cxt, 0); if (!sv) return (SV *) 0; GETMARK(flags); #ifdef HAS_RESTRICTED_HASHES if ((hash_flags & SHV_RESTRICTED) && (flags & SHV_K_LOCKED)) SvREADONLY_on(sv); #endif if (flags & SHV_K_ISSV) { /* XXX you can't set a placeholder with an SV key. Then again, you can't get an SV key. Without messing around beyond what the API is supposed to do. */ SV *keysv; TRACEME(("(#%d) keysv, flags=%d", (int)i, flags)); keysv = retrieve(aTHX_ cxt, 0); if (!keysv) return (SV *) 0; if (!hv_store_ent(hv, keysv, sv, 0)) return (SV *) 0; } else { /* * Get key. * Since we're reading into kbuf, we must ensure we're not * recursing between the read and the hv_store() where it's used. * Hence the key comes after the value. */ if (flags & SHV_K_PLACEHOLDER) { SvREFCNT_dec (sv); sv = &PL_sv_placeholder; store_flags |= HVhek_PLACEHOLD; } if (flags & SHV_K_UTF8) { #ifdef HAS_UTF8_HASHES store_flags |= HVhek_UTF8; #else if (cxt->use_bytes < 0) cxt->use_bytes = (SvTRUE(get_sv("Storable::drop_utf8", GV_ADD)) ? 1 : 0); if (cxt->use_bytes == 0) UTF8_CROAK(); #endif } #ifdef HAS_UTF8_HASHES if (flags & SHV_K_WASUTF8) store_flags |= HVhek_WASUTF8; #endif RLEN(size); /* Get key size */ KBUFCHK((STRLEN)size);/* Grow hash key read pool if needed */ if (size) READ(kbuf, size); kbuf[size] = '\0'; /* Mark string end, just in case */ TRACEME(("(#%d) key '%s' flags %X store_flags %X", (int)i, kbuf, flags, store_flags)); /* * Enter key/value pair into hash table. */ #ifdef HAS_RESTRICTED_HASHES if (hv_store_flags(hv, kbuf, size, sv, 0, store_flags) == 0) return (SV *) 0; #else if (!(store_flags & HVhek_PLACEHOLD)) if (hv_store(hv, kbuf, size, sv, 0) == 0) return (SV *) 0; #endif } } #ifdef HAS_RESTRICTED_HASHES if (hash_flags & SHV_RESTRICTED) SvREADONLY_on(hv); #endif TRACEME(("ok (retrieve_hash at 0x%" UVxf ")", PTR2UV(hv))); return (SV *) hv; } /* * retrieve_code * * Return a code reference. */ static SV *retrieve_code(pTHX_ stcxt_t *cxt, const char *cname) { dSP; I32 type, count; IV tagnum; SV *cv; SV *sv, *text, *sub, *errsv; HV *stash; TRACEME(("retrieve_code (#%d)", (int)cxt->tagnum)); /* * Insert dummy SV in the aseen array so that we don't screw * up the tag numbers. We would just make the internal * scalar an untagged item in the stream, but * retrieve_scalar() calls SEEN(). So we just increase the * tag number. */ tagnum = cxt->tagnum; sv = newSViv(0); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 0); /* * Retrieve the source of the code reference * as a small or large scalar */ GETMARK(type); switch (type) { case SX_SCALAR: text = retrieve_scalar(aTHX_ cxt, cname); break; case SX_LSCALAR: text = retrieve_lscalar(aTHX_ cxt, cname); break; case SX_UTF8STR: text = retrieve_utf8str(aTHX_ cxt, cname); break; case SX_LUTF8STR: text = retrieve_lutf8str(aTHX_ cxt, cname); break; default: CROAK(("Unexpected type %d in retrieve_code\n", (int)type)); } if (!text) { CROAK(("Unable to retrieve code\n")); } /* * prepend "sub " to the source */ sub = newSVpvs("sub "); if (SvUTF8(text)) SvUTF8_on(sub); sv_catpv(sub, SvPV_nolen(text)); /* XXX no sv_catsv! */ SvREFCNT_dec(text); /* * evaluate the source to a code reference and use the CV value */ if (cxt->eval == NULL) { cxt->eval = get_sv("Storable::Eval", GV_ADD); SvREFCNT_inc(cxt->eval); } if (!SvTRUE(cxt->eval)) { if (cxt->forgive_me == 0 || (cxt->forgive_me < 0 && !(cxt->forgive_me = SvTRUE (get_sv("Storable::forgive_me", GV_ADD)) ? 1 : 0)) ) { CROAK(("Can't eval, please set $Storable::Eval to a true value")); } else { sv = newSVsv(sub); /* fix up the dummy entry... */ av_store(cxt->aseen, tagnum, SvREFCNT_inc(sv)); return sv; } } ENTER; SAVETMPS; errsv = get_sv("@", GV_ADD); SvPVCLEAR(errsv); /* clear $@ */ if (SvROK(cxt->eval) && SvTYPE(SvRV(cxt->eval)) == SVt_PVCV) { PUSHMARK(sp); XPUSHs(sv_2mortal(newSVsv(sub))); PUTBACK; count = call_sv(cxt->eval, G_SCALAR); if (count != 1) CROAK(("Unexpected return value from $Storable::Eval callback\n")); } else { eval_sv(sub, G_SCALAR); } SPAGAIN; cv = POPs; PUTBACK; if (SvTRUE(errsv)) { CROAK(("code %s caused an error: %s", SvPV_nolen(sub), SvPV_nolen(errsv))); } if (cv && SvROK(cv) && SvTYPE(SvRV(cv)) == SVt_PVCV) { sv = SvRV(cv); } else { CROAK(("code %s did not evaluate to a subroutine reference\n", SvPV_nolen(sub))); } SvREFCNT_inc(sv); /* XXX seems to be necessary */ SvREFCNT_dec(sub); FREETMPS; LEAVE; /* fix up the dummy entry... */ av_store(cxt->aseen, tagnum, SvREFCNT_inc(sv)); return sv; } static SV *retrieve_regexp(pTHX_ stcxt_t *cxt, const char *cname) { #if PERL_VERSION_GE(5,8,0) int op_flags; U32 re_len; STRLEN flags_len; SV *re; SV *flags; SV *re_ref; SV *sv; dSP; I32 count; HV *stash; ENTER; SAVETMPS; GETMARK(op_flags); if (op_flags & SHR_U32_RE_LEN) { RLEN(re_len); } else GETMARK(re_len); re = sv_2mortal(NEWSV(10002, re_len ? re_len : 1)); READ(SvPVX(re), re_len); SvCUR_set(re, re_len); *SvEND(re) = '\0'; SvPOK_only(re); GETMARK(flags_len); flags = sv_2mortal(NEWSV(10002, flags_len ? flags_len : 1)); READ(SvPVX(flags), flags_len); SvCUR_set(flags, flags_len); *SvEND(flags) = '\0'; SvPOK_only(flags); PUSHMARK(SP); XPUSHs(re); XPUSHs(flags); PUTBACK; count = call_pv("Storable::_make_re", G_SCALAR); SPAGAIN; if (count != 1) CROAK(("Bad count %d calling _make_re", (int)count)); re_ref = POPs; PUTBACK; if (!SvROK(re_ref)) CROAK(("_make_re didn't return a reference")); sv = SvRV(re_ref); SvREFCNT_inc(sv); stash = cname ? gv_stashpv(cname, GV_ADD) : 0; SEEN_NN(sv, stash, 0); FREETMPS; LEAVE; return sv; #else CROAK(("retrieve_regexp does not work with 5.6 or earlier")); #endif } /* * old_retrieve_array * * Retrieve a whole array in pre-0.6 binary format. * * Layout is SX_ARRAY <size> followed by each item, in increasing index order. * Each item is stored as SX_ITEM <object> or SX_IT_UNDEF for "holes". * * When we come here, SX_ARRAY has been read already. */ static SV *old_retrieve_array(pTHX_ stcxt_t *cxt, const char *cname) { I32 len; I32 i; AV *av; SV *sv; int c; PERL_UNUSED_ARG(cname); TRACEME(("old_retrieve_array (#%d)", (int)cxt->tagnum)); /* * Read length, and allocate array, then pre-extend it. */ RLEN(len); TRACEME(("size = %d", (int)len)); av = newAV(); SEEN0_NN(av, 0); /* Will return if array not allocated nicely */ if (len) av_extend(av, len); else return (SV *) av; /* No data follow if array is empty */ /* * Now get each item in turn... */ for (i = 0; i < len; i++) { GETMARK(c); if (c == SX_IT_UNDEF) { TRACEME(("(#%d) undef item", (int)i)); continue; /* av_extend() already filled us with undef */ } if (c != SX_ITEM) (void) retrieve_other(aTHX_ cxt, 0);/* Will croak out */ TRACEME(("(#%d) item", (int)i)); sv = retrieve(aTHX_ cxt, 0); /* Retrieve item */ if (!sv) return (SV *) 0; if (av_store(av, i, sv) == 0) return (SV *) 0; } TRACEME(("ok (old_retrieve_array at 0x%" UVxf ")", PTR2UV(av))); return (SV *) av; } /* * old_retrieve_hash * * Retrieve a whole hash table in pre-0.6 binary format. * * Layout is SX_HASH <size> followed by each key/value pair, in random order. * Keys are stored as SX_KEY <length> <data>, the <data> section being omitted * if length is 0. * Values are stored as SX_VALUE <object> or SX_VL_UNDEF for "holes". * * When we come here, SX_HASH has been read already. */ static SV *old_retrieve_hash(pTHX_ stcxt_t *cxt, const char *cname) { I32 len; I32 size; I32 i; HV *hv; SV *sv = (SV *) 0; int c; SV *sv_h_undef = (SV *) 0; /* hv_store() bug */ PERL_UNUSED_ARG(cname); TRACEME(("old_retrieve_hash (#%d)", (int)cxt->tagnum)); /* * Read length, allocate table. */ RLEN(len); TRACEME(("size = %d", (int)len)); hv = newHV(); SEEN0_NN(hv, 0); /* Will return if table not allocated properly */ if (len == 0) return (SV *) hv; /* No data follow if table empty */ TRACEME(("split %d", (int)len+1)); hv_ksplit(hv, len+1); /* pre-extend hash to save multiple splits */ /* * Now get each key/value pair in turn... */ for (i = 0; i < len; i++) { /* * Get value first. */ GETMARK(c); if (c == SX_VL_UNDEF) { TRACEME(("(#%d) undef value", (int)i)); /* * Due to a bug in hv_store(), it's not possible to pass * &PL_sv_undef to hv_store() as a value, otherwise the * associated key will not be creatable any more. -- RAM, 14/01/97 */ if (!sv_h_undef) sv_h_undef = newSVsv(&PL_sv_undef); sv = SvREFCNT_inc(sv_h_undef); } else if (c == SX_VALUE) { TRACEME(("(#%d) value", (int)i)); sv = retrieve(aTHX_ cxt, 0); if (!sv) return (SV *) 0; } else (void) retrieve_other(aTHX_ cxt, 0); /* Will croak out */ /* * Get key. * Since we're reading into kbuf, we must ensure we're not * recursing between the read and the hv_store() where it's used. * Hence the key comes after the value. */ GETMARK(c); if (c != SX_KEY) (void) retrieve_other(aTHX_ cxt, 0); /* Will croak out */ RLEN(size); /* Get key size */ KBUFCHK((STRLEN)size); /* Grow hash key read pool if needed */ if (size) READ(kbuf, size); kbuf[size] = '\0'; /* Mark string end, just in case */ TRACEME(("(#%d) key '%s'", (int)i, kbuf)); /* * Enter key/value pair into hash table. */ if (hv_store(hv, kbuf, (U32) size, sv, 0) == 0) return (SV *) 0; } TRACEME(("ok (retrieve_hash at 0x%" UVxf ")", PTR2UV(hv))); return (SV *) hv; } /*** *** Retrieval engine. ***/ /* * magic_check * * Make sure the stored data we're trying to retrieve has been produced * on an ILP compatible system with the same byteorder. It croaks out in * case an error is detected. [ILP = integer-long-pointer sizes] * Returns null if error is detected, &PL_sv_undef otherwise. * * Note that there's no byte ordering info emitted when network order was * used at store time. */ static SV *magic_check(pTHX_ stcxt_t *cxt) { /* The worst case for a malicious header would be old magic (which is longer), major, minor, byteorder length byte of 255, 255 bytes of garbage, sizeof int, long, pointer, NV. So the worse of that we can read is 255 bytes of garbage plus 4. Err, I am assuming 8 bit bytes here. Please file a bug report if you're compiling perl on a system with chars that are larger than 8 bits. (Even Crays aren't *that* perverse). */ unsigned char buf[4 + 255]; unsigned char *current; int c; int length; int use_network_order; int use_NV_size; int old_magic = 0; int version_major; int version_minor = 0; TRACEME(("magic_check")); /* * The "magic number" is only for files, not when freezing in memory. */ if (cxt->fio) { /* This includes the '\0' at the end. I want to read the extra byte, which is usually going to be the major version number. */ STRLEN len = sizeof(magicstr); STRLEN old_len; READ(buf, (SSize_t)(len)); /* Not null-terminated */ /* Point at the byte after the byte we read. */ current = buf + --len; /* Do the -- outside of macros. */ if (memNE(buf, magicstr, len)) { /* * Try to read more bytes to check for the old magic number, which * was longer. */ TRACEME(("trying for old magic number")); old_len = sizeof(old_magicstr) - 1; READ(current + 1, (SSize_t)(old_len - len)); if (memNE(buf, old_magicstr, old_len)) CROAK(("File is not a perl storable")); old_magic++; current = buf + old_len; } use_network_order = *current; } else { GETMARK(use_network_order); } /* * Starting with 0.6, the "use_network_order" byte flag is also used to * indicate the version number of the binary, and therefore governs the * setting of sv_retrieve_vtbl. See magic_write(). */ if (old_magic && use_network_order > 1) { /* 0.1 dump - use_network_order is really byte order length */ version_major = -1; } else { version_major = use_network_order >> 1; } cxt->retrieve_vtbl = (SV*(**)(pTHX_ stcxt_t *cxt, const char *cname)) (version_major > 0 ? sv_retrieve : sv_old_retrieve); TRACEME(("magic_check: netorder = 0x%x", use_network_order)); /* * Starting with 0.7 (binary major 2), a full byte is dedicated to the * minor version of the protocol. See magic_write(). */ if (version_major > 1) GETMARK(version_minor); cxt->ver_major = version_major; cxt->ver_minor = version_minor; TRACEME(("binary image version is %d.%d", version_major, version_minor)); /* * Inter-operability sanity check: we can't retrieve something stored * using a format more recent than ours, because we have no way to * know what has changed, and letting retrieval go would mean a probable * failure reporting a "corrupted" storable file. */ if ( version_major > STORABLE_BIN_MAJOR || (version_major == STORABLE_BIN_MAJOR && version_minor > STORABLE_BIN_MINOR) ) { int croak_now = 1; TRACEME(("but I am version is %d.%d", STORABLE_BIN_MAJOR, STORABLE_BIN_MINOR)); if (version_major == STORABLE_BIN_MAJOR) { TRACEME(("cxt->accept_future_minor is %d", cxt->accept_future_minor)); if (cxt->accept_future_minor < 0) cxt->accept_future_minor = (SvTRUE(get_sv("Storable::accept_future_minor", GV_ADD)) ? 1 : 0); if (cxt->accept_future_minor == 1) croak_now = 0; /* Don't croak yet. */ } if (croak_now) { CROAK(("Storable binary image v%d.%d more recent than I am (v%d.%d)", version_major, version_minor, STORABLE_BIN_MAJOR, STORABLE_BIN_MINOR)); } } /* * If they stored using network order, there's no byte ordering * information to check. */ if ((cxt->netorder = (use_network_order & 0x1))) /* Extra () for -Wall */ return &PL_sv_undef; /* No byte ordering info */ /* In C truth is 1, falsehood is 0. Very convenient. */ use_NV_size = version_major >= 2 && version_minor >= 2; if (version_major >= 0) { GETMARK(c); } else { c = use_network_order; } length = c + 3 + use_NV_size; READ(buf, length); /* Not null-terminated */ TRACEME(("byte order '%.*s' %d", c, buf, c)); #ifdef USE_56_INTERWORK_KLUDGE /* No point in caching this in the context as we only need it once per retrieve, and we need to recheck it each read. */ if (SvTRUE(get_sv("Storable::interwork_56_64bit", GV_ADD))) { if ((c != (sizeof (byteorderstr_56) - 1)) || memNE(buf, byteorderstr_56, c)) CROAK(("Byte order is not compatible")); } else #endif { if ((c != (sizeof (byteorderstr) - 1)) || memNE(buf, byteorderstr, c)) CROAK(("Byte order is not compatible")); } current = buf + c; /* sizeof(int) */ if ((int) *current++ != sizeof(int)) CROAK(("Integer size is not compatible")); /* sizeof(long) */ if ((int) *current++ != sizeof(long)) CROAK(("Long integer size is not compatible")); /* sizeof(char *) */ if ((int) *current != sizeof(char *)) CROAK(("Pointer size is not compatible")); if (use_NV_size) { /* sizeof(NV) */ if ((int) *++current != sizeof(NV)) CROAK(("Double size is not compatible")); } return &PL_sv_undef; /* OK */ } /* * retrieve * * Recursively retrieve objects from the specified file and return their * root SV (which may be an AV or an HV for what we care). * Returns null if there is a problem. */ static SV *retrieve(pTHX_ stcxt_t *cxt, const char *cname) { int type; SV **svh; SV *sv; TRACEME(("retrieve")); /* * Grab address tag which identifies the object if we are retrieving * an older format. Since the new binary format counts objects and no * longer explicitly tags them, we must keep track of the correspondence * ourselves. * * The following section will disappear one day when the old format is * no longer supported, hence the final "goto" in the "if" block. */ if (cxt->hseen) { /* Retrieving old binary */ stag_t tag; if (cxt->netorder) { I32 nettag; READ(&nettag, sizeof(I32)); /* Ordered sequence of I32 */ tag = (stag_t) nettag; } else READ(&tag, sizeof(stag_t)); /* Original address of the SV */ GETMARK(type); if (type == SX_OBJECT) { I32 tagn; svh = hv_fetch(cxt->hseen, (char *) &tag, sizeof(tag), FALSE); if (!svh) CROAK(("Old tag 0x%" UVxf " should have been mapped already", (UV) tag)); tagn = SvIV(*svh); /* Mapped tag number computed earlier below */ /* * The following code is common with the SX_OBJECT case below. */ svh = av_fetch(cxt->aseen, tagn, FALSE); if (!svh) CROAK(("Object #%" IVdf " should have been retrieved already", (IV) tagn)); sv = *svh; TRACEME(("has retrieved #%d at 0x%" UVxf, (int)tagn, PTR2UV(sv))); SvREFCNT_inc(sv); /* One more reference to this same sv */ return sv; /* The SV pointer where object was retrieved */ } /* * Map new object, but don't increase tagnum. This will be done * by each of the retrieve_* functions when they call SEEN(). * * The mapping associates the "tag" initially present with a unique * tag number. See test for SX_OBJECT above to see how this is perused. */ if (!hv_store(cxt->hseen, (char *) &tag, sizeof(tag), newSViv(cxt->tagnum), 0)) return (SV *) 0; goto first_time; } /* * Regular post-0.6 binary format. */ GETMARK(type); TRACEME(("retrieve type = %d", type)); /* * Are we dealing with an object we should have already retrieved? */ if (type == SX_OBJECT) { I32 tag; READ_I32(tag); tag = ntohl(tag); #ifndef HAS_U64 /* A 32-bit system can't have over 2**31 objects anyway */ if (tag < 0) CROAK(("Object #%" IVdf " out of range", (IV)tag)); #endif /* Older versions of Storable on with 64-bit support on 64-bit systems can produce values above the 2G boundary (or wrapped above the 4G boundary, which we can't do much about), treat those as unsigned. This same commit stores tag ids over the 2G boundary as long tags since older Storables will mis-handle them as short tags. */ svh = av_fetch(cxt->aseen, (U32)tag, FALSE); if (!svh) CROAK(("Object #%" IVdf " should have been retrieved already", (IV) tag)); sv = *svh; TRACEME(("had retrieved #%d at 0x%" UVxf, (int)tag, PTR2UV(sv))); SvREFCNT_inc(sv); /* One more reference to this same sv */ return sv; /* The SV pointer where object was retrieved */ } else if (type >= SX_LAST && cxt->ver_minor > STORABLE_BIN_MINOR) { if (cxt->accept_future_minor < 0) cxt->accept_future_minor = (SvTRUE(get_sv("Storable::accept_future_minor", GV_ADD)) ? 1 : 0); if (cxt->accept_future_minor == 1) { CROAK(("Storable binary image v%d.%d contains data of type %d. " "This Storable is v%d.%d and can only handle data types up to %d", cxt->ver_major, cxt->ver_minor, type, STORABLE_BIN_MAJOR, STORABLE_BIN_MINOR, SX_LAST - 1)); } } first_time: /* Will disappear when support for old format is dropped */ /* * Okay, first time through for this one. */ sv = RETRIEVE(cxt, type)(aTHX_ cxt, cname); if (!sv) return (SV *) 0; /* Failed */ /* * Old binary formats (pre-0.7). * * Final notifications, ended by SX_STORED may now follow. * Currently, the only pertinent notification to apply on the * freshly retrieved object is either: * SX_CLASS <char-len> <classname> for short classnames. * SX_LG_CLASS <int-len> <classname> for larger one (rare!). * Class name is then read into the key buffer pool used by * hash table key retrieval. */ if (cxt->ver_major < 2) { while ((type = GETCHAR()) != SX_STORED) { I32 len; HV* stash; switch (type) { case SX_CLASS: GETMARK(len); /* Length coded on a single char */ break; case SX_LG_CLASS: /* Length coded on a regular integer */ RLEN(len); break; case EOF: default: return (SV *) 0; /* Failed */ } KBUFCHK((STRLEN)len); /* Grow buffer as necessary */ if (len) READ(kbuf, len); kbuf[len] = '\0'; /* Mark string end */ stash = gv_stashpvn(kbuf, len, GV_ADD); BLESS(sv, stash); } } TRACEME(("ok (retrieved 0x%" UVxf ", refcnt=%d, %s)", PTR2UV(sv), (int)SvREFCNT(sv) - 1, sv_reftype(sv, FALSE))); return sv; /* Ok */ } /* * do_retrieve * * Retrieve data held in file and return the root object. * Common routine for pretrieve and mretrieve. */ static SV *do_retrieve( pTHX_ PerlIO *f, SV *in, int optype, int flags) { dSTCXT; SV *sv; int is_tainted; /* Is input source tainted? */ int pre_06_fmt = 0; /* True with pre Storable 0.6 formats */ TRACEMED(("do_retrieve (optype = 0x%x, flags=0x%x)", (unsigned)optype, (unsigned)flags)); optype |= ST_RETRIEVE; cxt->flags = flags; /* * Sanity assertions for retrieve dispatch tables. */ ASSERT(sizeof(sv_old_retrieve) == sizeof(sv_retrieve), ("old and new retrieve dispatch table have same size")); ASSERT(sv_old_retrieve[(int)SX_LAST] == retrieve_other, ("SX_LAST entry correctly initialized in old dispatch table")); ASSERT(sv_retrieve[(int)SX_LAST] == retrieve_other, ("SX_LAST entry correctly initialized in new dispatch table")); /* * Workaround for CROAK leak: if they enter with a "dirty" context, * free up memory for them now. */ assert(cxt); if (cxt->s_dirty) clean_context(aTHX_ cxt); /* * Now that STORABLE_xxx hooks exist, it is possible that they try to * re-enter retrieve() via the hooks. */ if (cxt->entry) { cxt = allocate_context(aTHX_ cxt); cxt->flags = flags; } INIT_TRACEME; cxt->entry++; ASSERT(cxt->entry == 1, ("starting new recursion")); ASSERT(!cxt->s_dirty, ("clean context")); /* * Prepare context. * * Data is loaded into the memory buffer when f is NULL, unless 'in' is * also NULL, in which case we're expecting the data to already lie * in the buffer (dclone case). */ KBUFINIT(); /* Allocate hash key reading pool once */ if (!f && in) { #ifdef SvUTF8_on if (SvUTF8(in)) { STRLEN length; const char *orig = SvPV(in, length); char *asbytes; /* This is quite deliberate. I want the UTF8 routines to encounter the '\0' which perl adds at the end of all scalars, so that any new string also has this. */ STRLEN klen_tmp = length + 1; bool is_utf8 = TRUE; /* Just casting the &klen to (STRLEN) won't work well if STRLEN and I32 are of different widths. --jhi */ asbytes = (char*)bytes_from_utf8((U8*)orig, &klen_tmp, &is_utf8); if (is_utf8) { CROAK(("Frozen string corrupt - contains characters outside 0-255")); } if (asbytes != orig) { /* String has been converted. There is no need to keep any reference to the old string. */ in = sv_newmortal(); /* We donate the SV the malloc()ed string bytes_from_utf8 returned us. */ SvUPGRADE(in, SVt_PV); SvPOK_on(in); SvPV_set(in, asbytes); SvLEN_set(in, klen_tmp); SvCUR_set(in, klen_tmp - 1); } } #endif MBUF_SAVE_AND_LOAD(in); } /* * Magic number verifications. * * This needs to be done before calling init_retrieve_context() * since the format indication in the file are necessary to conduct * some of the initializations. */ cxt->fio = f; /* Where I/O are performed */ if (!magic_check(aTHX_ cxt)) CROAK(("Magic number checking on storable %s failed", cxt->fio ? "file" : "string")); TRACEME(("data stored in %s format", cxt->netorder ? "net order" : "native")); /* * Check whether input source is tainted, so that we don't wrongly * taint perfectly good values... * * We assume file input is always tainted. If both 'f' and 'in' are * NULL, then we come from dclone, and tainted is already filled in * the context. That's a kludge, but the whole dclone() thing is * already quite a kludge anyway! -- RAM, 15/09/2000. */ is_tainted = f ? 1 : (in ? SvTAINTED(in) : cxt->s_tainted); TRACEME(("input source is %s", is_tainted ? "tainted" : "trusted")); init_retrieve_context(aTHX_ cxt, optype, is_tainted); ASSERT(is_retrieving(aTHX), ("within retrieve operation")); sv = retrieve(aTHX_ cxt, 0); /* Recursively retrieve object, get root SV */ /* * Final cleanup. */ if (!f && in) MBUF_RESTORE(); pre_06_fmt = cxt->hseen != NULL; /* Before we clean context */ /* * The "root" context is never freed. */ clean_retrieve_context(aTHX_ cxt); if (cxt->prev) /* This context was stacked */ free_context(aTHX_ cxt); /* It was not the "root" context */ /* * Prepare returned value. */ if (!sv) { TRACEMED(("retrieve ERROR")); return &PL_sv_undef; /* Something went wrong, return undef */ } TRACEMED(("retrieve got %s(0x%" UVxf ")", sv_reftype(sv, FALSE), PTR2UV(sv))); /* * Backward compatibility with Storable-0.5@9 (which we know we * are retrieving if hseen is non-null): don't create an extra RV * for objects since we special-cased it at store time. * * Build a reference to the SV returned by pretrieve even if it is * already one and not a scalar, for consistency reasons. */ if (pre_06_fmt) { /* Was not handling overloading by then */ SV *rv; TRACEMED(("fixing for old formats -- pre 0.6")); if (sv_type(aTHX_ sv) == svis_REF && (rv = SvRV(sv)) && SvOBJECT(rv)) { TRACEME(("ended do_retrieve() with an object -- pre 0.6")); return sv; } } /* * If reference is overloaded, restore behaviour. * * NB: minor glitch here: normally, overloaded refs are stored specially * so that we can croak when behaviour cannot be re-installed, and also * avoid testing for overloading magic at each reference retrieval. * * Unfortunately, the root reference is implicitly stored, so we must * check for possible overloading now. Furthermore, if we don't restore * overloading, we cannot croak as if the original ref was, because we * have no way to determine whether it was an overloaded ref or not in * the first place. * * It's a pity that overloading magic is attached to the rv, and not to * the underlying sv as blessing is. */ if (SvOBJECT(sv)) { HV *stash = (HV *) SvSTASH(sv); SV *rv = newRV_noinc(sv); if (stash && Gv_AMG(stash)) { SvAMAGIC_on(rv); TRACEMED(("restored overloading on root reference")); } TRACEMED(("ended do_retrieve() with an object")); return rv; } TRACEMED(("regular do_retrieve() end")); return newRV_noinc(sv); } /* * pretrieve * * Retrieve data held in file and return the root object, undef on error. */ static SV *pretrieve(pTHX_ PerlIO *f, IV flag) { TRACEMED(("pretrieve")); return do_retrieve(aTHX_ f, Nullsv, 0, (int)flag); } /* * mretrieve * * Retrieve data held in scalar and return the root object, undef on error. */ static SV *mretrieve(pTHX_ SV *sv, IV flag) { TRACEMED(("mretrieve")); return do_retrieve(aTHX_ (PerlIO*) 0, sv, 0, (int)flag); } /*** *** Deep cloning ***/ /* * dclone * * Deep clone: returns a fresh copy of the original referenced SV tree. * * This is achieved by storing the object in memory and restoring from * there. Not that efficient, but it should be faster than doing it from * pure perl anyway. */ static SV *dclone(pTHX_ SV *sv) { dSTCXT; STRLEN size; stcxt_t *real_context; SV *out; TRACEMED(("dclone")); /* * Workaround for CROAK leak: if they enter with a "dirty" context, * free up memory for them now. */ assert(cxt); if (cxt->s_dirty) clean_context(aTHX_ cxt); /* * Tied elements seem to need special handling. */ if ((SvTYPE(sv) == SVt_PVLV #if PERL_VERSION_LT(5,8,0) || SvTYPE(sv) == SVt_PVMG #endif ) && (SvFLAGS(sv) & (SVs_GMG|SVs_SMG|SVs_RMG)) == (SVs_GMG|SVs_SMG|SVs_RMG) && mg_find(sv, 'p')) { mg_get(sv); } /* * do_store() optimizes for dclone by not freeing its context, should * we need to allocate one because we're deep cloning from a hook. */ if (!do_store(aTHX_ (PerlIO*) 0, sv, ST_CLONE, FALSE, (SV**) 0)) return &PL_sv_undef; /* Error during store */ /* * Because of the above optimization, we have to refresh the context, * since a new one could have been allocated and stacked by do_store(). */ { dSTCXT; real_context = cxt; } /* Sub-block needed for macro */ cxt = real_context; /* And we need this temporary... */ /* * Now, 'cxt' may refer to a new context. */ assert(cxt); ASSERT(!cxt->s_dirty, ("clean context")); ASSERT(!cxt->entry, ("entry will not cause new context allocation")); size = MBUF_SIZE(); TRACEME(("dclone stored %ld bytes", (long)size)); MBUF_INIT(size); /* * Since we're passing do_retrieve() both a NULL file and sv, we need * to pre-compute the taintedness of the input by setting cxt->tainted * to whatever state our own input string was. -- RAM, 15/09/2000 * * do_retrieve() will free non-root context. */ cxt->s_tainted = SvTAINTED(sv); out = do_retrieve(aTHX_ (PerlIO*) 0, Nullsv, ST_CLONE, FLAG_BLESS_OK | FLAG_TIE_OK); TRACEMED(("dclone returns 0x%" UVxf, PTR2UV(out))); return out; } /*** *** Glue with perl. ***/ /* * The Perl IO GV object distinguishes between input and output for sockets * but not for plain files. To allow Storable to transparently work on * plain files and sockets transparently, we have to ask xsubpp to fetch the * right object for us. Hence the OutputStream and InputStream declarations. * * Before perl 5.004_05, those entries in the standard typemap are not * defined in perl include files, so we do that here. */ #ifndef OutputStream #define OutputStream PerlIO * #define InputStream PerlIO * #endif /* !OutputStream */ static int storable_free(pTHX_ SV *sv, MAGIC* mg) { stcxt_t *cxt = (stcxt_t *)SvPVX(sv); PERL_UNUSED_ARG(mg); #ifdef USE_PTR_TABLE if (cxt->pseen) ptr_table_free(cxt->pseen); #endif if (kbuf) Safefree(kbuf); if (!cxt->membuf_ro && mbase) Safefree(mbase); if (cxt->membuf_ro && (cxt->msaved).arena) Safefree((cxt->msaved).arena); return 0; } #line 7674 "Storable.c" #ifndef PERL_UNUSED_VAR # define PERL_UNUSED_VAR(var) if (0) var = var #endif #ifndef dVAR # define dVAR dNOOP #endif /* This stuff is not part of the API! You have been warned. */ #ifndef PERL_VERSION_DECIMAL # define PERL_VERSION_DECIMAL(r,v,s) (r*1000000 + v*1000 + s) #endif #ifndef PERL_DECIMAL_VERSION # define PERL_DECIMAL_VERSION \ PERL_VERSION_DECIMAL(PERL_REVISION,PERL_VERSION,PERL_SUBVERSION) #endif #ifndef PERL_VERSION_GE # define PERL_VERSION_GE(r,v,s) \ (PERL_DECIMAL_VERSION >= PERL_VERSION_DECIMAL(r,v,s)) #endif #ifndef PERL_VERSION_LE # define PERL_VERSION_LE(r,v,s) \ (PERL_DECIMAL_VERSION <= PERL_VERSION_DECIMAL(r,v,s)) #endif /* XS_INTERNAL is the explicit static-linkage variant of the default * XS macro. * * XS_EXTERNAL is the same as XS_INTERNAL except it does not include * "STATIC", ie. it exports XSUB symbols. You probably don't want that * for anything but the BOOT XSUB. * * See XSUB.h in core! */ /* TODO: This might be compatible further back than 5.10.0. */ #if PERL_VERSION_GE(5, 10, 0) && PERL_VERSION_LE(5, 15, 1) # undef XS_EXTERNAL # undef XS_INTERNAL # if defined(__CYGWIN__) && defined(USE_DYNAMIC_LOADING) # define XS_EXTERNAL(name) __declspec(dllexport) XSPROTO(name) # define XS_INTERNAL(name) STATIC XSPROTO(name) # endif # if defined(__SYMBIAN32__) # define XS_EXTERNAL(name) EXPORT_C XSPROTO(name) # define XS_INTERNAL(name) EXPORT_C STATIC XSPROTO(name) # endif # ifndef XS_EXTERNAL # if defined(HASATTRIBUTE_UNUSED) && !defined(__cplusplus) # define XS_EXTERNAL(name) void name(pTHX_ CV* cv __attribute__unused__) # define XS_INTERNAL(name) STATIC void name(pTHX_ CV* cv __attribute__unused__) # else # ifdef __cplusplus # define XS_EXTERNAL(name) extern "C" XSPROTO(name) # define XS_INTERNAL(name) static XSPROTO(name) # else # define XS_EXTERNAL(name) XSPROTO(name) # define XS_INTERNAL(name) STATIC XSPROTO(name) # endif # endif # endif #endif /* perl >= 5.10.0 && perl <= 5.15.1 */ /* The XS_EXTERNAL macro is used for functions that must not be static * like the boot XSUB of a module. If perl didn't have an XS_EXTERNAL * macro defined, the best we can do is assume XS is the same. * Dito for XS_INTERNAL. */ #ifndef XS_EXTERNAL # define XS_EXTERNAL(name) XS(name) #endif #ifndef XS_INTERNAL # define XS_INTERNAL(name) XS(name) #endif /* Now, finally, after all this mess, we want an ExtUtils::ParseXS * internal macro that we're free to redefine for varying linkage due * to the EXPORT_XSUB_SYMBOLS XS keyword. This is internal, use * XS_EXTERNAL(name) or XS_INTERNAL(name) in your code if you need to! */ #undef XS_EUPXS #if defined(PERL_EUPXS_ALWAYS_EXPORT) # define XS_EUPXS(name) XS_EXTERNAL(name) #else /* default to internal */ # define XS_EUPXS(name) XS_INTERNAL(name) #endif #ifndef PERL_ARGS_ASSERT_CROAK_XS_USAGE #define PERL_ARGS_ASSERT_CROAK_XS_USAGE assert(cv); assert(params) /* prototype to pass -Wmissing-prototypes */ STATIC void S_croak_xs_usage(const CV *const cv, const char *const params); STATIC void S_croak_xs_usage(const CV *const cv, const char *const params) { const GV *const gv = CvGV(cv); PERL_ARGS_ASSERT_CROAK_XS_USAGE; if (gv) { const char *const gvname = GvNAME(gv); const HV *const stash = GvSTASH(gv); const char *const hvname = stash ? HvNAME(stash) : NULL; if (hvname) Perl_croak_nocontext("Usage: %s::%s(%s)", hvname, gvname, params); else Perl_croak_nocontext("Usage: %s(%s)", gvname, params); } else { /* Pants. I don't think that it should be possible to get here. */ Perl_croak_nocontext("Usage: CODE(0x%" UVxf ")(%s)", PTR2UV(cv), params); } } #undef PERL_ARGS_ASSERT_CROAK_XS_USAGE #define croak_xs_usage S_croak_xs_usage #endif /* NOTE: the prototype of newXSproto() is different in versions of perls, * so we define a portable version of newXSproto() */ #ifdef newXS_flags #define newXSproto_portable(name, c_impl, file, proto) newXS_flags(name, c_impl, file, proto, 0) #else #define newXSproto_portable(name, c_impl, file, proto) (PL_Sv=(SV*)newXS(name, c_impl, file), sv_setpv(PL_Sv, proto), (CV*)PL_Sv) #endif /* !defined(newXS_flags) */ #if PERL_VERSION_LE(5, 21, 5) # define newXS_deffile(a,b) Perl_newXS(aTHX_ a,b,file) #else # define newXS_deffile(a,b) Perl_newXS_deffile(aTHX_ a,b) #endif #line 7818 "Storable.c" XS_EUPXS(XS_Storable_init_perinterp); /* prototype to pass -Wmissing-prototypes */ XS_EUPXS(XS_Storable_init_perinterp) { dVAR; dXSARGS; if (items != 0) croak_xs_usage(cv, ""); { #line 7691 "Storable.xs" init_perinterp(aTHX); #line 7829 "Storable.c" } XSRETURN_EMPTY; } XS_EUPXS(XS_Storable_pstore); /* prototype to pass -Wmissing-prototypes */ XS_EUPXS(XS_Storable_pstore) { dVAR; dXSARGS; dXSI32; if (items != 2) croak_xs_usage(cv, "f, obj"); PERL_UNUSED_VAR(ax); /* -Wall */ SP -= items; { OutputStream f = IoOFP(sv_2io(ST(0))) ; SV* obj = ST(1) ; SV * RETVAL; #line 7710 "Storable.xs" RETVAL = do_store(aTHX_ f, obj, 0, ix, (SV **)0) ? &PL_sv_yes : &PL_sv_undef; /* do_store() can reallocate the stack, so need a sequence point to ensure that ST(0) knows about it. Hence using two statements. */ ST(0) = RETVAL; XSRETURN(1); #line 7856 "Storable.c" PUTBACK; return; } } XS_EUPXS(XS_Storable_mstore); /* prototype to pass -Wmissing-prototypes */ XS_EUPXS(XS_Storable_mstore) { dVAR; dXSARGS; dXSI32; if (items != 1) croak_xs_usage(cv, "obj"); { SV* obj = ST(0) ; SV * RETVAL; #line 7732 "Storable.xs" RETVAL = &PL_sv_undef; if (!do_store(aTHX_ (PerlIO*) 0, obj, 0, ix, &RETVAL)) RETVAL = &PL_sv_undef; #line 7878 "Storable.c" RETVAL = sv_2mortal(RETVAL); ST(0) = RETVAL; } XSRETURN(1); } XS_EUPXS(XS_Storable_pretrieve); /* prototype to pass -Wmissing-prototypes */ XS_EUPXS(XS_Storable_pretrieve) { dVAR; dXSARGS; if (items < 1 || items > 2) croak_xs_usage(cv, "f, flag = 6"); { InputStream f = IoIFP(sv_2io(ST(0))) ; IV flag; SV * RETVAL; if (items < 2) flag = 6; else { flag = (IV)SvIV(ST(1)) ; } #line 7743 "Storable.xs" RETVAL = pretrieve(aTHX_ f, flag); #line 7906 "Storable.c" RETVAL = sv_2mortal(RETVAL); ST(0) = RETVAL; } XSRETURN(1); } XS_EUPXS(XS_Storable_mretrieve); /* prototype to pass -Wmissing-prototypes */ XS_EUPXS(XS_Storable_mretrieve) { dVAR; dXSARGS; if (items < 1 || items > 2) croak_xs_usage(cv, "sv, flag = 6"); { SV* sv = ST(0) ; IV flag; SV * RETVAL; if (items < 2) flag = 6; else { flag = (IV)SvIV(ST(1)) ; } #line 7752 "Storable.xs" RETVAL = mretrieve(aTHX_ sv, flag); #line 7934 "Storable.c" RETVAL = sv_2mortal(RETVAL); ST(0) = RETVAL; } XSRETURN(1); } XS_EUPXS(XS_Storable_dclone); /* prototype to pass -Wmissing-prototypes */ XS_EUPXS(XS_Storable_dclone) { dVAR; dXSARGS; if (items != 1) croak_xs_usage(cv, "sv"); { SV* sv = ST(0) ; SV * RETVAL; #line 7760 "Storable.xs" RETVAL = dclone(aTHX_ sv); #line 7954 "Storable.c" RETVAL = sv_2mortal(RETVAL); ST(0) = RETVAL; } XSRETURN(1); } XS_EUPXS(XS_Storable_last_op_in_netorder); /* prototype to pass -Wmissing-prototypes */ XS_EUPXS(XS_Storable_last_op_in_netorder) { dVAR; dXSARGS; dXSI32; if (items != 0) croak_xs_usage(cv, ""); { #line 7770 "Storable.xs" bool result; #line 7972 "Storable.c" #line 7772 "Storable.xs" if (ix) { dSTCXT; assert(cxt); result = cxt->entry && (cxt->optype & ix) ? TRUE : FALSE; } else { result = !!last_op_in_netorder(aTHX); } ST(0) = boolSV(result); #line 7982 "Storable.c" } XSRETURN(1); } XS_EUPXS(XS_Storable_stack_depth); /* prototype to pass -Wmissing-prototypes */ XS_EUPXS(XS_Storable_stack_depth) { dVAR; dXSARGS; if (items != 0) croak_xs_usage(cv, ""); { IV RETVAL; dXSTARG; #line 7785 "Storable.xs" RETVAL = SvIV(get_sv("Storable::recursion_limit", GV_ADD)); #line 7999 "Storable.c" XSprePUSH; PUSHi((IV)RETVAL); } XSRETURN(1); } XS_EUPXS(XS_Storable_stack_depth_hash); /* prototype to pass -Wmissing-prototypes */ XS_EUPXS(XS_Storable_stack_depth_hash) { dVAR; dXSARGS; if (items != 0) croak_xs_usage(cv, ""); { IV RETVAL; dXSTARG; #line 7792 "Storable.xs" RETVAL = SvIV(get_sv("Storable::recursion_limit_hash", GV_ADD)); #line 8017 "Storable.c" XSprePUSH; PUSHi((IV)RETVAL); } XSRETURN(1); } #ifdef __cplusplus extern "C" #endif XS_EXTERNAL(boot_Storable); /* prototype to pass -Wmissing-prototypes */ XS_EXTERNAL(boot_Storable) { #if PERL_VERSION_LE(5, 21, 5) dVAR; dXSARGS; #else dVAR; dXSBOOTARGSXSAPIVERCHK; #endif #if (PERL_REVISION == 5 && PERL_VERSION < 9) char* file = __FILE__; #else const char* file = __FILE__; #endif PERL_UNUSED_VAR(file); PERL_UNUSED_VAR(cv); /* -W */ PERL_UNUSED_VAR(items); /* -W */ #if PERL_VERSION_LE(5, 21, 5) XS_VERSION_BOOTCHECK; # ifdef XS_APIVERSION_BOOTCHECK XS_APIVERSION_BOOTCHECK; # endif #endif (void)newXSproto_portable("Storable::init_perinterp", XS_Storable_init_perinterp, file, ""); cv = newXSproto_portable("Storable::net_pstore", XS_Storable_pstore, file, "$$"); XSANY.any_i32 = 1; cv = newXSproto_portable("Storable::pstore", XS_Storable_pstore, file, "$$"); XSANY.any_i32 = 0; cv = newXSproto_portable("Storable::mstore", XS_Storable_mstore, file, "$"); XSANY.any_i32 = 0; cv = newXSproto_portable("Storable::net_mstore", XS_Storable_mstore, file, "$"); XSANY.any_i32 = 1; (void)newXSproto_portable("Storable::pretrieve", XS_Storable_pretrieve, file, "$;$"); (void)newXSproto_portable("Storable::mretrieve", XS_Storable_mretrieve, file, "$;$"); (void)newXSproto_portable("Storable::dclone", XS_Storable_dclone, file, "$"); cv = newXSproto_portable("Storable::is_retrieving", XS_Storable_last_op_in_netorder, file, ""); XSANY.any_i32 = ST_RETRIEVE; cv = newXSproto_portable("Storable::is_storing", XS_Storable_last_op_in_netorder, file, ""); XSANY.any_i32 = ST_STORE; cv = newXSproto_portable("Storable::last_op_in_netorder", XS_Storable_last_op_in_netorder, file, ""); XSANY.any_i32 = 0; (void)newXSproto_portable("Storable::stack_depth", XS_Storable_stack_depth, file, ""); (void)newXSproto_portable("Storable::stack_depth_hash", XS_Storable_stack_depth_hash, file, ""); /* Initialisation Section */ #line 7669 "Storable.xs" { HV *stash = gv_stashpvn("Storable", 8, GV_ADD); newCONSTSUB(stash, "BIN_MAJOR", newSViv(STORABLE_BIN_MAJOR)); newCONSTSUB(stash, "BIN_MINOR", newSViv(STORABLE_BIN_MINOR)); newCONSTSUB(stash, "BIN_WRITE_MINOR", newSViv(STORABLE_BIN_WRITE_MINOR)); newCONSTSUB(stash, "CAN_FLOCK", CAN_FLOCK); init_perinterp(aTHX); gv_fetchpv("Storable::drop_utf8", GV_ADDMULTI, SVt_PV); #ifdef DEBUGME /* Only disable the used only once warning if we are in debugging mode. */ gv_fetchpv("Storable::DEBUGME", GV_ADDMULTI, SVt_PV); #endif #ifdef USE_56_INTERWORK_KLUDGE gv_fetchpv("Storable::interwork_56_64bit", GV_ADDMULTI, SVt_PV); #endif } #line 8094 "Storable.c" /* End of Initialisation Section */ #if PERL_VERSION_LE(5, 21, 5) # if PERL_VERSION_GE(5, 9, 0) if (PL_unitcheckav) call_list(PL_scopestack_ix, PL_unitcheckav); # endif XSRETURN_YES; #else Perl_xs_boot_epilog(aTHX_ ax); #endif } PK ��[�mL� � META.ymlnu �[��� --- abstract: 'persistence for Perl data structures' author: - 'Perl 5 Porters' build_requires: ExtUtils::MakeMaker: '6.31' Test::More: '0.41' configure_requires: ExtUtils::MakeMaker: '6.31' dynamic_config: 1 generated_by: 'ExtUtils::MakeMaker version 7.62, CPAN::Meta::Converter version 2.150010' license: perl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: '1.4' name: Storable no_index: directory: - t - inc provides: Storable: file: Storable.pm version: '3.25' requires: XSLoader: '0' resources: bugtracker: https://github.com/Perl/perl5/issues version: '3.25' x_serialization_backend: 'CPAN::Meta::YAML version 0.018' PK ��[��!�� � Makefile.PLnu �[��� # # Copyright (c) 1995-2000, Raphael Manfredi # Copyright (c) 2017, Reini Urban # # You may redistribute only under the same terms as Perl 5, as specified # in the README file that comes with the distribution. # use strict; use warnings; use ExtUtils::MakeMaker 6.31; use Config; WriteMakefile( NAME => 'Storable', AUTHOR => 'Perl 5 Porters', LICENSE => 'perl', DISTNAME => "Storable", PREREQ_PM => { XSLoader => 0, }, ( $ExtUtils::MakeMaker::VERSION >= 6.64 ? ( CONFIGURE_REQUIRES => { 'ExtUtils::MakeMaker' => '6.31', }, BUILD_REQUIRES => { 'ExtUtils::MakeMaker' => '6.31', }, TEST_REQUIRES => { 'Test::More' => '0.41', }, ) : () ), INSTALLDIRS => ($] >= 5.007 && $] < 5.012) ? 'perl' : 'site', VERSION_FROM => 'Storable.pm', ABSTRACT_FROM => 'Storable.pm', ($ExtUtils::MakeMaker::VERSION > 6.45 ? (META_MERGE => { resources => { bugtracker => 'https://github.com/Perl/perl5/issues' }, provides => { 'Storable' => { file => 'Storable.pm', version => MM->parse_version('Storable.pm'), }, }, }, ) : ()), dist => { SUFFIX => 'gz', COMPRESS => 'gzip -f' }, clean => { FILES => 'Storable-*' }, ); my $ivtype = $Config{ivtype}; # I don't know if the VMS folks ever supported long long on 5.6.x if ($ivtype and $ivtype eq 'long long' and $^O !~ /^MSWin/) { print <<'EOM'; You appear to have a perl configured to use 64 bit integers in its scalar variables. If you have existing data written with an earlier version of Storable which this version of Storable refuses to load with a Byte order is not compatible error, then please read the section "64 bit data in perl 5.6.0 and 5.6.1" in the Storable documentation for instructions on how to read your data. (You can find the documentation at the end of Storable.pm in POD format) EOM } package MY; sub depend { " release : dist git tag \$(VERSION) cpan-upload \$(DISTVNAME).tar\$(SUFFIX) git push git push --tags " } PK ��[ -�.�� �� blib/man3/Storable.3pmnu �[��� .\" 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 .\" ======================================================================== .\" .IX Title "Storable 3" .TH Storable 3 "2021-08-30" "perl v5.32.1" "User Contributed Perl Documentation" .\" 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" Storable \- persistence for Perl data structures .SH "SYNOPSIS" .IX Header "SYNOPSIS" .Vb 3 \& use Storable; \& store \e%table, \*(Aqfile\*(Aq; \& $hashref = retrieve(\*(Aqfile\*(Aq); \& \& use Storable qw(nstore store_fd nstore_fd freeze thaw dclone); \& \& # Network order \& nstore \e%table, \*(Aqfile\*(Aq; \& $hashref = retrieve(\*(Aqfile\*(Aq); # There is NO nretrieve() \& \& # Storing to and retrieving from an already opened file \& store_fd \e@array, \e*STDOUT; \& nstore_fd \e%table, \e*STDOUT; \& $aryref = fd_retrieve(\e*SOCKET); \& $hashref = fd_retrieve(\e*SOCKET); \& \& # Serializing to memory \& $serialized = freeze \e%table; \& %table_clone = %{ thaw($serialized) }; \& \& # Deep (recursive) cloning \& $cloneref = dclone($ref); \& \& # Advisory locking \& use Storable qw(lock_store lock_nstore lock_retrieve) \& lock_store \e%table, \*(Aqfile\*(Aq; \& lock_nstore \e%table, \*(Aqfile\*(Aq; \& $hashref = lock_retrieve(\*(Aqfile\*(Aq); .Ve .SH "DESCRIPTION" .IX Header "DESCRIPTION" The Storable package brings persistence to your Perl data structures containing \s-1SCALAR, ARRAY, HASH\s0 or \s-1REF\s0 objects, i.e. anything that can be conveniently stored to disk and retrieved at a later time. .PP It can be used in the regular procedural way by calling \f(CW\*(C`store\*(C'\fR with a reference to the object to be stored, along with the file name where the image should be written. .PP The routine returns \f(CW\*(C`undef\*(C'\fR for I/O problems or other internal error, a true value otherwise. Serious errors are propagated as a \f(CW\*(C`die\*(C'\fR exception. .PP To retrieve data stored to disk, use \f(CW\*(C`retrieve\*(C'\fR with a file name. The objects stored into that file are recreated into memory for you, and a \fIreference\fR to the root object is returned. In case an I/O error occurs while reading, \f(CW\*(C`undef\*(C'\fR is returned instead. Other serious errors are propagated via \f(CW\*(C`die\*(C'\fR. .PP Since storage is performed recursively, you might want to stuff references to objects that share a lot of common data into a single array or hash table, and then store that object. That way, when you retrieve back the whole thing, the objects will continue to share what they originally shared. .PP At the cost of a slight header overhead, you may store to an already opened file descriptor using the \f(CW\*(C`store_fd\*(C'\fR routine, and retrieve from a file via \f(CW\*(C`fd_retrieve\*(C'\fR. Those names aren't imported by default, so you will have to do that explicitly if you need those routines. The file descriptor you supply must be already opened, for read if you're going to retrieve and for write if you wish to store. .PP .Vb 2 \& store_fd(\e%table, *STDOUT) || die "can\*(Aqt store to stdout\en"; \& $hashref = fd_retrieve(*STDIN); .Ve .PP You can also store data in network order to allow easy sharing across multiple platforms, or when storing on a socket known to be remotely connected. The routines to call have an initial \f(CW\*(C`n\*(C'\fR prefix for \fInetwork\fR, as in \f(CW\*(C`nstore\*(C'\fR and \f(CW\*(C`nstore_fd\*(C'\fR. At retrieval time, your data will be correctly restored so you don't have to know whether you're restoring from native or network ordered data. Double values are stored stringified to ensure portability as well, at the slight risk of loosing some precision in the last decimals. .PP When using \f(CW\*(C`fd_retrieve\*(C'\fR, objects are retrieved in sequence, one object (i.e. one recursive tree) per associated \f(CW\*(C`store_fd\*(C'\fR. .PP If you're more from the object-oriented camp, you can inherit from Storable and directly store your objects by invoking \f(CW\*(C`store\*(C'\fR as a method. The fact that the root of the to-be-stored tree is a blessed reference (i.e. an object) is special-cased so that the retrieve does not provide a reference to that object but rather the blessed object reference itself. (Otherwise, you'd get a reference to that blessed object). .SH "MEMORY STORE" .IX Header "MEMORY STORE" The Storable engine can also store data into a Perl scalar instead, to later retrieve them. This is mainly used to freeze a complex structure in some safe compact memory place (where it can possibly be sent to another process via some \s-1IPC,\s0 since freezing the structure also serializes it in effect). Later on, and maybe somewhere else, you can thaw the Perl scalar out and recreate the original complex structure in memory. .PP Surprisingly, the routines to be called are named \f(CW\*(C`freeze\*(C'\fR and \f(CW\*(C`thaw\*(C'\fR. If you wish to send out the frozen scalar to another machine, use \&\f(CW\*(C`nfreeze\*(C'\fR instead to get a portable image. .PP Note that freezing an object structure and immediately thawing it actually achieves a deep cloning of that structure: .PP .Vb 1 \& dclone(.) = thaw(freeze(.)) .Ve .PP Storable provides you with a \f(CW\*(C`dclone\*(C'\fR interface which does not create that intermediary scalar but instead freezes the structure in some internal memory space and then immediately thaws it out. .SH "ADVISORY LOCKING" .IX Header "ADVISORY LOCKING" The \f(CW\*(C`lock_store\*(C'\fR and \f(CW\*(C`lock_nstore\*(C'\fR routine are equivalent to \&\f(CW\*(C`store\*(C'\fR and \f(CW\*(C`nstore\*(C'\fR, except that they get an exclusive lock on the file before writing. Likewise, \f(CW\*(C`lock_retrieve\*(C'\fR does the same as \f(CW\*(C`retrieve\*(C'\fR, but also gets a shared lock on the file before reading. .PP As with any advisory locking scheme, the protection only works if you systematically use \f(CW\*(C`lock_store\*(C'\fR and \f(CW\*(C`lock_retrieve\*(C'\fR. If one side of your application uses \f(CW\*(C`store\*(C'\fR whilst the other uses \f(CW\*(C`lock_retrieve\*(C'\fR, you will get no protection at all. .PP The internal advisory locking is implemented using Perl's \fBflock()\fR routine. If your system does not support any form of \fBflock()\fR, or if you share your files across \s-1NFS,\s0 you might wish to use other forms of locking by using modules such as LockFile::Simple which lock a file using a filesystem entry, instead of locking the file descriptor. .SH "SPEED" .IX Header "SPEED" The heart of Storable is written in C for decent speed. Extra low-level optimizations have been made when manipulating perl internals, to sacrifice encapsulation for the benefit of greater speed. .SH "CANONICAL REPRESENTATION" .IX Header "CANONICAL REPRESENTATION" Normally, Storable stores elements of hashes in the order they are stored internally by Perl, i.e. pseudo-randomly. If you set \&\f(CW$Storable::canonical\fR to some \f(CW\*(C`TRUE\*(C'\fR value, Storable will store hashes with the elements sorted by their key. This allows you to compare data structures by comparing their frozen representations (or even the compressed frozen representations), which can be useful for creating lookup tables for complicated queries. .PP Canonical order does not imply network order; those are two orthogonal settings. .SH "CODE REFERENCES" .IX Header "CODE REFERENCES" Since Storable version 2.05, \s-1CODE\s0 references may be serialized with the help of B::Deparse. To enable this feature, set \&\f(CW$Storable::Deparse\fR to a true value. To enable deserialization, \&\f(CW$Storable::Eval\fR should be set to a true value. Be aware that deserialization is done through \f(CW\*(C`eval\*(C'\fR, which is dangerous if the Storable file contains malicious data. You can set \f(CW$Storable::Eval\fR to a subroutine reference which would be used instead of \f(CW\*(C`eval\*(C'\fR. See below for an example using a Safe compartment for deserialization of \s-1CODE\s0 references. .PP If \f(CW$Storable::Deparse\fR and/or \f(CW$Storable::Eval\fR are set to false values, then the value of \f(CW$Storable::forgive_me\fR (see below) is respected while serializing and deserializing. .SH "FORWARD COMPATIBILITY" .IX Header "FORWARD COMPATIBILITY" This release of Storable can be used on a newer version of Perl to serialize data which is not supported by earlier Perls. By default, Storable will attempt to do the right thing, by \f(CW\*(C`croak()\*(C'\fRing if it encounters data that it cannot deserialize. However, the defaults can be changed as follows: .IP "utf8 data" 4 .IX Item "utf8 data" Perl 5.6 added support for Unicode characters with code points > 255, and Perl 5.8 has full support for Unicode characters in hash keys. Perl internally encodes strings with these characters using utf8, and Storable serializes them as utf8. By default, if an older version of Perl encounters a utf8 value it cannot represent, it will \f(CW\*(C`croak()\*(C'\fR. To change this behaviour so that Storable deserializes utf8 encoded values as the string of bytes (effectively dropping the \fIis_utf8\fR flag) set \f(CW$Storable::drop_utf8\fR to some \f(CW\*(C`TRUE\*(C'\fR value. This is a form of data loss, because with \f(CW$drop_utf8\fR true, it becomes impossible to tell whether the original data was the Unicode string, or a series of bytes that happen to be valid utf8. .IP "restricted hashes" 4 .IX Item "restricted hashes" Perl 5.8 adds support for restricted hashes, which have keys restricted to a given set, and can have values locked to be read only. By default, when Storable encounters a restricted hash on a perl that doesn't support them, it will deserialize it as a normal hash, silently discarding any placeholder keys and leaving the keys and all values unlocked. To make Storable \f(CW\*(C`croak()\*(C'\fR instead, set \&\f(CW$Storable::downgrade_restricted\fR to a \f(CW\*(C`FALSE\*(C'\fR value. To restore the default set it back to some \f(CW\*(C`TRUE\*(C'\fR value. .Sp The cperl \s-1PERL_PERTURB_KEYS_TOP\s0 hash strategy has a known problem with restricted hashes. .IP "huge objects" 4 .IX Item "huge objects" On 64bit systems some data structures may exceed the 2G (i.e. I32_MAX) limit. On 32bit systems also strings between I32 and U32 (2G\-4G). Since Storable 3.00 (not in perl5 core) we are able to store and retrieve these objects, even if perl5 itself is not able to handle them. These are strings longer then 4G, arrays with more then 2G elements and hashes with more then 2G elements. cperl forbids hashes with more than 2G elements, but this fail in cperl then. perl5 itself at least until 5.26 allows it, but cannot iterate over them. Note that creating those objects might cause out of memory exceptions by the operating system before perl has a chance to abort. .IP "files from future versions of Storable" 4 .IX Item "files from future versions of Storable" Earlier versions of Storable would immediately croak if they encountered a file with a higher internal version number than the reading Storable knew about. Internal version numbers are increased each time new data types (such as restricted hashes) are added to the vocabulary of the file format. This meant that a newer Storable module had no way of writing a file readable by an older Storable, even if the writer didn't store newer data types. .Sp This version of Storable will defer croaking until it encounters a data type in the file that it does not recognize. This means that it will continue to read files generated by newer Storable modules which are careful in what they write out, making it easier to upgrade Storable modules in a mixed environment. .Sp The old behaviour of immediate croaking can be re-instated by setting \&\f(CW$Storable::accept_future_minor\fR to some \f(CW\*(C`FALSE\*(C'\fR value. .PP All these variables have no effect on a newer Perl which supports the relevant feature. .SH "ERROR REPORTING" .IX Header "ERROR REPORTING" Storable uses the \*(L"exception\*(R" paradigm, in that it does not try to workaround failures: if something bad happens, an exception is generated from the caller's perspective (see Carp and \f(CW\*(C`croak()\*(C'\fR). Use eval {} to trap those exceptions. .PP When Storable croaks, it tries to report the error via the \f(CW\*(C`logcroak()\*(C'\fR routine from the \f(CW\*(C`Log::Agent\*(C'\fR package, if it is available. .PP Normal errors are reported by having \fBstore()\fR or \fBretrieve()\fR return \f(CW\*(C`undef\*(C'\fR. Such errors are usually I/O errors (or truncated stream errors at retrieval). .PP When Storable throws the \*(L"Max. recursion depth with nested structures exceeded\*(R" error we are already out of stack space. Unfortunately on some earlier perl versions cleaning up a recursive data structure recurses into the free calls, which will lead to stack overflows in the cleanup. This data structure is not properly cleaned up then, it will only be destroyed during global destruction. .SH "WIZARDS ONLY" .IX Header "WIZARDS ONLY" .SS "Hooks" .IX Subsection "Hooks" Any class may define hooks that will be called during the serialization and deserialization process on objects that are instances of that class. Those hooks can redefine the way serialization is performed (and therefore, how the symmetrical deserialization should be conducted). .PP Since we said earlier: .PP .Vb 1 \& dclone(.) = thaw(freeze(.)) .Ve .PP everything we say about hooks should also hold for deep cloning. However, hooks get to know whether the operation is a mere serialization, or a cloning. .PP Therefore, when serializing hooks are involved, .PP .Vb 1 \& dclone(.) <> thaw(freeze(.)) .Ve .PP Well, you could keep them in sync, but there's no guarantee it will always hold on classes somebody else wrote. Besides, there is little to gain in doing so: a serializing hook could keep only one attribute of an object, which is probably not what should happen during a deep cloning of that same object. .PP Here is the hooking interface: .ie n .IP """STORABLE_freeze"" \fIobj\fR, \fIcloning\fR" 4 .el .IP "\f(CWSTORABLE_freeze\fR \fIobj\fR, \fIcloning\fR" 4 .IX Item "STORABLE_freeze obj, cloning" The serializing hook, called on the object during serialization. It can be inherited, or defined in the class itself, like any other method. .Sp Arguments: \fIobj\fR is the object to serialize, \fIcloning\fR is a flag indicating whether we're in a \fBdclone()\fR or a regular serialization via \fBstore()\fR or \fBfreeze()\fR. .Sp Returned value: A \s-1LIST\s0 \f(CW\*(C`($serialized, $ref1, $ref2, ...)\*(C'\fR where \f(CW$serialized\fR is the serialized form to be used, and the optional \f(CW$ref1\fR, \f(CW$ref2\fR, etc... are extra references that you wish to let the Storable engine serialize. .Sp At deserialization time, you will be given back the same \s-1LIST,\s0 but all the extra references will be pointing into the deserialized structure. .Sp The \fBfirst time\fR the hook is hit in a serialization flow, you may have it return an empty list. That will signal the Storable engine to further discard that hook for this class and to therefore revert to the default serialization of the underlying Perl data. The hook will again be normally processed in the next serialization. .Sp Unless you know better, serializing hook should always say: .Sp .Vb 5 \& sub STORABLE_freeze { \& my ($self, $cloning) = @_; \& return if $cloning; # Regular default serialization \& .... \& } .Ve .Sp in order to keep reasonable \fBdclone()\fR semantics. .ie n .IP """STORABLE_thaw"" \fIobj\fR, \fIcloning\fR, \fIserialized\fR, ..." 4 .el .IP "\f(CWSTORABLE_thaw\fR \fIobj\fR, \fIcloning\fR, \fIserialized\fR, ..." 4 .IX Item "STORABLE_thaw obj, cloning, serialized, ..." The deserializing hook called on the object during deserialization. But wait: if we're deserializing, there's no object yet... right? .Sp Wrong: the Storable engine creates an empty one for you. If you know Eiffel, you can view \f(CW\*(C`STORABLE_thaw\*(C'\fR as an alternate creation routine. .Sp This means the hook can be inherited like any other method, and that \&\fIobj\fR is your blessed reference for this particular instance. .Sp The other arguments should look familiar if you know \f(CW\*(C`STORABLE_freeze\*(C'\fR: \&\fIcloning\fR is true when we're part of a deep clone operation, \fIserialized\fR is the serialized string you returned to the engine in \f(CW\*(C`STORABLE_freeze\*(C'\fR, and there may be an optional list of references, in the same order you gave them at serialization time, pointing to the deserialized objects (which have been processed courtesy of the Storable engine). .Sp When the Storable engine does not find any \f(CW\*(C`STORABLE_thaw\*(C'\fR hook routine, it tries to load the class by requiring the package dynamically (using the blessed package name), and then re-attempts the lookup. If at that time the hook cannot be located, the engine croaks. Note that this mechanism will fail if you define several classes in the same file, but perlmod warned you. .Sp It is up to you to use this information to populate \fIobj\fR the way you want. .Sp Returned value: none. .ie n .IP """STORABLE_attach"" \fIclass\fR, \fIcloning\fR, \fIserialized\fR" 4 .el .IP "\f(CWSTORABLE_attach\fR \fIclass\fR, \fIcloning\fR, \fIserialized\fR" 4 .IX Item "STORABLE_attach class, cloning, serialized" While \f(CW\*(C`STORABLE_freeze\*(C'\fR and \f(CW\*(C`STORABLE_thaw\*(C'\fR are useful for classes where each instance is independent, this mechanism has difficulty (or is incompatible) with objects that exist as common process-level or system-level resources, such as singleton objects, database pools, caches or memoized objects. .Sp The alternative \f(CW\*(C`STORABLE_attach\*(C'\fR method provides a solution for these shared objects. Instead of \f(CW\*(C`STORABLE_freeze\*(C'\fR \-\-> \f(CW\*(C`STORABLE_thaw\*(C'\fR, you implement \f(CW\*(C`STORABLE_freeze\*(C'\fR \-\-> \f(CW\*(C`STORABLE_attach\*(C'\fR instead. .Sp Arguments: \fIclass\fR is the class we are attaching to, \fIcloning\fR is a flag indicating whether we're in a \fBdclone()\fR or a regular de-serialization via \&\fBthaw()\fR, and \fIserialized\fR is the stored string for the resource object. .Sp Because these resource objects are considered to be owned by the entire process/system, and not the \*(L"property\*(R" of whatever is being serialized, no references underneath the object should be included in the serialized string. Thus, in any class that implements \f(CW\*(C`STORABLE_attach\*(C'\fR, the \&\f(CW\*(C`STORABLE_freeze\*(C'\fR method cannot return any references, and \f(CW\*(C`Storable\*(C'\fR will throw an error if \f(CW\*(C`STORABLE_freeze\*(C'\fR tries to return references. .Sp All information required to \*(L"attach\*(R" back to the shared resource object \&\fBmust\fR be contained \fBonly\fR in the \f(CW\*(C`STORABLE_freeze\*(C'\fR return string. Otherwise, \f(CW\*(C`STORABLE_freeze\*(C'\fR behaves as normal for \f(CW\*(C`STORABLE_attach\*(C'\fR classes. .Sp Because \f(CW\*(C`STORABLE_attach\*(C'\fR is passed the class (rather than an object), it also returns the object directly, rather than modifying the passed object. .Sp Returned value: object of type \f(CW\*(C`class\*(C'\fR .SS "Predicates" .IX Subsection "Predicates" Predicates are not exportable. They must be called by explicitly prefixing them with the Storable package name. .ie n .IP """Storable::last_op_in_netorder""" 4 .el .IP "\f(CWStorable::last_op_in_netorder\fR" 4 .IX Item "Storable::last_op_in_netorder" The \f(CW\*(C`Storable::last_op_in_netorder()\*(C'\fR predicate will tell you whether network order was used in the last store or retrieve operation. If you don't know how to use this, just forget about it. .ie n .IP """Storable::is_storing""" 4 .el .IP "\f(CWStorable::is_storing\fR" 4 .IX Item "Storable::is_storing" Returns true if within a store operation (via STORABLE_freeze hook). .ie n .IP """Storable::is_retrieving""" 4 .el .IP "\f(CWStorable::is_retrieving\fR" 4 .IX Item "Storable::is_retrieving" Returns true if within a retrieve operation (via STORABLE_thaw hook). .SS "Recursion" .IX Subsection "Recursion" With hooks comes the ability to recurse back to the Storable engine. Indeed, hooks are regular Perl code, and Storable is convenient when it comes to serializing and deserializing things, so why not use it to handle the serialization string? .PP There are a few things you need to know, however: .IP "\(bu" 4 From Storable 3.05 to 3.13 we probed for the stack recursion limit for references, arrays and hashes to a maximal depth of ~1200\-35000, otherwise we might fall into a stack-overflow. On \s-1JSON::XS\s0 this limit is 512 btw. With references not immediately referencing each other there's no such limit yet, so you might fall into such a stack-overflow segfault. .Sp This probing and the checks we performed have some limitations: .RS 4 .IP "\(bu" 4 the stack size at build time might be different at run time, eg. the stack size may have been modified with \fBulimit\fR\|(1). If it's larger at run time Storable may fail the \fBfreeze()\fR or \fBthaw()\fR unnecessarily. If it's larger at build time Storable may segmentation fault when processing a deep structure at run time. .IP "\(bu" 4 the stack size might be different in a thread. .IP "\(bu" 4 array and hash recursion limits are checked separately against the same recursion depth, a frozen structure with a large sequence of nested arrays within many nested hashes may exhaust the processor stack without triggering Storable's recursion protection. .RE .RS 4 .Sp So these now have simple defaults rather than probing at build-time. .Sp You can control the maximum array and hash recursion depths by modifying \f(CW$Storable::recursion_limit\fR and \&\f(CW$Storable::recursion_limit_hash\fR respectively. Either can be set to \&\f(CW\*(C`\-1\*(C'\fR to prevent any depth checks, though this isn't recommended. .Sp If you want to test what the limits are, the \fIstacksize\fR tool is included in the \f(CW\*(C`Storable\*(C'\fR distribution. .RE .IP "\(bu" 4 You can create endless loops if the things you serialize via \fBfreeze()\fR (for instance) point back to the object we're trying to serialize in the hook. .IP "\(bu" 4 Shared references among objects will not stay shared: if we're serializing the list of object [A, C] where both object A and C refer to the \s-1SAME\s0 object B, and if there is a serializing hook in A that says freeze(B), then when deserializing, we'll get [A', C'] where A' refers to B', but C' refers to D, a deep clone of B'. The topology was not preserved. .IP "\(bu" 4 The maximal stack recursion limit for your system is returned by \&\f(CW\*(C`stack_depth()\*(C'\fR and \f(CW\*(C`stack_depth_hash()\*(C'\fR. The hash limit is usually half the size of the array and ref limit, as the Perl hash \s-1API\s0 is not optimal. .PP That's why \f(CW\*(C`STORABLE_freeze\*(C'\fR lets you provide a list of references to serialize. The engine guarantees that those will be serialized in the same context as the other objects, and therefore that shared objects will stay shared. .PP In the above [A, C] example, the \f(CW\*(C`STORABLE_freeze\*(C'\fR hook could return: .PP .Vb 1 \& ("something", $self\->{B}) .Ve .PP and the B part would be serialized by the engine. In \f(CW\*(C`STORABLE_thaw\*(C'\fR, you would get back the reference to the B' object, deserialized for you. .PP Therefore, recursion should normally be avoided, but is nonetheless supported. .SS "Deep Cloning" .IX Subsection "Deep Cloning" There is a Clone module available on \s-1CPAN\s0 which implements deep cloning natively, i.e. without freezing to memory and thawing the result. It is aimed to replace Storable's \fBdclone()\fR some day. However, it does not currently support Storable hooks to redefine the way deep cloning is performed. .SH "Storable magic" .IX Header "Storable magic" Yes, there's a lot of that :\-) But more precisely, in \s-1UNIX\s0 systems there's a utility called \f(CW\*(C`file\*(C'\fR, which recognizes data files based on their contents (usually their first few bytes). For this to work, a certain file called \fImagic\fR needs to taught about the \fIsignature\fR of the data. Where that configuration file lives depends on the \s-1UNIX\s0 flavour; often it's something like \fI/usr/share/misc/magic\fR or \&\fI/etc/magic\fR. Your system administrator needs to do the updating of the \fImagic\fR file. The necessary signature information is output to \&\s-1STDOUT\s0 by invoking \fBStorable::show_file_magic()\fR. Note that the \s-1GNU\s0 implementation of the \f(CW\*(C`file\*(C'\fR utility, version 3.38 or later, is expected to contain support for recognising Storable files out-of-the-box, in addition to other kinds of Perl files. .PP You can also use the following functions to extract the file header information from Storable images: .ie n .IP "$info = Storable::file_magic( $filename )" 4 .el .IP "\f(CW$info\fR = Storable::file_magic( \f(CW$filename\fR )" 4 .IX Item "$info = Storable::file_magic( $filename )" If the given file is a Storable image return a hash describing it. If the file is readable, but not a Storable image return \f(CW\*(C`undef\*(C'\fR. If the file does not exist or is unreadable then croak. .Sp The hash returned has the following elements: .RS 4 .ie n .IP """version""" 4 .el .IP "\f(CWversion\fR" 4 .IX Item "version" This returns the file format version. It is a string like \*(L"2.7\*(R". .Sp Note that this version number is not the same as the version number of the Storable module itself. For instance Storable v0.7 create files in format v2.0 and Storable v2.15 create files in format v2.7. The file format version number only increment when additional features that would confuse older versions of the module are added. .Sp Files older than v2.0 will have the one of the version numbers \*(L"\-1\*(R", \&\*(L"0\*(R" or \*(L"1\*(R". No minor number was used at that time. .ie n .IP """version_nv""" 4 .el .IP "\f(CWversion_nv\fR" 4 .IX Item "version_nv" This returns the file format version as number. It is a string like \&\*(L"2.007\*(R". This value is suitable for numeric comparisons. .Sp The constant function \f(CW\*(C`Storable::BIN_VERSION_NV\*(C'\fR returns a comparable number that represents the highest file version number that this version of Storable fully supports (but see discussion of \&\f(CW$Storable::accept_future_minor\fR above). The constant \&\f(CW\*(C`Storable::BIN_WRITE_VERSION_NV\*(C'\fR function returns what file version is written and might be less than \f(CW\*(C`Storable::BIN_VERSION_NV\*(C'\fR in some configurations. .ie n .IP """major"", ""minor""" 4 .el .IP "\f(CWmajor\fR, \f(CWminor\fR" 4 .IX Item "major, minor" This also returns the file format version. If the version is \*(L"2.7\*(R" then major would be 2 and minor would be 7. The minor element is missing for when major is less than 2. .ie n .IP """hdrsize""" 4 .el .IP "\f(CWhdrsize\fR" 4 .IX Item "hdrsize" The is the number of bytes that the Storable header occupies. .ie n .IP """netorder""" 4 .el .IP "\f(CWnetorder\fR" 4 .IX Item "netorder" This is \s-1TRUE\s0 if the image store data in network order. This means that it was created with \fBnstore()\fR or similar. .ie n .IP """byteorder""" 4 .el .IP "\f(CWbyteorder\fR" 4 .IX Item "byteorder" This is only present when \f(CW\*(C`netorder\*(C'\fR is \s-1FALSE.\s0 It is the \&\f(CW$Config\fR{byteorder} string of the perl that created this image. It is a string like \*(L"1234\*(R" (32 bit little endian) or \*(L"87654321\*(R" (64 bit big endian). This must match the current perl for the image to be readable by Storable. .ie n .IP """intsize"", ""longsize"", ""ptrsize"", ""nvsize""" 4 .el .IP "\f(CWintsize\fR, \f(CWlongsize\fR, \f(CWptrsize\fR, \f(CWnvsize\fR" 4 .IX Item "intsize, longsize, ptrsize, nvsize" These are only present when \f(CW\*(C`netorder\*(C'\fR is \s-1FALSE.\s0 These are the sizes of various C datatypes of the perl that created this image. These must match the current perl for the image to be readable by Storable. .Sp The \f(CW\*(C`nvsize\*(C'\fR element is only present for file format v2.2 and higher. .ie n .IP """file""" 4 .el .IP "\f(CWfile\fR" 4 .IX Item "file" The name of the file. .RE .RS 4 .RE .ie n .IP "$info = Storable::read_magic( $buffer )" 4 .el .IP "\f(CW$info\fR = Storable::read_magic( \f(CW$buffer\fR )" 4 .IX Item "$info = Storable::read_magic( $buffer )" .PD 0 .ie n .IP "$info = Storable::read_magic( $buffer, $must_be_file )" 4 .el .IP "\f(CW$info\fR = Storable::read_magic( \f(CW$buffer\fR, \f(CW$must_be_file\fR )" 4 .IX Item "$info = Storable::read_magic( $buffer, $must_be_file )" .PD The \f(CW$buffer\fR should be a Storable image or the first few bytes of it. If \f(CW$buffer\fR starts with a Storable header, then a hash describing the image is returned, otherwise \f(CW\*(C`undef\*(C'\fR is returned. .Sp The hash has the same structure as the one returned by \&\fBStorable::file_magic()\fR. The \f(CW\*(C`file\*(C'\fR element is true if the image is a file image. .Sp If the \f(CW$must_be_file\fR argument is provided and is \s-1TRUE,\s0 then return \&\f(CW\*(C`undef\*(C'\fR unless the image looks like it belongs to a file dump. .Sp The maximum size of a Storable header is currently 21 bytes. If the provided \f(CW$buffer\fR is only the first part of a Storable image it should at least be this long to ensure that \fBread_magic()\fR will recognize it as such. .SH "EXAMPLES" .IX Header "EXAMPLES" Here are some code samples showing a possible usage of Storable: .PP .Vb 1 \& use Storable qw(store retrieve freeze thaw dclone); \& \& %color = (\*(AqBlue\*(Aq => 0.1, \*(AqRed\*(Aq => 0.8, \*(AqBlack\*(Aq => 0, \*(AqWhite\*(Aq => 1); \& \& store(\e%color, \*(Aqmycolors\*(Aq) or die "Can\*(Aqt store %a in mycolors!\en"; \& \& $colref = retrieve(\*(Aqmycolors\*(Aq); \& die "Unable to retrieve from mycolors!\en" unless defined $colref; \& printf "Blue is still %lf\en", $colref\->{\*(AqBlue\*(Aq}; \& \& $colref2 = dclone(\e%color); \& \& $str = freeze(\e%color); \& printf "Serialization of %%color is %d bytes long.\en", length($str); \& $colref3 = thaw($str); .Ve .PP which prints (on my machine): .PP .Vb 2 \& Blue is still 0.100000 \& Serialization of %color is 102 bytes long. .Ve .PP Serialization of \s-1CODE\s0 references and deserialization in a safe compartment: .PP .Vb 11 \& use Storable qw(freeze thaw); \& use Safe; \& use strict; \& my $safe = new Safe; \& # because of opcodes used in "use strict": \& $safe\->permit(qw(:default require)); \& local $Storable::Deparse = 1; \& local $Storable::Eval = sub { $safe\->reval($_[0]) }; \& my $serialized = freeze(sub { 42 }); \& my $code = thaw($serialized); \& $code\->() == 42; .Ve .SH "SECURITY WARNING" .IX Header "SECURITY WARNING" \&\fBDo not accept Storable documents from untrusted sources!\fR .PP Some features of Storable can lead to security vulnerabilities if you accept Storable documents from untrusted sources with the default flags. Most obviously, the optional (off by default) \s-1CODE\s0 reference serialization feature allows transfer of code to the deserializing process. Furthermore, any serialized object will cause Storable to helpfully load the module corresponding to the class of the object in the deserializing module. For manipulated module names, this can load almost arbitrary code. Finally, the deserialized object's destructors will be invoked when the objects get destroyed in the deserializing process. Maliciously crafted Storable documents may put such objects in the value of a hash key that is overridden by another key/value pair in the same hash, thus causing immediate destructor execution. .PP To disable blessing objects while thawing/retrieving remove the flag \&\f(CW\*(C`BLESS_OK\*(C'\fR = 2 from \f(CW$Storable::flags\fR or set the 2nd argument for thaw/retrieve to 0. .PP To disable tieing data while thawing/retrieving remove the flag \f(CW\*(C`TIE_OK\*(C'\fR = 4 from \f(CW$Storable::flags\fR or set the 2nd argument for thaw/retrieve to 0. .PP With the default setting of \f(CW$Storable::flags\fR = 6, creating or destroying random objects, even renamed objects can be controlled by an attacker. See \s-1CVE\-2015\-1592\s0 and its metasploit module. .PP If your application requires accepting data from untrusted sources, you are best off with a less powerful and more-likely safe serialization format and implementation. If your data is sufficiently simple, Cpanel::JSON::XS, Data::MessagePack or Sereal are the best choices and offer maximum interoperability, but note that Sereal is unsafe by default. .SH "WARNING" .IX Header "WARNING" If you're using references as keys within your hash tables, you're bound to be disappointed when retrieving your data. Indeed, Perl stringifies references used as hash table keys. If you later wish to access the items via another reference stringification (i.e. using the same reference that was used for the key originally to record the value into the hash table), it will work because both references stringify to the same string. .PP It won't work across a sequence of \f(CW\*(C`store\*(C'\fR and \f(CW\*(C`retrieve\*(C'\fR operations, however, because the addresses in the retrieved objects, which are part of the stringified references, will probably differ from the original addresses. The topology of your structure is preserved, but not hidden semantics like those. .PP On platforms where it matters, be sure to call \f(CW\*(C`binmode()\*(C'\fR on the descriptors that you pass to Storable functions. .PP Storing data canonically that contains large hashes can be significantly slower than storing the same data normally, as temporary arrays to hold the keys for each hash have to be allocated, populated, sorted and freed. Some tests have shown a halving of the speed of storing \*(-- the exact penalty will depend on the complexity of your data. There is no slowdown on retrieval. .SH "REGULAR EXPRESSIONS" .IX Header "REGULAR EXPRESSIONS" Storable now has experimental support for storing regular expressions, but there are significant limitations: .IP "\(bu" 4 perl 5.8 or later is required. .IP "\(bu" 4 regular expressions with code blocks, ie \f(CW\*(C`/(?{ ... })/\*(C'\fR or \f(CW\*(C`/(??{ \&... })/\*(C'\fR will throw an exception when thawed. .IP "\(bu" 4 regular expression syntax and flags have changed over the history of perl, so a regular expression that you freeze in one version of perl may fail to thaw or behave differently in another version of perl. .IP "\(bu" 4 depending on the version of perl, regular expressions can change in behaviour depending on the context, but later perls will bake that behaviour into the regexp. .PP Storable will throw an exception if a frozen regular expression cannot be thawed. .SH "BUGS" .IX Header "BUGS" You can't store \s-1GLOB, FORMLINE,\s0 etc.... If you can define semantics for those operations, feel free to enhance Storable so that it can deal with them. .PP The store functions will \f(CW\*(C`croak\*(C'\fR if they run into such references unless you set \f(CW$Storable::forgive_me\fR to some \f(CW\*(C`TRUE\*(C'\fR value. In that case, the fatal message is converted to a warning and some meaningless string is stored instead. .PP Setting \f(CW$Storable::canonical\fR may not yield frozen strings that compare equal due to possible stringification of numbers. When the string version of a scalar exists, it is the form stored; therefore, if you happen to use your numbers as strings between two freezing operations on the same data structures, you will get different results. .PP When storing doubles in network order, their value is stored as text. However, you should also not expect non-numeric floating-point values such as infinity and \*(L"not a number\*(R" to pass successfully through a \&\fBnstore()\fR/\fBretrieve()\fR pair. .PP As Storable neither knows nor cares about character sets (although it does know that characters may be more than eight bits wide), any difference in the interpretation of character codes between a host and a target system is your problem. In particular, if host and target use different code points to represent the characters used in the text representation of floating-point numbers, you will not be able be able to exchange floating-point data, even with \fBnstore()\fR. .PP \&\f(CW\*(C`Storable::drop_utf8\*(C'\fR is a blunt tool. There is no facility either to return \fBall\fR strings as utf8 sequences, or to attempt to convert utf8 data back to 8 bit and \f(CW\*(C`croak()\*(C'\fR if the conversion fails. .PP Prior to Storable 2.01, no distinction was made between signed and unsigned integers on storing. By default Storable prefers to store a scalars string representation (if it has one) so this would only cause problems when storing large unsigned integers that had never been converted to string or floating point. In other words values that had been generated by integer operations such as logic ops and then not used in any string or arithmetic context before storing. .SS "64 bit data in perl 5.6.0 and 5.6.1" .IX Subsection "64 bit data in perl 5.6.0 and 5.6.1" This section only applies to you if you have existing data written out by Storable 2.02 or earlier on perl 5.6.0 or 5.6.1 on Unix or Linux which has been configured with 64 bit integer support (not the default) If you got a precompiled perl, rather than running Configure to build your own perl from source, then it almost certainly does not affect you, and you can stop reading now (unless you're curious). If you're using perl on Windows it does not affect you. .PP Storable writes a file header which contains the sizes of various C language types for the C compiler that built Storable (when not writing in network order), and will refuse to load files written by a Storable not on the same (or compatible) architecture. This check and a check on machine byteorder is needed because the size of various fields in the file are given by the sizes of the C language types, and so files written on different architectures are incompatible. This is done for increased speed. (When writing in network order, all fields are written out as standard lengths, which allows full interworking, but takes longer to read and write) .PP Perl 5.6.x introduced the ability to optional configure the perl interpreter to use C's \f(CW\*(C`long long\*(C'\fR type to allow scalars to store 64 bit integers on 32 bit systems. However, due to the way the Perl configuration system generated the C configuration files on non-Windows platforms, and the way Storable generates its header, nothing in the Storable file header reflected whether the perl writing was using 32 or 64 bit integers, despite the fact that Storable was storing some data differently in the file. Hence Storable running on perl with 64 bit integers will read the header from a file written by a 32 bit perl, not realise that the data is actually in a subtly incompatible format, and then go horribly wrong (possibly crashing) if it encountered a stored integer. This is a design failure. .PP Storable has now been changed to write out and read in a file header with information about the size of integers. It's impossible to detect whether an old file being read in was written with 32 or 64 bit integers (they have the same header) so it's impossible to automatically switch to a correct backwards compatibility mode. Hence this Storable defaults to the new, correct behaviour. .PP What this means is that if you have data written by Storable 1.x running on perl 5.6.0 or 5.6.1 configured with 64 bit integers on Unix or Linux then by default this Storable will refuse to read it, giving the error \&\fIByte order is not compatible\fR. If you have such data then you should set \f(CW$Storable::interwork_56_64bit\fR to a true value to make this Storable read and write files with the old header. You should also migrate your data, or any older perl you are communicating with, to this current version of Storable. .PP If you don't have data written with specific configuration of perl described above, then you do not and should not do anything. Don't set the flag \- not only will Storable on an identically configured perl refuse to load them, but Storable a differently configured perl will load them believing them to be correct for it, and then may well fail or crash part way through reading them. .SH "CREDITS" .IX Header "CREDITS" Thank you to (in chronological order): .PP .Vb 10 \& Jarkko Hietaniemi <jhi@iki.fi> \& Ulrich Pfeifer <pfeifer@charly.informatik.uni\-dortmund.de> \& Benjamin A. Holzman <bholzman@earthlink.net> \& Andrew Ford <A.Ford@ford\-mason.co.uk> \& Gisle Aas <gisle@aas.no> \& Jeff Gresham <gresham_jeffrey@jpmorgan.com> \& Murray Nesbitt <murray@activestate.com> \& Marc Lehmann <pcg@opengroup.org> \& Justin Banks <justinb@wamnet.com> \& Jarkko Hietaniemi <jhi@iki.fi> (AGAIN, as perl 5.7.0 Pumpkin!) \& Salvador Ortiz Garcia <sog@msg.com.mx> \& Dominic Dunlop <domo@computer.org> \& Erik Haugan <erik@solbors.no> \& Benjamin A. Holzman <ben.holzman@grantstreet.com> \& Reini Urban <rurban@cpan.org> \& Todd Rinaldo <toddr@cpanel.net> \& Aaron Crane <arc@cpan.org> .Ve .PP for their bug reports, suggestions and contributions. .PP Benjamin Holzman contributed the tied variable support, Andrew Ford contributed the canonical order for hashes, and Gisle Aas fixed a few misunderstandings of mine regarding the perl internals, and optimized the emission of \*(L"tags\*(R" in the output streams by simply counting the objects instead of tagging them (leading to a binary incompatibility for the Storable image starting at version 0.6\-\-older images are, of course, still properly understood). Murray Nesbitt made Storable thread-safe. Marc Lehmann added overloading and references to tied items support. Benjamin Holzman added a performance improvement for overloaded classes; thanks to Grant Street Group for footing the bill. Reini Urban took over maintenance from p5p, and added security fixes and huge object support. .SH "AUTHOR" .IX Header "AUTHOR" Storable was written by Raphael Manfredi \&\fI<Raphael_Manfredi@pobox.com>\fR Maintenance is now done by cperl <http://perl11.org/cperl> .PP Please e\-mail us with problems, bug fixes, comments and complaints, although if you have compliments you should send them to Raphael. Please don't e\-mail Raphael with problems, as he no longer works on Storable, and your message will be delayed while he forwards it to us. .SH "SEE ALSO" .IX Header "SEE ALSO" Clone. PK ��[ blib/man3/.existsnu �[��� PK ��[ blib/man1/.existsnu �[��� PK ��[ blib/arch/.existsnu �[��� PK ��[ blib/arch/auto/Storable/.existsnu �[��� PK ��[�{� - - # blib/arch/auto/Storable/Storable.sonu ȯ�� ELF >