← Index
NYTProf Performance Profile   « line view »
For v11.pl
  Run on Sun Jan 5 19:10:15 2020
Reported on Sun Jan 5 19:10:28 2020

Filename/usr/lib/x86_64-linux-gnu/perl/5.26/Data/Dumper.pm
StatementsExecuted 41 statements in 5.06ms
Subroutines
Calls P F Exclusive
Time		 Inclusive
Time		 Subroutine
1111.56ms2.10msData::Dumper::::BEGIN@277Data::Dumper::BEGIN@277
111214µs216µsData::Dumper::::BEGIN@761Data::Dumper::BEGIN@761
11121µs172µsData::Dumper::::BEGIN@23Data::Dumper::BEGIN@23
11114µs14µsData::Dumper::::BEGIN@18Data::Dumper::BEGIN@18
11110µs10µsData::Dumper::::BEGIN@12Data::Dumper::BEGIN@12
1114µs4µsData::Dumper::::BEGIN@21Data::Dumper::BEGIN@21
1113µs3µsData::Dumper::::_vstringData::Dumper::_vstring (xsub)
1112µs2µsData::Dumper::::CORE:qrData::Dumper::CORE:qr (opcode)
0000s0sData::Dumper::::BlessData::Dumper::Bless
0000s0sData::Dumper::::DESTROYData::Dumper::DESTROY
0000s0sData::Dumper::::DeepcopyData::Dumper::Deepcopy
0000s0sData::Dumper::::DeparseData::Dumper::Deparse
0000s0sData::Dumper::::DumpData::Dumper::Dump
0000s0sData::Dumper::::DumperData::Dumper::Dumper
0000s0sData::Dumper::::DumperXData::Dumper::DumperX
0000s0sData::Dumper::::DumpperlData::Dumper::Dumpperl
0000s0sData::Dumper::::FreezerData::Dumper::Freezer
0000s0sData::Dumper::::IndentData::Dumper::Indent
0000s0sData::Dumper::::MaxdepthData::Dumper::Maxdepth
0000s0sData::Dumper::::MaxrecurseData::Dumper::Maxrecurse
0000s0sData::Dumper::::NamesData::Dumper::Names
0000s0sData::Dumper::::PadData::Dumper::Pad
0000s0sData::Dumper::::PairData::Dumper::Pair
0000s0sData::Dumper::::PurityData::Dumper::Purity
0000s0sData::Dumper::::QuotekeysData::Dumper::Quotekeys
0000s0sData::Dumper::::ResetData::Dumper::Reset
0000s0sData::Dumper::::SeenData::Dumper::Seen
0000s0sData::Dumper::::SortkeysData::Dumper::Sortkeys
0000s0sData::Dumper::::SparseseenData::Dumper::Sparseseen
0000s0sData::Dumper::::TerseData::Dumper::Terse
0000s0sData::Dumper::::ToasterData::Dumper::Toaster
0000s0sData::Dumper::::TrailingcommaData::Dumper::Trailingcomma
0000s0sData::Dumper::::UseperlData::Dumper::Useperl
0000s0sData::Dumper::::UseqqData::Dumper::Useqq
0000s0sData::Dumper::::ValuesData::Dumper::Values
0000s0sData::Dumper::::VarnameData::Dumper::Varname
0000s0sData::Dumper::::_compose_outData::Dumper::_compose_out
0000s0sData::Dumper::::_dumpData::Dumper::_dump
0000s0sData::Dumper::::_quoteData::Dumper::_quote
0000s0sData::Dumper::::_refine_nameData::Dumper::_refine_name
0000s0sData::Dumper::::_sortkeysData::Dumper::_sortkeys
0000s0sData::Dumper::::format_refaddrData::Dumper::format_refaddr
0000s0sData::Dumper::::init_refaddr_formatData::Dumper::init_refaddr_format
0000s0sData::Dumper::::newData::Dumper::new
0000s0sData::Dumper::::qquoteData::Dumper::qquote
Call graph for these subroutines as a Graphviz dot language file.
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
10package Data::Dumper;
11
12
# spent 10µs within Data::Dumper::BEGIN@12 which was called: # once (10µs+0s) by main::BEGIN@32 at line 14
BEGIN {
13115µs $VERSION = '2.167'; # Don't forget to set version and release
14137µs110µs} # date in POD below!
# spent 10µs making 1 call to Data::Dumper::BEGIN@12
15
16#$| = 1;
17
18253µs114µs
# spent 14µs within Data::Dumper::BEGIN@18 which was called: # once (14µs+0s) by main::BEGIN@32 at line 18
use 5.006_001;
# spent 14µs making 1 call to Data::Dumper::BEGIN@18
191700nsrequire Exporter;
20
21283µs14µs
# spent 4µs within Data::Dumper::BEGIN@21 which was called: # once (4µs+0s) by main::BEGIN@32 at line 21
use Carp ();
# spent 4µs making 1 call to Data::Dumper::BEGIN@21
22
23
# spent 172µs (21+151) within Data::Dumper::BEGIN@23 which was called: # once (21µs+151µs) by main::BEGIN@32 at line 37
BEGIN {
2419µs @ISA = qw(Exporter);
251500ns @EXPORT = qw(Dumper);
261300ns @EXPORT_OK = qw(DumperX);
27
28 # if run under miniperl, or otherwise lacking dynamic loading,
29 # XSLoader should be attempted to load, or the pure perl flag
30 # toggled on load failure.
3113µs eval {
321500ns require XSLoader;
331158µs1151µs XSLoader::load( 'Data::Dumper' );
# spent 151µs making 1 call to XSLoader::load
341700ns 1
35 }
36 or $Useperl = 1;
3711.24ms1172µs}
# spent 172µs making 1 call to Data::Dumper::BEGIN@23
38
391800nsmy $IS_ASCII = ord 'A' == 65;
40
41# module vars and their defaults
421400ns$Indent = 2 unless defined $Indent;
431200ns$Trailingcomma = 0 unless defined $Trailingcomma;
441200ns$Purity = 0 unless defined $Purity;
451300ns$Pad = "" unless defined $Pad;
461200ns$Varname = "VAR" unless defined $Varname;
471100ns$Useqq = 0 unless defined $Useqq;
481100ns$Terse = 0 unless defined $Terse;
491200ns$Freezer = "" unless defined $Freezer;
501200ns$Toaster = "" unless defined $Toaster;
511100ns$Deepcopy = 0 unless defined $Deepcopy;
521200ns$Quotekeys = 1 unless defined $Quotekeys;
531200ns$Bless = "bless" unless defined $Bless;
54#$Expdepth = 0 unless defined $Expdepth;
551200ns$Maxdepth = 0 unless defined $Maxdepth;
561200ns$Pair = ' => ' unless defined $Pair;
571100ns$Useperl = 0 unless defined $Useperl;
581100ns$Sortkeys = 0 unless defined $Sortkeys;
591100ns$Deparse = 0 unless defined $Deparse;
601100ns$Sparseseen = 0 unless defined $Sparseseen;
611100ns$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#
69sub new {
70 my($c, $v, $n) = @_;
71
72 Carp::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 trailingcomma => $Trailingcomma, # whether to add comma after last elem
80 pad => $Pad, # all lines prefixed by this string
81 xpad => "", # padding-per-level
82 apad => "", # added padding for hash keys n such
83 sep => "", # list separator
84 pair => $Pair, # hash key/value separator: defaults to ' => '
85 seen => {}, # local (nested) refs (id => [name, val])
86 todump => $v, # values to dump []
87 names => $n, # optional names for values []
88 varname => $Varname, # prefix to use for tagging nameless ones
89 purity => $Purity, # degree to which output is evalable
90 useqq => $Useqq, # use "" for strings (backslashitis ensues)
91 terse => $Terse, # avoid name output (where feasible)
92 freezer => $Freezer, # name of Freezer method for objects
93 toaster => $Toaster, # name of method to revive objects
94 deepcopy => $Deepcopy, # do not cross-ref, except to stop recursion
95 quotekeys => $Quotekeys, # quote hash keys
96 'bless' => $Bless, # keyword to use for "bless"
97# expdepth => $Expdepth, # cutoff depth for explicit dumping
98 maxdepth => $Maxdepth, # depth beyond which we give up
99 maxrecurse => $Maxrecurse, # depth beyond which we abort
100 useperl => $Useperl, # use the pure Perl implementation
101 sortkeys => $Sortkeys, # flag or filter for sorting hash keys
102 deparse => $Deparse, # use B::Deparse for coderefs
103 noseen => $Sparseseen, # do not populate the seen hash unless necessary
104 };
105
106 if ($Indent > 0) {
107 $s->{xpad} = " ";
108 $s->{sep} = "\n";
109 }
110 return bless($s, $c);
111}
112
113# Packed numeric addresses take less memory. Plus pack is faster than sprintf
114
115# Most users of current versions of Data::Dumper will be 5.008 or later.
116# Anyone on 5.6.1 and 5.6.2 upgrading will be rare (particularly judging by
117# the bug reports from users on those platforms), so for the common case avoid
118# complexity, and avoid even compiling the unneeded code.
119
120sub init_refaddr_format {
121}
122
123sub format_refaddr {
124 require Scalar::Util;
125 pack "J", Scalar::Util::refaddr(shift);
126};
127
1281800nsif ($] < 5.008) {
129 eval <<'EOC' or die;
130 no warnings 'redefine';
131 my $refaddr_format;
132 sub init_refaddr_format {
133 require Config;
134 my $f = $Config::Config{uvxformat};
135 $f =~ tr/"//d;
136 $refaddr_format = "0x%" . $f;
137 }
138
139 sub format_refaddr {
140 require Scalar::Util;
141 sprintf $refaddr_format, Scalar::Util::refaddr(shift);
142 }
143
144 1
145EOC
146}
147
148#
149# add-to or query the table of already seen references
150#
151sub Seen {
152 my($s, $g) = @_;
153 if (defined($g) && (ref($g) eq 'HASH')) {
154 init_refaddr_format();
155 my($k, $v, $id);
156 while (($k, $v) = each %$g) {
157 if (defined $v) {
158 if (ref $v) {
159 $id = format_refaddr($v);
160 if ($k =~ /^[*](.*)$/) {
161 $k = (ref $v eq 'ARRAY') ? ( "\\\@" . $1 ) :
162 (ref $v eq 'HASH') ? ( "\\\%" . $1 ) :
163 (ref $v eq 'CODE') ? ( "\\\&" . $1 ) :
164 ( "\$" . $1 ) ;
165 }
166 elsif ($k !~ /^\$/) {
167 $k = "\$" . $k;
168 }
169 $s->{seen}{$id} = [$k, $v];
170 }
171 else {
172 Carp::carp("Only refs supported, ignoring non-ref item \$$k");
173 }
174 }
175 else {
176 Carp::carp("Value of ref must be defined; ignoring undefined item \$$k");
177 }
178 }
179 return $s;
180 }
181 else {
182 return map { @$_ } values %{$s->{seen}};
183 }
184}
185
186#
187# set or query the values to be dumped
188#
189sub Values {
190 my($s, $v) = @_;
191 if (defined($v)) {
192 if (ref($v) eq 'ARRAY') {
193 $s->{todump} = [@$v]; # make a copy
194 return $s;
195 }
196 else {
197 Carp::croak("Argument to Values, if provided, must be array ref");
198 }
199 }
200 else {
201 return @{$s->{todump}};
202 }
203}
204
205#
206# set or query the names of the values to be dumped
207#
208sub Names {
209 my($s, $n) = @_;
210 if (defined($n)) {
211 if (ref($n) eq 'ARRAY') {
212 $s->{names} = [@$n]; # make a copy
213 return $s;
214 }
215 else {
216 Carp::croak("Argument to Names, if provided, must be array ref");
217 }
218 }
219 else {
220 return @{$s->{names}};
221 }
222}
223
224sub DESTROY {}
225
226sub Dump {
227 return &Dumpxs
228 unless $Data::Dumper::Useperl || (ref($_[0]) && $_[0]->{useperl})
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#
239sub 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)
269sub _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.
27722.67ms32.18ms
# spent 2.10ms (1.56+540µs) within Data::Dumper::BEGIN@277 which was called: # once (1.56ms+540µs) by main::BEGIN@32 at line 277
use constant _bad_vsmg => defined &_vstring && (_vstring(~v0)||'') eq "v0";
# spent 2.10ms making 1 call to Data::Dumper::BEGIN@277 # spent 70µs making 1 call to constant::import # spent 3µ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#
285sub _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 .= ","
417 if $i++ < $#$val
418 || ($s->{trailingcomma} && $s->{indent} >= 1);
419 }
420 $out .= $pad . ($s->{xpad} x ($s->{level} - 1)) if $i;
421 $out .= ($name =~ /^\@/) ? ')' : ']';
422 }
423 elsif ($realtype eq 'HASH') {
424 my ($k, $v, $pad, $lpad, $mname, $pair);
425 $out .= ($name =~ /^\%/) ? '(' : '{';
426 $pad = $s->{sep} . $s->{pad} . $s->{apad};
427 $lpad = $s->{apad};
428 $pair = $s->{pair};
429 ($name =~ /^\%(.*)$/) ? ($mname = "\$" . $1) :
430 # omit -> if $foo->[0]->{bar}, but not ${$foo->[0]}->{bar}
431 ($name =~ /^\\?[\%\@\*\$][^{].*[]}]$/) ? ($mname = $name) :
432 ($mname = $name . '->');
433 $mname .= '->' if $mname =~ /^\*.+\{[A-Z]+\}$/;
434 my $sortkeys = defined($s->{sortkeys}) ? $s->{sortkeys} : '';
435 my $keys = [];
436 if ($sortkeys) {
437 if (ref($s->{sortkeys}) eq 'CODE') {
438 $keys = $s->{sortkeys}($val);
439 unless (ref($keys) eq 'ARRAY') {
440 Carp::carp("Sortkeys subroutine did not return ARRAYREF");
441 $keys = [];
442 }
443 }
444 else {
445 $keys = [ sort keys %$val ];
446 }
447 }
448
449 # Ensure hash iterator is reset
450 keys(%$val);
451
452 my $key;
453 while (($k, $v) = ! $sortkeys ? (each %$val) :
454 @$keys ? ($key = shift(@$keys), $val->{$key}) :
455 () )
456 {
457 my $nk = $s->_dump($k, "");
458
459 # _dump doesn't quote numbers of this form
460 if ($s->{quotekeys} && $nk =~ /^(?:0|-?[1-9][0-9]{0,8})\z/) {
461 $nk = $s->{useqq} ? qq("$nk") : qq('$nk');
462 }
463 elsif (!$s->{quotekeys} and $nk =~ /^[\"\']([A-Za-z_]\w*)[\"\']$/) {
464 $nk = $1
465 }
466
467 $sname = $mname . '{' . $nk . '}';
468 $out .= $pad . $ipad . $nk . $pair;
469
470 # temporarily alter apad
471 $s->{apad} .= (" " x (length($nk) + 4))
472 if $s->{indent} >= 2;
473 $out .= $s->_dump($val->{$k}, $sname) . ",";
474 $s->{apad} = $lpad
475 if $s->{indent} >= 2;
476 }
477 if (substr($out, -1) eq ',') {
478 chop $out if !$s->{trailingcomma} || !$s->{indent};
479 $out .= $pad . ($s->{xpad} x ($s->{level} - 1));
480 }
481 $out .= ($name =~ /^\%/) ? ')' : '}';
482 }
483 elsif ($realtype eq 'CODE') {
484 if ($s->{deparse}) {
485 require B::Deparse;
486 my $sub = 'sub ' . (B::Deparse->new)->coderef2text($val);
487 $pad = $s->{sep} . $s->{pad} . $s->{apad} . $s->{xpad} x ($s->{level} - 1);
488 $sub =~ s/\n/$pad/gs;
489 $out .= $sub;
490 }
491 else {
492 $out .= 'sub { "DUMMY" }';
493 Carp::carp("Encountered CODE ref, using dummy placeholder") if $s->{purity};
494 }
495 }
496 else {
497 Carp::croak("Can't handle '$realtype' type");
498 }
499
500 if ($realpack and !$no_bless) { # we have a blessed ref
501 $out .= ', ' . _quote($realpack) . ' )';
502 $out .= '->' . $s->{toaster} . '()'
503 if $s->{toaster} ne '';
504 $s->{apad} = $blesspad;
505 }
506 $s->{level}--;
507 }
508 else { # simple scalar
509
510 my $ref = \$_[1];
511 my $v;
512 # first, catalog the scalar
513 if ($name ne '') {
514 $id = format_refaddr($ref);
515 if (exists $s->{seen}{$id}) {
516 if ($s->{seen}{$id}[2]) {
517 $out = $s->{seen}{$id}[0];
518 #warn "[<$out]\n";
519 return "\${$out}";
520 }
521 }
522 else {
523 #warn "[>\\$name]\n";
524 $s->{seen}{$id} = ["\\$name", $ref];
525 }
526 }
527 $ref = \$val;
528 if (ref($ref) eq 'GLOB') { # glob
529 my $name = substr($val, 1);
530 if ($name =~ /^[A-Za-z_][\w:]*$/ && $name ne 'main::') {
531 $name =~ s/^main::/::/;
532 $sname = $name;
533 }
534 else {
535 $sname = $s->_dump(
536 $name eq 'main::' || $] < 5.007 && $name eq "main::\0"
537 ? ''
538 : $name,
539 "",
540 );
541 $sname = '{' . $sname . '}';
542 }
543 if ($s->{purity}) {
544 my $k;
545 local ($s->{level}) = 0;
546 for $k (qw(SCALAR ARRAY HASH)) {
547 my $gval = *$val{$k};
548 next unless defined $gval;
549 next if $k eq "SCALAR" && ! defined $$gval; # always there
550
551 # _dump can push into @post, so we hold our place using $postlen
552 my $postlen = scalar @post;
553 $post[$postlen] = "\*$sname = ";
554 local ($s->{apad}) = " " x length($post[$postlen]) if $s->{indent} >= 2;
555 $post[$postlen] .= $s->_dump($gval, "\*$sname\{$k\}");
556 }
557 }
558 $out .= '*' . $sname;
559 }
560 elsif (!defined($val)) {
561 $out .= "undef";
562 }
563 elsif (defined &_vstring and $v = _vstring($val)
564 and !_bad_vsmg || eval $v eq $val) {
565 $out .= $v;
566 }
567 elsif (!defined &_vstring
568 and ref $ref eq 'VSTRING' || eval{Scalar::Util::isvstring($val)}) {
569 $out .= sprintf "%vd", $val;
570 }
571 # \d here would treat "1\x{660}" as a safe decimal number
572 elsif ($val =~ /^(?:0|-?[1-9][0-9]{0,8})\z/) { # safe decimal number
573 $out .= $val;
574 }
575 else { # string
576 if ($s->{useqq} or $val =~ tr/\0-\377//c) {
577 # Fall back to qq if there's Unicode
578 $out .= qquote($val, $s->{useqq});
579 }
580 else {
581 $out .= _quote($val);
582 }
583 }
584 }
585 if ($id) {
586 # if we made it this far, $id was added to seen list at current
587 # level, so remove it to get deep copies
588 if ($s->{deepcopy}) {
589 delete($s->{seen}{$id});
590 }
591 elsif ($name) {
592 $s->{seen}{$id}[2] = 1;
593 }
594 }
595 return $out;
596}
597
598#
599# non-OO style of earlier version
600#
601sub Dumper {
602 return Data::Dumper->Dump([@_]);
603}
604
605# compat stub
606sub DumperX {
607 return Data::Dumper->Dumpxs([@_], []);
608}
609
610#
611# reset the "seen" cache
612#
613sub Reset {
614 my($s) = shift;
615 $s->{seen} = {};
616 return $s;
617}
618
619sub Indent {
620 my($s, $v) = @_;
621 if (defined($v)) {
622 if ($v == 0) {
623 $s->{xpad} = "";
624 $s->{sep} = "";
625 }
626 else {
627 $s->{xpad} = " ";
628 $s->{sep} = "\n";
629 }
630 $s->{indent} = $v;
631 return $s;
632 }
633 else {
634 return $s->{indent};
635 }
636}
637
638sub Trailingcomma {
639 my($s, $v) = @_;
640 defined($v) ? (($s->{trailingcomma} = $v), return $s) : $s->{trailingcomma};
641}
642
643sub Pair {
644 my($s, $v) = @_;
645 defined($v) ? (($s->{pair} = $v), return $s) : $s->{pair};
646}
647
648sub Pad {
649 my($s, $v) = @_;
650 defined($v) ? (($s->{pad} = $v), return $s) : $s->{pad};
651}
652
653sub Varname {
654 my($s, $v) = @_;
655 defined($v) ? (($s->{varname} = $v), return $s) : $s->{varname};
656}
657
658sub Purity {
659 my($s, $v) = @_;
660 defined($v) ? (($s->{purity} = $v), return $s) : $s->{purity};
661}
662
663sub Useqq {
664 my($s, $v) = @_;
665 defined($v) ? (($s->{useqq} = $v), return $s) : $s->{useqq};
666}
667
668sub Terse {
669 my($s, $v) = @_;
670 defined($v) ? (($s->{terse} = $v), return $s) : $s->{terse};
671}
672
673sub Freezer {
674 my($s, $v) = @_;
675 defined($v) ? (($s->{freezer} = $v), return $s) : $s->{freezer};
676}
677
678sub Toaster {
679 my($s, $v) = @_;
680 defined($v) ? (($s->{toaster} = $v), return $s) : $s->{toaster};
681}
682
683sub Deepcopy {
684 my($s, $v) = @_;
685 defined($v) ? (($s->{deepcopy} = $v), return $s) : $s->{deepcopy};
686}
687
688sub Quotekeys {
689 my($s, $v) = @_;
690 defined($v) ? (($s->{quotekeys} = $v), return $s) : $s->{quotekeys};
691}
692
693sub Bless {
694 my($s, $v) = @_;
695 defined($v) ? (($s->{'bless'} = $v), return $s) : $s->{'bless'};
696}
697
698sub Maxdepth {
699 my($s, $v) = @_;
700 defined($v) ? (($s->{'maxdepth'} = $v), return $s) : $s->{'maxdepth'};
701}
702
703sub Maxrecurse {
704 my($s, $v) = @_;
705 defined($v) ? (($s->{'maxrecurse'} = $v), return $s) : $s->{'maxrecurse'};
706}
707
708sub Useperl {
709 my($s, $v) = @_;
710 defined($v) ? (($s->{'useperl'} = $v), return $s) : $s->{'useperl'};
711}
712
713sub Sortkeys {
714 my($s, $v) = @_;
715 defined($v) ? (($s->{'sortkeys'} = $v), return $s) : $s->{'sortkeys'};
716}
717
718sub Deparse {
719 my($s, $v) = @_;
720 defined($v) ? (($s->{'deparse'} = $v), return $s) : $s->{'deparse'};
721}
722
723sub Sparseseen {
724 my($s, $v) = @_;
725 defined($v) ? (($s->{'noseen'} = $v), return $s) : $s->{'noseen'};
726}
727
728# used by qquote below
72913µsmy %esc = (
730 "\a" => "\\a",
731 "\b" => "\\b",
732 "\t" => "\\t",
733 "\n" => "\\n",
734 "\f" => "\\f",
735 "\r" => "\\r",
736 "\e" => "\\e",
737);
738
73918µs12µsmy $low_controls = ($IS_ASCII)
# spent 2µs making 1 call to Data::Dumper::CORE:qr
740
741 # This includes \177, because traditionally it has been
742 # output as octal, even though it isn't really a "low"
743 # control
744 ? qr/[\0-\x1f\177]/
745
746 # EBCDIC low controls.
747 : qr/[\0-\x3f]/;
748
749# put a string value in double quotes
750sub qquote {
751 local($_) = shift;
752 s/([\\\"\@\$])/\\$1/g;
753
754 # This efficiently changes the high ordinal characters to \x{} if the utf8
755 # flag is on. On ASCII platforms, the high ordinals are all the
756 # non-ASCII's. On EBCDIC platforms, we don't include in these the non-ASCII
757 # controls whose ordinals are less than SPACE, excluded below by the range
758 # \0-\x3f. On ASCII platforms this range just compiles as part of :ascii:.
759 # On EBCDIC platforms, there is just one outlier high ordinal control, and
760 # it gets output as \x{}.
7612762µs2219µs
# spent 216µs (214+3) within Data::Dumper::BEGIN@761 which was called: # once (214µs+3µs) by main::BEGIN@32 at line 761
my $bytes; { use bytes; $bytes = length }
# spent 216µs making 1 call to Data::Dumper::BEGIN@761 # spent 2µs making 1 call to bytes::import
762 s/([^[:ascii:]\0-\x3f])/sprintf("\\x{%x}",ord($1))/ge
763 if $bytes > length
764 || (! $IS_ASCII && $] ge 5.008_001 && utf8::is_utf8($_));
765
- -
771 return qq("$_") unless /[[:^print:]]/; # fast exit if only printables
772
773 # Here, there is at least one non-printable to output. First, translate the
774 # escapes.
775 s/([\a\b\t\n\f\r\e])/$esc{$1}/g;
776
777 # no need for 3 digits in escape for octals not followed by a digit.
778 s/($low_controls)(?!\d)/'\\'.sprintf('%o',ord($1))/eg;
779
780 # But otherwise use 3 digits
781 s/($low_controls)/'\\'.sprintf('%03o',ord($1))/eg;
782
783 # all but last branch below not supported --BEHAVIOR SUBJECT TO CHANGE--
784 my $high = shift || "";
785 if ($high eq "iso8859") { # Doesn't escape the Latin1 printables
786 if ($IS_ASCII) {
787 s/([\200-\240])/'\\'.sprintf('%o',ord($1))/eg;
788 }
789 elsif ($] ge 5.007_003) {
790 my $high_control = utf8::unicode_to_native(0x9F);
791 s/$high_control/sprintf('\\%o',ord($1))/eg;
792 }
793 } elsif ($high eq "utf8") {
794# Some discussion of what to do here is in
795# https://rt.perl.org/Ticket/Display.html?id=113088
796# use utf8;
797# $str =~ s/([^\040-\176])/sprintf "\\x{%04x}", ord($1)/ge;
798 } elsif ($high eq "8bit") {
799 # leave it as it is
800 } else {
801 s/([[:^ascii:]])/'\\'.sprintf('%03o',ord($1))/eg;
802 #s/([^\040-\176])/sprintf "\\x{%04x}", ord($1)/ge;
803 }
804
805 return qq("$_");
806}
807
808# helper sub to sort hash keys in Perl < 5.8.0 where we don't have
809# access to sortsv() from XS
810sub _sortkeys { [ sort keys %{$_[0]} ] }
811
812sub _refine_name {
813 my $s = shift;
814 my ($name, $val, $i) = @_;
815 if (defined $name) {
816 if ($name =~ /^[*](.*)$/) {
817 if (defined $val) {
818 $name = (ref $val eq 'ARRAY') ? ( "\@" . $1 ) :
819 (ref $val eq 'HASH') ? ( "\%" . $1 ) :
820 (ref $val eq 'CODE') ? ( "\*" . $1 ) :
821 ( "\$" . $1 ) ;
822 }
823 else {
824 $name = "\$" . $1;
825 }
826 }
827 elsif ($name !~ /^\$/) {
828 $name = "\$" . $name;
829 }
830 }
831 else { # no names provided
832 $name = "\$" . $s->{varname} . $i;
833 }
834 return $name;
835}
836
837sub _compose_out {
838 my $s = shift;
839 my ($valstr, $postref) = @_;
840 my $out = "";
841 $out .= $s->{pad} . $valstr . $s->{sep};
842 if (@{$postref}) {
843 $out .= $s->{pad} .
844 join(';' . $s->{sep} . $s->{pad}, @{$postref}) .
845 ';' .
846 $s->{sep};
847 }
848 return $out;
849}
850
851113µs1;
852__END__
 
# spent 2µs within Data::Dumper::CORE:qr which was called: # once (2µs+0s) by main::BEGIN@32 at line 739
sub Data::Dumper::CORE:qr; # opcode
# spent 3µs within Data::Dumper::_vstring which was called: # once (3µs+0s) by Data::Dumper::BEGIN@277 at line 277
sub Data::Dumper::_vstring; # xsub
Report produced by the NYTProf 6.04 Perl profiler, developed by Tim Bunce based on work by Adam Kaplan and Salvador Fandiño García.