Filename | /home/ss5/perl5/perlbrew/perls/perl-5.22.0/lib/5.22.0/x86_64-linux/Data/Dumper.pm |
Statements | Executed 41 statements in 2.77ms |
Calls | P | F | Exclusive Time |
Inclusive Time |
Subroutine |
---|---|---|---|---|---|
1 | 1 | 1 | 165µs | 167µs | BEGIN@754 | Data::Dumper::
1 | 1 | 1 | 14µs | 37µs | BEGIN@22 | Data::Dumper::
1 | 1 | 1 | 14µs | 56µs | BEGIN@277 | Data::Dumper::
1 | 1 | 1 | 12µs | 122µs | BEGIN@24 | Data::Dumper::
1 | 1 | 1 | 6µs | 6µs | BEGIN@12 | Data::Dumper::
1 | 1 | 1 | 6µs | 6µs | BEGIN@18 | Data::Dumper::
1 | 1 | 1 | 2µs | 2µs | CORE:qr (opcode) | Data::Dumper::
1 | 1 | 1 | 1µs | 1µs | _vstring (xsub) | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Bless | Data::Dumper::
0 | 0 | 0 | 0s | 0s | DESTROY | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Deepcopy | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Deparse | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Dump | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Dumper | Data::Dumper::
0 | 0 | 0 | 0s | 0s | DumperX | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Dumpperl | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Freezer | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Indent | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Maxdepth | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Maxrecurse | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Names | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Pad | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Pair | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Purity | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Quotekeys | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Reset | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Seen | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Sortkeys | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Sparseseen | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Terse | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Toaster | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Useperl | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Useqq | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Values | Data::Dumper::
0 | 0 | 0 | 0s | 0s | Varname | Data::Dumper::
0 | 0 | 0 | 0s | 0s | _compose_out | Data::Dumper::
0 | 0 | 0 | 0s | 0s | _dump | Data::Dumper::
0 | 0 | 0 | 0s | 0s | _quote | Data::Dumper::
0 | 0 | 0 | 0s | 0s | _refine_name | Data::Dumper::
0 | 0 | 0 | 0s | 0s | _sortkeys | Data::Dumper::
0 | 0 | 0 | 0s | 0s | format_refaddr | Data::Dumper::
0 | 0 | 0 | 0s | 0s | init_refaddr_format | Data::Dumper::
0 | 0 | 0 | 0s | 0s | new | Data::Dumper::
0 | 0 | 0 | 0s | 0s | qquote | Data::Dumper::
Line | State ments |
Time on line |
Calls | Time in subs |
Code |
---|---|---|---|---|---|
1 | # | ||||
2 | # Data/Dumper.pm | ||||
3 | # | ||||
4 | # convert perl data structures into perl syntax suitable for both printing | ||||
5 | # and eval | ||||
6 | # | ||||
7 | # Documentation at the __END__ | ||||
8 | # | ||||
9 | |||||
10 | package Data::Dumper; | ||||
11 | |||||
12 | # spent 6µs within Data::Dumper::BEGIN@12 which was called:
# once (6µs+0s) by CHI::Util::BEGIN@5 at line 14 | ||||
13 | 1 | 4µs | $VERSION = '2.158'; # Don't forget to set version and release | ||
14 | 1 | 13µs | 1 | 6µs | } # date in POD below! # spent 6µs making 1 call to Data::Dumper::BEGIN@12 |
15 | |||||
16 | #$| = 1; | ||||
17 | |||||
18 | 2 | 27µs | 1 | 6µs | # spent 6µs within Data::Dumper::BEGIN@18 which was called:
# once (6µs+0s) by CHI::Util::BEGIN@5 at line 18 # spent 6µs making 1 call to Data::Dumper::BEGIN@18 |
19 | 1 | 500ns | require Exporter; | ||
20 | 1 | 500ns | require overload; | ||
21 | |||||
22 | 2 | 46µs | 2 | 59µs | # spent 37µs (14+22) within Data::Dumper::BEGIN@22 which was called:
# once (14µs+22µs) by CHI::Util::BEGIN@5 at line 22 # spent 37µs making 1 call to Data::Dumper::BEGIN@22
# spent 22µs making 1 call to Exporter::import |
23 | |||||
24 | # spent 122µs (12+111) within Data::Dumper::BEGIN@24 which was called:
# once (12µs+111µs) by CHI::Util::BEGIN@5 at line 38 | ||||
25 | 1 | 4µs | @ISA = qw(Exporter); | ||
26 | 1 | 400ns | @EXPORT = qw(Dumper); | ||
27 | 1 | 200ns | @EXPORT_OK = qw(DumperX); | ||
28 | |||||
29 | # if run under miniperl, or otherwise lacking dynamic loading, | ||||
30 | # XSLoader should be attempted to load, or the pure perl flag | ||||
31 | # toggled on load failure. | ||||
32 | 1 | 3µs | eval { | ||
33 | 1 | 300ns | require XSLoader; | ||
34 | 1 | 115µs | 1 | 111µs | XSLoader::load( 'Data::Dumper' ); # spent 111µs making 1 call to XSLoader::load |
35 | 1 | 400ns | 1 | ||
36 | } | ||||
37 | or $Useperl = 1; | ||||
38 | 1 | 591µs | 1 | 122µs | } # spent 122µs making 1 call to Data::Dumper::BEGIN@24 |
39 | |||||
40 | 1 | 400ns | my $IS_ASCII = ord 'A' == 65; | ||
41 | |||||
42 | # module vars and their defaults | ||||
43 | 1 | 300ns | $Indent = 2 unless defined $Indent; | ||
44 | 1 | 100ns | $Purity = 0 unless defined $Purity; | ||
45 | 1 | 200ns | $Pad = "" unless defined $Pad; | ||
46 | 1 | 100ns | $Varname = "VAR" unless defined $Varname; | ||
47 | 1 | 100ns | $Useqq = 0 unless defined $Useqq; | ||
48 | 1 | 0s | $Terse = 0 unless defined $Terse; | ||
49 | 1 | 200ns | $Freezer = "" unless defined $Freezer; | ||
50 | 1 | 200ns | $Toaster = "" unless defined $Toaster; | ||
51 | 1 | 100ns | $Deepcopy = 0 unless defined $Deepcopy; | ||
52 | 1 | 0s | $Quotekeys = 1 unless defined $Quotekeys; | ||
53 | 1 | 100ns | $Bless = "bless" unless defined $Bless; | ||
54 | #$Expdepth = 0 unless defined $Expdepth; | ||||
55 | 1 | 100ns | $Maxdepth = 0 unless defined $Maxdepth; | ||
56 | 1 | 200ns | $Pair = ' => ' unless defined $Pair; | ||
57 | 1 | 100ns | $Useperl = 0 unless defined $Useperl; | ||
58 | 1 | 100ns | $Sortkeys = 0 unless defined $Sortkeys; | ||
59 | 1 | 100ns | $Deparse = 0 unless defined $Deparse; | ||
60 | 1 | 100ns | $Sparseseen = 0 unless defined $Sparseseen; | ||
61 | 1 | 100ns | $Maxrecurse = 1000 unless defined $Maxrecurse; | ||
62 | |||||
63 | # | ||||
64 | # expects an arrayref of values to be dumped. | ||||
65 | # can optionally pass an arrayref of names for the values. | ||||
66 | # names must have leading $ sign stripped. begin the name with * | ||||
67 | # to cause output of arrays and hashes rather than refs. | ||||
68 | # | ||||
69 | sub new { | ||||
70 | my($c, $v, $n) = @_; | ||||
71 | |||||
72 | croak "Usage: PACKAGE->new(ARRAYREF, [ARRAYREF])" | ||||
73 | unless (defined($v) && (ref($v) eq 'ARRAY')); | ||||
74 | $n = [] unless (defined($n) && (ref($n) eq 'ARRAY')); | ||||
75 | |||||
76 | my($s) = { | ||||
77 | level => 0, # current recursive depth | ||||
78 | indent => $Indent, # various styles of indenting | ||||
79 | pad => $Pad, # all lines prefixed by this string | ||||
80 | xpad => "", # padding-per-level | ||||
81 | apad => "", # added padding for hash keys n such | ||||
82 | sep => "", # list separator | ||||
83 | pair => $Pair, # hash key/value separator: defaults to ' => ' | ||||
84 | seen => {}, # local (nested) refs (id => [name, val]) | ||||
85 | todump => $v, # values to dump [] | ||||
86 | names => $n, # optional names for values [] | ||||
87 | varname => $Varname, # prefix to use for tagging nameless ones | ||||
88 | purity => $Purity, # degree to which output is evalable | ||||
89 | useqq => $Useqq, # use "" for strings (backslashitis ensues) | ||||
90 | terse => $Terse, # avoid name output (where feasible) | ||||
91 | freezer => $Freezer, # name of Freezer method for objects | ||||
92 | toaster => $Toaster, # name of method to revive objects | ||||
93 | deepcopy => $Deepcopy, # do not cross-ref, except to stop recursion | ||||
94 | quotekeys => $Quotekeys, # quote hash keys | ||||
95 | 'bless' => $Bless, # keyword to use for "bless" | ||||
96 | # expdepth => $Expdepth, # cutoff depth for explicit dumping | ||||
97 | maxdepth => $Maxdepth, # depth beyond which we give up | ||||
98 | maxrecurse => $Maxrecurse, # depth beyond which we abort | ||||
99 | useperl => $Useperl, # use the pure Perl implementation | ||||
100 | sortkeys => $Sortkeys, # flag or filter for sorting hash keys | ||||
101 | deparse => $Deparse, # use B::Deparse for coderefs | ||||
102 | noseen => $Sparseseen, # do not populate the seen hash unless necessary | ||||
103 | }; | ||||
104 | |||||
105 | if ($Indent > 0) { | ||||
106 | $s->{xpad} = " "; | ||||
107 | $s->{sep} = "\n"; | ||||
108 | } | ||||
109 | return bless($s, $c); | ||||
110 | } | ||||
111 | |||||
112 | # Packed numeric addresses take less memory. Plus pack is faster than sprintf | ||||
113 | |||||
114 | # Most users of current versions of Data::Dumper will be 5.008 or later. | ||||
115 | # Anyone on 5.6.1 and 5.6.2 upgrading will be rare (particularly judging by | ||||
116 | # the bug reports from users on those platforms), so for the common case avoid | ||||
117 | # complexity, and avoid even compiling the unneeded code. | ||||
118 | |||||
119 | sub init_refaddr_format { | ||||
120 | } | ||||
121 | |||||
122 | sub format_refaddr { | ||||
123 | require Scalar::Util; | ||||
124 | pack "J", Scalar::Util::refaddr(shift); | ||||
125 | }; | ||||
126 | |||||
127 | 1 | 500ns | if ($] < 5.008) { | ||
128 | eval <<'EOC' or die; | ||||
129 | no warnings 'redefine'; | ||||
130 | my $refaddr_format; | ||||
131 | sub init_refaddr_format { | ||||
132 | require Config; | ||||
133 | my $f = $Config::Config{uvxformat}; | ||||
134 | $f =~ tr/"//d; | ||||
135 | $refaddr_format = "0x%" . $f; | ||||
136 | } | ||||
137 | |||||
138 | sub format_refaddr { | ||||
139 | require Scalar::Util; | ||||
140 | sprintf $refaddr_format, Scalar::Util::refaddr(shift); | ||||
141 | } | ||||
142 | |||||
143 | 1 | ||||
144 | EOC | ||||
145 | } | ||||
146 | |||||
147 | # | ||||
148 | # add-to or query the table of already seen references | ||||
149 | # | ||||
150 | sub Seen { | ||||
151 | my($s, $g) = @_; | ||||
152 | if (defined($g) && (ref($g) eq 'HASH')) { | ||||
153 | init_refaddr_format(); | ||||
154 | my($k, $v, $id); | ||||
155 | while (($k, $v) = each %$g) { | ||||
156 | if (defined $v) { | ||||
157 | if (ref $v) { | ||||
158 | $id = format_refaddr($v); | ||||
159 | if ($k =~ /^[*](.*)$/) { | ||||
160 | $k = (ref $v eq 'ARRAY') ? ( "\\\@" . $1 ) : | ||||
161 | (ref $v eq 'HASH') ? ( "\\\%" . $1 ) : | ||||
162 | (ref $v eq 'CODE') ? ( "\\\&" . $1 ) : | ||||
163 | ( "\$" . $1 ) ; | ||||
164 | } | ||||
165 | elsif ($k !~ /^\$/) { | ||||
166 | $k = "\$" . $k; | ||||
167 | } | ||||
168 | $s->{seen}{$id} = [$k, $v]; | ||||
169 | } | ||||
170 | else { | ||||
171 | carp "Only refs supported, ignoring non-ref item \$$k"; | ||||
172 | } | ||||
173 | } | ||||
174 | else { | ||||
175 | carp "Value of ref must be defined; ignoring undefined item \$$k"; | ||||
176 | } | ||||
177 | } | ||||
178 | return $s; | ||||
179 | } | ||||
180 | else { | ||||
181 | return map { @$_ } values %{$s->{seen}}; | ||||
182 | } | ||||
183 | } | ||||
184 | |||||
185 | # | ||||
186 | # set or query the values to be dumped | ||||
187 | # | ||||
188 | sub Values { | ||||
189 | my($s, $v) = @_; | ||||
190 | if (defined($v)) { | ||||
191 | if (ref($v) eq 'ARRAY') { | ||||
192 | $s->{todump} = [@$v]; # make a copy | ||||
193 | return $s; | ||||
194 | } | ||||
195 | else { | ||||
196 | croak "Argument to Values, if provided, must be array ref"; | ||||
197 | } | ||||
198 | } | ||||
199 | else { | ||||
200 | return @{$s->{todump}}; | ||||
201 | } | ||||
202 | } | ||||
203 | |||||
204 | # | ||||
205 | # set or query the names of the values to be dumped | ||||
206 | # | ||||
207 | sub Names { | ||||
208 | my($s, $n) = @_; | ||||
209 | if (defined($n)) { | ||||
210 | if (ref($n) eq 'ARRAY') { | ||||
211 | $s->{names} = [@$n]; # make a copy | ||||
212 | return $s; | ||||
213 | } | ||||
214 | else { | ||||
215 | croak "Argument to Names, if provided, must be array ref"; | ||||
216 | } | ||||
217 | } | ||||
218 | else { | ||||
219 | return @{$s->{names}}; | ||||
220 | } | ||||
221 | } | ||||
222 | |||||
223 | sub DESTROY {} | ||||
224 | |||||
225 | sub Dump { | ||||
226 | return &Dumpxs | ||||
227 | unless $Data::Dumper::Useperl || (ref($_[0]) && $_[0]->{useperl}) | ||||
228 | || $Data::Dumper::Deparse || (ref($_[0]) && $_[0]->{deparse}) | ||||
229 | |||||
230 | # Use pure perl version on earlier releases on EBCDIC platforms | ||||
231 | || (! $IS_ASCII && $] lt 5.021_010); | ||||
232 | return &Dumpperl; | ||||
233 | } | ||||
234 | |||||
235 | # | ||||
236 | # dump the refs in the current dumper object. | ||||
237 | # expects same args as new() if called via package name. | ||||
238 | # | ||||
239 | sub Dumpperl { | ||||
240 | my($s) = shift; | ||||
241 | my(@out, $val, $name); | ||||
242 | my($i) = 0; | ||||
243 | local(@post); | ||||
244 | init_refaddr_format(); | ||||
245 | |||||
246 | $s = $s->new(@_) unless ref $s; | ||||
247 | |||||
248 | for $val (@{$s->{todump}}) { | ||||
249 | @post = (); | ||||
250 | $name = $s->{names}[$i++]; | ||||
251 | $name = $s->_refine_name($name, $val, $i); | ||||
252 | |||||
253 | my $valstr; | ||||
254 | { | ||||
255 | local($s->{apad}) = $s->{apad}; | ||||
256 | $s->{apad} .= ' ' x (length($name) + 3) if $s->{indent} >= 2 and !$s->{terse}; | ||||
257 | $valstr = $s->_dump($val, $name); | ||||
258 | } | ||||
259 | |||||
260 | $valstr = "$name = " . $valstr . ';' if @post or !$s->{terse}; | ||||
261 | my $out = $s->_compose_out($valstr, \@post); | ||||
262 | |||||
263 | push @out, $out; | ||||
264 | } | ||||
265 | return wantarray ? @out : join('', @out); | ||||
266 | } | ||||
267 | |||||
268 | # wrap string in single quotes (escaping if needed) | ||||
269 | sub _quote { | ||||
270 | my $val = shift; | ||||
271 | $val =~ s/([\\\'])/\\$1/g; | ||||
272 | return "'" . $val . "'"; | ||||
273 | } | ||||
274 | |||||
275 | # Old Perls (5.14-) have trouble resetting vstring magic when it is no | ||||
276 | # longer valid. | ||||
277 | 2 | 1.46ms | 3 | 99µs | # spent 56µs (14+43) within Data::Dumper::BEGIN@277 which was called:
# once (14µs+43µs) by CHI::Util::BEGIN@5 at line 277 # spent 56µs making 1 call to Data::Dumper::BEGIN@277
# spent 41µs making 1 call to constant::import
# spent 1µs making 1 call to Data::Dumper::_vstring |
278 | |||||
279 | # | ||||
280 | # twist, toil and turn; | ||||
281 | # and recurse, of course. | ||||
282 | # sometimes sordidly; | ||||
283 | # and curse if no recourse. | ||||
284 | # | ||||
285 | sub _dump { | ||||
286 | my($s, $val, $name) = @_; | ||||
287 | my($out, $type, $id, $sname); | ||||
288 | |||||
289 | $type = ref $val; | ||||
290 | $out = ""; | ||||
291 | |||||
292 | if ($type) { | ||||
293 | |||||
294 | # Call the freezer method if it's specified and the object has the | ||||
295 | # method. Trap errors and warn() instead of die()ing, like the XS | ||||
296 | # implementation. | ||||
297 | my $freezer = $s->{freezer}; | ||||
298 | if ($freezer and UNIVERSAL::can($val, $freezer)) { | ||||
299 | eval { $val->$freezer() }; | ||||
300 | warn "WARNING(Freezer method call failed): $@" if $@; | ||||
301 | } | ||||
302 | |||||
303 | require Scalar::Util; | ||||
304 | my $realpack = Scalar::Util::blessed($val); | ||||
305 | my $realtype = $realpack ? Scalar::Util::reftype($val) : ref $val; | ||||
306 | $id = format_refaddr($val); | ||||
307 | |||||
308 | # Note: By this point $name is always defined and of non-zero length. | ||||
309 | # Keep a tab on it so that we do not fall into recursive pit. | ||||
310 | if (exists $s->{seen}{$id}) { | ||||
311 | if ($s->{purity} and $s->{level} > 0) { | ||||
312 | $out = ($realtype eq 'HASH') ? '{}' : | ||||
313 | ($realtype eq 'ARRAY') ? '[]' : | ||||
314 | 'do{my $o}' ; | ||||
315 | push @post, $name . " = " . $s->{seen}{$id}[0]; | ||||
316 | } | ||||
317 | else { | ||||
318 | $out = $s->{seen}{$id}[0]; | ||||
319 | if ($name =~ /^([\@\%])/) { | ||||
320 | my $start = $1; | ||||
321 | if ($out =~ /^\\$start/) { | ||||
322 | $out = substr($out, 1); | ||||
323 | } | ||||
324 | else { | ||||
325 | $out = $start . '{' . $out . '}'; | ||||
326 | } | ||||
327 | } | ||||
328 | } | ||||
329 | return $out; | ||||
330 | } | ||||
331 | else { | ||||
332 | # store our name | ||||
333 | $s->{seen}{$id} = [ ( | ||||
334 | ($name =~ /^[@%]/) | ||||
335 | ? ('\\' . $name ) | ||||
336 | : ($realtype eq 'CODE' and $name =~ /^[*](.*)$/) | ||||
337 | ? ('\\&' . $1 ) | ||||
338 | : $name | ||||
339 | ), $val ]; | ||||
340 | } | ||||
341 | my $no_bless = 0; | ||||
342 | my $is_regex = 0; | ||||
343 | if ( $realpack and ($] >= 5.009005 ? re::is_regexp($val) : $realpack eq 'Regexp') ) { | ||||
344 | $is_regex = 1; | ||||
345 | $no_bless = $realpack eq 'Regexp'; | ||||
346 | } | ||||
347 | |||||
348 | # If purity is not set and maxdepth is set, then check depth: | ||||
349 | # if we have reached maximum depth, return the string | ||||
350 | # representation of the thing we are currently examining | ||||
351 | # at this depth (i.e., 'Foo=ARRAY(0xdeadbeef)'). | ||||
352 | if (!$s->{purity} | ||||
353 | and defined($s->{maxdepth}) | ||||
354 | and $s->{maxdepth} > 0 | ||||
355 | and $s->{level} >= $s->{maxdepth}) | ||||
356 | { | ||||
357 | return qq['$val']; | ||||
358 | } | ||||
359 | |||||
360 | # avoid recursing infinitely [perl #122111] | ||||
361 | if ($s->{maxrecurse} > 0 | ||||
362 | and $s->{level} >= $s->{maxrecurse}) { | ||||
363 | die "Recursion limit of $s->{maxrecurse} exceeded"; | ||||
364 | } | ||||
365 | |||||
366 | # we have a blessed ref | ||||
367 | my ($blesspad); | ||||
368 | if ($realpack and !$no_bless) { | ||||
369 | $out = $s->{'bless'} . '( '; | ||||
370 | $blesspad = $s->{apad}; | ||||
371 | $s->{apad} .= ' ' if ($s->{indent} >= 2); | ||||
372 | } | ||||
373 | |||||
374 | $s->{level}++; | ||||
375 | my $ipad = $s->{xpad} x $s->{level}; | ||||
376 | |||||
377 | if ($is_regex) { | ||||
378 | my $pat; | ||||
379 | my $flags = ""; | ||||
380 | if (defined(*re::regexp_pattern{CODE})) { | ||||
381 | ($pat, $flags) = re::regexp_pattern($val); | ||||
382 | } | ||||
383 | else { | ||||
384 | $pat = "$val"; | ||||
385 | } | ||||
386 | $pat =~ s <(\\.)|/> { $1 || '\\/' }ge; | ||||
387 | $out .= "qr/$pat/$flags"; | ||||
388 | } | ||||
389 | elsif ($realtype eq 'SCALAR' || $realtype eq 'REF' | ||||
390 | || $realtype eq 'VSTRING') { | ||||
391 | if ($realpack) { | ||||
392 | $out .= 'do{\\(my $o = ' . $s->_dump($$val, "\${$name}") . ')}'; | ||||
393 | } | ||||
394 | else { | ||||
395 | $out .= '\\' . $s->_dump($$val, "\${$name}"); | ||||
396 | } | ||||
397 | } | ||||
398 | elsif ($realtype eq 'GLOB') { | ||||
399 | $out .= '\\' . $s->_dump($$val, "*{$name}"); | ||||
400 | } | ||||
401 | elsif ($realtype eq 'ARRAY') { | ||||
402 | my($pad, $mname); | ||||
403 | my($i) = 0; | ||||
404 | $out .= ($name =~ /^\@/) ? '(' : '['; | ||||
405 | $pad = $s->{sep} . $s->{pad} . $s->{apad}; | ||||
406 | ($name =~ /^\@(.*)$/) ? ($mname = "\$" . $1) : | ||||
407 | # omit -> if $foo->[0]->{bar}, but not ${$foo->[0]}->{bar} | ||||
408 | ($name =~ /^\\?[\%\@\*\$][^{].*[]}]$/) ? ($mname = $name) : | ||||
409 | ($mname = $name . '->'); | ||||
410 | $mname .= '->' if $mname =~ /^\*.+\{[A-Z]+\}$/; | ||||
411 | for my $v (@$val) { | ||||
412 | $sname = $mname . '[' . $i . ']'; | ||||
413 | $out .= $pad . $ipad . '#' . $i | ||||
414 | if $s->{indent} >= 3; | ||||
415 | $out .= $pad . $ipad . $s->_dump($v, $sname); | ||||
416 | $out .= "," if $i++ < $#$val; | ||||
417 | } | ||||
418 | $out .= $pad . ($s->{xpad} x ($s->{level} - 1)) if $i; | ||||
419 | $out .= ($name =~ /^\@/) ? ')' : ']'; | ||||
420 | } | ||||
421 | elsif ($realtype eq 'HASH') { | ||||
422 | my ($k, $v, $pad, $lpad, $mname, $pair); | ||||
423 | $out .= ($name =~ /^\%/) ? '(' : '{'; | ||||
424 | $pad = $s->{sep} . $s->{pad} . $s->{apad}; | ||||
425 | $lpad = $s->{apad}; | ||||
426 | $pair = $s->{pair}; | ||||
427 | ($name =~ /^\%(.*)$/) ? ($mname = "\$" . $1) : | ||||
428 | # omit -> if $foo->[0]->{bar}, but not ${$foo->[0]}->{bar} | ||||
429 | ($name =~ /^\\?[\%\@\*\$][^{].*[]}]$/) ? ($mname = $name) : | ||||
430 | ($mname = $name . '->'); | ||||
431 | $mname .= '->' if $mname =~ /^\*.+\{[A-Z]+\}$/; | ||||
432 | my $sortkeys = defined($s->{sortkeys}) ? $s->{sortkeys} : ''; | ||||
433 | my $keys = []; | ||||
434 | if ($sortkeys) { | ||||
435 | if (ref($s->{sortkeys}) eq 'CODE') { | ||||
436 | $keys = $s->{sortkeys}($val); | ||||
437 | unless (ref($keys) eq 'ARRAY') { | ||||
438 | carp "Sortkeys subroutine did not return ARRAYREF"; | ||||
439 | $keys = []; | ||||
440 | } | ||||
441 | } | ||||
442 | else { | ||||
443 | $keys = [ sort keys %$val ]; | ||||
444 | } | ||||
445 | } | ||||
446 | |||||
447 | # Ensure hash iterator is reset | ||||
448 | keys(%$val); | ||||
449 | |||||
450 | my $key; | ||||
451 | while (($k, $v) = ! $sortkeys ? (each %$val) : | ||||
452 | @$keys ? ($key = shift(@$keys), $val->{$key}) : | ||||
453 | () ) | ||||
454 | { | ||||
455 | my $nk = $s->_dump($k, ""); | ||||
456 | |||||
457 | # _dump doesn't quote numbers of this form | ||||
458 | if ($s->{quotekeys} && $nk =~ /^(?:0|-?[1-9][0-9]{0,8})\z/) { | ||||
459 | $nk = $s->{useqq} ? qq("$nk") : qq('$nk'); | ||||
460 | } | ||||
461 | elsif (!$s->{quotekeys} and $nk =~ /^[\"\']([A-Za-z_]\w*)[\"\']$/) { | ||||
462 | $nk = $1 | ||||
463 | } | ||||
464 | |||||
465 | $sname = $mname . '{' . $nk . '}'; | ||||
466 | $out .= $pad . $ipad . $nk . $pair; | ||||
467 | |||||
468 | # temporarily alter apad | ||||
469 | $s->{apad} .= (" " x (length($nk) + 4)) | ||||
470 | if $s->{indent} >= 2; | ||||
471 | $out .= $s->_dump($val->{$k}, $sname) . ","; | ||||
472 | $s->{apad} = $lpad | ||||
473 | if $s->{indent} >= 2; | ||||
474 | } | ||||
475 | if (substr($out, -1) eq ',') { | ||||
476 | chop $out; | ||||
477 | $out .= $pad . ($s->{xpad} x ($s->{level} - 1)); | ||||
478 | } | ||||
479 | $out .= ($name =~ /^\%/) ? ')' : '}'; | ||||
480 | } | ||||
481 | elsif ($realtype eq 'CODE') { | ||||
482 | if ($s->{deparse}) { | ||||
483 | require B::Deparse; | ||||
484 | my $sub = 'sub ' . (B::Deparse->new)->coderef2text($val); | ||||
485 | $pad = $s->{sep} . $s->{pad} . $s->{apad} . $s->{xpad} x ($s->{level} - 1); | ||||
486 | $sub =~ s/\n/$pad/gse; | ||||
487 | $out .= $sub; | ||||
488 | } | ||||
489 | else { | ||||
490 | $out .= 'sub { "DUMMY" }'; | ||||
491 | carp "Encountered CODE ref, using dummy placeholder" if $s->{purity}; | ||||
492 | } | ||||
493 | } | ||||
494 | else { | ||||
495 | croak "Can't handle '$realtype' type"; | ||||
496 | } | ||||
497 | |||||
498 | if ($realpack and !$no_bless) { # we have a blessed ref | ||||
499 | $out .= ', ' . _quote($realpack) . ' )'; | ||||
500 | $out .= '->' . $s->{toaster} . '()' | ||||
501 | if $s->{toaster} ne ''; | ||||
502 | $s->{apad} = $blesspad; | ||||
503 | } | ||||
504 | $s->{level}--; | ||||
505 | } | ||||
506 | else { # simple scalar | ||||
507 | |||||
508 | my $ref = \$_[1]; | ||||
509 | my $v; | ||||
510 | # first, catalog the scalar | ||||
511 | if ($name ne '') { | ||||
512 | $id = format_refaddr($ref); | ||||
513 | if (exists $s->{seen}{$id}) { | ||||
514 | if ($s->{seen}{$id}[2]) { | ||||
515 | $out = $s->{seen}{$id}[0]; | ||||
516 | #warn "[<$out]\n"; | ||||
517 | return "\${$out}"; | ||||
518 | } | ||||
519 | } | ||||
520 | else { | ||||
521 | #warn "[>\\$name]\n"; | ||||
522 | $s->{seen}{$id} = ["\\$name", $ref]; | ||||
523 | } | ||||
524 | } | ||||
525 | $ref = \$val; | ||||
526 | if (ref($ref) eq 'GLOB') { # glob | ||||
527 | my $name = substr($val, 1); | ||||
528 | if ($name =~ /^[A-Za-z_][\w:]*$/ && $name ne 'main::') { | ||||
529 | $name =~ s/^main::/::/; | ||||
530 | $sname = $name; | ||||
531 | } | ||||
532 | else { | ||||
533 | $sname = $s->_dump( | ||||
534 | $name eq 'main::' || $] < 5.007 && $name eq "main::\0" | ||||
535 | ? '' | ||||
536 | : $name, | ||||
537 | "", | ||||
538 | ); | ||||
539 | $sname = '{' . $sname . '}'; | ||||
540 | } | ||||
541 | if ($s->{purity}) { | ||||
542 | my $k; | ||||
543 | local ($s->{level}) = 0; | ||||
544 | for $k (qw(SCALAR ARRAY HASH)) { | ||||
545 | my $gval = *$val{$k}; | ||||
546 | next unless defined $gval; | ||||
547 | next if $k eq "SCALAR" && ! defined $$gval; # always there | ||||
548 | |||||
549 | # _dump can push into @post, so we hold our place using $postlen | ||||
550 | my $postlen = scalar @post; | ||||
551 | $post[$postlen] = "\*$sname = "; | ||||
552 | local ($s->{apad}) = " " x length($post[$postlen]) if $s->{indent} >= 2; | ||||
553 | $post[$postlen] .= $s->_dump($gval, "\*$sname\{$k\}"); | ||||
554 | } | ||||
555 | } | ||||
556 | $out .= '*' . $sname; | ||||
557 | } | ||||
558 | elsif (!defined($val)) { | ||||
559 | $out .= "undef"; | ||||
560 | } | ||||
561 | elsif (defined &_vstring and $v = _vstring($val) | ||||
562 | and !_bad_vsmg || eval $v eq $val) { | ||||
563 | $out .= $v; | ||||
564 | } | ||||
565 | elsif (!defined &_vstring | ||||
566 | and ref $ref eq 'VSTRING' || eval{Scalar::Util::isvstring($val)}) { | ||||
567 | $out .= sprintf "%vd", $val; | ||||
568 | } | ||||
569 | # \d here would treat "1\x{660}" as a safe decimal number | ||||
570 | elsif ($val =~ /^(?:0|-?[1-9][0-9]{0,8})\z/) { # safe decimal number | ||||
571 | $out .= $val; | ||||
572 | } | ||||
573 | else { # string | ||||
574 | if ($s->{useqq} or $val =~ tr/\0-\377//c) { | ||||
575 | # Fall back to qq if there's Unicode | ||||
576 | $out .= qquote($val, $s->{useqq}); | ||||
577 | } | ||||
578 | else { | ||||
579 | $out .= _quote($val); | ||||
580 | } | ||||
581 | } | ||||
582 | } | ||||
583 | if ($id) { | ||||
584 | # if we made it this far, $id was added to seen list at current | ||||
585 | # level, so remove it to get deep copies | ||||
586 | if ($s->{deepcopy}) { | ||||
587 | delete($s->{seen}{$id}); | ||||
588 | } | ||||
589 | elsif ($name) { | ||||
590 | $s->{seen}{$id}[2] = 1; | ||||
591 | } | ||||
592 | } | ||||
593 | return $out; | ||||
594 | } | ||||
595 | |||||
596 | # | ||||
597 | # non-OO style of earlier version | ||||
598 | # | ||||
599 | sub Dumper { | ||||
600 | return Data::Dumper->Dump([@_]); | ||||
601 | } | ||||
602 | |||||
603 | # compat stub | ||||
604 | sub DumperX { | ||||
605 | return Data::Dumper->Dumpxs([@_], []); | ||||
606 | } | ||||
607 | |||||
608 | # | ||||
609 | # reset the "seen" cache | ||||
610 | # | ||||
611 | sub Reset { | ||||
612 | my($s) = shift; | ||||
613 | $s->{seen} = {}; | ||||
614 | return $s; | ||||
615 | } | ||||
616 | |||||
617 | sub Indent { | ||||
618 | my($s, $v) = @_; | ||||
619 | if (defined($v)) { | ||||
620 | if ($v == 0) { | ||||
621 | $s->{xpad} = ""; | ||||
622 | $s->{sep} = ""; | ||||
623 | } | ||||
624 | else { | ||||
625 | $s->{xpad} = " "; | ||||
626 | $s->{sep} = "\n"; | ||||
627 | } | ||||
628 | $s->{indent} = $v; | ||||
629 | return $s; | ||||
630 | } | ||||
631 | else { | ||||
632 | return $s->{indent}; | ||||
633 | } | ||||
634 | } | ||||
635 | |||||
636 | sub Pair { | ||||
637 | my($s, $v) = @_; | ||||
638 | defined($v) ? (($s->{pair} = $v), return $s) : $s->{pair}; | ||||
639 | } | ||||
640 | |||||
641 | sub Pad { | ||||
642 | my($s, $v) = @_; | ||||
643 | defined($v) ? (($s->{pad} = $v), return $s) : $s->{pad}; | ||||
644 | } | ||||
645 | |||||
646 | sub Varname { | ||||
647 | my($s, $v) = @_; | ||||
648 | defined($v) ? (($s->{varname} = $v), return $s) : $s->{varname}; | ||||
649 | } | ||||
650 | |||||
651 | sub Purity { | ||||
652 | my($s, $v) = @_; | ||||
653 | defined($v) ? (($s->{purity} = $v), return $s) : $s->{purity}; | ||||
654 | } | ||||
655 | |||||
656 | sub Useqq { | ||||
657 | my($s, $v) = @_; | ||||
658 | defined($v) ? (($s->{useqq} = $v), return $s) : $s->{useqq}; | ||||
659 | } | ||||
660 | |||||
661 | sub Terse { | ||||
662 | my($s, $v) = @_; | ||||
663 | defined($v) ? (($s->{terse} = $v), return $s) : $s->{terse}; | ||||
664 | } | ||||
665 | |||||
666 | sub Freezer { | ||||
667 | my($s, $v) = @_; | ||||
668 | defined($v) ? (($s->{freezer} = $v), return $s) : $s->{freezer}; | ||||
669 | } | ||||
670 | |||||
671 | sub Toaster { | ||||
672 | my($s, $v) = @_; | ||||
673 | defined($v) ? (($s->{toaster} = $v), return $s) : $s->{toaster}; | ||||
674 | } | ||||
675 | |||||
676 | sub Deepcopy { | ||||
677 | my($s, $v) = @_; | ||||
678 | defined($v) ? (($s->{deepcopy} = $v), return $s) : $s->{deepcopy}; | ||||
679 | } | ||||
680 | |||||
681 | sub Quotekeys { | ||||
682 | my($s, $v) = @_; | ||||
683 | defined($v) ? (($s->{quotekeys} = $v), return $s) : $s->{quotekeys}; | ||||
684 | } | ||||
685 | |||||
686 | sub Bless { | ||||
687 | my($s, $v) = @_; | ||||
688 | defined($v) ? (($s->{'bless'} = $v), return $s) : $s->{'bless'}; | ||||
689 | } | ||||
690 | |||||
691 | sub Maxdepth { | ||||
692 | my($s, $v) = @_; | ||||
693 | defined($v) ? (($s->{'maxdepth'} = $v), return $s) : $s->{'maxdepth'}; | ||||
694 | } | ||||
695 | |||||
696 | sub Maxrecurse { | ||||
697 | my($s, $v) = @_; | ||||
698 | defined($v) ? (($s->{'maxrecurse'} = $v), return $s) : $s->{'maxrecurse'}; | ||||
699 | } | ||||
700 | |||||
701 | sub Useperl { | ||||
702 | my($s, $v) = @_; | ||||
703 | defined($v) ? (($s->{'useperl'} = $v), return $s) : $s->{'useperl'}; | ||||
704 | } | ||||
705 | |||||
706 | sub Sortkeys { | ||||
707 | my($s, $v) = @_; | ||||
708 | defined($v) ? (($s->{'sortkeys'} = $v), return $s) : $s->{'sortkeys'}; | ||||
709 | } | ||||
710 | |||||
711 | sub Deparse { | ||||
712 | my($s, $v) = @_; | ||||
713 | defined($v) ? (($s->{'deparse'} = $v), return $s) : $s->{'deparse'}; | ||||
714 | } | ||||
715 | |||||
716 | sub Sparseseen { | ||||
717 | my($s, $v) = @_; | ||||
718 | defined($v) ? (($s->{'noseen'} = $v), return $s) : $s->{'noseen'}; | ||||
719 | } | ||||
720 | |||||
721 | # used by qquote below | ||||
722 | 1 | 3µs | my %esc = ( | ||
723 | "\a" => "\\a", | ||||
724 | "\b" => "\\b", | ||||
725 | "\t" => "\\t", | ||||
726 | "\n" => "\\n", | ||||
727 | "\f" => "\\f", | ||||
728 | "\r" => "\\r", | ||||
729 | "\e" => "\\e", | ||||
730 | ); | ||||
731 | |||||
732 | 1 | 7µs | 1 | 2µs | my $low_controls = ($IS_ASCII) # spent 2µs making 1 call to Data::Dumper::CORE:qr |
733 | |||||
734 | # This includes \177, because traditionally it has been | ||||
735 | # output as octal, even though it isn't really a "low" | ||||
736 | # control | ||||
737 | ? qr/[\0-\x1f\177]/ | ||||
738 | |||||
739 | # EBCDIC low controls. | ||||
740 | : qr/[\0-\x3f]/; | ||||
741 | |||||
742 | # put a string value in double quotes | ||||
743 | sub qquote { | ||||
744 | local($_) = shift; | ||||
745 | s/([\\\"\@\$])/\\$1/g; | ||||
746 | |||||
747 | # This efficiently changes the high ordinal characters to \x{} if the utf8 | ||||
748 | # flag is on. On ASCII platforms, the high ordinals are all the | ||||
749 | # non-ASCII's. On EBCDIC platforms, we don't include in these the non-ASCII | ||||
750 | # controls whose ordinals are less than SPACE, excluded below by the range | ||||
751 | # \0-\x3f. On ASCII platforms this range just compiles as part of :ascii:. | ||||
752 | # On EBCDIC platforms, there is just one outlier high ordinal control, and | ||||
753 | # it gets output as \x{}. | ||||
754 | 2 | 484µs | 2 | 169µs | # spent 167µs (165+2) within Data::Dumper::BEGIN@754 which was called:
# once (165µs+2µs) by CHI::Util::BEGIN@5 at line 754 # spent 167µs making 1 call to Data::Dumper::BEGIN@754
# spent 2µs making 1 call to bytes::import |
755 | s/([^[:ascii:]\0-\x3f])/sprintf("\\x{%x}",ord($1))/ge | ||||
756 | if $bytes > length | ||||
757 | || (! $IS_ASCII && $] ge 5.008_001 && utf8::is_utf8($_)); | ||||
758 | |||||
- - | |||||
764 | return qq("$_") unless /[[:^print:]]/; # fast exit if only printables | ||||
765 | |||||
766 | # Here, there is at least one non-printable to output. First, translate the | ||||
767 | # escapes. | ||||
768 | s/([\a\b\t\n\f\r\e])/$esc{$1}/g; | ||||
769 | |||||
770 | # no need for 3 digits in escape for octals not followed by a digit. | ||||
771 | s/($low_controls)(?!\d)/'\\'.sprintf('%o',ord($1))/eg; | ||||
772 | |||||
773 | # But otherwise use 3 digits | ||||
774 | s/($low_controls)/'\\'.sprintf('%03o',ord($1))/eg; | ||||
775 | |||||
776 | # all but last branch below not supported --BEHAVIOR SUBJECT TO CHANGE-- | ||||
777 | my $high = shift || ""; | ||||
778 | if ($high eq "iso8859") { # Doesn't escape the Latin1 printables | ||||
779 | if ($IS_ASCII) { | ||||
780 | s/([\200-\240])/'\\'.sprintf('%o',ord($1))/eg; | ||||
781 | } | ||||
782 | elsif ($] ge 5.007_003) { | ||||
783 | my $high_control = utf8::unicode_to_native(0x9F); | ||||
784 | s/$high_control/sprintf('\\%o',ord($1))/eg; | ||||
785 | } | ||||
786 | } elsif ($high eq "utf8") { | ||||
787 | # Some discussion of what to do here is in | ||||
788 | # https://rt.perl.org/Ticket/Display.html?id=113088 | ||||
789 | # use utf8; | ||||
790 | # $str =~ s/([^\040-\176])/sprintf "\\x{%04x}", ord($1)/ge; | ||||
791 | } elsif ($high eq "8bit") { | ||||
792 | # leave it as it is | ||||
793 | } else { | ||||
794 | s/([[:^ascii:]])/'\\'.sprintf('%03o',ord($1))/eg; | ||||
795 | #s/([^\040-\176])/sprintf "\\x{%04x}", ord($1)/ge; | ||||
796 | } | ||||
797 | |||||
798 | return qq("$_"); | ||||
799 | } | ||||
800 | |||||
801 | # helper sub to sort hash keys in Perl < 5.8.0 where we don't have | ||||
802 | # access to sortsv() from XS | ||||
803 | sub _sortkeys { [ sort keys %{$_[0]} ] } | ||||
804 | |||||
805 | sub _refine_name { | ||||
806 | my $s = shift; | ||||
807 | my ($name, $val, $i) = @_; | ||||
808 | if (defined $name) { | ||||
809 | if ($name =~ /^[*](.*)$/) { | ||||
810 | if (defined $val) { | ||||
811 | $name = (ref $val eq 'ARRAY') ? ( "\@" . $1 ) : | ||||
812 | (ref $val eq 'HASH') ? ( "\%" . $1 ) : | ||||
813 | (ref $val eq 'CODE') ? ( "\*" . $1 ) : | ||||
814 | ( "\$" . $1 ) ; | ||||
815 | } | ||||
816 | else { | ||||
817 | $name = "\$" . $1; | ||||
818 | } | ||||
819 | } | ||||
820 | elsif ($name !~ /^\$/) { | ||||
821 | $name = "\$" . $name; | ||||
822 | } | ||||
823 | } | ||||
824 | else { # no names provided | ||||
825 | $name = "\$" . $s->{varname} . $i; | ||||
826 | } | ||||
827 | return $name; | ||||
828 | } | ||||
829 | |||||
830 | sub _compose_out { | ||||
831 | my $s = shift; | ||||
832 | my ($valstr, $postref) = @_; | ||||
833 | my $out = ""; | ||||
834 | $out .= $s->{pad} . $valstr . $s->{sep}; | ||||
835 | if (@{$postref}) { | ||||
836 | $out .= $s->{pad} . | ||||
837 | join(';' . $s->{sep} . $s->{pad}, @{$postref}) . | ||||
838 | ';' . | ||||
839 | $s->{sep}; | ||||
840 | } | ||||
841 | return $out; | ||||
842 | } | ||||
843 | |||||
844 | 1 | 7µs | 1; | ||
845 | __END__ | ||||
# spent 2µs within Data::Dumper::CORE:qr which was called:
# once (2µs+0s) by CHI::Util::BEGIN@5 at line 732 | |||||
# spent 1µs within Data::Dumper::_vstring which was called:
# once (1µs+0s) by Data::Dumper::BEGIN@277 at line 277 |