2 # Copyright (c) 1998-2000, 2002, 2003, 2004, 2005, 2006 Stephen McCamant.
4 # This module is free software; you can redistribute and/or modify
5 # it under the same terms as Perl itself.
7 # This is based on the module of the same name by Malcolm Beattie,
8 # but essentially none of his code remains.
12 use B qw(class main_root main_start main_cv svref_2object opnumber perlstring
13 OPf_WANT OPf_WANT_VOID OPf_WANT_SCALAR OPf_WANT_LIST
14 OPf_KIDS OPf_REF OPf_STACKED OPf_SPECIAL OPf_MOD OPpPAD_STATE
15 OPpLVAL_INTRO OPpOUR_INTRO OPpENTERSUB_AMPER OPpSLICE OPpCONST_BARE
16 OPpTRANS_SQUASH OPpTRANS_DELETE OPpTRANS_COMPLEMENT OPpTARGET_MY
17 OPpCONST_ARYBASE OPpEXISTS_SUB OPpSORT_NUMERIC OPpSORT_INTEGER
18 OPpSORT_REVERSE OPpSORT_INPLACE OPpSORT_DESCEND OPpITER_REVERSED
19 SVf_IOK SVf_NOK SVf_ROK SVf_POK SVpad_OUR SVf_FAKE SVs_RMG SVs_SMG
20 CVf_METHOD CVf_LOCKED CVf_LVALUE CVf_ASSERTION
21 PMf_KEEP PMf_GLOBAL PMf_CONTINUE PMf_EVAL PMf_ONCE PMf_SKIPWHITE
22 PMf_MULTILINE PMf_SINGLELINE PMf_FOLD PMf_EXTENDED);
25 use vars qw/$AUTOLOAD/;
28 # Changes between 0.50 and 0.51:
29 # - fixed nulled leave with live enter in sort { }
30 # - fixed reference constants (\"str")
31 # - handle empty programs gracefully
32 # - handle infinte loops (for (;;) {}, while (1) {})
33 # - differentiate between `for my $x ...' and `my $x; for $x ...'
34 # - various minor cleanups
35 # - moved globals into an object
36 # - added `-u', like B::C
37 # - package declarations using cop_stash
38 # - subs, formats and code sorted by cop_seq
39 # Changes between 0.51 and 0.52:
40 # - added pp_threadsv (special variables under USE_5005THREADS)
41 # - added documentation
42 # Changes between 0.52 and 0.53:
43 # - many changes adding precedence contexts and associativity
44 # - added `-p' and `-s' output style options
45 # - various other minor fixes
46 # Changes between 0.53 and 0.54:
47 # - added support for new `for (1..100)' optimization,
49 # Changes between 0.54 and 0.55:
50 # - added support for new qr// construct
51 # - added support for new pp_regcreset OP
52 # Changes between 0.55 and 0.56:
53 # - tested on base/*.t, cmd/*.t, comp/*.t, io/*.t
54 # - fixed $# on non-lexicals broken in last big rewrite
55 # - added temporary fix for change in opcode of OP_STRINGIFY
56 # - fixed problem in 0.54's for() patch in `for (@ary)'
57 # - fixed precedence in conditional of ?:
58 # - tweaked list paren elimination in `my($x) = @_'
59 # - made continue-block detection trickier wrt. null ops
60 # - fixed various prototype problems in pp_entersub
61 # - added support for sub prototypes that never get GVs
62 # - added unquoting for special filehandle first arg in truncate
63 # - print doubled rv2gv (a bug) as `*{*GV}' instead of illegal `**GV'
64 # - added semicolons at the ends of blocks
65 # - added -l `#line' declaration option -- fixes cmd/subval.t 27,28
66 # Changes between 0.56 and 0.561:
67 # - fixed multiply-declared my var in pp_truncate (thanks to Sarathy)
68 # - used new B.pm symbolic constants (done by Nick Ing-Simmons)
69 # Changes between 0.561 and 0.57:
70 # - stylistic changes to symbolic constant stuff
71 # - handled scope in s///e replacement code
72 # - added unquote option for expanding "" into concats, etc.
73 # - split method and proto parts of pp_entersub into separate functions
74 # - various minor cleanups
76 # - added parens in \&foo (patch by Albert Dvornik)
77 # Changes between 0.57 and 0.58:
78 # - fixed `0' statements that weren't being printed
79 # - added methods for use from other programs
80 # (based on patches from James Duncan and Hugo van der Sanden)
81 # - added -si and -sT to control indenting (also based on a patch from Hugo)
82 # - added -sv to print something else instead of '???'
83 # - preliminary version of utf8 tr/// handling
85 # - uses of $op->ppaddr changed to new $op->name (done by Sarathy)
86 # - added support for Hugo's new OP_SETSTATE (like nextstate)
87 # Changes between 0.58 and 0.59
88 # - added support for Chip's OP_METHOD_NAMED
89 # - added support for Ilya's OPpTARGET_MY optimization
90 # - elided arrows before `()' subscripts when possible
91 # Changes between 0.59 and 0.60
92 # - support for method attribues was added
93 # - some warnings fixed
94 # - separate recognition of constant subs
95 # - rewrote continue block handling, now recoginizing for loops
96 # - added more control of expanding control structures
97 # Changes between 0.60 and 0.61 (mostly by Robin Houston)
99 # - support for pragmas and 'use'
100 # - support for the little-used $[ variable
101 # - support for __DATA__ sections
103 # - BEGIN, CHECK, INIT and END blocks
104 # - scoping of subroutine declarations fixed
105 # - compile-time output from the input program can be suppressed, so that the
106 # output is just the deparsed code. (a change to O.pm in fact)
107 # - our() declarations
108 # - *all* the known bugs are now listed in the BUGS section
109 # - comprehensive test mechanism (TEST -deparse)
110 # Changes between 0.62 and 0.63 (mostly by Rafael Garcia-Suarez)
113 # - support for command-line switches (-l, -0, etc.)
114 # Changes between 0.63 and 0.64
115 # - support for //, CHECK blocks, and assertions
116 # - improved handling of foreach loops and lexicals
117 # - option to use Data::Dumper for constants
119 # - discovered lots more bugs not yet fixed
123 # Changes between 0.72 and 0.73
124 # - support new switch constructs
127 # (See also BUGS section at the end of this file)
129 # - finish tr/// changes
130 # - add option for even more parens (generalize \&foo change)
131 # - left/right context
132 # - copy comments (look at real text with $^P?)
133 # - avoid semis in one-statement blocks
134 # - associativity of &&=, ||=, ?:
135 # - ',' => '=>' (auto-unquote?)
136 # - break long lines ("\r" as discretionary break?)
137 # - configurable syntax highlighting: ANSI color, HTML, TeX, etc.
138 # - more style options: brace style, hex vs. octal, quotes, ...
139 # - print big ints as hex/octal instead of decimal (heuristic?)
140 # - handle `my $x if 0'?
141 # - version using op_next instead of op_first/sibling?
142 # - avoid string copies (pass arrays, one big join?)
145 # Current test.deparse failures
146 # comp/assertions 38 - disabled assertions should be like "my($x) if 0"
147 # 'sub f : assertion {}; no assertions; my $x=1; {f(my $x=2); print "$x\n"}'
148 # comp/hints 6 - location of BEGIN blocks wrt. block openings
149 # run/switchI 1 - missing -I switches entirely
150 # perl -Ifoo -e 'print @INC'
151 # op/caller 2 - warning mask propagates backwards before warnings::register
152 # 'use warnings; BEGIN {${^WARNING_BITS} eq "U"x12;} use warnings::register'
153 # op/getpid 2 - can't assign to shared my() declaration (threads only)
154 # 'my $x : shared = 5'
155 # op/override 7 - parens on overriden require change v-string interpretation
156 # 'BEGIN{*CORE::GLOBAL::require=sub {}} require v5.6'
157 # c.f. 'BEGIN { *f = sub {0} }; f 2'
158 # op/pat 774 - losing Unicode-ness of Latin1-only strings
159 # 'use charnames ":short"; $x="\N{latin:a with acute}"'
160 # op/recurse 12 - missing parens on recursive call makes it look like method
162 # op/subst 90 - inconsistent handling of utf8 under "use utf8"
163 # op/taint 29 - "use re 'taint'" deparsed in the wrong place wrt. block open
164 # op/tiehandle compile - "use strict" deparsed in the wrong place
166 # ext/B/t/xref 11 - line numbers when we add newlines to one-line subs
167 # ext/Data/Dumper/t/dumper compile
168 # ext/DB_file/several
170 # ext/Ernno/Errno warnings
171 # ext/IO/lib/IO/t/io_sel 23
172 # ext/PerlIO/t/encoding compile
173 # ext/POSIX/t/posix 6
174 # ext/Socket/Socket 8
175 # ext/Storable/t/croak compile
176 # lib/Attribute/Handlers/t/multi compile
177 # lib/bignum/ several
181 # lib/ExtUtils/t/bytes 4
182 # lib/File/DosGlob compile
183 # lib/Filter/Simple/t/data 1
184 # lib/Math/BigInt/t/constant 1
185 # lib/Net/t/config Deparse-warning
186 # lib/overload compile
187 # lib/Switch/ several
189 # lib/Test/Simple several
191 # lib/Tie/File/t/29_downcopy 5
194 # Object fields (were globals):
197 # (local($a), local($b)) and local($a, $b) have the same internal
198 # representation but the short form looks better. We notice we can
199 # use a large-scale local when checking the list, but need to prevent
200 # individual locals too. This hash holds the addresses of OPs that
201 # have already had their local-ness accounted for. The same thing
205 # CV for current sub (or main program) being deparsed
208 # Cached hash of lexical variables for curcv: keys are names,
209 # each value is an array of pairs, indicating the cop_seq of scopes
210 # in which a var of that name is valid.
213 # COP for statement being deparsed
216 # name of the current package for deparsed code
219 # array of [cop_seq, CV, is_format?] for subs and formats we still
223 # as above, but [name, prototype] for subs that never got a GV
225 # subs_done, forms_done:
226 # keys are addresses of GVs for subs and formats we've already
227 # deparsed (or at least put into subs_todo)
230 # keys are names of subs for which we've printed declarations.
231 # That means we can omit parentheses from the arguments.
234 # Keeps track of fully qualified names of all deparsed subs.
239 # cuddle: ` ' or `\n', depending on -sC
244 # A little explanation of how precedence contexts and associativity
247 # deparse() calls each per-op subroutine with an argument $cx (short
248 # for context, but not the same as the cx* in the perl core), which is
249 # a number describing the op's parents in terms of precedence, whether
250 # they're inside an expression or at statement level, etc. (see
251 # chart below). When ops with children call deparse on them, they pass
252 # along their precedence. Fractional values are used to implement
253 # associativity (`($x + $y) + $z' => `$x + $y + $y') and related
254 # parentheses hacks. The major disadvantage of this scheme is that
255 # it doesn't know about right sides and left sides, so say if you
256 # assign a listop to a variable, it can't tell it's allowed to leave
257 # the parens off the listop.
260 # 26 [TODO] inside interpolation context ("")
261 # 25 left terms and list operators (leftward)
265 # 21 right ! ~ \ and unary + and -
270 # 16 nonassoc named unary operators
271 # 15 nonassoc < > <= >= lt gt le ge
272 # 14 nonassoc == != <=> eq ne cmp
279 # 7 right = += -= *= etc.
281 # 5 nonassoc list operators (rightward)
285 # 1 statement modifiers
286 # 0.5 statements, but still print scopes as do { ... }
289 # Nonprinting characters with special meaning:
290 # \cS - steal parens (see maybe_parens_unop)
291 # \n - newline and indent
292 # \t - increase indent
293 # \b - decrease indent (`outdent')
294 # \f - flush left (no indent)
295 # \cK - kill following semicolon, if any
299 return class($op) eq "NULL";
304 my($cv, $is_form) = @_;
305 return unless ($cv->FILE eq $0 || exists $self->{files}{$cv->FILE});
307 if ($cv->OUTSIDE_SEQ) {
308 $seq = $cv->OUTSIDE_SEQ;
309 } elsif (!null($cv->START) and is_state($cv->START)) {
310 $seq = $cv->START->cop_seq;
314 push @{$self->{'subs_todo'}}, [$seq, $cv, $is_form];
315 unless ($is_form || class($cv->STASH) eq 'SPECIAL') {
316 $self->{'subs_deparsed'}{$cv->STASH->NAME."::".$cv->GV->NAME} = 1;
322 my $ent = shift @{$self->{'subs_todo'}};
325 my $name = $self->gv_name($gv);
327 return "format $name =\n"
328 . $self->deparse_format($ent->[1]). "\n";
330 $self->{'subs_declared'}{$name} = 1;
331 if ($name eq "BEGIN") {
332 my $use_dec = $self->begin_is_use($cv);
333 if (defined ($use_dec) and $self->{'expand'} < 5) {
334 return () if 0 == length($use_dec);
339 if ($self->{'linenums'}) {
340 my $line = $gv->LINE;
341 my $file = $gv->FILE;
342 $l = "\n\f#line $line \"$file\"\n";
345 if (class($cv->STASH) ne "SPECIAL") {
346 my $stash = $cv->STASH->NAME;
347 if ($stash ne $self->{'curstash'}) {
348 $p = "package $stash;\n";
349 $name = "$self->{'curstash'}::$name" unless $name =~ /::/;
350 $self->{'curstash'} = $stash;
352 $name =~ s/^\Q$stash\E:://;
354 return "${p}${l}sub $name " . $self->deparse_sub($cv);
358 # Return a "use" declaration for this BEGIN block, if appropriate
360 my ($self, $cv) = @_;
361 my $root = $cv->ROOT;
362 local @$self{qw'curcv curcvlex'} = ($cv);
364 #B::walkoptree($cv->ROOT, "debug");
365 my $lineseq = $root->first;
366 return if $lineseq->name ne "lineseq";
368 my $req_op = $lineseq->first->sibling;
369 return if $req_op->name ne "require";
372 if ($req_op->first->private & OPpCONST_BARE) {
373 # Actually it should always be a bareword
374 $module = $self->const_sv($req_op->first)->PV;
375 $module =~ s[/][::]g;
379 $module = $self->const($self->const_sv($req_op->first), 6);
383 my $version_op = $req_op->sibling;
384 return if class($version_op) eq "NULL";
385 if ($version_op->name eq "lineseq") {
386 # We have a version parameter; skip nextstate & pushmark
387 my $constop = $version_op->first->next->next;
389 return unless $self->const_sv($constop)->PV eq $module;
390 $constop = $constop->sibling;
391 $version = $self->const_sv($constop);
392 if (class($version) eq "IV") {
393 $version = $version->int_value;
394 } elsif (class($version) eq "NV") {
395 $version = $version->NV;
396 } elsif (class($version) ne "PVMG") {
397 # Includes PVIV and PVNV
398 $version = $version->PV;
400 # version specified as a v-string
401 $version = 'v'.join '.', map ord, split //, $version->PV;
403 $constop = $constop->sibling;
404 return if $constop->name ne "method_named";
405 return if $self->const_sv($constop)->PV ne "VERSION";
408 $lineseq = $version_op->sibling;
409 return if $lineseq->name ne "lineseq";
410 my $entersub = $lineseq->first->sibling;
411 if ($entersub->name eq "stub") {
412 return "use $module $version ();\n" if defined $version;
413 return "use $module ();\n";
415 return if $entersub->name ne "entersub";
417 # See if there are import arguments
420 my $svop = $entersub->first->sibling; # Skip over pushmark
421 return unless $self->const_sv($svop)->PV eq $module;
423 # Pull out the arguments
424 for ($svop=$svop->sibling; $svop->name ne "method_named";
425 $svop = $svop->sibling) {
426 $args .= ", " if length($args);
427 $args .= $self->deparse($svop, 6);
431 my $method_named = $svop;
432 return if $method_named->name ne "method_named";
433 my $method_name = $self->const_sv($method_named)->PV;
435 if ($method_name eq "unimport") {
439 # Certain pragmas are dealt with using hint bits,
440 # so we ignore them here
441 if ($module eq 'strict' || $module eq 'integer'
442 || $module eq 'bytes' || $module eq 'warnings') {
446 if (defined $version && length $args) {
447 return "$use $module $version ($args);\n";
448 } elsif (defined $version) {
449 return "$use $module $version;\n";
450 } elsif (length $args) {
451 return "$use $module ($args);\n";
453 return "$use $module;\n";
458 my ($self, $pack) = @_;
460 if (!defined $pack) {
465 $pack =~ s/(::)?$/::/;
469 my %stash = svref_2object($stash)->ARRAY;
470 while (my ($key, $val) = each %stash) {
471 next if $key eq 'main::'; # avoid infinite recursion
472 my $class = class($val);
473 if ($class eq "PV") {
474 # Just a prototype. As an ugly but fairly effective way
475 # to find out if it belongs here is to see if the AUTOLOAD
476 # (if any) for the stash was defined in one of our files.
477 my $A = $stash{"AUTOLOAD"};
478 if (defined ($A) && class($A) eq "GV" && defined($A->CV)
479 && class($A->CV) eq "CV") {
481 next unless $AF eq $0 || exists $self->{'files'}{$AF};
483 push @{$self->{'protos_todo'}}, [$pack . $key, $val->PV];
484 } elsif ($class eq "IV") {
485 # Just a name. As above.
486 my $A = $stash{"AUTOLOAD"};
487 if (defined ($A) && class($A) eq "GV" && defined($A->CV)
488 && class($A->CV) eq "CV") {
490 next unless $AF eq $0 || exists $self->{'files'}{$AF};
492 push @{$self->{'protos_todo'}}, [$pack . $key, undef];
493 } elsif ($class eq "GV") {
494 if (class(my $cv = $val->CV) ne "SPECIAL") {
495 next if $self->{'subs_done'}{$$val}++;
496 next if $$val != ${$cv->GV}; # Ignore imposters
499 if (class(my $cv = $val->FORM) ne "SPECIAL") {
500 next if $self->{'forms_done'}{$$val}++;
501 next if $$val != ${$cv->GV}; # Ignore imposters
504 if (class($val->HV) ne "SPECIAL" && $key =~ /::$/) {
505 $self->stash_subs($pack . $key);
515 foreach $ar (@{$self->{'protos_todo'}}) {
516 my $proto = (defined $ar->[1] ? " (". $ar->[1] . ")" : "");
517 push @ret, "sub " . $ar->[0] . "$proto;\n";
519 delete $self->{'protos_todo'};
527 while (length($opt = substr($opts, 0, 1))) {
529 $self->{'cuddle'} = " ";
530 $opts = substr($opts, 1);
531 } elsif ($opt eq "i") {
532 $opts =~ s/^i(\d+)//;
533 $self->{'indent_size'} = $1;
534 } elsif ($opt eq "T") {
535 $self->{'use_tabs'} = 1;
536 $opts = substr($opts, 1);
537 } elsif ($opt eq "v") {
538 $opts =~ s/^v([^.]*)(.|$)//;
539 $self->{'ex_const'} = $1;
546 my $self = bless {}, $class;
547 $self->{'cuddle'} = "\n";
548 $self->{'curcop'} = undef;
549 $self->{'curstash'} = "main";
550 $self->{'ex_const'} = "'???'";
551 $self->{'expand'} = 0;
552 $self->{'files'} = {};
553 $self->{'indent_size'} = 4;
554 $self->{'linenums'} = 0;
555 $self->{'parens'} = 0;
556 $self->{'subs_todo'} = [];
557 $self->{'unquote'} = 0;
558 $self->{'use_dumper'} = 0;
559 $self->{'use_tabs'} = 0;
561 $self->{'ambient_arybase'} = 0;
562 $self->{'ambient_warnings'} = undef; # Assume no lexical warnings
563 $self->{'ambient_hints'} = 0;
566 while (my $arg = shift @_) {
568 $self->{'use_dumper'} = 1;
569 require Data::Dumper;
570 } elsif ($arg =~ /^-f(.*)/) {
571 $self->{'files'}{$1} = 1;
572 } elsif ($arg eq "-l") {
573 $self->{'linenums'} = 1;
574 } elsif ($arg eq "-p") {
575 $self->{'parens'} = 1;
576 } elsif ($arg eq "-P") {
577 $self->{'noproto'} = 1;
578 } elsif ($arg eq "-q") {
579 $self->{'unquote'} = 1;
580 } elsif (substr($arg, 0, 2) eq "-s") {
581 $self->style_opts(substr $arg, 2);
582 } elsif ($arg =~ /^-x(\d)$/) {
583 $self->{'expand'} = $1;
590 # Mask out the bits that L<warnings::register> uses
593 $WARN_MASK = $warnings::Bits{all} | $warnings::DeadBits{all};
600 # Initialise the contextual information, either from
601 # defaults provided with the ambient_pragmas method,
602 # or from perl's own defaults otherwise.
606 $self->{'arybase'} = $self->{'ambient_arybase'};
607 $self->{'warnings'} = defined ($self->{'ambient_warnings'})
608 ? $self->{'ambient_warnings'} & WARN_MASK
610 $self->{'hints'} = $self->{'ambient_hints'};
612 # also a convenient place to clear out subs_declared
613 delete $self->{'subs_declared'};
619 my $self = B::Deparse->new(@args);
620 # First deparse command-line args
621 if (defined $^I) { # deparse -i
622 print q(BEGIN { $^I = ).perlstring($^I).qq(; }\n);
624 if ($^W) { # deparse -w
625 print qq(BEGIN { \$^W = $^W; }\n);
627 if ($/ ne "\n" or defined $O::savebackslash) { # deparse -l and -0
628 my $fs = perlstring($/) || 'undef';
629 my $bs = perlstring($O::savebackslash) || 'undef';
630 print qq(BEGIN { \$/ = $fs; \$\\ = $bs; }\n);
632 my @BEGINs = B::begin_av->isa("B::AV") ? B::begin_av->ARRAY : ();
633 my @UNITCHECKs = B::unitcheck_av->isa("B::AV")
634 ? B::unitcheck_av->ARRAY
636 my @CHECKs = B::check_av->isa("B::AV") ? B::check_av->ARRAY : ();
637 my @INITs = B::init_av->isa("B::AV") ? B::init_av->ARRAY : ();
638 my @ENDs = B::end_av->isa("B::AV") ? B::end_av->ARRAY : ();
639 for my $block (@BEGINs, @UNITCHECKs, @CHECKs, @INITs, @ENDs) {
640 $self->todo($block, 0);
643 local($SIG{"__DIE__"}) =
645 if ($self->{'curcop'}) {
646 my $cop = $self->{'curcop'};
647 my($line, $file) = ($cop->line, $cop->file);
648 print STDERR "While deparsing $file near line $line,\n";
651 $self->{'curcv'} = main_cv;
652 $self->{'curcvlex'} = undef;
653 print $self->print_protos;
654 @{$self->{'subs_todo'}} =
655 sort {$a->[0] <=> $b->[0]} @{$self->{'subs_todo'}};
656 print $self->indent($self->deparse_root(main_root)), "\n"
657 unless null main_root;
659 while (scalar(@{$self->{'subs_todo'}})) {
660 push @text, $self->next_todo;
662 print $self->indent(join("", @text)), "\n" if @text;
664 # Print __DATA__ section, if necessary
666 my $laststash = defined $self->{'curcop'}
667 ? $self->{'curcop'}->stash->NAME : $self->{'curstash'};
668 if (defined *{$laststash."::DATA"}{IO}) {
669 print "package $laststash;\n"
670 unless $laststash eq $self->{'curstash'};
672 print readline(*{$laststash."::DATA"});
680 croak "Usage: ->coderef2text(CODEREF)" unless UNIVERSAL::isa($sub, "CODE");
683 return $self->indent($self->deparse_sub(svref_2object($sub)));
686 sub ambient_pragmas {
688 my ($arybase, $hint_bits, $warning_bits) = (0, 0);
694 if ($name eq 'strict') {
697 if ($val eq 'none') {
698 $hint_bits &= ~strict::bits(qw/refs subs vars/);
704 @names = qw/refs subs vars/;
710 @names = split' ', $val;
712 $hint_bits |= strict::bits(@names);
715 elsif ($name eq '$[') {
719 elsif ($name eq 'integer'
721 || $name eq 'utf8') {
724 $hint_bits |= ${$::{"${name}::"}{"hint_bits"}};
727 $hint_bits &= ~${$::{"${name}::"}{"hint_bits"}};
731 elsif ($name eq 're') {
733 if ($val eq 'none') {
734 $hint_bits &= ~re::bits(qw/taint eval/);
740 @names = qw/taint eval/;
746 @names = split' ',$val;
748 $hint_bits |= re::bits(@names);
751 elsif ($name eq 'warnings') {
752 if ($val eq 'none') {
753 $warning_bits = $warnings::NONE;
762 @names = split/\s+/, $val;
765 $warning_bits = $warnings::NONE if !defined ($warning_bits);
766 $warning_bits |= warnings::bits(@names);
769 elsif ($name eq 'warning_bits') {
770 $warning_bits = $val;
773 elsif ($name eq 'hint_bits') {
778 croak "Unknown pragma type: $name";
782 croak "The ambient_pragmas method expects an even number of args";
785 $self->{'ambient_arybase'} = $arybase;
786 $self->{'ambient_warnings'} = $warning_bits;
787 $self->{'ambient_hints'} = $hint_bits;
790 # This method is the inner loop, so try to keep it simple
795 Carp::confess("Null op in deparse") if !defined($op)
796 || class($op) eq "NULL";
797 my $meth = "pp_" . $op->name;
798 return $self->$meth($op, $cx);
804 my @lines = split(/\n/, $txt);
809 my $cmd = substr($line, 0, 1);
810 if ($cmd eq "\t" or $cmd eq "\b") {
811 $level += ($cmd eq "\t" ? 1 : -1) * $self->{'indent_size'};
812 if ($self->{'use_tabs'}) {
813 $leader = "\t" x ($level / 8) . " " x ($level % 8);
815 $leader = " " x $level;
817 $line = substr($line, 1);
819 if (substr($line, 0, 1) eq "\f") {
820 $line = substr($line, 1); # no indent
822 $line = $leader . $line;
826 return join("\n", @lines);
833 Carp::confess("NULL in deparse_sub") if !defined($cv) || $cv->isa("B::NULL");
834 Carp::confess("SPECIAL in deparse_sub") if $cv->isa("B::SPECIAL");
835 local $self->{'curcop'} = $self->{'curcop'};
836 if ($cv->FLAGS & SVf_POK) {
837 $proto = "(". $cv->PV . ") ";
839 if ($cv->CvFLAGS & (CVf_METHOD|CVf_LOCKED|CVf_LVALUE|CVf_ASSERTION)) {
841 $proto .= "lvalue " if $cv->CvFLAGS & CVf_LVALUE;
842 $proto .= "locked " if $cv->CvFLAGS & CVf_LOCKED;
843 $proto .= "method " if $cv->CvFLAGS & CVf_METHOD;
844 $proto .= "assertion " if $cv->CvFLAGS & CVf_ASSERTION;
847 local($self->{'curcv'}) = $cv;
848 local($self->{'curcvlex'});
849 local(@$self{qw'curstash warnings hints'})
850 = @$self{qw'curstash warnings hints'};
852 if (not null $cv->ROOT) {
853 my $lineseq = $cv->ROOT->first;
854 if ($lineseq->name eq "lineseq") {
856 for(my$o=$lineseq->first; $$o; $o=$o->sibling) {
859 $body = $self->lineseq(undef, @ops).";";
860 my $scope_en = $self->find_scope_en($lineseq);
861 if (defined $scope_en) {
862 my $subs = join"", $self->seq_subs($scope_en);
863 $body .= ";\n$subs" if length($subs);
867 $body = $self->deparse($cv->ROOT->first, 0);
871 my $sv = $cv->const_sv;
873 # uh-oh. inlinable sub... format it differently
874 return $proto . "{ " . $self->const($sv, 0) . " }\n";
875 } else { # XSUB? (or just a declaration)
879 return $proto ."{\n\t$body\n\b}" ."\n";
886 local($self->{'curcv'}) = $form;
887 local($self->{'curcvlex'});
888 local($self->{'in_format'}) = 1;
889 local(@$self{qw'curstash warnings hints'})
890 = @$self{qw'curstash warnings hints'};
891 my $op = $form->ROOT;
893 return "\f." if $op->first->name eq 'stub'
894 || $op->first->name eq 'nextstate';
895 $op = $op->first->first; # skip leavewrite, lineseq
896 while (not null $op) {
897 $op = $op->sibling; # skip nextstate
899 $kid = $op->first->sibling; # skip pushmark
900 push @text, "\f".$self->const_sv($kid)->PV;
901 $kid = $kid->sibling;
902 for (; not null $kid; $kid = $kid->sibling) {
903 push @exprs, $self->deparse($kid, 0);
905 push @text, "\f".join(", ", @exprs)."\n" if @exprs;
908 return join("", @text) . "\f.";
913 return $op->name eq "leave" || $op->name eq "scope"
914 || $op->name eq "lineseq"
915 || ($op->name eq "null" && class($op) eq "UNOP"
916 && (is_scope($op->first) || $op->first->name eq "enter"));
920 my $name = $_[0]->name;
921 return $name eq "nextstate" || $name eq "dbstate" || $name eq "setstate";
924 sub is_miniwhile { # check for one-line loop (`foo() while $y--')
926 return (!null($op) and null($op->sibling)
927 and $op->name eq "null" and class($op) eq "UNOP"
928 and (($op->first->name =~ /^(and|or)$/
929 and $op->first->first->sibling->name eq "lineseq")
930 or ($op->first->name eq "lineseq"
931 and not null $op->first->first->sibling
932 and $op->first->first->sibling->name eq "unstack")
936 # Check if the op and its sibling are the initialization and the rest of a
937 # for (..;..;..) { ... } loop
940 # This OP might be almost anything, though it won't be a
941 # nextstate. (It's the initialization, so in the canonical case it
942 # will be an sassign.) The sibling is a lineseq whose first child
943 # is a nextstate and whose second is a leaveloop.
944 my $lseq = $op->sibling;
945 if (!is_state $op and !null($lseq) and $lseq->name eq "lineseq") {
946 if ($lseq->first && !null($lseq->first) && is_state($lseq->first)
947 && (my $sib = $lseq->first->sibling)) {
948 return (!null($sib) && $sib->name eq "leaveloop");
956 return ($op->name eq "rv2sv" or
957 $op->name eq "padsv" or
958 $op->name eq "gv" or # only in array/hash constructs
959 $op->flags & OPf_KIDS && !null($op->first)
960 && $op->first->name eq "gvsv");
965 my($text, $cx, $prec) = @_;
966 if ($prec < $cx # unary ops nest just fine
967 or $prec == $cx and $cx != 4 and $cx != 16 and $cx != 21
968 or $self->{'parens'})
971 # In a unop, let parent reuse our parens; see maybe_parens_unop
972 $text = "\cS" . $text if $cx == 16;
979 # same as above, but get around the `if it looks like a function' rule
980 sub maybe_parens_unop {
982 my($name, $kid, $cx) = @_;
983 if ($cx > 16 or $self->{'parens'}) {
984 $kid = $self->deparse($kid, 1);
985 if ($name eq "umask" && $kid =~ /^\d+$/) {
986 $kid = sprintf("%#o", $kid);
988 return "$name($kid)";
990 $kid = $self->deparse($kid, 16);
991 if ($name eq "umask" && $kid =~ /^\d+$/) {
992 $kid = sprintf("%#o", $kid);
994 if (substr($kid, 0, 1) eq "\cS") {
996 return $name . substr($kid, 1);
997 } elsif (substr($kid, 0, 1) eq "(") {
998 # avoid looks-like-a-function trap with extra parens
999 # (`+' can lead to ambiguities)
1000 return "$name(" . $kid . ")";
1002 return "$name $kid";
1007 sub maybe_parens_func {
1009 my($func, $text, $cx, $prec) = @_;
1010 if ($prec <= $cx or substr($text, 0, 1) eq "(" or $self->{'parens'}) {
1011 return "$func($text)";
1013 return "$func $text";
1019 my($op, $cx, $text) = @_;
1020 my $our_intro = ($op->name =~ /^(gv|rv2)[ash]v$/) ? OPpOUR_INTRO : 0;
1021 if ($op->private & (OPpLVAL_INTRO|$our_intro)
1022 and not $self->{'avoid_local'}{$$op}) {
1023 my $our_local = ($op->private & OPpLVAL_INTRO) ? "local" : "our";
1024 if( $our_local eq 'our' ) {
1025 # XXX This assertion fails code with non-ASCII identifiers,
1026 # like ./ext/Encode/t/jperl.t
1027 die "Unexpected our($text)\n" unless $text =~ /^\W(\w+::)*\w+\z/;
1028 $text =~ s/(\w+::)+//;
1030 if (want_scalar($op)) {
1031 return "$our_local $text";
1033 return $self->maybe_parens_func("$our_local", $text, $cx, 16);
1042 my($op, $cx, $func, @args) = @_;
1043 if ($op->private & OPpTARGET_MY) {
1044 my $var = $self->padname($op->targ);
1045 my $val = $func->($self, $op, 7, @args);
1046 return $self->maybe_parens("$var = $val", $cx, 7);
1048 return $func->($self, $op, $cx, @args);
1055 return $self->{'curcv'}->PADLIST->ARRAYelt(0)->ARRAYelt($targ);
1060 my($op, $cx, $text) = @_;
1061 if ($op->private & OPpLVAL_INTRO and not $self->{'avoid_local'}{$$op}) {
1062 my $my = $op->private & OPpPAD_STATE ? "state" : "my";
1063 if (want_scalar($op)) {
1066 return $self->maybe_parens_func($my, $text, $cx, 16);
1073 # The following OPs don't have functions:
1075 # pp_padany -- does not exist after parsing
1078 if ($AUTOLOAD =~ s/^.*::pp_//) {
1079 warn "unexpected OP_".uc $AUTOLOAD;
1082 die "Undefined subroutine $AUTOLOAD called";
1086 sub DESTROY {} # Do not AUTOLOAD
1088 # $root should be the op which represents the root of whatever
1089 # we're sequencing here. If it's undefined, then we don't append
1090 # any subroutine declarations to the deparsed ops, otherwise we
1091 # append appropriate declarations.
1093 my($self, $root, @ops) = @_;
1096 my $out_cop = $self->{'curcop'};
1097 my $out_seq = defined($out_cop) ? $out_cop->cop_seq : undef;
1099 if (defined $root) {
1100 $limit_seq = $out_seq;
1102 $nseq = $self->find_scope_st($root->sibling) if ${$root->sibling};
1103 $limit_seq = $nseq if !defined($limit_seq)
1104 or defined($nseq) && $nseq < $limit_seq;
1106 $limit_seq = $self->{'limit_seq'}
1107 if defined($self->{'limit_seq'})
1108 && (!defined($limit_seq) || $self->{'limit_seq'} < $limit_seq);
1109 local $self->{'limit_seq'} = $limit_seq;
1110 for (my $i = 0; $i < @ops; $i++) {
1112 if (is_state $ops[$i]) {
1113 $expr = $self->deparse($ops[$i], 0);
1120 if (!is_state $ops[$i] and (my $ls = $ops[$i+1]) and
1121 !null($ops[$i+1]) and $ops[$i+1]->name eq "lineseq")
1123 if ($ls->first && !null($ls->first) && is_state($ls->first)
1124 && (my $sib = $ls->first->sibling)) {
1125 if (!null($sib) && $sib->name eq "leaveloop") {
1126 push @exprs, $expr . $self->for_loop($ops[$i], 0);
1132 $expr .= $self->deparse($ops[$i], (@ops != 1)/2);
1133 $expr =~ s/;\n?\z//;
1136 my $body = join(";\n", grep {length} @exprs);
1138 if (defined $root && defined $limit_seq && !$self->{'in_format'}) {
1139 $subs = join "\n", $self->seq_subs($limit_seq);
1141 return join(";\n", grep {length} $body, $subs);
1145 my($real_block, $self, $op, $cx) = @_;
1149 local(@$self{qw'curstash warnings hints'})
1150 = @$self{qw'curstash warnings hints'} if $real_block;
1152 $kid = $op->first->sibling; # skip enter
1153 if (is_miniwhile($kid)) {
1154 my $top = $kid->first;
1155 my $name = $top->name;
1156 if ($name eq "and") {
1158 } elsif ($name eq "or") {
1160 } else { # no conditional -> while 1 or until 0
1161 return $self->deparse($top->first, 1) . " while 1";
1163 my $cond = $top->first;
1164 my $body = $cond->sibling->first; # skip lineseq
1165 $cond = $self->deparse($cond, 1);
1166 $body = $self->deparse($body, 1);
1167 return "$body $name $cond";
1172 for (; !null($kid); $kid = $kid->sibling) {
1175 if ($cx > 0) { # inside an expression, (a do {} while for lineseq)
1176 return "do {\n\t" . $self->lineseq($op, @kids) . "\n\b}";
1178 my $lineseq = $self->lineseq($op, @kids);
1179 return (length ($lineseq) ? "$lineseq;" : "");
1183 sub pp_scope { scopeop(0, @_); }
1184 sub pp_lineseq { scopeop(0, @_); }
1185 sub pp_leave { scopeop(1, @_); }
1187 # This is a special case of scopeop and lineseq, for the case of the
1188 # main_root. The difference is that we print the output statements as
1189 # soon as we get them, for the sake of impatient users.
1193 local(@$self{qw'curstash warnings hints'})
1194 = @$self{qw'curstash warnings hints'};
1196 return if null $op->first; # Can happen, e.g., for Bytecode without -k
1197 for (my $kid = $op->first->sibling; !null($kid); $kid = $kid->sibling) {
1200 for (my $i = 0; $i < @kids; $i++) {
1202 if (is_state $kids[$i]) {
1203 $expr = $self->deparse($kids[$i], 0);
1206 print $self->indent($expr);
1210 if (is_for_loop($kids[$i])) {
1211 $expr .= $self->for_loop($kids[$i], 0);
1212 $expr .= ";\n" unless $i == $#kids;
1213 print $self->indent($expr);
1217 $expr .= $self->deparse($kids[$i], (@kids != 1)/2);
1218 $expr =~ s/;\n?\z//;
1220 print $self->indent($expr);
1221 print "\n" unless $i == $#kids;
1225 # The BEGIN {} is used here because otherwise this code isn't executed
1226 # when you run B::Deparse on itself.
1228 BEGIN { map($globalnames{$_}++, "SIG", "STDIN", "STDOUT", "STDERR", "INC",
1229 "ENV", "ARGV", "ARGVOUT", "_"); }
1234 Carp::confess() unless ref($gv) eq "B::GV";
1235 my $stash = $gv->STASH->NAME;
1236 my $name = $gv->SAFENAME;
1237 if (($stash eq 'main' && $globalnames{$name})
1238 or ($stash eq $self->{'curstash'} && !$globalnames{$name})
1239 or $name =~ /^[^A-Za-z_:]/)
1243 $stash = $stash . "::";
1245 if ($name =~ /^(\^..|{)/) {
1246 $name = "{$name}"; # ${^WARNING_BITS}, etc and ${
1248 return $stash . $name;
1251 # Return the name to use for a stash variable.
1252 # If a lexical with the same name is in scope, it may need to be
1254 sub stash_variable {
1255 my ($self, $prefix, $name) = @_;
1257 return "$prefix$name" if $name =~ /::/;
1259 unless ($prefix eq '$' || $prefix eq '@' || #'
1260 $prefix eq '%' || $prefix eq '$#') {
1261 return "$prefix$name";
1264 my $v = ($prefix eq '$#' ? '@' : $prefix) . $name;
1265 return $prefix .$self->{'curstash'}.'::'. $name if $self->lex_in_scope($v);
1266 return "$prefix$name";
1270 my ($self, $name) = @_;
1271 $self->populate_curcvlex() if !defined $self->{'curcvlex'};
1273 return 0 if !defined($self->{'curcop'});
1274 my $seq = $self->{'curcop'}->cop_seq;
1275 return 0 if !exists $self->{'curcvlex'}{$name};
1276 for my $a (@{$self->{'curcvlex'}{$name}}) {
1277 my ($st, $en) = @$a;
1278 return 1 if $seq > $st && $seq <= $en;
1283 sub populate_curcvlex {
1285 for (my $cv = $self->{'curcv'}; class($cv) eq "CV"; $cv = $cv->OUTSIDE) {
1286 my $padlist = $cv->PADLIST;
1287 # an undef CV still in lexical chain
1288 next if class($padlist) eq "SPECIAL";
1289 my @padlist = $padlist->ARRAY;
1290 my @ns = $padlist[0]->ARRAY;
1292 for (my $i=0; $i<@ns; ++$i) {
1293 next if class($ns[$i]) eq "SPECIAL";
1294 next if $ns[$i]->FLAGS & SVpad_OUR; # Skip "our" vars
1295 if (class($ns[$i]) eq "PV") {
1296 # Probably that pesky lexical @_
1299 my $name = $ns[$i]->PVX;
1300 my ($seq_st, $seq_en) =
1301 ($ns[$i]->FLAGS & SVf_FAKE)
1303 : ($ns[$i]->NVX, $ns[$i]->IVX);
1305 push @{$self->{'curcvlex'}{$name}}, [$seq_st, $seq_en];
1310 sub find_scope_st { ((find_scope(@_))[0]); }
1311 sub find_scope_en { ((find_scope(@_))[1]); }
1313 # Recurses down the tree, looking for pad variable introductions and COPs
1315 my ($self, $op, $scope_st, $scope_en) = @_;
1316 carp("Undefined op in find_scope") if !defined $op;
1317 return ($scope_st, $scope_en) unless $op->flags & OPf_KIDS;
1319 for (my $o=$op->first; $$o; $o=$o->sibling) {
1320 if ($o->name =~ /^pad.v$/ && $o->private & OPpLVAL_INTRO) {
1321 my $s = int($self->padname_sv($o->targ)->NVX);
1322 my $e = $self->padname_sv($o->targ)->IVX;
1323 $scope_st = $s if !defined($scope_st) || $s < $scope_st;
1324 $scope_en = $e if !defined($scope_en) || $e > $scope_en;
1326 elsif (is_state($o)) {
1327 my $c = $o->cop_seq;
1328 $scope_st = $c if !defined($scope_st) || $c < $scope_st;
1329 $scope_en = $c if !defined($scope_en) || $c > $scope_en;
1331 elsif ($o->flags & OPf_KIDS) {
1332 ($scope_st, $scope_en) =
1333 $self->find_scope($o, $scope_st, $scope_en)
1337 return ($scope_st, $scope_en);
1340 # Returns a list of subs which should be inserted before the COP
1342 my ($self, $op, $out_seq) = @_;
1343 my $seq = $op->cop_seq;
1344 # If we have nephews, then our sequence number indicates
1345 # the cop_seq of the end of some sort of scope.
1346 if (class($op->sibling) ne "NULL" && $op->sibling->flags & OPf_KIDS
1347 and my $nseq = $self->find_scope_st($op->sibling) ) {
1350 $seq = $out_seq if defined($out_seq) && $out_seq < $seq;
1351 return $self->seq_subs($seq);
1355 my ($self, $seq) = @_;
1357 #push @text, "# ($seq)\n";
1359 return "" if !defined $seq;
1360 while (scalar(@{$self->{'subs_todo'}})
1361 and $seq > $self->{'subs_todo'}[0][0]) {
1362 push @text, $self->next_todo;
1367 # Notice how subs and formats are inserted between statements here;
1368 # also $[ assignments and pragmas.
1372 $self->{'curcop'} = $op;
1374 push @text, $self->cop_subs($op);
1375 push @text, $op->label . ": " if $op->label;
1376 my $stash = $op->stashpv;
1377 if ($stash ne $self->{'curstash'}) {
1378 push @text, "package $stash;\n";
1379 $self->{'curstash'} = $stash;
1382 if ($self->{'arybase'} != $op->arybase) {
1383 push @text, '$[ = '. $op->arybase .";\n";
1384 $self->{'arybase'} = $op->arybase;
1387 my $warnings = $op->warnings;
1389 if ($warnings->isa("B::SPECIAL") && $$warnings == 4) {
1390 $warning_bits = $warnings::Bits{"all"} & WARN_MASK;
1392 elsif ($warnings->isa("B::SPECIAL") && $$warnings == 5) {
1393 $warning_bits = $warnings::NONE;
1395 elsif ($warnings->isa("B::SPECIAL")) {
1396 $warning_bits = undef;
1399 $warning_bits = $warnings->PV & WARN_MASK;
1402 if (defined ($warning_bits) and
1403 !defined($self->{warnings}) || $self->{'warnings'} ne $warning_bits) {
1404 push @text, declare_warnings($self->{'warnings'}, $warning_bits);
1405 $self->{'warnings'} = $warning_bits;
1408 if ($self->{'hints'} != $op->hints) {
1409 push @text, declare_hints($self->{'hints'}, $op->hints);
1410 $self->{'hints'} = $op->hints;
1413 # This should go after of any branches that add statements, to
1414 # increase the chances that it refers to the same line it did in
1415 # the original program.
1416 if ($self->{'linenums'}) {
1417 push @text, "\f#line " . $op->line .
1418 ' "' . $op->file, qq'"\n';
1421 return join("", @text);
1424 sub declare_warnings {
1425 my ($from, $to) = @_;
1426 if (($to & WARN_MASK) eq (warnings::bits("all") & WARN_MASK)) {
1427 return "use warnings;\n";
1429 elsif (($to & WARN_MASK) eq ("\0"x length($to) & WARN_MASK)) {
1430 return "no warnings;\n";
1432 return "BEGIN {\${^WARNING_BITS} = ".perlstring($to)."}\n";
1436 my ($from, $to) = @_;
1437 my $use = $to & ~$from;
1438 my $no = $from & ~$to;
1440 for my $pragma (hint_pragmas($use)) {
1441 $decls .= "use $pragma;\n";
1443 for my $pragma (hint_pragmas($no)) {
1444 $decls .= "no $pragma;\n";
1452 push @pragmas, "integer" if $bits & 0x1;
1453 push @pragmas, "strict 'refs'" if $bits & 0x2;
1454 push @pragmas, "bytes" if $bits & 0x8;
1458 sub pp_dbstate { pp_nextstate(@_) }
1459 sub pp_setstate { pp_nextstate(@_) }
1461 sub pp_unstack { return "" } # see also leaveloop
1465 my($op, $cx, $name) = @_;
1471 my($op, $cx, $name) = @_;
1479 sub pp_wantarray { baseop(@_, "wantarray") }
1480 sub pp_fork { baseop(@_, "fork") }
1481 sub pp_wait { maybe_targmy(@_, \&baseop, "wait") }
1482 sub pp_getppid { maybe_targmy(@_, \&baseop, "getppid") }
1483 sub pp_time { maybe_targmy(@_, \&baseop, "time") }
1484 sub pp_tms { baseop(@_, "times") }
1485 sub pp_ghostent { baseop(@_, "gethostent") }
1486 sub pp_gnetent { baseop(@_, "getnetent") }
1487 sub pp_gprotoent { baseop(@_, "getprotoent") }
1488 sub pp_gservent { baseop(@_, "getservent") }
1489 sub pp_ehostent { baseop(@_, "endhostent") }
1490 sub pp_enetent { baseop(@_, "endnetent") }
1491 sub pp_eprotoent { baseop(@_, "endprotoent") }
1492 sub pp_eservent { baseop(@_, "endservent") }
1493 sub pp_gpwent { baseop(@_, "getpwent") }
1494 sub pp_spwent { baseop(@_, "setpwent") }
1495 sub pp_epwent { baseop(@_, "endpwent") }
1496 sub pp_ggrent { baseop(@_, "getgrent") }
1497 sub pp_sgrent { baseop(@_, "setgrent") }
1498 sub pp_egrent { baseop(@_, "endgrent") }
1499 sub pp_getlogin { baseop(@_, "getlogin") }
1501 sub POSTFIX () { 1 }
1503 # I couldn't think of a good short name, but this is the category of
1504 # symbolic unary operators with interesting precedence
1508 my($op, $cx, $name, $prec, $flags) = (@_, 0);
1509 my $kid = $op->first;
1510 $kid = $self->deparse($kid, $prec);
1511 return $self->maybe_parens(($flags & POSTFIX) ? "$kid$name" : "$name$kid",
1515 sub pp_preinc { pfixop(@_, "++", 23) }
1516 sub pp_predec { pfixop(@_, "--", 23) }
1517 sub pp_postinc { maybe_targmy(@_, \&pfixop, "++", 23, POSTFIX) }
1518 sub pp_postdec { maybe_targmy(@_, \&pfixop, "--", 23, POSTFIX) }
1519 sub pp_i_preinc { pfixop(@_, "++", 23) }
1520 sub pp_i_predec { pfixop(@_, "--", 23) }
1521 sub pp_i_postinc { maybe_targmy(@_, \&pfixop, "++", 23, POSTFIX) }
1522 sub pp_i_postdec { maybe_targmy(@_, \&pfixop, "--", 23, POSTFIX) }
1523 sub pp_complement { maybe_targmy(@_, \&pfixop, "~", 21) }
1525 sub pp_negate { maybe_targmy(@_, \&real_negate) }
1529 if ($op->first->name =~ /^(i_)?negate$/) {
1531 $self->pfixop($op, $cx, "-", 21.5);
1533 $self->pfixop($op, $cx, "-", 21);
1536 sub pp_i_negate { pp_negate(@_) }
1542 $self->pfixop($op, $cx, "not ", 4);
1544 $self->pfixop($op, $cx, "!", 21);
1550 my($op, $cx, $name) = @_;
1552 if ($op->flags & OPf_KIDS) {
1554 if (defined prototype("CORE::$name")
1555 && prototype("CORE::$name") =~ /^;?\*/
1556 && $kid->name eq "rv2gv") {
1560 return $self->maybe_parens_unop($name, $kid, $cx);
1562 return $name . ($op->flags & OPf_SPECIAL ? "()" : "");
1566 sub pp_chop { maybe_targmy(@_, \&unop, "chop") }
1567 sub pp_chomp { maybe_targmy(@_, \&unop, "chomp") }
1568 sub pp_schop { maybe_targmy(@_, \&unop, "chop") }
1569 sub pp_schomp { maybe_targmy(@_, \&unop, "chomp") }
1570 sub pp_defined { unop(@_, "defined") }
1571 sub pp_undef { unop(@_, "undef") }
1572 sub pp_study { unop(@_, "study") }
1573 sub pp_ref { unop(@_, "ref") }
1574 sub pp_pos { maybe_local(@_, unop(@_, "pos")) }
1576 sub pp_sin { maybe_targmy(@_, \&unop, "sin") }
1577 sub pp_cos { maybe_targmy(@_, \&unop, "cos") }
1578 sub pp_rand { maybe_targmy(@_, \&unop, "rand") }
1579 sub pp_srand { unop(@_, "srand") }
1580 sub pp_exp { maybe_targmy(@_, \&unop, "exp") }
1581 sub pp_log { maybe_targmy(@_, \&unop, "log") }
1582 sub pp_sqrt { maybe_targmy(@_, \&unop, "sqrt") }
1583 sub pp_int { maybe_targmy(@_, \&unop, "int") }
1584 sub pp_hex { maybe_targmy(@_, \&unop, "hex") }
1585 sub pp_oct { maybe_targmy(@_, \&unop, "oct") }
1586 sub pp_abs { maybe_targmy(@_, \&unop, "abs") }
1588 sub pp_length { maybe_targmy(@_, \&unop, "length") }
1589 sub pp_ord { maybe_targmy(@_, \&unop, "ord") }
1590 sub pp_chr { maybe_targmy(@_, \&unop, "chr") }
1592 sub pp_each { unop(@_, "each") }
1593 sub pp_values { unop(@_, "values") }
1594 sub pp_keys { unop(@_, "keys") }
1595 sub pp_pop { unop(@_, "pop") }
1596 sub pp_shift { unop(@_, "shift") }
1598 sub pp_caller { unop(@_, "caller") }
1599 sub pp_reset { unop(@_, "reset") }
1600 sub pp_exit { unop(@_, "exit") }
1601 sub pp_prototype { unop(@_, "prototype") }
1603 sub pp_close { unop(@_, "close") }
1604 sub pp_fileno { unop(@_, "fileno") }
1605 sub pp_umask { unop(@_, "umask") }
1606 sub pp_untie { unop(@_, "untie") }
1607 sub pp_tied { unop(@_, "tied") }
1608 sub pp_dbmclose { unop(@_, "dbmclose") }
1609 sub pp_getc { unop(@_, "getc") }
1610 sub pp_eof { unop(@_, "eof") }
1611 sub pp_tell { unop(@_, "tell") }
1612 sub pp_getsockname { unop(@_, "getsockname") }
1613 sub pp_getpeername { unop(@_, "getpeername") }
1615 sub pp_chdir { maybe_targmy(@_, \&unop, "chdir") }
1616 sub pp_chroot { maybe_targmy(@_, \&unop, "chroot") }
1617 sub pp_readlink { unop(@_, "readlink") }
1618 sub pp_rmdir { maybe_targmy(@_, \&unop, "rmdir") }
1619 sub pp_readdir { unop(@_, "readdir") }
1620 sub pp_telldir { unop(@_, "telldir") }
1621 sub pp_rewinddir { unop(@_, "rewinddir") }
1622 sub pp_closedir { unop(@_, "closedir") }
1623 sub pp_getpgrp { maybe_targmy(@_, \&unop, "getpgrp") }
1624 sub pp_localtime { unop(@_, "localtime") }
1625 sub pp_gmtime { unop(@_, "gmtime") }
1626 sub pp_alarm { unop(@_, "alarm") }
1627 sub pp_sleep { maybe_targmy(@_, \&unop, "sleep") }
1629 sub pp_dofile { unop(@_, "do") }
1630 sub pp_entereval { unop(@_, "eval") }
1632 sub pp_ghbyname { unop(@_, "gethostbyname") }
1633 sub pp_gnbyname { unop(@_, "getnetbyname") }
1634 sub pp_gpbyname { unop(@_, "getprotobyname") }
1635 sub pp_shostent { unop(@_, "sethostent") }
1636 sub pp_snetent { unop(@_, "setnetent") }
1637 sub pp_sprotoent { unop(@_, "setprotoent") }
1638 sub pp_sservent { unop(@_, "setservent") }
1639 sub pp_gpwnam { unop(@_, "getpwnam") }
1640 sub pp_gpwuid { unop(@_, "getpwuid") }
1641 sub pp_ggrnam { unop(@_, "getgrnam") }
1642 sub pp_ggrgid { unop(@_, "getgrgid") }
1644 sub pp_lock { unop(@_, "lock") }
1646 sub pp_continue { unop(@_, "continue"); }
1648 my ($self, $op) = @_;
1649 return "" if $op->flags & OPf_SPECIAL;
1655 my($op, $cx, $givwhen) = @_;
1657 my $enterop = $op->first;
1659 if ($enterop->flags & OPf_SPECIAL) {
1661 $block = $self->deparse($enterop->first, 0);
1664 my $cond = $enterop->first;
1665 my $cond_str = $self->deparse($cond, 1);
1666 $head = "$givwhen ($cond_str)";
1667 $block = $self->deparse($cond->sibling, 0);
1675 sub pp_leavegiven { givwhen(@_, "given"); }
1676 sub pp_leavewhen { givwhen(@_, "when"); }
1682 if ($op->private & OPpEXISTS_SUB) {
1683 # Checking for the existence of a subroutine
1684 return $self->maybe_parens_func("exists",
1685 $self->pp_rv2cv($op->first, 16), $cx, 16);
1687 if ($op->flags & OPf_SPECIAL) {
1688 # Array element, not hash element
1689 return $self->maybe_parens_func("exists",
1690 $self->pp_aelem($op->first, 16), $cx, 16);
1692 return $self->maybe_parens_func("exists", $self->pp_helem($op->first, 16),
1700 if ($op->private & OPpSLICE) {
1701 if ($op->flags & OPf_SPECIAL) {
1702 # Deleting from an array, not a hash
1703 return $self->maybe_parens_func("delete",
1704 $self->pp_aslice($op->first, 16),
1707 return $self->maybe_parens_func("delete",
1708 $self->pp_hslice($op->first, 16),
1711 if ($op->flags & OPf_SPECIAL) {
1712 # Deleting from an array, not a hash
1713 return $self->maybe_parens_func("delete",
1714 $self->pp_aelem($op->first, 16),
1717 return $self->maybe_parens_func("delete",
1718 $self->pp_helem($op->first, 16),
1726 my $opname = $op->flags & OPf_SPECIAL ? 'CORE::require' : 'require';
1727 if (class($op) eq "UNOP" and $op->first->name eq "const"
1728 and $op->first->private & OPpCONST_BARE)
1730 my $name = $self->const_sv($op->first)->PV;
1733 return "$opname $name";
1735 $self->unop($op, $cx, $opname);
1742 my $kid = $op->first;
1743 if (not null $kid->sibling) {
1744 # XXX Was a here-doc
1745 return $self->dquote($op);
1747 $self->unop(@_, "scalar");
1754 return $self->{'curcv'}->PADLIST->ARRAYelt(1)->ARRAYelt($targ);
1757 sub anon_hash_or_list {
1761 my($pre, $post) = @{{"anonlist" => ["[","]"],
1762 "anonhash" => ["{","}"]}->{$op->name}};
1764 $op = $op->first->sibling; # skip pushmark
1765 for (; !null($op); $op = $op->sibling) {
1766 $expr = $self->deparse($op, 6);
1769 return $pre . join(", ", @exprs) . $post;
1773 my ($self, $op) = @_;
1774 if ($op->flags & OPf_SPECIAL) {
1775 return $self->anon_hash_or_list($op);
1777 warn "Unexpected op pp_" . $op->name() . " without OPf_SPECIAL";
1781 *pp_anonhash = \&pp_anonlist;
1786 my $kid = $op->first;
1787 if ($kid->name eq "null") {
1789 if ($kid->name eq "anonlist" || $kid->name eq "anonhash") {
1790 return $self->anon_hash_or_list($op);
1791 } elsif (!null($kid->sibling) and
1792 $kid->sibling->name eq "anoncode") {
1794 $self->deparse_sub($self->padval($kid->sibling->targ));
1795 } elsif ($kid->name eq "pushmark") {
1796 my $sib_name = $kid->sibling->name;
1797 if ($sib_name =~ /^(pad|rv2)[ah]v$/
1798 and not $kid->sibling->flags & OPf_REF)
1800 # The @a in \(@a) isn't in ref context, but only when the
1802 return "\\(" . $self->pp_list($op->first) . ")";
1803 } elsif ($sib_name eq 'entersub') {
1804 my $text = $self->deparse($kid->sibling, 1);
1805 # Always show parens for \(&func()), but only with -p otherwise
1806 $text = "($text)" if $self->{'parens'}
1807 or $kid->sibling->private & OPpENTERSUB_AMPER;
1812 $self->pfixop($op, $cx, "\\", 20);
1815 sub pp_srefgen { pp_refgen(@_) }
1820 my $kid = $op->first;
1821 $kid = $kid->first if $kid->name eq "rv2gv"; # <$fh>
1822 return "<" . $self->deparse($kid, 1) . ">" if is_scalar($kid);
1823 return $self->unop($op, $cx, "readline");
1829 return "<" . $self->gv_name($self->gv_or_padgv($op)) . ">";
1832 # Unary operators that can occur as pseudo-listops inside double quotes
1835 my($op, $cx, $name, $prec, $flags) = (@_, 0, 0);
1837 if ($op->flags & OPf_KIDS) {
1839 # If there's more than one kid, the first is an ex-pushmark.
1840 $kid = $kid->sibling if not null $kid->sibling;
1841 return $self->maybe_parens_unop($name, $kid, $cx);
1843 return $name . ($op->flags & OPf_SPECIAL ? "()" : "");
1847 sub pp_ucfirst { dq_unop(@_, "ucfirst") }
1848 sub pp_lcfirst { dq_unop(@_, "lcfirst") }
1849 sub pp_uc { dq_unop(@_, "uc") }
1850 sub pp_lc { dq_unop(@_, "lc") }
1851 sub pp_quotemeta { maybe_targmy(@_, \&dq_unop, "quotemeta") }
1855 my ($op, $cx, $name) = @_;
1856 if (class($op) eq "PVOP") {
1857 return "$name " . $op->pv;
1858 } elsif (class($op) eq "OP") {
1860 } elsif (class($op) eq "UNOP") {
1861 # Note -- loop exits are actually exempt from the
1862 # looks-like-a-func rule, but a few extra parens won't hurt
1863 return $self->maybe_parens_unop($name, $op->first, $cx);
1867 sub pp_last { loopex(@_, "last") }
1868 sub pp_next { loopex(@_, "next") }
1869 sub pp_redo { loopex(@_, "redo") }
1870 sub pp_goto { loopex(@_, "goto") }
1871 sub pp_dump { loopex(@_, "dump") }
1875 my($op, $cx, $name) = @_;
1876 if (class($op) eq "UNOP") {
1877 # Genuine `-X' filetests are exempt from the LLAFR, but not
1878 # l?stat(); for the sake of clarity, give'em all parens
1879 return $self->maybe_parens_unop($name, $op->first, $cx);
1880 } elsif (class($op) =~ /^(SV|PAD)OP$/) {
1881 return $self->maybe_parens_func($name, $self->pp_gv($op, 1), $cx, 16);
1882 } else { # I don't think baseop filetests ever survive ck_ftst, but...
1887 sub pp_lstat { ftst(@_, "lstat") }
1888 sub pp_stat { ftst(@_, "stat") }
1889 sub pp_ftrread { ftst(@_, "-R") }
1890 sub pp_ftrwrite { ftst(@_, "-W") }
1891 sub pp_ftrexec { ftst(@_, "-X") }
1892 sub pp_fteread { ftst(@_, "-r") }
1893 sub pp_ftewrite { ftst(@_, "-w") }
1894 sub pp_fteexec { ftst(@_, "-x") }
1895 sub pp_ftis { ftst(@_, "-e") }
1896 sub pp_fteowned { ftst(@_, "-O") }
1897 sub pp_ftrowned { ftst(@_, "-o") }
1898 sub pp_ftzero { ftst(@_, "-z") }
1899 sub pp_ftsize { ftst(@_, "-s") }
1900 sub pp_ftmtime { ftst(@_, "-M") }
1901 sub pp_ftatime { ftst(@_, "-A") }
1902 sub pp_ftctime { ftst(@_, "-C") }
1903 sub pp_ftsock { ftst(@_, "-S") }
1904 sub pp_ftchr { ftst(@_, "-c") }
1905 sub pp_ftblk { ftst(@_, "-b") }
1906 sub pp_ftfile { ftst(@_, "-f") }
1907 sub pp_ftdir { ftst(@_, "-d") }
1908 sub pp_ftpipe { ftst(@_, "-p") }
1909 sub pp_ftlink { ftst(@_, "-l") }
1910 sub pp_ftsuid { ftst(@_, "-u") }
1911 sub pp_ftsgid { ftst(@_, "-g") }
1912 sub pp_ftsvtx { ftst(@_, "-k") }
1913 sub pp_fttty { ftst(@_, "-t") }
1914 sub pp_fttext { ftst(@_, "-T") }
1915 sub pp_ftbinary { ftst(@_, "-B") }
1917 sub SWAP_CHILDREN () { 1 }
1918 sub ASSIGN () { 2 } # has OP= variant
1919 sub LIST_CONTEXT () { 4 } # Assignment is in list context
1925 my $name = $op->name;
1926 if ($name eq "concat" and $op->first->name eq "concat") {
1927 # avoid spurious `=' -- see comment in pp_concat
1930 if ($name eq "null" and class($op) eq "UNOP"
1931 and $op->first->name =~ /^(and|x?or)$/
1932 and null $op->first->sibling)
1934 # Like all conditional constructs, OP_ANDs and OP_ORs are topped
1935 # with a null that's used as the common end point of the two
1936 # flows of control. For precedence purposes, ignore it.
1937 # (COND_EXPRs have these too, but we don't bother with
1938 # their associativity).
1939 return assoc_class($op->first);
1941 return $name . ($op->flags & OPf_STACKED ? "=" : "");
1944 # Left associative operators, like `+', for which
1945 # $a + $b + $c is equivalent to ($a + $b) + $c
1948 %left = ('multiply' => 19, 'i_multiply' => 19,
1949 'divide' => 19, 'i_divide' => 19,
1950 'modulo' => 19, 'i_modulo' => 19,
1952 'add' => 18, 'i_add' => 18,
1953 'subtract' => 18, 'i_subtract' => 18,
1955 'left_shift' => 17, 'right_shift' => 17,
1957 'bit_or' => 12, 'bit_xor' => 12,
1959 'or' => 2, 'xor' => 2,
1963 sub deparse_binop_left {
1965 my($op, $left, $prec) = @_;
1966 if ($left{assoc_class($op)} && $left{assoc_class($left)}
1967 and $left{assoc_class($op)} == $left{assoc_class($left)})
1969 return $self->deparse($left, $prec - .00001);
1971 return $self->deparse($left, $prec);
1975 # Right associative operators, like `=', for which
1976 # $a = $b = $c is equivalent to $a = ($b = $c)
1979 %right = ('pow' => 22,
1980 'sassign=' => 7, 'aassign=' => 7,
1981 'multiply=' => 7, 'i_multiply=' => 7,
1982 'divide=' => 7, 'i_divide=' => 7,
1983 'modulo=' => 7, 'i_modulo=' => 7,
1985 'add=' => 7, 'i_add=' => 7,
1986 'subtract=' => 7, 'i_subtract=' => 7,
1988 'left_shift=' => 7, 'right_shift=' => 7,
1990 'bit_or=' => 7, 'bit_xor=' => 7,
1996 sub deparse_binop_right {
1998 my($op, $right, $prec) = @_;
1999 if ($right{assoc_class($op)} && $right{assoc_class($right)}
2000 and $right{assoc_class($op)} == $right{assoc_class($right)})
2002 return $self->deparse($right, $prec - .00001);
2004 return $self->deparse($right, $prec);
2010 my ($op, $cx, $opname, $prec, $flags) = (@_, 0);
2011 my $left = $op->first;
2012 my $right = $op->last;
2014 if ($op->flags & OPf_STACKED && $flags & ASSIGN) {
2018 if ($flags & SWAP_CHILDREN) {
2019 ($left, $right) = ($right, $left);
2021 $left = $self->deparse_binop_left($op, $left, $prec);
2022 $left = "($left)" if $flags & LIST_CONTEXT
2023 && $left !~ /^(my|our|local|)[\@\(]/;
2024 $right = $self->deparse_binop_right($op, $right, $prec);
2025 return $self->maybe_parens("$left $opname$eq $right", $cx, $prec);
2028 sub pp_add { maybe_targmy(@_, \&binop, "+", 18, ASSIGN) }
2029 sub pp_multiply { maybe_targmy(@_, \&binop, "*", 19, ASSIGN) }
2030 sub pp_subtract { maybe_targmy(@_, \&binop, "-",18, ASSIGN) }
2031 sub pp_divide { maybe_targmy(@_, \&binop, "/", 19, ASSIGN) }
2032 sub pp_modulo { maybe_targmy(@_, \&binop, "%", 19, ASSIGN) }
2033 sub pp_i_add { maybe_targmy(@_, \&binop, "+", 18, ASSIGN) }
2034 sub pp_i_multiply { maybe_targmy(@_, \&binop, "*", 19, ASSIGN) }
2035 sub pp_i_subtract { maybe_targmy(@_, \&binop, "-", 18, ASSIGN) }
2036 sub pp_i_divide { maybe_targmy(@_, \&binop, "/", 19, ASSIGN) }
2037 sub pp_i_modulo { maybe_targmy(@_, \&binop, "%", 19, ASSIGN) }
2038 sub pp_pow { maybe_targmy(@_, \&binop, "**", 22, ASSIGN) }
2040 sub pp_left_shift { maybe_targmy(@_, \&binop, "<<", 17, ASSIGN) }
2041 sub pp_right_shift { maybe_targmy(@_, \&binop, ">>", 17, ASSIGN) }
2042 sub pp_bit_and { maybe_targmy(@_, \&binop, "&", 13, ASSIGN) }
2043 sub pp_bit_or { maybe_targmy(@_, \&binop, "|", 12, ASSIGN) }
2044 sub pp_bit_xor { maybe_targmy(@_, \&binop, "^", 12, ASSIGN) }
2046 sub pp_eq { binop(@_, "==", 14) }
2047 sub pp_ne { binop(@_, "!=", 14) }
2048 sub pp_lt { binop(@_, "<", 15) }
2049 sub pp_gt { binop(@_, ">", 15) }
2050 sub pp_ge { binop(@_, ">=", 15) }
2051 sub pp_le { binop(@_, "<=", 15) }
2052 sub pp_ncmp { binop(@_, "<=>", 14) }
2053 sub pp_i_eq { binop(@_, "==", 14) }
2054 sub pp_i_ne { binop(@_, "!=", 14) }
2055 sub pp_i_lt { binop(@_, "<", 15) }
2056 sub pp_i_gt { binop(@_, ">", 15) }
2057 sub pp_i_ge { binop(@_, ">=", 15) }
2058 sub pp_i_le { binop(@_, "<=", 15) }
2059 sub pp_i_ncmp { binop(@_, "<=>", 14) }
2061 sub pp_seq { binop(@_, "eq", 14) }
2062 sub pp_sne { binop(@_, "ne", 14) }
2063 sub pp_slt { binop(@_, "lt", 15) }
2064 sub pp_sgt { binop(@_, "gt", 15) }
2065 sub pp_sge { binop(@_, "ge", 15) }
2066 sub pp_sle { binop(@_, "le", 15) }
2067 sub pp_scmp { binop(@_, "cmp", 14) }
2069 sub pp_sassign { binop(@_, "=", 7, SWAP_CHILDREN) }
2070 sub pp_aassign { binop(@_, "=", 7, SWAP_CHILDREN | LIST_CONTEXT) }
2073 my ($self, $op, $cx) = @_;
2074 if ($op->flags & OPf_SPECIAL) {
2075 return $self->deparse($op->first, $cx);
2078 binop(@_, "~~", 14);
2082 # `.' is special because concats-of-concats are optimized to save copying
2083 # by making all but the first concat stacked. The effect is as if the
2084 # programmer had written `($a . $b) .= $c', except legal.
2085 sub pp_concat { maybe_targmy(@_, \&real_concat) }
2089 my $left = $op->first;
2090 my $right = $op->last;
2093 if ($op->flags & OPf_STACKED and $op->first->name ne "concat") {
2097 $left = $self->deparse_binop_left($op, $left, $prec);
2098 $right = $self->deparse_binop_right($op, $right, $prec);
2099 return $self->maybe_parens("$left .$eq $right", $cx, $prec);
2102 # `x' is weird when the left arg is a list
2106 my $left = $op->first;
2107 my $right = $op->last;
2110 if ($op->flags & OPf_STACKED) {
2114 if (null($right)) { # list repeat; count is inside left-side ex-list
2115 my $kid = $left->first->sibling; # skip pushmark
2117 for (; !null($kid->sibling); $kid = $kid->sibling) {
2118 push @exprs, $self->deparse($kid, 6);
2121 $left = "(" . join(", ", @exprs). ")";
2123 $left = $self->deparse_binop_left($op, $left, $prec);
2125 $right = $self->deparse_binop_right($op, $right, $prec);
2126 return $self->maybe_parens("$left x$eq $right", $cx, $prec);
2131 my ($op, $cx, $type) = @_;
2132 my $left = $op->first;
2133 my $right = $left->sibling;
2134 $left = $self->deparse($left, 9);
2135 $right = $self->deparse($right, 9);
2136 return $self->maybe_parens("$left $type $right", $cx, 9);
2142 my $flip = $op->first;
2143 my $type = ($flip->flags & OPf_SPECIAL) ? "..." : "..";
2144 return $self->range($flip->first, $cx, $type);
2147 # one-line while/until is handled in pp_leave
2151 my ($op, $cx, $lowop, $lowprec, $highop, $highprec, $blockname) = @_;
2152 my $left = $op->first;
2153 my $right = $op->first->sibling;
2154 if ($cx < 1 and is_scope($right) and $blockname
2155 and $self->{'expand'} < 7)
2157 $left = $self->deparse($left, 1);
2158 $right = $self->deparse($right, 0);
2159 return "$blockname ($left) {\n\t$right\n\b}\cK";
2160 } elsif ($cx < 1 and $blockname and not $self->{'parens'}
2161 and $self->{'expand'} < 7) { # $b if $a
2162 $right = $self->deparse($right, 1);
2163 $left = $self->deparse($left, 1);
2164 return "$right $blockname $left";
2165 } elsif ($cx > $lowprec and $highop) { # $a && $b
2166 $left = $self->deparse_binop_left($op, $left, $highprec);
2167 $right = $self->deparse_binop_right($op, $right, $highprec);
2168 return $self->maybe_parens("$left $highop $right", $cx, $highprec);
2169 } else { # $a and $b
2170 $left = $self->deparse_binop_left($op, $left, $lowprec);
2171 $right = $self->deparse_binop_right($op, $right, $lowprec);
2172 return $self->maybe_parens("$left $lowop $right", $cx, $lowprec);
2176 sub pp_and { logop(@_, "and", 3, "&&", 11, "if") }
2177 sub pp_or { logop(@_, "or", 2, "||", 10, "unless") }
2178 sub pp_dor { logop(@_, "err", 2, "//", 10, "") }
2180 # xor is syntactically a logop, but it's really a binop (contrary to
2181 # old versions of opcode.pl). Syntax is what matters here.
2182 sub pp_xor { logop(@_, "xor", 2, "", 0, "") }
2186 my ($op, $cx, $opname) = @_;
2187 my $left = $op->first;
2188 my $right = $op->first->sibling->first; # skip sassign
2189 $left = $self->deparse($left, 7);
2190 $right = $self->deparse($right, 7);
2191 return $self->maybe_parens("$left $opname $right", $cx, 7);
2194 sub pp_andassign { logassignop(@_, "&&=") }
2195 sub pp_orassign { logassignop(@_, "||=") }
2196 sub pp_dorassign { logassignop(@_, "//=") }
2200 my($op, $cx, $name) = @_;
2202 my $parens = ($cx >= 5) || $self->{'parens'};
2203 my $kid = $op->first->sibling;
2204 return $name if null $kid;
2206 $name = "socketpair" if $name eq "sockpair";
2207 my $proto = prototype("CORE::$name");
2209 && $proto =~ /^;?\*/
2210 && $kid->name eq "rv2gv") {
2211 $first = $self->deparse($kid->first, 6);
2214 $first = $self->deparse($kid, 6);
2216 if ($name eq "chmod" && $first =~ /^\d+$/) {
2217 $first = sprintf("%#o", $first);
2219 $first = "+$first" if not $parens and substr($first, 0, 1) eq "(";
2220 push @exprs, $first;
2221 $kid = $kid->sibling;
2222 if (defined $proto && $proto =~ /^\*\*/ && $kid->name eq "rv2gv") {
2223 push @exprs, $self->deparse($kid->first, 6);
2224 $kid = $kid->sibling;
2226 for (; !null($kid); $kid = $kid->sibling) {
2227 push @exprs, $self->deparse($kid, 6);
2230 return "$name(" . join(", ", @exprs) . ")";
2232 return "$name " . join(", ", @exprs);
2236 sub pp_bless { listop(@_, "bless") }
2237 sub pp_atan2 { maybe_targmy(@_, \&listop, "atan2") }
2238 sub pp_substr { maybe_local(@_, listop(@_, "substr")) }
2239 sub pp_vec { maybe_local(@_, listop(@_, "vec")) }
2240 sub pp_index { maybe_targmy(@_, \&listop, "index") }
2241 sub pp_rindex { maybe_targmy(@_, \&listop, "rindex") }
2242 sub pp_sprintf { maybe_targmy(@_, \&listop, "sprintf") }
2243 sub pp_formline { listop(@_, "formline") } # see also deparse_format
2244 sub pp_crypt { maybe_targmy(@_, \&listop, "crypt") }
2245 sub pp_unpack { listop(@_, "unpack") }
2246 sub pp_pack { listop(@_, "pack") }
2247 sub pp_join { maybe_targmy(@_, \&listop, "join") }
2248 sub pp_splice { listop(@_, "splice") }
2249 sub pp_push { maybe_targmy(@_, \&listop, "push") }
2250 sub pp_unshift { maybe_targmy(@_, \&listop, "unshift") }
2251 sub pp_reverse { listop(@_, "reverse") }
2252 sub pp_warn { listop(@_, "warn") }
2253 sub pp_die { listop(@_, "die") }
2254 # Actually, return is exempt from the LLAFR (see examples in this very
2255 # module!), but for consistency's sake, ignore that fact
2256 sub pp_return { listop(@_, "return") }
2257 sub pp_open { listop(@_, "open") }
2258 sub pp_pipe_op { listop(@_, "pipe") }
2259 sub pp_tie { listop(@_, "tie") }
2260 sub pp_binmode { listop(@_, "binmode") }
2261 sub pp_dbmopen { listop(@_, "dbmopen") }
2262 sub pp_sselect { listop(@_, "select") }
2263 sub pp_select { listop(@_, "select") }
2264 sub pp_read { listop(@_, "read") }
2265 sub pp_sysopen { listop(@_, "sysopen") }
2266 sub pp_sysseek { listop(@_, "sysseek") }
2267 sub pp_sysread { listop(@_, "sysread") }
2268 sub pp_syswrite { listop(@_, "syswrite") }
2269 sub pp_send { listop(@_, "send") }
2270 sub pp_recv { listop(@_, "recv") }
2271 sub pp_seek { listop(@_, "seek") }
2272 sub pp_fcntl { listop(@_, "fcntl") }
2273 sub pp_ioctl { listop(@_, "ioctl") }
2274 sub pp_flock { maybe_targmy(@_, \&listop, "flock") }
2275 sub pp_socket { listop(@_, "socket") }
2276 sub pp_sockpair { listop(@_, "sockpair") }
2277 sub pp_bind { listop(@_, "bind") }
2278 sub pp_connect { listop(@_, "connect") }
2279 sub pp_listen { listop(@_, "listen") }
2280 sub pp_accept { listop(@_, "accept") }
2281 sub pp_shutdown { listop(@_, "shutdown") }
2282 sub pp_gsockopt { listop(@_, "getsockopt") }
2283 sub pp_ssockopt { listop(@_, "setsockopt") }
2284 sub pp_chown { maybe_targmy(@_, \&listop, "chown") }
2285 sub pp_unlink { maybe_targmy(@_, \&listop, "unlink") }
2286 sub pp_chmod { maybe_targmy(@_, \&listop, "chmod") }
2287 sub pp_utime { maybe_targmy(@_, \&listop, "utime") }
2288 sub pp_rename { maybe_targmy(@_, \&listop, "rename") }
2289 sub pp_link { maybe_targmy(@_, \&listop, "link") }
2290 sub pp_symlink { maybe_targmy(@_, \&listop, "symlink") }
2291 sub pp_mkdir { maybe_targmy(@_, \&listop, "mkdir") }
2292 sub pp_open_dir { listop(@_, "opendir") }
2293 sub pp_seekdir { listop(@_, "seekdir") }
2294 sub pp_waitpid { maybe_targmy(@_, \&listop, "waitpid") }
2295 sub pp_system { maybe_targmy(@_, \&listop, "system") }
2296 sub pp_exec { maybe_targmy(@_, \&listop, "exec") }
2297 sub pp_kill { maybe_targmy(@_, \&listop, "kill") }
2298 sub pp_setpgrp { maybe_targmy(@_, \&listop, "setpgrp") }
2299 sub pp_getpriority { maybe_targmy(@_, \&listop, "getpriority") }
2300 sub pp_setpriority { maybe_targmy(@_, \&listop, "setpriority") }
2301 sub pp_shmget { listop(@_, "shmget") }
2302 sub pp_shmctl { listop(@_, "shmctl") }
2303 sub pp_shmread { listop(@_, "shmread") }
2304 sub pp_shmwrite { listop(@_, "shmwrite") }
2305 sub pp_msgget { listop(@_, "msgget") }
2306 sub pp_msgctl { listop(@_, "msgctl") }
2307 sub pp_msgsnd { listop(@_, "msgsnd") }
2308 sub pp_msgrcv { listop(@_, "msgrcv") }
2309 sub pp_semget { listop(@_, "semget") }
2310 sub pp_semctl { listop(@_, "semctl") }
2311 sub pp_semop { listop(@_, "semop") }
2312 sub pp_ghbyaddr { listop(@_, "gethostbyaddr") }
2313 sub pp_gnbyaddr { listop(@_, "getnetbyaddr") }
2314 sub pp_gpbynumber { listop(@_, "getprotobynumber") }
2315 sub pp_gsbyname { listop(@_, "getservbyname") }
2316 sub pp_gsbyport { listop(@_, "getservbyport") }
2317 sub pp_syscall { listop(@_, "syscall") }
2322 my $text = $self->dq($op->first->sibling); # skip pushmark
2323 if ($text =~ /^\$?(\w|::|\`)+$/ # could look like a readline
2324 or $text =~ /[<>]/) {
2325 return 'glob(' . single_delim('qq', '"', $text) . ')';
2327 return '<' . $text . '>';
2331 # Truncate is special because OPf_SPECIAL makes a bareword first arg
2332 # be a filehandle. This could probably be better fixed in the core
2333 # by moving the GV lookup into ck_truc.
2339 my $parens = ($cx >= 5) || $self->{'parens'};
2340 my $kid = $op->first->sibling;
2342 if ($op->flags & OPf_SPECIAL) {
2343 # $kid is an OP_CONST
2344 $fh = $self->const_sv($kid)->PV;
2346 $fh = $self->deparse($kid, 6);
2347 $fh = "+$fh" if not $parens and substr($fh, 0, 1) eq "(";
2349 my $len = $self->deparse($kid->sibling, 6);
2351 return "truncate($fh, $len)";
2353 return "truncate $fh, $len";
2359 my($op, $cx, $name) = @_;
2361 my $kid = $op->first->sibling;
2363 if ($op->flags & OPf_STACKED) {
2365 $indir = $indir->first; # skip rv2gv
2366 if (is_scope($indir)) {
2367 $indir = "{" . $self->deparse($indir, 0) . "}";
2368 $indir = "{;}" if $indir eq "{}";
2369 } elsif ($indir->name eq "const" && $indir->private & OPpCONST_BARE) {
2370 $indir = $self->const_sv($indir)->PV;
2372 $indir = $self->deparse($indir, 24);
2374 $indir = $indir . " ";
2375 $kid = $kid->sibling;
2377 if ($name eq "sort" && $op->private & (OPpSORT_NUMERIC | OPpSORT_INTEGER)) {
2378 $indir = ($op->private & OPpSORT_DESCEND) ? '{$b <=> $a} '
2381 elsif ($name eq "sort" && $op->private & OPpSORT_DESCEND) {
2382 $indir = '{$b cmp $a} ';
2384 for (; !null($kid); $kid = $kid->sibling) {
2385 $expr = $self->deparse($kid, 6);
2389 if ($name eq "sort" && $op->private & OPpSORT_REVERSE) {
2390 $name2 = 'reverse sort';
2392 if ($name eq "sort" && ($op->private & OPpSORT_INPLACE)) {
2393 return "$exprs[0] = $name2 $indir $exprs[0]";
2396 my $args = $indir . join(", ", @exprs);
2397 if ($indir ne "" and $name eq "sort") {
2398 # We don't want to say "sort(f 1, 2, 3)", since perl -w will
2399 # give bareword warnings in that case. Therefore if context
2400 # requires, we'll put parens around the outside "(sort f 1, 2,
2401 # 3)". Unfortunately, we'll currently think the parens are
2402 # necessary more often that they really are, because we don't
2403 # distinguish which side of an assignment we're on.
2405 return "($name2 $args)";
2407 return "$name2 $args";
2410 return $self->maybe_parens_func($name2, $args, $cx, 5);
2415 sub pp_prtf { indirop(@_, "printf") }
2416 sub pp_print { indirop(@_, "print") }
2417 sub pp_sort { indirop(@_, "sort") }
2421 my($op, $cx, $name) = @_;
2423 my $kid = $op->first; # this is the (map|grep)start
2424 $kid = $kid->first->sibling; # skip a pushmark
2425 my $code = $kid->first; # skip a null
2426 if (is_scope $code) {
2427 $code = "{" . $self->deparse($code, 0) . "} ";
2429 $code = $self->deparse($code, 24) . ", ";
2431 $kid = $kid->sibling;
2432 for (; !null($kid); $kid = $kid->sibling) {
2433 $expr = $self->deparse($kid, 6);
2434 push @exprs, $expr if defined $expr;
2436 return $self->maybe_parens_func($name, $code . join(", ", @exprs), $cx, 5);
2439 sub pp_mapwhile { mapop(@_, "map") }
2440 sub pp_grepwhile { mapop(@_, "grep") }
2441 sub pp_mapstart { baseop(@_, "map") }
2442 sub pp_grepstart { baseop(@_, "grep") }
2448 my $kid = $op->first->sibling; # skip pushmark
2450 my $local = "either"; # could be local(...), my(...), state(...) or our(...)
2451 for ($lop = $kid; !null($lop); $lop = $lop->sibling) {
2452 # This assumes that no other private flags equal 128, and that
2453 # OPs that store things other than flags in their op_private,
2454 # like OP_AELEMFAST, won't be immediate children of a list.
2456 # OP_ENTERSUB can break this logic, so check for it.
2457 # I suspect that open and exit can too.
2459 if (!($lop->private & (OPpLVAL_INTRO|OPpOUR_INTRO)
2460 or $lop->name eq "undef")
2461 or $lop->name eq "entersub"
2462 or $lop->name eq "exit"
2463 or $lop->name eq "open")
2465 $local = ""; # or not
2468 if ($lop->name =~ /^pad[ash]v$/) {
2469 if ($lop->private & OPpPAD_STATE) { # state()
2470 ($local = "", last) if $local =~ /^(?:local|our|my)$/;
2473 ($local = "", last) if $local =~ /^(?:local|our|state)$/;
2476 } elsif ($lop->name =~ /^(gv|rv2)[ash]v$/
2477 && $lop->private & OPpOUR_INTRO
2478 or $lop->name eq "null" && $lop->first->name eq "gvsv"
2479 && $lop->first->private & OPpOUR_INTRO) { # our()
2480 ($local = "", last) if $local =~ /^(?:my|local|state)$/;
2482 } elsif ($lop->name ne "undef"
2483 # specifically avoid the "reverse sort" optimisation,
2484 # where "reverse" is nullified
2485 && !($lop->name eq 'sort' && ($lop->flags & OPpSORT_REVERSE)))
2488 ($local = "", last) if $local =~ /^(?:my|our|state)$/;
2492 $local = "" if $local eq "either"; # no point if it's all undefs
2493 return $self->deparse($kid, $cx) if null $kid->sibling and not $local;
2494 for (; !null($kid); $kid = $kid->sibling) {
2496 if (class($kid) eq "UNOP" and $kid->first->name eq "gvsv") {
2501 $self->{'avoid_local'}{$$lop}++;
2502 $expr = $self->deparse($kid, 6);
2503 delete $self->{'avoid_local'}{$$lop};
2505 $expr = $self->deparse($kid, 6);
2510 return "$local(" . join(", ", @exprs) . ")";
2512 return $self->maybe_parens( join(", ", @exprs), $cx, 6);
2516 sub is_ifelse_cont {
2518 return ($op->name eq "null" and class($op) eq "UNOP"
2519 and $op->first->name =~ /^(and|cond_expr)$/
2520 and is_scope($op->first->first->sibling));
2526 my $cond = $op->first;
2527 my $true = $cond->sibling;
2528 my $false = $true->sibling;
2529 my $cuddle = $self->{'cuddle'};
2530 unless ($cx < 1 and (is_scope($true) and $true->name ne "null") and
2531 (is_scope($false) || is_ifelse_cont($false))
2532 and $self->{'expand'} < 7) {
2533 $cond = $self->deparse($cond, 8);
2534 $true = $self->deparse($true, 6);
2535 $false = $self->deparse($false, 8);
2536 return $self->maybe_parens("$cond ? $true : $false", $cx, 8);
2539 $cond = $self->deparse($cond, 1);
2540 $true = $self->deparse($true, 0);
2541 my $head = "if ($cond) {\n\t$true\n\b}";
2543 while (!null($false) and is_ifelse_cont($false)) {
2544 my $newop = $false->first;
2545 my $newcond = $newop->first;
2546 my $newtrue = $newcond->sibling;
2547 $false = $newtrue->sibling; # last in chain is OP_AND => no else
2548 $newcond = $self->deparse($newcond, 1);
2549 $newtrue = $self->deparse($newtrue, 0);
2550 push @elsifs, "elsif ($newcond) {\n\t$newtrue\n\b}";
2552 if (!null($false)) {
2553 $false = $cuddle . "else {\n\t" .
2554 $self->deparse($false, 0) . "\n\b}\cK";
2558 return $head . join($cuddle, "", @elsifs) . $false;
2563 my($op, $cx, $init) = @_;
2564 my $enter = $op->first;
2565 my $kid = $enter->sibling;
2566 local(@$self{qw'curstash warnings hints'})
2567 = @$self{qw'curstash warnings hints'};
2572 if ($kid->name eq "lineseq") { # bare or infinite loop
2573 if ($kid->last->name eq "unstack") { # infinite
2574 $head = "while (1) "; # Can't use for(;;) if there's a continue
2580 } elsif ($enter->name eq "enteriter") { # foreach
2581 my $ary = $enter->first->sibling; # first was pushmark
2582 my $var = $ary->sibling;
2583 if ($ary->name eq 'null' and $enter->private & OPpITER_REVERSED) {
2584 # "reverse" was optimised away
2585 $ary = listop($self, $ary->first->sibling, 1, 'reverse');
2586 } elsif ($enter->flags & OPf_STACKED
2587 and not null $ary->first->sibling->sibling)
2589 $ary = $self->deparse($ary->first->sibling, 9) . " .. " .
2590 $self->deparse($ary->first->sibling->sibling, 9);
2592 $ary = $self->deparse($ary, 1);
2595 if ($enter->flags & OPf_SPECIAL) { # thread special var
2596 $var = $self->pp_threadsv($enter, 1);
2597 } else { # regular my() variable
2598 $var = $self->pp_padsv($enter, 1);
2600 } elsif ($var->name eq "rv2gv") {
2601 $var = $self->pp_rv2sv($var, 1);
2602 if ($enter->private & OPpOUR_INTRO) {
2603 # our declarations don't have package names
2604 $var =~ s/^(.).*::/$1/;
2607 } elsif ($var->name eq "gv") {
2608 $var = "\$" . $self->deparse($var, 1);
2610 $body = $kid->first->first->sibling; # skip OP_AND and OP_ITER
2611 if (!is_state $body->first and $body->first->name ne "stub") {
2612 confess unless $var eq '$_';
2613 $body = $body->first;
2614 return $self->deparse($body, 2) . " foreach ($ary)";
2616 $head = "foreach $var ($ary) ";
2617 } elsif ($kid->name eq "null") { # while/until
2619 my $name = {"and" => "while", "or" => "until"}->{$kid->name};
2620 $cond = $self->deparse($kid->first, 1);
2621 $head = "$name ($cond) ";
2622 $body = $kid->first->sibling;
2623 } elsif ($kid->name eq "stub") { # bare and empty
2624 return "{;}"; # {} could be a hashref
2626 # If there isn't a continue block, then the next pointer for the loop
2627 # will point to the unstack, which is kid's last child, except
2628 # in a bare loop, when it will point to the leaveloop. When neither of
2629 # these conditions hold, then the second-to-last child is the continue
2630 # block (or the last in a bare loop).
2631 my $cont_start = $enter->nextop;
2633 if ($$cont_start != $$op && ${$cont_start} != ${$body->last}) {
2635 $cont = $body->last;
2637 $cont = $body->first;
2638 while (!null($cont->sibling->sibling)) {
2639 $cont = $cont->sibling;
2642 my $state = $body->first;
2643 my $cuddle = $self->{'cuddle'};
2645 for (; $$state != $$cont; $state = $state->sibling) {
2646 push @states, $state;
2648 $body = $self->lineseq(undef, @states);
2649 if (defined $cond and not is_scope $cont and $self->{'expand'} < 3) {
2650 $head = "for ($init; $cond; " . $self->deparse($cont, 1) .") ";
2653 $cont = $cuddle . "continue {\n\t" .
2654 $self->deparse($cont, 0) . "\n\b}\cK";
2657 return "" if !defined $body;
2659 $head = "for ($init; $cond;) ";
2662 $body = $self->deparse($body, 0);
2664 $body =~ s/;?$/;\n/;
2666 return $head . "{\n\t" . $body . "\b}" . $cont;
2669 sub pp_leaveloop { loop_common(@_, "") }
2674 my $init = $self->deparse($op, 1);
2675 return $self->loop_common($op->sibling->first->sibling, $cx, $init);
2680 return "eval {\n\t" . $self->pp_leave(@_) . "\n\b}";
2683 BEGIN { eval "sub OP_CONST () {" . opnumber("const") . "}" }
2684 BEGIN { eval "sub OP_STRINGIFY () {" . opnumber("stringify") . "}" }
2685 BEGIN { eval "sub OP_RV2SV () {" . opnumber("rv2sv") . "}" }
2686 BEGIN { eval "sub OP_LIST () {" . opnumber("list") . "}" }
2691 if (class($op) eq "OP") {
2693 return $self->{'ex_const'} if $op->targ == OP_CONST;
2694 } elsif ($op->first->name eq "pushmark") {
2695 return $self->pp_list($op, $cx);
2696 } elsif ($op->first->name eq "enter") {
2697 return $self->pp_leave($op, $cx);
2698 } elsif ($op->first->name eq "leave") {
2699 return $self->pp_leave($op->first, $cx);
2700 } elsif ($op->first->name eq "scope") {
2701 return $self->pp_scope($op->first, $cx);
2702 } elsif ($op->targ == OP_STRINGIFY) {
2703 return $self->dquote($op, $cx);
2704 } elsif (!null($op->first->sibling) and
2705 $op->first->sibling->name eq "readline" and
2706 $op->first->sibling->flags & OPf_STACKED) {
2707 return $self->maybe_parens($self->deparse($op->first, 7) . " = "
2708 . $self->deparse($op->first->sibling, 7),
2710 } elsif (!null($op->first->sibling) and
2711 $op->first->sibling->name eq "trans" and
2712 $op->first->sibling->flags & OPf_STACKED) {
2713 return $self->maybe_parens($self->deparse($op->first, 20) . " =~ "
2714 . $self->deparse($op->first->sibling, 20),
2716 } elsif ($op->flags & OPf_SPECIAL && $cx < 1 && !$op->targ) {
2717 return "do {\n\t". $self->deparse($op->first, $cx) ."\n\b};";
2718 } elsif (!null($op->first->sibling) and
2719 $op->first->sibling->name eq "null" and
2720 class($op->first->sibling) eq "UNOP" and
2721 $op->first->sibling->first->flags & OPf_STACKED and
2722 $op->first->sibling->first->name eq "rcatline") {
2723 return $self->maybe_parens($self->deparse($op->first, 18) . " .= "
2724 . $self->deparse($op->first->sibling, 18),
2727 return $self->deparse($op->first, $cx);
2734 return $self->padname_sv($targ)->PVX;
2740 return substr($self->padname($op->targ), 1); # skip $/@/%
2746 return $self->maybe_my($op, $cx, $self->padname($op->targ));
2749 sub pp_padav { pp_padsv(@_) }
2750 sub pp_padhv { pp_padsv(@_) }
2755 @threadsv_names = ("_", "1", "2", "3", "4", "5", "6", "7", "8", "9",
2756 "&", "`", "'", "+", "/", ".", ",", "\\", '"', ";",
2757 "^", "-", "%", "=", "|", "~", ":", "^A", "^E",
2764 return $self->maybe_local($op, $cx, "\$" . $threadsv_names[$op->targ]);
2770 if (class($op) eq "PADOP") {
2771 return $self->padval($op->padix);
2772 } else { # class($op) eq "SVOP"
2780 my $gv = $self->gv_or_padgv($op);
2781 return $self->maybe_local($op, $cx, $self->stash_variable("\$",
2782 $self->gv_name($gv)));
2788 my $gv = $self->gv_or_padgv($op);
2789 return $self->gv_name($gv);
2796 if ($op->flags & OPf_SPECIAL) { # optimised PADAV
2797 $name = $self->padname($op->targ);
2801 my $gv = $self->gv_or_padgv($op);
2802 $name = $self->gv_name($gv);
2803 $name = $self->{'curstash'}."::$name"
2804 if $name !~ /::/ && $self->lex_in_scope('@'.$name);
2805 $name = '$' . $name;
2808 return $name . "[" . ($op->private + $self->{'arybase'}) . "]";
2813 my($op, $cx, $type) = @_;
2815 if (class($op) eq 'NULL' || !$op->can("first")) {
2816 carp("Unexpected op in pp_rv2x");
2819 my $kid = $op->first;
2820 if ($kid->name eq "gv") {
2821 return $self->stash_variable($type, $self->deparse($kid, 0));
2822 } elsif (is_scalar $kid) {
2823 my $str = $self->deparse($kid, 0);
2824 if ($str =~ /^\$([^\w\d])\z/) {
2825 # "$$+" isn't a legal way to write the scalar dereference
2826 # of $+, since the lexer can't tell you aren't trying to
2827 # do something like "$$ + 1" to get one more than your
2828 # PID. Either "${$+}" or "$${+}" are workable
2829 # disambiguations, but if the programmer did the former,
2830 # they'd be in the "else" clause below rather than here.
2831 # It's not clear if this should somehow be unified with
2832 # the code in dq and re_dq that also adds lexer
2833 # disambiguation braces.
2834 $str = '$' . "{$1}"; #'
2836 return $type . $str;
2838 return $type . "{" . $self->deparse($kid, 0) . "}";
2842 sub pp_rv2sv { maybe_local(@_, rv2x(@_, "\$")) }
2843 sub pp_rv2hv { maybe_local(@_, rv2x(@_, "%")) }
2844 sub pp_rv2gv { maybe_local(@_, rv2x(@_, "*")) }
2850 if ($op->first->name eq "padav") {
2851 return $self->maybe_local($op, $cx, '$#' . $self->padany($op->first));
2853 return $self->maybe_local($op, $cx,
2854 $self->rv2x($op->first, $cx, '$#'));
2858 # skip down to the old, ex-rv2cv
2860 my ($self, $op, $cx) = @_;
2861 if (!null($op->first) && $op->first->name eq 'null' &&
2862 $op->first->targ eq OP_LIST)
2864 return $self->rv2x($op->first->first->sibling, $cx, "&")
2867 return $self->rv2x($op, $cx, "")
2873 my($cx, @list) = @_;
2874 my @a = map $self->const($_, 6), @list;
2879 } elsif ( @a > 2 and !grep(!/^-?\d+$/, @a)) {
2880 # collapse (-1,0,1,2) into (-1..2)
2881 my ($s, $e) = @a[0,-1];
2883 return $self->maybe_parens("$s..$e", $cx, 9)
2884 unless grep $i++ != $_, @a;
2886 return $self->maybe_parens(join(", ", @a), $cx, 6);
2892 my $kid = $op->first;
2893 if ($kid->name eq "const") { # constant list
2894 my $av = $self->const_sv($kid);
2895 return $self->list_const($cx, $av->ARRAY);
2897 return $self->maybe_local($op, $cx, $self->rv2x($op, $cx, "\@"));
2901 sub is_subscriptable {
2903 if ($op->name =~ /^[ahg]elem/) {
2905 } elsif ($op->name eq "entersub") {
2906 my $kid = $op->first;
2907 return 0 unless null $kid->sibling;
2909 $kid = $kid->sibling until null $kid->sibling;
2910 return 0 if is_scope($kid);
2912 return 0 if $kid->name eq "gv";
2913 return 0 if is_scalar($kid);
2914 return is_subscriptable($kid);
2922 my ($op, $cx, $left, $right, $padname) = @_;
2923 my($array, $idx) = ($op->first, $op->first->sibling);
2924 unless ($array->name eq $padname) { # Maybe this has been fixed
2925 $array = $array->first; # skip rv2av (or ex-rv2av in _53+)
2927 if ($array->name eq $padname) {
2928 $array = $self->padany($array);
2929 } elsif (is_scope($array)) { # ${expr}[0]
2930 $array = "{" . $self->deparse($array, 0) . "}";
2931 } elsif ($array->name eq "gv") {
2932 $array = $self->gv_name($self->gv_or_padgv($array));
2933 if ($array !~ /::/) {
2934 my $prefix = ($left eq '[' ? '@' : '%');
2935 $array = $self->{curstash}.'::'.$array
2936 if $self->lex_in_scope($prefix . $array);
2938 } elsif (is_scalar $array) { # $x[0], $$x[0], ...
2939 $array = $self->deparse($array, 24);
2941 # $x[20][3]{hi} or expr->[20]
2942 my $arrow = is_subscriptable($array) ? "" : "->";
2943 return $self->deparse($array, 24) . $arrow .
2944 $left . $self->deparse($idx, 1) . $right;
2946 $idx = $self->deparse($idx, 1);
2948 # Outer parens in an array index will confuse perl
2949 # if we're interpolating in a regular expression, i.e.
2950 # /$x$foo[(-1)]/ is *not* the same as /$x$foo[-1]/
2952 # If $self->{parens}, then an initial '(' will
2953 # definitely be paired with a final ')'. If
2954 # !$self->{parens}, the misleading parens won't
2955 # have been added in the first place.
2957 # [You might think that we could get "(...)...(...)"
2958 # where the initial and final parens do not match
2959 # each other. But we can't, because the above would
2960 # only happen if there's an infix binop between the
2961 # two pairs of parens, and *that* means that the whole
2962 # expression would be parenthesized as well.]
2964 $idx =~ s/^\((.*)\)$/$1/ if $self->{'parens'};
2966 # Hash-element braces will autoquote a bareword inside themselves.
2967 # We need to make sure that C<$hash{warn()}> doesn't come out as
2968 # C<$hash{warn}>, which has a quite different meaning. Currently
2969 # B::Deparse will always quote strings, even if the string was a
2970 # bareword in the original (i.e. the OPpCONST_BARE flag is ignored
2971 # for constant strings.) So we can cheat slightly here - if we see
2972 # a bareword, we know that it is supposed to be a function call.
2974 $idx =~ s/^([A-Za-z_]\w*)$/$1()/;
2976 return "\$" . $array . $left . $idx . $right;
2979 sub pp_aelem { maybe_local(@_, elem(@_, "[", "]", "padav")) }
2980 sub pp_helem { maybe_local(@_, elem(@_, "{", "}", "padhv")) }
2985 my($glob, $part) = ($op->first, $op->last);
2986 $glob = $glob->first; # skip rv2gv
2987 $glob = $glob->first if $glob->name eq "rv2gv"; # this one's a bug
2988 my $scope = is_scope($glob);
2989 $glob = $self->deparse($glob, 0);
2990 $part = $self->deparse($part, 1);
2991 return "*" . ($scope ? "{$glob}" : $glob) . "{$part}";
2996 my ($op, $cx, $left, $right, $regname, $padname) = @_;
2998 my(@elems, $kid, $array, $list);
2999 if (class($op) eq "LISTOP") {
3001 } else { # ex-hslice inside delete()
3002 for ($kid = $op->first; !null $kid->sibling; $kid = $kid->sibling) {}
3006 $array = $array->first
3007 if $array->name eq $regname or $array->name eq "null";
3008 if (is_scope($array)) {
3009 $array = "{" . $self->deparse($array, 0) . "}";
3010 } elsif ($array->name eq $padname) {
3011 $array = $self->padany($array);
3013 $array = $self->deparse($array, 24);
3015 $kid = $op->first->sibling; # skip pushmark
3016 if ($kid->name eq "list") {
3017 $kid = $kid->first->sibling; # skip list, pushmark
3018 for (; !null $kid; $kid = $kid->sibling) {
3019 push @elems, $self->deparse($kid, 6);
3021 $list = join(", ", @elems);
3023 $list = $self->deparse($kid, 1);
3025 return "\@" . $array . $left . $list . $right;
3028 sub pp_aslice { maybe_local(@_, slice(@_, "[", "]", "rv2av", "padav")) }
3029 sub pp_hslice { maybe_local(@_, slice(@_, "{", "}", "rv2hv", "padhv")) }
3034 my $idx = $op->first;
3035 my $list = $op->last;
3037 $list = $self->deparse($list, 1);
3038 $idx = $self->deparse($idx, 1);
3039 return "($list)" . "[$idx]";
3044 return ($op->flags & OPf_WANT) == OPf_WANT_SCALAR;
3049 return ($op->flags & OPf_WANT) == OPf_WANT_LIST;
3055 my $kid = $op->first->sibling; # skip pushmark
3056 my($meth, $obj, @exprs);
3057 if ($kid->name eq "list" and want_list $kid) {
3058 # When an indirect object isn't a bareword but the args are in
3059 # parens, the parens aren't part of the method syntax (the LLAFR
3060 # doesn't apply), but they make a list with OPf_PARENS set that
3061 # doesn't get flattened by the append_elem that adds the method,
3062 # making a (object, arg1, arg2, ...) list where the object
3063 # usually is. This can be distinguished from
3064 # `($obj, $arg1, $arg2)->meth()' (which is legal if $arg2 is an
3065 # object) because in the later the list is in scalar context
3066 # as the left side of -> always is, while in the former
3067 # the list is in list context as method arguments always are.
3068 # (Good thing there aren't method prototypes!)
3069 $meth = $kid->sibling;
3070 $kid = $kid->first->sibling; # skip pushmark
3072 $kid = $kid->sibling;
3073 for (; not null $kid; $kid = $kid->sibling) {
3074 push @exprs, $self->deparse($kid, 6);
3078 $kid = $kid->sibling;
3079 for (; !null ($kid->sibling) && $kid->name ne "method_named";
3080 $kid = $kid->sibling) {
3081 push @exprs, $self->deparse($kid, 6);
3085 $obj = $self->deparse($obj, 24);
3086 if ($meth->name eq "method_named") {
3087 $meth = $self->const_sv($meth)->PV;
3089 $meth = $meth->first;
3090 if ($meth->name eq "const") {
3091 # As of 5.005_58, this case is probably obsoleted by the
3092 # method_named case above
3093 $meth = $self->const_sv($meth)->PV; # needs to be bare
3095 $meth = $self->deparse($meth, 1);
3098 my $args = join(", ", @exprs);
3099 $kid = $obj . "->" . $meth;
3101 return $kid . "(" . $args . ")"; # parens mandatory
3107 # returns "&" if the prototype doesn't match the args,
3108 # or ("", $args_after_prototype_demunging) if it does.
3111 return "&" if $self->{'noproto'};
3112 my($proto, @args) = @_;
3116 # An unbackslashed @ or % gobbles up the rest of the args
3117 1 while $proto =~ s/(?<!\\)([@%])[^\]]+$/$1/;
3119 $proto =~ s/^(\\?[\$\@&%*]|\\\[[\$\@&%*]+\]|;)//;
3122 return "&" if @args;
3123 } elsif ($chr eq ";") {
3125 } elsif ($chr eq "@" or $chr eq "%") {
3126 push @reals, map($self->deparse($_, 6), @args);
3132 if (want_scalar $arg) {
3133 push @reals, $self->deparse($arg, 6);
3137 } elsif ($chr eq "&") {
3138 if ($arg->name =~ /^(s?refgen|undef)$/) {
3139 push @reals, $self->deparse($arg, 6);
3143 } elsif ($chr eq "*") {
3144 if ($arg->name =~ /^s?refgen$/
3145 and $arg->first->first->name eq "rv2gv")
3147 $real = $arg->first->first; # skip refgen, null
3148 if ($real->first->name eq "gv") {
3149 push @reals, $self->deparse($real, 6);
3151 push @reals, $self->deparse($real->first, 6);
3156 } elsif (substr($chr, 0, 1) eq "\\") {
3158 if ($arg->name =~ /^s?refgen$/ and
3159 !null($real = $arg->first) and
3160 ($chr =~ /\$/ && is_scalar($real->first)
3162 && class($real->first->sibling) ne 'NULL'
3163 && $real->first->sibling->name
3166 && class($real->first->sibling) ne 'NULL'
3167 && $real->first->sibling->name
3169 #or ($chr =~ /&/ # This doesn't work
3170 # && $real->first->name eq "rv2cv")
3172 && $real->first->name eq "rv2gv")))
3174 push @reals, $self->deparse($real, 6);
3181 return "&" if $proto and !$doneok; # too few args and no `;'
3182 return "&" if @args; # too many args
3183 return ("", join ", ", @reals);
3189 return $self->method($op, $cx) unless null $op->first->sibling;
3193 if ($op->flags & OPf_SPECIAL && !($op->flags & OPf_MOD)) {
3195 } elsif ($op->private & OPpENTERSUB_AMPER) {
3199 $kid = $kid->first->sibling; # skip ex-list, pushmark
3200 for (; not null $kid->sibling; $kid = $kid->sibling) {
3205 if (is_scope($kid)) {
3207 $kid = "{" . $self->deparse($kid, 0) . "}";
3208 } elsif ($kid->first->name eq "gv") {
3209 my $gv = $self->gv_or_padgv($kid->first);
3210 if (class($gv->CV) ne "SPECIAL") {
3211 $proto = $gv->CV->PV if $gv->CV->FLAGS & SVf_POK;
3213 $simple = 1; # only calls of named functions can be prototyped
3214 $kid = $self->deparse($kid, 24);
3215 } elsif (is_scalar ($kid->first) && $kid->first->name ne 'rv2cv') {
3217 $kid = $self->deparse($kid, 24);
3220 my $arrow = is_subscriptable($kid->first) ? "" : "->";
3221 $kid = $self->deparse($kid, 24) . $arrow;
3224 # Doesn't matter how many prototypes there are, if
3225 # they haven't happened yet!
3229 no warnings 'uninitialized';
3230 $declared = exists $self->{'subs_declared'}{$kid}
3232 defined &{ ${$self->{'curstash'}."::"}{$kid} }
3234 $self->{'subs_deparsed'}{$self->{'curstash'}."::".$kid}
3235 && defined prototype $self->{'curstash'}."::".$kid
3237 if (!$declared && defined($proto)) {
3238 # Avoid "too early to check prototype" warning
3239 ($amper, $proto) = ('&');
3244 if ($declared and defined $proto and not $amper) {
3245 ($amper, $args) = $self->check_proto($proto, @exprs);
3246 if ($amper eq "&") {
3247 $args = join(", ", map($self->deparse($_, 6), @exprs));
3250 $args = join(", ", map($self->deparse($_, 6), @exprs));
3252 if ($prefix or $amper) {
3253 if ($op->flags & OPf_STACKED) {
3254 return $prefix . $amper . $kid . "(" . $args . ")";
3256 return $prefix . $amper. $kid;
3259 # glob() invocations can be translated into calls of
3260 # CORE::GLOBAL::glob with a second parameter, a number.
3262 if ($kid eq "CORE::GLOBAL::glob") {
3264 $args =~ s/\s*,[^,]+$//;
3267 # It's a syntax error to call CORE::GLOBAL::foo without a prefix,
3268 # so it must have been translated from a keyword call. Translate
3270 $kid =~ s/^CORE::GLOBAL:://;
3272 my $dproto = defined($proto) ? $proto : "undefined";
3274 return "$kid(" . $args . ")";
3275 } elsif ($dproto eq "") {
3277 } elsif ($dproto eq "\$" and is_scalar($exprs[0])) {
3278 # is_scalar is an excessively conservative test here:
3279 # really, we should be comparing to the precedence of the
3280 # top operator of $exprs[0] (ala unop()), but that would
3281 # take some major code restructuring to do right.
3282 return $self->maybe_parens_func($kid, $args, $cx, 16);
3283 } elsif ($dproto ne '$' and defined($proto) || $simple) { #'
3284 return $self->maybe_parens_func($kid, $args, $cx, 5);
3286 return "$kid(" . $args . ")";
3291 sub pp_enterwrite { unop(@_, "write") }
3293 # escape things that cause interpolation in double quotes,
3294 # but not character escapes
3297 $str =~ s/(^|\G|[^\\])((?:\\\\)*)([\$\@]|\\[uUlLQE])/$1$2\\$3/g;
3305 # Matches any string which is balanced with respect to {braces}
3316 # the same, but treat $|, $), $( and $ at the end of the string differently
3330 (\(\?\??\{$bal\}\)) # $4
3336 /defined($4) && length($4) ? "$1$2$4" : "$1$2\\$3"/xeg;
3341 # This is for regular expressions with the /x modifier
3342 # We have to leave comments unmangled.
3343 sub re_uninterp_extended {
3356 ( \(\?\??\{$bal\}\) # $4 (skip over (?{}) and (??{}) blocks)
3357 | \#[^\n]* # (skip over comments)
3364 /defined($4) && length($4) ? "$1$2$4" : "$1$2\\$3"/xeg;
3370 my %unctrl = # portable to to EBCDIC
3372 "\c@" => '\c@', # unused
3399 "\c[" => '\c[', # unused
3400 "\c\\" => '\c\\', # unused
3401 "\c]" => '\c]', # unused
3402 "\c_" => '\c_', # unused
3405 # character escapes, but not delimiters that might need to be escaped
3406 sub escape_str { # ASCII, UTF8
3408 $str =~ s/(.)/ord($1) > 255 ? sprintf("\\x{%x}", ord($1)) : $1/eg;
3410 # $str =~ s/\cH/\\b/g; # \b means something different in a regex
3416 $str =~ s/([\cA-\cZ])/$unctrl{$1}/ge;
3417 $str =~ s/([[:^print:]])/sprintf("\\%03o", ord($1))/ge;
3421 # For regexes with the /x modifier.
3422 # Leave whitespace unmangled.
3423 sub escape_extended_re {
3425 $str =~ s/(.)/ord($1) > 255 ? sprintf("\\x{%x}", ord($1)) : $1/eg;
3426 $str =~ s/([[:^print:]])/
3427 ($1 =~ y! \t\n!!) ? $1 : sprintf("\\%03o", ord($1))/ge;
3428 $str =~ s/\n/\n\f/g;
3432 # Don't do this for regexen
3435 $str =~ s/\\/\\\\/g;
3439 # Remove backslashes which precede literal control characters,
3440 # to avoid creating ambiguity when we escape the latter.
3444 # the insane complexity here is due to the behaviour of "\c\"
3445 $str =~ s/(^|[^\\]|\\c\\)(?<!\\c)\\(\\\\)*(?=[[:^print:]])/$1$2/g;
3449 sub balanced_delim {
3451 my @str = split //, $str;
3452 my($ar, $open, $close, $fail, $c, $cnt, $last_bs);
3453 for $ar (['[',']'], ['(',')'], ['<','>'], ['{','}']) {
3454 ($open, $close) = @$ar;
3455 $fail = 0; $cnt = 0; $last_bs = 0;
3458 $fail = 1 if $last_bs;
3460 } elsif ($c eq $close) {
3461 $fail = 1 if $last_bs;
3469 $last_bs = $c eq '\\';
3471 $fail = 1 if $cnt != 0;
3472 return ($open, "$open$str$close") if not $fail;
3478 my($q, $default, $str) = @_;
3479 return "$default$str$default" if $default and index($str, $default) == -1;
3481 (my $succeed, $str) = balanced_delim($str);
3482 return "$q$str" if $succeed;
3484 for my $delim ('/', '"', '#') {
3485 return "$q$delim" . $str . $delim if index($str, $delim) == -1;
3488 $str =~ s/$default/\\$default/g;
3489 return "$default$str$default";
3497 BEGIN { $max_prec = int(0.999 + 8*length(pack("F", 42))*log(2)/log(10)); }
3499 # Split a floating point number into an integer mantissa and a binary
3500 # exponent. Assumes you've already made sure the number isn't zero or
3501 # some weird infinity or NaN.
3505 if ($f == int($f)) {
3506 while ($f % 2 == 0) {
3511 while ($f != int($f)) {
3516 my $mantissa = sprintf("%.0f", $f);
3517 return ($mantissa, $exponent);
3523 if ($self->{'use_dumper'}) {
3524 return $self->const_dumper($sv, $cx);
3526 if (class($sv) eq "SPECIAL") {
3527 # sv_undef, sv_yes, sv_no
3528 return ('undef', '1', $self->maybe_parens("!1", $cx, 21))[$$sv-1];
3529 } elsif (class($sv) eq "NULL") {
3532 # convert a version object into the "v1.2.3" string in its V magic
3533 if ($sv->FLAGS & SVs_RMG) {
3534 for (my $mg = $sv->MAGIC; $mg; $mg = $mg->MOREMAGIC) {
3535 return $mg->PTR if $mg->TYPE eq 'V';
3539 if ($sv->FLAGS & SVf_IOK) {
3540 my $str = $sv->int_value;
3541 $str = $self->maybe_parens($str, $cx, 21) if $str < 0;
3543 } elsif ($sv->FLAGS & SVf_NOK) {
3546 if (pack("F", $nv) eq pack("F", 0)) {
3551 return $self->maybe_parens("-.0", $cx, 21);
3553 } elsif (1/$nv == 0) {
3556 return $self->maybe_parens("9**9**9", $cx, 22);
3559 return $self->maybe_parens("-9**9**9", $cx, 21);
3561 } elsif ($nv != $nv) {
3563 if (pack("F", $nv) eq pack("F", sin(9**9**9))) {
3565 return "sin(9**9**9)";
3566 } elsif (pack("F", $nv) eq pack("F", -sin(9**9**9))) {
3568 return $self->maybe_parens("-sin(9**9**9)", $cx, 21);
3571 my $hex = unpack("h*", pack("F", $nv));
3572 return qq'unpack("F", pack("h*", "$hex"))';
3575 # first, try the default stringification
3578 # failing that, try using more precision
3579 $str = sprintf("%.${max_prec}g", $nv);
3580 # if (pack("F", $str) ne pack("F", $nv)) {
3582 # not representable in decimal with whatever sprintf()
3583 # and atof() Perl is using here.
3584 my($mant, $exp) = split_float($nv);
3585 return $self->maybe_parens("$mant * 2**$exp", $cx, 19);
3588 $str = $self->maybe_parens($str, $cx, 21) if $nv < 0;
3590 } elsif ($sv->FLAGS & SVf_ROK && $sv->can("RV")) {
3592 if (class($ref) eq "AV") {
3593 return "[" . $self->list_const(2, $ref->ARRAY) . "]";
3594 } elsif (class($ref) eq "HV") {
3595 my %hash = $ref->ARRAY;
3597 for my $k (sort keys %hash) {
3598 push @elts, "$k => " . $self->const($hash{$k}, 6);
3600 return "{" . join(", ", @elts) . "}";
3601 } elsif (class($ref) eq "CV") {
3602 return "sub " . $self->deparse_sub($ref);
3604 if ($ref->FLAGS & SVs_SMG) {
3605 for (my $mg = $ref->MAGIC; $mg; $mg = $mg->MOREMAGIC) {
3606 if ($mg->TYPE eq 'r') {
3607 my $re = re_uninterp(escape_str(re_unback($mg->precomp)));
3608 return single_delim("qr", "", $re);
3613 return $self->maybe_parens("\\" . $self->const($ref, 20), $cx, 20);
3614 } elsif ($sv->FLAGS & SVf_POK) {
3616 if ($str =~ /[[:^print:]]/) {
3617 return single_delim("qq", '"', uninterp escape_str unback $str);
3619 return single_delim("q", "'", unback $str);
3629 my $ref = $sv->object_2svref();
3630 my $dumper = Data::Dumper->new([$$ref], ['$v']);
3631 $dumper->Purity(1)->Terse(1)->Deparse(1)->Indent(0)->Useqq(1)->Sortkeys(1);
3632 my $str = $dumper->Dump();
3633 if ($str =~ /^\$v/) {
3634 return '${my ' . $str . ' \$v}';
3644 # the constant could be in the pad (under useithreads)
3645 $sv = $self->padval($op->targ) unless $$sv;
3652 if ($op->private & OPpCONST_ARYBASE) {
3655 # if ($op->private & OPpCONST_BARE) { # trouble with `=>' autoquoting
3656 # return $self->const_sv($op)->PV;
3658 my $sv = $self->const_sv($op);
3659 return $self->const($sv, $cx);
3665 my $type = $op->name;
3666 if ($type eq "const") {
3667 return '$[' if $op->private & OPpCONST_ARYBASE;
3668 return uninterp(escape_str(unback($self->const_sv($op)->as_string)));
3669 } elsif ($type eq "concat") {
3670 my $first = $self->dq($op->first);
3671 my $last = $self->dq($op->last);
3673 # Disambiguate "${foo}bar", "${foo}{bar}", "${foo}[1]", "$foo\::bar"
3674 ($last =~ /^[A-Z\\\^\[\]_?]/ &&
3675 $first =~ s/([\$@])\^$/${1}{^}/) # "${^}W" etc
3676 || ($last =~ /^[:'{\[\w_]/ && #'
3677 $first =~ s/([\$@])([A-Za-z_]\w*)$/${1}{$2}/);
3679 return $first . $last;
3680 } elsif ($type eq "uc") {
3681 return '\U' . $self->dq($op->first->sibling) . '\E';
3682 } elsif ($type eq "lc") {
3683 return '\L' . $self->dq($op->first->sibling) . '\E';
3684 } elsif ($type eq "ucfirst") {
3685 return '\u' . $self->dq($op->first->sibling);
3686 } elsif ($type eq "lcfirst") {
3687 return '\l' . $self->dq($op->first->sibling);
3688 } elsif ($type eq "quotemeta") {
3689 return '\Q' . $self->dq($op->first->sibling) . '\E';
3690 } elsif ($type eq "join") {
3691 return $self->deparse($op->last, 26); # was join($", @ary)
3693 return $self->deparse($op, 26);
3701 return single_delim("qx", '`', $self->dq($op->first->sibling));
3707 my $kid = $op->first->sibling; # skip ex-stringify, pushmark
3708 return $self->deparse($kid, $cx) if $self->{'unquote'};
3709 $self->maybe_targmy($kid, $cx,
3710 sub {single_delim("qq", '"', $self->dq($_[1]))});
3713 # OP_STRINGIFY is a listop, but it only ever has one arg
3714 sub pp_stringify { maybe_targmy(@_, \&dquote) }
3716 # tr/// and s/// (and tr[][], tr[]//, tr###, etc)
3717 # note that tr(from)/to/ is OK, but not tr/from/(to)
3719 my($from, $to) = @_;
3720 my($succeed, $delim);
3721 if ($from !~ m[/] and $to !~ m[/]) {
3722 return "/$from/$to/";
3723 } elsif (($succeed, $from) = balanced_delim($from) and $succeed) {
3724 if (($succeed, $to) = balanced_delim($to) and $succeed) {
3727 for $delim ('/', '"', '#') { # note no `'' -- s''' is special
3728 return "$from$delim$to$delim" if index($to, $delim) == -1;
3731 return "$from/$to/";
3734 for $delim ('/', '"', '#') { # note no '
3735 return "$delim$from$delim$to$delim"
3736 if index($to . $from, $delim) == -1;
3738 $from =~ s[/][\\/]g;
3740 return "/$from/$to/";
3744 # Only used by tr///, so backslashes hyphens
3747 if ($n == ord '\\') {
3749 } elsif ($n == ord "-") {
3751 } elsif ($n >= ord(' ') and $n <= ord('~')) {
3753 } elsif ($n == ord "\a") {
3755 } elsif ($n == ord "\b") {
3757 } elsif ($n == ord "\t") {
3759 } elsif ($n == ord "\n") {
3761 } elsif ($n == ord "\e") {
3763 } elsif ($n == ord "\f") {
3765 } elsif ($n == ord "\r") {
3767 } elsif ($n >= ord("\cA") and $n <= ord("\cZ")) {
3768 return '\\c' . chr(ord("@") + $n);
3770 # return '\x' . sprintf("%02x", $n);
3771 return '\\' . sprintf("%03o", $n);
3777 my($str, $c, $tr) = ("");
3778 for ($c = 0; $c < @chars; $c++) {
3781 if ($c <= $#chars - 2 and $chars[$c + 1] == $tr + 1 and
3782 $chars[$c + 2] == $tr + 2)
3784 for (; $c <= $#chars-1 and $chars[$c + 1] == $chars[$c] + 1; $c++)
3787 $str .= pchr($chars[$c]);
3793 sub tr_decode_byte {
3794 my($table, $flags) = @_;
3795 my(@table) = unpack("s*", $table);
3796 splice @table, 0x100, 1; # Number of subsequent elements
3797 my($c, $tr, @from, @to, @delfrom, $delhyphen);
3798 if ($table[ord "-"] != -1 and
3799 $table[ord("-") - 1] == -1 || $table[ord("-") + 1] == -1)
3801 $tr = $table[ord "-"];
3802 $table[ord "-"] = -1;
3806 } else { # -2 ==> delete
3810 for ($c = 0; $c < @table; $c++) {
3813 push @from, $c; push @to, $tr;
3814 } elsif ($tr == -2) {
3818 @from = (@from, @delfrom);
3819 if ($flags & OPpTRANS_COMPLEMENT) {
3822 @from{@from} = (1) x @from;
3823 for ($c = 0; $c < 256; $c++) {
3824 push @newfrom, $c unless $from{$c};
3828 unless ($flags & OPpTRANS_DELETE || !@to) {
3829 pop @to while $#to and $to[$#to] == $to[$#to -1];
3832 $from = collapse(@from);
3833 $to = collapse(@to);
3834 $from .= "-" if $delhyphen;
3835 return ($from, $to);
3840 if ($x == ord "-") {
3842 } elsif ($x == ord "\\") {
3849 # XXX This doesn't yet handle all cases correctly either
3851 sub tr_decode_utf8 {
3852 my($swash_hv, $flags) = @_;
3853 my %swash = $swash_hv->ARRAY;
3855 $final = $swash{'FINAL'}->IV if exists $swash{'FINAL'};
3856 my $none = $swash{"NONE"}->IV;
3857 my $extra = $none + 1;
3858 my(@from, @delfrom, @to);
3860 foreach $line (split /\n/, $swash{'LIST'}->PV) {
3861 my($min, $max, $result) = split(/\t/, $line);
3868 $result = hex $result;
3869 if ($result == $extra) {
3870 push @delfrom, [$min, $max];
3872 push @from, [$min, $max];
3873 push @to, [$result, $result + $max - $min];
3876 for my $i (0 .. $#from) {
3877 if ($from[$i][0] == ord '-') {
3878 unshift @from, splice(@from, $i, 1);
3879 unshift @to, splice(@to, $i, 1);
3881 } elsif ($from[$i][1] == ord '-') {
3884 unshift @from, ord '-';
3885 unshift @to, ord '-';
3889 for my $i (0 .. $#delfrom) {
3890 if ($delfrom[$i][0] == ord '-') {
3891 push @delfrom, splice(@delfrom, $i, 1);
3893 } elsif ($delfrom[$i][1] == ord '-') {
3895 push @delfrom, ord '-';
3899 if (defined $final and $to[$#to][1] != $final) {
3900 push @to, [$final, $final];
3902 push @from, @delfrom;
3903 if ($flags & OPpTRANS_COMPLEMENT) {
3906 for my $i (0 .. $#from) {
3907 push @newfrom, [$next, $from[$i][0] - 1];
3908 $next = $from[$i][1] + 1;
3911 for my $range (@newfrom) {
3912 if ($range->[0] <= $range->[1]) {
3917 my($from, $to, $diff);
3918 for my $chunk (@from) {
3919 $diff = $chunk->[1] - $chunk->[0];
3921 $from .= tr_chr($chunk->[0]) . "-" . tr_chr($chunk->[1]);
3922 } elsif ($diff == 1) {
3923 $from .= tr_chr($chunk->[0]) . tr_chr($chunk->[1]);
3925 $from .= tr_chr($chunk->[0]);
3928 for my $chunk (@to) {
3929 $diff = $chunk->[1] - $chunk->[0];
3931 $to .= tr_chr($chunk->[0]) . "-" . tr_chr($chunk->[1]);
3932 } elsif ($diff == 1) {
3933 $to .= tr_chr($chunk->[0]) . tr_chr($chunk->[1]);
3935 $to .= tr_chr($chunk->[0]);
3938 #$final = sprintf("%04x", $final) if defined $final;
3939 #$none = sprintf("%04x", $none) if defined $none;
3940 #$extra = sprintf("%04x", $extra) if defined $extra;
3941 #print STDERR "final: $final\n none: $none\nextra: $extra\n";
3942 #print STDERR $swash{'LIST'}->PV;
3943 return (escape_str($from), escape_str($to));
3950 if (class($op) eq "PVOP") {
3951 ($from, $to) = tr_decode_byte($op->pv, $op->private);
3952 } else { # class($op) eq "SVOP"
3953 ($from, $to) = tr_decode_utf8($op->sv->RV, $op->private);
3956 $flags .= "c" if $op->private & OPpTRANS_COMPLEMENT;
3957 $flags .= "d" if $op->private & OPpTRANS_DELETE;
3958 $to = "" if $from eq $to and $flags eq "";
3959 $flags .= "s" if $op->private & OPpTRANS_SQUASH;
3960 return "tr" . double_delim($from, $to) . $flags;
3963 # Like dq(), but different
3966 my ($op, $extended) = @_;
3968 my $type = $op->name;
3969 if ($type eq "const") {
3970 return '$[' if $op->private & OPpCONST_ARYBASE;
3971 my $unbacked = re_unback($self->const_sv($op)->as_string);
3972 return re_uninterp_extended(escape_extended_re($unbacked))
3974 return re_uninterp(escape_str($unbacked));
3975 } elsif ($type eq "concat") {
3976 my $first = $self->re_dq($op->first, $extended);
3977 my $last = $self->re_dq($op->last, $extended);
3979 # Disambiguate "${foo}bar", "${foo}{bar}", "${foo}[1]"
3980 ($last =~ /^[A-Z\\\^\[\]_?]/ &&
3981 $first =~ s/([\$@])\^$/${1}{^}/) # "${^}W" etc
3982 || ($last =~ /^[{\[\w_]/ &&
3983 $first =~ s/([\$@])([A-Za-z_]\w*)$/${1}{$2}/);
3985 return $first . $last;
3986 } elsif ($type eq "uc") {
3987 return '\U' . $self->re_dq($op->first->sibling, $extended) . '\E';
3988 } elsif ($type eq "lc") {
3989 return '\L' . $self->re_dq($op->first->sibling, $extended) . '\E';
3990 } elsif ($type eq "ucfirst") {
3991 return '\u' . $self->re_dq($op->first->sibling, $extended);
3992 } elsif ($type eq "lcfirst") {
3993 return '\l' . $self->re_dq($op->first->sibling, $extended);
3994 } elsif ($type eq "quotemeta") {
3995 return '\Q' . $self->re_dq($op->first->sibling, $extended) . '\E';
3996 } elsif ($type eq "join") {
3997 return $self->deparse($op->last, 26); # was join($", @ary)
3999 return $self->deparse($op, 26);
4004 my ($self, $op) = @_;
4005 return 0 if null $op;
4006 my $type = $op->name;
4008 if ($type eq 'const') {
4011 elsif ($type =~ /^[ul]c(first)?$/ || $type eq 'quotemeta') {
4012 return $self->pure_string($op->first->sibling);
4014 elsif ($type eq 'join') {
4015 my $join_op = $op->first->sibling; # Skip pushmark
4016 return 0 unless $join_op->name eq 'null' && $join_op->targ eq OP_RV2SV;
4018 my $gvop = $join_op->first;
4019 return 0 unless $gvop->name eq 'gvsv';
4020 return 0 unless '"' eq $self->gv_name($self->gv_or_padgv($gvop));
4022 return 0 unless ${$join_op->sibling} eq ${$op->last};
4023 return 0 unless $op->last->name =~ /^(rv2|pad)av$/;
4025 elsif ($type eq 'concat') {
4026 return $self->pure_string($op->first)
4027 && $self->pure_string($op->last);
4029 elsif (is_scalar($op) || $type =~ /^[ah]elem$/) {
4032 elsif ($type eq "null" and $op->can('first') and not null $op->first and
4033 $op->first->name eq "null" and $op->first->can('first')
4034 and not null $op->first->first and
4035 $op->first->first->name eq "aelemfast") {
4047 my($op, $cx, $extended) = @_;
4048 my $kid = $op->first;
4049 $kid = $kid->first if $kid->name eq "regcmaybe";
4050 $kid = $kid->first if $kid->name eq "regcreset";
4051 if ($kid->name eq "null" and !null($kid->first)
4052 and $kid->first->name eq 'pushmark')
4055 $kid = $kid->first->sibling;
4056 while (!null($kid)) {
4057 $str .= $self->re_dq($kid, $extended);
4058 $kid = $kid->sibling;
4063 return ($self->re_dq($kid, $extended), 1) if $self->pure_string($kid);
4064 return ($self->deparse($kid, $cx), 0);
4068 my ($self, $op, $cx) = @_;
4069 return (($self->regcomp($op, $cx, 0))[0]);
4072 # osmic acid -- see osmium tetroxide
4075 map($matchwords{join "", sort split //, $_} = $_, 'cig', 'cog', 'cos', 'cogs',
4076 'cox', 'go', 'is', 'ism', 'iso', 'mig', 'mix', 'osmic', 'ox', 'sic',
4077 'sig', 'six', 'smog', 'so', 'soc', 'sog', 'xi');
4081 my($op, $cx, $name, $delim) = @_;
4082 my $kid = $op->first;
4083 my ($binop, $var, $re) = ("", "", "");
4084 if ($op->flags & OPf_STACKED) {
4086 $var = $self->deparse($kid, 20);
4087 $kid = $kid->sibling;
4090 my $extended = ($op->pmflags & PMf_EXTENDED);
4092 my $unbacked = re_unback($op->precomp);
4094 $re = re_uninterp_extended(escape_extended_re($unbacked));
4096 $re = re_uninterp(escape_str(re_unback($op->precomp)));
4098 } elsif ($kid->name ne 'regcomp') {
4099 carp("found ".$kid->name." where regcomp expected");
4101 ($re, $quote) = $self->regcomp($kid, 21, $extended);
4104 $flags .= "c" if $op->pmflags & PMf_CONTINUE;
4105 $flags .= "g" if $op->pmflags & PMf_GLOBAL;
4106 $flags .= "i" if $op->pmflags & PMf_FOLD;
4107 $flags .= "m" if $op->pmflags & PMf_MULTILINE;
4108 $flags .= "o" if $op->pmflags & PMf_KEEP;
4109 $flags .= "s" if $op->pmflags & PMf_SINGLELINE;
4110 $flags .= "x" if $op->pmflags & PMf_EXTENDED;
4111 $flags = $matchwords{$flags} if $matchwords{$flags};
4112 if ($op->pmflags & PMf_ONCE) { # only one kind of delimiter works here
4116 $re = single_delim($name, $delim, $re);
4118 $re = $re . $flags if $quote;
4120 return $self->maybe_parens("$var =~ $re", $cx, 20);
4126 sub pp_match { matchop(@_, "m", "/") }
4127 sub pp_pushre { matchop(@_, "m", "/") }
4128 sub pp_qr { matchop(@_, "qr", "") }
4133 my($kid, @exprs, $ary, $expr);
4136 # For our kid (an OP_PUSHRE), pmreplroot is never actually the
4137 # root of a replacement; it's either empty, or abused to point to
4138 # the GV for an array we split into (an optimization to save
4139 # assignment overhead). Depending on whether we're using ithreads,
4140 # this OP* holds either a GV* or a PADOFFSET. Luckily, B.xs
4141 # figures out for us which it is.
4142 my $replroot = $kid->pmreplroot;
4144 if (ref($replroot) eq "B::GV") {
4146 } elsif (!ref($replroot) and $replroot > 0) {
4147 $gv = $self->padval($replroot);
4149 $ary = $self->stash_variable('@', $self->gv_name($gv)) if $gv;
4151 for (; !null($kid); $kid = $kid->sibling) {
4152 push @exprs, $self->deparse($kid, 6);
4155 # handle special case of split(), and split(' ') that compiles to /\s+/
4157 if ($kid->flags & OPf_SPECIAL and $kid->pmflags & PMf_SKIPWHITE) {
4161 $expr = "split(" . join(", ", @exprs) . ")";
4163 return $self->maybe_parens("$ary = $expr", $cx, 7);
4169 # oxime -- any of various compounds obtained chiefly by the action of
4170 # hydroxylamine on aldehydes and ketones and characterized by the
4171 # bivalent grouping C=NOH [Webster's Tenth]
4174 map($substwords{join "", sort split //, $_} = $_, 'ego', 'egoism', 'em',
4175 'es', 'ex', 'exes', 'gee', 'go', 'goes', 'ie', 'ism', 'iso', 'me',
4176 'meese', 'meso', 'mig', 'mix', 'os', 'ox', 'oxime', 'see', 'seem',
4177 'seg', 'sex', 'sig', 'six', 'smog', 'sog', 'some', 'xi');
4182 my $kid = $op->first;
4183 my($binop, $var, $re, $repl) = ("", "", "", "");
4184 if ($op->flags & OPf_STACKED) {
4186 $var = $self->deparse($kid, 20);
4187 $kid = $kid->sibling;
4190 if (null($op->pmreplroot)) {
4191 $repl = $self->dq($kid);
4192 $kid = $kid->sibling;
4194 $repl = $op->pmreplroot->first; # skip substcont
4195 while ($repl->name eq "entereval") {
4196 $repl = $repl->first;
4199 if ($op->pmflags & PMf_EVAL) {
4200 $repl = $self->deparse($repl->first, 0);
4202 $repl = $self->dq($repl);
4205 my $extended = ($op->pmflags & PMf_EXTENDED);
4207 my $unbacked = re_unback($op->precomp);
4209 $re = re_uninterp_extended(escape_extended_re($unbacked));
4212 $re = re_uninterp(escape_str($unbacked));
4215 ($re) = $self->regcomp($kid, 1, $extended);
4217 $flags .= "e" if $op->pmflags & PMf_EVAL;
4218 $flags .= "g" if $op->pmflags & PMf_GLOBAL;
4219 $flags .= "i" if $op->pmflags & PMf_FOLD;
4220 $flags .= "m" if $op->pmflags & PMf_MULTILINE;
4221 $flags .= "o" if $op->pmflags & PMf_KEEP;
4222 $flags .= "s" if $op->pmflags & PMf_SINGLELINE;
4223 $flags .= "x" if $extended;
4224 $flags = $substwords{$flags} if $substwords{$flags};
4226 return $self->maybe_parens("$var =~ s"
4227 . double_delim($re, $repl) . $flags,
4230 return "s". double_delim($re, $repl) . $flags;
4239 B::Deparse - Perl compiler backend to produce perl code
4243 B<perl> B<-MO=Deparse>[B<,-d>][B<,-f>I<FILE>][B<,-p>][B<,-q>][B<,-l>]
4244 [B<,-s>I<LETTERS>][B<,-x>I<LEVEL>] I<prog.pl>
4248 B::Deparse is a backend module for the Perl compiler that generates
4249 perl source code, based on the internal compiled structure that perl
4250 itself creates after parsing a program. The output of B::Deparse won't
4251 be exactly the same as the original source, since perl doesn't keep
4252 track of comments or whitespace, and there isn't a one-to-one
4253 correspondence between perl's syntactical constructions and their
4254 compiled form, but it will often be close. When you use the B<-p>
4255 option, the output also includes parentheses even when they are not
4256 required by precedence, which can make it easy to see if perl is
4257 parsing your expressions the way you intended.
4259 While B::Deparse goes to some lengths to try to figure out what your
4260 original program was doing, some parts of the language can still trip
4261 it up; it still fails even on some parts of Perl's own test suite. If
4262 you encounter a failure other than the most common ones described in
4263 the BUGS section below, you can help contribute to B::Deparse's
4264 ongoing development by submitting a bug report with a small
4269 As with all compiler backend options, these must follow directly after
4270 the '-MO=Deparse', separated by a comma but not any white space.
4276 Output data values (when they appear as constants) using Data::Dumper.
4277 Without this option, B::Deparse will use some simple routines of its
4278 own for the same purpose. Currently, Data::Dumper is better for some
4279 kinds of data (such as complex structures with sharing and
4280 self-reference) while the built-in routines are better for others
4281 (such as odd floating-point values).
4285 Normally, B::Deparse deparses the main code of a program, and all the subs
4286 defined in the same file. To include subs defined in other files, pass the
4287 B<-f> option with the filename. You can pass the B<-f> option several times, to
4288 include more than one secondary file. (Most of the time you don't want to
4289 use it at all.) You can also use this option to include subs which are
4290 defined in the scope of a B<#line> directive with two parameters.
4294 Add '#line' declarations to the output based on the line and file
4295 locations of the original code.
4299 Print extra parentheses. Without this option, B::Deparse includes
4300 parentheses in its output only when they are needed, based on the
4301 structure of your program. With B<-p>, it uses parentheses (almost)
4302 whenever they would be legal. This can be useful if you are used to
4303 LISP, or if you want to see how perl parses your input. If you say
4305 if ($var & 0x7f == 65) {print "Gimme an A!"}
4306 print ($which ? $a : $b), "\n";
4307 $name = $ENV{USER} or "Bob";
4309 C<B::Deparse,-p> will print
4312 print('Gimme an A!')
4314 (print(($which ? $a : $b)), '???');
4315 (($name = $ENV{'USER'}) or '???')
4317 which probably isn't what you intended (the C<'???'> is a sign that
4318 perl optimized away a constant value).
4322 Disable prototype checking. With this option, all function calls are
4323 deparsed as if no prototype was defined for them. In other words,
4325 perl -MO=Deparse,-P -e 'sub foo (\@) { 1 } foo @x'
4334 making clear how the parameters are actually passed to C<foo>.
4338 Expand double-quoted strings into the corresponding combinations of
4339 concatenation, uc, ucfirst, lc, lcfirst, quotemeta, and join. For
4342 print "Hello, $world, @ladies, \u$gentlemen\E, \u\L$me!";
4346 print 'Hello, ' . $world . ', ' . join($", @ladies) . ', '
4347 . ucfirst($gentlemen) . ', ' . ucfirst(lc $me . '!');
4349 Note that the expanded form represents the way perl handles such
4350 constructions internally -- this option actually turns off the reverse
4351 translation that B::Deparse usually does. On the other hand, note that
4352 C<$x = "$y"> is not the same as C<$x = $y>: the former makes the value
4353 of $y into a string before doing the assignment.
4355 =item B<-s>I<LETTERS>
4357 Tweak the style of B::Deparse's output. The letters should follow
4358 directly after the 's', with no space or punctuation. The following
4359 options are available:
4365 Cuddle C<elsif>, C<else>, and C<continue> blocks. For example, print
4382 The default is not to cuddle.
4386 Indent lines by multiples of I<NUMBER> columns. The default is 4 columns.
4390 Use tabs for each 8 columns of indent. The default is to use only spaces.
4391 For instance, if the style options are B<-si4T>, a line that's indented
4392 3 times will be preceded by one tab and four spaces; if the options were
4393 B<-si8T>, the same line would be preceded by three tabs.
4395 =item B<v>I<STRING>B<.>
4397 Print I<STRING> for the value of a constant that can't be determined
4398 because it was optimized away (mnemonic: this happens when a constant
4399 is used in B<v>oid context). The end of the string is marked by a period.
4400 The string should be a valid perl expression, generally a constant.
4401 Note that unless it's a number, it probably needs to be quoted, and on
4402 a command line quotes need to be protected from the shell. Some
4403 conventional values include 0, 1, 42, '', 'foo', and
4404 'Useless use of constant omitted' (which may need to be
4405 B<-sv"'Useless use of constant omitted'.">
4406 or something similar depending on your shell). The default is '???'.
4407 If you're using B::Deparse on a module or other file that's require'd,
4408 you shouldn't use a value that evaluates to false, since the customary
4409 true constant at the end of a module will be in void context when the
4410 file is compiled as a main program.
4416 Expand conventional syntax constructions into equivalent ones that expose
4417 their internal operation. I<LEVEL> should be a digit, with higher values
4418 meaning more expansion. As with B<-q>, this actually involves turning off
4419 special cases in B::Deparse's normal operations.
4421 If I<LEVEL> is at least 3, C<for> loops will be translated into equivalent
4422 while loops with continue blocks; for instance
4424 for ($i = 0; $i < 10; ++$i) {
4437 Note that in a few cases this translation can't be perfectly carried back
4438 into the source code -- if the loop's initializer declares a my variable,
4439 for instance, it won't have the correct scope outside of the loop.
4441 If I<LEVEL> is at least 5, C<use> declarations will be translated into
4442 C<BEGIN> blocks containing calls to C<require> and C<import>; for
4452 'strict'->import('refs')
4456 If I<LEVEL> is at least 7, C<if> statements will be translated into
4457 equivalent expressions using C<&&>, C<?:> and C<do {}>; for instance
4459 print 'hi' if $nice;
4471 $nice and print 'hi';
4472 $nice and do { print 'hi' };
4473 $nice ? do { print 'hi' } : do { print 'bye' };
4475 Long sequences of elsifs will turn into nested ternary operators, which
4476 B::Deparse doesn't know how to indent nicely.
4480 =head1 USING B::Deparse AS A MODULE
4485 $deparse = B::Deparse->new("-p", "-sC");
4486 $body = $deparse->coderef2text(\&func);
4487 eval "sub func $body"; # the inverse operation
4491 B::Deparse can also be used on a sub-by-sub basis from other perl
4496 $deparse = B::Deparse->new(OPTIONS)
4498 Create an object to store the state of a deparsing operation and any
4499 options. The options are the same as those that can be given on the
4500 command line (see L</OPTIONS>); options that are separated by commas
4501 after B<-MO=Deparse> should be given as separate strings. Some
4502 options, like B<-u>, don't make sense for a single subroutine, so
4505 =head2 ambient_pragmas
4507 $deparse->ambient_pragmas(strict => 'all', '$[' => $[);
4509 The compilation of a subroutine can be affected by a few compiler
4510 directives, B<pragmas>. These are:
4524 Assigning to the special variable $[
4544 Ordinarily, if you use B::Deparse on a subroutine which has
4545 been compiled in the presence of one or more of these pragmas,
4546 the output will include statements to turn on the appropriate
4547 directives. So if you then compile the code returned by coderef2text,
4548 it will behave the same way as the subroutine which you deparsed.
4550 However, you may know that you intend to use the results in a
4551 particular context, where some pragmas are already in scope. In
4552 this case, you use the B<ambient_pragmas> method to describe the
4553 assumptions you wish to make.
4555 Not all of the options currently have any useful effect. See
4556 L</BUGS> for more details.
4558 The parameters it accepts are:
4564 Takes a string, possibly containing several values separated
4565 by whitespace. The special values "all" and "none" mean what you'd
4568 $deparse->ambient_pragmas(strict => 'subs refs');
4572 Takes a number, the value of the array base $[.
4580 If the value is true, then the appropriate pragma is assumed to
4581 be in the ambient scope, otherwise not.
4585 Takes a string, possibly containing a whitespace-separated list of
4586 values. The values "all" and "none" are special. It's also permissible
4587 to pass an array reference here.
4589 $deparser->ambient_pragmas(re => 'eval');
4594 Takes a string, possibly containing a whitespace-separated list of
4595 values. The values "all" and "none" are special, again. It's also
4596 permissible to pass an array reference here.
4598 $deparser->ambient_pragmas(warnings => [qw[void io]]);
4600 If one of the values is the string "FATAL", then all the warnings
4601 in that list will be considered fatal, just as with the B<warnings>
4602 pragma itself. Should you need to specify that some warnings are
4603 fatal, and others are merely enabled, you can pass the B<warnings>
4606 $deparser->ambient_pragmas(
4608 warnings => [FATAL => qw/void io/],
4611 See L<perllexwarn> for more information about lexical warnings.
4617 These two parameters are used to specify the ambient pragmas in
4618 the format used by the special variables $^H and ${^WARNING_BITS}.
4620 They exist principally so that you can write code like:
4622 { my ($hint_bits, $warning_bits);
4623 BEGIN {($hint_bits, $warning_bits) = ($^H, ${^WARNING_BITS})}
4624 $deparser->ambient_pragmas (
4625 hint_bits => $hint_bits,
4626 warning_bits => $warning_bits,
4630 which specifies that the ambient pragmas are exactly those which
4631 are in scope at the point of calling.
4637 $body = $deparse->coderef2text(\&func)
4638 $body = $deparse->coderef2text(sub ($$) { ... })
4640 Return source code for the body of a subroutine (a block, optionally
4641 preceded by a prototype in parens), given a reference to the
4642 sub. Because a subroutine can have no names, or more than one name,
4643 this method doesn't return a complete subroutine definition -- if you
4644 want to eval the result, you should prepend "sub subname ", or "sub "
4645 for an anonymous function constructor. Unless the sub was defined in
4646 the main:: package, the code will include a package declaration.
4654 The only pragmas to be completely supported are: C<use warnings>,
4655 C<use strict 'refs'>, C<use bytes>, and C<use integer>. (C<$[>, which
4656 behaves like a pragma, is also supported.)
4658 Excepting those listed above, we're currently unable to guarantee that
4659 B::Deparse will produce a pragma at the correct point in the program.
4660 (Specifically, pragmas at the beginning of a block often appear right
4661 before the start of the block instead.)
4662 Since the effects of pragmas are often lexically scoped, this can mean
4663 that the pragma holds sway over a different portion of the program
4664 than in the input file.
4668 In fact, the above is a specific instance of a more general problem:
4669 we can't guarantee to produce BEGIN blocks or C<use> declarations in
4670 exactly the right place. So if you use a module which affects compilation
4671 (such as by over-riding keywords, overloading constants or whatever)
4672 then the output code might not work as intended.
4674 This is the most serious outstanding problem, and will require some help
4675 from the Perl core to fix.
4679 If a keyword is over-ridden, and your program explicitly calls
4680 the built-in version by using CORE::keyword, the output of B::Deparse
4681 will not reflect this. If you run the resulting code, it will call
4682 the over-ridden version rather than the built-in one. (Maybe there
4683 should be an option to B<always> print keyword calls as C<CORE::name>.)
4687 Some constants don't print correctly either with or without B<-d>.
4688 For instance, neither B::Deparse nor Data::Dumper know how to print
4689 dual-valued scalars correctly, as in:
4691 use constant E2BIG => ($!=7); $y = E2BIG; print $y, 0+$y;
4695 An input file that uses source filtering probably won't be deparsed into
4696 runnable code, because it will still include the B<use> declaration
4697 for the source filtering module, even though the code that is
4698 produced is already ordinary Perl which shouldn't be filtered again.
4702 Optimised away statements are rendered as '???'. This includes statements that
4703 have a compile-time side-effect, such as the obscure
4707 which is not, consequently, deparsed correctly.
4711 Lexical (my) variables declared in scopes external to a subroutine
4712 appear in code2ref output text as package variables. This is a tricky
4713 problem, as perl has no native facility for refering to a lexical variable
4714 defined within a different scope, although L<PadWalker> is a good start.
4718 There are probably many more bugs on non-ASCII platforms (EBCDIC).
4724 Stephen McCamant <smcc@CSUA.Berkeley.EDU>, based on an earlier version
4725 by Malcolm Beattie <mbeattie@sable.ox.ac.uk>, with contributions from
4726 Gisle Aas, James Duncan, Albert Dvornik, Robin Houston, Dave Mitchell,
4727 Hugo van der Sanden, Gurusamy Sarathy, Nick Ing-Simmons, and Rafael