Bencode-1.4000755001750000144 011414667363 11650 5ustar00apusers000000000000dist.ini000644001750000144 60611414667363 13356 0ustar00apusers000000000000Bencode-1.4name = Bencode version = 1.4 author = Aristotle Pagaltzis license = Perl_5 copyright_holder = Aristotle Pagaltzis [MetaResources] homepage = http://github.com/ap/Bencode bugtracker = http://github.com/ap/Bencode/issues repository = git://github.com/ap/Bencode [@Basic] [MetaJSON] [PkgVersion] [PodWeaver] [CheckChangeLog] [Prereqs / TestRequires] Test::More = 0 Changes000644001750000144 236411414667363 13230 0ustar00apusers000000000000Bencode-1.4=head1 Revision history for Bencode =head2 1.4 (2010-07-06 19:46:03+0200) =over 4 =item * New C<$max_depth> parameter to limit structure depth in parsing; fixes RT #59131 Many thanks to Day Barr for the report and the patch! =back =head2 1.31 (2007-11-05 02:53:06+01:00) =over 4 =item * C is necessary to get rid of C. Why doesn't C<./Build distcheck> run tests? =back =head2 1.3 (2007-11-05 00:08:04+01:00) =over 4 =item * Get rid of C; should work as far back as Perl 5.4 now =back =head2 1.2 (2007-11-04 19:37:37+01:00) =over 4 =item * 1.1 was released without changes in Changelog; fill in changes =item * Switch to POD changelog =item * Add test for newline-resilient string parsing (RT #30466) =back =head2 1.1 (2007-11-04 19:14:24+01:00) =over 4 =item * Change parsing of strings to not break on newlines (RT #30466) =item * Add leniency option to C (RT #19665) =item * Greatly improved error reporting (RT #30466) =item * Fix test suite to check for correct error message when rejecting input =item * Switch to inheritance-based use of L (previously imported C; not available on older Perls) =back =head2 1.0 (2006-04-15 11:54:39+01:00) =over 4 =item * Initial release. =back t000755001750000144 011414667363 12034 5ustar00apusers000000000000Bencode-1.400.load.t000644001750000144 20011414667363 13465 0ustar00apusers000000000000Bencode-1.4/tuse Test::More tests => 1; BEGIN { use_ok( 'Bencode' ) or BAIL_OUT( 'testing pointless if the module won\'t even load' ); } 02.bencode.t000644001750000144 154711414667363 14206 0ustar00apusers000000000000Bencode-1.4/tuse Test::More; use Bencode qw( bencode ); my @test = ( 'i4e' => 4, 'i0e' => 0, 'i-10e' => -10, 'i12345678901234567890e' => '12345678901234567890', '0:' => '', '3:abc' => 'abc', '10:1234567890' => \'1234567890', 'le' => [], 'li1ei2ei3ee' => [ 1, 2, 3 ], 'll5:Alice3:Bobeli2ei3eee' => [ [ 'Alice', 'Bob' ], [ 2, 3 ] ], 'de' => {}, 'd3:agei25e4:eyes4:bluee' => { 'age' => 25, 'eyes' => 'blue' }, 'd8:spam.mp3d6:author5:Alice6:lengthi100000eee' => { 'spam.mp3' => { 'author' => 'Alice', 'length' => 100000 } }, ); plan tests => 0 + @test / 2; while ( my ( $frozen, $thawed ) = splice @test, 0, 2 ) { is_deeply( bencode( $thawed ), $frozen, "encode $frozen" ); } # vim: set ft=perl: 01.bdecode.t000644001750000144 1371411414667363 14212 0ustar00apusers000000000000Bencode-1.4/tuse Test::More; use Bencode qw( bdecode ); my @test = ( '0:0:' => \[ qr/\Atrailing garbage at 2\b/, 'data past end of first correct bencoded string' ], 'i' => \[ qr/\Aunexpected end of data at 1\b/, 'aborted integer' ], 'i0' => \[ qr/\Amalformed integer data at 1\b/, 'unterminated integer' ], 'ie' => \[ qr/\Amalformed integer data at 1\b/, 'empty integer' ], 'i341foo382e' => \[ qr/\Amalformed integer data at 1\b/, 'malformed integer' ], 'i4e' => 4, 'i0e' => 0, 'i123456789e' => 123456789, 'i-10e' => -10, 'i-0e' => \[ qr/\Amalformed integer data at 1\b/, 'negative zero integer' ], 'i123' => \[ qr/\Amalformed integer data at 1\b/, 'unterminated integer' ], '' => \[ qr/\Aunexpected end of data at 0/, 'empty data' ], '1:' => \[ qr/\Aunexpected end of string data starting at 2\b/, 'string longer than data' ], 'i6easd' => \[ qr/\Atrailing garbage at 3\b/, 'integer with trailing garbage' ], '35208734823ljdahflajhdf' => \[ qr/\Agarbage at 0/, 'garbage looking vaguely like a string, with large count' ], '2:abfdjslhfld' => \[ qr/\Atrailing garbage at 4\b/, 'string with trailing garbage' ], '0:' => '', '3:abc' => 'abc', '10:1234567890' => '1234567890', '02:xy' => \[ qr/\Amalformed string length at 0\b/, 'string with extra leading zero in count' ], 'l' => \[ qr/\Aunexpected end of data at 1\b/, 'unclosed empty list' ], 'le' => [], 'leanfdldjfh' => \[ qr/\Atrailing garbage at 2\b/, 'empty list with trailing garbage' ], 'l0:0:0:e' => [ '', '', '' ], 'relwjhrlewjh' => \[ qr/\Agarbage at 0/, 'complete garbage' ], 'li1ei2ei3ee' => [ 1, 2, 3 ], 'l3:asd2:xye' => [ 'asd', 'xy' ], 'll5:Alice3:Bobeli2ei3eee' => [ [ 'Alice', 'Bob' ], [ 2, 3 ] ], 'd' => \[ qr/\Aunexpected end of data at 1\b/, 'unclosed empty dict' ], 'defoobar' => \[ qr/\Atrailing garbage at 2\b/, 'empty dict with trailing garbage' ], 'de' => {}, 'd3:agei25e4:eyes4:bluee' => { 'age' => 25, 'eyes' => 'blue' }, 'd8:spam.mp3d6:author5:Alice6:lengthi100000eee' => { 'spam.mp3' => { 'author' => 'Alice', 'length' => 100000 } }, 'd3:fooe' => \[ qr/\Adict key is missing value at 7\b/, 'dict with odd number of elements' ], 'di1e0:e' => \[ qr/\Adict key is not a string at 1/, 'dict with integer key' ], 'd1:b0:1:a0:e' => \[ qr/\Adict key not in sort order at 9/, 'missorted keys' ], 'd1:a0:1:a0:e' => \[ qr/\Aduplicate dict key at 9/, 'duplicate keys' ], 'i03e' => \[ qr/\Amalformed integer data at 1/, 'integer with leading zero' ], 'l01:ae' => \[ qr/\Amalformed string length at 1/, 'list with string with leading zero in count' ], '9999:x' => \[ qr/\Aunexpected end of string data starting at 5/, 'string shorter than count' ], 'l0:' => \[ qr/\Aunexpected end of data at 3/, 'unclosed list with content' ], 'd0:0:' => \[ qr/\Aunexpected end of data at 5/, 'unclosed dict with content' ], 'd0:' => \[ qr/\Aunexpected end of data at 3/, 'unclosed dict with odd number of elements' ], '00:' => \[ qr/\Amalformed string length at 0/, 'zero-length string with extra leading zero in count' ], 'l-3:e' => \[ qr/\Amalformed string length at 1/, 'list with negative-length string' ], 'i-03e' => \[ qr/\Amalformed integer data at 1/, 'negative integer with leading zero' ], "2:\x0A\x0D" => "\x0A\x0D", ['d1:a0:e', 0, 1] => { a => '' }, # Accept single dict when max_depth is 1 ['d1:a0:e', 0, 0] => \[ qr/\Anesting depth exceeded at 1/, 'single dict when max_depth is 0' ], ['d1:ad1:a0:ee', 0, 2] => { a => { a => '' } }, # Accept a nested dict when max_depth is 2 ['d1:ad1:a0:ee', 0, 1] => \[ qr/\Anesting depth exceeded at 5/, 'nested dict when max_depth is 1' ], ['l0:e', 0, 1] => [ '' ], # Accept single list when max_depth is 1 ['l0:e', 0, 0] => \[ qr/\Anesting depth exceeded at 1/, 'single list when max_depth is 0' ], ['ll0:ee', 0, 2] => [ [ '' ] ], # Accept a nested list when max_depth is 2 ['ll0:ee', 0, 1] => \[ qr/\Anesting depth exceeded at 2/, 'nested list when max_depth is 1' ], ['d1:al0:ee', 0, 2] => { a => [ '' ] }, # Accept dict containing list when max_depth is 2 ['d1:al0:ee', 0, 1] => \[ qr/\Anesting depth exceeded at 5/, 'list in dict when max_depth is 1' ], ['ld1:a0:ee', 0, 2] => [ { 'a' => '' } ], # Accept list containing dict when max_depth is 2 ['ld1:a0:ee', 0, 1] => \[ qr/\Anesting depth exceeded at 2/, 'dict in list when max_depth is 1' ], ['d1:a0:1:bl0:ee', 0, 2] => { a => '', b => [ '' ] }, # Accept dict containing list when max_depth is 2 ['d1:a0:1:bl0:ee', 0, 1] => \[ qr/\Anesting depth exceeded at 10/, 'list in dict when max_depth is 1' ], ); plan tests => 1 + @test / 2; while ( my ( $frozen, $thawed ) = splice @test, 0, 2 ) { my $result; my $testname; my $lived = eval { if ( ref $frozen eq 'ARRAY' ) { local $, = ', '; $testname = "decode [@$frozen]"; $result = bdecode( @$frozen ); } else { $testname = "decode '$frozen'"; $result = bdecode( $frozen ); } 1 }; if ( ref $thawed ne 'REF' ) { is_deeply( $result, $thawed, $testname ); } else { my ( $error_rx, $kind_of_brokenness ) = @$$thawed; like( $@, $error_rx, "reject $kind_of_brokenness" ); } } is_deeply( bdecode( 'd1:b0:1:a0:e', 1 ), { a => '', b => '', }, 'accept missorted keys when decoding leniently', ); # vim: set ft=perl: cpants.t000644001750000144 15711414667363 13633 0ustar00apusers000000000000Bencode-1.4/tuse Test::More skip_all => 'This is just to fob CPANTS'; eval 'use Test::Pod::Coverage'; eval 'use Test::Pod'; lib000755001750000144 011414667363 12337 5ustar00apusers000000000000Bencode-1.4Bencode.pm000644001750000144 1540111414667363 14414 0ustar00apusers000000000000Bencode-1.4/libpackage Bencode; BEGIN { $Bencode::VERSION = '1.4'; } use strict; use Carp; use Exporter; # ABSTRACT: BitTorrent serialisation format use vars qw( $VERSION @ISA @EXPORT_OK $DEBUG $do_lenient_decode $max_depth ); @ISA = qw( Exporter ); @EXPORT_OK = qw( bencode bdecode ); sub _msg { sprintf "@_", pos() || 0 } sub _bdecode_string { if ( m/ \G ( 0 | [1-9] \d* ) : /xgc ) { my $len = $1; croak _msg 'unexpected end of string data starting at %s' if $len > length() - pos(); my $str = substr $_, pos(), $len; pos() = pos() + $len; warn _msg STRING => "(length $len)", $len < 200 ? "[$str]" : () if $DEBUG; return $str; } else { my $pos = pos(); if ( m/ \G -? 0? \d+ : /xgc ) { pos() = $pos; croak _msg 'malformed string length at %s'; } } return; } sub _bdecode_chunk { warn _msg 'decoding at %s' if $DEBUG; local $max_depth = $max_depth - 1 if defined $max_depth; if ( defined( my $str = _bdecode_string() ) ) { return $str; } elsif ( m/ \G i /xgc ) { croak _msg 'unexpected end of data at %s' if m/ \G \z /xgc; m/ \G ( 0 | -? [1-9] \d* ) e /xgc or croak _msg 'malformed integer data at %s'; warn _msg INTEGER => $1 if $DEBUG; return $1; } elsif ( m/ \G l /xgc ) { warn _msg 'LIST' if $DEBUG; croak _msg 'nesting depth exceeded at %s' if defined $max_depth and $max_depth < 0; my @list; until ( m/ \G e /xgc ) { warn _msg 'list not terminated at %s, looking for another element' if $DEBUG; push @list, _bdecode_chunk(); } return \@list; } elsif ( m/ \G d /xgc ) { warn _msg 'DICT' if $DEBUG; croak _msg 'nesting depth exceeded at %s' if defined $max_depth and $max_depth < 0; my $last_key; my %hash; until ( m/ \G e /xgc ) { warn _msg 'dict not terminated at %s, looking for another pair' if $DEBUG; croak _msg 'unexpected end of data at %s' if m/ \G \z /xgc; my $key = _bdecode_string(); defined $key or croak _msg 'dict key is not a string at %s'; croak _msg 'duplicate dict key at %s' if exists $hash{ $key }; croak _msg 'dict key not in sort order at %s' if not( $do_lenient_decode ) and defined $last_key and $key lt $last_key; croak _msg 'dict key is missing value at %s' if m/ \G e /xgc; $last_key = $key; $hash{ $key } = _bdecode_chunk(); } return \%hash; } else { croak _msg m/ \G \z /xgc ? 'unexpected end of data at %s' : 'garbage at %s'; } } sub bdecode { local $_ = shift; local $do_lenient_decode = shift; local $max_depth = shift; my $deserialised_data = _bdecode_chunk(); croak _msg 'trailing garbage at %s' if $_ !~ m/ \G \z /xgc; return $deserialised_data; } sub _bencode { my ( $data ) = @_; if ( not ref $data ) { return sprintf 'i%se', $data if $data =~ m/\A (?: 0 | -? [1-9] \d* ) \z/x; return length( $data ) . ':' . $data; } elsif ( ref $data eq 'SCALAR' ) { # escape hatch -- use this to avoid num/str heuristics return length( $$data ) . ':' . $$data; } elsif ( ref $data eq 'ARRAY' ) { return 'l' . join( '', map _bencode( $_ ), @$data ) . 'e'; } elsif ( ref $data eq 'HASH' ) { return 'd' . join( '', map { _bencode( \$_ ), _bencode( $data->{ $_ } ) } sort keys %$data ) . 'e'; } else { croak 'unhandled data type'; } } sub bencode { croak 'need exactly one argument' if @_ != 1; goto &_bencode; } bdecode( 'i1e' ); =pod =head1 NAME Bencode - BitTorrent serialisation format =head1 VERSION version 1.4 =head1 SYNOPSIS use Bencode qw( bencode bdecode ); my $bencoded = bencode { 'age' => 25, 'eyes' => 'blue' }; print $bencoded, "\n"; my $decoded = bdecode $bencoded; =head1 DESCRIPTION This module implements the BitTorrent I serialisation format as described in L. =head1 INTERFACE =head2 C Takes a single argument which may be a scalar or a reference to a scalar, array or hash. Arrays and hashes may in turn contain values of these same types. Simple scalars that look like canonically represented integers will be serialised as such. To bypass the heuristic and force serialisation as a string, use a reference to a scalar. Croaks on unhandled data types. =head2 C Takes a string and returns the corresponding deserialised data structure. If you pass a true value for the second option, it will disregard the sort order of dict keys. This violation of the I format is somewhat common. If you pass an integer for the third option, it will croak when attempting to parse dictionaries nested deeper than this level, to prevent DoS attacks using maliciously crafted input. Croaks on malformed data. =head1 DIAGNOSTICS =over =item C Your data does not end after the first I-serialised item. You may also get this error if a malformed item follows. =item C Your data is malformed. =item C Your data is truncated. =item C Your data includes a string declared to be longer than the available data. =item C Your data contained a string with negative length or a length with leading zeroes. =item C Your data contained something that was supposed to be an integer but didn't make sense. =item C Your data violates the I format constaint that dict keys must appear in lexical sort order. =item C Your data violates the I format constaint that all dict keys must be unique. =item C Your data violates the I format constaint that all dict keys be strings. =item C Your data contains a dictionary with an odd number of elements. =item C Your data contains dicts or lists that are nested deeper than the $max_depth passed to C. =item C You are trying to serialise a data structure that consists of data types other than =over =item * scalars =item * references to arrays =item * references to hashes =item * references to scalars =back The format does not support this. =back =head1 BUGS AND LIMITATIONS Strings and numbers are practically indistinguishable in Perl, so C has to resort to a heuristic to decide how to serialise a scalar. This cannot be fixed. Please report any bugs or feature requests through the web interface at L. =head1 AUTHOR Aristotle Pagaltzis =head1 COPYRIGHT AND LICENSE This software is copyright (c) 2010 by Aristotle Pagaltzis. This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. =cut __END__ META.yml000644001750000144 105611414667363 13203 0ustar00apusers000000000000Bencode-1.4--- abstract: 'BitTorrent serialisation format' author: - 'Aristotle Pagaltzis ' build_requires: Test::More: 0 configure_requires: ExtUtils::MakeMaker: 6.31 dynamic_config: 0 generated_by: 'Dist::Zilla version 4.101831, CPAN::Meta::Converter version 2.101670' license: perl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: 1.4 name: Bencode resources: bugtracker: http://github.com/ap/Bencode/issues homepage: http://github.com/ap/Bencode repository: git://github.com/ap/Bencode version: 1.4 LICENSE000644001750000144 4354111414667363 12764 0ustar00apusers000000000000Bencode-1.4This software is copyright (c) 2010 by Aristotle Pagaltzis. This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. Terms of the Perl programming language system itself a) the GNU General Public License as published by the Free Software Foundation; either version 1, or (at your option) any later version, or b) the "Artistic License" --- The GNU General Public License, Version 1, February 1989 --- This software is Copyright (c) 2010 by Aristotle Pagaltzis. This is free software, licensed under: The GNU General Public License, Version 1, February 1989 GNU GENERAL PUBLIC LICENSE Version 1, February 1989 Copyright (C) 1989 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The license agreements of most software companies try to keep users at the mercy of those companies. By contrast, our General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. The General Public License applies to the Free Software Foundation's software and to any other program whose authors commit to using it. You can use it for your programs, too. When we speak of free software, we are referring to freedom, not price. Specifically, the General Public License is designed to make sure that you have the freedom to give away or sell copies of free software, that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of a such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must tell them their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any work containing the Program or a portion of it, either verbatim or with modifications. Each licensee is addressed as "you". 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this General Public License and to the absence of any warranty; and give any other recipients of the Program a copy of this General Public License along with the Program. You may charge a fee for the physical act of transferring a copy. 2. You may modify your copy or copies of the Program or any portion of it, and copy and distribute such modifications under the terms of Paragraph 1 above, provided that you also do the following: a) cause the modified files to carry prominent notices stating that you changed the files and the date of any change; and b) cause the whole of any work that you distribute or publish, that in whole or in part contains the Program or any part thereof, either with or without modifications, to be licensed at no charge to all third parties under the terms of this General Public License (except that you may choose to grant warranty protection to some or all third parties, at your option). c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the simplest and most usual way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this General Public License. d) You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. Mere aggregation of another independent work with the Program (or its derivative) on a volume of a storage or distribution medium does not bring the other work under the scope of these terms. 3. You may copy and distribute the Program (or a portion or derivative of it, under Paragraph 2) in object code or executable form under the terms of Paragraphs 1 and 2 above provided that you also do one of the following: a) accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Paragraphs 1 and 2 above; or, b) accompany it with a written offer, valid for at least three years, to give any third party free (except for a nominal charge for the cost of distribution) a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Paragraphs 1 and 2 above; or, c) accompany it with the information you received as to where the corresponding source code may be obtained. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form alone.) Source code for a work means the preferred form of the work for making modifications to it. For an executable file, complete source code means all the source code for all modules it contains; but, as a special exception, it need not include source code for modules which are standard libraries that accompany the operating system on which the executable file runs, or for standard header files or definitions files that accompany that operating system. 4. You may not copy, modify, sublicense, distribute or transfer the Program except as expressly provided under this General Public License. Any attempt otherwise to copy, modify, sublicense, distribute or transfer the Program is void, and will automatically terminate your rights to use the Program under this License. However, parties who have received copies, or rights to use copies, from you under this General Public License will not have their licenses terminated so long as such parties remain in full compliance. 5. By copying, distributing or modifying the Program (or any work based on the Program) you indicate your acceptance of this license to do so, and all its terms and conditions. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. 7. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of the license which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the license, you may choose any version ever published by the Free Software Foundation. 8. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 9. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 10. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS Appendix: How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to humanity, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) 19yy This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 1, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA. Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) 19xx name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (a program to direct compilers to make passes at assemblers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice That's all there is to it! --- The Artistic License 1.0 --- This software is Copyright (c) 2010 by Aristotle Pagaltzis. This is free software, licensed under: The Artistic License 1.0 The Artistic License Preamble The intent of this document is to state the conditions under which a Package may be copied, such that the Copyright Holder maintains some semblance of artistic control over the development of the package, while giving the users of the package the right to use and distribute the Package in a more-or-less customary fashion, plus the right to make reasonable modifications. Definitions: - "Package" refers to the collection of files distributed by the Copyright Holder, and derivatives of that collection of files created through textual modification. - "Standard Version" refers to such a Package if it has not been modified, or has been modified in accordance with the wishes of the Copyright Holder. - "Copyright Holder" is whoever is named in the copyright or copyrights for the package. - "You" is you, if you're thinking about copying or distributing this Package. - "Reasonable copying fee" is whatever you can justify on the basis of media cost, duplication charges, time of people involved, and so on. (You will not be required to justify it to the Copyright Holder, but only to the computing community at large as a market that must bear the fee.) - "Freely Available" means that no fee is charged for the item itself, though there may be fees involved in handling the item. It also means that recipients of the item may redistribute it under the same conditions they received it. 1. You may make and give away verbatim copies of the source form of the Standard Version of this Package without restriction, provided that you duplicate all of the original copyright notices and associated disclaimers. 2. You may apply bug fixes, portability fixes and other modifications derived from the Public Domain or from the Copyright Holder. A Package modified in such a way shall still be considered the Standard Version. 3. You may otherwise modify your copy of this Package in any way, provided that you insert a prominent notice in each changed file stating how and when you changed that file, and provided that you do at least ONE of the following: a) place your modifications in the Public Domain or otherwise make them Freely Available, such as by posting said modifications to Usenet or an equivalent medium, or placing the modifications on a major archive site such as ftp.uu.net, or by allowing the Copyright Holder to include your modifications in the Standard Version of the Package. b) use the modified Package only within your corporation or organization. c) rename any non-standard executables so the names do not conflict with standard executables, which must also be provided, and provide a separate manual page for each non-standard executable that clearly documents how it differs from the Standard Version. d) make other distribution arrangements with the Copyright Holder. 4. You may distribute the programs of this Package in object code or executable form, provided that you do at least ONE of the following: a) distribute a Standard Version of the executables and library files, together with instructions (in the manual page or equivalent) on where to get the Standard Version. b) accompany the distribution with the machine-readable source of the Package with your modifications. c) accompany any non-standard executables with their corresponding Standard Version executables, giving the non-standard executables non-standard names, and clearly documenting the differences in manual pages (or equivalent), together with instructions on where to get the Standard Version. d) make other distribution arrangements with the Copyright Holder. 5. You may charge a reasonable copying fee for any distribution of this Package. You may charge any fee you choose for support of this Package. You may not charge a fee for this Package itself. However, you may distribute this Package in aggregate with other (possibly commercial) programs as part of a larger (possibly commercial) software distribution provided that you do not advertise this Package as a product of your own. 6. The scripts and library files supplied as input to or produced as output from the programs of this Package do not automatically fall under the copyright of this Package, but belong to whomever generated them, and may be sold commercially, and may be aggregated with this Package. 7. C or perl subroutines supplied by you and linked into this Package shall not be considered part of this Package. 8. The name of the Copyright Holder may not be used to endorse or promote products derived from this software without specific prior written permission. 9. THIS PACKAGE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. The End README000644001750000144 45111414667363 12570 0ustar00apusers000000000000Bencode-1.4 This archive contains the distribution Bencode, version 1.4: BitTorrent serialisation format This software is copyright (c) 2010 by Aristotle Pagaltzis. This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. MANIFEST000644001750000144 21411414667363 13036 0ustar00apusers000000000000Bencode-1.4Changes LICENSE MANIFEST META.json META.yml Makefile.PL README dist.ini lib/Bencode.pm t/00.load.t t/01.bdecode.t t/02.bencode.t t/cpants.t META.json000644001750000144 167211414667363 13357 0ustar00apusers000000000000Bencode-1.4{ "abstract" : "BitTorrent serialisation format", "author" : [ "Aristotle Pagaltzis " ], "dynamic_config" : 0, "generated_by" : "Dist::Zilla version 4.101831, CPAN::Meta::Converter version 2.101670", "license" : [ "perl_5" ], "meta-spec" : { "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec", "version" : "2" }, "name" : "Bencode", "prereqs" : { "configure" : { "requires" : { "ExtUtils::MakeMaker" : "6.31" } }, "test" : { "requires" : { "Test::More" : 0 } } }, "release_status" : "stable", "resources" : { "bugtracker" : { "web" : "http://github.com/ap/Bencode/issues" }, "homepage" : "http://github.com/ap/Bencode", "repository" : { "type" : "git", "url" : "git://github.com/ap/Bencode" } }, "version" : "1.4" } Makefile.PL000644001750000144 172411414667363 13706 0ustar00apusers000000000000Bencode-1.4 use strict; use warnings; use ExtUtils::MakeMaker 6.31; my %WriteMakefileArgs = ( 'ABSTRACT' => 'BitTorrent serialisation format', 'AUTHOR' => 'Aristotle Pagaltzis ', 'BUILD_REQUIRES' => { 'Test::More' => '0' }, 'CONFIGURE_REQUIRES' => { 'ExtUtils::MakeMaker' => '6.31' }, 'DISTNAME' => 'Bencode', 'EXE_FILES' => [], 'LICENSE' => 'perl', 'NAME' => 'Bencode', 'PREREQ_PM' => {}, 'VERSION' => '1.4', 'test' => { 'TESTS' => 't/*.t' } ); unless ( eval { ExtUtils::MakeMaker->VERSION(6.56) } ) { my $br = delete $WriteMakefileArgs{BUILD_REQUIRES}; my $pp = $WriteMakefileArgs{PREREQ_PM}; for my $mod ( keys %$br ) { if ( exists $pp->{$mod} ) { $pp->{$mod} = $br->{$mod} if $br->{$mod} > $pp->{$mod}; } else { $pp->{$mod} = $br->{$mod}; } } } delete $WriteMakefileArgs{CONFIGURE_REQUIRES} unless eval { ExtUtils::MakeMaker->VERSION(6.52) }; WriteMakefile(%WriteMakefileArgs);