Leaked source code of windows server 2003
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

1048 lines
31 KiB

  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. package Data::Dumper;
  10. $VERSION = '2.102';
  11. #$| = 1;
  12. require 5.005_64;
  13. require Exporter;
  14. use XSLoader ();
  15. require overload;
  16. use Carp;
  17. @ISA = qw(Exporter);
  18. @EXPORT = qw(Dumper);
  19. @EXPORT_OK = qw(DumperX);
  20. XSLoader::load 'Data::Dumper';
  21. # module vars and their defaults
  22. $Indent = 2 unless defined $Indent;
  23. $Purity = 0 unless defined $Purity;
  24. $Pad = "" unless defined $Pad;
  25. $Varname = "VAR" unless defined $Varname;
  26. $Useqq = 0 unless defined $Useqq;
  27. $Terse = 0 unless defined $Terse;
  28. $Freezer = "" unless defined $Freezer;
  29. $Toaster = "" unless defined $Toaster;
  30. $Deepcopy = 0 unless defined $Deepcopy;
  31. $Quotekeys = 1 unless defined $Quotekeys;
  32. $Bless = "bless" unless defined $Bless;
  33. #$Expdepth = 0 unless defined $Expdepth;
  34. $Maxdepth = 0 unless defined $Maxdepth;
  35. #
  36. # expects an arrayref of values to be dumped.
  37. # can optionally pass an arrayref of names for the values.
  38. # names must have leading $ sign stripped. begin the name with *
  39. # to cause output of arrays and hashes rather than refs.
  40. #
  41. sub new {
  42. my($c, $v, $n) = @_;
  43. croak "Usage: PACKAGE->new(ARRAYREF, [ARRAYREF])"
  44. unless (defined($v) && (ref($v) eq 'ARRAY'));
  45. $n = [] unless (defined($n) && (ref($v) eq 'ARRAY'));
  46. my($s) = {
  47. level => 0, # current recursive depth
  48. indent => $Indent, # various styles of indenting
  49. pad => $Pad, # all lines prefixed by this string
  50. xpad => "", # padding-per-level
  51. apad => "", # added padding for hash keys n such
  52. sep => "", # list separator
  53. seen => {}, # local (nested) refs (id => [name, val])
  54. todump => $v, # values to dump []
  55. names => $n, # optional names for values []
  56. varname => $Varname, # prefix to use for tagging nameless ones
  57. purity => $Purity, # degree to which output is evalable
  58. useqq => $Useqq, # use "" for strings (backslashitis ensues)
  59. terse => $Terse, # avoid name output (where feasible)
  60. freezer => $Freezer, # name of Freezer method for objects
  61. toaster => $Toaster, # name of method to revive objects
  62. deepcopy => $Deepcopy, # dont cross-ref, except to stop recursion
  63. quotekeys => $Quotekeys, # quote hash keys
  64. 'bless' => $Bless, # keyword to use for "bless"
  65. # expdepth => $Expdepth, # cutoff depth for explicit dumping
  66. maxdepth => $Maxdepth, # depth beyond which we give up
  67. };
  68. if ($Indent > 0) {
  69. $s->{xpad} = " ";
  70. $s->{sep} = "\n";
  71. }
  72. return bless($s, $c);
  73. }
  74. #
  75. # add-to or query the table of already seen references
  76. #
  77. sub Seen {
  78. my($s, $g) = @_;
  79. if (defined($g) && (ref($g) eq 'HASH')) {
  80. my($k, $v, $id);
  81. while (($k, $v) = each %$g) {
  82. if (defined $v and ref $v) {
  83. ($id) = (overload::StrVal($v) =~ /\((.*)\)$/);
  84. if ($k =~ /^[*](.*)$/) {
  85. $k = (ref $v eq 'ARRAY') ? ( "\\\@" . $1 ) :
  86. (ref $v eq 'HASH') ? ( "\\\%" . $1 ) :
  87. (ref $v eq 'CODE') ? ( "\\\&" . $1 ) :
  88. ( "\$" . $1 ) ;
  89. }
  90. elsif ($k !~ /^\$/) {
  91. $k = "\$" . $k;
  92. }
  93. $s->{seen}{$id} = [$k, $v];
  94. }
  95. else {
  96. carp "Only refs supported, ignoring non-ref item \$$k";
  97. }
  98. }
  99. return $s;
  100. }
  101. else {
  102. return map { @$_ } values %{$s->{seen}};
  103. }
  104. }
  105. #
  106. # set or query the values to be dumped
  107. #
  108. sub Values {
  109. my($s, $v) = @_;
  110. if (defined($v) && (ref($v) eq 'ARRAY')) {
  111. $s->{todump} = [@$v]; # make a copy
  112. return $s;
  113. }
  114. else {
  115. return @{$s->{todump}};
  116. }
  117. }
  118. #
  119. # set or query the names of the values to be dumped
  120. #
  121. sub Names {
  122. my($s, $n) = @_;
  123. if (defined($n) && (ref($n) eq 'ARRAY')) {
  124. $s->{names} = [@$n]; # make a copy
  125. return $s;
  126. }
  127. else {
  128. return @{$s->{names}};
  129. }
  130. }
  131. sub DESTROY {}
  132. sub Dump {
  133. return &Dumpxs
  134. unless $Data::Dumper::Useqq || (ref($_[0]) && $_[0]->{useqq});
  135. return &Dumpperl;
  136. }
  137. #
  138. # dump the refs in the current dumper object.
  139. # expects same args as new() if called via package name.
  140. #
  141. sub Dumpperl {
  142. my($s) = shift;
  143. my(@out, $val, $name);
  144. my($i) = 0;
  145. local(@post);
  146. $s = $s->new(@_) unless ref $s;
  147. for $val (@{$s->{todump}}) {
  148. my $out = "";
  149. @post = ();
  150. $name = $s->{names}[$i++];
  151. if (defined $name) {
  152. if ($name =~ /^[*](.*)$/) {
  153. if (defined $val) {
  154. $name = (ref $val eq 'ARRAY') ? ( "\@" . $1 ) :
  155. (ref $val eq 'HASH') ? ( "\%" . $1 ) :
  156. (ref $val eq 'CODE') ? ( "\*" . $1 ) :
  157. ( "\$" . $1 ) ;
  158. }
  159. else {
  160. $name = "\$" . $1;
  161. }
  162. }
  163. elsif ($name !~ /^\$/) {
  164. $name = "\$" . $name;
  165. }
  166. }
  167. else {
  168. $name = "\$" . $s->{varname} . $i;
  169. }
  170. my $valstr;
  171. {
  172. local($s->{apad}) = $s->{apad};
  173. $s->{apad} .= ' ' x (length($name) + 3) if $s->{indent} >= 2;
  174. $valstr = $s->_dump($val, $name);
  175. }
  176. $valstr = "$name = " . $valstr . ';' if @post or !$s->{terse};
  177. $out .= $s->{pad} . $valstr . $s->{sep};
  178. $out .= $s->{pad} . join(';' . $s->{sep} . $s->{pad}, @post)
  179. . ';' . $s->{sep} if @post;
  180. push @out, $out;
  181. }
  182. return wantarray ? @out : join('', @out);
  183. }
  184. #
  185. # twist, toil and turn;
  186. # and recurse, of course.
  187. #
  188. sub _dump {
  189. my($s, $val, $name) = @_;
  190. my($sname);
  191. my($out, $realpack, $realtype, $type, $ipad, $id, $blesspad);
  192. $type = ref $val;
  193. $out = "";
  194. if ($type) {
  195. # prep it, if it looks like an object
  196. if (my $freezer = $s->{freezer}) {
  197. $val->$freezer() if UNIVERSAL::can($val, $freezer);
  198. }
  199. ($realpack, $realtype, $id) =
  200. (overload::StrVal($val) =~ /^(?:(.*)\=)?([^=]*)\(([^\(]*)\)$/);
  201. # if it has a name, we need to either look it up, or keep a tab
  202. # on it so we know when we hit it later
  203. if (defined($name) and length($name)) {
  204. # keep a tab on it so that we dont fall into recursive pit
  205. if (exists $s->{seen}{$id}) {
  206. # if ($s->{expdepth} < $s->{level}) {
  207. if ($s->{purity} and $s->{level} > 0) {
  208. $out = ($realtype eq 'HASH') ? '{}' :
  209. ($realtype eq 'ARRAY') ? '[]' :
  210. 'do{my $o}' ;
  211. push @post, $name . " = " . $s->{seen}{$id}[0];
  212. }
  213. else {
  214. $out = $s->{seen}{$id}[0];
  215. if ($name =~ /^([\@\%])/) {
  216. my $start = $1;
  217. if ($out =~ /^\\$start/) {
  218. $out = substr($out, 1);
  219. }
  220. else {
  221. $out = $start . '{' . $out . '}';
  222. }
  223. }
  224. }
  225. return $out;
  226. # }
  227. }
  228. else {
  229. # store our name
  230. $s->{seen}{$id} = [ (($name =~ /^[@%]/) ? ('\\' . $name ) :
  231. ($realtype eq 'CODE' and
  232. $name =~ /^[*](.*)$/) ? ('\\&' . $1 ) :
  233. $name ),
  234. $val ];
  235. }
  236. }
  237. if ($realpack and $realpack eq 'Regexp') {
  238. $out = "$val";
  239. $out =~ s,/,\\/,g;
  240. return "qr/$out/";
  241. }
  242. # If purity is not set and maxdepth is set, then check depth:
  243. # if we have reached maximum depth, return the string
  244. # representation of the thing we are currently examining
  245. # at this depth (i.e., 'Foo=ARRAY(0xdeadbeef)').
  246. if (!$s->{purity}
  247. and $s->{maxdepth} > 0
  248. and $s->{level} >= $s->{maxdepth})
  249. {
  250. return qq['$val'];
  251. }
  252. # we have a blessed ref
  253. if ($realpack) {
  254. $out = $s->{'bless'} . '( ';
  255. $blesspad = $s->{apad};
  256. $s->{apad} .= ' ' if ($s->{indent} >= 2);
  257. }
  258. $s->{level}++;
  259. $ipad = $s->{xpad} x $s->{level};
  260. if ($realtype eq 'SCALAR' || $realtype eq 'REF') {
  261. if ($realpack) {
  262. $out .= 'do{\\(my $o = ' . $s->_dump($$val, "\${$name}") . ')}';
  263. }
  264. else {
  265. $out .= '\\' . $s->_dump($$val, "\${$name}");
  266. }
  267. }
  268. elsif ($realtype eq 'GLOB') {
  269. $out .= '\\' . $s->_dump($$val, "*{$name}");
  270. }
  271. elsif ($realtype eq 'ARRAY') {
  272. my($v, $pad, $mname);
  273. my($i) = 0;
  274. $out .= ($name =~ /^\@/) ? '(' : '[';
  275. $pad = $s->{sep} . $s->{pad} . $s->{apad};
  276. ($name =~ /^\@(.*)$/) ? ($mname = "\$" . $1) :
  277. # omit -> if $foo->[0]->{bar}, but not ${$foo->[0]}->{bar}
  278. ($name =~ /^\\?[\%\@\*\$][^{].*[]}]$/) ? ($mname = $name) :
  279. ($mname = $name . '->');
  280. $mname .= '->' if $mname =~ /^\*.+\{[A-Z]+\}$/;
  281. for $v (@$val) {
  282. $sname = $mname . '[' . $i . ']';
  283. $out .= $pad . $ipad . '#' . $i if $s->{indent} >= 3;
  284. $out .= $pad . $ipad . $s->_dump($v, $sname);
  285. $out .= "," if $i++ < $#$val;
  286. }
  287. $out .= $pad . ($s->{xpad} x ($s->{level} - 1)) if $i;
  288. $out .= ($name =~ /^\@/) ? ')' : ']';
  289. }
  290. elsif ($realtype eq 'HASH') {
  291. my($k, $v, $pad, $lpad, $mname);
  292. $out .= ($name =~ /^\%/) ? '(' : '{';
  293. $pad = $s->{sep} . $s->{pad} . $s->{apad};
  294. $lpad = $s->{apad};
  295. ($name =~ /^\%(.*)$/) ? ($mname = "\$" . $1) :
  296. # omit -> if $foo->[0]->{bar}, but not ${$foo->[0]}->{bar}
  297. ($name =~ /^\\?[\%\@\*\$][^{].*[]}]$/) ? ($mname = $name) :
  298. ($mname = $name . '->');
  299. $mname .= '->' if $mname =~ /^\*.+\{[A-Z]+\}$/;
  300. while (($k, $v) = each %$val) {
  301. my $nk = $s->_dump($k, "");
  302. $nk = $1 if !$s->{quotekeys} and $nk =~ /^[\"\']([A-Za-z_]\w*)[\"\']$/;
  303. $sname = $mname . '{' . $nk . '}';
  304. $out .= $pad . $ipad . $nk . " => ";
  305. # temporarily alter apad
  306. $s->{apad} .= (" " x (length($nk) + 4)) if $s->{indent} >= 2;
  307. $out .= $s->_dump($val->{$k}, $sname) . ",";
  308. $s->{apad} = $lpad if $s->{indent} >= 2;
  309. }
  310. if (substr($out, -1) eq ',') {
  311. chop $out;
  312. $out .= $pad . ($s->{xpad} x ($s->{level} - 1));
  313. }
  314. $out .= ($name =~ /^\%/) ? ')' : '}';
  315. }
  316. elsif ($realtype eq 'CODE') {
  317. $out .= 'sub { "DUMMY" }';
  318. carp "Encountered CODE ref, using dummy placeholder" if $s->{purity};
  319. }
  320. else {
  321. croak "Can\'t handle $realtype type.";
  322. }
  323. if ($realpack) { # we have a blessed ref
  324. $out .= ', \'' . $realpack . '\'' . ' )';
  325. $out .= '->' . $s->{toaster} . '()' if $s->{toaster} ne '';
  326. $s->{apad} = $blesspad;
  327. }
  328. $s->{level}--;
  329. }
  330. else { # simple scalar
  331. my $ref = \$_[1];
  332. # first, catalog the scalar
  333. if ($name ne '') {
  334. ($id) = ("$ref" =~ /\(([^\(]*)\)$/);
  335. if (exists $s->{seen}{$id}) {
  336. if ($s->{seen}{$id}[2]) {
  337. $out = $s->{seen}{$id}[0];
  338. #warn "[<$out]\n";
  339. return "\${$out}";
  340. }
  341. }
  342. else {
  343. #warn "[>\\$name]\n";
  344. $s->{seen}{$id} = ["\\$name", $ref];
  345. }
  346. }
  347. if (ref($ref) eq 'GLOB' or "$ref" =~ /=GLOB\([^()]+\)$/) { # glob
  348. my $name = substr($val, 1);
  349. if ($name =~ /^[A-Za-z_][\w:]*$/) {
  350. $name =~ s/^main::/::/;
  351. $sname = $name;
  352. }
  353. else {
  354. $sname = $s->_dump($name, "");
  355. $sname = '{' . $sname . '}';
  356. }
  357. if ($s->{purity}) {
  358. my $k;
  359. local ($s->{level}) = 0;
  360. for $k (qw(SCALAR ARRAY HASH)) {
  361. my $gval = *$val{$k};
  362. next unless defined $gval;
  363. next if $k eq "SCALAR" && ! defined $$gval; # always there
  364. # _dump can push into @post, so we hold our place using $postlen
  365. my $postlen = scalar @post;
  366. $post[$postlen] = "\*$sname = ";
  367. local ($s->{apad}) = " " x length($post[$postlen]) if $s->{indent} >= 2;
  368. $post[$postlen] .= $s->_dump($gval, "\*$sname\{$k\}");
  369. }
  370. }
  371. $out .= '*' . $sname;
  372. }
  373. elsif (!defined($val)) {
  374. $out .= "undef";
  375. }
  376. elsif ($val =~ /^(?:0|-?[1-9]\d{0,8})$/) { # safe decimal number
  377. $out .= $val;
  378. }
  379. else { # string
  380. if ($s->{useqq}) {
  381. $out .= qquote($val, $s->{useqq});
  382. }
  383. else {
  384. $val =~ s/([\\\'])/\\$1/g;
  385. $out .= '\'' . $val . '\'';
  386. }
  387. }
  388. }
  389. if ($id) {
  390. # if we made it this far, $id was added to seen list at current
  391. # level, so remove it to get deep copies
  392. if ($s->{deepcopy}) {
  393. delete($s->{seen}{$id});
  394. }
  395. elsif ($name) {
  396. $s->{seen}{$id}[2] = 1;
  397. }
  398. }
  399. return $out;
  400. }
  401. #
  402. # non-OO style of earlier version
  403. #
  404. sub Dumper {
  405. return Data::Dumper->Dump([@_]);
  406. }
  407. # compat stub
  408. sub DumperX {
  409. return Data::Dumper->Dumpxs([@_], []);
  410. }
  411. sub Dumpf { return Data::Dumper->Dump(@_) }
  412. sub Dumpp { print Data::Dumper->Dump(@_) }
  413. #
  414. # reset the "seen" cache
  415. #
  416. sub Reset {
  417. my($s) = shift;
  418. $s->{seen} = {};
  419. return $s;
  420. }
  421. sub Indent {
  422. my($s, $v) = @_;
  423. if (defined($v)) {
  424. if ($v == 0) {
  425. $s->{xpad} = "";
  426. $s->{sep} = "";
  427. }
  428. else {
  429. $s->{xpad} = " ";
  430. $s->{sep} = "\n";
  431. }
  432. $s->{indent} = $v;
  433. return $s;
  434. }
  435. else {
  436. return $s->{indent};
  437. }
  438. }
  439. sub Pad {
  440. my($s, $v) = @_;
  441. defined($v) ? (($s->{pad} = $v), return $s) : $s->{pad};
  442. }
  443. sub Varname {
  444. my($s, $v) = @_;
  445. defined($v) ? (($s->{varname} = $v), return $s) : $s->{varname};
  446. }
  447. sub Purity {
  448. my($s, $v) = @_;
  449. defined($v) ? (($s->{purity} = $v), return $s) : $s->{purity};
  450. }
  451. sub Useqq {
  452. my($s, $v) = @_;
  453. defined($v) ? (($s->{useqq} = $v), return $s) : $s->{useqq};
  454. }
  455. sub Terse {
  456. my($s, $v) = @_;
  457. defined($v) ? (($s->{terse} = $v), return $s) : $s->{terse};
  458. }
  459. sub Freezer {
  460. my($s, $v) = @_;
  461. defined($v) ? (($s->{freezer} = $v), return $s) : $s->{freezer};
  462. }
  463. sub Toaster {
  464. my($s, $v) = @_;
  465. defined($v) ? (($s->{toaster} = $v), return $s) : $s->{toaster};
  466. }
  467. sub Deepcopy {
  468. my($s, $v) = @_;
  469. defined($v) ? (($s->{deepcopy} = $v), return $s) : $s->{deepcopy};
  470. }
  471. sub Quotekeys {
  472. my($s, $v) = @_;
  473. defined($v) ? (($s->{quotekeys} = $v), return $s) : $s->{quotekeys};
  474. }
  475. sub Bless {
  476. my($s, $v) = @_;
  477. defined($v) ? (($s->{'bless'} = $v), return $s) : $s->{'bless'};
  478. }
  479. sub Maxdepth {
  480. my($s, $v) = @_;
  481. defined($v) ? (($s->{'maxdepth'} = $v), return $s) : $s->{'maxdepth'};
  482. }
  483. # used by qquote below
  484. my %esc = (
  485. "\a" => "\\a",
  486. "\b" => "\\b",
  487. "\t" => "\\t",
  488. "\n" => "\\n",
  489. "\f" => "\\f",
  490. "\r" => "\\r",
  491. "\e" => "\\e",
  492. );
  493. # put a string value in double quotes
  494. sub qquote {
  495. local($_) = shift;
  496. s/([\\\"\@\$])/\\$1/g;
  497. return qq("$_") unless
  498. /[^ !"\#\$%&'()*+,\-.\/0-9:;<=>?\@A-Z[\\\]^_`a-z{|}~]/; # fast exit
  499. my $high = shift || "";
  500. s/([\a\b\t\n\f\r\e])/$esc{$1}/g;
  501. if (ord('^')==94) { # ascii
  502. # no need for 3 digits in escape for these
  503. s/([\0-\037])(?!\d)/'\\'.sprintf('%o',ord($1))/eg;
  504. s/([\0-\037\177])/'\\'.sprintf('%03o',ord($1))/eg;
  505. # all but last branch below not supported --BEHAVIOR SUBJECT TO CHANGE--
  506. if ($high eq "iso8859") {
  507. s/([\200-\240])/'\\'.sprintf('%o',ord($1))/eg;
  508. } elsif ($high eq "utf8") {
  509. # use utf8;
  510. # $str =~ s/([^\040-\176])/sprintf "\\x{%04x}", ord($1)/ge;
  511. } elsif ($high eq "8bit") {
  512. # leave it as it is
  513. } else {
  514. s/([\200-\377])/'\\'.sprintf('%03o',ord($1))/eg;
  515. }
  516. }
  517. else { # ebcdic
  518. s{([^ !"\#\$%&'()*+,\-.\/0-9:;<=>?\@A-Z[\\\]^_`a-z{|}~])(?!\d)}
  519. {my $v = ord($1); '\\'.sprintf(($v <= 037 ? '%o' : '%03o'), $v)}eg;
  520. s{([^ !"\#\$%&'()*+,\-.\/0-9:;<=>?\@A-Z[\\\]^_`a-z{|}~])}
  521. {'\\'.sprintf('%03o',ord($1))}eg;
  522. }
  523. return qq("$_");
  524. }
  525. 1;
  526. __END__
  527. =head1 NAME
  528. Data::Dumper - stringified perl data structures, suitable for both printing and C<eval>
  529. =head1 SYNOPSIS
  530. use Data::Dumper;
  531. # simple procedural interface
  532. print Dumper($foo, $bar);
  533. # extended usage with names
  534. print Data::Dumper->Dump([$foo, $bar], [qw(foo *ary)]);
  535. # configuration variables
  536. {
  537. local $Data::Dump::Purity = 1;
  538. eval Data::Dumper->Dump([$foo, $bar], [qw(foo *ary)]);
  539. }
  540. # OO usage
  541. $d = Data::Dumper->new([$foo, $bar], [qw(foo *ary)]);
  542. ...
  543. print $d->Dump;
  544. ...
  545. $d->Purity(1)->Terse(1)->Deepcopy(1);
  546. eval $d->Dump;
  547. =head1 DESCRIPTION
  548. Given a list of scalars or reference variables, writes out their contents in
  549. perl syntax. The references can also be objects. The contents of each
  550. variable is output in a single Perl statement. Handles self-referential
  551. structures correctly.
  552. The return value can be C<eval>ed to get back an identical copy of the
  553. original reference structure.
  554. Any references that are the same as one of those passed in will be named
  555. C<$VAR>I<n> (where I<n> is a numeric suffix), and other duplicate references
  556. to substructures within C<$VAR>I<n> will be appropriately labeled using arrow
  557. notation. You can specify names for individual values to be dumped if you
  558. use the C<Dump()> method, or you can change the default C<$VAR> prefix to
  559. something else. See C<$Data::Dumper::Varname> and C<$Data::Dumper::Terse>
  560. below.
  561. The default output of self-referential structures can be C<eval>ed, but the
  562. nested references to C<$VAR>I<n> will be undefined, since a recursive
  563. structure cannot be constructed using one Perl statement. You should set the
  564. C<Purity> flag to 1 to get additional statements that will correctly fill in
  565. these references.
  566. In the extended usage form, the references to be dumped can be given
  567. user-specified names. If a name begins with a C<*>, the output will
  568. describe the dereferenced type of the supplied reference for hashes and
  569. arrays, and coderefs. Output of names will be avoided where possible if
  570. the C<Terse> flag is set.
  571. In many cases, methods that are used to set the internal state of the
  572. object will return the object itself, so method calls can be conveniently
  573. chained together.
  574. Several styles of output are possible, all controlled by setting
  575. the C<Indent> flag. See L<Configuration Variables or Methods> below
  576. for details.
  577. =head2 Methods
  578. =over 4
  579. =item I<PACKAGE>->new(I<ARRAYREF [>, I<ARRAYREF]>)
  580. Returns a newly created C<Data::Dumper> object. The first argument is an
  581. anonymous array of values to be dumped. The optional second argument is an
  582. anonymous array of names for the values. The names need not have a leading
  583. C<$> sign, and must be comprised of alphanumeric characters. You can begin
  584. a name with a C<*> to specify that the dereferenced type must be dumped
  585. instead of the reference itself, for ARRAY and HASH references.
  586. The prefix specified by C<$Data::Dumper::Varname> will be used with a
  587. numeric suffix if the name for a value is undefined.
  588. Data::Dumper will catalog all references encountered while dumping the
  589. values. Cross-references (in the form of names of substructures in perl
  590. syntax) will be inserted at all possible points, preserving any structural
  591. interdependencies in the original set of values. Structure traversal is
  592. depth-first, and proceeds in order from the first supplied value to
  593. the last.
  594. =item I<$OBJ>->Dump I<or> I<PACKAGE>->Dump(I<ARRAYREF [>, I<ARRAYREF]>)
  595. Returns the stringified form of the values stored in the object (preserving
  596. the order in which they were supplied to C<new>), subject to the
  597. configuration options below. In a list context, it returns a list
  598. of strings corresponding to the supplied values.
  599. The second form, for convenience, simply calls the C<new> method on its
  600. arguments before dumping the object immediately.
  601. =item I<$OBJ>->Seen(I<[HASHREF]>)
  602. Queries or adds to the internal table of already encountered references.
  603. You must use C<Reset> to explicitly clear the table if needed. Such
  604. references are not dumped; instead, their names are inserted wherever they
  605. are encountered subsequently. This is useful especially for properly
  606. dumping subroutine references.
  607. Expects a anonymous hash of name => value pairs. Same rules apply for names
  608. as in C<new>. If no argument is supplied, will return the "seen" list of
  609. name => value pairs, in a list context. Otherwise, returns the object
  610. itself.
  611. =item I<$OBJ>->Values(I<[ARRAYREF]>)
  612. Queries or replaces the internal array of values that will be dumped.
  613. When called without arguments, returns the values. Otherwise, returns the
  614. object itself.
  615. =item I<$OBJ>->Names(I<[ARRAYREF]>)
  616. Queries or replaces the internal array of user supplied names for the values
  617. that will be dumped. When called without arguments, returns the names.
  618. Otherwise, returns the object itself.
  619. =item I<$OBJ>->Reset
  620. Clears the internal table of "seen" references and returns the object
  621. itself.
  622. =back
  623. =head2 Functions
  624. =over 4
  625. =item Dumper(I<LIST>)
  626. Returns the stringified form of the values in the list, subject to the
  627. configuration options below. The values will be named C<$VAR>I<n> in the
  628. output, where I<n> is a numeric suffix. Will return a list of strings
  629. in a list context.
  630. =back
  631. =head2 Configuration Variables or Methods
  632. Several configuration variables can be used to control the kind of output
  633. generated when using the procedural interface. These variables are usually
  634. C<local>ized in a block so that other parts of the code are not affected by
  635. the change.
  636. These variables determine the default state of the object created by calling
  637. the C<new> method, but cannot be used to alter the state of the object
  638. thereafter. The equivalent method names should be used instead to query
  639. or set the internal state of the object.
  640. The method forms return the object itself when called with arguments,
  641. so that they can be chained together nicely.
  642. =over 4
  643. =item $Data::Dumper::Indent I<or> I<$OBJ>->Indent(I<[NEWVAL]>)
  644. Controls the style of indentation. It can be set to 0, 1, 2 or 3. Style 0
  645. spews output without any newlines, indentation, or spaces between list
  646. items. It is the most compact format possible that can still be called
  647. valid perl. Style 1 outputs a readable form with newlines but no fancy
  648. indentation (each level in the structure is simply indented by a fixed
  649. amount of whitespace). Style 2 (the default) outputs a very readable form
  650. which takes into account the length of hash keys (so the hash value lines
  651. up). Style 3 is like style 2, but also annotates the elements of arrays
  652. with their index (but the comment is on its own line, so array output
  653. consumes twice the number of lines). Style 2 is the default.
  654. =item $Data::Dumper::Purity I<or> I<$OBJ>->Purity(I<[NEWVAL]>)
  655. Controls the degree to which the output can be C<eval>ed to recreate the
  656. supplied reference structures. Setting it to 1 will output additional perl
  657. statements that will correctly recreate nested references. The default is
  658. 0.
  659. =item $Data::Dumper::Pad I<or> I<$OBJ>->Pad(I<[NEWVAL]>)
  660. Specifies the string that will be prefixed to every line of the output.
  661. Empty string by default.
  662. =item $Data::Dumper::Varname I<or> I<$OBJ>->Varname(I<[NEWVAL]>)
  663. Contains the prefix to use for tagging variable names in the output. The
  664. default is "VAR".
  665. =item $Data::Dumper::Useqq I<or> I<$OBJ>->Useqq(I<[NEWVAL]>)
  666. When set, enables the use of double quotes for representing string values.
  667. Whitespace other than space will be represented as C<[\n\t\r]>, "unsafe"
  668. characters will be backslashed, and unprintable characters will be output as
  669. quoted octal integers. Since setting this variable imposes a performance
  670. penalty, the default is 0. C<Dump()> will run slower if this flag is set,
  671. since the fast XSUB implementation doesn't support it yet.
  672. =item $Data::Dumper::Terse I<or> I<$OBJ>->Terse(I<[NEWVAL]>)
  673. When set, Data::Dumper will emit single, non-self-referential values as
  674. atoms/terms rather than statements. This means that the C<$VAR>I<n> names
  675. will be avoided where possible, but be advised that such output may not
  676. always be parseable by C<eval>.
  677. =item $Data::Dumper::Freezer I<or> $I<OBJ>->Freezer(I<[NEWVAL]>)
  678. Can be set to a method name, or to an empty string to disable the feature.
  679. Data::Dumper will invoke that method via the object before attempting to
  680. stringify it. This method can alter the contents of the object (if, for
  681. instance, it contains data allocated from C), and even rebless it in a
  682. different package. The client is responsible for making sure the specified
  683. method can be called via the object, and that the object ends up containing
  684. only perl data types after the method has been called. Defaults to an empty
  685. string.
  686. =item $Data::Dumper::Toaster I<or> $I<OBJ>->Toaster(I<[NEWVAL]>)
  687. Can be set to a method name, or to an empty string to disable the feature.
  688. Data::Dumper will emit a method call for any objects that are to be dumped
  689. using the syntax C<bless(DATA, CLASS)->METHOD()>. Note that this means that
  690. the method specified will have to perform any modifications required on the
  691. object (like creating new state within it, and/or reblessing it in a
  692. different package) and then return it. The client is responsible for making
  693. sure the method can be called via the object, and that it returns a valid
  694. object. Defaults to an empty string.
  695. =item $Data::Dumper::Deepcopy I<or> $I<OBJ>->Deepcopy(I<[NEWVAL]>)
  696. Can be set to a boolean value to enable deep copies of structures.
  697. Cross-referencing will then only be done when absolutely essential
  698. (i.e., to break reference cycles). Default is 0.
  699. =item $Data::Dumper::Quotekeys I<or> $I<OBJ>->Quotekeys(I<[NEWVAL]>)
  700. Can be set to a boolean value to control whether hash keys are quoted.
  701. A false value will avoid quoting hash keys when it looks like a simple
  702. string. Default is 1, which will always enclose hash keys in quotes.
  703. =item $Data::Dumper::Bless I<or> $I<OBJ>->Bless(I<[NEWVAL]>)
  704. Can be set to a string that specifies an alternative to the C<bless>
  705. builtin operator used to create objects. A function with the specified
  706. name should exist, and should accept the same arguments as the builtin.
  707. Default is C<bless>.
  708. =item $Data::Dumper::Maxdepth I<or> $I<OBJ>->Maxdepth(I<[NEWVAL]>)
  709. Can be set to a positive integer that specifies the depth beyond which
  710. which we don't venture into a structure. Has no effect when
  711. C<Data::Dumper::Purity> is set. (Useful in debugger when we often don't
  712. want to see more than enough). Default is 0, which means there is
  713. no maximum depth.
  714. =back
  715. =head2 Exports
  716. =over 4
  717. =item Dumper
  718. =back
  719. =head1 EXAMPLES
  720. Run these code snippets to get a quick feel for the behavior of this
  721. module. When you are through with these examples, you may want to
  722. add or change the various configuration variables described above,
  723. to see their behavior. (See the testsuite in the Data::Dumper
  724. distribution for more examples.)
  725. use Data::Dumper;
  726. package Foo;
  727. sub new {bless {'a' => 1, 'b' => sub { return "foo" }}, $_[0]};
  728. package Fuz; # a weird REF-REF-SCALAR object
  729. sub new {bless \($_ = \ 'fu\'z'), $_[0]};
  730. package main;
  731. $foo = Foo->new;
  732. $fuz = Fuz->new;
  733. $boo = [ 1, [], "abcd", \*foo,
  734. {1 => 'a', 023 => 'b', 0x45 => 'c'},
  735. \\"p\q\'r", $foo, $fuz];
  736. ########
  737. # simple usage
  738. ########
  739. $bar = eval(Dumper($boo));
  740. print($@) if $@;
  741. print Dumper($boo), Dumper($bar); # pretty print (no array indices)
  742. $Data::Dumper::Terse = 1; # don't output names where feasible
  743. $Data::Dumper::Indent = 0; # turn off all pretty print
  744. print Dumper($boo), "\n";
  745. $Data::Dumper::Indent = 1; # mild pretty print
  746. print Dumper($boo);
  747. $Data::Dumper::Indent = 3; # pretty print with array indices
  748. print Dumper($boo);
  749. $Data::Dumper::Useqq = 1; # print strings in double quotes
  750. print Dumper($boo);
  751. ########
  752. # recursive structures
  753. ########
  754. @c = ('c');
  755. $c = \@c;
  756. $b = {};
  757. $a = [1, $b, $c];
  758. $b->{a} = $a;
  759. $b->{b} = $a->[1];
  760. $b->{c} = $a->[2];
  761. print Data::Dumper->Dump([$a,$b,$c], [qw(a b c)]);
  762. $Data::Dumper::Purity = 1; # fill in the holes for eval
  763. print Data::Dumper->Dump([$a, $b], [qw(*a b)]); # print as @a
  764. print Data::Dumper->Dump([$b, $a], [qw(*b a)]); # print as %b
  765. $Data::Dumper::Deepcopy = 1; # avoid cross-refs
  766. print Data::Dumper->Dump([$b, $a], [qw(*b a)]);
  767. $Data::Dumper::Purity = 0; # avoid cross-refs
  768. print Data::Dumper->Dump([$b, $a], [qw(*b a)]);
  769. ########
  770. # deep structures
  771. ########
  772. $a = "pearl";
  773. $b = [ $a ];
  774. $c = { 'b' => $b };
  775. $d = [ $c ];
  776. $e = { 'd' => $d };
  777. $f = { 'e' => $e };
  778. print Data::Dumper->Dump([$f], [qw(f)]);
  779. $Data::Dumper::Maxdepth = 3; # no deeper than 3 refs down
  780. print Data::Dumper->Dump([$f], [qw(f)]);
  781. ########
  782. # object-oriented usage
  783. ########
  784. $d = Data::Dumper->new([$a,$b], [qw(a b)]);
  785. $d->Seen({'*c' => $c}); # stash a ref without printing it
  786. $d->Indent(3);
  787. print $d->Dump;
  788. $d->Reset->Purity(0); # empty the seen cache
  789. print join "----\n", $d->Dump;
  790. ########
  791. # persistence
  792. ########
  793. package Foo;
  794. sub new { bless { state => 'awake' }, shift }
  795. sub Freeze {
  796. my $s = shift;
  797. print STDERR "preparing to sleep\n";
  798. $s->{state} = 'asleep';
  799. return bless $s, 'Foo::ZZZ';
  800. }
  801. package Foo::ZZZ;
  802. sub Thaw {
  803. my $s = shift;
  804. print STDERR "waking up\n";
  805. $s->{state} = 'awake';
  806. return bless $s, 'Foo';
  807. }
  808. package Foo;
  809. use Data::Dumper;
  810. $a = Foo->new;
  811. $b = Data::Dumper->new([$a], ['c']);
  812. $b->Freezer('Freeze');
  813. $b->Toaster('Thaw');
  814. $c = $b->Dump;
  815. print $c;
  816. $d = eval $c;
  817. print Data::Dumper->Dump([$d], ['d']);
  818. ########
  819. # symbol substitution (useful for recreating CODE refs)
  820. ########
  821. sub foo { print "foo speaking\n" }
  822. *other = \&foo;
  823. $bar = [ \&other ];
  824. $d = Data::Dumper->new([\&other,$bar],['*other','bar']);
  825. $d->Seen({ '*foo' => \&foo });
  826. print $d->Dump;
  827. =head1 BUGS
  828. Due to limitations of Perl subroutine call semantics, you cannot pass an
  829. array or hash. Prepend it with a C<\> to pass its reference instead. This
  830. will be remedied in time, with the arrival of prototypes in later versions
  831. of Perl. For now, you need to use the extended usage form, and prepend the
  832. name with a C<*> to output it as a hash or array.
  833. C<Data::Dumper> cheats with CODE references. If a code reference is
  834. encountered in the structure being processed, an anonymous subroutine that
  835. contains the string '"DUMMY"' will be inserted in its place, and a warning
  836. will be printed if C<Purity> is set. You can C<eval> the result, but bear
  837. in mind that the anonymous sub that gets created is just a placeholder.
  838. Someday, perl will have a switch to cache-on-demand the string
  839. representation of a compiled piece of code, I hope. If you have prior
  840. knowledge of all the code refs that your data structures are likely
  841. to have, you can use the C<Seen> method to pre-seed the internal reference
  842. table and make the dumped output point to them, instead. See L<EXAMPLES>
  843. above.
  844. The C<Useqq> flag makes Dump() run slower, since the XSUB implementation
  845. does not support it.
  846. SCALAR objects have the weirdest looking C<bless> workaround.
  847. =head1 AUTHOR
  848. Gurusamy Sarathy gsar@activestate.com
  849. Copyright (c) 1996-98 Gurusamy Sarathy. All rights reserved.
  850. This program is free software; you can redistribute it and/or
  851. modify it under the same terms as Perl itself.
  852. =head1 VERSION
  853. Version 2.11 (unreleased)
  854. =head1 SEE ALSO
  855. perl(1)
  856. =cut