2 # Copyright (c) 1998, 1999, 2000 Stephen McCamant. All rights reserved.
3 # This module is free software; you can redistribute and/or modify
4 # it under the same terms as Perl itself.
6 # This is based on the module of the same name by Malcolm Beattie,
7 # but essentially none of his code remains.
11 use B qw(class main_root main_start main_cv svref_2object opnumber cstring
12 OPf_WANT OPf_WANT_VOID OPf_WANT_SCALAR OPf_WANT_LIST
13 OPf_KIDS OPf_REF OPf_STACKED OPf_SPECIAL OPf_MOD
14 OPpLVAL_INTRO OPpOUR_INTRO OPpENTERSUB_AMPER OPpSLICE OPpCONST_BARE
15 OPpTRANS_SQUASH OPpTRANS_DELETE OPpTRANS_COMPLEMENT OPpTARGET_MY
16 OPpCONST_ARYBASE OPpEXISTS_SUB OPpSORT_NUMERIC OPpSORT_INTEGER
18 SVf_IOK SVf_NOK SVf_ROK SVf_POK SVpad_OUR
19 CVf_METHOD CVf_LOCKED CVf_LVALUE
20 PMf_KEEP PMf_GLOBAL PMf_CONTINUE PMf_EVAL PMf_ONCE PMf_SKIPWHITE
21 PMf_MULTILINE PMf_SINGLELINE PMf_FOLD PMf_EXTENDED);
24 use vars qw/$AUTOLOAD/;
27 # Changes between 0.50 and 0.51:
28 # - fixed nulled leave with live enter in sort { }
29 # - fixed reference constants (\"str")
30 # - handle empty programs gracefully
31 # - handle infinte loops (for (;;) {}, while (1) {})
32 # - differentiate between `for my $x ...' and `my $x; for $x ...'
33 # - various minor cleanups
34 # - moved globals into an object
35 # - added `-u', like B::C
36 # - package declarations using cop_stash
37 # - subs, formats and code sorted by cop_seq
38 # Changes between 0.51 and 0.52:
39 # - added pp_threadsv (special variables under USE_5005THREADS)
40 # - added documentation
41 # Changes between 0.52 and 0.53:
42 # - many changes adding precedence contexts and associativity
43 # - added `-p' and `-s' output style options
44 # - various other minor fixes
45 # Changes between 0.53 and 0.54:
46 # - added support for new `for (1..100)' optimization,
48 # Changes between 0.54 and 0.55:
49 # - added support for new qr// construct
50 # - added support for new pp_regcreset OP
51 # Changes between 0.55 and 0.56:
52 # - tested on base/*.t, cmd/*.t, comp/*.t, io/*.t
53 # - fixed $# on non-lexicals broken in last big rewrite
54 # - added temporary fix for change in opcode of OP_STRINGIFY
55 # - fixed problem in 0.54's for() patch in `for (@ary)'
56 # - fixed precedence in conditional of ?:
57 # - tweaked list paren elimination in `my($x) = @_'
58 # - made continue-block detection trickier wrt. null ops
59 # - fixed various prototype problems in pp_entersub
60 # - added support for sub prototypes that never get GVs
61 # - added unquoting for special filehandle first arg in truncate
62 # - print doubled rv2gv (a bug) as `*{*GV}' instead of illegal `**GV'
63 # - added semicolons at the ends of blocks
64 # - added -l `#line' declaration option -- fixes cmd/subval.t 27,28
65 # Changes between 0.56 and 0.561:
66 # - fixed multiply-declared my var in pp_truncate (thanks to Sarathy)
67 # - used new B.pm symbolic constants (done by Nick Ing-Simmons)
68 # Changes between 0.561 and 0.57:
69 # - stylistic changes to symbolic constant stuff
70 # - handled scope in s///e replacement code
71 # - added unquote option for expanding "" into concats, etc.
72 # - split method and proto parts of pp_entersub into separate functions
73 # - various minor cleanups
75 # - added parens in \&foo (patch by Albert Dvornik)
76 # Changes between 0.57 and 0.58:
77 # - fixed `0' statements that weren't being printed
78 # - added methods for use from other programs
79 # (based on patches from James Duncan and Hugo van der Sanden)
80 # - added -si and -sT to control indenting (also based on a patch from Hugo)
81 # - added -sv to print something else instead of '???'
82 # - preliminary version of utf8 tr/// handling
84 # - uses of $op->ppaddr changed to new $op->name (done by Sarathy)
85 # - added support for Hugo's new OP_SETSTATE (like nextstate)
86 # Changes between 0.58 and 0.59
87 # - added support for Chip's OP_METHOD_NAMED
88 # - added support for Ilya's OPpTARGET_MY optimization
89 # - elided arrows before `()' subscripts when possible
90 # Changes between 0.59 and 0.60
91 # - support for method attribues was added
92 # - some warnings fixed
93 # - separate recognition of constant subs
94 # - rewrote continue block handling, now recoginizing for loops
95 # - added more control of expanding control structures
96 # Changes between 0.60 and 0.61 (mostly by Robin Houston)
98 # - support for pragmas and 'use'
99 # - support for the little-used $[ variable
100 # - support for __DATA__ sections
102 # - BEGIN, CHECK, INIT and END blocks
103 # - scoping of subroutine declarations fixed
104 # - compile-time output from the input program can be suppressed, so that the
105 # output is just the deparsed code. (a change to O.pm in fact)
106 # - our() declarations
107 # - *all* the known bugs are now listed in the BUGS section
108 # - comprehensive test mechanism (TEST -deparse)
111 # (See also BUGS section at the end of this file)
113 # - finish tr/// changes
114 # - add option for even more parens (generalize \&foo change)
115 # - left/right context
116 # - treat top-level block specially for incremental output
117 # - copy comments (look at real text with $^P?)
118 # - avoid semis in one-statement blocks
119 # - associativity of &&=, ||=, ?:
120 # - ',' => '=>' (auto-unquote?)
121 # - break long lines ("\r" as discretionary break?)
122 # - configurable syntax highlighting: ANSI color, HTML, TeX, etc.
123 # - more style options: brace style, hex vs. octal, quotes, ...
124 # - print big ints as hex/octal instead of decimal (heuristic?)
125 # - handle `my $x if 0'?
126 # - coordinate with Data::Dumper (both directions? see previous)
127 # - version using op_next instead of op_first/sibling?
128 # - avoid string copies (pass arrays, one big join?)
131 # Tests that will always fail:
132 # (see t/TEST for the short list)
134 # Object fields (were globals):
137 # (local($a), local($b)) and local($a, $b) have the same internal
138 # representation but the short form looks better. We notice we can
139 # use a large-scale local when checking the list, but need to prevent
140 # individual locals too. This hash holds the addresses of OPs that
141 # have already had their local-ness accounted for. The same thing
145 # CV for current sub (or main program) being deparsed
148 # Cached hash of lexical variables for curcv: keys are names,
149 # each value is an array of pairs, indicating the cop_seq of scopes
150 # in which a var of that name is valid.
153 # COP for statement being deparsed
156 # name of the current package for deparsed code
159 # array of [cop_seq, CV, is_format?] for subs and formats we still
163 # as above, but [name, prototype] for subs that never got a GV
165 # subs_done, forms_done:
166 # keys are addresses of GVs for subs and formats we've already
167 # deparsed (or at least put into subs_todo)
170 # keys are names of subs for which we've printed declarations.
171 # That means we can omit parentheses from the arguments.
174 # Keeps track of fully qualified names of all deparsed subs.
179 # cuddle: ` ' or `\n', depending on -sC
184 # A little explanation of how precedence contexts and associativity
187 # deparse() calls each per-op subroutine with an argument $cx (short
188 # for context, but not the same as the cx* in the perl core), which is
189 # a number describing the op's parents in terms of precedence, whether
190 # they're inside an expression or at statement level, etc. (see
191 # chart below). When ops with children call deparse on them, they pass
192 # along their precedence. Fractional values are used to implement
193 # associativity (`($x + $y) + $z' => `$x + $y + $y') and related
194 # parentheses hacks. The major disadvantage of this scheme is that
195 # it doesn't know about right sides and left sides, so say if you
196 # assign a listop to a variable, it can't tell it's allowed to leave
197 # the parens off the listop.
200 # 26 [TODO] inside interpolation context ("")
201 # 25 left terms and list operators (leftward)
205 # 21 right ! ~ \ and unary + and -
210 # 16 nonassoc named unary operators
211 # 15 nonassoc < > <= >= lt gt le ge
212 # 14 nonassoc == != <=> eq ne cmp
219 # 7 right = += -= *= etc.
221 # 5 nonassoc list operators (rightward)
225 # 1 statement modifiers
228 # Also, lineseq may pass a fourth parameter to the pp_ routines:
229 # if present, the fourth parameter is passed on by deparse.
231 # If present and true, it means that the op exists directly as
232 # part of a lineseq. Currently it's only used by scopeop to
233 # decide whether its results need to be enclosed in a do {} block.
235 # Nonprinting characters with special meaning:
236 # \cS - steal parens (see maybe_parens_unop)
237 # \n - newline and indent
238 # \t - increase indent
239 # \b - decrease indent (`outdent')
240 # \f - flush left (no indent)
241 # \cK - kill following semicolon, if any
245 return class($op) eq "NULL";
250 my($cv, $is_form) = @_;
251 return unless ($cv->FILE eq $0 || exists $self->{files}{$cv->FILE});
253 if (!null($cv->START) and is_state($cv->START)) {
254 $seq = $cv->START->cop_seq;
258 push @{$self->{'subs_todo'}}, [$seq, $cv, $is_form];
259 unless ($is_form || class($cv->STASH) eq 'SPECIAL') {
260 $self->{'subs_deparsed'}{$cv->STASH->NAME."::".$cv->GV->NAME} = 1;
266 my $ent = shift @{$self->{'subs_todo'}};
269 my $name = $self->gv_name($gv);
271 return "format $name =\n"
272 . $self->deparse_format($ent->[1]). "\n";
274 $self->{'subs_declared'}{$name} = 1;
275 if ($name eq "BEGIN") {
276 my $use_dec = $self->begin_is_use($cv);
277 if (defined ($use_dec)) {
278 return () if 0 == length($use_dec);
283 if ($self->{'linenums'}) {
284 my $line = $gv->LINE;
285 my $file = $gv->FILE;
286 $l = "\n\f#line $line \"$file\"\n";
288 return "${l}sub $name " . $self->deparse_sub($cv);
292 # Return a "use" declaration for this BEGIN block, if appropriate
294 my ($self, $cv) = @_;
295 my $root = $cv->ROOT;
296 local @$self{qw'curcv curcvlex'} = ($cv);
298 #B::walkoptree($cv->ROOT, "debug");
299 my $lineseq = $root->first;
300 return if $lineseq->name ne "lineseq";
302 my $req_op = $lineseq->first->sibling;
303 return if $req_op->name ne "require";
306 if ($req_op->first->private & OPpCONST_BARE) {
307 # Actually it should always be a bareword
308 $module = $self->const_sv($req_op->first)->PV;
309 $module =~ s[/][::]g;
313 $module = const($self->const_sv($req_op->first));
317 my $version_op = $req_op->sibling;
318 return if class($version_op) eq "NULL";
319 if ($version_op->name eq "lineseq") {
320 # We have a version parameter; skip nextstate & pushmark
321 my $constop = $version_op->first->next->next;
323 return unless $self->const_sv($constop)->PV eq $module;
324 $constop = $constop->sibling;
325 $version = $self->const_sv($constop)->int_value;
326 $constop = $constop->sibling;
327 return if $constop->name ne "method_named";
328 return if $self->const_sv($constop)->PV ne "VERSION";
331 $lineseq = $version_op->sibling;
332 return if $lineseq->name ne "lineseq";
333 my $entersub = $lineseq->first->sibling;
334 if ($entersub->name eq "stub") {
335 return "use $module $version ();\n" if defined $version;
336 return "use $module ();\n";
338 return if $entersub->name ne "entersub";
340 # See if there are import arguments
343 my $svop = $entersub->first->sibling; # Skip over pushmark
344 return unless $self->const_sv($svop)->PV eq $module;
346 # Pull out the arguments
347 for ($svop=$svop->sibling; $svop->name ne "method_named";
348 $svop = $svop->sibling) {
349 $args .= ", " if length($args);
350 $args .= $self->deparse($svop, 6);
354 my $method_named = $svop;
355 return if $method_named->name ne "method_named";
356 my $method_name = $self->const_sv($method_named)->PV;
358 if ($method_name eq "unimport") {
362 # Certain pragmas are dealt with using hint bits,
363 # so we ignore them here
364 if ($module eq 'strict' || $module eq 'integer'
365 || $module eq 'bytes' || $module eq 'warnings') {
369 if (defined $version && length $args) {
370 return "$use $module $version ($args);\n";
371 } elsif (defined $version) {
372 return "$use $module $version;\n";
373 } elsif (length $args) {
374 return "$use $module ($args);\n";
376 return "$use $module;\n";
381 my ($self, $pack) = @_;
383 if (!defined $pack) {
388 $pack =~ s/(::)?$/::/;
392 my %stash = svref_2object($stash)->ARRAY;
393 while (my ($key, $val) = each %stash) {
394 next if $key eq 'main::'; # avoid infinite recursion
395 my $class = class($val);
396 if ($class eq "PV") {
397 # Just a prototype. As an ugly but fairly effective way
398 # to find out if it belongs here is to see if the AUTOLOAD
399 # (if any) for the stash was defined in one of our files.
400 my $A = $stash{"AUTOLOAD"};
401 if (defined ($A) && class($A) eq "GV" && defined($A->CV)
402 && class($A->CV) eq "CV") {
404 next unless $AF eq $0 || exists $self->{'files'}{$AF};
406 push @{$self->{'protos_todo'}}, [$pack . $key, $val->PV];
407 } elsif ($class eq "IV") {
408 # Just a name. As above.
409 my $A = $stash{"AUTOLOAD"};
410 if (defined ($A) && class($A) eq "GV" && defined($A->CV)
411 && class($A->CV) eq "CV") {
413 next unless $AF eq $0 || exists $self->{'files'}{$AF};
415 push @{$self->{'protos_todo'}}, [$pack . $key, undef];
416 } elsif ($class eq "GV") {
417 if (class(my $cv = $val->CV) ne "SPECIAL") {
418 next if $self->{'subs_done'}{$$val}++;
419 next if $$val != ${$cv->GV}; # Ignore imposters
422 if (class(my $cv = $val->FORM) ne "SPECIAL") {
423 next if $self->{'forms_done'}{$$val}++;
424 next if $$val != ${$cv->GV}; # Ignore imposters
427 if (class($val->HV) ne "SPECIAL" && $key =~ /::$/) {
428 $self->stash_subs($pack . $key);
438 foreach $ar (@{$self->{'protos_todo'}}) {
439 my $proto = (defined $ar->[1] ? " (". $ar->[1] . ")" : "");
440 push @ret, "sub " . $ar->[0] . "$proto;\n";
442 delete $self->{'protos_todo'};
450 while (length($opt = substr($opts, 0, 1))) {
452 $self->{'cuddle'} = " ";
453 $opts = substr($opts, 1);
454 } elsif ($opt eq "i") {
455 $opts =~ s/^i(\d+)//;
456 $self->{'indent_size'} = $1;
457 } elsif ($opt eq "T") {
458 $self->{'use_tabs'} = 1;
459 $opts = substr($opts, 1);
460 } elsif ($opt eq "v") {
461 $opts =~ s/^v([^.]*)(.|$)//;
462 $self->{'ex_const'} = $1;
469 my $self = bless {}, $class;
470 $self->{'subs_todo'} = [];
471 $self->{'files'} = {};
472 $self->{'curstash'} = "main";
473 $self->{'curcop'} = undef;
474 $self->{'cuddle'} = "\n";
475 $self->{'indent_size'} = 4;
476 $self->{'use_tabs'} = 0;
477 $self->{'expand'} = 0;
478 $self->{'unquote'} = 0;
479 $self->{'linenums'} = 0;
480 $self->{'parens'} = 0;
481 $self->{'ex_const'} = "'???'";
483 $self->{'ambient_arybase'} = 0;
484 $self->{'ambient_warnings'} = undef; # Assume no lexical warnings
485 $self->{'ambient_hints'} = 0;
488 while (my $arg = shift @_) {
489 if ($arg =~ /^-f(.*)/) {
490 $self->{'files'}{$1} = 1;
491 } elsif ($arg eq "-p") {
492 $self->{'parens'} = 1;
493 } elsif ($arg eq "-l") {
494 $self->{'linenums'} = 1;
495 } elsif ($arg eq "-q") {
496 $self->{'unquote'} = 1;
497 } elsif (substr($arg, 0, 2) eq "-s") {
498 $self->style_opts(substr $arg, 2);
499 } elsif ($arg =~ /^-x(\d)$/) {
500 $self->{'expand'} = $1;
507 # Mask out the bits that L<warnings::register> uses
510 $WARN_MASK = $warnings::Bits{all} | $warnings::DeadBits{all};
517 # Initialise the contextual information, either from
518 # defaults provided with the ambient_pragmas method,
519 # or from perl's own defaults otherwise.
523 $self->{'arybase'} = $self->{'ambient_arybase'};
524 $self->{'warnings'} = defined ($self->{'ambient_warnings'})
525 ? $self->{'ambient_warnings'} & WARN_MASK
527 $self->{'hints'} = $self->{'ambient_hints'} & 0xFF;
529 # also a convenient place to clear out subs_declared
530 delete $self->{'subs_declared'};
536 my $self = B::Deparse->new(@args);
537 # First deparse command-line args
538 if (defined $^I) { # deparse -i
539 print q(BEGIN { $^I = ).cstring($^I).qq(; }\n);
541 if ($^W) { # deparse -w
542 print qq(BEGIN { \$^W = $^W; }\n);
544 if ($/ ne "\n" or defined $O::savebackslash) { # deparse -l and -0
545 my $fs = cstring($/) || 'undef';
546 my $bs = cstring($O::savebackslash) || 'undef';
547 print qq(BEGIN { \$/ = $fs; \$\\ = $bs; }\n);
549 my @BEGINs = B::begin_av->isa("B::AV") ? B::begin_av->ARRAY : ();
550 my @INITs = B::init_av->isa("B::AV") ? B::init_av->ARRAY : ();
551 my @ENDs = B::end_av->isa("B::AV") ? B::end_av->ARRAY : ();
552 for my $block (@BEGINs, @INITs, @ENDs) {
553 $self->todo($block, 0);
556 $self->{'curcv'} = main_cv;
557 $self->{'curcvlex'} = undef;
558 print $self->print_protos;
559 @{$self->{'subs_todo'}} =
560 sort {$a->[0] <=> $b->[0]} @{$self->{'subs_todo'}};
561 print $self->indent($self->deparse(main_root, 0)), "\n"
562 unless null main_root;
564 while (scalar(@{$self->{'subs_todo'}})) {
565 push @text, $self->next_todo;
567 print $self->indent(join("", @text)), "\n" if @text;
569 # Print __DATA__ section, if necessary
571 my $laststash = defined $self->{'curcop'}
572 ? $self->{'curcop'}->stash->NAME : $self->{'curstash'};
573 if (defined *{$laststash."::DATA"}{IO}) {
575 print readline(*{$laststash."::DATA"});
583 croak "Usage: ->coderef2text(CODEREF)" unless ref($sub) eq "CODE";
586 return $self->indent($self->deparse_sub(svref_2object($sub)));
589 sub ambient_pragmas {
591 my ($arybase, $hint_bits, $warning_bits) = (0, 0);
597 if ($name eq 'strict') {
600 if ($val eq 'none') {
601 $hint_bits &= ~strict::bits(qw/refs subs vars/);
607 @names = qw/refs subs vars/;
613 @names = split' ', $val;
615 $hint_bits |= strict::bits(@names);
618 elsif ($name eq '$[') {
622 elsif ($name eq 'integer'
624 || $name eq 'utf8') {
627 $hint_bits |= ${$::{"${name}::"}{"hint_bits"}};
630 $hint_bits &= ~${$::{"${name}::"}{"hint_bits"}};
634 elsif ($name eq 're') {
636 if ($val eq 'none') {
637 $hint_bits &= ~re::bits(qw/taint eval/);
643 @names = qw/taint eval/;
649 @names = split' ',$val;
651 $hint_bits |= re::bits(@names);
654 elsif ($name eq 'warnings') {
655 if ($val eq 'none') {
656 $warning_bits = $warnings::NONE;
665 @names = split/\s+/, $val;
668 $warning_bits = $warnings::NONE if !defined ($warning_bits);
669 $warning_bits |= warnings::bits(@names);
672 elsif ($name eq 'warning_bits') {
673 $warning_bits = $val;
676 elsif ($name eq 'hint_bits') {
681 croak "Unknown pragma type: $name";
685 croak "The ambient_pragmas method expects an even number of args";
688 $self->{'ambient_arybase'} = $arybase;
689 $self->{'ambient_warnings'} = $warning_bits;
690 $self->{'ambient_hints'} = $hint_bits;
695 my($op, $cx, $flags) = @_;
697 Carp::confess("Null op in deparse") if !defined($op)
698 || class($op) eq "NULL";
699 my $meth = "pp_" . $op->name;
701 return $self->$meth($op, $cx, $flags);
703 return $self->$meth($op, $cx);
709 my @lines = split(/\n/, $txt);
714 my $cmd = substr($line, 0, 1);
715 if ($cmd eq "\t" or $cmd eq "\b") {
716 $level += ($cmd eq "\t" ? 1 : -1) * $self->{'indent_size'};
717 if ($self->{'use_tabs'}) {
718 $leader = "\t" x ($level / 8) . " " x ($level % 8);
720 $leader = " " x $level;
722 $line = substr($line, 1);
724 if (substr($line, 0, 1) eq "\f") {
725 $line = substr($line, 1); # no indent
727 $line = $leader . $line;
731 return join("\n", @lines);
738 Carp::confess("NULL in deparse_sub") if !defined($cv) || $cv->isa("B::NULL");
739 Carp::confess("SPECIAL in deparse_sub") if $cv->isa("B::SPECIAL");
740 local $self->{'curcop'} = $self->{'curcop'};
741 if ($cv->FLAGS & SVf_POK) {
742 $proto = "(". $cv->PV . ") ";
744 if ($cv->CvFLAGS & (CVf_METHOD|CVf_LOCKED|CVf_LVALUE)) {
746 $proto .= "lvalue " if $cv->CvFLAGS & CVf_LVALUE;
747 $proto .= "locked " if $cv->CvFLAGS & CVf_LOCKED;
748 $proto .= "method " if $cv->CvFLAGS & CVf_METHOD;
751 local($self->{'curcv'}) = $cv;
752 local($self->{'curcvlex'});
753 local(@$self{qw'curstash warnings hints'})
754 = @$self{qw'curstash warnings hints'};
756 if (not null $cv->ROOT) {
757 my $lineseq = $cv->ROOT->first;
758 if ($lineseq->name eq "lineseq") {
760 for(my$o=$lineseq->first; $$o; $o=$o->sibling) {
763 $body = $self->lineseq(undef, @ops).";";
764 my $scope_en = $self->find_scope_en($lineseq);
765 if (defined $scope_en) {
766 my $subs = join"", $self->seq_subs($scope_en);
767 $body .= ";\n$subs" if length($subs);
771 $body = $self->deparse($cv->ROOT->first, 0);
775 my $sv = $cv->const_sv;
777 # uh-oh. inlinable sub... format it differently
778 return $proto . "{ " . const($sv) . " }\n";
779 } else { # XSUB? (or just a declaration)
783 return $proto ."{\n\t$body\n\b}" ."\n";
790 local($self->{'curcv'}) = $form;
791 local($self->{'curcvlex'});
792 local($self->{'in_format'}) = 1;
793 local(@$self{qw'curstash warnings hints'})
794 = @$self{qw'curstash warnings hints'};
795 my $op = $form->ROOT;
797 return "\f." if $op->first->name eq 'stub';
798 $op = $op->first->first; # skip leavewrite, lineseq
799 while (not null $op) {
800 $op = $op->sibling; # skip nextstate
802 $kid = $op->first->sibling; # skip pushmark
803 push @text, "\f".$self->const_sv($kid)->PV;
804 $kid = $kid->sibling;
805 for (; not null $kid; $kid = $kid->sibling) {
806 push @exprs, $self->deparse($kid, 0);
808 push @text, "\f".join(", ", @exprs)."\n" if @exprs;
811 return join("", @text) . "\f.";
816 return $op->name eq "leave" || $op->name eq "scope"
817 || $op->name eq "lineseq"
818 || ($op->name eq "null" && class($op) eq "UNOP"
819 && (is_scope($op->first) || $op->first->name eq "enter"));
823 my $name = $_[0]->name;
824 return $name eq "nextstate" || $name eq "dbstate" || $name eq "setstate";
827 sub is_miniwhile { # check for one-line loop (`foo() while $y--')
829 return (!null($op) and null($op->sibling)
830 and $op->name eq "null" and class($op) eq "UNOP"
831 and (($op->first->name =~ /^(and|or)$/
832 and $op->first->first->sibling->name eq "lineseq")
833 or ($op->first->name eq "lineseq"
834 and not null $op->first->first->sibling
835 and $op->first->first->sibling->name eq "unstack")
841 return ($op->name eq "rv2sv" or
842 $op->name eq "padsv" or
843 $op->name eq "gv" or # only in array/hash constructs
844 $op->flags & OPf_KIDS && !null($op->first)
845 && $op->first->name eq "gvsv");
850 my($text, $cx, $prec) = @_;
851 if ($prec < $cx # unary ops nest just fine
852 or $prec == $cx and $cx != 4 and $cx != 16 and $cx != 21
853 or $self->{'parens'})
856 # In a unop, let parent reuse our parens; see maybe_parens_unop
857 $text = "\cS" . $text if $cx == 16;
864 # same as above, but get around the `if it looks like a function' rule
865 sub maybe_parens_unop {
867 my($name, $kid, $cx) = @_;
868 if ($cx > 16 or $self->{'parens'}) {
869 $kid = $self->deparse($kid, 1);
870 if ($name eq "umask" && $kid =~ /^\d+$/) {
871 $kid = sprintf("%#o", $kid);
873 return "$name($kid)";
875 $kid = $self->deparse($kid, 16);
876 if ($name eq "umask" && $kid =~ /^\d+$/) {
877 $kid = sprintf("%#o", $kid);
879 if (substr($kid, 0, 1) eq "\cS") {
881 return $name . substr($kid, 1);
882 } elsif (substr($kid, 0, 1) eq "(") {
883 # avoid looks-like-a-function trap with extra parens
884 # (`+' can lead to ambiguities)
885 return "$name(" . $kid . ")";
892 sub maybe_parens_func {
894 my($func, $text, $cx, $prec) = @_;
895 if ($prec <= $cx or substr($text, 0, 1) eq "(" or $self->{'parens'}) {
896 return "$func($text)";
898 return "$func $text";
904 my($op, $cx, $text) = @_;
905 my $our_intro = ($op->name =~ /^(gv|rv2)[ash]v$/) ? OPpOUR_INTRO : 0;
906 if ($op->private & (OPpLVAL_INTRO|$our_intro)
907 and not $self->{'avoid_local'}{$$op}) {
908 my $our_local = ($op->private & OPpLVAL_INTRO) ? "local" : "our";
909 if (want_scalar($op)) {
910 return "$our_local $text";
912 return $self->maybe_parens_func("$our_local", $text, $cx, 16);
921 my($op, $cx, $func, @args) = @_;
922 if ($op->private & OPpTARGET_MY) {
923 my $var = $self->padname($op->targ);
924 my $val = $func->($self, $op, 7, @args);
925 return $self->maybe_parens("$var = $val", $cx, 7);
927 return $func->($self, $op, $cx, @args);
934 return (($self->{'curcv'}->PADLIST->ARRAY)[0]->ARRAY)[$targ];
939 my($op, $cx, $text) = @_;
940 if ($op->private & OPpLVAL_INTRO and not $self->{'avoid_local'}{$$op}) {
941 if (want_scalar($op)) {
944 return $self->maybe_parens_func("my", $text, $cx, 16);
951 # The following OPs don't have functions:
953 # pp_padany -- does not exist after parsing
956 if ($AUTOLOAD =~ s/^.*::pp_//) {
957 warn "unexpected OP_".uc $AUTOLOAD;
960 die "Undefined subroutine $AUTOLOAD called";
964 # $root should be the op which represents the root of whatever
965 # we're sequencing here. If it's undefined, then we don't append
966 # any subroutine declarations to the deparsed ops, otherwise we
967 # append appropriate declarations.
969 my($self, $root, @ops) = @_;
972 my $out_cop = $self->{'curcop'};
973 my $out_seq = defined($out_cop) ? $out_cop->cop_seq : undef;
976 $limit_seq = $out_seq;
977 my $nseq = $self->find_scope_st($root->sibling) if ${$root->sibling};
978 $limit_seq = $nseq if !defined($limit_seq)
979 or defined($nseq) && $nseq < $limit_seq;
981 $limit_seq = $self->{'limit_seq'}
982 if defined($self->{'limit_seq'})
983 && (!defined($limit_seq) || $self->{'limit_seq'} < $limit_seq);
984 local $self->{'limit_seq'} = $limit_seq;
985 for (my $i = 0; $i < @ops; $i++) {
987 if (is_state $ops[$i]) {
988 $expr = $self->deparse($ops[$i], 0);
995 if (!is_state $ops[$i] and (my $ls = $ops[$i+1]) and
996 !null($ops[$i+1]) and $ops[$i+1]->name eq "lineseq")
998 if ($ls->first && !null($ls->first) && is_state($ls->first)
999 && (my $sib = $ls->first->sibling)) {
1000 if (!null($sib) && $sib->name eq "leaveloop") {
1001 push @exprs, $expr . $self->for_loop($ops[$i], 0);
1007 $expr .= $self->deparse($ops[$i], 0, (@ops != 1));
1008 $expr =~ s/;\n?\z//;
1011 my $body = join(";\n", grep {length} @exprs);
1013 if (defined $root && defined $limit_seq && !$self->{'in_format'}) {
1014 $subs = join "\n", $self->seq_subs($limit_seq);
1016 return join(";\n", grep {length} $body, $subs);
1020 my($real_block, $self, $op, $cx, $flags) = @_;
1024 local(@$self{qw'curstash warnings hints'})
1025 = @$self{qw'curstash warnings hints'} if $real_block;
1027 $kid = $op->first->sibling; # skip enter
1028 if (is_miniwhile($kid)) {
1029 my $top = $kid->first;
1030 my $name = $top->name;
1031 if ($name eq "and") {
1033 } elsif ($name eq "or") {
1035 } else { # no conditional -> while 1 or until 0
1036 return $self->deparse($top->first, 1) . " while 1";
1038 my $cond = $top->first;
1039 my $body = $cond->sibling->first; # skip lineseq
1040 $cond = $self->deparse($cond, 1);
1041 $body = $self->deparse($body, 1);
1042 return "$body $name $cond";
1047 for (; !null($kid); $kid = $kid->sibling) {
1050 if ($flags || $cx > 0) { # inside an expression, (a do {} while for lineseq)
1051 return "do {\n\t" . $self->lineseq($op, @kids) . "\n\b}";
1053 my $lineseq = $self->lineseq($op, @kids);
1054 return (length ($lineseq) ? "$lineseq;" : "");
1058 sub pp_scope { scopeop(0, @_); }
1059 sub pp_lineseq { scopeop(0, @_); }
1060 sub pp_leave { scopeop(1, @_); }
1062 # The BEGIN {} is used here because otherwise this code isn't executed
1063 # when you run B::Deparse on itself.
1065 BEGIN { map($globalnames{$_}++, "SIG", "STDIN", "STDOUT", "STDERR", "INC",
1066 "ENV", "ARGV", "ARGVOUT", "_"); }
1071 Carp::confess() if $gv->isa("B::CV");
1072 my $stash = $gv->STASH->NAME;
1073 my $name = $gv->SAFENAME;
1074 if ($stash eq $self->{'curstash'} or $globalnames{$name}
1075 or $name =~ /^[^A-Za-z_]/)
1079 $stash = $stash . "::";
1081 if ($name =~ /^(\^..|{)/) {
1082 $name = "{$name}"; # ${^WARNING_BITS}, etc and ${
1084 return $stash . $name;
1087 # Return the name to use for a stash variable.
1088 # If a lexical with the same name is in scope, it may need to be
1090 sub stash_variable {
1091 my ($self, $prefix, $name) = @_;
1093 return "$prefix$name" if $name =~ /::/;
1095 unless ($prefix eq '$' || $prefix eq '@' ||
1096 $prefix eq '%' || $prefix eq '$#') {
1097 return "$prefix$name";
1100 my $v = ($prefix eq '$#' ? '@' : $prefix) . $name;
1101 return $prefix .$self->{'curstash'}.'::'. $name if $self->lex_in_scope($v);
1102 return "$prefix$name";
1106 my ($self, $name) = @_;
1107 $self->populate_curcvlex() if !defined $self->{'curcvlex'};
1109 return 0 if !defined($self->{'curcop'});
1110 my $seq = $self->{'curcop'}->cop_seq;
1111 return 0 if !exists $self->{'curcvlex'}{$name};
1112 for my $a (@{$self->{'curcvlex'}{$name}}) {
1113 my ($st, $en) = @$a;
1114 return 1 if $seq > $st && $seq <= $en;
1119 sub populate_curcvlex {
1121 for (my $cv = $self->{'curcv'}; class($cv) eq "CV"; $cv = $cv->OUTSIDE) {
1122 my @padlist = $cv->PADLIST->ARRAY;
1123 my @ns = $padlist[0]->ARRAY;
1125 for (my $i=0; $i<@ns; ++$i) {
1126 next if class($ns[$i]) eq "SPECIAL";
1127 next if $ns[$i]->FLAGS & SVpad_OUR; # Skip "our" vars
1128 if (class($ns[$i]) eq "PV") {
1129 # Probably that pesky lexical @_
1132 my $name = $ns[$i]->PVX;
1133 my $seq_st = $ns[$i]->NVX;
1134 my $seq_en = int($ns[$i]->IVX);
1136 push @{$self->{'curcvlex'}{$name}}, [$seq_st, $seq_en];
1141 sub find_scope_st { ((find_scope(@_))[0]); }
1142 sub find_scope_en { ((find_scope(@_))[1]); }
1144 # Recurses down the tree, looking for pad variable introductions and COPs
1146 my ($self, $op, $scope_st, $scope_en) = @_;
1147 carp("Undefined op in find_scope") if !defined $op;
1148 return ($scope_st, $scope_en) unless $op->flags & OPf_KIDS;
1150 for (my $o=$op->first; $$o; $o=$o->sibling) {
1151 if ($o->name =~ /^pad.v$/ && $o->private & OPpLVAL_INTRO) {
1152 my $s = int($self->padname_sv($o->targ)->NVX);
1153 my $e = $self->padname_sv($o->targ)->IVX;
1154 $scope_st = $s if !defined($scope_st) || $s < $scope_st;
1155 $scope_en = $e if !defined($scope_en) || $e > $scope_en;
1157 elsif (is_state($o)) {
1158 my $c = $o->cop_seq;
1159 $scope_st = $c if !defined($scope_st) || $c < $scope_st;
1160 $scope_en = $c if !defined($scope_en) || $c > $scope_en;
1162 elsif ($o->flags & OPf_KIDS) {
1163 ($scope_st, $scope_en) =
1164 $self->find_scope($o, $scope_st, $scope_en)
1168 return ($scope_st, $scope_en);
1171 # Returns a list of subs which should be inserted before the COP
1173 my ($self, $op, $out_seq) = @_;
1174 my $seq = $op->cop_seq;
1175 # If we have nephews, then our sequence number indicates
1176 # the cop_seq of the end of some sort of scope.
1177 if (class($op->sibling) ne "NULL" && $op->sibling->flags & OPf_KIDS
1178 and my $nseq = $self->find_scope_st($op->sibling) ) {
1181 $seq = $out_seq if defined($out_seq) && $out_seq < $seq;
1182 return $self->seq_subs($seq);
1186 my ($self, $seq) = @_;
1188 #push @text, "# ($seq)\n";
1190 return "" if !defined $seq;
1191 while (scalar(@{$self->{'subs_todo'}})
1192 and $seq > $self->{'subs_todo'}[0][0]) {
1193 push @text, $self->next_todo;
1198 # Notice how subs and formats are inserted between statements here;
1199 # also $[ assignments and pragmas.
1203 $self->{'curcop'} = $op;
1205 push @text, $self->cop_subs($op);
1206 push @text, $op->label . ": " if $op->label;
1207 my $stash = $op->stashpv;
1208 if ($stash ne $self->{'curstash'}) {
1209 push @text, "package $stash;\n";
1210 $self->{'curstash'} = $stash;
1212 if ($self->{'linenums'}) {
1213 push @text, "\f#line " . $op->line .
1214 ' "' . $op->file, qq'"\n';
1217 if ($self->{'arybase'} != $op->arybase) {
1218 push @text, '$[ = '. $op->arybase .";\n";
1219 $self->{'arybase'} = $op->arybase;
1222 my $warnings = $op->warnings;
1224 if ($warnings->isa("B::SPECIAL") && $$warnings == 4) {
1225 $warning_bits = $warnings::Bits{"all"} & WARN_MASK;
1227 elsif ($warnings->isa("B::SPECIAL") && $$warnings == 5) {
1228 $warning_bits = $warnings::NONE;
1230 elsif ($warnings->isa("B::SPECIAL")) {
1231 $warning_bits = undef;
1234 $warning_bits = $warnings->PV & WARN_MASK;
1237 if (defined ($warning_bits) and
1238 !defined($self->{warnings}) || $self->{'warnings'} ne $warning_bits) {
1239 push @text, declare_warnings($self->{'warnings'}, $warning_bits);
1240 $self->{'warnings'} = $warning_bits;
1243 if ($self->{'hints'} != $op->private) {
1244 push @text, declare_hints($self->{'hints'}, $op->private);
1245 $self->{'hints'} = $op->private;
1248 return join("", @text);
1251 sub declare_warnings {
1252 my ($from, $to) = @_;
1253 if (($to & WARN_MASK) eq warnings::bits("all")) {
1254 return "use warnings;\n";
1256 elsif (($to & WARN_MASK) eq "\0"x length($to)) {
1257 return "no warnings;\n";
1259 return "BEGIN {\${^WARNING_BITS} = ".cstring($to)."}\n";
1263 my ($from, $to) = @_;
1264 my $use = $to & ~$from;
1265 my $no = $from & ~$to;
1267 for my $pragma (hint_pragmas($use)) {
1268 $decls .= "use $pragma;\n";
1270 for my $pragma (hint_pragmas($no)) {
1271 $decls .= "no $pragma;\n";
1279 push @pragmas, "integer" if $bits & 0x1;
1280 push @pragmas, "strict 'refs'" if $bits & 0x2;
1281 push @pragmas, "bytes" if $bits & 0x8;
1285 sub pp_dbstate { pp_nextstate(@_) }
1286 sub pp_setstate { pp_nextstate(@_) }
1288 sub pp_unstack { return "" } # see also leaveloop
1292 my($op, $cx, $name) = @_;
1298 my($op, $cx, $name) = @_;
1306 sub pp_wantarray { baseop(@_, "wantarray") }
1307 sub pp_fork { baseop(@_, "fork") }
1308 sub pp_wait { maybe_targmy(@_, \&baseop, "wait") }
1309 sub pp_getppid { maybe_targmy(@_, \&baseop, "getppid") }
1310 sub pp_time { maybe_targmy(@_, \&baseop, "time") }
1311 sub pp_tms { baseop(@_, "times") }
1312 sub pp_ghostent { baseop(@_, "gethostent") }
1313 sub pp_gnetent { baseop(@_, "getnetent") }
1314 sub pp_gprotoent { baseop(@_, "getprotoent") }
1315 sub pp_gservent { baseop(@_, "getservent") }
1316 sub pp_ehostent { baseop(@_, "endhostent") }
1317 sub pp_enetent { baseop(@_, "endnetent") }
1318 sub pp_eprotoent { baseop(@_, "endprotoent") }
1319 sub pp_eservent { baseop(@_, "endservent") }
1320 sub pp_gpwent { baseop(@_, "getpwent") }
1321 sub pp_spwent { baseop(@_, "setpwent") }
1322 sub pp_epwent { baseop(@_, "endpwent") }
1323 sub pp_ggrent { baseop(@_, "getgrent") }
1324 sub pp_sgrent { baseop(@_, "setgrent") }
1325 sub pp_egrent { baseop(@_, "endgrent") }
1326 sub pp_getlogin { baseop(@_, "getlogin") }
1328 sub POSTFIX () { 1 }
1330 # I couldn't think of a good short name, but this is the category of
1331 # symbolic unary operators with interesting precedence
1335 my($op, $cx, $name, $prec, $flags) = (@_, 0);
1336 my $kid = $op->first;
1337 $kid = $self->deparse($kid, $prec);
1338 return $self->maybe_parens(($flags & POSTFIX) ? "$kid$name" : "$name$kid",
1342 sub pp_preinc { pfixop(@_, "++", 23) }
1343 sub pp_predec { pfixop(@_, "--", 23) }
1344 sub pp_postinc { maybe_targmy(@_, \&pfixop, "++", 23, POSTFIX) }
1345 sub pp_postdec { maybe_targmy(@_, \&pfixop, "--", 23, POSTFIX) }
1346 sub pp_i_preinc { pfixop(@_, "++", 23) }
1347 sub pp_i_predec { pfixop(@_, "--", 23) }
1348 sub pp_i_postinc { maybe_targmy(@_, \&pfixop, "++", 23, POSTFIX) }
1349 sub pp_i_postdec { maybe_targmy(@_, \&pfixop, "--", 23, POSTFIX) }
1350 sub pp_complement { maybe_targmy(@_, \&pfixop, "~", 21) }
1352 sub pp_negate { maybe_targmy(@_, \&real_negate) }
1356 if ($op->first->name =~ /^(i_)?negate$/) {
1358 $self->pfixop($op, $cx, "-", 21.5);
1360 $self->pfixop($op, $cx, "-", 21);
1363 sub pp_i_negate { pp_negate(@_) }
1369 $self->pfixop($op, $cx, "not ", 4);
1371 $self->pfixop($op, $cx, "!", 21);
1377 my($op, $cx, $name) = @_;
1379 if ($op->flags & OPf_KIDS) {
1381 if (defined prototype("CORE::$name")
1382 && prototype("CORE::$name") =~ /^;?\*/
1383 && $kid->name eq "rv2gv") {
1387 return $self->maybe_parens_unop($name, $kid, $cx);
1389 return $name . ($op->flags & OPf_SPECIAL ? "()" : "");
1393 sub pp_chop { maybe_targmy(@_, \&unop, "chop") }
1394 sub pp_chomp { maybe_targmy(@_, \&unop, "chomp") }
1395 sub pp_schop { maybe_targmy(@_, \&unop, "chop") }
1396 sub pp_schomp { maybe_targmy(@_, \&unop, "chomp") }
1397 sub pp_defined { unop(@_, "defined") }
1398 sub pp_undef { unop(@_, "undef") }
1399 sub pp_study { unop(@_, "study") }
1400 sub pp_ref { unop(@_, "ref") }
1401 sub pp_pos { maybe_local(@_, unop(@_, "pos")) }
1403 sub pp_sin { maybe_targmy(@_, \&unop, "sin") }
1404 sub pp_cos { maybe_targmy(@_, \&unop, "cos") }
1405 sub pp_rand { maybe_targmy(@_, \&unop, "rand") }
1406 sub pp_srand { unop(@_, "srand") }
1407 sub pp_exp { maybe_targmy(@_, \&unop, "exp") }
1408 sub pp_log { maybe_targmy(@_, \&unop, "log") }
1409 sub pp_sqrt { maybe_targmy(@_, \&unop, "sqrt") }
1410 sub pp_int { maybe_targmy(@_, \&unop, "int") }
1411 sub pp_hex { maybe_targmy(@_, \&unop, "hex") }
1412 sub pp_oct { maybe_targmy(@_, \&unop, "oct") }
1413 sub pp_abs { maybe_targmy(@_, \&unop, "abs") }
1415 sub pp_length { maybe_targmy(@_, \&unop, "length") }
1416 sub pp_ord { maybe_targmy(@_, \&unop, "ord") }
1417 sub pp_chr { maybe_targmy(@_, \&unop, "chr") }
1419 sub pp_each { unop(@_, "each") }
1420 sub pp_values { unop(@_, "values") }
1421 sub pp_keys { unop(@_, "keys") }
1422 sub pp_pop { unop(@_, "pop") }
1423 sub pp_shift { unop(@_, "shift") }
1425 sub pp_caller { unop(@_, "caller") }
1426 sub pp_reset { unop(@_, "reset") }
1427 sub pp_exit { unop(@_, "exit") }
1428 sub pp_prototype { unop(@_, "prototype") }
1430 sub pp_close { unop(@_, "close") }
1431 sub pp_fileno { unop(@_, "fileno") }
1432 sub pp_umask { unop(@_, "umask") }
1433 sub pp_untie { unop(@_, "untie") }
1434 sub pp_tied { unop(@_, "tied") }
1435 sub pp_dbmclose { unop(@_, "dbmclose") }
1436 sub pp_getc { unop(@_, "getc") }
1437 sub pp_eof { unop(@_, "eof") }
1438 sub pp_tell { unop(@_, "tell") }
1439 sub pp_getsockname { unop(@_, "getsockname") }
1440 sub pp_getpeername { unop(@_, "getpeername") }
1442 sub pp_chdir { maybe_targmy(@_, \&unop, "chdir") }
1443 sub pp_chroot { maybe_targmy(@_, \&unop, "chroot") }
1444 sub pp_readlink { unop(@_, "readlink") }
1445 sub pp_rmdir { maybe_targmy(@_, \&unop, "rmdir") }
1446 sub pp_readdir { unop(@_, "readdir") }
1447 sub pp_telldir { unop(@_, "telldir") }
1448 sub pp_rewinddir { unop(@_, "rewinddir") }
1449 sub pp_closedir { unop(@_, "closedir") }
1450 sub pp_getpgrp { maybe_targmy(@_, \&unop, "getpgrp") }
1451 sub pp_localtime { unop(@_, "localtime") }
1452 sub pp_gmtime { unop(@_, "gmtime") }
1453 sub pp_alarm { unop(@_, "alarm") }
1454 sub pp_sleep { maybe_targmy(@_, \&unop, "sleep") }
1456 sub pp_dofile { unop(@_, "do") }
1457 sub pp_entereval { unop(@_, "eval") }
1459 sub pp_ghbyname { unop(@_, "gethostbyname") }
1460 sub pp_gnbyname { unop(@_, "getnetbyname") }
1461 sub pp_gpbyname { unop(@_, "getprotobyname") }
1462 sub pp_shostent { unop(@_, "sethostent") }
1463 sub pp_snetent { unop(@_, "setnetent") }
1464 sub pp_sprotoent { unop(@_, "setprotoent") }
1465 sub pp_sservent { unop(@_, "setservent") }
1466 sub pp_gpwnam { unop(@_, "getpwnam") }
1467 sub pp_gpwuid { unop(@_, "getpwuid") }
1468 sub pp_ggrnam { unop(@_, "getgrnam") }
1469 sub pp_ggrgid { unop(@_, "getgrgid") }
1471 sub pp_lock { unop(@_, "lock") }
1477 if ($op->private & OPpEXISTS_SUB) {
1478 # Checking for the existence of a subroutine
1479 return $self->maybe_parens_func("exists",
1480 $self->pp_rv2cv($op->first, 16), $cx, 16);
1482 if ($op->flags & OPf_SPECIAL) {
1483 # Array element, not hash element
1484 return $self->maybe_parens_func("exists",
1485 $self->pp_aelem($op->first, 16), $cx, 16);
1487 return $self->maybe_parens_func("exists", $self->pp_helem($op->first, 16),
1495 if ($op->private & OPpSLICE) {
1496 if ($op->flags & OPf_SPECIAL) {
1497 # Deleting from an array, not a hash
1498 return $self->maybe_parens_func("delete",
1499 $self->pp_aslice($op->first, 16),
1502 return $self->maybe_parens_func("delete",
1503 $self->pp_hslice($op->first, 16),
1506 if ($op->flags & OPf_SPECIAL) {
1507 # Deleting from an array, not a hash
1508 return $self->maybe_parens_func("delete",
1509 $self->pp_aelem($op->first, 16),
1512 return $self->maybe_parens_func("delete",
1513 $self->pp_helem($op->first, 16),
1521 if (class($op) eq "UNOP" and $op->first->name eq "const"
1522 and $op->first->private & OPpCONST_BARE)
1524 my $name = $self->const_sv($op->first)->PV;
1527 return "require $name";
1529 $self->unop($op, $cx, "require");
1536 my $kid = $op->first;
1537 if (not null $kid->sibling) {
1538 # XXX Was a here-doc
1539 return $self->dquote($op);
1541 $self->unop(@_, "scalar");
1548 return (($self->{'curcv'}->PADLIST->ARRAY)[1]->ARRAY)[$targ];
1554 my $kid = $op->first;
1555 if ($kid->name eq "null") {
1557 if ($kid->name eq "anonlist" || $kid->name eq "anonhash") {
1558 my($pre, $post) = @{{"anonlist" => ["[","]"],
1559 "anonhash" => ["{","}"]}->{$kid->name}};
1561 $kid = $kid->first->sibling; # skip pushmark
1562 for (; !null($kid); $kid = $kid->sibling) {
1563 $expr = $self->deparse($kid, 6);
1566 return $pre . join(", ", @exprs) . $post;
1567 } elsif (!null($kid->sibling) and
1568 $kid->sibling->name eq "anoncode") {
1570 $self->deparse_sub($self->padval($kid->sibling->targ));
1571 } elsif ($kid->name eq "pushmark") {
1572 my $sib_name = $kid->sibling->name;
1573 if ($sib_name =~ /^(pad|rv2)[ah]v$/
1574 and not $kid->sibling->flags & OPf_REF)
1576 # The @a in \(@a) isn't in ref context, but only when the
1578 return "\\(" . $self->deparse($kid->sibling, 1) . ")";
1579 } elsif ($sib_name eq 'entersub') {
1580 my $text = $self->deparse($kid->sibling, 1);
1581 # Always show parens for \(&func()), but only with -p otherwise
1582 $text = "($text)" if $self->{'parens'}
1583 or $kid->sibling->private & OPpENTERSUB_AMPER;
1588 $self->pfixop($op, $cx, "\\", 20);
1591 sub pp_srefgen { pp_refgen(@_) }
1596 my $kid = $op->first;
1597 $kid = $kid->first if $kid->name eq "rv2gv"; # <$fh>
1598 return "<" . $self->deparse($kid, 1) . ">" if is_scalar($kid);
1599 return $self->unop($op, $cx, "readline");
1605 return "<" . $self->gv_name($op->gv) . ">";
1608 # Unary operators that can occur as pseudo-listops inside double quotes
1611 my($op, $cx, $name, $prec, $flags) = (@_, 0, 0);
1613 if ($op->flags & OPf_KIDS) {
1615 # If there's more than one kid, the first is an ex-pushmark.
1616 $kid = $kid->sibling if not null $kid->sibling;
1617 return $self->maybe_parens_unop($name, $kid, $cx);
1619 return $name . ($op->flags & OPf_SPECIAL ? "()" : "");
1623 sub pp_ucfirst { dq_unop(@_, "ucfirst") }
1624 sub pp_lcfirst { dq_unop(@_, "lcfirst") }
1625 sub pp_uc { dq_unop(@_, "uc") }
1626 sub pp_lc { dq_unop(@_, "lc") }
1627 sub pp_quotemeta { maybe_targmy(@_, \&dq_unop, "quotemeta") }
1631 my ($op, $cx, $name) = @_;
1632 if (class($op) eq "PVOP") {
1633 return "$name " . $op->pv;
1634 } elsif (class($op) eq "OP") {
1636 } elsif (class($op) eq "UNOP") {
1637 # Note -- loop exits are actually exempt from the
1638 # looks-like-a-func rule, but a few extra parens won't hurt
1639 return $self->maybe_parens_unop($name, $op->first, $cx);
1643 sub pp_last { loopex(@_, "last") }
1644 sub pp_next { loopex(@_, "next") }
1645 sub pp_redo { loopex(@_, "redo") }
1646 sub pp_goto { loopex(@_, "goto") }
1647 sub pp_dump { loopex(@_, "dump") }
1651 my($op, $cx, $name) = @_;
1652 if (class($op) eq "UNOP") {
1653 # Genuine `-X' filetests are exempt from the LLAFR, but not
1654 # l?stat(); for the sake of clarity, give'em all parens
1655 return $self->maybe_parens_unop($name, $op->first, $cx);
1656 } elsif (class($op) eq "SVOP") {
1657 return $self->maybe_parens_func($name, $self->pp_gv($op, 1), $cx, 16);
1658 } else { # I don't think baseop filetests ever survive ck_ftst, but...
1663 sub pp_lstat { ftst(@_, "lstat") }
1664 sub pp_stat { ftst(@_, "stat") }
1665 sub pp_ftrread { ftst(@_, "-R") }
1666 sub pp_ftrwrite { ftst(@_, "-W") }
1667 sub pp_ftrexec { ftst(@_, "-X") }
1668 sub pp_fteread { ftst(@_, "-r") }
1669 sub pp_ftewrite { ftst(@_, "-w") }
1670 sub pp_fteexec { ftst(@_, "-x") }
1671 sub pp_ftis { ftst(@_, "-e") }
1672 sub pp_fteowned { ftst(@_, "-O") }
1673 sub pp_ftrowned { ftst(@_, "-o") }
1674 sub pp_ftzero { ftst(@_, "-z") }
1675 sub pp_ftsize { ftst(@_, "-s") }
1676 sub pp_ftmtime { ftst(@_, "-M") }
1677 sub pp_ftatime { ftst(@_, "-A") }
1678 sub pp_ftctime { ftst(@_, "-C") }
1679 sub pp_ftsock { ftst(@_, "-S") }
1680 sub pp_ftchr { ftst(@_, "-c") }
1681 sub pp_ftblk { ftst(@_, "-b") }
1682 sub pp_ftfile { ftst(@_, "-f") }
1683 sub pp_ftdir { ftst(@_, "-d") }
1684 sub pp_ftpipe { ftst(@_, "-p") }
1685 sub pp_ftlink { ftst(@_, "-l") }
1686 sub pp_ftsuid { ftst(@_, "-u") }
1687 sub pp_ftsgid { ftst(@_, "-g") }
1688 sub pp_ftsvtx { ftst(@_, "-k") }
1689 sub pp_fttty { ftst(@_, "-t") }
1690 sub pp_fttext { ftst(@_, "-T") }
1691 sub pp_ftbinary { ftst(@_, "-B") }
1693 sub SWAP_CHILDREN () { 1 }
1694 sub ASSIGN () { 2 } # has OP= variant
1695 sub LIST_CONTEXT () { 4 } # Assignment is in list context
1701 my $name = $op->name;
1702 if ($name eq "concat" and $op->first->name eq "concat") {
1703 # avoid spurious `=' -- see comment in pp_concat
1706 if ($name eq "null" and class($op) eq "UNOP"
1707 and $op->first->name =~ /^(and|x?or)$/
1708 and null $op->first->sibling)
1710 # Like all conditional constructs, OP_ANDs and OP_ORs are topped
1711 # with a null that's used as the common end point of the two
1712 # flows of control. For precedence purposes, ignore it.
1713 # (COND_EXPRs have these too, but we don't bother with
1714 # their associativity).
1715 return assoc_class($op->first);
1717 return $name . ($op->flags & OPf_STACKED ? "=" : "");
1720 # Left associative operators, like `+', for which
1721 # $a + $b + $c is equivalent to ($a + $b) + $c
1724 %left = ('multiply' => 19, 'i_multiply' => 19,
1725 'divide' => 19, 'i_divide' => 19,
1726 'modulo' => 19, 'i_modulo' => 19,
1728 'add' => 18, 'i_add' => 18,
1729 'subtract' => 18, 'i_subtract' => 18,
1731 'left_shift' => 17, 'right_shift' => 17,
1733 'bit_or' => 12, 'bit_xor' => 12,
1735 'or' => 2, 'xor' => 2,
1739 sub deparse_binop_left {
1741 my($op, $left, $prec) = @_;
1742 if ($left{assoc_class($op)} && $left{assoc_class($left)}
1743 and $left{assoc_class($op)} == $left{assoc_class($left)})
1745 return $self->deparse($left, $prec - .00001);
1747 return $self->deparse($left, $prec);
1751 # Right associative operators, like `=', for which
1752 # $a = $b = $c is equivalent to $a = ($b = $c)
1755 %right = ('pow' => 22,
1756 'sassign=' => 7, 'aassign=' => 7,
1757 'multiply=' => 7, 'i_multiply=' => 7,
1758 'divide=' => 7, 'i_divide=' => 7,
1759 'modulo=' => 7, 'i_modulo=' => 7,
1761 'add=' => 7, 'i_add=' => 7,
1762 'subtract=' => 7, 'i_subtract=' => 7,
1764 'left_shift=' => 7, 'right_shift=' => 7,
1766 'bit_or=' => 7, 'bit_xor=' => 7,
1772 sub deparse_binop_right {
1774 my($op, $right, $prec) = @_;
1775 if ($right{assoc_class($op)} && $right{assoc_class($right)}
1776 and $right{assoc_class($op)} == $right{assoc_class($right)})
1778 return $self->deparse($right, $prec - .00001);
1780 return $self->deparse($right, $prec);
1786 my ($op, $cx, $opname, $prec, $flags) = (@_, 0);
1787 my $left = $op->first;
1788 my $right = $op->last;
1790 if ($op->flags & OPf_STACKED && $flags & ASSIGN) {
1794 if ($flags & SWAP_CHILDREN) {
1795 ($left, $right) = ($right, $left);
1797 $left = $self->deparse_binop_left($op, $left, $prec);
1798 $left = "($left)" if $flags & LIST_CONTEXT
1799 && $left !~ /^(my|our|local|)[\@\(]/;
1800 $right = $self->deparse_binop_right($op, $right, $prec);
1801 return $self->maybe_parens("$left $opname$eq $right", $cx, $prec);
1804 sub pp_add { maybe_targmy(@_, \&binop, "+", 18, ASSIGN) }
1805 sub pp_multiply { maybe_targmy(@_, \&binop, "*", 19, ASSIGN) }
1806 sub pp_subtract { maybe_targmy(@_, \&binop, "-",18, ASSIGN) }
1807 sub pp_divide { maybe_targmy(@_, \&binop, "/", 19, ASSIGN) }
1808 sub pp_modulo { maybe_targmy(@_, \&binop, "%", 19, ASSIGN) }
1809 sub pp_i_add { maybe_targmy(@_, \&binop, "+", 18, ASSIGN) }
1810 sub pp_i_multiply { maybe_targmy(@_, \&binop, "*", 19, ASSIGN) }
1811 sub pp_i_subtract { maybe_targmy(@_, \&binop, "-", 18, ASSIGN) }
1812 sub pp_i_divide { maybe_targmy(@_, \&binop, "/", 19, ASSIGN) }
1813 sub pp_i_modulo { maybe_targmy(@_, \&binop, "%", 19, ASSIGN) }
1814 sub pp_pow { maybe_targmy(@_, \&binop, "**", 22, ASSIGN) }
1816 sub pp_left_shift { maybe_targmy(@_, \&binop, "<<", 17, ASSIGN) }
1817 sub pp_right_shift { maybe_targmy(@_, \&binop, ">>", 17, ASSIGN) }
1818 sub pp_bit_and { maybe_targmy(@_, \&binop, "&", 13, ASSIGN) }
1819 sub pp_bit_or { maybe_targmy(@_, \&binop, "|", 12, ASSIGN) }
1820 sub pp_bit_xor { maybe_targmy(@_, \&binop, "^", 12, ASSIGN) }
1822 sub pp_eq { binop(@_, "==", 14) }
1823 sub pp_ne { binop(@_, "!=", 14) }
1824 sub pp_lt { binop(@_, "<", 15) }
1825 sub pp_gt { binop(@_, ">", 15) }
1826 sub pp_ge { binop(@_, ">=", 15) }
1827 sub pp_le { binop(@_, "<=", 15) }
1828 sub pp_ncmp { binop(@_, "<=>", 14) }
1829 sub pp_i_eq { binop(@_, "==", 14) }
1830 sub pp_i_ne { binop(@_, "!=", 14) }
1831 sub pp_i_lt { binop(@_, "<", 15) }
1832 sub pp_i_gt { binop(@_, ">", 15) }
1833 sub pp_i_ge { binop(@_, ">=", 15) }
1834 sub pp_i_le { binop(@_, "<=", 15) }
1835 sub pp_i_ncmp { binop(@_, "<=>", 14) }
1837 sub pp_seq { binop(@_, "eq", 14) }
1838 sub pp_sne { binop(@_, "ne", 14) }
1839 sub pp_slt { binop(@_, "lt", 15) }
1840 sub pp_sgt { binop(@_, "gt", 15) }
1841 sub pp_sge { binop(@_, "ge", 15) }
1842 sub pp_sle { binop(@_, "le", 15) }
1843 sub pp_scmp { binop(@_, "cmp", 14) }
1845 sub pp_sassign { binop(@_, "=", 7, SWAP_CHILDREN) }
1846 sub pp_aassign { binop(@_, "=", 7, SWAP_CHILDREN | LIST_CONTEXT) }
1848 # `.' is special because concats-of-concats are optimized to save copying
1849 # by making all but the first concat stacked. The effect is as if the
1850 # programmer had written `($a . $b) .= $c', except legal.
1851 sub pp_concat { maybe_targmy(@_, \&real_concat) }
1855 my $left = $op->first;
1856 my $right = $op->last;
1859 if ($op->flags & OPf_STACKED and $op->first->name ne "concat") {
1863 $left = $self->deparse_binop_left($op, $left, $prec);
1864 $right = $self->deparse_binop_right($op, $right, $prec);
1865 return $self->maybe_parens("$left .$eq $right", $cx, $prec);
1868 # `x' is weird when the left arg is a list
1872 my $left = $op->first;
1873 my $right = $op->last;
1876 if ($op->flags & OPf_STACKED) {
1880 if (null($right)) { # list repeat; count is inside left-side ex-list
1881 my $kid = $left->first->sibling; # skip pushmark
1883 for (; !null($kid->sibling); $kid = $kid->sibling) {
1884 push @exprs, $self->deparse($kid, 6);
1887 $left = "(" . join(", ", @exprs). ")";
1889 $left = $self->deparse_binop_left($op, $left, $prec);
1891 $right = $self->deparse_binop_right($op, $right, $prec);
1892 return $self->maybe_parens("$left x$eq $right", $cx, $prec);
1897 my ($op, $cx, $type) = @_;
1898 my $left = $op->first;
1899 my $right = $left->sibling;
1900 $left = $self->deparse($left, 9);
1901 $right = $self->deparse($right, 9);
1902 return $self->maybe_parens("$left $type $right", $cx, 9);
1908 my $flip = $op->first;
1909 my $type = ($flip->flags & OPf_SPECIAL) ? "..." : "..";
1910 return $self->range($flip->first, $cx, $type);
1913 # one-line while/until is handled in pp_leave
1917 my ($op, $cx, $lowop, $lowprec, $highop, $highprec, $blockname) = @_;
1918 my $left = $op->first;
1919 my $right = $op->first->sibling;
1920 if ($cx == 0 and is_scope($right) and $blockname
1921 and $self->{'expand'} < 7)
1923 $left = $self->deparse($left, 1);
1924 $right = $self->deparse($right, 0);
1925 return "$blockname ($left) {\n\t$right\n\b}\cK";
1926 } elsif ($cx == 0 and $blockname and not $self->{'parens'}
1927 and $self->{'expand'} < 7) { # $b if $a
1928 $right = $self->deparse($right, 1);
1929 $left = $self->deparse($left, 1);
1930 return "$right $blockname $left";
1931 } elsif ($cx > $lowprec and $highop) { # $a && $b
1932 $left = $self->deparse_binop_left($op, $left, $highprec);
1933 $right = $self->deparse_binop_right($op, $right, $highprec);
1934 return $self->maybe_parens("$left $highop $right", $cx, $highprec);
1935 } else { # $a and $b
1936 $left = $self->deparse_binop_left($op, $left, $lowprec);
1937 $right = $self->deparse_binop_right($op, $right, $lowprec);
1938 return $self->maybe_parens("$left $lowop $right", $cx, $lowprec);
1942 sub pp_and { logop(@_, "and", 3, "&&", 11, "if") }
1943 sub pp_or { logop(@_, "or", 2, "||", 10, "unless") }
1945 # xor is syntactically a logop, but it's really a binop (contrary to
1946 # old versions of opcode.pl). Syntax is what matters here.
1947 sub pp_xor { logop(@_, "xor", 2, "", 0, "") }
1951 my ($op, $cx, $opname) = @_;
1952 my $left = $op->first;
1953 my $right = $op->first->sibling->first; # skip sassign
1954 $left = $self->deparse($left, 7);
1955 $right = $self->deparse($right, 7);
1956 return $self->maybe_parens("$left $opname $right", $cx, 7);
1959 sub pp_andassign { logassignop(@_, "&&=") }
1960 sub pp_orassign { logassignop(@_, "||=") }
1964 my($op, $cx, $name) = @_;
1966 my $parens = ($cx >= 5) || $self->{'parens'};
1967 my $kid = $op->first->sibling;
1968 return $name if null $kid;
1970 if (defined prototype("CORE::$name")
1971 && prototype("CORE::$name") =~ /^;?\*/
1972 && $kid->name eq "rv2gv") {
1973 $first = $self->deparse($kid->first, 6);
1976 $first = $self->deparse($kid, 6);
1978 if ($name eq "chmod" && $first =~ /^\d+$/) {
1979 $first = sprintf("%#o", $first);
1981 $first = "+$first" if not $parens and substr($first, 0, 1) eq "(";
1982 push @exprs, $first;
1983 $kid = $kid->sibling;
1984 for (; !null($kid); $kid = $kid->sibling) {
1985 push @exprs, $self->deparse($kid, 6);
1988 return "$name(" . join(", ", @exprs) . ")";
1990 return "$name " . join(", ", @exprs);
1994 sub pp_bless { listop(@_, "bless") }
1995 sub pp_atan2 { maybe_targmy(@_, \&listop, "atan2") }
1996 sub pp_substr { maybe_local(@_, listop(@_, "substr")) }
1997 sub pp_vec { maybe_local(@_, listop(@_, "vec")) }
1998 sub pp_index { maybe_targmy(@_, \&listop, "index") }
1999 sub pp_rindex { maybe_targmy(@_, \&listop, "rindex") }
2000 sub pp_sprintf { maybe_targmy(@_, \&listop, "sprintf") }
2001 sub pp_formline { listop(@_, "formline") } # see also deparse_format
2002 sub pp_crypt { maybe_targmy(@_, \&listop, "crypt") }
2003 sub pp_unpack { listop(@_, "unpack") }
2004 sub pp_pack { listop(@_, "pack") }
2005 sub pp_join { maybe_targmy(@_, \&listop, "join") }
2006 sub pp_splice { listop(@_, "splice") }
2007 sub pp_push { maybe_targmy(@_, \&listop, "push") }
2008 sub pp_unshift { maybe_targmy(@_, \&listop, "unshift") }
2009 sub pp_reverse { listop(@_, "reverse") }
2010 sub pp_warn { listop(@_, "warn") }
2011 sub pp_die { listop(@_, "die") }
2012 # Actually, return is exempt from the LLAFR (see examples in this very
2013 # module!), but for consistency's sake, ignore that fact
2014 sub pp_return { listop(@_, "return") }
2015 sub pp_open { listop(@_, "open") }
2016 sub pp_pipe_op { listop(@_, "pipe") }
2017 sub pp_tie { listop(@_, "tie") }
2018 sub pp_binmode { listop(@_, "binmode") }
2019 sub pp_dbmopen { listop(@_, "dbmopen") }
2020 sub pp_sselect { listop(@_, "select") }
2021 sub pp_select { listop(@_, "select") }
2022 sub pp_read { listop(@_, "read") }
2023 sub pp_sysopen { listop(@_, "sysopen") }
2024 sub pp_sysseek { listop(@_, "sysseek") }
2025 sub pp_sysread { listop(@_, "sysread") }
2026 sub pp_syswrite { listop(@_, "syswrite") }
2027 sub pp_send { listop(@_, "send") }
2028 sub pp_recv { listop(@_, "recv") }
2029 sub pp_seek { listop(@_, "seek") }
2030 sub pp_fcntl { listop(@_, "fcntl") }
2031 sub pp_ioctl { listop(@_, "ioctl") }
2032 sub pp_flock { maybe_targmy(@_, \&listop, "flock") }
2033 sub pp_socket { listop(@_, "socket") }
2034 sub pp_sockpair { listop(@_, "sockpair") }
2035 sub pp_bind { listop(@_, "bind") }
2036 sub pp_connect { listop(@_, "connect") }
2037 sub pp_listen { listop(@_, "listen") }
2038 sub pp_accept { listop(@_, "accept") }
2039 sub pp_shutdown { listop(@_, "shutdown") }
2040 sub pp_gsockopt { listop(@_, "getsockopt") }
2041 sub pp_ssockopt { listop(@_, "setsockopt") }
2042 sub pp_chown { maybe_targmy(@_, \&listop, "chown") }
2043 sub pp_unlink { maybe_targmy(@_, \&listop, "unlink") }
2044 sub pp_chmod { maybe_targmy(@_, \&listop, "chmod") }
2045 sub pp_utime { maybe_targmy(@_, \&listop, "utime") }
2046 sub pp_rename { maybe_targmy(@_, \&listop, "rename") }
2047 sub pp_link { maybe_targmy(@_, \&listop, "link") }
2048 sub pp_symlink { maybe_targmy(@_, \&listop, "symlink") }
2049 sub pp_mkdir { maybe_targmy(@_, \&listop, "mkdir") }
2050 sub pp_open_dir { listop(@_, "opendir") }
2051 sub pp_seekdir { listop(@_, "seekdir") }
2052 sub pp_waitpid { maybe_targmy(@_, \&listop, "waitpid") }
2053 sub pp_system { maybe_targmy(@_, \&listop, "system") }
2054 sub pp_exec { maybe_targmy(@_, \&listop, "exec") }
2055 sub pp_kill { maybe_targmy(@_, \&listop, "kill") }
2056 sub pp_setpgrp { maybe_targmy(@_, \&listop, "setpgrp") }
2057 sub pp_getpriority { maybe_targmy(@_, \&listop, "getpriority") }
2058 sub pp_setpriority { maybe_targmy(@_, \&listop, "setpriority") }
2059 sub pp_shmget { listop(@_, "shmget") }
2060 sub pp_shmctl { listop(@_, "shmctl") }
2061 sub pp_shmread { listop(@_, "shmread") }
2062 sub pp_shmwrite { listop(@_, "shmwrite") }
2063 sub pp_msgget { listop(@_, "msgget") }
2064 sub pp_msgctl { listop(@_, "msgctl") }
2065 sub pp_msgsnd { listop(@_, "msgsnd") }
2066 sub pp_msgrcv { listop(@_, "msgrcv") }
2067 sub pp_semget { listop(@_, "semget") }
2068 sub pp_semctl { listop(@_, "semctl") }
2069 sub pp_semop { listop(@_, "semop") }
2070 sub pp_ghbyaddr { listop(@_, "gethostbyaddr") }
2071 sub pp_gnbyaddr { listop(@_, "getnetbyaddr") }
2072 sub pp_gpbynumber { listop(@_, "getprotobynumber") }
2073 sub pp_gsbyname { listop(@_, "getservbyname") }
2074 sub pp_gsbyport { listop(@_, "getservbyport") }
2075 sub pp_syscall { listop(@_, "syscall") }
2080 my $text = $self->dq($op->first->sibling); # skip pushmark
2081 if ($text =~ /^\$?(\w|::|\`)+$/ # could look like a readline
2082 or $text =~ /[<>]/) {
2083 return 'glob(' . single_delim('qq', '"', $text) . ')';
2085 return '<' . $text . '>';
2089 # Truncate is special because OPf_SPECIAL makes a bareword first arg
2090 # be a filehandle. This could probably be better fixed in the core
2091 # by moving the GV lookup into ck_truc.
2097 my $parens = ($cx >= 5) || $self->{'parens'};
2098 my $kid = $op->first->sibling;
2100 if ($op->flags & OPf_SPECIAL) {
2101 # $kid is an OP_CONST
2102 $fh = $self->const_sv($kid)->PV;
2104 $fh = $self->deparse($kid, 6);
2105 $fh = "+$fh" if not $parens and substr($fh, 0, 1) eq "(";
2107 my $len = $self->deparse($kid->sibling, 6);
2109 return "truncate($fh, $len)";
2111 return "truncate $fh, $len";
2117 my($op, $cx, $name) = @_;
2119 my $kid = $op->first->sibling;
2121 if ($op->flags & OPf_STACKED) {
2123 $indir = $indir->first; # skip rv2gv
2124 if (is_scope($indir)) {
2125 $indir = "{" . $self->deparse($indir, 0) . "}";
2126 } elsif ($indir->name eq "const" && $indir->private & OPpCONST_BARE) {
2127 $indir = $self->const_sv($indir)->PV;
2129 $indir = $self->deparse($indir, 24);
2131 $indir = $indir . " ";
2132 $kid = $kid->sibling;
2134 if ($name eq "sort" && $op->private & (OPpSORT_NUMERIC | OPpSORT_INTEGER)) {
2135 $indir = ($op->private & OPpSORT_REVERSE) ? '{$b <=> $a} '
2138 elsif ($name eq "sort" && $op->private & OPpSORT_REVERSE) {
2139 $indir = '{$b cmp $a} ';
2141 for (; !null($kid); $kid = $kid->sibling) {
2142 $expr = $self->deparse($kid, 6);
2145 return $self->maybe_parens_func($name, $indir . join(", ", @exprs),
2149 sub pp_prtf { indirop(@_, "printf") }
2150 sub pp_print { indirop(@_, "print") }
2151 sub pp_sort { indirop(@_, "sort") }
2155 my($op, $cx, $name) = @_;
2157 my $kid = $op->first; # this is the (map|grep)start
2158 $kid = $kid->first->sibling; # skip a pushmark
2159 my $code = $kid->first; # skip a null
2160 if (is_scope $code) {
2161 $code = "{" . $self->deparse($code, 0) . "} ";
2163 $code = $self->deparse($code, 24) . ", ";
2165 $kid = $kid->sibling;
2166 for (; !null($kid); $kid = $kid->sibling) {
2167 $expr = $self->deparse($kid, 6);
2168 push @exprs, $expr if $expr;
2170 return $self->maybe_parens_func($name, $code . join(", ", @exprs), $cx, 5);
2173 sub pp_mapwhile { mapop(@_, "map") }
2174 sub pp_grepwhile { mapop(@_, "grep") }
2180 my $kid = $op->first->sibling; # skip pushmark
2182 my $local = "either"; # could be local(...), my(...) or our(...)
2183 for ($lop = $kid; !null($lop); $lop = $lop->sibling) {
2184 # This assumes that no other private flags equal 128, and that
2185 # OPs that store things other than flags in their op_private,
2186 # like OP_AELEMFAST, won't be immediate children of a list.
2188 # OP_ENTERSUB can break this logic, so check for it.
2189 # I suspect that open and exit can too.
2191 if (!($lop->private & (OPpLVAL_INTRO|OPpOUR_INTRO)
2192 or $lop->name eq "undef")
2193 or $lop->name eq "entersub"
2194 or $lop->name eq "exit"
2195 or $lop->name eq "open")
2197 $local = ""; # or not
2200 if ($lop->name =~ /^pad[ash]v$/) { # my()
2201 ($local = "", last) if $local eq "local" || $local eq "our";
2203 } elsif ($lop->name =~ /^(gv|rv2)[ash]v$/
2204 && $lop->private & OPpOUR_INTRO
2205 or $lop->name eq "null" && $lop->first->name eq "gvsv"
2206 && $lop->first->private & OPpOUR_INTRO) { # our()
2207 ($local = "", last) if $local eq "my" || $local eq "local";
2209 } elsif ($lop->name ne "undef") { # local()
2210 ($local = "", last) if $local eq "my" || $local eq "our";
2214 $local = "" if $local eq "either"; # no point if it's all undefs
2215 return $self->deparse($kid, $cx) if null $kid->sibling and not $local;
2216 for (; !null($kid); $kid = $kid->sibling) {
2218 if (class($kid) eq "UNOP" and $kid->first->name eq "gvsv") {
2223 $self->{'avoid_local'}{$$lop}++;
2224 $expr = $self->deparse($kid, 6);
2225 delete $self->{'avoid_local'}{$$lop};
2227 $expr = $self->deparse($kid, 6);
2232 return "$local(" . join(", ", @exprs) . ")";
2234 return $self->maybe_parens( join(", ", @exprs), $cx, 6);
2238 sub is_ifelse_cont {
2240 return ($op->name eq "null" and class($op) eq "UNOP"
2241 and $op->first->name =~ /^(and|cond_expr)$/
2242 and is_scope($op->first->first->sibling));
2248 my $cond = $op->first;
2249 my $true = $cond->sibling;
2250 my $false = $true->sibling;
2251 my $cuddle = $self->{'cuddle'};
2252 unless ($cx == 0 and (is_scope($true) and $true->name ne "null") and
2253 (is_scope($false) || is_ifelse_cont($false))
2254 and $self->{'expand'} < 7) {
2255 $cond = $self->deparse($cond, 8);
2256 $true = $self->deparse($true, 8);
2257 $false = $self->deparse($false, 8);
2258 return $self->maybe_parens("$cond ? $true : $false", $cx, 8);
2261 $cond = $self->deparse($cond, 1);
2262 $true = $self->deparse($true, 0);
2263 my $head = "if ($cond) {\n\t$true\n\b}";
2265 while (!null($false) and is_ifelse_cont($false)) {
2266 my $newop = $false->first;
2267 my $newcond = $newop->first;
2268 my $newtrue = $newcond->sibling;
2269 $false = $newtrue->sibling; # last in chain is OP_AND => no else
2270 $newcond = $self->deparse($newcond, 1);
2271 $newtrue = $self->deparse($newtrue, 0);
2272 push @elsifs, "elsif ($newcond) {\n\t$newtrue\n\b}";
2274 if (!null($false)) {
2275 $false = $cuddle . "else {\n\t" .
2276 $self->deparse($false, 0) . "\n\b}\cK";
2280 return $head . join($cuddle, "", @elsifs) . $false;
2285 my($op, $cx, $init) = @_;
2286 my $enter = $op->first;
2287 my $kid = $enter->sibling;
2288 local(@$self{qw'curstash warnings hints'})
2289 = @$self{qw'curstash warnings hints'};
2294 if ($kid->name eq "lineseq") { # bare or infinite loop
2295 if (is_state $kid->last) { # infinite
2296 $head = "while (1) "; # Can't use for(;;) if there's a continue
2302 } elsif ($enter->name eq "enteriter") { # foreach
2303 my $ary = $enter->first->sibling; # first was pushmark
2304 my $var = $ary->sibling;
2305 if ($enter->flags & OPf_STACKED
2306 and not null $ary->first->sibling->sibling)
2308 $ary = $self->deparse($ary->first->sibling, 9) . " .. " .
2309 $self->deparse($ary->first->sibling->sibling, 9);
2311 $ary = $self->deparse($ary, 1);
2314 if ($enter->flags & OPf_SPECIAL) { # thread special var
2315 $var = $self->pp_threadsv($enter, 1);
2316 } else { # regular my() variable
2317 $var = $self->pp_padsv($enter, 1);
2318 if ($self->padname_sv($enter->targ)->IVX ==
2319 $kid->first->first->sibling->last->cop_seq)
2321 # If the scope of this variable closes at the last
2322 # statement of the loop, it must have been
2324 $var = "my " . $var;
2327 } elsif ($var->name eq "rv2gv") {
2328 $var = $self->pp_rv2sv($var, 1);
2329 } elsif ($var->name eq "gv") {
2330 $var = "\$" . $self->deparse($var, 1);
2332 $head = "foreach $var ($ary) ";
2333 $body = $kid->first->first->sibling; # skip OP_AND and OP_ITER
2334 } elsif ($kid->name eq "null") { # while/until
2336 my $name = {"and" => "while", "or" => "until"}->{$kid->name};
2337 $cond = $self->deparse($kid->first, 1);
2338 $head = "$name ($cond) ";
2339 $body = $kid->first->sibling;
2340 } elsif ($kid->name eq "stub") { # bare and empty
2341 return "{;}"; # {} could be a hashref
2343 # If there isn't a continue block, then the next pointer for the loop
2344 # will point to the unstack, which is kid's penultimate child, except
2345 # in a bare loop, when it will point to the leaveloop. When neither of
2346 # these conditions hold, then the third-to-last child in the continue
2347 # block (or the last in a bare loop).
2348 my $cont_start = $enter->nextop;
2350 if ($$cont_start != $$op && ${$cont_start->sibling} != ${$body->last}) {
2352 $cont = $body->last;
2354 $cont = $body->first;
2355 while (!null($cont->sibling->sibling->sibling)) {
2356 $cont = $cont->sibling;
2359 my $state = $body->first;
2360 my $cuddle = $self->{'cuddle'};
2362 for (; $$state != $$cont; $state = $state->sibling) {
2363 push @states, $state;
2365 $body = $self->lineseq(undef, @states);
2366 if (defined $cond and not is_scope $cont and $self->{'expand'} < 3) {
2367 $head = "for ($init; $cond; " . $self->deparse($cont, 1) .") ";
2370 $cont = $cuddle . "continue {\n\t" .
2371 $self->deparse($cont, 0) . "\n\b}\cK";
2374 return "" if !defined $body;
2376 $head = "for ($init; $cond;) ";
2379 $body = $self->deparse($body, 0);
2381 $body =~ s/;?$/;\n/;
2383 return $head . "{\n\t" . $body . "\b}" . $cont;
2386 sub pp_leaveloop { loop_common(@_, "") }
2391 my $init = $self->deparse($op, 1);
2392 return $self->loop_common($op->sibling->first->sibling, $cx, $init);
2397 return "eval {\n\t" . $self->pp_leave(@_) . "\n\b}";
2400 BEGIN { eval "sub OP_CONST () {" . opnumber("const") . "}" }
2401 BEGIN { eval "sub OP_STRINGIFY () {" . opnumber("stringify") . "}" }
2402 BEGIN { eval "sub OP_RV2SV () {" . opnumber("rv2sv") . "}" }
2403 BEGIN { eval "sub OP_LIST () {" . opnumber("list") . "}" }
2408 if (class($op) eq "OP") {
2410 return $self->{'ex_const'} if $op->targ == OP_CONST;
2411 } elsif ($op->first->name eq "pushmark") {
2412 return $self->pp_list($op, $cx);
2413 } elsif ($op->first->name eq "enter") {
2414 return $self->pp_leave($op, $cx);
2415 } elsif ($op->targ == OP_STRINGIFY) {
2416 return $self->dquote($op, $cx);
2417 } elsif (!null($op->first->sibling) and
2418 $op->first->sibling->name eq "readline" and
2419 $op->first->sibling->flags & OPf_STACKED) {
2420 return $self->maybe_parens($self->deparse($op->first, 7) . " = "
2421 . $self->deparse($op->first->sibling, 7),
2423 } elsif (!null($op->first->sibling) and
2424 $op->first->sibling->name eq "trans" and
2425 $op->first->sibling->flags & OPf_STACKED) {
2426 return $self->maybe_parens($self->deparse($op->first, 20) . " =~ "
2427 . $self->deparse($op->first->sibling, 20),
2429 } elsif ($op->flags & OPf_SPECIAL && $cx == 0 && !$op->targ) {
2430 return "do {\n\t". $self->deparse($op->first, $cx) ."\n\b};";
2431 } elsif (!null($op->first->sibling) and
2432 $op->first->sibling->name eq "null" and
2433 class($op->first->sibling) eq "UNOP" and
2434 $op->first->sibling->first->flags & OPf_STACKED and
2435 $op->first->sibling->first->name eq "rcatline") {
2436 return $self->maybe_parens($self->deparse($op->first, 18) . " .= "
2437 . $self->deparse($op->first->sibling, 18),
2440 return $self->deparse($op->first, $cx);
2447 return $self->padname_sv($targ)->PVX;
2453 return substr($self->padname($op->targ), 1); # skip $/@/%
2459 return $self->maybe_my($op, $cx, $self->padname($op->targ));
2462 sub pp_padav { pp_padsv(@_) }
2463 sub pp_padhv { pp_padsv(@_) }
2468 @threadsv_names = ("_", "1", "2", "3", "4", "5", "6", "7", "8", "9",
2469 "&", "`", "'", "+", "/", ".", ",", "\\", '"', ";",
2470 "^", "-", "%", "=", "|", "~", ":", "^A", "^E",
2477 return $self->maybe_local($op, $cx, "\$" . $threadsv_names[$op->targ]);
2483 if (class($op) eq "PADOP") {
2484 return $self->padval($op->padix);
2485 } else { # class($op) eq "SVOP"
2493 my $gv = $self->gv_or_padgv($op);
2494 return $self->maybe_local($op, $cx, $self->stash_variable("\$",
2495 $self->gv_name($gv)));
2501 my $gv = $self->gv_or_padgv($op);
2502 return $self->gv_name($gv);
2508 my $gv = $self->gv_or_padgv($op);
2509 my $name = $self->gv_name($gv);
2510 $name = $self->{'curstash'}."::$name"
2511 if $name !~ /::/ && $self->lex_in_scope('@'.$name);
2513 return "\$" . $name . "[" .
2514 ($op->private + $self->{'arybase'}) . "]";
2519 my($op, $cx, $type) = @_;
2521 if (class($op) eq 'NULL' || !$op->can("first")) {
2522 carp("Unexpected op in pp_rv2x");
2525 my $kid = $op->first;
2526 my $str = $self->deparse($kid, 0);
2527 return $self->stash_variable($type, $str) if is_scalar($kid);
2528 return $type ."{$str}";
2531 sub pp_rv2sv { maybe_local(@_, rv2x(@_, "\$")) }
2532 sub pp_rv2hv { maybe_local(@_, rv2x(@_, "%")) }
2533 sub pp_rv2gv { maybe_local(@_, rv2x(@_, "*")) }
2539 if ($op->first->name eq "padav") {
2540 return $self->maybe_local($op, $cx, '$#' . $self->padany($op->first));
2542 return $self->maybe_local($op, $cx,
2543 $self->rv2x($op->first, $cx, '$#'));
2547 # skip down to the old, ex-rv2cv
2549 my ($self, $op, $cx) = @_;
2550 if (!null($op->first) && $op->first->name eq 'null' &&
2551 $op->first->targ eq OP_LIST)
2553 return $self->rv2x($op->first->first->sibling, $cx, "&")
2556 return $self->rv2x($op, $cx, "")
2563 my $kid = $op->first;
2564 if ($kid->name eq "const") { # constant list
2565 my $av = $self->const_sv($kid);
2566 return "(" . join(", ", map(const($_), $av->ARRAY)) . ")";
2568 return $self->maybe_local($op, $cx, $self->rv2x($op, $cx, "\@"));
2572 sub is_subscriptable {
2574 if ($op->name =~ /^[ahg]elem/) {
2576 } elsif ($op->name eq "entersub") {
2577 my $kid = $op->first;
2578 return 0 unless null $kid->sibling;
2580 $kid = $kid->sibling until null $kid->sibling;
2581 return 0 if is_scope($kid);
2583 return 0 if $kid->name eq "gv";
2584 return 0 if is_scalar($kid);
2585 return is_subscriptable($kid);
2593 my ($op, $cx, $left, $right, $padname) = @_;
2594 my($array, $idx) = ($op->first, $op->first->sibling);
2595 unless ($array->name eq $padname) { # Maybe this has been fixed
2596 $array = $array->first; # skip rv2av (or ex-rv2av in _53+)
2598 if ($array->name eq $padname) {
2599 $array = $self->padany($array);
2600 } elsif (is_scope($array)) { # ${expr}[0]
2601 $array = "{" . $self->deparse($array, 0) . "}";
2602 } elsif ($array->name eq "gv") {
2603 $array = $self->gv_name($self->gv_or_padgv($array));
2604 if ($array !~ /::/) {
2605 my $prefix = ($left eq '[' ? '@' : '%');
2606 $array = $self->{curstash}.'::'.$array
2607 if $self->lex_in_scope($prefix . $array);
2609 } elsif (is_scalar $array) { # $x[0], $$x[0], ...
2610 $array = $self->deparse($array, 24);
2612 # $x[20][3]{hi} or expr->[20]
2613 my $arrow = is_subscriptable($array) ? "" : "->";
2614 return $self->deparse($array, 24) . $arrow .
2615 $left . $self->deparse($idx, 1) . $right;
2617 $idx = $self->deparse($idx, 1);
2619 # Outer parens in an array index will confuse perl
2620 # if we're interpolating in a regular expression, i.e.
2621 # /$x$foo[(-1)]/ is *not* the same as /$x$foo[-1]/
2623 # If $self->{parens}, then an initial '(' will
2624 # definitely be paired with a final ')'. If
2625 # !$self->{parens}, the misleading parens won't
2626 # have been added in the first place.
2628 # [You might think that we could get "(...)...(...)"
2629 # where the initial and final parens do not match
2630 # each other. But we can't, because the above would
2631 # only happen if there's an infix binop between the
2632 # two pairs of parens, and *that* means that the whole
2633 # expression would be parenthesized as well.]
2635 $idx =~ s/^\((.*)\)$/$1/ if $self->{'parens'};
2637 # Hash-element braces will autoquote a bareword inside themselves.
2638 # We need to make sure that C<$hash{warn()}> doesn't come out as
2639 # C<$hash{warn}>, which has a quite different meaning. Currently
2640 # B::Deparse will always quote strings, even if the string was a
2641 # bareword in the original (i.e. the OPpCONST_BARE flag is ignored
2642 # for constant strings.) So we can cheat slightly here - if we see
2643 # a bareword, we know that it is supposed to be a function call.
2645 $idx =~ s/^([A-Za-z_]\w*)$/$1()/;
2647 return "\$" . $array . $left . $idx . $right;
2650 sub pp_aelem { maybe_local(@_, elem(@_, "[", "]", "padav")) }
2651 sub pp_helem { maybe_local(@_, elem(@_, "{", "}", "padhv")) }
2656 my($glob, $part) = ($op->first, $op->last);
2657 $glob = $glob->first; # skip rv2gv
2658 $glob = $glob->first if $glob->name eq "rv2gv"; # this one's a bug
2659 my $scope = is_scope($glob);
2660 $glob = $self->deparse($glob, 0);
2661 $part = $self->deparse($part, 1);
2662 return "*" . ($scope ? "{$glob}" : $glob) . "{$part}";
2667 my ($op, $cx, $left, $right, $regname, $padname) = @_;
2669 my(@elems, $kid, $array, $list);
2670 if (class($op) eq "LISTOP") {
2672 } else { # ex-hslice inside delete()
2673 for ($kid = $op->first; !null $kid->sibling; $kid = $kid->sibling) {}
2677 $array = $array->first
2678 if $array->name eq $regname or $array->name eq "null";
2679 if (is_scope($array)) {
2680 $array = "{" . $self->deparse($array, 0) . "}";
2681 } elsif ($array->name eq $padname) {
2682 $array = $self->padany($array);
2684 $array = $self->deparse($array, 24);
2686 $kid = $op->first->sibling; # skip pushmark
2687 if ($kid->name eq "list") {
2688 $kid = $kid->first->sibling; # skip list, pushmark
2689 for (; !null $kid; $kid = $kid->sibling) {
2690 push @elems, $self->deparse($kid, 6);
2692 $list = join(", ", @elems);
2694 $list = $self->deparse($kid, 1);
2696 return "\@" . $array . $left . $list . $right;
2699 sub pp_aslice { maybe_local(@_, slice(@_, "[", "]", "rv2av", "padav")) }
2700 sub pp_hslice { maybe_local(@_, slice(@_, "{", "}", "rv2hv", "padhv")) }
2705 my $idx = $op->first;
2706 my $list = $op->last;
2708 $list = $self->deparse($list, 1);
2709 $idx = $self->deparse($idx, 1);
2710 return "($list)" . "[$idx]";
2715 return ($op->flags & OPf_WANT) == OPf_WANT_SCALAR;
2720 return ($op->flags & OPf_WANT) == OPf_WANT_LIST;
2726 my $kid = $op->first->sibling; # skip pushmark
2727 my($meth, $obj, @exprs);
2728 if ($kid->name eq "list" and want_list $kid) {
2729 # When an indirect object isn't a bareword but the args are in
2730 # parens, the parens aren't part of the method syntax (the LLAFR
2731 # doesn't apply), but they make a list with OPf_PARENS set that
2732 # doesn't get flattened by the append_elem that adds the method,
2733 # making a (object, arg1, arg2, ...) list where the object
2734 # usually is. This can be distinguished from
2735 # `($obj, $arg1, $arg2)->meth()' (which is legal if $arg2 is an
2736 # object) because in the later the list is in scalar context
2737 # as the left side of -> always is, while in the former
2738 # the list is in list context as method arguments always are.
2739 # (Good thing there aren't method prototypes!)
2740 $meth = $kid->sibling;
2741 $kid = $kid->first->sibling; # skip pushmark
2743 $kid = $kid->sibling;
2744 for (; not null $kid; $kid = $kid->sibling) {
2745 push @exprs, $self->deparse($kid, 6);
2749 $kid = $kid->sibling;
2750 for (; !null ($kid->sibling) && $kid->name ne "method_named";
2751 $kid = $kid->sibling) {
2752 push @exprs, $self->deparse($kid, 6);
2756 $obj = $self->deparse($obj, 24);
2757 if ($meth->name eq "method_named") {
2758 $meth = $self->const_sv($meth)->PV;
2760 $meth = $meth->first;
2761 if ($meth->name eq "const") {
2762 # As of 5.005_58, this case is probably obsoleted by the
2763 # method_named case above
2764 $meth = $self->const_sv($meth)->PV; # needs to be bare
2766 $meth = $self->deparse($meth, 1);
2769 my $args = join(", ", @exprs);
2770 $kid = $obj . "->" . $meth;
2772 return $kid . "(" . $args . ")"; # parens mandatory
2778 # returns "&" if the prototype doesn't match the args,
2779 # or ("", $args_after_prototype_demunging) if it does.
2782 my($proto, @args) = @_;
2786 # An unbackslashed @ or % gobbles up the rest of the args
2787 1 while $proto =~ s/(?<!\\)([@%])[^\]]+$/$1/;
2789 $proto =~ s/^(\\?[\$\@&%*]|\\\[[\$\@&%*]+\]|;)//;
2792 return "&" if @args;
2793 } elsif ($chr eq ";") {
2795 } elsif ($chr eq "@" or $chr eq "%") {
2796 push @reals, map($self->deparse($_, 6), @args);
2802 if (want_scalar $arg) {
2803 push @reals, $self->deparse($arg, 6);
2807 } elsif ($chr eq "&") {
2808 if ($arg->name =~ /^(s?refgen|undef)$/) {
2809 push @reals, $self->deparse($arg, 6);
2813 } elsif ($chr eq "*") {
2814 if ($arg->name =~ /^s?refgen$/
2815 and $arg->first->first->name eq "rv2gv")
2817 $real = $arg->first->first; # skip refgen, null
2818 if ($real->first->name eq "gv") {
2819 push @reals, $self->deparse($real, 6);
2821 push @reals, $self->deparse($real->first, 6);
2826 } elsif (substr($chr, 0, 1) eq "\\") {
2828 if ($arg->name =~ /^s?refgen$/ and
2829 !null($real = $arg->first) and
2830 ($chr =~ /\$/ && is_scalar($real->first)
2832 && class($real->first->sibling) ne 'NULL'
2833 && $real->first->sibling->name
2836 && class($real->first->sibling) ne 'NULL'
2837 && $real->first->sibling->name
2839 #or ($chr =~ /&/ # This doesn't work
2840 # && $real->first->name eq "rv2cv")
2842 && $real->first->name eq "rv2gv")))
2844 push @reals, $self->deparse($real, 6);
2851 return "&" if $proto and !$doneok; # too few args and no `;'
2852 return "&" if @args; # too many args
2853 return ("", join ", ", @reals);
2859 return $self->method($op, $cx) unless null $op->first->sibling;
2863 if ($op->flags & OPf_SPECIAL && !($op->flags & OPf_MOD)) {
2865 } elsif ($op->private & OPpENTERSUB_AMPER) {
2869 $kid = $kid->first->sibling; # skip ex-list, pushmark
2870 for (; not null $kid->sibling; $kid = $kid->sibling) {
2875 if (is_scope($kid)) {
2877 $kid = "{" . $self->deparse($kid, 0) . "}";
2878 } elsif ($kid->first->name eq "gv") {
2879 my $gv = $self->gv_or_padgv($kid->first);
2880 if (class($gv->CV) ne "SPECIAL") {
2881 $proto = $gv->CV->PV if $gv->CV->FLAGS & SVf_POK;
2883 $simple = 1; # only calls of named functions can be prototyped
2884 $kid = $self->deparse($kid, 24);
2885 } elsif (is_scalar ($kid->first) && $kid->first->name ne 'rv2cv') {
2887 $kid = $self->deparse($kid, 24);
2890 my $arrow = is_subscriptable($kid->first) ? "" : "->";
2891 $kid = $self->deparse($kid, 24) . $arrow;
2894 # Doesn't matter how many prototypes there are, if
2895 # they haven't happened yet!
2899 no warnings 'uninitialized';
2900 $declared = exists $self->{'subs_declared'}{$kid}
2902 defined &{ %{$self->{'curstash'}."::"}->{$kid} }
2904 $self->{'subs_deparsed'}{$self->{'curstash'}."::".$kid}
2905 && defined prototype $self->{'curstash'}."::".$kid
2907 if (!$declared && defined($proto)) {
2908 # Avoid "too early to check prototype" warning
2909 ($amper, $proto) = ('&');
2914 if ($declared and defined $proto and not $amper) {
2915 ($amper, $args) = $self->check_proto($proto, @exprs);
2916 if ($amper eq "&") {
2917 $args = join(", ", map($self->deparse($_, 6), @exprs));
2920 $args = join(", ", map($self->deparse($_, 6), @exprs));
2922 if ($prefix or $amper) {
2923 if ($op->flags & OPf_STACKED) {
2924 return $prefix . $amper . $kid . "(" . $args . ")";
2926 return $prefix . $amper. $kid;
2929 # glob() invocations can be translated into calls of
2930 # CORE::GLOBAL::glob with a second parameter, a number.
2932 if ($kid eq "CORE::GLOBAL::glob") {
2934 $args =~ s/\s*,[^,]+$//;
2937 # It's a syntax error to call CORE::GLOBAL::foo without a prefix,
2938 # so it must have been translated from a keyword call. Translate
2940 $kid =~ s/^CORE::GLOBAL:://;
2943 return "$kid(" . $args . ")";
2944 } elsif (defined $proto and $proto eq "") {
2946 } elsif (defined $proto and $proto eq "\$" and is_scalar($exprs[0])) {
2947 return $self->maybe_parens_func($kid, $args, $cx, 16);
2948 } elsif (defined($proto) && $proto or $simple) {
2949 return $self->maybe_parens_func($kid, $args, $cx, 5);
2951 return "$kid(" . $args . ")";
2956 sub pp_enterwrite { unop(@_, "write") }
2958 # escape things that cause interpolation in double quotes,
2959 # but not character escapes
2962 $str =~ s/(^|\G|[^\\])((?:\\\\)*)([\$\@]|\\[uUlLQE])/$1$2\\$3/g;
2970 # Matches any string which is balanced with respect to {braces}
2981 # the same, but treat $|, $), $( and $ at the end of the string differently
2995 (\(\?\??\{$bal\}\)) # $4
3001 /length($4) ? "$1$2$4" : "$1$2\\$3"/xeg;
3006 # This is for regular expressions with the /x modifier
3007 # We have to leave comments unmangled.
3008 sub re_uninterp_extended {
3021 ( \(\?\??\{$bal\}\) # $4 (skip over (?{}) and (??{}) blocks)
3022 | \#[^\n]* # (skip over comments)
3029 /length($4) ? "$1$2$4" : "$1$2\\$3"/xeg;
3035 # character escapes, but not delimiters that might need to be escaped
3036 sub escape_str { # ASCII, UTF8
3038 $str =~ s/(.)/ord($1)>255 ? sprintf("\\x{%x}", ord($1)) : $1/eg;
3040 # $str =~ s/\cH/\\b/g; # \b means someting different in a regex
3046 $str =~ s/([\cA-\cZ])/'\\c' . chr(ord('@') + ord($1))/ge;
3047 $str =~ s/([\0\033-\037\177-\377])/'\\' . sprintf("%03o", ord($1))/ge;
3051 # For regexes with the /x modifier.
3052 # Leave whitespace unmangled.
3053 sub escape_extended_re {
3055 $str =~ s/(.)/ord($1)>255 ? sprintf("\\x{%x}", ord($1)) : $1/eg;
3056 $str =~ s/([\0\033-\037\177-\377])/'\\' . sprintf("%03o", ord($1))/ge;
3057 $str =~ s/\n/\n\f/g;
3061 # Don't do this for regexen
3064 $str =~ s/\\/\\\\/g;
3068 # Remove backslashes which precede literal control characters,
3069 # to avoid creating ambiguity when we escape the latter.
3073 # the insane complexity here is due to the behaviour of "\c\"
3074 $str =~ s/(^|[^\\]|\\c\\)(?<!\\c)\\(\\\\)*(?=[\0-\031\177-\377])/$1$2/g;
3078 sub balanced_delim {
3080 my @str = split //, $str;
3081 my($ar, $open, $close, $fail, $c, $cnt);
3082 for $ar (['[',']'], ['(',')'], ['<','>'], ['{','}']) {
3083 ($open, $close) = @$ar;
3084 $fail = 0; $cnt = 0;
3088 } elsif ($c eq $close) {
3097 $fail = 1 if $cnt != 0;
3098 return ($open, "$open$str$close") if not $fail;
3104 my($q, $default, $str) = @_;
3105 return "$default$str$default" if $default and index($str, $default) == -1;
3107 (my $succeed, $str) = balanced_delim($str);
3108 return "$q$str" if $succeed;
3110 for my $delim ('/', '"', '#') {
3111 return "$q$delim" . $str . $delim if index($str, $delim) == -1;
3114 $str =~ s/$default/\\$default/g;
3115 return "$default$str$default";
3124 if (class($sv) eq "SPECIAL") {
3125 return ('undef', '1', '0')[$$sv-1]; # sv_undef, sv_yes, sv_no
3126 } elsif (class($sv) eq "NULL") {
3128 } elsif ($sv->FLAGS & SVf_IOK) {
3129 return $sv->int_value;
3130 } elsif ($sv->FLAGS & SVf_NOK) {
3131 # try the default stringification
3134 # If it's in scientific notation, we might have lost information
3135 return sprintf("%.20e", $sv->NV);
3138 } elsif ($sv->FLAGS & SVf_ROK && $sv->can("RV")) {
3139 return "\\(" . const($sv->RV) . ")"; # constant folded
3140 } elsif ($sv->FLAGS & SVf_POK) {
3142 if ($str =~ /[^ -~]/) { # ASCII for non-printing
3143 return single_delim("qq", '"', uninterp escape_str unback $str);
3145 return single_delim("q", "'", unback $str);
3156 # the constant could be in the pad (under useithreads)
3157 $sv = $self->padval($op->targ) unless $$sv;
3164 if ($op->private & OPpCONST_ARYBASE) {
3167 # if ($op->private & OPpCONST_BARE) { # trouble with `=>' autoquoting
3168 # return $self->const_sv($op)->PV;
3170 my $sv = $self->const_sv($op);
3171 # return const($sv);
3173 return $c =~ /^-\d/ ? $self->maybe_parens($c, $cx, 21) : $c;
3179 my $type = $op->name;
3180 if ($type eq "const") {
3181 return '$[' if $op->private & OPpCONST_ARYBASE;
3182 return uninterp(escape_str(unback($self->const_sv($op)->as_string)));
3183 } elsif ($type eq "concat") {
3184 my $first = $self->dq($op->first);
3185 my $last = $self->dq($op->last);
3187 # Disambiguate "${foo}bar", "${foo}{bar}", "${foo}[1]"
3188 ($last =~ /^[A-Z\\\^\[\]_?]/ &&
3189 $first =~ s/([\$@])\^$/${1}{^}/) # "${^}W" etc
3190 || ($last =~ /^[{\[\w_]/ &&
3191 $first =~ s/([\$@])([A-Za-z_]\w*)$/${1}{$2}/);
3193 return $first . $last;
3194 } elsif ($type eq "uc") {
3195 return '\U' . $self->dq($op->first->sibling) . '\E';
3196 } elsif ($type eq "lc") {
3197 return '\L' . $self->dq($op->first->sibling) . '\E';
3198 } elsif ($type eq "ucfirst") {
3199 return '\u' . $self->dq($op->first->sibling);
3200 } elsif ($type eq "lcfirst") {
3201 return '\l' . $self->dq($op->first->sibling);
3202 } elsif ($type eq "quotemeta") {
3203 return '\Q' . $self->dq($op->first->sibling) . '\E';
3204 } elsif ($type eq "join") {
3205 return $self->deparse($op->last, 26); # was join($", @ary)
3207 return $self->deparse($op, 26);
3215 return single_delim("qx", '`', $self->dq($op->first->sibling));
3221 my $kid = $op->first->sibling; # skip ex-stringify, pushmark
3222 return $self->deparse($kid, $cx) if $self->{'unquote'};
3223 $self->maybe_targmy($kid, $cx,
3224 sub {single_delim("qq", '"', $self->dq($_[1]))});
3227 # OP_STRINGIFY is a listop, but it only ever has one arg
3228 sub pp_stringify { maybe_targmy(@_, \&dquote) }
3230 # tr/// and s/// (and tr[][], tr[]//, tr###, etc)
3231 # note that tr(from)/to/ is OK, but not tr/from/(to)
3233 my($from, $to) = @_;
3234 my($succeed, $delim);
3235 if ($from !~ m[/] and $to !~ m[/]) {
3236 return "/$from/$to/";
3237 } elsif (($succeed, $from) = balanced_delim($from) and $succeed) {
3238 if (($succeed, $to) = balanced_delim($to) and $succeed) {
3241 for $delim ('/', '"', '#') { # note no `'' -- s''' is special
3242 return "$from$delim$to$delim" if index($to, $delim) == -1;
3245 return "$from/$to/";
3248 for $delim ('/', '"', '#') { # note no '
3249 return "$delim$from$delim$to$delim"
3250 if index($to . $from, $delim) == -1;
3252 $from =~ s[/][\\/]g;
3254 return "/$from/$to/";
3258 # Only used by tr///, so backslashes hyphens
3261 if ($n == ord '\\') {
3263 } elsif ($n == ord "-") {
3265 } elsif ($n >= ord(' ') and $n <= ord('~')) {
3267 } elsif ($n == ord "\a") {
3269 } elsif ($n == ord "\b") {
3271 } elsif ($n == ord "\t") {
3273 } elsif ($n == ord "\n") {
3275 } elsif ($n == ord "\e") {
3277 } elsif ($n == ord "\f") {
3279 } elsif ($n == ord "\r") {
3281 } elsif ($n >= ord("\cA") and $n <= ord("\cZ")) {
3282 return '\\c' . chr(ord("@") + $n);
3284 # return '\x' . sprintf("%02x", $n);
3285 return '\\' . sprintf("%03o", $n);
3291 my($str, $c, $tr) = ("");
3292 for ($c = 0; $c < @chars; $c++) {
3295 if ($c <= $#chars - 2 and $chars[$c + 1] == $tr + 1 and
3296 $chars[$c + 2] == $tr + 2)
3298 for (; $c <= $#chars-1 and $chars[$c + 1] == $chars[$c] + 1; $c++)
3301 $str .= pchr($chars[$c]);
3307 sub tr_decode_byte {
3308 my($table, $flags) = @_;
3309 my(@table) = unpack("s*", $table);
3310 splice @table, 0x100, 1; # Number of subsequent elements
3311 my($c, $tr, @from, @to, @delfrom, $delhyphen);
3312 if ($table[ord "-"] != -1 and
3313 $table[ord("-") - 1] == -1 || $table[ord("-") + 1] == -1)
3315 $tr = $table[ord "-"];
3316 $table[ord "-"] = -1;
3320 } else { # -2 ==> delete
3324 for ($c = 0; $c < @table; $c++) {
3327 push @from, $c; push @to, $tr;
3328 } elsif ($tr == -2) {
3332 @from = (@from, @delfrom);
3333 if ($flags & OPpTRANS_COMPLEMENT) {
3336 @from{@from} = (1) x @from;
3337 for ($c = 0; $c < 256; $c++) {
3338 push @newfrom, $c unless $from{$c};
3342 unless ($flags & OPpTRANS_DELETE || !@to) {
3343 pop @to while $#to and $to[$#to] == $to[$#to -1];
3346 $from = collapse(@from);
3347 $to = collapse(@to);
3348 $from .= "-" if $delhyphen;
3349 return ($from, $to);
3354 if ($x == ord "-") {
3356 } elsif ($x == ord "\\") {
3363 # XXX This doesn't yet handle all cases correctly either
3365 sub tr_decode_utf8 {
3366 my($swash_hv, $flags) = @_;
3367 my %swash = $swash_hv->ARRAY;
3369 $final = $swash{'FINAL'}->IV if exists $swash{'FINAL'};
3370 my $none = $swash{"NONE"}->IV;
3371 my $extra = $none + 1;
3372 my(@from, @delfrom, @to);
3374 foreach $line (split /\n/, $swash{'LIST'}->PV) {
3375 my($min, $max, $result) = split(/\t/, $line);
3382 $result = hex $result;
3383 if ($result == $extra) {
3384 push @delfrom, [$min, $max];
3386 push @from, [$min, $max];
3387 push @to, [$result, $result + $max - $min];
3390 for my $i (0 .. $#from) {
3391 if ($from[$i][0] == ord '-') {
3392 unshift @from, splice(@from, $i, 1);
3393 unshift @to, splice(@to, $i, 1);
3395 } elsif ($from[$i][1] == ord '-') {
3398 unshift @from, ord '-';
3399 unshift @to, ord '-';
3403 for my $i (0 .. $#delfrom) {
3404 if ($delfrom[$i][0] == ord '-') {
3405 push @delfrom, splice(@delfrom, $i, 1);
3407 } elsif ($delfrom[$i][1] == ord '-') {
3409 push @delfrom, ord '-';
3413 if (defined $final and $to[$#to][1] != $final) {
3414 push @to, [$final, $final];
3416 push @from, @delfrom;
3417 if ($flags & OPpTRANS_COMPLEMENT) {
3420 for my $i (0 .. $#from) {
3421 push @newfrom, [$next, $from[$i][0] - 1];
3422 $next = $from[$i][1] + 1;
3425 for my $range (@newfrom) {
3426 if ($range->[0] <= $range->[1]) {
3431 my($from, $to, $diff);
3432 for my $chunk (@from) {
3433 $diff = $chunk->[1] - $chunk->[0];
3435 $from .= tr_chr($chunk->[0]) . "-" . tr_chr($chunk->[1]);
3436 } elsif ($diff == 1) {
3437 $from .= tr_chr($chunk->[0]) . tr_chr($chunk->[1]);
3439 $from .= tr_chr($chunk->[0]);
3442 for my $chunk (@to) {
3443 $diff = $chunk->[1] - $chunk->[0];
3445 $to .= tr_chr($chunk->[0]) . "-" . tr_chr($chunk->[1]);
3446 } elsif ($diff == 1) {
3447 $to .= tr_chr($chunk->[0]) . tr_chr($chunk->[1]);
3449 $to .= tr_chr($chunk->[0]);
3452 #$final = sprintf("%04x", $final) if defined $final;
3453 #$none = sprintf("%04x", $none) if defined $none;
3454 #$extra = sprintf("%04x", $extra) if defined $extra;
3455 #print STDERR "final: $final\n none: $none\nextra: $extra\n";
3456 #print STDERR $swash{'LIST'}->PV;
3457 return (escape_str($from), escape_str($to));
3464 if (class($op) eq "PVOP") {
3465 ($from, $to) = tr_decode_byte($op->pv, $op->private);
3466 } else { # class($op) eq "SVOP"
3467 ($from, $to) = tr_decode_utf8($op->sv->RV, $op->private);
3470 $flags .= "c" if $op->private & OPpTRANS_COMPLEMENT;
3471 $flags .= "d" if $op->private & OPpTRANS_DELETE;
3472 $to = "" if $from eq $to and $flags eq "";
3473 $flags .= "s" if $op->private & OPpTRANS_SQUASH;
3474 return "tr" . double_delim($from, $to) . $flags;
3477 # Like dq(), but different
3480 my ($op, $extended) = @_;
3482 my $type = $op->name;
3483 if ($type eq "const") {
3484 return '$[' if $op->private & OPpCONST_ARYBASE;
3485 my $unbacked = re_unback($self->const_sv($op)->as_string);
3486 return re_uninterp_extended(escape_extended_re($unbacked))
3488 return re_uninterp(escape_str($unbacked));
3489 } elsif ($type eq "concat") {
3490 my $first = $self->re_dq($op->first, $extended);
3491 my $last = $self->re_dq($op->last, $extended);
3493 # Disambiguate "${foo}bar", "${foo}{bar}", "${foo}[1]"
3494 ($last =~ /^[A-Z\\\^\[\]_?]/ &&
3495 $first =~ s/([\$@])\^$/${1}{^}/) # "${^}W" etc
3496 || ($last =~ /^[{\[\w_]/ &&
3497 $first =~ s/([\$@])([A-Za-z_]\w*)$/${1}{$2}/);
3499 return $first . $last;
3500 } elsif ($type eq "uc") {
3501 return '\U' . $self->re_dq($op->first->sibling, $extended) . '\E';
3502 } elsif ($type eq "lc") {
3503 return '\L' . $self->re_dq($op->first->sibling, $extended) . '\E';
3504 } elsif ($type eq "ucfirst") {
3505 return '\u' . $self->re_dq($op->first->sibling, $extended);
3506 } elsif ($type eq "lcfirst") {
3507 return '\l' . $self->re_dq($op->first->sibling, $extended);
3508 } elsif ($type eq "quotemeta") {
3509 return '\Q' . $self->re_dq($op->first->sibling, $extended) . '\E';
3510 } elsif ($type eq "join") {
3511 return $self->deparse($op->last, 26); # was join($", @ary)
3513 return $self->deparse($op, 26);
3518 my ($self, $op) = @_;
3519 my $type = $op->name;
3521 if ($type eq 'const') {
3524 elsif ($type =~ /^[ul]c(first)?$/ || $type eq 'quotemeta') {
3525 return $self->pure_string($op->first->sibling);
3527 elsif ($type eq 'join') {
3528 my $join_op = $op->first->sibling; # Skip pushmark
3529 return 0 unless $join_op->name eq 'null' && $join_op->targ eq OP_RV2SV;
3531 my $gvop = $join_op->first;
3532 return 0 unless $gvop->name eq 'gvsv';
3533 return 0 unless '"' eq $self->gv_name($self->gv_or_padgv($gvop));
3535 return 0 unless ${$join_op->sibling} eq ${$op->last};
3536 return 0 unless $op->last->name =~ /^(rv2|pad)av$/;
3538 elsif ($type eq 'concat') {
3539 return $self->pure_string($op->first)
3540 && $self->pure_string($op->last);
3542 elsif (is_scalar($op) || $type =~ /^[ah]elem(fast)?$/) {
3554 my($op, $cx, $extended) = @_;
3555 my $kid = $op->first;
3556 $kid = $kid->first if $kid->name eq "regcmaybe";
3557 $kid = $kid->first if $kid->name eq "regcreset";
3558 return ($self->re_dq($kid, $extended), 1) if $self->pure_string($kid);
3559 return ($self->deparse($kid, $cx), 0);
3563 my ($self, $op, $cx) = @_;
3564 return (($self->regcomp($op, $cx, 0))[0]);
3567 # osmic acid -- see osmium tetroxide
3570 map($matchwords{join "", sort split //, $_} = $_, 'cig', 'cog', 'cos', 'cogs',
3571 'cox', 'go', 'is', 'ism', 'iso', 'mig', 'mix', 'osmic', 'ox', 'sic',
3572 'sig', 'six', 'smog', 'so', 'soc', 'sog', 'xi');
3576 my($op, $cx, $name, $delim) = @_;
3577 my $kid = $op->first;
3578 my ($binop, $var, $re) = ("", "", "");
3579 if ($op->flags & OPf_STACKED) {
3581 $var = $self->deparse($kid, 20);
3582 $kid = $kid->sibling;
3585 my $extended = ($op->pmflags & PMf_EXTENDED);
3587 my $unbacked = re_unback($op->precomp);
3589 $re = re_uninterp_extended(escape_extended_re($unbacked));
3591 $re = re_uninterp(escape_str(re_unback($op->precomp)));
3593 } elsif ($kid->name ne 'regcomp') {
3594 carp("found ".$kid->name." where regcomp expected");
3596 ($re, $quote) = $self->regcomp($kid, 1, $extended);
3599 $flags .= "c" if $op->pmflags & PMf_CONTINUE;
3600 $flags .= "g" if $op->pmflags & PMf_GLOBAL;
3601 $flags .= "i" if $op->pmflags & PMf_FOLD;
3602 $flags .= "m" if $op->pmflags & PMf_MULTILINE;
3603 $flags .= "o" if $op->pmflags & PMf_KEEP;
3604 $flags .= "s" if $op->pmflags & PMf_SINGLELINE;
3605 $flags .= "x" if $op->pmflags & PMf_EXTENDED;
3606 $flags = $matchwords{$flags} if $matchwords{$flags};
3607 if ($op->pmflags & PMf_ONCE) { # only one kind of delimiter works here
3611 $re = single_delim($name, $delim, $re);
3613 $re = $re . $flags if $quote;
3615 return $self->maybe_parens("$var =~ $re", $cx, 20);
3621 sub pp_match { matchop(@_, "m", "/") }
3622 sub pp_pushre { matchop(@_, "m", "/") }
3623 sub pp_qr { matchop(@_, "qr", "") }
3628 my($kid, @exprs, $ary, $expr);
3630 if ($ {$kid->pmreplroot}) {
3631 $ary = $self->stash_variable('@', $self->gv_name($kid->pmreplroot));
3633 for (; !null($kid); $kid = $kid->sibling) {
3634 push @exprs, $self->deparse($kid, 6);
3637 # handle special case of split(), and split(" ") that compiles to /\s+/
3639 if ($kid->flags & OPf_SPECIAL
3640 && $exprs[0] eq '/\\s+/'
3641 && $kid->pmflags & PMf_SKIPWHITE ) {
3645 $expr = "split(" . join(", ", @exprs) . ")";
3647 return $self->maybe_parens("$ary = $expr", $cx, 7);
3653 # oxime -- any of various compounds obtained chiefly by the action of
3654 # hydroxylamine on aldehydes and ketones and characterized by the
3655 # bivalent grouping C=NOH [Webster's Tenth]
3658 map($substwords{join "", sort split //, $_} = $_, 'ego', 'egoism', 'em',
3659 'es', 'ex', 'exes', 'gee', 'go', 'goes', 'ie', 'ism', 'iso', 'me',
3660 'meese', 'meso', 'mig', 'mix', 'os', 'ox', 'oxime', 'see', 'seem',
3661 'seg', 'sex', 'sig', 'six', 'smog', 'sog', 'some', 'xi');
3666 my $kid = $op->first;
3667 my($binop, $var, $re, $repl) = ("", "", "", "");
3668 if ($op->flags & OPf_STACKED) {
3670 $var = $self->deparse($kid, 20);
3671 $kid = $kid->sibling;
3674 if (null($op->pmreplroot)) {
3675 $repl = $self->dq($kid);
3676 $kid = $kid->sibling;
3678 $repl = $op->pmreplroot->first; # skip substcont
3679 while ($repl->name eq "entereval") {
3680 $repl = $repl->first;
3683 if ($op->pmflags & PMf_EVAL) {
3684 $repl = $self->deparse($repl, 0);
3686 $repl = $self->dq($repl);
3689 my $extended = ($op->pmflags & PMf_EXTENDED);
3691 my $unbacked = re_unback($op->precomp);
3693 $re = re_uninterp_extended(escape_extended_re($unbacked));
3696 $re = re_uninterp(escape_str($unbacked));
3699 ($re) = $self->regcomp($kid, 1, $extended);
3701 $flags .= "e" if $op->pmflags & PMf_EVAL;
3702 $flags .= "g" if $op->pmflags & PMf_GLOBAL;
3703 $flags .= "i" if $op->pmflags & PMf_FOLD;
3704 $flags .= "m" if $op->pmflags & PMf_MULTILINE;
3705 $flags .= "o" if $op->pmflags & PMf_KEEP;
3706 $flags .= "s" if $op->pmflags & PMf_SINGLELINE;
3707 $flags .= "x" if $extended;
3708 $flags = $substwords{$flags} if $substwords{$flags};
3710 return $self->maybe_parens("$var =~ s"
3711 . double_delim($re, $repl) . $flags,
3714 return "s". double_delim($re, $repl) . $flags;
3723 B::Deparse - Perl compiler backend to produce perl code
3727 B<perl> B<-MO=Deparse>[B<,-u>I<PACKAGE>][B<,-p>][B<,-q>][B<,-l>]
3728 [B<,-s>I<LETTERS>][B<,-x>I<LEVEL>] I<prog.pl>
3732 B::Deparse is a backend module for the Perl compiler that generates
3733 perl source code, based on the internal compiled structure that perl
3734 itself creates after parsing a program. The output of B::Deparse won't
3735 be exactly the same as the original source, since perl doesn't keep
3736 track of comments or whitespace, and there isn't a one-to-one
3737 correspondence between perl's syntactical constructions and their
3738 compiled form, but it will often be close. When you use the B<-p>
3739 option, the output also includes parentheses even when they are not
3740 required by precedence, which can make it easy to see if perl is
3741 parsing your expressions the way you intended.
3743 Please note that this module is mainly new and untested code and is
3744 still under development, so it may change in the future.
3748 As with all compiler backend options, these must follow directly after
3749 the '-MO=Deparse', separated by a comma but not any white space.
3755 Add '#line' declarations to the output based on the line and file
3756 locations of the original code.
3760 Print extra parentheses. Without this option, B::Deparse includes
3761 parentheses in its output only when they are needed, based on the
3762 structure of your program. With B<-p>, it uses parentheses (almost)
3763 whenever they would be legal. This can be useful if you are used to
3764 LISP, or if you want to see how perl parses your input. If you say
3766 if ($var & 0x7f == 65) {print "Gimme an A!"}
3767 print ($which ? $a : $b), "\n";
3768 $name = $ENV{USER} or "Bob";
3770 C<B::Deparse,-p> will print
3773 print('Gimme an A!')
3775 (print(($which ? $a : $b)), '???');
3776 (($name = $ENV{'USER'}) or '???')
3778 which probably isn't what you intended (the C<'???'> is a sign that
3779 perl optimized away a constant value).
3783 Expand double-quoted strings into the corresponding combinations of
3784 concatenation, uc, ucfirst, lc, lcfirst, quotemeta, and join. For
3787 print "Hello, $world, @ladies, \u$gentlemen\E, \u\L$me!";
3791 print 'Hello, ' . $world . ', ' . join($", @ladies) . ', '
3792 . ucfirst($gentlemen) . ', ' . ucfirst(lc $me . '!');
3794 Note that the expanded form represents the way perl handles such
3795 constructions internally -- this option actually turns off the reverse
3796 translation that B::Deparse usually does. On the other hand, note that
3797 C<$x = "$y"> is not the same as C<$x = $y>: the former makes the value
3798 of $y into a string before doing the assignment.
3802 Normally, B::Deparse deparses the main code of a program, and all the subs
3803 defined in the same file. To include subs defined in other files, pass the
3804 B<-f> option with the filename. You can pass the B<-f> option several times, to
3805 include more than one secondary file. (Most of the time you don't want to
3806 use it at all.) You can also use this option to include subs which are
3807 defined in the scope of a B<#line> directive with two parameters.
3809 =item B<-s>I<LETTERS>
3811 Tweak the style of B::Deparse's output. The letters should follow
3812 directly after the 's', with no space or punctuation. The following
3813 options are available:
3819 Cuddle C<elsif>, C<else>, and C<continue> blocks. For example, print
3836 The default is not to cuddle.
3840 Indent lines by multiples of I<NUMBER> columns. The default is 4 columns.
3844 Use tabs for each 8 columns of indent. The default is to use only spaces.
3845 For instance, if the style options are B<-si4T>, a line that's indented
3846 3 times will be preceded by one tab and four spaces; if the options were
3847 B<-si8T>, the same line would be preceded by three tabs.
3849 =item B<v>I<STRING>B<.>
3851 Print I<STRING> for the value of a constant that can't be determined
3852 because it was optimized away (mnemonic: this happens when a constant
3853 is used in B<v>oid context). The end of the string is marked by a period.
3854 The string should be a valid perl expression, generally a constant.
3855 Note that unless it's a number, it probably needs to be quoted, and on
3856 a command line quotes need to be protected from the shell. Some
3857 conventional values include 0, 1, 42, '', 'foo', and
3858 'Useless use of constant omitted' (which may need to be
3859 B<-sv"'Useless use of constant omitted'.">
3860 or something similar depending on your shell). The default is '???'.
3861 If you're using B::Deparse on a module or other file that's require'd,
3862 you shouldn't use a value that evaluates to false, since the customary
3863 true constant at the end of a module will be in void context when the
3864 file is compiled as a main program.
3870 Expand conventional syntax constructions into equivalent ones that expose
3871 their internal operation. I<LEVEL> should be a digit, with higher values
3872 meaning more expansion. As with B<-q>, this actually involves turning off
3873 special cases in B::Deparse's normal operations.
3875 If I<LEVEL> is at least 3, for loops will be translated into equivalent
3876 while loops with continue blocks; for instance
3878 for ($i = 0; $i < 10; ++$i) {
3891 Note that in a few cases this translation can't be perfectly carried back
3892 into the source code -- if the loop's initializer declares a my variable,
3893 for instance, it won't have the correct scope outside of the loop.
3895 If I<LEVEL> is at least 7, if statements will be translated into equivalent
3896 expressions using C<&&>, C<?:> and C<do {}>; for instance
3898 print 'hi' if $nice;
3910 $nice and print 'hi';
3911 $nice and do { print 'hi' };
3912 $nice ? do { print 'hi' } : do { print 'bye' };
3914 Long sequences of elsifs will turn into nested ternary operators, which
3915 B::Deparse doesn't know how to indent nicely.
3919 =head1 USING B::Deparse AS A MODULE
3924 $deparse = B::Deparse->new("-p", "-sC");
3925 $body = $deparse->coderef2text(\&func);
3926 eval "sub func $body"; # the inverse operation
3930 B::Deparse can also be used on a sub-by-sub basis from other perl
3935 $deparse = B::Deparse->new(OPTIONS)
3937 Create an object to store the state of a deparsing operation and any
3938 options. The options are the same as those that can be given on the
3939 command line (see L</OPTIONS>); options that are separated by commas
3940 after B<-MO=Deparse> should be given as separate strings. Some
3941 options, like B<-u>, don't make sense for a single subroutine, so
3944 =head2 ambient_pragmas
3946 $deparse->ambient_pragmas(strict => 'all', '$[' => $[);
3948 The compilation of a subroutine can be affected by a few compiler
3949 directives, B<pragmas>. These are:
3963 Assigning to the special variable $[
3983 Ordinarily, if you use B::Deparse on a subroutine which has
3984 been compiled in the presence of one or more of these pragmas,
3985 the output will include statements to turn on the appropriate
3986 directives. So if you then compile the code returned by coderef2text,
3987 it will behave the same way as the subroutine which you deparsed.
3989 However, you may know that you intend to use the results in a
3990 particular context, where some pragmas are already in scope. In
3991 this case, you use the B<ambient_pragmas> method to describe the
3992 assumptions you wish to make.
3994 Not all of the options currently have any useful effect. See
3995 L</BUGS> for more details.
3997 The parameters it accepts are:
4003 Takes a string, possibly containing several values separated
4004 by whitespace. The special values "all" and "none" mean what you'd
4007 $deparse->ambient_pragmas(strict => 'subs refs');
4011 Takes a number, the value of the array base $[.
4019 If the value is true, then the appropriate pragma is assumed to
4020 be in the ambient scope, otherwise not.
4024 Takes a string, possibly containing a whitespace-separated list of
4025 values. The values "all" and "none" are special. It's also permissible
4026 to pass an array reference here.
4028 $deparser->ambient_pragmas(re => 'eval');
4033 Takes a string, possibly containing a whitespace-separated list of
4034 values. The values "all" and "none" are special, again. It's also
4035 permissible to pass an array reference here.
4037 $deparser->ambient_pragmas(warnings => [qw[void io]]);
4039 If one of the values is the string "FATAL", then all the warnings
4040 in that list will be considered fatal, just as with the B<warnings>
4041 pragma itself. Should you need to specify that some warnings are
4042 fatal, and others are merely enabled, you can pass the B<warnings>
4045 $deparser->ambient_pragmas(
4047 warnings => [FATAL => qw/void io/],
4050 See L<perllexwarn> for more information about lexical warnings.
4056 These two parameters are used to specify the ambient pragmas in
4057 the format used by the special variables $^H and ${^WARNING_BITS}.
4059 They exist principally so that you can write code like:
4061 { my ($hint_bits, $warning_bits);
4062 BEGIN {($hint_bits, $warning_bits) = ($^H, ${^WARNING_BITS})}
4063 $deparser->ambient_pragmas (
4064 hint_bits => $hint_bits,
4065 warning_bits => $warning_bits,
4069 which specifies that the ambient pragmas are exactly those which
4070 are in scope at the point of calling.
4076 $body = $deparse->coderef2text(\&func)
4077 $body = $deparse->coderef2text(sub ($$) { ... })
4079 Return source code for the body of a subroutine (a block, optionally
4080 preceded by a prototype in parens), given a reference to the
4081 sub. Because a subroutine can have no names, or more than one name,
4082 this method doesn't return a complete subroutine definition -- if you
4083 want to eval the result, you should prepend "sub subname ", or "sub "
4084 for an anonymous function constructor. Unless the sub was defined in
4085 the main:: package, the code will include a package declaration.
4093 The only pragmas to be completely supported are: C<use warnings>,
4094 C<use strict 'refs'>, C<use bytes>, and C<use integer>. (C<$[>, which
4095 behaves like a pragma, is also supported.)
4097 Excepting those listed above, we're currently unable to guarantee that
4098 B::Deparse will produce a pragma at the correct point in the program.
4099 Since the effects of pragmas are often lexically scoped, this can mean
4100 that the pragma holds sway over a different portion of the program
4101 than in the input file.
4105 In fact, the above is a specific instance of a more general problem:
4106 we can't guarantee to produce BEGIN blocks or C<use> declarations in
4107 exactly the right place. So if you use a module which affects compilation
4108 (such as by over-riding keywords, overloading constants or whatever)
4109 then the output code might not work as intended.
4111 This is the most serious outstanding problem, and will be very hard
4116 If a keyword is over-ridden, and your program explicitly calls
4117 the built-in version by using CORE::keyword, the output of B::Deparse
4118 will not reflect this. If you run the resulting code, it will call
4119 the over-ridden version rather than the built-in one. (Maybe there
4120 should be an option to B<always> print keyword calls as C<CORE::name>.)
4124 C<sort foo (1, 2, 3)> comes out as C<sort (foo 1, 2, 3)>, which
4125 causes perl to issue a warning.
4127 The obvious fix doesn't work, because these are different:
4129 print (FOO 1, 2, 3), 4, 5, 6;
4130 print FOO (1, 2, 3), 4, 5, 6;
4134 Constants (other than simple strings or numbers) don't work properly.
4135 Pathological examples that fail (and probably always will) include:
4137 use constant E2BIG => ($!=7);
4138 use constant x=>\$x; print x
4140 The following could (and should) be made to work:
4142 use constant regex => qr/blah/;
4147 An input file that uses source filtering probably won't be deparsed into
4148 runnable code, because it will still include the B<use> declaration
4149 for the source filtering module, even though the code that is
4150 produced is already ordinary Perl which shouldn't be filtered again.
4154 There are probably many more bugs on non-ASCII platforms (EBCDIC).
4160 Stephen McCamant <smcc@CSUA.Berkeley.EDU>, based on an earlier
4161 version by Malcolm Beattie <mbeattie@sable.ox.ac.uk>, with
4162 contributions from Gisle Aas, James Duncan, Albert Dvornik, Robin
4163 Houston, Hugo van der Sanden, Gurusamy Sarathy, Nick Ing-Simmons,
4164 and Rafael Garcia-Suarez.