XML-Hash-XS-0.64/0000755000175000017500000000000014735256165012054 5ustar yurayuraXML-Hash-XS-0.64/Changes0000644000175000017500000001346314735256066013356 0ustar yurayuraRevision history for perl module XML::Hash::XS 0.64 2025-01-01 - Fix for Sparc64. 0.63 2024-12-29 - Fix for OpenBSD. - Fix for MSVC. 0.62 2024-12-28 - Fix for Win32. 0.61 2024-12-27 - Another fix for big endian. 0.60 2024-12-24 - Another fix for big endian. 0.59 2024-12-21 - Fix typo 0.58 2024-12-20 - Fix for big endian architecture 0.57 2024-09-27 - Use "keep_root" option to generate XML via "hash2xml" - Change default value of "keep_root" option to "1" 0.56 2021-02-14 - Fix XML parsing with file handle - Thanks to Rory Zweistra for report - Fix case of "XML::Simple" in docs - Thanks to Anirvan Chatterjee for help 0.55 2020-03-03 - Parse "xml-stylesheet" processing instruction 0.54 2019-12-28 - Add "SuppressEmpty" option 0.53 2018-08-31 - Don't trim spaces on text node when "trim" option is off - Thanks to Tudor Marghidanu for report 0.52 2018-03-25 - Implement searilization of objects with overloaded stringification - Thanks to Slobodan Mišković for advice 0.51 2017-08-28 - Add partial support for DTD 0.50 2017-03-16 - Fix documentation typo 0.49 2017-03-16 - Fix encoder error handling - Thanks to Ben Bullock for report 0.48 2017-03-15 - Don't merge text from different nodes 0.47 2017-02-18 - The "trim" option now is used while conversion of xml to hash - Thanks to Useperl for report 0.46 2017-01-28 - Fix bug occurs while using multiple job compile - Fix configure error on OpenBSD: No library found for -liconv 0.45 2017-01-19 - Fix incorrect folding of arrays in LX mode - Thanks to Nigelm for report 0.44 2016-06-09 - Fix bug with null-terminated xml - Thanks to Zdm for report 0.43 2015-07-15 - Fix memory allocation bug - Thanks to Jeffrey Ryan Thalhammer for report 0.42 2015-05-08 - Improved fix for OpenBSD/NetBSD 0.41 2015-04-30 - Fix bug in parsing entity references 0.40 2015-04-30 - Fix memory allocation bug - Thanks to Phillup for report - Fix compilation on OpenBSD/NetBSD 0.39 2015-04-28 - Improved XML detection - Thanks to Phillup for report 0.38 2015-04-21 - New options "filter" and "cb" - Fix some memory leaks bugs - Fix compilation errors with using -Wextra 0.37 2015-04-14 - Fix broken archive 0.36 2015-04-14 - Fix bug with use force_array option - Thanks to Dmytro Zagashev for report - New option "force_content" - New option "merge_text" 0.35 2015-04-13 - Fix bug with regexp on perl 5.8.X 0.34 2015-04-12 - Fix bug when many contents in one node 0.33 2015-04-12 - Fix bug when many contents in one node - New option "force_array" 0.32 2015-03-28 - Revamped Makefile.PL - Add resources to META_MERGE - Add prereqs to META_ADD - Replace bugtracker to github - Added author tests 0.31 2015-03-25 - Fix xml parsing failure when CR symbol found after xml declaration - https://rt.cpan.org/Ticket/Display.html?id=103002 - Thanks to Dmytro Zagashev for report 0.30 2015-03-23 - Fix params validation failure - https://rt.cpan.org/Ticket/Display.html?id=102992 - Thanks to Dmytro Zagashev for report 0.29 2015-01-30 - Fix segmentation fault on test for tied handle 0.28 2015-01-14 - Fix test for tied handle - Fix compilation failure on Haiku OS 0.27 2015-01-14 - Added feature conversion of xml to hash 0.26 2014-03-13 - Fix compilation failure on some OS - Fix compilation failure when using libiconv with MinGW - Fix segmentation fault when using XML::LibXML 0.25 2014-03-11 - Added possibility object serialization using methods "toString" and "iternext" - Fixed docs and other minor fixes 0.24 2014-01-17 - Fix overriding CCFLAGS when passed to WriteMakefile 0.23 2014-01-15 - Mass refactoring, fix many bugs and add some tests 0.22 2013-07-20 - Using XML::LibXML library is optional now - Fix some tests 0.21 2013-07-16 - Fixed #include error 0.20 2013-07-14 - Fix bug when conv_writer_t has no member named encoder - Fix 02-conv-lx.t test 0.19 2013-07-08 - Fix segmentation fault when value=undef and use_attr=1 - Set utf8 flag for result string 0.18 2013-04-14 - Fix segmentation fault - Skip encoding tests if encoding is not supported 0.17 2013-03-22 - Fix bug with invalid stack pointer 0.16 2013-03-19 - New option "doc" 0.15 2013-03-17 - Modify for directly using of Iconv and ICU libs 0.14 2013-03-13 - Fixed bug with memory allocation 0.13 2013-03-09 - Implemented OO interface 0.12_01 2013-03-07 - Added benchmark results 0.12 2013-03-06 - Added experimental support the conversion method of the XML::Hash::LX library 0.11 2013-03-02 - Fix for compatibility with version 2.9.0 library libxml2 0.10 2012-04-19 - New option "xml_decl". 0.09 2012-04-12 - New option "content" 0.08 2012-04-10 - Fix build error when using perl < 5.10 0.07 2012-04-07 - Fix memory leak 0.06 2012-04-06 - New options "canonical" and "use_attr" 0.05_03 2012-04-02 - Fix bug with ppport.h 0.05_02 2012-04-02 - Added ppport.h - No more using Scalar::Util 0.05_01 2012-03-26 - Fix conv.t test 0.05 2012-03-25 - Fix build error on FreeBSD 0.04 2012-03-24 - Updated Makefile.PL 0.03_01 2012-02-28 - Added META.json 0.03 2012-02-25 - Changed output to a file handle - Thanks to Cono 0.02 2012-02-15 - Increased performance by 2.5 times via direct conversion to a string without creating a DOM 0.01 2012-02-12 - First version XML-Hash-XS-0.64/typemap0000644000175000017500000000153112455473143013450 0ustar yurayuraTYPEMAP xh_opts_t * T_CONV xmlNodePtr O_NODE_OBJECT INPUT O_NODE_OBJECT if( sv_isobject($arg) && (SvTYPE(SvRV($arg)) == SVt_PVMG) ) { $var = INT2PTR($type,PmmSvNode($arg)); if ( $var == NULL ) { croak( \"${Package}::$func_name() -- $var contains no data\" ); XSRETURN_UNDEF; } } else { croak( \"${Package}::$func_name() -- $var is not a blessed SV reference\" ); XSRETURN_UNDEF; } T_CONV if (sv_isa($arg, \"XML::Hash::XS\")) { IV tmp = SvIV((SV *) SvRV($arg)); $var = INT2PTR(xh_opts_t *, tmp); } else Perl_croak(aTHX_ \"%s: %s is not of type XML::Hash::XS\", ${$ALIAS?\q[GvNAME(CvGV(cv))]:\qq[\"$pname\"]}, \"$var\") OUTPUT T_CONV sv_setref_pv($arg, \"XML::Hash::XS\", (void *) $var); XML-Hash-XS-0.64/LICENSE0000644000175000017500000000206214732550202013043 0ustar yurayuraMIT License Copyright (c) 2024 Yurii Ustiushenko Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. XML-Hash-XS-0.64/benchmark/0000755000175000017500000000000014735256165014006 5ustar yurayuraXML-Hash-XS-0.64/benchmark/benchmark.pl0000755000175000017500000000316613177671425016305 0ustar yurayura#!/usr/bin/env perl use FindBin; use lib ("$FindBin::Bin/../blib/lib", "$FindBin::Bin/../blib/arch"); use LWP::Simple 'get'; use XML::Hash::LX; use XML::Hash; use XML::Simple; use XML::LibXML; use XML::Hash::XS qw(); use Benchmark qw(:all); use XML::Bare; my $xml_converter = XML::Hash->new(); my $xml = getXml(); my $xh_hash = $xml_converter->fromXMLStringtoHash($xml); my $lx_hash = xml2hash($xml); my $xs_hash = XMLin($xml); my $xs_conv = XML::Hash::XS->new(); print "\nHash to XML:\n"; cmpthese -3, { 'XML::Hash' => sub { my $oxml = $xml_converter->fromHashtoXMLString($xh_hash); }, 'XML::Simple' => sub { my $oxml = XMLout($xs_hash); }, 'XML::Hash::LX' => sub { my $oxml = hash2xml($lx_hash); }, 'XML::Hash::XS' => sub { my $oxml = XML::Hash::XS::hash2xml($xs_hash); }, }; print "\nXML to Hash:\n"; cmpthese -3, { # 'XML::Hash' => sub { # my $oxml = $xml_converter->fromXMLStringtoHash($xh_hash); # }, 'XML::Simple' => sub { my $oxml = XMLin($xml); }, 'XML::Hash::LX' => sub { my $oxml = hash2xml($lx_hash); }, 'XML::Hash::XS' => sub { my $oxml = XML::Hash::XS::xml2hash($xml); }, 'XML::Bare' => sub { my $oxml = XML::Bare->new(text => $xml)->parse(); }, }; sub getXml { my $fn = "$FindBin::Bin/uploads.rdf"; open my $f, '<',$fn or return do { warn "Fetching file\n"; my $data = get 'http://search.cpan.org/uploads.rdf'; open my $fo, '>', $fn; print $fo $data; close $fo; $data; }; warn "Have preloaded file\n"; local $/; <$f> } XML-Hash-XS-0.64/t/0000755000175000017500000000000014735256165012317 5ustar yurayuraXML-Hash-XS-0.64/t/09-x2h_cdata.t0000644000175000017500000000143414675463631014572 0ustar yurayurapackage main; use strict; use warnings; use Test::More tests => 4; use Data::Dumper; $Data::Dumper::Indent = 0; $Data::Dumper::Sortkeys = 1; use XML::Hash::XS 'xml2hash'; $XML::Hash::XS::keep_root = 0; our $xml_decl_utf8 = qq{}; { is xml2hash("\n\t ]]>"), "\n\t abcde!\@#\$%^&*<>\n\t ", 'use special symbols', ; } { is xml2hash(" ]]]]]]>"), ' [ abc ] ]> ]]]]', 'terminate section', ; } { is xml2hash(""), ' ]', 'terminate section2', ; } { is xml2hash(""), '', 'empty section', ; } XML-Hash-XS-0.64/t/04-h2x-lx.t0000644000175000017500000000546613037760327014054 0ustar yurayura use strict; use warnings; use Test::More tests => 15; use XML::Hash::XS 'hash2xml'; $XML::Hash::XS::method = 'LX'; $XML::Hash::XS::trim = 1; our $xml_decl = qq{\n}; { is hash2xml( { root => { '#text' => ' zzzz ' } } ), qq{$xml_declzzzz}, 'text', ; } { is hash2xml( { root => { sub => 'test' } } ), qq{$xml_decltest}, 'node', ; } { is hash2xml( { root => { -attr => "test < > & \" \t \n \r end" } } ), qq{$xml_decl}, 'attr', ; } { is hash2xml( { root => { _attr => "test" } }, attr => '_' ), qq{$xml_decl}, 'attr _', ; } { is hash2xml( { root => { '~' => "zzzz < > & \r end" } }, text => '~' ), qq{$xml_declzzzz < > & end}, 'text ~', ; } { is hash2xml( { root => " \t\ntest" }, trim => 1 ), qq{$xml_decltest}, 'trim 1', ; is hash2xml( { root => " \t\ntest" }, trim => 0 ), qq{$xml_decl \t\ntest}, 'trim 0', ; } { is hash2xml( { root => { sub => { '@' => "cdata < > & \" \t \n \r end" } } }, cdata => '@' ), qq{$xml_decl & \" \t \n \r end]]>}, 'cdata @', ; } { is hash2xml( { root => { sub => { '/' => "comment < > & \" \t \n \r end" } } },comm => '/' ), qq{$xml_decl}, 'comm /', ; } { is hash2xml( { root => { -attr => undef } } ), qq{$xml_decl}, 'empty attr', ; } { is hash2xml( { root => { '#cdata' => undef } }, cdata => '#cdata' ), qq{$xml_decl}, 'empty cdata', ; } { is hash2xml( { root => { '/' => undef } }, comm => '/' ), qq{$xml_decl}, 'empty comment', ; } { is hash2xml( { root => { x=>undef } } ), qq{$xml_decl}, 'empty tag', ; } { is hash2xml( { root => { item => [1, 2, 3, { -attr => 4, node => 5 }, [6, 7] ] } } ), qq{$xml_decl123567}, 'array', ; } SKIP: { my $data; eval { $data = hash2xml( { root => { test => "Тест" } }, encoding => 'cp1251' ) }; my $err = $@; chomp $err; skip $err, 1 if $err; is $data, qq{\n\322\345\361\362}, 'encoding support', ; } XML-Hash-XS-0.64/t/03-h2x-oop.t0000644000175000017500000000077112307437245014216 0ustar yurayura use strict; use warnings; use Test::More tests => 2; use XML::Hash::XS qw(); our $conv = XML::Hash::XS->new(); our $xml_decl = qq{}; { is $conv->hash2xml( { node1 => sub { 'value1' } } ), qq{$xml_decl\nvalue1}, 'code reference', ; } { is XML::Hash::XS::hash2xml( { node1 => sub { 'value1' } } ), qq{$xml_decl\nvalue1}, 'code reference', ; } XML-Hash-XS-0.64/t/17-x2h_stylesheet.t0000644000175000017500000000075314675463560015712 0ustar yurayurapackage main; use strict; use warnings; use Test::More tests => 1; use XML::Hash::XS 'xml2hash'; $XML::Hash::XS::keep_root = 0; { is xml2hash('' . '' . '' . 'OK'), "OK", 'simple', ; } XML-Hash-XS-0.64/t/test_null_terminated.xml0000644000175000017500000000020412726250242017246 0ustar yurayura XML-Hash-XS-0.64/t/00-load.t0000644000175000017500000000045112310371725013623 0ustar yurayura use strict; use warnings; use Test::More tests => 1; BEGIN { use_ok('XML::Hash::XS') }; diag( "Testing XML::Hash::XS $XML::Hash::XS::VERSION, Perl $], $^X" ); eval { require XML::LibXML }; unless ($@) { diag("XML::LibXML $XML::LibXML::VERSION, libxml2 ", XML::LibXML::LIBXML_VERSION()); } XML-Hash-XS-0.64/t/01-h2x.t0000644000175000017500000001774514731447702013434 0ustar yurayurapackage main; use strict; use warnings; use Test::More tests => 25; use File::Temp qw(tempfile); use XML::Hash::XS 'hash2xml'; our $xml_decl = qq{}; { is hash2xml( { node1 => [ 'value1', { node2 => 'value2' } ] } ), qq{$xml_decl\nvalue1value2}, 'default', ; } { is hash2xml( { node1 => [ 'value1', { node2 => 'value2' } ] }, keep_root => 0, xml_decl => 0 ), qq{value1value2}, 'rootless', ; } { is hash2xml( { node3 => 'value3', node1 => 'value1', node2 => 'value2' }, canonical => 1 ), qq{$xml_decl\nvalue1value2value3}, 'canonical', ; } { is hash2xml( { node1 => [ 'value1', { node2 => 'value2' } ] }, indent => 2 ), <<"EOT", $xml_decl value1 value2 EOT 'indent', ; } { is hash2xml( { node1 => [ 1, '2', '2' + 1 ] } ), qq{$xml_decl\n123}, 'integer, string, integer + string', ; } { my $x = 1.1; my $y = '2.2'; is hash2xml( { node1 => [ $x, $y, $y + $x ] } ), qq{$xml_decl\n1.12.23.3}, 'double, string, double + string', ; } { is hash2xml( { 1 => 'value1' } ), qq{$xml_decl\n<_1>value1}, 'quote tag name', ; } { is hash2xml( { node1 => \'value1' } ), qq{$xml_decl\nvalue1}, 'scalar reference', ; } { is hash2xml( { node1 => sub { 'value1' } } ), qq{$xml_decl\nvalue1}, 'code reference', ; } { is hash2xml( { node1 => sub { undef } } ), qq{$xml_decl\n}, 'code reference with undef', ; } { is hash2xml( { node1 => sub { [ 'value1' ] } } ), qq{$xml_decl\nvalue1}, 'code reference with array', ; } SKIP: { my $data; eval { $data = hash2xml( { node1 => 'Тест' }, encoding => 'cp1251' ) }; my $err = $@; chomp $err; skip $err, 1 if $err; is $data, qq{\n\322\345\361\362}, 'encoding support', ; } { is hash2xml( { node1 => "< > & \r" } ), qq{$xml_decl\n< > & }, 'escaping', ; } { is hash2xml( { node => " \t\ntest " }, trim => 0 ), qq{$xml_decl\n \t\ntest }, 'trim 0', ; is hash2xml( { node => " \t\ntest " }, trim => 1 ), qq{$xml_decl\ntest}, 'trim 1', ; } { my $data; my $fh = tempfile(); hash2xml( { node1 => 'value1' }, output => $fh ); seek($fh, 0, 0); { local $/; $data = <$fh> } is $data, qq{$xml_decl\nvalue1}, 'filehandle output', ; } { my $data = ''; tie *STDOUT, "Trapper", \$data; hash2xml( { node1 => 'value1' }, output => \*STDOUT ); untie *STDOUT; is $data, qq{$xml_decl\nvalue1}, 'tied filehandle output', ; } { is hash2xml( { node1 => 'value1"', node2 => 'value2&', node3 => { node31 => 'value31' }, node4 => [ { node41 => 'value41' }, { node42 => 'value42' } ], node5 => [ 51, 52, { node53 => 'value53' } ], node6 => {}, node7 => [], }, use_attr => 1, canonical => 1, indent => 2, ), <<"EOT", $xml_decl 51 52 EOT 'use attributes', ; } { is hash2xml( { content => 'content&1', node2 => [ 21, { node22 => "value22 < > & \" \t \n \r", content => "content < > & \r", } ], }, use_attr => 1, canonical => 1, indent => 2, content => 'content', ), <<"EOT", $xml_decl content&1 21 content < > & EOT 'content', ; } { my $o = TestObject->new(); is hash2xml( { object => $o }, ), qq{$xml_decl\nvalue1}, 'object', ; } { my $o = TestObjectWithOverloadedStringification->new('test'); is hash2xml({ object => $o }), qq{$xml_decl\ntest}, 'object with overloaded stringification', ; } { $XML::Hash::XS::indent = 2; $XML::Hash::XS::use_attr = 1; $XML::Hash::XS::canonical = 1; $XML::Hash::XS::content = 'content'; is hash2xml( { content => 'content&1', node2 => [ 21, { node22 => 'value23', 'content' => 'content2' } ], }, ), <<"EOT", $xml_decl content&1 21 content2 EOT 'global options', ; } { $XML::Hash::XS::indent = 2; $XML::Hash::XS::use_attr = 1; $XML::Hash::XS::canonical = 1; $XML::Hash::XS::content = 'content'; $XML::Hash::XS::xml_decl = 0; is hash2xml( { node1 => 'value1', }, ), <<"EOT", EOT 'xml declaration', ; } { $XML::Hash::XS::indent = 2; $XML::Hash::XS::use_attr = 1; $XML::Hash::XS::canonical = 1; $XML::Hash::XS::xml_decl = 0; my @arr = (1, 2, 3, { att1 => 1, att2 => 2 }); my $obj = new Iterator sub { shift @arr }; is hash2xml( { iterator => $obj, }, ), <<"EOT", 1 2 3 EOT 'iterator & attr', ; } { $XML::Hash::XS::indent = 2; $XML::Hash::XS::use_attr = 0; $XML::Hash::XS::canonical = 1; $XML::Hash::XS::xml_decl = 0; my @arr = (1, 2, 3, { att1 => 1, att2 => 2}); my $obj = new Iterator sub { shift @arr }; is hash2xml( { iterator => $obj, }, ), <<"EOT", 1 2 3 1 2 EOT 'iterator', ; } package Iterator; sub new { my ($class, $cb) = @_; return bless { cb => $cb }, $class; } sub iternext { return shift->{cb}->(); } package TestObject; sub new { return bless [], shift; } sub toString { return 'value1'; } package TestObjectWithOverloadedStringification; use overload '""' => sub { shift->stringify }, fallback => 1; sub new { my ($class, $value) = @_; return bless { value => $value }, $class; } sub stringify { return shift->{value}; } package Trapper; sub TIEHANDLE { my ($class, $str) = @_; return bless [$str], $class; } sub WRITE { my ($self, $buf, $len, $offset) = @_; $len ||= length($buf); $offset ||= 0; ${$self->[0]} .= substr($buf, $offset, $len); return $len; } sub PRINT { ${shift->[0]} .= join('', @_); } XML-Hash-XS-0.64/t/14-x2h_merge_text.t0000644000175000017500000000427313062061363015642 0ustar yurayurapackage main; use strict; use warnings; use Test::More tests => 3; use Data::Dumper; $Data::Dumper::Indent = 0; $Data::Dumper::Sortkeys = 1; use XML::Hash::XS 'xml2hash'; our $xml_decl_utf8 = qq{}; { is Dumper(xml2hash(<<"XML", force_array => 1, force_content => 1, merge_text => 1, keep_root => 1, trim => 1)), 123 node3_content_1 subnode31_content node3_content_2 subnode32_content subnode32_content2 subnode33_content XML Dumper({ 'root' => { 'node1' => [ { content => '123' } ], 'node3' => [ { 'attr1' => [ { content => 'attr1_content' } ], 'content' => ['node3_content_1', 'node3_content_2'], 'subnode3' => [ { content => 'subnode30_content' }, { content => 'subnode31_content' }, { content => 'subnode32_contentsubnode32_content2' }, { content => 'subnode33_content' }, ], }, ], }, }), 'use merge_text option', ; } { is Dumper(xml2hash(<<"XML", merge_text => 1, keep_root => 1)), XML Dumper({ 'root' => "Hello, world!\n" }), 'merge cdata', ; } { is Dumper(xml2hash(<<"XML", merge_text => 1, keep_root => 1)), XML Dumper({ 'root' => { 'value' => ["Hello,", " world!\n"], }, }), 'don`t merge text from different nodes', ; } XML-Hash-XS-0.64/t/02-h2d.t0000644000175000017500000001206412505301700013356 0ustar yurayurapackage main; use strict; use warnings; use Test::More; use File::Temp qw(tempfile); use XML::Hash::XS; our $c; eval { $c = XML::Hash::XS->new(doc => 1) }; if ($@) { plan skip_all => "Option 'doc' is not supported"; } else { plan tests => 13; require XML::LibXML; } ## no critic (Subroutines::ProhibitSubroutinePrototypes) sub fix_xml($) { my $xml = shift; chomp $xml; $xml =~ s|(<\w[^]*[^/])>|$1/>|g; $xml } ## use critic our $xml_decl = qq{}; { is fix_xml $c->hash2xml( { node1 => [ 'value1', { node2 => 'value2' } ] } )->toString(), qq{$xml_decl\nvalue1value2}, 'default', ; } { is fix_xml $c->hash2xml( { node3 => 'value3', node1 => 'value1', node2 => 'value2' }, canonical => 1 )->toString(), qq{$xml_decl\nvalue1value2value3}, 'canonical', ; } { is fix_xml $c->hash2xml( { node1 => [ 1, '2', '2' + 1 ] } )->toString(), qq{$xml_decl\n123}, 'integer, string, integer + string', ; } { my $x = 1.1; my $y = '2.2'; is fix_xml $c->hash2xml( { node1 => [ $x, $y, $y + $x ] } )->toString(), qq{$xml_decl\n1.12.23.3}, 'double, string, double + string', ; } { is fix_xml $c->hash2xml( { 1 => 'value1' } )->toString(), qq{$xml_decl\n<_1>value1}, 'quote tag name', ; } SKIP: { my $data; eval { $data = fix_xml $c->hash2xml( { node1 => 'Тест' }, encoding => 'cp1251' )->toString(); }; my $err = $@; chomp $err; skip $err, 1 if $err; is $data, qq{\n\322\345\361\362}, 'encoding support', ; } { is fix_xml $c->hash2xml( { node1 => "< > & \r" } )->toString(), qq{$xml_decl\n< > & }, 'escaping', ; } { is fix_xml $c->hash2xml( { node => " \t\ntest " }, trim => 0 )->toString(), qq{$xml_decl\n \t\ntest }, 'trim 0', ; is fix_xml $c->hash2xml( { node => " \t\ntest " }, trim => 1 )->toString(), qq{$xml_decl\ntest}, 'trim 1', ; } { is fix_xml $c->hash2xml( { node1 => 'value1"', node2 => 'value2&', node3 => { node31 => 'value31', t => [ 'text' ] }, node4 => [ { node41 => 'value41', t => [ 'text' ] }, { node42 => 'value42', t => [ 'text' ] } ], node5 => [ 51, 52, { node53 => 'value53', t => [ 'text' ] } ], node6 => [], }, use_attr => 1, canonical => 1, indent => 2, )->toString(), qq{$xml_decl\ntexttexttext5152text}, 'use attributes', ; } { is fix_xml $c->hash2xml( { content => 'content&1', node2 => [ 21, { node22 => "value22 < > & \" \t \n \r", content => "content < > & \r", } ], }, use_attr => 1, canonical => 1, indent => 2, content => 'content', )->toString(), qq{$xml_decl\ncontent&121content < > & }, 'content', ; } { my @arr = (1, 2, 3, { att1 => 1, att2 => 2}); my $obj = new Iterator sub { shift @arr }; is fix_xml $c->hash2xml( { iterator => $obj, }, use_attr => 1, canonical => 1, indent => 2, content => 'content', )->toString(), qq{$xml_decl\n123}, 'content & attr', ; } { my @arr = (1, 2, 3, { att1 => 1, att2 => 2}); my $obj = new Iterator sub { shift @arr }; is fix_xml $c->hash2xml( { iterator => $obj, }, use_attr => 0, canonical => 1, indent => 2, content => 'content', )->toString(), qq{$xml_decl\n12312}, 'iterator', ; } package Iterator; sub new { my ($class, $cb) = @_; return bless { cb => $cb }, $class; } sub iternext { return shift->{cb}->(); } XML-Hash-XS-0.64/t/12-x2h_ref.t0000644000175000017500000000120314675463666014266 0ustar yurayurapackage main; use strict; use warnings; use Test::More tests => 2; use Data::Dumper; $Data::Dumper::Indent = 0; $Data::Dumper::Sortkeys = 1; use XML::Hash::XS 'xml2hash'; $XML::Hash::XS::keep_root = 0; our $xml_decl_utf8 = qq{}; { is Dumper(xml2hash('', utf8 => 0)), Dumper({ a => "abc\302\240def&\'<>\"" }), 'references in the attribute', ; } { is xml2hash('&abc def&<>"'', utf8 => 0), "&abc\302\240def&<>\"'", 'references in the content', ; } XML-Hash-XS-0.64/t/test.xml0000644000175000017500000000030112455473143014004 0ustar yurayura value1 value2 1 2 3 XML-Hash-XS-0.64/t/07-x2h_filter.t0000644000175000017500000000474613052112257014771 0ustar yurayurapackage main; use strict; use warnings; use Test::More tests => 6; use Data::Dumper; $Data::Dumper::Indent = 0; $Data::Dumper::Sortkeys = 1; use XML::Hash::XS 'xml2hash'; our $xml_decl_utf8 = qq{}; { is Dumper(xml2hash(<<"XML", filter => '/root/node1', keep_root => 1, trim => 1)), $xml_decl_utf8 value1 value2 value3 XML Dumper([ { node1 => 'value1' }, ]), 'one pattern', ; } { is Dumper(xml2hash(<<"XML", filter => ['/root/node1', '/root/node2'], keep_root => 1, trim => 1)), $xml_decl_utf8 value1 value2 value3 XML Dumper([ { node1 => 'value1' }, { node2 => { attr1 => '1', content => 'value2', }}, ]), 'array of patterns', ; } { is Dumper(xml2hash(<<"XML", filter => qr[^/root/node\d+$], keep_root => 1, trim => 1)), $xml_decl_utf8 value1 value2 value3 XML Dumper([ { node1 => 'value1' }, { node2 => { attr1 => '1', content => 'value2', }}, { node3 => 'value3' }, ]), 'regex', ; } { is Dumper(xml2hash(<<"XML", filter => ['/root/node1', qr[node3$]], keep_root => 1, trim => 1)), $xml_decl_utf8 value1 value2 value3 XML Dumper([ { node1 => 'value1' }, { node3 => 'value3' }, ]), 'pattern and regex', ; } { is Dumper(xml2hash(<<"XML", filter => ['/root/node5'], keep_root => 1, trim => 1)), $xml_decl_utf8 value1 value2 value3 XML Dumper([]), 'array with one pattern', ; } { my @nodes; xml2hash(<<"XML", filter => qr[^/root/node\d+$], keep_root => 1, trim => 1, cb => sub { push @nodes, $_[0] }); $xml_decl_utf8 value1 value2 value3 XML is Dumper(\@nodes), Dumper([ { node1 => 'value1' }, { node2 => { attr1 => '1', content => 'value2', }}, { node3 => 'value3' }, ]), 'use callback', ; } XML-Hash-XS-0.64/t/test_cp1251.xml0000644000175000017500000000007512455473143015007 0ustar yurayura ! XML-Hash-XS-0.64/t/16-x2h_suppress_empty.t0000644000175000017500000000172214675463575016625 0ustar yurayurapackage main; use strict; use warnings; use Test::More tests => 3; use Data::Dumper; $Data::Dumper::Indent = 0; $Data::Dumper::Sortkeys = 1; use XML::Hash::XS 'xml2hash'; $XML::Hash::XS::keep_root = 0; our $xml_decl_utf8 = qq{}; { is Dumper(xml2hash(" ", suppress_empty => 0)), Dumper({node => ' ', node_with_attr => {attr => ' '}}), 'don`t suppress empty nodes', ; } { is Dumper(xml2hash(" ", suppress_empty => '')), Dumper({node => '', node_with_attr => {attr => ''}}), 'suppress empty nodes to empty string', ; } { is Dumper(xml2hash(" ", suppress_empty => undef)), Dumper({node => undef, node_with_attr => {attr => undef}}), 'suppress empty nodes to undefined value', ; } XML-Hash-XS-0.64/t/06-x2h.t0000644000175000017500000000555714675463536013451 0ustar yurayurapackage main; use strict; use warnings; use Test::More tests => 10; use Data::Dumper; $Data::Dumper::Indent = 0; $Data::Dumper::Sortkeys = 1; use XML::Hash::XS 'xml2hash'; $XML::Hash::XS::keep_root = 0; our $xml_decl_utf8 = qq{}; { is Dumper(xml2hash(<<"XML", keep_root => 1, content => 'text', trim => 1)), value1 value2 content1 content2 content1 content2 1 2 3 ]]> ]]]]]]> XML Dumper({ root => { attr1 => '1', attr2 => '2', cdata => 'abcde!@#0^&*<>', cdata2 => 'abc ]', cdata3 => '[ abc ] ]> ]]]]', item => ['1', '2', '3'], node1 => 'value1', node2 => { attr1 => '1', text => 'value2', }, node3 => ['content1', 'content2'], node4 => { text => ['content1', 'content2'], empty_node4 => '', }, } }), 'complex', ; } { use utf8; my $xml = <<'XML'; Test XML no warnings qw(void); substr $xml, 0, 0; # this will cause error in XS param type definition is xml2hash(\$xml, trim => 1), 'Test', 'check validation parameters', ; } { my $xml=qq[\x0D\x0A\x0D\x0Aasdasdsa\x0D\x0A]; is xml2hash(\$xml, trim => 1), 'asdasdsa', 'bug RT#103002', ; } { my $xml=qq[\x0D\x0Aasd\x0D\x0Aasd\x0D\x0D\x0Aasd\x0D\x0A]; is xml2hash(\$xml, trim => 1), "asd\x0Aasd\x0A\x0Aasd", 'normalize line feeds', ; } { is Dumper(xml2hash(<<"XML")), bbbdddfffggg XML Dumper({aaa => { content => ['bbb', 'ddd', 'ggg'], eee => 'fff' }}), 'bug with many contents in the one node', ; } { eval { xml2hash("") }; ok($@, 'invalid xml'); } { eval { xml2hash("") }; ok($@, 'invalid xml2'); } { eval { xml2hash("") }; ok($@, 'invalid xml3'); } { eval { xml2hash("text") }; ok($@, 'invalid xml4'); } { is Dumper(xml2hash(<<"XML")), XML Dumper({ row => [ {cell => {'text' => "test's"}}, {cell => {'text' => " test's"}}, ], }), 'memory allocation bug', ; } XML-Hash-XS-0.64/t/05-h2d-lx.t0000644000175000017500000000653313037763310014020 0ustar yurayura use strict; use warnings; use Test::More; use XML::Hash::XS; our $c; eval { $c = XML::Hash::XS->new(doc => 1, method => 'LX', trim => 1) }; if ($@) { plan skip_all => "Option 'doc' is not supported"; } else { plan tests => 14; require XML::LibXML; } our $xml_decl = qq{\n}; ## no critic (Subroutines::ProhibitSubroutinePrototypes) sub fix_xml($) { my $xml = shift; chomp $xml; $xml =~ s|(<\w[^]*[^/])>|$1/>|g; $xml } ## use critic { is fix_xml $c->hash2xml( { root => { '#text' => ' zzzz ' } } )->toString(), qq{$xml_declzzzz}, 'text', ; } { is fix_xml $c->hash2xml( { root => { sub => 'test' } } )->toString(), qq{$xml_decltest}, 'node', ; } { is fix_xml $c->hash2xml( { root => { -attr => "test < > & \" \t \n \r end" } } )->toString(), qq{$xml_decl}, 'attr', ; } { is fix_xml $c->hash2xml( { root => { _attr => "test" } }, attr => '_' )->toString(), qq{$xml_decl}, 'attr _', ; } { is fix_xml $c->hash2xml( { root => { '~' => "zzzz < > & \r end" } }, text => '~' )->toString(), qq{$xml_declzzzz < > & end}, 'text ~', ; } { is fix_xml $c->hash2xml( { root => " \t\ntest" }, trim => 1 )->toString(), qq{$xml_decltest}, 'trim 1', ; is fix_xml $c->hash2xml( { root => " \t\ntest" }, trim => 0 )->toString(), qq{$xml_decl \t\ntest}, 'trim 0', ; } { is fix_xml $c->hash2xml( { root => { sub => { '@' => "cdata < > & \" \t \n \r end" } } }, cdata => '@' )->toString(), qq{$xml_decl & \" \t \n \r end]]>}, 'cdata @', ; } { is fix_xml $c->hash2xml( { root => { sub => { '/' => "comment < > & \" \t \n \r end" } } },comm => '/' )->toString(), qq{$xml_decl}, 'comm /', ; } { is fix_xml $c->hash2xml( { root => { -attr => undef, '#text' => 'text' } } )->toString(), qq{$xml_decltext}, 'empty attr', ; } { is fix_xml $c->hash2xml( { root => { '#cdata' => undef, '#text' => 'text' } }, cdata => '#cdata' )->toString(), qq{$xml_decltext}, 'empty cdata', ; } { is fix_xml $c->hash2xml( { root => { '/' => undef } }, comm => '/' )->toString(), qq{$xml_decl}, 'empty comment', ; } { is fix_xml $c->hash2xml( { root => { item => [1, 2, 3, { -attr => 4, node => 5 }, [6, 7] ] } } )->toString(), qq{$xml_decl123567}, 'array', ; } SKIP: { my $data; eval { $data = fix_xml $c->hash2xml( { root => { test => "Тест" } }, encoding => 'cp1251' )->toString() }; my $err = $@; chomp $err; skip $err, 1 if $err; chomp $data; is $data, qq{\n\322\345\361\362}, 'encoding support', ; } XML-Hash-XS-0.64/t/test_utf8.xml0000644000175000017500000000010212455473143014751 0ustar yurayura Привет! XML-Hash-XS-0.64/t/13-x2h_force_array.t0000644000175000017500000000757214675463700016013 0ustar yurayurapackage main; use strict; use warnings; use Test::More tests => 6; use Data::Dumper; $Data::Dumper::Indent = 0; $Data::Dumper::Sortkeys = 1; use XML::Hash::XS 'xml2hash'; $XML::Hash::XS::keep_root = 0; our $xml_decl_utf8 = qq{}; { is Dumper(xml2hash(<<"XML", force_array => 0)), bbb gggeeefff XML Dumper({ aaa => 'bbb', ccc => {'content' => ['eee', 'fff'], 'ddd' => 'ggg'}, }), 'unuse force_array option', ; } { is Dumper(xml2hash(<<"XML", force_array => 1)), bbb gggeeefff XML Dumper({ aaa => ['bbb'], ccc => [{'content' => ['eee', 'fff'], 'ddd' => ['ggg']}], }), 'use force_array option', ; } { is Dumper(xml2hash(<<"XML", force_array => qr/aaa|ddd/)), bbb gggeeefff XML Dumper({ aaa => ['bbb'], ccc => {'content' => ['eee', 'fff'], 'ddd' => ['ggg']}, }), 'use force_array option with regexp', ; } { my $o = XML::Hash::XS->new(force_array => ['aaa', 'ddd']); is Dumper($o->xml2hash(<<"XML")), bbb gggeeefff XML Dumper({ aaa => ['bbb'], ccc => {'content' => ['eee', 'fff'], 'ddd' => ['ggg']}, }), 'use force_array option with array', ; } { is Dumper(xml2hash(<<"XML", force_array => 1, keep_root => 1, trim => 1)), 123 node3_content_1 subnode31_content node3_content_2 subnode32_content subnode33_content XML Dumper({ 'root' => { 'node1' => ['123'], 'node3' => [ { 'attr1' => [ 'attr1_content' ], 'content' => [ 'node3_content_1', 'node3_content_2' ], 'subnode3' => [ 'subnode30_content', 'subnode31_content', 'subnode32_content', 'subnode33_content', ], }, ], }, }), 'use force_array option, issue #2', ; } { is Dumper(xml2hash(<<"XML", force_array => 1, force_content => 1, keep_root => 1, trim => 1)), 123 node3_content_1 subnode31_content node3_content_2 subnode32_content subnode33_content XML Dumper({ 'root' => { 'node1' => [ { content => '123' } ], 'node3' => [ { 'attr1' => [ { content => 'attr1_content' } ], 'content' => [ 'node3_content_1', 'node3_content_2' ], 'subnode3' => [ { content => 'subnode30_content' }, { content => 'subnode31_content' }, { content => 'subnode32_content' }, { content => 'subnode33_content' }, ], }, ], }, }), 'use force_content option', ; } XML-Hash-XS-0.64/t/test_cp1251_wo_decl.xml0000644000175000017500000000002512455473143016476 0ustar yurayura! XML-Hash-XS-0.64/t/08-x2h_trim.t0000644000175000017500000000303514675463533014470 0ustar yurayurapackage main; use strict; use warnings; use Test::More tests => 5; use Data::Dumper; $Data::Dumper::Indent = 0; $Data::Dumper::Sortkeys = 1; use XML::Hash::XS 'xml2hash'; $XML::Hash::XS::keep_root = 0; our $xml_decl_utf8 = qq{}; { is xml2hash(" \r\n\tboom"), 'boom', 'ignore leading white spaces', ; } { is Dumper(xml2hash(<<"XML", keep_root => 1)), $xml_decl_utf8 text\n \n XML Dumper({ root => { cdata1 => "\n\t cdata1\n\t ", cdata2 => " ", text => " text\n \n", }, }), 'if the trim is off', ; } { is Dumper(xml2hash(<<"XML", keep_root => 1, trim => 1)), $xml_decl_utf8 text\n \n \r\n XML Dumper({ root => { cdata1 => 'cdata1', cdata2 => '', text => 'text', }, }), 'if the trim is on', ; } { is Dumper(xml2hash(<<"XML", trim => 1)), $xml_decl_utf8 \r\n XML Dumper({ text => '' }), 'when element contains only spaces and trim is on', ; } { is Dumper(xml2hash(<<"XML", trim => 0)), $xml_decl_utf8 \r\n XML Dumper({ text => ' ' }), 'when element contains only spaces and trim is off', ; } XML-Hash-XS-0.64/t/15-x2h_doctype.t0000644000175000017500000000466714675463612015174 0ustar yurayurapackage main; use strict; use warnings; use Test::More tests => 15; use XML::Hash::XS 'xml2hash'; $XML::Hash::XS::keep_root = 0; { is xml2hash("OK"), "OK", 'simple', ; } { is xml2hash("OK"), "OK", 'with extra spaces', ; } { is xml2hash("OK"), "OK", 'with comments', ; } { is xml2hash("OK"), "OK", 'with external system DTD', ; } { is xml2hash("OK"), "OK", 'with external system DTD', ; } { is xml2hash('OK'), "OK", 'with external public DTD', ; } { is xml2hash(<<'XML'), ]> OK XML "OK", 'with internal subset', ; } { eval { xml2hash("123") }; ok($@, 'missing root element type'); } { eval { xml2hash("123") }; ok($@, 'duplicate doctype'); } { eval { xml2hash("") }; ok($@, 'misplaced doctype'); } { eval { xml2hash("123") }; ok($@, 'wrong external system DTD'); } { eval { xml2hash('123') }; ok($@, 'wrong external public DTD'); } { eval { xml2hash('123') }; ok($@, 'wrong external public DTD2'); } { eval { xml2hash('123') }; ok($@, 'wrong internal subset'); } { eval { xml2hash('123') }; ok($@, 'wrong internal subset'); } XML-Hash-XS-0.64/t/11-x2h_read.t0000644000175000017500000000414714675463656014435 0ustar yurayurapackage main; use strict; use warnings; use Test::More tests => 6; use Data::Dumper; $Data::Dumper::Indent = 0; $Data::Dumper::Sortkeys = 1; use XML::Hash::XS 'xml2hash'; $XML::Hash::XS::keep_root = 0; our $xml_decl_utf8 = qq{}; { is Dumper(xml2hash('t/test.xml', keep_root => 1)), Dumper({ root => { attr1 => '1', attr2 => '2', item => ['1', '2', '3'], node1 => 'value1', node2 => { attr1 => '1', content => 'value2', } } }), 'read from file', ; } { use utf8; is xml2hash('Привет!', buf_size => 2), "Привет!", 'read from string with buf_size=2', ; } { use utf8; is xml2hash('Привет!', buf_size => 2), "Привет!", 'read from string with buf_size=2 and xml decl', ; } { use utf8; ## no critic (InputOutput::ProhibitBarewordFileHandles) open(DATA, '<:encoding(UTF-8)', 't/test_utf8.xml') or die "Can't open file 't/test_utf8.xml'"; ## use critic is xml2hash(*DATA), "Привет!", 'read from file handle', ; close DATA; } { tie *DATA, 'MyReader', 'Привет!'; use utf8; is xml2hash(*DATA, buf_size => 2), "Привет!", 'read from tied handle', ; untie *DATA; } { eval { xml2hash('t/test_null_terminated.xml') }; ok(!$@, 'read from the null-terminated file'); } package MyReader; use base 'Tie::Handle'; sub TIEHANDLE { my ($class, $str) = @_; bless {str => $str, pos => 0, len => length($str)}, $class; } sub READ { my $bufref = \$_[1]; my ($self, undef, $len, $offset) = @_; $offset ||= 0; if (($self->{pos} + $len) > $self->{len}) { $len = $self->{len} - $self->{pos}; } if ($len > 0) { $$bufref = substr($$bufref, 0, $offset) . substr($self->{str}, $self->{pos}, $len); $self->{pos} += $len; } return $len; } sub WRITE {} sub PRINT {} XML-Hash-XS-0.64/t/10-x2h_encode.t0000644000175000017500000000457714675463641014757 0ustar yurayurapackage main; use strict; use warnings; use Test::More tests => 11; use Data::Dumper; $Data::Dumper::Indent = 0; $Data::Dumper::Sortkeys = 1; use XML::Hash::XS 'xml2hash'; $XML::Hash::XS::keep_root = 0; our $xml_decl_utf8 = qq{}; SKIP: { use utf8; my $result = eval { xml2hash('t/test_cp1251.xml') }; my $err = $@; chomp $err; skip $err, 1 if $err; is $result, 'Привет!', 'test cp1251', ; } SKIP: { my $result = eval { xml2hash('t/test_cp1251.xml', utf8 => 0) }; my $err = $@; chomp $err; skip $err, 1 if $err; is $result, 'Привет!', 'test cp1251 utf8 off', ; } SKIP: { use utf8; my $result = eval { xml2hash('t/test_cp1251.xml', encoding => 'cp1251') }; my $err = $@; chomp $err; skip $err, 1 if $err; is $result, 'Привет!', 'test cp1251 with encoding', ; } SKIP: { my $result = eval { xml2hash('t/test_cp1251.xml', encoding => 'iso-8859-1', utf8 => 0) }; my $err = $@; chomp $err; skip $err, 1 if $err; is $result, 'Ïðèâåò!', 'test cp1251 without encoding', ; } SKIP: { my $result = eval { xml2hash('t/test_cp1251_wo_decl.xml', utf8 => 0) }; my $err = $@; chomp $err; skip $err, 1 if $err; is $result, "\317\360\350\342\345\362!", 'test cp1251 wo decl', ; } SKIP: { use utf8; my $result = eval { xml2hash('t/test_cp1251_wo_decl.xml', encoding => 'cp1251') }; my $err = $@; chomp $err; skip $err, 1 if $err; is $result, "Привет!", 'test cp1251 wo decl with encoding', ; } { use utf8; is xml2hash('t/test_utf8.xml'), "Привет!", 'test utf8', ; } { use utf8; is xml2hash('t/test_utf8.xml', encoding => 'utf-8'), "Привет!", 'test utf8 with encoding', ; } { is xml2hash('t/test_utf8.xml', utf8 => 0), "Привет!", 'test utf8 with utf8 off', ; } { is xml2hash('Привет!', utf8 => 0), "Привет!", 'test utf8 string with utf8 off', ; } { use utf8; is xml2hash('Привет!'), "Привет!", 'test utf8 string with utf8 on', ; } XML-Hash-XS-0.64/src/0000755000175000017500000000000014735256165012643 5ustar yurayuraXML-Hash-XS-0.64/src/xh_encoder.h0000644000175000017500000000263513325066767015141 0ustar yurayura#ifndef _XH_ENCODER_H_ #define _XH_ENCODER_H_ #include "xh_config.h" #include "xh_core.h" #ifdef XH_HAVE_ENCODER #ifdef XH_HAVE_ICONV #if defined(__MINGW32__) || defined(_WIN32) #define LIBICONV_STATIC #endif #include #endif #ifdef XH_HAVE_ICU #include #include #endif typedef enum { XH_ENC_ICONV, XH_ENC_ICU } xh_encoder_type_t; typedef enum { XH_ENC_OK = 0, XH_ENC_BUFFER_OVERFLOW, XH_ENC_TRUNCATED_CHAR_FOUND } xh_encoder_state_t; typedef struct _xh_encoder_t xh_encoder_t; struct _xh_encoder_t { xh_encoder_type_t type; xh_encoder_state_t state; xh_char_t fromcode[XH_PARAM_LEN]; xh_char_t tocode[XH_PARAM_LEN]; #ifdef XH_HAVE_ICONV iconv_t iconv; #endif #ifdef XH_HAVE_ICU UConverter *uconv_from; UConverter *uconv_to; UChar pivotBuffer[1024]; const UChar *pivotLimit; UChar *pivotSource, *pivotTarget, *pivotStart; #endif }; void xh_encoder_destroy(xh_encoder_t *encoder); xh_encoder_t *xh_encoder_create(xh_char_t *tocode, xh_char_t *fromcode); void xh_encoder_encode_perl_buffer(xh_encoder_t *encoder, xh_perl_buffer_t *main_buf, xh_perl_buffer_t *enc_buf); void xh_encoder_encode_string(xh_encoder_t *encoder, xh_char_t **src, size_t *src_left, xh_char_t **dst, size_t *dst_left); #endif /* XH_HAVE_ENCODER */ #endif /* _XH_ENCODER_H_ */ XML-Hash-XS-0.64/src/xh_reader.h0000644000175000017500000000255312455473142014753 0ustar yurayura#ifndef _XH_READER_H_ #define _XH_READER_H_ #include "xh_config.h" #include "xh_core.h" typedef enum { XH_READER_STRING_TYPE, XH_READER_FILE_TYPE, XH_READER_MMAPED_FILE_TYPE } xh_reader_type_t; typedef struct _xh_reader_t xh_reader_t; struct _xh_reader_t { xh_reader_type_t type; SV *input; xh_char_t *str; size_t len; xh_char_t *file; int fd; PerlIO *perl_io; SV *perl_obj; #ifdef WIN32 HANDLE fm, fh; #endif #ifdef XH_HAVE_ENCODER xh_encoder_t *encoder; xh_buffer_t enc_buf; #endif xh_buffer_t main_buf; xh_perl_buffer_t perl_buf; xh_char_t *fake_read_pos; size_t fake_read_len; size_t buf_size; void (*init) (xh_reader_t *reader, SV *input, xh_char_t *encoding, size_t buf_size); size_t (*read) (xh_reader_t *reader, xh_char_t **buf, xh_char_t *preserve, size_t *off); void (*switch_encoding) (xh_reader_t *reader, xh_char_t *encoding, xh_char_t **buf, size_t *len); void (*destroy) (xh_reader_t *reader); }; void xh_reader_destroy(xh_reader_t *reader); void xh_reader_init(xh_reader_t *reader, SV *input, xh_char_t *encoding, size_t buf_size); #endif /* _XH_READER_H_ */ XML-Hash-XS-0.64/src/xh_xml.h0000644000175000017500000002631513325066767014323 0ustar yurayura#ifndef _XH_XML_H_ #define _XH_XML_H_ #include "xh_config.h" #include "xh_core.h" static const xh_char_t indent_string[60] = " "; XH_INLINE void xh_xml_write_xml_declaration(xh_writer_t *writer, xh_char_t *version, xh_char_t *encoding) { xh_perl_buffer_t *buf; size_t ver_len, enc_len; buf = &writer->main_buf; ver_len = xh_strlen(version); if (encoding[0] == '\0') encoding = XH_CHAR_CAST XH_INTERNAL_ENCODING; enc_len = xh_strlen(encoding); XH_WRITER_RESIZE_BUFFER(writer, buf, sizeof("\n") - 1 + ver_len * 6 + enc_len * 6) XH_BUFFER_WRITE_CONSTANT(buf, "\n"); } XH_INLINE void xh_xml_write_node(xh_writer_t *writer, xh_char_t *name, size_t name_len, SV *value, xh_bool_t raw) { size_t indent_len; xh_perl_buffer_t *buf; xh_char_t *content; STRLEN content_len; buf = &writer->main_buf; content = XH_CHAR_CAST SvPV(value, content_len); if (writer->trim && content_len) { content = xh_str_trim(content, &content_len); } if (writer->indent) { indent_len = writer->indent_count * writer->indent; if (indent_len > sizeof(indent_string)) { indent_len = sizeof(indent_string); } /* "" + "\n" */ XH_WRITER_RESIZE_BUFFER(writer, buf, indent_len + name_len * 2 + 10 + (raw ? content_len : content_len * 5)) XH_BUFFER_WRITE_LONG_STRING(buf, indent_string, indent_len); } else { /* "" + "\n" */ XH_WRITER_RESIZE_BUFFER(writer, buf, name_len * 2 + 10 + (raw ? content_len : content_len * 5)) } XH_BUFFER_WRITE_CHAR(buf, '<') if (name[0] >= '0' && name[0] <= '9') { XH_BUFFER_WRITE_CHAR(buf, '_') } XH_BUFFER_WRITE_LONG_STRING(buf, name, name_len) XH_BUFFER_WRITE_CHAR(buf, '>') if (raw) { XH_BUFFER_WRITE_LONG_STRING(buf, content, content_len) } else { XH_BUFFER_WRITE_ESCAPE_STRING(buf, content, content_len) } XH_BUFFER_WRITE_CHAR2(buf, "= '0' && name[0] <= '9') { XH_BUFFER_WRITE_CHAR(buf, '_') } XH_BUFFER_WRITE_LONG_STRING(buf, name, name_len) XH_BUFFER_WRITE_CHAR(buf, '>') if (writer->indent) { XH_BUFFER_WRITE_CHAR(buf, '\n') } } XH_INLINE void xh_xml_write_empty_node(xh_writer_t *writer, xh_char_t *name, size_t name_len) { size_t indent_len; xh_perl_buffer_t *buf; buf = &writer->main_buf; if (writer->indent) { indent_len = writer->indent_count * writer->indent; if (indent_len > sizeof(indent_string)) { indent_len = sizeof(indent_string); } /* "" + "\n" */ XH_WRITER_RESIZE_BUFFER(writer, buf, indent_len + name_len + 5) XH_BUFFER_WRITE_LONG_STRING(buf, indent_string, indent_len); } else { /* "" + "\n" */ XH_WRITER_RESIZE_BUFFER(writer, buf, name_len + 5) } XH_BUFFER_WRITE_CHAR(buf, '<') if (name[0] >= '0' && name[0] <= '9') { XH_BUFFER_WRITE_CHAR(buf, '_') } XH_BUFFER_WRITE_LONG_STRING(buf, name, name_len) XH_BUFFER_WRITE_CHAR2(buf, "/>") if (writer->indent) { XH_BUFFER_WRITE_CHAR(buf, '\n') } } XH_INLINE void xh_xml_write_start_node(xh_writer_t *writer, xh_char_t *name, size_t name_len) { size_t indent_len; xh_perl_buffer_t *buf; buf = &writer->main_buf; if (writer->indent) { indent_len = writer->indent_count++ * writer->indent; if (indent_len > sizeof(indent_string)) { indent_len = sizeof(indent_string); } /* "" + "\n" */ XH_WRITER_RESIZE_BUFFER(writer, buf, indent_len + name_len + 5) XH_BUFFER_WRITE_LONG_STRING(buf, indent_string, indent_len); } else { /* "" + "\n" */ XH_WRITER_RESIZE_BUFFER(writer, buf, name_len + 5) } XH_BUFFER_WRITE_CHAR(buf, '<') if (name[0] >= '0' && name[0] <= '9') { XH_BUFFER_WRITE_CHAR(buf, '_') } XH_BUFFER_WRITE_LONG_STRING(buf, name, name_len) XH_BUFFER_WRITE_CHAR(buf, '>') if (writer->indent) { XH_BUFFER_WRITE_CHAR(buf, '\n') } } XH_INLINE void xh_xml_write_end_node(xh_writer_t *writer, xh_char_t *name, size_t name_len) { size_t indent_len; xh_perl_buffer_t *buf; buf = &writer->main_buf; if (writer->indent) { indent_len = --writer->indent_count * writer->indent; if (indent_len > sizeof(indent_string)) { indent_len = sizeof(indent_string); } /* "" + "\n" */ XH_WRITER_RESIZE_BUFFER(writer, buf, indent_len + name_len + 5) XH_BUFFER_WRITE_LONG_STRING(buf, indent_string, indent_len); } else { /* "" + "\n" */ XH_WRITER_RESIZE_BUFFER(writer, buf, name_len + 5) } XH_BUFFER_WRITE_CHAR2(buf, "= '0' && name[0] <= '9') { XH_BUFFER_WRITE_CHAR(buf, '_') } XH_BUFFER_WRITE_LONG_STRING(buf, name, name_len) XH_BUFFER_WRITE_CHAR(buf, '>') if (writer->indent) { XH_BUFFER_WRITE_CHAR(buf, '\n') } } XH_INLINE void xh_xml_write_content(xh_writer_t *writer, SV *value) { size_t indent_len; xh_perl_buffer_t *buf; xh_char_t *content; size_t content_len; STRLEN str_len; buf = &writer->main_buf; content = XH_CHAR_CAST SvPV(value, str_len); content_len = str_len; if (writer->trim) { content = xh_str_trim(content, &content_len); } if (writer->indent) { indent_len = writer->indent_count * writer->indent; if (indent_len > sizeof(indent_string)) { indent_len = sizeof(indent_string); } XH_WRITER_RESIZE_BUFFER(writer, buf, indent_len + content_len * 5) XH_BUFFER_WRITE_LONG_STRING(buf, indent_string, indent_len); } else { XH_WRITER_RESIZE_BUFFER(writer, buf, content_len * 5) } XH_BUFFER_WRITE_ESCAPE_STRING(buf, content, content_len); if (writer->indent) { XH_BUFFER_WRITE_CHAR(buf, '\n') } } XH_INLINE void xh_xml_write_comment(xh_writer_t *writer, SV *value) { size_t indent_len; xh_perl_buffer_t *buf; xh_char_t *content; size_t content_len; STRLEN str_len; buf = &writer->main_buf; if (value == NULL) { content = XH_EMPTY_STRING; content_len = 0; } else { content = XH_CHAR_CAST SvPV(value, str_len); content_len = str_len; } if (writer->trim && content_len) { content = xh_str_trim(content, &content_len); } if (writer->indent) { indent_len = writer->indent_count * writer->indent; if (indent_len > sizeof(indent_string)) { indent_len = sizeof(indent_string); } /* "" */ XH_WRITER_RESIZE_BUFFER(writer, buf, indent_len + content_len + 7) XH_BUFFER_WRITE_LONG_STRING(buf, indent_string, indent_len); } else { /* "" */ XH_WRITER_RESIZE_BUFFER(writer, buf, content_len + 7) } XH_BUFFER_WRITE_CHAR4(buf, "") if (writer->indent) { XH_BUFFER_WRITE_CHAR(buf, '\n') } } XH_INLINE void xh_xml_write_cdata(xh_writer_t *writer, SV *value) { size_t indent_len; xh_perl_buffer_t *buf; xh_char_t *content; size_t content_len; STRLEN str_len; buf = &writer->main_buf; if (value == NULL) { content = XH_EMPTY_STRING; content_len = 0; } else { content = XH_CHAR_CAST SvPV(value, str_len); content_len = str_len; } if (writer->trim && content_len) { content = xh_str_trim(content, &content_len); } if (writer->indent) { indent_len = writer->indent_count * writer->indent; if (indent_len > sizeof(indent_string)) { indent_len = sizeof(indent_string); } /* "" */ XH_WRITER_RESIZE_BUFFER(writer, buf, indent_len + content_len + 12) XH_BUFFER_WRITE_LONG_STRING(buf, indent_string, indent_len); } else { /* "" */ XH_WRITER_RESIZE_BUFFER(writer, buf, content_len + 12) } XH_BUFFER_WRITE_CHAR9(buf, "") if (writer->indent) { XH_BUFFER_WRITE_CHAR(buf, '\n') } } XH_INLINE void xh_xml_write_start_tag(xh_writer_t *writer, xh_char_t *name, size_t name_len) { size_t indent_len; xh_perl_buffer_t *buf; buf = &writer->main_buf; if (writer->indent) { indent_len = writer->indent_count * writer->indent; if (indent_len > sizeof(indent_string)) { indent_len = sizeof(indent_string); } /* "<" + "_" */ XH_WRITER_RESIZE_BUFFER(writer, buf, indent_len + name_len + 2) XH_BUFFER_WRITE_LONG_STRING(buf, indent_string, indent_len); } else { /* "<" + "_" */ XH_WRITER_RESIZE_BUFFER(writer, buf, name_len + 2) } XH_BUFFER_WRITE_CHAR(buf, '<') if (name[0] >= '0' && name[0] <= '9') { XH_BUFFER_WRITE_CHAR(buf, '_') } XH_BUFFER_WRITE_LONG_STRING(buf, name, name_len) } XH_INLINE void xh_xml_write_end_tag(xh_writer_t *writer) { xh_perl_buffer_t *buf; buf = &writer->main_buf; XH_WRITER_RESIZE_BUFFER(writer, buf, 2) if (writer->indent) { XH_BUFFER_WRITE_CHAR2(buf, ">\n"); writer->indent_count++; } else { XH_BUFFER_WRITE_CHAR(buf, '>') } } XH_INLINE void xh_xml_write_closed_end_tag(xh_writer_t *writer) { xh_perl_buffer_t *buf; buf = &writer->main_buf; XH_WRITER_RESIZE_BUFFER(writer, buf, 3) if (writer->indent) { XH_BUFFER_WRITE_CHAR3(buf, "/>\n"); } else { XH_BUFFER_WRITE_CHAR2(buf, "/>"); } } XH_INLINE void xh_xml_write_attribute(xh_writer_t *writer, xh_char_t *name, size_t name_len, SV *value) { xh_perl_buffer_t *buf; xh_char_t *content; size_t content_len; STRLEN str_len; buf = &writer->main_buf; if (value == NULL) { content = XH_EMPTY_STRING; content_len = 0; } else { content = XH_CHAR_CAST SvPV(value, str_len); content_len = str_len; } /* ' =""' */ XH_WRITER_RESIZE_BUFFER(writer, buf, name_len + content_len * 6 + 4) XH_BUFFER_WRITE_CHAR(buf, ' ') XH_BUFFER_WRITE_LONG_STRING(buf, name, name_len) if (content_len == 0) { XH_BUFFER_WRITE_CHAR3(buf, "=\"\""); } else { XH_BUFFER_WRITE_CHAR2(buf, "=\""); XH_BUFFER_WRITE_ESCAPE_ATTR(buf, content, content_len); XH_BUFFER_WRITE_CHAR(buf, '"'); } } #endif /* _XH_XML_H_ */ XML-Hash-XS-0.64/src/xh_h2x.h0000644000175000017500000001121513325066767014215 0ustar yurayura#ifndef _XH_H2X_H_ #define _XH_H2X_H_ #include "xh_config.h" #include "xh_core.h" #define XH_H2X_F_NONE 0 #define XH_H2X_F_SIMPLE 1 #define XH_H2X_F_COMPLEX 2 #define XH_H2X_F_CONTENT 4 #define XH_H2X_F_ATTR_ONLY 8 #define XH_H2X_T_SCALAR 1 #define XH_H2X_T_HASH 2 #define XH_H2X_T_ARRAY 4 #define XH_H2X_T_BLESSED 8 #define XH_H2X_T_RAW 16 #define XH_H2X_T_NOT_NULL (XH_H2X_T_SCALAR | XH_H2X_T_ARRAY | XH_H2X_T_HASH) #define XH_H2X_STASH_SIZE 16 typedef struct { xh_opts_t opts; xh_int_t depth; xh_writer_t writer; xh_stack_t stash; SV *hash; } xh_h2x_ctx_t; XH_INLINE SV * xh_h2x_call_method(SV *obj, GV *method) { int count; SV *result = &PL_sv_undef; dSP; ENTER; SAVETMPS; PUSHMARK (SP); XPUSHs(sv_2mortal(newRV_inc(obj))); PUTBACK; count = call_sv((SV *) GvCV(method), G_SCALAR); SPAGAIN; if (count) { result = POPs; SvREFCNT_inc_void(result); } PUTBACK; FREETMPS; LEAVE; return result; } XH_INLINE SV * xh_h2x_resolve_value(xh_h2x_ctx_t *ctx, SV *value, xh_uint_t *type) { xh_int_t nitems; GV *method; SV *tmpsv, *rv; #if PERL_VERSION <= 8 MAGIC *mg; #endif *type = 0; while ( SvOK(value) && SvROK(value) ) { if (++ctx->depth > ctx->opts.max_depth) croak("Maximum recursion depth exceeded"); rv = value; value = SvRV(value); *type = 0; if (SvOBJECT(value)) { if (SvGMAGICAL(value)) mg_get(value); if (XH_AMAGIC(value) && (tmpsv = XH_AMG_CALL_STRING(rv)) != NULL) { value = tmpsv; SvREFCNT_inc_void(value); xh_stash_push(&ctx->stash, value); } else if ((method = gv_fetchmethod_autoload(SvSTASH(value), "toString", 0)) != NULL) { dSP; ENTER; SAVETMPS; PUSHMARK(SP); XPUSHs(sv_2mortal(newRV_inc(value))); PUTBACK; nitems = call_sv((SV *) GvCV(method), G_SCALAR); SPAGAIN; if (nitems == 1) { value = POPs; PUTBACK; SvREFCNT_inc_void(value); xh_stash_push(&ctx->stash, value); FREETMPS; LEAVE; } else { value = &PL_sv_undef; } *type |= XH_H2X_T_RAW; } } else if( SvTYPE(value) == SVt_PVCV ) { dSP; ENTER; SAVETMPS; PUSHMARK (SP); nitems = call_sv(value, G_SCALAR|G_NOARGS); SPAGAIN; if (nitems == 1) { value = POPs; SvREFCNT_inc_void(value); xh_stash_push(&ctx->stash, value); PUTBACK; FREETMPS; LEAVE; } else { value = &PL_sv_undef; } } } if (SvTYPE(value) == SVt_PVHV) { *type |= XH_H2X_T_HASH; } else if (SvTYPE(value) == SVt_PVAV) { *type |= XH_H2X_T_ARRAY; } else if (!SvOK(value)) { *type = 0; } else { *type |= XH_H2X_T_SCALAR; } if (SvOBJECT(value)) *type |= XH_H2X_T_BLESSED; return value; } SV *xh_h2x(xh_h2x_ctx_t *ctx); void xh_h2x_native(xh_h2x_ctx_t *ctx, xh_char_t *key, I32 key_len, SV *value); xh_int_t xh_h2x_native_attr(xh_h2x_ctx_t *ctx, xh_char_t *key, I32 key_len, SV *value, xh_int_t flag); void xh_h2x_lx(xh_h2x_ctx_t *ctx, SV *value, xh_char_t *key, I32 key_len, xh_int_t flag); #ifdef XH_HAVE_DOM SV *xh_h2d(xh_h2x_ctx_t *ctx); void xh_h2d_native(xh_h2x_ctx_t *ctx, xmlNodePtr rootNode, xh_char_t *key, I32 key_len, SV *value); xh_int_t xh_h2d_native_attr(xh_h2x_ctx_t *ctx, xmlNodePtr rootNode, xh_char_t *key, I32 key_len, SV *value, xh_int_t flag); void xh_h2d_lx(xh_h2x_ctx_t *ctx, xmlNodePtr rootNode, SV *value, xh_char_t *key, I32 key_len, xh_int_t flag); #endif XH_INLINE void xh_h2x_destroy_ctx(xh_h2x_ctx_t *ctx) { xh_destroy_opts(&ctx->opts); } XH_INLINE void xh_h2x_init_ctx(xh_h2x_ctx_t *ctx, I32 ax, I32 items) { xh_opts_t *opts = NULL; xh_int_t nparam = 0; memset(ctx, 0, sizeof(xh_h2x_ctx_t)); opts = (xh_opts_t *) xh_get_obj_param(&nparam, ax, items, "XML::Hash::XS"); ctx->hash = xh_get_hash_param(&nparam, ax, items); xh_merge_opts(&ctx->opts, opts, nparam, ax, items); } #endif /* _XH_H2X_H_ */ XML-Hash-XS-0.64/src/xh_h2x_lx.c0000644000175000017500000001737713325066767014732 0ustar yurayura#include "xh_config.h" #include "xh_core.h" XH_INLINE void _xh_h2x_lx_write_complex_node(xh_h2x_ctx_t *ctx, xh_char_t *key, I32 key_len, SV *value) { /* 'writer, key, key_len); /* ' attr1="..." attr2="..."' */ xh_h2x_lx(ctx, value, key, key_len, XH_H2X_F_ATTR_ONLY); /* '>' */ xh_xml_write_end_tag(&ctx->writer); xh_h2x_lx(ctx, value, key, key_len, XH_H2X_F_NONE); xh_xml_write_end_node(&ctx->writer, key, key_len); } XH_INLINE void _xh_h2x_lx(xh_h2x_ctx_t *ctx, xh_char_t *key, I32 key_len, SV *value, xh_int_t flag) { xh_uint_t type; value = xh_h2x_resolve_value(ctx, value, &type); if (ctx->opts.cdata[0] != '\0' && xh_strcmp(key, ctx->opts.cdata) == 0) { if (flag & XH_H2X_F_ATTR_ONLY || !(type & XH_H2X_T_SCALAR)) return; xh_xml_write_cdata(&ctx->writer, value); } else if (ctx->opts.text[0] != '\0' && xh_strcmp(key, ctx->opts.text) == 0) { if (flag & XH_H2X_F_ATTR_ONLY || !(type & XH_H2X_T_SCALAR)) return; xh_xml_write_content(&ctx->writer, value); } else if (ctx->opts.comm[0] != '\0' && xh_strcmp(key, ctx->opts.comm) == 0) { if (flag & XH_H2X_F_ATTR_ONLY) return; if (type & XH_H2X_T_SCALAR) { xh_xml_write_comment(&ctx->writer, value); } else { xh_xml_write_comment(&ctx->writer, NULL); } } else if (ctx->opts.attr[0] != '\0') { if (xh_strncmp(key, ctx->opts.attr, ctx->opts.attr_len) == 0) { if (!(flag & XH_H2X_F_ATTR_ONLY)) return; key += ctx->opts.attr_len; key_len -= ctx->opts.attr_len; if (type & XH_H2X_T_SCALAR) { xh_xml_write_attribute(&ctx->writer, key, key_len, value); } else { xh_xml_write_attribute(&ctx->writer, key, key_len, NULL); } } else { if (flag & XH_H2X_F_ATTR_ONLY) return; if (type & XH_H2X_T_ARRAY) { xh_h2x_lx(ctx, value, key, key_len, XH_H2X_F_NONE); } else if (type & XH_H2X_T_NOT_NULL) { _xh_h2x_lx_write_complex_node(ctx, key, key_len, value); } else { xh_xml_write_empty_node(&ctx->writer, key, key_len); } } } else { if (type & XH_H2X_T_NOT_NULL) { xh_h2x_lx(ctx, value, key, key_len, XH_H2X_F_NONE); } else { xh_xml_write_empty_node(&ctx->writer, key, key_len); } } } void xh_h2x_lx(xh_h2x_ctx_t *ctx, SV *value, xh_char_t *key, I32 key_len, xh_int_t flag) { SV *hash_value; size_t len, i; xh_uint_t type; xh_sort_hash_t *sorted_hash; value = xh_h2x_resolve_value(ctx, value, &type); if (type & XH_H2X_T_SCALAR) { if (flag & XH_H2X_F_ATTR_ONLY) goto FINISH; xh_xml_write_content(&ctx->writer, value); } else if (type & XH_H2X_T_HASH) { len = HvUSEDKEYS((HV *) value); if (len > 1 && ctx->opts.canonical) { sorted_hash = xh_sort_hash((HV *) value, len); for (i = 0; i < len; i++) { _xh_h2x_lx(ctx, sorted_hash[i].key, sorted_hash[i].key_len, sorted_hash[i].value, flag); } free(sorted_hash); } else { hv_iterinit((HV *) value); while ((hash_value = hv_iternextsv((HV *) value, (char **) &key, &key_len))) { _xh_h2x_lx(ctx, key, key_len, hash_value, flag); } } } else if (type & XH_H2X_T_ARRAY) { if (flag & XH_H2X_F_ATTR_ONLY) goto FINISH; len = av_len((AV *) value) + 1; for (i = 0; i < len; i++) { _xh_h2x_lx_write_complex_node(ctx, key, key_len, *av_fetch((AV *) value, i, 0)); } } FINISH: ctx->depth--; } #ifdef XH_HAVE_DOM XH_INLINE void _xh_h2d_lx_write_complex_node(xh_h2x_ctx_t *ctx, xmlNodePtr rootNode, xh_char_t *key, I32 key_len, SV *value) { //rootNode = xh_dom_new_node(ctx, rootNode, key, key_len, NULL, type & XH_H2X_T_RAW); rootNode = xh_dom_new_node(ctx, rootNode, key, key_len, NULL, XH_H2X_T_RAW); xh_h2d_lx(ctx, rootNode, value, key, key_len, XH_H2X_F_ATTR_ONLY); xh_h2d_lx(ctx, rootNode, value, key, key_len, XH_H2X_F_NONE); } XH_INLINE void _xh_h2d_lx(xh_h2x_ctx_t *ctx, xmlNodePtr rootNode, xh_char_t *key, I32 key_len, SV *value, xh_int_t flag) { xh_uint_t type; value = xh_h2x_resolve_value(ctx, value, &type); if (ctx->opts.cdata[0] != '\0' && xh_strcmp(key, ctx->opts.cdata) == 0) { if (flag & XH_H2X_F_ATTR_ONLY || !(type & XH_H2X_T_SCALAR)) return; xh_dom_new_cdata(ctx, rootNode, value); } else if (ctx->opts.text[0] != '\0' && xh_strcmp(key, ctx->opts.text) == 0) { if (flag & XH_H2X_F_ATTR_ONLY || !(type & XH_H2X_T_SCALAR)) return; xh_dom_new_content(ctx, rootNode, value); } else if (ctx->opts.comm[0] != '\0' && xh_strcmp(key, ctx->opts.comm) == 0) { if (flag & XH_H2X_F_ATTR_ONLY) return; if (!type) { xh_dom_new_comment(ctx, rootNode, NULL); } else if (type & XH_H2X_T_SCALAR) { xh_dom_new_comment(ctx, rootNode, value); } } else if (ctx->opts.attr[0] != '\0') { if (xh_strncmp(key, ctx->opts.attr, ctx->opts.attr_len) == 0) { if (!(flag & XH_H2X_F_ATTR_ONLY)) return; key += ctx->opts.attr_len; key_len -= ctx->opts.attr_len; if (type & XH_H2X_T_SCALAR) { xh_dom_new_attribute(ctx, rootNode, key, key_len, value); } else { xh_dom_new_attribute(ctx, rootNode, key, key_len, NULL); } } else { if (flag & XH_H2X_F_ATTR_ONLY) return; if (type & XH_H2X_T_ARRAY) { xh_h2d_lx(ctx, rootNode, value, key, key_len, XH_H2X_F_NONE); } else if (type & XH_H2X_T_NOT_NULL) { _xh_h2d_lx_write_complex_node(ctx, rootNode, key, key_len, value); } else { xh_dom_new_node(ctx, rootNode, key, key_len, NULL, type & XH_H2X_T_RAW); } } } else { rootNode = xh_dom_new_node(ctx, rootNode, key, key_len, NULL, type & XH_H2X_T_RAW); if (type & XH_H2X_T_NOT_NULL) { xh_h2d_lx(ctx, rootNode, value, key, key_len, XH_H2X_F_NONE); } } } void xh_h2d_lx(xh_h2x_ctx_t *ctx, xmlNodePtr rootNode, SV *value, xh_char_t *key, I32 key_len, xh_int_t flag) { SV *hash_value; size_t len, i; xh_uint_t type; xh_sort_hash_t *sorted_hash; value = xh_h2x_resolve_value(ctx, value, &type); if (type & XH_H2X_T_SCALAR) { if (flag & XH_H2X_F_ATTR_ONLY) goto FINISH; xh_dom_new_content(ctx, rootNode, value); } else if (type & XH_H2X_T_HASH) { len = HvUSEDKEYS((HV *) value); hv_iterinit((HV *) value); if (len > 1 && ctx->opts.canonical) { sorted_hash = xh_sort_hash((HV *) value, len); for (i = 0; i < len; i++) { _xh_h2d_lx(ctx, rootNode, sorted_hash[i].key, sorted_hash[i].key_len, sorted_hash[i].value, flag); } free(sorted_hash); } else { while ((hash_value = hv_iternextsv((HV *) value, (char **) &key, &key_len))) { _xh_h2d_lx(ctx, rootNode, key, key_len, hash_value, flag); } } } else if (type & XH_H2X_T_ARRAY) { if (flag & XH_H2X_F_ATTR_ONLY) goto FINISH; len = av_len((AV *) value) + 1; for (i = 0; i < len; i++) { _xh_h2d_lx_write_complex_node(ctx, rootNode, key, key_len, *av_fetch((AV *) value, i, 0)); } } FINISH: ctx->depth--; } #endif XML-Hash-XS-0.64/src/xh_x2h.h0000644000175000017500000002270514734303064014210 0ustar yurayura#ifndef _XH_X2H_H_ #define _XH_X2H_H_ #include "xh_config.h" #include "xh_core.h" #define XH_X2H_XPATH_MAX_LEN 1023 #define XH_X2H_NORMALIZE_REF 1 #define XH_X2H_NORMALIZE_LINE_FEED 2 #define XH_X2H_FILTER_ENABLED 4 #define XH_X2H_FILTER_MATCHED 8 #define XH_X2H_ROOT_FOUND 16 #define XH_X2H_IS_NOT_BLANK 32 #define XH_X2H_DOCTYPE_FOUND 64 #define XH_X2H_TEXT_NODE 128 #define XH_X2H_TAG_EXISTS 256 #define XH_X2H_NEED_NORMALIZE (XH_X2H_NORMALIZE_REF | \ XH_X2H_NORMALIZE_LINE_FEED) #define XH_X2H_FILTER_SEARCH(f) (((f) & (XH_X2H_FILTER_ENABLED | XH_X2H_FILTER_MATCHED)) ==\ XH_X2H_FILTER_ENABLED) #define XH_X2H_PARSER_STATE_LIST \ XH_X2H_PROCESS_STATE(CONTENT_START) \ XH_X2H_PROCESS_STATE(PARSE_ELEMENT_START) \ XH_X2H_PROCESS_STATE(XML_COMMENT_NODE_OR_CDATA_START) \ XH_X2H_PROCESS_STATE(COMMENT1_START) \ XH_X2H_PROCESS_STATE(END_COMMENT1_START) \ XH_X2H_PROCESS_STATE(END_COMMENT2_START) \ XH_X2H_PROCESS_STATE(END_COMMENT3_START) \ XH_X2H_PROCESS_STATE(CDATA_1_1_START) \ XH_X2H_PROCESS_STATE(CDATA_1_2_START) \ XH_X2H_PROCESS_STATE(CDATA_1_3_START) \ XH_X2H_PROCESS_STATE(CDATA_2_1_START) \ XH_X2H_PROCESS_STATE(CDATA_2_2_START) \ XH_X2H_PROCESS_STATE(CDATA_2_3_START) \ XH_X2H_PROCESS_STATE(END_CDATA1_START) \ XH_X2H_PROCESS_STATE(END_CDATA2_START) \ XH_X2H_PROCESS_STATE(END_CDATA3_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_1_1_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_1_2_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_1_3_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_2_1_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_2_2_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_2_3_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_NAME_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_NAME_START_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_NAME_END_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_NAME_BLANK_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_SYSTEM_1_1_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_SYSTEM_1_2_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_SYSTEM_1_3_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_SYSTEM_2_1_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_SYSTEM_2_2_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_SYSTEM_LOCATION_DOCTYPE_DELIM_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_SYSTEM_LOCATION_DOCTYPE_DELIM_SKIP_BLANK_START)\ XH_X2H_PROCESS_STATE(DOCTYPE_SYSTEM_1_END_OF_LITERAL_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_SYSTEM_2_END_OF_LITERAL_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_1_1_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_1_2_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_1_3_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_2_1_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_2_2_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_ID_DOCTYPE_DELIM_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_ID_DOCTYPE_DELIM_SKIP_BLANK_START)\ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_LOCATION_1_DOCTYPE_DELIM_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_LOCATION_1_DOCTYPE_DELIM_SKIP_BLANK_START)\ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_LOCATION_1_1_END_OF_LITERAL_START)\ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_LOCATION_1_2_END_OF_LITERAL_START)\ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_LOCATION_2_DOCTYPE_DELIM_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_LOCATION_2_DOCTYPE_DELIM_SKIP_BLANK_START)\ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_LOCATION_2_1_END_OF_LITERAL_START)\ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_LOCATION_2_2_END_OF_LITERAL_START)\ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_1_END_OF_LITERAL_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_PUBLIC_2_END_OF_LITERAL_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_END_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_INTSUBSET_START) \ XH_X2H_PROCESS_STATE(DOCTYPE_INTSUBSET_START_START) \ XH_X2H_PROCESS_STATE(CDATA_WITH_TRIM_1_1_START) \ XH_X2H_PROCESS_STATE(CDATA_WITH_TRIM_1_2_START) \ XH_X2H_PROCESS_STATE(CDATA_WITH_TRIM_1_3_START) \ XH_X2H_PROCESS_STATE(CDATA_WITH_TRIM_2_1_START) \ XH_X2H_PROCESS_STATE(CDATA_WITH_TRIM_2_2_START) \ XH_X2H_PROCESS_STATE(CDATA_WITH_TRIM_2_3_START) \ XH_X2H_PROCESS_STATE(END_CDATA_WITH_TRIM1_START) \ XH_X2H_PROCESS_STATE(END_CDATA_WITH_TRIM2_START) \ XH_X2H_PROCESS_STATE(END_CDATA_WITH_TRIM3_START) \ XH_X2H_PROCESS_STATE(PARSE_CLOSING_TAG_START) \ XH_X2H_PROCESS_STATE(SEARCH_CLOSING_END_TAG_START) \ XH_X2H_PROCESS_STATE(PARSE_OPENING_TAG_START) \ XH_X2H_PROCESS_STATE(SEARCH_OPENING_END_TAG_START) \ XH_X2H_PROCESS_STATE(NODE_SEARCH_ATTR_START) \ XH_X2H_PROCESS_STATE(SEARCH_END_TAG_START) \ XH_X2H_PROCESS_STATE(NODE_PARSE_ATTR_NAME_START) \ XH_X2H_PROCESS_STATE(NODE_ATTR_SKIP_BLANK_START) \ XH_X2H_PROCESS_STATE(NODE_PARSE_ATTR_VALUE_START) \ XH_X2H_PROCESS_STATE(NODE_1_END_ATTR_VALUE_START) \ XH_X2H_PROCESS_STATE(NODE_2_END_ATTR_VALUE_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_1_1_1_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_1_1_2_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_1_1_3_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_1_2_1_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_1_2_2_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_2_1_1_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_2_1_2_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_2_1_3_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_2_2_1_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_2_2_2_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_ATTR_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_ATTR_SEARCH_ATTR_START) \ XH_X2H_PROCESS_STATE(PI_SEARCH_END_TAG2_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_ATTR_PARSE_ATTR_NAME_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_ATTR_ATTR_SKIP_BLANK_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_ATTR_PARSE_ATTR_VALUE_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_ATTR_1_END_ATTR_VALUE_START) \ XH_X2H_PROCESS_STATE(STYLESHEET_PI_ATTR_2_END_ATTR_VALUE_START) \ XH_X2H_PROCESS_STATE(XML_DECL_1_START) \ XH_X2H_PROCESS_STATE(XML_DECL_2_START) \ XH_X2H_PROCESS_STATE(XML_DECL_3_START) \ XH_X2H_PROCESS_STATE(XML_DECL_ATTR_START) \ XH_X2H_PROCESS_STATE(XML_DECL_ATTR_SEARCH_ATTR_START) \ XH_X2H_PROCESS_STATE(XML_DECL_SEARCH_END_TAG2_START) \ XH_X2H_PROCESS_STATE(XML_DECL_ATTR_PARSE_ATTR_NAME_START) \ XH_X2H_PROCESS_STATE(XML_DECL_ATTR_ATTR_SKIP_BLANK_START) \ XH_X2H_PROCESS_STATE(XML_DECL_ATTR_PARSE_ATTR_VALUE_START) \ XH_X2H_PROCESS_STATE(XML_DECL_ATTR_1_END_ATTR_VALUE_START) \ XH_X2H_PROCESS_STATE(XML_DECL_ATTR_2_END_ATTR_VALUE_START) #define XH_X2H_PROCESS_STATE(st) st, typedef enum { PARSER_ST_NONE = 0, XH_X2H_PARSER_STATE_LIST XML_DECL_FOUND, PARSER_ST_DONE } xh_x2h_state_t; #undef XH_X2H_PROCESS_STATE #define XH_X2H_NODE_FLAG_NONE 0 #define XH_X2H_NODE_FLAG_FORCE_ARRAY 1 typedef struct { SV **lval; unsigned int flags; } xh_x2h_node_t; typedef struct { xh_opts_t opts; SV *hash; xh_char_t encoding[XH_PARAM_LEN]; xh_char_t *tmp; size_t tmp_size; xh_char_t *node, *end, *end_of_attr_value, *content; unsigned int flags; xh_x2h_node_t *nodes; SV **lval; unsigned int depth, real_depth, code; xh_x2h_state_t state; xh_reader_t reader; SV *result, *input; xh_char_t xpath[XH_X2H_XPATH_MAX_LEN + 1]; } xh_x2h_ctx_t; SV *xh_x2h(xh_x2h_ctx_t *ctx); void xh_x2h_destroy_ctx(xh_x2h_ctx_t *ctx); void xh_x2h_init_ctx(xh_x2h_ctx_t *ctx, I32 ax, I32 items); #endif /* _XH_X2H_H_ */ XML-Hash-XS-0.64/src/xh_h2x.c0000644000175000017500000000625714675452010014207 0ustar yurayura#include "xh_config.h" #include "xh_core.h" SV * xh_h2x(xh_h2x_ctx_t *ctx) { SV *result; /* run */ dXCPT; XCPT_TRY_START { xh_stack_init(&ctx->stash, XH_H2X_STASH_SIZE, sizeof(SV *)); xh_writer_init(&ctx->writer, ctx->opts.encoding, ctx->opts.output, ctx->opts.buf_size, ctx->opts.indent, ctx->opts.trim); if (ctx->opts.xml_decl) { xh_xml_write_xml_declaration(&ctx->writer, ctx->opts.version, ctx->opts.encoding); } switch (ctx->opts.method) { case XH_METHOD_NATIVE: if (ctx->opts.keep_root) { xh_h2x_native(ctx, ctx->opts.root, xh_strlen(ctx->opts.root), SvRV(ctx->hash)); } else { xh_h2x_native(ctx, NULL, 0, SvRV(ctx->hash)); } break; case XH_METHOD_NATIVE_ATTR_MODE: (void) xh_h2x_native_attr(ctx, ctx->opts.root, xh_strlen(ctx->opts.root), SvRV(ctx->hash), XH_H2X_F_COMPLEX); break; case XH_METHOD_LX: xh_h2x_lx(ctx, ctx->hash, NULL, 0, XH_H2X_F_NONE); break; default: croak("Invalid method"); } } XCPT_TRY_END XCPT_CATCH { xh_stash_clean(&ctx->stash); result = xh_writer_flush(&ctx->writer); if (result != NULL && result != &PL_sv_undef) { SvREFCNT_dec(result); } xh_writer_destroy(&ctx->writer); XCPT_RETHROW; } xh_stash_clean(&ctx->stash); result = xh_writer_flush(&ctx->writer); if (result != NULL && ctx->opts.utf8) { #ifdef XH_HAVE_ENCODER if (ctx->writer.encoder == NULL) { SvUTF8_on(result); } #else SvUTF8_on(result); #endif } xh_writer_destroy(&ctx->writer); return result; } #ifdef XH_HAVE_DOM SV * xh_h2d(xh_h2x_ctx_t *ctx) { dXCPT; xmlDocPtr doc = xmlNewDoc(BAD_CAST ctx->opts.version); if (doc == NULL) { croak("Can't create new document"); } if (ctx->opts.encoding[0] == '\0') { doc->encoding = (const xmlChar*) xmlStrdup((const xmlChar*) XH_INTERNAL_ENCODING); } else { doc->encoding = (const xmlChar*) xmlStrdup((const xmlChar*) ctx->opts.encoding); } XCPT_TRY_START { xh_stack_init(&ctx->stash, XH_H2X_STASH_SIZE, sizeof(SV *)); switch (ctx->opts.method) { case XH_METHOD_NATIVE: xh_h2d_native(ctx, (xmlNodePtr) doc, ctx->opts.root, xh_strlen(ctx->opts.root), SvRV(ctx->hash)); break; case XH_METHOD_NATIVE_ATTR_MODE: (void) xh_h2d_native_attr(ctx, (xmlNodePtr) doc, ctx->opts.root, xh_strlen(ctx->opts.root), SvRV(ctx->hash), XH_H2X_F_COMPLEX); break; case XH_METHOD_LX: xh_h2d_lx(ctx, (xmlNodePtr) doc, ctx->hash, NULL, 0, XH_H2X_F_NONE); break; default: croak("Invalid method"); } } XCPT_TRY_END XCPT_CATCH { xh_stash_clean(&ctx->stash); XCPT_RETHROW; } xh_stash_clean(&ctx->stash); return x_PmmNodeToSv((xmlNodePtr) doc, NULL); } #endif XML-Hash-XS-0.64/src/xh_x2h.c0000644000175000017500000021163114735241261014202 0ustar yurayura#include "xh_config.h" #include "xh_core.h" static const char DEF_CONTENT_KEY[] = "content"; void xh_x2h_destroy_ctx(xh_x2h_ctx_t *ctx) { if (ctx->nodes != NULL) free(ctx->nodes); if (ctx->tmp != NULL) free(ctx->tmp); xh_destroy_opts(&ctx->opts); } void xh_x2h_init_ctx(xh_x2h_ctx_t *ctx, I32 ax, I32 items) { xh_opts_t *opts = NULL; xh_int_t nparam = 0; memset(ctx, 0, sizeof(xh_x2h_ctx_t)); opts = (xh_opts_t *) xh_get_obj_param(&nparam, ax, items, "XML::Hash::XS"); ctx->input = xh_get_str_param(&nparam, ax, items); xh_merge_opts(&ctx->opts, opts, nparam, ax, items); if ((ctx->nodes = malloc(sizeof(xh_x2h_node_t) * ctx->opts.max_depth)) == NULL) { croak("Memory allocation error"); } memset(ctx->nodes, 0, sizeof(xh_x2h_node_t) * ctx->opts.max_depth); } XH_INLINE void xh_x2h_xpath_update(xh_char_t *xpath, xh_char_t *name, size_t name_len) { size_t len; len = xh_strlen(xpath); if (name != NULL) { if ((len + name_len + 1) > XH_X2H_XPATH_MAX_LEN) croak("XPath too long"); xpath[len++] = '/'; for (;name_len--;) xpath[len++] = *name++; } else if (len == 0) { croak("Can't update xpath, something wrong!"); } else { for (;--len && xpath[len] != '/';) {/* void */} } xpath[len] = '\0'; xh_log_trace1("xpath: [%s]", xpath); } XH_INLINE xh_bool_t xh_x2h_match_node(xh_char_t *name, size_t name_len, SV *expr) { SSize_t i, l; AV *av; SV *fake_str; xh_char_t *expr_str; STRLEN expr_len; REGEXP *re; xh_bool_t matched; xh_log_trace2("match node: [%.*s]", name_len, name); fake_str = newSV(0); matched = TRUE; if ( SvRXOK(expr) ) { re = (REGEXP *) SvRX(expr); if (re != NULL && pregexec(re, (char *) name, (char *) (name + name_len), (char *) name, name_len, fake_str, 0) ) { goto MATCHED; } } else if ( SvROK(expr) && SvTYPE(SvRV(expr)) == SVt_PVAV ) { av = (AV *) SvRV(expr); l = av_len(av); for(i = 0; i <= l; i++) { expr = *av_fetch(av, i, 0); if ( SvRXOK(expr) ) { re = (REGEXP *) SvRX(expr); if (re != NULL && pregexec(re, (char *) name, (char *) (name + name_len), (char *) name, name_len, fake_str, 0) ) { goto MATCHED; } } else { expr_str = (xh_char_t *) SvPVutf8(expr, expr_len); if (name_len == expr_len && !xh_strncmp(name, expr_str, name_len)) { goto MATCHED; } } } } else { expr_str = (xh_char_t *) SvPVutf8(expr, expr_len); if (name_len == expr_len && !xh_strncmp(name, expr_str, name_len)) { goto MATCHED; } } matched = FALSE; MATCHED: SvREFCNT_dec(fake_str); return matched; } XH_INLINE void xh_x2h_pass_matched_node(SV *cb, SV *val) { dSP; ENTER; SAVETMPS; PUSHMARK(SP); XPUSHs(val); PUTBACK; (void) call_sv(cb, G_DISCARD); FREETMPS; LEAVE; } #define NEW_STRING(s, l, f) \ ( \ !((f) & XH_X2H_IS_NOT_BLANK) && ctx->opts.suppress_empty == XH_SUPPRESS_EMPTY_TO_UNDEF\ ? newSV(0) \ : !((f) & XH_X2H_IS_NOT_BLANK) && ctx->opts.suppress_empty == XH_SUPPRESS_EMPTY_TO_STRING\ ? newSVpvn_utf8("", 0, ctx->opts.utf8) \ : newSVpvn_utf8((const char *) (s), (l), ctx->opts.utf8)\ ) #define SET_STRING(v, s, l, f) \ if (!((f) & XH_X2H_IS_NOT_BLANK) && ctx->opts.suppress_empty == XH_SUPPRESS_EMPTY_TO_UNDEF) {\ sv_setsv((v), &PL_sv_undef); \ } \ else if (!((f) & XH_X2H_IS_NOT_BLANK) && ctx->opts.suppress_empty == XH_SUPPRESS_EMPTY_TO_STRING) {\ sv_setpvn((v), "", 0); \ if (ctx->opts.utf8) SvUTF8_on(v); \ } \ else { \ sv_setpvn((v), (const char *) (s), (l)); \ if (ctx->opts.utf8) SvUTF8_on(v); \ } #define CAT_STRING(v, s, l, f) \ if (((f) & XH_X2H_IS_NOT_BLANK) || ctx->opts.suppress_empty == XH_SUPPRESS_EMPTY_NONE) {\ if ( SvOK(v) ) { \ sv_catpvn((v), (const char *) (s), (l)); \ } \ else { \ sv_setpvn((v), (const char *) (s), (l)); \ } \ if (ctx->opts.utf8) SvUTF8_on(v); \ } #define SAVE_VALUE(lv, v , s, l, f) \ xh_log_trace2("save value: [%.*s]", l, s); \ if ( ((f) & XH_X2H_TAG_EXISTS) || SvOK(v) ) { \ xh_log_trace0("add to array"); \ /* get array if value is reference to array */ \ if ( SvROK(v) && SvTYPE(SvRV(v)) == SVt_PVAV) { \ av = (AV *) SvRV(v); \ } \ /* create a new array and move value to array */ \ else { \ av = newAV(); \ *(lv) = newRV_noinc((SV *) av); \ av_store(av, 0, v); \ (v) = *(lv); \ } \ /* add value to array */ \ (lv) = av_store(av, av_len(av) + 1, NEW_STRING((s), (l), f)); \ } \ else { \ xh_log_trace0("set string"); \ SET_STRING((v), (s), (l), f); \ } \ #define _OPEN_TAG(s, l) \ val = *lval; \ /* if content exists that move to hash with 'content' key */ \ if ( !SvROK(val) || SvTYPE(SvRV(val)) == SVt_PVAV ) { \ *lval = newRV_noinc((SV *) newHV()); \ if (SvROK(val) || (SvOK(val) && SvCUR(val))) { \ (void) hv_store((HV *) SvRV(*lval), (const char *) content_key, (I32) content_key_len, val, 0);\ } \ else { \ SvREFCNT_dec(val); \ } \ val = *lval; \ } \ extra_flags = 0; \ if (ctx->opts.suppress_empty == XH_SUPPRESS_EMPTY_TO_UNDEF && \ hv_exists((HV *) SvRV(val), (const char *) (s), ctx->opts.utf8 ? -(l) : (l))) {\ extra_flags = XH_X2H_TAG_EXISTS; \ } \ /* fetch existen or create empty hash entry */ \ lval = hv_fetch((HV *) SvRV(val), (const char *) (s), ctx->opts.utf8 ? -(l) : (l), 1);\ /* save as empty string */ \ val = *lval; \ SAVE_VALUE(lval, val, "", 0, extra_flags) \ if (++depth >= ctx->opts.max_depth) goto MAX_DEPTH_EXCEEDED; \ nodes[depth].lval = lval; \ nodes[depth].flags = XH_X2H_NODE_FLAG_NONE; \ if (depth > 1 && ctx->opts.force_array.enable && (!SvROK(val) || SvTYPE(SvRV(val)) != SVt_PVAV) \ && (ctx->opts.force_array.always || xh_x2h_match_node(s, l, ctx->opts.force_array.expr))\ ) { \ nodes[depth].flags |= XH_X2H_NODE_FLAG_FORCE_ARRAY; \ } \ (s) = NULL; #define OPEN_TAG(s, l) \ xh_log_trace2("new tag: [%.*s]", l, s); \ flags |= XH_X2H_TEXT_NODE; \ if (real_depth == 0) { \ if (flags & XH_X2H_ROOT_FOUND) goto INVALID_XML; \ flags |= XH_X2H_ROOT_FOUND; \ } \ if (XH_X2H_FILTER_SEARCH(flags)) { \ xh_x2h_xpath_update(ctx->xpath, s, l); \ if (xh_x2h_match_node(ctx->xpath, xh_strlen(ctx->xpath), ctx->opts.filter.expr)) {\ xh_log_trace2("match node: [%.*s]", l, s); \ ctx->hash = newRV_noinc((SV *) newHV()); \ nodes[0].lval = lval = &ctx->hash; \ depth = 0; \ flags |= XH_X2H_FILTER_MATCHED; \ } \ } \ if (!XH_X2H_FILTER_SEARCH(flags)) { \ _OPEN_TAG(s, l) \ } \ real_depth++; #define _CLOSE_TAG \ val = *nodes[depth].lval; \ if (ctx->opts.force_content && !SvROK(val)) { \ lval = nodes[depth].lval; \ *lval = newRV_noinc((SV *) newHV()); \ (void) hv_store((HV *) SvRV(*lval), (const char *) content_key, (I32) content_key_len, val, 0);\ val = *lval; \ } \ if ((nodes[depth].flags & XH_X2H_NODE_FLAG_FORCE_ARRAY) \ && (!SvROK(val) || SvTYPE(SvRV(val)) != SVt_PVAV) \ ) { \ lval = nodes[depth].lval; \ av = newAV(); \ *lval = newRV_noinc((SV *) av); \ av_store(av, 0, val); \ } \ lval = nodes[--depth].lval; #define CLOSE_TAG \ xh_log_trace0("close tag"); \ flags &= ~XH_X2H_TEXT_NODE; \ if (real_depth == 0) goto INVALID_XML; \ if (!XH_X2H_FILTER_SEARCH(flags)) { \ _CLOSE_TAG \ } \ if ((flags & XH_X2H_FILTER_MATCHED) && depth == 0) { \ xh_log_trace0("match node finished"); \ val = *nodes[0].lval; \ if (!ctx->opts.keep_root) { \ val = SvRV(val); \ hv_iterinit((HV *) val); \ val = hv_iterval((HV *) val, hv_iternext((HV *) val)); \ SvREFCNT_inc(val); \ SvREFCNT_dec(*nodes[0].lval); \ } \ if (ctx->opts.cb == NULL) { \ av_push((AV *) SvRV(ctx->result), val); \ } \ else { \ xh_x2h_pass_matched_node(ctx->opts.cb, val); \ SvREFCNT_dec(val); \ } \ flags ^= XH_X2H_FILTER_MATCHED; \ } \ if ((flags & (XH_X2H_FILTER_ENABLED | XH_X2H_FILTER_MATCHED)) == XH_X2H_FILTER_ENABLED) {\ xh_x2h_xpath_update(ctx->xpath, NULL, 0); \ } \ real_depth--; #define NEW_NODE_ATTRIBUTE(k, kl, v, vl) \ if (!XH_X2H_FILTER_SEARCH(flags)) { \ _OPEN_TAG(k, kl) \ _NEW_TEXT(v, vl) \ _CLOSE_TAG \ } #define _NEW_NODE_ATTRIBUTE(k, kl, v, vl) \ xh_log_trace4("new attr name: [%.*s] value: [%.*s]", kl, k, vl, v); \ /* create hash if not created already */ \ if ( !SvROK(*lval) ) { \ /* destroy empty old scalar (empty string) */ \ SvREFCNT_dec(*lval); \ *lval = newRV_noinc((SV *) newHV()); \ } \ /* save key/value */ \ (void) hv_store((HV *) SvRV(*lval), (const char *) (k), ctx->opts.utf8 ? -(kl) : (kl),\ NEW_STRING(v, vl, flags), 0); \ (k) = (v) = NULL; #define NEW_XML_DECL_ATTRIBUTE(k, kl, v, vl) \ xh_log_trace4("new xml decl attr name: [%.*s] value: [%.*s]", kl, k, vl, v);\ /* save encoding parameter to converter context if param found */ \ if ((kl) == (sizeof("encoding") - 1) && \ xh_strncmp((k), XH_CHAR_CAST "encoding", sizeof("encoding") - 1) == 0) {\ xh_str_range_copy(ctx->encoding, XH_CHAR_CAST (v), vl, XH_PARAM_LEN);\ } \ (k) = (v) = NULL; #define NEW_PI_ATTRIBUTE(k, kl, v, vl) \ xh_log_trace4("new PI attr name: [%.*s] value: [%.*s]", kl, k, vl, v); #define NEW_ATTRIBUTE(k, kl, v, vl) NEW_NODE_ATTRIBUTE(k, kl, v, vl) #define _NEW_TEXT(s, l) \ val = *lval; \ if ( SvROK(val) ) { \ xh_log_trace0("add to array"); \ /* add content to array*/ \ if (SvTYPE(SvRV(val)) == SVt_PVAV) { \ av = (AV *) SvRV(val); \ av_store(av, av_len(av) + 1, NEW_STRING(s, l, flags)); \ } \ /* save content to hash with "content" key */ \ else { \ extra_flags = 0; \ if (ctx->opts.suppress_empty == XH_SUPPRESS_EMPTY_TO_UNDEF &&\ hv_exists((HV *) SvRV(val), (const char *) content_key, (I32) content_key_len)) {\ extra_flags = XH_X2H_TAG_EXISTS; \ } \ xh_log_trace0("save to hash"); \ lval = hv_fetch((HV *) SvRV(val), (const char *) content_key, (I32) content_key_len, 1);\ val = *lval; \ SAVE_VALUE(lval, val, s, l, flags | extra_flags) \ lval = nodes[depth].lval; \ } \ } \ else if (SvOK(val) && SvCUR(val) && !ctx->opts.merge_text) { \ xh_log_trace0("create a new array"); \ xh_log_trace1("create a new array val: %s", SvPV_nolen(val)); \ xh_log_trace3("create a new array svrok: %d type: %d rtype: %d", SvROK(val), SvTYPE(val), SvTYPE(SvRV(val)));\ /* content already exists, create a new array and move*/ \ /* old and new content to array */ \ av = newAV(); \ *lval = newRV_noinc((SV *) av); \ av_store(av, 0, val); \ av_store(av, av_len(av) + 1, NEW_STRING(s, l, flags)); \ } \ else { \ xh_log_trace0("concat"); \ /* concatenate with previous string */ \ CAT_STRING(val, s, l, flags) \ } \ #define NEW_TEXT(s, l) \ xh_log_trace2("new text: [%.*s]", l, s); \ if (real_depth == 0) goto INVALID_XML; \ if (!XH_X2H_FILTER_SEARCH(flags)) { \ _NEW_TEXT(s, l) \ } #define NEW_COMMENT(s, l) (s) = NULL; #define NEW_CDATA(s, l) NEW_TEXT(s, l) #define CHECK_EOF_WITH_CHUNK(loop) \ if (cur >= eof || *cur == '\0') { \ eof = cur; \ if (terminate) goto PPCAT(loop, _FINISH); \ ctx->state = PPCAT(loop, _START); \ goto CHUNK_FINISH; \ } \ #define CHECK_EOF_WITHOUT_CHUNK(loop) \ if (cur >= eof || *cur == '\0') goto PPCAT(loop, _FINISH); \ #define CHECK_EOF(loop) CHECK_EOF_WITH_CHUNK(loop) #define DO(loop) \ PPCAT(loop, _START): \ CHECK_EOF(loop) \ c = *cur++; \ xh_log_trace3("'%c'=[0x%X] %s start", c, c, STRINGIZE(loop)); \ switch (c) { #define _DO(loop) \ PPCAT(loop, _START): \ CHECK_EOF_WITHOUT_CHUNK(loop) \ c = *cur++; \ xh_log_trace3("'%c'=[0x%X] %s start", c, c, STRINGIZE(loop)); \ switch (c) { #define END(loop) \ } \ xh_log_trace1(" %s end", STRINGIZE(loop)); \ goto PPCAT(loop, _START); \ PPCAT(loop, _FINISH): #define EXPECT_ANY(desc) \ default: xh_log_trace3("'%c'=[0x%X] - %s expected", c, c, desc); #define EXPECT_CHAR(desc, c1) \ case c1: xh_log_trace3("'%c'=[0x%X] - %s expected", c, c, desc); #define EXPECT_BLANK_WO_CR(desc) \ case ' ': case '\t': case '\n': \ xh_log_trace3("'%c'=[0x%X] - %s expected", c, c, desc); #define EXPECT_BLANK(desc) \ case ' ': case '\t': case '\n': case '\r': \ xh_log_trace3("'%c'=[0x%X] - %s expected", c, c, desc); #define EXPECT_DIGIT(desc) \ case '0': case '1': case '2': case '3': case '4': \ case '5': case '6': case '7': case '8': case '9': \ xh_log_trace3("'%c'=[0x%X] - %s expected", c, c, desc); #define EXPECT_HEX_CHAR_LC(desc) \ case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': \ xh_log_trace3("'%c'=[0x%X] - %s expected", c, c, desc); #define EXPECT_HEX_CHAR_UC(desc) \ case 'A': case 'B': case 'C': case 'D': case 'E': case 'F': \ xh_log_trace3("'%c'=[0x%X] - %s expected", c, c, desc); #define SKIP_BLANK \ EXPECT_BLANK("skip blank") break; #define SCAN2(loop, c1, c2) \ DO(PPCAT(loop, _1)) EXPECT_CHAR(STRINGIZE(c1), c1) \ DO(PPCAT(loop, _2)) EXPECT_CHAR(STRINGIZE(c2), c2) #define END2(loop, stop) \ EXPECT_ANY("wrong character") goto stop; \ END(PPCAT(loop, _2)) goto stop; \ EXPECT_ANY("wrong character") goto stop; \ END(PPCAT(loop, _1)) #define SCAN3(loop, c1, c2, c3) \ DO(PPCAT(loop, _1)) EXPECT_CHAR(STRINGIZE(c1), c1) \ DO(PPCAT(loop, _2)) EXPECT_CHAR(STRINGIZE(c2), c2) \ DO(PPCAT(loop, _3)) EXPECT_CHAR(STRINGIZE(c3), c3) #define END3(loop, stop) \ EXPECT_ANY("wrong character") goto stop; \ END(PPCAT(loop, _3)) goto stop; \ EXPECT_ANY("wrong character") goto stop; \ END(PPCAT(loop, _2)) goto stop; \ EXPECT_ANY("wrong character") goto stop; \ END(PPCAT(loop, _1)) #define SCAN5(loop, c1, c2, c3, c4, c5) \ SCAN3(PPCAT(loop, _1), c1, c2, c3) \ SCAN2(PPCAT(loop, _2), c4, c5) #define END5(loop, stop) \ END2(PPCAT(loop, _2), stop) \ END3(PPCAT(loop, _1), stop) #define SCAN6(loop, c1, c2, c3, c4, c5, c6) \ SCAN3(PPCAT(loop, _1), c1, c2, c3) \ SCAN3(PPCAT(loop, _2), c4, c5, c6) #define END6(loop, stop) \ END3(PPCAT(loop, _2), stop) \ END3(PPCAT(loop, _1), stop) #define SCAN10(loop, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10) \ SCAN5(PPCAT(loop, _1), c1, c2, c3, c4, c5) \ SCAN5(PPCAT(loop, _2), c6, c7, c8, c9, c10) #define END10(loop, stop) \ END5(PPCAT(loop, _2), stop) \ END5(PPCAT(loop, _1), stop) #define SEARCH_END_TAG \ EXPECT_CHAR("end tag", '>') \ goto PARSE_CONTENT; \ EXPECT_CHAR("self closing tag", '/') \ CLOSE_TAG \ DO(SEARCH_END_TAG) \ EXPECT_CHAR("end tag", '>') \ goto PARSE_CONTENT; \ EXPECT_ANY("wrong character") \ goto INVALID_XML; \ END(SEARCH_END_TAG) \ goto INVALID_XML; #define SEARCH_NODE_ATTRIBUTE_VALUE(loop, top_loop, quot) \ EXPECT_CHAR("start attr value", quot) \ content = NULL; \ end_of_attr_value = NULL; \ flags &= ~(XH_X2H_NEED_NORMALIZE | XH_X2H_IS_NOT_BLANK); \ DO(PPCAT(loop, _END_ATTR_VALUE)) \ EXPECT_CHAR("attr value end", quot) \ if (flags & XH_X2H_NEED_NORMALIZE) { \ NORMALIZE_TEXT(loop, content, end_of_attr_value - content)\ NEW_ATTRIBUTE(node, end - node, enc, enc_len) \ } \ else if (content != NULL) { \ NEW_ATTRIBUTE(node, end - node, content, end_of_attr_value - content)\ } \ else { \ NEW_ATTRIBUTE(node, end - node, "", 0) \ } \ goto top_loop; \ EXPECT_BLANK_WO_CR("blank") \ if (!ctx->opts.trim) \ goto PPCAT(loop, _START_ATTR_VALUE); \ break; \ EXPECT_CHAR("CR", '\r') \ if (content != NULL) { \ flags |= XH_X2H_NORMALIZE_LINE_FEED; \ } \ if (!ctx->opts.trim) \ goto PPCAT(loop, _START_ATTR_VALUE); \ break; \ EXPECT_CHAR("reference", '&') \ flags |= (XH_X2H_NORMALIZE_REF | XH_X2H_IS_NOT_BLANK); \ goto PPCAT(loop, _START_ATTR_VALUE); \ EXPECT_ANY("any char") \ flags |= XH_X2H_IS_NOT_BLANK; \ PPCAT(loop, _START_ATTR_VALUE): \ if (content == NULL) content = cur - 1; \ end_of_attr_value = cur; \ END(PPCAT(loop, _END_ATTR_VALUE)) \ goto INVALID_XML; #define SEARCH_XML_DECL_ATTRIBUTE_VALUE(loop, top_loop, quot) \ EXPECT_CHAR("start attr value", quot) \ content = cur; \ DO(PPCAT(loop, _END_ATTR_VALUE)) \ EXPECT_CHAR("attr value end", quot) \ NEW_ATTRIBUTE(node, end - node, content, cur - content - 1)\ goto top_loop; \ END(PPCAT(loop, _END_ATTR_VALUE)) \ goto INVALID_XML; #define SEARCH_ATTRIBUTE_VALUE(loop, top_loop, quot) SEARCH_NODE_ATTRIBUTE_VALUE(loop, top_loop, quot) #define SEARCH_ATTRIBUTES(loop, search_end_tag) \ PPCAT(loop, _SEARCH_ATTRIBUTES_LOOP): \ DO(PPCAT(loop, _SEARCH_ATTR)) \ search_end_tag \ \ SKIP_BLANK \ \ EXPECT_ANY("start attr name") \ node = cur - 1; \ \ DO(PPCAT(loop, _PARSE_ATTR_NAME)) \ EXPECT_BLANK("end attr name") \ end = cur - 1; \ xh_log_trace2("attr name: [%.*s]", end - node, node);\ \ DO(PPCAT(loop, _ATTR_SKIP_BLANK)) \ EXPECT_CHAR("search attr value", '=') \ goto PPCAT(loop, _SEARCH_ATTRIBUTE_VALUE); \ SKIP_BLANK \ EXPECT_ANY("wrong character") \ goto INVALID_XML; \ END(PPCAT(loop, _ATTR_SKIP_BLANK)) \ goto INVALID_XML; \ EXPECT_CHAR("end attr name", '=') \ end = cur - 1; \ xh_log_trace2("attr name: [%.*s]", end - node, node);\ \ PPCAT(loop, _SEARCH_ATTRIBUTE_VALUE): \ DO(PPCAT(loop, _PARSE_ATTR_VALUE)) \ SEARCH_ATTRIBUTE_VALUE(PPCAT(loop, _1), PPCAT(loop, _SEARCH_ATTRIBUTES_LOOP), '"')\ SEARCH_ATTRIBUTE_VALUE(PPCAT(loop, _2), PPCAT(loop, _SEARCH_ATTRIBUTES_LOOP), '\'')\ SKIP_BLANK \ EXPECT_ANY("wrong character") \ goto INVALID_XML; \ END(PPCAT(loop, _PARSE_ATTR_VALUE)) \ goto INVALID_XML; \ END(PPCAT(loop, _PARSE_ATTR_NAME)) \ goto INVALID_XML; \ END(PPCAT(loop, _SEARCH_ATTR)) \ goto INVALID_XML; #define SEARCH_END_XML_DECLARATION \ EXPECT_CHAR("end tag", '?') \ DO(XML_DECL_SEARCH_END_TAG2) \ EXPECT_CHAR("end tag", '>') \ goto XML_DECL_FOUND; \ EXPECT_ANY("wrong character") \ goto INVALID_XML; \ END(XML_DECL_SEARCH_END_TAG2) \ goto INVALID_XML; #define SEARCH_END_PI \ EXPECT_CHAR("end tag", '?') \ DO(PI_SEARCH_END_TAG2) \ EXPECT_CHAR("end tag", '>') \ goto PARSE_CONTENT; \ EXPECT_ANY("wrong character") \ goto INVALID_XML; \ END(PI_SEARCH_END_TAG2) \ goto INVALID_XML; #define PARSE_DOCTYPE_END \ goto PARSE_DOCTYPE_INTSUBSET_START; #define PARSE_DOCTYPE_LITERAL(loop, next, quot) \ EXPECT_CHAR("start of literal", quot) \ DO(PPCAT(loop, _END_OF_LITERAL)) \ EXPECT_CHAR("end of literal", quot) \ next \ END(PPCAT(loop, _END_OF_LITERAL)) \ goto INVALID_XML; #define PARSE_DOCTYPE_LITERALS(prefix, next) \ PARSE_DOCTYPE_LITERAL(PPCAT(prefix, _1), next, '"')\ PARSE_DOCTYPE_LITERAL(PPCAT(prefix, _2), next, '\'') #define PARSE_DOCTYPE_DELIM(prefix, next) \ DO(PPCAT(prefix, _DOCTYPE_DELIM)) \ EXPECT_BLANK("delimiter") \ DO(PPCAT(prefix, _DOCTYPE_DELIM_SKIP_BLANK)) \ SKIP_BLANK \ next \ EXPECT_ANY("wrong character") \ goto INVALID_XML; \ END(PPCAT(prefix, _DOCTYPE_DELIM_SKIP_BLANK)) \ goto INVALID_XML; \ EXPECT_ANY("wrong character") \ goto INVALID_XML; \ END(PPCAT(prefix, _DOCTYPE_DELIM)) \ goto INVALID_XML; #define PARSE_DOCTYPE_SYSTEM \ SCAN5(DOCTYPE_SYSTEM, 'Y', 'S', 'T', 'E', 'M') \ PARSE_DOCTYPE_DELIM(DOCTYPE_SYSTEM_LOCATION, PARSE_DOCTYPE_LITERALS(DOCTYPE_SYSTEM, PARSE_DOCTYPE_END))\ END5(DOCTYPE_SYSTEM, INVALID_XML) \ goto INVALID_XML; #define PARSE_DOCTYPE_PUBLIC_ID(prefix) \ PARSE_DOCTYPE_LITERAL( \ PPCAT(prefix, _1), \ PARSE_DOCTYPE_DELIM(DOCTYPE_PUBLIC_LOCATION_1, PARSE_DOCTYPE_LITERALS(DOCTYPE_PUBLIC_LOCATION_1, PARSE_DOCTYPE_END)),\ '"' \ ) \ PARSE_DOCTYPE_LITERAL( \ PPCAT(prefix, _2), \ PARSE_DOCTYPE_DELIM(DOCTYPE_PUBLIC_LOCATION_2, PARSE_DOCTYPE_LITERALS(DOCTYPE_PUBLIC_LOCATION_2, PARSE_DOCTYPE_END)),\ '\'' \ ) #define PARSE_DOCTYPE_PUBLIC \ SCAN5(DOCTYPE_PUBLIC, 'U', 'B', 'L', 'I', 'C') \ PARSE_DOCTYPE_DELIM(DOCTYPE_PUBLIC_ID, PARSE_DOCTYPE_PUBLIC_ID(DOCTYPE_PUBLIC))\ END5(DOCTYPE_PUBLIC, INVALID_XML) \ goto INVALID_XML; #define PARSE_DOCTYPE \ SCAN6(DOCTYPE, 'O', 'C', 'T', 'Y', 'P', 'E') \ if (flags & (XH_X2H_ROOT_FOUND | XH_X2H_DOCTYPE_FOUND)) goto INVALID_XML;\ flags |= XH_X2H_DOCTYPE_FOUND; \ DO(DOCTYPE_NAME) \ EXPECT_BLANK("delimiter") \ DO(DOCTYPE_NAME_START) \ SKIP_BLANK \ EXPECT_ANY("start name") \ DO(DOCTYPE_NAME_END) \ EXPECT_BLANK("end name") \ DO(DOCTYPE_NAME_BLANK) \ SKIP_BLANK \ EXPECT_CHAR("end doctype", '>') \ goto PARSE_CONTENT; \ EXPECT_CHAR("SYSTEM", 'S') \ PARSE_DOCTYPE_SYSTEM \ EXPECT_CHAR("PUBLIC", 'P') \ PARSE_DOCTYPE_PUBLIC \ EXPECT_CHAR("internal subset", '[') \ goto PARSE_DOCTYPE_INTSUBSET; \ EXPECT_ANY("wrong character") \ goto INVALID_XML; \ END(DOCTYPE_NAME_BLANK) \ goto INVALID_XML; \ EXPECT_CHAR("end doctype", '>') \ goto PARSE_CONTENT; \ END(DOCTYPE_NAME_END) \ goto INVALID_XML; \ END(DOCTYPE_NAME_START) \ goto INVALID_XML; \ EXPECT_ANY("wrong character") \ goto INVALID_XML; \ END(DOCTYPE_NAME) \ goto INVALID_XML; \ END6(DOCTYPE, INVALID_XML) \ goto INVALID_XML; #define PARSE_COMMENT \ DO(COMMENT1) \ EXPECT_CHAR("-", '-') \ content = NULL; \ DO(END_COMMENT1) \ SKIP_BLANK \ EXPECT_CHAR("1st -", '-') \ if (content == NULL) content = end = cur - 1; \ DO(END_COMMENT2) \ EXPECT_CHAR("2nd -", '-') \ DO(END_COMMENT3) \ EXPECT_CHAR(">", '>') \ NEW_COMMENT(content, end - content) \ goto PARSE_CONTENT; \ EXPECT_CHAR("2nd -", '-') \ end = cur - 2; \ goto END_COMMENT3_START; \ EXPECT_ANY("any character") \ end = cur - 1; \ goto END_COMMENT1_START; \ END(END_COMMENT3) \ EXPECT_BLANK("skip blank") \ end = cur - 1; \ goto END_COMMENT1_START; \ EXPECT_ANY("any character") \ end = cur; \ goto END_COMMENT1_START; \ END(END_COMMENT2) \ EXPECT_ANY("any char") \ if (content == NULL) content = cur - 1; \ end = cur; \ END(END_COMMENT1) \ goto INVALID_XML; \ \ EXPECT_ANY("wrong character") \ goto INVALID_XML; \ \ END(COMMENT1) \ goto INVALID_XML; #define PARSE_CDATA \ SCAN6(CDATA, 'C', 'D', 'A', 'T', 'A', '[') \ content = end = cur; \ DO(END_CDATA1) \ EXPECT_CHAR("1st ]", ']') \ DO(END_CDATA2) \ EXPECT_CHAR("2nd ]", ']') \ DO(END_CDATA3) \ EXPECT_CHAR(">", '>') \ end = cur - 3; \ NEW_CDATA(content, end - content) \ goto PARSE_CONTENT; \ EXPECT_CHAR("2nd ]", ']') \ goto END_CDATA3_START; \ EXPECT_ANY("any character") \ goto END_CDATA1_START; \ END(END_CDATA3) \ EXPECT_ANY("any character") \ goto END_CDATA1_START; \ END(END_CDATA2) \ ; \ END(END_CDATA1) \ goto INVALID_XML; \ END6(CDATA, INVALID_XML) #define PARSE_CDATA_WITH_TRIM \ SCAN6(CDATA_WITH_TRIM, 'C', 'D', 'A', 'T', 'A', '[') \ content = NULL; \ DO(END_CDATA_WITH_TRIM1) \ SKIP_BLANK \ EXPECT_CHAR("1st ]", ']') \ if (content == NULL) content = end = cur - 1; \ DO(END_CDATA_WITH_TRIM2) \ EXPECT_CHAR("2nd ]", ']') \ DO(END_CDATA_WITH_TRIM3) \ EXPECT_CHAR(">", '>') \ NEW_CDATA(content, end - content) \ goto PARSE_CONTENT; \ EXPECT_CHAR("2nd ]", ']') \ end = cur - 2; \ goto END_CDATA_WITH_TRIM3_START; \ EXPECT_ANY("any character") \ end = cur - 1; \ goto END_CDATA_WITH_TRIM1_START; \ END(END_CDATA_WITH_TRIM3) \ EXPECT_BLANK("skip blank") \ end = cur - 1; \ goto END_CDATA_WITH_TRIM1_START; \ EXPECT_ANY("any character") \ end = cur; \ goto END_CDATA_WITH_TRIM1_START; \ END(END_CDATA_WITH_TRIM2) \ EXPECT_ANY("any char") \ if (content == NULL) content = cur - 1; \ end = cur; \ END(END_CDATA_WITH_TRIM1) \ goto INVALID_XML; \ END6(CDATA_WITH_TRIM, INVALID_XML) #define NORMALIZE_REFERENCE(loop) \ _DO(PPCAT(loop, _REFERENCE)) \ EXPECT_CHAR("char reference", '#') \ _DO(PPCAT(loop, _CHAR_REFERENCE)) \ EXPECT_CHAR("hex", 'x') \ code = 0; \ _DO(PPCAT(loop, _HEX_CHAR_REFERENCE_LOOP)) \ EXPECT_DIGIT("hex digit") \ code = code * 16 + (c - '0'); \ break; \ EXPECT_HEX_CHAR_LC("hex a-f") \ code = code * 16 + (c - 'a') + 10; \ break; \ EXPECT_HEX_CHAR_UC("hex A-F") \ code = code * 16 + (c - 'A') + 10; \ break; \ EXPECT_CHAR("reference end", ';') \ goto PPCAT(loop, _REFEFENCE_VALUE); \ END(PPCAT(loop, _HEX_CHAR_REFERENCE_LOOP)) \ goto INVALID_REF; \ EXPECT_DIGIT("digit") \ code = (c - '0'); \ _DO(PPCAT(loop, _CHAR_REFERENCE_LOOP)) \ EXPECT_DIGIT("digit") \ code = code * 10 + (c - '0'); \ break; \ EXPECT_CHAR("reference end", ';') \ goto PPCAT(loop, _REFEFENCE_VALUE); \ END(PPCAT(loop, _CHAR_REFERENCE_LOOP)) \ goto INVALID_REF; \ EXPECT_ANY("any char") \ goto INVALID_REF; \ END(PPCAT(loop, _CHAR_REFERENCE)) \ goto INVALID_REF; \ EXPECT_CHAR("amp or apos", 'a') \ if (xh_str_auto_equal3(cur, 'm', 'p', ';', "mp;")) { \ code = '&'; \ cur += 3; \ goto PPCAT(loop, _REFEFENCE_VALUE); \ } \ if (xh_str_auto_equal4(cur, 'p', 'o', 's', ';', "pos;")) { \ code = '\''; \ cur += 4; \ goto PPCAT(loop, _REFEFENCE_VALUE); \ } \ goto INVALID_REF; \ EXPECT_CHAR("lt", 'l') \ if (xh_str_auto_equal2(cur, 't', ';', "t;")) { \ code = '<'; \ cur += 2; \ goto PPCAT(loop, _REFEFENCE_VALUE); \ } \ goto INVALID_REF; \ EXPECT_CHAR("gt", 'g') \ if (xh_str_auto_equal2(cur, 't', ';', "t;")) { \ code = '>'; \ cur += 2; \ goto PPCAT(loop, _REFEFENCE_VALUE); \ } \ goto INVALID_REF; \ EXPECT_CHAR("quot", 'q') \ if (xh_str_auto_equal4(cur, 'u', 'o', 't', ';', "uot;")) { \ code = '"'; \ cur += 4; \ goto PPCAT(loop, _REFEFENCE_VALUE); \ } \ goto INVALID_REF; \ EXPECT_ANY("any char") \ goto INVALID_REF; \ END(PPCAT(loop, _REFERENCE)) \ goto INVALID_REF; \ PPCAT(loop, _REFEFENCE_VALUE): \ xh_log_trace1("parse reference value: %lu", code); \ if (code == 0 || code > 0x10FFFF) goto INVALID_REF; \ if (code >= 0x80) { \ if (code < 0x800) { \ *enc_cur++ = (code >> 6) | 0xC0; bits = 0; \ } \ else if (code < 0x10000) { \ *enc_cur++ = (code >> 12) | 0xE0; bits = 6; \ } \ else if (code < 0x110000) { \ *enc_cur++ = (code >> 18) | 0xF0; bits = 12; \ } \ else { \ goto INVALID_REF; \ } \ for (; bits >= 0; bits-= 6) { \ *enc_cur++ = ((code >> bits) & 0x3F) | 0x80; \ } \ } \ else { \ *enc_cur++ = (xh_char_t) code; \ } #define NORMALIZE_LINE_FEED(loop) \ _DO(PPCAT(loop, _NORMALIZE_LINE_FEED)) \ EXPECT_CHAR("LF", '\n') \ goto PPCAT(loop, _NORMALIZE_LINE_FEED_END); \ EXPECT_ANY("any char") \ cur--; \ goto PPCAT(loop, _NORMALIZE_LINE_FEED_END); \ END(PPCAT(loop, _NORMALIZE_LINE_FEED)) \ PPCAT(loop, _NORMALIZE_LINE_FEED_END): \ *enc_cur++ = '\n'; #define NORMALIZE_TEXT(loop, s, l) \ enc_len = l; \ if (enc_len) { \ old_cur = cur; \ old_eof = eof; \ cur = s; \ eof = cur + enc_len; \ if (ctx->tmp == NULL) { \ xh_log_trace1("malloc() %lu", enc_len); \ if ((ctx->tmp = malloc(enc_len)) == NULL) goto MALLOC; \ ctx->tmp_size = enc_len; \ } \ else if (enc_len > ctx->tmp_size) { \ xh_log_trace1("realloc() %lu", enc_len); \ if ((enc = realloc(ctx->tmp, enc_len)) == NULL) goto MALLOC;\ ctx->tmp = enc; \ ctx->tmp_size = enc_len; \ } \ enc = enc_cur = ctx->tmp; \ memcpy(enc, cur, enc_len); \ _DO(PPCAT(loop, _NORMALIZE_TEXT)) \ EXPECT_CHAR("reference", '&') \ NORMALIZE_REFERENCE(loop) \ break; \ EXPECT_CHAR("CR", '\r') \ NORMALIZE_LINE_FEED(loop) \ break; \ EXPECT_ANY("any char") \ *enc_cur++ = c; \ END(PPCAT(loop, _NORMALIZE_TEXT)) \ enc_len = enc_cur - enc; \ cur = old_cur; \ eof = old_eof; \ } \ else { \ enc = s; \ } #define END_OF_TEXT(loop, s, l) \ if (s != NULL) { \ if (flags & (XH_X2H_IS_NOT_BLANK | XH_X2H_TEXT_NODE)) { \ if (flags & XH_X2H_NEED_NORMALIZE) { \ NORMALIZE_TEXT(loop, s, (l)) \ NEW_TEXT(enc, enc_len) \ } \ else { \ NEW_TEXT(s, (l)) \ } \ } \ s = NULL; \ } static void xh_x2h_parse_chunk(xh_x2h_ctx_t *ctx, xh_char_t **buf, size_t *bytesleft, xh_bool_t terminate) { xh_char_t c, *cur, *node, *end, *content, *eof, *enc, *enc_cur, *old_cur, *old_eof, *content_key, *end_of_attr_value; unsigned int depth, real_depth, code, flags, extra_flags; int bits; SV **lval, *val; xh_x2h_node_t *nodes; AV *av; size_t enc_len, content_key_len; cur = *buf; eof = cur + *bytesleft; nodes = ctx->nodes; depth = ctx->depth; real_depth = ctx->real_depth; flags = ctx->flags; node = ctx->node; end = ctx->end; end_of_attr_value = ctx->end_of_attr_value; content = ctx->content; code = ctx->code; lval = ctx->lval; enc = enc_cur = old_eof = old_cur = NULL; c = '\0'; if (ctx->opts.content[0] == '\0') { content_key = (xh_char_t *) DEF_CONTENT_KEY; content_key_len = sizeof(DEF_CONTENT_KEY) - 1; } else { content_key = ctx->opts.content; content_key_len = xh_strlen(ctx->opts.content); } #define XH_X2H_PROCESS_STATE(st) case st: goto st; switch (ctx->state) { case PARSER_ST_NONE: break; XH_X2H_PARSER_STATE_LIST case XML_DECL_FOUND: break; case PARSER_ST_DONE: goto DONE; } #undef XH_X2H_PROCESS_STATE PARSE_CONTENT: content = NULL; flags &= ~(XH_X2H_NEED_NORMALIZE | XH_X2H_IS_NOT_BLANK); DO(CONTENT) EXPECT_CHAR("new element", '<') DO(PARSE_ELEMENT) EXPECT_CHAR("xml declaration", '?') if (real_depth != 0) goto INVALID_XML; END_OF_TEXT(TEXT_BEFORE_XML_DECL, content, end - content) SCAN3(XML_DECL, 'x', 'm', 'l') DO(XML_DECL_ATTR) EXPECT_BLANK("blank") #undef NEW_ATTRIBUTE #define NEW_ATTRIBUTE(k, kl, v, vl) NEW_XML_DECL_ATTRIBUTE(k, kl, v, vl) #undef SEARCH_ATTRIBUTE_VALUE #define SEARCH_ATTRIBUTE_VALUE(loop, top_loop, quot) SEARCH_XML_DECL_ATTRIBUTE_VALUE(loop, top_loop, quot) SEARCH_ATTRIBUTES(XML_DECL_ATTR, SEARCH_END_XML_DECLARATION) #undef NEW_ATTRIBUTE #define NEW_ATTRIBUTE(k, kl, v, vl) NEW_NODE_ATTRIBUTE(k, kl, v, vl) #undef SEARCH_ATTRIBUTE_VALUE #define SEARCH_ATTRIBUTE_VALUE(loop, top_loop, quot) SEARCH_NODE_ATTRIBUTE_VALUE(loop, top_loop, quot) goto INVALID_XML; EXPECT_CHAR("PI", '-') SCAN10(STYLESHEET_PI, 's', 't', 'y', 'l', 'e', 's', 'h', 'e', 'e', 't') DO(STYLESHEET_PI_ATTR) EXPECT_BLANK("blank") #undef NEW_ATTRIBUTE #define NEW_ATTRIBUTE(k, kl, v, vl) NEW_PI_ATTRIBUTE(k, kl, v, vl) #undef SEARCH_ATTRIBUTE_VALUE #define SEARCH_ATTRIBUTE_VALUE(loop, top_loop, quot) SEARCH_XML_DECL_ATTRIBUTE_VALUE(loop, top_loop, quot) SEARCH_ATTRIBUTES(STYLESHEET_PI_ATTR, SEARCH_END_PI) #undef NEW_ATTRIBUTE #define NEW_ATTRIBUTE(k, kl, v, vl) NEW_NODE_ATTRIBUTE(k, kl, v, vl) #undef SEARCH_ATTRIBUTE_VALUE #define SEARCH_ATTRIBUTE_VALUE(loop, top_loop, quot) SEARCH_NODE_ATTRIBUTE_VALUE(loop, top_loop, quot) goto INVALID_XML; EXPECT_ANY("wrong character") goto INVALID_XML; END(STYLESHEET_PI_ATTR) goto INVALID_XML; END10(STYLESHEET_PI, INVALID_XML) goto INVALID_XML; EXPECT_ANY("wrong character") goto INVALID_XML; END(XML_DECL_ATTR) goto INVALID_XML; END3(XML_DECL, INVALID_XML) goto INVALID_XML; EXPECT_CHAR("comment or cdata or doctype", '!') flags &= ~XH_X2H_TEXT_NODE; END_OF_TEXT(TEXT_BEFORE_COMMENT, content, end - content) DO(XML_COMMENT_NODE_OR_CDATA) EXPECT_CHAR("comment", '-') PARSE_COMMENT EXPECT_CHAR("cdata", '[') if (ctx->opts.trim) { PARSE_CDATA_WITH_TRIM ; } else { PARSE_CDATA ; } EXPECT_CHAR("doctype", 'D') PARSE_DOCTYPE EXPECT_ANY("wrong character") goto INVALID_XML; END(XML_COMMENT_NODE_OR_CDATA) goto INVALID_XML; EXPECT_CHAR("closing tag", '/') END_OF_TEXT(TEXT_BEFORE_CLOSING_TAG, content, end - content) //node = cur; DO(PARSE_CLOSING_TAG) EXPECT_CHAR("end tag name", '>') CLOSE_TAG goto PARSE_CONTENT; EXPECT_BLANK("end tag name") DO(SEARCH_CLOSING_END_TAG) EXPECT_CHAR("end tag", '>') CLOSE_TAG goto PARSE_CONTENT; SKIP_BLANK EXPECT_ANY("wrong character") goto INVALID_XML; END(SEARCH_CLOSING_END_TAG) goto INVALID_XML; END(PARSE_CLOSING_TAG) goto INVALID_XML; EXPECT_ANY("opening tag") flags &= ~XH_X2H_TEXT_NODE; END_OF_TEXT(TEXT_BEFORE_OPENING_TAG, content, end - content) node = cur - 1; DO(PARSE_OPENING_TAG) EXPECT_CHAR("end tag", '>') OPEN_TAG(node, cur - node - 1) goto PARSE_CONTENT; EXPECT_CHAR("self closing tag", '/') OPEN_TAG(node, cur - node - 1) CLOSE_TAG DO(SEARCH_OPENING_END_TAG) EXPECT_CHAR("end tag", '>') goto PARSE_CONTENT; EXPECT_ANY("wrong character") goto INVALID_XML; END(SEARCH_OPENING_END_TAG) goto INVALID_XML; EXPECT_BLANK("end tag name") OPEN_TAG(node, cur - node - 1) SEARCH_ATTRIBUTES(NODE, SEARCH_END_TAG) goto PARSE_CONTENT; END(PARSE_OPENING_TAG); goto INVALID_XML; END(PARSE_ELEMENT) EXPECT_CHAR("wrong symbol", '>') goto INVALID_XML; EXPECT_BLANK_WO_CR("blank") if (!ctx->opts.trim) goto START_CONTENT; break; EXPECT_CHAR("CR", '\r') if (content != NULL) { flags |= XH_X2H_NORMALIZE_LINE_FEED; } if (!ctx->opts.trim) goto START_CONTENT; break; EXPECT_CHAR("reference", '&') flags |= (XH_X2H_NORMALIZE_REF | XH_X2H_IS_NOT_BLANK); goto START_CONTENT; EXPECT_ANY("any char") flags |= XH_X2H_IS_NOT_BLANK; START_CONTENT: if (content == NULL) content = cur - 1; end = cur; END(CONTENT) if ( ((content != NULL) && (flags & XH_X2H_IS_NOT_BLANK)) || (real_depth != 0) || !(flags & XH_X2H_ROOT_FOUND) ) goto INVALID_XML; ctx->state = PARSER_ST_DONE; *bytesleft = eof - cur; *buf = cur; return; PARSE_DOCTYPE_INTSUBSET: DO(DOCTYPE_INTSUBSET) EXPECT_CHAR("end of internal subset", ']') DO(DOCTYPE_END) SKIP_BLANK EXPECT_CHAR("end doctype", '>') goto PARSE_CONTENT; EXPECT_ANY("wrong character") goto INVALID_XML; END(DOCTYPE_END) goto INVALID_XML; END(DOCTYPE_INTSUBSET) goto INVALID_XML; PARSE_DOCTYPE_INTSUBSET_START: DO(DOCTYPE_INTSUBSET_START) SKIP_BLANK EXPECT_CHAR("end doctype", '>') goto PARSE_CONTENT; EXPECT_CHAR("start of internal subset", '[') goto PARSE_DOCTYPE_INTSUBSET; EXPECT_ANY("wrong character") goto INVALID_XML; END(DOCTYPE_INTSUBSET_START) goto INVALID_XML; XML_DECL_FOUND: ctx->state = XML_DECL_FOUND; CHUNK_FINISH: ctx->content = content; ctx->node = node; ctx->end = end; ctx->end_of_attr_value = end_of_attr_value; ctx->depth = depth; ctx->real_depth = real_depth; ctx->flags = flags; ctx->code = code; ctx->lval = lval; *bytesleft = eof - cur; *buf = cur; return; MAX_DEPTH_EXCEEDED: croak("Maximum depth exceeded"); INVALID_XML: croak("Invalid XML"); INVALID_REF: croak("Invalid reference"); MALLOC: croak("Memory allocation error"); DONE: croak("Parsing is done"); } static void xh_x2h_parse(xh_x2h_ctx_t *ctx, xh_reader_t *reader) { xh_char_t *buf, *preserve; size_t len, off; xh_bool_t eof; do { preserve = ctx->node != NULL ? ctx->node : ctx->content; len = reader->read(reader, &buf, preserve, &off); eof = (len == 0); if (off) { if (ctx->node != NULL) ctx->node -= off; if (ctx->content != NULL) ctx->content -= off; if (ctx->end != NULL) ctx->end -= off; if (ctx->end_of_attr_value != NULL) ctx->end_of_attr_value -= off; } xh_log_trace2("read buf: %.*s", len, buf); do { xh_log_trace2("parse buf: %.*s", len, buf); xh_x2h_parse_chunk(ctx, &buf, &len, eof); if (ctx->state == XML_DECL_FOUND && ctx->opts.encoding[0] == '\0' && ctx->encoding[0] != '\0') { reader->switch_encoding(reader, ctx->encoding, &buf, &len); } } while (len > 0); } while (!eof); if (ctx->state != PARSER_ST_DONE) croak("Invalid XML"); } SV * xh_x2h(xh_x2h_ctx_t *ctx) { HV *hv; HE *he; SV *result; dXCPT; XCPT_TRY_START { if (ctx->opts.filter.enable) { ctx->flags |= XH_X2H_FILTER_ENABLED; if (ctx->opts.cb == NULL) ctx->result = newRV_noinc((SV *) newAV()); } else { ctx->result = newRV_noinc((SV *) newHV()); ctx->nodes[0].lval = ctx->lval = &ctx->result; } xh_reader_init(&ctx->reader, ctx->input, ctx->opts.encoding, ctx->opts.buf_size); xh_x2h_parse(ctx, &ctx->reader); } XCPT_TRY_END XCPT_CATCH { if (ctx->result != NULL) SvREFCNT_dec(ctx->result); xh_reader_destroy(&ctx->reader); XCPT_RETHROW; } xh_reader_destroy(&ctx->reader); result = ctx->result; if (ctx->opts.filter.enable) { if (ctx->opts.cb != NULL) result = NULL; } else if (!ctx->opts.keep_root) { hv = (HV *) SvRV(result); hv_iterinit(hv); if ((he = hv_iternext(hv))) { result = hv_iterval(hv, he); SvREFCNT_inc(result); } else { result = NULL; } SvREFCNT_dec(ctx->result); } return result; } XML-Hash-XS-0.64/src/XS.xs0000644000175000017500000000364614734303565013556 0ustar yurayura#include "xh_config.h" #include "xh_core.h" MODULE = XML::Hash::XS PACKAGE = XML::Hash::XS PROTOTYPES: DISABLE xh_opts_t * new(CLASS,...) PREINIT: xh_opts_t *opts; CODE: dXCPT; if ((opts = xh_create_opts()) == NULL) croak("Malloc error in new()"); XCPT_TRY_START { xh_parse_param(opts, 1, ax, items); } XCPT_TRY_END XCPT_CATCH { xh_destroy_opts(opts); XCPT_RETHROW; } RETVAL = opts; OUTPUT: RETVAL SV * hash2xml(...) PREINIT: xh_h2x_ctx_t ctx; SV *result; CODE: dXCPT; XCPT_TRY_START { xh_h2x_init_ctx(&ctx, ax, items); /* hack */ #ifdef XH_HAVE_DOM if (ctx.opts.doc) { result = xh_h2d(&ctx); } else { result = xh_h2x(&ctx); } #else result = xh_h2x(&ctx); #endif } XCPT_TRY_END XCPT_CATCH { xh_h2x_destroy_ctx(&ctx); XCPT_RETHROW; } if (ctx.opts.output != NULL) result = NULL; xh_h2x_destroy_ctx(&ctx); if (result == NULL) XSRETURN_UNDEF; RETVAL = result; OUTPUT: RETVAL SV * xml2hash(...) PREINIT: xh_x2h_ctx_t ctx; SV *result; CODE: dXCPT; XCPT_TRY_START { xh_x2h_init_ctx(&ctx, ax, items); result = xh_x2h(&ctx); } XCPT_TRY_END XCPT_CATCH { xh_x2h_destroy_ctx(&ctx); XCPT_RETHROW; } if (ctx.opts.cb != NULL) result = NULL; xh_x2h_destroy_ctx(&ctx); if (result == NULL) XSRETURN_UNDEF; RETVAL = result; OUTPUT: RETVAL void DESTROY(opts) xh_opts_t *opts; CODE: xh_destroy_opts(opts); free(opts); XML-Hash-XS-0.64/src/xh.c0000644000175000017500000003231214732511770013420 0ustar yurayura#include "xh_config.h" #include "xh_core.h" xh_bool_t xh_init_opts(xh_opts_t *opts) { xh_char_t method[XH_PARAM_LEN]; xh_bool_t use_attr; XH_PARAM_READ_INIT /* native options */ XH_PARAM_READ_STRING (opts->root, "XML::Hash::XS::root", XH_DEF_ROOT); XH_PARAM_READ_STRING (opts->version, "XML::Hash::XS::version", XH_DEF_VERSION); XH_PARAM_READ_STRING (opts->encoding, "XML::Hash::XS::encoding", XH_DEF_ENCODING); XH_PARAM_READ_INT (opts->indent, "XML::Hash::XS::indent", XH_DEF_INDENT); XH_PARAM_READ_BOOL (opts->canonical, "XML::Hash::XS::canonical", XH_DEF_CANONICAL); XH_PARAM_READ_STRING (opts->content, "XML::Hash::XS::content", XH_DEF_CONTENT); XH_PARAM_READ_BOOL (opts->utf8, "XML::Hash::XS::utf8", XH_DEF_UTF8); XH_PARAM_READ_BOOL (opts->xml_decl, "XML::Hash::XS::xml_decl", XH_DEF_XML_DECL); XH_PARAM_READ_BOOL (opts->keep_root, "XML::Hash::XS::keep_root", XH_DEF_KEEP_ROOT); #ifdef XH_HAVE_DOM XH_PARAM_READ_BOOL (opts->doc, "XML::Hash::XS::doc", XH_DEF_DOC); #endif XH_PARAM_READ_BOOL (use_attr, "XML::Hash::XS::use_attr", XH_DEF_USE_ATTR); XH_PARAM_READ_INT (opts->max_depth, "XML::Hash::XS::max_depth", XH_DEF_MAX_DEPTH); XH_PARAM_READ_INT (opts->buf_size, "XML::Hash::XS::buf_size", XH_DEF_BUF_SIZE); XH_PARAM_READ_PATTERN(opts->force_array, "XML::Hash::XS::force_array", XH_DEF_FORCE_ARRAY); XH_PARAM_READ_BOOL (opts->force_content, "XML::Hash::XS::force_content", XH_DEF_FORCE_CONTENT); XH_PARAM_READ_BOOL (opts->merge_text, "XML::Hash::XS::merge_text", XH_DEF_MERGE_TEXT); /* XML::Hash::LX options */ XH_PARAM_READ_STRING (opts->attr, "XML::Hash::XS::attr", XH_DEF_ATTR); opts->attr_len = xh_strlen(opts->attr); XH_PARAM_READ_STRING (opts->text, "XML::Hash::XS::text", XH_DEF_TEXT); XH_PARAM_READ_BOOL (opts->trim, "XML::Hash::XS::trim", XH_DEF_TRIM); XH_PARAM_READ_STRING (opts->cdata, "XML::Hash::XS::cdata", XH_DEF_CDATA); XH_PARAM_READ_STRING (opts->comm, "XML::Hash::XS::comm", XH_DEF_COMM); /* method */ XH_PARAM_READ_STRING (method, "XML::Hash::XS::method", XH_DEF_METHOD); if (xh_strcmp(method, XH_CHAR_CAST "LX") == 0) { opts->method = XH_METHOD_LX; } else if (use_attr) { opts->method = XH_METHOD_NATIVE_ATTR_MODE; } else { opts->method = XH_METHOD_NATIVE; } /* output, NULL - to string */ XH_PARAM_READ_REF (opts->output, "XML::Hash::XS::output", XH_DEF_OUTPUT); /* suppress empty */ if ( (sv = get_sv("XML::Hash::XS::suppress_empty", 0)) != NULL ) { if ( SvOK(sv) ) { if (SvTYPE(sv) == SVt_IV) { opts->suppress_empty = SvIV(sv); } else { opts->suppress_empty = XH_SUPPRESS_EMPTY_TO_STRING; } } else { opts->suppress_empty = XH_SUPPRESS_EMPTY_TO_UNDEF; } } else { opts->suppress_empty = XH_DEF_SUPPRESS_EMPTY; } return TRUE; } xh_opts_t * xh_create_opts(void) { xh_opts_t *opts; if ((opts = malloc(sizeof(xh_opts_t))) == NULL) { return NULL; } memset(opts, 0, sizeof(xh_opts_t)); if (! xh_init_opts(opts)) { xh_destroy_opts(opts); return NULL; } return opts; } void xh_destroy_opts(xh_opts_t *opts) { if (opts->force_array.expr != NULL) SvREFCNT_dec(opts->force_array.expr); if (opts->filter.expr != NULL) SvREFCNT_dec(opts->filter.expr); if (opts->cb != NULL) SvREFCNT_dec(opts->cb); } void xh_copy_opts(xh_opts_t *dst, xh_opts_t *src) { memcpy(dst, src, sizeof(xh_opts_t)); if (dst->force_array.expr != NULL) { SvREFCNT_inc(dst->force_array.expr); } } void xh_parse_param(xh_opts_t *opts, xh_int_t first, I32 ax, I32 items) { xh_int_t i; xh_char_t *p, *cv; SV *v; STRLEN len; xh_int_t use_attr = -1; if ((items - first) % 2 != 0) { croak("Odd number of parameters in new()"); } for (i = first; i < items; i = i + 2) { v = ST(i); if (!SvOK(v)) { croak("Parameter name is undefined"); } p = XH_CHAR_CAST SvPV(v, len); v = ST(i + 1); switch (len) { case 2: if (xh_str_equal2(p, 'c', 'b')) { opts->cb = xh_param_assign_cb("cb", v); break; } goto error; #ifdef XH_HAVE_DOM case 3: if (xh_str_equal3(p, 'd', 'o', 'c')) { opts->doc = xh_param_assign_bool(v); break; } goto error; #endif case 4: if (xh_str_equal4(p, 'a', 't', 't', 'r')) { xh_param_assign_string(opts->attr, v); if (opts->attr[0] == '\0') { opts->attr_len = 0; } else { opts->attr_len = xh_strlen(opts->attr); } break; } if (xh_str_equal4(p, 'c', 'o', 'm', 'm')) { xh_param_assign_string(opts->comm, v); break; } if (xh_str_equal4(p, 'r', 'o', 'o', 't')) { xh_param_assign_string(opts->root, v); break; } if (xh_str_equal4(p, 't', 'r', 'i', 'm')) { opts->trim = xh_param_assign_bool(v); break; } if (xh_str_equal4(p, 't', 'e', 'x', 't')) { xh_param_assign_string(opts->text, v); break; } if (xh_str_equal4(p, 'u', 't', 'f', '8')) { opts->utf8 = xh_param_assign_bool(v); break; } goto error; case 5: if (xh_str_equal5(p, 'c', 'd', 'a', 't', 'a')) { xh_param_assign_string(opts->cdata, v); break; } goto error; case 6: if (xh_str_equal6(p, 'i', 'n', 'd', 'e', 'n', 't')) { xh_param_assign_int(p, &opts->indent, v); break; } if (xh_str_equal6(p, 'm', 'e', 't', 'h', 'o', 'd')) { if (!SvOK(v)) { croak("Parameter '%s' is undefined", p); } cv = XH_CHAR_CAST SvPV(v, len); switch (len) { case 6: if (xh_str_equal6(cv, 'N', 'A', 'T', 'I', 'V', 'E')) { opts->method = XH_METHOD_NATIVE; break; } goto error_value; case 2: if (cv[0] == 'L' && cv[1] == 'X') { opts->method = XH_METHOD_LX; break; } goto error_value; default: goto error_value; } break; } if (xh_str_equal6(p, 'o', 'u', 't', 'p', 'u', 't')) { if ( SvOK(v) && SvROK(v) ) { opts->output = SvRV(v); } else { opts->output = NULL; } break; } if (xh_str_equal6(p, 'f', 'i', 'l', 't', 'e', 'r')) { xh_param_assign_filter(&opts->filter, v); break; } goto error; case 7: if (xh_str_equal7(p, 'c', 'o', 'n', 't', 'e', 'n', 't')) { xh_param_assign_string(opts->content, v); break; } if (xh_str_equal7(p, 'v', 'e', 'r', 's', 'i', 'o', 'n')) { xh_param_assign_string(opts->version, v); break; } goto error; case 8: if (xh_str_equal8(p, 'e', 'n', 'c', 'o', 'd', 'i', 'n', 'g')) { xh_param_assign_string(opts->encoding, v); break; } if (xh_str_equal8(p, 'u', 's', 'e', '_', 'a', 't', 't', 'r')) { use_attr = xh_param_assign_bool(v); break; } if (xh_str_equal8(p, 'x', 'm', 'l', '_', 'd', 'e', 'c', 'l')) { opts->xml_decl = xh_param_assign_bool(v); break; } if (xh_str_equal8(p, 'b', 'u', 'f', '_', 's', 'i', 'z', 'e')) { xh_param_assign_int(p, &opts->buf_size, v); break; } goto error; case 9: if (xh_str_equal9(p, 'c', 'a', 'n', 'o', 'n', 'i', 'c', 'a', 'l')) { opts->canonical = xh_param_assign_bool(v); break; } if (xh_str_equal9(p, 'm', 'a', 'x', '_', 'd', 'e', 'p', 't', 'h')) { xh_param_assign_int(p, &opts->max_depth, v); break; } if (xh_str_equal9(p, 'k', 'e', 'e', 'p', '_', 'r', 'o', 'o', 't')) { opts->keep_root = xh_param_assign_bool(v); break; } goto error; case 10: if (xh_str_equal10(p, 'm', 'e', 'r', 'g', 'e', '_', 't', 'e', 'x', 't')) { opts->merge_text = xh_param_assign_bool(v); break; } goto error; case 11: if (xh_str_equal11(p, 'f', 'o', 'r', 'c', 'e', '_', 'a', 'r', 'r', 'a', 'y')) { xh_param_assign_pattern(&opts->force_array, v); break; } goto error; case 13: if (xh_str_equal13(p, 'f', 'o', 'r', 'c', 'e', '_', 'c', 'o', 'n', 't', 'e', 'n', 't')) { opts->force_content = xh_param_assign_bool(v); break; } goto error; case 14: if (xh_str_equal14(p, 's', 'u', 'p', 'p', 'r', 'e', 's', 's', '_', 'e', 'm', 'p', 't', 'y')) { if (SvOK(v)) { if (SvTYPE(v) == SVt_IV) { opts->suppress_empty = SvIV(v); } else { opts->suppress_empty = XH_SUPPRESS_EMPTY_TO_STRING; } } else { opts->suppress_empty = XH_SUPPRESS_EMPTY_TO_UNDEF; } break; } default: goto error; } } if (use_attr != -1 && (opts->method == XH_METHOD_NATIVE || opts->method == XH_METHOD_NATIVE_ATTR_MODE)) { if (use_attr == TRUE) { opts->method = XH_METHOD_NATIVE_ATTR_MODE; } else { opts->method = XH_METHOD_NATIVE; } } return; error_value: croak("Invalid parameter value for '%s': %s", p, cv); return; error: croak("Invalid parameter '%s'", p); } void * xh_get_obj_param(xh_int_t *nparam, I32 ax, I32 items, char *class) { SV *param; void *obj = NULL; if (*nparam >= items) croak("Invalid parameters"); param = ST(*nparam); if ( sv_derived_from(param, class) ) { if ( sv_isobject(param) ) { /* reference to object */ IV tmp = SvIV((SV *) SvRV(param)); obj = INT2PTR(xh_opts_t *, tmp); } (*nparam)++; } return obj; } SV * xh_get_hash_param(xh_int_t *nparam, I32 ax, I32 items) { SV *param; if (*nparam >= items) croak("Invalid parameters"); param = ST(*nparam); if (!SvROK(param) || SvTYPE(SvRV(param)) != SVt_PVHV) croak("Parameter is not hash reference"); (*nparam)++; return param; } SV * xh_get_str_param(xh_int_t *nparam, I32 ax, I32 items) { SV *param; if (*nparam >= items) croak("Invalid parameters"); param = ST(*nparam); if (SvROK(param)) param = SvRV(param); if (!SvOK(param)) croak("Invalid parameters"); if (!SvPOK(param) && SvTYPE(param) != SVt_PVGV) croak("Invalid parameters"); (*nparam)++; return param; } void xh_merge_opts(xh_opts_t *ctx_opts, xh_opts_t *opts, xh_int_t nparam, I32 ax, I32 items) { if (opts == NULL) { /* read global options */ xh_init_opts(ctx_opts); } else { /* copy options from object */ xh_copy_opts(ctx_opts, opts); } if (nparam < items) { xh_parse_param(ctx_opts, nparam, ax, items); } } XML-Hash-XS-0.64/src/xh_sort.c0000644000175000017500000000130412455473142014464 0ustar yurayura#include "xh_config.h" #include "xh_core.h" static int xh_sort_hash_cmp(const void *p1, const void *p2) { return xh_strcmp(((xh_sort_hash_t *) p1)->key, ((xh_sort_hash_t *) p2)->key); } xh_sort_hash_t * xh_sort_hash(HV *hash, size_t len) { xh_sort_hash_t *sorted_hash; size_t i; sorted_hash = malloc(sizeof(xh_sort_hash_t) * len); if (sorted_hash == NULL) { croak("Memory allocation error"); } hv_iterinit(hash); for (i = 0; i < len; i++) { sorted_hash[i].value = hv_iternextsv(hash, (char **) &sorted_hash[i].key, &sorted_hash[i].key_len); } qsort(sorted_hash, len, sizeof(xh_sort_hash_t), xh_sort_hash_cmp); return sorted_hash; } XML-Hash-XS-0.64/src/xh_param.c0000644000175000017500000000334613325066767014615 0ustar yurayura#include "xh_config.h" #include "xh_core.h" void xh_param_assign_string(xh_char_t param[], SV *value) { xh_char_t *str; if ( SvOK(value) ) { str = XH_CHAR_CAST SvPV_nolen(value); xh_str_copy(param, str, XH_PARAM_LEN); } else { *param = 0; } } void xh_param_assign_int(xh_char_t *name, xh_int_t *param, SV *value) { if ( !SvOK(value) ) croak("Parameter '%s' is undefined", name); *param = SvIV(value); } xh_bool_t xh_param_assign_bool(SV *value) { if ( SvTRUE(value) ) return TRUE; return FALSE; } void xh_param_assign_pattern(xh_pattern_t *patt, SV *value) { if (patt->expr != NULL) { SvREFCNT_dec(patt->expr); patt->expr = NULL; } if ( SvOK(value) && SvTRUE(value) ) { patt->enable = TRUE; if ( SvRXOK(value) || (SvROK(value) && SvTYPE(SvRV(value)) == SVt_PVAV) ) { patt->always = FALSE; patt->expr = value; SvREFCNT_inc(value); } else { patt->always = TRUE; } } else { patt->enable = FALSE; } } void xh_param_assign_filter(xh_pattern_t *patt, SV *value) { if (patt->expr != NULL) { SvREFCNT_dec(patt->expr); patt->expr = NULL; } if ( SvOK(value) ) { patt->enable = TRUE; patt->always = FALSE; patt->expr = value; SvREFCNT_inc(value); } else { patt->enable = FALSE; } } SV * xh_param_assign_cb(char *name, SV *value) { if ( !SvOK(value) ) return NULL; if ( !SvROK(value) || SvTYPE(SvRV(value)) != SVt_PVCV) croak("Parameter '%s' is not CODE reference", name); value = SvRV(value); SvREFCNT_inc(value); return value; } XML-Hash-XS-0.64/src/ppport.h0000644000175000017500000052540612255124376014345 0ustar yurayura#if 0 <<'SKIP'; #endif /* ---------------------------------------------------------------------- ppport.h -- Perl/Pollution/Portability Version 3.19 Automatically created by Devel::PPPort running under perl 5.012004. 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.19 =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 unsupported API --api-info=name show Perl API portability information =head1 COMPATIBILITY This version of F is designed to support operation with Perl installations back to 5.003, and has been tested up to 5.10.0. =head1 OPTIONS =head2 --help Display a brief usage summary. =head2 --version Display the version of F. =head2 --patch=I 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 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 automagially 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 or a C program to be installed. =head2 --diff=I Manually set the diff program and options to use. The default is to use C, when installed, and output unified context diffs. =head2 --compat-version=I Tell F to check for compatibility with the given Perl version. The default is to check for compatibility with Perl version 5.003. You can use this option to reduce the output of F if you intend to be backward compatible only down to a certain Perl version. =head2 --cplusplus Usually, F will detect C++ style comments and replace them with C style comments for portability reasons. Using this option instructs F 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. This reduces the size of F dramatically and may be useful if you want to include F in smaller modules without increasing their distribution size too much. The stripped F will have a C<--unstrip> option that allows you to undo the stripping, but only if an appropriate C module is installed. =head2 --list-provided Lists the API elements for which compatibility is provided by F. 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 supported by F and below which version of Perl they probably won't be available or work. =head2 --api-info=I Show portability information for API elements matching I. If I is surrounded by slashes, it is interpreted as a regular expression. =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 prefix is deprecated. Also, some API functions used to have a C prefix. Using this form is also deprecated. You can safely use the supported API, as F will provide wrappers for older Perl versions. =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. These functions or variables will be marked C 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 or global variants. For a C 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 ----------------------------------------------------------------------------------------- PL_parser NEED_PL_parser NEED_PL_parser_GLOBAL PL_signals NEED_PL_signals NEED_PL_signals_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 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 newCONSTSUB() NEED_newCONSTSUB NEED_newCONSTSUB_GLOBAL newRV_noinc() NEED_newRV_noinc NEED_newRV_noinc_GLOBAL newSV_type() NEED_newSV_type NEED_newSV_type_GLOBAL newSVpvn_flags() NEED_newSVpvn_flags NEED_newSVpvn_flags_GLOBAL newSVpvn_share() NEED_newSVpvn_share NEED_newSVpvn_share_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_2pv_flags() NEED_sv_2pv_flags NEED_sv_2pv_flags_GLOBAL sv_2pvbyte() NEED_sv_2pvbyte NEED_sv_2pvbyte_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_pvn_force_flags() NEED_sv_pvn_force_flags NEED_sv_pvn_force_flags_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 vload_module() NEED_vload_module NEED_vload_module_GLOBAL vnewSVpvf() NEED_vnewSVpvf NEED_vnewSVpvf_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 macro. Just C<#define> the macro before including C: #define DPPP_NAMESPACE MyOwnNamespace_ #include "ppport.h" The default namespace is C. =back The good thing is that most of the above can be checked by running F on your source code. See the next section for details. =head1 EXAMPLES To verify whether F is needed for your module, whether you should make any changes to your code, and whether any special defines should be used, F 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 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 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 If this version of F is causing failure during the compilation of this module, please check if newer versions of either this module or C are available on CPAN before sending a bug report. If F was generated using the latest version of C and is causing failure of this module, please file a bug report using the CPAN Request Tracker at L. 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 module from CPAN. =head1 COPYRIGHT Version 3.x, Copyright (c) 2004-2009, 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. =cut use strict; # Disable broken TRIE-optimization BEGIN { eval '${^RE_TRIE_MAXBUF} = -1' if $] >= 5.009004 && $] <= 5.009005 } my $VERSION = 3.19; 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}; if (exists $opt{'compat-version'}) { my($r,$v,$s) = eval { parse_version($opt{'compat-version'}) }; if ($@) { die "Invalid version number format: '$opt{'compat-version'}'\n"; } die "Only Perl 5 is supported\n" if $r != 5; die "Invalid version number: $opt{'compat-version'}\n" if $v >= 1000 || $s >= 1000; $opt{'compat-version'} = sprintf "%d.%03d%03d", $r, $v, $s; } else { $opt{'compat-version'} = 5; } 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 ) : ()), } ) : die "invalid spec: $_" } qw( AvFILLp|5.004050||p AvFILL||| CLASS|||n CPERLscope|5.005000||p CX_CURPAD_SAVE||| CX_CURPAD_SV||| CopFILEAV|5.006000||p CopFILEGV_set|5.006000||p CopFILEGV|5.006000||p CopFILESV|5.006000||p CopFILE_set|5.006000||p CopFILE|5.006000||p CopSTASHPV_set|5.006000||p CopSTASHPV|5.006000||p CopSTASH_eq|5.006000||p CopSTASH_set|5.006000||p CopSTASH|5.006000||p CopyD|5.009002||p Copy||| CvPADLIST||| CvSTASH||| CvWEAKOUTSIDE||| DEFSV_set|5.011000||p DEFSV|5.004050||p END_EXTERN_C|5.005000||p ENTER||| ERRSV|5.004050||p EXTEND||| EXTERN_C|5.005000||p F0convert|||n FREETMPS||| GIMME_V||5.004000|n GIMME|||n GROK_NUMERIC_RADIX|5.007002||p G_ARRAY||| G_DISCARD||| G_EVAL||| G_METHOD|5.006001||p G_NOARGS||| G_SCALAR||| G_VOID||5.004000| GetVars||| GvSVn|5.009003||p GvSV||| Gv_AMupdate||| HEf_SVKEY||5.004000| HeHASH||5.004000| HeKEY||5.004000| HeKLEN||5.004000| HePV||5.004000| HeSVKEY_force||5.004000| HeSVKEY_set||5.004000| HeSVKEY||5.004000| HeUTF8||5.011000| HeVAL||5.004000| HvNAMELEN_get|5.009003||p HvNAME_get|5.009003||p HvNAME||| INT2PTR|5.006000||p IN_LOCALE_COMPILETIME|5.007002||p IN_LOCALE_RUNTIME|5.007002||p IN_LOCALE|5.007002||p IN_PERL_COMPILETIME|5.008001||p IS_NUMBER_GREATER_THAN_UV_MAX|5.007002||p IS_NUMBER_INFINITY|5.007002||p IS_NUMBER_IN_UV|5.007002||p IS_NUMBER_NAN|5.007003||p IS_NUMBER_NEG|5.007002||p IS_NUMBER_NOT_INT|5.007002||p IVSIZE|5.006000||p IVTYPE|5.006000||p IVdf|5.006000||p LEAVE||| LVRET||| MARK||| MULTICALL||5.011000| MY_CXT_CLONE|5.009002||p MY_CXT_INIT|5.007003||p MY_CXT|5.007003||p MoveD|5.009002||p Move||| NOOP|5.005000||p NUM2PTR|5.006000||p NVTYPE|5.006000||p NVef|5.006001||p NVff|5.006001||p NVgf|5.006001||p Newxc|5.009003||p Newxz|5.009003||p Newx|5.009003||p Nullav||| Nullch||| Nullcv||| Nullhv||| Nullsv||| ORIGMARK||| PAD_BASE_SV||| PAD_CLONE_VARS||| PAD_COMPNAME_FLAGS||| PAD_COMPNAME_GEN_set||| PAD_COMPNAME_GEN||| PAD_COMPNAME_OURSTASH||| PAD_COMPNAME_PV||| PAD_COMPNAME_TYPE||| PAD_DUP||| PAD_RESTORE_LOCAL||| PAD_SAVE_LOCAL||| PAD_SAVE_SETNULLPAD||| PAD_SETSV||| PAD_SET_CUR_NOSAVE||| PAD_SET_CUR||| PAD_SVl||| PAD_SV||| PERLIO_FUNCS_CAST|5.009003||p PERLIO_FUNCS_DECL|5.009003||p PERL_ABS|5.008001||p PERL_BCDVERSION|5.011000||p PERL_GCC_BRACE_GROUPS_FORBIDDEN|5.008001||p PERL_HASH|5.004000||p PERL_INT_MAX|5.004000||p PERL_INT_MIN|5.004000||p PERL_LONG_MAX|5.004000||p PERL_LONG_MIN|5.004000||p PERL_MAGIC_arylen|5.007002||p PERL_MAGIC_backref|5.007002||p PERL_MAGIC_bm|5.007002||p PERL_MAGIC_collxfrm|5.007002||p PERL_MAGIC_dbfile|5.007002||p PERL_MAGIC_dbline|5.007002||p PERL_MAGIC_defelem|5.007002||p PERL_MAGIC_envelem|5.007002||p PERL_MAGIC_env|5.007002||p PERL_MAGIC_ext|5.007002||p PERL_MAGIC_fm|5.007002||p PERL_MAGIC_glob|5.011000||p PERL_MAGIC_isaelem|5.007002||p PERL_MAGIC_isa|5.007002||p PERL_MAGIC_mutex|5.011000||p PERL_MAGIC_nkeys|5.007002||p PERL_MAGIC_overload_elem|5.007002||p PERL_MAGIC_overload_table|5.007002||p PERL_MAGIC_overload|5.007002||p PERL_MAGIC_pos|5.007002||p PERL_MAGIC_qr|5.007002||p PERL_MAGIC_regdata|5.007002||p PERL_MAGIC_regdatum|5.007002||p PERL_MAGIC_regex_global|5.007002||p PERL_MAGIC_shared_scalar|5.007003||p PERL_MAGIC_shared|5.007003||p PERL_MAGIC_sigelem|5.007002||p PERL_MAGIC_sig|5.007002||p PERL_MAGIC_substr|5.007002||p PERL_MAGIC_sv|5.007002||p PERL_MAGIC_taint|5.007002||p PERL_MAGIC_tiedelem|5.007002||p PERL_MAGIC_tiedscalar|5.007002||p PERL_MAGIC_tied|5.007002||p PERL_MAGIC_utf8|5.008001||p PERL_MAGIC_uvar_elem|5.007003||p PERL_MAGIC_uvar|5.007002||p PERL_MAGIC_vec|5.007002||p PERL_MAGIC_vstring|5.008001||p PERL_PV_ESCAPE_ALL|5.009004||p PERL_PV_ESCAPE_FIRSTCHAR|5.009004||p PERL_PV_ESCAPE_NOBACKSLASH|5.009004||p PERL_PV_ESCAPE_NOCLEAR|5.009004||p PERL_PV_ESCAPE_QUOTE|5.009004||p PERL_PV_ESCAPE_RE|5.009005||p PERL_PV_ESCAPE_UNI_DETECT|5.009004||p PERL_PV_ESCAPE_UNI|5.009004||p PERL_PV_PRETTY_DUMP|5.009004||p PERL_PV_PRETTY_ELLIPSES|5.010000||p PERL_PV_PRETTY_LTGT|5.009004||p PERL_PV_PRETTY_NOCLEAR|5.010000||p PERL_PV_PRETTY_QUOTE|5.009004||p PERL_PV_PRETTY_REGPROP|5.009004||p PERL_QUAD_MAX|5.004000||p PERL_QUAD_MIN|5.004000||p PERL_REVISION|5.006000||p PERL_SCAN_ALLOW_UNDERSCORES|5.007003||p PERL_SCAN_DISALLOW_PREFIX|5.007003||p PERL_SCAN_GREATER_THAN_UV_MAX|5.007003||p PERL_SCAN_SILENT_ILLDIGIT|5.008001||p PERL_SHORT_MAX|5.004000||p PERL_SHORT_MIN|5.004000||p PERL_SIGNALS_UNSAFE_FLAG|5.008001||p PERL_SUBVERSION|5.006000||p PERL_SYS_INIT3||5.006000| PERL_SYS_INIT||| PERL_SYS_TERM||5.011000| PERL_UCHAR_MAX|5.004000||p PERL_UCHAR_MIN|5.004000||p PERL_UINT_MAX|5.004000||p PERL_UINT_MIN|5.004000||p PERL_ULONG_MAX|5.004000||p PERL_ULONG_MIN|5.004000||p PERL_UNUSED_ARG|5.009003||p PERL_UNUSED_CONTEXT|5.009004||p PERL_UNUSED_DECL|5.007002||p PERL_UNUSED_VAR|5.007002||p PERL_UQUAD_MAX|5.004000||p PERL_UQUAD_MIN|5.004000||p PERL_USE_GCC_BRACE_GROUPS|5.009004||p PERL_USHORT_MAX|5.004000||p PERL_USHORT_MIN|5.004000||p PERL_VERSION|5.006000||p PL_DBsignal|5.005000||p PL_DBsingle|||pn PL_DBsub|||pn PL_DBtrace|||pn PL_Sv|5.005000||p PL_bufend|5.011000||p PL_bufptr|5.011000||p PL_compiling|5.004050||p PL_copline|5.011000||p PL_curcop|5.004050||p PL_curstash|5.004050||p PL_debstash|5.004050||p PL_defgv|5.004050||p PL_diehook|5.004050||p PL_dirty|5.004050||p PL_dowarn|||pn PL_errgv|5.004050||p PL_error_count|5.011000||p PL_expect|5.011000||p PL_hexdigit|5.005000||p PL_hints|5.005000||p PL_in_my_stash|5.011000||p PL_in_my|5.011000||p PL_last_in_gv|||n PL_laststatval|5.005000||p PL_lex_state|5.011000||p PL_lex_stuff|5.011000||p PL_linestr|5.011000||p PL_modglobal||5.005000|n PL_na|5.004050||pn PL_no_modify|5.006000||p PL_ofsgv|||n PL_parser|5.009005||p PL_perl_destruct_level|5.004050||p PL_perldb|5.004050||p PL_ppaddr|5.006000||p PL_rsfp_filters|5.004050||p PL_rsfp|5.004050||p PL_rs|||n PL_signals|5.008001||p PL_stack_base|5.004050||p PL_stack_sp|5.004050||p PL_statcache|5.005000||p PL_stdingv|5.004050||p PL_sv_arenaroot|5.004050||p PL_sv_no|5.004050||pn PL_sv_undef|5.004050||pn PL_sv_yes|5.004050||pn PL_tainted|5.004050||p PL_tainting|5.004050||p PL_tokenbuf|5.011000||p POP_MULTICALL||5.011000| POPi|||n POPl|||n POPn|||n POPpbytex||5.007001|n POPpx||5.005030|n POPp|||n POPs|||n PTR2IV|5.006000||p PTR2NV|5.006000||p PTR2UV|5.006000||p PTR2nat|5.009003||p PTR2ul|5.007001||p PTRV|5.006000||p PUSHMARK||| PUSH_MULTICALL||5.011000| PUSHi||| PUSHmortal|5.009002||p PUSHn||| PUSHp||| PUSHs||| PUSHu|5.004000||p PUTBACK||| PerlIO_clearerr||5.007003| PerlIO_close||5.007003| PerlIO_context_layers||5.009004| PerlIO_eof||5.007003| PerlIO_error||5.007003| PerlIO_fileno||5.007003| PerlIO_fill||5.007003| PerlIO_flush||5.007003| PerlIO_get_base||5.007003| PerlIO_get_bufsiz||5.007003| PerlIO_get_cnt||5.007003| PerlIO_get_ptr||5.007003| PerlIO_read||5.007003| PerlIO_seek||5.007003| PerlIO_set_cnt||5.007003| PerlIO_set_ptrcnt||5.007003| PerlIO_setlinebuf||5.007003| PerlIO_stderr||5.007003| PerlIO_stdin||5.007003| PerlIO_stdout||5.007003| PerlIO_tell||5.007003| PerlIO_unread||5.007003| PerlIO_write||5.007003| Perl_signbit||5.009005|n PoisonFree|5.009004||p PoisonNew|5.009004||p PoisonWith|5.009004||p Poison|5.008000||p RETVAL|||n Renewc||| Renew||| SAVECLEARSV||| SAVECOMPPAD||| SAVEPADSV||| SAVETMPS||| SAVE_DEFSV|5.004050||p SPAGAIN||| SP||| START_EXTERN_C|5.005000||p START_MY_CXT|5.007003||p STMT_END|||p STMT_START|||p STR_WITH_LEN|5.009003||p ST||| SV_CONST_RETURN|5.009003||p SV_COW_DROP_PV|5.008001||p SV_COW_SHARED_HASH_KEYS|5.009005||p SV_GMAGIC|5.007002||p SV_HAS_TRAILING_NUL|5.009004||p SV_IMMEDIATE_UNREF|5.007001||p SV_MUTABLE_RETURN|5.009003||p SV_NOSTEAL|5.009002||p SV_SMAGIC|5.009003||p SV_UTF8_NO_ENCODING|5.008001||p SVfARG|5.009005||p SVf_UTF8|5.006000||p SVf|5.006000||p SVt_IV||| SVt_NV||| SVt_PVAV||| SVt_PVCV||| SVt_PVHV||| SVt_PVMG||| SVt_PV||| Safefree||| Slab_Alloc||| Slab_Free||| Slab_to_rw||| StructCopy||| SvCUR_set||| SvCUR||| SvEND||| SvGAMAGIC||5.006001| SvGETMAGIC|5.004050||p SvGROW||| SvIOK_UV||5.006000| SvIOK_notUV||5.006000| SvIOK_off||| SvIOK_only_UV||5.006000| SvIOK_only||| SvIOK_on||| SvIOKp||| SvIOK||| SvIVX||| SvIV_nomg|5.009001||p SvIV_set||| SvIVx||| SvIV||| SvIsCOW_shared_hash||5.008003| SvIsCOW||5.008003| SvLEN_set||| SvLEN||| SvLOCK||5.007003| SvMAGIC_set|5.009003||p SvNIOK_off||| SvNIOKp||| SvNIOK||| SvNOK_off||| SvNOK_only||| SvNOK_on||| SvNOKp||| SvNOK||| SvNVX||| SvNV_set||| SvNVx||| SvNV||| SvOK||| SvOOK_offset||5.011000| SvOOK||| SvPOK_off||| SvPOK_only_UTF8||5.006000| SvPOK_only||| SvPOK_on||| SvPOKp||| SvPOK||| SvPVX_const|5.009003||p SvPVX_mutable|5.009003||p SvPVX||| SvPV_const|5.009003||p SvPV_flags_const_nolen|5.009003||p SvPV_flags_const|5.009003||p SvPV_flags_mutable|5.009003||p SvPV_flags|5.007002||p SvPV_force_flags_mutable|5.009003||p SvPV_force_flags_nolen|5.009003||p SvPV_force_flags|5.007002||p SvPV_force_mutable|5.009003||p SvPV_force_nolen|5.009003||p SvPV_force_nomg_nolen|5.009003||p SvPV_force_nomg|5.007002||p SvPV_force|||p SvPV_mutable|5.009003||p SvPV_nolen_const|5.009003||p SvPV_nolen|5.006000||p SvPV_nomg_const_nolen|5.009003||p SvPV_nomg_const|5.009003||p SvPV_nomg|5.007002||p SvPV_renew|5.009003||p SvPV_set||| SvPVbyte_force||5.009002| SvPVbyte_nolen||5.006000| SvPVbytex_force||5.006000| SvPVbytex||5.006000| SvPVbyte|5.006000||p SvPVutf8_force||5.006000| SvPVutf8_nolen||5.006000| SvPVutf8x_force||5.006000| SvPVutf8x||5.006000| SvPVutf8||5.006000| SvPVx||| SvPV||| SvREFCNT_dec||| SvREFCNT_inc_NN|5.009004||p SvREFCNT_inc_simple_NN|5.009004||p SvREFCNT_inc_simple_void_NN|5.009004||p SvREFCNT_inc_simple_void|5.009004||p SvREFCNT_inc_simple|5.009004||p SvREFCNT_inc_void_NN|5.009004||p SvREFCNT_inc_void|5.009004||p SvREFCNT_inc|||p SvREFCNT||| SvROK_off||| SvROK_on||| SvROK||| SvRV_set|5.009003||p SvRV||| SvRXOK||5.009005| SvRX||5.009005| SvSETMAGIC||| SvSHARED_HASH|5.009003||p SvSHARE||5.007003| SvSTASH_set|5.009003||p SvSTASH||| SvSetMagicSV_nosteal||5.004000| SvSetMagicSV||5.004000| SvSetSV_nosteal||5.004000| SvSetSV||| SvTAINTED_off||5.004000| SvTAINTED_on||5.004000| SvTAINTED||5.004000| SvTAINT||| SvTRUE||| SvTYPE||| SvUNLOCK||5.007003| SvUOK|5.007001|5.006000|p SvUPGRADE||| SvUTF8_off||5.006000| SvUTF8_on||5.006000| SvUTF8||5.006000| SvUVXx|5.004000||p SvUVX|5.004000||p SvUV_nomg|5.009001||p SvUV_set|5.009003||p SvUVx|5.004000||p SvUV|5.004000||p SvVOK||5.008001| SvVSTRING_mg|5.009004||p THIS|||n UNDERBAR|5.009002||p UTF8_MAXBYTES|5.009002||p UVSIZE|5.006000||p UVTYPE|5.006000||p UVXf|5.007001||p UVof|5.006000||p UVuf|5.006000||p UVxf|5.006000||p WARN_ALL|5.006000||p WARN_AMBIGUOUS|5.006000||p WARN_ASSERTIONS|5.011000||p WARN_BAREWORD|5.006000||p WARN_CLOSED|5.006000||p WARN_CLOSURE|5.006000||p WARN_DEBUGGING|5.006000||p WARN_DEPRECATED|5.006000||p WARN_DIGIT|5.006000||p WARN_EXEC|5.006000||p WARN_EXITING|5.006000||p WARN_GLOB|5.006000||p WARN_INPLACE|5.006000||p WARN_INTERNAL|5.006000||p WARN_IO|5.006000||p WARN_LAYER|5.008000||p WARN_MALLOC|5.006000||p WARN_MISC|5.006000||p WARN_NEWLINE|5.006000||p WARN_NUMERIC|5.006000||p WARN_ONCE|5.006000||p WARN_OVERFLOW|5.006000||p WARN_PACK|5.006000||p WARN_PARENTHESIS|5.006000||p WARN_PIPE|5.006000||p WARN_PORTABLE|5.006000||p WARN_PRECEDENCE|5.006000||p WARN_PRINTF|5.006000||p WARN_PROTOTYPE|5.006000||p WARN_QW|5.006000||p WARN_RECURSION|5.006000||p WARN_REDEFINE|5.006000||p WARN_REGEXP|5.006000||p WARN_RESERVED|5.006000||p WARN_SEMICOLON|5.006000||p WARN_SEVERE|5.006000||p WARN_SIGNAL|5.006000||p WARN_SUBSTR|5.006000||p WARN_SYNTAX|5.006000||p WARN_TAINT|5.006000||p WARN_THREADS|5.008000||p WARN_UNINITIALIZED|5.006000||p WARN_UNOPENED|5.006000||p WARN_UNPACK|5.006000||p WARN_UNTIE|5.006000||p WARN_UTF8|5.006000||p WARN_VOID|5.006000||p XCPT_CATCH|5.009002||p XCPT_RETHROW|5.009002||p XCPT_TRY_END|5.009002||p XCPT_TRY_START|5.009002||p XPUSHi||| XPUSHmortal|5.009002||p XPUSHn||| XPUSHp||| XPUSHs||| XPUSHu|5.004000||p XSPROTO|5.010000||p XSRETURN_EMPTY||| XSRETURN_IV||| XSRETURN_NO||| XSRETURN_NV||| XSRETURN_PV||| XSRETURN_UNDEF||| XSRETURN_UV|5.008001||p XSRETURN_YES||| XSRETURN|||p XST_mIV||| XST_mNO||| XST_mNV||| XST_mPV||| XST_mUNDEF||| XST_mUV|5.008001||p XST_mYES||| XS_VERSION_BOOTCHECK||| XS_VERSION||| XSprePUSH|5.006000||p XS||| ZeroD|5.009002||p Zero||| _aMY_CXT|5.007003||p _pMY_CXT|5.007003||p aMY_CXT_|5.007003||p aMY_CXT|5.007003||p aTHXR_|5.011000||p aTHXR|5.011000||p aTHX_|5.006000||p aTHX|5.006000||p add_data|||n addmad||| allocmy||| amagic_call||| amagic_cmp_locale||| amagic_cmp||| amagic_i_ncmp||| amagic_ncmp||| any_dup||| ao||| append_elem||| append_list||| append_madprops||| apply_attrs_my||| apply_attrs_string||5.006001| apply_attrs||| apply||| atfork_lock||5.007003|n atfork_unlock||5.007003|n av_arylen_p||5.009003| av_clear||| av_create_and_push||5.009005| av_create_and_unshift_one||5.009005| av_delete||5.006000| av_exists||5.006000| av_extend||| av_fetch||| av_fill||| av_iter_p||5.011000| av_len||| av_make||| av_pop||| av_push||| av_reify||| av_shift||| av_store||| av_undef||| av_unshift||| ax|||n bad_type||| bind_match||| block_end||| block_gimme||5.004000| block_start||| boolSV|5.004000||p boot_core_PerlIO||| boot_core_UNIVERSAL||| boot_core_mro||| bytes_from_utf8||5.007001| bytes_to_uni|||n bytes_to_utf8||5.006001| call_argv|5.006000||p call_atexit||5.006000| call_list||5.004000| call_method|5.006000||p call_pv|5.006000||p call_sv|5.006000||p calloc||5.007002|n cando||| cast_i32||5.006000| cast_iv||5.006000| cast_ulong||5.006000| cast_uv||5.006000| check_type_and_open||| check_uni||| checkcomma||| checkposixcc||| ckWARN|5.006000||p ck_anoncode||| ck_bitop||| ck_concat||| ck_defined||| ck_delete||| ck_die||| ck_each||| ck_eof||| ck_eval||| ck_exec||| ck_exists||| ck_exit||| ck_ftst||| ck_fun||| ck_glob||| ck_grep||| ck_index||| ck_join||| ck_lfun||| ck_listiob||| ck_match||| ck_method||| ck_null||| ck_open||| ck_readline||| ck_repeat||| ck_require||| ck_return||| ck_rfun||| ck_rvconst||| ck_sassign||| ck_select||| ck_shift||| ck_sort||| ck_spair||| ck_split||| ck_subr||| ck_substr||| ck_svconst||| ck_trunc||| ck_unpack||| ckwarn_d||5.009003| ckwarn||5.009003| cl_and|||n cl_anything|||n cl_init_zero|||n cl_init|||n cl_is_anything|||n cl_or|||n clear_placeholders||| closest_cop||| convert||| cop_free||| cr_textfilter||| create_eval_scope||| croak_nocontext|||vn croak_xs_usage||5.011000| croak|||v csighandler||5.009003|n curmad||| custom_op_desc||5.007003| custom_op_name||5.007003| cv_ckproto_len||| cv_clone||| cv_const_sv||5.004000| cv_dump||| cv_undef||| cx_dump||5.005000| cx_dup||| cxinc||| dAXMARK|5.009003||p dAX|5.007002||p dITEMS|5.007002||p dMARK||| dMULTICALL||5.009003| dMY_CXT_SV|5.007003||p dMY_CXT|5.007003||p dNOOP|5.006000||p dORIGMARK||| dSP||| dTHR|5.004050||p dTHXR|5.011000||p dTHXa|5.006000||p dTHXoa|5.006000||p dTHX|5.006000||p dUNDERBAR|5.009002||p dVAR|5.009003||p dXCPT|5.009002||p dXSARGS||| dXSI32||| dXSTARG|5.006000||p deb_curcv||| deb_nocontext|||vn deb_stack_all||| deb_stack_n||| debop||5.005000| debprofdump||5.005000| debprof||| debstackptrs||5.007003| debstack||5.007003| debug_start_match||| deb||5.007003|v del_sv||| delete_eval_scope||| delimcpy||5.004000| deprecate_old||| deprecate||| despatch_signals||5.007001| destroy_matcher||| die_nocontext|||vn die_where||| die|||v dirp_dup||| div128||| djSP||| do_aexec5||| do_aexec||| do_aspawn||| do_binmode||5.004050| do_chomp||| do_chop||| do_close||| do_dump_pad||| do_eof||| do_exec3||| do_execfree||| do_exec||| do_gv_dump||5.006000| do_gvgv_dump||5.006000| do_hv_dump||5.006000| do_ipcctl||| do_ipcget||| do_join||| do_kv||| do_magic_dump||5.006000| do_msgrcv||| do_msgsnd||| do_oddball||| do_op_dump||5.006000| do_op_xmldump||| do_open9||5.006000| do_openn||5.007001| do_open||5.004000| do_pmop_dump||5.006000| do_pmop_xmldump||| do_print||| do_readline||| do_seek||| do_semop||| do_shmio||| do_smartmatch||| do_spawn_nowait||| do_spawn||| do_sprintf||| do_sv_dump||5.006000| do_sysseek||| do_tell||| do_trans_complex_utf8||| do_trans_complex||| do_trans_count_utf8||| do_trans_count||| do_trans_simple_utf8||| do_trans_simple||| do_trans||| do_vecget||| do_vecset||| do_vop||| docatch||| doeval||| dofile||| dofindlabel||| doform||| doing_taint||5.008001|n dooneliner||| doopen_pm||| doparseform||| dopoptoeval||| dopoptogiven||| dopoptolabel||| dopoptoloop||| dopoptosub_at||| dopoptowhen||| doref||5.009003| dounwind||| dowantarray||| dump_all||5.006000| dump_eval||5.006000| dump_exec_pos||| dump_fds||| dump_form||5.006000| dump_indent||5.006000|v dump_mstats||| dump_packsubs||5.006000| dump_sub||5.006000| dump_sv_child||| dump_trie_interim_list||| dump_trie_interim_table||| dump_trie||| dump_vindent||5.006000| dumpuntil||| dup_attrlist||| emulate_cop_io||| eval_pv|5.006000||p eval_sv|5.006000||p exec_failed||| expect_number||| fbm_compile||5.005000| fbm_instr||5.005000| feature_is_enabled||| fetch_cop_label||5.011000| filter_add||| filter_del||| filter_gets||| filter_read||| find_and_forget_pmops||| find_array_subscript||| find_beginning||| find_byclass||| find_hash_subscript||| find_in_my_stash||| find_runcv||5.008001| find_rundefsvoffset||5.009002| find_script||| find_uninit_var||| first_symbol|||n fold_constants||| forbid_setid||| force_ident||| force_list||| force_next||| force_version||| force_word||| forget_pmop||| form_nocontext|||vn form||5.004000|v fp_dup||| fprintf_nocontext|||vn free_global_struct||| free_tied_hv_pool||| free_tmps||| gen_constant_list||| get_arena||| get_aux_mg||| get_av|5.006000||p get_context||5.006000|n get_cvn_flags||5.009005| get_cv|5.006000||p get_db_sub||| get_debug_opts||| get_hash_seed||| get_hv|5.006000||p get_isa_hash||| get_mstats||| get_no_modify||| get_num||| get_op_descs||5.005000| get_op_names||5.005000| get_opargs||| get_ppaddr||5.006000| get_re_arg||| get_sv|5.006000||p get_vtbl||5.005030| getcwd_sv||5.007002| getenv_len||| glob_2number||| glob_assign_glob||| glob_assign_ref||| gp_dup||| gp_free||| gp_ref||| grok_bin|5.007003||p grok_hex|5.007003||p grok_number|5.007002||p grok_numeric_radix|5.007002||p grok_oct|5.007003||p group_end||| gv_AVadd||| gv_HVadd||| gv_IOadd||| gv_SVadd||| gv_autoload4||5.004000| gv_check||| gv_const_sv||5.009003| gv_dump||5.006000| gv_efullname3||5.004000| gv_efullname4||5.006001| gv_efullname||| gv_ename||| gv_fetchfile_flags||5.009005| gv_fetchfile||| gv_fetchmeth_autoload||5.007003| gv_fetchmethod_autoload||5.004000| gv_fetchmethod_flags||5.011000| gv_fetchmethod||| gv_fetchmeth||| gv_fetchpvn_flags|5.009002||p gv_fetchpvs|5.009004||p gv_fetchpv||| gv_fetchsv||5.009002| gv_fullname3||5.004000| gv_fullname4||5.006001| gv_fullname||| gv_get_super_pkg||| gv_handler||5.007001| gv_init_sv||| gv_init||| gv_name_set||5.009004| gv_stashpvn|5.004000||p gv_stashpvs|5.009003||p gv_stashpv||| gv_stashsv||| he_dup||| hek_dup||| hfreeentries||| hsplit||| hv_assert||5.011000| hv_auxinit|||n hv_backreferences_p||| hv_clear_placeholders||5.009001| hv_clear||| hv_common_key_len||5.010000| hv_common||5.010000| hv_copy_hints_hv||| hv_delayfree_ent||5.004000| hv_delete_common||| hv_delete_ent||5.004000| hv_delete||| hv_eiter_p||5.009003| hv_eiter_set||5.009003| hv_exists_ent||5.004000| hv_exists||| hv_fetch_ent||5.004000| hv_fetchs|5.009003||p hv_fetch||| hv_free_ent||5.004000| hv_iterinit||| hv_iterkeysv||5.004000| hv_iterkey||| hv_iternext_flags||5.008000| hv_iternextsv||| hv_iternext||| hv_iterval||| hv_kill_backrefs||| hv_ksplit||5.004000| hv_magic_check|||n hv_magic||| hv_name_set||5.009003| hv_notallowed||| hv_placeholders_get||5.009003| hv_placeholders_p||5.009003| hv_placeholders_set||5.009003| hv_riter_p||5.009003| hv_riter_set||5.009003| hv_scalar||5.009001| hv_store_ent||5.004000| hv_store_flags||5.008000| hv_stores|5.009004||p hv_store||| hv_undef||| ibcmp_locale||5.004000| ibcmp_utf8||5.007003| ibcmp||| incline||| incpush_if_exists||| incpush_use_sep||| incpush||| ingroup||| init_argv_symbols||| init_debugger||| init_global_struct||| init_i18nl10n||5.006000| init_i18nl14n||5.006000| init_ids||| init_interp||| init_main_stash||| init_perllib||| init_postdump_symbols||| init_predump_symbols||| init_stacks||5.005000| init_tm||5.007002| instr||| intro_my||| intuit_method||| intuit_more||| invert||| io_close||| isALNUMC|5.006000||p isALNUM||| isALPHA||| isASCII|5.006000||p isBLANK|5.006001||p isCNTRL|5.006000||p isDIGIT||| isGRAPH|5.006000||p isGV_with_GP|5.009004||p isLOWER||| isPRINT|5.004000||p isPSXSPC|5.006001||p isPUNCT|5.006000||p isSPACE||| isUPPER||| isXDIGIT|5.006000||p is_an_int||| is_gv_magical_sv||| is_handle_constructor|||n is_list_assignment||| is_lvalue_sub||5.007001| is_uni_alnum_lc||5.006000| is_uni_alnumc_lc||5.006000| is_uni_alnumc||5.006000| is_uni_alnum||5.006000| is_uni_alpha_lc||5.006000| is_uni_alpha||5.006000| is_uni_ascii_lc||5.006000| is_uni_ascii||5.006000| is_uni_cntrl_lc||5.006000| is_uni_cntrl||5.006000| is_uni_digit_lc||5.006000| is_uni_digit||5.006000| is_uni_graph_lc||5.006000| is_uni_graph||5.006000| is_uni_idfirst_lc||5.006000| is_uni_idfirst||5.006000| is_uni_lower_lc||5.006000| is_uni_lower||5.006000| is_uni_print_lc||5.006000| is_uni_print||5.006000| is_uni_punct_lc||5.006000| is_uni_punct||5.006000| is_uni_space_lc||5.006000| is_uni_space||5.006000| is_uni_upper_lc||5.006000| is_uni_upper||5.006000| is_uni_xdigit_lc||5.006000| is_uni_xdigit||5.006000| is_utf8_alnumc||5.006000| is_utf8_alnum||5.006000| is_utf8_alpha||5.006000| is_utf8_ascii||5.006000| is_utf8_char_slow|||n is_utf8_char||5.006000| is_utf8_cntrl||5.006000| is_utf8_common||| is_utf8_digit||5.006000| is_utf8_graph||5.006000| is_utf8_idcont||5.008000| is_utf8_idfirst||5.006000| is_utf8_lower||5.006000| is_utf8_mark||5.006000| is_utf8_print||5.006000| is_utf8_punct||5.006000| is_utf8_space||5.006000| is_utf8_string_loclen||5.009003| is_utf8_string_loc||5.008001| is_utf8_string||5.006001| is_utf8_upper||5.006000| is_utf8_xdigit||5.006000| isa_lookup||| items|||n ix|||n jmaybe||| join_exact||| keyword||| leave_scope||| lex_end||| lex_start||| linklist||| listkids||| list||| load_module_nocontext|||vn load_module|5.006000||pv localize||| looks_like_bool||| looks_like_number||| lop||| mPUSHi|5.009002||p mPUSHn|5.009002||p mPUSHp|5.009002||p mPUSHs|5.011000||p mPUSHu|5.009002||p mXPUSHi|5.009002||p mXPUSHn|5.009002||p mXPUSHp|5.009002||p mXPUSHs|5.011000||p mXPUSHu|5.009002||p mad_free||| madlex||| madparse||| magic_clear_all_env||| magic_clearenv||| magic_clearhint||| magic_clearisa||| magic_clearpack||| magic_clearsig||| magic_dump||5.006000| magic_existspack||| magic_freearylen_p||| magic_freeovrld||| magic_getarylen||| magic_getdefelem||| magic_getnkeys||| magic_getpack||| magic_getpos||| magic_getsig||| magic_getsubstr||| magic_gettaint||| magic_getuvar||| magic_getvec||| magic_get||| magic_killbackrefs||| magic_len||| magic_methcall||| magic_methpack||| magic_nextpack||| magic_regdata_cnt||| magic_regdatum_get||| magic_regdatum_set||| magic_scalarpack||| magic_set_all_env||| magic_setamagic||| magic_setarylen||| magic_setcollxfrm||| magic_setdbline||| magic_setdefelem||| magic_setenv||| magic_sethint||| magic_setisa||| magic_setmglob||| magic_setnkeys||| magic_setpack||| magic_setpos||| magic_setregexp||| magic_setsig||| magic_setsubstr||| magic_settaint||| magic_setutf8||| magic_setuvar||| magic_setvec||| magic_set||| magic_sizepack||| magic_wipepack||| make_matcher||| make_trie_failtable||| make_trie||| malloc_good_size|||n malloced_size|||n malloc||5.007002|n markstack_grow||| matcher_matches_sv||| measure_struct||| memEQ|5.004000||p memNE|5.004000||p mem_collxfrm||| mem_log_common|||n mess_alloc||| mess_nocontext|||vn mess||5.006000|v method_common||| mfree||5.007002|n mg_clear||| mg_copy||| mg_dup||| mg_find||| mg_free||| mg_get||| mg_length||5.005000| mg_localize||| mg_magical||| mg_set||| mg_size||5.005000| mini_mktime||5.007002| missingterm||| mode_from_discipline||| modkids||| mod||| more_bodies||| more_sv||| moreswitches||| mro_get_from_name||5.011000| mro_get_linear_isa_dfs||| mro_get_linear_isa||5.009005| mro_get_private_data||5.011000| mro_isa_changed_in||| mro_meta_dup||| mro_meta_init||| mro_method_changed_in||5.009005| mro_register||5.011000| mro_set_mro||5.011000| mro_set_private_data||5.011000| mul128||| mulexp10|||n my_atof2||5.007002| my_atof||5.006000| my_attrs||| my_bcopy|||n my_betoh16|||n my_betoh32|||n my_betoh64|||n my_betohi|||n my_betohl|||n my_betohs|||n my_bzero|||n my_chsize||| my_clearenv||| my_cxt_index||| my_cxt_init||| my_dirfd||5.009005| my_exit_jump||| my_exit||| my_failure_exit||5.004000| my_fflush_all||5.006000| my_fork||5.007003|n my_htobe16|||n my_htobe32|||n my_htobe64|||n my_htobei|||n my_htobel|||n my_htobes|||n my_htole16|||n my_htole32|||n my_htole64|||n my_htolei|||n my_htolel|||n my_htoles|||n my_htonl||| my_kid||| my_letoh16|||n my_letoh32|||n my_letoh64|||n my_letohi|||n my_letohl|||n my_letohs|||n my_lstat||| my_memcmp||5.004000|n my_memset|||n my_ntohl||| my_pclose||5.004000| my_popen_list||5.007001| my_popen||5.004000| my_setenv||| my_snprintf|5.009004||pvn my_socketpair||5.007003|n my_sprintf|5.009003||pvn my_stat||| my_strftime||5.007002| my_strlcat|5.009004||pn my_strlcpy|5.009004||pn my_swabn|||n my_swap||| my_unexec||| my_vsnprintf||5.009004|n need_utf8|||n newANONATTRSUB||5.006000| newANONHASH||| newANONLIST||| newANONSUB||| newASSIGNOP||| newATTRSUB||5.006000| newAVREF||| newAV||| newBINOP||| newCONDOP||| newCONSTSUB|5.004050||p newCVREF||| newDEFSVOP||| newFORM||| newFOROP||| newGIVENOP||5.009003| newGIVWHENOP||| newGP||| newGVOP||| newGVREF||| newGVgen||| newHVREF||| newHVhv||5.005000| newHV||| newIO||| newLISTOP||| newLOGOP||| newLOOPEX||| newLOOPOP||| newMADPROP||| newMADsv||| newMYSUB||| newNULLLIST||| newOP||| newPADOP||| newPMOP||| newPROG||| newPVOP||| newRANGE||| newRV_inc|5.004000||p newRV_noinc|5.004000||p newRV||| newSLICEOP||| newSTATEOP||| newSUB||| newSVOP||| newSVREF||| newSV_type|5.009005||p newSVhek||5.009003| newSViv||| newSVnv||| newSVpvf_nocontext|||vn newSVpvf||5.004000|v newSVpvn_flags|5.011000||p newSVpvn_share|5.007001||p newSVpvn_utf8|5.011000||p newSVpvn|5.004050||p newSVpvs_flags|5.011000||p newSVpvs_share||5.009003| newSVpvs|5.009003||p newSVpv||| newSVrv||| newSVsv||| newSVuv|5.006000||p newSV||| newTOKEN||| newUNOP||| newWHENOP||5.009003| newWHILEOP||5.009003| newXS_flags||5.009004| newXSproto||5.006000| newXS||5.006000| new_collate||5.006000| new_constant||| new_ctype||5.006000| new_he||| new_logop||| new_numeric||5.006000| new_stackinfo||5.005000| new_version||5.009000| new_warnings_bitfield||| next_symbol||| nextargv||| nextchar||| ninstr||| no_bareword_allowed||| no_fh_allowed||| no_op||| not_a_number||| nothreadhook||5.008000| nuke_stacks||| num_overflow|||n offer_nice_chunk||| oopsAV||| oopsHV||| op_clear||| op_const_sv||| op_dump||5.006000| op_free||| op_getmad_weak||| op_getmad||| op_null||5.007002| op_refcnt_dec||| op_refcnt_inc||| op_refcnt_lock||5.009002| op_refcnt_unlock||5.009002| op_xmldump||| open_script||| pMY_CXT_|5.007003||p pMY_CXT|5.007003||p pTHX_|5.006000||p pTHX|5.006000||p packWARN|5.007003||p pack_cat||5.007003| pack_rec||| package||| packlist||5.008001| pad_add_anon||| pad_add_name||| pad_alloc||| pad_block_start||| pad_check_dup||| pad_compname_type||| pad_findlex||| pad_findmy||| pad_fixup_inner_anons||| pad_free||| pad_leavemy||| pad_new||| pad_peg|||n pad_push||| pad_reset||| pad_setsv||| pad_sv||5.011000| pad_swipe||| pad_tidy||| pad_undef||| parse_body||| parse_unicode_opts||| parser_dup||| parser_free||| path_is_absolute|||n peep||| pending_Slabs_to_ro||| perl_alloc_using|||n perl_alloc|||n perl_clone_using|||n perl_clone|||n perl_construct|||n perl_destruct||5.007003|n perl_free|||n perl_parse||5.006000|n perl_run|||n pidgone||| pm_description||| pmflag||| pmop_dump||5.006000| pmop_xmldump||| pmruntime||| pmtrans||| pop_scope||| pregcomp||5.009005| pregexec||| pregfree2||5.011000| pregfree||| prepend_elem||| prepend_madprops||| printbuf||| printf_nocontext|||vn process_special_blocks||| ptr_table_clear||5.009005| ptr_table_fetch||5.009005| ptr_table_find|||n ptr_table_free||5.009005| ptr_table_new||5.009005| ptr_table_split||5.009005| ptr_table_store||5.009005| push_scope||| put_byte||| pv_display|5.006000||p pv_escape|5.009004||p pv_pretty|5.009004||p pv_uni_display||5.007003| qerror||| qsortsvu||| re_compile||5.009005| re_croak2||| re_dup_guts||| re_intuit_start||5.009005| re_intuit_string||5.006000| readpipe_override||| realloc||5.007002|n reentrant_free||| reentrant_init||| reentrant_retry|||vn reentrant_size||| ref_array_or_hash||| refcounted_he_chain_2hv||| refcounted_he_fetch||| refcounted_he_free||| refcounted_he_new_common||| refcounted_he_new||| refcounted_he_value||| refkids||| refto||| ref||5.011000| reg_check_named_buff_matched||| reg_named_buff_all||5.009005| reg_named_buff_exists||5.009005| reg_named_buff_fetch||5.009005| reg_named_buff_firstkey||5.009005| reg_named_buff_iter||| reg_named_buff_nextkey||5.009005| reg_named_buff_scalar||5.009005| reg_named_buff||| reg_namedseq||| reg_node||| reg_numbered_buff_fetch||| reg_numbered_buff_length||| reg_numbered_buff_store||| reg_qr_package||| reg_recode||| reg_scan_name||| reg_skipcomment||| reg_temp_copy||| reganode||| regatom||| regbranch||| regclass_swash||5.009004| regclass||| regcppop||| regcppush||| regcurly|||n regdump_extflags||| regdump||5.005000| regdupe_internal||| regexec_flags||5.005000| regfree_internal||5.009005| reghop3|||n reghop4|||n reghopmaybe3|||n reginclass||| reginitcolors||5.006000| reginsert||| regmatch||| regnext||5.005000| regpiece||| regpposixcc||| regprop||| regrepeat||| regtail_study||| regtail||| regtry||| reguni||| regwhite|||n reg||| repeatcpy||| report_evil_fh||| report_uninit||| require_pv||5.006000| require_tie_mod||| restore_magic||| rninstr||| rsignal_restore||| rsignal_save||| rsignal_state||5.004000| rsignal||5.004000| run_body||| run_user_filter||| runops_debug||5.005000| runops_standard||5.005000| rvpv_dup||| rxres_free||| rxres_restore||| rxres_save||| safesyscalloc||5.006000|n safesysfree||5.006000|n safesysmalloc||5.006000|n safesysrealloc||5.006000|n same_dirent||| save_I16||5.004000| save_I32||| save_I8||5.006000| save_adelete||5.011000| save_aelem||5.004050| save_alloc||5.006000| save_aptr||| save_ary||| save_bool||5.008001| save_clearsv||| save_delete||| save_destructor_x||5.006000| save_destructor||5.006000| save_freeop||| save_freepv||| save_freesv||| save_generic_pvref||5.006001| save_generic_svref||5.005030| save_gp||5.004000| save_hash||| save_hek_flags|||n save_helem_flags||5.011000| save_helem||5.004050| save_hints||| save_hptr||| save_int||| save_item||| save_iv||5.005000| save_lines||| save_list||| save_long||| save_magic||| save_mortalizesv||5.007001| save_nogv||| save_op||| save_padsv_and_mortalize||5.011000| save_pptr||| save_pushi32ptr||| save_pushptri32ptr||| save_pushptrptr||| save_pushptr||5.011000| save_re_context||5.006000| save_scalar_at||| save_scalar||| save_set_svflags||5.009000| save_shared_pvref||5.007003| save_sptr||| save_svref||| save_vptr||5.006000| savepvn||| savepvs||5.009003| savepv||| savesharedpvn||5.009005| savesharedpv||5.007003| savestack_grow_cnt||5.008001| savestack_grow||| savesvpv||5.009002| sawparens||| scalar_mod_type|||n scalarboolean||| scalarkids||| scalarseq||| scalarvoid||| scalar||| scan_bin||5.006000| scan_commit||| scan_const||| scan_formline||| scan_heredoc||| scan_hex||| scan_ident||| scan_inputsymbol||| scan_num||5.007001| scan_oct||| scan_pat||| scan_str||| scan_subst||| scan_trans||| scan_version||5.009001| scan_vstring||5.009005| scan_word||| scope||| screaminstr||5.005000| search_const||| seed||5.008001| sequence_num||| sequence_tail||| sequence||| set_context||5.006000|n set_numeric_local||5.006000| set_numeric_radix||5.006000| set_numeric_standard||5.006000| setdefout||| share_hek_flags||| share_hek||5.004000| si_dup||| sighandler|||n simplify_sort||| skipspace0||| skipspace1||| skipspace2||| skipspace||| softref2xv||| sortcv_stacked||| sortcv_xsub||| sortcv||| sortsv_flags||5.009003| sortsv||5.007003| space_join_names_mortal||| ss_dup||| stack_grow||| start_force||| start_glob||| start_subparse||5.004000| stashpv_hvname_match||5.011000| stdize_locale||| store_cop_label||| strEQ||| strGE||| strGT||| strLE||| strLT||| strNE||| str_to_version||5.006000| strip_return||| strnEQ||| strnNE||| study_chunk||| sub_crush_depth||| sublex_done||| sublex_push||| sublex_start||| sv_2bool||| sv_2cv||| sv_2io||| sv_2iuv_common||| sv_2iuv_non_preserve||| sv_2iv_flags||5.009001| sv_2iv||| sv_2mortal||| sv_2num||| sv_2nv||| sv_2pv_flags|5.007002||p sv_2pv_nolen|5.006000||p sv_2pvbyte_nolen|5.006000||p sv_2pvbyte|5.006000||p sv_2pvutf8_nolen||5.006000| sv_2pvutf8||5.006000| sv_2pv||| sv_2uv_flags||5.009001| sv_2uv|5.004000||p sv_add_arena||| sv_add_backref||| sv_backoff||| sv_bless||| sv_cat_decode||5.008001| sv_catpv_mg|5.004050||p sv_catpvf_mg_nocontext|||pvn sv_catpvf_mg|5.006000|5.004000|pv sv_catpvf_nocontext|||vn sv_catpvf||5.004000|v sv_catpvn_flags||5.007002| sv_catpvn_mg|5.004050||p sv_catpvn_nomg|5.007002||p sv_catpvn||| sv_catpvs|5.009003||p sv_catpv||| sv_catsv_flags||5.007002| sv_catsv_mg|5.004050||p sv_catsv_nomg|5.007002||p sv_catsv||| sv_catxmlpvn||| sv_catxmlsv||| sv_chop||| sv_clean_all||| sv_clean_objs||| sv_clear||| sv_cmp_locale||5.004000| sv_cmp||| sv_collxfrm||| sv_compile_2op||5.008001| sv_copypv||5.007003| sv_dec||| sv_del_backref||| sv_derived_from||5.004000| sv_destroyable||5.010000| sv_does||5.009004| sv_dump||| sv_dup_inc_multiple||| sv_dup||| sv_eq||| sv_exp_grow||| sv_force_normal_flags||5.007001| sv_force_normal||5.006000| sv_free2||| sv_free_arenas||| sv_free||| sv_gets||5.004000| sv_grow||| sv_i_ncmp||| sv_inc||| sv_insert_flags||5.011000| sv_insert||| sv_isa||| sv_isobject||| sv_iv||5.005000| sv_kill_backrefs||| sv_len_utf8||5.006000| sv_len||| sv_magic_portable|5.011000|5.004000|p sv_magicext||5.007003| sv_magic||| sv_mortalcopy||| sv_ncmp||| sv_newmortal||| sv_newref||| sv_nolocking||5.007003| sv_nosharing||5.007003| sv_nounlocking||| sv_nv||5.005000| sv_peek||5.005000| sv_pos_b2u_midway||| sv_pos_b2u||5.006000| sv_pos_u2b_cached||| sv_pos_u2b_forwards|||n sv_pos_u2b_midway|||n sv_pos_u2b||5.006000| sv_pvbyten_force||5.006000| sv_pvbyten||5.006000| sv_pvbyte||5.006000| sv_pvn_force_flags|5.007002||p sv_pvn_force||| sv_pvn_nomg|5.007003|5.005000|p sv_pvn||5.005000| sv_pvutf8n_force||5.006000| sv_pvutf8n||5.006000| sv_pvutf8||5.006000| sv_pv||5.006000| sv_recode_to_utf8||5.007003| sv_reftype||| sv_release_COW||| sv_replace||| sv_report_used||| sv_reset||| sv_rvweaken||5.006000| sv_setiv_mg|5.004050||p sv_setiv||| sv_setnv_mg|5.006000||p sv_setnv||| sv_setpv_mg|5.004050||p sv_setpvf_mg_nocontext|||pvn sv_setpvf_mg|5.006000|5.004000|pv sv_setpvf_nocontext|||vn sv_setpvf||5.004000|v sv_setpviv_mg||5.008001| sv_setpviv||5.008001| sv_setpvn_mg|5.004050||p sv_setpvn||| sv_setpvs|5.009004||p sv_setpv||| sv_setref_iv||| sv_setref_nv||| sv_setref_pvn||| sv_setref_pv||| sv_setref_uv||5.007001| sv_setsv_cow||| sv_setsv_flags||5.007002| sv_setsv_mg|5.004050||p sv_setsv_nomg|5.007002||p sv_setsv||| sv_setuv_mg|5.004050||p sv_setuv|5.004000||p sv_tainted||5.004000| sv_taint||5.004000| sv_true||5.005000| sv_unglob||| sv_uni_display||5.007003| sv_unmagic||| sv_unref_flags||5.007001| sv_unref||| sv_untaint||5.004000| sv_upgrade||| sv_usepvn_flags||5.009004| sv_usepvn_mg|5.004050||p sv_usepvn||| sv_utf8_decode||5.006000| sv_utf8_downgrade||5.006000| sv_utf8_encode||5.006000| sv_utf8_upgrade_flags_grow||5.011000| sv_utf8_upgrade_flags||5.007002| sv_utf8_upgrade_nomg||5.007002| sv_utf8_upgrade||5.007001| sv_uv|5.005000||p sv_vcatpvf_mg|5.006000|5.004000|p sv_vcatpvfn||5.004000| sv_vcatpvf|5.006000|5.004000|p sv_vsetpvf_mg|5.006000|5.004000|p sv_vsetpvfn||5.004000| sv_vsetpvf|5.006000|5.004000|p sv_xmlpeek||| svtype||| swallow_bom||| swap_match_buff||| swash_fetch||5.007002| swash_get||| swash_init||5.006000| sys_init3||5.010000|n sys_init||5.010000|n sys_intern_clear||| sys_intern_dup||| sys_intern_init||| sys_term||5.010000|n taint_env||| taint_proper||| tmps_grow||5.006000| toLOWER||| toUPPER||| to_byte_substr||| to_uni_fold||5.007003| to_uni_lower_lc||5.006000| to_uni_lower||5.007003| to_uni_title_lc||5.006000| to_uni_title||5.007003| to_uni_upper_lc||5.006000| to_uni_upper||5.007003| to_utf8_case||5.007003| to_utf8_fold||5.007003| to_utf8_lower||5.007003| to_utf8_substr||| to_utf8_title||5.007003| to_utf8_upper||5.007003| token_free||| token_getmad||| tokenize_use||| tokeq||| tokereport||| too_few_arguments||| too_many_arguments||| uiv_2buf|||n unlnk||| unpack_rec||| unpack_str||5.007003| unpackstring||5.008001| unshare_hek_or_pvn||| unshare_hek||| unsharepvn||5.004000| unwind_handler_stack||| update_debugger_info||| upg_version||5.009005| usage||| utf16_to_utf8_reversed||5.006001| utf16_to_utf8||5.006001| utf8_distance||5.006000| utf8_hop||5.006000| utf8_length||5.007001| utf8_mg_pos_cache_update||| utf8_to_bytes||5.006001| utf8_to_uvchr||5.007001| utf8_to_uvuni||5.007001| utf8n_to_uvchr||| utf8n_to_uvuni||5.007001| utilize||| uvchr_to_utf8_flags||5.007003| uvchr_to_utf8||| uvuni_to_utf8_flags||5.007003| uvuni_to_utf8||5.007001| validate_suid||| varname||| vcmp||5.009000| vcroak||5.006000| vdeb||5.007003| vdie_common||| vdie_croak_common||| vdie||| vform||5.006000| visit||| vivify_defelem||| vivify_ref||| vload_module|5.006000||p vmess||5.006000| vnewSVpvf|5.006000|5.004000|p vnormal||5.009002| vnumify||5.009000| vstringify||5.009000| vverify||5.009003| vwarner||5.006000| vwarn||5.006000| wait4pid||| warn_nocontext|||vn warner_nocontext|||vn warner|5.006000|5.004000|pv warn|||v watch||| whichsig||| write_no_mem||| write_to_stderr||| xmldump_all||| xmldump_attr||| xmldump_eval||| xmldump_form||| xmldump_indent|||v xmldump_packsubs||| xmldump_sub||| xmldump_vindent||| yyerror||| yylex||| yyparse||| yywarn||| ); if (exists $opt{'list-unsupported'}) { my $f; for $f (sort { lc $a cmp lc $b } keys %API) { next unless $API{$f}{todo}; print "$f ", '.'x(40-length($f)), " ", format_version($API{$f}{todo}), "\n"; } exit 0; } # Scan for possible replacement candidates my(%replace, %need, %hints, %warnings, %depends); my $replace = 0; my($hint, $define, $function); sub find_api { my $code = shift; $code =~ s{ / (?: \*[^*]*\*+(?:[^$ccs][^*]*\*+)* / | /[^\r\n]*) | "[^"\\]*(?:\\.[^"\\]*)*" | '[^'\\]*(?:\\.[^'\\]*)*' }{}egsx; grep { exists $API{$_} } $code =~ /(\w+)/mg; } while () { if ($hint) { my $h = $hint->[0] eq 'Hint' ? \%hints : \%warnings; if (m{^\s*\*\s(.*?)\s*$}) { for (@{$hint->[1]}) { $h->{$_} ||= ''; # suppress warning with older perls $h->{$_} .= "$1\n"; } } else { undef $hint } } $hint = [$1, [split /,?\s+/, $2]] if m{^\s*$rccs\s+(Hint|Warning):\s+(\w+(?:,?\s+\w+)*)\s*$}; if ($define) { if ($define->[1] =~ /\\$/) { $define->[1] .= $_; } else { if (exists $API{$define->[0]} && $define->[1] !~ /^DPPP_\(/) { my @n = find_api($define->[1]); push @{$depends{$define->[0]}}, @n if @n } undef $define; } } $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+)\)}; $replace = $1 if m{^\s*$rccs\s+Replace:\s+(\d+)\s+$rcce\s*$}; $replace{$2} = $1 if $replace and m{^\s*#\s*define\s+(\w+)(?:\([^)]*\))?\s+(\w+)}; $replace{$2} = $1 if m{^\s*#\s*define\s+(\w+)(?:\([^)]*\))?\s+(\w+).*$rccs\s+Replace\s+$rcce}; $replace{$1} = $2 if m{^\s*$rccs\s+Replace (\w+) with (\w+)\s+$rcce\s*$}; 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 %s; $_ = [sort grep !$s{$_}++, @$_]; } if (exists $opt{'api-info'}) { my $f; my $count = 0; my $match = $opt{'api-info'} =~ m!^/(.*)/$! ? $1 : "^\Q$opt{'api-info'}\E\$"; for $f (sort { lc $a cmp lc $b } keys %API) { next unless $f =~ /$match/; print "\n=== $f ===\n\n"; my $info = 0; if ($API{$f}{base} || $API{$f}{todo}) { my $base = format_version($API{$f}{base} || $API{$f}{todo}); print "Supported at least starting from perl-$base.\n"; $info++; } if ($API{$f}{provided}) { my $todo = $API{$f}{todo} ? format_version($API{$f}{todo}) : "5.003"; print "Support by $ppport provided back to perl-$todo.\n"; print "Support needs to be explicitly requested by NEED_$f.\n" if exists $need{$f}; print "Depends on: ", join(', ', @{$depends{$f}}), ".\n" if exists $depends{$f}; print "\n$hints{$f}" if exists $hints{$f}; print "\nWARNING:\n$warnings{$f}" if exists $warnings{$f}; $info++; } print "No portability information available.\n" unless $info; $count++; } $count or print "Found no API matching '$opt{'api-info'}'."; print "\n"; exit 0; } if (exists $opt{'list-provided'}) { my $f; for $f (sort { lc $a cmp lc $b } 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 $/; }; 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} || $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} && $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 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 keys %{$file{uses_replace}}) { warning("Uses $func instead of $replace{$func}"); $file{changes} += ($c =~ s/\b$func\b/$replace{$func}/g); } for $func (sort 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); } unless ($opt{quiet}) { for $func (sort keys %{$file{uses_todo}}) { print "*** WARNING: Uses $func, which may not be portable below perl ", format_version($API{$func}{todo}), ", even with '$ppport'\n"; $warnings++; } } for $func (sort 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 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 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 = <
$tmp") { print F $str; close F; if (open F, "$prog $file $tmp |") { while () { 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 parse_version { my $ver = shift; if ($ver =~ /^(\d+)\.(\d+)\.(\d+)$/) { return ($1, $2, $3); } elsif ($ver !~ /^\d+\.[\d_]+$/) { die "cannot parse version '$ver'\n"; } $ver =~ s/_//g; $ver =~ s/$/000000/; my($r,$v,$s) = $ver =~ /(\d+)\.(\d{3})(\d{3})/; $v = int $v; $s = int $s; if ($r < 5 || ($r == 5 && $v < 6)) { if ($s % 10) { die "cannot parse version '$ver'\n"; } } return ($r, $v, $s); } sub format_version { my $ver = shift; $ver =~ s/$/000000/; my($r,$v,$s) = $ver =~ /(\d+)\.(\d{3})(\d{3})/; $v = int $v; $s = int $s; if ($r < 5 || ($r == 5 && $v < 6)) { if ($s % 10) { die "invalid version '$ver'\n"; } $s /= 10; $ver = sprintf "%d.%03d", $r, $v; $s > 0 and $ver .= sprintf "_%02d", $s; return $ver; } return sprintf "%d.%d.%d", $r, $v, $s; } 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; } 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 < }; 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 <$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) #ifndef PERL_REVISION # if !defined(__PATCHLEVEL_H_INCLUDED__) && !(defined(PATCHLEVEL) && defined(SUBVERSION)) # define PERL_PATCHLEVEL_H_IMPLICIT # include # endif # if !(defined(PERL_VERSION) || (defined(SUBVERSION) && defined(PATCHLEVEL))) # include # endif # ifndef PERL_REVISION # define PERL_REVISION (5) /* Replace: 1 */ # define PERL_VERSION PATCHLEVEL # define PERL_SUBVERSION SUBVERSION /* Replace PERL_PATCHLEVEL with PERL_VERSION */ /* Replace: 0 */ # endif #endif #define _dpppDEC2BCD(dec) ((((dec)/100)<<8)|((((dec)%100)/10)<<4)|((dec)%10)) #define PERL_BCDVERSION ((_dpppDEC2BCD(PERL_REVISION)<<24)|(_dpppDEC2BCD(PERL_VERSION)<<12)|_dpppDEC2BCD(PERL_SUBVERSION)) /* It is very unlikely that anyone will try to use this with Perl 6 (or greater), but who knows. */ #if PERL_REVISION != 5 # error ppport.h only works with Perl version 5 #endif /* PERL_REVISION != 5 */ #ifndef dTHR # define dTHR dNOOP #endif #ifndef dTHX # define dTHX dNOOP #endif #ifndef dTHXa # define dTHXa(x) dNOOP #endif #ifndef pTHX # define pTHX void #endif #ifndef pTHX_ # define pTHX_ #endif #ifndef aTHX # define aTHX #endif #ifndef aTHX_ # define aTHX_ #endif #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 #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 */ # 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 */ # 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 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 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 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 #ifndef sv_2uv # define sv_2uv(sv) ((PL_Sv = (sv)), (UV) (SvNOK(PL_Sv) ? SvNV(PL_Sv) : sv_2nv(PL_Sv))) #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 #ifndef SvUVx # define SvUVx(sv) ((PL_Sv = (sv)), SvUV(PL_Sv)) #endif /* Hint: sv_uv * Always use the SvUVx() macro instead of sv_uv(). */ #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 #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 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 #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 # 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 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 defined(PERL_GCC_PEDANTIC) # ifndef PERL_GCC_BRACE_GROUPS_FORBIDDEN # define PERL_GCC_BRACE_GROUPS_FORBIDDEN # 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 #ifdef 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 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; \ register 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 UTF8_MAXBYTES # define UTF8_MAXBYTES UTF8_MAXLEN #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 #ifndef isPSXSPC # define isPSXSPC(c) (isSPACE(c) || (c) == '\v') #endif #ifndef isBLANK # define isBLANK(c) ((c) == ' ' || (c) == '\t') #endif #ifdef EBCDIC #ifndef isALNUMC # define isALNUMC(c) isalnum(c) #endif #ifndef isASCII # define isASCII(c) isascii(c) #endif #ifndef isCNTRL # define isCNTRL(c) iscntrl(c) #endif #ifndef isGRAPH # define isGRAPH(c) isgraph(c) #endif #ifndef isPRINT # define isPRINT(c) isprint(c) #endif #ifndef isPUNCT # define isPUNCT(c) ispunct(c) #endif #ifndef isXDIGIT # define isXDIGIT(c) isxdigit(c) #endif #else # if (PERL_BCDVERSION < 0x5010000) /* Hint: isPRINT * The implementation in older perl versions includes all of the * isSPACE() characters, which is wrong. The version provided by * Devel::PPPort always overrides a present buggy version. */ # undef isPRINT # endif #ifndef isALNUMC # define isALNUMC(c) (isALPHA(c) || isDIGIT(c)) #endif #ifndef isASCII # define isASCII(c) ((c) <= 127) #endif #ifndef isCNTRL # define isCNTRL(c) ((c) < ' ' || (c) == 127) #endif #ifndef isGRAPH # define isGRAPH(c) (isALNUM(c) || isPUNCT(c)) #endif #ifndef isPRINT # define isPRINT(c) (((c) >= 32 && (c) < 127)) #endif #ifndef isPUNCT # define isPUNCT(c) (((c) >= 33 && (c) <= 47) || ((c) >= 58 && (c) <= 64) || ((c) >= 91 && (c) <= 96) || ((c) >= 123 && (c) <= 126)) #endif #ifndef isXDIGIT # define isXDIGIT(c) (isDIGIT(c) || ((c) >= 'a' && (c) <= 'f') || ((c) >= 'A' && (c) <= 'F')) #endif #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_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 /* 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 is 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 * doint. 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 #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 /* Replace: 0 */ #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 #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 /* Replace perl_eval_pv with eval_pv */ #ifndef eval_pv #if defined(NEED_eval_pv) static SV* DPPP_(my_eval_pv)(char *p, I32 croak_on_error); static #else extern SV* DPPP_(my_eval_pv)(char *p, I32 croak_on_error); #endif #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) #if defined(NEED_eval_pv) || defined(NEED_eval_pv_GLOBAL) SV* DPPP_(my_eval_pv)(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; if (croak_on_error && SvTRUE(GvSV(errgv))) croak(SvPVx(GvSV(errgv), na)); return sv; } #endif #endif #ifndef vload_module #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 #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) #if defined(NEED_vload_module) || defined(NEED_vload_module_GLOBAL) 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_compling 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_compling */ 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; #if (PERL_BCDVERSION >= 0x5004000) utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0), veop, modname, imop); #else utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(), modname, imop); #endif 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 #ifdef load_module # undef load_module #endif #define load_module DPPP_(my_load_module) #define Perl_load_module DPPP_(my_load_module) #if defined(NEED_load_module) || defined(NEED_load_module_GLOBAL) 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(NEED_newRV_noinc) static SV * DPPP_(my_newRV_noinc)(SV *sv); static #else extern SV * DPPP_(my_newRV_noinc)(SV *sv); #endif #ifdef newRV_noinc # undef newRV_noinc #endif #define newRV_noinc(a) DPPP_(my_newRV_noinc)(aTHX_ a) #define Perl_newRV_noinc DPPP_(my_newRV_noinc) #if defined(NEED_newRV_noinc) || defined(NEED_newRV_noinc_GLOBAL) SV * DPPP_(my_newRV_noinc)(SV *sv) { SV *rv = (SV *)newRV(sv); SvREFCNT_dec(sv); return rv; } #endif #endif /* Hint: newCONSTSUB * Returns a CV* as of perl-5.7.1. This return value is not supported * by Devel::PPPort. */ /* newCONSTSUB from IO.xs is in the core starting with 5.004_63 */ #if (PERL_BCDVERSION < 0x5004063) && (PERL_BCDVERSION != 0x5004005) #if defined(NEED_newCONSTSUB) static void DPPP_(my_newCONSTSUB)(HV *stash, const char *name, SV *sv); static #else extern void DPPP_(my_newCONSTSUB)(HV *stash, const char *name, SV *sv); #endif #ifdef newCONSTSUB # undef newCONSTSUB #endif #define newCONSTSUB(a,b,c) DPPP_(my_newCONSTSUB)(aTHX_ a,b,c) #define Perl_newCONSTSUB DPPP_(my_newCONSTSUB) #if defined(NEED_newCONSTSUB) || defined(NEED_newCONSTSUB_GLOBAL) /* 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 void DPPP_(my_newCONSTSUB)(HV *stash, const char *name, SV *sv) { 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; newSUB( #if (PERL_BCDVERSION < 0x5003022) start_subparse(), #elif (PERL_BCDVERSION == 0x5003022) start_subparse(0), #else /* 5.003_23 onwards */ start_subparse(FALSE, 0), #endif 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; } #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 IVdf # if IVSIZE == LONGSIZE # define IVdf "ld" # define UVuf "lu" # define UVof "lo" # define UVxf "lx" # define UVXf "lX" # else # if IVSIZE == INTSIZE # define IVdf "d" # define UVuf "u" # define UVof "o" # define UVxf "x" # define UVXf "X" # endif # 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 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(NEED_newSV_type) static SV* DPPP_(my_newSV_type)(pTHX_ svtype const t); static #else extern SV* DPPP_(my_newSV_type)(pTHX_ svtype const t); #endif #ifdef newSV_type # undef newSV_type #endif #define newSV_type(a) DPPP_(my_newSV_type)(aTHX_ a) #define Perl_newSV_type DPPP_(my_newSV_type) #if defined(NEED_newSV_type) || defined(NEED_newSV_type_GLOBAL) SV* DPPP_(my_newSV_type)(pTHX_ svtype const t) { SV* const sv = newSV(0); sv_upgrade(sv, t); return 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(NEED_newSVpvn_flags) static SV * DPPP_(my_newSVpvn_flags)(pTHX_ const char *s, STRLEN len, U32 flags); static #else extern SV * DPPP_(my_newSVpvn_flags)(pTHX_ const char *s, STRLEN len, U32 flags); #endif #ifdef newSVpvn_flags # undef newSVpvn_flags #endif #define newSVpvn_flags(a,b,c) DPPP_(my_newSVpvn_flags)(aTHX_ a,b,c) #define Perl_newSVpvn_flags DPPP_(my_newSVpvn_flags) #if defined(NEED_newSVpvn_flags) || defined(NEED_newSVpvn_flags_GLOBAL) SV * DPPP_(my_newSVpvn_flags)(pTHX_ const char *s, STRLEN len, U32 flags) { SV *sv = newSVpvn(D_PPP_CONSTPV_ARG(s), len); SvFLAGS(sv) |= (flags & SVf_UTF8); return (flags & SVs_TEMP) ? sv_2mortal(sv) : sv; } #endif #endif /* Backwards compatibility stuff... :-( */ #if !defined(NEED_sv_2pv_flags) && defined(NEED_sv_2pv_nolen) # define NEED_sv_2pv_flags #endif #if !defined(NEED_sv_2pv_flags_GLOBAL) && defined(NEED_sv_2pv_nolen_GLOBAL) # define NEED_sv_2pv_flags_GLOBAL #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) #if defined(NEED_sv_2pvbyte) static char * DPPP_(my_sv_2pvbyte)(pTHX_ SV *sv, STRLEN *lp); static #else extern char * DPPP_(my_sv_2pvbyte)(pTHX_ SV *sv, STRLEN *lp); #endif #ifdef sv_2pvbyte # undef sv_2pvbyte #endif #define sv_2pvbyte(a,b) DPPP_(my_sv_2pvbyte)(aTHX_ a,b) #define Perl_sv_2pvbyte DPPP_(my_sv_2pvbyte) #if defined(NEED_sv_2pvbyte) || defined(NEED_sv_2pvbyte_GLOBAL) char * DPPP_(my_sv_2pvbyte)(pTHX_ SV *sv, STRLEN *lp) { sv_utf8_downgrade(sv,0); return SvPV(sv,*lp); } #endif /* Hint: sv_2pvbyte * Use the SvPVbyte() macro instead of sv_2pvbyte(). */ #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(). */ /* Hint: sv_pvn_force * Always use the SvPV_force() macro instead of sv_pvn_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_NOSTEAL # define SV_NOSTEAL 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 (PERL_BCDVERSION < 0x5007002) #if defined(NEED_sv_2pv_flags) static char * DPPP_(my_sv_2pv_flags)(pTHX_ SV *sv, STRLEN *lp, I32 flags); static #else extern char * DPPP_(my_sv_2pv_flags)(pTHX_ SV *sv, STRLEN *lp, I32 flags); #endif #ifdef sv_2pv_flags # undef sv_2pv_flags #endif #define sv_2pv_flags(a,b,c) DPPP_(my_sv_2pv_flags)(aTHX_ a,b,c) #define Perl_sv_2pv_flags DPPP_(my_sv_2pv_flags) #if defined(NEED_sv_2pv_flags) || defined(NEED_sv_2pv_flags_GLOBAL) char * DPPP_(my_sv_2pv_flags)(pTHX_ SV *sv, STRLEN *lp, I32 flags) { STRLEN n_a = (STRLEN) flags; return sv_2pv(sv, lp ? lp : &n_a); } #endif #if defined(NEED_sv_pvn_force_flags) static char * DPPP_(my_sv_pvn_force_flags)(pTHX_ SV *sv, STRLEN *lp, I32 flags); static #else extern char * DPPP_(my_sv_pvn_force_flags)(pTHX_ SV *sv, STRLEN *lp, I32 flags); #endif #ifdef sv_pvn_force_flags # undef sv_pvn_force_flags #endif #define sv_pvn_force_flags(a,b,c) DPPP_(my_sv_pvn_force_flags)(aTHX_ a,b,c) #define Perl_sv_pvn_force_flags DPPP_(my_sv_pvn_force_flags) #if defined(NEED_sv_pvn_force_flags) || defined(NEED_sv_pvn_force_flags_GLOBAL) char * DPPP_(my_sv_pvn_force_flags)(pTHX_ SV *sv, STRLEN *lp, I32 flags) { STRLEN n_a = (STRLEN) flags; return sv_pvn_force(sv, lp ? lp : &n_a); } #endif #endif #if (PERL_BCDVERSION < 0x5008008) || ( (PERL_BCDVERSION >= 0x5009000) && (PERL_BCDVERSION < 0x5009003) ) # define DPPP_SVPV_NOLEN_LP_ARG &PL_na #else # define DPPP_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, DPPP_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, DPPP_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, DPPP_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, DPPP_SVPV_NOLEN_LP_ARG, SV_GMAGIC|SV_CONST_RETURN)) #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_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 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 #if (PERL_BCDVERSION >= 0x5004000) && !defined(vnewSVpvf) #if defined(NEED_vnewSVpvf) static SV * DPPP_(my_vnewSVpvf)(pTHX_ const char *pat, va_list *args); static #else extern SV * DPPP_(my_vnewSVpvf)(pTHX_ const char *pat, va_list *args); #endif #ifdef vnewSVpvf # undef vnewSVpvf #endif #define vnewSVpvf(a,b) DPPP_(my_vnewSVpvf)(aTHX_ a,b) #define Perl_vnewSVpvf DPPP_(my_vnewSVpvf) #if defined(NEED_vnewSVpvf) || defined(NEED_vnewSVpvf_GLOBAL) SV * DPPP_(my_vnewSVpvf)(pTHX_ const char *pat, va_list *args) { register SV *sv = newSV(0); sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*)); return 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 *sv, const char *pat, ...); static #else extern void DPPP_(my_sv_catpvf_mg)(pTHX_ SV *sv, const char *pat, ...); #endif #define Perl_sv_catpvf_mg DPPP_(my_sv_catpvf_mg) #if defined(NEED_sv_catpvf_mg) || defined(NEED_sv_catpvf_mg_GLOBAL) void DPPP_(my_sv_catpvf_mg)(pTHX_ SV *sv, const char *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 *sv, const char *pat, ...); static #else extern void DPPP_(my_sv_catpvf_mg_nocontext)(SV *sv, const char *pat, ...); #endif #define sv_catpvf_mg_nocontext DPPP_(my_sv_catpvf_mg_nocontext) #define Perl_sv_catpvf_mg_nocontext DPPP_(my_sv_catpvf_mg_nocontext) #if defined(NEED_sv_catpvf_mg_nocontext) || defined(NEED_sv_catpvf_mg_nocontext_GLOBAL) void DPPP_(my_sv_catpvf_mg_nocontext)(SV *sv, const char *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 *sv, const char *pat, ...); static #else extern void DPPP_(my_sv_setpvf_mg)(pTHX_ SV *sv, const char *pat, ...); #endif #define Perl_sv_setpvf_mg DPPP_(my_sv_setpvf_mg) #if defined(NEED_sv_setpvf_mg) || defined(NEED_sv_setpvf_mg_GLOBAL) void DPPP_(my_sv_setpvf_mg)(pTHX_ SV *sv, const char *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 *sv, const char *pat, ...); static #else extern void DPPP_(my_sv_setpvf_mg_nocontext)(SV *sv, const char *pat, ...); #endif #define sv_setpvf_mg_nocontext DPPP_(my_sv_setpvf_mg_nocontext) #define Perl_sv_setpvf_mg_nocontext DPPP_(my_sv_setpvf_mg_nocontext) #if defined(NEED_sv_setpvf_mg_nocontext) || defined(NEED_sv_setpvf_mg_nocontext_GLOBAL) void DPPP_(my_sv_setpvf_mg_nocontext)(SV *sv, const char *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 #ifndef newSVpvn_share #if defined(NEED_newSVpvn_share) static SV * DPPP_(my_newSVpvn_share)(pTHX_ const char *src, I32 len, U32 hash); static #else extern SV * DPPP_(my_newSVpvn_share)(pTHX_ const char *src, I32 len, U32 hash); #endif #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) #if defined(NEED_newSVpvn_share) || defined(NEED_newSVpvn_share_GLOBAL) SV * DPPP_(my_newSVpvn_share)(pTHX_ const char *src, I32 len, U32 hash) { SV *sv; if (len < 0) len = -len; if (!hash) PERL_HASH(hash, (char*) src, len); sv = newSVpvn((char *) src, 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 #ifndef GvSVn # define GvSVn(gv) GvSV(gv) #endif #ifndef isGV_with_GP # define isGV_with_GP(gv) isGV(gv) #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 ckWARN # ifdef G_WARN_ON # define ckWARN(a) (PL_dowarn & G_WARN_ON) # else # define ckWARN(a) PL_dowarn # endif #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 #define Perl_warner DPPP_(my_warner) #if defined(NEED_warner) || defined(NEED_warner_GLOBAL) void DPPP_(my_warner)(U32 err, const char *pat, ...) { SV *sv; va_list args; PERL_UNUSED_ARG(err); va_start(args, pat); sv = vnewSVpvf(pat, &args); va_end(args); sv_2mortal(sv); warn("%s", SvPV_nolen(sv)); } #define warner Perl_warner #define Perl_warner_nocontext Perl_warner #endif #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 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_fetchpvn_flags # define gv_fetchpvn_flags(name, len, flags, svt) gv_fetchpv(name, flags, svt) #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 SvGETMAGIC # define SvGETMAGIC(x) STMT_START { if (SvGMAGICAL(x)) mg_get(x); } STMT_END #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 /* 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 #ifndef SvIV_nomg # define SvIV_nomg SvIV #endif #ifndef SvUV_nomg # define SvUV_nomg SvUV #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 #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 */ #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 #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) #if defined(NEED_grok_numeric_radix) || defined(NEED_grok_numeric_radix_GLOBAL) 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 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 #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) #if defined(NEED_grok_number) || defined(NEED_grok_number_GLOBAL) 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 #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) #if defined(NEED_grok_bin) || defined(NEED_grok_bin_GLOBAL) 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 #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) #if defined(NEED_grok_hex) || defined(NEED_grok_hex_GLOBAL) 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 #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) #if defined(NEED_grok_oct) || defined(NEED_grok_oct_GLOBAL) 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 #define my_snprintf DPPP_(my_my_snprintf) #define Perl_my_snprintf DPPP_(my_my_snprintf) #if defined(NEED_my_snprintf) || defined(NEED_my_snprintf_GLOBAL) 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 #define my_sprintf DPPP_(my_my_sprintf) #define Perl_my_sprintf DPPP_(my_my_sprintf) #if defined(NEED_my_sprintf) || defined(NEED_my_sprintf_GLOBAL) 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 #define my_strlcat DPPP_(my_my_strlcat) #define Perl_my_strlcat DPPP_(my_my_strlcat) #if defined(NEED_my_strlcat) || defined(NEED_my_strlcat_GLOBAL) 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 #define my_strlcpy DPPP_(my_my_strlcpy) #define Perl_my_strlcpy DPPP_(my_my_strlcpy) #if defined(NEED_my_strlcpy) || defined(NEED_my_strlcpy_GLOBAL) 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 #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 #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) #if defined(NEED_pv_escape) || defined(NEED_pv_escape_GLOBAL) 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) 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) 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) isuni ? utf8_to_uvchr((U8*)pv, &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 #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) #if defined(NEED_pv_pretty) || defined(NEED_pv_pretty_GLOBAL) 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 #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) #if defined(NEED_pv_display) || defined(NEED_pv_display_GLOBAL) 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 #endif /* _P_P_PORTABILITY_H_ */ /* End of File ppport.h */ XML-Hash-XS-0.64/src/xh_stash.h0000644000175000017500000000046012265425011014615 0ustar yurayura#ifndef _XH_STASH_H_ #define _XH_STASH_H_ #include "xh_config.h" #include "xh_core.h" XH_INLINE void xh_stash_push(xh_stack_t *stash, SV *value) { SV **stash_item; stash_item = xh_stack_push(stash); *stash_item = value; } void xh_stash_clean(xh_stack_t *stash); #endif /* _XH_STASH_H_ */ XML-Hash-XS-0.64/src/xh_stash.c0000644000175000017500000000033612265425011014612 0ustar yurayura#include "xh_config.h" #include "xh_core.h" void xh_stash_clean(xh_stack_t *stash) { SV **value; while ((value = xh_stack_pop(stash)) != NULL) { SvREFCNT_dec(*value); } xh_stack_destroy(stash); } XML-Hash-XS-0.64/src/xh_stack.h0000644000175000017500000000162312455473142014613 0ustar yurayura#ifndef _XH_STACK_H_ #define _XH_STACK_H_ #include "xh_config.h" #include "xh_core.h" typedef struct { void *elts; size_t size; size_t nelts; size_t top; } xh_stack_t; XH_INLINE void * xh_stack_push(xh_stack_t *st) { if (st->top >= st->nelts) { st->nelts *= 2; if ((st->elts = realloc(st->elts, st->nelts * st->size)) == NULL) { croak("Memory allocation error"); } } return (void *) (XH_CHAR_CAST st->elts + st->top++ * st->size); } XH_INLINE void * xh_stack_pop(xh_stack_t *st) { return st->top == 0 ? NULL : (void *) (XH_CHAR_CAST st->elts + --st->top * st->size); } XH_INLINE xh_bool_t xh_stack_empty(xh_stack_t *st) { return st->top == 0 ? TRUE : FALSE; } void xh_stack_init(xh_stack_t *st, xh_uint_t nelts, size_t size); void xh_stack_destroy(xh_stack_t *st); #endif /* _XH_STACK_H_ */ XML-Hash-XS-0.64/src/xh_reader.c0000644000175000017500000005372113325066767014761 0ustar yurayura#include "xh_config.h" #include "xh_core.h" static void xh_common_reader_init(xh_reader_t *reader, SV *XH_UNUSED(input), xh_char_t *encoding, size_t buf_size) { reader->buf_size = buf_size; if (encoding[0] != '\0') reader->switch_encoding(reader, encoding, NULL, NULL); } static void xh_common_reader_destroy(xh_reader_t *reader) { #ifdef XH_HAVE_ENCODER xh_buffer_destroy(&reader->enc_buf); if (reader->encoder != NULL) xh_encoder_destroy(reader->encoder); #endif } static void xh_common_reader_switch_encoding(xh_reader_t *reader, xh_char_t *encoding, xh_char_t **buf, size_t *len) { xh_log_debug1("switch encoding to '%s'", encoding); if (xh_strcasecmp(encoding, XH_INTERNAL_ENCODING) == 0) { #ifdef XH_HAVE_ENCODER if (reader->encoder != NULL) { croak("Can't to switch encoding from %s to %s", reader->encoder->fromcode, encoding); } #endif } else { #ifdef XH_HAVE_ENCODER if (reader->encoder == NULL) { /* create encoder */ xh_log_debug1("create a new encoder: %s", encoding); reader->encoder = xh_encoder_create(XH_CHAR_CAST XH_INTERNAL_ENCODING, encoding); if (reader->encoder == NULL) { croak("Can't create encoder for '%s'", encoding); } xh_buffer_init(&reader->enc_buf, reader->buf_size); if (len != NULL && *len > 0) { reader->fake_read_pos = *buf; reader->fake_read_len = *len; *len = 0; } } else if (xh_strcasecmp(encoding, reader->encoder->fromcode) != 0) { croak("Can't to switch encoding from %s to %s", reader->encoder->fromcode, encoding); } #else croak("Can't create encoder for '%s'", encoding); #endif } } static void xh_string_reader_init(xh_reader_t *reader, SV *input, xh_char_t *encoding, size_t buf_size) { STRLEN len; xh_char_t *str; str = XH_CHAR_CAST SvPV(input, len); reader->str = str; reader->len = (size_t) len; reader->main_buf.start = reader->main_buf.cur = str; reader->main_buf.end = str + len; xh_common_reader_init(reader, input, encoding, buf_size); } static size_t xh_string_reader_read(xh_reader_t *reader, xh_char_t **buf, xh_char_t *XH_UNUSED(preserve), size_t *off) { size_t len; xh_buffer_t *main_buf; *off = 0; main_buf = &reader->main_buf; *buf = xh_buffer_pos(main_buf); len = xh_buffer_avail(main_buf); xh_buffer_seek_eof(main_buf); return len; } #ifdef XH_HAVE_ENCODER static size_t xh_string_reader_read_with_encoding(xh_reader_t *reader, xh_char_t **buf, xh_char_t *preserve, size_t *off) { xh_char_t *old_buf_addr; size_t src_left, dst_left; xh_buffer_t *main_buf, *enc_buf; *off = 0; main_buf = &reader->main_buf; enc_buf = &reader->enc_buf; xh_log_debug4("enc_buf: %p[%.*s] len: %lu", enc_buf->start, enc_buf->cur - enc_buf->start, enc_buf->cur, enc_buf->cur - enc_buf->start); xh_log_debug1("preserve data: %p", preserve); if (preserve == NULL) { xh_buffer_seek_top(enc_buf); } else { *off = preserve - enc_buf->start; xh_log_debug1("off: %lu", *off); if (*off) { xh_log_debug3("memmove dest: %p src %p size: %lu", enc_buf->start, preserve, enc_buf->end - preserve); xh_memmove(enc_buf->start, preserve, enc_buf->end - preserve); } enc_buf->cur -= *off; } old_buf_addr = xh_buffer_start(enc_buf); xh_buffer_grow50(enc_buf); if (preserve != NULL && xh_buffer_start(enc_buf) != old_buf_addr) { *off += old_buf_addr - xh_buffer_start(enc_buf); } *buf = xh_buffer_pos(enc_buf); while (enc_buf->cur < enc_buf->end) { if (reader->fake_read_pos != NULL) { main_buf->cur = reader->fake_read_pos; reader->fake_read_pos = NULL; reader->fake_read_len = 0; } xh_log_debug2("main buf cur: %p end: %p", main_buf->cur, main_buf->end); src_left = xh_buffer_avail(main_buf); if (src_left == 0 && reader->encoder->state == XH_ENC_OK) { if (main_buf->cur == main_buf->end) break; croak("Truncate char found"); } dst_left = xh_buffer_avail(enc_buf); xh_log_debug4("main_buf: %.*s src_left: %lu dst_left: %lu", src_left, main_buf->cur, src_left, dst_left); xh_encoder_encode_string(reader->encoder, &main_buf->cur, &src_left, &enc_buf->cur, &dst_left); xh_log_debug3("enc_buf: %.*s len: %lu", enc_buf->cur - enc_buf->start, enc_buf->start, enc_buf->cur - enc_buf->start); switch (reader->encoder->state) { case XH_ENC_TRUNCATED_CHAR_FOUND: if (src_left == 0) croak("Truncated char found but buffer is empty"); break; case XH_ENC_BUFFER_OVERFLOW: default: goto DONE; } } DONE: dst_left = enc_buf->cur - *buf; xh_log_debug4("enc_buf: %p[%.*s] len: %lu", enc_buf->start, dst_left, enc_buf->cur, dst_left); return dst_left; } #endif /* XH_HAVE_ENCODER */ static void xh_string_reader_switch_encoding(xh_reader_t *reader, xh_char_t *encoding, xh_char_t **buf, size_t *len) { xh_common_reader_switch_encoding(reader, encoding, buf, len); #ifdef XH_HAVE_ENCODER reader->read = reader->encoder == NULL ? xh_string_reader_read : xh_string_reader_read_with_encoding; #endif } static void xh_string_reader_destroy(xh_reader_t *reader) { xh_common_reader_destroy(reader); } #ifdef XH_HAVE_MMAP static void xh_mmaped_file_reader_init(xh_reader_t *reader, SV *input, xh_char_t *encoding, size_t buf_size) { struct stat sb; reader->file = XH_CHAR_CAST SvPV_nolen(input); xh_log_debug1("open file: %s", reader->file); reader->fd = open((const char *) reader->file, O_RDONLY); if (reader->fd == -1) { croak("Can't open file '%s': %s", reader->file, strerror(errno)); } if (fstat(reader->fd, &sb) == -1) { croak("Can't get stat of file '%s': %s", reader->file, strerror(errno)); } xh_log_debug1("file size: %lu", sb.st_size); if (sb.st_size == 0) { croak("File '%s' is empty", reader->file); } reader->len = sb.st_size; #ifdef WIN32 reader->fh = (HANDLE) _get_osfhandle(reader->fd); if (reader->fh == INVALID_HANDLE_VALUE) { croak("Can't get file handle of file '%s'", reader->file); } xh_log_debug1("create mapping for file %s", reader->file); reader->fm = CreateFileMapping(reader->fh, NULL, PAGE_READONLY, 0, 0, NULL); if (reader->fm == NULL) { croak("Can't create file mapping of file '%s'", reader->file); } xh_log_debug1("create map view for file %s", reader->file); reader->str = XH_CHAR_CAST MapViewOfFile(reader->fm, FILE_MAP_READ, 0, 0, reader->len); if (reader->str == NULL) { croak("Can't create map view of file '%s'", reader->file); } #else xh_log_debug1("mmap file %s", reader->file); reader->str = XH_CHAR_CAST mmap((caddr_t) 0, reader->len, PROT_READ, MAP_PRIVATE, reader->fd, 0); if ((caddr_t) reader->str == (caddr_t) (-1)) { croak("Can't create map of file '%s': %s", reader->file, strerror(errno)); } #endif reader->main_buf.start = reader->main_buf.cur = reader->str; reader->main_buf.end = reader->str + reader->len; xh_common_reader_init(reader, input, encoding, buf_size); } static void xh_mmaped_file_reader_destroy(xh_reader_t *reader) { xh_common_reader_destroy(reader); if (reader->fd == -1) return; #ifdef WIN32 xh_log_debug1("unmap view of file %s", reader->file); UnmapViewOfFile(reader->str); xh_log_debug1("close handle of file %s", reader->file); CloseHandle(reader->fm); #else xh_log_debug1("munmap file %s", reader->file); if (munmap(reader->str, reader->len) == -1) { croak("Can't munmap file '%s': %s", reader->file, strerror(errno)); } #endif xh_log_debug1("close file %s", reader->file); if (close(reader->fd) == -1) { croak("Can't close file '%s': %s", reader->file, strerror(errno)); } } #else static void xh_file_reader_init(xh_reader_t *reader, SV *input, xh_char_t *encoding, size_t buf_size) { reader->file = XH_CHAR_CAST SvPV_nolen(input); xh_log_debug1("open file: %s", reader->file); reader->fd = open((char *) reader->file, O_RDONLY); if (reader->fd == -1) { croak("Can't open file '%s': %s", reader->file, strerror(errno)); } xh_buffer_init(&reader->main_buf, buf_size); xh_common_reader_init(reader, input, encoding, buf_size); } static void xh_file_reader_destroy(xh_reader_t *reader) { xh_common_reader_destroy(reader); if (reader->main_buf.start != NULL) free(reader->main_buf.start); if (close(reader->fd) == -1) { croak("Can't close file '%s': %s", reader->file, strerror(errno)); } } #endif /* XH_HAVE_MMAP */ static size_t xh_file_reader_read(xh_reader_t *reader, xh_char_t **buf, xh_char_t *preserve, size_t *off) { xh_char_t *old_buf_addr; size_t len; xh_buffer_t *main_buf; main_buf = &reader->main_buf; *off = 0; xh_log_debug1("read preserve: %p", preserve); if (preserve == NULL) { main_buf->cur = main_buf->start; } else { *off = preserve - main_buf->start; xh_log_debug1("off: %lu", *off); if (*off) { xh_log_debug3("memmove dest: %p src %p size: %lu", main_buf->start, preserve, main_buf->end - preserve); xh_memmove(main_buf->start, preserve, main_buf->end - preserve); } main_buf->cur -= *off; xh_log_debug1("read cur: %p", main_buf->cur); } old_buf_addr = main_buf->start; xh_buffer_grow50(main_buf); if (preserve != NULL && main_buf->start != old_buf_addr) { *off += old_buf_addr - main_buf->start; } len = read(reader->fd, main_buf->cur, xh_buffer_avail(main_buf)); *buf = main_buf->cur; if (len == (size_t) (-1)) { croak("Failed to read file"); } main_buf->cur += len; return len; } #ifdef XH_HAVE_ENCODER static size_t xh_file_reader_read_with_encoding(xh_reader_t *reader, xh_char_t **buf, xh_char_t *preserve, size_t *off) { xh_char_t *old_buf_addr; size_t src_left, dst_left; xh_buffer_t *main_buf, *enc_buf; *off = 0; main_buf = &reader->main_buf; enc_buf = &reader->enc_buf; xh_log_debug4("enc_buf: %p[%.*s] len: %lu", enc_buf->start, enc_buf->cur - enc_buf->start, enc_buf->cur, enc_buf->cur - enc_buf->start); xh_log_debug1("preserve data: %p", preserve); if (preserve == NULL) { xh_buffer_seek_top(enc_buf); } else { *off = preserve - enc_buf->start; xh_log_debug1("off: %lu", *off); if (*off) { xh_log_debug3("memmove dest: %p src %p size: %lu", enc_buf->start, preserve, enc_buf->end - preserve); xh_memmove(enc_buf->start, preserve, enc_buf->end - preserve); } enc_buf->cur -= *off; } old_buf_addr = enc_buf->start; xh_buffer_grow50(enc_buf); if (preserve != NULL && enc_buf->start != old_buf_addr) { *off += old_buf_addr - enc_buf->start; } *buf = xh_buffer_pos(enc_buf); while (enc_buf->cur < enc_buf->end) { xh_buffer_grow50(main_buf); if (reader->fake_read_pos == NULL) { src_left = read(reader->fd, xh_buffer_pos(main_buf), xh_buffer_avail(main_buf)); } else { main_buf->cur = reader->fake_read_pos; src_left = reader->fake_read_len; reader->fake_read_pos = NULL; reader->fake_read_len = 0; } if (src_left == 0) { if (main_buf->cur == main_buf->end) break; croak("Truncate char found"); } if (src_left == (size_t) (-1)) croak("Failed to read file"); dst_left = xh_buffer_avail(enc_buf); xh_log_debug4("main_buf: %.*s src_left: %lu dst_left: %lu", src_left, main_buf->cur, src_left, dst_left); xh_encoder_encode_string(reader->encoder, &main_buf->cur, &src_left, &enc_buf->cur, &dst_left); xh_log_debug3("enc_buf: %.*s len: %lu", enc_buf->cur - enc_buf->start, enc_buf->start, enc_buf->cur - enc_buf->start); switch (reader->encoder->state) { case XH_ENC_TRUNCATED_CHAR_FOUND: if (src_left == 0) croak("Truncated char found but buffer is empty"); xh_memmove(main_buf->start, main_buf->cur, src_left); main_buf->cur = main_buf->start + src_left; break; case XH_ENC_BUFFER_OVERFLOW: default: xh_buffer_seek_top(main_buf); goto DONE; } } DONE: dst_left = enc_buf->cur - *buf; xh_log_debug4("enc_buf: %p[%.*s] len: %lu", enc_buf->start, dst_left, enc_buf->cur, dst_left); return dst_left; } #endif /* XH_HAVE_ENCODER */ static void xh_file_reader_switch_encoding(xh_reader_t *reader, xh_char_t *encoding, xh_char_t **buf, size_t *len) { xh_common_reader_switch_encoding(reader, encoding, buf, len); #ifdef XH_HAVE_ENCODER reader->read = reader->encoder == NULL ? xh_file_reader_read : xh_file_reader_read_with_encoding; #endif } static void xh_perl_io_reader_init(xh_reader_t *reader, SV *input, xh_char_t *encoding, size_t buf_size) { reader->fd = PerlIO_fileno(reader->perl_io); xh_buffer_init(&reader->main_buf, buf_size); xh_common_reader_init(reader, input, encoding, buf_size); } static void xh_perl_io_reader_destroy(xh_reader_t *reader) { xh_common_reader_destroy(reader); if (reader->main_buf.start != NULL) free(reader->main_buf.start); } static size_t xh_perl_obj_read(SV *obj, SV *buf, size_t count, size_t offset) { int nparam; size_t len = 0; dSP; ENTER; SAVETMPS; PUSHMARK(SP); XPUSHs(obj); XPUSHs(buf); XPUSHs(sv_2mortal(newSViv(count))); XPUSHs(sv_2mortal(newSViv(offset))); PUTBACK; nparam = call_method("READ", G_SCALAR); SPAGAIN; if (nparam) { len = POPi; } else { len = 0; } FREETMPS; LEAVE; return len; } static void xh_perl_obj_reader_init(xh_reader_t *reader, SV *input, xh_char_t *encoding, size_t buf_size) { xh_perl_buffer_init(&reader->perl_buf, buf_size); xh_common_reader_init(reader, input, encoding, buf_size); } static void xh_perl_obj_reader_destroy(xh_reader_t *reader) { xh_common_reader_destroy(reader); if (reader->perl_buf.scalar != NULL) SvREFCNT_dec(reader->perl_buf.scalar); } static size_t xh_perl_obj_reader_read(xh_reader_t *reader, xh_char_t **buf, xh_char_t *preserve, size_t *off) { xh_char_t *old_buf_addr; size_t len; xh_perl_buffer_t *main_buf; main_buf = &reader->perl_buf; *off = 0; xh_log_debug1("read preserve: %p", preserve); if (preserve == NULL) { main_buf->cur = main_buf->start; } else { *off = preserve - main_buf->start; xh_log_debug1("off: %lu", *off); if (*off) { xh_log_debug3("memmove dest: %p src %p size: %lu", main_buf->start, preserve, main_buf->end - preserve); xh_memmove(main_buf->start, preserve, main_buf->end - preserve); } main_buf->cur -= *off; xh_log_debug1("read cur: %p", main_buf->cur); } { old_buf_addr = main_buf->start; xh_perl_buffer_grow50(main_buf); len = xh_perl_obj_read(reader->perl_obj, main_buf->scalar, xh_perl_buffer_avail(main_buf), main_buf->cur - main_buf->start); xh_perl_buffer_sync(main_buf); if (preserve != NULL && main_buf->start != old_buf_addr) { *off += old_buf_addr - main_buf->start; } } *buf = main_buf->cur; if (len == (size_t) (-1)) { croak("Failed to read file"); } main_buf->cur += len; return len; } #ifdef XH_HAVE_ENCODER static size_t xh_perl_obj_reader_read_with_encoding(xh_reader_t *reader, xh_char_t **buf, xh_char_t *preserve, size_t *off) { xh_char_t *old_buf_addr; size_t src_left, dst_left; xh_perl_buffer_t *main_buf; xh_buffer_t *enc_buf; *off = 0; main_buf = &reader->perl_buf; enc_buf = &reader->enc_buf; xh_log_debug4("enc_buf: %p[%.*s] len: %lu", enc_buf->start, enc_buf->cur - enc_buf->start, enc_buf->cur, enc_buf->cur - enc_buf->start); xh_log_debug1("preserve data: %p", preserve); if (preserve == NULL) { xh_buffer_seek_top(enc_buf); } else { *off = preserve - enc_buf->start; xh_log_debug1("off: %lu", *off); if (*off) { xh_log_debug3("memmove dest: %p src %p size: %lu", enc_buf->start, preserve, enc_buf->end - preserve); xh_memmove(enc_buf->start, preserve, enc_buf->end - preserve); } enc_buf->cur -= *off; } old_buf_addr = enc_buf->start; xh_buffer_grow50(enc_buf); if (preserve != NULL && enc_buf->start != old_buf_addr) { *off += old_buf_addr - enc_buf->start; } *buf = xh_buffer_pos(enc_buf); while (enc_buf->cur < enc_buf->end) { xh_perl_buffer_grow50(main_buf); if (reader->fake_read_pos == NULL) { src_left = xh_perl_obj_read(reader->perl_obj, main_buf->scalar, xh_perl_buffer_avail(main_buf), main_buf->cur - main_buf->start); } else { main_buf->cur = reader->fake_read_pos; src_left = reader->fake_read_len; reader->fake_read_pos = NULL; reader->fake_read_len = 0; } if (src_left == 0) { if (main_buf->cur == main_buf->end) break; croak("Truncate char found"); } if (src_left == (size_t) (-1)) croak("Failed to read file"); dst_left = xh_buffer_avail(enc_buf); xh_log_debug4("main_buf: %.*s src_left: %lu dst_left: %lu", src_left, main_buf->cur, src_left, dst_left); xh_encoder_encode_string(reader->encoder, &main_buf->cur, &src_left, &enc_buf->cur, &dst_left); xh_log_debug3("enc_buf: %.*s len: %lu", enc_buf->cur - enc_buf->start, enc_buf->start, enc_buf->cur - enc_buf->start); switch (reader->encoder->state) { case XH_ENC_TRUNCATED_CHAR_FOUND: if (src_left == 0) croak("Truncated char found but buffer is empty"); xh_memmove(main_buf->start, main_buf->cur, src_left); main_buf->cur = main_buf->start + src_left; break; case XH_ENC_BUFFER_OVERFLOW: default: xh_buffer_seek_top(main_buf); goto DONE; } } DONE: dst_left = enc_buf->cur - *buf; xh_log_debug4("enc_buf: %p[%.*s] len: %lu", enc_buf->start, dst_left, enc_buf->cur, dst_left); return dst_left; } #endif /* XH_HAVE_ENCODER */ static void xh_perl_obj_reader_switch_encoding(xh_reader_t *reader, xh_char_t *encoding, xh_char_t **buf, size_t *len) { xh_common_reader_switch_encoding(reader, encoding, buf, len); #ifdef XH_HAVE_ENCODER reader->read = reader->encoder == NULL ? xh_perl_obj_reader_read : xh_perl_obj_reader_read_with_encoding; #endif } void xh_reader_init(xh_reader_t *reader, SV *input, xh_char_t *encoding, size_t buf_size) { STRLEN len; xh_char_t *str; MAGIC *mg; GV *gv; IO *io; if (SvTYPE(input) != SVt_PVGV) { str = XH_CHAR_CAST SvPV(input, len); if (len == 0) croak("String is empty"); /* Parsing string */ if (xh_str_is_xml(str)) { reader->type = XH_READER_STRING_TYPE; reader->init = xh_string_reader_init; reader->read = xh_string_reader_read; reader->switch_encoding = xh_string_reader_switch_encoding; reader->destroy = xh_string_reader_destroy; } /* Parsing file */ else { #ifdef XH_HAVE_MMAP reader->type = XH_READER_MMAPED_FILE_TYPE; reader->init = xh_mmaped_file_reader_init; reader->read = xh_string_reader_read; reader->switch_encoding = xh_string_reader_switch_encoding; reader->destroy = xh_mmaped_file_reader_destroy; #else reader->type = XH_READER_FILE_TYPE; reader->init = xh_file_reader_init; reader->read = xh_file_reader_read; reader->switch_encoding = xh_file_reader_switch_encoding; reader->destroy = xh_file_reader_destroy; #endif } } else { gv = (GV *) input; io = GvIO(gv); if (!io) croak("Can't use file handle as a PerlIO handle"); if ((mg = SvTIED_mg(MUTABLE_SV(io), PERL_MAGIC_tiedscalar))) { /* Tied handle */ xh_log_debug0("Tied handle detected"); reader->perl_obj = SvTIED_obj(MUTABLE_SV(io), mg); reader->type = XH_READER_FILE_TYPE; reader->init = xh_perl_obj_reader_init; reader->read = xh_perl_obj_reader_read; reader->switch_encoding = xh_perl_obj_reader_switch_encoding; reader->destroy = xh_perl_obj_reader_destroy; } else { /* PerlIO handle */ xh_log_debug0("PerlIO handle detected"); reader->perl_io = IoIFP(io); reader->type = XH_READER_FILE_TYPE; reader->init = xh_perl_io_reader_init; reader->read = xh_file_reader_read; reader->switch_encoding = xh_file_reader_switch_encoding; reader->destroy = xh_perl_io_reader_destroy; } } reader->init(reader, input, encoding, buf_size); } void xh_reader_destroy(xh_reader_t *reader) { if (reader->destroy != NULL) reader->destroy(reader); } XML-Hash-XS-0.64/src/xh_buffer.h0000644000175000017500000000171512455473142014761 0ustar yurayura#ifndef _XH_BUFFER_H_ #define _XH_BUFFER_H_ #include "xh_config.h" #include "xh_core.h" typedef struct _xh_buffer_t xh_buffer_t; struct _xh_buffer_t { xh_char_t *start; xh_char_t *cur; xh_char_t *end; }; void xh_buffer_init(xh_buffer_t *buf, size_t size); void xh_buffer_grow(xh_buffer_t *buf, size_t inc); XH_INLINE void xh_buffer_destroy(xh_buffer_t *buf) { if (buf->start != NULL) { xh_log_debug1("free enc buf: %p", buf->start); free(buf->start); } } #define xh_buffer_avail(b) ((b)->end - (b)->cur) #define xh_buffer_start(b) ((b)->start) #define xh_buffer_pos(b) ((b)->cur) #define xh_buffer_end(b) ((b)->end) #define xh_buffer_size(b) ((b)->end - (b)->start) #define xh_buffer_seek(b, p) (b)->cur = p #define xh_buffer_seek_eof(b) (b)->cur = (b)->end #define xh_buffer_seek_top(b) (b)->cur = (b)->start #define xh_buffer_grow50(b) xh_buffer_grow((b), xh_buffer_size(b) / 2) #endif /* _XH_BUFFER_H_ */ XML-Hash-XS-0.64/src/xh_dom.c0000644000175000017500000001034712265425011014252 0ustar yurayura#include "xh_config.h" #include "xh_core.h" #ifdef XH_HAVE_DOM SV* x_PROXY_NODE_REGISTRY_MUTEX = NULL; static const char* x_PmmNodeTypeName( xmlNodePtr elem ){ const char *name = "XML::LibXML::Node"; if ( elem != NULL ) { switch ( elem->type ) { case XML_ELEMENT_NODE: name = "XML::LibXML::Element"; break; case XML_TEXT_NODE: name = "XML::LibXML::Text"; break; case XML_COMMENT_NODE: name = "XML::LibXML::Comment"; break; case XML_CDATA_SECTION_NODE: name = "XML::LibXML::CDATASection"; break; case XML_ATTRIBUTE_NODE: name = "XML::LibXML::Attr"; break; case XML_DOCUMENT_NODE: case XML_HTML_DOCUMENT_NODE: name = "XML::LibXML::Document"; break; case XML_DOCUMENT_FRAG_NODE: name = "XML::LibXML::DocumentFragment"; break; case XML_NAMESPACE_DECL: name = "XML::LibXML::Namespace"; break; case XML_DTD_NODE: name = "XML::LibXML::Dtd"; break; case XML_PI_NODE: name = "XML::LibXML::PI"; break; default: name = "XML::LibXML::Node"; break; }; return name; } return ""; } static ProxyNodePtr x_PmmNewNode(xmlNodePtr node) { ProxyNodePtr proxy = NULL; if ( node == NULL ) { return NULL; } if ( node->_private == NULL ) { switch ( node->type ) { case XML_DOCUMENT_NODE: case XML_HTML_DOCUMENT_NODE: case XML_DOCB_DOCUMENT_NODE: proxy = (ProxyNodePtr)xmlMalloc(sizeof(struct _DocProxyNode)); if (proxy != NULL) { ((DocProxyNodePtr)proxy)->psvi_status = Pmm_NO_PSVI; x_SetPmmENCODING(proxy, XML_CHAR_ENCODING_NONE); } break; default: proxy = (ProxyNodePtr)xmlMalloc(sizeof(struct _ProxyNode)); break; } if (proxy != NULL) { proxy->node = node; proxy->owner = NULL; proxy->count = 0; node->_private = (void*) proxy; } } else { proxy = (ProxyNodePtr)node->_private; } return proxy; } SV * x_PmmNodeToSv(xmlNodePtr node, ProxyNodePtr owner) { ProxyNodePtr dfProxy= NULL; SV * retval = &PL_sv_undef; const char * CLASS = "XML::LibXML::Node"; if ( node != NULL ) { #ifdef XML_LIBXML_THREADS if( x_PmmUSEREGISTRY ) SvLOCK(x_PROXY_NODE_REGISTRY_MUTEX); #endif /* find out about the class */ CLASS = x_PmmNodeTypeName( node ); if ( node->_private != NULL ) { dfProxy = x_PmmNewNode(node); /* warn(" at 0x%08.8X\n", dfProxy); */ } else { dfProxy = x_PmmNewNode(node); /* fprintf(stderr, " at 0x%08.8X\n", dfProxy); */ if ( dfProxy != NULL ) { if ( owner != NULL ) { dfProxy->owner = x_PmmNODE( owner ); x_PmmREFCNT_inc( owner ); /* fprintf(stderr, "REFCNT incremented on owner: 0x%08.8X\n", owner); */ } } else { warn("x_PmmNodeToSv: proxy creation failed!\n"); } } retval = NEWSV(0,0); sv_setref_pv( retval, CLASS, (void*)dfProxy ); #ifdef XML_LIBXML_THREADS if( x_PmmUSEREGISTRY ) x_PmmRegistryREFCNT_inc(dfProxy); #endif x_PmmREFCNT_inc(dfProxy); /* fprintf(stderr, "REFCNT incremented on node: 0x%08.8X\n", dfProxy); */ switch ( node->type ) { case XML_DOCUMENT_NODE: case XML_HTML_DOCUMENT_NODE: case XML_DOCB_DOCUMENT_NODE: if ( ((xmlDocPtr)node)->encoding != NULL ) { x_SetPmmENCODING(dfProxy, (int)xmlParseCharEncoding( (const char*)((xmlDocPtr)node)->encoding )); } break; default: break; } #ifdef XML_LIBXML_THREADS if( x_PmmUSEREGISTRY ) SvUNLOCK(x_PROXY_NODE_REGISTRY_MUTEX); #endif } else { warn( "x_PmmNodeToSv: no node found!\n" ); } return retval; } #endif XML-Hash-XS-0.64/src/xh_log.h0000644000175000017500000001275713255511534014276 0ustar yurayura#include "xh_config.h" #include "xh_core.h" #ifndef _XH_LOG_H_ #define _XH_LOG_H_ typedef enum { XH_LOG_CRITIC = 0, XH_LOG_ERROR, XH_LOG_WARN, XH_LOG_NOTICE, XH_LOG_INFO, XH_LOG_DEBUG, XH_LOG_TRACE } xh_log_level_t; #ifdef WITH_TRACE #define xh_log_debug0(msg) \ xh_log(XH_LOG_DEBUG, XH_FUNCTION, __LINE__, msg) #define xh_log_debug1(msg, arg1) \ xh_log(XH_LOG_DEBUG, XH_FUNCTION, __LINE__, msg, arg1) #define xh_log_debug2(msg, arg1, arg2) \ xh_log(XH_LOG_DEBUG, XH_FUNCTION, __LINE__, msg, arg1, arg2) #define xh_log_debug3(msg, arg1, arg2, arg3) \ xh_log(XH_LOG_DEBUG, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3) #define xh_log_debug4(msg, arg1, arg2, arg3, arg4) \ xh_log(XH_LOG_DEBUG, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3, arg4) #define xh_log_debug5(msg, arg1, arg2, arg3, arg4, arg5) \ xh_log(XH_LOG_DEBUG, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3, arg4, arg5) #define xh_log_debug6(msg, arg1, arg2, arg3, arg4, arg5, arg6) \ xh_log(XH_LOG_DEBUG, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3, arg4, arg5, arg6) #define xh_log_debug7(msg, arg1, arg2, arg3, arg4, arg5, arg6, arg7) \ xh_log(XH_LOG_DEBUG, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3, arg4, arg5, arg6, arg7) #define xh_log_debug8(msg, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8) \ xh_log(XH_LOG_DEBUG, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8) #else #define xh_log_debug0(msg) #define xh_log_debug1(msg, arg1) #define xh_log_debug2(msg, arg1, arg2) #define xh_log_debug3(msg, arg1, arg2, arg3) #define xh_log_debug4(msg, arg1, arg2, arg3, arg4) #define xh_log_debug5(msg, arg1, arg2, arg3, arg4, arg5) #define xh_log_debug6(msg, arg1, arg2, arg3, arg4, arg5, arg6) #define xh_log_debug7(msg, arg1, arg2, arg3, arg4, arg5, arg6, arg7) #define xh_log_debug8(msg, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8) #endif #ifdef WITH_TRACE #define xh_log_trace0(msg) \ xh_log(XH_LOG_TRACE, XH_FUNCTION, __LINE__, msg) #define xh_log_trace1(msg, arg1) \ xh_log(XH_LOG_TRACE, XH_FUNCTION, __LINE__, msg, arg1) #define xh_log_trace2(msg, arg1, arg2) \ xh_log(XH_LOG_TRACE, XH_FUNCTION, __LINE__, msg, arg1, arg2) #define xh_log_trace3(msg, arg1, arg2, arg3) \ xh_log(XH_LOG_TRACE, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3) #define xh_log_trace4(msg, arg1, arg2, arg3, arg4) \ xh_log(XH_LOG_TRACE, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3, arg4) #define xh_log_trace5(msg, arg1, arg2, arg3, arg4, arg5) \ xh_log(XH_LOG_TRACE, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3, arg4, arg5) #define xh_log_trace6(msg, arg1, arg2, arg3, arg4, arg5, arg6) \ xh_log(XH_LOG_TRACE, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3, arg4, arg5, arg6) #define xh_log_trace7(msg, arg1, arg2, arg3, arg4, arg5, arg6, arg7) \ xh_log(XH_LOG_TRACE, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3, arg4, arg5, arg6, arg7) #define xh_log_trace8(msg, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8) \ xh_log(XH_LOG_TRACE, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8) #else #define xh_log_trace0(msg) #define xh_log_trace1(msg, arg1) #define xh_log_trace2(msg, arg1, arg2) #define xh_log_trace3(msg, arg1, arg2, arg3) #define xh_log_trace4(msg, arg1, arg2, arg3, arg4) #define xh_log_trace5(msg, arg1, arg2, arg3, arg4, arg5) #define xh_log_trace6(msg, arg1, arg2, arg3, arg4, arg5, arg6) #define xh_log_trace7(msg, arg1, arg2, arg3, arg4, arg5, arg6, arg7) #define xh_log_trace8(msg, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8) #endif #define xh_log_error0(msg) \ xh_log(XH_LOG_ERROR, XH_FUNCTION, __LINE__, msg) #define xh_log_error1(msg, arg1) \ xh_log(XH_LOG_ERROR, XH_FUNCTION, __LINE__, msg, arg1) #define xh_log_error2(msg, arg1, arg2) \ xh_log(XH_LOG_ERROR, XH_FUNCTION, __LINE__, msg, arg1, arg2) #define xh_log_error3(msg, arg1, arg2, arg3) \ xh_log(XH_LOG_ERROR, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3) #define xh_log_error4(msg, arg1, arg2, arg3, arg4) \ xh_log(XH_LOG_ERROR, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3, arg4) #define xh_log_error5(msg, arg1, arg2, arg3, arg4, arg5) \ xh_log(XH_LOG_ERROR, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3, arg4, arg5) #define xh_log_error6(msg, arg1, arg2, arg3, arg4, arg5, arg6) \ xh_log(XH_LOG_ERROR, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3, arg4, arg5, arg6) #define xh_log_error7(msg, arg1, arg2, arg3, arg4, arg5, arg6, arg7) \ xh_log(XH_LOG_ERROR, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3, arg4, arg5, arg6, arg7) #define xh_log_error8(msg, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8) \ xh_log(XH_LOG_ERROR, XH_FUNCTION, __LINE__, msg, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8) void xh_log(xh_log_level_t log_level, const char *func, xh_int_t line, const char *msg, ...); #endif /* _XH_LOG_H_ */ XML-Hash-XS-0.64/src/xh_core.h0000644000175000017500000000211213177671425014436 0ustar yurayura#ifndef _XH_CORE_H_ #define _XH_CORE_H_ /* * Concatenate preprocessor tokens A and B without expanding macro definitions * (however, if invoked from a macro, macro arguments are expanded). */ #define PPCAT_NX(A, B) A ## B /* * Concatenate preprocessor tokens A and B after macro-expanding them. */ #define PPCAT(A, B) PPCAT_NX(A, B) /* * Turn A into a string literal without expanding macro definitions * (however, if invoked from a macro, macro arguments are expanded). */ #define STRINGIZE_NX(A) #A /* * Turn A into a string literal after macro-expanding it. */ #define STRINGIZE(A) STRINGIZE_NX(A) #ifndef FALSE #define FALSE (0) #endif #ifndef TRUE #define TRUE (1) #endif #include "xh_log.h" #include "xh_string.h" #include "xh_sort.h" #include "xh_stack.h" #include "xh_stash.h" #include "xh_param.h" #include "xh_buffer_helper.h" #include "xh_buffer.h" #include "xh_perl_buffer.h" #include "xh_encoder.h" #include "xh_reader.h" #include "xh_writer.h" #include "xh.h" #include "xh_h2x.h" #include "xh_x2h.h" #include "xh_xml.h" #include "xh_dom.h" #endif /* _XH_CORE_H_ */ XML-Hash-XS-0.64/src/xh_encoder.c0000644000175000017500000001265413325066767015136 0ustar yurayura#include "xh_config.h" #include "xh_core.h" #ifdef XH_HAVE_ENCODER #ifdef XH_HAVE_ICU static void xh_encoder_uconv_destroy(UConverter *uconv) { if (uconv != NULL) { ucnv_close(uconv); } } static UConverter * xh_encoder_uconv_create(xh_char_t *encoding, xh_bool_t toUnicode) { UConverter *uconv; UErrorCode status = U_ZERO_ERROR; uconv = ucnv_open((char *) encoding, &status); if ( U_FAILURE(status) ) { return NULL; } if (toUnicode) { ucnv_setToUCallBack(uconv, UCNV_TO_U_CALLBACK_STOP, NULL, NULL, NULL, &status); } else { ucnv_setFromUCallBack(uconv, UCNV_FROM_U_CALLBACK_STOP, NULL, NULL, NULL, &status); } return uconv; } #endif void xh_encoder_destroy(xh_encoder_t *encoder) { if (encoder != NULL) { #ifdef XH_HAVE_ICONV if (encoder->iconv != NULL) { xh_log_debug0("destroy iconv encoder"); iconv_close(encoder->iconv); } #endif #ifdef XH_HAVE_ICU if (encoder->uconv_from != NULL) { xh_log_debug0("destroy icu encoder"); xh_encoder_uconv_destroy(encoder->uconv_from); xh_encoder_uconv_destroy(encoder->uconv_to); } #endif free(encoder); } } xh_encoder_t * xh_encoder_create(xh_char_t *tocode, xh_char_t *fromcode) { xh_encoder_t *encoder; encoder = malloc(sizeof(xh_encoder_t)); if (encoder == NULL) { return NULL; } memset(encoder, 0, sizeof(xh_encoder_t)); xh_str_copy(encoder->tocode, tocode, XH_PARAM_LEN); xh_str_copy(encoder->fromcode, fromcode, XH_PARAM_LEN); #ifdef XH_HAVE_ICONV xh_log_debug2("create iconv encoder from: '%s' to: '%s'", fromcode, tocode); encoder->iconv = iconv_open((char *) tocode, (char *) fromcode); if (encoder->iconv != (iconv_t) -1) { encoder->type = XH_ENC_ICONV; return encoder; } encoder->iconv = NULL; #endif #ifdef XH_HAVE_ICU xh_log_debug2("create icu encoder from: '%s' to: '%s'", fromcode, tocode); encoder->uconv_to = xh_encoder_uconv_create(tocode, 1); if (encoder->uconv_to != NULL) { encoder->uconv_from = xh_encoder_uconv_create(fromcode, 0); if (encoder->uconv_from != NULL) { encoder->type = XH_ENC_ICU; encoder->pivotSource = encoder->pivotTarget = encoder->pivotStart = encoder->pivotBuffer; encoder->pivotLimit = encoder->pivotBuffer + sizeof(encoder->pivotBuffer) / sizeof(encoder->pivotBuffer[0]); return encoder; } } #endif xh_encoder_destroy(encoder); return NULL; } void xh_encoder_encode_perl_buffer(xh_encoder_t *encoder, xh_perl_buffer_t *main_buf, xh_perl_buffer_t *enc_buf) { xh_char_t *src = main_buf->start; #ifdef XH_HAVE_ICONV if (encoder->type == XH_ENC_ICONV) { size_t in_left = main_buf->cur - main_buf->start; size_t out_left = enc_buf->end - enc_buf->cur; size_t converted = iconv(encoder->iconv, (char **) &src, &in_left, (char **) &enc_buf->cur, &out_left); if (converted == (size_t) -1) { croak("Encoding error"); } return; } #endif #ifdef XH_HAVE_ICU UErrorCode err = U_ZERO_ERROR; ucnv_convertEx(encoder->uconv_to, encoder->uconv_from, (char **) &enc_buf->cur, (char *) enc_buf->end, (const char **) &src, (char *) main_buf->cur, NULL, NULL, NULL, NULL, FALSE, TRUE, &err); if ( U_FAILURE(err) ) { croak("Encoding error: %d", err); } #endif } void xh_encoder_encode_string(xh_encoder_t *encoder, xh_char_t **src, size_t *src_left, xh_char_t **dst, size_t *dst_left) { #ifdef XH_HAVE_ICONV if (encoder->type == XH_ENC_ICONV) { size_t converted = iconv(encoder->iconv, (char **) src, src_left, (char **) dst, dst_left); if (converted == (size_t) -1) { switch (errno) { case EILSEQ: croak("Encoding error: invalid char found"); case E2BIG: encoder->state = XH_ENC_BUFFER_OVERFLOW; break; case EINVAL: encoder->state = XH_ENC_TRUNCATED_CHAR_FOUND; break; default: croak("Encoding error"); } } else { encoder->state = XH_ENC_OK; } return; } #endif #ifdef XH_HAVE_ICU UErrorCode err = U_ZERO_ERROR; xh_char_t *old_src = *src; xh_char_t *old_dst = *dst; ucnv_convertEx(encoder->uconv_to, encoder->uconv_from, (char **) dst, (char *) (*dst + *dst_left), (const char **) src, (char *) (*src + *src_left), encoder->pivotStart, &encoder->pivotSource, &encoder->pivotTarget, encoder->pivotLimit, FALSE, FALSE, &err); *src_left -= *src - old_src; *dst_left -= *dst - old_dst; if ( U_FAILURE(err) ) { switch (err) { case U_INVALID_CHAR_FOUND: croak("Encoding error: invalid char found"); case U_BUFFER_OVERFLOW_ERROR: encoder->state = XH_ENC_BUFFER_OVERFLOW; break; case U_TRUNCATED_CHAR_FOUND: encoder->state = XH_ENC_TRUNCATED_CHAR_FOUND; break; default: croak("Encoding error: %d", err); } } else { encoder->state = XH_ENC_OK; } #endif } #endif /* XH_HAVE_ENCODER */ XML-Hash-XS-0.64/src/xh_writer.h0000644000175000017500000000377313325066767015042 0ustar yurayura#ifndef _XH_WRITER_H_ #define _XH_WRITER_H_ #include "xh_config.h" #include "xh_core.h" #define XH_WRITER_RESIZE_BUFFER(w, b, l) \ if (((l) + 1) > (size_t) (b->end - b->cur)) { \ xh_writer_resize_buffer(w, (l) + 1); \ } typedef struct _xh_writer_t xh_writer_t; struct _xh_writer_t { #ifdef XH_HAVE_ENCODER xh_encoder_t *encoder; xh_perl_buffer_t enc_buf; #endif PerlIO *perl_io; SV *perl_obj; xh_perl_buffer_t main_buf; xh_int_t indent; xh_int_t indent_count; xh_bool_t trim; }; SV *xh_writer_flush_buffer(xh_writer_t *writer, xh_perl_buffer_t *buf); SV *xh_writer_flush(xh_writer_t *writer); void xh_writer_resize_buffer(xh_writer_t *writer, size_t inc); void xh_writer_destroy(xh_writer_t *writer); void xh_writer_init(xh_writer_t *writer, xh_char_t *encoding, void *output, size_t size, xh_uint_t indent, xh_bool_t trim); XH_INLINE void xh_writer_write_to_perl_obj(xh_perl_buffer_t *buf, SV *perl_obj) { size_t len = buf->cur - buf->start; if (len > 0) { dSP; *buf->cur = '\0'; SvCUR_set(buf->scalar, len); ENTER; SAVETMPS; PUSHMARK(SP); EXTEND(SP, 2); PUSHs((SV *) perl_obj); PUSHs(buf->scalar); PUTBACK; call_method("PRINT", G_DISCARD); FREETMPS; LEAVE; buf->cur = buf->start; } } XH_INLINE void xh_writer_write_to_perl_io(xh_perl_buffer_t *buf, PerlIO *perl_io) { size_t len = buf->cur - buf->start; if (len > 0) { *buf->cur = '\0'; SvCUR_set(buf->scalar, len); PerlIO_write(perl_io, buf->start, len); buf->cur = buf->start; } } XH_INLINE SV * xh_writer_write_to_perl_scalar(xh_perl_buffer_t *buf) { *buf->cur = '\0'; SvCUR_set(buf->scalar, buf->cur - buf->start); return buf->scalar; } #endif /* _XH_WRITER_H_ */ XML-Hash-XS-0.64/src/xh_buffer_helper.h0000644000175000017500000001565014735236007016323 0ustar yurayura#ifndef _XH_BUFFER_HELPER_H_ #define _XH_BUFFER_HELPER_H_ #include "xh_config.h" #include "xh_core.h" #define XH_BUFFER_WRITE_LONG_STRING(b, s, l) \ memcpy(b->cur, s, l); \ b->cur += l; #define XH_BUFFER_WRITE_SHORT_STRING(b, s, l) \ while (l--) { \ *b->cur++ = *s++; \ } #define XH_BUFFER_WRITE_STRING(b, s, l) \ if (l < 17) { \ XH_BUFFER_WRITE_SHORT_STRING(b, s, l) \ } \ else { \ XH_BUFFER_WRITE_LONG_STRING(b, s, l) \ } #define XH_BUFFER_WRITE_CHAR(b, c) \ *b->cur++ = c; #ifdef XH_SPARC_ARCH #define XH_BUFFER_WRITE_CHAR2(b, s) \ XH_BUFFER_WRITE_LONG_STRING(b, s, 2) #else #define XH_BUFFER_WRITE_CHAR2(b, s) \ *((uint16_t *) b->cur) = *((uint16_t *) (s)); \ b->cur += 2; #endif #ifdef XH_SPARC_ARCH #define XH_BUFFER_WRITE_CHAR3(b, s) \ XH_BUFFER_WRITE_LONG_STRING(b, s, 3) #else #define XH_BUFFER_WRITE_CHAR3(b, s) \ XH_BUFFER_WRITE_CHAR2(b, s) \ XH_BUFFER_WRITE_CHAR(b, s[2]) #endif #ifdef XH_SPARC_ARCH #define XH_BUFFER_WRITE_CHAR4(b, s) \ XH_BUFFER_WRITE_LONG_STRING(b, s, 4) #else #define XH_BUFFER_WRITE_CHAR4(b, s) \ *((uint32_t *) b->cur) = *((uint32_t *) (s)); \ b->cur += 4; #endif #ifdef XH_SPARC_ARCH #define XH_BUFFER_WRITE_CHAR5(b, s) \ XH_BUFFER_WRITE_LONG_STRING(b, s, 5) #else #define XH_BUFFER_WRITE_CHAR5(b, s) \ XH_BUFFER_WRITE_CHAR4(b, s) \ XH_BUFFER_WRITE_CHAR(b, s[4]) #endif #ifdef XH_SPARC_ARCH #define XH_BUFFER_WRITE_CHAR6(b, s) \ XH_BUFFER_WRITE_LONG_STRING(b, s, 6) #else #define XH_BUFFER_WRITE_CHAR6(b, s) \ XH_BUFFER_WRITE_CHAR4(b, s) \ XH_BUFFER_WRITE_CHAR2(b, s + 4) #endif #ifdef XH_SPARC_ARCH #define XH_BUFFER_WRITE_CHAR7(b, s) \ XH_BUFFER_WRITE_LONG_STRING(b, s, 7) #else #define XH_BUFFER_WRITE_CHAR7(b, s) \ XH_BUFFER_WRITE_CHAR6(b, s) \ XH_BUFFER_WRITE_CHAR(b, s[6]) #endif #ifdef XH_SPARC_ARCH #define XH_BUFFER_WRITE_CHAR8(b, s) \ XH_BUFFER_WRITE_LONG_STRING(b, s, 8) #else #define XH_BUFFER_WRITE_CHAR8(b, s) \ XH_BUFFER_WRITE_CHAR4(b, s) \ XH_BUFFER_WRITE_CHAR4(b, s + 4) #endif #ifdef XH_SPARC_ARCH #define XH_BUFFER_WRITE_CHAR9(b, s) \ XH_BUFFER_WRITE_LONG_STRING(b, s, 9) #else #define XH_BUFFER_WRITE_CHAR9(b, s) \ XH_BUFFER_WRITE_CHAR8(b, s) \ XH_BUFFER_WRITE_CHAR(b, s[8]) #endif #define XH_BUFFER_WRITE_ESCAPE_STRING(b, s, l) \ while (l--) { \ switch (*b->cur = *s++) { \ case '\r': \ XH_BUFFER_WRITE_CHAR5(b, " ") \ break; \ case '<': \ XH_BUFFER_WRITE_CHAR4(b, "<") \ break; \ case '>': \ XH_BUFFER_WRITE_CHAR4(b, ">") \ break; \ case '&': \ XH_BUFFER_WRITE_CHAR5(b, "&") \ break; \ default: \ b->cur++; \ } \ } #define XH_BUFFER_WRITE_ESCAPE_ATTR(b, s, l) \ while (l--) { \ switch (*b->cur = *s++) { \ case '\n': \ XH_BUFFER_WRITE_CHAR5(b, " ") \ break; \ case '\r': \ XH_BUFFER_WRITE_CHAR5(b, " ") \ break; \ case '\t': \ XH_BUFFER_WRITE_CHAR4(b, " ") \ break; \ case '<': \ XH_BUFFER_WRITE_CHAR4(b, "<") \ break; \ case '>': \ XH_BUFFER_WRITE_CHAR4(b, ">") \ break; \ case '&': \ XH_BUFFER_WRITE_CHAR5(b, "&") \ break; \ case '"': \ XH_BUFFER_WRITE_CHAR6(b, """) \ break; \ default: \ b->cur++; \ } \ } #define XH_BUFFER_WRITE_CONSTANT(b, s) \ XH_BUFFER_WRITE_LONG_STRING(b, s, sizeof(s) - 1) #endif /* _XH_BUFFER_HELPER_H_ */ XML-Hash-XS-0.64/src/xh_writer.c0000644000175000017500000000612613325066767015030 0ustar yurayura#include "xh_config.h" #include "xh_core.h" void xh_writer_resize_buffer(xh_writer_t *writer, size_t inc) { (void) xh_writer_flush(writer); xh_perl_buffer_grow(&writer->main_buf, inc); } SV * xh_writer_flush_buffer(xh_writer_t *writer, xh_perl_buffer_t *buf) { if (writer->perl_obj != NULL) { xh_writer_write_to_perl_obj(buf, writer->perl_obj); return &PL_sv_undef; } else if (writer->perl_io != NULL) { xh_writer_write_to_perl_io(buf, writer->perl_io); return &PL_sv_undef; } return xh_writer_write_to_perl_scalar(buf); } #ifdef XH_HAVE_ENCODER void xh_writer_encode_buffer(xh_writer_t *writer, xh_perl_buffer_t *main_buf, xh_perl_buffer_t *enc_buf) { size_t len; /* 1 char -> 4 chars and '\0' */ len = (main_buf->cur - main_buf->start) * 4 + 1; if (len > (size_t) (enc_buf->end - enc_buf->cur)) { xh_writer_flush_buffer(writer, enc_buf); xh_perl_buffer_grow(enc_buf, len); } xh_encoder_encode_perl_buffer(writer->encoder, main_buf, enc_buf); } #endif SV * xh_writer_flush(xh_writer_t *writer) { xh_perl_buffer_t *buf; #ifdef XH_HAVE_ENCODER if (writer->encoder != NULL) { xh_writer_encode_buffer(writer, &writer->main_buf, &writer->enc_buf); buf = &writer->enc_buf; } else { buf = &writer->main_buf; } #else buf = &writer->main_buf; #endif return xh_writer_flush_buffer(writer, buf); } void xh_writer_destroy(xh_writer_t *writer) { if (writer->perl_obj != NULL || writer->perl_io != NULL) { if (writer->main_buf.scalar != NULL) SvREFCNT_dec(writer->main_buf.scalar); #ifdef XH_HAVE_ENCODER if (writer->enc_buf.scalar != NULL) SvREFCNT_dec(writer->enc_buf.scalar); } else if (writer->encoder != NULL) { if (writer->main_buf.scalar != NULL) SvREFCNT_dec(writer->main_buf.scalar); #endif } #ifdef XH_HAVE_ENCODER xh_encoder_destroy(writer->encoder); #endif } void xh_writer_init(xh_writer_t *writer, xh_char_t *encoding, void *output, size_t size, xh_uint_t indent, xh_bool_t trim) { writer->indent = indent; writer->trim = trim; xh_perl_buffer_init(&writer->main_buf, size); if (encoding[0] != '\0' && xh_strcasecmp(encoding, XH_INTERNAL_ENCODING) != 0) { #ifdef XH_HAVE_ENCODER writer->encoder = xh_encoder_create(encoding, XH_CHAR_CAST XH_INTERNAL_ENCODING); if (writer->encoder == NULL) { croak("Can't create encoder for '%s'", encoding); } xh_perl_buffer_init(&writer->enc_buf, size * 4); #else croak("Can't create encoder for '%s'", encoding); #endif } if (output != NULL) { MAGIC *mg; GV *gv = (GV *) output; IO *io = GvIO(gv); if (!io) croak("Can't use file handle as a PerlIO handle"); if ((mg = SvTIED_mg(MUTABLE_SV(io), PERL_MAGIC_tiedscalar))) { /* Tied handle */ writer->perl_obj = SvTIED_obj(MUTABLE_SV(io), mg); } else { /* PerlIO handle */ writer->perl_io = IoOFP(io); } } } XML-Hash-XS-0.64/src/xh_perl_buffer.c0000644000175000017500000000230012531035107015753 0ustar yurayura#include "xh_config.h" #include "xh_core.h" void xh_perl_buffer_init(xh_perl_buffer_t *buf, size_t size) { buf->scalar = newSV(size); sv_setpv(buf->scalar, ""); buf->start = buf->cur = XH_CHAR_CAST SvPVX(buf->scalar); buf->end = buf->start + size; xh_log_debug2("buf: %p size: %lu", buf->start, size); } void xh_perl_buffer_grow(xh_perl_buffer_t *buf, size_t inc) { size_t size, use; if (inc <= (size_t) (buf->end - buf->cur)) return; size = buf->end - buf->start; use = buf->cur - buf->start; xh_log_debug2("old buf: %p size: %lu", buf->start, size); size += inc < size ? size : inc; SvCUR_set(buf->scalar, use); SvGROW(buf->scalar, size); buf->start = XH_CHAR_CAST SvPVX(buf->scalar); buf->cur = buf->start + use; buf->end = buf->start + size; xh_log_debug2("new buf: %p size: %lu", buf->start, size); } void xh_perl_buffer_sync(xh_perl_buffer_t *buf) { size_t use = buf->cur - buf->start; size_t size = SvLEN(buf->scalar); buf->start = XH_CHAR_CAST SvPVX(buf->scalar); buf->end = buf->start + size; buf->cur = buf->start + use; xh_log_debug2("buf: %p size: %lu", buf->start, size); } XML-Hash-XS-0.64/src/xh_buffer.c0000644000175000017500000000157112531035107014742 0ustar yurayura#include "xh_config.h" #include "xh_core.h" void xh_buffer_init(xh_buffer_t *buf, size_t size) { buf->start = buf->cur = malloc(size); if (buf->start == NULL) { croak("Memory allocation error"); } buf->end = buf->start + size; xh_log_debug2("buf: %p size: %lu", buf->start, size); } void xh_buffer_grow(xh_buffer_t *buf, size_t inc) { size_t size, use; if (inc <= (size_t) (buf->end - buf->cur)) { return; } size = buf->end - buf->start; use = buf->cur - buf->start; xh_log_debug2("old buf: %p size: %lu", buf->start, size); size += inc < size ? size : inc; buf->start = realloc(buf->start, size); if (buf->start == NULL) { croak("Memory allocation error"); } buf->cur = buf->start + use; buf->end = buf->start + size; xh_log_debug2("new buf: %p size: %lu", buf->start, size); } XML-Hash-XS-0.64/src/xh_dom.h0000644000175000017500000001412712531035107014256 0ustar yurayura#ifndef _XH_DOM_H_ #define _XH_DOM_H_ #ifdef XH_HAVE_DOM #include "xh_config.h" #include "xh_core.h" #define Pmm_NO_PSVI 0 #define Pmm_PSVI_TAINTED 1 struct _ProxyNode { xmlNodePtr node; xmlNodePtr owner; int count; }; struct _DocProxyNode { xmlNodePtr node; xmlNodePtr owner; int count; int encoding; /* only used for proxies of xmlDocPtr */ int psvi_status; /* see below ... */ }; /* helper type for the proxy structure */ typedef struct _DocProxyNode DocProxyNode; typedef struct _ProxyNode ProxyNode; /* pointer to the proxy structure */ typedef ProxyNode* ProxyNodePtr; typedef DocProxyNode* DocProxyNodePtr; /* this my go only into the header used by the xs */ #define SvPROXYNODE(x) (INT2PTR(ProxyNodePtr,SvIV(SvRV(x)))) #define PmmPROXYNODE(x) (INT2PTR(ProxyNodePtr,x->_private)) #define SvNAMESPACE(x) (INT2PTR(xmlNsPtr,SvIV(SvRV(x)))) #define x_PmmREFCNT(node) node->count #define x_PmmREFCNT_inc(node) node->count++ #define x_PmmNODE(xnode) xnode->node #define x_PmmOWNER(node) node->owner #define x_PmmOWNERPO(node) ((node && x_PmmOWNER(node)) ? (ProxyNodePtr)x_PmmOWNER(node)->_private : node) #define x_PmmENCODING(node) ((DocProxyNodePtr)(node))->encoding #define x_PmmNodeEncoding(node) ((DocProxyNodePtr)(node->_private))->encoding #define x_SetPmmENCODING(node,code) x_PmmENCODING(node)=(code) #define x_SetPmmNodeEncoding(node,code) x_PmmNodeEncoding(node)=(code) #define x_PmmSvNode(n) x_PmmSvNodeExt(n,1) #define x_PmmUSEREGISTRY (x_PROXY_NODE_REGISTRY_MUTEX != NULL) #define x_PmmREGISTRY (INT2PTR(xmlHashTablePtr,SvIV(SvRV(get_sv("XML::LibXML::__PROXY_NODE_REGISTRY",0))))) SV *x_PmmNodeToSv(xmlNodePtr node, ProxyNodePtr owner); XH_INLINE xmlNodePtr xh_dom_new_node(xh_h2x_ctx_t *ctx, xmlNodePtr rootNode, xh_char_t *name, size_t name_len, SV *value, xh_bool_t raw) { xh_char_t *tmp; xh_char_t *content; size_t content_len; STRLEN str_len; xh_char_t ch; if (value == NULL) { content = XH_EMPTY_STRING; content_len = 0; } else { content = XH_CHAR_CAST SvPV(value, str_len); content_len = str_len; } tmp = NULL; if (name[0] >= '1' && name[0] <= '9') { tmp = malloc(name_len + 2); if (tmp == NULL) { croak("Memory allocation error"); } (void) xh_strcpy(&tmp[1], name); name = tmp; name[0] = '_'; } if (ctx->opts.trim && content_len) { content = xh_str_trim(content, &content_len); ch = content[content_len]; content[content_len] = '\0'; if (content_len && !raw) { rootNode = xmlNewTextChild(rootNode, NULL, BAD_CAST name, BAD_CAST content); } else { rootNode = xmlNewChild(rootNode, NULL, BAD_CAST name, BAD_CAST content); } content[content_len] = ch; } else { if (content_len && !raw) { rootNode = xmlNewTextChild(rootNode, NULL, BAD_CAST name, BAD_CAST content); } else { rootNode = xmlNewChild(rootNode, NULL, BAD_CAST name, BAD_CAST content); } } if (tmp != NULL) { free(tmp); } return rootNode; } XH_INLINE void xh_dom_new_content(xh_h2x_ctx_t *ctx, xmlNodePtr rootNode, SV *value) { xh_char_t *content; size_t content_len; STRLEN str_len; xh_char_t ch; if (value == NULL) { content = XH_EMPTY_STRING; content_len = 0; } else { content = XH_CHAR_CAST SvPV(value, str_len); content_len = str_len; } if (ctx->opts.trim && content_len) { content = xh_str_trim(content, &content_len); ch = content[content_len]; content[content_len] = '\0'; xmlNodeAddContentLen(rootNode, BAD_CAST content, content_len); content[content_len] = ch; } else { xmlNodeAddContentLen(rootNode, BAD_CAST content, content_len); } } XH_INLINE void xh_dom_new_comment(xh_h2x_ctx_t *ctx, xmlNodePtr rootNode, SV *value) { xh_char_t *content; size_t content_len; STRLEN str_len; xh_char_t ch; if (value == NULL) { content = XH_EMPTY_STRING; content_len = 0; } else { content = XH_CHAR_CAST SvPV(value, str_len); content_len = str_len; } if (ctx->opts.trim && content_len) { content = xh_str_trim(content, &content_len); ch = content[content_len]; content[content_len] = '\0'; (void) xmlAddChild(rootNode, xmlNewDocComment(rootNode->doc, BAD_CAST content)); content[content_len] = ch; } else { (void) xmlAddChild(rootNode, xmlNewDocComment(rootNode->doc, BAD_CAST content)); } } XH_INLINE void xh_dom_new_cdata(xh_h2x_ctx_t *ctx, xmlNodePtr rootNode, SV *value) { xh_char_t *content; size_t content_len; STRLEN str_len; if (value == NULL) { content = XH_EMPTY_STRING; content_len = 0; } else { content = XH_CHAR_CAST SvPV(value, str_len); content_len = str_len; } if (ctx->opts.trim && content_len) { content = xh_str_trim(content, &content_len); } (void) xmlAddChild(rootNode, xmlNewCDataBlock(rootNode->doc, BAD_CAST content, content_len)); } XH_INLINE void xh_dom_new_attribute(xh_h2x_ctx_t *XH_UNUSED(ctx), xmlNodePtr rootNode, xh_char_t *name, size_t name_len, SV *value) { xh_char_t *content; STRLEN str_len; xh_char_t *tmp; if (value == NULL) { content = NULL; } else { content = XH_CHAR_CAST SvPV(value, str_len); } tmp = NULL; if (name[0] >= '1' && name[0] <= '9') { tmp = malloc(name_len + 1); if (tmp == NULL) { croak("Memory allocation error"); } (void) xh_strcpy(&tmp[1], name); name = tmp; name[0] = '_'; } (void) xmlSetProp(rootNode, BAD_CAST name, BAD_CAST content); if (tmp != NULL) { free(tmp); } } #endif #endif /* _XH_DOM_H_ */ XML-Hash-XS-0.64/src/xh_config.h0000644000175000017500000001046014735235312014750 0ustar yurayura#ifndef _XH_CONFIG_H_ #define _XH_CONFIG_H_ #include "EXTERN.h" #include "perl.h" #define NO_XSLOCKS #include "XSUB.h" #define NEED_newRV_noinc #define NEED_newSVpvn_flags #define NEED_sv_2pv_flags_GLOBAL #include "ppport.h" #include #include #include #include #include #include #include #ifdef WIN32 #include #include #else #include #endif #if defined(__sparc__) || defined(__sparc) # define XH_SPARC_ARCH #endif #if defined(sun) || defined(__sun) # include # if defined(_LITTLE_ENDIAN) # define XH_LITTLE_ENDIAN # else # define XH_BIG_ENDIAN # endif #else # if defined(SVR4) || defined(__SVR4) # include # include # elif defined(_AIX) || defined(__TOS_AIX__) # include # elif defined(__FreeBSD__) || defined(__OpenBSD__) || defined(__NetBSD__) || defined(__DragonFly__) \ || defined(__APPLE__) # if defined(__NetBSD__) || defined(__OpenBSD__) # include # endif # include # elif defined(__linux__) || defined(__CYGWIN__) # include # endif # ifndef LITTLE_ENDIAN # ifdef __LITTLE_ENDIAN # define LITTLE_ENDIAN __LITTLE_ENDIAN # else # define LITTLE_ENDIAN _LITTLE_ENDIAN # endif # endif # ifndef BIG_ENDIAN # ifdef __BIG_ENDIAN # define BIG_ENDIAN __BIG_ENDIAN # else # define BIG_ENDIAN _BIG_ENDIAN # endif # endif # ifndef BYTE_ORDER # ifdef __BYTE_ORDER # define BYTE_ORDER __BYTE_ORDER # else # define BYTE_ORDER _BYTE_ORDER # endif # endif # if BYTE_ORDER == LITTLE_ENDIAN # define XH_LITTLE_ENDIAN # else # define XH_BIG_ENDIAN # endif #endif #ifndef MUTABLE_PTR #if defined(__GNUC__) && !defined(PERL_GCC_BRACE_GROUPS_FORBIDDEN) # define MUTABLE_PTR(p) ({ void *_p = (p); _p; }) #else # define MUTABLE_PTR(p) ((void *) (p)) #endif #endif #ifndef MUTABLE_SV #define MUTABLE_SV(p) ((SV *)MUTABLE_PTR(p)) #endif #ifndef SvRXOK #define SvRX(sv) (Perl_get_re_arg(aTHX_ sv)) #define SvRXOK(sv) (Perl_get_re_arg(aTHX_ sv) ? TRUE : FALSE) static REGEXP * Perl_get_re_arg(pTHX_ SV *sv) { MAGIC *mg; if (sv) { if (SvMAGICAL(sv)) mg_get(sv); if (SvROK(sv)) sv = MUTABLE_SV(SvRV(sv)); #if PERL_VERSION < 11 if (SvTYPE(sv) == SVt_PVMG && (mg = mg_find(sv, PERL_MAGIC_qr))) return (REGEXP *) mg->mg_obj; #else if (SvTYPE(sv) == SVt_REGEXP) return (REGEXP *) sv; #endif } return NULL; } #endif #if PERL_VERSION > 17 # define XH_AMAGIC(sv) HvAMAGIC(SvSTASH(sv)) #else # if PERL_VERSION > 8 # define XH_AMAGIC(sv) (SvFLAGS(sv) & SVf_AMAGIC) # else # define XH_AMAGIC(sv) ((SvFLAGS(sv) & SVf_AMAGIC) \ || ((mg = mg_find((SV*) SvSTASH(sv), PERL_MAGIC_overload_table)) \ && mg->mg_ptr && AMT_AMAGIC((AMT*)mg->mg_ptr))) # endif #endif #if PERL_VERSION > 13 # define XH_AMG_CALL_STRING(sv) AMG_CALLunary(sv, string_amg) #else # define XH_AMG_CALL_STRING(sv) AMG_CALLun(sv ,string) #endif #if __GNUC__ >= 3 # define expect(expr,value) __builtin_expect ((expr), (value)) # define XH_INLINE static inline # define XH_UNUSED(v) x __attribute__((unused)) #else # define expect(expr,value) (expr) # define XH_INLINE static # define XH_UNUSED(v) v #endif #if __STDC_VERSION__ < 199901L # if __GNUC__ >= 2 # define XH_FUNCTION __FUNCTION__ # else # define XH_FUNCTION "" # endif #else # define XH_FUNCTION __func__ #endif #ifdef _MSC_VER #define _CRT_SECURE_NO_WARNINGS #define _CRT_NONSTDC_NO_DEPRECATE #define strncasecmp _strnicmp #define strcasecmp _stricmp #endif #define expect_false(expr) expect ((expr) != 0, 0) #define expect_true(expr) expect ((expr) != 0, 1) typedef uintptr_t xh_bool_t; typedef uintptr_t xh_uint_t; typedef intptr_t xh_int_t; typedef u_char xh_char_t; #define XH_CHAR_CAST (xh_char_t *) #define XH_EMPTY_STRING (XH_CHAR_CAST "") #if defined(XH_HAVE_ICONV) || defined(XH_HAVE_ICU) #define XH_HAVE_ENCODER #endif #if defined(XH_HAVE_XML2) && defined(XH_HAVE_XML__LIBXML) #define XH_HAVE_DOM #endif #ifdef XH_HAVE_DOM #include #endif #define XH_HAVE_MMAP #endif /* _XH_CONFIG_H_ */ XML-Hash-XS-0.64/src/xh_string.h0000644000175000017500000001557714735243115015027 0ustar yurayura#ifndef _XH_STRING_H_ #define _XH_STRING_H_ #include "xh_config.h" #include "xh_core.h" #ifdef XH_LITTLE_ENDIAN #define xh_str_equal2(p, c0, c1) \ ((((uint32_t *) (p))[0] & 0xffff) == ((c1 << 8) | c0)) #define xh_str_equal3(p, c0, c1, c2) \ ((((uint32_t *) (p))[0] & 0xffffff) == ((c2 << 16) | (c1 << 8) | c0)) #define xh_str_equal4(p, c0, c1, c2, c3) \ (*(uint32_t *) (p) == ((c3 << 24) | (c2 << 16) | (c1 << 8) | c0)) #else #define xh_str_equal2(p, c0, c1) \ ((((uint32_t *) (p))[0] & 0xffff0000) == ((c0 << 24) | (c1 << 16))) #define xh_str_equal3(p, c0, c1, c2) \ ((((uint32_t *) (p))[0] & 0xffffff00) == ((c0 << 24) | (c1 << 16) | (c2 << 8))) #define xh_str_equal4(p, c0, c1, c2, c3) \ (*(uint32_t *) (p) == ((c0 << 24) | (c1 << 16) | (c2 << 8) | c3)) #endif #define xh_str_equal5(p, c0, c1, c2, c3, c4) \ (xh_str_equal4(p, c0, c1, c2, c3) && (p)[4] == c4) #define xh_str_equal6(p, c0, c1, c2, c3, c4, c5) \ (xh_str_equal4(p, c0, c1, c2, c3) && xh_str_equal2(&(p)[4], c4, c5)) #define xh_str_equal7(p, c0, c1, c2, c3, c4, c5, c6) \ (xh_str_equal4(p, c0, c1, c2, c3) && xh_str_equal3(&(p)[4], c4, c5, c6)) #define xh_str_equal8(p, c0, c1, c2, c3, c4, c5, c6, c7) \ (xh_str_equal4(p, c0, c1, c2, c3) && xh_str_equal4(&(p)[4], c4, c5, c6, c7)) #define xh_str_equal9(p, c0, c1, c2, c3, c4, c5, c6, c7, c8) \ (xh_str_equal8(p, c0, c1, c2, c3, c4, c5, c6, c7) && (p)[8] == c8) #define xh_str_equal10(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9) \ (xh_str_equal8(p, c0, c1, c2, c3, c4, c5, c6, c7) && xh_str_equal2(&p[8], c8, c9)) #define xh_str_equal11(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10) \ (xh_str_equal8(p, c0, c1, c2, c3, c4, c5, c6, c7) && xh_str_equal3(&p[8], c8, c9, c10)) #define xh_str_equal12(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11)\ (xh_str_equal8(p, c0, c1, c2, c3, c4, c5, c6, c7) && xh_str_equal4(&(p)[8], c8, c9, c10, c11)) #define xh_str_equal13(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, c12)\ (xh_str_equal8(p, c0, c1, c2, c3, c4, c5, c6, c7) && xh_str_equal5(&(p)[8], c8, c9, c10, c11, c12)) #define xh_str_equal14(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, c12, c13)\ (xh_str_equal8(p, c0, c1, c2, c3, c4, c5, c6, c7) && xh_str_equal6(&(p)[8], c8, c9, c10, c11, c12, c13)) #define xh_strcmp(s1, s2) strcmp((const char *) (s1), (const char *) (s2)) #define xh_strcasecmp(s1, s2) strcasecmp((const char *) (s1), (const char *) (s2)) #define xh_strncmp(s1, s2, n) strncmp((const char *) (s1), (const char *) (s2), (n)) #define xh_strlen(s) strlen((const char *) (s)) #define xh_strcpy(d, s) strcpy((char *) (d), (const char *) (s)) #define xh_strncpy(d, s, n) strncpy((char *) (d), (const char *) (s), (n)) #ifdef XH_SPARC_ARCH #define xh_str_auto_equal2(p, c0, c1, s) (xh_strncmp(p, s, 2) == 0) #define xh_str_auto_equal3(p, c0, c1, c2, s) (xh_strncmp(p, s, 3) == 0) #define xh_str_auto_equal4(p, c0, c1, c2, c3, s) (xh_strncmp(p, s, 4) == 0) #define xh_str_auto_equal5(p, c0, c1, c2, c3, c4, s) (xh_strncmp(p, s, 5) == 0) #define xh_str_auto_equal6(p, c0, c1, c2, c3, c4, c5, s) (xh_strncmp(p, s, 6) == 0) #define xh_str_auto_equal7(p, c0, c1, c2, c3, c4, c5, c6, s) (xh_strncmp(p, s, 7) == 0) #define xh_str_auto_equal8(p, c0, c1, c2, c3, c4, c5, c6, c7, s) (xh_strncmp(p, s, 8) == 0 #define xh_str_auto_equal9(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, s) (xh_strncmp(p, s, 9) == 0) #define xh_str_auto_equal10(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, s) (xh_strncmp(p, s, 10) == 0) #define xh_str_auto_equal11(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, s) (xh_strncmp(p, s, 11) == 0) #define xh_str_auto_equal12(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, s) (xh_strncmp(p, s, 12) == 0) #define xh_str_auto_equal13(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, c12, s) (xh_strncmp(p, s, 13) == 0) #define xh_str_auto_equal14(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, s) \ (xh_strncmp(p, s, 14) == 0) #else #define xh_str_auto_equal2(p, c0, c1, s) xh_str_equal2(p, c0, c1) #define xh_str_auto_equal3(p, c0, c1, c2, s) xh_str_equal3(p, c0, c1, c2) #define xh_str_auto_equal4(p, c0, c1, c2, c3, s) xh_str_equal4(p, c0, c1, c2, c3) #define xh_str_auto_equal5(p, c0, c1, c2, c3, c4, s) xh_str_equal5(p, c0, c1, c2, c3, c4) #define xh_str_auto_equal6(p, c0, c1, c2, c3, c4, c5, s) xh_str_equal6(p, c0, c1, c2, c3, c4, c5) #define xh_str_auto_equal7(p, c0, c1, c2, c3, c4, c5, c6, s) xh_str_equal7(p, c0, c1, c2, c3, c4, c5, c6) #define xh_str_auto_equal8(p, c0, c1, c2, c3, c4, c5, c6, c7, s) \ xh_str_equal8(p, c0, c1, c2, c3, c4, c5, c6, c7) #define xh_str_auto_equal9(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, s) \ xh_str_equal9(p, c0, c1, c2, c3, c4, c5, c6, c7, c8) #define xh_str_auto_equal10(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, s) \ xh_str_equal10(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9) #define xh_str_auto_equal11(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, s) \ xh_str_equal11(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10) #define xh_str_auto_equal12(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, s) \ xh_str_equal12(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11) #define xh_str_auto_equal13(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, c12, s) \ xh_str_equal13(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, c12) #define xh_str_auto_equal14(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, s) \ xh_str_equal14(p, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, c12, c13) #endif XH_INLINE xh_char_t * xh_str_trim(xh_char_t *s, size_t *len) { xh_char_t *end, ch; end = s + *len; while ((ch = *s++) == ' ' || ch == '\t' || ch == '\n' || ch == '\r'); if (ch == '\0') { *len = 0; return s - 1; } s--; while (--end != s && ((ch = *end) == ' ' || ch == '\t' || ch == '\n' || ch == '\r')); *len = end - s + 1; return s; } XH_INLINE xh_char_t * xh_str_copy(xh_char_t *dest, const xh_char_t *src, size_t n) { dest[--n] = '\0'; return XH_CHAR_CAST strncpy((char *) dest, (const char *) src, n); } XH_INLINE xh_char_t * xh_str_range_copy(xh_char_t *dest, const xh_char_t *src, size_t l, size_t n) { if (l < n) n = l + 1; dest[--n] = '\0'; return XH_CHAR_CAST strncpy((char *) dest, (const char *) src, n); } XH_INLINE void xh_memmove(xh_char_t *dest, const xh_char_t *src, size_t n) { while (n--) *dest++ = *src++; } XH_INLINE xh_bool_t xh_str_is_xml(xh_char_t *s) { xh_char_t ch; while ((ch = *s++) == ' ' || ch =='\t' || ch == '\n' || ch == '\r'); if (ch == '<') return TRUE; return FALSE; } #endif /* _XH_STRING_H_ */ XML-Hash-XS-0.64/src/xh_perl_buffer.h0000644000175000017500000000172112455473142016000 0ustar yurayura#ifndef _XH_PERL_BUFFER_H_ #define _XH_PERL_BUFFER_H_ #include "xh_config.h" #include "xh_core.h" typedef struct _xh_perl_buffer_t xh_perl_buffer_t; struct _xh_perl_buffer_t { SV *scalar; xh_char_t *start; xh_char_t *cur; xh_char_t *end; }; void xh_perl_buffer_init(xh_perl_buffer_t *buf, size_t size); void xh_perl_buffer_grow(xh_perl_buffer_t *buf, size_t inc); void xh_perl_buffer_sync(xh_perl_buffer_t *buf); #define xh_perl_buffer_avail(b) ((b)->end - (b)->cur) #define xh_perl_buffer_start(b) ((b)->start) #define xh_perl_buffer_pos(b) ((b)->cur) #define xh_perl_buffer_end(b) ((b)->end) #define xh_perl_buffer_size(b) ((b)->end - (b)->start) #define xh_perl_buffer_seek(b, p) (b)->cur = p #define xh_perl_buffer_seek_eof(b) (b)->cur = (b)->end #define xh_perl_buffer_seek_top(b) (b)->cur = (b)->start #define xh_perl_buffer_grow50(b) xh_perl_buffer_grow((b), xh_perl_buffer_size(b) / 2) #endif /* _XH_PERL_BUFFER_H_ */ XML-Hash-XS-0.64/src/xh_param.h0000644000175000017500000000661313325066767014622 0ustar yurayura#ifndef _XH_PARAM_H_ #define _XH_PARAM_H_ #include "xh_config.h" #include "xh_core.h" typedef struct { xh_bool_t enable; xh_bool_t always; SV *expr; } xh_pattern_t; void xh_param_assign_string(xh_char_t param[], SV *value); void xh_param_assign_int(xh_char_t *name, xh_int_t *param, SV *value); xh_bool_t xh_param_assign_bool(SV *value); void xh_param_assign_pattern(xh_pattern_t *param, SV *value); void xh_param_assign_filter(xh_pattern_t *param, SV *value); SV *xh_param_assign_cb(char *name, SV *value); #define XH_PARAM_LEN 32 #define XH_PARAM_READ_INIT \ SV *sv; \ xh_char_t *str; #define XH_PARAM_READ_STRING(var, name, def_value) \ if ( (sv = get_sv(name, 0)) != NULL ) { \ if ( SvOK(sv) ) { \ str = XH_CHAR_CAST SvPV_nolen(sv); \ xh_str_copy(var, str, XH_PARAM_LEN); \ } \ else { \ var[0] = '\0'; \ } \ } \ else { \ xh_str_copy(var, XH_CHAR_CAST def_value, XH_PARAM_LEN);\ } #define XH_PARAM_READ_BOOL(var, name, def_value) \ if ( (sv = get_sv(name, 0)) != NULL ) { \ if ( SvTRUE(sv) ) { \ var = TRUE; \ } \ else { \ var = FALSE; \ } \ } \ else { \ var = def_value; \ } #define XH_PARAM_READ_INT(var, name, def_value) \ if ( (sv = get_sv(name, 0)) != NULL ) { \ var = SvIV(sv); \ } \ else { \ var = def_value; \ } #define XH_PARAM_READ_REF(var, name, def_value) \ if ( (sv = get_sv(name, 0)) != NULL ) { \ if ( SvOK(sv) && SvROK(sv) ) { \ var = sv; \ } \ else { \ var = NULL; \ } \ } \ else { \ var = def_value; \ } #define XH_PARAM_READ_PATTERN(var, name, def_value) \ if ( (sv = get_sv(name, 0)) != NULL ) { \ xh_param_assign_pattern(&(var), sv); \ } \ else { \ xh_param_assign_pattern(&(var), def_value); \ } #endif /* _XH_PARAM_H_ */ XML-Hash-XS-0.64/src/xh_stack.c0000644000175000017500000000052612265425011014576 0ustar yurayura#include "xh_config.h" #include "xh_core.h" void xh_stack_init(xh_stack_t *st, xh_uint_t nelts, size_t size) { if ((st->elts = malloc(nelts * size)) == NULL) { croak("Memory allocation error"); } st->size = size; st->nelts = nelts; st->top = 0; } void xh_stack_destroy(xh_stack_t *st) { free(st->elts); } XML-Hash-XS-0.64/src/xh_h2x_native.c0000644000175000017500000001000414675451004015540 0ustar yurayura#include "xh_config.h" #include "xh_core.h" void xh_h2x_native(xh_h2x_ctx_t *ctx, xh_char_t *key, I32 key_len, SV *value) { xh_uint_t type; size_t i, len; SV *item_value; xh_char_t *item; I32 item_len; xh_sort_hash_t *sorted_hash; GV *method; value = xh_h2x_resolve_value(ctx, value, &type); if (type & XH_H2X_T_BLESSED && (method = gv_fetchmethod_autoload(SvSTASH(value), "iternext", 0)) != NULL) { while (1) { item_value = xh_h2x_call_method(value, method); if (!SvOK(item_value)) break; (void) xh_h2x_native(ctx, key, key_len, item_value); SvREFCNT_dec(item_value); } goto FINISH; } if (type & XH_H2X_T_SCALAR) { xh_xml_write_node(&ctx->writer, key, key_len, value, type & XH_H2X_T_RAW); } else if (type & XH_H2X_T_HASH) { len = HvUSEDKEYS((HV *) value); if (len == 0) goto ADD_EMPTY_NODE; if (key != NULL) xh_xml_write_start_node(&ctx->writer, key, key_len); if (len > 1 && ctx->opts.canonical) { sorted_hash = xh_sort_hash((HV *) value, len); for (i = 0; i < len; i++) { xh_h2x_native(ctx, sorted_hash[i].key, sorted_hash[i].key_len, sorted_hash[i].value); } free(sorted_hash); } else { hv_iterinit((HV *) value); while ((item_value = hv_iternextsv((HV *) value, (char **) &item, &item_len))) { xh_h2x_native(ctx, item, item_len, item_value); } } if (key != NULL) xh_xml_write_end_node(&ctx->writer, key, key_len); } else if (type & XH_H2X_T_ARRAY) { len = av_len((AV *) value) + 1; for (i = 0; i < len; i++) { xh_h2x_native(ctx, key, key_len, *av_fetch((AV *) value, i, 0)); } } else { ADD_EMPTY_NODE: if (key != NULL) xh_xml_write_empty_node(&ctx->writer, key, key_len); } FINISH: ctx->depth--; } #ifdef XH_HAVE_DOM void xh_h2d_native(xh_h2x_ctx_t *ctx, xmlNodePtr rootNode, xh_char_t *key, I32 key_len, SV *value) { xh_uint_t type; size_t i, len; SV *item_value; xh_char_t *item; I32 item_len; xh_sort_hash_t *sorted_hash; GV *method; value = xh_h2x_resolve_value(ctx, value, &type); if (type & XH_H2X_T_BLESSED && (method = gv_fetchmethod_autoload(SvSTASH(value), "iternext", 0)) != NULL) { while (1) { item_value = xh_h2x_call_method(value, method); if (!SvOK(item_value)) break; (void) xh_h2d_native(ctx, rootNode, key, key_len, item_value); SvREFCNT_dec(item_value); } goto FINISH; } if (type & XH_H2X_T_SCALAR) { (void) xh_dom_new_node(ctx, rootNode, key, key_len, value, type & XH_H2X_T_RAW); } else if (type & XH_H2X_T_HASH) { len = HvUSEDKEYS((HV *) value); if (len == 0) goto ADD_EMPTY_NODE; rootNode = xh_dom_new_node(ctx, rootNode, key, key_len, NULL, FALSE); if (len > 1 && ctx->opts.canonical) { sorted_hash = xh_sort_hash((HV *) value, len); for (i = 0; i < len; i++) { xh_h2d_native(ctx, rootNode, sorted_hash[i].key, sorted_hash[i].key_len, sorted_hash[i].value); } free(sorted_hash); } else { hv_iterinit((HV *) value); while ((item_value = hv_iternextsv((HV *) value, (char **) &item, &item_len))) { xh_h2d_native(ctx, rootNode, item, item_len, item_value); } } } else if (type & XH_H2X_T_ARRAY) { len = av_len((AV *) value) + 1; for (i = 0; i < len; i++) { (void) xh_h2d_native(ctx, rootNode, key, key_len, *av_fetch((AV *) value, i, 0)); } } else { ADD_EMPTY_NODE: xh_dom_new_node(ctx, rootNode, key, key_len, NULL, FALSE); } FINISH: ctx->depth--; } #endif XML-Hash-XS-0.64/src/xh_sort.h0000644000175000017500000000043712455473142014477 0ustar yurayura#ifndef _XH_SORT_H_ #define _XH_SORT_H_ #include "xh_config.h" #include "xh_core.h" typedef struct { xh_char_t *key; I32 key_len; void *value; } xh_sort_hash_t; xh_sort_hash_t *xh_sort_hash(HV *hash, size_t len); #endif /* _XH_SORT_H_ */ XML-Hash-XS-0.64/src/xh_log.c0000644000175000017500000000116712455473142014265 0ustar yurayura#include "xh_config.h" #include "xh_core.h" #define XH_LOG_LEVEL XH_LOG_TRACE static char *LOG_LEVEL_NAME[7] = { "CRITIC", "ERROR", "WARN", "NOTICE", "INFO", "DEBUG", "TRACE", }; void xh_log(xh_log_level_t log_level, const char *func, xh_int_t line, const char *msg, ...) { va_list args; if (log_level > XH_LOG_LEVEL) return; (void) fprintf(stderr, "(%s) %s[%.0d]: ", LOG_LEVEL_NAME[log_level], func, (int) line); va_start(args, msg); (void) vfprintf(stderr, msg, args); if (msg[strlen(msg) - 1] != '\n') { (void) fprintf(stderr, "\n"); } va_end(args); } XML-Hash-XS-0.64/src/xh_h2x_native_attr.c0000644000175000017500000001760113325066767016615 0ustar yurayura#include "xh_config.h" #include "xh_core.h" xh_int_t xh_h2x_native_attr(xh_h2x_ctx_t *ctx, xh_char_t *key, I32 key_len, SV *value, xh_int_t flag) { xh_uint_t type; size_t len, i, nattrs, done; xh_sort_hash_t *sorted_hash; SV *item_value; xh_char_t *item; I32 item_len; GV *method; nattrs = 0; if (ctx->opts.content[0] != '\0' && xh_strcmp(key, ctx->opts.content) == 0) flag = flag | XH_H2X_F_CONTENT; value = xh_h2x_resolve_value(ctx, value, &type); if (type & XH_H2X_T_BLESSED && (method = gv_fetchmethod_autoload(SvSTASH(value), "iternext", 0)) != NULL) { if (!(flag & XH_H2X_F_COMPLEX)) goto FINISH; while (1) { item_value = xh_h2x_call_method(value, method); if (!SvOK(item_value)) break; (void) xh_h2x_native_attr(ctx, key, key_len, item_value, XH_H2X_F_SIMPLE | XH_H2X_F_COMPLEX); SvREFCNT_dec(item_value); } nattrs++; goto FINISH; } if (type & XH_H2X_T_SCALAR) { if (flag & XH_H2X_F_COMPLEX && (flag & XH_H2X_F_SIMPLE || type & XH_H2X_T_RAW)) { xh_xml_write_node(&ctx->writer, key, key_len, value, type & XH_H2X_T_RAW); } else if (flag & XH_H2X_F_COMPLEX && flag & XH_H2X_F_CONTENT) { xh_xml_write_content(&ctx->writer, value); } else if (flag & XH_H2X_F_SIMPLE && !(flag & XH_H2X_F_CONTENT) && !(type & XH_H2X_T_RAW)) { xh_xml_write_attribute(&ctx->writer, key, key_len, value); nattrs++; } } else if (type & XH_H2X_T_HASH) { if (!(flag & XH_H2X_F_COMPLEX)) goto FINISH; len = HvUSEDKEYS((SV *) value); if (len == 0) { xh_xml_write_empty_node(&ctx->writer, key, key_len); goto FINISH; } xh_xml_write_start_tag(&ctx->writer, key, key_len); done = 0; if (len > 1 && ctx->opts.canonical) { sorted_hash = xh_sort_hash((HV *) value, len); for (i = 0; i < len; i++) { done += xh_h2x_native_attr(ctx, sorted_hash[i].key, sorted_hash[i].key_len, sorted_hash[i].value, XH_H2X_F_SIMPLE); } if (done == len) { xh_xml_write_closed_end_tag(&ctx->writer); } else { xh_xml_write_end_tag(&ctx->writer); for (i = 0; i < len; i++) { (void) xh_h2x_native_attr(ctx, sorted_hash[i].key, sorted_hash[i].key_len, sorted_hash[i].value, XH_H2X_F_COMPLEX); } xh_xml_write_end_node(&ctx->writer, key, key_len); } free(sorted_hash); } else { hv_iterinit((HV *) value); while ((item_value = hv_iternextsv((HV *) value, (char **) &item, &item_len))) { done += xh_h2x_native_attr(ctx, item, item_len,item_value, XH_H2X_F_SIMPLE); } if (done == len) { xh_xml_write_closed_end_tag(&ctx->writer); } else { xh_xml_write_end_tag(&ctx->writer); hv_iterinit((HV *) value); while ((item_value = hv_iternextsv((HV *) value, (char **) &item, &item_len))) { (void) xh_h2x_native_attr(ctx, item, item_len,item_value, XH_H2X_F_COMPLEX); } xh_xml_write_end_node(&ctx->writer, key, key_len); } } nattrs++; } else if (type & XH_H2X_T_ARRAY) { if (!(flag & XH_H2X_F_COMPLEX)) goto FINISH; len = av_len((AV *) value) + 1; for (i = 0; i < len; i++) { (void) xh_h2x_native_attr(ctx, key, key_len, *av_fetch((AV *) value, i, 0), XH_H2X_F_SIMPLE | XH_H2X_F_COMPLEX); } nattrs++; } else { if (flag & XH_H2X_F_SIMPLE && flag & XH_H2X_F_COMPLEX) { xh_xml_write_empty_node(&ctx->writer, key, key_len); } else if (flag & XH_H2X_F_SIMPLE && !(flag & XH_H2X_F_CONTENT)) { xh_xml_write_attribute(&ctx->writer, key, key_len, NULL); nattrs++; } } FINISH: ctx->depth--; return nattrs; } #ifdef XH_HAVE_DOM xh_int_t xh_h2d_native_attr(xh_h2x_ctx_t *ctx, xmlNodePtr rootNode, xh_char_t *key, I32 key_len, SV *value, xh_int_t flag) { xh_uint_t type; size_t len, i, nattrs, done; xh_sort_hash_t *sorted_hash; SV *item_value; xh_char_t *item; I32 item_len; GV *method; nattrs = 0; if (ctx->opts.content[0] != '\0' && xh_strcmp(key, ctx->opts.content) == 0) flag = flag | XH_H2X_F_CONTENT; value = xh_h2x_resolve_value(ctx, value, &type); if (type & XH_H2X_T_BLESSED && (method = gv_fetchmethod_autoload(SvSTASH(value), "iternext", 0)) != NULL) { if (!(flag & XH_H2X_F_COMPLEX)) goto FINISH; while (1) { item_value = xh_h2x_call_method(value, method); if (!SvOK(item_value)) break; (void) xh_h2d_native_attr(ctx, rootNode, key, key_len, item_value, XH_H2X_F_SIMPLE | XH_H2X_F_COMPLEX); SvREFCNT_dec(item_value); } nattrs++; goto FINISH; } if (type & XH_H2X_T_SCALAR) { if (flag & XH_H2X_F_SIMPLE && flag & XH_H2X_F_COMPLEX) { (void) xh_dom_new_node(ctx, rootNode, key, key_len, value, type & XH_H2X_T_RAW); } else if (flag & XH_H2X_F_COMPLEX && flag & XH_H2X_F_CONTENT) { xh_dom_new_content(ctx, rootNode, value); } else if (flag & XH_H2X_F_SIMPLE && !(flag & XH_H2X_F_CONTENT)) { xh_dom_new_attribute(ctx, rootNode, key, key_len, value); nattrs++; } } else if (type & XH_H2X_T_HASH) { if (!(flag & XH_H2X_F_COMPLEX)) goto FINISH; rootNode = xh_dom_new_node(ctx, rootNode, key, key_len, NULL, type & XH_H2X_T_RAW); len = HvUSEDKEYS((SV *) value); if (len == 0) goto FINISH; done = 0; if (len > 1 && ctx->opts.canonical) { sorted_hash = xh_sort_hash((HV *) value, len); for (i = 0; i < len; i++) { done += xh_h2d_native_attr(ctx, rootNode, sorted_hash[i].key, sorted_hash[i].key_len, sorted_hash[i].value, XH_H2X_F_SIMPLE); } if (done != len) { for (i = 0; i < len; i++) { (void) xh_h2d_native_attr(ctx, rootNode, sorted_hash[i].key, sorted_hash[i].key_len, sorted_hash[i].value, XH_H2X_F_COMPLEX); } } free(sorted_hash); } else { hv_iterinit((HV *) value); while ((item_value = hv_iternextsv((HV *) value, (char **) &item, &item_len))) { done += xh_h2d_native_attr(ctx, rootNode, item, item_len,item_value, XH_H2X_F_SIMPLE); } if (done != len) { hv_iterinit((HV *) value); while ((item_value = hv_iternextsv((HV *) value, (char **) &item, &item_len))) { (void) xh_h2d_native_attr(ctx, rootNode, item, item_len,item_value, XH_H2X_F_COMPLEX); } } } nattrs++; } else if (type & XH_H2X_T_ARRAY) { if (!(flag & XH_H2X_F_COMPLEX)) goto FINISH; len = av_len((AV *) value) + 1; for (i = 0; i < len; i++) { (void) xh_h2d_native_attr(ctx, rootNode, key, key_len, *av_fetch((AV *) value, i, 0), XH_H2X_F_SIMPLE | XH_H2X_F_COMPLEX); } nattrs++; } else { if (flag & XH_H2X_F_SIMPLE && flag & XH_H2X_F_COMPLEX) { (void) xh_dom_new_node(ctx, rootNode, key, key_len, NULL, type & XH_H2X_T_RAW); } else if (flag & XH_H2X_F_SIMPLE && !(flag & XH_H2X_F_CONTENT)) { xh_dom_new_attribute(ctx, rootNode, key, key_len, NULL); nattrs++; } } FINISH: ctx->depth--; return nattrs; } #endif XML-Hash-XS-0.64/src/xh.h0000644000175000017500000000565313601603117013424 0ustar yurayura#ifndef _XH_H_ #define _XH_H_ #include "xh_config.h" #include "xh_core.h" #define XH_INTERNAL_ENCODING "utf-8" #define XH_SUPPRESS_EMPTY_NONE 0 #define XH_SUPPRESS_EMPTY_TO_DELETE 1 #define XH_SUPPRESS_EMPTY_TO_STRING 2 #define XH_SUPPRESS_EMPTY_TO_UNDEF 3 /* Default opts */ #define XH_DEF_OUTPUT NULL #define XH_DEF_METHOD "NATIVE" #define XH_DEF_ROOT "root" #define XH_DEF_VERSION "1.0" #define XH_DEF_ENCODING "" #define XH_DEF_UTF8 TRUE #define XH_DEF_INDENT 0 #define XH_DEF_CANONICAL FALSE #define XH_DEF_USE_ATTR FALSE #define XH_DEF_CONTENT "" #define XH_DEF_XML_DECL TRUE #define XH_DEF_KEEP_ROOT FALSE #ifdef XH_HAVE_DOM #define XH_DEF_DOC FALSE #endif #define XH_DEF_FORCE_ARRAY &PL_sv_undef #define XH_DEF_FORCE_CONTENT FALSE #define XH_DEF_MERGE_TEXT FALSE #define XH_DEF_SUPPRESS_EMPTY XH_SUPPRESS_EMPTY_NONE #define XH_DEF_ATTR "-" #define XH_DEF_TEXT "#text" #define XH_DEF_TRIM FALSE #define XH_DEF_CDATA "" #define XH_DEF_COMM "" #define XH_DEF_MAX_DEPTH 1024 #define XH_DEF_BUF_SIZE 4096 typedef enum { XH_METHOD_NATIVE = 0, XH_METHOD_NATIVE_ATTR_MODE, XH_METHOD_LX } xh_method_t; typedef struct { xh_method_t method; /* native options */ xh_char_t version[XH_PARAM_LEN]; xh_char_t encoding[XH_PARAM_LEN]; xh_char_t root[XH_PARAM_LEN]; xh_bool_t utf8; xh_bool_t xml_decl; xh_bool_t keep_root; xh_bool_t canonical; xh_char_t content[XH_PARAM_LEN]; xh_int_t indent; void *output; #ifdef XH_HAVE_DOM xh_bool_t doc; #endif xh_int_t max_depth; xh_int_t buf_size; xh_pattern_t force_array; xh_bool_t force_content; xh_bool_t merge_text; xh_int_t suppress_empty; xh_pattern_t filter; SV *cb; /* LX options */ xh_char_t attr[XH_PARAM_LEN]; size_t attr_len; xh_char_t text[XH_PARAM_LEN]; xh_bool_t trim; xh_char_t cdata[XH_PARAM_LEN]; xh_char_t comm[XH_PARAM_LEN]; } xh_opts_t; xh_opts_t *xh_create_opts(void); void xh_destroy_opts(xh_opts_t *opts); xh_bool_t xh_init_opts(xh_opts_t *opts); void xh_parse_param(xh_opts_t *opts, xh_int_t first, I32 ax, I32 items); void xh_copy_opts(xh_opts_t *dst, xh_opts_t *src); void *xh_get_obj_param(xh_int_t *nparam, I32 ax, I32 items, char *class); SV *xh_get_hash_param(xh_int_t *nparam, I32 ax, I32 items); SV *xh_get_str_param(xh_int_t *nparam, I32 ax, I32 items); void xh_merge_opts(xh_opts_t *ctx_opts, xh_opts_t *opts, xh_int_t nparam, I32 ax, I32 items); #endif /* _XH_H_ */ XML-Hash-XS-0.64/MANIFEST.SKIP0000644000175000017500000000204112531035107013726 0ustar yurayura #!start included /usr/lib64/perl5/vendor_perl/5.12.4/ExtUtils/MANIFEST.SKIP # Avoid version control files. \bRCS\b \bCVS\b \bSCCS\b ,v$ \B\.svn\b \B\.git\b \B\.gitignore\b \b_darcs\b \B\.cvsignore$ # Avoid VMS specific MakeMaker generated files \bDescrip.MMS$ \bDESCRIP.MMS$ \bdescrip.mms$ # Avoid Makemaker generated and utility files. \bMANIFEST\.bak \bMakefile$ \bblib/ \bMakeMaker-\d \bpm_to_blib\.ts$ \bpm_to_blib$ \bblibdirs\.ts$ # 6.18 through 6.25 generated this # Avoid Module::Build generated and utility files. \bBuild$ \b_build/ \bBuild.bat$ \bBuild.COM$ \bBUILD.COM$ \bbuild.com$ # Avoid temp and backup files. ~$ \.old$ \#$ \b\.# \.bak$ \.tmp$ \.# \.rej$ # Avoid OS-specific files/dirs # Mac OSX metadata \B\.DS_Store # Mac OSX SMB mount metadata files \B\._ # Avoid Devel::Cover and Devel::CoverX::Covered files. \bcover_db\b \bcovered\b # Avoid MYMETA files ^MYMETA\. #!end included /usr/lib64/perl5/vendor_perl/5.12.4/ExtUtils/MANIFEST.SKIP \B\.travis.yml$ \.o$ XS\.c$ \.bs$ \.tar\.gz$ \bbenchmark/uploads\.rdf$ \btools\b XML-Hash-XS-0.64/inc/0000755000175000017500000000000014735256165012625 5ustar yurayuraXML-Hash-XS-0.64/inc/Devel/0000755000175000017500000000000014735256165013664 5ustar yurayuraXML-Hash-XS-0.64/inc/Devel/CheckLib.pm0000644000175000017500000003476612121441773015672 0ustar yurayura# $Id: CheckLib.pm,v 1.25 2008/10/27 12:16:23 drhyde Exp $ package # Devel::CheckLib; use 5.00405; #postfix foreach use strict; use vars qw($VERSION @ISA @EXPORT); $VERSION = '0.98'; use Config qw(%Config); use Text::ParseWords 'quotewords'; use File::Spec; use File::Temp; require Exporter; @ISA = qw(Exporter); @EXPORT = qw(assert_lib check_lib_or_exit check_lib); # localising prevents the warningness leaking out of this module local $^W = 1; # use warnings is a 5.6-ism _findcc(); # bomb out early if there's no compiler =head1 NAME Devel::CheckLib - check that a library is available =head1 DESCRIPTION Devel::CheckLib is a perl module that checks whether a particular C library and its headers are available. =head1 SYNOPSIS use Devel::CheckLib; check_lib_or_exit( lib => 'jpeg', header => 'jpeglib.h' ); check_lib_or_exit( lib => [ 'iconv', 'jpeg' ] ); # or prompt for path to library and then do this: check_lib_or_exit( lib => 'jpeg', libpath => $additional_path ); =head1 USING IT IN Makefile.PL or Build.PL If you want to use this from Makefile.PL or Build.PL, do not simply copy the module into your distribution as this may cause problems when PAUSE and search.cpan.org index the distro. Instead, use the use-devel-checklib script. =head1 HOW IT WORKS You pass named parameters to a function, describing to it how to build and link to the libraries. It works by trying to compile some code - which defaults to this: int main(void) { return 0; } and linking it to the specified libraries. If something pops out the end which looks executable, it gets executed, and if main() returns 0 we know that it worked. That tiny program is built once for each library that you specify, and (without linking) once for each header file. If you want to check for the presence of particular functions in a library, or even that those functions return particular results, then you can pass your own function body for main() thus: check_lib_or_exit( function => 'foo();if(libversion() > 5) return 0; else return 1;' incpath => ... libpath => ... lib => ... header => ... ); In that case, it will fail to build if either foo() or libversion() don't exist, and main() will return the wrong value if libversion()'s return value isn't what you want. =head1 FUNCTIONS All of these take the same named parameters and are exported by default. To avoid exporting them, C. =head2 assert_lib This takes several named parameters, all of which are optional, and dies with an error message if any of the libraries listed can not be found. B: dying in a Makefile.PL or Build.PL may provoke a 'FAIL' report from CPAN Testers' automated smoke testers. Use C instead. The named parameters are: =over =item lib Must be either a string with the name of a single library or a reference to an array of strings of library names. Depending on the compiler found, library names will be fed to the compiler either as C<-l> arguments or as C<.lib> file names. (E.g. C<-ljpeg> or C) =item libpath a string or an array of strings representing additional paths to search for libraries. =item LIBS a C-style space-seperated list of libraries (each preceded by '-l') and directories (preceded by '-L'). This can also be supplied on the command-line. =back And libraries are no use without header files, so ... =over =item header Must be either a string with the name of a single header file or a reference to an array of strings of header file names. =item incpath a string or an array of strings representing additional paths to search for headers. =item INC a C-style space-seperated list of incpaths, each preceded by '-I'. This can also be supplied on the command-line. =back =head2 check_lib_or_exit This behaves exactly the same as C except that instead of dieing, it warns (with exactly the same error message) and exits. This is intended for use in Makefile.PL / Build.PL when you might want to prompt the user for various paths and things before checking that what they've told you is sane. If any library or header is missing, it exits with an exit value of 0 to avoid causing a CPAN Testers 'FAIL' report. CPAN Testers should ignore this result -- which is what you want if an external library dependency is not available. =head2 check_lib This behaves exactly the same as C except that it is silent, returning false instead of dieing, or true otherwise. =cut sub check_lib_or_exit { eval 'assert_lib(@_)'; if($@) { warn $@; exit; } } sub check_lib { eval 'assert_lib(@_)'; return $@ ? 0 : 1; } sub assert_lib { my %args = @_; my (@libs, @libpaths, @headers, @incpaths); # FIXME: these four just SCREAM "refactor" at me @libs = (ref($args{lib}) ? @{$args{lib}} : $args{lib}) if $args{lib}; @libpaths = (ref($args{libpath}) ? @{$args{libpath}} : $args{libpath}) if $args{libpath}; @headers = (ref($args{header}) ? @{$args{header}} : $args{header}) if $args{header}; @incpaths = (ref($args{incpath}) ? @{$args{incpath}} : $args{incpath}) if $args{incpath}; # work-a-like for Makefile.PL's LIBS and INC arguments # if given as command-line argument, append to %args for my $arg (@ARGV) { for my $mm_attr_key (qw(LIBS INC)) { if (my ($mm_attr_value) = $arg =~ /\A $mm_attr_key = (.*)/x) { # it is tempting to put some \s* into the expression, but the # MM command-line parser only accepts LIBS etc. followed by =, # so we should not be any more lenient with whitespace than that $args{$mm_attr_key} .= " $mm_attr_value"; } } } # using special form of split to trim whitespace if(defined($args{LIBS})) { foreach my $arg (split(' ', $args{LIBS})) { die("LIBS argument badly-formed: $arg\n") unless($arg =~ /^-l/i); push @{$arg =~ /^-l/ ? \@libs : \@libpaths}, substr($arg, 2); } } if(defined($args{INC})) { foreach my $arg (split(' ', $args{INC})) { die("INC argument badly-formed: $arg\n") unless($arg =~ /^-I/); push @incpaths, substr($arg, 2); } } my ($cc, $ld) = _findcc(); my @missing; my @wrongresult; my @use_headers; # first figure out which headers we can't find ... for my $header (@headers) { push @use_headers, $header; my($ch, $cfile) = File::Temp::tempfile( 'assertlibXXXXXXXX', SUFFIX => '.c' ); my $ofile = $cfile; $ofile =~ s/\.c$/$Config{_o}/; print $ch qq{#include <$_>\n} for @use_headers; print $ch qq{int main(void) { return 0; }\n}; close($ch); my $exefile = File::Temp::mktemp( 'assertlibXXXXXXXX' ) . $Config{_exe}; my @sys_cmd; # FIXME: re-factor - almost identical code later when linking if ( $Config{cc} eq 'cl' ) { # Microsoft compiler require Win32; @sys_cmd = ( @$cc, $cfile, "/Fe$exefile", (map { '/I'.Win32::GetShortPathName($_) } @incpaths), "/link", @$ld ); } elsif($Config{cc} =~ /bcc32(\.exe)?/) { # Borland @sys_cmd = ( @$cc, @$ld, (map { "-I$_" } @incpaths), "-o$exefile", $cfile ); } else { # Unix-ish: gcc, Sun, AIX (gcc, cc), ... @sys_cmd = ( @$cc, @$ld, $cfile, (map { "-I$_" } @incpaths), "-o", "$exefile" ); } warn "# @sys_cmd\n" if $args{debug}; my $rv = $args{debug} ? system(@sys_cmd) : _quiet_system(@sys_cmd); push @missing, $header if $rv != 0 || ! -x $exefile; _cleanup_exe($exefile); unlink $ofile if -e $ofile; unlink $cfile; } # now do each library in turn with headers my($ch, $cfile) = File::Temp::tempfile( 'assertlibXXXXXXXX', SUFFIX => '.c' ); my $ofile = $cfile; $ofile =~ s/\.c$/$Config{_o}/; print $ch qq{#include <$_>\n} foreach (@headers); print $ch "int main(void) { ".($args{function} || 'return 0;')." }\n"; close($ch); my $exefile = File::Temp::mktemp( 'assertlibXXXXXXXX' ) . $Config{_exe}; my @sys_cmd; if ( $Config{cc} eq 'cl' ) { # Microsoft compiler require Win32; my @libpath = map { q{/libpath:} . Win32::GetShortPathName($_) } @libpaths; # this is horribly sensitive to the order of arguments @sys_cmd = ( @$cc, $cfile, (map { "$_.lib" } @libs), "/Fe$exefile", (map { '/I'.Win32::GetShortPathName($_) } @incpaths), "/link", @$ld, (map {'/libpath:'.Win32::GetShortPathName($_)} @libpaths), ); } elsif($Config{cc} eq 'CC/DECC') { # VMS } elsif($Config{cc} =~ /bcc32(\.exe)?/) { # Borland @sys_cmd = ( @$cc, @$ld, "-o$exefile", (map { "-I$_" } @incpaths), (map { "-L$_" } @libpaths), (map { "-l$_" } @libs), $cfile); } else { # Unix-ish # gcc, Sun, AIX (gcc, cc) @sys_cmd = ( @$cc, @$ld, $cfile, "-o", "$exefile", (map { "-I$_" } @incpaths), (map { "-L$_" } @libpaths), (map { "-l$_" } @libs), ); } warn "# @sys_cmd\n" if $args{debug}; my $rv = $args{debug} ? system(@sys_cmd) : _quiet_system(@sys_cmd); push @missing, @libs if $rv != 0 || ! -x $exefile; my $absexefile = File::Spec->rel2abs($exefile); $absexefile = '"'.$absexefile.'"' if $absexefile =~ m/\s/; push @wrongresult, @libs if $rv == 0 && -x $exefile && system($absexefile) != 0; unlink $ofile if -e $ofile; _cleanup_exe($exefile); unlink $cfile; my $miss_string = join( q{, }, map { qq{'$_'} } @missing ); die("Can't link/include C library $miss_string, aborting.\n") if @missing; my $wrong_string = join( q{, }, map { qq{'$_'} } @wrongresult); die("wrong result: $wrong_string\n") if @wrongresult; } sub _cleanup_exe { my ($exefile) = @_; my $ofile = $exefile; $ofile =~ s/$Config{_exe}$/$Config{_o}/; unlink $exefile if -f $exefile; unlink $ofile if -f $ofile; unlink "$exefile\.manifest" if -f "$exefile\.manifest"; if ( $Config{cc} eq 'cl' ) { # MSVC also creates foo.ilk and foo.pdb my $ilkfile = $exefile; $ilkfile =~ s/$Config{_exe}$/.ilk/; my $pdbfile = $exefile; $pdbfile =~ s/$Config{_exe}$/.pdb/; unlink $ilkfile if -f $ilkfile; unlink $pdbfile if -f $pdbfile; } return } # return ($cc, $ld) # where $cc is an array ref of compiler name, compiler flags # where $ld is an array ref of linker flags sub _findcc { # Need to use $keep=1 to work with MSWin32 backslashes and quotes my $Config_ccflags = $Config{ccflags}; # use copy so ASPerl will compile my @Config_ldflags = (); for my $config_val ( @Config{qw(ldflags perllibs)} ){ push @Config_ldflags, $config_val if ( $config_val =~ /\S/ ); } my @ccflags = grep { length } quotewords('\s+', 1, $Config_ccflags||''); my @ldflags = grep { length } quotewords('\s+', 1, @Config_ldflags); my @paths = split(/$Config{path_sep}/, $ENV{PATH}); my @cc = split(/\s+/, $Config{cc}); return ( [ @cc, @ccflags ], \@ldflags ) if -x $cc[0]; foreach my $path (@paths) { my $compiler = File::Spec->catfile($path, $cc[0]) . $Config{_exe}; return ([ $compiler, @cc[1 .. $#cc], @ccflags ], \@ldflags) if -x $compiler; } die("Couldn't find your C compiler\n"); } # code substantially borrowed from IPC::Run3 sub _quiet_system { my (@cmd) = @_; # save handles local *STDOUT_SAVE; local *STDERR_SAVE; open STDOUT_SAVE, ">&STDOUT" or die "CheckLib: $! saving STDOUT"; open STDERR_SAVE, ">&STDERR" or die "CheckLib: $! saving STDERR"; # redirect to nowhere local *DEV_NULL; open DEV_NULL, ">" . File::Spec->devnull or die "CheckLib: $! opening handle to null device"; open STDOUT, ">&" . fileno DEV_NULL or die "CheckLib: $! redirecting STDOUT to null handle"; open STDERR, ">&" . fileno DEV_NULL or die "CheckLib: $! redirecting STDERR to null handle"; # run system command my $rv = system(@cmd); # restore handles open STDOUT, ">&" . fileno STDOUT_SAVE or die "CheckLib: $! restoring STDOUT handle"; open STDERR, ">&" . fileno STDERR_SAVE or die "CheckLib: $! restoring STDERR handle"; return $rv; } =head1 PLATFORMS SUPPORTED You must have a C compiler installed. We check for C<$Config{cc}>, both literally as it is in Config.pm and also in the $PATH. It has been tested with varying degrees on rigourousness on: =over =item gcc (on Linux, *BSD, Mac OS X, Solaris, Cygwin) =item Sun's compiler tools on Solaris =item IBM's tools on AIX =item SGI's tools on Irix 6.5 =item Microsoft's tools on Windows =item MinGW on Windows (with Strawberry Perl) =item Borland's tools on Windows =item QNX =back =head1 WARNINGS, BUGS and FEEDBACK This is a very early release intended primarily for feedback from people who have discussed it. The interface may change and it has not been adequately tested. Feedback is most welcome, including constructive criticism. Bug reports should be made using L or by email. When submitting a bug report, please include the output from running: perl -V perl -MDevel::CheckLib -e0 =head1 SEE ALSO L L =head1 AUTHORS David Cantrell Edavid@cantrell.org.ukE David Golden Edagolden@cpan.orgE Yasuhiro Matsumoto Emattn@cpan.orgE Thanks to the cpan-testers-discuss mailing list for prompting us to write it in the first place; to Chris Williams for help with Borland support; to Tony Cook for help with Microsoft compiler command-line options =head1 COPYRIGHT and LICENCE Copyright 2007 David Cantrell. Portions copyright 2007 David Golden. This module is free-as-in-speech software, and may be used, distributed, and modified under the same conditions as perl itself. =head1 CONSPIRACY This module is also free-as-in-mason software. =cut 1; XML-Hash-XS-0.64/META.yml0000664000175000017500000000167314735256165013336 0ustar yurayura--- abstract: 'Simple and fast hash to XML and XML to hash conversion written in C' author: - 'Yuriy Ustushenko ' build_requires: Config: '0' Data::Dumper: '0' ExtUtils::MakeMaker: '0' File::Spec: '0' Test::More: '0' configure_requires: Config: '0' ExtUtils::MakeMaker: '0' File::Spec: '0' 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: XML-Hash-XS no_index: directory: - t - inc requires: Exporter: '5.57' XSLoader: '0' base: '0' resources: bugtracker: https://github.com/yoreek/XML-Hash-XS/issues homepage: https://github.com/yoreek/XML-Hash-XS license: http://dev.perl.org/licenses/ repository: https://github.com/yoreek/XML-Hash-XS.git version: '0.64' x_serialization_backend: 'CPAN::Meta::YAML version 0.018' XML-Hash-XS-0.64/MANIFEST0000644000175000017500000000250114735256165013203 0ustar yurayurabenchmark/benchmark.pl Changes inc/Devel/CheckLib.pm lib/XML/Hash/XS.pm LICENSE Makefile.PL MANIFEST This list of files MANIFEST.SKIP README src/ppport.h src/xh.c src/xh.h src/xh_buffer.c src/xh_buffer.h src/xh_buffer_helper.h src/xh_config.h src/xh_core.h src/xh_dom.c src/xh_dom.h src/xh_encoder.c src/xh_encoder.h src/xh_h2x.c src/xh_h2x.h src/xh_h2x_lx.c src/xh_h2x_native.c src/xh_h2x_native_attr.c src/xh_log.c src/xh_log.h src/xh_param.c src/xh_param.h src/xh_perl_buffer.c src/xh_perl_buffer.h src/xh_reader.c src/xh_reader.h src/xh_sort.c src/xh_sort.h src/xh_stack.c src/xh_stack.h src/xh_stash.c src/xh_stash.h src/xh_string.h src/xh_writer.c src/xh_writer.h src/xh_x2h.c src/xh_x2h.h src/xh_xml.h src/XS.xs t/00-load.t t/01-h2x.t t/02-h2d.t t/03-h2x-oop.t t/04-h2x-lx.t t/05-h2d-lx.t t/06-x2h.t t/07-x2h_filter.t t/08-x2h_trim.t t/09-x2h_cdata.t t/10-x2h_encode.t t/11-x2h_read.t t/12-x2h_ref.t t/13-x2h_force_array.t t/14-x2h_merge_text.t t/15-x2h_doctype.t t/16-x2h_suppress_empty.t t/17-x2h_stylesheet.t t/test.xml t/test_cp1251.xml t/test_cp1251_wo_decl.xml t/test_null_terminated.xml t/test_utf8.xml typemap xt/91-pod-syntax.t xt/92-critic.t xt/93-changes.t META.yml Module YAML meta-data (added by MakeMaker) META.json Module JSON meta-data (added by MakeMaker) XML-Hash-XS-0.64/Makefile.PL0000644000175000017500000003563414734303565014035 0ustar yurayura# Makefile.PL for XML::Hash::XS. # # This program is free software; you can redistribute it and/or modify it # under the same terms as Perl itself. # Copyright 2012-2021 Yuriy Ustushenko, all rights reserved. # # Derived from the module XML::LibXML # Copyright 2001-2003 AxKit.com Ltd., 2002-2006 Christian Glahn, 2006-2009 Petr Pajas use 5.008008; use warnings; use strict; use lib qw(inc); use Devel::CheckLib; use ExtUtils::MakeMaker; use Config; use File::Spec; $| = 0; our $IS_VC = $Config{cc} eq 'cl'; our %PARAMS = parse_params(); my %WriteMakefileArgs = ( NAME => 'XML::Hash::XS', VERSION_FROM => 'lib/XML/Hash/XS.pm', ABSTRACT_FROM => 'lib/XML/Hash/XS.pm', AUTHOR => 'Yuriy Ustushenko ', test => { TESTS => 't/*.t'. ($ENV{AUTHOR_TESTING} ? ' xt/*.t' : '') }, META_MERGE => { 'meta-spec' => { version => 2 }, resources => { license => 'http://dev.perl.org/licenses/', homepage => 'https://github.com/yoreek/XML-Hash-XS', repository => { type => 'git', url => 'https://github.com/yoreek/XML-Hash-XS.git', web => 'https://github.com/yoreek/XML-Hash-XS', }, bugtracker => { web => 'https://github.com/yoreek/XML-Hash-XS/issues', }, }, }, META_ADD => { prereqs => { configure => { requires => { 'ExtUtils::MakeMaker' => 0, 'Config' => 0, 'File::Spec' => 0, }, }, build => { requires => { 'ExtUtils::MakeMaker' => 0, 'Config' => 0, 'File::Spec' => 0, }, }, runtime => { requires => { 'Exporter' => 5.57, 'base' => 0, 'XSLoader' => 0, }, }, test => { requires => { 'Test::More' => 0, 'Data::Dumper' => 0, }, }, }, }, MIN_PERL_VERSION => 5.008008, LICENSE => 'perl_5', CCFLAGS => $Config{ccflags} . ( $IS_VC ? ' /Fosrc/' : ' -o $@' ), OBJECT => q/$(O_FILES)/, XS => { 'src/XS.xs' => 'src/XS.c', }, C => [ 'src/XS.c', glob('src/*.c') ], H => [ glob('src/*.h') ], clean => { FILES => 'src/*.o* *.o* src/*.pdb *.pdb' }, extra_config(), ); my $eumm_version = eval $ExtUtils::MakeMaker::VERSION; for (qw(configure build test runtime)) { my $key = $_ eq 'runtime' ? 'PREREQ_PM' : uc $_.'_REQUIRES'; next unless exists $WriteMakefileArgs{META_ADD}{prereqs}{$_} or exists $WriteMakefileArgs{$key}; my $r = $WriteMakefileArgs{$key} = { %{$WriteMakefileArgs{META_ADD}{prereqs}{$_}{requires} || {}}, %{delete $WriteMakefileArgs{$key} || {}}, }; defined $r->{$_} or delete $r->{$_} for keys %$r; } $WriteMakefileArgs{BUILD_REQUIRES} = { %{$WriteMakefileArgs{BUILD_REQUIRES} || {}}, %{delete $WriteMakefileArgs{TEST_REQUIRES}} } if $eumm_version < 6.63_03; $WriteMakefileArgs{PREREQ_PM} = { %{$WriteMakefileArgs{PREREQ_PM}}, %{delete $WriteMakefileArgs{BUILD_REQUIRES}} } if $eumm_version < 6.55_01; delete $WriteMakefileArgs{CONFIGURE_REQUIRES} if $eumm_version < 6.51_03; delete @WriteMakefileArgs{qw(META_ADD META_MERGE)} if $eumm_version < 6.46; delete $WriteMakefileArgs{MIN_PERL_VERSION} if $eumm_version < 6.48; delete $WriteMakefileArgs{LICENSE} if $eumm_version < 6.31; WriteMakefile(%WriteMakefileArgs); sub extra_config { my $available_libs = get_available_libs(); my (%config, %summary_config); my @options = qw(lib libpath incpath); # remove unneded libxml2 delete $available_libs->{xml2} unless exists $available_libs->{'XML::LibXML'}; foreach my $lib_config (values %$available_libs) { foreach my $option (@options) { my $value = $lib_config->{$option} or next; $value = [ split(/\s+/, $value) ] unless ref $value; $config{$option}{$_} = 1 for @$value; } } if ( $PARAMS{LIBS} ) { $summary_config{LIBS} = [ $PARAMS{LIBS} ]; } else { my @libs = ( # order is important! ( map { "-L$_" } keys %{ $config{libpath} || {} } ), ( map { $IS_VC && $_ !~ /\.lib$/ ? "-l$_.lib" : "-l$_" } keys %{ $config{lib} || {} } ), ); $summary_config{LIBS} = [$Config::Config{ldflags} || '', @libs] if scalar @libs; } if ( $PARAMS{INC} ) { $summary_config{INC} = [ $PARAMS{INC} ]; } else { my @inc = map { "-I$_" } keys %{ $config{incpath} || {} }; $summary_config{INC} = \@inc if scalar @inc; } my @define = map { s/:/_/g; "-DXH_HAVE_" . uc($_) } keys %$available_libs; $summary_config{DEFINE} = \@define if scalar @define; # convert array to string $summary_config{$_} = join(' ', @{ $summary_config{$_} }) for keys %summary_config; # CCFLAGS $summary_config{CCFLAGS} = ( $Config{ccflags} || '' ) . ( $IS_VC ? ' /Fosrc/' : ' -o $@' ); $summary_config{CCFLAGS} .= ' -g -Wall -Werror -Wextra -pedantic -Wno-clobbered -std=c99 -DPERL_GCC_PEDANTIC -DWITH_DEBUG -O0' if $PARAMS{DEBUG}; $summary_config{CCFLAGS} .= ' -DWITH_TRACE' if $PARAMS{DEBUG} && $PARAMS{TRACE}; # Fix from Glib module. # On OpenBSD, any program that directly or indirectly wants to load # libpthread.so must do so from the start. But when perl is built without # ithreads, it will also most likely not be compiled with "-pthread". When # libglib/libgobject then go and try to load libpthread.so, the loader will # error out. if ($^O =~ /^openbsd|netbsd$/ && $Config::Config{ldflags} !~ m/-pthread\b/ && $Config::Config{ccflags} !~ m/-pthread\b/) { warn " ***\n *** on OpenBSD, we either need perl linked with '-pthread',\n", " *** or we need to set LD_PRELOAD=libpthread.so; doing the latter now...\n ***\n"; $summary_config{macro} = { FULLPERLRUN => 'LD_PRELOAD=/usr/lib/libpthread.so $(FULLPERL)' }; } return %summary_config; } sub get_available_libs { my @COMMON_LIB_PATH = ( '/usr/lib', '/usr/local/lib', '/usr/pkg/lib', '/opt/local/lib', ); my @COMMON_INC_PATH = ( '/usr/include', '/usr/local/include', '/usr/pkg/include', '/opt/local/include', ); my @REQUIRED_LIBS = ( { perl => 1, name => 'XML::LibXML', version => 1.62, mandatory => 0, }, { name => 'xml2', mandatory => 0, configs => [ { lib => sub { my $results = $PARAMS{WIN32} ? undef : backtick( join('/bin/', grep { $_ } ($ENV{XMLPREFIX} || $PARAMS{XMLPREFIX}, 'xml2-config')), '--libs', ); $results ? [ map { substr($_, 2) } grep { $_ =~ /^-l/ } split(/\s+/, $results) ] : undef; }, libpath => sub { my $results = $PARAMS{WIN32} ? undef : backtick( join('/bin/', grep { $_ } ($ENV{XMLPREFIX} || $PARAMS{XMLPREFIX}, 'xml2-config')), '--libs', ); $results ? [ map { substr($_, 2) } grep { $_ =~ /^-L/ } split(/\s+/, $results) ] : undef; }, incpath => sub { my $results = $PARAMS{WIN32} ? undef : backtick( join('/bin/', grep { $_ } ($ENV{XMLPREFIX} || $PARAMS{XMLPREFIX}, 'xml2-config')), '--cflags', ); $results ? [ map { substr($_, 2) } grep { $_ =~ /^-I/ } split(/\s+/, $results) ] : undef; }, header => 'libxml/parser.h', }, { lib => 'xml2 m z', libpath => \@COMMON_LIB_PATH, incpath => [ @COMMON_INC_PATH, '/usr/include/libxml2', '/usr/local/include/libxml2', '/usr/pkg/include/libxml2', '/opt/local/include/libxml2', ], header => 'libxml/parser.h', }, ], }, { name => 'iconv', configs => [ { lib => 'c', header => 'iconv.h', function => 'iconv_t iconv = iconv_open("UTF-8", "UTF-8");(void) iconv_close(iconv);return 0;', }, { lib => 'iconv', header => 'iconv.h', function => 'iconv_t iconv = iconv_open("UTF-8", "UTF-8");(void) iconv_close(iconv);return 0;', }, ], }, { name => 'icu', configs => [ { lib => sub { my $results = $PARAMS{WIN32} ? undef : backtick('icu-config', '--ldflags-libsonly'); $results ? [ map { substr($_, 2) } grep { $_ =~ /^-l/ } split(/\s+/, $results) ] : undef; }, libpath => sub { my $results = $PARAMS{WIN32} ? undef : backtick('icu-config', '--ldflags-searchpath'); $results ? [ map { substr($_, 2) } grep { $_ =~ /^-L/ } split(/\s+/, $results) ] : undef; }, incpath => sub { my $results = $PARAMS{WIN32} ? undef : backtick('icu-config', '--cppflags-searchpath'); $results ? [ map { substr($_, 2) } grep { $_ =~ /^-I/ } split(/\s+/, $results) ] : undef; }, header => [ 'unicode/utypes.h', 'unicode/ucnv.h', ], function => 'UErrorCode status = U_ZERO_ERROR;UConverter *uconv = ucnv_open("UTF-8", &status);ucnv_close(uconv);return 0;', }, { lib => 'icui18n icuuc icudata', libpath => \@COMMON_LIB_PATH, incpath => \@COMMON_INC_PATH, header => [ 'unicode/utypes.h', 'unicode/ucnv.h', ], function => 'UErrorCode status = U_ZERO_ERROR;UConverter *uconv = ucnv_open("UTF-8", &status);ucnv_close(uconv);return 0;', }, ], }, ); my %libs; my @options = qw(lib libpath incpath header function); foreach my $info (@REQUIRED_LIBS) { my $lib = $info->{name}; if ( $info->{perl} ) { my $ver = $info->{version} || ''; print "Checking for '$lib'... "; eval "use $lib $ver"; if (my $err = $@) { print "no\n"; print $err if $PARAMS{DEBUG} } else { print "yes\n"; $libs{$lib} = {}; } } else { foreach my $lib_config (@{ $info->{configs} }) { my %config; @config{@options} = map { my $results = $lib_config->{$_}; $results = ($results and ref($results) eq 'CODE') ? &$results() : $results; ($results and $_ ne 'function' and !ref($results)) ? [ split(/\s+/, $results) ] : $results ; } @options; next unless $config{lib} || $config{perl_lib}; print "Checking for '$lib'... "; delete $config{$_} for grep { !$config{$_} } keys %config; if ( $PARAMS{LIBS} ) { delete $config{lib}; delete $config{libpath}; $config{LIBS} = $PARAMS{LIBS}; } if ( $PARAMS{INC} ) { delete $config{incpath}; $config{INC} = $PARAMS{INC}; } if ( check_lib(debug => $PARAMS{DEBUG}, %config) ) { print "yes\n"; $libs{$lib} = \%config; last; } print "no\n"; } } if ($info->{mandatory} && !$libs{$lib}) { print STDERR <<"DEATH"; '$lib' library not found Try setting LIBS and INC values on the command line Also, you may try to run perl Makefile.PL with the DEBUG=1 parameter to see the exact reason why the detection of '$lib' installation failed or why Makefile.PL was not able to compile a test program. DEATH exit 1; } } return \%libs; } sub parse_params { my %params; @params{qw(DEBUG TRACE INC LIBS XMLPREFIX)} = (); @ARGV = grep { my ($key, $val) = split(/=/, $_, 2); if (exists $params{$key}) { $params{$key} = $val; 0 } else { 1 } } @ARGV; $params{WIN32} = ($^O =~ /Win32/); if ( $params{WIN32} ) { $params{DEVNULL} = 'DEVNULL'; } else { $params{DEVNULL} = eval { File::Spec->devnull }; if ($@) { $params{DEVNULL} = '/dev/null' } } return %params; } sub backtick { my $command = join(' ', @_); if ($PARAMS{DEBUG}) { print "Cmd: $command \n"; my $results = `$command`; if ($? != 0) { warn "Backticks call to '$command' failed"; return; } chomp $results; return $results; } local *OLDOUT; local *OLDERR; open(OLDOUT, ">&STDOUT"); open(OLDERR, ">&STDERR"); open(STDOUT, ">$PARAMS{DEVNULL}"); open(STDERR, ">$PARAMS{DEVNULL}"); my $results = `$command`; my $retval = $?; open(STDOUT, ">&OLDOUT"); open(STDERR, ">&OLDERR"); if ($retval != 0) { if ($PARAMS{DEBUG}) { warn "backticks call to '$command' failed"; } return; } chomp $results; return $results; } package MY; # Fix bug occurs while using multiple job compile: # gcc: error: xh_buffer.c: No such file or directory # Replace $* to $< # $*: dir/file.o -> file.c # $<: dir/file.o -> dir/file.c sub c_o { my $inherited = shift->SUPER::c_o(@_); $inherited =~ s/\$\*.*/\$" ], "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" : "XML-Hash-XS", "no_index" : { "directory" : [ "t", "inc" ] }, "prereqs" : { "build" : { "requires" : { "Config" : "0", "ExtUtils::MakeMaker" : "0", "File::Spec" : "0" } }, "configure" : { "requires" : { "Config" : "0", "ExtUtils::MakeMaker" : "0", "File::Spec" : "0" } }, "runtime" : { "requires" : { "Exporter" : "5.57", "XSLoader" : "0", "base" : "0" } }, "test" : { "requires" : { "Data::Dumper" : "0", "Test::More" : "0" } } }, "release_status" : "stable", "resources" : { "bugtracker" : { "web" : "https://github.com/yoreek/XML-Hash-XS/issues" }, "homepage" : "https://github.com/yoreek/XML-Hash-XS", "license" : [ "http://dev.perl.org/licenses/" ], "repository" : { "type" : "git", "url" : "https://github.com/yoreek/XML-Hash-XS.git", "web" : "https://github.com/yoreek/XML-Hash-XS" } }, "version" : "0.64", "x_serialization_backend" : "JSON::PP version 4.06" } XML-Hash-XS-0.64/xt/0000755000175000017500000000000014735256165012507 5ustar yurayuraXML-Hash-XS-0.64/xt/92-critic.t0000644000175000017500000000057712505302475014377 0ustar yurayura# test for recommendations from "Perl Best Practices" use strict; use warnings; use Test::More; eval { use Test::Perl::Critic }; plan skip_all => 'Test::Perl::Critic required' if $@; # check only new code my @dirs = qw( lib ); my @files = glob('t/*.t xt/*.t'); push @files, Perl::Critic::Utils::all_perl_files(@dirs); plan tests => scalar(@files); critic_ok($_) foreach @files; XML-Hash-XS-0.64/xt/91-pod-syntax.t0000644000175000017500000000030112505302725015206 0ustar yurayura# test sources for POD syntax use strict; use warnings; use Test::More; eval { use Test::Pod 1.22 }; plan skip_all => 'Test::Pod (>=1.22) is required' if $@; all_pod_files_ok(qw/ lib t /); XML-Hash-XS-0.64/xt/93-changes.t0000644000175000017500000000045512505304200014512 0ustar yurayura# test for recommendations from "Perl Best Practices" use strict; use warnings; use Test::More; use XML::Hash::XS; eval { use Test::CPAN::Changes }; plan skip_all => 'Test::CPAN::Changes required for this test' if $@; plan tests => 6; changes_file_ok(undef, { version => $XML::Hash::XS::VERSION }); XML-Hash-XS-0.64/README0000644000175000017500000002413214675474057012743 0ustar yurayuraNAME XML::Hash::XS - Simple and fast hash to XML and XML to hash conversion written in C SYNOPSIS use XML::Hash::XS; my $xmlstr = hash2xml \%hash; hash2xml \%hash, output => $fh; my $hash = xml2hash $xmlstr; my $hash = xml2hash \$xmlstr; my $hash = xml2hash 'test.xml', encoding => 'cp1251'; my $hash = xml2hash $fh; my $hash = xml2hash *STDIN; Or OOP way: use XML::Hash::XS qw(); my $conv = XML::Hash::XS->new(utf8 => 0, encoding => 'utf-8') my $xmlstr = $conv->hash2xml(\%hash, utf8 => 1); my $hash = $conv->xml2hash($xmlstr, encoding => 'cp1251'); DESCRIPTION This module implements simple hash to XML and XML to hash conversion written in C. During conversion uses minimum of memory, XML or hash is written directly without building DOM. Some features are optional and are available with appropriate libraries: * XML::LibXML library is required in order to build DOM * ICU or iconv library is required in order to perform charset conversions FUNCTIONS hash2xml $hash, [ %options ] $hash is reference to hash hash2xml { node1 => 'value1', node2 => [ 'value21', { node22 => 'value22' } ], node3 => \'value3', node4 => sub { return 'value4' }, node5 => sub { return { node51 => 'value51' } }, }, canonical => 1, indent => 2, ; will convert to: value1 value21 value22 value3 value4 value51 and (use_attr=1): hash2xml { node1 => 'value1', node2 => [ 'value21', { node22 => 'value22' } ], node3 => \'value3', node4 => sub { return 'value4' }, node5 => sub { return { node51 => 'value51' } }, }, use_attr => 1, canonical => 1, indent => 2, ; will convert to: value21 xml2hash $xml, [ %options ] $xml may be string, reference to string, file handle or tied file handle: xml2hash 'text'; # output: 'text' xml2hash 'text'; # output: { a => '1', b => '2', content => 'text' } open(my $fh, '<', 'test.xml'); xml2hash $fh; xml2hash *STDIN; OPTIONS doc [ => 0 ] *# hash2xml* if doc is '1', then returned value is XML::LibXML::Document. root [ = 'root' ] *# hash2xml* Root node name. version [ = '1.0' ] *# hash2xml* XML document version encoding [ = 'utf-8' ] *# hash2xml+xml2hash* XML input/output encoding indent [ = 0 ] *# hash2xml* if indent great than "0", XML output should be indented according to its hierarchic structure. This value determines the number of spaces. if indent is "0", XML output will all be on one line. output [ = undef ] *# hash2xml* XML output method if output is undefined, XML document dumped into string. if output is FH, XML document writes directly to a filehandle or a stream. canonical [ = 0 ] *# hash2xml* if canonical is "1", converter will be write hashes sorted by key. if canonical is "0", order of the element will be pseudo-randomly. use_attr [ = 0 ] *# hash2xml* if use_attr is "1", converter will be use the attributes. if use_attr is "0", converter will be use tags only. content [ = undef ] *# hash2xml+xml2hash* if defined that the key name for the text content(used only if use_attr=1). force_array => [ = undef ] *# xml2hash* This option is similar to "ForceArray" from XML::Simple module: . force_content => [ = 0 ] *# xml2hash* This option is similar to "ForceContent" from XML::Simple module: . merge_text [ = 0 ] *# xml2hash* Setting this option to "1" will cause merge adjacent text nodes. xml_decl [ = 1 ] *# hash2xml* if xml_decl is "1", output will start with the XML declaration ''. if xml_decl is "0", XML declaration will not be output. trim [ = 0 ] *# hash2xml+xml2hash* Trim leading and trailing whitespace from text nodes. suppress_empty => [ = 0 ] *# xml2hash* This option is similar to "SuppressEmpty" from XMl::Simple module: . utf8 [ = 1 ] *# hash2xml+xml2hash* Turn on utf8 flag for strings if enabled. max_depth [ = 1024 ] *# xml2hash* Maximum recursion depth. buf_size [ = 4096 ] *# hash2xml+xml2hash* Buffer size for reading end encoding data. keep_root [ = 1 ] *# hash2xml+xml2hash* Keep root element. filter [ = undef ] *# xml2hash* Filter nodes matched by pattern and return reference to array of nodes. Sample: my $xml = <<'XML'; 111 222 333 XML my $nodes = xml2hash($xml, filter => '/root/item1'); # $nodes = [ 111 ] my $nodes = xml2hash($xml, filter => ['/root/item1', '/root/item2']); # $nodes = [ 111, 222 ] my $nodes = xml2hash($xml, filter => qr[/root/item\d$]); # $nodes = [ 111, 222, 333 ] It may be used to parse large XML because does not require a lot of memory. cb [ = undef ] *# xml2hash* This option is used in conjunction with "filter" option and defines callback that will called for each matched node. Sample: xml2hash($xml, filter => qr[/root/item\d$], cb => sub { print $_[0], "\n"; }); # 111 # 222 # 333 method [ = 'NATIVE' ] *# hash2xml* experimental support the conversion methods other libraries if method is 'LX' then conversion result is the same as using XML::Hash::LX library Note: for 'LX' method following additional options are available: attr cdata text comm OBJECT SERIALISATION(hash2xml) 1. When object has a "toString" method In this case, the method of object is invoked in scalar context. It must return a single scalar that can be directly encoded into XML. Example: use XML::LibXML; local $XML::LibXML::skipXMLDeclaration = 1; my $doc = XML::LibXML->new->parse_string(''); print hash2xml({ doc => $doc }, indent => 2, xml_decl => 0); => 2. When object has overloaded stringification In this case, the stringification method of object is invoked and result is directly encoded into XML. Example: package Test { use overload '""' => sub { shift->stringify }, fallback => 1; sub new { my ($class, $str) = @_; bless { str => $str }, $class; } sub stringify { shift->{str} } } my $obj = Test->new('test string'); print hash2xml({ obj => $obj }, indent => 2, xml_decl => 0); => test string 3. When object has a "iternext" method ("NATIVE" method only) In this case, the method method will invoke a few times until the return value is not undefined. Example: my $count = 0; my $o = bless {}, 'Iterator'; *Iterator::iternext = sub { $count++ < 3 ? { count => $count } : undef }; print hash2xml({ item => $o }, use_attr => 1, indent => 2, xml_decl => 0); => This can be used to generate a large XML using minimum memory, example with DBI: my $sth = $dbh->prepare('SELECT * FROM foo WHERE bar=?'); $sth->execute(...); my $o = bless {}, 'Iterator'; *Iterator::iternext = sub { $sth->fetchrow_hashref() }; open(my $fh, '>', 'data.xml'); hash2xml({ row => $o }, use_attr => 1, indent => 2, xml_decl => 0, output => $fh); => ... BENCHMARK Performance benchmark in comparison with some popular modules(hash2xml): Rate XML::Hash XML::Hash::LX XML::Simple XML::Hash::XS XML::Hash 65.0/s -- -6% -37% -99% XML::Hash::LX 68.8/s 6% -- -33% -99% XML::Simple 103/s 58% 49% -- -98% XML::Hash::XS 4879/s 7404% 6988% 4658% -- Benchmark was done on AUTHOR Yuriy Ustushenko, COPYRIGHT AND LICENSE Copyright (C) 2012-2021 Yuriy Ustushenko This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself. XML-Hash-XS-0.64/lib/0000755000175000017500000000000014735256165012622 5ustar yurayuraXML-Hash-XS-0.64/lib/XML/0000755000175000017500000000000014735256165013262 5ustar yurayuraXML-Hash-XS-0.64/lib/XML/Hash/0000755000175000017500000000000014735256165014145 5ustar yurayuraXML-Hash-XS-0.64/lib/XML/Hash/XS.pm0000644000175000017500000002510614735256103015031 0ustar yurayurapackage XML::Hash::XS; use 5.008008; use strict; use warnings; use vars qw($VERSION @EXPORT @EXPORT_OK); use base 'Exporter'; @EXPORT_OK = @EXPORT = qw( hash2xml xml2hash ); $VERSION = '0.64'; require XSLoader; XSLoader::load('XML::Hash::XS', $VERSION); use vars qw($method $output $root $version $encoding $utf8 $indent $canonical $use_attr $content $xml_decl $doc $max_depth $attr $text $trim $cdata $comm $buf_size $keep_root $force_array $force_content $merge_text $suppress_empty ); # 'NATIVE' or 'LX' $method = 'NATIVE'; # native options $output = undef; $root = 'root'; $version = '1.0'; $encoding = ''; $utf8 = 1; $indent = 0; $canonical = 0; $use_attr = 0; $content = undef; $xml_decl = 1; $keep_root = 1; $doc = 0; $max_depth = 1024; $buf_size = 4096; $trim = 0; $force_array = undef; $force_content = 0; $merge_text = 0; $suppress_empty = 0; # XML::Hash::LX options $attr = '-'; $text = '#text'; $cdata = undef; $comm = undef; 1; __END__ =head1 NAME XML::Hash::XS - Simple and fast hash to XML and XML to hash conversion written in C =begin HTML

CPAN version

=end HTML =head1 SYNOPSIS use XML::Hash::XS; my $xmlstr = hash2xml \%hash; hash2xml \%hash, output => $fh; my $hash = xml2hash $xmlstr; my $hash = xml2hash \$xmlstr; my $hash = xml2hash 'test.xml', encoding => 'cp1251'; my $hash = xml2hash $fh; my $hash = xml2hash *STDIN; Or OOP way: use XML::Hash::XS qw(); my $conv = XML::Hash::XS->new(utf8 => 0, encoding => 'utf-8') my $xmlstr = $conv->hash2xml(\%hash, utf8 => 1); my $hash = $conv->xml2hash($xmlstr, encoding => 'cp1251'); =head1 DESCRIPTION This module implements simple hash to XML and XML to hash conversion written in C. During conversion uses minimum of memory, XML or hash is written directly without building DOM. Some features are optional and are available with appropriate libraries: =over 2 =item * XML::LibXML library is required in order to build DOM =item * ICU or iconv library is required in order to perform charset conversions =back =head1 FUNCTIONS =head2 hash2xml $hash, [ %options ] $hash is reference to hash hash2xml { node1 => 'value1', node2 => [ 'value21', { node22 => 'value22' } ], node3 => \'value3', node4 => sub { return 'value4' }, node5 => sub { return { node51 => 'value51' } }, }, canonical => 1, indent => 2, ; will convert to: value1 value21 value22 value3 value4 value51 and (use_attr=1): hash2xml { node1 => 'value1', node2 => [ 'value21', { node22 => 'value22' } ], node3 => \'value3', node4 => sub { return 'value4' }, node5 => sub { return { node51 => 'value51' } }, }, use_attr => 1, canonical => 1, indent => 2, ; will convert to: value21 =head2 xml2hash $xml, [ %options ] $xml may be string, reference to string, file handle or tied file handle: xml2hash 'text'; # output: 'text' xml2hash 'text'; # output: { a => '1', b => '2', content => 'text' } open(my $fh, '<', 'test.xml'); xml2hash $fh; xml2hash *STDIN; =head1 OPTIONS =over 4 =item doc [ => 0 ] I<# hash2xml> if doc is '1', then returned value is L. =item root [ = 'root' ] I<# hash2xml> Root node name. =item version [ = '1.0' ] I<# hash2xml> XML document version =item encoding [ = 'utf-8' ] I<# hash2xml+xml2hash> XML input/output encoding =item indent [ = 0 ] I<# hash2xml> if indent great than "0", XML output should be indented according to its hierarchic structure. This value determines the number of spaces. if indent is "0", XML output will all be on one line. =item output [ = undef ] I<# hash2xml> XML output method if output is undefined, XML document dumped into string. if output is FH, XML document writes directly to a filehandle or a stream. =item canonical [ = 0 ] I<# hash2xml> if canonical is "1", converter will be write hashes sorted by key. if canonical is "0", order of the element will be pseudo-randomly. =item use_attr [ = 0 ] I<# hash2xml> if use_attr is "1", converter will be use the attributes. if use_attr is "0", converter will be use tags only. =item content [ = undef ] I<# hash2xml+xml2hash> if defined that the key name for the text content(used only if use_attr=1). =item force_array => [ = undef ] I<# xml2hash> This option is similar to "ForceArray" from XML::Simple module: L. =item force_content => [ = 0 ] I<# xml2hash> This option is similar to "ForceContent" from XML::Simple module: L. =item merge_text [ = 0 ] I<# xml2hash> Setting this option to "1" will cause merge adjacent text nodes. =item xml_decl [ = 1 ] I<# hash2xml> if xml_decl is "1", output will start with the XML declaration ''. if xml_decl is "0", XML declaration will not be output. =item trim [ = 0 ] I<# hash2xml+xml2hash> Trim leading and trailing whitespace from text nodes. =item suppress_empty => [ = 0 ] I<# xml2hash> This option is similar to "SuppressEmpty" from XMl::Simple module: L. =item utf8 [ = 1 ] I<# hash2xml+xml2hash> Turn on utf8 flag for strings if enabled. =item max_depth [ = 1024 ] I<# xml2hash> Maximum recursion depth. =item buf_size [ = 4096 ] I<# hash2xml+xml2hash> Buffer size for reading end encoding data. =item keep_root [ = 1 ] I<# hash2xml+xml2hash> Keep root element. =item filter [ = undef ] I<# xml2hash> Filter nodes matched by pattern and return reference to array of nodes. Sample: my $xml = <<'XML'; 111 222 333 XML my $nodes = xml2hash($xml, filter => '/root/item1'); # $nodes = [ 111 ] my $nodes = xml2hash($xml, filter => ['/root/item1', '/root/item2']); # $nodes = [ 111, 222 ] my $nodes = xml2hash($xml, filter => qr[/root/item\d$]); # $nodes = [ 111, 222, 333 ] It may be used to parse large XML because does not require a lot of memory. =item cb [ = undef ] I<# xml2hash> This option is used in conjunction with "filter" option and defines callback that will called for each matched node. Sample: xml2hash($xml, filter => qr[/root/item\d$], cb => sub { print $_[0], "\n"; }); # 111 # 222 # 333 =item method [ = 'NATIVE' ] I<# hash2xml> experimental support the conversion methods other libraries if method is 'LX' then conversion result is the same as using L library Note: for 'LX' method following additional options are available: attr cdata text comm =back =head1 OBJECT SERIALISATION(hash2xml) =over 2 =item 1. When object has a "toString" method In this case, the method of object is invoked in scalar context. It must return a single scalar that can be directly encoded into XML. Example: use XML::LibXML; local $XML::LibXML::skipXMLDeclaration = 1; my $doc = XML::LibXML->new->parse_string(''); print hash2xml({ doc => $doc }, indent => 2, xml_decl => 0); => =item 2. When object has overloaded stringification In this case, the stringification method of object is invoked and result is directly encoded into XML. Example: package Test { use overload '""' => sub { shift->stringify }, fallback => 1; sub new { my ($class, $str) = @_; bless { str => $str }, $class; } sub stringify { shift->{str} } } my $obj = Test->new('test string'); print hash2xml({ obj => $obj }, indent => 2, xml_decl => 0); => test string =item 3. When object has a "iternext" method ("NATIVE" method only) In this case, the method method will invoke a few times until the return value is not undefined. Example: my $count = 0; my $o = bless {}, 'Iterator'; *Iterator::iternext = sub { $count++ < 3 ? { count => $count } : undef }; print hash2xml({ item => $o }, use_attr => 1, indent => 2, xml_decl => 0); => This can be used to generate a large XML using minimum memory, example with DBI: my $sth = $dbh->prepare('SELECT * FROM foo WHERE bar=?'); $sth->execute(...); my $o = bless {}, 'Iterator'; *Iterator::iternext = sub { $sth->fetchrow_hashref() }; open(my $fh, '>', 'data.xml'); hash2xml({ row => $o }, use_attr => 1, indent => 2, xml_decl => 0, output => $fh); => ... =back =head1 BENCHMARK Performance benchmark in comparison with some popular modules(hash2xml): Rate XML::Hash XML::Hash::LX XML::Simple XML::Hash::XS XML::Hash 65.0/s -- -6% -37% -99% XML::Hash::LX 68.8/s 6% -- -33% -99% XML::Simple 103/s 58% 49% -- -98% XML::Hash::XS 4879/s 7404% 6988% 4658% -- Benchmark was done on L =head1 AUTHOR Yuriy Ustushenko, Eyoreek@yahoo.comE =head1 COPYRIGHT AND LICENSE Copyright (C) 2012-2021 Yuriy Ustushenko This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself. =cut