import Devel-Size 0.68 from CPAN
[p5sagit/Devel-Size.git] / lib / Devel / Size.pm
CommitLineData
e98cedbf 1package Devel::Size;
2
e98cedbf 3use strict;
0430b7f7 4use vars qw($VERSION @ISA @EXPORT @EXPORT_OK %EXPORT_TAGS $warn);
e98cedbf 5
6require Exporter;
7require DynaLoader;
8
a6ea0805 9@ISA = qw(Exporter DynaLoader);
e98cedbf 10
e98cedbf 11# This allows declaration use Devel::Size ':all';
a6ea0805 12%EXPORT_TAGS = ( 'all' => [ qw(
0bff12d8 13 size total_size
e98cedbf 14) ] );
15
a6ea0805 16@EXPORT_OK = ( @{ $EXPORT_TAGS{'all'} } );
e98cedbf 17
0430b7f7 18@EXPORT = qw( );
c8db37d3 19$VERSION = '0.68';
e98cedbf 20
21bootstrap Devel::Size $VERSION;
22
78dfb4e7 23$warn = 1;
ebb2c5b9 24
e98cedbf 251;
26__END__
e98cedbf 27
28=head1 NAME
29
0bff12d8 30Devel::Size - Perl extension for finding the memory usage of Perl variables
e98cedbf 31
32=head1 SYNOPSIS
33
0bff12d8 34 use Devel::Size qw(size total_size);
e98cedbf 35
0bff12d8 36 my $size = size("A string");
37
38 my @foo = (1, 2, 3, 4, 5);
39 my $other_size = size(\@foo);
40
41 my $foo = {a => [1, 2, 3],
5c2e1b12 42 b => {a => [1, 3, 4]}
43 };
0bff12d8 44 my $total_size = total_size($foo);
5c2e1b12 45
e98cedbf 46=head1 DESCRIPTION
47
0bff12d8 48This module figures out the real sizes of Perl variables in bytes.
49Call functions with a reference to the variable you want the size
50of. If the variable is a plain scalar it returns the size of
51the scalar. If the variable is a hash or an array, use a reference
52when calling.
53
54=head1 FUNCTIONS
55
56=head2 size($ref)
e98cedbf 57
5c2e1b12 58The C<size> function returns the amount of memory the variable
0bff12d8 59returns. If the variable is a hash or an array, it only reports
60the amount used by the structure, I<not> the contents.
61
62=head2 total_size($ref)
5c2e1b12 63
0bff12d8 64The C<total_size> function will traverse the variable and look
65at the sizes of contents. Any references contained in the variable
66will also be followed, so this function can be used to get the
67total size of a multidimensional data structure. At the moment
68there is no way to get the size of an array or a hash and its
69elements without using this function.
5c2e1b12 70
b98fcdb9 71=head1 EXPORT
e98cedbf 72
0bff12d8 73None but default, but optionally C<size> and C<total_size>.
e98cedbf 74
b98fcdb9 75=head1 UNDERSTANDING MEMORY ALLOCATION
76
77Please note that the following discussion of memory allocation in perl
78is based on the perl 5.8.0 sources. While this is generally
79applicable to all versions of perl, some of the gory details are
80omitted. It also makes some presumptions on how your system memory
81allocator works so, while it will be generally correct, it may not
82exactly reflect your system. (Generally the only issue is the size of
83the constant values we'll talk about, not their existence)
84
85=head2 The C library
86
87It's important firtst to understand how your OS and libraries handle
88memory. When the perl interpreter needs some memory, it asks the C
89runtime library for it, using the C<malloc()> call. C<malloc> has one
90parameter, the size of the memory allocation you want, and returns a
91pointer to that memory. C<malloc> also makes sure that the pointer it
92returns to you is properly aligned. When you're done with the memory
93you hand it back to the library with the C<free()> call. C<free> has
94one parameter, the pointer that C<malloc> returned. There are a couple of interesting ramifications to this.
95
96Because malloc has to return an aligned pointer, it will round up the
97memory allocation to make sure that the memory it returns is aligned
98right. What that alignment is depends on your CPU, OS, and compiler
99settings, but things are generally aligned to either a 4 or 8 byte
100boundary. That means that if you ask for 1 byte, C<malloc> will
101silently round up to either 4 or 8 bytes, though it doesn't tell the
102program making the request, so the extra memory can't be used.
103
104Since C<free> isn't given the size of the memory chunk you're
105freeing, it has to track it another way. Most libraries do this by
106tacking on a length field just before the memory it hands to your
107program. (It's put before the beginning rather than after the end
108because it's less likely to get mangled by program bugs) This size
109field is the size of your platform integer, Generally either 4 or 8
110bytes.
111
112So, if you asked for 1 byte, malloc would build something like this:
113
114 +------------------+
115 | 4 byte length |
116 +------------------+ <----- the pointer malloc returns
117 | your 1 byte |
118 +------------------+
119 | 3 bytes padding |
120 +------------------+
121
122As you can see, you asked for 1 byte but C<malloc> used 8. If your
123integers were 8 bytes rather than 4, C<malloc> would have used 16 bytes
124to satisfy your 1 byte request.
125
126The C memory allocation system also keeps a list of free memory
127chunks, so it can recycle freed memory. For performance reasons, some
128C memory allocation systems put a limit to the number of free
129segments that are on the free list, or only search through a small
130number of memory chunks waiting to be recycled before just
131allocating more memory from the system.
132
133The memory allocation system tries to keep as few chunks on the free
134list as possible. It does this by trying to notice if there are two
135adjacent chunks of memory on the free list and, if there are,
136coalescing them into a single larger chunk. This works pretty well,
137but there are ways to have a lot of memory on the free list yet still
138not have anything that can be allocated. If a program allocates one
139million eight-byte chunks, for example, then frees every other chunk,
140there will be four million bytes of memory on the free list, but none
141of that memory can be handed out to satisfy a request for 10
142bytes. This is what's referred to as a fragmented free list, and can
143be one reason why your program could have a lot of free memory yet
144still not be able to allocate more, or have a huge process size and
145still have almost no memory actually allocated to the program running.
146
147=head2 Perl
148
149Perl's memory allocation scheme is a bit convoluted, and more complex
0430b7f7 150than can really be addressed here, but there is one common spot where Perl's
b98fcdb9 151memory allocation is unintuitive, and that's for hash keys.
152
153When you have a hash, each entry has a structure that points to the
154key and the value for that entry. The value is just a pointer to the
155scalar in the entry, and doesn't take up any special amount of
156memory. The key structure holds the hash value for the key, the key
157length, and the key string. (The entry and key structures are
158separate so perl can potentially share keys across multiple hashes)
159
160The entry structure has three pointers in it, and takes up either 12
161or 24 bytes, depending on whether you're on a 32 bit or 64 bit
162system. Since these structures are of fixed size, perl can keep a big
163pool of them internally (generally called an arena) so it doesn't
164have to allocate memory for each one.
165
166The key structure, though, is of variable length because the key
167string is of variable length, so perl has to ask the system for a
168memory allocation for each key. The base size of this structure is
1698 or 16 bytes (once again, depending on whether you're on a 32 bit or
17064 bit system) plus the string length plus two bytes.
171
172Since this memory has to be allocated from the system there's the
173malloc size-field overhead (4 or 8 bytes) plus the alignment bytes (0
174to 7, depending on your system and the key length)
175that get added on to the chunk perl requests. If the key is only 1
176character, and you're on a 32 bit system, the allocation will be 16
177bytes. If the key is 7 characters then the allocation is 24 bytes on
178a 32 bit system. If you're on a 64 bit system the numbers get even
179larger.
180
181This does mean that hashes eat up a I<lot> of memory, both in memory
182Devel::Size can track (the memory actually in the structures and
183strings) and that it can't (the malloc alignment and length overhead).
184
185=head1 DANGERS
186
187Devel::Size, because of the way it works, can consume a
188considerable amount of memory as it runs. It will use five
189pointers, two integers, and two bytes worth of storage, plus
190potential alignment and bucket overhead, per thing it looks at. This
191memory is released at the end, but it may fragment your free pool,
192and will definitely expand your process' memory footprint.
193
5073b933 194=head1 Messages: texts originating from this module.
195
196=head2 Errors
197
198=over 4
199
200=item "Devel::Size: Unknown variable type"
201
202The thing (or something contained within it) that you gave to
203total_size() was unrecognisable as a Perl entity.
204
205=back
206
207=head2 warnings
208
209These messages warn you that for some types, the sizes calculated may not include
210everything that could be associated with those types. The differences are usually
211insignificant for most uses of this module.
212
213These may be disabled by setting
214
215 $Devel::Size::warn = 0
216
217=over 4
218
219=item "Devel::Size: Calculated sizes for CVs are incomplete"
220
221=item "Devel::Size: Calculated sizes for FMs are incomplete"
222
5073b933 223=back
224
e98cedbf 225=head1 BUGS
226
fea63ffa 227Doesn't currently walk all the bits for code refs, formats, and
6a9ad7ec 228IO. Those throw a warning, but a minimum size for them is returned.
e98cedbf 229
b98fcdb9 230Devel::Size only counts the memory that perl actually allocates. It
231doesn't count 'dark' memory--memory that is lost due to fragmented free lists,
232allocation alignments, or C library overhead.
233
e98cedbf 234=head1 AUTHOR
235
236Dan Sugalski dan@sidhe.org
237
98ecbbc6 238Small portion taken from the B module as shipped with perl 5.6.2.
239
0430b7f7 240Maintained now by Tels <http://bloodgate.com>
241
98ecbbc6 242=head1 COPYRIGHT
243
b1e5ad85 244Copyright (C) 2005 Dan Sugalski, Copyright (C) 2007 Tels
98ecbbc6 245
246This module is free software; you can redistribute it and/or modify it
247under the same terms as Perl itself.
248
e98cedbf 249=head1 SEE ALSO
250
0430b7f7 251perl(1), L<Devel::Size::Report>.
e98cedbf 252
253=cut