← Index
NYTProf Performance Profile   « line view »
For /usr/local/libexec/sympa/task_manager-debug.pl
  Run on Tue Jun 1 22:32:51 2021
Reported on Tue Jun 1 22:35:15 2021

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