4 package Visitor::NameTracking;
8 use namespace::clean -except => 'meta';
10 has '_current_trace_name' => (is => 'ro');
11 has 'root_name' => (is => 'ro');
14 my ($orig, $self) = (shift, shift);
15 local $self->{_current_trace_name}
16 = ($self->{_current_trace_name}||$self->root_name);
17 return $self->$orig(@_);
20 around visit_hash_entry => sub {
21 my ($orig, $self) = (shift, shift);
22 my $key = $_[0]; # $key, $value
23 local $self->{_current_trace_name}
24 = $self->{_current_trace_name}.'->{'.(perlstring $key).'}';
25 return $self->$orig(@_);
28 around visit_array_entry => sub {
29 my ($orig, $self) = (shift, shift);
30 my $index = $_[1]; # $value, $index
31 local $self->{_current_trace_name}
32 = $self->{_current_trace_name}.'->['.$index.']';
33 return $self->$orig(@_);
36 around visit_scalar => sub {
37 my ($orig, $self) = (shift, shift);
38 local $self->{_current_trace_name} = '${'.$self->{_current_trace_name}.'}';
39 return $self->$orig(@_);
45 use Scalar::Util qw(weaken refaddr);
46 use namespace::clean -except => 'meta';
48 extends 'Data::Visitor';
50 with 'Visitor::NameTracking';
52 # dump the lazy when we get a sensible version of D::V on the dev system
54 has '_traced_refs' => (is => 'ro', lazy => 1, default => sub { {} });
55 has '_traced_names' => (is => 'ro', lazy => 1, default => sub { {} });
57 before visit_ref => sub {
58 my ($self, $data) = @_;
60 # can't just rely on refaddr because it may get re-used if the data goes
61 # out of scope (we could play clever games with free magic on the wizard
62 # or whatever but KISS) - but we -can- keep a weak reference which will
63 # turn to undef if the variable disappears
65 weaken($self->_traced_refs->{refaddr $data} = $data);
67 $self->_traced_names->{refaddr $data} = $self->_current_trace_name;
72 my $refs = $self->_traced_refs;
73 my $names = $self->_traced_names;
75 # nuke keys where the traced refs entry is undef since they indicate
76 # "went out of scope" so the name is no longer valid. however if we
77 # do still have a refs entry we know the name is valid because if it
78 # didn't go out of scope that refaddr can't have been re-used.
79 # (NB: I don't care if this works under ithreads)
81 delete @{$names}{grep !defined($refs->{$_}), keys %$names};
85 # force recursion into objects (Data::Visitor doesn't by default)
87 sub visit_object { shift->visit_ref(@_) }
89 package Ref::Replacer;
91 # note: we actually handle weaken as well as external refs because I intend
92 # to use Data::Dumper as a first pass and YAML::XS as a second and neither
93 # of them know how to deal with weak references
95 # I'm faintly curious to see if manual cross-ref-ification nad JSON::XS will
96 # actually be faster for reconstructing structures but it's fairly academic
100 # ensure we have next::method available - just because Moose loads it
101 # as a side effect doesn't mean it's clever to rely on that
103 use Scalar::Util qw(refaddr isweak);
104 use namespace::clean -except => 'meta';
106 extends 'Data::Visitor';
108 with 'Visitor::NameTracking';
110 has 'external_mappings' => (is => 'ro', lazy => 1, default => sub { {} });
111 has 'weaken_these' => (is => 'ro', lazy => 1, default => sub { {} });
112 has 'map_these' => (is => 'ro', lazy => 1, default => sub { {} });
114 # fairly sure an around modifier will get severely fucked up here
115 # in that the copying of @_ will lose the weakness we need to check
120 # have to test $_[0] directly since copying a weak ref gives a strong ref
122 warn $self->_current_trace_name;
126 $self->weaken_these->{$self->_current_trace_name} = 1;
129 # if we've got a mapping for a reference (i.e. it's supplied from
130 # somewhere else) then we need to record where we are and then
131 # return undef for the fmap process so we serialize an undefined
132 # value and the fixup puts the external reference back in later
134 if (my $m = $self->external_mappings->{refaddr $_[0]}) {
135 $self->map_these->{$self->_current_trace_name} = $m;
139 return $self->next::method(@_);
142 sub _register_mapping { $_[2] }
148 map $self->${\"_fixup_code_for_$_"},
149 qw(externals weakrefs)
153 sub _fixup_code_for_externals {
155 my $ext = $self->map_these;
156 return unless keys %$ext;
158 qq{# fixup code for external references},
160 $_.' = '.$ext->{$_}.';';
166 sub _fixup_code_for_weakrefs {
168 my $weaken = $self->weaken_these;
169 return unless keys %$weaken;
171 qq{# fixup code for weak references},
172 'use Scalar::Util ();',
174 'Scalar::Util::weaken('.$_.');';
180 # force recursion into objects (Data::Visitor doesn't by default)
182 sub visit_object { shift->visit_ref(@_) }
186 use Test::More qw(no_plan);
187 use Scalar::Util qw(refaddr weaken);
190 bar => { baz => [ 'quux', { fleem => 1 } ] },
191 skald => \[ { hot => 'story' } ],
194 my @expect = split "\n", <<'EOEXPECT';
199 ${$foo->{"skald"}}->[0]
202 my $tracer = Ref::Tracer->new({ root_name => '$foo' });
204 $tracer->visit($foo);
206 delete $foo->{bar}{baz};
208 my $result = $tracer->traced_ref_map;
212 [ sort { length($a) <=> length($b) } values %$result ],
213 "Expected results present"
216 my %map = reverse %$result;
218 foreach my $e (@expect) {
222 die "Error $@ evaluating $e" if $@;
225 is($map{$e},refaddr($value), "Result for ${e} ok");
229 one => { two => three },
230 bard => $foo->{skald},
231 bard_guts => ${$foo->{skald}},
232 empty_now => $foo->{bar},
235 weaken($flimflam->{weak_one} = $flimflam->{one});
237 my $replacer = Ref::Replacer->new({
238 external_mappings => $result,
239 root_name => '$final',
242 my $copyflam = $replacer->visit($flimflam);
244 use Data::Dumper; $Data::Dumper::Indent = 1;
246 warn Dumper($copyflam);
248 warn $replacer->fixup_code;