2 # Copyright (c) 1998-2000, 2002, 2003 Stephen McCamant. All rights reserved.
3 # This module is free software; you can redistribute and/or modify
4 # it under the same terms as Perl itself.
6 # This is based on the module of the same name by Malcolm Beattie,
7 # but essentially none of his code remains.
11 use B qw(class main_root main_start main_cv svref_2object opnumber perlstring
12 OPf_WANT OPf_WANT_VOID OPf_WANT_SCALAR OPf_WANT_LIST
13 OPf_KIDS OPf_REF OPf_STACKED OPf_SPECIAL OPf_MOD
14 OPpLVAL_INTRO OPpOUR_INTRO OPpENTERSUB_AMPER OPpSLICE OPpCONST_BARE
15 OPpTRANS_SQUASH OPpTRANS_DELETE OPpTRANS_COMPLEMENT OPpTARGET_MY
16 OPpCONST_ARYBASE OPpEXISTS_SUB OPpSORT_NUMERIC OPpSORT_INTEGER
17 OPpSORT_REVERSE OPpSORT_INPLACE OPpSORT_DESCEND OPpITER_REVERSED
18 SVf_IOK SVf_NOK SVf_ROK SVf_POK SVpad_OUR SVf_FAKE SVs_RMG SVs_SMG
19 CVf_METHOD CVf_LOCKED CVf_LVALUE CVf_ASSERTION
20 PMf_KEEP PMf_GLOBAL PMf_CONTINUE PMf_EVAL PMf_ONCE PMf_SKIPWHITE
21 PMf_MULTILINE PMf_SINGLELINE PMf_FOLD PMf_EXTENDED);
24 use vars qw/$AUTOLOAD/;
27 # Changes between 0.50 and 0.51:
28 # - fixed nulled leave with live enter in sort { }
29 # - fixed reference constants (\"str")
30 # - handle empty programs gracefully
31 # - handle infinte loops (for (;;) {}, while (1) {})
32 # - differentiate between `for my $x ...' and `my $x; for $x ...'
33 # - various minor cleanups
34 # - moved globals into an object
35 # - added `-u', like B::C
36 # - package declarations using cop_stash
37 # - subs, formats and code sorted by cop_seq
38 # Changes between 0.51 and 0.52:
39 # - added pp_threadsv (special variables under USE_5005THREADS)
40 # - added documentation
41 # Changes between 0.52 and 0.53:
42 # - many changes adding precedence contexts and associativity
43 # - added `-p' and `-s' output style options
44 # - various other minor fixes
45 # Changes between 0.53 and 0.54:
46 # - added support for new `for (1..100)' optimization,
48 # Changes between 0.54 and 0.55:
49 # - added support for new qr// construct
50 # - added support for new pp_regcreset OP
51 # Changes between 0.55 and 0.56:
52 # - tested on base/*.t, cmd/*.t, comp/*.t, io/*.t
53 # - fixed $# on non-lexicals broken in last big rewrite
54 # - added temporary fix for change in opcode of OP_STRINGIFY
55 # - fixed problem in 0.54's for() patch in `for (@ary)'
56 # - fixed precedence in conditional of ?:
57 # - tweaked list paren elimination in `my($x) = @_'
58 # - made continue-block detection trickier wrt. null ops
59 # - fixed various prototype problems in pp_entersub
60 # - added support for sub prototypes that never get GVs
61 # - added unquoting for special filehandle first arg in truncate
62 # - print doubled rv2gv (a bug) as `*{*GV}' instead of illegal `**GV'
63 # - added semicolons at the ends of blocks
64 # - added -l `#line' declaration option -- fixes cmd/subval.t 27,28
65 # Changes between 0.56 and 0.561:
66 # - fixed multiply-declared my var in pp_truncate (thanks to Sarathy)
67 # - used new B.pm symbolic constants (done by Nick Ing-Simmons)
68 # Changes between 0.561 and 0.57:
69 # - stylistic changes to symbolic constant stuff
70 # - handled scope in s///e replacement code
71 # - added unquote option for expanding "" into concats, etc.
72 # - split method and proto parts of pp_entersub into separate functions
73 # - various minor cleanups
75 # - added parens in \&foo (patch by Albert Dvornik)
76 # Changes between 0.57 and 0.58:
77 # - fixed `0' statements that weren't being printed
78 # - added methods for use from other programs
79 # (based on patches from James Duncan and Hugo van der Sanden)
80 # - added -si and -sT to control indenting (also based on a patch from Hugo)
81 # - added -sv to print something else instead of '???'
82 # - preliminary version of utf8 tr/// handling
84 # - uses of $op->ppaddr changed to new $op->name (done by Sarathy)
85 # - added support for Hugo's new OP_SETSTATE (like nextstate)
86 # Changes between 0.58 and 0.59
87 # - added support for Chip's OP_METHOD_NAMED
88 # - added support for Ilya's OPpTARGET_MY optimization
89 # - elided arrows before `()' subscripts when possible
90 # Changes between 0.59 and 0.60
91 # - support for method attribues was added
92 # - some warnings fixed
93 # - separate recognition of constant subs
94 # - rewrote continue block handling, now recoginizing for loops
95 # - added more control of expanding control structures
96 # Changes between 0.60 and 0.61 (mostly by Robin Houston)
98 # - support for pragmas and 'use'
99 # - support for the little-used $[ variable
100 # - support for __DATA__ sections
102 # - BEGIN, CHECK, INIT and END blocks
103 # - scoping of subroutine declarations fixed
104 # - compile-time output from the input program can be suppressed, so that the
105 # output is just the deparsed code. (a change to O.pm in fact)
106 # - our() declarations
107 # - *all* the known bugs are now listed in the BUGS section
108 # - comprehensive test mechanism (TEST -deparse)
109 # Changes between 0.62 and 0.63 (mostly by Rafael Garcia-Suarez)
112 # - support for command-line switches (-l, -0, etc.)
113 # Changes between 0.63 and 0.64
114 # - support for //, CHECK blocks, and assertions
115 # - improved handling of foreach loops and lexicals
116 # - option to use Data::Dumper for constants
118 # - discovered lots more bugs not yet fixed
121 # (See also BUGS section at the end of this file)
123 # - finish tr/// changes
124 # - add option for even more parens (generalize \&foo change)
125 # - left/right context
126 # - copy comments (look at real text with $^P?)
127 # - avoid semis in one-statement blocks
128 # - associativity of &&=, ||=, ?:
129 # - ',' => '=>' (auto-unquote?)
130 # - break long lines ("\r" as discretionary break?)
131 # - configurable syntax highlighting: ANSI color, HTML, TeX, etc.
132 # - more style options: brace style, hex vs. octal, quotes, ...
133 # - print big ints as hex/octal instead of decimal (heuristic?)
134 # - handle `my $x if 0'?
135 # - version using op_next instead of op_first/sibling?
136 # - avoid string copies (pass arrays, one big join?)
139 # Current test.deparse failures
140 # comp/assertions 38 - disabled assertions should be like "my($x) if 0"
141 # 'sub f : assertion {}; no assertions; my $x=1; {f(my $x=2); print "$x\n"}'
142 # comp/hints 6 - location of BEGIN blocks wrt. block openings
143 # run/switchI 1 - missing -I switches entirely
144 # perl -Ifoo -e 'print @INC'
145 # op/caller 2 - warning mask propagates backwards before warnings::register
146 # 'use warnings; BEGIN {${^WARNING_BITS} eq "U"x12;} use warnings::register'
147 # op/getpid 2 - can't assign to shared my() declaration (threads only)
148 # 'my $x : shared = 5'
149 # op/override 7 - parens on overriden require change v-string interpretation
150 # 'BEGIN{*CORE::GLOBAL::require=sub {}} require v5.6'
151 # c.f. 'BEGIN { *f = sub {0} }; f 2'
152 # op/pat 774 - losing Unicode-ness of Latin1-only strings
153 # 'use charnames ":short"; $x="\N{latin:a with acute}"'
154 # op/recurse 12 - missing parens on recursive call makes it look like method
156 # op/subst 90 - inconsistent handling of utf8 under "use utf8"
157 # op/taint 29 - "use re 'taint'" deparsed in the wrong place wrt. block open
158 # op/tiehandle compile - "use strict" deparsed in the wrong place
160 # ext/B/t/xref 11 - line numbers when we add newlines to one-line subs
161 # ext/Data/Dumper/t/dumper compile
162 # ext/DB_file/several
164 # ext/Ernno/Errno warnings
165 # ext/IO/lib/IO/t/io_sel 23
166 # ext/PerlIO/t/encoding compile
167 # ext/POSIX/t/posix 6
168 # ext/Socket/Socket 8
169 # ext/Storable/t/croak compile
170 # lib/Attribute/Handlers/t/multi compile
171 # lib/bignum/ several
175 # lib/ExtUtils/t/bytes 4
176 # lib/File/DosGlob compile
177 # lib/Filter/Simple/t/data 1
178 # lib/Math/BigInt/t/constant 1
179 # lib/Net/t/config Deparse-warning
180 # lib/overload compile
181 # lib/Switch/ several
183 # lib/Test/Simple several
185 # lib/Tie/File/t/29_downcopy 5
188 # Object fields (were globals):
191 # (local($a), local($b)) and local($a, $b) have the same internal
192 # representation but the short form looks better. We notice we can
193 # use a large-scale local when checking the list, but need to prevent
194 # individual locals too. This hash holds the addresses of OPs that
195 # have already had their local-ness accounted for. The same thing
199 # CV for current sub (or main program) being deparsed
202 # Cached hash of lexical variables for curcv: keys are names,
203 # each value is an array of pairs, indicating the cop_seq of scopes
204 # in which a var of that name is valid.
207 # COP for statement being deparsed
210 # name of the current package for deparsed code
213 # array of [cop_seq, CV, is_format?] for subs and formats we still
217 # as above, but [name, prototype] for subs that never got a GV
219 # subs_done, forms_done:
220 # keys are addresses of GVs for subs and formats we've already
221 # deparsed (or at least put into subs_todo)
224 # keys are names of subs for which we've printed declarations.
225 # That means we can omit parentheses from the arguments.
228 # Keeps track of fully qualified names of all deparsed subs.
233 # cuddle: ` ' or `\n', depending on -sC
238 # A little explanation of how precedence contexts and associativity
241 # deparse() calls each per-op subroutine with an argument $cx (short
242 # for context, but not the same as the cx* in the perl core), which is
243 # a number describing the op's parents in terms of precedence, whether
244 # they're inside an expression or at statement level, etc. (see
245 # chart below). When ops with children call deparse on them, they pass
246 # along their precedence. Fractional values are used to implement
247 # associativity (`($x + $y) + $z' => `$x + $y + $y') and related
248 # parentheses hacks. The major disadvantage of this scheme is that
249 # it doesn't know about right sides and left sides, so say if you
250 # assign a listop to a variable, it can't tell it's allowed to leave
251 # the parens off the listop.
254 # 26 [TODO] inside interpolation context ("")
255 # 25 left terms and list operators (leftward)
259 # 21 right ! ~ \ and unary + and -
264 # 16 nonassoc named unary operators
265 # 15 nonassoc < > <= >= lt gt le ge
266 # 14 nonassoc == != <=> eq ne cmp
273 # 7 right = += -= *= etc.
275 # 5 nonassoc list operators (rightward)
279 # 1 statement modifiers
280 # 0.5 statements, but still print scopes as do { ... }
283 # Nonprinting characters with special meaning:
284 # \cS - steal parens (see maybe_parens_unop)
285 # \n - newline and indent
286 # \t - increase indent
287 # \b - decrease indent (`outdent')
288 # \f - flush left (no indent)
289 # \cK - kill following semicolon, if any
293 return class($op) eq "NULL";
298 my($cv, $is_form) = @_;
299 return unless ($cv->FILE eq $0 || exists $self->{files}{$cv->FILE});
301 if ($cv->OUTSIDE_SEQ) {
302 $seq = $cv->OUTSIDE_SEQ;
303 } elsif (!null($cv->START) and is_state($cv->START)) {
304 $seq = $cv->START->cop_seq;
308 push @{$self->{'subs_todo'}}, [$seq, $cv, $is_form];
309 unless ($is_form || class($cv->STASH) eq 'SPECIAL') {
310 $self->{'subs_deparsed'}{$cv->STASH->NAME."::".$cv->GV->NAME} = 1;
316 my $ent = shift @{$self->{'subs_todo'}};
319 my $name = $self->gv_name($gv);
321 return "format $name =\n"
322 . $self->deparse_format($ent->[1]). "\n";
324 $self->{'subs_declared'}{$name} = 1;
325 if ($name eq "BEGIN") {
326 my $use_dec = $self->begin_is_use($cv);
327 if (defined ($use_dec) and $self->{'expand'} < 5) {
328 return () if 0 == length($use_dec);
333 if ($self->{'linenums'}) {
334 my $line = $gv->LINE;
335 my $file = $gv->FILE;
336 $l = "\n\f#line $line \"$file\"\n";
339 if (class($cv->STASH) ne "SPECIAL") {
340 my $stash = $cv->STASH->NAME;
341 if ($stash ne $self->{'curstash'}) {
342 $p = "package $stash;\n";
343 $name = "$self->{'curstash'}::$name" unless $name =~ /::/;
344 $self->{'curstash'} = $stash;
346 $name =~ s/^\Q$stash\E:://;
348 return "${p}${l}sub $name " . $self->deparse_sub($cv);
352 # Return a "use" declaration for this BEGIN block, if appropriate
354 my ($self, $cv) = @_;
355 my $root = $cv->ROOT;
356 local @$self{qw'curcv curcvlex'} = ($cv);
358 #B::walkoptree($cv->ROOT, "debug");
359 my $lineseq = $root->first;
360 return if $lineseq->name ne "lineseq";
362 my $req_op = $lineseq->first->sibling;
363 return if $req_op->name ne "require";
366 if ($req_op->first->private & OPpCONST_BARE) {
367 # Actually it should always be a bareword
368 $module = $self->const_sv($req_op->first)->PV;
369 $module =~ s[/][::]g;
373 $module = $self->const($self->const_sv($req_op->first), 6);
377 my $version_op = $req_op->sibling;
378 return if class($version_op) eq "NULL";
379 if ($version_op->name eq "lineseq") {
380 # We have a version parameter; skip nextstate & pushmark
381 my $constop = $version_op->first->next->next;
383 return unless $self->const_sv($constop)->PV eq $module;
384 $constop = $constop->sibling;
385 $version = $self->const_sv($constop);
386 if (class($version) eq "IV") {
387 $version = $version->int_value;
388 } elsif (class($version) eq "NV") {
389 $version = $version->NV;
390 } elsif (class($version) ne "PVMG") {
391 # Includes PVIV and PVNV
392 $version = $version->PV;
394 # version specified as a v-string
395 $version = 'v'.join '.', map ord, split //, $version->PV;
397 $constop = $constop->sibling;
398 return if $constop->name ne "method_named";
399 return if $self->const_sv($constop)->PV ne "VERSION";
402 $lineseq = $version_op->sibling;
403 return if $lineseq->name ne "lineseq";
404 my $entersub = $lineseq->first->sibling;
405 if ($entersub->name eq "stub") {
406 return "use $module $version ();\n" if defined $version;
407 return "use $module ();\n";
409 return if $entersub->name ne "entersub";
411 # See if there are import arguments
414 my $svop = $entersub->first->sibling; # Skip over pushmark
415 return unless $self->const_sv($svop)->PV eq $module;
417 # Pull out the arguments
418 for ($svop=$svop->sibling; $svop->name ne "method_named";
419 $svop = $svop->sibling) {
420 $args .= ", " if length($args);
421 $args .= $self->deparse($svop, 6);
425 my $method_named = $svop;
426 return if $method_named->name ne "method_named";
427 my $method_name = $self->const_sv($method_named)->PV;
429 if ($method_name eq "unimport") {
433 # Certain pragmas are dealt with using hint bits,
434 # so we ignore them here
435 if ($module eq 'strict' || $module eq 'integer'
436 || $module eq 'bytes' || $module eq 'warnings') {
440 if (defined $version && length $args) {
441 return "$use $module $version ($args);\n";
442 } elsif (defined $version) {
443 return "$use $module $version;\n";
444 } elsif (length $args) {
445 return "$use $module ($args);\n";
447 return "$use $module;\n";
452 my ($self, $pack) = @_;
454 if (!defined $pack) {
459 $pack =~ s/(::)?$/::/;
463 my %stash = svref_2object($stash)->ARRAY;
464 while (my ($key, $val) = each %stash) {
465 next if $key eq 'main::'; # avoid infinite recursion
466 my $class = class($val);
467 if ($class eq "PV") {
468 # Just a prototype. As an ugly but fairly effective way
469 # to find out if it belongs here is to see if the AUTOLOAD
470 # (if any) for the stash was defined in one of our files.
471 my $A = $stash{"AUTOLOAD"};
472 if (defined ($A) && class($A) eq "GV" && defined($A->CV)
473 && class($A->CV) eq "CV") {
475 next unless $AF eq $0 || exists $self->{'files'}{$AF};
477 push @{$self->{'protos_todo'}}, [$pack . $key, $val->PV];
478 } elsif ($class eq "IV") {
479 # Just a name. As above.
480 my $A = $stash{"AUTOLOAD"};
481 if (defined ($A) && class($A) eq "GV" && defined($A->CV)
482 && class($A->CV) eq "CV") {
484 next unless $AF eq $0 || exists $self->{'files'}{$AF};
486 push @{$self->{'protos_todo'}}, [$pack . $key, undef];
487 } elsif ($class eq "GV") {
488 if (class(my $cv = $val->CV) ne "SPECIAL") {
489 next if $self->{'subs_done'}{$$val}++;
490 next if $$val != ${$cv->GV}; # Ignore imposters
493 if (class(my $cv = $val->FORM) ne "SPECIAL") {
494 next if $self->{'forms_done'}{$$val}++;
495 next if $$val != ${$cv->GV}; # Ignore imposters
498 if (class($val->HV) ne "SPECIAL" && $key =~ /::$/) {
499 $self->stash_subs($pack . $key);
509 foreach $ar (@{$self->{'protos_todo'}}) {
510 my $proto = (defined $ar->[1] ? " (". $ar->[1] . ")" : "");
511 push @ret, "sub " . $ar->[0] . "$proto;\n";
513 delete $self->{'protos_todo'};
521 while (length($opt = substr($opts, 0, 1))) {
523 $self->{'cuddle'} = " ";
524 $opts = substr($opts, 1);
525 } elsif ($opt eq "i") {
526 $opts =~ s/^i(\d+)//;
527 $self->{'indent_size'} = $1;
528 } elsif ($opt eq "T") {
529 $self->{'use_tabs'} = 1;
530 $opts = substr($opts, 1);
531 } elsif ($opt eq "v") {
532 $opts =~ s/^v([^.]*)(.|$)//;
533 $self->{'ex_const'} = $1;
540 my $self = bless {}, $class;
541 $self->{'cuddle'} = "\n";
542 $self->{'curcop'} = undef;
543 $self->{'curstash'} = "main";
544 $self->{'ex_const'} = "'???'";
545 $self->{'expand'} = 0;
546 $self->{'files'} = {};
547 $self->{'indent_size'} = 4;
548 $self->{'linenums'} = 0;
549 $self->{'parens'} = 0;
550 $self->{'subs_todo'} = [];
551 $self->{'unquote'} = 0;
552 $self->{'use_dumper'} = 0;
553 $self->{'use_tabs'} = 0;
555 $self->{'ambient_arybase'} = 0;
556 $self->{'ambient_warnings'} = undef; # Assume no lexical warnings
557 $self->{'ambient_hints'} = 0;
560 while (my $arg = shift @_) {
562 $self->{'use_dumper'} = 1;
563 require Data::Dumper;
564 } elsif ($arg =~ /^-f(.*)/) {
565 $self->{'files'}{$1} = 1;
566 } elsif ($arg eq "-l") {
567 $self->{'linenums'} = 1;
568 } elsif ($arg eq "-p") {
569 $self->{'parens'} = 1;
570 } elsif ($arg eq "-P") {
571 $self->{'noproto'} = 1;
572 } elsif ($arg eq "-q") {
573 $self->{'unquote'} = 1;
574 } elsif (substr($arg, 0, 2) eq "-s") {
575 $self->style_opts(substr $arg, 2);
576 } elsif ($arg =~ /^-x(\d)$/) {
577 $self->{'expand'} = $1;
584 # Mask out the bits that L<warnings::register> uses
587 $WARN_MASK = $warnings::Bits{all} | $warnings::DeadBits{all};
594 # Initialise the contextual information, either from
595 # defaults provided with the ambient_pragmas method,
596 # or from perl's own defaults otherwise.
600 $self->{'arybase'} = $self->{'ambient_arybase'};
601 $self->{'warnings'} = defined ($self->{'ambient_warnings'})
602 ? $self->{'ambient_warnings'} & WARN_MASK
604 $self->{'hints'} = $self->{'ambient_hints'} & 0xFF;
606 # also a convenient place to clear out subs_declared
607 delete $self->{'subs_declared'};
613 my $self = B::Deparse->new(@args);
614 # First deparse command-line args
615 if (defined $^I) { # deparse -i
616 print q(BEGIN { $^I = ).perlstring($^I).qq(; }\n);
618 if ($^W) { # deparse -w
619 print qq(BEGIN { \$^W = $^W; }\n);
621 if ($/ ne "\n" or defined $O::savebackslash) { # deparse -l and -0
622 my $fs = perlstring($/) || 'undef';
623 my $bs = perlstring($O::savebackslash) || 'undef';
624 print qq(BEGIN { \$/ = $fs; \$\\ = $bs; }\n);
626 my @BEGINs = B::begin_av->isa("B::AV") ? B::begin_av->ARRAY : ();
627 my @CHECKs = B::check_av->isa("B::AV") ? B::check_av->ARRAY : ();
628 my @INITs = B::init_av->isa("B::AV") ? B::init_av->ARRAY : ();
629 my @ENDs = B::end_av->isa("B::AV") ? B::end_av->ARRAY : ();
630 for my $block (@BEGINs, @CHECKs, @INITs, @ENDs) {
631 $self->todo($block, 0);
634 local($SIG{"__DIE__"}) =
636 if ($self->{'curcop'}) {
637 my $cop = $self->{'curcop'};
638 my($line, $file) = ($cop->line, $cop->file);
639 print STDERR "While deparsing $file near line $line,\n";
642 $self->{'curcv'} = main_cv;
643 $self->{'curcvlex'} = undef;
644 print $self->print_protos;
645 @{$self->{'subs_todo'}} =
646 sort {$a->[0] <=> $b->[0]} @{$self->{'subs_todo'}};
647 print $self->indent($self->deparse_root(main_root)), "\n"
648 unless null main_root;
650 while (scalar(@{$self->{'subs_todo'}})) {
651 push @text, $self->next_todo;
653 print $self->indent(join("", @text)), "\n" if @text;
655 # Print __DATA__ section, if necessary
657 my $laststash = defined $self->{'curcop'}
658 ? $self->{'curcop'}->stash->NAME : $self->{'curstash'};
659 if (defined *{$laststash."::DATA"}{IO}) {
660 print "package $laststash;\n"
661 unless $laststash eq $self->{'curstash'};
663 print readline(*{$laststash."::DATA"});
671 croak "Usage: ->coderef2text(CODEREF)" unless UNIVERSAL::isa($sub, "CODE");
674 return $self->indent($self->deparse_sub(svref_2object($sub)));
677 sub ambient_pragmas {
679 my ($arybase, $hint_bits, $warning_bits) = (0, 0);
685 if ($name eq 'strict') {
688 if ($val eq 'none') {
689 $hint_bits &= ~strict::bits(qw/refs subs vars/);
695 @names = qw/refs subs vars/;
701 @names = split' ', $val;
703 $hint_bits |= strict::bits(@names);
706 elsif ($name eq '$[') {
710 elsif ($name eq 'integer'
712 || $name eq 'utf8') {
715 $hint_bits |= ${$::{"${name}::"}{"hint_bits"}};
718 $hint_bits &= ~${$::{"${name}::"}{"hint_bits"}};
722 elsif ($name eq 're') {
724 if ($val eq 'none') {
725 $hint_bits &= ~re::bits(qw/taint eval/);
731 @names = qw/taint eval/;
737 @names = split' ',$val;
739 $hint_bits |= re::bits(@names);
742 elsif ($name eq 'warnings') {
743 if ($val eq 'none') {
744 $warning_bits = $warnings::NONE;
753 @names = split/\s+/, $val;
756 $warning_bits = $warnings::NONE if !defined ($warning_bits);
757 $warning_bits |= warnings::bits(@names);
760 elsif ($name eq 'warning_bits') {
761 $warning_bits = $val;
764 elsif ($name eq 'hint_bits') {
769 croak "Unknown pragma type: $name";
773 croak "The ambient_pragmas method expects an even number of args";
776 $self->{'ambient_arybase'} = $arybase;
777 $self->{'ambient_warnings'} = $warning_bits;
778 $self->{'ambient_hints'} = $hint_bits;
781 # This method is the inner loop, so try to keep it simple
786 Carp::confess("Null op in deparse") if !defined($op)
787 || class($op) eq "NULL";
788 my $meth = "pp_" . $op->name;
789 return $self->$meth($op, $cx);
795 my @lines = split(/\n/, $txt);
800 my $cmd = substr($line, 0, 1);
801 if ($cmd eq "\t" or $cmd eq "\b") {
802 $level += ($cmd eq "\t" ? 1 : -1) * $self->{'indent_size'};
803 if ($self->{'use_tabs'}) {
804 $leader = "\t" x ($level / 8) . " " x ($level % 8);
806 $leader = " " x $level;
808 $line = substr($line, 1);
810 if (substr($line, 0, 1) eq "\f") {
811 $line = substr($line, 1); # no indent
813 $line = $leader . $line;
817 return join("\n", @lines);
824 Carp::confess("NULL in deparse_sub") if !defined($cv) || $cv->isa("B::NULL");
825 Carp::confess("SPECIAL in deparse_sub") if $cv->isa("B::SPECIAL");
826 local $self->{'curcop'} = $self->{'curcop'};
827 if ($cv->FLAGS & SVf_POK) {
828 $proto = "(". $cv->PV . ") ";
830 if ($cv->CvFLAGS & (CVf_METHOD|CVf_LOCKED|CVf_LVALUE|CVf_ASSERTION)) {
832 $proto .= "lvalue " if $cv->CvFLAGS & CVf_LVALUE;
833 $proto .= "locked " if $cv->CvFLAGS & CVf_LOCKED;
834 $proto .= "method " if $cv->CvFLAGS & CVf_METHOD;
835 $proto .= "assertion " if $cv->CvFLAGS & CVf_ASSERTION;
838 local($self->{'curcv'}) = $cv;
839 local($self->{'curcvlex'});
840 local(@$self{qw'curstash warnings hints'})
841 = @$self{qw'curstash warnings hints'};
843 if (not null $cv->ROOT) {
844 my $lineseq = $cv->ROOT->first;
845 if ($lineseq->name eq "lineseq") {
847 for(my$o=$lineseq->first; $$o; $o=$o->sibling) {
850 $body = $self->lineseq(undef, @ops).";";
851 my $scope_en = $self->find_scope_en($lineseq);
852 if (defined $scope_en) {
853 my $subs = join"", $self->seq_subs($scope_en);
854 $body .= ";\n$subs" if length($subs);
858 $body = $self->deparse($cv->ROOT->first, 0);
862 my $sv = $cv->const_sv;
864 # uh-oh. inlinable sub... format it differently
865 return $proto . "{ " . $self->const($sv, 0) . " }\n";
866 } else { # XSUB? (or just a declaration)
870 return $proto ."{\n\t$body\n\b}" ."\n";
877 local($self->{'curcv'}) = $form;
878 local($self->{'curcvlex'});
879 local($self->{'in_format'}) = 1;
880 local(@$self{qw'curstash warnings hints'})
881 = @$self{qw'curstash warnings hints'};
882 my $op = $form->ROOT;
884 return "\f." if $op->first->name eq 'stub'
885 || $op->first->name eq 'nextstate';
886 $op = $op->first->first; # skip leavewrite, lineseq
887 while (not null $op) {
888 $op = $op->sibling; # skip nextstate
890 $kid = $op->first->sibling; # skip pushmark
891 push @text, "\f".$self->const_sv($kid)->PV;
892 $kid = $kid->sibling;
893 for (; not null $kid; $kid = $kid->sibling) {
894 push @exprs, $self->deparse($kid, 0);
896 push @text, "\f".join(", ", @exprs)."\n" if @exprs;
899 return join("", @text) . "\f.";
904 return $op->name eq "leave" || $op->name eq "scope"
905 || $op->name eq "lineseq"
906 || ($op->name eq "null" && class($op) eq "UNOP"
907 && (is_scope($op->first) || $op->first->name eq "enter"));
911 my $name = $_[0]->name;
912 return $name eq "nextstate" || $name eq "dbstate" || $name eq "setstate";
915 sub is_miniwhile { # check for one-line loop (`foo() while $y--')
917 return (!null($op) and null($op->sibling)
918 and $op->name eq "null" and class($op) eq "UNOP"
919 and (($op->first->name =~ /^(and|or)$/
920 and $op->first->first->sibling->name eq "lineseq")
921 or ($op->first->name eq "lineseq"
922 and not null $op->first->first->sibling
923 and $op->first->first->sibling->name eq "unstack")
927 # Check if the op and its sibling are the initialization and the rest of a
928 # for (..;..;..) { ... } loop
931 # This OP might be almost anything, though it won't be a
932 # nextstate. (It's the initialization, so in the canonical case it
933 # will be an sassign.) The sibling is a lineseq whose first child
934 # is a nextstate and whose second is a leaveloop.
935 my $lseq = $op->sibling;
936 if (!is_state $op and !null($lseq) and $lseq->name eq "lineseq") {
937 if ($lseq->first && !null($lseq->first) && is_state($lseq->first)
938 && (my $sib = $lseq->first->sibling)) {
939 return (!null($sib) && $sib->name eq "leaveloop");
947 return ($op->name eq "rv2sv" or
948 $op->name eq "padsv" or
949 $op->name eq "gv" or # only in array/hash constructs
950 $op->flags & OPf_KIDS && !null($op->first)
951 && $op->first->name eq "gvsv");
956 my($text, $cx, $prec) = @_;
957 if ($prec < $cx # unary ops nest just fine
958 or $prec == $cx and $cx != 4 and $cx != 16 and $cx != 21
959 or $self->{'parens'})
962 # In a unop, let parent reuse our parens; see maybe_parens_unop
963 $text = "\cS" . $text if $cx == 16;
970 # same as above, but get around the `if it looks like a function' rule
971 sub maybe_parens_unop {
973 my($name, $kid, $cx) = @_;
974 if ($cx > 16 or $self->{'parens'}) {
975 $kid = $self->deparse($kid, 1);
976 if ($name eq "umask" && $kid =~ /^\d+$/) {
977 $kid = sprintf("%#o", $kid);
979 return "$name($kid)";
981 $kid = $self->deparse($kid, 16);
982 if ($name eq "umask" && $kid =~ /^\d+$/) {
983 $kid = sprintf("%#o", $kid);
985 if (substr($kid, 0, 1) eq "\cS") {
987 return $name . substr($kid, 1);
988 } elsif (substr($kid, 0, 1) eq "(") {
989 # avoid looks-like-a-function trap with extra parens
990 # (`+' can lead to ambiguities)
991 return "$name(" . $kid . ")";
998 sub maybe_parens_func {
1000 my($func, $text, $cx, $prec) = @_;
1001 if ($prec <= $cx or substr($text, 0, 1) eq "(" or $self->{'parens'}) {
1002 return "$func($text)";
1004 return "$func $text";
1010 my($op, $cx, $text) = @_;
1011 my $our_intro = ($op->name =~ /^(gv|rv2)[ash]v$/) ? OPpOUR_INTRO : 0;
1012 if ($op->private & (OPpLVAL_INTRO|$our_intro)
1013 and not $self->{'avoid_local'}{$$op}) {
1014 my $our_local = ($op->private & OPpLVAL_INTRO) ? "local" : "our";
1015 if( $our_local eq 'our' ) {
1016 # XXX This assertion fails code with non-ASCII identifiers,
1017 # like ./ext/Encode/t/jperl.t
1018 die "Unexpected our($text)\n" unless $text =~ /^\W(\w+::)*\w+\z/;
1019 $text =~ s/(\w+::)+//;
1021 if (want_scalar($op)) {
1022 return "$our_local $text";
1024 return $self->maybe_parens_func("$our_local", $text, $cx, 16);
1033 my($op, $cx, $func, @args) = @_;
1034 if ($op->private & OPpTARGET_MY) {
1035 my $var = $self->padname($op->targ);
1036 my $val = $func->($self, $op, 7, @args);
1037 return $self->maybe_parens("$var = $val", $cx, 7);
1039 return $func->($self, $op, $cx, @args);
1046 return $self->{'curcv'}->PADLIST->ARRAYelt(0)->ARRAYelt($targ);
1051 my($op, $cx, $text) = @_;
1052 if ($op->private & OPpLVAL_INTRO and not $self->{'avoid_local'}{$$op}) {
1053 if (want_scalar($op)) {
1056 return $self->maybe_parens_func("my", $text, $cx, 16);
1063 # The following OPs don't have functions:
1065 # pp_padany -- does not exist after parsing
1068 if ($AUTOLOAD =~ s/^.*::pp_//) {
1069 warn "unexpected OP_".uc $AUTOLOAD;
1072 die "Undefined subroutine $AUTOLOAD called";
1076 sub DESTROY {} # Do not AUTOLOAD
1078 # $root should be the op which represents the root of whatever
1079 # we're sequencing here. If it's undefined, then we don't append
1080 # any subroutine declarations to the deparsed ops, otherwise we
1081 # append appropriate declarations.
1083 my($self, $root, @ops) = @_;
1086 my $out_cop = $self->{'curcop'};
1087 my $out_seq = defined($out_cop) ? $out_cop->cop_seq : undef;
1089 if (defined $root) {
1090 $limit_seq = $out_seq;
1092 $nseq = $self->find_scope_st($root->sibling) if ${$root->sibling};
1093 $limit_seq = $nseq if !defined($limit_seq)
1094 or defined($nseq) && $nseq < $limit_seq;
1096 $limit_seq = $self->{'limit_seq'}
1097 if defined($self->{'limit_seq'})
1098 && (!defined($limit_seq) || $self->{'limit_seq'} < $limit_seq);
1099 local $self->{'limit_seq'} = $limit_seq;
1100 for (my $i = 0; $i < @ops; $i++) {
1102 if (is_state $ops[$i]) {
1103 $expr = $self->deparse($ops[$i], 0);
1110 if (!is_state $ops[$i] and (my $ls = $ops[$i+1]) and
1111 !null($ops[$i+1]) and $ops[$i+1]->name eq "lineseq")
1113 if ($ls->first && !null($ls->first) && is_state($ls->first)
1114 && (my $sib = $ls->first->sibling)) {
1115 if (!null($sib) && $sib->name eq "leaveloop") {
1116 push @exprs, $expr . $self->for_loop($ops[$i], 0);
1122 $expr .= $self->deparse($ops[$i], (@ops != 1)/2);
1123 $expr =~ s/;\n?\z//;
1126 my $body = join(";\n", grep {length} @exprs);
1128 if (defined $root && defined $limit_seq && !$self->{'in_format'}) {
1129 $subs = join "\n", $self->seq_subs($limit_seq);
1131 return join(";\n", grep {length} $body, $subs);
1135 my($real_block, $self, $op, $cx) = @_;
1139 local(@$self{qw'curstash warnings hints'})
1140 = @$self{qw'curstash warnings hints'} if $real_block;
1142 $kid = $op->first->sibling; # skip enter
1143 if (is_miniwhile($kid)) {
1144 my $top = $kid->first;
1145 my $name = $top->name;
1146 if ($name eq "and") {
1148 } elsif ($name eq "or") {
1150 } else { # no conditional -> while 1 or until 0
1151 return $self->deparse($top->first, 1) . " while 1";
1153 my $cond = $top->first;
1154 my $body = $cond->sibling->first; # skip lineseq
1155 $cond = $self->deparse($cond, 1);
1156 $body = $self->deparse($body, 1);
1157 return "$body $name $cond";
1162 for (; !null($kid); $kid = $kid->sibling) {
1165 if ($cx > 0) { # inside an expression, (a do {} while for lineseq)
1166 return "do {\n\t" . $self->lineseq($op, @kids) . "\n\b}";
1168 my $lineseq = $self->lineseq($op, @kids);
1169 return (length ($lineseq) ? "$lineseq;" : "");
1173 sub pp_scope { scopeop(0, @_); }
1174 sub pp_lineseq { scopeop(0, @_); }
1175 sub pp_leave { scopeop(1, @_); }
1177 # This is a special case of scopeop and lineseq, for the case of the
1178 # main_root. The difference is that we print the output statements as
1179 # soon as we get them, for the sake of impatient users.
1183 local(@$self{qw'curstash warnings hints'})
1184 = @$self{qw'curstash warnings hints'};
1186 for (my $kid = $op->first->sibling; !null($kid); $kid = $kid->sibling) {
1189 for (my $i = 0; $i < @kids; $i++) {
1191 if (is_state $kids[$i]) {
1192 $expr = $self->deparse($kids[$i], 0);
1195 print $self->indent($expr);
1199 if (is_for_loop($kids[$i])) {
1200 $expr .= $self->for_loop($kids[$i], 0);
1201 $expr .= ";\n" unless $i == $#kids;
1202 print $self->indent($expr);
1206 $expr .= $self->deparse($kids[$i], (@kids != 1)/2);
1207 $expr =~ s/;\n?\z//;
1209 print $self->indent($expr);
1210 print "\n" unless $i == $#kids;
1214 # The BEGIN {} is used here because otherwise this code isn't executed
1215 # when you run B::Deparse on itself.
1217 BEGIN { map($globalnames{$_}++, "SIG", "STDIN", "STDOUT", "STDERR", "INC",
1218 "ENV", "ARGV", "ARGVOUT", "_"); }
1223 Carp::confess() unless ref($gv) eq "B::GV";
1224 my $stash = $gv->STASH->NAME;
1225 my $name = $gv->SAFENAME;
1226 if (($stash eq 'main' && $globalnames{$name})
1227 or ($stash eq $self->{'curstash'} && !$globalnames{$name})
1228 or $name =~ /^[^A-Za-z_:]/)
1232 $stash = $stash . "::";
1234 if ($name =~ /^(\^..|{)/) {
1235 $name = "{$name}"; # ${^WARNING_BITS}, etc and ${
1237 return $stash . $name;
1240 # Return the name to use for a stash variable.
1241 # If a lexical with the same name is in scope, it may need to be
1243 sub stash_variable {
1244 my ($self, $prefix, $name) = @_;
1246 return "$prefix$name" if $name =~ /::/;
1248 unless ($prefix eq '$' || $prefix eq '@' || #'
1249 $prefix eq '%' || $prefix eq '$#') {
1250 return "$prefix$name";
1253 my $v = ($prefix eq '$#' ? '@' : $prefix) . $name;
1254 return $prefix .$self->{'curstash'}.'::'. $name if $self->lex_in_scope($v);
1255 return "$prefix$name";
1259 my ($self, $name) = @_;
1260 $self->populate_curcvlex() if !defined $self->{'curcvlex'};
1262 return 0 if !defined($self->{'curcop'});
1263 my $seq = $self->{'curcop'}->cop_seq;
1264 return 0 if !exists $self->{'curcvlex'}{$name};
1265 for my $a (@{$self->{'curcvlex'}{$name}}) {
1266 my ($st, $en) = @$a;
1267 return 1 if $seq > $st && $seq <= $en;
1272 sub populate_curcvlex {
1274 for (my $cv = $self->{'curcv'}; class($cv) eq "CV"; $cv = $cv->OUTSIDE) {
1275 my $padlist = $cv->PADLIST;
1276 # an undef CV still in lexical chain
1277 next if class($padlist) eq "SPECIAL";
1278 my @padlist = $padlist->ARRAY;
1279 my @ns = $padlist[0]->ARRAY;
1281 for (my $i=0; $i<@ns; ++$i) {
1282 next if class($ns[$i]) eq "SPECIAL";
1283 next if $ns[$i]->FLAGS & SVpad_OUR; # Skip "our" vars
1284 if (class($ns[$i]) eq "PV") {
1285 # Probably that pesky lexical @_
1288 my $name = $ns[$i]->PVX;
1289 my ($seq_st, $seq_en) =
1290 ($ns[$i]->FLAGS & SVf_FAKE)
1292 : ($ns[$i]->NVX, $ns[$i]->IVX);
1294 push @{$self->{'curcvlex'}{$name}}, [$seq_st, $seq_en];
1299 sub find_scope_st { ((find_scope(@_))[0]); }
1300 sub find_scope_en { ((find_scope(@_))[1]); }
1302 # Recurses down the tree, looking for pad variable introductions and COPs
1304 my ($self, $op, $scope_st, $scope_en) = @_;
1305 carp("Undefined op in find_scope") if !defined $op;
1306 return ($scope_st, $scope_en) unless $op->flags & OPf_KIDS;
1308 for (my $o=$op->first; $$o; $o=$o->sibling) {
1309 if ($o->name =~ /^pad.v$/ && $o->private & OPpLVAL_INTRO) {
1310 my $s = int($self->padname_sv($o->targ)->NVX);
1311 my $e = $self->padname_sv($o->targ)->IVX;
1312 $scope_st = $s if !defined($scope_st) || $s < $scope_st;
1313 $scope_en = $e if !defined($scope_en) || $e > $scope_en;
1315 elsif (is_state($o)) {
1316 my $c = $o->cop_seq;
1317 $scope_st = $c if !defined($scope_st) || $c < $scope_st;
1318 $scope_en = $c if !defined($scope_en) || $c > $scope_en;
1320 elsif ($o->flags & OPf_KIDS) {
1321 ($scope_st, $scope_en) =
1322 $self->find_scope($o, $scope_st, $scope_en)
1326 return ($scope_st, $scope_en);
1329 # Returns a list of subs which should be inserted before the COP
1331 my ($self, $op, $out_seq) = @_;
1332 my $seq = $op->cop_seq;
1333 # If we have nephews, then our sequence number indicates
1334 # the cop_seq of the end of some sort of scope.
1335 if (class($op->sibling) ne "NULL" && $op->sibling->flags & OPf_KIDS
1336 and my $nseq = $self->find_scope_st($op->sibling) ) {
1339 $seq = $out_seq if defined($out_seq) && $out_seq < $seq;
1340 return $self->seq_subs($seq);
1344 my ($self, $seq) = @_;
1346 #push @text, "# ($seq)\n";
1348 return "" if !defined $seq;
1349 while (scalar(@{$self->{'subs_todo'}})
1350 and $seq > $self->{'subs_todo'}[0][0]) {
1351 push @text, $self->next_todo;
1356 # Notice how subs and formats are inserted between statements here;
1357 # also $[ assignments and pragmas.
1361 $self->{'curcop'} = $op;
1363 push @text, $self->cop_subs($op);
1364 push @text, $op->label . ": " if $op->label;
1365 my $stash = $op->stashpv;
1366 if ($stash ne $self->{'curstash'}) {
1367 push @text, "package $stash;\n";
1368 $self->{'curstash'} = $stash;
1371 if ($self->{'arybase'} != $op->arybase) {
1372 push @text, '$[ = '. $op->arybase .";\n";
1373 $self->{'arybase'} = $op->arybase;
1376 my $warnings = $op->warnings;
1378 if ($warnings->isa("B::SPECIAL") && $$warnings == 4) {
1379 $warning_bits = $warnings::Bits{"all"} & WARN_MASK;
1381 elsif ($warnings->isa("B::SPECIAL") && $$warnings == 5) {
1382 $warning_bits = $warnings::NONE;
1384 elsif ($warnings->isa("B::SPECIAL")) {
1385 $warning_bits = undef;
1388 $warning_bits = $warnings->PV & WARN_MASK;
1391 if (defined ($warning_bits) and
1392 !defined($self->{warnings}) || $self->{'warnings'} ne $warning_bits) {
1393 push @text, declare_warnings($self->{'warnings'}, $warning_bits);
1394 $self->{'warnings'} = $warning_bits;
1397 if ($self->{'hints'} != $op->private) {
1398 push @text, declare_hints($self->{'hints'}, $op->private);
1399 $self->{'hints'} = $op->private;
1402 # This should go after of any branches that add statements, to
1403 # increase the chances that it refers to the same line it did in
1404 # the original program.
1405 if ($self->{'linenums'}) {
1406 push @text, "\f#line " . $op->line .
1407 ' "' . $op->file, qq'"\n';
1410 return join("", @text);
1413 sub declare_warnings {
1414 my ($from, $to) = @_;
1415 if (($to & WARN_MASK) eq (warnings::bits("all") & WARN_MASK)) {
1416 return "use warnings;\n";
1418 elsif (($to & WARN_MASK) eq ("\0"x length($to) & WARN_MASK)) {
1419 return "no warnings;\n";
1421 return "BEGIN {\${^WARNING_BITS} = ".perlstring($to)."}\n";
1425 my ($from, $to) = @_;
1426 my $use = $to & ~$from;
1427 my $no = $from & ~$to;
1429 for my $pragma (hint_pragmas($use)) {
1430 $decls .= "use $pragma;\n";
1432 for my $pragma (hint_pragmas($no)) {
1433 $decls .= "no $pragma;\n";
1441 push @pragmas, "integer" if $bits & 0x1;
1442 push @pragmas, "strict 'refs'" if $bits & 0x2;
1443 push @pragmas, "bytes" if $bits & 0x8;
1447 sub pp_dbstate { pp_nextstate(@_) }
1448 sub pp_setstate { pp_nextstate(@_) }
1450 sub pp_unstack { return "" } # see also leaveloop
1454 my($op, $cx, $name) = @_;
1460 my($op, $cx, $name) = @_;
1468 sub pp_wantarray { baseop(@_, "wantarray") }
1469 sub pp_fork { baseop(@_, "fork") }
1470 sub pp_wait { maybe_targmy(@_, \&baseop, "wait") }
1471 sub pp_getppid { maybe_targmy(@_, \&baseop, "getppid") }
1472 sub pp_time { maybe_targmy(@_, \&baseop, "time") }
1473 sub pp_tms { baseop(@_, "times") }
1474 sub pp_ghostent { baseop(@_, "gethostent") }
1475 sub pp_gnetent { baseop(@_, "getnetent") }
1476 sub pp_gprotoent { baseop(@_, "getprotoent") }
1477 sub pp_gservent { baseop(@_, "getservent") }
1478 sub pp_ehostent { baseop(@_, "endhostent") }
1479 sub pp_enetent { baseop(@_, "endnetent") }
1480 sub pp_eprotoent { baseop(@_, "endprotoent") }
1481 sub pp_eservent { baseop(@_, "endservent") }
1482 sub pp_gpwent { baseop(@_, "getpwent") }
1483 sub pp_spwent { baseop(@_, "setpwent") }
1484 sub pp_epwent { baseop(@_, "endpwent") }
1485 sub pp_ggrent { baseop(@_, "getgrent") }
1486 sub pp_sgrent { baseop(@_, "setgrent") }
1487 sub pp_egrent { baseop(@_, "endgrent") }
1488 sub pp_getlogin { baseop(@_, "getlogin") }
1490 sub POSTFIX () { 1 }
1492 # I couldn't think of a good short name, but this is the category of
1493 # symbolic unary operators with interesting precedence
1497 my($op, $cx, $name, $prec, $flags) = (@_, 0);
1498 my $kid = $op->first;
1499 $kid = $self->deparse($kid, $prec);
1500 return $self->maybe_parens(($flags & POSTFIX) ? "$kid$name" : "$name$kid",
1504 sub pp_preinc { pfixop(@_, "++", 23) }
1505 sub pp_predec { pfixop(@_, "--", 23) }
1506 sub pp_postinc { maybe_targmy(@_, \&pfixop, "++", 23, POSTFIX) }
1507 sub pp_postdec { maybe_targmy(@_, \&pfixop, "--", 23, POSTFIX) }
1508 sub pp_i_preinc { pfixop(@_, "++", 23) }
1509 sub pp_i_predec { pfixop(@_, "--", 23) }
1510 sub pp_i_postinc { maybe_targmy(@_, \&pfixop, "++", 23, POSTFIX) }
1511 sub pp_i_postdec { maybe_targmy(@_, \&pfixop, "--", 23, POSTFIX) }
1512 sub pp_complement { maybe_targmy(@_, \&pfixop, "~", 21) }
1514 sub pp_negate { maybe_targmy(@_, \&real_negate) }
1518 if ($op->first->name =~ /^(i_)?negate$/) {
1520 $self->pfixop($op, $cx, "-", 21.5);
1522 $self->pfixop($op, $cx, "-", 21);
1525 sub pp_i_negate { pp_negate(@_) }
1531 $self->pfixop($op, $cx, "not ", 4);
1533 $self->pfixop($op, $cx, "!", 21);
1539 my($op, $cx, $name) = @_;
1541 if ($op->flags & OPf_KIDS) {
1543 if (defined prototype("CORE::$name")
1544 && prototype("CORE::$name") =~ /^;?\*/
1545 && $kid->name eq "rv2gv") {
1549 return $self->maybe_parens_unop($name, $kid, $cx);
1551 return $name . ($op->flags & OPf_SPECIAL ? "()" : "");
1555 sub pp_chop { maybe_targmy(@_, \&unop, "chop") }
1556 sub pp_chomp { maybe_targmy(@_, \&unop, "chomp") }
1557 sub pp_schop { maybe_targmy(@_, \&unop, "chop") }
1558 sub pp_schomp { maybe_targmy(@_, \&unop, "chomp") }
1559 sub pp_defined { unop(@_, "defined") }
1560 sub pp_undef { unop(@_, "undef") }
1561 sub pp_study { unop(@_, "study") }
1562 sub pp_ref { unop(@_, "ref") }
1563 sub pp_pos { maybe_local(@_, unop(@_, "pos")) }
1565 sub pp_sin { maybe_targmy(@_, \&unop, "sin") }
1566 sub pp_cos { maybe_targmy(@_, \&unop, "cos") }
1567 sub pp_rand { maybe_targmy(@_, \&unop, "rand") }
1568 sub pp_srand { unop(@_, "srand") }
1569 sub pp_exp { maybe_targmy(@_, \&unop, "exp") }
1570 sub pp_log { maybe_targmy(@_, \&unop, "log") }
1571 sub pp_sqrt { maybe_targmy(@_, \&unop, "sqrt") }
1572 sub pp_int { maybe_targmy(@_, \&unop, "int") }
1573 sub pp_hex { maybe_targmy(@_, \&unop, "hex") }
1574 sub pp_oct { maybe_targmy(@_, \&unop, "oct") }
1575 sub pp_abs { maybe_targmy(@_, \&unop, "abs") }
1577 sub pp_length { maybe_targmy(@_, \&unop, "length") }
1578 sub pp_ord { maybe_targmy(@_, \&unop, "ord") }
1579 sub pp_chr { maybe_targmy(@_, \&unop, "chr") }
1581 sub pp_each { unop(@_, "each") }
1582 sub pp_values { unop(@_, "values") }
1583 sub pp_keys { unop(@_, "keys") }
1584 sub pp_pop { unop(@_, "pop") }
1585 sub pp_shift { unop(@_, "shift") }
1587 sub pp_caller { unop(@_, "caller") }
1588 sub pp_reset { unop(@_, "reset") }
1589 sub pp_exit { unop(@_, "exit") }
1590 sub pp_prototype { unop(@_, "prototype") }
1592 sub pp_close { unop(@_, "close") }
1593 sub pp_fileno { unop(@_, "fileno") }
1594 sub pp_umask { unop(@_, "umask") }
1595 sub pp_untie { unop(@_, "untie") }
1596 sub pp_tied { unop(@_, "tied") }
1597 sub pp_dbmclose { unop(@_, "dbmclose") }
1598 sub pp_getc { unop(@_, "getc") }
1599 sub pp_eof { unop(@_, "eof") }
1600 sub pp_tell { unop(@_, "tell") }
1601 sub pp_getsockname { unop(@_, "getsockname") }
1602 sub pp_getpeername { unop(@_, "getpeername") }
1604 sub pp_chdir { maybe_targmy(@_, \&unop, "chdir") }
1605 sub pp_chroot { maybe_targmy(@_, \&unop, "chroot") }
1606 sub pp_readlink { unop(@_, "readlink") }
1607 sub pp_rmdir { maybe_targmy(@_, \&unop, "rmdir") }
1608 sub pp_readdir { unop(@_, "readdir") }
1609 sub pp_telldir { unop(@_, "telldir") }
1610 sub pp_rewinddir { unop(@_, "rewinddir") }
1611 sub pp_closedir { unop(@_, "closedir") }
1612 sub pp_getpgrp { maybe_targmy(@_, \&unop, "getpgrp") }
1613 sub pp_localtime { unop(@_, "localtime") }
1614 sub pp_gmtime { unop(@_, "gmtime") }
1615 sub pp_alarm { unop(@_, "alarm") }
1616 sub pp_sleep { maybe_targmy(@_, \&unop, "sleep") }
1618 sub pp_dofile { unop(@_, "do") }
1619 sub pp_entereval { unop(@_, "eval") }
1621 sub pp_ghbyname { unop(@_, "gethostbyname") }
1622 sub pp_gnbyname { unop(@_, "getnetbyname") }
1623 sub pp_gpbyname { unop(@_, "getprotobyname") }
1624 sub pp_shostent { unop(@_, "sethostent") }
1625 sub pp_snetent { unop(@_, "setnetent") }
1626 sub pp_sprotoent { unop(@_, "setprotoent") }
1627 sub pp_sservent { unop(@_, "setservent") }
1628 sub pp_gpwnam { unop(@_, "getpwnam") }
1629 sub pp_gpwuid { unop(@_, "getpwuid") }
1630 sub pp_ggrnam { unop(@_, "getgrnam") }
1631 sub pp_ggrgid { unop(@_, "getgrgid") }
1633 sub pp_lock { unop(@_, "lock") }
1639 if ($op->private & OPpEXISTS_SUB) {
1640 # Checking for the existence of a subroutine
1641 return $self->maybe_parens_func("exists",
1642 $self->pp_rv2cv($op->first, 16), $cx, 16);
1644 if ($op->flags & OPf_SPECIAL) {
1645 # Array element, not hash element
1646 return $self->maybe_parens_func("exists",
1647 $self->pp_aelem($op->first, 16), $cx, 16);
1649 return $self->maybe_parens_func("exists", $self->pp_helem($op->first, 16),
1657 if ($op->private & OPpSLICE) {
1658 if ($op->flags & OPf_SPECIAL) {
1659 # Deleting from an array, not a hash
1660 return $self->maybe_parens_func("delete",
1661 $self->pp_aslice($op->first, 16),
1664 return $self->maybe_parens_func("delete",
1665 $self->pp_hslice($op->first, 16),
1668 if ($op->flags & OPf_SPECIAL) {
1669 # Deleting from an array, not a hash
1670 return $self->maybe_parens_func("delete",
1671 $self->pp_aelem($op->first, 16),
1674 return $self->maybe_parens_func("delete",
1675 $self->pp_helem($op->first, 16),
1683 my $opname = $op->flags & OPf_SPECIAL ? 'CORE::require' : 'require';
1684 if (class($op) eq "UNOP" and $op->first->name eq "const"
1685 and $op->first->private & OPpCONST_BARE)
1687 my $name = $self->const_sv($op->first)->PV;
1690 return "$opname $name";
1692 $self->unop($op, $cx, $opname);
1699 my $kid = $op->first;
1700 if (not null $kid->sibling) {
1701 # XXX Was a here-doc
1702 return $self->dquote($op);
1704 $self->unop(@_, "scalar");
1711 return $self->{'curcv'}->PADLIST->ARRAYelt(1)->ARRAYelt($targ);
1717 my $kid = $op->first;
1718 if ($kid->name eq "null") {
1720 if ($kid->name eq "anonlist" || $kid->name eq "anonhash") {
1721 my($pre, $post) = @{{"anonlist" => ["[","]"],
1722 "anonhash" => ["{","}"]}->{$kid->name}};
1724 $kid = $kid->first->sibling; # skip pushmark
1725 for (; !null($kid); $kid = $kid->sibling) {
1726 $expr = $self->deparse($kid, 6);
1729 return $pre . join(", ", @exprs) . $post;
1730 } elsif (!null($kid->sibling) and
1731 $kid->sibling->name eq "anoncode") {
1733 $self->deparse_sub($self->padval($kid->sibling->targ));
1734 } elsif ($kid->name eq "pushmark") {
1735 my $sib_name = $kid->sibling->name;
1736 if ($sib_name =~ /^(pad|rv2)[ah]v$/
1737 and not $kid->sibling->flags & OPf_REF)
1739 # The @a in \(@a) isn't in ref context, but only when the
1741 return "\\(" . $self->pp_list($op->first) . ")";
1742 } elsif ($sib_name eq 'entersub') {
1743 my $text = $self->deparse($kid->sibling, 1);
1744 # Always show parens for \(&func()), but only with -p otherwise
1745 $text = "($text)" if $self->{'parens'}
1746 or $kid->sibling->private & OPpENTERSUB_AMPER;
1751 $self->pfixop($op, $cx, "\\", 20);
1754 sub pp_srefgen { pp_refgen(@_) }
1759 my $kid = $op->first;
1760 $kid = $kid->first if $kid->name eq "rv2gv"; # <$fh>
1761 return "<" . $self->deparse($kid, 1) . ">" if is_scalar($kid);
1762 return $self->unop($op, $cx, "readline");
1768 return "<" . $self->gv_name($self->gv_or_padgv($op)) . ">";
1771 # Unary operators that can occur as pseudo-listops inside double quotes
1774 my($op, $cx, $name, $prec, $flags) = (@_, 0, 0);
1776 if ($op->flags & OPf_KIDS) {
1778 # If there's more than one kid, the first is an ex-pushmark.
1779 $kid = $kid->sibling if not null $kid->sibling;
1780 return $self->maybe_parens_unop($name, $kid, $cx);
1782 return $name . ($op->flags & OPf_SPECIAL ? "()" : "");
1786 sub pp_ucfirst { dq_unop(@_, "ucfirst") }
1787 sub pp_lcfirst { dq_unop(@_, "lcfirst") }
1788 sub pp_uc { dq_unop(@_, "uc") }
1789 sub pp_lc { dq_unop(@_, "lc") }
1790 sub pp_quotemeta { maybe_targmy(@_, \&dq_unop, "quotemeta") }
1794 my ($op, $cx, $name) = @_;
1795 if (class($op) eq "PVOP") {
1796 return "$name " . $op->pv;
1797 } elsif (class($op) eq "OP") {
1799 } elsif (class($op) eq "UNOP") {
1800 # Note -- loop exits are actually exempt from the
1801 # looks-like-a-func rule, but a few extra parens won't hurt
1802 return $self->maybe_parens_unop($name, $op->first, $cx);
1806 sub pp_last { loopex(@_, "last") }
1807 sub pp_next { loopex(@_, "next") }
1808 sub pp_redo { loopex(@_, "redo") }
1809 sub pp_goto { loopex(@_, "goto") }
1810 sub pp_dump { loopex(@_, "dump") }
1814 my($op, $cx, $name) = @_;
1815 if (class($op) eq "UNOP") {
1816 # Genuine `-X' filetests are exempt from the LLAFR, but not
1817 # l?stat(); for the sake of clarity, give'em all parens
1818 return $self->maybe_parens_unop($name, $op->first, $cx);
1819 } elsif (class($op) =~ /^(SV|PAD)OP$/) {
1820 return $self->maybe_parens_func($name, $self->pp_gv($op, 1), $cx, 16);
1821 } else { # I don't think baseop filetests ever survive ck_ftst, but...
1826 sub pp_lstat { ftst(@_, "lstat") }
1827 sub pp_stat { ftst(@_, "stat") }
1828 sub pp_ftrread { ftst(@_, "-R") }
1829 sub pp_ftrwrite { ftst(@_, "-W") }
1830 sub pp_ftrexec { ftst(@_, "-X") }
1831 sub pp_fteread { ftst(@_, "-r") }
1832 sub pp_ftewrite { ftst(@_, "-w") }
1833 sub pp_fteexec { ftst(@_, "-x") }
1834 sub pp_ftis { ftst(@_, "-e") }
1835 sub pp_fteowned { ftst(@_, "-O") }
1836 sub pp_ftrowned { ftst(@_, "-o") }
1837 sub pp_ftzero { ftst(@_, "-z") }
1838 sub pp_ftsize { ftst(@_, "-s") }
1839 sub pp_ftmtime { ftst(@_, "-M") }
1840 sub pp_ftatime { ftst(@_, "-A") }
1841 sub pp_ftctime { ftst(@_, "-C") }
1842 sub pp_ftsock { ftst(@_, "-S") }
1843 sub pp_ftchr { ftst(@_, "-c") }
1844 sub pp_ftblk { ftst(@_, "-b") }
1845 sub pp_ftfile { ftst(@_, "-f") }
1846 sub pp_ftdir { ftst(@_, "-d") }
1847 sub pp_ftpipe { ftst(@_, "-p") }
1848 sub pp_ftlink { ftst(@_, "-l") }
1849 sub pp_ftsuid { ftst(@_, "-u") }
1850 sub pp_ftsgid { ftst(@_, "-g") }
1851 sub pp_ftsvtx { ftst(@_, "-k") }
1852 sub pp_fttty { ftst(@_, "-t") }
1853 sub pp_fttext { ftst(@_, "-T") }
1854 sub pp_ftbinary { ftst(@_, "-B") }
1856 sub SWAP_CHILDREN () { 1 }
1857 sub ASSIGN () { 2 } # has OP= variant
1858 sub LIST_CONTEXT () { 4 } # Assignment is in list context
1864 my $name = $op->name;
1865 if ($name eq "concat" and $op->first->name eq "concat") {
1866 # avoid spurious `=' -- see comment in pp_concat
1869 if ($name eq "null" and class($op) eq "UNOP"
1870 and $op->first->name =~ /^(and|x?or)$/
1871 and null $op->first->sibling)
1873 # Like all conditional constructs, OP_ANDs and OP_ORs are topped
1874 # with a null that's used as the common end point of the two
1875 # flows of control. For precedence purposes, ignore it.
1876 # (COND_EXPRs have these too, but we don't bother with
1877 # their associativity).
1878 return assoc_class($op->first);
1880 return $name . ($op->flags & OPf_STACKED ? "=" : "");
1883 # Left associative operators, like `+', for which
1884 # $a + $b + $c is equivalent to ($a + $b) + $c
1887 %left = ('multiply' => 19, 'i_multiply' => 19,
1888 'divide' => 19, 'i_divide' => 19,
1889 'modulo' => 19, 'i_modulo' => 19,
1891 'add' => 18, 'i_add' => 18,
1892 'subtract' => 18, 'i_subtract' => 18,
1894 'left_shift' => 17, 'right_shift' => 17,
1896 'bit_or' => 12, 'bit_xor' => 12,
1898 'or' => 2, 'xor' => 2,
1902 sub deparse_binop_left {
1904 my($op, $left, $prec) = @_;
1905 if ($left{assoc_class($op)} && $left{assoc_class($left)}
1906 and $left{assoc_class($op)} == $left{assoc_class($left)})
1908 return $self->deparse($left, $prec - .00001);
1910 return $self->deparse($left, $prec);
1914 # Right associative operators, like `=', for which
1915 # $a = $b = $c is equivalent to $a = ($b = $c)
1918 %right = ('pow' => 22,
1919 'sassign=' => 7, 'aassign=' => 7,
1920 'multiply=' => 7, 'i_multiply=' => 7,
1921 'divide=' => 7, 'i_divide=' => 7,
1922 'modulo=' => 7, 'i_modulo=' => 7,
1924 'add=' => 7, 'i_add=' => 7,
1925 'subtract=' => 7, 'i_subtract=' => 7,
1927 'left_shift=' => 7, 'right_shift=' => 7,
1929 'bit_or=' => 7, 'bit_xor=' => 7,
1935 sub deparse_binop_right {
1937 my($op, $right, $prec) = @_;
1938 if ($right{assoc_class($op)} && $right{assoc_class($right)}
1939 and $right{assoc_class($op)} == $right{assoc_class($right)})
1941 return $self->deparse($right, $prec - .00001);
1943 return $self->deparse($right, $prec);
1949 my ($op, $cx, $opname, $prec, $flags) = (@_, 0);
1950 my $left = $op->first;
1951 my $right = $op->last;
1953 if ($op->flags & OPf_STACKED && $flags & ASSIGN) {
1957 if ($flags & SWAP_CHILDREN) {
1958 ($left, $right) = ($right, $left);
1960 $left = $self->deparse_binop_left($op, $left, $prec);
1961 $left = "($left)" if $flags & LIST_CONTEXT
1962 && $left !~ /^(my|our|local|)[\@\(]/;
1963 $right = $self->deparse_binop_right($op, $right, $prec);
1964 return $self->maybe_parens("$left $opname$eq $right", $cx, $prec);
1967 sub pp_add { maybe_targmy(@_, \&binop, "+", 18, ASSIGN) }
1968 sub pp_multiply { maybe_targmy(@_, \&binop, "*", 19, ASSIGN) }
1969 sub pp_subtract { maybe_targmy(@_, \&binop, "-",18, ASSIGN) }
1970 sub pp_divide { maybe_targmy(@_, \&binop, "/", 19, ASSIGN) }
1971 sub pp_modulo { maybe_targmy(@_, \&binop, "%", 19, ASSIGN) }
1972 sub pp_i_add { maybe_targmy(@_, \&binop, "+", 18, ASSIGN) }
1973 sub pp_i_multiply { maybe_targmy(@_, \&binop, "*", 19, ASSIGN) }
1974 sub pp_i_subtract { maybe_targmy(@_, \&binop, "-", 18, ASSIGN) }
1975 sub pp_i_divide { maybe_targmy(@_, \&binop, "/", 19, ASSIGN) }
1976 sub pp_i_modulo { maybe_targmy(@_, \&binop, "%", 19, ASSIGN) }
1977 sub pp_pow { maybe_targmy(@_, \&binop, "**", 22, ASSIGN) }
1979 sub pp_left_shift { maybe_targmy(@_, \&binop, "<<", 17, ASSIGN) }
1980 sub pp_right_shift { maybe_targmy(@_, \&binop, ">>", 17, ASSIGN) }
1981 sub pp_bit_and { maybe_targmy(@_, \&binop, "&", 13, ASSIGN) }
1982 sub pp_bit_or { maybe_targmy(@_, \&binop, "|", 12, ASSIGN) }
1983 sub pp_bit_xor { maybe_targmy(@_, \&binop, "^", 12, ASSIGN) }
1985 sub pp_eq { binop(@_, "==", 14) }
1986 sub pp_ne { binop(@_, "!=", 14) }
1987 sub pp_lt { binop(@_, "<", 15) }
1988 sub pp_gt { binop(@_, ">", 15) }
1989 sub pp_ge { binop(@_, ">=", 15) }
1990 sub pp_le { binop(@_, "<=", 15) }
1991 sub pp_ncmp { binop(@_, "<=>", 14) }
1992 sub pp_i_eq { binop(@_, "==", 14) }
1993 sub pp_i_ne { binop(@_, "!=", 14) }
1994 sub pp_i_lt { binop(@_, "<", 15) }
1995 sub pp_i_gt { binop(@_, ">", 15) }
1996 sub pp_i_ge { binop(@_, ">=", 15) }
1997 sub pp_i_le { binop(@_, "<=", 15) }
1998 sub pp_i_ncmp { binop(@_, "<=>", 14) }
2000 sub pp_seq { binop(@_, "eq", 14) }
2001 sub pp_sne { binop(@_, "ne", 14) }
2002 sub pp_slt { binop(@_, "lt", 15) }
2003 sub pp_sgt { binop(@_, "gt", 15) }
2004 sub pp_sge { binop(@_, "ge", 15) }
2005 sub pp_sle { binop(@_, "le", 15) }
2006 sub pp_scmp { binop(@_, "cmp", 14) }
2008 sub pp_sassign { binop(@_, "=", 7, SWAP_CHILDREN) }
2009 sub pp_aassign { binop(@_, "=", 7, SWAP_CHILDREN | LIST_CONTEXT) }
2011 # `.' is special because concats-of-concats are optimized to save copying
2012 # by making all but the first concat stacked. The effect is as if the
2013 # programmer had written `($a . $b) .= $c', except legal.
2014 sub pp_concat { maybe_targmy(@_, \&real_concat) }
2018 my $left = $op->first;
2019 my $right = $op->last;
2022 if ($op->flags & OPf_STACKED and $op->first->name ne "concat") {
2026 $left = $self->deparse_binop_left($op, $left, $prec);
2027 $right = $self->deparse_binop_right($op, $right, $prec);
2028 return $self->maybe_parens("$left .$eq $right", $cx, $prec);
2031 # `x' is weird when the left arg is a list
2035 my $left = $op->first;
2036 my $right = $op->last;
2039 if ($op->flags & OPf_STACKED) {
2043 if (null($right)) { # list repeat; count is inside left-side ex-list
2044 my $kid = $left->first->sibling; # skip pushmark
2046 for (; !null($kid->sibling); $kid = $kid->sibling) {
2047 push @exprs, $self->deparse($kid, 6);
2050 $left = "(" . join(", ", @exprs). ")";
2052 $left = $self->deparse_binop_left($op, $left, $prec);
2054 $right = $self->deparse_binop_right($op, $right, $prec);
2055 return $self->maybe_parens("$left x$eq $right", $cx, $prec);
2060 my ($op, $cx, $type) = @_;
2061 my $left = $op->first;
2062 my $right = $left->sibling;
2063 $left = $self->deparse($left, 9);
2064 $right = $self->deparse($right, 9);
2065 return $self->maybe_parens("$left $type $right", $cx, 9);
2071 my $flip = $op->first;
2072 my $type = ($flip->flags & OPf_SPECIAL) ? "..." : "..";
2073 return $self->range($flip->first, $cx, $type);
2076 # one-line while/until is handled in pp_leave
2080 my ($op, $cx, $lowop, $lowprec, $highop, $highprec, $blockname) = @_;
2081 my $left = $op->first;
2082 my $right = $op->first->sibling;
2083 if ($cx < 1 and is_scope($right) and $blockname
2084 and $self->{'expand'} < 7)
2086 $left = $self->deparse($left, 1);
2087 $right = $self->deparse($right, 0);
2088 return "$blockname ($left) {\n\t$right\n\b}\cK";
2089 } elsif ($cx < 1 and $blockname and not $self->{'parens'}
2090 and $self->{'expand'} < 7) { # $b if $a
2091 $right = $self->deparse($right, 1);
2092 $left = $self->deparse($left, 1);
2093 return "$right $blockname $left";
2094 } elsif ($cx > $lowprec and $highop) { # $a && $b
2095 $left = $self->deparse_binop_left($op, $left, $highprec);
2096 $right = $self->deparse_binop_right($op, $right, $highprec);
2097 return $self->maybe_parens("$left $highop $right", $cx, $highprec);
2098 } else { # $a and $b
2099 $left = $self->deparse_binop_left($op, $left, $lowprec);
2100 $right = $self->deparse_binop_right($op, $right, $lowprec);
2101 return $self->maybe_parens("$left $lowop $right", $cx, $lowprec);
2105 sub pp_and { logop(@_, "and", 3, "&&", 11, "if") }
2106 sub pp_or { logop(@_, "or", 2, "||", 10, "unless") }
2107 sub pp_dor { logop(@_, "err", 2, "//", 10, "") }
2109 # xor is syntactically a logop, but it's really a binop (contrary to
2110 # old versions of opcode.pl). Syntax is what matters here.
2111 sub pp_xor { logop(@_, "xor", 2, "", 0, "") }
2115 my ($op, $cx, $opname) = @_;
2116 my $left = $op->first;
2117 my $right = $op->first->sibling->first; # skip sassign
2118 $left = $self->deparse($left, 7);
2119 $right = $self->deparse($right, 7);
2120 return $self->maybe_parens("$left $opname $right", $cx, 7);
2123 sub pp_andassign { logassignop(@_, "&&=") }
2124 sub pp_orassign { logassignop(@_, "||=") }
2125 sub pp_dorassign { logassignop(@_, "//=") }
2129 my($op, $cx, $name) = @_;
2131 my $parens = ($cx >= 5) || $self->{'parens'};
2132 my $kid = $op->first->sibling;
2133 return $name if null $kid;
2135 $name = "socketpair" if $name eq "sockpair";
2136 my $proto = prototype("CORE::$name");
2138 && $proto =~ /^;?\*/
2139 && $kid->name eq "rv2gv") {
2140 $first = $self->deparse($kid->first, 6);
2143 $first = $self->deparse($kid, 6);
2145 if ($name eq "chmod" && $first =~ /^\d+$/) {
2146 $first = sprintf("%#o", $first);
2148 $first = "+$first" if not $parens and substr($first, 0, 1) eq "(";
2149 push @exprs, $first;
2150 $kid = $kid->sibling;
2151 if (defined $proto && $proto =~ /^\*\*/ && $kid->name eq "rv2gv") {
2152 push @exprs, $self->deparse($kid->first, 6);
2153 $kid = $kid->sibling;
2155 for (; !null($kid); $kid = $kid->sibling) {
2156 push @exprs, $self->deparse($kid, 6);
2159 return "$name(" . join(", ", @exprs) . ")";
2161 return "$name " . join(", ", @exprs);
2165 sub pp_bless { listop(@_, "bless") }
2166 sub pp_atan2 { maybe_targmy(@_, \&listop, "atan2") }
2167 sub pp_substr { maybe_local(@_, listop(@_, "substr")) }
2168 sub pp_vec { maybe_local(@_, listop(@_, "vec")) }
2169 sub pp_index { maybe_targmy(@_, \&listop, "index") }
2170 sub pp_rindex { maybe_targmy(@_, \&listop, "rindex") }
2171 sub pp_sprintf { maybe_targmy(@_, \&listop, "sprintf") }
2172 sub pp_formline { listop(@_, "formline") } # see also deparse_format
2173 sub pp_crypt { maybe_targmy(@_, \&listop, "crypt") }
2174 sub pp_unpack { listop(@_, "unpack") }
2175 sub pp_pack { listop(@_, "pack") }
2176 sub pp_join { maybe_targmy(@_, \&listop, "join") }
2177 sub pp_splice { listop(@_, "splice") }
2178 sub pp_push { maybe_targmy(@_, \&listop, "push") }
2179 sub pp_unshift { maybe_targmy(@_, \&listop, "unshift") }
2180 sub pp_reverse { listop(@_, "reverse") }
2181 sub pp_warn { listop(@_, "warn") }
2182 sub pp_die { listop(@_, "die") }
2183 # Actually, return is exempt from the LLAFR (see examples in this very
2184 # module!), but for consistency's sake, ignore that fact
2185 sub pp_return { listop(@_, "return") }
2186 sub pp_open { listop(@_, "open") }
2187 sub pp_pipe_op { listop(@_, "pipe") }
2188 sub pp_tie { listop(@_, "tie") }
2189 sub pp_binmode { listop(@_, "binmode") }
2190 sub pp_dbmopen { listop(@_, "dbmopen") }
2191 sub pp_sselect { listop(@_, "select") }
2192 sub pp_select { listop(@_, "select") }
2193 sub pp_read { listop(@_, "read") }
2194 sub pp_sysopen { listop(@_, "sysopen") }
2195 sub pp_sysseek { listop(@_, "sysseek") }
2196 sub pp_sysread { listop(@_, "sysread") }
2197 sub pp_syswrite { listop(@_, "syswrite") }
2198 sub pp_send { listop(@_, "send") }
2199 sub pp_recv { listop(@_, "recv") }
2200 sub pp_seek { listop(@_, "seek") }
2201 sub pp_fcntl { listop(@_, "fcntl") }
2202 sub pp_ioctl { listop(@_, "ioctl") }
2203 sub pp_flock { maybe_targmy(@_, \&listop, "flock") }
2204 sub pp_socket { listop(@_, "socket") }
2205 sub pp_sockpair { listop(@_, "sockpair") }
2206 sub pp_bind { listop(@_, "bind") }
2207 sub pp_connect { listop(@_, "connect") }
2208 sub pp_listen { listop(@_, "listen") }
2209 sub pp_accept { listop(@_, "accept") }
2210 sub pp_shutdown { listop(@_, "shutdown") }
2211 sub pp_gsockopt { listop(@_, "getsockopt") }
2212 sub pp_ssockopt { listop(@_, "setsockopt") }
2213 sub pp_chown { maybe_targmy(@_, \&listop, "chown") }
2214 sub pp_unlink { maybe_targmy(@_, \&listop, "unlink") }
2215 sub pp_chmod { maybe_targmy(@_, \&listop, "chmod") }
2216 sub pp_utime { maybe_targmy(@_, \&listop, "utime") }
2217 sub pp_rename { maybe_targmy(@_, \&listop, "rename") }
2218 sub pp_link { maybe_targmy(@_, \&listop, "link") }
2219 sub pp_symlink { maybe_targmy(@_, \&listop, "symlink") }
2220 sub pp_mkdir { maybe_targmy(@_, \&listop, "mkdir") }
2221 sub pp_open_dir { listop(@_, "opendir") }
2222 sub pp_seekdir { listop(@_, "seekdir") }
2223 sub pp_waitpid { maybe_targmy(@_, \&listop, "waitpid") }
2224 sub pp_system { maybe_targmy(@_, \&listop, "system") }
2225 sub pp_exec { maybe_targmy(@_, \&listop, "exec") }
2226 sub pp_kill { maybe_targmy(@_, \&listop, "kill") }
2227 sub pp_setpgrp { maybe_targmy(@_, \&listop, "setpgrp") }
2228 sub pp_getpriority { maybe_targmy(@_, \&listop, "getpriority") }
2229 sub pp_setpriority { maybe_targmy(@_, \&listop, "setpriority") }
2230 sub pp_shmget { listop(@_, "shmget") }
2231 sub pp_shmctl { listop(@_, "shmctl") }
2232 sub pp_shmread { listop(@_, "shmread") }
2233 sub pp_shmwrite { listop(@_, "shmwrite") }
2234 sub pp_msgget { listop(@_, "msgget") }
2235 sub pp_msgctl { listop(@_, "msgctl") }
2236 sub pp_msgsnd { listop(@_, "msgsnd") }
2237 sub pp_msgrcv { listop(@_, "msgrcv") }
2238 sub pp_semget { listop(@_, "semget") }
2239 sub pp_semctl { listop(@_, "semctl") }
2240 sub pp_semop { listop(@_, "semop") }
2241 sub pp_ghbyaddr { listop(@_, "gethostbyaddr") }
2242 sub pp_gnbyaddr { listop(@_, "getnetbyaddr") }
2243 sub pp_gpbynumber { listop(@_, "getprotobynumber") }
2244 sub pp_gsbyname { listop(@_, "getservbyname") }
2245 sub pp_gsbyport { listop(@_, "getservbyport") }
2246 sub pp_syscall { listop(@_, "syscall") }
2251 my $text = $self->dq($op->first->sibling); # skip pushmark
2252 if ($text =~ /^\$?(\w|::|\`)+$/ # could look like a readline
2253 or $text =~ /[<>]/) {
2254 return 'glob(' . single_delim('qq', '"', $text) . ')';
2256 return '<' . $text . '>';
2260 # Truncate is special because OPf_SPECIAL makes a bareword first arg
2261 # be a filehandle. This could probably be better fixed in the core
2262 # by moving the GV lookup into ck_truc.
2268 my $parens = ($cx >= 5) || $self->{'parens'};
2269 my $kid = $op->first->sibling;
2271 if ($op->flags & OPf_SPECIAL) {
2272 # $kid is an OP_CONST
2273 $fh = $self->const_sv($kid)->PV;
2275 $fh = $self->deparse($kid, 6);
2276 $fh = "+$fh" if not $parens and substr($fh, 0, 1) eq "(";
2278 my $len = $self->deparse($kid->sibling, 6);
2280 return "truncate($fh, $len)";
2282 return "truncate $fh, $len";
2288 my($op, $cx, $name) = @_;
2290 my $kid = $op->first->sibling;
2292 if ($op->flags & OPf_STACKED) {
2294 $indir = $indir->first; # skip rv2gv
2295 if (is_scope($indir)) {
2296 $indir = "{" . $self->deparse($indir, 0) . "}";
2297 $indir = "{;}" if $indir eq "{}";
2298 } elsif ($indir->name eq "const" && $indir->private & OPpCONST_BARE) {
2299 $indir = $self->const_sv($indir)->PV;
2301 $indir = $self->deparse($indir, 24);
2303 $indir = $indir . " ";
2304 $kid = $kid->sibling;
2306 if ($name eq "sort" && $op->private & (OPpSORT_NUMERIC | OPpSORT_INTEGER)) {
2307 $indir = ($op->private & OPpSORT_DESCEND) ? '{$b <=> $a} '
2310 elsif ($name eq "sort" && $op->private & OPpSORT_DESCEND) {
2311 $indir = '{$b cmp $a} ';
2313 for (; !null($kid); $kid = $kid->sibling) {
2314 $expr = $self->deparse($kid, 6);
2318 if ($name eq "sort" && $op->private & OPpSORT_REVERSE) {
2319 $name2 = 'reverse sort';
2321 if ($name eq "sort" && ($op->private & OPpSORT_INPLACE)) {
2322 return "$exprs[0] = $name2 $indir $exprs[0]";
2325 my $args = $indir . join(", ", @exprs);
2326 if ($indir ne "" and $name eq "sort") {
2327 # We don't want to say "sort(f 1, 2, 3)", since perl -w will
2328 # give bareword warnings in that case. Therefore if context
2329 # requires, we'll put parens around the outside "(sort f 1, 2,
2330 # 3)". Unfortunately, we'll currently think the parens are
2331 # necessary more often that they really are, because we don't
2332 # distinguish which side of an assignment we're on.
2334 return "($name2 $args)";
2336 return "$name2 $args";
2339 return $self->maybe_parens_func($name2, $args, $cx, 5);
2344 sub pp_prtf { indirop(@_, "printf") }
2345 sub pp_print { indirop(@_, "print") }
2346 sub pp_sort { indirop(@_, "sort") }
2350 my($op, $cx, $name) = @_;
2352 my $kid = $op->first; # this is the (map|grep)start
2353 $kid = $kid->first->sibling; # skip a pushmark
2354 my $code = $kid->first; # skip a null
2355 if (is_scope $code) {
2356 $code = "{" . $self->deparse($code, 0) . "} ";
2358 $code = $self->deparse($code, 24) . ", ";
2360 $kid = $kid->sibling;
2361 for (; !null($kid); $kid = $kid->sibling) {
2362 $expr = $self->deparse($kid, 6);
2363 push @exprs, $expr if defined $expr;
2365 return $self->maybe_parens_func($name, $code . join(", ", @exprs), $cx, 5);
2368 sub pp_mapwhile { mapop(@_, "map") }
2369 sub pp_grepwhile { mapop(@_, "grep") }
2370 sub pp_mapstart { baseop(@_, "map") }
2371 sub pp_grepstart { baseop(@_, "grep") }
2377 my $kid = $op->first->sibling; # skip pushmark
2379 my $local = "either"; # could be local(...), my(...) or our(...)
2380 for ($lop = $kid; !null($lop); $lop = $lop->sibling) {
2381 # This assumes that no other private flags equal 128, and that
2382 # OPs that store things other than flags in their op_private,
2383 # like OP_AELEMFAST, won't be immediate children of a list.
2385 # OP_ENTERSUB can break this logic, so check for it.
2386 # I suspect that open and exit can too.
2388 if (!($lop->private & (OPpLVAL_INTRO|OPpOUR_INTRO)
2389 or $lop->name eq "undef")
2390 or $lop->name eq "entersub"
2391 or $lop->name eq "exit"
2392 or $lop->name eq "open")
2394 $local = ""; # or not
2397 if ($lop->name =~ /^pad[ash]v$/) { # my()
2398 ($local = "", last) if $local eq "local" || $local eq "our";
2400 } elsif ($lop->name =~ /^(gv|rv2)[ash]v$/
2401 && $lop->private & OPpOUR_INTRO
2402 or $lop->name eq "null" && $lop->first->name eq "gvsv"
2403 && $lop->first->private & OPpOUR_INTRO) { # our()
2404 ($local = "", last) if $local eq "my" || $local eq "local";
2406 } elsif ($lop->name ne "undef"
2407 # specifically avoid the "reverse sort" optimisation,
2408 # where "reverse" is nullified
2409 && !($lop->name eq 'sort' && ($lop->flags & OPpSORT_REVERSE)))
2412 ($local = "", last) if $local eq "my" || $local eq "our";
2416 $local = "" if $local eq "either"; # no point if it's all undefs
2417 return $self->deparse($kid, $cx) if null $kid->sibling and not $local;
2418 for (; !null($kid); $kid = $kid->sibling) {
2420 if (class($kid) eq "UNOP" and $kid->first->name eq "gvsv") {
2425 $self->{'avoid_local'}{$$lop}++;
2426 $expr = $self->deparse($kid, 6);
2427 delete $self->{'avoid_local'}{$$lop};
2429 $expr = $self->deparse($kid, 6);
2434 return "$local(" . join(", ", @exprs) . ")";
2436 return $self->maybe_parens( join(", ", @exprs), $cx, 6);
2440 sub is_ifelse_cont {
2442 return ($op->name eq "null" and class($op) eq "UNOP"
2443 and $op->first->name =~ /^(and|cond_expr)$/
2444 and is_scope($op->first->first->sibling));
2450 my $cond = $op->first;
2451 my $true = $cond->sibling;
2452 my $false = $true->sibling;
2453 my $cuddle = $self->{'cuddle'};
2454 unless ($cx < 1 and (is_scope($true) and $true->name ne "null") and
2455 (is_scope($false) || is_ifelse_cont($false))
2456 and $self->{'expand'} < 7) {
2457 $cond = $self->deparse($cond, 8);
2458 $true = $self->deparse($true, 8);
2459 $false = $self->deparse($false, 8);
2460 return $self->maybe_parens("$cond ? $true : $false", $cx, 8);
2463 $cond = $self->deparse($cond, 1);
2464 $true = $self->deparse($true, 0);
2465 my $head = "if ($cond) {\n\t$true\n\b}";
2467 while (!null($false) and is_ifelse_cont($false)) {
2468 my $newop = $false->first;
2469 my $newcond = $newop->first;
2470 my $newtrue = $newcond->sibling;
2471 $false = $newtrue->sibling; # last in chain is OP_AND => no else
2472 $newcond = $self->deparse($newcond, 1);
2473 $newtrue = $self->deparse($newtrue, 0);
2474 push @elsifs, "elsif ($newcond) {\n\t$newtrue\n\b}";
2476 if (!null($false)) {
2477 $false = $cuddle . "else {\n\t" .
2478 $self->deparse($false, 0) . "\n\b}\cK";
2482 return $head . join($cuddle, "", @elsifs) . $false;
2487 my($op, $cx, $init) = @_;
2488 my $enter = $op->first;
2489 my $kid = $enter->sibling;
2490 local(@$self{qw'curstash warnings hints'})
2491 = @$self{qw'curstash warnings hints'};
2496 if ($kid->name eq "lineseq") { # bare or infinite loop
2497 if ($kid->last->name eq "unstack") { # infinite
2498 $head = "while (1) "; # Can't use for(;;) if there's a continue
2504 } elsif ($enter->name eq "enteriter") { # foreach
2505 my $ary = $enter->first->sibling; # first was pushmark
2506 my $var = $ary->sibling;
2507 if ($ary->name eq 'null' and $enter->private & OPpITER_REVERSED) {
2508 # "reverse" was optimised away
2509 $ary = listop($self, $ary->first->sibling, 1, 'reverse');
2510 } elsif ($enter->flags & OPf_STACKED
2511 and not null $ary->first->sibling->sibling)
2513 $ary = $self->deparse($ary->first->sibling, 9) . " .. " .
2514 $self->deparse($ary->first->sibling->sibling, 9);
2516 $ary = $self->deparse($ary, 1);
2519 if ($enter->flags & OPf_SPECIAL) { # thread special var
2520 $var = $self->pp_threadsv($enter, 1);
2521 } else { # regular my() variable
2522 $var = $self->pp_padsv($enter, 1);
2524 } elsif ($var->name eq "rv2gv") {
2525 $var = $self->pp_rv2sv($var, 1);
2526 if ($enter->private & OPpOUR_INTRO) {
2527 # our declarations don't have package names
2528 $var =~ s/^(.).*::/$1/;
2531 } elsif ($var->name eq "gv") {
2532 $var = "\$" . $self->deparse($var, 1);
2534 $body = $kid->first->first->sibling; # skip OP_AND and OP_ITER
2535 if (!is_state $body->first and $body->first->name ne "stub") {
2536 confess unless $var eq '$_';
2537 $body = $body->first;
2538 return $self->deparse($body, 2) . " foreach ($ary)";
2540 $head = "foreach $var ($ary) ";
2541 } elsif ($kid->name eq "null") { # while/until
2543 my $name = {"and" => "while", "or" => "until"}->{$kid->name};
2544 $cond = $self->deparse($kid->first, 1);
2545 $head = "$name ($cond) ";
2546 $body = $kid->first->sibling;
2547 } elsif ($kid->name eq "stub") { # bare and empty
2548 return "{;}"; # {} could be a hashref
2550 # If there isn't a continue block, then the next pointer for the loop
2551 # will point to the unstack, which is kid's last child, except
2552 # in a bare loop, when it will point to the leaveloop. When neither of
2553 # these conditions hold, then the second-to-last child is the continue
2554 # block (or the last in a bare loop).
2555 my $cont_start = $enter->nextop;
2557 if ($$cont_start != $$op && ${$cont_start} != ${$body->last}) {
2559 $cont = $body->last;
2561 $cont = $body->first;
2562 while (!null($cont->sibling->sibling)) {
2563 $cont = $cont->sibling;
2566 my $state = $body->first;
2567 my $cuddle = $self->{'cuddle'};
2569 for (; $$state != $$cont; $state = $state->sibling) {
2570 push @states, $state;
2572 $body = $self->lineseq(undef, @states);
2573 if (defined $cond and not is_scope $cont and $self->{'expand'} < 3) {
2574 $head = "for ($init; $cond; " . $self->deparse($cont, 1) .") ";
2577 $cont = $cuddle . "continue {\n\t" .
2578 $self->deparse($cont, 0) . "\n\b}\cK";
2581 return "" if !defined $body;
2583 $head = "for ($init; $cond;) ";
2586 $body = $self->deparse($body, 0);
2588 $body =~ s/;?$/;\n/;
2590 return $head . "{\n\t" . $body . "\b}" . $cont;
2593 sub pp_leaveloop { loop_common(@_, "") }
2598 my $init = $self->deparse($op, 1);
2599 return $self->loop_common($op->sibling->first->sibling, $cx, $init);
2604 return "eval {\n\t" . $self->pp_leave(@_) . "\n\b}";
2607 BEGIN { eval "sub OP_CONST () {" . opnumber("const") . "}" }
2608 BEGIN { eval "sub OP_STRINGIFY () {" . opnumber("stringify") . "}" }
2609 BEGIN { eval "sub OP_RV2SV () {" . opnumber("rv2sv") . "}" }
2610 BEGIN { eval "sub OP_LIST () {" . opnumber("list") . "}" }
2615 if (class($op) eq "OP") {
2617 return $self->{'ex_const'} if $op->targ == OP_CONST;
2618 } elsif ($op->first->name eq "pushmark") {
2619 return $self->pp_list($op, $cx);
2620 } elsif ($op->first->name eq "enter") {
2621 return $self->pp_leave($op, $cx);
2622 } elsif ($op->targ == OP_STRINGIFY) {
2623 return $self->dquote($op, $cx);
2624 } elsif (!null($op->first->sibling) and
2625 $op->first->sibling->name eq "readline" and
2626 $op->first->sibling->flags & OPf_STACKED) {
2627 return $self->maybe_parens($self->deparse($op->first, 7) . " = "
2628 . $self->deparse($op->first->sibling, 7),
2630 } elsif (!null($op->first->sibling) and
2631 $op->first->sibling->name eq "trans" and
2632 $op->first->sibling->flags & OPf_STACKED) {
2633 return $self->maybe_parens($self->deparse($op->first, 20) . " =~ "
2634 . $self->deparse($op->first->sibling, 20),
2636 } elsif ($op->flags & OPf_SPECIAL && $cx < 1 && !$op->targ) {
2637 return "do {\n\t". $self->deparse($op->first, $cx) ."\n\b};";
2638 } elsif (!null($op->first->sibling) and
2639 $op->first->sibling->name eq "null" and
2640 class($op->first->sibling) eq "UNOP" and
2641 $op->first->sibling->first->flags & OPf_STACKED and
2642 $op->first->sibling->first->name eq "rcatline") {
2643 return $self->maybe_parens($self->deparse($op->first, 18) . " .= "
2644 . $self->deparse($op->first->sibling, 18),
2647 return $self->deparse($op->first, $cx);
2654 return $self->padname_sv($targ)->PVX;
2660 return substr($self->padname($op->targ), 1); # skip $/@/%
2666 return $self->maybe_my($op, $cx, $self->padname($op->targ));
2669 sub pp_padav { pp_padsv(@_) }
2670 sub pp_padhv { pp_padsv(@_) }
2675 @threadsv_names = ("_", "1", "2", "3", "4", "5", "6", "7", "8", "9",
2676 "&", "`", "'", "+", "/", ".", ",", "\\", '"', ";",
2677 "^", "-", "%", "=", "|", "~", ":", "^A", "^E",
2684 return $self->maybe_local($op, $cx, "\$" . $threadsv_names[$op->targ]);
2690 if (class($op) eq "PADOP") {
2691 return $self->padval($op->padix);
2692 } else { # class($op) eq "SVOP"
2700 my $gv = $self->gv_or_padgv($op);
2701 return $self->maybe_local($op, $cx, $self->stash_variable("\$",
2702 $self->gv_name($gv)));
2708 my $gv = $self->gv_or_padgv($op);
2709 return $self->gv_name($gv);
2716 if ($op->flags & OPf_SPECIAL) { # optimised PADAV
2717 $name = $self->padname($op->targ);
2721 my $gv = $self->gv_or_padgv($op);
2722 $name = $self->gv_name($gv);
2723 $name = $self->{'curstash'}."::$name"
2724 if $name !~ /::/ && $self->lex_in_scope('@'.$name);
2725 $name = '$' . $name;
2728 return $name . "[" . ($op->private + $self->{'arybase'}) . "]";
2733 my($op, $cx, $type) = @_;
2735 if (class($op) eq 'NULL' || !$op->can("first")) {
2736 carp("Unexpected op in pp_rv2x");
2739 my $kid = $op->first;
2740 if ($kid->name eq "gv") {
2741 return $self->stash_variable($type, $self->deparse($kid, 0));
2742 } elsif (is_scalar $kid) {
2743 my $str = $self->deparse($kid, 0);
2744 if ($str =~ /^\$([^\w\d])\z/) {
2745 # "$$+" isn't a legal way to write the scalar dereference
2746 # of $+, since the lexer can't tell you aren't trying to
2747 # do something like "$$ + 1" to get one more than your
2748 # PID. Either "${$+}" or "$${+}" are workable
2749 # disambiguations, but if the programmer did the former,
2750 # they'd be in the "else" clause below rather than here.
2751 # It's not clear if this should somehow be unified with
2752 # the code in dq and re_dq that also adds lexer
2753 # disambiguation braces.
2754 $str = '$' . "{$1}"; #'
2756 return $type . $str;
2758 return $type . "{" . $self->deparse($kid, 0) . "}";
2762 sub pp_rv2sv { maybe_local(@_, rv2x(@_, "\$")) }
2763 sub pp_rv2hv { maybe_local(@_, rv2x(@_, "%")) }
2764 sub pp_rv2gv { maybe_local(@_, rv2x(@_, "*")) }
2770 if ($op->first->name eq "padav") {
2771 return $self->maybe_local($op, $cx, '$#' . $self->padany($op->first));
2773 return $self->maybe_local($op, $cx,
2774 $self->rv2x($op->first, $cx, '$#'));
2778 # skip down to the old, ex-rv2cv
2780 my ($self, $op, $cx) = @_;
2781 if (!null($op->first) && $op->first->name eq 'null' &&
2782 $op->first->targ eq OP_LIST)
2784 return $self->rv2x($op->first->first->sibling, $cx, "&")
2787 return $self->rv2x($op, $cx, "")
2793 my($cx, @list) = @_;
2794 my @a = map $self->const($_, 6), @list;
2799 } elsif ( @a > 2 and !grep(!/^-?\d+$/, @a)) {
2800 # collapse (-1,0,1,2) into (-1..2)
2801 my ($s, $e) = @a[0,-1];
2803 return $self->maybe_parens("$s..$e", $cx, 9)
2804 unless grep $i++ != $_, @a;
2806 return $self->maybe_parens(join(", ", @a), $cx, 6);
2812 my $kid = $op->first;
2813 if ($kid->name eq "const") { # constant list
2814 my $av = $self->const_sv($kid);
2815 return $self->list_const($cx, $av->ARRAY);
2817 return $self->maybe_local($op, $cx, $self->rv2x($op, $cx, "\@"));
2821 sub is_subscriptable {
2823 if ($op->name =~ /^[ahg]elem/) {
2825 } elsif ($op->name eq "entersub") {
2826 my $kid = $op->first;
2827 return 0 unless null $kid->sibling;
2829 $kid = $kid->sibling until null $kid->sibling;
2830 return 0 if is_scope($kid);
2832 return 0 if $kid->name eq "gv";
2833 return 0 if is_scalar($kid);
2834 return is_subscriptable($kid);
2842 my ($op, $cx, $left, $right, $padname) = @_;
2843 my($array, $idx) = ($op->first, $op->first->sibling);
2844 unless ($array->name eq $padname) { # Maybe this has been fixed
2845 $array = $array->first; # skip rv2av (or ex-rv2av in _53+)
2847 if ($array->name eq $padname) {
2848 $array = $self->padany($array);
2849 } elsif (is_scope($array)) { # ${expr}[0]
2850 $array = "{" . $self->deparse($array, 0) . "}";
2851 } elsif ($array->name eq "gv") {
2852 $array = $self->gv_name($self->gv_or_padgv($array));
2853 if ($array !~ /::/) {
2854 my $prefix = ($left eq '[' ? '@' : '%');
2855 $array = $self->{curstash}.'::'.$array
2856 if $self->lex_in_scope($prefix . $array);
2858 } elsif (is_scalar $array) { # $x[0], $$x[0], ...
2859 $array = $self->deparse($array, 24);
2861 # $x[20][3]{hi} or expr->[20]
2862 my $arrow = is_subscriptable($array) ? "" : "->";
2863 return $self->deparse($array, 24) . $arrow .
2864 $left . $self->deparse($idx, 1) . $right;
2866 $idx = $self->deparse($idx, 1);
2868 # Outer parens in an array index will confuse perl
2869 # if we're interpolating in a regular expression, i.e.
2870 # /$x$foo[(-1)]/ is *not* the same as /$x$foo[-1]/
2872 # If $self->{parens}, then an initial '(' will
2873 # definitely be paired with a final ')'. If
2874 # !$self->{parens}, the misleading parens won't
2875 # have been added in the first place.
2877 # [You might think that we could get "(...)...(...)"
2878 # where the initial and final parens do not match
2879 # each other. But we can't, because the above would
2880 # only happen if there's an infix binop between the
2881 # two pairs of parens, and *that* means that the whole
2882 # expression would be parenthesized as well.]
2884 $idx =~ s/^\((.*)\)$/$1/ if $self->{'parens'};
2886 # Hash-element braces will autoquote a bareword inside themselves.
2887 # We need to make sure that C<$hash{warn()}> doesn't come out as
2888 # C<$hash{warn}>, which has a quite different meaning. Currently
2889 # B::Deparse will always quote strings, even if the string was a
2890 # bareword in the original (i.e. the OPpCONST_BARE flag is ignored
2891 # for constant strings.) So we can cheat slightly here - if we see
2892 # a bareword, we know that it is supposed to be a function call.
2894 $idx =~ s/^([A-Za-z_]\w*)$/$1()/;
2896 return "\$" . $array . $left . $idx . $right;
2899 sub pp_aelem { maybe_local(@_, elem(@_, "[", "]", "padav")) }
2900 sub pp_helem { maybe_local(@_, elem(@_, "{", "}", "padhv")) }
2905 my($glob, $part) = ($op->first, $op->last);
2906 $glob = $glob->first; # skip rv2gv
2907 $glob = $glob->first if $glob->name eq "rv2gv"; # this one's a bug
2908 my $scope = is_scope($glob);
2909 $glob = $self->deparse($glob, 0);
2910 $part = $self->deparse($part, 1);
2911 return "*" . ($scope ? "{$glob}" : $glob) . "{$part}";
2916 my ($op, $cx, $left, $right, $regname, $padname) = @_;
2918 my(@elems, $kid, $array, $list);
2919 if (class($op) eq "LISTOP") {
2921 } else { # ex-hslice inside delete()
2922 for ($kid = $op->first; !null $kid->sibling; $kid = $kid->sibling) {}
2926 $array = $array->first
2927 if $array->name eq $regname or $array->name eq "null";
2928 if (is_scope($array)) {
2929 $array = "{" . $self->deparse($array, 0) . "}";
2930 } elsif ($array->name eq $padname) {
2931 $array = $self->padany($array);
2933 $array = $self->deparse($array, 24);
2935 $kid = $op->first->sibling; # skip pushmark
2936 if ($kid->name eq "list") {
2937 $kid = $kid->first->sibling; # skip list, pushmark
2938 for (; !null $kid; $kid = $kid->sibling) {
2939 push @elems, $self->deparse($kid, 6);
2941 $list = join(", ", @elems);
2943 $list = $self->deparse($kid, 1);
2945 return "\@" . $array . $left . $list . $right;
2948 sub pp_aslice { maybe_local(@_, slice(@_, "[", "]", "rv2av", "padav")) }
2949 sub pp_hslice { maybe_local(@_, slice(@_, "{", "}", "rv2hv", "padhv")) }
2954 my $idx = $op->first;
2955 my $list = $op->last;
2957 $list = $self->deparse($list, 1);
2958 $idx = $self->deparse($idx, 1);
2959 return "($list)" . "[$idx]";
2964 return ($op->flags & OPf_WANT) == OPf_WANT_SCALAR;
2969 return ($op->flags & OPf_WANT) == OPf_WANT_LIST;
2975 my $kid = $op->first->sibling; # skip pushmark
2976 my($meth, $obj, @exprs);
2977 if ($kid->name eq "list" and want_list $kid) {
2978 # When an indirect object isn't a bareword but the args are in
2979 # parens, the parens aren't part of the method syntax (the LLAFR
2980 # doesn't apply), but they make a list with OPf_PARENS set that
2981 # doesn't get flattened by the append_elem that adds the method,
2982 # making a (object, arg1, arg2, ...) list where the object
2983 # usually is. This can be distinguished from
2984 # `($obj, $arg1, $arg2)->meth()' (which is legal if $arg2 is an
2985 # object) because in the later the list is in scalar context
2986 # as the left side of -> always is, while in the former
2987 # the list is in list context as method arguments always are.
2988 # (Good thing there aren't method prototypes!)
2989 $meth = $kid->sibling;
2990 $kid = $kid->first->sibling; # skip pushmark
2992 $kid = $kid->sibling;
2993 for (; not null $kid; $kid = $kid->sibling) {
2994 push @exprs, $self->deparse($kid, 6);
2998 $kid = $kid->sibling;
2999 for (; !null ($kid->sibling) && $kid->name ne "method_named";
3000 $kid = $kid->sibling) {
3001 push @exprs, $self->deparse($kid, 6);
3005 $obj = $self->deparse($obj, 24);
3006 if ($meth->name eq "method_named") {
3007 $meth = $self->const_sv($meth)->PV;
3009 $meth = $meth->first;
3010 if ($meth->name eq "const") {
3011 # As of 5.005_58, this case is probably obsoleted by the
3012 # method_named case above
3013 $meth = $self->const_sv($meth)->PV; # needs to be bare
3015 $meth = $self->deparse($meth, 1);
3018 my $args = join(", ", @exprs);
3019 $kid = $obj . "->" . $meth;
3021 return $kid . "(" . $args . ")"; # parens mandatory
3027 # returns "&" if the prototype doesn't match the args,
3028 # or ("", $args_after_prototype_demunging) if it does.
3031 return "&" if $self->{'noproto'};
3032 my($proto, @args) = @_;
3036 # An unbackslashed @ or % gobbles up the rest of the args
3037 1 while $proto =~ s/(?<!\\)([@%])[^\]]+$/$1/;
3039 $proto =~ s/^(\\?[\$\@&%*]|\\\[[\$\@&%*]+\]|;)//;
3042 return "&" if @args;
3043 } elsif ($chr eq ";") {
3045 } elsif ($chr eq "@" or $chr eq "%") {
3046 push @reals, map($self->deparse($_, 6), @args);
3052 if (want_scalar $arg) {
3053 push @reals, $self->deparse($arg, 6);
3057 } elsif ($chr eq "&") {
3058 if ($arg->name =~ /^(s?refgen|undef)$/) {
3059 push @reals, $self->deparse($arg, 6);
3063 } elsif ($chr eq "*") {
3064 if ($arg->name =~ /^s?refgen$/
3065 and $arg->first->first->name eq "rv2gv")
3067 $real = $arg->first->first; # skip refgen, null
3068 if ($real->first->name eq "gv") {
3069 push @reals, $self->deparse($real, 6);
3071 push @reals, $self->deparse($real->first, 6);
3076 } elsif (substr($chr, 0, 1) eq "\\") {
3078 if ($arg->name =~ /^s?refgen$/ and
3079 !null($real = $arg->first) and
3080 ($chr =~ /\$/ && is_scalar($real->first)
3082 && class($real->first->sibling) ne 'NULL'
3083 && $real->first->sibling->name
3086 && class($real->first->sibling) ne 'NULL'
3087 && $real->first->sibling->name
3089 #or ($chr =~ /&/ # This doesn't work
3090 # && $real->first->name eq "rv2cv")
3092 && $real->first->name eq "rv2gv")))
3094 push @reals, $self->deparse($real, 6);
3101 return "&" if $proto and !$doneok; # too few args and no `;'
3102 return "&" if @args; # too many args
3103 return ("", join ", ", @reals);
3109 return $self->method($op, $cx) unless null $op->first->sibling;
3113 if ($op->flags & OPf_SPECIAL && !($op->flags & OPf_MOD)) {
3115 } elsif ($op->private & OPpENTERSUB_AMPER) {
3119 $kid = $kid->first->sibling; # skip ex-list, pushmark
3120 for (; not null $kid->sibling; $kid = $kid->sibling) {
3125 if (is_scope($kid)) {
3127 $kid = "{" . $self->deparse($kid, 0) . "}";
3128 } elsif ($kid->first->name eq "gv") {
3129 my $gv = $self->gv_or_padgv($kid->first);
3130 if (class($gv->CV) ne "SPECIAL") {
3131 $proto = $gv->CV->PV if $gv->CV->FLAGS & SVf_POK;
3133 $simple = 1; # only calls of named functions can be prototyped
3134 $kid = $self->deparse($kid, 24);
3135 } elsif (is_scalar ($kid->first) && $kid->first->name ne 'rv2cv') {
3137 $kid = $self->deparse($kid, 24);
3140 my $arrow = is_subscriptable($kid->first) ? "" : "->";
3141 $kid = $self->deparse($kid, 24) . $arrow;
3144 # Doesn't matter how many prototypes there are, if
3145 # they haven't happened yet!
3149 no warnings 'uninitialized';
3150 $declared = exists $self->{'subs_declared'}{$kid}
3152 defined &{ ${$self->{'curstash'}."::"}{$kid} }
3154 $self->{'subs_deparsed'}{$self->{'curstash'}."::".$kid}
3155 && defined prototype $self->{'curstash'}."::".$kid
3157 if (!$declared && defined($proto)) {
3158 # Avoid "too early to check prototype" warning
3159 ($amper, $proto) = ('&');
3164 if ($declared and defined $proto and not $amper) {
3165 ($amper, $args) = $self->check_proto($proto, @exprs);
3166 if ($amper eq "&") {
3167 $args = join(", ", map($self->deparse($_, 6), @exprs));
3170 $args = join(", ", map($self->deparse($_, 6), @exprs));
3172 if ($prefix or $amper) {
3173 if ($op->flags & OPf_STACKED) {
3174 return $prefix . $amper . $kid . "(" . $args . ")";
3176 return $prefix . $amper. $kid;
3179 # glob() invocations can be translated into calls of
3180 # CORE::GLOBAL::glob with a second parameter, a number.
3182 if ($kid eq "CORE::GLOBAL::glob") {
3184 $args =~ s/\s*,[^,]+$//;
3187 # It's a syntax error to call CORE::GLOBAL::foo without a prefix,
3188 # so it must have been translated from a keyword call. Translate
3190 $kid =~ s/^CORE::GLOBAL:://;
3192 my $dproto = defined($proto) ? $proto : "undefined";
3194 return "$kid(" . $args . ")";
3195 } elsif ($dproto eq "") {
3197 } elsif ($dproto eq "\$" and is_scalar($exprs[0])) {
3198 # is_scalar is an excessively conservative test here:
3199 # really, we should be comparing to the precedence of the
3200 # top operator of $exprs[0] (ala unop()), but that would
3201 # take some major code restructuring to do right.
3202 return $self->maybe_parens_func($kid, $args, $cx, 16);
3203 } elsif ($dproto ne '$' and defined($proto) || $simple) { #'
3204 return $self->maybe_parens_func($kid, $args, $cx, 5);
3206 return "$kid(" . $args . ")";
3211 sub pp_enterwrite { unop(@_, "write") }
3213 # escape things that cause interpolation in double quotes,
3214 # but not character escapes
3217 $str =~ s/(^|\G|[^\\])((?:\\\\)*)([\$\@]|\\[uUlLQE])/$1$2\\$3/g;
3225 # Matches any string which is balanced with respect to {braces}
3236 # the same, but treat $|, $), $( and $ at the end of the string differently
3250 (\(\?\??\{$bal\}\)) # $4
3256 /defined($4) && length($4) ? "$1$2$4" : "$1$2\\$3"/xeg;
3261 # This is for regular expressions with the /x modifier
3262 # We have to leave comments unmangled.
3263 sub re_uninterp_extended {
3276 ( \(\?\??\{$bal\}\) # $4 (skip over (?{}) and (??{}) blocks)
3277 | \#[^\n]* # (skip over comments)
3284 /defined($4) && length($4) ? "$1$2$4" : "$1$2\\$3"/xeg;
3290 my %unctrl = # portable to to EBCDIC
3292 "\c@" => '\c@', # unused
3319 "\c[" => '\c[', # unused
3320 "\c\\" => '\c\\', # unused
3321 "\c]" => '\c]', # unused
3322 "\c_" => '\c_', # unused
3325 # character escapes, but not delimiters that might need to be escaped
3326 sub escape_str { # ASCII, UTF8
3328 $str =~ s/(.)/ord($1) > 255 ? sprintf("\\x{%x}", ord($1)) : $1/eg;
3330 # $str =~ s/\cH/\\b/g; # \b means something different in a regex
3336 $str =~ s/([\cA-\cZ])/$unctrl{$1}/ge;
3337 $str =~ s/([[:^print:]])/sprintf("\\%03o", ord($1))/ge;
3341 # For regexes with the /x modifier.
3342 # Leave whitespace unmangled.
3343 sub escape_extended_re {
3345 $str =~ s/(.)/ord($1) > 255 ? sprintf("\\x{%x}", ord($1)) : $1/eg;
3346 $str =~ s/([[:^print:]])/
3347 ($1 =~ y! \t\n!!) ? $1 : sprintf("\\%03o", ord($1))/ge;
3348 $str =~ s/\n/\n\f/g;
3352 # Don't do this for regexen
3355 $str =~ s/\\/\\\\/g;
3359 # Remove backslashes which precede literal control characters,
3360 # to avoid creating ambiguity when we escape the latter.
3364 # the insane complexity here is due to the behaviour of "\c\"
3365 $str =~ s/(^|[^\\]|\\c\\)(?<!\\c)\\(\\\\)*(?=[[:^print:]])/$1$2/g;
3369 sub balanced_delim {
3371 my @str = split //, $str;
3372 my($ar, $open, $close, $fail, $c, $cnt, $last_bs);
3373 for $ar (['[',']'], ['(',')'], ['<','>'], ['{','}']) {
3374 ($open, $close) = @$ar;
3375 $fail = 0; $cnt = 0; $last_bs = 0;
3378 $fail = 1 if $last_bs;
3380 } elsif ($c eq $close) {
3381 $fail = 1 if $last_bs;
3389 $last_bs = $c eq '\\';
3391 $fail = 1 if $cnt != 0;
3392 return ($open, "$open$str$close") if not $fail;
3398 my($q, $default, $str) = @_;
3399 return "$default$str$default" if $default and index($str, $default) == -1;
3401 (my $succeed, $str) = balanced_delim($str);
3402 return "$q$str" if $succeed;
3404 for my $delim ('/', '"', '#') {
3405 return "$q$delim" . $str . $delim if index($str, $delim) == -1;
3408 $str =~ s/$default/\\$default/g;
3409 return "$default$str$default";
3417 BEGIN { $max_prec = int(0.999 + 8*length(pack("F", 42))*log(2)/log(10)); }
3419 # Split a floating point number into an integer mantissa and a binary
3420 # exponent. Assumes you've already made sure the number isn't zero or
3421 # some weird infinity or NaN.
3425 if ($f == int($f)) {
3426 while ($f % 2 == 0) {
3431 while ($f != int($f)) {
3436 my $mantissa = sprintf("%.0f", $f);
3437 return ($mantissa, $exponent);
3443 if ($self->{'use_dumper'}) {
3444 return $self->const_dumper($sv, $cx);
3446 if (class($sv) eq "SPECIAL") {
3447 # sv_undef, sv_yes, sv_no
3448 return ('undef', '1', $self->maybe_parens("!1", $cx, 21))[$$sv-1];
3449 } elsif (class($sv) eq "NULL") {
3452 # convert a version object into the "v1.2.3" string in its V magic
3453 if ($sv->FLAGS & SVs_RMG) {
3454 for (my $mg = $sv->MAGIC; $mg; $mg = $mg->MOREMAGIC) {
3455 return $mg->PTR if $mg->TYPE eq 'V';
3459 if ($sv->FLAGS & SVf_IOK) {
3460 my $str = $sv->int_value;
3461 $str = $self->maybe_parens($str, $cx, 21) if $str < 0;
3463 } elsif ($sv->FLAGS & SVf_NOK) {
3466 if (pack("F", $nv) eq pack("F", 0)) {
3471 return $self->maybe_parens("-.0", $cx, 21);
3473 } elsif (1/$nv == 0) {
3476 return $self->maybe_parens("9**9**9", $cx, 22);
3479 return $self->maybe_parens("-9**9**9", $cx, 21);
3481 } elsif ($nv != $nv) {
3483 if (pack("F", $nv) eq pack("F", sin(9**9**9))) {
3485 return "sin(9**9**9)";
3486 } elsif (pack("F", $nv) eq pack("F", -sin(9**9**9))) {
3488 return $self->maybe_parens("-sin(9**9**9)", $cx, 21);
3491 my $hex = unpack("h*", pack("F", $nv));
3492 return qq'unpack("F", pack("h*", "$hex"))';
3495 # first, try the default stringification
3498 # failing that, try using more precision
3499 $str = sprintf("%.${max_prec}g", $nv);
3500 # if (pack("F", $str) ne pack("F", $nv)) {
3502 # not representable in decimal with whatever sprintf()
3503 # and atof() Perl is using here.
3504 my($mant, $exp) = split_float($nv);
3505 return $self->maybe_parens("$mant * 2**$exp", $cx, 19);
3508 $str = $self->maybe_parens($str, $cx, 21) if $nv < 0;
3510 } elsif ($sv->FLAGS & SVf_ROK && $sv->can("RV")) {
3512 if (class($ref) eq "AV") {
3513 return "[" . $self->list_const(2, $ref->ARRAY) . "]";
3514 } elsif (class($ref) eq "HV") {
3515 my %hash = $ref->ARRAY;
3517 for my $k (sort keys %hash) {
3518 push @elts, "$k => " . $self->const($hash{$k}, 6);
3520 return "{" . join(", ", @elts) . "}";
3521 } elsif (class($ref) eq "CV") {
3522 return "sub " . $self->deparse_sub($ref);
3524 if ($ref->FLAGS & SVs_SMG) {
3525 for (my $mg = $ref->MAGIC; $mg; $mg = $mg->MOREMAGIC) {
3526 if ($mg->TYPE eq 'r') {
3527 my $re = re_uninterp(escape_str(re_unback($mg->precomp)));
3528 return single_delim("qr", "", $re);
3533 return $self->maybe_parens("\\" . $self->const($ref, 20), $cx, 20);
3534 } elsif ($sv->FLAGS & SVf_POK) {
3536 if ($str =~ /[^ -~]/) { # ASCII for non-printing
3537 return single_delim("qq", '"', uninterp escape_str unback $str);
3539 return single_delim("q", "'", unback $str);
3549 my $ref = $sv->object_2svref();
3550 my $dumper = Data::Dumper->new([$$ref], ['$v']);
3551 $dumper->Purity(1)->Terse(1)->Deparse(1)->Indent(0)->Useqq(1)->Sortkeys(1);
3552 my $str = $dumper->Dump();
3553 if ($str =~ /^\$v/) {
3554 return '${my ' . $str . ' \$v}';
3564 # the constant could be in the pad (under useithreads)
3565 $sv = $self->padval($op->targ) unless $$sv;
3572 if ($op->private & OPpCONST_ARYBASE) {
3575 # if ($op->private & OPpCONST_BARE) { # trouble with `=>' autoquoting
3576 # return $self->const_sv($op)->PV;
3578 my $sv = $self->const_sv($op);
3579 return $self->const($sv, $cx);
3585 my $type = $op->name;
3586 if ($type eq "const") {
3587 return '$[' if $op->private & OPpCONST_ARYBASE;
3588 return uninterp(escape_str(unback($self->const_sv($op)->as_string)));
3589 } elsif ($type eq "concat") {
3590 my $first = $self->dq($op->first);
3591 my $last = $self->dq($op->last);
3593 # Disambiguate "${foo}bar", "${foo}{bar}", "${foo}[1]", "$foo\::bar"
3594 ($last =~ /^[A-Z\\\^\[\]_?]/ &&
3595 $first =~ s/([\$@])\^$/${1}{^}/) # "${^}W" etc
3596 || ($last =~ /^[:'{\[\w_]/ && #'
3597 $first =~ s/([\$@])([A-Za-z_]\w*)$/${1}{$2}/);
3599 return $first . $last;
3600 } elsif ($type eq "uc") {
3601 return '\U' . $self->dq($op->first->sibling) . '\E';
3602 } elsif ($type eq "lc") {
3603 return '\L' . $self->dq($op->first->sibling) . '\E';
3604 } elsif ($type eq "ucfirst") {
3605 return '\u' . $self->dq($op->first->sibling);
3606 } elsif ($type eq "lcfirst") {
3607 return '\l' . $self->dq($op->first->sibling);
3608 } elsif ($type eq "quotemeta") {
3609 return '\Q' . $self->dq($op->first->sibling) . '\E';
3610 } elsif ($type eq "join") {
3611 return $self->deparse($op->last, 26); # was join($", @ary)
3613 return $self->deparse($op, 26);
3621 return single_delim("qx", '`', $self->dq($op->first->sibling));
3627 my $kid = $op->first->sibling; # skip ex-stringify, pushmark
3628 return $self->deparse($kid, $cx) if $self->{'unquote'};
3629 $self->maybe_targmy($kid, $cx,
3630 sub {single_delim("qq", '"', $self->dq($_[1]))});
3633 # OP_STRINGIFY is a listop, but it only ever has one arg
3634 sub pp_stringify { maybe_targmy(@_, \&dquote) }
3636 # tr/// and s/// (and tr[][], tr[]//, tr###, etc)
3637 # note that tr(from)/to/ is OK, but not tr/from/(to)
3639 my($from, $to) = @_;
3640 my($succeed, $delim);
3641 if ($from !~ m[/] and $to !~ m[/]) {
3642 return "/$from/$to/";
3643 } elsif (($succeed, $from) = balanced_delim($from) and $succeed) {
3644 if (($succeed, $to) = balanced_delim($to) and $succeed) {
3647 for $delim ('/', '"', '#') { # note no `'' -- s''' is special
3648 return "$from$delim$to$delim" if index($to, $delim) == -1;
3651 return "$from/$to/";
3654 for $delim ('/', '"', '#') { # note no '
3655 return "$delim$from$delim$to$delim"
3656 if index($to . $from, $delim) == -1;
3658 $from =~ s[/][\\/]g;
3660 return "/$from/$to/";
3664 # Only used by tr///, so backslashes hyphens
3667 if ($n == ord '\\') {
3669 } elsif ($n == ord "-") {
3671 } elsif ($n >= ord(' ') and $n <= ord('~')) {
3673 } elsif ($n == ord "\a") {
3675 } elsif ($n == ord "\b") {
3677 } elsif ($n == ord "\t") {
3679 } elsif ($n == ord "\n") {
3681 } elsif ($n == ord "\e") {
3683 } elsif ($n == ord "\f") {
3685 } elsif ($n == ord "\r") {
3687 } elsif ($n >= ord("\cA") and $n <= ord("\cZ")) {
3688 return '\\c' . chr(ord("@") + $n);
3690 # return '\x' . sprintf("%02x", $n);
3691 return '\\' . sprintf("%03o", $n);
3697 my($str, $c, $tr) = ("");
3698 for ($c = 0; $c < @chars; $c++) {
3701 if ($c <= $#chars - 2 and $chars[$c + 1] == $tr + 1 and
3702 $chars[$c + 2] == $tr + 2)
3704 for (; $c <= $#chars-1 and $chars[$c + 1] == $chars[$c] + 1; $c++)
3707 $str .= pchr($chars[$c]);
3713 sub tr_decode_byte {
3714 my($table, $flags) = @_;
3715 my(@table) = unpack("s*", $table);
3716 splice @table, 0x100, 1; # Number of subsequent elements
3717 my($c, $tr, @from, @to, @delfrom, $delhyphen);
3718 if ($table[ord "-"] != -1 and
3719 $table[ord("-") - 1] == -1 || $table[ord("-") + 1] == -1)
3721 $tr = $table[ord "-"];
3722 $table[ord "-"] = -1;
3726 } else { # -2 ==> delete
3730 for ($c = 0; $c < @table; $c++) {
3733 push @from, $c; push @to, $tr;
3734 } elsif ($tr == -2) {
3738 @from = (@from, @delfrom);
3739 if ($flags & OPpTRANS_COMPLEMENT) {
3742 @from{@from} = (1) x @from;
3743 for ($c = 0; $c < 256; $c++) {
3744 push @newfrom, $c unless $from{$c};
3748 unless ($flags & OPpTRANS_DELETE || !@to) {
3749 pop @to while $#to and $to[$#to] == $to[$#to -1];
3752 $from = collapse(@from);
3753 $to = collapse(@to);
3754 $from .= "-" if $delhyphen;
3755 return ($from, $to);
3760 if ($x == ord "-") {
3762 } elsif ($x == ord "\\") {
3769 # XXX This doesn't yet handle all cases correctly either
3771 sub tr_decode_utf8 {
3772 my($swash_hv, $flags) = @_;
3773 my %swash = $swash_hv->ARRAY;
3775 $final = $swash{'FINAL'}->IV if exists $swash{'FINAL'};
3776 my $none = $swash{"NONE"}->IV;
3777 my $extra = $none + 1;
3778 my(@from, @delfrom, @to);
3780 foreach $line (split /\n/, $swash{'LIST'}->PV) {
3781 my($min, $max, $result) = split(/\t/, $line);
3788 $result = hex $result;
3789 if ($result == $extra) {
3790 push @delfrom, [$min, $max];
3792 push @from, [$min, $max];
3793 push @to, [$result, $result + $max - $min];
3796 for my $i (0 .. $#from) {
3797 if ($from[$i][0] == ord '-') {
3798 unshift @from, splice(@from, $i, 1);
3799 unshift @to, splice(@to, $i, 1);
3801 } elsif ($from[$i][1] == ord '-') {
3804 unshift @from, ord '-';
3805 unshift @to, ord '-';
3809 for my $i (0 .. $#delfrom) {
3810 if ($delfrom[$i][0] == ord '-') {
3811 push @delfrom, splice(@delfrom, $i, 1);
3813 } elsif ($delfrom[$i][1] == ord '-') {
3815 push @delfrom, ord '-';
3819 if (defined $final and $to[$#to][1] != $final) {
3820 push @to, [$final, $final];
3822 push @from, @delfrom;
3823 if ($flags & OPpTRANS_COMPLEMENT) {
3826 for my $i (0 .. $#from) {
3827 push @newfrom, [$next, $from[$i][0] - 1];
3828 $next = $from[$i][1] + 1;
3831 for my $range (@newfrom) {
3832 if ($range->[0] <= $range->[1]) {
3837 my($from, $to, $diff);
3838 for my $chunk (@from) {
3839 $diff = $chunk->[1] - $chunk->[0];
3841 $from .= tr_chr($chunk->[0]) . "-" . tr_chr($chunk->[1]);
3842 } elsif ($diff == 1) {
3843 $from .= tr_chr($chunk->[0]) . tr_chr($chunk->[1]);
3845 $from .= tr_chr($chunk->[0]);
3848 for my $chunk (@to) {
3849 $diff = $chunk->[1] - $chunk->[0];
3851 $to .= tr_chr($chunk->[0]) . "-" . tr_chr($chunk->[1]);
3852 } elsif ($diff == 1) {
3853 $to .= tr_chr($chunk->[0]) . tr_chr($chunk->[1]);
3855 $to .= tr_chr($chunk->[0]);
3858 #$final = sprintf("%04x", $final) if defined $final;
3859 #$none = sprintf("%04x", $none) if defined $none;
3860 #$extra = sprintf("%04x", $extra) if defined $extra;
3861 #print STDERR "final: $final\n none: $none\nextra: $extra\n";
3862 #print STDERR $swash{'LIST'}->PV;
3863 return (escape_str($from), escape_str($to));
3870 if (class($op) eq "PVOP") {
3871 ($from, $to) = tr_decode_byte($op->pv, $op->private);
3872 } else { # class($op) eq "SVOP"
3873 ($from, $to) = tr_decode_utf8($op->sv->RV, $op->private);
3876 $flags .= "c" if $op->private & OPpTRANS_COMPLEMENT;
3877 $flags .= "d" if $op->private & OPpTRANS_DELETE;
3878 $to = "" if $from eq $to and $flags eq "";
3879 $flags .= "s" if $op->private & OPpTRANS_SQUASH;
3880 return "tr" . double_delim($from, $to) . $flags;
3883 # Like dq(), but different
3886 my ($op, $extended) = @_;
3888 my $type = $op->name;
3889 if ($type eq "const") {
3890 return '$[' if $op->private & OPpCONST_ARYBASE;
3891 my $unbacked = re_unback($self->const_sv($op)->as_string);
3892 return re_uninterp_extended(escape_extended_re($unbacked))
3894 return re_uninterp(escape_str($unbacked));
3895 } elsif ($type eq "concat") {
3896 my $first = $self->re_dq($op->first, $extended);
3897 my $last = $self->re_dq($op->last, $extended);
3899 # Disambiguate "${foo}bar", "${foo}{bar}", "${foo}[1]"
3900 ($last =~ /^[A-Z\\\^\[\]_?]/ &&
3901 $first =~ s/([\$@])\^$/${1}{^}/) # "${^}W" etc
3902 || ($last =~ /^[{\[\w_]/ &&
3903 $first =~ s/([\$@])([A-Za-z_]\w*)$/${1}{$2}/);
3905 return $first . $last;
3906 } elsif ($type eq "uc") {
3907 return '\U' . $self->re_dq($op->first->sibling, $extended) . '\E';
3908 } elsif ($type eq "lc") {
3909 return '\L' . $self->re_dq($op->first->sibling, $extended) . '\E';
3910 } elsif ($type eq "ucfirst") {
3911 return '\u' . $self->re_dq($op->first->sibling, $extended);
3912 } elsif ($type eq "lcfirst") {
3913 return '\l' . $self->re_dq($op->first->sibling, $extended);
3914 } elsif ($type eq "quotemeta") {
3915 return '\Q' . $self->re_dq($op->first->sibling, $extended) . '\E';
3916 } elsif ($type eq "join") {
3917 return $self->deparse($op->last, 26); # was join($", @ary)
3919 return $self->deparse($op, 26);
3924 my ($self, $op) = @_;
3925 return 0 if null $op;
3926 my $type = $op->name;
3928 if ($type eq 'const') {
3931 elsif ($type =~ /^[ul]c(first)?$/ || $type eq 'quotemeta') {
3932 return $self->pure_string($op->first->sibling);
3934 elsif ($type eq 'join') {
3935 my $join_op = $op->first->sibling; # Skip pushmark
3936 return 0 unless $join_op->name eq 'null' && $join_op->targ eq OP_RV2SV;
3938 my $gvop = $join_op->first;
3939 return 0 unless $gvop->name eq 'gvsv';
3940 return 0 unless '"' eq $self->gv_name($self->gv_or_padgv($gvop));
3942 return 0 unless ${$join_op->sibling} eq ${$op->last};
3943 return 0 unless $op->last->name =~ /^(rv2|pad)av$/;
3945 elsif ($type eq 'concat') {
3946 return $self->pure_string($op->first)
3947 && $self->pure_string($op->last);
3949 elsif (is_scalar($op) || $type =~ /^[ah]elem$/) {
3952 elsif ($type eq "null" and $op->can('first') and not null $op->first and
3953 $op->first->name eq "null" and $op->first->can('first')
3954 and not null $op->first->first and
3955 $op->first->first->name eq "aelemfast") {
3967 my($op, $cx, $extended) = @_;
3968 my $kid = $op->first;
3969 $kid = $kid->first if $kid->name eq "regcmaybe";
3970 $kid = $kid->first if $kid->name eq "regcreset";
3971 if ($kid->name eq "null" and !null($kid->first)
3972 and $kid->first->name eq 'pushmark')
3975 $kid = $kid->first->sibling;
3976 while (!null($kid)) {
3977 $str .= $self->re_dq($kid, $extended);
3978 $kid = $kid->sibling;
3983 return ($self->re_dq($kid, $extended), 1) if $self->pure_string($kid);
3984 return ($self->deparse($kid, $cx), 0);
3988 my ($self, $op, $cx) = @_;
3989 return (($self->regcomp($op, $cx, 0))[0]);
3992 # osmic acid -- see osmium tetroxide
3995 map($matchwords{join "", sort split //, $_} = $_, 'cig', 'cog', 'cos', 'cogs',
3996 'cox', 'go', 'is', 'ism', 'iso', 'mig', 'mix', 'osmic', 'ox', 'sic',
3997 'sig', 'six', 'smog', 'so', 'soc', 'sog', 'xi');
4001 my($op, $cx, $name, $delim) = @_;
4002 my $kid = $op->first;
4003 my ($binop, $var, $re) = ("", "", "");
4004 if ($op->flags & OPf_STACKED) {
4006 $var = $self->deparse($kid, 20);
4007 $kid = $kid->sibling;
4010 my $extended = ($op->pmflags & PMf_EXTENDED);
4012 my $unbacked = re_unback($op->precomp);
4014 $re = re_uninterp_extended(escape_extended_re($unbacked));
4016 $re = re_uninterp(escape_str(re_unback($op->precomp)));
4018 } elsif ($kid->name ne 'regcomp') {
4019 carp("found ".$kid->name." where regcomp expected");
4021 ($re, $quote) = $self->regcomp($kid, 21, $extended);
4024 $flags .= "c" if $op->pmflags & PMf_CONTINUE;
4025 $flags .= "g" if $op->pmflags & PMf_GLOBAL;
4026 $flags .= "i" if $op->pmflags & PMf_FOLD;
4027 $flags .= "m" if $op->pmflags & PMf_MULTILINE;
4028 $flags .= "o" if $op->pmflags & PMf_KEEP;
4029 $flags .= "s" if $op->pmflags & PMf_SINGLELINE;
4030 $flags .= "x" if $op->pmflags & PMf_EXTENDED;
4031 $flags = $matchwords{$flags} if $matchwords{$flags};
4032 if ($op->pmflags & PMf_ONCE) { # only one kind of delimiter works here
4036 $re = single_delim($name, $delim, $re);
4038 $re = $re . $flags if $quote;
4040 return $self->maybe_parens("$var =~ $re", $cx, 20);
4046 sub pp_match { matchop(@_, "m", "/") }
4047 sub pp_pushre { matchop(@_, "m", "/") }
4048 sub pp_qr { matchop(@_, "qr", "") }
4053 my($kid, @exprs, $ary, $expr);
4056 # For our kid (an OP_PUSHRE), pmreplroot is never actually the
4057 # root of a replacement; it's either empty, or abused to point to
4058 # the GV for an array we split into (an optimization to save
4059 # assignment overhead). Depending on whether we're using ithreads,
4060 # this OP* holds either a GV* or a PADOFFSET. Luckily, B.xs
4061 # figures out for us which it is.
4062 my $replroot = $kid->pmreplroot;
4064 if (ref($replroot) eq "B::GV") {
4066 } elsif (!ref($replroot) and $replroot > 0) {
4067 $gv = $self->padval($replroot);
4069 $ary = $self->stash_variable('@', $self->gv_name($gv)) if $gv;
4071 for (; !null($kid); $kid = $kid->sibling) {
4072 push @exprs, $self->deparse($kid, 6);
4075 # handle special case of split(), and split(" ") that compiles to /\s+/
4077 if ($kid->flags & OPf_SPECIAL
4078 && $exprs[0] eq '/\\s+/'
4079 && $kid->pmflags & PMf_SKIPWHITE ) {
4083 $expr = "split(" . join(", ", @exprs) . ")";
4085 return $self->maybe_parens("$ary = $expr", $cx, 7);
4091 # oxime -- any of various compounds obtained chiefly by the action of
4092 # hydroxylamine on aldehydes and ketones and characterized by the
4093 # bivalent grouping C=NOH [Webster's Tenth]
4096 map($substwords{join "", sort split //, $_} = $_, 'ego', 'egoism', 'em',
4097 'es', 'ex', 'exes', 'gee', 'go', 'goes', 'ie', 'ism', 'iso', 'me',
4098 'meese', 'meso', 'mig', 'mix', 'os', 'ox', 'oxime', 'see', 'seem',
4099 'seg', 'sex', 'sig', 'six', 'smog', 'sog', 'some', 'xi');
4104 my $kid = $op->first;
4105 my($binop, $var, $re, $repl) = ("", "", "", "");
4106 if ($op->flags & OPf_STACKED) {
4108 $var = $self->deparse($kid, 20);
4109 $kid = $kid->sibling;
4112 if (null($op->pmreplroot)) {
4113 $repl = $self->dq($kid);
4114 $kid = $kid->sibling;
4116 $repl = $op->pmreplroot->first; # skip substcont
4117 while ($repl->name eq "entereval") {
4118 $repl = $repl->first;
4121 if ($op->pmflags & PMf_EVAL) {
4122 $repl = $self->deparse($repl->first, 0);
4124 $repl = $self->dq($repl);
4127 my $extended = ($op->pmflags & PMf_EXTENDED);
4129 my $unbacked = re_unback($op->precomp);
4131 $re = re_uninterp_extended(escape_extended_re($unbacked));
4134 $re = re_uninterp(escape_str($unbacked));
4137 ($re) = $self->regcomp($kid, 1, $extended);
4139 $flags .= "e" if $op->pmflags & PMf_EVAL;
4140 $flags .= "g" if $op->pmflags & PMf_GLOBAL;
4141 $flags .= "i" if $op->pmflags & PMf_FOLD;
4142 $flags .= "m" if $op->pmflags & PMf_MULTILINE;
4143 $flags .= "o" if $op->pmflags & PMf_KEEP;
4144 $flags .= "s" if $op->pmflags & PMf_SINGLELINE;
4145 $flags .= "x" if $extended;
4146 $flags = $substwords{$flags} if $substwords{$flags};
4148 return $self->maybe_parens("$var =~ s"
4149 . double_delim($re, $repl) . $flags,
4152 return "s". double_delim($re, $repl) . $flags;
4161 B::Deparse - Perl compiler backend to produce perl code
4165 B<perl> B<-MO=Deparse>[B<,-d>][B<,-f>I<FILE>][B<,-p>][B<,-q>][B<,-l>]
4166 [B<,-s>I<LETTERS>][B<,-x>I<LEVEL>] I<prog.pl>
4170 B::Deparse is a backend module for the Perl compiler that generates
4171 perl source code, based on the internal compiled structure that perl
4172 itself creates after parsing a program. The output of B::Deparse won't
4173 be exactly the same as the original source, since perl doesn't keep
4174 track of comments or whitespace, and there isn't a one-to-one
4175 correspondence between perl's syntactical constructions and their
4176 compiled form, but it will often be close. When you use the B<-p>
4177 option, the output also includes parentheses even when they are not
4178 required by precedence, which can make it easy to see if perl is
4179 parsing your expressions the way you intended.
4181 While B::Deparse goes to some lengths to try to figure out what your
4182 original program was doing, some parts of the language can still trip
4183 it up; it still fails even on some parts of Perl's own test suite. If
4184 you encounter a failure other than the most common ones described in
4185 the BUGS section below, you can help contribute to B::Deparse's
4186 ongoing development by submitting a bug report with a small
4191 As with all compiler backend options, these must follow directly after
4192 the '-MO=Deparse', separated by a comma but not any white space.
4198 Output data values (when they appear as constants) using Data::Dumper.
4199 Without this option, B::Deparse will use some simple routines of its
4200 own for the same purpose. Currently, Data::Dumper is better for some
4201 kinds of data (such as complex structures with sharing and
4202 self-reference) while the built-in routines are better for others
4203 (such as odd floating-point values).
4207 Normally, B::Deparse deparses the main code of a program, and all the subs
4208 defined in the same file. To include subs defined in other files, pass the
4209 B<-f> option with the filename. You can pass the B<-f> option several times, to
4210 include more than one secondary file. (Most of the time you don't want to
4211 use it at all.) You can also use this option to include subs which are
4212 defined in the scope of a B<#line> directive with two parameters.
4216 Add '#line' declarations to the output based on the line and file
4217 locations of the original code.
4221 Print extra parentheses. Without this option, B::Deparse includes
4222 parentheses in its output only when they are needed, based on the
4223 structure of your program. With B<-p>, it uses parentheses (almost)
4224 whenever they would be legal. This can be useful if you are used to
4225 LISP, or if you want to see how perl parses your input. If you say
4227 if ($var & 0x7f == 65) {print "Gimme an A!"}
4228 print ($which ? $a : $b), "\n";
4229 $name = $ENV{USER} or "Bob";
4231 C<B::Deparse,-p> will print
4234 print('Gimme an A!')
4236 (print(($which ? $a : $b)), '???');
4237 (($name = $ENV{'USER'}) or '???')
4239 which probably isn't what you intended (the C<'???'> is a sign that
4240 perl optimized away a constant value).
4244 Disable prototype checking. With this option, all function calls are
4245 deparsed as if no prototype was defined for them. In other words,
4247 perl -MO=Deparse,-P -e 'sub foo (\@) { 1 } foo @x'
4256 making clear how the parameters are actually passed to C<foo>.
4260 Expand double-quoted strings into the corresponding combinations of
4261 concatenation, uc, ucfirst, lc, lcfirst, quotemeta, and join. For
4264 print "Hello, $world, @ladies, \u$gentlemen\E, \u\L$me!";
4268 print 'Hello, ' . $world . ', ' . join($", @ladies) . ', '
4269 . ucfirst($gentlemen) . ', ' . ucfirst(lc $me . '!');
4271 Note that the expanded form represents the way perl handles such
4272 constructions internally -- this option actually turns off the reverse
4273 translation that B::Deparse usually does. On the other hand, note that
4274 C<$x = "$y"> is not the same as C<$x = $y>: the former makes the value
4275 of $y into a string before doing the assignment.
4277 =item B<-s>I<LETTERS>
4279 Tweak the style of B::Deparse's output. The letters should follow
4280 directly after the 's', with no space or punctuation. The following
4281 options are available:
4287 Cuddle C<elsif>, C<else>, and C<continue> blocks. For example, print
4304 The default is not to cuddle.
4308 Indent lines by multiples of I<NUMBER> columns. The default is 4 columns.
4312 Use tabs for each 8 columns of indent. The default is to use only spaces.
4313 For instance, if the style options are B<-si4T>, a line that's indented
4314 3 times will be preceded by one tab and four spaces; if the options were
4315 B<-si8T>, the same line would be preceded by three tabs.
4317 =item B<v>I<STRING>B<.>
4319 Print I<STRING> for the value of a constant that can't be determined
4320 because it was optimized away (mnemonic: this happens when a constant
4321 is used in B<v>oid context). The end of the string is marked by a period.
4322 The string should be a valid perl expression, generally a constant.
4323 Note that unless it's a number, it probably needs to be quoted, and on
4324 a command line quotes need to be protected from the shell. Some
4325 conventional values include 0, 1, 42, '', 'foo', and
4326 'Useless use of constant omitted' (which may need to be
4327 B<-sv"'Useless use of constant omitted'.">
4328 or something similar depending on your shell). The default is '???'.
4329 If you're using B::Deparse on a module or other file that's require'd,
4330 you shouldn't use a value that evaluates to false, since the customary
4331 true constant at the end of a module will be in void context when the
4332 file is compiled as a main program.
4338 Expand conventional syntax constructions into equivalent ones that expose
4339 their internal operation. I<LEVEL> should be a digit, with higher values
4340 meaning more expansion. As with B<-q>, this actually involves turning off
4341 special cases in B::Deparse's normal operations.
4343 If I<LEVEL> is at least 3, C<for> loops will be translated into equivalent
4344 while loops with continue blocks; for instance
4346 for ($i = 0; $i < 10; ++$i) {
4359 Note that in a few cases this translation can't be perfectly carried back
4360 into the source code -- if the loop's initializer declares a my variable,
4361 for instance, it won't have the correct scope outside of the loop.
4363 If I<LEVEL> is at least 5, C<use> declarations will be translated into
4364 C<BEGIN> blocks containing calls to C<require> and C<import>; for
4374 'strict'->import('refs')
4378 If I<LEVEL> is at least 7, C<if> statements will be translated into
4379 equivalent expressions using C<&&>, C<?:> and C<do {}>; for instance
4381 print 'hi' if $nice;
4393 $nice and print 'hi';
4394 $nice and do { print 'hi' };
4395 $nice ? do { print 'hi' } : do { print 'bye' };
4397 Long sequences of elsifs will turn into nested ternary operators, which
4398 B::Deparse doesn't know how to indent nicely.
4402 =head1 USING B::Deparse AS A MODULE
4407 $deparse = B::Deparse->new("-p", "-sC");
4408 $body = $deparse->coderef2text(\&func);
4409 eval "sub func $body"; # the inverse operation
4413 B::Deparse can also be used on a sub-by-sub basis from other perl
4418 $deparse = B::Deparse->new(OPTIONS)
4420 Create an object to store the state of a deparsing operation and any
4421 options. The options are the same as those that can be given on the
4422 command line (see L</OPTIONS>); options that are separated by commas
4423 after B<-MO=Deparse> should be given as separate strings. Some
4424 options, like B<-u>, don't make sense for a single subroutine, so
4427 =head2 ambient_pragmas
4429 $deparse->ambient_pragmas(strict => 'all', '$[' => $[);
4431 The compilation of a subroutine can be affected by a few compiler
4432 directives, B<pragmas>. These are:
4446 Assigning to the special variable $[
4466 Ordinarily, if you use B::Deparse on a subroutine which has
4467 been compiled in the presence of one or more of these pragmas,
4468 the output will include statements to turn on the appropriate
4469 directives. So if you then compile the code returned by coderef2text,
4470 it will behave the same way as the subroutine which you deparsed.
4472 However, you may know that you intend to use the results in a
4473 particular context, where some pragmas are already in scope. In
4474 this case, you use the B<ambient_pragmas> method to describe the
4475 assumptions you wish to make.
4477 Not all of the options currently have any useful effect. See
4478 L</BUGS> for more details.
4480 The parameters it accepts are:
4486 Takes a string, possibly containing several values separated
4487 by whitespace. The special values "all" and "none" mean what you'd
4490 $deparse->ambient_pragmas(strict => 'subs refs');
4494 Takes a number, the value of the array base $[.
4502 If the value is true, then the appropriate pragma is assumed to
4503 be in the ambient scope, otherwise not.
4507 Takes a string, possibly containing a whitespace-separated list of
4508 values. The values "all" and "none" are special. It's also permissible
4509 to pass an array reference here.
4511 $deparser->ambient_pragmas(re => 'eval');
4516 Takes a string, possibly containing a whitespace-separated list of
4517 values. The values "all" and "none" are special, again. It's also
4518 permissible to pass an array reference here.
4520 $deparser->ambient_pragmas(warnings => [qw[void io]]);
4522 If one of the values is the string "FATAL", then all the warnings
4523 in that list will be considered fatal, just as with the B<warnings>
4524 pragma itself. Should you need to specify that some warnings are
4525 fatal, and others are merely enabled, you can pass the B<warnings>
4528 $deparser->ambient_pragmas(
4530 warnings => [FATAL => qw/void io/],
4533 See L<perllexwarn> for more information about lexical warnings.
4539 These two parameters are used to specify the ambient pragmas in
4540 the format used by the special variables $^H and ${^WARNING_BITS}.
4542 They exist principally so that you can write code like:
4544 { my ($hint_bits, $warning_bits);
4545 BEGIN {($hint_bits, $warning_bits) = ($^H, ${^WARNING_BITS})}
4546 $deparser->ambient_pragmas (
4547 hint_bits => $hint_bits,
4548 warning_bits => $warning_bits,
4552 which specifies that the ambient pragmas are exactly those which
4553 are in scope at the point of calling.
4559 $body = $deparse->coderef2text(\&func)
4560 $body = $deparse->coderef2text(sub ($$) { ... })
4562 Return source code for the body of a subroutine (a block, optionally
4563 preceded by a prototype in parens), given a reference to the
4564 sub. Because a subroutine can have no names, or more than one name,
4565 this method doesn't return a complete subroutine definition -- if you
4566 want to eval the result, you should prepend "sub subname ", or "sub "
4567 for an anonymous function constructor. Unless the sub was defined in
4568 the main:: package, the code will include a package declaration.
4576 The only pragmas to be completely supported are: C<use warnings>,
4577 C<use strict 'refs'>, C<use bytes>, and C<use integer>. (C<$[>, which
4578 behaves like a pragma, is also supported.)
4580 Excepting those listed above, we're currently unable to guarantee that
4581 B::Deparse will produce a pragma at the correct point in the program.
4582 (Specifically, pragmas at the beginning of a block often appear right
4583 before the start of the block instead.)
4584 Since the effects of pragmas are often lexically scoped, this can mean
4585 that the pragma holds sway over a different portion of the program
4586 than in the input file.
4590 In fact, the above is a specific instance of a more general problem:
4591 we can't guarantee to produce BEGIN blocks or C<use> declarations in
4592 exactly the right place. So if you use a module which affects compilation
4593 (such as by over-riding keywords, overloading constants or whatever)
4594 then the output code might not work as intended.
4596 This is the most serious outstanding problem, and will require some help
4597 from the Perl core to fix.
4601 If a keyword is over-ridden, and your program explicitly calls
4602 the built-in version by using CORE::keyword, the output of B::Deparse
4603 will not reflect this. If you run the resulting code, it will call
4604 the over-ridden version rather than the built-in one. (Maybe there
4605 should be an option to B<always> print keyword calls as C<CORE::name>.)
4609 Some constants don't print correctly either with or without B<-d>.
4610 For instance, neither B::Deparse nor Data::Dumper know how to print
4611 dual-valued scalars correctly, as in:
4613 use constant E2BIG => ($!=7); $y = E2BIG; print $y, 0+$y;
4617 An input file that uses source filtering probably won't be deparsed into
4618 runnable code, because it will still include the B<use> declaration
4619 for the source filtering module, even though the code that is
4620 produced is already ordinary Perl which shouldn't be filtered again.
4624 Optimised away statements are rendered as '???'. This includes statements that
4625 have a compile-time side-effect, such as the obscure
4629 which is not, consequently, deparsed correctly.
4633 There are probably many more bugs on non-ASCII platforms (EBCDIC).
4639 Stephen McCamant <smcc@CSUA.Berkeley.EDU>, based on an earlier version
4640 by Malcolm Beattie <mbeattie@sable.ox.ac.uk>, with contributions from
4641 Gisle Aas, James Duncan, Albert Dvornik, Robin Houston, Dave Mitchell,
4642 Hugo van der Sanden, Gurusamy Sarathy, Nick Ing-Simmons, and Rafael