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 perlstring
12 OPf_WANT OPf_WANT_VOID OPf_WANT_SCALAR OPf_WANT_LIST
13 OPf_KIDS OPf_REF OPf_STACKED OPf_SPECIAL OPf_MOD
14 OPpLVAL_INTRO OPpOUR_INTRO OPpENTERSUB_AMPER OPpSLICE OPpCONST_BARE
15 OPpTRANS_SQUASH OPpTRANS_DELETE OPpTRANS_COMPLEMENT OPpTARGET_MY
16 OPpCONST_ARYBASE OPpEXISTS_SUB OPpSORT_NUMERIC OPpSORT_INTEGER
18 SVf_IOK SVf_NOK SVf_ROK SVf_POK SVpad_OUR SVf_FAKE
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)
109 # Changes between 0.62 and 0.63 (mostly by Rafael Garcia-Suarez)
112 # - support for command-line switches (-l, -0, etc.)
115 # (See also BUGS section at the end of this file)
117 # - finish tr/// changes
118 # - add option for even more parens (generalize \&foo change)
119 # - left/right context
120 # - treat top-level block specially for incremental output
121 # - copy comments (look at real text with $^P?)
122 # - avoid semis in one-statement blocks
123 # - associativity of &&=, ||=, ?:
124 # - ',' => '=>' (auto-unquote?)
125 # - break long lines ("\r" as discretionary break?)
126 # - configurable syntax highlighting: ANSI color, HTML, TeX, etc.
127 # - more style options: brace style, hex vs. octal, quotes, ...
128 # - print big ints as hex/octal instead of decimal (heuristic?)
129 # - handle `my $x if 0'?
130 # - coordinate with Data::Dumper (both directions? see previous)
131 # - version using op_next instead of op_first/sibling?
132 # - avoid string copies (pass arrays, one big join?)
135 # Tests that will always fail:
136 # (see t/TEST for the short list)
138 # Object fields (were globals):
141 # (local($a), local($b)) and local($a, $b) have the same internal
142 # representation but the short form looks better. We notice we can
143 # use a large-scale local when checking the list, but need to prevent
144 # individual locals too. This hash holds the addresses of OPs that
145 # have already had their local-ness accounted for. The same thing
149 # CV for current sub (or main program) being deparsed
152 # Cached hash of lexical variables for curcv: keys are names,
153 # each value is an array of pairs, indicating the cop_seq of scopes
154 # in which a var of that name is valid.
157 # COP for statement being deparsed
160 # name of the current package for deparsed code
163 # array of [cop_seq, CV, is_format?] for subs and formats we still
167 # as above, but [name, prototype] for subs that never got a GV
169 # subs_done, forms_done:
170 # keys are addresses of GVs for subs and formats we've already
171 # deparsed (or at least put into subs_todo)
174 # keys are names of subs for which we've printed declarations.
175 # That means we can omit parentheses from the arguments.
178 # Keeps track of fully qualified names of all deparsed subs.
183 # cuddle: ` ' or `\n', depending on -sC
188 # A little explanation of how precedence contexts and associativity
191 # deparse() calls each per-op subroutine with an argument $cx (short
192 # for context, but not the same as the cx* in the perl core), which is
193 # a number describing the op's parents in terms of precedence, whether
194 # they're inside an expression or at statement level, etc. (see
195 # chart below). When ops with children call deparse on them, they pass
196 # along their precedence. Fractional values are used to implement
197 # associativity (`($x + $y) + $z' => `$x + $y + $y') and related
198 # parentheses hacks. The major disadvantage of this scheme is that
199 # it doesn't know about right sides and left sides, so say if you
200 # assign a listop to a variable, it can't tell it's allowed to leave
201 # the parens off the listop.
204 # 26 [TODO] inside interpolation context ("")
205 # 25 left terms and list operators (leftward)
209 # 21 right ! ~ \ and unary + and -
214 # 16 nonassoc named unary operators
215 # 15 nonassoc < > <= >= lt gt le ge
216 # 14 nonassoc == != <=> eq ne cmp
223 # 7 right = += -= *= etc.
225 # 5 nonassoc list operators (rightward)
229 # 1 statement modifiers
232 # Also, lineseq may pass a fourth parameter to the pp_ routines:
233 # if present, the fourth parameter is passed on by deparse.
235 # If present and true, it means that the op exists directly as
236 # part of a lineseq. Currently it's only used by scopeop to
237 # decide whether its results need to be enclosed in a do {} block.
239 # Nonprinting characters with special meaning:
240 # \cS - steal parens (see maybe_parens_unop)
241 # \n - newline and indent
242 # \t - increase indent
243 # \b - decrease indent (`outdent')
244 # \f - flush left (no indent)
245 # \cK - kill following semicolon, if any
249 return class($op) eq "NULL";
254 my($cv, $is_form) = @_;
255 return unless ($cv->FILE eq $0 || exists $self->{files}{$cv->FILE});
257 if (!null($cv->START) and is_state($cv->START)) {
258 $seq = $cv->START->cop_seq;
262 push @{$self->{'subs_todo'}}, [$seq, $cv, $is_form];
263 unless ($is_form || class($cv->STASH) eq 'SPECIAL') {
264 $self->{'subs_deparsed'}{$cv->STASH->NAME."::".$cv->GV->NAME} = 1;
270 my $ent = shift @{$self->{'subs_todo'}};
273 my $name = $self->gv_name($gv);
275 return "format $name =\n"
276 . $self->deparse_format($ent->[1]). "\n";
278 $self->{'subs_declared'}{$name} = 1;
279 if ($name eq "BEGIN") {
280 my $use_dec = $self->begin_is_use($cv);
281 if (defined ($use_dec)) {
282 return () if 0 == length($use_dec);
287 if ($self->{'linenums'}) {
288 my $line = $gv->LINE;
289 my $file = $gv->FILE;
290 $l = "\n\f#line $line \"$file\"\n";
292 return "${l}sub $name " . $self->deparse_sub($cv);
296 # Return a "use" declaration for this BEGIN block, if appropriate
298 my ($self, $cv) = @_;
299 my $root = $cv->ROOT;
300 local @$self{qw'curcv curcvlex'} = ($cv);
302 #B::walkoptree($cv->ROOT, "debug");
303 my $lineseq = $root->first;
304 return if $lineseq->name ne "lineseq";
306 my $req_op = $lineseq->first->sibling;
307 return if $req_op->name ne "require";
310 if ($req_op->first->private & OPpCONST_BARE) {
311 # Actually it should always be a bareword
312 $module = $self->const_sv($req_op->first)->PV;
313 $module =~ s[/][::]g;
317 $module = const($self->const_sv($req_op->first));
321 my $version_op = $req_op->sibling;
322 return if class($version_op) eq "NULL";
323 if ($version_op->name eq "lineseq") {
324 # We have a version parameter; skip nextstate & pushmark
325 my $constop = $version_op->first->next->next;
327 return unless $self->const_sv($constop)->PV eq $module;
328 $constop = $constop->sibling;
329 $version = $self->const_sv($constop)->int_value;
330 $constop = $constop->sibling;
331 return if $constop->name ne "method_named";
332 return if $self->const_sv($constop)->PV ne "VERSION";
335 $lineseq = $version_op->sibling;
336 return if $lineseq->name ne "lineseq";
337 my $entersub = $lineseq->first->sibling;
338 if ($entersub->name eq "stub") {
339 return "use $module $version ();\n" if defined $version;
340 return "use $module ();\n";
342 return if $entersub->name ne "entersub";
344 # See if there are import arguments
347 my $svop = $entersub->first->sibling; # Skip over pushmark
348 return unless $self->const_sv($svop)->PV eq $module;
350 # Pull out the arguments
351 for ($svop=$svop->sibling; $svop->name ne "method_named";
352 $svop = $svop->sibling) {
353 $args .= ", " if length($args);
354 $args .= $self->deparse($svop, 6);
358 my $method_named = $svop;
359 return if $method_named->name ne "method_named";
360 my $method_name = $self->const_sv($method_named)->PV;
362 if ($method_name eq "unimport") {
366 # Certain pragmas are dealt with using hint bits,
367 # so we ignore them here
368 if ($module eq 'strict' || $module eq 'integer'
369 || $module eq 'bytes' || $module eq 'warnings') {
373 if (defined $version && length $args) {
374 return "$use $module $version ($args);\n";
375 } elsif (defined $version) {
376 return "$use $module $version;\n";
377 } elsif (length $args) {
378 return "$use $module ($args);\n";
380 return "$use $module;\n";
385 my ($self, $pack) = @_;
387 if (!defined $pack) {
392 $pack =~ s/(::)?$/::/;
396 my %stash = svref_2object($stash)->ARRAY;
397 while (my ($key, $val) = each %stash) {
398 next if $key eq 'main::'; # avoid infinite recursion
399 my $class = class($val);
400 if ($class eq "PV") {
401 # Just a prototype. As an ugly but fairly effective way
402 # to find out if it belongs here is to see if the AUTOLOAD
403 # (if any) for the stash was defined in one of our files.
404 my $A = $stash{"AUTOLOAD"};
405 if (defined ($A) && class($A) eq "GV" && defined($A->CV)
406 && class($A->CV) eq "CV") {
408 next unless $AF eq $0 || exists $self->{'files'}{$AF};
410 push @{$self->{'protos_todo'}}, [$pack . $key, $val->PV];
411 } elsif ($class eq "IV") {
412 # Just a name. As above.
413 my $A = $stash{"AUTOLOAD"};
414 if (defined ($A) && class($A) eq "GV" && defined($A->CV)
415 && class($A->CV) eq "CV") {
417 next unless $AF eq $0 || exists $self->{'files'}{$AF};
419 push @{$self->{'protos_todo'}}, [$pack . $key, undef];
420 } elsif ($class eq "GV") {
421 if (class(my $cv = $val->CV) ne "SPECIAL") {
422 next if $self->{'subs_done'}{$$val}++;
423 next if $$val != ${$cv->GV}; # Ignore imposters
426 if (class(my $cv = $val->FORM) ne "SPECIAL") {
427 next if $self->{'forms_done'}{$$val}++;
428 next if $$val != ${$cv->GV}; # Ignore imposters
431 if (class($val->HV) ne "SPECIAL" && $key =~ /::$/) {
432 $self->stash_subs($pack . $key);
442 foreach $ar (@{$self->{'protos_todo'}}) {
443 my $proto = (defined $ar->[1] ? " (". $ar->[1] . ")" : "");
444 push @ret, "sub " . $ar->[0] . "$proto;\n";
446 delete $self->{'protos_todo'};
454 while (length($opt = substr($opts, 0, 1))) {
456 $self->{'cuddle'} = " ";
457 $opts = substr($opts, 1);
458 } elsif ($opt eq "i") {
459 $opts =~ s/^i(\d+)//;
460 $self->{'indent_size'} = $1;
461 } elsif ($opt eq "T") {
462 $self->{'use_tabs'} = 1;
463 $opts = substr($opts, 1);
464 } elsif ($opt eq "v") {
465 $opts =~ s/^v([^.]*)(.|$)//;
466 $self->{'ex_const'} = $1;
473 my $self = bless {}, $class;
474 $self->{'subs_todo'} = [];
475 $self->{'files'} = {};
476 $self->{'curstash'} = "main";
477 $self->{'curcop'} = undef;
478 $self->{'cuddle'} = "\n";
479 $self->{'indent_size'} = 4;
480 $self->{'use_tabs'} = 0;
481 $self->{'expand'} = 0;
482 $self->{'unquote'} = 0;
483 $self->{'linenums'} = 0;
484 $self->{'parens'} = 0;
485 $self->{'ex_const'} = "'???'";
487 $self->{'ambient_arybase'} = 0;
488 $self->{'ambient_warnings'} = undef; # Assume no lexical warnings
489 $self->{'ambient_hints'} = 0;
492 while (my $arg = shift @_) {
493 if ($arg =~ /^-f(.*)/) {
494 $self->{'files'}{$1} = 1;
495 } elsif ($arg eq "-p") {
496 $self->{'parens'} = 1;
497 } elsif ($arg eq "-P") {
498 $self->{'noproto'} = 1;
499 } elsif ($arg eq "-l") {
500 $self->{'linenums'} = 1;
501 } elsif ($arg eq "-q") {
502 $self->{'unquote'} = 1;
503 } elsif (substr($arg, 0, 2) eq "-s") {
504 $self->style_opts(substr $arg, 2);
505 } elsif ($arg =~ /^-x(\d)$/) {
506 $self->{'expand'} = $1;
513 # Mask out the bits that L<warnings::register> uses
516 $WARN_MASK = $warnings::Bits{all} | $warnings::DeadBits{all};
523 # Initialise the contextual information, either from
524 # defaults provided with the ambient_pragmas method,
525 # or from perl's own defaults otherwise.
529 $self->{'arybase'} = $self->{'ambient_arybase'};
530 $self->{'warnings'} = defined ($self->{'ambient_warnings'})
531 ? $self->{'ambient_warnings'} & WARN_MASK
533 $self->{'hints'} = $self->{'ambient_hints'} & 0xFF;
535 # also a convenient place to clear out subs_declared
536 delete $self->{'subs_declared'};
542 my $self = B::Deparse->new(@args);
543 # First deparse command-line args
544 if (defined $^I) { # deparse -i
545 print q(BEGIN { $^I = ).perlstring($^I).qq(; }\n);
547 if ($^W) { # deparse -w
548 print qq(BEGIN { \$^W = $^W; }\n);
550 if ($/ ne "\n" or defined $O::savebackslash) { # deparse -l and -0
551 my $fs = perlstring($/) || 'undef';
552 my $bs = perlstring($O::savebackslash) || 'undef';
553 print qq(BEGIN { \$/ = $fs; \$\\ = $bs; }\n);
555 my @BEGINs = B::begin_av->isa("B::AV") ? B::begin_av->ARRAY : ();
556 my @CHECKs = B::check_av->isa("B::AV") ? B::check_av->ARRAY : ();
557 my @INITs = B::init_av->isa("B::AV") ? B::init_av->ARRAY : ();
558 my @ENDs = B::end_av->isa("B::AV") ? B::end_av->ARRAY : ();
559 for my $block (@BEGINs, @CHECKs, @INITs, @ENDs) {
560 $self->todo($block, 0);
563 $self->{'curcv'} = main_cv;
564 $self->{'curcvlex'} = undef;
565 print $self->print_protos;
566 @{$self->{'subs_todo'}} =
567 sort {$a->[0] <=> $b->[0]} @{$self->{'subs_todo'}};
568 print $self->indent($self->deparse(main_root, 0)), "\n"
569 unless null main_root;
571 while (scalar(@{$self->{'subs_todo'}})) {
572 push @text, $self->next_todo;
574 print $self->indent(join("", @text)), "\n" if @text;
576 # Print __DATA__ section, if necessary
578 my $laststash = defined $self->{'curcop'}
579 ? $self->{'curcop'}->stash->NAME : $self->{'curstash'};
580 if (defined *{$laststash."::DATA"}{IO}) {
582 print readline(*{$laststash."::DATA"});
590 croak "Usage: ->coderef2text(CODEREF)" unless UNIVERSAL::isa($sub, "CODE");
593 return $self->indent($self->deparse_sub(svref_2object($sub)));
596 sub ambient_pragmas {
598 my ($arybase, $hint_bits, $warning_bits) = (0, 0);
604 if ($name eq 'strict') {
607 if ($val eq 'none') {
608 $hint_bits &= ~strict::bits(qw/refs subs vars/);
614 @names = qw/refs subs vars/;
620 @names = split' ', $val;
622 $hint_bits |= strict::bits(@names);
625 elsif ($name eq '$[') {
629 elsif ($name eq 'integer'
631 || $name eq 'utf8') {
634 $hint_bits |= ${$::{"${name}::"}{"hint_bits"}};
637 $hint_bits &= ~${$::{"${name}::"}{"hint_bits"}};
641 elsif ($name eq 're') {
643 if ($val eq 'none') {
644 $hint_bits &= ~re::bits(qw/taint eval/);
650 @names = qw/taint eval/;
656 @names = split' ',$val;
658 $hint_bits |= re::bits(@names);
661 elsif ($name eq 'warnings') {
662 if ($val eq 'none') {
663 $warning_bits = $warnings::NONE;
672 @names = split/\s+/, $val;
675 $warning_bits = $warnings::NONE if !defined ($warning_bits);
676 $warning_bits |= warnings::bits(@names);
679 elsif ($name eq 'warning_bits') {
680 $warning_bits = $val;
683 elsif ($name eq 'hint_bits') {
688 croak "Unknown pragma type: $name";
692 croak "The ambient_pragmas method expects an even number of args";
695 $self->{'ambient_arybase'} = $arybase;
696 $self->{'ambient_warnings'} = $warning_bits;
697 $self->{'ambient_hints'} = $hint_bits;
702 my($op, $cx, $flags) = @_;
704 Carp::confess("Null op in deparse") if !defined($op)
705 || class($op) eq "NULL";
706 my $meth = "pp_" . $op->name;
708 return $self->$meth($op, $cx, $flags);
710 return $self->$meth($op, $cx);
716 my @lines = split(/\n/, $txt);
721 my $cmd = substr($line, 0, 1);
722 if ($cmd eq "\t" or $cmd eq "\b") {
723 $level += ($cmd eq "\t" ? 1 : -1) * $self->{'indent_size'};
724 if ($self->{'use_tabs'}) {
725 $leader = "\t" x ($level / 8) . " " x ($level % 8);
727 $leader = " " x $level;
729 $line = substr($line, 1);
731 if (substr($line, 0, 1) eq "\f") {
732 $line = substr($line, 1); # no indent
734 $line = $leader . $line;
738 return join("\n", @lines);
745 Carp::confess("NULL in deparse_sub") if !defined($cv) || $cv->isa("B::NULL");
746 Carp::confess("SPECIAL in deparse_sub") if $cv->isa("B::SPECIAL");
747 local $self->{'curcop'} = $self->{'curcop'};
748 if ($cv->FLAGS & SVf_POK) {
749 $proto = "(". $cv->PV . ") ";
751 if ($cv->CvFLAGS & (CVf_METHOD|CVf_LOCKED|CVf_LVALUE)) {
753 $proto .= "lvalue " if $cv->CvFLAGS & CVf_LVALUE;
754 $proto .= "locked " if $cv->CvFLAGS & CVf_LOCKED;
755 $proto .= "method " if $cv->CvFLAGS & CVf_METHOD;
758 local($self->{'curcv'}) = $cv;
759 local($self->{'curcvlex'});
760 local(@$self{qw'curstash warnings hints'})
761 = @$self{qw'curstash warnings hints'};
763 if (not null $cv->ROOT) {
764 my $lineseq = $cv->ROOT->first;
765 if ($lineseq->name eq "lineseq") {
767 for(my$o=$lineseq->first; $$o; $o=$o->sibling) {
770 $body = $self->lineseq(undef, @ops).";";
771 my $scope_en = $self->find_scope_en($lineseq);
772 if (defined $scope_en) {
773 my $subs = join"", $self->seq_subs($scope_en);
774 $body .= ";\n$subs" if length($subs);
778 $body = $self->deparse($cv->ROOT->first, 0);
782 my $sv = $cv->const_sv;
784 # uh-oh. inlinable sub... format it differently
785 return $proto . "{ " . const($sv) . " }\n";
786 } else { # XSUB? (or just a declaration)
790 return $proto ."{\n\t$body\n\b}" ."\n";
797 local($self->{'curcv'}) = $form;
798 local($self->{'curcvlex'});
799 local($self->{'in_format'}) = 1;
800 local(@$self{qw'curstash warnings hints'})
801 = @$self{qw'curstash warnings hints'};
802 my $op = $form->ROOT;
804 return "\f." if $op->first->name eq 'stub'
805 || $op->first->name eq 'nextstate';
806 $op = $op->first->first; # skip leavewrite, lineseq
807 while (not null $op) {
808 $op = $op->sibling; # skip nextstate
810 $kid = $op->first->sibling; # skip pushmark
811 push @text, "\f".$self->const_sv($kid)->PV;
812 $kid = $kid->sibling;
813 for (; not null $kid; $kid = $kid->sibling) {
814 push @exprs, $self->deparse($kid, 0);
816 push @text, "\f".join(", ", @exprs)."\n" if @exprs;
819 return join("", @text) . "\f.";
824 return $op->name eq "leave" || $op->name eq "scope"
825 || $op->name eq "lineseq"
826 || ($op->name eq "null" && class($op) eq "UNOP"
827 && (is_scope($op->first) || $op->first->name eq "enter"));
831 my $name = $_[0]->name;
832 return $name eq "nextstate" || $name eq "dbstate" || $name eq "setstate";
835 sub is_miniwhile { # check for one-line loop (`foo() while $y--')
837 return (!null($op) and null($op->sibling)
838 and $op->name eq "null" and class($op) eq "UNOP"
839 and (($op->first->name =~ /^(and|or)$/
840 and $op->first->first->sibling->name eq "lineseq")
841 or ($op->first->name eq "lineseq"
842 and not null $op->first->first->sibling
843 and $op->first->first->sibling->name eq "unstack")
849 return ($op->name eq "rv2sv" or
850 $op->name eq "padsv" or
851 $op->name eq "gv" or # only in array/hash constructs
852 $op->flags & OPf_KIDS && !null($op->first)
853 && $op->first->name eq "gvsv");
858 my($text, $cx, $prec) = @_;
859 if ($prec < $cx # unary ops nest just fine
860 or $prec == $cx and $cx != 4 and $cx != 16 and $cx != 21
861 or $self->{'parens'})
864 # In a unop, let parent reuse our parens; see maybe_parens_unop
865 $text = "\cS" . $text if $cx == 16;
872 # same as above, but get around the `if it looks like a function' rule
873 sub maybe_parens_unop {
875 my($name, $kid, $cx) = @_;
876 if ($cx > 16 or $self->{'parens'}) {
877 $kid = $self->deparse($kid, 1);
878 if ($name eq "umask" && $kid =~ /^\d+$/) {
879 $kid = sprintf("%#o", $kid);
881 return "$name($kid)";
883 $kid = $self->deparse($kid, 16);
884 if ($name eq "umask" && $kid =~ /^\d+$/) {
885 $kid = sprintf("%#o", $kid);
887 if (substr($kid, 0, 1) eq "\cS") {
889 return $name . substr($kid, 1);
890 } elsif (substr($kid, 0, 1) eq "(") {
891 # avoid looks-like-a-function trap with extra parens
892 # (`+' can lead to ambiguities)
893 return "$name(" . $kid . ")";
900 sub maybe_parens_func {
902 my($func, $text, $cx, $prec) = @_;
903 if ($prec <= $cx or substr($text, 0, 1) eq "(" or $self->{'parens'}) {
904 return "$func($text)";
906 return "$func $text";
912 my($op, $cx, $text) = @_;
913 my $our_intro = ($op->name =~ /^(gv|rv2)[ash]v$/) ? OPpOUR_INTRO : 0;
914 if ($op->private & (OPpLVAL_INTRO|$our_intro)
915 and not $self->{'avoid_local'}{$$op}) {
916 my $our_local = ($op->private & OPpLVAL_INTRO) ? "local" : "our";
917 if (want_scalar($op)) {
918 return "$our_local $text";
920 return $self->maybe_parens_func("$our_local", $text, $cx, 16);
929 my($op, $cx, $func, @args) = @_;
930 if ($op->private & OPpTARGET_MY) {
931 my $var = $self->padname($op->targ);
932 my $val = $func->($self, $op, 7, @args);
933 return $self->maybe_parens("$var = $val", $cx, 7);
935 return $func->($self, $op, $cx, @args);
942 return (($self->{'curcv'}->PADLIST->ARRAY)[0]->ARRAY)[$targ];
947 my($op, $cx, $text) = @_;
948 if ($op->private & OPpLVAL_INTRO and not $self->{'avoid_local'}{$$op}) {
949 if (want_scalar($op)) {
952 return $self->maybe_parens_func("my", $text, $cx, 16);
959 # The following OPs don't have functions:
961 # pp_padany -- does not exist after parsing
964 if ($AUTOLOAD =~ s/^.*::pp_//) {
965 warn "unexpected OP_".uc $AUTOLOAD;
968 die "Undefined subroutine $AUTOLOAD called";
972 sub DESTROY {} # Do not AUTOLOAD
974 # $root should be the op which represents the root of whatever
975 # we're sequencing here. If it's undefined, then we don't append
976 # any subroutine declarations to the deparsed ops, otherwise we
977 # append appropriate declarations.
979 my($self, $root, @ops) = @_;
982 my $out_cop = $self->{'curcop'};
983 my $out_seq = defined($out_cop) ? $out_cop->cop_seq : undef;
986 $limit_seq = $out_seq;
987 my $nseq = $self->find_scope_st($root->sibling) if ${$root->sibling};
988 $limit_seq = $nseq if !defined($limit_seq)
989 or defined($nseq) && $nseq < $limit_seq;
991 $limit_seq = $self->{'limit_seq'}
992 if defined($self->{'limit_seq'})
993 && (!defined($limit_seq) || $self->{'limit_seq'} < $limit_seq);
994 local $self->{'limit_seq'} = $limit_seq;
995 for (my $i = 0; $i < @ops; $i++) {
997 if (is_state $ops[$i]) {
998 $expr = $self->deparse($ops[$i], 0);
1005 if (!is_state $ops[$i] and (my $ls = $ops[$i+1]) and
1006 !null($ops[$i+1]) and $ops[$i+1]->name eq "lineseq")
1008 if ($ls->first && !null($ls->first) && is_state($ls->first)
1009 && (my $sib = $ls->first->sibling)) {
1010 if (!null($sib) && $sib->name eq "leaveloop") {
1011 push @exprs, $expr . $self->for_loop($ops[$i], 0);
1017 $expr .= $self->deparse($ops[$i], 0, (@ops != 1));
1018 $expr =~ s/;\n?\z//;
1021 my $body = join(";\n", grep {length} @exprs);
1023 if (defined $root && defined $limit_seq && !$self->{'in_format'}) {
1024 $subs = join "\n", $self->seq_subs($limit_seq);
1026 return join(";\n", grep {length} $body, $subs);
1030 my($real_block, $self, $op, $cx, $flags) = @_;
1034 local(@$self{qw'curstash warnings hints'})
1035 = @$self{qw'curstash warnings hints'} if $real_block;
1037 $kid = $op->first->sibling; # skip enter
1038 if (is_miniwhile($kid)) {
1039 my $top = $kid->first;
1040 my $name = $top->name;
1041 if ($name eq "and") {
1043 } elsif ($name eq "or") {
1045 } else { # no conditional -> while 1 or until 0
1046 return $self->deparse($top->first, 1) . " while 1";
1048 my $cond = $top->first;
1049 my $body = $cond->sibling->first; # skip lineseq
1050 $cond = $self->deparse($cond, 1);
1051 $body = $self->deparse($body, 1);
1052 return "$body $name $cond";
1057 for (; !null($kid); $kid = $kid->sibling) {
1060 if ($flags || $cx > 0) { # inside an expression, (a do {} while for lineseq)
1061 return "do {\n\t" . $self->lineseq($op, @kids) . "\n\b}";
1063 my $lineseq = $self->lineseq($op, @kids);
1064 return (length ($lineseq) ? "$lineseq;" : "");
1068 sub pp_scope { scopeop(0, @_); }
1069 sub pp_lineseq { scopeop(0, @_); }
1070 sub pp_leave { scopeop(1, @_); }
1072 # The BEGIN {} is used here because otherwise this code isn't executed
1073 # when you run B::Deparse on itself.
1075 BEGIN { map($globalnames{$_}++, "SIG", "STDIN", "STDOUT", "STDERR", "INC",
1076 "ENV", "ARGV", "ARGVOUT", "_"); }
1081 Carp::confess() if $gv->isa("B::CV");
1082 my $stash = $gv->STASH->NAME;
1083 my $name = $gv->SAFENAME;
1084 if (($stash eq 'main' && $globalnames{$name})
1085 or ($stash eq $self->{'curstash'} && !$globalnames{$name})
1086 or $name =~ /^[^A-Za-z_]/)
1090 $stash = $stash . "::";
1092 if ($name =~ /^(\^..|{)/) {
1093 $name = "{$name}"; # ${^WARNING_BITS}, etc and ${
1095 return $stash . $name;
1098 # Return the name to use for a stash variable.
1099 # If a lexical with the same name is in scope, it may need to be
1101 sub stash_variable {
1102 my ($self, $prefix, $name) = @_;
1104 return "$prefix$name" if $name =~ /::/;
1106 unless ($prefix eq '$' || $prefix eq '@' ||
1107 $prefix eq '%' || $prefix eq '$#') {
1108 return "$prefix$name";
1111 my $v = ($prefix eq '$#' ? '@' : $prefix) . $name;
1112 return $prefix .$self->{'curstash'}.'::'. $name if $self->lex_in_scope($v);
1113 return "$prefix$name";
1117 my ($self, $name) = @_;
1118 $self->populate_curcvlex() if !defined $self->{'curcvlex'};
1120 return 0 if !defined($self->{'curcop'});
1121 my $seq = $self->{'curcop'}->cop_seq;
1122 return 0 if !exists $self->{'curcvlex'}{$name};
1123 for my $a (@{$self->{'curcvlex'}{$name}}) {
1124 my ($st, $en) = @$a;
1125 return 1 if $seq > $st && $seq <= $en;
1130 sub populate_curcvlex {
1132 for (my $cv = $self->{'curcv'}; class($cv) eq "CV"; $cv = $cv->OUTSIDE) {
1133 my $padlist = $cv->PADLIST;
1134 # an undef CV still in lexical chain
1135 next if class($padlist) eq "SPECIAL";
1136 my @padlist = $padlist->ARRAY;
1137 my @ns = $padlist[0]->ARRAY;
1139 for (my $i=0; $i<@ns; ++$i) {
1140 next if class($ns[$i]) eq "SPECIAL";
1141 next if $ns[$i]->FLAGS & SVpad_OUR; # Skip "our" vars
1142 if (class($ns[$i]) eq "PV") {
1143 # Probably that pesky lexical @_
1146 my $name = $ns[$i]->PVX;
1147 my ($seq_st, $seq_en) =
1148 ($ns[$i]->FLAGS & SVf_FAKE)
1150 : ($ns[$i]->NVX, $ns[$i]->IVX);
1152 push @{$self->{'curcvlex'}{$name}}, [$seq_st, $seq_en];
1157 sub find_scope_st { ((find_scope(@_))[0]); }
1158 sub find_scope_en { ((find_scope(@_))[1]); }
1160 # Recurses down the tree, looking for pad variable introductions and COPs
1162 my ($self, $op, $scope_st, $scope_en) = @_;
1163 carp("Undefined op in find_scope") if !defined $op;
1164 return ($scope_st, $scope_en) unless $op->flags & OPf_KIDS;
1166 for (my $o=$op->first; $$o; $o=$o->sibling) {
1167 if ($o->name =~ /^pad.v$/ && $o->private & OPpLVAL_INTRO) {
1168 my $s = int($self->padname_sv($o->targ)->NVX);
1169 my $e = $self->padname_sv($o->targ)->IVX;
1170 $scope_st = $s if !defined($scope_st) || $s < $scope_st;
1171 $scope_en = $e if !defined($scope_en) || $e > $scope_en;
1173 elsif (is_state($o)) {
1174 my $c = $o->cop_seq;
1175 $scope_st = $c if !defined($scope_st) || $c < $scope_st;
1176 $scope_en = $c if !defined($scope_en) || $c > $scope_en;
1178 elsif ($o->flags & OPf_KIDS) {
1179 ($scope_st, $scope_en) =
1180 $self->find_scope($o, $scope_st, $scope_en)
1184 return ($scope_st, $scope_en);
1187 # Returns a list of subs which should be inserted before the COP
1189 my ($self, $op, $out_seq) = @_;
1190 my $seq = $op->cop_seq;
1191 # If we have nephews, then our sequence number indicates
1192 # the cop_seq of the end of some sort of scope.
1193 if (class($op->sibling) ne "NULL" && $op->sibling->flags & OPf_KIDS
1194 and my $nseq = $self->find_scope_st($op->sibling) ) {
1197 $seq = $out_seq if defined($out_seq) && $out_seq < $seq;
1198 return $self->seq_subs($seq);
1202 my ($self, $seq) = @_;
1204 #push @text, "# ($seq)\n";
1206 return "" if !defined $seq;
1207 while (scalar(@{$self->{'subs_todo'}})
1208 and $seq > $self->{'subs_todo'}[0][0]) {
1209 push @text, $self->next_todo;
1214 # Notice how subs and formats are inserted between statements here;
1215 # also $[ assignments and pragmas.
1219 $self->{'curcop'} = $op;
1221 push @text, $self->cop_subs($op);
1222 push @text, $op->label . ": " if $op->label;
1223 my $stash = $op->stashpv;
1224 if ($stash ne $self->{'curstash'}) {
1225 push @text, "package $stash;\n";
1226 $self->{'curstash'} = $stash;
1228 if ($self->{'linenums'}) {
1229 push @text, "\f#line " . $op->line .
1230 ' "' . $op->file, qq'"\n';
1233 if ($self->{'arybase'} != $op->arybase) {
1234 push @text, '$[ = '. $op->arybase .";\n";
1235 $self->{'arybase'} = $op->arybase;
1238 my $warnings = $op->warnings;
1240 if ($warnings->isa("B::SPECIAL") && $$warnings == 4) {
1241 $warning_bits = $warnings::Bits{"all"} & WARN_MASK;
1243 elsif ($warnings->isa("B::SPECIAL") && $$warnings == 5) {
1244 $warning_bits = $warnings::NONE;
1246 elsif ($warnings->isa("B::SPECIAL")) {
1247 $warning_bits = undef;
1250 $warning_bits = $warnings->PV & WARN_MASK;
1253 if (defined ($warning_bits) and
1254 !defined($self->{warnings}) || $self->{'warnings'} ne $warning_bits) {
1255 push @text, declare_warnings($self->{'warnings'}, $warning_bits);
1256 $self->{'warnings'} = $warning_bits;
1259 if ($self->{'hints'} != $op->private) {
1260 push @text, declare_hints($self->{'hints'}, $op->private);
1261 $self->{'hints'} = $op->private;
1264 return join("", @text);
1267 sub declare_warnings {
1268 my ($from, $to) = @_;
1269 if (($to & WARN_MASK) eq warnings::bits("all")) {
1270 return "use warnings;\n";
1272 elsif (($to & WARN_MASK) eq "\0"x length($to)) {
1273 return "no warnings;\n";
1275 return "BEGIN {\${^WARNING_BITS} = ".perlstring($to)."}\n";
1279 my ($from, $to) = @_;
1280 my $use = $to & ~$from;
1281 my $no = $from & ~$to;
1283 for my $pragma (hint_pragmas($use)) {
1284 $decls .= "use $pragma;\n";
1286 for my $pragma (hint_pragmas($no)) {
1287 $decls .= "no $pragma;\n";
1295 push @pragmas, "integer" if $bits & 0x1;
1296 push @pragmas, "strict 'refs'" if $bits & 0x2;
1297 push @pragmas, "bytes" if $bits & 0x8;
1301 sub pp_dbstate { pp_nextstate(@_) }
1302 sub pp_setstate { pp_nextstate(@_) }
1304 sub pp_unstack { return "" } # see also leaveloop
1308 my($op, $cx, $name) = @_;
1314 my($op, $cx, $name) = @_;
1322 sub pp_wantarray { baseop(@_, "wantarray") }
1323 sub pp_fork { baseop(@_, "fork") }
1324 sub pp_wait { maybe_targmy(@_, \&baseop, "wait") }
1325 sub pp_getppid { maybe_targmy(@_, \&baseop, "getppid") }
1326 sub pp_time { maybe_targmy(@_, \&baseop, "time") }
1327 sub pp_tms { baseop(@_, "times") }
1328 sub pp_ghostent { baseop(@_, "gethostent") }
1329 sub pp_gnetent { baseop(@_, "getnetent") }
1330 sub pp_gprotoent { baseop(@_, "getprotoent") }
1331 sub pp_gservent { baseop(@_, "getservent") }
1332 sub pp_ehostent { baseop(@_, "endhostent") }
1333 sub pp_enetent { baseop(@_, "endnetent") }
1334 sub pp_eprotoent { baseop(@_, "endprotoent") }
1335 sub pp_eservent { baseop(@_, "endservent") }
1336 sub pp_gpwent { baseop(@_, "getpwent") }
1337 sub pp_spwent { baseop(@_, "setpwent") }
1338 sub pp_epwent { baseop(@_, "endpwent") }
1339 sub pp_ggrent { baseop(@_, "getgrent") }
1340 sub pp_sgrent { baseop(@_, "setgrent") }
1341 sub pp_egrent { baseop(@_, "endgrent") }
1342 sub pp_getlogin { baseop(@_, "getlogin") }
1344 sub POSTFIX () { 1 }
1346 # I couldn't think of a good short name, but this is the category of
1347 # symbolic unary operators with interesting precedence
1351 my($op, $cx, $name, $prec, $flags) = (@_, 0);
1352 my $kid = $op->first;
1353 $kid = $self->deparse($kid, $prec);
1354 return $self->maybe_parens(($flags & POSTFIX) ? "$kid$name" : "$name$kid",
1358 sub pp_preinc { pfixop(@_, "++", 23) }
1359 sub pp_predec { pfixop(@_, "--", 23) }
1360 sub pp_postinc { maybe_targmy(@_, \&pfixop, "++", 23, POSTFIX) }
1361 sub pp_postdec { maybe_targmy(@_, \&pfixop, "--", 23, POSTFIX) }
1362 sub pp_i_preinc { pfixop(@_, "++", 23) }
1363 sub pp_i_predec { pfixop(@_, "--", 23) }
1364 sub pp_i_postinc { maybe_targmy(@_, \&pfixop, "++", 23, POSTFIX) }
1365 sub pp_i_postdec { maybe_targmy(@_, \&pfixop, "--", 23, POSTFIX) }
1366 sub pp_complement { maybe_targmy(@_, \&pfixop, "~", 21) }
1368 sub pp_negate { maybe_targmy(@_, \&real_negate) }
1372 if ($op->first->name =~ /^(i_)?negate$/) {
1374 $self->pfixop($op, $cx, "-", 21.5);
1376 $self->pfixop($op, $cx, "-", 21);
1379 sub pp_i_negate { pp_negate(@_) }
1385 $self->pfixop($op, $cx, "not ", 4);
1387 $self->pfixop($op, $cx, "!", 21);
1393 my($op, $cx, $name) = @_;
1395 if ($op->flags & OPf_KIDS) {
1397 if (defined prototype("CORE::$name")
1398 && prototype("CORE::$name") =~ /^;?\*/
1399 && $kid->name eq "rv2gv") {
1403 return $self->maybe_parens_unop($name, $kid, $cx);
1405 return $name . ($op->flags & OPf_SPECIAL ? "()" : "");
1409 sub pp_chop { maybe_targmy(@_, \&unop, "chop") }
1410 sub pp_chomp { maybe_targmy(@_, \&unop, "chomp") }
1411 sub pp_schop { maybe_targmy(@_, \&unop, "chop") }
1412 sub pp_schomp { maybe_targmy(@_, \&unop, "chomp") }
1413 sub pp_defined { unop(@_, "defined") }
1414 sub pp_undef { unop(@_, "undef") }
1415 sub pp_study { unop(@_, "study") }
1416 sub pp_ref { unop(@_, "ref") }
1417 sub pp_pos { maybe_local(@_, unop(@_, "pos")) }
1419 sub pp_sin { maybe_targmy(@_, \&unop, "sin") }
1420 sub pp_cos { maybe_targmy(@_, \&unop, "cos") }
1421 sub pp_rand { maybe_targmy(@_, \&unop, "rand") }
1422 sub pp_srand { unop(@_, "srand") }
1423 sub pp_exp { maybe_targmy(@_, \&unop, "exp") }
1424 sub pp_log { maybe_targmy(@_, \&unop, "log") }
1425 sub pp_sqrt { maybe_targmy(@_, \&unop, "sqrt") }
1426 sub pp_int { maybe_targmy(@_, \&unop, "int") }
1427 sub pp_hex { maybe_targmy(@_, \&unop, "hex") }
1428 sub pp_oct { maybe_targmy(@_, \&unop, "oct") }
1429 sub pp_abs { maybe_targmy(@_, \&unop, "abs") }
1431 sub pp_length { maybe_targmy(@_, \&unop, "length") }
1432 sub pp_ord { maybe_targmy(@_, \&unop, "ord") }
1433 sub pp_chr { maybe_targmy(@_, \&unop, "chr") }
1435 sub pp_each { unop(@_, "each") }
1436 sub pp_values { unop(@_, "values") }
1437 sub pp_keys { unop(@_, "keys") }
1438 sub pp_pop { unop(@_, "pop") }
1439 sub pp_shift { unop(@_, "shift") }
1441 sub pp_caller { unop(@_, "caller") }
1442 sub pp_reset { unop(@_, "reset") }
1443 sub pp_exit { unop(@_, "exit") }
1444 sub pp_prototype { unop(@_, "prototype") }
1446 sub pp_close { unop(@_, "close") }
1447 sub pp_fileno { unop(@_, "fileno") }
1448 sub pp_umask { unop(@_, "umask") }
1449 sub pp_untie { unop(@_, "untie") }
1450 sub pp_tied { unop(@_, "tied") }
1451 sub pp_dbmclose { unop(@_, "dbmclose") }
1452 sub pp_getc { unop(@_, "getc") }
1453 sub pp_eof { unop(@_, "eof") }
1454 sub pp_tell { unop(@_, "tell") }
1455 sub pp_getsockname { unop(@_, "getsockname") }
1456 sub pp_getpeername { unop(@_, "getpeername") }
1458 sub pp_chdir { maybe_targmy(@_, \&unop, "chdir") }
1459 sub pp_chroot { maybe_targmy(@_, \&unop, "chroot") }
1460 sub pp_readlink { unop(@_, "readlink") }
1461 sub pp_rmdir { maybe_targmy(@_, \&unop, "rmdir") }
1462 sub pp_readdir { unop(@_, "readdir") }
1463 sub pp_telldir { unop(@_, "telldir") }
1464 sub pp_rewinddir { unop(@_, "rewinddir") }
1465 sub pp_closedir { unop(@_, "closedir") }
1466 sub pp_getpgrp { maybe_targmy(@_, \&unop, "getpgrp") }
1467 sub pp_localtime { unop(@_, "localtime") }
1468 sub pp_gmtime { unop(@_, "gmtime") }
1469 sub pp_alarm { unop(@_, "alarm") }
1470 sub pp_sleep { maybe_targmy(@_, \&unop, "sleep") }
1472 sub pp_dofile { unop(@_, "do") }
1473 sub pp_entereval { unop(@_, "eval") }
1475 sub pp_ghbyname { unop(@_, "gethostbyname") }
1476 sub pp_gnbyname { unop(@_, "getnetbyname") }
1477 sub pp_gpbyname { unop(@_, "getprotobyname") }
1478 sub pp_shostent { unop(@_, "sethostent") }
1479 sub pp_snetent { unop(@_, "setnetent") }
1480 sub pp_sprotoent { unop(@_, "setprotoent") }
1481 sub pp_sservent { unop(@_, "setservent") }
1482 sub pp_gpwnam { unop(@_, "getpwnam") }
1483 sub pp_gpwuid { unop(@_, "getpwuid") }
1484 sub pp_ggrnam { unop(@_, "getgrnam") }
1485 sub pp_ggrgid { unop(@_, "getgrgid") }
1487 sub pp_lock { unop(@_, "lock") }
1493 if ($op->private & OPpEXISTS_SUB) {
1494 # Checking for the existence of a subroutine
1495 return $self->maybe_parens_func("exists",
1496 $self->pp_rv2cv($op->first, 16), $cx, 16);
1498 if ($op->flags & OPf_SPECIAL) {
1499 # Array element, not hash element
1500 return $self->maybe_parens_func("exists",
1501 $self->pp_aelem($op->first, 16), $cx, 16);
1503 return $self->maybe_parens_func("exists", $self->pp_helem($op->first, 16),
1511 if ($op->private & OPpSLICE) {
1512 if ($op->flags & OPf_SPECIAL) {
1513 # Deleting from an array, not a hash
1514 return $self->maybe_parens_func("delete",
1515 $self->pp_aslice($op->first, 16),
1518 return $self->maybe_parens_func("delete",
1519 $self->pp_hslice($op->first, 16),
1522 if ($op->flags & OPf_SPECIAL) {
1523 # Deleting from an array, not a hash
1524 return $self->maybe_parens_func("delete",
1525 $self->pp_aelem($op->first, 16),
1528 return $self->maybe_parens_func("delete",
1529 $self->pp_helem($op->first, 16),
1537 if (class($op) eq "UNOP" and $op->first->name eq "const"
1538 and $op->first->private & OPpCONST_BARE)
1540 my $name = $self->const_sv($op->first)->PV;
1543 return "require $name";
1545 $self->unop($op, $cx, "require");
1552 my $kid = $op->first;
1553 if (not null $kid->sibling) {
1554 # XXX Was a here-doc
1555 return $self->dquote($op);
1557 $self->unop(@_, "scalar");
1564 return (($self->{'curcv'}->PADLIST->ARRAY)[1]->ARRAY)[$targ];
1570 my $kid = $op->first;
1571 if ($kid->name eq "null") {
1573 if ($kid->name eq "anonlist" || $kid->name eq "anonhash") {
1574 my($pre, $post) = @{{"anonlist" => ["[","]"],
1575 "anonhash" => ["{","}"]}->{$kid->name}};
1577 $kid = $kid->first->sibling; # skip pushmark
1578 for (; !null($kid); $kid = $kid->sibling) {
1579 $expr = $self->deparse($kid, 6);
1582 return $pre . join(", ", @exprs) . $post;
1583 } elsif (!null($kid->sibling) and
1584 $kid->sibling->name eq "anoncode") {
1586 $self->deparse_sub($self->padval($kid->sibling->targ));
1587 } elsif ($kid->name eq "pushmark") {
1588 my $sib_name = $kid->sibling->name;
1589 if ($sib_name =~ /^(pad|rv2)[ah]v$/
1590 and not $kid->sibling->flags & OPf_REF)
1592 # The @a in \(@a) isn't in ref context, but only when the
1594 return "\\(" . $self->deparse($kid->sibling, 1) . ")";
1595 } elsif ($sib_name eq 'entersub') {
1596 my $text = $self->deparse($kid->sibling, 1);
1597 # Always show parens for \(&func()), but only with -p otherwise
1598 $text = "($text)" if $self->{'parens'}
1599 or $kid->sibling->private & OPpENTERSUB_AMPER;
1604 $self->pfixop($op, $cx, "\\", 20);
1607 sub pp_srefgen { pp_refgen(@_) }
1612 my $kid = $op->first;
1613 $kid = $kid->first if $kid->name eq "rv2gv"; # <$fh>
1614 return "<" . $self->deparse($kid, 1) . ">" if is_scalar($kid);
1615 return $self->unop($op, $cx, "readline");
1621 return "<" . $self->gv_name($op->gv) . ">";
1624 # Unary operators that can occur as pseudo-listops inside double quotes
1627 my($op, $cx, $name, $prec, $flags) = (@_, 0, 0);
1629 if ($op->flags & OPf_KIDS) {
1631 # If there's more than one kid, the first is an ex-pushmark.
1632 $kid = $kid->sibling if not null $kid->sibling;
1633 return $self->maybe_parens_unop($name, $kid, $cx);
1635 return $name . ($op->flags & OPf_SPECIAL ? "()" : "");
1639 sub pp_ucfirst { dq_unop(@_, "ucfirst") }
1640 sub pp_lcfirst { dq_unop(@_, "lcfirst") }
1641 sub pp_uc { dq_unop(@_, "uc") }
1642 sub pp_lc { dq_unop(@_, "lc") }
1643 sub pp_quotemeta { maybe_targmy(@_, \&dq_unop, "quotemeta") }
1647 my ($op, $cx, $name) = @_;
1648 if (class($op) eq "PVOP") {
1649 return "$name " . $op->pv;
1650 } elsif (class($op) eq "OP") {
1652 } elsif (class($op) eq "UNOP") {
1653 # Note -- loop exits are actually exempt from the
1654 # looks-like-a-func rule, but a few extra parens won't hurt
1655 return $self->maybe_parens_unop($name, $op->first, $cx);
1659 sub pp_last { loopex(@_, "last") }
1660 sub pp_next { loopex(@_, "next") }
1661 sub pp_redo { loopex(@_, "redo") }
1662 sub pp_goto { loopex(@_, "goto") }
1663 sub pp_dump { loopex(@_, "dump") }
1667 my($op, $cx, $name) = @_;
1668 if (class($op) eq "UNOP") {
1669 # Genuine `-X' filetests are exempt from the LLAFR, but not
1670 # l?stat(); for the sake of clarity, give'em all parens
1671 return $self->maybe_parens_unop($name, $op->first, $cx);
1672 } elsif (class($op) eq "SVOP") {
1673 return $self->maybe_parens_func($name, $self->pp_gv($op, 1), $cx, 16);
1674 } else { # I don't think baseop filetests ever survive ck_ftst, but...
1679 sub pp_lstat { ftst(@_, "lstat") }
1680 sub pp_stat { ftst(@_, "stat") }
1681 sub pp_ftrread { ftst(@_, "-R") }
1682 sub pp_ftrwrite { ftst(@_, "-W") }
1683 sub pp_ftrexec { ftst(@_, "-X") }
1684 sub pp_fteread { ftst(@_, "-r") }
1685 sub pp_ftewrite { ftst(@_, "-w") }
1686 sub pp_fteexec { ftst(@_, "-x") }
1687 sub pp_ftis { ftst(@_, "-e") }
1688 sub pp_fteowned { ftst(@_, "-O") }
1689 sub pp_ftrowned { ftst(@_, "-o") }
1690 sub pp_ftzero { ftst(@_, "-z") }
1691 sub pp_ftsize { ftst(@_, "-s") }
1692 sub pp_ftmtime { ftst(@_, "-M") }
1693 sub pp_ftatime { ftst(@_, "-A") }
1694 sub pp_ftctime { ftst(@_, "-C") }
1695 sub pp_ftsock { ftst(@_, "-S") }
1696 sub pp_ftchr { ftst(@_, "-c") }
1697 sub pp_ftblk { ftst(@_, "-b") }
1698 sub pp_ftfile { ftst(@_, "-f") }
1699 sub pp_ftdir { ftst(@_, "-d") }
1700 sub pp_ftpipe { ftst(@_, "-p") }
1701 sub pp_ftlink { ftst(@_, "-l") }
1702 sub pp_ftsuid { ftst(@_, "-u") }
1703 sub pp_ftsgid { ftst(@_, "-g") }
1704 sub pp_ftsvtx { ftst(@_, "-k") }
1705 sub pp_fttty { ftst(@_, "-t") }
1706 sub pp_fttext { ftst(@_, "-T") }
1707 sub pp_ftbinary { ftst(@_, "-B") }
1709 sub SWAP_CHILDREN () { 1 }
1710 sub ASSIGN () { 2 } # has OP= variant
1711 sub LIST_CONTEXT () { 4 } # Assignment is in list context
1717 my $name = $op->name;
1718 if ($name eq "concat" and $op->first->name eq "concat") {
1719 # avoid spurious `=' -- see comment in pp_concat
1722 if ($name eq "null" and class($op) eq "UNOP"
1723 and $op->first->name =~ /^(and|x?or)$/
1724 and null $op->first->sibling)
1726 # Like all conditional constructs, OP_ANDs and OP_ORs are topped
1727 # with a null that's used as the common end point of the two
1728 # flows of control. For precedence purposes, ignore it.
1729 # (COND_EXPRs have these too, but we don't bother with
1730 # their associativity).
1731 return assoc_class($op->first);
1733 return $name . ($op->flags & OPf_STACKED ? "=" : "");
1736 # Left associative operators, like `+', for which
1737 # $a + $b + $c is equivalent to ($a + $b) + $c
1740 %left = ('multiply' => 19, 'i_multiply' => 19,
1741 'divide' => 19, 'i_divide' => 19,
1742 'modulo' => 19, 'i_modulo' => 19,
1744 'add' => 18, 'i_add' => 18,
1745 'subtract' => 18, 'i_subtract' => 18,
1747 'left_shift' => 17, 'right_shift' => 17,
1749 'bit_or' => 12, 'bit_xor' => 12,
1751 'or' => 2, 'xor' => 2,
1755 sub deparse_binop_left {
1757 my($op, $left, $prec) = @_;
1758 if ($left{assoc_class($op)} && $left{assoc_class($left)}
1759 and $left{assoc_class($op)} == $left{assoc_class($left)})
1761 return $self->deparse($left, $prec - .00001);
1763 return $self->deparse($left, $prec);
1767 # Right associative operators, like `=', for which
1768 # $a = $b = $c is equivalent to $a = ($b = $c)
1771 %right = ('pow' => 22,
1772 'sassign=' => 7, 'aassign=' => 7,
1773 'multiply=' => 7, 'i_multiply=' => 7,
1774 'divide=' => 7, 'i_divide=' => 7,
1775 'modulo=' => 7, 'i_modulo=' => 7,
1777 'add=' => 7, 'i_add=' => 7,
1778 'subtract=' => 7, 'i_subtract=' => 7,
1780 'left_shift=' => 7, 'right_shift=' => 7,
1782 'bit_or=' => 7, 'bit_xor=' => 7,
1788 sub deparse_binop_right {
1790 my($op, $right, $prec) = @_;
1791 if ($right{assoc_class($op)} && $right{assoc_class($right)}
1792 and $right{assoc_class($op)} == $right{assoc_class($right)})
1794 return $self->deparse($right, $prec - .00001);
1796 return $self->deparse($right, $prec);
1802 my ($op, $cx, $opname, $prec, $flags) = (@_, 0);
1803 my $left = $op->first;
1804 my $right = $op->last;
1806 if ($op->flags & OPf_STACKED && $flags & ASSIGN) {
1810 if ($flags & SWAP_CHILDREN) {
1811 ($left, $right) = ($right, $left);
1813 $left = $self->deparse_binop_left($op, $left, $prec);
1814 $left = "($left)" if $flags & LIST_CONTEXT
1815 && $left !~ /^(my|our|local|)[\@\(]/;
1816 $right = $self->deparse_binop_right($op, $right, $prec);
1817 return $self->maybe_parens("$left $opname$eq $right", $cx, $prec);
1820 sub pp_add { maybe_targmy(@_, \&binop, "+", 18, ASSIGN) }
1821 sub pp_multiply { maybe_targmy(@_, \&binop, "*", 19, ASSIGN) }
1822 sub pp_subtract { maybe_targmy(@_, \&binop, "-",18, ASSIGN) }
1823 sub pp_divide { maybe_targmy(@_, \&binop, "/", 19, ASSIGN) }
1824 sub pp_modulo { maybe_targmy(@_, \&binop, "%", 19, ASSIGN) }
1825 sub pp_i_add { maybe_targmy(@_, \&binop, "+", 18, ASSIGN) }
1826 sub pp_i_multiply { maybe_targmy(@_, \&binop, "*", 19, ASSIGN) }
1827 sub pp_i_subtract { maybe_targmy(@_, \&binop, "-", 18, ASSIGN) }
1828 sub pp_i_divide { maybe_targmy(@_, \&binop, "/", 19, ASSIGN) }
1829 sub pp_i_modulo { maybe_targmy(@_, \&binop, "%", 19, ASSIGN) }
1830 sub pp_pow { maybe_targmy(@_, \&binop, "**", 22, ASSIGN) }
1832 sub pp_left_shift { maybe_targmy(@_, \&binop, "<<", 17, ASSIGN) }
1833 sub pp_right_shift { maybe_targmy(@_, \&binop, ">>", 17, ASSIGN) }
1834 sub pp_bit_and { maybe_targmy(@_, \&binop, "&", 13, ASSIGN) }
1835 sub pp_bit_or { maybe_targmy(@_, \&binop, "|", 12, ASSIGN) }
1836 sub pp_bit_xor { maybe_targmy(@_, \&binop, "^", 12, ASSIGN) }
1838 sub pp_eq { binop(@_, "==", 14) }
1839 sub pp_ne { binop(@_, "!=", 14) }
1840 sub pp_lt { binop(@_, "<", 15) }
1841 sub pp_gt { binop(@_, ">", 15) }
1842 sub pp_ge { binop(@_, ">=", 15) }
1843 sub pp_le { binop(@_, "<=", 15) }
1844 sub pp_ncmp { binop(@_, "<=>", 14) }
1845 sub pp_i_eq { binop(@_, "==", 14) }
1846 sub pp_i_ne { binop(@_, "!=", 14) }
1847 sub pp_i_lt { binop(@_, "<", 15) }
1848 sub pp_i_gt { binop(@_, ">", 15) }
1849 sub pp_i_ge { binop(@_, ">=", 15) }
1850 sub pp_i_le { binop(@_, "<=", 15) }
1851 sub pp_i_ncmp { binop(@_, "<=>", 14) }
1853 sub pp_seq { binop(@_, "eq", 14) }
1854 sub pp_sne { binop(@_, "ne", 14) }
1855 sub pp_slt { binop(@_, "lt", 15) }
1856 sub pp_sgt { binop(@_, "gt", 15) }
1857 sub pp_sge { binop(@_, "ge", 15) }
1858 sub pp_sle { binop(@_, "le", 15) }
1859 sub pp_scmp { binop(@_, "cmp", 14) }
1861 sub pp_sassign { binop(@_, "=", 7, SWAP_CHILDREN) }
1862 sub pp_aassign { binop(@_, "=", 7, SWAP_CHILDREN | LIST_CONTEXT) }
1864 # `.' is special because concats-of-concats are optimized to save copying
1865 # by making all but the first concat stacked. The effect is as if the
1866 # programmer had written `($a . $b) .= $c', except legal.
1867 sub pp_concat { maybe_targmy(@_, \&real_concat) }
1871 my $left = $op->first;
1872 my $right = $op->last;
1875 if ($op->flags & OPf_STACKED and $op->first->name ne "concat") {
1879 $left = $self->deparse_binop_left($op, $left, $prec);
1880 $right = $self->deparse_binop_right($op, $right, $prec);
1881 return $self->maybe_parens("$left .$eq $right", $cx, $prec);
1884 # `x' is weird when the left arg is a list
1888 my $left = $op->first;
1889 my $right = $op->last;
1892 if ($op->flags & OPf_STACKED) {
1896 if (null($right)) { # list repeat; count is inside left-side ex-list
1897 my $kid = $left->first->sibling; # skip pushmark
1899 for (; !null($kid->sibling); $kid = $kid->sibling) {
1900 push @exprs, $self->deparse($kid, 6);
1903 $left = "(" . join(", ", @exprs). ")";
1905 $left = $self->deparse_binop_left($op, $left, $prec);
1907 $right = $self->deparse_binop_right($op, $right, $prec);
1908 return $self->maybe_parens("$left x$eq $right", $cx, $prec);
1913 my ($op, $cx, $type) = @_;
1914 my $left = $op->first;
1915 my $right = $left->sibling;
1916 $left = $self->deparse($left, 9);
1917 $right = $self->deparse($right, 9);
1918 return $self->maybe_parens("$left $type $right", $cx, 9);
1924 my $flip = $op->first;
1925 my $type = ($flip->flags & OPf_SPECIAL) ? "..." : "..";
1926 return $self->range($flip->first, $cx, $type);
1929 # one-line while/until is handled in pp_leave
1933 my ($op, $cx, $lowop, $lowprec, $highop, $highprec, $blockname) = @_;
1934 my $left = $op->first;
1935 my $right = $op->first->sibling;
1936 if ($cx == 0 and is_scope($right) and $blockname
1937 and $self->{'expand'} < 7)
1939 $left = $self->deparse($left, 1);
1940 $right = $self->deparse($right, 0);
1941 return "$blockname ($left) {\n\t$right\n\b}\cK";
1942 } elsif ($cx == 0 and $blockname and not $self->{'parens'}
1943 and $self->{'expand'} < 7) { # $b if $a
1944 $right = $self->deparse($right, 1);
1945 $left = $self->deparse($left, 1);
1946 return "$right $blockname $left";
1947 } elsif ($cx > $lowprec and $highop) { # $a && $b
1948 $left = $self->deparse_binop_left($op, $left, $highprec);
1949 $right = $self->deparse_binop_right($op, $right, $highprec);
1950 return $self->maybe_parens("$left $highop $right", $cx, $highprec);
1951 } else { # $a and $b
1952 $left = $self->deparse_binop_left($op, $left, $lowprec);
1953 $right = $self->deparse_binop_right($op, $right, $lowprec);
1954 return $self->maybe_parens("$left $lowop $right", $cx, $lowprec);
1958 sub pp_and { logop(@_, "and", 3, "&&", 11, "if") }
1959 sub pp_or { logop(@_, "or", 2, "||", 10, "unless") }
1960 sub pp_dor { logop(@_, "err", 2, "//", 10, "") }
1962 # xor is syntactically a logop, but it's really a binop (contrary to
1963 # old versions of opcode.pl). Syntax is what matters here.
1964 sub pp_xor { logop(@_, "xor", 2, "", 0, "") }
1968 my ($op, $cx, $opname) = @_;
1969 my $left = $op->first;
1970 my $right = $op->first->sibling->first; # skip sassign
1971 $left = $self->deparse($left, 7);
1972 $right = $self->deparse($right, 7);
1973 return $self->maybe_parens("$left $opname $right", $cx, 7);
1976 sub pp_andassign { logassignop(@_, "&&=") }
1977 sub pp_orassign { logassignop(@_, "||=") }
1978 sub pp_dorassign { logassignop(@_, "//=") }
1982 my($op, $cx, $name) = @_;
1984 my $parens = ($cx >= 5) || $self->{'parens'};
1985 my $kid = $op->first->sibling;
1986 return $name if null $kid;
1988 $name = "socketpair" if $name eq "sockpair";
1989 if (defined prototype("CORE::$name")
1990 && prototype("CORE::$name") =~ /^;?\*/
1991 && $kid->name eq "rv2gv") {
1992 $first = $self->deparse($kid->first, 6);
1995 $first = $self->deparse($kid, 6);
1997 if ($name eq "chmod" && $first =~ /^\d+$/) {
1998 $first = sprintf("%#o", $first);
2000 $first = "+$first" if not $parens and substr($first, 0, 1) eq "(";
2001 push @exprs, $first;
2002 $kid = $kid->sibling;
2003 for (; !null($kid); $kid = $kid->sibling) {
2004 push @exprs, $self->deparse($kid, 6);
2007 return "$name(" . join(", ", @exprs) . ")";
2009 return "$name " . join(", ", @exprs);
2013 sub pp_bless { listop(@_, "bless") }
2014 sub pp_atan2 { maybe_targmy(@_, \&listop, "atan2") }
2015 sub pp_substr { maybe_local(@_, listop(@_, "substr")) }
2016 sub pp_vec { maybe_local(@_, listop(@_, "vec")) }
2017 sub pp_index { maybe_targmy(@_, \&listop, "index") }
2018 sub pp_rindex { maybe_targmy(@_, \&listop, "rindex") }
2019 sub pp_sprintf { maybe_targmy(@_, \&listop, "sprintf") }
2020 sub pp_formline { listop(@_, "formline") } # see also deparse_format
2021 sub pp_crypt { maybe_targmy(@_, \&listop, "crypt") }
2022 sub pp_unpack { listop(@_, "unpack") }
2023 sub pp_pack { listop(@_, "pack") }
2024 sub pp_join { maybe_targmy(@_, \&listop, "join") }
2025 sub pp_splice { listop(@_, "splice") }
2026 sub pp_push { maybe_targmy(@_, \&listop, "push") }
2027 sub pp_unshift { maybe_targmy(@_, \&listop, "unshift") }
2028 sub pp_reverse { listop(@_, "reverse") }
2029 sub pp_warn { listop(@_, "warn") }
2030 sub pp_die { listop(@_, "die") }
2031 # Actually, return is exempt from the LLAFR (see examples in this very
2032 # module!), but for consistency's sake, ignore that fact
2033 sub pp_return { listop(@_, "return") }
2034 sub pp_open { listop(@_, "open") }
2035 sub pp_pipe_op { listop(@_, "pipe") }
2036 sub pp_tie { listop(@_, "tie") }
2037 sub pp_binmode { listop(@_, "binmode") }
2038 sub pp_dbmopen { listop(@_, "dbmopen") }
2039 sub pp_sselect { listop(@_, "select") }
2040 sub pp_select { listop(@_, "select") }
2041 sub pp_read { listop(@_, "read") }
2042 sub pp_sysopen { listop(@_, "sysopen") }
2043 sub pp_sysseek { listop(@_, "sysseek") }
2044 sub pp_sysread { listop(@_, "sysread") }
2045 sub pp_syswrite { listop(@_, "syswrite") }
2046 sub pp_send { listop(@_, "send") }
2047 sub pp_recv { listop(@_, "recv") }
2048 sub pp_seek { listop(@_, "seek") }
2049 sub pp_fcntl { listop(@_, "fcntl") }
2050 sub pp_ioctl { listop(@_, "ioctl") }
2051 sub pp_flock { maybe_targmy(@_, \&listop, "flock") }
2052 sub pp_socket { listop(@_, "socket") }
2053 sub pp_sockpair { listop(@_, "sockpair") }
2054 sub pp_bind { listop(@_, "bind") }
2055 sub pp_connect { listop(@_, "connect") }
2056 sub pp_listen { listop(@_, "listen") }
2057 sub pp_accept { listop(@_, "accept") }
2058 sub pp_shutdown { listop(@_, "shutdown") }
2059 sub pp_gsockopt { listop(@_, "getsockopt") }
2060 sub pp_ssockopt { listop(@_, "setsockopt") }
2061 sub pp_chown { maybe_targmy(@_, \&listop, "chown") }
2062 sub pp_unlink { maybe_targmy(@_, \&listop, "unlink") }
2063 sub pp_chmod { maybe_targmy(@_, \&listop, "chmod") }
2064 sub pp_utime { maybe_targmy(@_, \&listop, "utime") }
2065 sub pp_rename { maybe_targmy(@_, \&listop, "rename") }
2066 sub pp_link { maybe_targmy(@_, \&listop, "link") }
2067 sub pp_symlink { maybe_targmy(@_, \&listop, "symlink") }
2068 sub pp_mkdir { maybe_targmy(@_, \&listop, "mkdir") }
2069 sub pp_open_dir { listop(@_, "opendir") }
2070 sub pp_seekdir { listop(@_, "seekdir") }
2071 sub pp_waitpid { maybe_targmy(@_, \&listop, "waitpid") }
2072 sub pp_system { maybe_targmy(@_, \&listop, "system") }
2073 sub pp_exec { maybe_targmy(@_, \&listop, "exec") }
2074 sub pp_kill { maybe_targmy(@_, \&listop, "kill") }
2075 sub pp_setpgrp { maybe_targmy(@_, \&listop, "setpgrp") }
2076 sub pp_getpriority { maybe_targmy(@_, \&listop, "getpriority") }
2077 sub pp_setpriority { maybe_targmy(@_, \&listop, "setpriority") }
2078 sub pp_shmget { listop(@_, "shmget") }
2079 sub pp_shmctl { listop(@_, "shmctl") }
2080 sub pp_shmread { listop(@_, "shmread") }
2081 sub pp_shmwrite { listop(@_, "shmwrite") }
2082 sub pp_msgget { listop(@_, "msgget") }
2083 sub pp_msgctl { listop(@_, "msgctl") }
2084 sub pp_msgsnd { listop(@_, "msgsnd") }
2085 sub pp_msgrcv { listop(@_, "msgrcv") }
2086 sub pp_semget { listop(@_, "semget") }
2087 sub pp_semctl { listop(@_, "semctl") }
2088 sub pp_semop { listop(@_, "semop") }
2089 sub pp_ghbyaddr { listop(@_, "gethostbyaddr") }
2090 sub pp_gnbyaddr { listop(@_, "getnetbyaddr") }
2091 sub pp_gpbynumber { listop(@_, "getprotobynumber") }
2092 sub pp_gsbyname { listop(@_, "getservbyname") }
2093 sub pp_gsbyport { listop(@_, "getservbyport") }
2094 sub pp_syscall { listop(@_, "syscall") }
2099 my $text = $self->dq($op->first->sibling); # skip pushmark
2100 if ($text =~ /^\$?(\w|::|\`)+$/ # could look like a readline
2101 or $text =~ /[<>]/) {
2102 return 'glob(' . single_delim('qq', '"', $text) . ')';
2104 return '<' . $text . '>';
2108 # Truncate is special because OPf_SPECIAL makes a bareword first arg
2109 # be a filehandle. This could probably be better fixed in the core
2110 # by moving the GV lookup into ck_truc.
2116 my $parens = ($cx >= 5) || $self->{'parens'};
2117 my $kid = $op->first->sibling;
2119 if ($op->flags & OPf_SPECIAL) {
2120 # $kid is an OP_CONST
2121 $fh = $self->const_sv($kid)->PV;
2123 $fh = $self->deparse($kid, 6);
2124 $fh = "+$fh" if not $parens and substr($fh, 0, 1) eq "(";
2126 my $len = $self->deparse($kid->sibling, 6);
2128 return "truncate($fh, $len)";
2130 return "truncate $fh, $len";
2136 my($op, $cx, $name) = @_;
2138 my $kid = $op->first->sibling;
2140 if ($op->flags & OPf_STACKED) {
2142 $indir = $indir->first; # skip rv2gv
2143 if (is_scope($indir)) {
2144 $indir = "{" . $self->deparse($indir, 0) . "}";
2145 } elsif ($indir->name eq "const" && $indir->private & OPpCONST_BARE) {
2146 $indir = $self->const_sv($indir)->PV;
2148 $indir = $self->deparse($indir, 24);
2150 $indir = $indir . " ";
2151 $kid = $kid->sibling;
2153 if ($name eq "sort" && $op->private & (OPpSORT_NUMERIC | OPpSORT_INTEGER)) {
2154 $indir = ($op->private & OPpSORT_REVERSE) ? '{$b <=> $a} '
2157 elsif ($name eq "sort" && $op->private & OPpSORT_REVERSE) {
2158 $indir = '{$b cmp $a} ';
2160 for (; !null($kid); $kid = $kid->sibling) {
2161 $expr = $self->deparse($kid, 6);
2164 return $self->maybe_parens_func($name, $indir . join(", ", @exprs),
2168 sub pp_prtf { indirop(@_, "printf") }
2169 sub pp_print { indirop(@_, "print") }
2170 sub pp_sort { indirop(@_, "sort") }
2174 my($op, $cx, $name) = @_;
2176 my $kid = $op->first; # this is the (map|grep)start
2177 $kid = $kid->first->sibling; # skip a pushmark
2178 my $code = $kid->first; # skip a null
2179 if (is_scope $code) {
2180 $code = "{" . $self->deparse($code, 0) . "} ";
2182 $code = $self->deparse($code, 24) . ", ";
2184 $kid = $kid->sibling;
2185 for (; !null($kid); $kid = $kid->sibling) {
2186 $expr = $self->deparse($kid, 6);
2187 push @exprs, $expr if defined $expr;
2189 return $self->maybe_parens_func($name, $code . join(", ", @exprs), $cx, 5);
2192 sub pp_mapwhile { mapop(@_, "map") }
2193 sub pp_grepwhile { mapop(@_, "grep") }
2199 my $kid = $op->first->sibling; # skip pushmark
2201 my $local = "either"; # could be local(...), my(...) or our(...)
2202 for ($lop = $kid; !null($lop); $lop = $lop->sibling) {
2203 # This assumes that no other private flags equal 128, and that
2204 # OPs that store things other than flags in their op_private,
2205 # like OP_AELEMFAST, won't be immediate children of a list.
2207 # OP_ENTERSUB can break this logic, so check for it.
2208 # I suspect that open and exit can too.
2210 if (!($lop->private & (OPpLVAL_INTRO|OPpOUR_INTRO)
2211 or $lop->name eq "undef")
2212 or $lop->name eq "entersub"
2213 or $lop->name eq "exit"
2214 or $lop->name eq "open")
2216 $local = ""; # or not
2219 if ($lop->name =~ /^pad[ash]v$/) { # my()
2220 ($local = "", last) if $local eq "local" || $local eq "our";
2222 } elsif ($lop->name =~ /^(gv|rv2)[ash]v$/
2223 && $lop->private & OPpOUR_INTRO
2224 or $lop->name eq "null" && $lop->first->name eq "gvsv"
2225 && $lop->first->private & OPpOUR_INTRO) { # our()
2226 ($local = "", last) if $local eq "my" || $local eq "local";
2228 } elsif ($lop->name ne "undef") { # local()
2229 ($local = "", last) if $local eq "my" || $local eq "our";
2233 $local = "" if $local eq "either"; # no point if it's all undefs
2234 return $self->deparse($kid, $cx) if null $kid->sibling and not $local;
2235 for (; !null($kid); $kid = $kid->sibling) {
2237 if (class($kid) eq "UNOP" and $kid->first->name eq "gvsv") {
2242 $self->{'avoid_local'}{$$lop}++;
2243 $expr = $self->deparse($kid, 6);
2244 delete $self->{'avoid_local'}{$$lop};
2246 $expr = $self->deparse($kid, 6);
2251 return "$local(" . join(", ", @exprs) . ")";
2253 return $self->maybe_parens( join(", ", @exprs), $cx, 6);
2257 sub is_ifelse_cont {
2259 return ($op->name eq "null" and class($op) eq "UNOP"
2260 and $op->first->name =~ /^(and|cond_expr)$/
2261 and is_scope($op->first->first->sibling));
2267 my $cond = $op->first;
2268 my $true = $cond->sibling;
2269 my $false = $true->sibling;
2270 my $cuddle = $self->{'cuddle'};
2271 unless ($cx == 0 and (is_scope($true) and $true->name ne "null") and
2272 (is_scope($false) || is_ifelse_cont($false))
2273 and $self->{'expand'} < 7) {
2274 $cond = $self->deparse($cond, 8);
2275 $true = $self->deparse($true, 8);
2276 $false = $self->deparse($false, 8);
2277 return $self->maybe_parens("$cond ? $true : $false", $cx, 8);
2280 $cond = $self->deparse($cond, 1);
2281 $true = $self->deparse($true, 0);
2282 my $head = "if ($cond) {\n\t$true\n\b}";
2284 while (!null($false) and is_ifelse_cont($false)) {
2285 my $newop = $false->first;
2286 my $newcond = $newop->first;
2287 my $newtrue = $newcond->sibling;
2288 $false = $newtrue->sibling; # last in chain is OP_AND => no else
2289 $newcond = $self->deparse($newcond, 1);
2290 $newtrue = $self->deparse($newtrue, 0);
2291 push @elsifs, "elsif ($newcond) {\n\t$newtrue\n\b}";
2293 if (!null($false)) {
2294 $false = $cuddle . "else {\n\t" .
2295 $self->deparse($false, 0) . "\n\b}\cK";
2299 return $head . join($cuddle, "", @elsifs) . $false;
2304 my($op, $cx, $init) = @_;
2305 my $enter = $op->first;
2306 my $kid = $enter->sibling;
2307 local(@$self{qw'curstash warnings hints'})
2308 = @$self{qw'curstash warnings hints'};
2313 if ($kid->name eq "lineseq") { # bare or infinite loop
2314 if (is_state $kid->last) { # infinite
2315 $head = "while (1) "; # Can't use for(;;) if there's a continue
2321 } elsif ($enter->name eq "enteriter") { # foreach
2322 my $ary = $enter->first->sibling; # first was pushmark
2323 my $var = $ary->sibling;
2324 if ($enter->flags & OPf_STACKED
2325 and not null $ary->first->sibling->sibling)
2327 $ary = $self->deparse($ary->first->sibling, 9) . " .. " .
2328 $self->deparse($ary->first->sibling->sibling, 9);
2330 $ary = $self->deparse($ary, 1);
2333 if ($enter->flags & OPf_SPECIAL) { # thread special var
2334 $var = $self->pp_threadsv($enter, 1);
2335 } else { # regular my() variable
2336 $var = $self->pp_padsv($enter, 1);
2337 if ($self->padname_sv($enter->targ)->IVX ==
2338 $kid->first->first->sibling->last->cop_seq)
2340 # If the scope of this variable closes at the last
2341 # statement of the loop, it must have been
2343 $var = "my " . $var;
2346 } elsif ($var->name eq "rv2gv") {
2347 $var = $self->pp_rv2sv($var, 1);
2348 } elsif ($var->name eq "gv") {
2349 $var = "\$" . $self->deparse($var, 1);
2351 $head = "foreach $var ($ary) ";
2352 $body = $kid->first->first->sibling; # skip OP_AND and OP_ITER
2353 } elsif ($kid->name eq "null") { # while/until
2355 my $name = {"and" => "while", "or" => "until"}->{$kid->name};
2356 $cond = $self->deparse($kid->first, 1);
2357 $head = "$name ($cond) ";
2358 $body = $kid->first->sibling;
2359 } elsif ($kid->name eq "stub") { # bare and empty
2360 return "{;}"; # {} could be a hashref
2362 # If there isn't a continue block, then the next pointer for the loop
2363 # will point to the unstack, which is kid's penultimate child, except
2364 # in a bare loop, when it will point to the leaveloop. When neither of
2365 # these conditions hold, then the third-to-last child in the continue
2366 # block (or the last in a bare loop).
2367 my $cont_start = $enter->nextop;
2369 if ($$cont_start != $$op && ${$cont_start->sibling} != ${$body->last}) {
2371 $cont = $body->last;
2373 $cont = $body->first;
2374 while (!null($cont->sibling->sibling->sibling)) {
2375 $cont = $cont->sibling;
2378 my $state = $body->first;
2379 my $cuddle = $self->{'cuddle'};
2381 for (; $$state != $$cont; $state = $state->sibling) {
2382 push @states, $state;
2384 $body = $self->lineseq(undef, @states);
2385 if (defined $cond and not is_scope $cont and $self->{'expand'} < 3) {
2386 $head = "for ($init; $cond; " . $self->deparse($cont, 1) .") ";
2389 $cont = $cuddle . "continue {\n\t" .
2390 $self->deparse($cont, 0) . "\n\b}\cK";
2393 return "" if !defined $body;
2395 $head = "for ($init; $cond;) ";
2398 $body = $self->deparse($body, 0);
2400 $body =~ s/;?$/;\n/;
2402 return $head . "{\n\t" . $body . "\b}" . $cont;
2405 sub pp_leaveloop { loop_common(@_, "") }
2410 my $init = $self->deparse($op, 1);
2411 return $self->loop_common($op->sibling->first->sibling, $cx, $init);
2416 return "eval {\n\t" . $self->pp_leave(@_) . "\n\b}";
2419 BEGIN { eval "sub OP_CONST () {" . opnumber("const") . "}" }
2420 BEGIN { eval "sub OP_STRINGIFY () {" . opnumber("stringify") . "}" }
2421 BEGIN { eval "sub OP_RV2SV () {" . opnumber("rv2sv") . "}" }
2422 BEGIN { eval "sub OP_LIST () {" . opnumber("list") . "}" }
2426 my($op, $cx, $flags) = @_;
2427 if (class($op) eq "OP") {
2429 return $self->{'ex_const'} if $op->targ == OP_CONST;
2430 } elsif ($op->first->name eq "pushmark") {
2431 return $self->pp_list($op, $cx);
2432 } elsif ($op->first->name eq "enter") {
2433 return $self->pp_leave($op, $cx);
2434 } elsif ($op->targ == OP_STRINGIFY) {
2435 return $self->dquote($op, $cx);
2436 } elsif (!null($op->first->sibling) and
2437 $op->first->sibling->name eq "readline" and
2438 $op->first->sibling->flags & OPf_STACKED) {
2439 return $self->maybe_parens($self->deparse($op->first, 7) . " = "
2440 . $self->deparse($op->first->sibling, 7),
2442 } elsif (!null($op->first->sibling) and
2443 $op->first->sibling->name eq "trans" and
2444 $op->first->sibling->flags & OPf_STACKED) {
2445 return $self->maybe_parens($self->deparse($op->first, 20) . " =~ "
2446 . $self->deparse($op->first->sibling, 20),
2448 } elsif ($op->flags & OPf_SPECIAL && $cx == 0 && !$op->targ) {
2450 return $self->deparse($op->first, $cx);
2453 return "do {\n\t". $self->deparse($op->first, $cx) ."\n\b};";
2455 } elsif (!null($op->first->sibling) and
2456 $op->first->sibling->name eq "null" and
2457 class($op->first->sibling) eq "UNOP" and
2458 $op->first->sibling->first->flags & OPf_STACKED and
2459 $op->first->sibling->first->name eq "rcatline") {
2460 return $self->maybe_parens($self->deparse($op->first, 18) . " .= "
2461 . $self->deparse($op->first->sibling, 18),
2464 return $self->deparse($op->first, $cx);
2471 return $self->padname_sv($targ)->PVX;
2477 return substr($self->padname($op->targ), 1); # skip $/@/%
2483 return $self->maybe_my($op, $cx, $self->padname($op->targ));
2486 sub pp_padav { pp_padsv(@_) }
2487 sub pp_padhv { pp_padsv(@_) }
2492 @threadsv_names = ("_", "1", "2", "3", "4", "5", "6", "7", "8", "9",
2493 "&", "`", "'", "+", "/", ".", ",", "\\", '"', ";",
2494 "^", "-", "%", "=", "|", "~", ":", "^A", "^E",
2501 return $self->maybe_local($op, $cx, "\$" . $threadsv_names[$op->targ]);
2507 if (class($op) eq "PADOP") {
2508 return $self->padval($op->padix);
2509 } else { # class($op) eq "SVOP"
2517 my $gv = $self->gv_or_padgv($op);
2518 return $self->maybe_local($op, $cx, $self->stash_variable("\$",
2519 $self->gv_name($gv)));
2525 my $gv = $self->gv_or_padgv($op);
2526 return $self->gv_name($gv);
2532 my $gv = $self->gv_or_padgv($op);
2533 my $name = $self->gv_name($gv);
2534 $name = $self->{'curstash'}."::$name"
2535 if $name !~ /::/ && $self->lex_in_scope('@'.$name);
2537 return "\$" . $name . "[" .
2538 ($op->private + $self->{'arybase'}) . "]";
2543 my($op, $cx, $type) = @_;
2545 if (class($op) eq 'NULL' || !$op->can("first")) {
2546 carp("Unexpected op in pp_rv2x");
2549 my $kid = $op->first;
2550 my $str = $self->deparse($kid, 0);
2551 return $self->stash_variable($type, $str) if is_scalar($kid);
2552 return $type ."{$str}";
2555 sub pp_rv2sv { maybe_local(@_, rv2x(@_, "\$")) }
2556 sub pp_rv2hv { maybe_local(@_, rv2x(@_, "%")) }
2557 sub pp_rv2gv { maybe_local(@_, rv2x(@_, "*")) }
2563 if ($op->first->name eq "padav") {
2564 return $self->maybe_local($op, $cx, '$#' . $self->padany($op->first));
2566 return $self->maybe_local($op, $cx,
2567 $self->rv2x($op->first, $cx, '$#'));
2571 # skip down to the old, ex-rv2cv
2573 my ($self, $op, $cx) = @_;
2574 if (!null($op->first) && $op->first->name eq 'null' &&
2575 $op->first->targ eq OP_LIST)
2577 return $self->rv2x($op->first->first->sibling, $cx, "&")
2580 return $self->rv2x($op, $cx, "")
2587 my $kid = $op->first;
2588 if ($kid->name eq "const") { # constant list
2589 my $av = $self->const_sv($kid);
2590 return "(" . join(", ", map(const($_), $av->ARRAY)) . ")";
2592 return $self->maybe_local($op, $cx, $self->rv2x($op, $cx, "\@"));
2596 sub is_subscriptable {
2598 if ($op->name =~ /^[ahg]elem/) {
2600 } elsif ($op->name eq "entersub") {
2601 my $kid = $op->first;
2602 return 0 unless null $kid->sibling;
2604 $kid = $kid->sibling until null $kid->sibling;
2605 return 0 if is_scope($kid);
2607 return 0 if $kid->name eq "gv";
2608 return 0 if is_scalar($kid);
2609 return is_subscriptable($kid);
2617 my ($op, $cx, $left, $right, $padname) = @_;
2618 my($array, $idx) = ($op->first, $op->first->sibling);
2619 unless ($array->name eq $padname) { # Maybe this has been fixed
2620 $array = $array->first; # skip rv2av (or ex-rv2av in _53+)
2622 if ($array->name eq $padname) {
2623 $array = $self->padany($array);
2624 } elsif (is_scope($array)) { # ${expr}[0]
2625 $array = "{" . $self->deparse($array, 0) . "}";
2626 } elsif ($array->name eq "gv") {
2627 $array = $self->gv_name($self->gv_or_padgv($array));
2628 if ($array !~ /::/) {
2629 my $prefix = ($left eq '[' ? '@' : '%');
2630 $array = $self->{curstash}.'::'.$array
2631 if $self->lex_in_scope($prefix . $array);
2633 } elsif (is_scalar $array) { # $x[0], $$x[0], ...
2634 $array = $self->deparse($array, 24);
2636 # $x[20][3]{hi} or expr->[20]
2637 my $arrow = is_subscriptable($array) ? "" : "->";
2638 return $self->deparse($array, 24) . $arrow .
2639 $left . $self->deparse($idx, 1) . $right;
2641 $idx = $self->deparse($idx, 1);
2643 # Outer parens in an array index will confuse perl
2644 # if we're interpolating in a regular expression, i.e.
2645 # /$x$foo[(-1)]/ is *not* the same as /$x$foo[-1]/
2647 # If $self->{parens}, then an initial '(' will
2648 # definitely be paired with a final ')'. If
2649 # !$self->{parens}, the misleading parens won't
2650 # have been added in the first place.
2652 # [You might think that we could get "(...)...(...)"
2653 # where the initial and final parens do not match
2654 # each other. But we can't, because the above would
2655 # only happen if there's an infix binop between the
2656 # two pairs of parens, and *that* means that the whole
2657 # expression would be parenthesized as well.]
2659 $idx =~ s/^\((.*)\)$/$1/ if $self->{'parens'};
2661 # Hash-element braces will autoquote a bareword inside themselves.
2662 # We need to make sure that C<$hash{warn()}> doesn't come out as
2663 # C<$hash{warn}>, which has a quite different meaning. Currently
2664 # B::Deparse will always quote strings, even if the string was a
2665 # bareword in the original (i.e. the OPpCONST_BARE flag is ignored
2666 # for constant strings.) So we can cheat slightly here - if we see
2667 # a bareword, we know that it is supposed to be a function call.
2669 $idx =~ s/^([A-Za-z_]\w*)$/$1()/;
2671 return "\$" . $array . $left . $idx . $right;
2674 sub pp_aelem { maybe_local(@_, elem(@_, "[", "]", "padav")) }
2675 sub pp_helem { maybe_local(@_, elem(@_, "{", "}", "padhv")) }
2680 my($glob, $part) = ($op->first, $op->last);
2681 $glob = $glob->first; # skip rv2gv
2682 $glob = $glob->first if $glob->name eq "rv2gv"; # this one's a bug
2683 my $scope = is_scope($glob);
2684 $glob = $self->deparse($glob, 0);
2685 $part = $self->deparse($part, 1);
2686 return "*" . ($scope ? "{$glob}" : $glob) . "{$part}";
2691 my ($op, $cx, $left, $right, $regname, $padname) = @_;
2693 my(@elems, $kid, $array, $list);
2694 if (class($op) eq "LISTOP") {
2696 } else { # ex-hslice inside delete()
2697 for ($kid = $op->first; !null $kid->sibling; $kid = $kid->sibling) {}
2701 $array = $array->first
2702 if $array->name eq $regname or $array->name eq "null";
2703 if (is_scope($array)) {
2704 $array = "{" . $self->deparse($array, 0) . "}";
2705 } elsif ($array->name eq $padname) {
2706 $array = $self->padany($array);
2708 $array = $self->deparse($array, 24);
2710 $kid = $op->first->sibling; # skip pushmark
2711 if ($kid->name eq "list") {
2712 $kid = $kid->first->sibling; # skip list, pushmark
2713 for (; !null $kid; $kid = $kid->sibling) {
2714 push @elems, $self->deparse($kid, 6);
2716 $list = join(", ", @elems);
2718 $list = $self->deparse($kid, 1);
2720 return "\@" . $array . $left . $list . $right;
2723 sub pp_aslice { maybe_local(@_, slice(@_, "[", "]", "rv2av", "padav")) }
2724 sub pp_hslice { maybe_local(@_, slice(@_, "{", "}", "rv2hv", "padhv")) }
2729 my $idx = $op->first;
2730 my $list = $op->last;
2732 $list = $self->deparse($list, 1);
2733 $idx = $self->deparse($idx, 1);
2734 return "($list)" . "[$idx]";
2739 return ($op->flags & OPf_WANT) == OPf_WANT_SCALAR;
2744 return ($op->flags & OPf_WANT) == OPf_WANT_LIST;
2750 my $kid = $op->first->sibling; # skip pushmark
2751 my($meth, $obj, @exprs);
2752 if ($kid->name eq "list" and want_list $kid) {
2753 # When an indirect object isn't a bareword but the args are in
2754 # parens, the parens aren't part of the method syntax (the LLAFR
2755 # doesn't apply), but they make a list with OPf_PARENS set that
2756 # doesn't get flattened by the append_elem that adds the method,
2757 # making a (object, arg1, arg2, ...) list where the object
2758 # usually is. This can be distinguished from
2759 # `($obj, $arg1, $arg2)->meth()' (which is legal if $arg2 is an
2760 # object) because in the later the list is in scalar context
2761 # as the left side of -> always is, while in the former
2762 # the list is in list context as method arguments always are.
2763 # (Good thing there aren't method prototypes!)
2764 $meth = $kid->sibling;
2765 $kid = $kid->first->sibling; # skip pushmark
2767 $kid = $kid->sibling;
2768 for (; not null $kid; $kid = $kid->sibling) {
2769 push @exprs, $self->deparse($kid, 6);
2773 $kid = $kid->sibling;
2774 for (; !null ($kid->sibling) && $kid->name ne "method_named";
2775 $kid = $kid->sibling) {
2776 push @exprs, $self->deparse($kid, 6);
2780 $obj = $self->deparse($obj, 24);
2781 if ($meth->name eq "method_named") {
2782 $meth = $self->const_sv($meth)->PV;
2784 $meth = $meth->first;
2785 if ($meth->name eq "const") {
2786 # As of 5.005_58, this case is probably obsoleted by the
2787 # method_named case above
2788 $meth = $self->const_sv($meth)->PV; # needs to be bare
2790 $meth = $self->deparse($meth, 1);
2793 my $args = join(", ", @exprs);
2794 $kid = $obj . "->" . $meth;
2796 return $kid . "(" . $args . ")"; # parens mandatory
2802 # returns "&" if the prototype doesn't match the args,
2803 # or ("", $args_after_prototype_demunging) if it does.
2806 return "&" if $self->{'noproto'};
2807 my($proto, @args) = @_;
2811 # An unbackslashed @ or % gobbles up the rest of the args
2812 1 while $proto =~ s/(?<!\\)([@%])[^\]]+$/$1/;
2814 $proto =~ s/^(\\?[\$\@&%*]|\\\[[\$\@&%*]+\]|;)//;
2817 return "&" if @args;
2818 } elsif ($chr eq ";") {
2820 } elsif ($chr eq "@" or $chr eq "%") {
2821 push @reals, map($self->deparse($_, 6), @args);
2827 if (want_scalar $arg) {
2828 push @reals, $self->deparse($arg, 6);
2832 } elsif ($chr eq "&") {
2833 if ($arg->name =~ /^(s?refgen|undef)$/) {
2834 push @reals, $self->deparse($arg, 6);
2838 } elsif ($chr eq "*") {
2839 if ($arg->name =~ /^s?refgen$/
2840 and $arg->first->first->name eq "rv2gv")
2842 $real = $arg->first->first; # skip refgen, null
2843 if ($real->first->name eq "gv") {
2844 push @reals, $self->deparse($real, 6);
2846 push @reals, $self->deparse($real->first, 6);
2851 } elsif (substr($chr, 0, 1) eq "\\") {
2853 if ($arg->name =~ /^s?refgen$/ and
2854 !null($real = $arg->first) and
2855 ($chr =~ /\$/ && is_scalar($real->first)
2857 && class($real->first->sibling) ne 'NULL'
2858 && $real->first->sibling->name
2861 && class($real->first->sibling) ne 'NULL'
2862 && $real->first->sibling->name
2864 #or ($chr =~ /&/ # This doesn't work
2865 # && $real->first->name eq "rv2cv")
2867 && $real->first->name eq "rv2gv")))
2869 push @reals, $self->deparse($real, 6);
2876 return "&" if $proto and !$doneok; # too few args and no `;'
2877 return "&" if @args; # too many args
2878 return ("", join ", ", @reals);
2884 return $self->method($op, $cx) unless null $op->first->sibling;
2888 if ($op->flags & OPf_SPECIAL && !($op->flags & OPf_MOD)) {
2890 } elsif ($op->private & OPpENTERSUB_AMPER) {
2894 $kid = $kid->first->sibling; # skip ex-list, pushmark
2895 for (; not null $kid->sibling; $kid = $kid->sibling) {
2900 if (is_scope($kid)) {
2902 $kid = "{" . $self->deparse($kid, 0) . "}";
2903 } elsif ($kid->first->name eq "gv") {
2904 my $gv = $self->gv_or_padgv($kid->first);
2905 if (class($gv->CV) ne "SPECIAL") {
2906 $proto = $gv->CV->PV if $gv->CV->FLAGS & SVf_POK;
2908 $simple = 1; # only calls of named functions can be prototyped
2909 $kid = $self->deparse($kid, 24);
2910 } elsif (is_scalar ($kid->first) && $kid->first->name ne 'rv2cv') {
2912 $kid = $self->deparse($kid, 24);
2915 my $arrow = is_subscriptable($kid->first) ? "" : "->";
2916 $kid = $self->deparse($kid, 24) . $arrow;
2919 # Doesn't matter how many prototypes there are, if
2920 # they haven't happened yet!
2924 no warnings 'uninitialized';
2925 $declared = exists $self->{'subs_declared'}{$kid}
2927 defined &{ %{$self->{'curstash'}."::"}->{$kid} }
2929 $self->{'subs_deparsed'}{$self->{'curstash'}."::".$kid}
2930 && defined prototype $self->{'curstash'}."::".$kid
2932 if (!$declared && defined($proto)) {
2933 # Avoid "too early to check prototype" warning
2934 ($amper, $proto) = ('&');
2939 if ($declared and defined $proto and not $amper) {
2940 ($amper, $args) = $self->check_proto($proto, @exprs);
2941 if ($amper eq "&") {
2942 $args = join(", ", map($self->deparse($_, 6), @exprs));
2945 $args = join(", ", map($self->deparse($_, 6), @exprs));
2947 if ($prefix or $amper) {
2948 if ($op->flags & OPf_STACKED) {
2949 return $prefix . $amper . $kid . "(" . $args . ")";
2951 return $prefix . $amper. $kid;
2954 # glob() invocations can be translated into calls of
2955 # CORE::GLOBAL::glob with a second parameter, a number.
2957 if ($kid eq "CORE::GLOBAL::glob") {
2959 $args =~ s/\s*,[^,]+$//;
2962 # It's a syntax error to call CORE::GLOBAL::foo without a prefix,
2963 # so it must have been translated from a keyword call. Translate
2965 $kid =~ s/^CORE::GLOBAL:://;
2968 return "$kid(" . $args . ")";
2969 } elsif (defined $proto and $proto eq "") {
2971 } elsif (defined $proto and $proto eq "\$" and is_scalar($exprs[0])) {
2972 return $self->maybe_parens_func($kid, $args, $cx, 16);
2973 } elsif (defined($proto) && $proto or $simple) {
2974 return $self->maybe_parens_func($kid, $args, $cx, 5);
2976 return "$kid(" . $args . ")";
2981 sub pp_enterwrite { unop(@_, "write") }
2983 # escape things that cause interpolation in double quotes,
2984 # but not character escapes
2987 $str =~ s/(^|\G|[^\\])((?:\\\\)*)([\$\@]|\\[uUlLQE])/$1$2\\$3/g;
2995 # Matches any string which is balanced with respect to {braces}
3006 # the same, but treat $|, $), $( and $ at the end of the string differently
3020 (\(\?\??\{$bal\}\)) # $4
3026 /defined($4) && length($4) ? "$1$2$4" : "$1$2\\$3"/xeg;
3031 # This is for regular expressions with the /x modifier
3032 # We have to leave comments unmangled.
3033 sub re_uninterp_extended {
3046 ( \(\?\??\{$bal\}\) # $4 (skip over (?{}) and (??{}) blocks)
3047 | \#[^\n]* # (skip over comments)
3054 /defined($4) && length($4) ? "$1$2$4" : "$1$2\\$3"/xeg;
3060 my %unctrl = # portable to to EBCDIC
3062 "\c@" => '\c@', # unused
3089 "\c[" => '\c[', # unused
3090 "\c\\" => '\c\\', # unused
3091 "\c]" => '\c]', # unused
3092 "\c_" => '\c_', # unused
3095 # character escapes, but not delimiters that might need to be escaped
3096 sub escape_str { # ASCII, UTF8
3098 $str =~ s/(.)/ord($1) > 255 ? sprintf("\\x{%x}", ord($1)) : $1/eg;
3100 # $str =~ s/\cH/\\b/g; # \b means something different in a regex
3106 $str =~ s/([\cA-\cZ])/$unctrl{$1}/ge;
3107 $str =~ s/([[:^print:]])/sprintf("\\%03o", ord($1))/ge;
3111 # For regexes with the /x modifier.
3112 # Leave whitespace unmangled.
3113 sub escape_extended_re {
3115 $str =~ s/(.)/ord($1) > 255 ? sprintf("\\x{%x}", ord($1)) : $1/eg;
3116 $str =~ s/([[:^print:]])/
3117 ($1 =~ y! \t\n!!) ? $1 : sprintf("\\%03o", ord($1))/ge;
3118 $str =~ s/\n/\n\f/g;
3122 # Don't do this for regexen
3125 $str =~ s/\\/\\\\/g;
3129 # Remove backslashes which precede literal control characters,
3130 # to avoid creating ambiguity when we escape the latter.
3134 # the insane complexity here is due to the behaviour of "\c\"
3135 $str =~ s/(^|[^\\]|\\c\\)(?<!\\c)\\(\\\\)*(?=[[:^print:]])/$1$2/g;
3139 sub balanced_delim {
3141 my @str = split //, $str;
3142 my($ar, $open, $close, $fail, $c, $cnt);
3143 for $ar (['[',']'], ['(',')'], ['<','>'], ['{','}']) {
3144 ($open, $close) = @$ar;
3145 $fail = 0; $cnt = 0;
3149 } elsif ($c eq $close) {
3158 $fail = 1 if $cnt != 0;
3159 return ($open, "$open$str$close") if not $fail;
3165 my($q, $default, $str) = @_;
3166 return "$default$str$default" if $default and index($str, $default) == -1;
3168 (my $succeed, $str) = balanced_delim($str);
3169 return "$q$str" if $succeed;
3171 for my $delim ('/', '"', '#') {
3172 return "$q$delim" . $str . $delim if index($str, $delim) == -1;
3175 $str =~ s/$default/\\$default/g;
3176 return "$default$str$default";
3185 if (class($sv) eq "SPECIAL") {
3186 return ('undef', '1', '0')[$$sv-1]; # sv_undef, sv_yes, sv_no
3187 } elsif (class($sv) eq "NULL") {
3189 } elsif ($sv->FLAGS & SVf_IOK) {
3190 return $sv->int_value;
3191 } elsif ($sv->FLAGS & SVf_NOK) {
3192 # try the default stringification
3195 # If it's in scientific notation, we might have lost information
3196 return sprintf("%.20e", $sv->NV);
3199 } elsif ($sv->FLAGS & SVf_ROK && $sv->can("RV")) {
3200 return "\\(" . const($sv->RV) . ")"; # constant folded
3201 } elsif ($sv->FLAGS & SVf_POK) {
3203 if ($str =~ /[^ -~]/) { # ASCII for non-printing
3204 return single_delim("qq", '"', uninterp escape_str unback $str);
3206 return single_delim("q", "'", unback $str);
3217 # the constant could be in the pad (under useithreads)
3218 $sv = $self->padval($op->targ) unless $$sv;
3225 if ($op->private & OPpCONST_ARYBASE) {
3228 # if ($op->private & OPpCONST_BARE) { # trouble with `=>' autoquoting
3229 # return $self->const_sv($op)->PV;
3231 my $sv = $self->const_sv($op);
3232 # return const($sv);
3234 return $c =~ /^-\d/ ? $self->maybe_parens($c, $cx, 21) : $c;
3240 my $type = $op->name;
3241 if ($type eq "const") {
3242 return '$[' if $op->private & OPpCONST_ARYBASE;
3243 return uninterp(escape_str(unback($self->const_sv($op)->as_string)));
3244 } elsif ($type eq "concat") {
3245 my $first = $self->dq($op->first);
3246 my $last = $self->dq($op->last);
3248 # Disambiguate "${foo}bar", "${foo}{bar}", "${foo}[1]"
3249 ($last =~ /^[A-Z\\\^\[\]_?]/ &&
3250 $first =~ s/([\$@])\^$/${1}{^}/) # "${^}W" etc
3251 || ($last =~ /^[{\[\w_]/ &&
3252 $first =~ s/([\$@])([A-Za-z_]\w*)$/${1}{$2}/);
3254 return $first . $last;
3255 } elsif ($type eq "uc") {
3256 return '\U' . $self->dq($op->first->sibling) . '\E';
3257 } elsif ($type eq "lc") {
3258 return '\L' . $self->dq($op->first->sibling) . '\E';
3259 } elsif ($type eq "ucfirst") {
3260 return '\u' . $self->dq($op->first->sibling);
3261 } elsif ($type eq "lcfirst") {
3262 return '\l' . $self->dq($op->first->sibling);
3263 } elsif ($type eq "quotemeta") {
3264 return '\Q' . $self->dq($op->first->sibling) . '\E';
3265 } elsif ($type eq "join") {
3266 return $self->deparse($op->last, 26); # was join($", @ary)
3268 return $self->deparse($op, 26);
3276 return single_delim("qx", '`', $self->dq($op->first->sibling));
3282 my $kid = $op->first->sibling; # skip ex-stringify, pushmark
3283 return $self->deparse($kid, $cx) if $self->{'unquote'};
3284 $self->maybe_targmy($kid, $cx,
3285 sub {single_delim("qq", '"', $self->dq($_[1]))});
3288 # OP_STRINGIFY is a listop, but it only ever has one arg
3289 sub pp_stringify { maybe_targmy(@_, \&dquote) }
3291 # tr/// and s/// (and tr[][], tr[]//, tr###, etc)
3292 # note that tr(from)/to/ is OK, but not tr/from/(to)
3294 my($from, $to) = @_;
3295 my($succeed, $delim);
3296 if ($from !~ m[/] and $to !~ m[/]) {
3297 return "/$from/$to/";
3298 } elsif (($succeed, $from) = balanced_delim($from) and $succeed) {
3299 if (($succeed, $to) = balanced_delim($to) and $succeed) {
3302 for $delim ('/', '"', '#') { # note no `'' -- s''' is special
3303 return "$from$delim$to$delim" if index($to, $delim) == -1;
3306 return "$from/$to/";
3309 for $delim ('/', '"', '#') { # note no '
3310 return "$delim$from$delim$to$delim"
3311 if index($to . $from, $delim) == -1;
3313 $from =~ s[/][\\/]g;
3315 return "/$from/$to/";
3319 # Only used by tr///, so backslashes hyphens
3322 if ($n == ord '\\') {
3324 } elsif ($n == ord "-") {
3326 } elsif ($n >= ord(' ') and $n <= ord('~')) {
3328 } elsif ($n == ord "\a") {
3330 } elsif ($n == ord "\b") {
3332 } elsif ($n == ord "\t") {
3334 } elsif ($n == ord "\n") {
3336 } elsif ($n == ord "\e") {
3338 } elsif ($n == ord "\f") {
3340 } elsif ($n == ord "\r") {
3342 } elsif ($n >= ord("\cA") and $n <= ord("\cZ")) {
3343 return '\\c' . chr(ord("@") + $n);
3345 # return '\x' . sprintf("%02x", $n);
3346 return '\\' . sprintf("%03o", $n);
3352 my($str, $c, $tr) = ("");
3353 for ($c = 0; $c < @chars; $c++) {
3356 if ($c <= $#chars - 2 and $chars[$c + 1] == $tr + 1 and
3357 $chars[$c + 2] == $tr + 2)
3359 for (; $c <= $#chars-1 and $chars[$c + 1] == $chars[$c] + 1; $c++)
3362 $str .= pchr($chars[$c]);
3368 sub tr_decode_byte {
3369 my($table, $flags) = @_;
3370 my(@table) = unpack("s*", $table);
3371 splice @table, 0x100, 1; # Number of subsequent elements
3372 my($c, $tr, @from, @to, @delfrom, $delhyphen);
3373 if ($table[ord "-"] != -1 and
3374 $table[ord("-") - 1] == -1 || $table[ord("-") + 1] == -1)
3376 $tr = $table[ord "-"];
3377 $table[ord "-"] = -1;
3381 } else { # -2 ==> delete
3385 for ($c = 0; $c < @table; $c++) {
3388 push @from, $c; push @to, $tr;
3389 } elsif ($tr == -2) {
3393 @from = (@from, @delfrom);
3394 if ($flags & OPpTRANS_COMPLEMENT) {
3397 @from{@from} = (1) x @from;
3398 for ($c = 0; $c < 256; $c++) {
3399 push @newfrom, $c unless $from{$c};
3403 unless ($flags & OPpTRANS_DELETE || !@to) {
3404 pop @to while $#to and $to[$#to] == $to[$#to -1];
3407 $from = collapse(@from);
3408 $to = collapse(@to);
3409 $from .= "-" if $delhyphen;
3410 return ($from, $to);
3415 if ($x == ord "-") {
3417 } elsif ($x == ord "\\") {
3424 # XXX This doesn't yet handle all cases correctly either
3426 sub tr_decode_utf8 {
3427 my($swash_hv, $flags) = @_;
3428 my %swash = $swash_hv->ARRAY;
3430 $final = $swash{'FINAL'}->IV if exists $swash{'FINAL'};
3431 my $none = $swash{"NONE"}->IV;
3432 my $extra = $none + 1;
3433 my(@from, @delfrom, @to);
3435 foreach $line (split /\n/, $swash{'LIST'}->PV) {
3436 my($min, $max, $result) = split(/\t/, $line);
3443 $result = hex $result;
3444 if ($result == $extra) {
3445 push @delfrom, [$min, $max];
3447 push @from, [$min, $max];
3448 push @to, [$result, $result + $max - $min];
3451 for my $i (0 .. $#from) {
3452 if ($from[$i][0] == ord '-') {
3453 unshift @from, splice(@from, $i, 1);
3454 unshift @to, splice(@to, $i, 1);
3456 } elsif ($from[$i][1] == ord '-') {
3459 unshift @from, ord '-';
3460 unshift @to, ord '-';
3464 for my $i (0 .. $#delfrom) {
3465 if ($delfrom[$i][0] == ord '-') {
3466 push @delfrom, splice(@delfrom, $i, 1);
3468 } elsif ($delfrom[$i][1] == ord '-') {
3470 push @delfrom, ord '-';
3474 if (defined $final and $to[$#to][1] != $final) {
3475 push @to, [$final, $final];
3477 push @from, @delfrom;
3478 if ($flags & OPpTRANS_COMPLEMENT) {
3481 for my $i (0 .. $#from) {
3482 push @newfrom, [$next, $from[$i][0] - 1];
3483 $next = $from[$i][1] + 1;
3486 for my $range (@newfrom) {
3487 if ($range->[0] <= $range->[1]) {
3492 my($from, $to, $diff);
3493 for my $chunk (@from) {
3494 $diff = $chunk->[1] - $chunk->[0];
3496 $from .= tr_chr($chunk->[0]) . "-" . tr_chr($chunk->[1]);
3497 } elsif ($diff == 1) {
3498 $from .= tr_chr($chunk->[0]) . tr_chr($chunk->[1]);
3500 $from .= tr_chr($chunk->[0]);
3503 for my $chunk (@to) {
3504 $diff = $chunk->[1] - $chunk->[0];
3506 $to .= tr_chr($chunk->[0]) . "-" . tr_chr($chunk->[1]);
3507 } elsif ($diff == 1) {
3508 $to .= tr_chr($chunk->[0]) . tr_chr($chunk->[1]);
3510 $to .= tr_chr($chunk->[0]);
3513 #$final = sprintf("%04x", $final) if defined $final;
3514 #$none = sprintf("%04x", $none) if defined $none;
3515 #$extra = sprintf("%04x", $extra) if defined $extra;
3516 #print STDERR "final: $final\n none: $none\nextra: $extra\n";
3517 #print STDERR $swash{'LIST'}->PV;
3518 return (escape_str($from), escape_str($to));
3525 if (class($op) eq "PVOP") {
3526 ($from, $to) = tr_decode_byte($op->pv, $op->private);
3527 } else { # class($op) eq "SVOP"
3528 ($from, $to) = tr_decode_utf8($op->sv->RV, $op->private);
3531 $flags .= "c" if $op->private & OPpTRANS_COMPLEMENT;
3532 $flags .= "d" if $op->private & OPpTRANS_DELETE;
3533 $to = "" if $from eq $to and $flags eq "";
3534 $flags .= "s" if $op->private & OPpTRANS_SQUASH;
3535 return "tr" . double_delim($from, $to) . $flags;
3538 # Like dq(), but different
3541 my ($op, $extended) = @_;
3543 my $type = $op->name;
3544 if ($type eq "const") {
3545 return '$[' if $op->private & OPpCONST_ARYBASE;
3546 my $unbacked = re_unback($self->const_sv($op)->as_string);
3547 return re_uninterp_extended(escape_extended_re($unbacked))
3549 return re_uninterp(escape_str($unbacked));
3550 } elsif ($type eq "concat") {
3551 my $first = $self->re_dq($op->first, $extended);
3552 my $last = $self->re_dq($op->last, $extended);
3554 # Disambiguate "${foo}bar", "${foo}{bar}", "${foo}[1]"
3555 ($last =~ /^[A-Z\\\^\[\]_?]/ &&
3556 $first =~ s/([\$@])\^$/${1}{^}/) # "${^}W" etc
3557 || ($last =~ /^[{\[\w_]/ &&
3558 $first =~ s/([\$@])([A-Za-z_]\w*)$/${1}{$2}/);
3560 return $first . $last;
3561 } elsif ($type eq "uc") {
3562 return '\U' . $self->re_dq($op->first->sibling, $extended) . '\E';
3563 } elsif ($type eq "lc") {
3564 return '\L' . $self->re_dq($op->first->sibling, $extended) . '\E';
3565 } elsif ($type eq "ucfirst") {
3566 return '\u' . $self->re_dq($op->first->sibling, $extended);
3567 } elsif ($type eq "lcfirst") {
3568 return '\l' . $self->re_dq($op->first->sibling, $extended);
3569 } elsif ($type eq "quotemeta") {
3570 return '\Q' . $self->re_dq($op->first->sibling, $extended) . '\E';
3571 } elsif ($type eq "join") {
3572 return $self->deparse($op->last, 26); # was join($", @ary)
3574 return $self->deparse($op, 26);
3579 my ($self, $op) = @_;
3580 my $type = $op->name;
3582 if ($type eq 'const') {
3585 elsif ($type =~ /^[ul]c(first)?$/ || $type eq 'quotemeta') {
3586 return $self->pure_string($op->first->sibling);
3588 elsif ($type eq 'join') {
3589 my $join_op = $op->first->sibling; # Skip pushmark
3590 return 0 unless $join_op->name eq 'null' && $join_op->targ eq OP_RV2SV;
3592 my $gvop = $join_op->first;
3593 return 0 unless $gvop->name eq 'gvsv';
3594 return 0 unless '"' eq $self->gv_name($self->gv_or_padgv($gvop));
3596 return 0 unless ${$join_op->sibling} eq ${$op->last};
3597 return 0 unless $op->last->name =~ /^(rv2|pad)av$/;
3599 elsif ($type eq 'concat') {
3600 return $self->pure_string($op->first)
3601 && $self->pure_string($op->last);
3603 elsif (is_scalar($op) || $type =~ /^[ah]elem(fast)?$/) {
3615 my($op, $cx, $extended) = @_;
3616 my $kid = $op->first;
3617 $kid = $kid->first if $kid->name eq "regcmaybe";
3618 $kid = $kid->first if $kid->name eq "regcreset";
3619 return ($self->re_dq($kid, $extended), 1) if $self->pure_string($kid);
3620 return ($self->deparse($kid, $cx), 0);
3624 my ($self, $op, $cx) = @_;
3625 return (($self->regcomp($op, $cx, 0))[0]);
3628 # osmic acid -- see osmium tetroxide
3631 map($matchwords{join "", sort split //, $_} = $_, 'cig', 'cog', 'cos', 'cogs',
3632 'cox', 'go', 'is', 'ism', 'iso', 'mig', 'mix', 'osmic', 'ox', 'sic',
3633 'sig', 'six', 'smog', 'so', 'soc', 'sog', 'xi');
3637 my($op, $cx, $name, $delim) = @_;
3638 my $kid = $op->first;
3639 my ($binop, $var, $re) = ("", "", "");
3640 if ($op->flags & OPf_STACKED) {
3642 $var = $self->deparse($kid, 20);
3643 $kid = $kid->sibling;
3646 my $extended = ($op->pmflags & PMf_EXTENDED);
3648 my $unbacked = re_unback($op->precomp);
3650 $re = re_uninterp_extended(escape_extended_re($unbacked));
3652 $re = re_uninterp(escape_str(re_unback($op->precomp)));
3654 } elsif ($kid->name ne 'regcomp') {
3655 carp("found ".$kid->name." where regcomp expected");
3657 ($re, $quote) = $self->regcomp($kid, 1, $extended);
3660 $flags .= "c" if $op->pmflags & PMf_CONTINUE;
3661 $flags .= "g" if $op->pmflags & PMf_GLOBAL;
3662 $flags .= "i" if $op->pmflags & PMf_FOLD;
3663 $flags .= "m" if $op->pmflags & PMf_MULTILINE;
3664 $flags .= "o" if $op->pmflags & PMf_KEEP;
3665 $flags .= "s" if $op->pmflags & PMf_SINGLELINE;
3666 $flags .= "x" if $op->pmflags & PMf_EXTENDED;
3667 $flags = $matchwords{$flags} if $matchwords{$flags};
3668 if ($op->pmflags & PMf_ONCE) { # only one kind of delimiter works here
3672 $re = single_delim($name, $delim, $re);
3674 $re = $re . $flags if $quote;
3676 return $self->maybe_parens("$var =~ $re", $cx, 20);
3682 sub pp_match { matchop(@_, "m", "/") }
3683 sub pp_pushre { matchop(@_, "m", "/") }
3684 sub pp_qr { matchop(@_, "qr", "") }
3689 my($kid, @exprs, $ary, $expr);
3691 # under ithreads pmreplroot is an integer, not an SV
3692 my $replroot = $kid->pmreplroot;
3693 if ( ( ref($replroot) && $$replroot ) ||
3694 ( !ref($replroot) && $replroot ) ) {
3695 $ary = $self->stash_variable('@', $self->gv_name($kid->pmreplroot));
3697 for (; !null($kid); $kid = $kid->sibling) {
3698 push @exprs, $self->deparse($kid, 6);
3701 # handle special case of split(), and split(" ") that compiles to /\s+/
3703 if ($kid->flags & OPf_SPECIAL
3704 && $exprs[0] eq '/\\s+/'
3705 && $kid->pmflags & PMf_SKIPWHITE ) {
3709 $expr = "split(" . join(", ", @exprs) . ")";
3711 return $self->maybe_parens("$ary = $expr", $cx, 7);
3717 # oxime -- any of various compounds obtained chiefly by the action of
3718 # hydroxylamine on aldehydes and ketones and characterized by the
3719 # bivalent grouping C=NOH [Webster's Tenth]
3722 map($substwords{join "", sort split //, $_} = $_, 'ego', 'egoism', 'em',
3723 'es', 'ex', 'exes', 'gee', 'go', 'goes', 'ie', 'ism', 'iso', 'me',
3724 'meese', 'meso', 'mig', 'mix', 'os', 'ox', 'oxime', 'see', 'seem',
3725 'seg', 'sex', 'sig', 'six', 'smog', 'sog', 'some', 'xi');
3730 my $kid = $op->first;
3731 my($binop, $var, $re, $repl) = ("", "", "", "");
3732 if ($op->flags & OPf_STACKED) {
3734 $var = $self->deparse($kid, 20);
3735 $kid = $kid->sibling;
3738 if (null($op->pmreplroot)) {
3739 $repl = $self->dq($kid);
3740 $kid = $kid->sibling;
3742 $repl = $op->pmreplroot->first; # skip substcont
3743 while ($repl->name eq "entereval") {
3744 $repl = $repl->first;
3747 if ($op->pmflags & PMf_EVAL) {
3748 $repl = $self->deparse($repl, 0, 1);
3750 $repl = $self->dq($repl);
3753 my $extended = ($op->pmflags & PMf_EXTENDED);
3755 my $unbacked = re_unback($op->precomp);
3757 $re = re_uninterp_extended(escape_extended_re($unbacked));
3760 $re = re_uninterp(escape_str($unbacked));
3763 ($re) = $self->regcomp($kid, 1, $extended);
3765 $flags .= "e" if $op->pmflags & PMf_EVAL;
3766 $flags .= "g" if $op->pmflags & PMf_GLOBAL;
3767 $flags .= "i" if $op->pmflags & PMf_FOLD;
3768 $flags .= "m" if $op->pmflags & PMf_MULTILINE;
3769 $flags .= "o" if $op->pmflags & PMf_KEEP;
3770 $flags .= "s" if $op->pmflags & PMf_SINGLELINE;
3771 $flags .= "x" if $extended;
3772 $flags = $substwords{$flags} if $substwords{$flags};
3774 return $self->maybe_parens("$var =~ s"
3775 . double_delim($re, $repl) . $flags,
3778 return "s". double_delim($re, $repl) . $flags;
3787 B::Deparse - Perl compiler backend to produce perl code
3791 B<perl> B<-MO=Deparse>[B<,-u>I<PACKAGE>][B<,-p>][B<,-q>][B<,-l>]
3792 [B<,-s>I<LETTERS>][B<,-x>I<LEVEL>] I<prog.pl>
3796 B::Deparse is a backend module for the Perl compiler that generates
3797 perl source code, based on the internal compiled structure that perl
3798 itself creates after parsing a program. The output of B::Deparse won't
3799 be exactly the same as the original source, since perl doesn't keep
3800 track of comments or whitespace, and there isn't a one-to-one
3801 correspondence between perl's syntactical constructions and their
3802 compiled form, but it will often be close. When you use the B<-p>
3803 option, the output also includes parentheses even when they are not
3804 required by precedence, which can make it easy to see if perl is
3805 parsing your expressions the way you intended.
3807 Please note that this module is mainly new and untested code and is
3808 still under development, so it may change in the future.
3812 As with all compiler backend options, these must follow directly after
3813 the '-MO=Deparse', separated by a comma but not any white space.
3819 Add '#line' declarations to the output based on the line and file
3820 locations of the original code.
3824 Print extra parentheses. Without this option, B::Deparse includes
3825 parentheses in its output only when they are needed, based on the
3826 structure of your program. With B<-p>, it uses parentheses (almost)
3827 whenever they would be legal. This can be useful if you are used to
3828 LISP, or if you want to see how perl parses your input. If you say
3830 if ($var & 0x7f == 65) {print "Gimme an A!"}
3831 print ($which ? $a : $b), "\n";
3832 $name = $ENV{USER} or "Bob";
3834 C<B::Deparse,-p> will print
3837 print('Gimme an A!')
3839 (print(($which ? $a : $b)), '???');
3840 (($name = $ENV{'USER'}) or '???')
3842 which probably isn't what you intended (the C<'???'> is a sign that
3843 perl optimized away a constant value).
3847 Disable prototype checking. With this option, all function calls are
3848 deparsed as if no prototype was defined for them. In other words,
3850 perl -MO=Deparse,-P -e 'sub foo (\@) { 1 } foo @x'
3859 making clear how the parameters are actually passed to C<foo>.
3863 Expand double-quoted strings into the corresponding combinations of
3864 concatenation, uc, ucfirst, lc, lcfirst, quotemeta, and join. For
3867 print "Hello, $world, @ladies, \u$gentlemen\E, \u\L$me!";
3871 print 'Hello, ' . $world . ', ' . join($", @ladies) . ', '
3872 . ucfirst($gentlemen) . ', ' . ucfirst(lc $me . '!');
3874 Note that the expanded form represents the way perl handles such
3875 constructions internally -- this option actually turns off the reverse
3876 translation that B::Deparse usually does. On the other hand, note that
3877 C<$x = "$y"> is not the same as C<$x = $y>: the former makes the value
3878 of $y into a string before doing the assignment.
3882 Normally, B::Deparse deparses the main code of a program, and all the subs
3883 defined in the same file. To include subs defined in other files, pass the
3884 B<-f> option with the filename. You can pass the B<-f> option several times, to
3885 include more than one secondary file. (Most of the time you don't want to
3886 use it at all.) You can also use this option to include subs which are
3887 defined in the scope of a B<#line> directive with two parameters.
3889 =item B<-s>I<LETTERS>
3891 Tweak the style of B::Deparse's output. The letters should follow
3892 directly after the 's', with no space or punctuation. The following
3893 options are available:
3899 Cuddle C<elsif>, C<else>, and C<continue> blocks. For example, print
3916 The default is not to cuddle.
3920 Indent lines by multiples of I<NUMBER> columns. The default is 4 columns.
3924 Use tabs for each 8 columns of indent. The default is to use only spaces.
3925 For instance, if the style options are B<-si4T>, a line that's indented
3926 3 times will be preceded by one tab and four spaces; if the options were
3927 B<-si8T>, the same line would be preceded by three tabs.
3929 =item B<v>I<STRING>B<.>
3931 Print I<STRING> for the value of a constant that can't be determined
3932 because it was optimized away (mnemonic: this happens when a constant
3933 is used in B<v>oid context). The end of the string is marked by a period.
3934 The string should be a valid perl expression, generally a constant.
3935 Note that unless it's a number, it probably needs to be quoted, and on
3936 a command line quotes need to be protected from the shell. Some
3937 conventional values include 0, 1, 42, '', 'foo', and
3938 'Useless use of constant omitted' (which may need to be
3939 B<-sv"'Useless use of constant omitted'.">
3940 or something similar depending on your shell). The default is '???'.
3941 If you're using B::Deparse on a module or other file that's require'd,
3942 you shouldn't use a value that evaluates to false, since the customary
3943 true constant at the end of a module will be in void context when the
3944 file is compiled as a main program.
3950 Expand conventional syntax constructions into equivalent ones that expose
3951 their internal operation. I<LEVEL> should be a digit, with higher values
3952 meaning more expansion. As with B<-q>, this actually involves turning off
3953 special cases in B::Deparse's normal operations.
3955 If I<LEVEL> is at least 3, for loops will be translated into equivalent
3956 while loops with continue blocks; for instance
3958 for ($i = 0; $i < 10; ++$i) {
3971 Note that in a few cases this translation can't be perfectly carried back
3972 into the source code -- if the loop's initializer declares a my variable,
3973 for instance, it won't have the correct scope outside of the loop.
3975 If I<LEVEL> is at least 7, if statements will be translated into equivalent
3976 expressions using C<&&>, C<?:> and C<do {}>; for instance
3978 print 'hi' if $nice;
3990 $nice and print 'hi';
3991 $nice and do { print 'hi' };
3992 $nice ? do { print 'hi' } : do { print 'bye' };
3994 Long sequences of elsifs will turn into nested ternary operators, which
3995 B::Deparse doesn't know how to indent nicely.
3999 =head1 USING B::Deparse AS A MODULE
4004 $deparse = B::Deparse->new("-p", "-sC");
4005 $body = $deparse->coderef2text(\&func);
4006 eval "sub func $body"; # the inverse operation
4010 B::Deparse can also be used on a sub-by-sub basis from other perl
4015 $deparse = B::Deparse->new(OPTIONS)
4017 Create an object to store the state of a deparsing operation and any
4018 options. The options are the same as those that can be given on the
4019 command line (see L</OPTIONS>); options that are separated by commas
4020 after B<-MO=Deparse> should be given as separate strings. Some
4021 options, like B<-u>, don't make sense for a single subroutine, so
4024 =head2 ambient_pragmas
4026 $deparse->ambient_pragmas(strict => 'all', '$[' => $[);
4028 The compilation of a subroutine can be affected by a few compiler
4029 directives, B<pragmas>. These are:
4043 Assigning to the special variable $[
4063 Ordinarily, if you use B::Deparse on a subroutine which has
4064 been compiled in the presence of one or more of these pragmas,
4065 the output will include statements to turn on the appropriate
4066 directives. So if you then compile the code returned by coderef2text,
4067 it will behave the same way as the subroutine which you deparsed.
4069 However, you may know that you intend to use the results in a
4070 particular context, where some pragmas are already in scope. In
4071 this case, you use the B<ambient_pragmas> method to describe the
4072 assumptions you wish to make.
4074 Not all of the options currently have any useful effect. See
4075 L</BUGS> for more details.
4077 The parameters it accepts are:
4083 Takes a string, possibly containing several values separated
4084 by whitespace. The special values "all" and "none" mean what you'd
4087 $deparse->ambient_pragmas(strict => 'subs refs');
4091 Takes a number, the value of the array base $[.
4099 If the value is true, then the appropriate pragma is assumed to
4100 be in the ambient scope, otherwise not.
4104 Takes a string, possibly containing a whitespace-separated list of
4105 values. The values "all" and "none" are special. It's also permissible
4106 to pass an array reference here.
4108 $deparser->ambient_pragmas(re => 'eval');
4113 Takes a string, possibly containing a whitespace-separated list of
4114 values. The values "all" and "none" are special, again. It's also
4115 permissible to pass an array reference here.
4117 $deparser->ambient_pragmas(warnings => [qw[void io]]);
4119 If one of the values is the string "FATAL", then all the warnings
4120 in that list will be considered fatal, just as with the B<warnings>
4121 pragma itself. Should you need to specify that some warnings are
4122 fatal, and others are merely enabled, you can pass the B<warnings>
4125 $deparser->ambient_pragmas(
4127 warnings => [FATAL => qw/void io/],
4130 See L<perllexwarn> for more information about lexical warnings.
4136 These two parameters are used to specify the ambient pragmas in
4137 the format used by the special variables $^H and ${^WARNING_BITS}.
4139 They exist principally so that you can write code like:
4141 { my ($hint_bits, $warning_bits);
4142 BEGIN {($hint_bits, $warning_bits) = ($^H, ${^WARNING_BITS})}
4143 $deparser->ambient_pragmas (
4144 hint_bits => $hint_bits,
4145 warning_bits => $warning_bits,
4149 which specifies that the ambient pragmas are exactly those which
4150 are in scope at the point of calling.
4156 $body = $deparse->coderef2text(\&func)
4157 $body = $deparse->coderef2text(sub ($$) { ... })
4159 Return source code for the body of a subroutine (a block, optionally
4160 preceded by a prototype in parens), given a reference to the
4161 sub. Because a subroutine can have no names, or more than one name,
4162 this method doesn't return a complete subroutine definition -- if you
4163 want to eval the result, you should prepend "sub subname ", or "sub "
4164 for an anonymous function constructor. Unless the sub was defined in
4165 the main:: package, the code will include a package declaration.
4173 The only pragmas to be completely supported are: C<use warnings>,
4174 C<use strict 'refs'>, C<use bytes>, and C<use integer>. (C<$[>, which
4175 behaves like a pragma, is also supported.)
4177 Excepting those listed above, we're currently unable to guarantee that
4178 B::Deparse will produce a pragma at the correct point in the program.
4179 Since the effects of pragmas are often lexically scoped, this can mean
4180 that the pragma holds sway over a different portion of the program
4181 than in the input file.
4185 In fact, the above is a specific instance of a more general problem:
4186 we can't guarantee to produce BEGIN blocks or C<use> declarations in
4187 exactly the right place. So if you use a module which affects compilation
4188 (such as by over-riding keywords, overloading constants or whatever)
4189 then the output code might not work as intended.
4191 This is the most serious outstanding problem, and will be very hard
4196 If a keyword is over-ridden, and your program explicitly calls
4197 the built-in version by using CORE::keyword, the output of B::Deparse
4198 will not reflect this. If you run the resulting code, it will call
4199 the over-ridden version rather than the built-in one. (Maybe there
4200 should be an option to B<always> print keyword calls as C<CORE::name>.)
4204 C<sort foo (1, 2, 3)> comes out as C<sort (foo 1, 2, 3)>, which
4205 causes perl to issue a warning.
4207 The obvious fix doesn't work, because these are different:
4209 print (FOO 1, 2, 3), 4, 5, 6;
4210 print FOO (1, 2, 3), 4, 5, 6;
4214 Constants (other than simple strings or numbers) don't work properly.
4215 Pathological examples that fail (and probably always will) include:
4217 use constant E2BIG => ($!=7);
4218 use constant x=>\$x; print x
4220 The following could (and should) be made to work:
4222 use constant regex => qr/blah/;
4227 An input file that uses source filtering probably won't be deparsed into
4228 runnable code, because it will still include the B<use> declaration
4229 for the source filtering module, even though the code that is
4230 produced is already ordinary Perl which shouldn't be filtered again.
4234 There are probably many more bugs on non-ASCII platforms (EBCDIC).
4240 Stephen McCamant <smcc@CSUA.Berkeley.EDU>, based on an earlier
4241 version by Malcolm Beattie <mbeattie@sable.ox.ac.uk>, with
4242 contributions from Gisle Aas, James Duncan, Albert Dvornik, Robin
4243 Houston, Hugo van der Sanden, Gurusamy Sarathy, Nick Ing-Simmons,
4244 and Rafael Garcia-Suarez.