Test-Memory-Cycle-1.06/0000755000101700007640000000000012652315771014052 5ustar alesterispcTest-Memory-Cycle-1.06/META.json0000644000101700007640000000210312652315771015467 0ustar alesterispc{ "abstract" : "Verifies code hasn't left circular references", "author" : [ "unknown" ], "dynamic_config" : 1, "generated_by" : "ExtUtils::MakeMaker version 6.96, CPAN::Meta::Converter version 2.132830", "license" : [ "unknown" ], "meta-spec" : { "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec", "version" : "2" }, "name" : "Test-Memory-Cycle", "no_index" : { "directory" : [ "t", "inc" ] }, "prereqs" : { "build" : { "requires" : { "ExtUtils::MakeMaker" : "0" } }, "configure" : { "requires" : { "ExtUtils::MakeMaker" : "0" } }, "runtime" : { "requires" : { "Devel::Cycle" : "1.07", "Getopt::Long" : "0", "PadWalker" : "0", "Test::Builder" : "0", "Test::Builder::Tester" : "0", "Test::More" : "0", "Test::Simple" : "0.62" } } }, "release_status" : "stable", "version" : "1.06" } Test-Memory-Cycle-1.06/MANIFEST0000644000101700007640000000055612652315771015211 0ustar alesterispcChanges Cycle.pm LICENSE MANIFEST Makefile.PL README.md t/00-load.t t/cycle-exists.t t/family-array.t t/family-hash.t t/family-object.t t/family-scalar.t t/Foo.pm t/good.t t/pod-coverage.t t/pod.t META.yml Module YAML meta-data (added by MakeMaker) META.json Module JSON meta-data (added by MakeMaker) Test-Memory-Cycle-1.06/README.md0000644000101700007640000000031312652311723015317 0ustar alesterispc# test-memory-cycle Test::Memory::Cycle -- A Perl module to check for memory leaks and circular memory references. It's a thin Test::More-compatible wrapper around Lincoln Stein's Devel::Cycle module. Test-Memory-Cycle-1.06/LICENSE0000644000101700007640000002134212652315566015063 0ustar alesterispc The Artistic License 2.0 Copyright (c) 2000-2006, The Perl Foundation. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble This license establishes the terms under which a given free software Package may be copied, modified, distributed, and/or redistributed. The intent is that the Copyright Holder maintains some artistic control over the development of that Package while still keeping the Package available as open source and free software. You are always permitted to make arrangements wholly outside of this license directly with the Copyright Holder of a given Package. If the terms of this license do not permit the full use that you propose to make of the Package, you should contact the Copyright Holder and seek a different licensing arrangement. Definitions "Copyright Holder" means the individual(s) or organization(s) named in the copyright notice for the entire Package. "Contributor" means any party that has contributed code or other material to the Package, in accordance with the Copyright Holder's procedures. "You" and "your" means any person who would like to copy, distribute, or modify the Package. "Package" means the collection of files distributed by the Copyright Holder, and derivatives of that collection and/or of those files. A given Package may consist of either the Standard Version, or a Modified Version. "Distribute" means providing a copy of the Package or making it accessible to anyone else, or in the case of a company or organization, to others outside of your company or organization. "Distributor Fee" means any fee that you charge for Distributing this Package or providing support for this Package to another party. It does not mean licensing fees. "Standard Version" refers to the Package if it has not been modified, or has been modified only in ways explicitly requested by the Copyright Holder. "Modified Version" means the Package, if it has been changed, and such changes were not explicitly requested by the Copyright Holder. "Original License" means this Artistic License as Distributed with the Standard Version of the Package, in its current version or as it may be modified by The Perl Foundation in the future. "Source" form means the source code, documentation source, and configuration files for the Package. "Compiled" form means the compiled bytecode, object code, binary, or any other form resulting from mechanical transformation or translation of the Source form. Permission for Use and Modification Without Distribution (1) You are permitted to use the Standard Version and create and use Modified Versions for any purpose without restriction, provided that you do not Distribute the Modified Version. Permissions for Redistribution of the Standard Version (2) You may Distribute verbatim copies of the Source form of the Standard Version of this Package in any medium without restriction, either gratis or for a Distributor Fee, provided that you duplicate all of the original copyright notices and associated disclaimers. At your discretion, such verbatim copies may or may not include a Compiled form of the Package. (3) You may apply any bug fixes, portability changes, and other modifications made available from the Copyright Holder. The resulting Package will still be considered the Standard Version, and as such will be subject to the Original License. Distribution of Modified Versions of the Package as Source (4) You may Distribute your Modified Version as Source (either gratis or for a Distributor Fee, and with or without a Compiled form of the Modified Version) provided that you clearly document how it differs from the Standard Version, including, but not limited to, documenting any non-standard features, executables, or modules, and provided that you do at least ONE of the following: (a) make the Modified Version available to the Copyright Holder of the Standard Version, under the Original License, so that the Copyright Holder may include your modifications in the Standard Version. (b) ensure that installation of your Modified Version does not prevent the user installing or running the Standard Version. In addition, the Modified Version must bear a name that is different from the name of the Standard Version. (c) allow anyone who receives a copy of the Modified Version to make the Source form of the Modified Version available to others under (i) the Original License or (ii) a license that permits the licensee to freely copy, modify and redistribute the Modified Version using the same licensing terms that apply to the copy that the licensee received, and requires that the Source form of the Modified Version, and of any works derived from it, be made freely available in that license fees are prohibited but Distributor Fees are allowed. Distribution of Compiled Forms of the Standard Version or Modified Versions without the Source (5) You may Distribute Compiled forms of the Standard Version without the Source, provided that you include complete instructions on how to get the Source of the Standard Version. Such instructions must be valid at the time of your distribution. If these instructions, at any time while you are carrying out such distribution, become invalid, you must provide new instructions on demand or cease further distribution. If you provide valid instructions or cease distribution within thirty days after you become aware that the instructions are invalid, then you do not forfeit any of your rights under this license. (6) You may Distribute a Modified Version in Compiled form without the Source, provided that you comply with Section 4 with respect to the Source of the Modified Version. Aggregating or Linking the Package (7) You may aggregate the Package (either the Standard Version or Modified Version) with other packages and Distribute the resulting aggregation provided that you do not charge a licensing fee for the Package. Distributor Fees are permitted, and licensing fees for other components in the aggregation are permitted. The terms of this license apply to the use and Distribution of the Standard or Modified Versions as included in the aggregation. (8) You are permitted to link Modified and Standard Versions with other works, to embed the Package in a larger work of your own, or to build stand-alone binary or bytecode versions of applications that include the Package, and Distribute the result without restriction, provided the result does not expose a direct interface to the Package. Items That are Not Considered Part of a Modified Version (9) Works (including, but not limited to, modules and scripts) that merely extend or make use of the Package, do not, by themselves, cause the Package to be a Modified Version. In addition, such works are not considered parts of the Package itself, and are not subject to the terms of this license. General Provisions (10) Any use, modification, and distribution of the Standard or Modified Versions is governed by this Artistic License. By using, modifying or distributing the Package, you accept this license. Do not use, modify, or distribute the Package, if you do not accept this license. (11) If your Modified Version has been derived from a Modified Version made by someone other than you, you are nevertheless required to ensure that your Modified Version complies with the requirements of this license. (12) This license does not grant you the right to use any trademark, service mark, tradename, or logo of the Copyright Holder. (13) This license includes the non-exclusive, worldwide, free-of-charge patent license to make, have made, use, offer to sell, sell, import and otherwise transfer the Package with respect to any patent claims licensable by the Copyright Holder that are necessarily infringed by the Package. If you institute patent litigation (including a cross-claim or counterclaim) against any party alleging that the Package constitutes direct or contributory patent infringement, then this Artistic License to you shall terminate on the date that such litigation is filed. (14) Disclaimer of Warranty: THE PACKAGE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS "AS IS' AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES. THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, OR NON-INFRINGEMENT ARE DISCLAIMED TO THE EXTENT PERMITTED BY YOUR LOCAL LAW. UNLESS REQUIRED BY LAW, NO COPYRIGHT HOLDER OR CONTRIBUTOR WILL BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING IN ANY WAY OUT OF THE USE OF THE PACKAGE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. Test-Memory-Cycle-1.06/META.yml0000644000101700007640000000113712652315771015325 0ustar alesterispc--- abstract: "Verifies code hasn't left circular references" author: - unknown build_requires: ExtUtils::MakeMaker: 0 configure_requires: ExtUtils::MakeMaker: 0 dynamic_config: 1 generated_by: 'ExtUtils::MakeMaker version 6.96, CPAN::Meta::Converter version 2.132830' license: unknown meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: 1.4 name: Test-Memory-Cycle no_index: directory: - t - inc requires: Devel::Cycle: 1.07 Getopt::Long: 0 PadWalker: 0 Test::Builder: 0 Test::Builder::Tester: 0 Test::More: 0 Test::Simple: 0.62 version: 1.06 Test-Memory-Cycle-1.06/t/0000755000101700007640000000000012652315771014315 5ustar alesterispcTest-Memory-Cycle-1.06/t/family-hash.t0000644000101700007640000000314012652315314016673 0ustar alesterispc#!perl -T use strict; use warnings FATAL => 'all'; use Scalar::Util qw( weaken ); use Test::More tests => 7; use Test::Builder::Tester; BEGIN { use_ok( 'Test::Memory::Cycle' ); } my $mom = { name => "Marilyn Lester", }; my $me = { name => "Andy Lester", mother => $mom, }; $mom->{son} = $me; test_out( "not ok 1 - Small family" ); test_fail( +4 ); test_diag( 'Cycle #1' ); test_diag( ' %A->{mother} => %B' ); test_diag( ' %B->{son} => %A' ); memory_cycle_ok( $me, "Small family" ); test_test( "Small family testing" ); test_out( "ok 1 - Small family has Cycles" ); memory_cycle_exists( $me, "Small family has Cycles" ); test_test( "Small family testing for cycles" ); weaken($me->{mother}->{son}); test_out( "ok 1 - Small family (weakened)" ); memory_cycle_ok( $me, "Small family (weakened)" ); test_test( "Small family (weakened) testing (no cycles)" ); test_out( "not ok 1 - Small family (weakened)" ); test_fail( +4 ); test_diag( 'Cycle #1' ); test_diag( ' %A->{mother} => %B' ); test_diag( ' w->%B->{son} => %A' ); weakened_memory_cycle_ok( $me, "Small family (weakened)" ); test_test( "Small family (weakened) testing for cycles (weakened cycles found)" ); test_out( "not ok 1 - Small family (weakened) has Cycles" ); test_fail( +1 ); memory_cycle_exists( $me, "Small family (weakened) has Cycles" ); test_test( "Small family (weakened) testing for cycles (no cycles)" ); test_out( "ok 1 - Small family (weakened) has Cycles" ); weakened_memory_cycle_exists( $me, "Small family (weakened) has Cycles" ); test_test( "Small family (weakened) testing for cycles (weakened cycles found)" );Test-Memory-Cycle-1.06/t/cycle-exists.t0000644000101700007640000000224612652315566017124 0ustar alesterispc#!perl -T use warnings FATAL => 'all'; use strict; use Test::Builder::Tester tests => 5; use Test::More; BEGIN { use_ok( 'Test::Memory::Cycle' ); } { my $cycle_less_hash = {}; test_out( "not ok 1 - A hash reference has no cycles" ); test_fail( +1 ); memory_cycle_exists( $cycle_less_hash, "A hash reference has no cycles" ); test_test( "Testing for lack of cycles in hash reference" ); } { my $cycle_less_array = []; test_out( "not ok 1 - An array reference has no cycles" ); test_fail( +1 ); memory_cycle_exists( $cycle_less_array, "An array reference has no cycles" ); test_test( "Testing for lack of cycles in array reference" ); } { my $var = 0; my $cycle_less_scalar = \$var; test_out( "not ok 1 - A scalar reference has no cycles" ); test_fail( +1 ); memory_cycle_exists( $cycle_less_scalar, "A scalar reference has no cycles" ); test_test( "Testing for lack of cycles in scalar reference" ); } { my $cycle_less_object = bless({}, 'NoCyclesHere'); test_out( "not ok 1 - A blessed reference has no cycles" ); test_fail( +1 ); memory_cycle_exists( $cycle_less_object, "A blessed reference has no cycles" ); test_test( "Testing for lack of cycles in blessed reference" ); } Test-Memory-Cycle-1.06/t/pod-coverage.t0000644000101700007640000000025512652315135017051 0ustar alesterispc#!perl -Tw use Test::More; eval "use Test::Pod::Coverage 1.04"; plan skip_all => "Test::Pod::Coverage 1.04 required for testing POD coverage" if $@; all_pod_coverage_ok(); Test-Memory-Cycle-1.06/t/family-array.t0000644000101700007640000000512312652315160017070 0ustar alesterispc#!perl -T use strict; use warnings FATAL => 'all'; use Scalar::Util qw( weaken ); use Test::More tests => 7; use Test::Builder::Tester; BEGIN { use_ok( 'Test::Memory::Cycle' ); } my $mom = { name => "Marilyn Lester", }; my $dad = { name => "Dan Lester", }; my $me = { name => "Andy Lester", parents => [$mom,$dad], }; my $andy = $me; my $amy = { name => "Amy Lester", }; my $quinn = { name => "Quinn Lester", parents => [$andy,$amy], }; $mom->{children} = [$andy]; $mom->{grandchildren} = [$quinn]; test_out( "not ok 1 - The Array Family" ); test_fail( +13 ); test_diag( 'Cycle #1' ); test_diag( ' %A->{parents} => @B' ); test_diag( ' @B->[0] => %C' ); test_diag( ' %C->{children} => @D' ); test_diag( ' @D->[0] => %A' ); test_diag( 'Cycle #2' ); test_diag( ' %A->{parents} => @B' ); test_diag( ' @B->[0] => %C' ); test_diag( ' %C->{grandchildren} => @E' ); test_diag( ' @E->[0] => %F' ); test_diag( ' %F->{parents} => @G' ); test_diag( ' @G->[0] => %A' ); memory_cycle_ok( $me, "The Array Family" ); test_test( "Array family testing" ); test_out( "ok 1 - The Array Family has Cycles" ); memory_cycle_exists( $me, "The Array Family has Cycles" ); test_test( "Array family testing for cycles" ); weaken($me->{parents}->[0]->{children}->[0]); weaken($me->{parents}->[0]->{grandchildren}->[0]->{parents}->[0]); test_out( "ok 1 - The Array Family (weakened)" ); memory_cycle_ok( $me, "The Array Family (weakened)" ); test_test( "Array family (weakened) testing (no cycles)" ); test_out( "not ok 1 - The Array Family (weakened)" ); test_fail( +13 ); test_diag( 'Cycle #1' ); test_diag( ' %A->{parents} => @B' ); test_diag( ' @B->[0] => %C' ); test_diag( ' %C->{children} => @D' ); test_diag( ' w->@D->[0] => %A' ); test_diag( 'Cycle #2' ); test_diag( ' %A->{parents} => @B' ); test_diag( ' @B->[0] => %C' ); test_diag( ' %C->{grandchildren} => @E' ); test_diag( ' @E->[0] => %F' ); test_diag( ' %F->{parents} => @G' ); test_diag( ' w->@G->[0] => %A' ); weakened_memory_cycle_ok( $me, "The Array Family (weakened)" ); test_test( "Array family (weakened) testing (weakened cycles showing)" ); test_out( "not ok 1 - The Array Family (weakened) has Cycles" ); test_fail( +1 ); memory_cycle_exists( $me, "The Array Family (weakened) has Cycles" ); test_test( "Array family (weakened) testing for cycles (no cycles)" ); test_out( "ok 1 - The Array Family (weakened) has Cycles" ); weakened_memory_cycle_exists( $me, "The Array Family (weakened) has Cycles" ); test_test( "Array family (weakened) testing for cycles (weakened cycles showing)" ); Test-Memory-Cycle-1.06/t/family-scalar.t0000644000101700007640000000531112652315131017214 0ustar alesterispc#!perl -T use strict; use warnings FATAL => 'all'; use Scalar::Util qw( weaken ); use Test::More tests => 12; use Test::Builder::Tester; BEGIN { use_ok( 'Test::Memory::Cycle' ); } my $me; $me = \$me; test_out( "not ok 1 - Scalar Family" ); test_fail( +3 ); test_diag( 'Cycle #1' ); test_diag( ' $A => $A' ); memory_cycle_ok( $me, "Scalar Family" ); test_test( "Simple loopback" ); test_out( "ok 1 - Scalar Family has Cycles" ); memory_cycle_exists( $me, "Scalar Family has Cycles" ); test_test( "Simple loopback testing for cycles" ); my $myself = \$me; $me = \$myself; test_out( "not ok 1" ); test_fail( +4 ); test_diag( 'Cycle #1' ); test_diag( ' $A => $B' ); test_diag( ' $B => $A' ); memory_cycle_ok( $myself ); # Test non-comments test_test( "Simple loopback to myself" ); test_out( "ok 1" ); memory_cycle_exists( $myself ); # Test non-comments test_test( "Simple loopback to myself with cycles" ); # Order matters test_out( "not ok 1" ); test_fail( +4 ); test_diag( 'Cycle #1' ); test_diag( ' $B => $A' ); test_diag( ' $A => $B' ); memory_cycle_ok( $me ); # Test non-comments test_test( "Flip-flopped the A/B" ); my $sybil; $sybil = [ $sybil, \$sybil, $me, \$sybil ]; test_out( "not ok 1" ); test_fail( +11 ); test_diag( 'Cycle #1' ); test_diag( ' @C->[1] => $D' ); test_diag( ' $D => @C' ); test_diag( 'Cycle #2' ); test_diag( ' @C->[2] => $B' ); test_diag( ' $B => $A' ); test_diag( ' $A => $B' ); test_diag( 'Cycle #3' ); test_diag( ' @C->[3] => $D' ); test_diag( ' $D => @C' ); memory_cycle_ok( $sybil ); # Test non-comments test_test( "Sybil and her sisters" ); test_out( "ok 1" ); memory_cycle_exists( $sybil ); # Test non-comments test_test( "Sybil and her sisters have cycles" ); weaken($sybil->[1]); weaken($sybil->[2]); weaken($sybil->[3]); test_out( "ok 1" ); memory_cycle_ok( $sybil ); # Test non-comments test_test( "Sybil and her sisters (weakened) (no cycles found)" ); test_out( "not ok 1" ); test_fail( +11 ); test_diag( 'Cycle #1' ); test_diag( ' w->@C->[1] => $D' ); test_diag( ' $D => @C' ); test_diag( 'Cycle #2' ); test_diag( ' w->@C->[2] => $B' ); test_diag( ' $B => $A' ); test_diag( ' $A => $B' ); test_diag( 'Cycle #3' ); test_diag( ' w->@C->[3] => $D' ); test_diag( ' $D => @C' ); weakened_memory_cycle_ok( $sybil ); # Test non-comments test_test( "Sybil and her sisters (weakened) (weakened cycles found)" ); test_out( "not ok 1" ); test_fail( +1 ); memory_cycle_exists( $sybil ); # Test non-comments test_test( "Sybil and her sisters (weakened) have cycles (no cycles found)" ); test_out( "ok 1" ); weakened_memory_cycle_exists( $sybil ); # Test non-comments test_test( "Sybil and her sisters (weakened) have cycles (weakened cycles found)" ); Test-Memory-Cycle-1.06/t/00-load.t0000644000101700007640000000035212652315566015640 0ustar alesterispc#!perl -T use strict; use warnings FATAL => 'all'; use Test::More tests => 1; use_ok( 'Test::Memory::Cycle' ); diag( "Testing Test::Memory::Cycle $Test::Memory::Cycle::VERSION under Perl $] and Test::More $Test::More::VERSION" ); Test-Memory-Cycle-1.06/t/Foo.pm0000644000101700007640000000014612652315566015401 0ustar alesterispcpackage Foo; use strict; use warnings; sub new { my $class = shift; bless {}, $class; } 1; Test-Memory-Cycle-1.06/t/pod.t0000644000101700007640000000021512652315140015250 0ustar alesterispc#!perl -Tw use Test::More; eval "use Test::Pod 1.14"; plan skip_all => "Test::Pod 1.14 required for testing POD" if $@; all_pod_files_ok(); Test-Memory-Cycle-1.06/t/family-object.t0000644000101700007640000000250712652315116017224 0ustar alesterispc#!perl -T use strict; use warnings FATAL => 'all'; use Test::More tests => 3; use Test::Builder::Tester; use Getopt::Long; BEGIN { use_ok( 'Test::Memory::Cycle' ); } my $dis = Getopt::Long::Parser->new; my $dat = Getopt::Long::Parser->new; $dis->{dose} = [$dat,$dat,$dat]; $dat->{dem} = { dis => $dis }; test_out( "not ok 1 - Object family" ); test_fail( +16 ); test_diag( 'Cycle #1' ); test_diag( ' Getopt::Long::Parser A->{dose} => @B' ); test_diag( ' @B->[0] => Getopt::Long::Parser C' ); test_diag( ' Getopt::Long::Parser C->{dem} => %D' ); test_diag( ' %D->{dis} => Getopt::Long::Parser A' ); test_diag( 'Cycle #2' ); test_diag( ' Getopt::Long::Parser A->{dose} => @B' ); test_diag( ' @B->[1] => Getopt::Long::Parser C' ); test_diag( ' Getopt::Long::Parser C->{dem} => %D' ); test_diag( ' %D->{dis} => Getopt::Long::Parser A' ); test_diag( 'Cycle #3' ); test_diag( ' Getopt::Long::Parser A->{dose} => @B' ); test_diag( ' @B->[2] => Getopt::Long::Parser C' ); test_diag( ' Getopt::Long::Parser C->{dem} => %D' ); test_diag( ' %D->{dis} => Getopt::Long::Parser A' ); memory_cycle_ok( $dis, "Object family" ); test_test( "Object family testing" ); test_out( "ok 1 - Object family has Cycles" ); memory_cycle_exists( $dis, "Object family has Cycles" ); test_test( "Object family testing with cycles" ); Test-Memory-Cycle-1.06/t/good.t0000644000101700007640000000040512652315566015433 0ustar alesterispc#!perl -T use strict; use warnings FATAL => 'all'; use Test::Builder::Tester tests => 2; use Test::More; use lib 't'; use Foo; BEGIN { use_ok( 'Test::Memory::Cycle' ); } GOOD: { my $cgi = new Foo; memory_cycle_ok( $cgi, "Foo doesn't leak" ); } Test-Memory-Cycle-1.06/Changes0000644000101700007640000000172312652315633015345 0ustar alesterispcRevision history for Perl extension Test::Memory::Cycle 1.06 Wed Jan 27 22:36:55 CST 2016 This release has no changes in functionality. [FIXES] * One of the tests used to use CGI.pm, but it was not a declared dependency, so Perl 5.22+ would fail because CGI.pm is no longer shipped as core. The test now uses a local module for testing. Thanks, Graham Ollis. 1.04 Sun Aug 6 22:09:36 CDT 2006 [FIXES] * Updated the minimum version requirements. [ENHANCEMENTS] * Added support for detecting closures. Thanks Yuval Kogman. [INTERNALS] * Internal code optimizations 1.02 Tue May 17 11:22:09 CDT 2005 [ENHANCEMENTS] * Added weakened_memory_cycle_ok() and weakened_memory_cycle_exists(). Thanks, Stevan Little. 1.00 Sun Jan 23 01:00:32 CST 2005 [ENHANCEMENTS] * Added memory_cycle_exists(). Thanks, Stevan Little. Test-Memory-Cycle-1.06/Cycle.pm0000644000101700007640000001633612652315732015455 0ustar alesterispcpackage Test::Memory::Cycle; use strict; use warnings; =head1 NAME Test::Memory::Cycle - Check for memory leaks and circular memory references =head1 VERSION Version 1.06 =cut our $VERSION = '1.06'; =head1 SYNOPSIS Perl's garbage collection has one big problem: Circular references can't get cleaned up. A circular reference can be as simple as two references that refer to each other: my $mom = { name => "Marilyn Lester", }; my $me = { name => "Andy Lester", mother => $mom, }; $mom->{son} = $me; C is built on top of C to give you an easy way to check for these circular references. use Test::Memory::Cycle; my $object = new MyObject; # Do stuff with the object. memory_cycle_ok( $object ); You can also use C to make sure that you have a cycle where you expect to have one. =cut use Devel::Cycle qw( find_cycle find_weakened_cycle ); use Test::Builder; my $Test = Test::Builder->new; sub import { my $self = shift; my $caller = caller; no strict 'refs'; *{$caller.'::memory_cycle_ok'} = \&memory_cycle_ok; *{$caller.'::memory_cycle_exists'} = \&memory_cycle_exists; *{$caller.'::weakened_memory_cycle_ok'} = \&weakened_memory_cycle_ok; *{$caller.'::weakened_memory_cycle_exists'} = \&weakened_memory_cycle_exists; *{$caller.'::memory_cycle_exists'} = \&memory_cycle_exists; *{$caller.'::weakened_memory_cycle_ok'} = \&weakened_memory_cycle_ok; *{$caller.'::weakened_memory_cycle_exists'} = \&weakened_memory_cycle_exists; $Test->exported_to($caller); $Test->plan(@_); return; } =head1 FUNCTIONS =head2 C, I<$msg> )> Checks that I<$reference> doesn't have any circular memory references. =cut sub memory_cycle_ok { my $ref = shift; my $msg = shift; my $cycle_no = 0; my @diags; # Callback function that is called once for each memory cycle found. my $callback = sub { my $path = shift; $cycle_no++; push( @diags, "Cycle #$cycle_no" ); foreach (@$path) { my ($type,$index,$ref,$value) = @$_; my $str = 'Unknown! This should never happen!'; my $refdisp = _ref_shortname( $ref ); my $valuedisp = _ref_shortname( $value ); $str = sprintf( ' %s => %s', $refdisp, $valuedisp ) if $type eq 'SCALAR'; $str = sprintf( ' %s => %s', "${refdisp}->[$index]", $valuedisp ) if $type eq 'ARRAY'; $str = sprintf( ' %s => %s', "${refdisp}->{$index}", $valuedisp ) if $type eq 'HASH'; $str = sprintf( ' closure %s => %s', "${refdisp}, $index", $valuedisp ) if $type eq 'CODE'; push( @diags, $str ); } }; find_cycle( $ref, $callback ); my $ok = !$cycle_no; $Test->ok( $ok, $msg ); $Test->diag( join( "\n", @diags, '' ) ) unless $ok; return $ok; } # memory_cycle_ok =head2 C, I<$msg> )> Checks that I<$reference> B have any circular memory references. =cut sub memory_cycle_exists { my $ref = shift; my $msg = shift; my $cycle_no = 0; # Callback function that is called once for each memory cycle found. my $callback = sub { $cycle_no++ }; find_cycle( $ref, $callback ); my $ok = $cycle_no; $Test->ok( $ok, $msg ); return $ok; } # memory_cycle_exists =head2 C, I<$msg> )> Checks that I<$reference> doesn't have any circular memory references, but unlike C this will also check for weakened cycles produced with Scalar::Util's C. =cut sub weakened_memory_cycle_ok { my $ref = shift; my $msg = shift; my $cycle_no = 0; my @diags; # Callback function that is called once for each memory cycle found. my $callback = sub { my $path = shift; $cycle_no++; push( @diags, "Cycle #$cycle_no" ); foreach (@$path) { my ($type,$index,$ref,$value,$is_weakened) = @$_; my $str = "Unknown! This should never happen!"; my $refdisp = _ref_shortname( $ref ); my $valuedisp = _ref_shortname( $value ); my $weak = $is_weakened ? 'w->' : ''; $str = sprintf( ' %s%s => %s', $weak, $refdisp, $valuedisp ) if $type eq 'SCALAR'; $str = sprintf( ' %s%s => %s', $weak, "${refdisp}->[$index]", $valuedisp ) if $type eq 'ARRAY'; $str = sprintf( ' %s%s => %s', $weak, "${refdisp}->{$index}", $valuedisp ) if $type eq 'HASH'; push( @diags, $str ); } }; find_weakened_cycle( $ref, $callback ); my $ok = !$cycle_no; $Test->ok( $ok, $msg ); $Test->diag( join( "\n", @diags, "" ) ) unless $ok; return $ok; } # weakened_memory_cycle_ok =head2 C, I<$msg> )> Checks that I<$reference> B have any circular memory references, but unlike C this will also check for weakened cycles produced with Scalar::Util's C. =cut sub weakened_memory_cycle_exists { my $ref = shift; my $msg = shift; my $cycle_no = 0; # Callback function that is called once for each memory cycle found. my $callback = sub { $cycle_no++ }; find_weakened_cycle( $ref, $callback ); my $ok = $cycle_no; $Test->ok( $ok, $msg ); return $ok; } # weakened_memory_cycle_exists my %shortnames; my $new_shortname = "A"; sub _ref_shortname { my $ref = shift; my $refstr = "$ref"; my $refdisp = $shortnames{ $refstr }; if ( !$refdisp ) { my $sigil = ref($ref) . " "; $sigil = '%' if $sigil eq "HASH "; $sigil = '@' if $sigil eq "ARRAY "; $sigil = '$' if $sigil eq "REF "; $sigil = '&' if $sigil eq "CODE "; $refdisp = $shortnames{ $refstr } = $sigil . $new_shortname++; } return $refdisp; } =head1 AUTHOR Written by Andy Lester, C<< >>. =head1 BUGS Please report any bugs or feature requests to C, or through the web interface at L. I will be notified, and then you'll automatically be notified of progress on your bug as I make changes. =head1 SUPPORT You can find documentation for this module with the perldoc command. perldoc Test::Memory::Cycle You can also look for information at: =over 4 =item * AnnoCPAN: Annotated CPAN documentation L =item * CPAN Ratings L =item * RT: CPAN's request tracker L =item * Search CPAN L =back =head1 ACKNOWLEDGEMENTS Thanks to the contributions of Stevan Little, and to Lincoln Stein for writing Devel::Cycle. =head1 COPYRIGHT Copyright 2003-2016 Andy Lester. This program is free software; you can redistribute it and/or modify it under the terms of the Artistic License v2.0. See http://www.perlfoundation.org/artistic_license_2_0 or the LICENSE file that comes with the Test::Memory::Cycle distribution. =cut 1; Test-Memory-Cycle-1.06/Makefile.PL0000644000101700007640000000131210465526210016011 0ustar alesterispcuse strict; use warnings; use ExtUtils::MakeMaker; WriteMakefile( NAME => 'Test::Memory::Cycle', VERSION_FROM => 'Cycle.pm', # finds $VERSION ABSTRACT => "Verifies code hasn't left circular references", PREREQ_PM => { 'Devel::Cycle' => 1.07, # for weakened ref checking 'Getopt::Long' => 0, 'PadWalker' => 0, 'Test::Builder' => 0, 'Test::Builder::Tester' => 0, 'Test::More' => 0, 'Test::Simple' => 0.62, }, dist => { COMPRESS => 'gzip -9f', SUFFIX => 'gz', }, clean => { FILES => 'Test-Memory-Cycle-*' }, );