1 package DBICTest::Util::LeakTracer;
7 use Scalar::Util qw(isweak weaken blessed reftype);
8 use DBIx::Class::_Util qw(refcount hrefaddr refdesc);
9 use DBIx::Class::Optional::Dependencies;
10 use Data::Dumper::Concise;
11 use DBICTest::Util 'stacktrace';
13 CV_TRACING => DBIx::Class::Optional::Dependencies->req_ok_for ('test_leaks_heavy'),
14 SKIP_SCALAR_REFS => ( $] > 5.017 ) ? 1 : 0,
18 our @EXPORT_OK = qw(populate_weakregistry assert_empty_weakregistry visit_refs);
24 sub populate_weakregistry {
25 my ($weak_registry, $target, $note) = @_;
27 croak 'Expecting a registry hashref' unless ref $weak_registry eq 'HASH';
28 croak 'Target is not a reference' unless length ref $target;
30 my $refaddr = hrefaddr $target;
32 # a registry could be fed to itself or another registry via recursive sweeps
33 return $target if $reg_of_regs{$refaddr};
35 weaken( $reg_of_regs{ hrefaddr($weak_registry) } = $weak_registry )
36 unless( $reg_of_regs{ hrefaddr($weak_registry) } );
38 # an explicit "garbage collection" pass every time we store a ref
39 # if we do not do this the registry will keep growing appearing
40 # as if the traced program is continuously slowly leaking memory
41 for my $reg (values %reg_of_regs) {
42 (defined $reg->{$_}{weakref}) or delete $reg->{$_}
46 # FIXME/INVESTIGATE - something fishy is going on with refs to plain
47 # strings, perhaps something to do with the CoW work etc...
48 return $target if SKIP_SCALAR_REFS and reftype($target) eq 'SCALAR';
50 if (! defined $weak_registry->{$refaddr}{weakref}) {
51 $weak_registry->{$refaddr} = {
52 stacktrace => stacktrace(1),
56 # on perl < 5.8.3 sometimes a weaken can throw (can't find RT)
57 # so guard against that unlikely event
59 eval { weaken( $weak_registry->{$refaddr}{weakref} ); $refs_traced++ }
60 or delete $weak_registry->{$refaddr};
63 my $desc = refdesc $target;
64 $weak_registry->{$refaddr}{slot_names}{$desc} = 1;
66 $note =~ s/\s*\Q$desc\E\s*//g;
67 $weak_registry->{$refaddr}{slot_names}{$note} = 1;
73 # Regenerate the slots names on a thread spawn
75 my @individual_regs = grep { scalar keys %{$_||{}} } values %reg_of_regs;
78 for my $reg (@individual_regs) {
79 my @live_slots = grep { defined $_->{weakref} } values %$reg
82 $reg = {}; # get a fresh hashref in the new thread ctx
83 weaken( $reg_of_regs{hrefaddr($reg)} = $reg );
85 for my $slot_info (@live_slots) {
86 my $new_addr = hrefaddr $slot_info->{weakref};
88 # replace all slot names
89 $slot_info->{slot_names} = { map {
91 $name =~ s/\(0x[0-9A-F]+\)/sprintf ('(%s)', $new_addr)/ieg;
93 } keys %{$slot_info->{slot_names}} };
95 $reg->{$new_addr} = $slot_info;
101 my $args = { (ref $_[0]) ? %{$_[0]} : @_ };
103 $args->{seen_refs} ||= {};
105 my $visited_cnt = '0E0';
106 for my $i (0 .. $#{$args->{refs}} ) {
108 next unless length ref $args->{refs}[$i]; # not-a-ref
110 my $addr = hrefaddr $args->{refs}[$i];
112 # no diving into weakregistries
113 next if $reg_of_regs{$addr};
115 next if $args->{seen_refs}{$addr}++;
118 my $r = $args->{refs}[$i];
120 $args->{action}->($r) or next;
122 # This may end up being necessarry some day, but do not slow things
124 #if ( defined( my $t = tied($r) ) ) {
125 # $visited_cnt += visit_refs({ %$args, refs => [ $t ] });
128 my $type = reftype $r;
132 if ($type eq 'HASH') {
133 $visited_cnt += visit_refs({ %$args, refs => [ map {
134 ( !isweak($r->{$_}) ) ? $r->{$_} : ()
137 elsif ($type eq 'ARRAY') {
138 $visited_cnt += visit_refs({ %$args, refs => [ map {
139 ( !isweak($r->[$_]) ) ? $r->[$_] : ()
142 elsif ($type eq 'REF' and !isweak($$r)) {
143 $visited_cnt += visit_refs({ %$args, refs => [ $$r ] });
145 elsif (CV_TRACING and $type eq 'CODE') {
146 $visited_cnt += visit_refs({ %$args, refs => [ map {
147 ( !isweak($_) ) ? $_ : ()
148 } scalar PadWalker::closed_over($r) ] }); # scalar due to RT#92269
151 } or warn "Could not descend into @{[ refdesc $r ]}: $@\n";
156 sub visit_namespaces {
157 my $args = { (ref $_[0]) ? %{$_[0]} : @_ };
161 $args->{package} ||= '::';
162 $args->{package} = '::' if $args->{package} eq 'main';
164 if ( $args->{action}->($args->{package}) ) {
166 my $base = $args->{package};
167 $base = '' if $base eq '::';
170 $visited += visit_namespaces({ %$args, package => $_ }) for map
171 { $_ =~ /(.+?)::$/ ? "${base}::$1" : () }
173 { $_ =~ /(?<!^main)::$/ }
174 do { no strict 'refs'; keys %{ $base . '::'} }
180 # compiles a list of addresses stored as globals (possibly even catching
181 # class data in the form of method closures), so we can skip them further on
182 sub symtable_referenced_addresses {
186 my $dummy_addresslist;
195 $pkg = '' if $pkg eq '::';
198 # the unless regex at the end skips some dangerous namespaces outright
199 # (but does not prevent descent)
200 $refs_per_pkg->{$pkg} += visit_refs (
201 seen_refs => $seen_refs,
204 # This is so damn odd - if we feed a constsub {1} (or in fact almost
205 # anything other than the actionsub below, any scalarref will show
206 # up as a leak, trapped by... something...
207 # Ideally we should be able to const this to sub{1} and just return
208 # $seen_refs (in fact it is identical to the dummy list at the end of
209 # a run here). Alas this doesn't seem to work, so punt for now...
210 action => sub { ++$dummy_addresslist->{ hrefaddr $_[0] } },
212 refs => [ map { my $sym = $_;
213 # *{"$pkg$sym"}{CODE} won't simply work - MRO-cached CVs are invisible there
214 ( CV_TRACING ? Class::MethodCache::get_cv("${pkg}$sym") : () ),
216 ( defined *{"$pkg$sym"}{SCALAR} and length ref ${"$pkg$sym"} and ! isweak( ${"$pkg$sym"} ) )
221 ( defined *{"$pkg$sym"}{$_} and ! isweak(defined *{"$pkg$sym"}{$_}) )
224 } qw(HASH ARRAY IO GLOB) ),
227 ) unless $pkg =~ /^ :: (?:
228 DB | next | B | .+? ::::ISA (?: ::CACHE ) | Class::C3
235 # { { $_ => $refs_per_pkg->{$_} } }
237 # {$refs_per_pkg->{$a} <=> $refs_per_pkg->{$b} }
238 # keys %$refs_per_pkg
244 sub assert_empty_weakregistry {
245 my ($weak_registry, $quiet) = @_;
247 Sub::Defer::undefer_all();
249 # in case we hooked bless any extra object creation will wreak
250 # havoc during the assert phase
251 local *CORE::GLOBAL::bless;
252 *CORE::GLOBAL::bless = sub { CORE::bless( $_[0], (@_ > 1) ? $_[1] : caller() ) };
254 croak 'Expecting a registry hashref' unless ref $weak_registry eq 'HASH';
256 defined $weak_registry->{$_}{weakref} or delete $weak_registry->{$_}
257 for keys %$weak_registry;
259 return unless keys %$weak_registry;
261 my $tb = eval { Test::Builder->new }
262 or croak "Calling assert_empty_weakregistry in $0 without a loaded Test::Builder makes no sense";
264 for my $addr (keys %$weak_registry) {
265 $weak_registry->{$addr}{display_name} = join ' | ', (
267 { length $a <=> length $b or $a cmp $b }
268 keys %{$weak_registry->{$addr}{slot_names}}
271 $tb->BAILOUT("!!!! WEAK REGISTRY SLOT $weak_registry->{$addr}{display_name} IS NOT A WEAKREF !!!!")
272 if defined $weak_registry->{$addr}{weakref} and ! isweak( $weak_registry->{$addr}{weakref} );
275 # the symtable walk is very expensive
276 # if we are $quiet (running in an END block) we do not really need to be
277 # that thorough - can get by with only %Sub::Quote::QUOTED
278 delete $weak_registry->{$_} for $quiet
282 # only look at the closed over stuffs
283 refs => [ grep { length ref $_ } map { values %{$_->[2]} } grep { ref $_ eq 'ARRAY' } values %Sub::Quote::QUOTED ],
290 # full sumtable walk, starting from ::
291 keys %{ symtable_referenced_addresses() }
295 for my $addr (sort { $weak_registry->{$a}{display_name} cmp $weak_registry->{$b}{display_name} } keys %$weak_registry) {
297 next if ! defined $weak_registry->{$addr}{weakref};
299 $leaks_found++ unless $tb->in_todo;
300 $tb->ok (0, "Expected garbage collection of $weak_registry->{$addr}{display_name}");
303 local $Data::Dumper::Maxdepth = 1;
304 sprintf "\n%s (refcnt %d) => %s\n",
305 $weak_registry->{$addr}{display_name},
306 refcount($weak_registry->{$addr}{weakref}),
308 ref($weak_registry->{$addr}{weakref}) eq 'CODE'
310 B::svref_2object($weak_registry->{$addr}{weakref})->XSUB
311 ) ? '__XSUB__' : Dumper( $weak_registry->{$addr}{weakref} )
315 # FIXME - need to add a circular reference seeker based on the visitor
316 # (will need a bunch of modifications, punting with just a stub for now)
318 $diag .= Devel::FindRef::track ($weak_registry->{$addr}{weakref}, 50) . "\n"
319 if ( $ENV{TEST_VERBOSE} && eval { require Devel::FindRef });
323 if (my $stack = $weak_registry->{$addr}{stacktrace}) {
324 $diag .= " Reference first seen$stack";
329 # if ($leaks_found == 1) {
330 # # using the fh dumper due to intermittent buffering issues
331 # # in case we decide to exit soon after (possibly via _exit)
332 # require Devel::MAT::Dumper;
333 # local $Devel::MAT::Dumper::MAX_STRING = -1;
334 # open( my $fh, '>:raw', "leaked_${addr}_pid$$.pmat" ) or die $!;
335 # Devel::MAT::Dumper::dumpfh( $fh );
336 # close ($fh) or die $!;
343 if (! $quiet and !$leaks_found and ! $tb->in_todo) {
344 $tb->ok(1, sprintf "No leaks found at %s line %d", (caller())[1,2] );
350 $INC{'Test/Builder.pm'}
354 my $t = eval { Test::Builder->new }
355 or warn "Test::Builder->new failed:\n$@\n";
359 # we check for test passage - a leak may be a part of a TODO
360 if ($leaks_found and !$tb->is_passing) {
363 "\n\n%s\n%s\n\nInstall Devel::FindRef and re-run the test with set "
364 . '$ENV{TEST_VERBOSE} (prove -v) to see a more detailed leak-report'
365 . "\n\n%s\n%s\n\n", ('#' x 16) x 4
366 ) if ( !$ENV{TEST_VERBOSE} or !$INC{'Devel/FindRef.pm'} );
370 $tb->note("Auto checked $refs_traced references for leaks - none detected");
373 # Disable this until better times - SQLT and probably other things
374 # still load strictures. Let's just wait until Moo2.0 and go from there
376 # also while we are here and not in plain runmode: make sure we never
377 # loaded any of the strictures XS bullshit (it's a leak in a sense)
378 unless (DBICTest::RunMode->is_plain) {
379 for (qw(indirect multidimensional bareword::filehandles)) {
380 exists $INC{ Module::Runtime::module_notional_filename($_) }
382 $tb->ok(0, "$_ load should not have been attempted!!!" )