Devel-Refcount-0.10000755001750001750 012105733677 13010 5ustar00leoleo000000000000Devel-Refcount-0.10/Changes000444001750001750 240312105733677 14437 0ustar00leoleo000000000000Revision history for Devel-Refcount 0.10 CHANGES: * Added assert_oneref() 0.09 CHANGES: * Use Test::Fatal instead of Test::Exception * Provide fallback PP implementation using B * Don't skip Regexp tests dependent on Perl version since all stable Perl releases are fine now (0.08 skipped because I messed up the alpha version numbering of 0.08_001. Oops). 0.07 CHANGES: * Don't use base 'Exporter' * Use XSLoader instead of DynaLoader 0.06 CHANGES: * Added SEE ALSO to Test::Refcount * Various small updates to keep CPANTS happy 0.05 CHANGES: * use warnings * Added (C) declaration to main file 0.04 BUGFIXES: * Declare ExtUtils::CBuilder and Module::Build as configure_requires 0.03 BUGFIXES: * TEMPORARY workaround for bleadperl's behaviour on Regexp references * Declare dependence on ExtUtils::CBuilder 0.02 BUGFIXES: * Make sure Regexp refs have count 1 even on perl 5.11, which seems to share references CHANGES: * Expanded documentation about the difference between refcount() and Devel::Peek::SvREFCNT(). 0.01 First version, released on an unsuspecting world. Devel-Refcount-0.10/META.json000444001750001750 220012105733677 14560 0ustar00leoleo000000000000{ "abstract" : "obtain the REFCNT value of a referent", "author" : [ "Paul Evans " ], "dynamic_config" : 1, "generated_by" : "Module::Build version 0.4001, CPAN::Meta::Converter version 2.120921", "license" : [ "perl_5" ], "meta-spec" : { "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec", "version" : "2" }, "name" : "Devel-Refcount", "prereqs" : { "build" : { "requires" : { "ExtUtils::CBuilder" : "0", "Module::Build" : "0", "Test::Fatal" : "0", "Test::More" : "0" } }, "configure" : { "requires" : { "Module::Build" : "0" } }, "runtime" : { "requires" : { "Exporter" : "5.57", "XSLoader" : "0" } } }, "provides" : { "Devel::Refcount" : { "file" : "lib/Devel/Refcount.pm", "version" : "0.10" } }, "release_status" : "stable", "resources" : { "license" : [ "http://dev.perl.org/licenses/" ] }, "version" : "0.10" } Devel-Refcount-0.10/README000444001750001750 1013112105733677 14041 0ustar00leoleo000000000000NAME `Devel::Refcount' - obtain the REFCNT value of a referent SYNOPSIS use Devel::Refcount qw( refcount ); my $anon = []; print "Anon ARRAY $anon has " . refcount( $anon ) . " reference\n"; my $otherref = $anon; print "Anon ARRAY $anon now has " . refcount( $anon ) . " references\n"; assert_oneref $otherref; # This will throw an exception at runtime DESCRIPTION This module provides a single function which obtains the reference count of the object being pointed to by the passed reference value. It also provides a debugging assertion that asserts a given reference has a count of only 1. FUNCTIONS $count = refcount( $ref ) Returns the reference count of the object being pointed to by $ref. assert_oneref( $ref ) Asserts that the given object reference has a reference count of only 1. If this is true the function does nothing. If it has more than 1 reference then an exception is thrown. Additionally, if Devel::FindRef is available, it will be used to print a more detailed trace of where the references are found. Typically this would be useful in debugging to track down cases where objects are still being referenced beyond the point at which they are supposed to be dropped. For example, if an element is delete from a hash that ought to be the last remaining reference, the return value of the `delete' operator can be asserted on assert_oneref delete $self->{some_item}; If at the time of deleting there are any other references to this object then the assertion will fail; and if `Devel::FindRef' is available the other locations will be printed. COMPARISON WITH SvREFCNT This function differs from `Devel::Peek::SvREFCNT' in that SvREFCNT() gives the reference count of the SV object itself that it is passed, whereas refcount() gives the count of the object being pointed to. This allows it to give the count of any referent (i.e. ARRAY, HASH, CODE, GLOB and Regexp types) as well. Consider the following example program: use Devel::Peek qw( SvREFCNT ); use Devel::Refcount qw( refcount ); sub printcount { my $name = shift; printf "%30s has SvREFCNT=%d, refcount=%d\n", $name, SvREFCNT( $_[0] ), refcount( $_[0] ); } my $var = []; printcount 'Initially, $var', $var; my $othervar = $var; printcount 'Before CODE ref, $var', $var; printcount '$othervar', $othervar; my $code = sub { undef $var }; printcount 'After CODE ref, $var', $var; printcount '$othervar', $othervar; This produces the output Initially, $var has SvREFCNT=1, refcount=1 Before CODE ref, $var has SvREFCNT=1, refcount=2 $othervar has SvREFCNT=1, refcount=2 After CODE ref, $var has SvREFCNT=2, refcount=2 $othervar has SvREFCNT=1, refcount=2 Here, we see that SvREFCNT() counts the number of references to the SV object passed in as the scalar value - the $var or $othervar respectively, whereas refcount() counts the number of reference values that point to the referent object - the anonymous ARRAY in this case. Before the CODE reference is constructed, both $var and $othervar have SvREFCNT() of 1, as they exist only in the current lexical pad. The anonymous ARRAY has a refcount() of 2, because both $var and $othervar store a reference to it. After the CODE reference is constructed, the $var variable now has an SvREFCNT() of 2, because it also appears in the lexical pad for the new anonymous CODE block. PURE-PERL FALLBACK An XS implementation of this function is provided, and is used by default. If the XS library cannot be loaded, a fallback implementation in pure perl using the `B' module is used instead. This will behave identically, but is much slower. Rate pp xs pp 225985/s -- -66% xs 669570/s 196% -- SEE ALSO * Test::Refcount - assert reference counts on objects AUTHOR Paul Evans Devel-Refcount-0.10/Build.PL000444001750001750 135012105733677 14440 0ustar00leoleo000000000000use strict; use warnings; use Module::Build; use ExtUtils::CBuilder; my $build_xs = 1; if( $build_xs and not ExtUtils::CBuilder->new->have_compiler ) { print "No C compiler is available so cannot build XS implementation\n"; $build_xs = 0; } my $build = Module::Build->new( module_name => 'Devel::Refcount', requires => { 'Exporter' => '5.57', 'XSLoader' => 0, }, configure_requires => { 'Module::Build' => 0, }, build_requires => { 'Module::Build' => 0, 'Test::Fatal' => 0, 'Test::More' => 0, }, ( $build_xs ? () : ( xs_files => {} ) ), license => 'perl', create_makefile_pl => 'small', create_license => 1, create_readme => 1, ); $build->create_build_script; Devel-Refcount-0.10/LICENSE000444001750001750 4376012105733677 14204 0ustar00leoleo000000000000This software is copyright (c) 2013 by Paul Evans . 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) 2013 by Paul Evans . 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. 51 Franklin St, Suite 500, Boston, MA 02110-1335 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., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301 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) 2013 by Paul Evans . 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 Devel-Refcount-0.10/META.yml000444001750001750 121012105733677 14410 0ustar00leoleo000000000000--- abstract: 'obtain the REFCNT value of a referent' author: - 'Paul Evans ' build_requires: ExtUtils::CBuilder: 0 Module::Build: 0 Test::Fatal: 0 Test::More: 0 configure_requires: Module::Build: 0 dynamic_config: 1 generated_by: 'Module::Build version 0.4001, CPAN::Meta::Converter version 2.120921' license: perl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: 1.4 name: Devel-Refcount provides: Devel::Refcount: file: lib/Devel/Refcount.pm version: 0.10 requires: Exporter: 5.57 XSLoader: 0 resources: license: http://dev.perl.org/licenses/ version: 0.10 Devel-Refcount-0.10/MANIFEST000444001750001750 32712105733677 14260 0ustar00leoleo000000000000Build.PL Changes lib/Devel/Refcount.pm lib/Devel/Refcount.xs LICENSE Makefile.PL MANIFEST This list of files META.yml README t/00use.t t/01refs.t t/02objects.t t/03fail.t t/04pp.t t/05assert.t t/99pod.t META.json Devel-Refcount-0.10/Makefile.PL000444001750001750 42512105733677 15100 0ustar00leoleo000000000000# Note: this file was auto-generated by Module::Build::Compat version 0.4001 use Module::Build::Compat 0.02; Module::Build::Compat->run_build_pl(args => \@ARGV); require Module::Build; Module::Build::Compat->write_makefile(build_class => 'Module::Build'); Devel-Refcount-0.10/lib000755001750001750 012105733677 13556 5ustar00leoleo000000000000Devel-Refcount-0.10/lib/Devel000755001750001750 012105733677 14615 5ustar00leoleo000000000000Devel-Refcount-0.10/lib/Devel/Refcount.pm000444001750001750 1171212105733677 17117 0ustar00leoleo000000000000# You may distribute under the terms of either the GNU General Public License # or the Artistic License (the same terms as Perl itself) # # (C) Paul Evans, 2008-2013 -- leonerd@leonerd.org.uk package Devel::Refcount; use strict; use warnings; our $VERSION = '0.10'; use Exporter 'import'; our @EXPORT_OK = qw( refcount assert_oneref ); require XSLoader; if( !eval { XSLoader::load( __PACKAGE__, $VERSION ) } ) { *refcount = \&_refcount_pp; require B; } use Carp; use Scalar::Util qw( weaken ); =head1 NAME C - obtain the REFCNT value of a referent =head1 SYNOPSIS use Devel::Refcount qw( refcount ); my $anon = []; print "Anon ARRAY $anon has " . refcount( $anon ) . " reference\n"; my $otherref = $anon; print "Anon ARRAY $anon now has " . refcount( $anon ) . " references\n"; assert_oneref $otherref; # This will throw an exception at runtime =head1 DESCRIPTION This module provides a single function which obtains the reference count of the object being pointed to by the passed reference value. It also provides a debugging assertion that asserts a given reference has a count of only 1. =cut =head1 FUNCTIONS =cut =head2 $count = refcount( $ref ) Returns the reference count of the object being pointed to by $ref. =cut # This normally isn't used if the XS code is loaded sub _refcount_pp { B::svref_2object( shift )->REFCNT; } =head2 assert_oneref( $ref ) Asserts that the given object reference has a reference count of only 1. If this is true the function does nothing. If it has more than 1 reference then an exception is thrown. Additionally, if L is available, it will be used to print a more detailed trace of where the references are found. Typically this would be useful in debugging to track down cases where objects are still being referenced beyond the point at which they are supposed to be dropped. For example, if an element is delete from a hash that ought to be the last remaining reference, the return value of the C operator can be asserted on assert_oneref delete $self->{some_item}; If at the time of deleting there are any other references to this object then the assertion will fail; and if C is available the other locations will be printed. =cut sub assert_oneref { my $object = shift; weaken $object; my $refcount = refcount( $object ); return if $refcount == 1; my $message = Carp::shortmess( "Expected $object to have only one reference, found $refcount" ); if( eval { require Devel::FindRef } ) { my $track = Devel::FindRef::track( $object ); die "$message\n$track\n"; } else { die $message; } } =head1 COMPARISON WITH SvREFCNT This function differs from C in that SvREFCNT() gives the reference count of the SV object itself that it is passed, whereas refcount() gives the count of the object being pointed to. This allows it to give the count of any referent (i.e. ARRAY, HASH, CODE, GLOB and Regexp types) as well. Consider the following example program: use Devel::Peek qw( SvREFCNT ); use Devel::Refcount qw( refcount ); sub printcount { my $name = shift; printf "%30s has SvREFCNT=%d, refcount=%d\n", $name, SvREFCNT( $_[0] ), refcount( $_[0] ); } my $var = []; printcount 'Initially, $var', $var; my $othervar = $var; printcount 'Before CODE ref, $var', $var; printcount '$othervar', $othervar; my $code = sub { undef $var }; printcount 'After CODE ref, $var', $var; printcount '$othervar', $othervar; This produces the output Initially, $var has SvREFCNT=1, refcount=1 Before CODE ref, $var has SvREFCNT=1, refcount=2 $othervar has SvREFCNT=1, refcount=2 After CODE ref, $var has SvREFCNT=2, refcount=2 $othervar has SvREFCNT=1, refcount=2 Here, we see that SvREFCNT() counts the number of references to the SV object passed in as the scalar value - the $var or $othervar respectively, whereas refcount() counts the number of reference values that point to the referent object - the anonymous ARRAY in this case. Before the CODE reference is constructed, both $var and $othervar have SvREFCNT() of 1, as they exist only in the current lexical pad. The anonymous ARRAY has a refcount() of 2, because both $var and $othervar store a reference to it. After the CODE reference is constructed, the $var variable now has an SvREFCNT() of 2, because it also appears in the lexical pad for the new anonymous CODE block. =cut =head1 PURE-PERL FALLBACK An XS implementation of this function is provided, and is used by default. If the XS library cannot be loaded, a fallback implementation in pure perl using the C module is used instead. This will behave identically, but is much slower. Rate pp xs pp 225985/s -- -66% xs 669570/s 196% -- =head1 SEE ALSO =over 4 =item * L - assert reference counts on objects =back =head1 AUTHOR Paul Evans =cut 0x55AA; Devel-Refcount-0.10/lib/Devel/Refcount.xs000444001750001750 41712105733677 17075 0ustar00leoleo000000000000#include "EXTERN.h" #include "perl.h" #include "XSUB.h" MODULE = Devel::Refcount PACKAGE = Devel::Refcount int refcount(ref) SV *ref CODE: if(!SvROK(ref)) { croak("ref is not a reference"); } RETVAL = SvREFCNT(SvRV(ref)); OUTPUT: RETVAL Devel-Refcount-0.10/t000755001750001750 012105733677 13253 5ustar00leoleo000000000000Devel-Refcount-0.10/t/02objects.t000444001750001750 235312105733677 15373 0ustar00leoleo000000000000#!/usr/bin/perl use strict; use warnings; use Test::More tests => 12; use Devel::Refcount qw( refcount ); use Symbol qw( gensym ); my %refs = ( SCALAR => do { my $var; \$var }, ARRAY => [], HASH => +{}, # This magic is to ensure the code ref is new, not shared. To be a new one # it has to contain a unique pad. CODE => do { my $var; sub { $var } }, GLOB => gensym(), Regexp => do { my $var; qr/foo(?{ $var = 1 })/ }, ); bless $_, "Some::Package" for values %refs; is( refcount($refs{SCALAR}), 1, 'refcount(SCALAR) is 1'); is( refcount($refs{ARRAY}), 1, 'refcount(ARRAY) is 1'); is( refcount($refs{HASH}), 1, 'refcount(HASH) is 1'); is( refcount($refs{CODE}), 1, 'refcount(CODE) is 1'); is( refcount($refs{GLOB}), 1, 'refcount(GLOB) is 1'); is( refcount($refs{Regexp}), 1, 'refcount(Regexp) is 1'); my %otherrefs = %refs; # Hope they're all 2 now is( refcount($refs{SCALAR}), 2, 'refcount(SCALAR) is now 2'); is( refcount($refs{ARRAY}), 2, 'refcount(ARRAY) is now 2'); is( refcount($refs{HASH}), 2, 'refcount(HASH) is now 2'); is( refcount($refs{CODE}), 2, 'refcount(CODE) is now 2'); is( refcount($refs{GLOB}), 2, 'refcount(GLOB) is now 2'); is( refcount($refs{Regexp}), 2, 'refcount(Regexp) is now 2'); Devel-Refcount-0.10/t/00use.t000444001750001750 14512105733677 14511 0ustar00leoleo000000000000#!/usr/bin/perl use strict; use warnings; use Test::More tests => 1; use_ok( "Devel::Refcount" ); Devel-Refcount-0.10/t/05assert.t000444001750001750 110112105733677 15234 0ustar00leoleo000000000000#!/usr/bin/perl use strict; use warnings; use Test::More tests => 3; use Test::Fatal; use Devel::Refcount qw( assert_oneref ); my $anon = []; ok( !exception { assert_oneref $anon }, 'assert_oneref on one-reference anon array' ); my $otherref = $anon; like( exception { assert_oneref $anon }, qr/^Expected ARRAY\(0x[[:xdigit:]]+\) to have only one reference, found 2 at /, 'assert_oneref on two-reference anon array' ); my %hash = ( element => [] ); ok( !exception { assert_oneref delete $hash{element} }, 'assert_oneref on deleted hash element' ); Devel-Refcount-0.10/t/04pp.t000444001750001750 242512105733677 14363 0ustar00leoleo000000000000#!/usr/bin/perl use strict; use warnings; use Test::More tests => 12; # Some hackery to import the PP emulation require Devel::Refcount; require B; *refcount = \&Devel::Refcount::_refcount_pp; use Symbol qw( gensym ); my %refs = ( SCALAR => do { my $var; \$var }, ARRAY => [], HASH => +{}, # This magic is to ensure the code ref is new, not shared. To be a new one # it has to contain a unique pad. CODE => do { my $var; sub { $var } }, GLOB => gensym(), Regexp => do { my $var; qr/foo(?{ $var = 1 })/ }, ); is( refcount($refs{SCALAR}), 1, 'refcount(SCALAR) is 1'); is( refcount($refs{ARRAY}), 1, 'refcount(ARRAY) is 1'); is( refcount($refs{HASH}), 1, 'refcount(HASH) is 1'); is( refcount($refs{CODE}), 1, 'refcount(CODE) is 1'); is( refcount($refs{GLOB}), 1, 'refcount(GLOB) is 1'); is( refcount($refs{Regexp}), 1, 'refcount(Regexp) is 1'); my %otherrefs = %refs; # Hope they're all 2 now is( refcount($refs{SCALAR}), 2, 'refcount(SCALAR) is now 2'); is( refcount($refs{ARRAY}), 2, 'refcount(ARRAY) is now 2'); is( refcount($refs{HASH}), 2, 'refcount(HASH) is now 2'); is( refcount($refs{CODE}), 2, 'refcount(CODE) is now 2'); is( refcount($refs{GLOB}), 2, 'refcount(GLOB) is now 2'); is( refcount($refs{Regexp}), 2, 'refcount(Regexp) is now 2'); Devel-Refcount-0.10/t/99pod.t000444001750001750 25712105733677 14525 0ustar00leoleo000000000000#!/usr/bin/perl use strict; use warnings; use Test::More; eval "use Test::Pod 1.00"; plan skip_all => "Test::Pod 1.00 required for testing POD" if $@; all_pod_files_ok(); Devel-Refcount-0.10/t/03fail.t000444001750001750 53312105733677 14634 0ustar00leoleo000000000000#!/usr/bin/perl use strict; use warnings; use Test::More tests => 3; use Test::Fatal; use Devel::Refcount qw( refcount ); ok( exception { refcount() }, 'refcount with no args fails' ); ok( exception { refcount(undef) }, 'refcount with undef arg fails' ); ok( exception { refcount("hello") }, 'refcount with non-ref arg fails' ); Devel-Refcount-0.10/t/01refs.t000444001750001750 227612105733677 14704 0ustar00leoleo000000000000#!/usr/bin/perl use strict; use warnings; use Test::More tests => 12; use Devel::Refcount qw( refcount ); use Symbol qw( gensym ); my %refs = ( SCALAR => do { my $var; \$var }, ARRAY => [], HASH => +{}, # This magic is to ensure the code ref is new, not shared. To be a new one # it has to contain a unique pad. CODE => do { my $var; sub { $var } }, GLOB => gensym(), Regexp => do { my $var; qr/foo(?{ $var = 1 })/ }, ); is( refcount($refs{SCALAR}), 1, 'refcount(SCALAR) is 1'); is( refcount($refs{ARRAY}), 1, 'refcount(ARRAY) is 1'); is( refcount($refs{HASH}), 1, 'refcount(HASH) is 1'); is( refcount($refs{CODE}), 1, 'refcount(CODE) is 1'); is( refcount($refs{GLOB}), 1, 'refcount(GLOB) is 1'); is( refcount($refs{Regexp}), 1, 'refcount(Regexp) is 1'); my %otherrefs = %refs; # Hope they're all 2 now is( refcount($refs{SCALAR}), 2, 'refcount(SCALAR) is now 2'); is( refcount($refs{ARRAY}), 2, 'refcount(ARRAY) is now 2'); is( refcount($refs{HASH}), 2, 'refcount(HASH) is now 2'); is( refcount($refs{CODE}), 2, 'refcount(CODE) is now 2'); is( refcount($refs{GLOB}), 2, 'refcount(GLOB) is now 2'); is( refcount($refs{Regexp}), 2, 'refcount(Regexp) is now 2');