2 # Copyright (c) 1998-2000, 2002, 2003, 2004, 2005, 2006 Stephen McCamant.
4 # This module is free software; you can redistribute and/or modify
5 # it under the same terms as Perl itself.
7 # This is based on the module of the same name by Malcolm Beattie,
8 # but essentially none of his code remains.
12 use B qw(class main_root main_start main_cv svref_2object opnumber perlstring
13 OPf_WANT OPf_WANT_VOID OPf_WANT_SCALAR OPf_WANT_LIST
14 OPf_KIDS OPf_REF OPf_STACKED OPf_SPECIAL OPf_MOD
15 OPpLVAL_INTRO OPpOUR_INTRO OPpENTERSUB_AMPER OPpSLICE OPpCONST_BARE
16 OPpTRANS_SQUASH OPpTRANS_DELETE OPpTRANS_COMPLEMENT OPpTARGET_MY
17 OPpEXISTS_SUB OPpSORT_NUMERIC OPpSORT_INTEGER
19 SVf_IOK SVf_NOK SVf_ROK SVf_POK SVpad_OUR SVf_FAKE SVs_RMG SVs_SMG
21 PMf_KEEP PMf_GLOBAL PMf_CONTINUE PMf_EVAL PMf_ONCE
22 PMf_MULTILINE PMf_SINGLELINE PMf_FOLD PMf_EXTENDED);
25 use vars qw/$AUTOLOAD/;
29 # List version-specific constants here.
30 # Easiest way to keep this code portable between version looks to
31 # be to fake up a dummy constant that will never actually be true.
32 foreach (qw(OPpSORT_INPLACE OPpSORT_DESCEND OPpITER_REVERSED OPpCONST_NOVER
33 OPpPAD_STATE PMf_SKIPWHITE RXf_SKIPWHITE
34 RXf_PMf_CHARSET RXf_PMf_KEEPCOPY
35 CVf_LOCKED OPpREVERSE_INPLACE OPpSUBSTR_REPL_FIRST
36 PMf_NONDESTRUCT OPpCONST_ARYBASE OPpEVAL_BYTES)) {
39 *{$_} = sub () {0} unless *{$_}{CODE};
43 # Changes between 0.50 and 0.51:
44 # - fixed nulled leave with live enter in sort { }
45 # - fixed reference constants (\"str")
46 # - handle empty programs gracefully
47 # - handle infinite loops (for (;;) {}, while (1) {})
48 # - differentiate between 'for my $x ...' and 'my $x; for $x ...'
49 # - various minor cleanups
50 # - moved globals into an object
51 # - added '-u', like B::C
52 # - package declarations using cop_stash
53 # - subs, formats and code sorted by cop_seq
54 # Changes between 0.51 and 0.52:
55 # - added pp_threadsv (special variables under USE_5005THREADS)
56 # - added documentation
57 # Changes between 0.52 and 0.53:
58 # - many changes adding precedence contexts and associativity
59 # - added '-p' and '-s' output style options
60 # - various other minor fixes
61 # Changes between 0.53 and 0.54:
62 # - added support for new 'for (1..100)' optimization,
64 # Changes between 0.54 and 0.55:
65 # - added support for new qr// construct
66 # - added support for new pp_regcreset OP
67 # Changes between 0.55 and 0.56:
68 # - tested on base/*.t, cmd/*.t, comp/*.t, io/*.t
69 # - fixed $# on non-lexicals broken in last big rewrite
70 # - added temporary fix for change in opcode of OP_STRINGIFY
71 # - fixed problem in 0.54's for() patch in 'for (@ary)'
72 # - fixed precedence in conditional of ?:
73 # - tweaked list paren elimination in 'my($x) = @_'
74 # - made continue-block detection trickier wrt. null ops
75 # - fixed various prototype problems in pp_entersub
76 # - added support for sub prototypes that never get GVs
77 # - added unquoting for special filehandle first arg in truncate
78 # - print doubled rv2gv (a bug) as '*{*GV}' instead of illegal '**GV'
79 # - added semicolons at the ends of blocks
80 # - added -l '#line' declaration option -- fixes cmd/subval.t 27,28
81 # Changes between 0.56 and 0.561:
82 # - fixed multiply-declared my var in pp_truncate (thanks to Sarathy)
83 # - used new B.pm symbolic constants (done by Nick Ing-Simmons)
84 # Changes between 0.561 and 0.57:
85 # - stylistic changes to symbolic constant stuff
86 # - handled scope in s///e replacement code
87 # - added unquote option for expanding "" into concats, etc.
88 # - split method and proto parts of pp_entersub into separate functions
89 # - various minor cleanups
91 # - added parens in \&foo (patch by Albert Dvornik)
92 # Changes between 0.57 and 0.58:
93 # - fixed '0' statements that weren't being printed
94 # - added methods for use from other programs
95 # (based on patches from James Duncan and Hugo van der Sanden)
96 # - added -si and -sT to control indenting (also based on a patch from Hugo)
97 # - added -sv to print something else instead of '???'
98 # - preliminary version of utf8 tr/// handling
100 # - uses of $op->ppaddr changed to new $op->name (done by Sarathy)
101 # - added support for Hugo's new OP_SETSTATE (like nextstate)
102 # Changes between 0.58 and 0.59
103 # - added support for Chip's OP_METHOD_NAMED
104 # - added support for Ilya's OPpTARGET_MY optimization
105 # - elided arrows before '()' subscripts when possible
106 # Changes between 0.59 and 0.60
107 # - support for method attributes was added
108 # - some warnings fixed
109 # - separate recognition of constant subs
110 # - rewrote continue block handling, now recognizing for loops
111 # - added more control of expanding control structures
112 # Changes between 0.60 and 0.61 (mostly by Robin Houston)
114 # - support for pragmas and 'use'
115 # - support for the little-used $[ variable
116 # - support for __DATA__ sections
118 # - BEGIN, CHECK, INIT and END blocks
119 # - scoping of subroutine declarations fixed
120 # - compile-time output from the input program can be suppressed, so that the
121 # output is just the deparsed code. (a change to O.pm in fact)
122 # - our() declarations
123 # - *all* the known bugs are now listed in the BUGS section
124 # - comprehensive test mechanism (TEST -deparse)
125 # Changes between 0.62 and 0.63 (mostly by Rafael Garcia-Suarez)
128 # - support for command-line switches (-l, -0, etc.)
129 # Changes between 0.63 and 0.64
130 # - support for //, CHECK blocks, and assertions
131 # - improved handling of foreach loops and lexicals
132 # - option to use Data::Dumper for constants
134 # - discovered lots more bugs not yet fixed
138 # Changes between 0.72 and 0.73
139 # - support new switch constructs
142 # (See also BUGS section at the end of this file)
144 # - finish tr/// changes
145 # - add option for even more parens (generalize \&foo change)
146 # - left/right context
147 # - copy comments (look at real text with $^P?)
148 # - avoid semis in one-statement blocks
149 # - associativity of &&=, ||=, ?:
150 # - ',' => '=>' (auto-unquote?)
151 # - break long lines ("\r" as discretionary break?)
152 # - configurable syntax highlighting: ANSI color, HTML, TeX, etc.
153 # - more style options: brace style, hex vs. octal, quotes, ...
154 # - print big ints as hex/octal instead of decimal (heuristic?)
155 # - handle 'my $x if 0'?
156 # - version using op_next instead of op_first/sibling?
157 # - avoid string copies (pass arrays, one big join?)
160 # Current test.deparse failures
161 # comp/hints 6 - location of BEGIN blocks wrt. block openings
162 # run/switchI 1 - missing -I switches entirely
163 # perl -Ifoo -e 'print @INC'
164 # op/caller 2 - warning mask propagates backwards before warnings::register
165 # 'use warnings; BEGIN {${^WARNING_BITS} eq "U"x12;} use warnings::register'
166 # op/getpid 2 - can't assign to shared my() declaration (threads only)
167 # 'my $x : shared = 5'
168 # op/override 7 - parens on overridden require change v-string interpretation
169 # 'BEGIN{*CORE::GLOBAL::require=sub {}} require v5.6'
170 # c.f. 'BEGIN { *f = sub {0} }; f 2'
171 # op/pat 774 - losing Unicode-ness of Latin1-only strings
172 # 'use charnames ":short"; $x="\N{latin:a with acute}"'
173 # op/recurse 12 - missing parens on recursive call makes it look like method
175 # op/subst 90 - inconsistent handling of utf8 under "use utf8"
176 # op/taint 29 - "use re 'taint'" deparsed in the wrong place wrt. block open
177 # op/tiehandle compile - "use strict" deparsed in the wrong place
179 # ext/B/t/xref 11 - line numbers when we add newlines to one-line subs
180 # ext/Data/Dumper/t/dumper compile
181 # ext/DB_file/several
183 # ext/Ernno/Errno warnings
184 # ext/IO/lib/IO/t/io_sel 23
185 # ext/PerlIO/t/encoding compile
186 # ext/POSIX/t/posix 6
187 # ext/Socket/Socket 8
188 # ext/Storable/t/croak compile
189 # lib/Attribute/Handlers/t/multi compile
190 # lib/bignum/ several
194 # lib/ExtUtils/t/bytes 4
195 # lib/File/DosGlob compile
196 # lib/Filter/Simple/t/data 1
197 # lib/Math/BigInt/t/constant 1
198 # lib/Net/t/config Deparse-warning
199 # lib/overload compile
200 # lib/Switch/ several
202 # lib/Test/Simple several
204 # lib/Tie/File/t/29_downcopy 5
207 # Object fields (were globals):
210 # (local($a), local($b)) and local($a, $b) have the same internal
211 # representation but the short form looks better. We notice we can
212 # use a large-scale local when checking the list, but need to prevent
213 # individual locals too. This hash holds the addresses of OPs that
214 # have already had their local-ness accounted for. The same thing
218 # CV for current sub (or main program) being deparsed
221 # Cached hash of lexical variables for curcv: keys are
222 # names prefixed with "m" or "o" (representing my/our), and
223 # each value is an array of pairs, indicating the cop_seq of scopes
224 # in which a var of that name is valid.
227 # COP for statement being deparsed
230 # name of the current package for deparsed code
233 # array of [cop_seq, CV, is_format?] for subs and formats we still
237 # as above, but [name, prototype] for subs that never got a GV
239 # subs_done, forms_done:
240 # keys are addresses of GVs for subs and formats we've already
241 # deparsed (or at least put into subs_todo)
244 # keys are names of subs for which we've printed declarations.
245 # That means we can omit parentheses from the arguments. It also means we
246 # need to put CORE:: on core functions of the same name.
249 # Keeps track of fully qualified names of all deparsed subs.
254 # cuddle: ' ' or '\n', depending on -sC
259 # A little explanation of how precedence contexts and associativity
262 # deparse() calls each per-op subroutine with an argument $cx (short
263 # for context, but not the same as the cx* in the perl core), which is
264 # a number describing the op's parents in terms of precedence, whether
265 # they're inside an expression or at statement level, etc. (see
266 # chart below). When ops with children call deparse on them, they pass
267 # along their precedence. Fractional values are used to implement
268 # associativity ('($x + $y) + $z' => '$x + $y + $y') and related
269 # parentheses hacks. The major disadvantage of this scheme is that
270 # it doesn't know about right sides and left sides, so say if you
271 # assign a listop to a variable, it can't tell it's allowed to leave
272 # the parens off the listop.
275 # 26 [TODO] inside interpolation context ("")
276 # 25 left terms and list operators (leftward)
280 # 21 right ! ~ \ and unary + and -
285 # 16 nonassoc named unary operators
286 # 15 nonassoc < > <= >= lt gt le ge
287 # 14 nonassoc == != <=> eq ne cmp
294 # 7 right = += -= *= etc.
296 # 5 nonassoc list operators (rightward)
300 # 1 statement modifiers
301 # 0.5 statements, but still print scopes as do { ... }
304 # Nonprinting characters with special meaning:
305 # \cS - steal parens (see maybe_parens_unop)
306 # \n - newline and indent
307 # \t - increase indent
308 # \b - decrease indent ('outdent')
309 # \f - flush left (no indent)
310 # \cK - kill following semicolon, if any
314 return class($op) eq "NULL";
319 my($cv, $is_form) = @_;
320 return unless ($cv->FILE eq $0 || exists $self->{files}{$cv->FILE});
322 if ($cv->OUTSIDE_SEQ) {
323 $seq = $cv->OUTSIDE_SEQ;
324 } elsif (!null($cv->START) and is_state($cv->START)) {
325 $seq = $cv->START->cop_seq;
329 push @{$self->{'subs_todo'}}, [$seq, $cv, $is_form];
330 unless ($is_form || class($cv->STASH) eq 'SPECIAL') {
331 $self->{'subs_deparsed'}{$cv->STASH->NAME."::".$cv->GV->NAME} = 1;
337 my $ent = shift @{$self->{'subs_todo'}};
340 my $name = $self->gv_name($gv);
342 return "format $name =\n"
343 . $self->deparse_format($ent->[1]). "\n";
345 $self->{'subs_declared'}{$name} = 1;
346 if ($name eq "BEGIN") {
347 my $use_dec = $self->begin_is_use($cv);
348 if (defined ($use_dec) and $self->{'expand'} < 5) {
349 return () if 0 == length($use_dec);
354 if ($self->{'linenums'}) {
355 my $line = $gv->LINE;
356 my $file = $gv->FILE;
357 $l = "\n\f#line $line \"$file\"\n";
360 if (class($cv->STASH) ne "SPECIAL") {
361 my $stash = $cv->STASH->NAME;
362 if ($stash ne $self->{'curstash'}) {
363 $p = "package $stash;\n";
364 $name = "$self->{'curstash'}::$name" unless $name =~ /::/;
365 $self->{'curstash'} = $stash;
367 $name =~ s/^\Q$stash\E::(?!\z|.*::)//;
369 return "${p}${l}sub $name " . $self->deparse_sub($cv);
373 # Return a "use" declaration for this BEGIN block, if appropriate
375 my ($self, $cv) = @_;
376 my $root = $cv->ROOT;
377 local @$self{qw'curcv curcvlex'} = ($cv);
379 #B::walkoptree($cv->ROOT, "debug");
380 my $lineseq = $root->first;
381 return if $lineseq->name ne "lineseq";
383 my $req_op = $lineseq->first->sibling;
384 return if $req_op->name ne "require";
387 if ($req_op->first->private & OPpCONST_BARE) {
388 # Actually it should always be a bareword
389 $module = $self->const_sv($req_op->first)->PV;
390 $module =~ s[/][::]g;
394 $module = $self->const($self->const_sv($req_op->first), 6);
398 my $version_op = $req_op->sibling;
399 return if class($version_op) eq "NULL";
400 if ($version_op->name eq "lineseq") {
401 # We have a version parameter; skip nextstate & pushmark
402 my $constop = $version_op->first->next->next;
404 return unless $self->const_sv($constop)->PV eq $module;
405 $constop = $constop->sibling;
406 $version = $self->const_sv($constop);
407 if (class($version) eq "IV") {
408 $version = $version->int_value;
409 } elsif (class($version) eq "NV") {
410 $version = $version->NV;
411 } elsif (class($version) ne "PVMG") {
412 # Includes PVIV and PVNV
413 $version = $version->PV;
415 # version specified as a v-string
416 $version = 'v'.join '.', map ord, split //, $version->PV;
418 $constop = $constop->sibling;
419 return if $constop->name ne "method_named";
420 return if $self->const_sv($constop)->PV ne "VERSION";
423 $lineseq = $version_op->sibling;
424 return if $lineseq->name ne "lineseq";
425 my $entersub = $lineseq->first->sibling;
426 if ($entersub->name eq "stub") {
427 return "use $module $version ();\n" if defined $version;
428 return "use $module ();\n";
430 return if $entersub->name ne "entersub";
432 # See if there are import arguments
435 my $svop = $entersub->first->sibling; # Skip over pushmark
436 return unless $self->const_sv($svop)->PV eq $module;
438 # Pull out the arguments
439 for ($svop=$svop->sibling; $svop->name ne "method_named";
440 $svop = $svop->sibling) {
441 $args .= ", " if length($args);
442 $args .= $self->deparse($svop, 6);
446 my $method_named = $svop;
447 return if $method_named->name ne "method_named";
448 my $method_name = $self->const_sv($method_named)->PV;
450 if ($method_name eq "unimport") {
454 # Certain pragmas are dealt with using hint bits,
455 # so we ignore them here
456 if ($module eq 'strict' || $module eq 'integer'
457 || $module eq 'bytes' || $module eq 'warnings'
458 || $module eq 'feature') {
462 if (defined $version && length $args) {
463 return "$use $module $version ($args);\n";
464 } elsif (defined $version) {
465 return "$use $module $version;\n";
466 } elsif (length $args) {
467 return "$use $module ($args);\n";
469 return "$use $module;\n";
474 my ($self, $pack, $seen) = @_;
476 if (!defined $pack) {
481 $pack =~ s/(::)?$/::/;
483 $stash = \%{"main::$pack"};
487 $INC{"overload.pm"} ? overload::StrVal($stash) : $stash
489 my %stash = svref_2object($stash)->ARRAY;
490 while (my ($key, $val) = each %stash) {
491 my $class = class($val);
492 if ($class eq "PV") {
493 # Just a prototype. As an ugly but fairly effective way
494 # to find out if it belongs here is to see if the AUTOLOAD
495 # (if any) for the stash was defined in one of our files.
496 my $A = $stash{"AUTOLOAD"};
497 if (defined ($A) && class($A) eq "GV" && defined($A->CV)
498 && class($A->CV) eq "CV") {
500 next unless $AF eq $0 || exists $self->{'files'}{$AF};
502 push @{$self->{'protos_todo'}}, [$pack . $key, $val->PV];
503 } elsif ($class eq "IV" && !($val->FLAGS & SVf_ROK)) {
504 # Just a name. As above.
505 # But skip proxy constant subroutines, as some form of perl-space
506 # visible code must have created them, be it a use statement, or
507 # some direct symbol-table manipulation code that we will Deparse
508 my $A = $stash{"AUTOLOAD"};
509 if (defined ($A) && class($A) eq "GV" && defined($A->CV)
510 && class($A->CV) eq "CV") {
512 next unless $AF eq $0 || exists $self->{'files'}{$AF};
514 push @{$self->{'protos_todo'}}, [$pack . $key, undef];
515 } elsif ($class eq "GV") {
516 if (class(my $cv = $val->CV) ne "SPECIAL") {
517 next if $self->{'subs_done'}{$$val}++;
518 next if $$val != ${$cv->GV}; # Ignore imposters
521 if (class(my $cv = $val->FORM) ne "SPECIAL") {
522 next if $self->{'forms_done'}{$$val}++;
523 next if $$val != ${$cv->GV}; # Ignore imposters
526 if (class($val->HV) ne "SPECIAL" && $key =~ /::$/) {
527 $self->stash_subs($pack . $key, $seen);
537 foreach $ar (@{$self->{'protos_todo'}}) {
538 my $proto = (defined $ar->[1] ? " (". $ar->[1] . ")" : "");
539 push @ret, "sub " . $ar->[0] . "$proto;\n";
541 delete $self->{'protos_todo'};
549 while (length($opt = substr($opts, 0, 1))) {
551 $self->{'cuddle'} = " ";
552 $opts = substr($opts, 1);
553 } elsif ($opt eq "i") {
554 $opts =~ s/^i(\d+)//;
555 $self->{'indent_size'} = $1;
556 } elsif ($opt eq "T") {
557 $self->{'use_tabs'} = 1;
558 $opts = substr($opts, 1);
559 } elsif ($opt eq "v") {
560 $opts =~ s/^v([^.]*)(.|$)//;
561 $self->{'ex_const'} = $1;
568 my $self = bless {}, $class;
569 $self->{'cuddle'} = "\n";
570 $self->{'curcop'} = undef;
571 $self->{'curstash'} = "main";
572 $self->{'ex_const'} = "'???'";
573 $self->{'expand'} = 0;
574 $self->{'files'} = {};
575 $self->{'indent_size'} = 4;
576 $self->{'linenums'} = 0;
577 $self->{'parens'} = 0;
578 $self->{'subs_todo'} = [];
579 $self->{'unquote'} = 0;
580 $self->{'use_dumper'} = 0;
581 $self->{'use_tabs'} = 0;
583 $self->{'ambient_arybase'} = 0;
584 $self->{'ambient_warnings'} = undef; # Assume no lexical warnings
585 $self->{'ambient_hints'} = 0;
586 $self->{'ambient_hinthash'} = undef;
589 while (my $arg = shift @_) {
591 $self->{'use_dumper'} = 1;
592 require Data::Dumper;
593 } elsif ($arg =~ /^-f(.*)/) {
594 $self->{'files'}{$1} = 1;
595 } elsif ($arg eq "-l") {
596 $self->{'linenums'} = 1;
597 } elsif ($arg eq "-p") {
598 $self->{'parens'} = 1;
599 } elsif ($arg eq "-P") {
600 $self->{'noproto'} = 1;
601 } elsif ($arg eq "-q") {
602 $self->{'unquote'} = 1;
603 } elsif (substr($arg, 0, 2) eq "-s") {
604 $self->style_opts(substr $arg, 2);
605 } elsif ($arg =~ /^-x(\d)$/) {
606 $self->{'expand'} = $1;
613 # Mask out the bits that L<warnings::register> uses
616 $WARN_MASK = $warnings::Bits{all} | $warnings::DeadBits{all};
623 # Initialise the contextual information, either from
624 # defaults provided with the ambient_pragmas method,
625 # or from perl's own defaults otherwise.
629 $self->{'arybase'} = $self->{'ambient_arybase'};
630 $self->{'warnings'} = defined ($self->{'ambient_warnings'})
631 ? $self->{'ambient_warnings'} & WARN_MASK
633 $self->{'hints'} = $self->{'ambient_hints'};
634 $self->{'hints'} &= 0xFF if $] < 5.009;
635 $self->{'hinthash'} = $self->{'ambient_hinthash'};
637 # also a convenient place to clear out subs_declared
638 delete $self->{'subs_declared'};
644 my $self = B::Deparse->new(@args);
645 # First deparse command-line args
646 if (defined $^I) { # deparse -i
647 print q(BEGIN { $^I = ).perlstring($^I).qq(; }\n);
649 if ($^W) { # deparse -w
650 print qq(BEGIN { \$^W = $^W; }\n);
652 if ($/ ne "\n" or defined $O::savebackslash) { # deparse -l and -0
653 my $fs = perlstring($/) || 'undef';
654 my $bs = perlstring($O::savebackslash) || 'undef';
655 print qq(BEGIN { \$/ = $fs; \$\\ = $bs; }\n);
657 my @BEGINs = B::begin_av->isa("B::AV") ? B::begin_av->ARRAY : ();
658 my @UNITCHECKs = B::unitcheck_av->isa("B::AV")
659 ? B::unitcheck_av->ARRAY
661 my @CHECKs = B::check_av->isa("B::AV") ? B::check_av->ARRAY : ();
662 my @INITs = B::init_av->isa("B::AV") ? B::init_av->ARRAY : ();
663 my @ENDs = B::end_av->isa("B::AV") ? B::end_av->ARRAY : ();
664 for my $block (@BEGINs, @UNITCHECKs, @CHECKs, @INITs, @ENDs) {
665 $self->todo($block, 0);
668 local($SIG{"__DIE__"}) =
670 if ($self->{'curcop'}) {
671 my $cop = $self->{'curcop'};
672 my($line, $file) = ($cop->line, $cop->file);
673 print STDERR "While deparsing $file near line $line,\n";
676 $self->{'curcv'} = main_cv;
677 $self->{'curcvlex'} = undef;
678 print $self->print_protos;
679 @{$self->{'subs_todo'}} =
680 sort {$a->[0] <=> $b->[0]} @{$self->{'subs_todo'}};
681 print $self->indent($self->deparse_root(main_root)), "\n"
682 unless null main_root;
684 while (scalar(@{$self->{'subs_todo'}})) {
685 push @text, $self->next_todo;
687 print $self->indent(join("", @text)), "\n" if @text;
689 # Print __DATA__ section, if necessary
691 my $laststash = defined $self->{'curcop'}
692 ? $self->{'curcop'}->stash->NAME : $self->{'curstash'};
693 if (defined *{$laststash."::DATA"}{IO}) {
694 print "package $laststash;\n"
695 unless $laststash eq $self->{'curstash'};
697 print readline(*{$laststash."::DATA"});
705 croak "Usage: ->coderef2text(CODEREF)" unless UNIVERSAL::isa($sub, "CODE");
708 return $self->indent($self->deparse_sub(svref_2object($sub)));
711 my %strict_bits = do {
713 map +($_ => strict::bits($_)), qw/refs subs vars/
716 sub ambient_pragmas {
718 my ($arybase, $hint_bits, $warning_bits, $hinthash) = (0, 0);
724 if ($name eq 'strict') {
727 if ($val eq 'none') {
728 $hint_bits &= $strict_bits{$_} for qw/refs subs vars/;
734 @names = qw/refs subs vars/;
740 @names = split' ', $val;
742 $hint_bits |= $strict_bits{$_} for @names;
745 elsif ($name eq '$[') {
746 if (OPpCONST_ARYBASE) {
749 croak "\$[ can't be non-zero on this perl" unless $val == 0;
753 elsif ($name eq 'integer'
755 || $name eq 'utf8') {
758 $hint_bits |= ${$::{"${name}::"}{"hint_bits"}};
761 $hint_bits &= ~${$::{"${name}::"}{"hint_bits"}};
765 elsif ($name eq 're') {
767 if ($val eq 'none') {
768 $hint_bits &= ~re::bits(qw/taint eval/);
774 @names = qw/taint eval/;
780 @names = split' ',$val;
782 $hint_bits |= re::bits(@names);
785 elsif ($name eq 'warnings') {
786 if ($val eq 'none') {
787 $warning_bits = $warnings::NONE;
796 @names = split/\s+/, $val;
799 $warning_bits = $warnings::NONE if !defined ($warning_bits);
800 $warning_bits |= warnings::bits(@names);
803 elsif ($name eq 'warning_bits') {
804 $warning_bits = $val;
807 elsif ($name eq 'hint_bits') {
811 elsif ($name eq '%^H') {
816 croak "Unknown pragma type: $name";
820 croak "The ambient_pragmas method expects an even number of args";
823 $self->{'ambient_arybase'} = $arybase;
824 $self->{'ambient_warnings'} = $warning_bits;
825 $self->{'ambient_hints'} = $hint_bits;
826 $self->{'ambient_hinthash'} = $hinthash;
829 # This method is the inner loop, so try to keep it simple
834 Carp::confess("Null op in deparse") if !defined($op)
835 || class($op) eq "NULL";
836 my $meth = "pp_" . $op->name;
837 return $self->$meth($op, $cx);
843 my @lines = split(/\n/, $txt);
848 my $cmd = substr($line, 0, 1);
849 if ($cmd eq "\t" or $cmd eq "\b") {
850 $level += ($cmd eq "\t" ? 1 : -1) * $self->{'indent_size'};
851 if ($self->{'use_tabs'}) {
852 $leader = "\t" x ($level / 8) . " " x ($level % 8);
854 $leader = " " x $level;
856 $line = substr($line, 1);
858 if (substr($line, 0, 1) eq "\f") {
859 $line = substr($line, 1); # no indent
861 $line = $leader . $line;
865 return join("\n", @lines);
872 Carp::confess("NULL in deparse_sub") if !defined($cv) || $cv->isa("B::NULL");
873 Carp::confess("SPECIAL in deparse_sub") if $cv->isa("B::SPECIAL");
874 local $self->{'curcop'} = $self->{'curcop'};
875 if ($cv->FLAGS & SVf_POK) {
876 $proto = "(". $cv->PV . ") ";
878 if ($cv->CvFLAGS & (CVf_METHOD|CVf_LOCKED|CVf_LVALUE)) {
880 $proto .= "lvalue " if $cv->CvFLAGS & CVf_LVALUE;
881 $proto .= "locked " if $cv->CvFLAGS & CVf_LOCKED;
882 $proto .= "method " if $cv->CvFLAGS & CVf_METHOD;
885 local($self->{'curcv'}) = $cv;
886 local($self->{'curcvlex'});
887 local(@$self{qw'curstash warnings hints hinthash'})
888 = @$self{qw'curstash warnings hints hinthash'};
890 if (not null $cv->ROOT) {
891 my $lineseq = $cv->ROOT->first;
892 if ($lineseq->name eq "lineseq") {
894 for(my$o=$lineseq->first; $$o; $o=$o->sibling) {
897 $body = $self->lineseq(undef, @ops).";";
898 my $scope_en = $self->find_scope_en($lineseq);
899 if (defined $scope_en) {
900 my $subs = join"", $self->seq_subs($scope_en);
901 $body .= ";\n$subs" if length($subs);
905 $body = $self->deparse($cv->ROOT->first, 0);
909 my $sv = $cv->const_sv;
911 # uh-oh. inlinable sub... format it differently
912 return $proto . "{ " . $self->const($sv, 0) . " }\n";
913 } else { # XSUB? (or just a declaration)
917 return $proto ."{\n\t$body\n\b}" ."\n";
924 local($self->{'curcv'}) = $form;
925 local($self->{'curcvlex'});
926 local($self->{'in_format'}) = 1;
927 local(@$self{qw'curstash warnings hints hinthash'})
928 = @$self{qw'curstash warnings hints hinthash'};
929 my $op = $form->ROOT;
931 return "\f." if $op->first->name eq 'stub'
932 || $op->first->name eq 'nextstate';
933 $op = $op->first->first; # skip leavewrite, lineseq
934 while (not null $op) {
935 $op = $op->sibling; # skip nextstate
937 $kid = $op->first->sibling; # skip pushmark
938 push @text, "\f".$self->const_sv($kid)->PV;
939 $kid = $kid->sibling;
940 for (; not null $kid; $kid = $kid->sibling) {
941 push @exprs, $self->deparse($kid, 0);
943 push @text, "\f".join(", ", @exprs)."\n" if @exprs;
946 return join("", @text) . "\f.";
951 return $op->name eq "leave" || $op->name eq "scope"
952 || $op->name eq "lineseq"
953 || ($op->name eq "null" && class($op) eq "UNOP"
954 && (is_scope($op->first) || $op->first->name eq "enter"));
958 my $name = $_[0]->name;
959 return $name eq "nextstate" || $name eq "dbstate" || $name eq "setstate";
962 sub is_miniwhile { # check for one-line loop ('foo() while $y--')
964 return (!null($op) and null($op->sibling)
965 and $op->name eq "null" and class($op) eq "UNOP"
966 and (($op->first->name =~ /^(and|or)$/
967 and $op->first->first->sibling->name eq "lineseq")
968 or ($op->first->name eq "lineseq"
969 and not null $op->first->first->sibling
970 and $op->first->first->sibling->name eq "unstack")
974 # Check if the op and its sibling are the initialization and the rest of a
975 # for (..;..;..) { ... } loop
978 # This OP might be almost anything, though it won't be a
979 # nextstate. (It's the initialization, so in the canonical case it
980 # will be an sassign.) The sibling is (old style) a lineseq whose
981 # first child is a nextstate and whose second is a leaveloop, or
982 # (new style) an unstack whose sibling is a leaveloop.
983 my $lseq = $op->sibling;
984 return 0 unless !is_state($op) and !null($lseq);
985 if ($lseq->name eq "lineseq") {
986 if ($lseq->first && !null($lseq->first) && is_state($lseq->first)
987 && (my $sib = $lseq->first->sibling)) {
988 return (!null($sib) && $sib->name eq "leaveloop");
990 } elsif ($lseq->name eq "unstack" && ($lseq->flags & OPf_SPECIAL)) {
991 my $sib = $lseq->sibling;
992 return $sib && !null($sib) && $sib->name eq "leaveloop";
999 return ($op->name eq "rv2sv" or
1000 $op->name eq "padsv" or
1001 $op->name eq "gv" or # only in array/hash constructs
1002 $op->flags & OPf_KIDS && !null($op->first)
1003 && $op->first->name eq "gvsv");
1008 my($text, $cx, $prec) = @_;
1009 if ($prec < $cx # unary ops nest just fine
1010 or $prec == $cx and $cx != 4 and $cx != 16 and $cx != 21
1011 or $self->{'parens'})
1014 # In a unop, let parent reuse our parens; see maybe_parens_unop
1015 $text = "\cS" . $text if $cx == 16;
1022 # same as above, but get around the 'if it looks like a function' rule
1023 sub maybe_parens_unop {
1025 my($name, $kid, $cx) = @_;
1026 if ($cx > 16 or $self->{'parens'}) {
1027 $kid = $self->deparse($kid, 1);
1028 if ($name eq "umask" && $kid =~ /^\d+$/) {
1029 $kid = sprintf("%#o", $kid);
1031 return $self->keyword($name) . "($kid)";
1033 $kid = $self->deparse($kid, 16);
1034 if ($name eq "umask" && $kid =~ /^\d+$/) {
1035 $kid = sprintf("%#o", $kid);
1037 $name = $self->keyword($name);
1038 if (substr($kid, 0, 1) eq "\cS") {
1040 return $name . substr($kid, 1);
1041 } elsif (substr($kid, 0, 1) eq "(") {
1042 # avoid looks-like-a-function trap with extra parens
1043 # ('+' can lead to ambiguities)
1044 return "$name(" . $kid . ")";
1046 return "$name $kid";
1051 sub maybe_parens_func {
1053 my($func, $text, $cx, $prec) = @_;
1054 if ($prec <= $cx or substr($text, 0, 1) eq "(" or $self->{'parens'}) {
1055 return "$func($text)";
1057 return "$func $text";
1063 my($op, $cx, $text) = @_;
1064 my $our_intro = ($op->name =~ /^(gv|rv2)[ash]v$/) ? OPpOUR_INTRO : 0;
1065 if ($op->private & (OPpLVAL_INTRO|$our_intro)
1066 and not $self->{'avoid_local'}{$$op}) {
1067 my $our_local = ($op->private & OPpLVAL_INTRO) ? "local" : "our";
1068 if( $our_local eq 'our' ) {
1069 if ( $text !~ /^\W(\w+::)*\w+\z/
1070 and !utf8::decode($text) || $text !~ /^\W(\w+::)*\w+\z/
1072 die "Unexpected our($text)\n";
1074 $text =~ s/(\w+::)+//;
1076 if (want_scalar($op)) {
1077 return "$our_local $text";
1079 return $self->maybe_parens_func("$our_local", $text, $cx, 16);
1088 my($op, $cx, $func, @args) = @_;
1089 if ($op->private & OPpTARGET_MY) {
1090 my $var = $self->padname($op->targ);
1091 my $val = $func->($self, $op, 7, @args);
1092 return $self->maybe_parens("$var = $val", $cx, 7);
1094 return $func->($self, $op, $cx, @args);
1101 return $self->{'curcv'}->PADLIST->ARRAYelt(0)->ARRAYelt($targ);
1106 my($op, $cx, $text) = @_;
1107 if ($op->private & OPpLVAL_INTRO and not $self->{'avoid_local'}{$$op}) {
1108 my $my = $op->private & OPpPAD_STATE
1109 ? $self->keyword("state")
1111 if (want_scalar($op)) {
1114 return $self->maybe_parens_func($my, $text, $cx, 16);
1121 # The following OPs don't have functions:
1123 # pp_padany -- does not exist after parsing
1126 if ($AUTOLOAD =~ s/^.*::pp_//) {
1127 warn "unexpected OP_".uc $AUTOLOAD;
1130 die "Undefined subroutine $AUTOLOAD called";
1134 sub DESTROY {} # Do not AUTOLOAD
1136 # $root should be the op which represents the root of whatever
1137 # we're sequencing here. If it's undefined, then we don't append
1138 # any subroutine declarations to the deparsed ops, otherwise we
1139 # append appropriate declarations.
1141 my($self, $root, @ops) = @_;
1144 my $out_cop = $self->{'curcop'};
1145 my $out_seq = defined($out_cop) ? $out_cop->cop_seq : undef;
1147 if (defined $root) {
1148 $limit_seq = $out_seq;
1150 $nseq = $self->find_scope_st($root->sibling) if ${$root->sibling};
1151 $limit_seq = $nseq if !defined($limit_seq)
1152 or defined($nseq) && $nseq < $limit_seq;
1154 $limit_seq = $self->{'limit_seq'}
1155 if defined($self->{'limit_seq'})
1156 && (!defined($limit_seq) || $self->{'limit_seq'} < $limit_seq);
1157 local $self->{'limit_seq'} = $limit_seq;
1159 $self->walk_lineseq($root, \@ops,
1160 sub { push @exprs, $_[0]} );
1162 my $body = join(";\n", grep {length} @exprs);
1164 if (defined $root && defined $limit_seq && !$self->{'in_format'}) {
1165 $subs = join "\n", $self->seq_subs($limit_seq);
1167 return join(";\n", grep {length} $body, $subs);
1171 my($real_block, $self, $op, $cx) = @_;
1175 local(@$self{qw'curstash warnings hints hinthash'})
1176 = @$self{qw'curstash warnings hints hinthash'} if $real_block;
1178 $kid = $op->first->sibling; # skip enter
1179 if (is_miniwhile($kid)) {
1180 my $top = $kid->first;
1181 my $name = $top->name;
1182 if ($name eq "and") {
1184 } elsif ($name eq "or") {
1186 } else { # no conditional -> while 1 or until 0
1187 return $self->deparse($top->first, 1) . " while 1";
1189 my $cond = $top->first;
1190 my $body = $cond->sibling->first; # skip lineseq
1191 $cond = $self->deparse($cond, 1);
1192 $body = $self->deparse($body, 1);
1193 return "$body $name $cond";
1198 for (; !null($kid); $kid = $kid->sibling) {
1201 if ($cx > 0) { # inside an expression, (a do {} while for lineseq)
1202 return "do {\n\t" . $self->lineseq($op, @kids) . "\n\b}";
1204 my $lineseq = $self->lineseq($op, @kids);
1205 return (length ($lineseq) ? "$lineseq;" : "");
1209 sub pp_scope { scopeop(0, @_); }
1210 sub pp_lineseq { scopeop(0, @_); }
1211 sub pp_leave { scopeop(1, @_); }
1213 # This is a special case of scopeop and lineseq, for the case of the
1214 # main_root. The difference is that we print the output statements as
1215 # soon as we get them, for the sake of impatient users.
1219 local(@$self{qw'curstash warnings hints hinthash'})
1220 = @$self{qw'curstash warnings hints hinthash'};
1222 return if null $op->first; # Can happen, e.g., for Bytecode without -k
1223 for (my $kid = $op->first->sibling; !null($kid); $kid = $kid->sibling) {
1226 $self->walk_lineseq($op, \@kids,
1227 sub { print $self->indent($_[0].';');
1228 print "\n" unless $_[1] == $#kids;
1233 my ($self, $op, $kids, $callback) = @_;
1235 for (my $i = 0; $i < @kids; $i++) {
1237 if (is_state $kids[$i]) {
1238 $expr = $self->deparse($kids[$i++], 0);
1240 $callback->($expr, $i);
1244 if (is_for_loop($kids[$i])) {
1245 $callback->($expr . $self->for_loop($kids[$i], 0),
1246 $i += $kids[$i]->sibling->name eq "unstack" ? 2 : 1);
1249 $expr .= $self->deparse($kids[$i], (@kids != 1)/2);
1250 $expr =~ s/;\n?\z//;
1251 $callback->($expr, $i);
1255 # The BEGIN {} is used here because otherwise this code isn't executed
1256 # when you run B::Deparse on itself.
1258 BEGIN { map($globalnames{$_}++, "SIG", "STDIN", "STDOUT", "STDERR", "INC",
1259 "ENV", "ARGV", "ARGVOUT", "_"); }
1265 Carp::confess() unless ref($gv) eq "B::GV";
1266 my $stash = $gv->STASH->NAME;
1267 my $name = $raw ? $gv->NAME : $gv->SAFENAME;
1268 if ($stash eq 'main' && $name =~ /^::/) {
1271 elsif (($stash eq 'main'
1272 && ($globalnames{$name} || $name =~ /^[^A-Za-z_:]/))
1273 or ($stash eq $self->{'curstash'} && !$globalnames{$name}
1274 && ($stash eq 'main' || $name !~ /::/))
1279 $stash = $stash . "::";
1281 if (!$raw and $name =~ /^(\^..|{)/) {
1282 $name = "{$name}"; # ${^WARNING_BITS}, etc and ${
1284 return $stash . $name;
1287 # Return the name to use for a stash variable.
1288 # If a lexical with the same name is in scope, or
1289 # if strictures are enabled, it may need to be
1291 sub stash_variable {
1292 my ($self, $prefix, $name, $cx) = @_;
1294 return "$prefix$name" if $name =~ /::/;
1296 unless ($prefix eq '$' || $prefix eq '@' || #'
1297 $prefix eq '%' || $prefix eq '$#') {
1298 return "$prefix$name";
1301 if ($name =~ /^[^\w+-]$/) {
1302 if (defined $cx && $cx == 26) {
1303 if ($prefix eq '@') {
1304 return "$prefix\{$name}";
1306 elsif ($name eq '#') { return '${#}' } # "${#}a" vs "$#a"
1308 if ($prefix eq '$#') {
1309 return "\$#{$name}";
1313 return $prefix . $self->maybe_qualify($prefix, $name);
1316 # Return just the name, without the prefix. It may be returned as a quoted
1317 # string. The second return value is a boolean indicating that.
1318 sub stash_variable_name {
1319 my($self, $prefix, $gv) = @_;
1320 my $name = $self->gv_name($gv, 1);
1321 $name = $self->maybe_qualify($prefix,$name);
1322 if ($name =~ /^(?:\S|(?!\d)[\ca-\cz]?(?:\w|::)*|\d+)\z/) {
1323 $name =~ s/^([\ca-\cz])/'^'.($1|'@')/e;
1324 $name =~ /^(\^..|{)/ and $name = "{$name}";
1325 return $name, 0; # not quoted
1328 single_delim("q", "'", $name), 1;
1333 my ($self,$prefix,$name) = @_;
1334 my $v = ($prefix eq '$#' ? '@' : $prefix) . $name;
1335 return $name if !$prefix || $name =~ /::/;
1336 return $self->{'curstash'}.'::'. $name
1338 $name =~ /^(?!\d)\w/ # alphabetic
1339 && $v !~ /^\$[ab]\z/ # not $a or $b
1340 && !$globalnames{$name} # not a global name
1341 && $self->{hints} & $strict_bits{vars} # strict vars
1342 && !$self->lex_in_scope($v,1) # no "our"
1343 or $self->lex_in_scope($v); # conflicts with "my" variable
1348 my ($self, $name, $our) = @_;
1349 substr $name, 0, 0, = $our ? 'o' : 'm'; # our/my
1350 $self->populate_curcvlex() if !defined $self->{'curcvlex'};
1352 return 0 if !defined($self->{'curcop'});
1353 my $seq = $self->{'curcop'}->cop_seq;
1354 return 0 if !exists $self->{'curcvlex'}{$name};
1355 for my $a (@{$self->{'curcvlex'}{$name}}) {
1356 my ($st, $en) = @$a;
1357 return 1 if $seq > $st && $seq <= $en;
1362 sub populate_curcvlex {
1364 for (my $cv = $self->{'curcv'}; class($cv) eq "CV"; $cv = $cv->OUTSIDE) {
1365 my $padlist = $cv->PADLIST;
1366 # an undef CV still in lexical chain
1367 next if class($padlist) eq "SPECIAL";
1368 my @padlist = $padlist->ARRAY;
1369 my @ns = $padlist[0]->ARRAY;
1371 for (my $i=0; $i<@ns; ++$i) {
1372 next if class($ns[$i]) eq "SPECIAL";
1373 if (class($ns[$i]) eq "PV") {
1374 # Probably that pesky lexical @_
1377 my $name = $ns[$i]->PVX;
1378 my ($seq_st, $seq_en) =
1379 ($ns[$i]->FLAGS & SVf_FAKE)
1381 : ($ns[$i]->COP_SEQ_RANGE_LOW, $ns[$i]->COP_SEQ_RANGE_HIGH);
1383 push @{$self->{'curcvlex'}{
1384 ($ns[$i]->FLAGS & SVpad_OUR ? 'o' : 'm') . $name
1385 }}, [$seq_st, $seq_en];
1390 sub find_scope_st { ((find_scope(@_))[0]); }
1391 sub find_scope_en { ((find_scope(@_))[1]); }
1393 # Recurses down the tree, looking for pad variable introductions and COPs
1395 my ($self, $op, $scope_st, $scope_en) = @_;
1396 carp("Undefined op in find_scope") if !defined $op;
1397 return ($scope_st, $scope_en) unless $op->flags & OPf_KIDS;
1400 while(my $op = shift @queue ) {
1401 for (my $o=$op->first; $$o; $o=$o->sibling) {
1402 if ($o->name =~ /^pad.v$/ && $o->private & OPpLVAL_INTRO) {
1403 my $s = int($self->padname_sv($o->targ)->COP_SEQ_RANGE_LOW);
1404 my $e = $self->padname_sv($o->targ)->COP_SEQ_RANGE_HIGH;
1405 $scope_st = $s if !defined($scope_st) || $s < $scope_st;
1406 $scope_en = $e if !defined($scope_en) || $e > $scope_en;
1407 return ($scope_st, $scope_en);
1409 elsif (is_state($o)) {
1410 my $c = $o->cop_seq;
1411 $scope_st = $c if !defined($scope_st) || $c < $scope_st;
1412 $scope_en = $c if !defined($scope_en) || $c > $scope_en;
1413 return ($scope_st, $scope_en);
1415 elsif ($o->flags & OPf_KIDS) {
1416 unshift (@queue, $o);
1421 return ($scope_st, $scope_en);
1424 # Returns a list of subs which should be inserted before the COP
1426 my ($self, $op, $out_seq) = @_;
1427 my $seq = $op->cop_seq;
1428 # If we have nephews, then our sequence number indicates
1429 # the cop_seq of the end of some sort of scope.
1430 if (class($op->sibling) ne "NULL" && $op->sibling->flags & OPf_KIDS
1431 and my $nseq = $self->find_scope_st($op->sibling) ) {
1434 $seq = $out_seq if defined($out_seq) && $out_seq < $seq;
1435 return $self->seq_subs($seq);
1439 my ($self, $seq) = @_;
1441 #push @text, "# ($seq)\n";
1443 return "" if !defined $seq;
1444 while (scalar(@{$self->{'subs_todo'}})
1445 and $seq > $self->{'subs_todo'}[0][0]) {
1446 push @text, $self->next_todo;
1451 my $feature_bundle_mask = 0x1c000000;
1453 # Notice how subs and formats are inserted between statements here;
1454 # also $[ assignments and pragmas.
1458 $self->{'curcop'} = $op;
1460 push @text, $self->cop_subs($op);
1461 my $stash = $op->stashpv;
1462 if ($stash ne $self->{'curstash'}) {
1463 push @text, "package $stash;\n";
1464 $self->{'curstash'} = $stash;
1467 if (OPpCONST_ARYBASE && $self->{'arybase'} != $op->arybase) {
1468 push @text, '$[ = '. $op->arybase .";\n";
1469 $self->{'arybase'} = $op->arybase;
1472 my $warnings = $op->warnings;
1474 if ($warnings->isa("B::SPECIAL") && $$warnings == 4) {
1475 $warning_bits = $warnings::Bits{"all"} & WARN_MASK;
1477 elsif ($warnings->isa("B::SPECIAL") && $$warnings == 5) {
1478 $warning_bits = $warnings::NONE;
1480 elsif ($warnings->isa("B::SPECIAL")) {
1481 $warning_bits = undef;
1484 $warning_bits = $warnings->PV & WARN_MASK;
1487 if (defined ($warning_bits) and
1488 !defined($self->{warnings}) || $self->{'warnings'} ne $warning_bits) {
1489 push @text, declare_warnings($self->{'warnings'}, $warning_bits);
1490 $self->{'warnings'} = $warning_bits;
1493 my $hints = $] < 5.008009 ? $op->private : $op->hints;
1494 my $old_hints = $self->{'hints'};
1495 if ($self->{'hints'} != $hints) {
1496 push @text, declare_hints($self->{'hints'}, $hints);
1497 $self->{'hints'} = $hints;
1502 $newhh = $op->hints_hash->HASH;
1505 if ($] >= 5.015006) {
1506 # feature bundle hints
1507 my $from = $old_hints & $feature_bundle_mask;
1508 my $to = $ hints & $feature_bundle_mask;
1511 if ($to == $feature_bundle_mask) {
1512 if ($self->{'hinthash'}) {
1513 delete $self->{'hinthash'}{$_}
1514 for grep /^feature_/, keys %{$self->{'hinthash'}};
1516 else { $self->{'hinthash'} = {} }
1518 foreach (@{feature::current_bundle()}) {
1519 $self->{'hinthash'}{$feature::feature{$_}} = 1;
1524 $feature::hint_bundles[$to >> $feature::hint_shift];
1525 $bundle =~ s/(\d[13579])\z/$1+1/e; # 5.11 => 5.12
1526 push @text, "no feature;\n",
1527 "use feature ':$bundle';\n";
1533 push @text, declare_hinthash(
1534 $self->{'hinthash'}, $newhh,
1535 $self->{indent_size}, $self->{hints},
1537 $self->{'hinthash'} = $newhh;
1540 # This should go after of any branches that add statements, to
1541 # increase the chances that it refers to the same line it did in
1542 # the original program.
1543 if ($self->{'linenums'}) {
1544 push @text, "\f#line " . $op->line .
1545 ' "' . $op->file, qq'"\n';
1548 push @text, $op->label . ": " if $op->label;
1550 return join("", @text);
1553 sub declare_warnings {
1554 my ($from, $to) = @_;
1555 if (($to & WARN_MASK) eq (warnings::bits("all") & WARN_MASK)) {
1556 return "use warnings;\n";
1558 elsif (($to & WARN_MASK) eq ("\0"x length($to) & WARN_MASK)) {
1559 return "no warnings;\n";
1561 return "BEGIN {\${^WARNING_BITS} = ".perlstring($to)."}\n";
1565 my ($from, $to) = @_;
1566 my $use = $to & ~$from;
1567 my $no = $from & ~$to;
1569 for my $pragma (hint_pragmas($use)) {
1570 $decls .= "use $pragma;\n";
1572 for my $pragma (hint_pragmas($no)) {
1573 $decls .= "no $pragma;\n";
1578 # Internal implementation hints that the core sets automatically, so don't need
1579 # (or want) to be passed back to the user
1580 my %ignored_hints = (
1591 sub declare_hinthash {
1592 my ($from, $to, $indent, $hints) = @_;
1593 my $doing_features =
1594 ($hints & $feature_bundle_mask) == $feature_bundle_mask;
1597 my @unfeatures; # bugs?
1598 for my $key (sort keys %$to) {
1599 next if $ignored_hints{$key};
1600 my $is_feature = $key =~ /^feature_/ && $^V ge 5.15.6;
1601 next if $is_feature and not $doing_features;
1602 if (!exists $from->{$key} or $from->{$key} ne $to->{$key}) {
1603 push(@features, $key), next if $is_feature;
1605 qq(\$^H{) . single_delim("q", "'", $key) . qq(} = )
1608 ? single_delim("q", "'", $to->{$key})
1614 for my $key (sort keys %$from) {
1615 next if $ignored_hints{$key};
1616 my $is_feature = $key =~ /^feature_/ && $^V ge 5.15.6;
1617 next if $is_feature and not $doing_features;
1618 if (!exists $to->{$key}) {
1619 push(@unfeatures, $key), next if $is_feature;
1620 push @decls, qq(delete \$^H{'$key'};);
1624 if (@features || @unfeatures) {
1626 if (!%rev_feature) { %rev_feature = reverse %feature::feature }
1629 push @ret, "use feature "
1630 . join(", ", map "'$rev_feature{$_}'", @features) . ";\n";
1633 push @ret, "no feature "
1634 . join(", ", map "'$rev_feature{$_}'", @unfeatures)
1639 join("\n" . (" " x $indent), "BEGIN {", @decls) . "\n}\n";
1645 my (@pragmas, @strict);
1646 push @pragmas, "integer" if $bits & 0x1;
1647 for (sort keys %strict_bits) {
1648 push @strict, "'$_'" if $bits & $strict_bits{$_};
1650 if (@strict == keys %strict_bits) {
1651 push @pragmas, "strict";
1654 push @pragmas, "strict " . join ', ', @strict;
1656 push @pragmas, "bytes" if $bits & 0x8;
1660 sub pp_dbstate { pp_nextstate(@_) }
1661 sub pp_setstate { pp_nextstate(@_) }
1663 sub pp_unstack { return "" } # see also leaveloop
1665 my %feature_keywords = (
1666 # keyword => 'feature',
1671 default => 'switch',
1673 evalbytes=>'evalbytes',
1674 __SUB__ => '__SUB__',
1681 return $name if $name =~ /^CORE::/; # just in case
1682 if (exists $feature_keywords{$name}) {
1684 my $hints = $self->{hints} & $feature_bundle_mask;
1685 if ($hints && $hints != $feature_bundle_mask) {
1687 local $^H = $self->{hints};
1688 # Shh! Keep quite about this function. It is not to be
1690 foreach (@{feature::current_bundle()}) {
1691 $hh->{$feature::feature{$_}} = 1;
1694 elsif ($hints) { $hh = $self->{'hinthash'} }
1695 return "CORE::$name"
1697 || !$hh->{"feature_$feature_keywords{$name}"}
1700 $name !~ /^(?:chom?p|do|exec|glob|s(?:elect|ystem))\z/
1701 && !defined eval{prototype "CORE::$name"}
1704 exists $self->{subs_declared}{$name}
1706 exists &{"$self->{curstash}::$name"}
1708 return "CORE::$name"
1715 my($op, $cx, $name) = @_;
1716 return $self->keyword($name);
1721 my($op, $cx, $name) = @_;
1729 sub pp_wantarray { baseop(@_, "wantarray") }
1730 sub pp_fork { baseop(@_, "fork") }
1731 sub pp_wait { maybe_targmy(@_, \&baseop, "wait") }
1732 sub pp_getppid { maybe_targmy(@_, \&baseop, "getppid") }
1733 sub pp_time { maybe_targmy(@_, \&baseop, "time") }
1734 sub pp_tms { baseop(@_, "times") }
1735 sub pp_ghostent { baseop(@_, "gethostent") }
1736 sub pp_gnetent { baseop(@_, "getnetent") }
1737 sub pp_gprotoent { baseop(@_, "getprotoent") }
1738 sub pp_gservent { baseop(@_, "getservent") }
1739 sub pp_ehostent { baseop(@_, "endhostent") }
1740 sub pp_enetent { baseop(@_, "endnetent") }
1741 sub pp_eprotoent { baseop(@_, "endprotoent") }
1742 sub pp_eservent { baseop(@_, "endservent") }
1743 sub pp_gpwent { baseop(@_, "getpwent") }
1744 sub pp_spwent { baseop(@_, "setpwent") }
1745 sub pp_epwent { baseop(@_, "endpwent") }
1746 sub pp_ggrent { baseop(@_, "getgrent") }
1747 sub pp_sgrent { baseop(@_, "setgrent") }
1748 sub pp_egrent { baseop(@_, "endgrent") }
1749 sub pp_getlogin { baseop(@_, "getlogin") }
1751 sub POSTFIX () { 1 }
1753 # I couldn't think of a good short name, but this is the category of
1754 # symbolic unary operators with interesting precedence
1758 my($op, $cx, $name, $prec, $flags) = (@_, 0);
1759 my $kid = $op->first;
1760 $kid = $self->deparse($kid, $prec);
1761 return $self->maybe_parens(($flags & POSTFIX)
1763 # avoid confusion with filetests
1765 && $kid =~ /^[a-zA-Z](?!\w)/
1771 sub pp_preinc { pfixop(@_, "++", 23) }
1772 sub pp_predec { pfixop(@_, "--", 23) }
1773 sub pp_postinc { maybe_targmy(@_, \&pfixop, "++", 23, POSTFIX) }
1774 sub pp_postdec { maybe_targmy(@_, \&pfixop, "--", 23, POSTFIX) }
1775 sub pp_i_preinc { pfixop(@_, "++", 23) }
1776 sub pp_i_predec { pfixop(@_, "--", 23) }
1777 sub pp_i_postinc { maybe_targmy(@_, \&pfixop, "++", 23, POSTFIX) }
1778 sub pp_i_postdec { maybe_targmy(@_, \&pfixop, "--", 23, POSTFIX) }
1779 sub pp_complement { maybe_targmy(@_, \&pfixop, "~", 21) }
1781 sub pp_negate { maybe_targmy(@_, \&real_negate) }
1785 if ($op->first->name =~ /^(i_)?negate$/) {
1787 $self->pfixop($op, $cx, "-", 21.5);
1789 $self->pfixop($op, $cx, "-", 21);
1792 sub pp_i_negate { pp_negate(@_) }
1798 $self->listop($op, $cx, "not", $op->first);
1800 $self->pfixop($op, $cx, "!", 21);
1806 my($op, $cx, $name, $nollafr) = @_;
1808 if ($op->flags & OPf_KIDS) {
1811 # this deals with 'boolkeys' right now
1812 return $self->deparse($kid,$cx);
1814 my $builtinname = $name;
1815 $builtinname =~ /^CORE::/ or $builtinname = "CORE::$name";
1816 if (defined prototype($builtinname)
1817 && prototype($builtinname) =~ /^;?\*/
1818 && $kid->name eq "rv2gv") {
1823 ($kid = $self->deparse($kid, 16)) =~ s/^\cS//;
1824 return $self->maybe_parens(
1825 $self->keyword($name) . " $kid", $cx, 16
1828 return $self->maybe_parens_unop($name, $kid, $cx);
1830 return $self->maybe_parens(
1831 $self->keyword($name) . ($op->flags & OPf_SPECIAL ? "()" : ""),
1837 sub pp_chop { maybe_targmy(@_, \&unop, "chop") }
1838 sub pp_chomp { maybe_targmy(@_, \&unop, "chomp") }
1839 sub pp_schop { maybe_targmy(@_, \&unop, "chop") }
1840 sub pp_schomp { maybe_targmy(@_, \&unop, "chomp") }
1841 sub pp_defined { unop(@_, "defined") }
1842 sub pp_undef { unop(@_, "undef") }
1843 sub pp_study { unop(@_, "study") }
1844 sub pp_ref { unop(@_, "ref") }
1845 sub pp_pos { maybe_local(@_, unop(@_, "pos")) }
1847 sub pp_sin { maybe_targmy(@_, \&unop, "sin") }
1848 sub pp_cos { maybe_targmy(@_, \&unop, "cos") }
1849 sub pp_rand { maybe_targmy(@_, \&unop, "rand") }
1850 sub pp_srand { unop(@_, "srand") }
1851 sub pp_exp { maybe_targmy(@_, \&unop, "exp") }
1852 sub pp_log { maybe_targmy(@_, \&unop, "log") }
1853 sub pp_sqrt { maybe_targmy(@_, \&unop, "sqrt") }
1854 sub pp_int { maybe_targmy(@_, \&unop, "int") }
1855 sub pp_hex { maybe_targmy(@_, \&unop, "hex") }
1856 sub pp_oct { maybe_targmy(@_, \&unop, "oct") }
1857 sub pp_abs { maybe_targmy(@_, \&unop, "abs") }
1859 sub pp_length { maybe_targmy(@_, \&unop, "length") }
1860 sub pp_ord { maybe_targmy(@_, \&unop, "ord") }
1861 sub pp_chr { maybe_targmy(@_, \&unop, "chr") }
1863 sub pp_each { unop(@_, "each") }
1864 sub pp_values { unop(@_, "values") }
1865 sub pp_keys { unop(@_, "keys") }
1866 { no strict 'refs'; *{"pp_r$_"} = *{"pp_$_"} for qw< keys each values >; }
1868 # no name because its an optimisation op that has no keyword
1871 sub pp_aeach { unop(@_, "each") }
1872 sub pp_avalues { unop(@_, "values") }
1873 sub pp_akeys { unop(@_, "keys") }
1874 sub pp_pop { unop(@_, "pop") }
1875 sub pp_shift { unop(@_, "shift") }
1877 sub pp_caller { unop(@_, "caller") }
1878 sub pp_reset { unop(@_, "reset") }
1879 sub pp_exit { unop(@_, "exit") }
1880 sub pp_prototype { unop(@_, "prototype") }
1882 sub pp_close { unop(@_, "close") }
1883 sub pp_fileno { unop(@_, "fileno") }
1884 sub pp_umask { unop(@_, "umask") }
1885 sub pp_untie { unop(@_, "untie") }
1886 sub pp_tied { unop(@_, "tied") }
1887 sub pp_dbmclose { unop(@_, "dbmclose") }
1888 sub pp_getc { unop(@_, "getc") }
1889 sub pp_eof { unop(@_, "eof") }
1890 sub pp_tell { unop(@_, "tell") }
1891 sub pp_getsockname { unop(@_, "getsockname") }
1892 sub pp_getpeername { unop(@_, "getpeername") }
1894 sub pp_chdir { maybe_targmy(@_, \&unop, "chdir") }
1895 sub pp_chroot { maybe_targmy(@_, \&unop, "chroot") }
1896 sub pp_readlink { unop(@_, "readlink") }
1897 sub pp_rmdir { maybe_targmy(@_, \&unop, "rmdir") }
1898 sub pp_readdir { unop(@_, "readdir") }
1899 sub pp_telldir { unop(@_, "telldir") }
1900 sub pp_rewinddir { unop(@_, "rewinddir") }
1901 sub pp_closedir { unop(@_, "closedir") }
1902 sub pp_getpgrp { maybe_targmy(@_, \&unop, "getpgrp") }
1903 sub pp_localtime { unop(@_, "localtime") }
1904 sub pp_gmtime { unop(@_, "gmtime") }
1905 sub pp_alarm { unop(@_, "alarm") }
1906 sub pp_sleep { maybe_targmy(@_, \&unop, "sleep") }
1909 my $code = unop(@_, "do", 1); # llafr does not apply
1910 if ($code =~ s/^((?:CORE::)?do) \{/$1({/) { $code .= ')' }
1916 $_[1]->private & OPpEVAL_BYTES ? $_[0]->keyword('evalbytes') : "eval"
1920 sub pp_ghbyname { unop(@_, "gethostbyname") }
1921 sub pp_gnbyname { unop(@_, "getnetbyname") }
1922 sub pp_gpbyname { unop(@_, "getprotobyname") }
1923 sub pp_shostent { unop(@_, "sethostent") }
1924 sub pp_snetent { unop(@_, "setnetent") }
1925 sub pp_sprotoent { unop(@_, "setprotoent") }
1926 sub pp_sservent { unop(@_, "setservent") }
1927 sub pp_gpwnam { unop(@_, "getpwnam") }
1928 sub pp_gpwuid { unop(@_, "getpwuid") }
1929 sub pp_ggrnam { unop(@_, "getgrnam") }
1930 sub pp_ggrgid { unop(@_, "getgrgid") }
1932 sub pp_lock { unop(@_, "lock") }
1934 sub pp_continue { unop(@_, "continue"); }
1935 sub pp_break { unop(@_, "break"); }
1939 my($op, $cx, $givwhen) = @_;
1941 my $enterop = $op->first;
1943 if ($enterop->flags & OPf_SPECIAL) {
1944 $head = $self->keyword("default");
1945 $block = $self->deparse($enterop->first, 0);
1948 my $cond = $enterop->first;
1949 my $cond_str = $self->deparse($cond, 1);
1950 $head = "$givwhen ($cond_str)";
1951 $block = $self->deparse($cond->sibling, 0);
1959 sub pp_leavegiven { givwhen(@_, $_[0]->keyword("given")); }
1960 sub pp_leavewhen { givwhen(@_, $_[0]->keyword("when")); }
1966 if ($op->private & OPpEXISTS_SUB) {
1967 # Checking for the existence of a subroutine
1968 return $self->maybe_parens_func("exists",
1969 $self->pp_rv2cv($op->first, 16), $cx, 16);
1971 if ($op->flags & OPf_SPECIAL) {
1972 # Array element, not hash element
1973 return $self->maybe_parens_func("exists",
1974 $self->pp_aelem($op->first, 16), $cx, 16);
1976 return $self->maybe_parens_func("exists", $self->pp_helem($op->first, 16),
1984 if ($op->private & OPpSLICE) {
1985 if ($op->flags & OPf_SPECIAL) {
1986 # Deleting from an array, not a hash
1987 return $self->maybe_parens_func("delete",
1988 $self->pp_aslice($op->first, 16),
1991 return $self->maybe_parens_func("delete",
1992 $self->pp_hslice($op->first, 16),
1995 if ($op->flags & OPf_SPECIAL) {
1996 # Deleting from an array, not a hash
1997 return $self->maybe_parens_func("delete",
1998 $self->pp_aelem($op->first, 16),
2001 return $self->maybe_parens_func("delete",
2002 $self->pp_helem($op->first, 16),
2010 my $opname = $op->flags & OPf_SPECIAL ? 'CORE::require' : 'require';
2011 if (class($op) eq "UNOP" and $op->first->name eq "const"
2012 and $op->first->private & OPpCONST_BARE)
2014 my $name = $self->const_sv($op->first)->PV;
2017 return $self->maybe_parens("$opname $name", $cx, 16);
2021 $op->first->name eq 'const'
2022 && $op->first->private & OPpCONST_NOVER
2025 1, # llafr does not apply
2033 my $kid = $op->first;
2034 if (not null $kid->sibling) {
2035 # XXX Was a here-doc
2036 return $self->dquote($op);
2038 $self->unop(@_, "scalar");
2045 return $self->{'curcv'}->PADLIST->ARRAYelt(1)->ARRAYelt($targ);
2048 sub anon_hash_or_list {
2052 my($pre, $post) = @{{"anonlist" => ["[","]"],
2053 "anonhash" => ["{","}"]}->{$op->name}};
2055 $op = $op->first->sibling; # skip pushmark
2056 for (; !null($op); $op = $op->sibling) {
2057 $expr = $self->deparse($op, 6);
2060 if ($pre eq "{" and $cx < 1) {
2061 # Disambiguate that it's not a block
2064 return $pre . join(", ", @exprs) . $post;
2070 if ($op->flags & OPf_SPECIAL) {
2071 return $self->anon_hash_or_list($op, $cx);
2073 warn "Unexpected op pp_" . $op->name() . " without OPf_SPECIAL";
2077 *pp_anonhash = \&pp_anonlist;
2082 my $kid = $op->first;
2083 if ($kid->name eq "null") {
2085 if (!null($kid->sibling) and
2086 $kid->sibling->name eq "anoncode") {
2087 return $self->e_anoncode({ code => $self->padval($kid->sibling->targ) });
2088 } elsif ($kid->name eq "pushmark") {
2089 my $sib_name = $kid->sibling->name;
2090 if ($sib_name =~ /^(pad|rv2)[ah]v$/
2091 and not $kid->sibling->flags & OPf_REF)
2093 # The @a in \(@a) isn't in ref context, but only when the
2095 return "\\(" . $self->pp_list($op->first) . ")";
2096 } elsif ($sib_name eq 'entersub') {
2097 my $text = $self->deparse($kid->sibling, 1);
2098 # Always show parens for \(&func()), but only with -p otherwise
2099 $text = "($text)" if $self->{'parens'}
2100 or $kid->sibling->private & OPpENTERSUB_AMPER;
2105 $self->pfixop($op, $cx, "\\", 20);
2109 my ($self, $info) = @_;
2110 my $text = $self->deparse_sub($info->{code});
2111 return "sub " . $text;
2114 sub pp_srefgen { pp_refgen(@_) }
2119 my $kid = $op->first;
2120 $kid = $kid->first if $kid->name eq "rv2gv"; # <$fh>
2121 return "<" . $self->deparse($kid, 1) . ">" if is_scalar($kid);
2122 return $self->unop($op, $cx, "readline");
2128 return "<" . $self->gv_name($self->gv_or_padgv($op)) . ">";
2131 # Unary operators that can occur as pseudo-listops inside double quotes
2134 my($op, $cx, $name, $prec, $flags) = (@_, 0, 0);
2136 if ($op->flags & OPf_KIDS) {
2138 # If there's more than one kid, the first is an ex-pushmark.
2139 $kid = $kid->sibling if not null $kid->sibling;
2140 return $self->maybe_parens_unop($name, $kid, $cx);
2142 return $name . ($op->flags & OPf_SPECIAL ? "()" : "");
2146 sub pp_ucfirst { dq_unop(@_, "ucfirst") }
2147 sub pp_lcfirst { dq_unop(@_, "lcfirst") }
2148 sub pp_uc { dq_unop(@_, "uc") }
2149 sub pp_lc { dq_unop(@_, "lc") }
2150 sub pp_quotemeta { maybe_targmy(@_, \&dq_unop, "quotemeta") }
2151 sub pp_fc { dq_unop(@_, "fc") }
2155 my ($op, $cx, $name) = @_;
2156 if (class($op) eq "PVOP") {
2157 $name .= " " . $op->pv;
2158 } elsif (class($op) eq "OP") {
2160 } elsif (class($op) eq "UNOP") {
2161 (my $kid = $self->deparse($op->first, 16)) =~ s/^\cS//;
2164 return $self->maybe_parens($name, $cx, 16);
2167 sub pp_last { loopex(@_, "last") }
2168 sub pp_next { loopex(@_, "next") }
2169 sub pp_redo { loopex(@_, "redo") }
2170 sub pp_goto { loopex(@_, "goto") }
2171 sub pp_dump { loopex(@_, "CORE::dump") }
2175 my($op, $cx, $name) = @_;
2176 if (class($op) eq "UNOP") {
2177 # Genuine '-X' filetests are exempt from the LLAFR, but not
2179 if ($name =~ /^-/) {
2180 (my $kid = $self->deparse($op->first, 16)) =~ s/^\cS//;
2181 return $self->maybe_parens("$name $kid", $cx, 16);
2183 return $self->maybe_parens_unop($name, $op->first, $cx);
2184 } elsif (class($op) =~ /^(SV|PAD)OP$/) {
2185 return $self->maybe_parens_func($name, $self->pp_gv($op, 1), $cx, 16);
2186 } else { # I don't think baseop filetests ever survive ck_ftst, but...
2191 sub pp_lstat { ftst(@_, "lstat") }
2192 sub pp_stat { ftst(@_, "stat") }
2193 sub pp_ftrread { ftst(@_, "-R") }
2194 sub pp_ftrwrite { ftst(@_, "-W") }
2195 sub pp_ftrexec { ftst(@_, "-X") }
2196 sub pp_fteread { ftst(@_, "-r") }
2197 sub pp_ftewrite { ftst(@_, "-w") }
2198 sub pp_fteexec { ftst(@_, "-x") }
2199 sub pp_ftis { ftst(@_, "-e") }
2200 sub pp_fteowned { ftst(@_, "-O") }
2201 sub pp_ftrowned { ftst(@_, "-o") }
2202 sub pp_ftzero { ftst(@_, "-z") }
2203 sub pp_ftsize { ftst(@_, "-s") }
2204 sub pp_ftmtime { ftst(@_, "-M") }
2205 sub pp_ftatime { ftst(@_, "-A") }
2206 sub pp_ftctime { ftst(@_, "-C") }
2207 sub pp_ftsock { ftst(@_, "-S") }
2208 sub pp_ftchr { ftst(@_, "-c") }
2209 sub pp_ftblk { ftst(@_, "-b") }
2210 sub pp_ftfile { ftst(@_, "-f") }
2211 sub pp_ftdir { ftst(@_, "-d") }
2212 sub pp_ftpipe { ftst(@_, "-p") }
2213 sub pp_ftlink { ftst(@_, "-l") }
2214 sub pp_ftsuid { ftst(@_, "-u") }
2215 sub pp_ftsgid { ftst(@_, "-g") }
2216 sub pp_ftsvtx { ftst(@_, "-k") }
2217 sub pp_fttty { ftst(@_, "-t") }
2218 sub pp_fttext { ftst(@_, "-T") }
2219 sub pp_ftbinary { ftst(@_, "-B") }
2221 sub SWAP_CHILDREN () { 1 }
2222 sub ASSIGN () { 2 } # has OP= variant
2223 sub LIST_CONTEXT () { 4 } # Assignment is in list context
2229 my $name = $op->name;
2230 if ($name eq "concat" and $op->first->name eq "concat") {
2231 # avoid spurious '=' -- see comment in pp_concat
2234 if ($name eq "null" and class($op) eq "UNOP"
2235 and $op->first->name =~ /^(and|x?or)$/
2236 and null $op->first->sibling)
2238 # Like all conditional constructs, OP_ANDs and OP_ORs are topped
2239 # with a null that's used as the common end point of the two
2240 # flows of control. For precedence purposes, ignore it.
2241 # (COND_EXPRs have these too, but we don't bother with
2242 # their associativity).
2243 return assoc_class($op->first);
2245 return $name . ($op->flags & OPf_STACKED ? "=" : "");
2248 # Left associative operators, like '+', for which
2249 # $a + $b + $c is equivalent to ($a + $b) + $c
2252 %left = ('multiply' => 19, 'i_multiply' => 19,
2253 'divide' => 19, 'i_divide' => 19,
2254 'modulo' => 19, 'i_modulo' => 19,
2256 'add' => 18, 'i_add' => 18,
2257 'subtract' => 18, 'i_subtract' => 18,
2259 'left_shift' => 17, 'right_shift' => 17,
2261 'bit_or' => 12, 'bit_xor' => 12,
2263 'or' => 2, 'xor' => 2,
2267 sub deparse_binop_left {
2269 my($op, $left, $prec) = @_;
2270 if ($left{assoc_class($op)} && $left{assoc_class($left)}
2271 and $left{assoc_class($op)} == $left{assoc_class($left)})
2273 return $self->deparse($left, $prec - .00001);
2275 return $self->deparse($left, $prec);
2279 # Right associative operators, like '=', for which
2280 # $a = $b = $c is equivalent to $a = ($b = $c)
2283 %right = ('pow' => 22,
2284 'sassign=' => 7, 'aassign=' => 7,
2285 'multiply=' => 7, 'i_multiply=' => 7,
2286 'divide=' => 7, 'i_divide=' => 7,
2287 'modulo=' => 7, 'i_modulo=' => 7,
2289 'add=' => 7, 'i_add=' => 7,
2290 'subtract=' => 7, 'i_subtract=' => 7,
2292 'left_shift=' => 7, 'right_shift=' => 7,
2294 'bit_or=' => 7, 'bit_xor=' => 7,
2300 sub deparse_binop_right {
2302 my($op, $right, $prec) = @_;
2303 if ($right{assoc_class($op)} && $right{assoc_class($right)}
2304 and $right{assoc_class($op)} == $right{assoc_class($right)})
2306 return $self->deparse($right, $prec - .00001);
2308 return $self->deparse($right, $prec);
2314 my ($op, $cx, $opname, $prec, $flags) = (@_, 0);
2315 my $left = $op->first;
2316 my $right = $op->last;
2318 if ($op->flags & OPf_STACKED && $flags & ASSIGN) {
2322 if ($flags & SWAP_CHILDREN) {
2323 ($left, $right) = ($right, $left);
2325 $left = $self->deparse_binop_left($op, $left, $prec);
2326 $left = "($left)" if $flags & LIST_CONTEXT
2327 && $left !~ /^(my|our|local|)[\@\(]/;
2328 $right = $self->deparse_binop_right($op, $right, $prec);
2329 return $self->maybe_parens("$left $opname$eq $right", $cx, $prec);
2332 sub pp_add { maybe_targmy(@_, \&binop, "+", 18, ASSIGN) }
2333 sub pp_multiply { maybe_targmy(@_, \&binop, "*", 19, ASSIGN) }
2334 sub pp_subtract { maybe_targmy(@_, \&binop, "-",18, ASSIGN) }
2335 sub pp_divide { maybe_targmy(@_, \&binop, "/", 19, ASSIGN) }
2336 sub pp_modulo { maybe_targmy(@_, \&binop, "%", 19, ASSIGN) }
2337 sub pp_i_add { maybe_targmy(@_, \&binop, "+", 18, ASSIGN) }
2338 sub pp_i_multiply { maybe_targmy(@_, \&binop, "*", 19, ASSIGN) }
2339 sub pp_i_subtract { maybe_targmy(@_, \&binop, "-", 18, ASSIGN) }
2340 sub pp_i_divide { maybe_targmy(@_, \&binop, "/", 19, ASSIGN) }
2341 sub pp_i_modulo { maybe_targmy(@_, \&binop, "%", 19, ASSIGN) }
2342 sub pp_pow { maybe_targmy(@_, \&binop, "**", 22, ASSIGN) }
2344 sub pp_left_shift { maybe_targmy(@_, \&binop, "<<", 17, ASSIGN) }
2345 sub pp_right_shift { maybe_targmy(@_, \&binop, ">>", 17, ASSIGN) }
2346 sub pp_bit_and { maybe_targmy(@_, \&binop, "&", 13, ASSIGN) }
2347 sub pp_bit_or { maybe_targmy(@_, \&binop, "|", 12, ASSIGN) }
2348 sub pp_bit_xor { maybe_targmy(@_, \&binop, "^", 12, ASSIGN) }
2350 sub pp_eq { binop(@_, "==", 14) }
2351 sub pp_ne { binop(@_, "!=", 14) }
2352 sub pp_lt { binop(@_, "<", 15) }
2353 sub pp_gt { binop(@_, ">", 15) }
2354 sub pp_ge { binop(@_, ">=", 15) }
2355 sub pp_le { binop(@_, "<=", 15) }
2356 sub pp_ncmp { binop(@_, "<=>", 14) }
2357 sub pp_i_eq { binop(@_, "==", 14) }
2358 sub pp_i_ne { binop(@_, "!=", 14) }
2359 sub pp_i_lt { binop(@_, "<", 15) }
2360 sub pp_i_gt { binop(@_, ">", 15) }
2361 sub pp_i_ge { binop(@_, ">=", 15) }
2362 sub pp_i_le { binop(@_, "<=", 15) }
2363 sub pp_i_ncmp { binop(@_, "<=>", 14) }
2365 sub pp_seq { binop(@_, "eq", 14) }
2366 sub pp_sne { binop(@_, "ne", 14) }
2367 sub pp_slt { binop(@_, "lt", 15) }
2368 sub pp_sgt { binop(@_, "gt", 15) }
2369 sub pp_sge { binop(@_, "ge", 15) }
2370 sub pp_sle { binop(@_, "le", 15) }
2371 sub pp_scmp { binop(@_, "cmp", 14) }
2373 sub pp_sassign { binop(@_, "=", 7, SWAP_CHILDREN) }
2374 sub pp_aassign { binop(@_, "=", 7, SWAP_CHILDREN | LIST_CONTEXT) }
2377 my ($self, $op, $cx) = @_;
2378 if ($op->flags & OPf_SPECIAL) {
2379 return $self->deparse($op->last, $cx);
2382 binop(@_, "~~", 14);
2386 # '.' is special because concats-of-concats are optimized to save copying
2387 # by making all but the first concat stacked. The effect is as if the
2388 # programmer had written '($a . $b) .= $c', except legal.
2389 sub pp_concat { maybe_targmy(@_, \&real_concat) }
2393 my $left = $op->first;
2394 my $right = $op->last;
2397 if ($op->flags & OPf_STACKED and $op->first->name ne "concat") {
2401 $left = $self->deparse_binop_left($op, $left, $prec);
2402 $right = $self->deparse_binop_right($op, $right, $prec);
2403 return $self->maybe_parens("$left .$eq $right", $cx, $prec);
2406 # 'x' is weird when the left arg is a list
2410 my $left = $op->first;
2411 my $right = $op->last;
2414 if ($op->flags & OPf_STACKED) {
2418 if (null($right)) { # list repeat; count is inside left-side ex-list
2419 my $kid = $left->first->sibling; # skip pushmark
2421 for (; !null($kid->sibling); $kid = $kid->sibling) {
2422 push @exprs, $self->deparse($kid, 6);
2425 $left = "(" . join(", ", @exprs). ")";
2427 $left = $self->deparse_binop_left($op, $left, $prec);
2429 $right = $self->deparse_binop_right($op, $right, $prec);
2430 return $self->maybe_parens("$left x$eq $right", $cx, $prec);
2435 my ($op, $cx, $type) = @_;
2436 my $left = $op->first;
2437 my $right = $left->sibling;
2438 $left = $self->deparse($left, 9);
2439 $right = $self->deparse($right, 9);
2440 return $self->maybe_parens("$left $type $right", $cx, 9);
2446 my $flip = $op->first;
2447 my $type = ($flip->flags & OPf_SPECIAL) ? "..." : "..";
2448 return $self->range($flip->first, $cx, $type);
2451 # one-line while/until is handled in pp_leave
2455 my ($op, $cx, $lowop, $lowprec, $highop, $highprec, $blockname) = @_;
2456 my $left = $op->first;
2457 my $right = $op->first->sibling;
2458 if ($cx < 1 and is_scope($right) and $blockname
2459 and $self->{'expand'} < 7)
2461 $left = $self->deparse($left, 1);
2462 $right = $self->deparse($right, 0);
2463 return "$blockname ($left) {\n\t$right\n\b}\cK";
2464 } elsif ($cx < 1 and $blockname and not $self->{'parens'}
2465 and $self->{'expand'} < 7) { # $b if $a
2466 $right = $self->deparse($right, 1);
2467 $left = $self->deparse($left, 1);
2468 return "$right $blockname $left";
2469 } elsif ($cx > $lowprec and $highop) { # $a && $b
2470 $left = $self->deparse_binop_left($op, $left, $highprec);
2471 $right = $self->deparse_binop_right($op, $right, $highprec);
2472 return $self->maybe_parens("$left $highop $right", $cx, $highprec);
2473 } else { # $a and $b
2474 $left = $self->deparse_binop_left($op, $left, $lowprec);
2475 $right = $self->deparse_binop_right($op, $right, $lowprec);
2476 return $self->maybe_parens("$left $lowop $right", $cx, $lowprec);
2480 sub pp_and { logop(@_, "and", 3, "&&", 11, "if") }
2481 sub pp_or { logop(@_, "or", 2, "||", 10, "unless") }
2482 sub pp_dor { logop(@_, "//", 10) }
2484 # xor is syntactically a logop, but it's really a binop (contrary to
2485 # old versions of opcode.pl). Syntax is what matters here.
2486 sub pp_xor { logop(@_, "xor", 2, "", 0, "") }
2490 my ($op, $cx, $opname) = @_;
2491 my $left = $op->first;
2492 my $right = $op->first->sibling->first; # skip sassign
2493 $left = $self->deparse($left, 7);
2494 $right = $self->deparse($right, 7);
2495 return $self->maybe_parens("$left $opname $right", $cx, 7);
2498 sub pp_andassign { logassignop(@_, "&&=") }
2499 sub pp_orassign { logassignop(@_, "||=") }
2500 sub pp_dorassign { logassignop(@_, "//=") }
2502 sub rv2gv_or_string {
2504 if ($op->name eq "gv") { # could be open("open") or open("###")
2506 $self->stash_variable_name(undef,$self->gv_or_padgv($op));
2507 $quoted ? $name : "*$name";
2510 $self->deparse($op, 6);
2516 my($op, $cx, $name, $kid, $nollafr) = @_;
2518 my $parens = ($cx >= 5) || $self->{'parens'};
2519 $kid ||= $op->first->sibling;
2520 # If there are no arguments, add final parentheses (or parenthesize the
2521 # whole thing if the llafr does not apply) to account for cases like
2522 # (return)+1 or setpgrp()+1. When the llafr does not apply, we use a
2523 # precedence of 6 (< comma), as "return, 1" does not need parentheses.
2526 ? $self->maybe_parens($self->keyword($name), $cx, 7)
2527 : $self->keyword($name) . '()' x (7 < $cx);
2530 $name = "socketpair" if $name eq "sockpair";
2531 my $fullname = $self->keyword($name);
2532 my $proto = prototype("CORE::$name");
2534 && $proto =~ /^;?\*/
2535 && $kid->name eq "rv2gv" && !($kid->private & OPpLVAL_INTRO)) {
2536 $first = $self->rv2gv_or_string($kid->first);
2539 $first = $self->deparse($kid, 6);
2541 if ($name eq "chmod" && $first =~ /^\d+$/) {
2542 $first = sprintf("%#o", $first);
2545 if not $parens and not $nollafr and substr($first, 0, 1) eq "(";
2546 push @exprs, $first;
2547 $kid = $kid->sibling;
2548 if (defined $proto && $proto =~ /^\*\*/ && $kid->name eq "rv2gv"
2549 && !($kid->private & OPpLVAL_INTRO)) {
2550 push @exprs, $first = $self->rv2gv_or_string($kid->first);
2551 $kid = $kid->sibling;
2553 for (; !null($kid); $kid = $kid->sibling) {
2554 push @exprs, $self->deparse($kid, 6);
2556 if ($name eq "reverse" && ($op->private & OPpREVERSE_INPLACE)) {
2557 return "$exprs[0] = $fullname"
2558 . ($parens ? "($exprs[0])" : " $exprs[0]");
2560 if ($parens && $nollafr) {
2561 return "($fullname " . join(", ", @exprs) . ")";
2563 return "$fullname(" . join(", ", @exprs) . ")";
2565 return "$fullname " . join(", ", @exprs);
2569 sub pp_bless { listop(@_, "bless") }
2570 sub pp_atan2 { maybe_targmy(@_, \&listop, "atan2") }
2572 my ($self,$op,$cx) = @_;
2573 if ($op->private & OPpSUBSTR_REPL_FIRST) {
2575 listop($self, $op, 7, "substr", $op->first->sibling->sibling)
2577 . $self->deparse($op->first->sibling, 7);
2579 maybe_local(@_, listop(@_, "substr"))
2581 sub pp_vec { maybe_local(@_, listop(@_, "vec")) }
2582 sub pp_index { maybe_targmy(@_, \&listop, "index") }
2583 sub pp_rindex { maybe_targmy(@_, \&listop, "rindex") }
2584 sub pp_sprintf { maybe_targmy(@_, \&listop, "sprintf") }
2585 sub pp_formline { listop(@_, "formline") } # see also deparse_format
2586 sub pp_crypt { maybe_targmy(@_, \&listop, "crypt") }
2587 sub pp_unpack { listop(@_, "unpack") }
2588 sub pp_pack { listop(@_, "pack") }
2589 sub pp_join { maybe_targmy(@_, \&listop, "join") }
2590 sub pp_splice { listop(@_, "splice") }
2591 sub pp_push { maybe_targmy(@_, \&listop, "push") }
2592 sub pp_unshift { maybe_targmy(@_, \&listop, "unshift") }
2593 sub pp_reverse { listop(@_, "reverse") }
2594 sub pp_warn { listop(@_, "warn") }
2595 sub pp_die { listop(@_, "die") }
2596 sub pp_return { listop(@_, "return", undef, 1) } # llafr does not apply
2597 sub pp_open { listop(@_, "open") }
2598 sub pp_pipe_op { listop(@_, "pipe") }
2599 sub pp_tie { listop(@_, "tie") }
2600 sub pp_binmode { listop(@_, "binmode") }
2601 sub pp_dbmopen { listop(@_, "dbmopen") }
2602 sub pp_sselect { listop(@_, "select") }
2603 sub pp_select { listop(@_, "select") }
2604 sub pp_read { listop(@_, "read") }
2605 sub pp_sysopen { listop(@_, "sysopen") }
2606 sub pp_sysseek { listop(@_, "sysseek") }
2607 sub pp_sysread { listop(@_, "sysread") }
2608 sub pp_syswrite { listop(@_, "syswrite") }
2609 sub pp_send { listop(@_, "send") }
2610 sub pp_recv { listop(@_, "recv") }
2611 sub pp_seek { listop(@_, "seek") }
2612 sub pp_fcntl { listop(@_, "fcntl") }
2613 sub pp_ioctl { listop(@_, "ioctl") }
2614 sub pp_flock { maybe_targmy(@_, \&listop, "flock") }
2615 sub pp_socket { listop(@_, "socket") }
2616 sub pp_sockpair { listop(@_, "sockpair") }
2617 sub pp_bind { listop(@_, "bind") }
2618 sub pp_connect { listop(@_, "connect") }
2619 sub pp_listen { listop(@_, "listen") }
2620 sub pp_accept { listop(@_, "accept") }
2621 sub pp_shutdown { listop(@_, "shutdown") }
2622 sub pp_gsockopt { listop(@_, "getsockopt") }
2623 sub pp_ssockopt { listop(@_, "setsockopt") }
2624 sub pp_chown { maybe_targmy(@_, \&listop, "chown") }
2625 sub pp_unlink { maybe_targmy(@_, \&listop, "unlink") }
2626 sub pp_chmod { maybe_targmy(@_, \&listop, "chmod") }
2627 sub pp_utime { maybe_targmy(@_, \&listop, "utime") }
2628 sub pp_rename { maybe_targmy(@_, \&listop, "rename") }
2629 sub pp_link { maybe_targmy(@_, \&listop, "link") }
2630 sub pp_symlink { maybe_targmy(@_, \&listop, "symlink") }
2631 sub pp_mkdir { maybe_targmy(@_, \&listop, "mkdir") }
2632 sub pp_open_dir { listop(@_, "opendir") }
2633 sub pp_seekdir { listop(@_, "seekdir") }
2634 sub pp_waitpid { maybe_targmy(@_, \&listop, "waitpid") }
2635 sub pp_system { maybe_targmy(@_, \&listop, "system") }
2636 sub pp_exec { maybe_targmy(@_, \&listop, "exec") }
2637 sub pp_kill { maybe_targmy(@_, \&listop, "kill") }
2638 sub pp_setpgrp { maybe_targmy(@_, \&listop, "setpgrp") }
2639 sub pp_getpriority { maybe_targmy(@_, \&listop, "getpriority") }
2640 sub pp_setpriority { maybe_targmy(@_, \&listop, "setpriority") }
2641 sub pp_shmget { listop(@_, "shmget") }
2642 sub pp_shmctl { listop(@_, "shmctl") }
2643 sub pp_shmread { listop(@_, "shmread") }
2644 sub pp_shmwrite { listop(@_, "shmwrite") }
2645 sub pp_msgget { listop(@_, "msgget") }
2646 sub pp_msgctl { listop(@_, "msgctl") }
2647 sub pp_msgsnd { listop(@_, "msgsnd") }
2648 sub pp_msgrcv { listop(@_, "msgrcv") }
2649 sub pp_semget { listop(@_, "semget") }
2650 sub pp_semctl { listop(@_, "semctl") }
2651 sub pp_semop { listop(@_, "semop") }
2652 sub pp_ghbyaddr { listop(@_, "gethostbyaddr") }
2653 sub pp_gnbyaddr { listop(@_, "getnetbyaddr") }
2654 sub pp_gpbynumber { listop(@_, "getprotobynumber") }
2655 sub pp_gsbyname { listop(@_, "getservbyname") }
2656 sub pp_gsbyport { listop(@_, "getservbyport") }
2657 sub pp_syscall { listop(@_, "syscall") }
2662 my $text = $self->dq($op->first->sibling); # skip pushmark
2664 $op->flags & OPf_SPECIAL ? 'glob' : $self->keyword('glob');
2665 if ($text =~ /^\$?(\w|::|\`)+$/ # could look like a readline
2666 or $keyword =~ /^CORE::/
2667 or $text =~ /[<>]/) {
2668 return "$keyword(" . single_delim('qq', '"', $text) . ')';
2670 return '<' . $text . '>';
2674 # Truncate is special because OPf_SPECIAL makes a bareword first arg
2675 # be a filehandle. This could probably be better fixed in the core
2676 # by moving the GV lookup into ck_truc.
2682 my $parens = ($cx >= 5) || $self->{'parens'};
2683 my $kid = $op->first->sibling;
2685 if ($op->flags & OPf_SPECIAL) {
2686 # $kid is an OP_CONST
2687 $fh = $self->const_sv($kid)->PV;
2689 $fh = $self->deparse($kid, 6);
2690 $fh = "+$fh" if not $parens and substr($fh, 0, 1) eq "(";
2692 my $len = $self->deparse($kid->sibling, 6);
2693 my $name = $self->keyword('truncate');
2695 return "$name($fh, $len)";
2697 return "$name $fh, $len";
2703 my($op, $cx, $name) = @_;
2705 my $firstkid = my $kid = $op->first->sibling;
2707 if ($op->flags & OPf_STACKED) {
2709 $indir = $indir->first; # skip rv2gv
2710 if (is_scope($indir)) {
2711 $indir = "{" . $self->deparse($indir, 0) . "}";
2712 $indir = "{;}" if $indir eq "{}";
2713 } elsif ($indir->name eq "const" && $indir->private & OPpCONST_BARE) {
2714 $indir = $self->const_sv($indir)->PV;
2716 $indir = $self->deparse($indir, 24);
2718 $indir = $indir . " ";
2719 $kid = $kid->sibling;
2721 if ($name eq "sort" && $op->private & (OPpSORT_NUMERIC | OPpSORT_INTEGER)) {
2722 $indir = ($op->private & OPpSORT_DESCEND) ? '{$b <=> $a} '
2725 elsif ($name eq "sort" && $op->private & OPpSORT_DESCEND) {
2726 $indir = '{$b cmp $a} ';
2728 for (; !null($kid); $kid = $kid->sibling) {
2729 $expr = $self->deparse($kid, !$indir && $kid == $firstkid && $name eq "sort" && $firstkid->name eq "entersub" ? 16 : 6);
2733 if ($name eq "sort" && $op->private & OPpSORT_REVERSE) {
2734 $name2 = $self->keyword('reverse') . ' ' . $self->keyword('sort');
2736 else { $name2 = $self->keyword($name) }
2737 if ($name eq "sort" && ($op->private & OPpSORT_INPLACE)) {
2738 return "$exprs[0] = $name2 $indir $exprs[0]";
2741 my $args = $indir . join(", ", @exprs);
2742 if ($indir ne "" && $name eq "sort") {
2743 # We don't want to say "sort(f 1, 2, 3)", since perl -w will
2744 # give bareword warnings in that case. Therefore if context
2745 # requires, we'll put parens around the outside "(sort f 1, 2,
2746 # 3)". Unfortunately, we'll currently think the parens are
2747 # necessary more often that they really are, because we don't
2748 # distinguish which side of an assignment we're on.
2750 return "($name2 $args)";
2752 return "$name2 $args";
2755 !$indir && $name eq "sort"
2756 && $op->first->sibling->name eq 'entersub'
2758 # We cannot say sort foo(bar), as foo will be interpreted as a
2759 # comparison routine. We have to say sort(...) in that case.
2760 return "$name2($args)";
2762 return $self->maybe_parens_func($name2, $args, $cx, 5);
2767 sub pp_prtf { indirop(@_, "printf") }
2768 sub pp_print { indirop(@_, "print") }
2769 sub pp_say { indirop(@_, "say") }
2770 sub pp_sort { indirop(@_, "sort") }
2774 my($op, $cx, $name) = @_;
2776 my $kid = $op->first; # this is the (map|grep)start
2777 $kid = $kid->first->sibling; # skip a pushmark
2778 my $code = $kid->first; # skip a null
2779 if (is_scope $code) {
2780 $code = "{" . $self->deparse($code, 0) . "} ";
2782 $code = $self->deparse($code, 24) . ", ";
2784 $kid = $kid->sibling;
2785 for (; !null($kid); $kid = $kid->sibling) {
2786 $expr = $self->deparse($kid, 6);
2787 push @exprs, $expr if defined $expr;
2789 return $self->maybe_parens_func($name, $code . join(", ", @exprs), $cx, 5);
2792 sub pp_mapwhile { mapop(@_, "map") }
2793 sub pp_grepwhile { mapop(@_, "grep") }
2794 sub pp_mapstart { baseop(@_, "map") }
2795 sub pp_grepstart { baseop(@_, "grep") }
2801 my $kid = $op->first->sibling; # skip pushmark
2802 return '' if class($kid) eq 'NULL';
2804 my $local = "either"; # could be local(...), my(...), state(...) or our(...)
2805 for ($lop = $kid; !null($lop); $lop = $lop->sibling) {
2806 # This assumes that no other private flags equal 128, and that
2807 # OPs that store things other than flags in their op_private,
2808 # like OP_AELEMFAST, won't be immediate children of a list.
2810 # OP_ENTERSUB can break this logic, so check for it.
2811 # I suspect that open and exit can too.
2813 if (!($lop->private & (OPpLVAL_INTRO|OPpOUR_INTRO)
2814 or $lop->name eq "undef")
2815 or $lop->name eq "entersub"
2816 or $lop->name eq "exit"
2817 or $lop->name eq "open")
2819 $local = ""; # or not
2822 if ($lop->name =~ /^pad[ash]v$/) {
2823 if ($lop->private & OPpPAD_STATE) { # state()
2824 ($local = "", last) if $local =~ /^(?:local|our|my)$/;
2827 ($local = "", last) if $local =~ /^(?:local|our|state)$/;
2830 } elsif ($lop->name =~ /^(gv|rv2)[ash]v$/
2831 && $lop->private & OPpOUR_INTRO
2832 or $lop->name eq "null" && $lop->first->name eq "gvsv"
2833 && $lop->first->private & OPpOUR_INTRO) { # our()
2834 ($local = "", last) if $local =~ /^(?:my|local|state)$/;
2836 } elsif ($lop->name ne "undef"
2837 # specifically avoid the "reverse sort" optimisation,
2838 # where "reverse" is nullified
2839 && !($lop->name eq 'sort' && ($lop->flags & OPpSORT_REVERSE)))
2842 ($local = "", last) if $local =~ /^(?:my|our|state)$/;
2846 $local = "" if $local eq "either"; # no point if it's all undefs
2847 return $self->deparse($kid, $cx) if null $kid->sibling and not $local;
2848 for (; !null($kid); $kid = $kid->sibling) {
2850 if (class($kid) eq "UNOP" and $kid->first->name eq "gvsv") {
2855 $self->{'avoid_local'}{$$lop}++;
2856 $expr = $self->deparse($kid, 6);
2857 delete $self->{'avoid_local'}{$$lop};
2859 $expr = $self->deparse($kid, 6);
2864 return "$local(" . join(", ", @exprs) . ")";
2866 return $self->maybe_parens( join(", ", @exprs), $cx, 6);
2870 sub is_ifelse_cont {
2872 return ($op->name eq "null" and class($op) eq "UNOP"
2873 and $op->first->name =~ /^(and|cond_expr)$/
2874 and is_scope($op->first->first->sibling));
2880 my $cond = $op->first;
2881 my $true = $cond->sibling;
2882 my $false = $true->sibling;
2883 my $cuddle = $self->{'cuddle'};
2884 unless ($cx < 1 and (is_scope($true) and $true->name ne "null") and
2885 (is_scope($false) || is_ifelse_cont($false))
2886 and $self->{'expand'} < 7) {
2887 $cond = $self->deparse($cond, 8);
2888 $true = $self->deparse($true, 6);
2889 $false = $self->deparse($false, 8);
2890 return $self->maybe_parens("$cond ? $true : $false", $cx, 8);
2893 $cond = $self->deparse($cond, 1);
2894 $true = $self->deparse($true, 0);
2895 my $head = "if ($cond) {\n\t$true\n\b}";
2897 while (!null($false) and is_ifelse_cont($false)) {
2898 my $newop = $false->first;
2899 my $newcond = $newop->first;
2900 my $newtrue = $newcond->sibling;
2901 $false = $newtrue->sibling; # last in chain is OP_AND => no else
2902 if ($newcond->name eq "lineseq")
2904 # lineseq to ensure correct line numbers in elsif()
2905 # Bug #37302 fixed by change #33710.
2906 $newcond = $newcond->first->sibling;
2908 $newcond = $self->deparse($newcond, 1);
2909 $newtrue = $self->deparse($newtrue, 0);
2910 push @elsifs, "elsif ($newcond) {\n\t$newtrue\n\b}";
2912 if (!null($false)) {
2913 $false = $cuddle . "else {\n\t" .
2914 $self->deparse($false, 0) . "\n\b}\cK";
2918 return $head . join($cuddle, "", @elsifs) . $false;
2922 my ($self, $op, $cx) = @_;
2923 my $cond = $op->first;
2924 my $true = $cond->sibling;
2926 return $self->deparse($true, $cx);
2931 my($op, $cx, $init) = @_;
2932 my $enter = $op->first;
2933 my $kid = $enter->sibling;
2934 local(@$self{qw'curstash warnings hints hinthash'})
2935 = @$self{qw'curstash warnings hints hinthash'};
2940 if ($kid->name eq "lineseq") { # bare or infinite loop
2941 if ($kid->last->name eq "unstack") { # infinite
2942 $head = "while (1) "; # Can't use for(;;) if there's a continue
2948 } elsif ($enter->name eq "enteriter") { # foreach
2949 my $ary = $enter->first->sibling; # first was pushmark
2950 my $var = $ary->sibling;
2951 if ($ary->name eq 'null' and $enter->private & OPpITER_REVERSED) {
2952 # "reverse" was optimised away
2953 $ary = listop($self, $ary->first->sibling, 1, 'reverse');
2954 } elsif ($enter->flags & OPf_STACKED
2955 and not null $ary->first->sibling->sibling)
2957 $ary = $self->deparse($ary->first->sibling, 9) . " .. " .
2958 $self->deparse($ary->first->sibling->sibling, 9);
2960 $ary = $self->deparse($ary, 1);
2963 if (($enter->flags & OPf_SPECIAL) && ($] < 5.009)) {
2964 # thread special var, under 5005threads
2965 $var = $self->pp_threadsv($enter, 1);
2966 } else { # regular my() variable
2967 $var = $self->pp_padsv($enter, 1);
2969 } elsif ($var->name eq "rv2gv") {
2970 $var = $self->pp_rv2sv($var, 1);
2971 if ($enter->private & OPpOUR_INTRO) {
2972 # our declarations don't have package names
2973 $var =~ s/^(.).*::/$1/;
2976 } elsif ($var->name eq "gv") {
2977 $var = "\$" . $self->deparse($var, 1);
2979 $body = $kid->first->first->sibling; # skip OP_AND and OP_ITER
2980 if (!is_state $body->first and $body->first->name !~ /^(?:stub|leave|scope)$/) {
2981 confess unless $var eq '$_';
2982 $body = $body->first;
2983 return $self->deparse($body, 2) . " foreach ($ary)";
2985 $head = "foreach $var ($ary) ";
2986 } elsif ($kid->name eq "null") { # while/until
2988 my $name = {"and" => "while", "or" => "until"}->{$kid->name};
2989 $cond = $self->deparse($kid->first, 1);
2990 $head = "$name ($cond) ";
2991 $body = $kid->first->sibling;
2992 } elsif ($kid->name eq "stub") { # bare and empty
2993 return "{;}"; # {} could be a hashref
2995 # If there isn't a continue block, then the next pointer for the loop
2996 # will point to the unstack, which is kid's last child, except
2997 # in a bare loop, when it will point to the leaveloop. When neither of
2998 # these conditions hold, then the second-to-last child is the continue
2999 # block (or the last in a bare loop).
3000 my $cont_start = $enter->nextop;
3002 if ($$cont_start != $$op && ${$cont_start} != ${$body->last}) {
3004 $cont = $body->last;
3006 $cont = $body->first;
3007 while (!null($cont->sibling->sibling)) {
3008 $cont = $cont->sibling;
3011 my $state = $body->first;
3012 my $cuddle = $self->{'cuddle'};
3014 for (; $$state != $$cont; $state = $state->sibling) {
3015 push @states, $state;
3017 $body = $self->lineseq(undef, @states);
3018 if (defined $cond and not is_scope $cont and $self->{'expand'} < 3) {
3019 $head = "for ($init; $cond; " . $self->deparse($cont, 1) .") ";
3022 $cont = $cuddle . "continue {\n\t" .
3023 $self->deparse($cont, 0) . "\n\b}\cK";
3026 return "" if !defined $body;
3028 $head = "for ($init; $cond;) ";
3031 $body = $self->deparse($body, 0);
3033 $body =~ s/;?$/;\n/;
3035 return $head . "{\n\t" . $body . "\b}" . $cont;
3038 sub pp_leaveloop { shift->loop_common(@_, "") }
3043 my $init = $self->deparse($op, 1);
3044 my $s = $op->sibling;
3045 my $ll = $s->name eq "unstack" ? $s->sibling : $s->first->sibling;
3046 return $self->loop_common($ll, $cx, $init);
3051 return "eval {\n\t" . $self->pp_leave(@_) . "\n\b}";
3054 BEGIN { for (qw[ const stringify rv2sv list glob ]) {
3055 eval "sub OP_\U$_ () { " . opnumber($_) . "}"
3061 if (class($op) eq "OP") {
3063 return $self->{'ex_const'} if $op->targ == OP_CONST;
3064 } elsif ($op->first->name eq "pushmark") {
3065 return $self->pp_list($op, $cx);
3066 } elsif ($op->first->name eq "enter") {
3067 return $self->pp_leave($op, $cx);
3068 } elsif ($op->first->name eq "leave") {
3069 return $self->pp_leave($op->first, $cx);
3070 } elsif ($op->first->name eq "scope") {
3071 return $self->pp_scope($op->first, $cx);
3072 } elsif ($op->targ == OP_STRINGIFY) {
3073 return $self->dquote($op, $cx);
3074 } elsif ($op->targ == OP_GLOB) {
3075 return $self->pp_glob(
3076 $op->first # entersub
3082 } elsif (!null($op->first->sibling) and
3083 $op->first->sibling->name eq "readline" and
3084 $op->first->sibling->flags & OPf_STACKED) {
3085 return $self->maybe_parens($self->deparse($op->first, 7) . " = "
3086 . $self->deparse($op->first->sibling, 7),
3088 } elsif (!null($op->first->sibling) and
3089 $op->first->sibling->name eq "trans" and
3090 $op->first->sibling->flags & OPf_STACKED) {
3091 return $self->maybe_parens($self->deparse($op->first, 20) . " =~ "
3092 . $self->deparse($op->first->sibling, 20),
3094 } elsif ($op->flags & OPf_SPECIAL && $cx < 1 && !$op->targ) {
3095 return "do {\n\t". $self->deparse($op->first, $cx) ."\n\b};";
3096 } elsif (!null($op->first->sibling) and
3097 $op->first->sibling->name eq "null" and
3098 class($op->first->sibling) eq "UNOP" and
3099 $op->first->sibling->first->flags & OPf_STACKED and
3100 $op->first->sibling->first->name eq "rcatline") {
3101 return $self->maybe_parens($self->deparse($op->first, 18) . " .= "
3102 . $self->deparse($op->first->sibling, 18),
3105 return $self->deparse($op->first, $cx);
3112 return $self->padname_sv($targ)->PVX;
3118 return substr($self->padname($op->targ), 1); # skip $/@/%
3124 return $self->maybe_my($op, $cx, $self->padname($op->targ));
3127 sub pp_padav { pp_padsv(@_) }
3128 sub pp_padhv { pp_padsv(@_) }
3130 my @threadsv_names = B::threadsv_names;
3134 return $self->maybe_local($op, $cx, "\$" . $threadsv_names[$op->targ]);
3140 if (class($op) eq "PADOP") {
3141 return $self->padval($op->padix);
3142 } else { # class($op) eq "SVOP"
3150 my $gv = $self->gv_or_padgv($op);
3151 return $self->maybe_local($op, $cx, $self->stash_variable("\$",
3152 $self->gv_name($gv), $cx));
3158 my $gv = $self->gv_or_padgv($op);
3159 return $self->gv_name($gv);
3162 sub pp_aelemfast_lex {
3165 my $name = $self->padname($op->targ);
3167 return $name . "[" . ($op->private + $self->{'arybase'}) . "]";
3173 # optimised PADAV, pre 5.15
3174 return $self->pp_aelemfast_lex(@_) if ($op->flags & OPf_SPECIAL);
3176 my $gv = $self->gv_or_padgv($op);
3177 my($name,$quoted) = $self->stash_variable_name('@',$gv);
3178 $name = $quoted ? "$name->" : '$' . $name;
3179 return $name . "[" . ($op->private + $self->{'arybase'}) . "]";
3184 my($op, $cx, $type) = @_;
3186 if (class($op) eq 'NULL' || !$op->can("first")) {
3187 carp("Unexpected op in pp_rv2x");
3190 my $kid = $op->first;
3191 if ($kid->name eq "gv") {
3192 return $self->stash_variable($type, $self->deparse($kid, 0), $cx);
3193 } elsif (is_scalar $kid) {
3194 my $str = $self->deparse($kid, 0);
3195 if ($str =~ /^\$([^\w\d])\z/) {
3196 # "$$+" isn't a legal way to write the scalar dereference
3197 # of $+, since the lexer can't tell you aren't trying to
3198 # do something like "$$ + 1" to get one more than your
3199 # PID. Either "${$+}" or "$${+}" are workable
3200 # disambiguations, but if the programmer did the former,
3201 # they'd be in the "else" clause below rather than here.
3202 # It's not clear if this should somehow be unified with
3203 # the code in dq and re_dq that also adds lexer
3204 # disambiguation braces.
3205 $str = '$' . "{$1}"; #'
3207 return $type . $str;
3209 return $type . "{" . $self->deparse($kid, 0) . "}";
3213 sub pp_rv2sv { maybe_local(@_, rv2x(@_, "\$")) }
3214 sub pp_rv2hv { maybe_local(@_, rv2x(@_, "%")) }
3215 sub pp_rv2gv { maybe_local(@_, rv2x(@_, "*")) }
3221 if ($op->first->name eq "padav") {
3222 return $self->maybe_local($op, $cx, '$#' . $self->padany($op->first));
3224 return $self->maybe_local($op, $cx,
3225 $self->rv2x($op->first, $cx, '$#'));
3229 # skip down to the old, ex-rv2cv
3231 my ($self, $op, $cx) = @_;
3232 if (!null($op->first) && $op->first->name eq 'null' &&
3233 $op->first->targ eq OP_LIST)
3235 return $self->rv2x($op->first->first->sibling, $cx, "&")
3238 return $self->rv2x($op, $cx, "")
3244 my($cx, @list) = @_;
3245 my @a = map $self->const($_, 6), @list;
3250 } elsif ( @a > 2 and !grep(!/^-?\d+$/, @a)) {
3251 # collapse (-1,0,1,2) into (-1..2)
3252 my ($s, $e) = @a[0,-1];
3254 return $self->maybe_parens("$s..$e", $cx, 9)
3255 unless grep $i++ != $_, @a;
3257 return $self->maybe_parens(join(", ", @a), $cx, 6);
3263 my $kid = $op->first;
3264 if ($kid->name eq "const") { # constant list
3265 my $av = $self->const_sv($kid);
3266 return $self->list_const($cx, $av->ARRAY);
3268 return $self->maybe_local($op, $cx, $self->rv2x($op, $cx, "\@"));
3272 sub is_subscriptable {
3274 if ($op->name =~ /^[ahg]elem/) {
3276 } elsif ($op->name eq "entersub") {
3277 my $kid = $op->first;
3278 return 0 unless null $kid->sibling;
3280 $kid = $kid->sibling until null $kid->sibling;
3281 return 0 if is_scope($kid);
3283 return 0 if $kid->name eq "gv";
3284 return 0 if is_scalar($kid);
3285 return is_subscriptable($kid);
3291 sub elem_or_slice_array_name
3294 my ($array, $left, $padname, $allow_arrow) = @_;
3296 if ($array->name eq $padname) {
3297 return $self->padany($array);
3298 } elsif (is_scope($array)) { # ${expr}[0]
3299 return "{" . $self->deparse($array, 0) . "}";
3300 } elsif ($array->name eq "gv") {
3301 ($array, my $quoted) =
3302 $self->stash_variable_name(
3303 $left eq '[' ? '@' : '%', $self->gv_or_padgv($array)
3305 if (!$allow_arrow && $quoted) {
3306 # This cannot happen.
3307 die "Invalid variable name $array for slice";
3309 return $quoted ? "$array->" : $array;
3310 } elsif (!$allow_arrow || is_scalar $array) { # $x[0], $$x[0], ...
3311 return $self->deparse($array, 24);
3317 sub elem_or_slice_single_index
3322 $idx = $self->deparse($idx, 1);
3324 # Outer parens in an array index will confuse perl
3325 # if we're interpolating in a regular expression, i.e.
3326 # /$x$foo[(-1)]/ is *not* the same as /$x$foo[-1]/
3328 # If $self->{parens}, then an initial '(' will
3329 # definitely be paired with a final ')'. If
3330 # !$self->{parens}, the misleading parens won't
3331 # have been added in the first place.
3333 # [You might think that we could get "(...)...(...)"
3334 # where the initial and final parens do not match
3335 # each other. But we can't, because the above would
3336 # only happen if there's an infix binop between the
3337 # two pairs of parens, and *that* means that the whole
3338 # expression would be parenthesized as well.]
3340 $idx =~ s/^\((.*)\)$/$1/ if $self->{'parens'};
3342 # Hash-element braces will autoquote a bareword inside themselves.
3343 # We need to make sure that C<$hash{warn()}> doesn't come out as
3344 # C<$hash{warn}>, which has a quite different meaning. Currently
3345 # B::Deparse will always quote strings, even if the string was a
3346 # bareword in the original (i.e. the OPpCONST_BARE flag is ignored
3347 # for constant strings.) So we can cheat slightly here - if we see
3348 # a bareword, we know that it is supposed to be a function call.
3350 $idx =~ s/^([A-Za-z_]\w*)$/$1()/;
3357 my ($op, $cx, $left, $right, $padname) = @_;
3358 my($array, $idx) = ($op->first, $op->first->sibling);
3360 $idx = $self->elem_or_slice_single_index($idx);
3362 unless ($array->name eq $padname) { # Maybe this has been fixed
3363 $array = $array->first; # skip rv2av (or ex-rv2av in _53+)
3365 if (my $array_name=$self->elem_or_slice_array_name
3366 ($array, $left, $padname, 1)) {
3367 return ($array_name =~ /->\z/ ? $array_name : "\$" . $array_name)
3368 . $left . $idx . $right;
3370 # $x[20][3]{hi} or expr->[20]
3371 my $arrow = is_subscriptable($array) ? "" : "->";
3372 return $self->deparse($array, 24) . $arrow . $left . $idx . $right;
3377 sub pp_aelem { maybe_local(@_, elem(@_, "[", "]", "padav")) }
3378 sub pp_helem { maybe_local(@_, elem(@_, "{", "}", "padhv")) }
3383 my($glob, $part) = ($op->first, $op->last);
3384 $glob = $glob->first; # skip rv2gv
3385 $glob = $glob->first if $glob->name eq "rv2gv"; # this one's a bug
3386 my $scope = is_scope($glob);
3387 $glob = $self->deparse($glob, 0);
3388 $part = $self->deparse($part, 1);
3389 return "*" . ($scope ? "{$glob}" : $glob) . "{$part}";
3394 my ($op, $cx, $left, $right, $regname, $padname) = @_;
3396 my(@elems, $kid, $array, $list);
3397 if (class($op) eq "LISTOP") {
3399 } else { # ex-hslice inside delete()
3400 for ($kid = $op->first; !null $kid->sibling; $kid = $kid->sibling) {}
3404 $array = $array->first
3405 if $array->name eq $regname or $array->name eq "null";
3406 $array = $self->elem_or_slice_array_name($array,$left,$padname,0);
3407 $kid = $op->first->sibling; # skip pushmark
3408 if ($kid->name eq "list") {
3409 $kid = $kid->first->sibling; # skip list, pushmark
3410 for (; !null $kid; $kid = $kid->sibling) {
3411 push @elems, $self->deparse($kid, 6);
3413 $list = join(", ", @elems);
3415 $list = $self->elem_or_slice_single_index($kid);
3417 return "\@" . $array . $left . $list . $right;
3420 sub pp_aslice { maybe_local(@_, slice(@_, "[", "]", "rv2av", "padav")) }
3421 sub pp_hslice { maybe_local(@_, slice(@_, "{", "}", "rv2hv", "padhv")) }
3426 my $idx = $op->first;
3427 my $list = $op->last;
3429 $list = $self->deparse($list, 1);
3430 $idx = $self->deparse($idx, 1);
3431 return "($list)" . "[$idx]";
3436 return ($op->flags & OPf_WANT) == OPf_WANT_SCALAR;
3441 return ($op->flags & OPf_WANT) == OPf_WANT_LIST;
3447 my $kid = $op->first->sibling; # skip pushmark
3448 my($meth, $obj, @exprs);
3449 if ($kid->name eq "list" and want_list $kid) {
3450 # When an indirect object isn't a bareword but the args are in
3451 # parens, the parens aren't part of the method syntax (the LLAFR
3452 # doesn't apply), but they make a list with OPf_PARENS set that
3453 # doesn't get flattened by the append_elem that adds the method,
3454 # making a (object, arg1, arg2, ...) list where the object
3455 # usually is. This can be distinguished from
3456 # '($obj, $arg1, $arg2)->meth()' (which is legal if $arg2 is an
3457 # object) because in the later the list is in scalar context
3458 # as the left side of -> always is, while in the former
3459 # the list is in list context as method arguments always are.
3460 # (Good thing there aren't method prototypes!)
3461 $meth = $kid->sibling;
3462 $kid = $kid->first->sibling; # skip pushmark
3464 $kid = $kid->sibling;
3465 for (; not null $kid; $kid = $kid->sibling) {
3470 $kid = $kid->sibling;
3471 for (; !null ($kid->sibling) && $kid->name!~/^method(?:_named)?\z/;
3472 $kid = $kid->sibling) {
3478 if ($meth->name eq "method_named") {
3479 $meth = $self->const_sv($meth)->PV;
3481 $meth = $meth->first;
3482 if ($meth->name eq "const") {
3483 # As of 5.005_58, this case is probably obsoleted by the
3484 # method_named case above
3485 $meth = $self->const_sv($meth)->PV; # needs to be bare
3489 return { method => $meth, variable_method => ref($meth),
3490 object => $obj, args => \@exprs },
3494 # compat function only
3497 my $info = $self->_method(@_);
3498 return $self->e_method( $self->_method(@_) );
3502 my ($self, $info, $cx) = @_;
3503 my $obj = $self->deparse($info->{object}, 24);
3505 my $meth = $info->{method};
3506 $meth = $self->deparse($meth, 1) if $info->{variable_method};
3507 my $args = join(", ", map { $self->deparse($_, 6) } @{$info->{args}} );
3508 if ($info->{object}->name eq 'scope' && want_list $info->{object}) {
3509 # method { $object }
3510 # This must be deparsed this way to preserve list context
3512 my $need_paren = $cx >= 6;
3513 return '(' x $need_paren
3514 . $meth . substr($obj,2) # chop off the "do"
3516 . ')' x $need_paren;
3518 my $kid = $obj . "->" . $meth;
3520 return $kid . "(" . $args . ")"; # parens mandatory
3526 # returns "&" if the prototype doesn't match the args,
3527 # or ("", $args_after_prototype_demunging) if it does.
3530 return "&" if $self->{'noproto'};
3531 my($proto, @args) = @_;
3535 # An unbackslashed @ or % gobbles up the rest of the args
3536 1 while $proto =~ s/(?<!\\)([@%])[^\]]+$/$1/;
3538 $proto =~ s/^(\\?[\$\@&%*_]|\\\[[\$\@&%*]+\]|;)//;
3541 return "&" if @args;
3542 } elsif ($chr eq ";") {
3544 } elsif ($chr eq "@" or $chr eq "%") {
3545 push @reals, map($self->deparse($_, 6), @args);
3550 if ($chr eq "\$" || $chr eq "_") {
3551 if (want_scalar $arg) {
3552 push @reals, $self->deparse($arg, 6);
3556 } elsif ($chr eq "&") {
3557 if ($arg->name =~ /^(s?refgen|undef)$/) {
3558 push @reals, $self->deparse($arg, 6);
3562 } elsif ($chr eq "*") {
3563 if ($arg->name =~ /^s?refgen$/
3564 and $arg->first->first->name eq "rv2gv")
3566 $real = $arg->first->first; # skip refgen, null
3567 if ($real->first->name eq "gv") {
3568 push @reals, $self->deparse($real, 6);
3570 push @reals, $self->deparse($real->first, 6);
3575 } elsif (substr($chr, 0, 1) eq "\\") {
3577 if ($arg->name =~ /^s?refgen$/ and
3578 !null($real = $arg->first) and
3579 ($chr =~ /\$/ && is_scalar($real->first)
3581 && class($real->first->sibling) ne 'NULL'
3582 && $real->first->sibling->name
3585 && class($real->first->sibling) ne 'NULL'
3586 && $real->first->sibling->name
3588 #or ($chr =~ /&/ # This doesn't work
3589 # && $real->first->name eq "rv2cv")
3591 && $real->first->name eq "rv2gv")))
3593 push @reals, $self->deparse($real, 6);
3600 return "&" if $proto and !$doneok; # too few args and no ';'
3601 return "&" if @args; # too many args
3602 return ("", join ", ", @reals);
3608 return $self->e_method($self->_method($op, $cx))
3609 unless null $op->first->sibling;
3613 if ($op->flags & OPf_SPECIAL && !($op->flags & OPf_MOD)) {
3615 } elsif ($op->private & OPpENTERSUB_AMPER) {
3619 $kid = $kid->first->sibling; # skip ex-list, pushmark
3620 for (; not null $kid->sibling; $kid = $kid->sibling) {
3625 if (is_scope($kid)) {
3627 $kid = "{" . $self->deparse($kid, 0) . "}";
3628 } elsif ($kid->first->name eq "gv") {
3629 my $gv = $self->gv_or_padgv($kid->first);
3630 if (class($gv->CV) ne "SPECIAL") {
3631 $proto = $gv->CV->PV if $gv->CV->FLAGS & SVf_POK;
3633 $simple = 1; # only calls of named functions can be prototyped
3634 $kid = $self->deparse($kid, 24);
3636 if ($kid eq 'main::') {
3638 } elsif ($kid !~ /^(?:\w|::)(?:[\w\d]|::(?!\z))*\z/) {
3639 $kid = single_delim("q", "'", $kid) . '->';
3642 } elsif (is_scalar ($kid->first) && $kid->first->name ne 'rv2cv') {
3644 $kid = $self->deparse($kid, 24);
3647 my $arrow = is_subscriptable($kid->first) ? "" : "->";
3648 $kid = $self->deparse($kid, 24) . $arrow;
3651 # Doesn't matter how many prototypes there are, if
3652 # they haven't happened yet!
3656 no warnings 'uninitialized';
3657 $declared = exists $self->{'subs_declared'}{$kid}
3659 defined &{ ${$self->{'curstash'}."::"}{$kid} }
3661 $self->{'subs_deparsed'}{$self->{'curstash'}."::".$kid}
3662 && defined prototype $self->{'curstash'}."::".$kid
3664 if (!$declared && defined($proto)) {
3665 # Avoid "too early to check prototype" warning
3666 ($amper, $proto) = ('&');
3671 if ($declared and defined $proto and not $amper) {
3672 ($amper, $args) = $self->check_proto($proto, @exprs);
3673 if ($amper eq "&") {
3674 $args = join(", ", map($self->deparse($_, 6), @exprs));
3677 $args = join(", ", map($self->deparse($_, 6), @exprs));
3679 if ($prefix or $amper) {
3680 if ($kid eq '&') { $kid = "{$kid}" } # &{&} cannot be written as &&
3681 if ($op->flags & OPf_STACKED) {
3682 return $prefix . $amper . $kid . "(" . $args . ")";
3684 return $prefix . $amper. $kid;
3687 # It's a syntax error to call CORE::GLOBAL::foo with a prefix,
3688 # so it must have been translated from a keyword call. Translate
3690 $kid =~ s/^CORE::GLOBAL:://;
3692 my $dproto = defined($proto) ? $proto : "undefined";
3694 return "$kid(" . $args . ")";
3695 } elsif ($dproto eq "") {
3697 } elsif ($dproto eq "\$" and is_scalar($exprs[0])) {
3698 # is_scalar is an excessively conservative test here:
3699 # really, we should be comparing to the precedence of the
3700 # top operator of $exprs[0] (ala unop()), but that would
3701 # take some major code restructuring to do right.
3702 return $self->maybe_parens_func($kid, $args, $cx, 16);
3703 } elsif ($dproto ne '$' and defined($proto) || $simple) { #'
3704 return $self->maybe_parens_func($kid, $args, $cx, 5);
3706 return "$kid(" . $args . ")";
3711 sub pp_enterwrite { unop(@_, "write") }
3713 # escape things that cause interpolation in double quotes,
3714 # but not character escapes
3717 $str =~ s/(^|\G|[^\\])((?:\\\\)*)([\$\@]|\\[uUlLQE])/$1$2\\$3/g;
3725 # Matches any string which is balanced with respect to {braces}
3736 # the same, but treat $|, $), $( and $ at the end of the string differently
3750 (\(\?\??\{$bal\}\)) # $4
3756 /defined($4) && length($4) ? "$1$2$4" : "$1$2\\$3"/xeg;
3761 # This is for regular expressions with the /x modifier
3762 # We have to leave comments unmangled.
3763 sub re_uninterp_extended {
3776 ( \(\?\??\{$bal\}\) # $4 (skip over (?{}) and (??{}) blocks)
3777 | \#[^\n]* # (skip over comments)
3784 /defined($4) && length($4) ? "$1$2$4" : "$1$2\\$3"/xeg;
3790 my %unctrl = # portable to to EBCDIC
3792 "\c@" => '\c@', # unused
3819 "\c[" => '\c[', # unused
3820 "\c\\" => '\c\\', # unused
3821 "\c]" => '\c]', # unused
3822 "\c_" => '\c_', # unused
3825 # character escapes, but not delimiters that might need to be escaped
3826 sub escape_str { # ASCII, UTF8
3828 $str =~ s/(.)/ord($1) > 255 ? sprintf("\\x{%x}", ord($1)) : $1/eg;
3830 # $str =~ s/\cH/\\b/g; # \b means something different in a regex
3836 $str =~ s/([\cA-\cZ])/$unctrl{$1}/ge;
3837 $str =~ s/([[:^print:]])/sprintf("\\%03o", ord($1))/ge;
3841 # For regexes with the /x modifier.
3842 # Leave whitespace unmangled.
3843 sub escape_extended_re {
3845 $str =~ s/(.)/ord($1) > 255 ? sprintf("\\x{%x}", ord($1)) : $1/eg;
3846 $str =~ s/([[:^print:]])/
3847 ($1 =~ y! \t\n!!) ? $1 : sprintf("\\%03o", ord($1))/ge;
3848 $str =~ s/\n/\n\f/g;
3852 # Don't do this for regexen
3855 $str =~ s/\\/\\\\/g;
3859 # Remove backslashes which precede literal control characters,
3860 # to avoid creating ambiguity when we escape the latter.
3864 # the insane complexity here is due to the behaviour of "\c\"
3865 $str =~ s/(^|[^\\]|\\c\\)(?<!\\c)\\(\\\\)*(?=[[:^print:]])/$1$2/g;
3869 sub balanced_delim {
3871 my @str = split //, $str;
3872 my($ar, $open, $close, $fail, $c, $cnt, $last_bs);
3873 for $ar (['[',']'], ['(',')'], ['<','>'], ['{','}']) {
3874 ($open, $close) = @$ar;
3875 $fail = 0; $cnt = 0; $last_bs = 0;
3878 $fail = 1 if $last_bs;
3880 } elsif ($c eq $close) {
3881 $fail = 1 if $last_bs;
3889 $last_bs = $c eq '\\';
3891 $fail = 1 if $cnt != 0;
3892 return ($open, "$open$str$close") if not $fail;
3898 my($q, $default, $str) = @_;
3899 return "$default$str$default" if $default and index($str, $default) == -1;
3901 (my $succeed, $str) = balanced_delim($str);
3902 return "$q$str" if $succeed;
3904 for my $delim ('/', '"', '#') {
3905 return "$q$delim" . $str . $delim if index($str, $delim) == -1;
3908 $str =~ s/$default/\\$default/g;
3909 return "$default$str$default";
3917 BEGIN { $max_prec = int(0.999 + 8*length(pack("F", 42))*log(2)/log(10)); }
3919 # Split a floating point number into an integer mantissa and a binary
3920 # exponent. Assumes you've already made sure the number isn't zero or
3921 # some weird infinity or NaN.
3925 if ($f == int($f)) {
3926 while ($f % 2 == 0) {
3931 while ($f != int($f)) {
3936 my $mantissa = sprintf("%.0f", $f);
3937 return ($mantissa, $exponent);
3943 if ($self->{'use_dumper'}) {
3944 return $self->const_dumper($sv, $cx);
3946 if (class($sv) eq "SPECIAL") {
3947 # sv_undef, sv_yes, sv_no
3948 return ('undef', '1', $self->maybe_parens("!1", $cx, 21))[$$sv-1];
3950 if (class($sv) eq "NULL") {
3953 # convert a version object into the "v1.2.3" string in its V magic
3954 if ($sv->FLAGS & SVs_RMG) {
3955 for (my $mg = $sv->MAGIC; $mg; $mg = $mg->MOREMAGIC) {
3956 return $mg->PTR if $mg->TYPE eq 'V';
3960 if ($sv->FLAGS & SVf_IOK) {
3961 my $str = $sv->int_value;
3962 $str = $self->maybe_parens($str, $cx, 21) if $str < 0;
3964 } elsif ($sv->FLAGS & SVf_NOK) {
3967 if (pack("F", $nv) eq pack("F", 0)) {
3972 return $self->maybe_parens("-.0", $cx, 21);
3974 } elsif (1/$nv == 0) {
3977 return $self->maybe_parens("9**9**9", $cx, 22);
3980 return $self->maybe_parens("-9**9**9", $cx, 21);
3982 } elsif ($nv != $nv) {
3984 if (pack("F", $nv) eq pack("F", sin(9**9**9))) {
3986 return "sin(9**9**9)";
3987 } elsif (pack("F", $nv) eq pack("F", -sin(9**9**9))) {
3989 return $self->maybe_parens("-sin(9**9**9)", $cx, 21);
3992 my $hex = unpack("h*", pack("F", $nv));
3993 return qq'unpack("F", pack("h*", "$hex"))';
3996 # first, try the default stringification
3999 # failing that, try using more precision
4000 $str = sprintf("%.${max_prec}g", $nv);
4001 # if (pack("F", $str) ne pack("F", $nv)) {
4003 # not representable in decimal with whatever sprintf()
4004 # and atof() Perl is using here.
4005 my($mant, $exp) = split_float($nv);
4006 return $self->maybe_parens("$mant * 2**$exp", $cx, 19);
4009 $str = $self->maybe_parens($str, $cx, 21) if $nv < 0;
4011 } elsif ($sv->FLAGS & SVf_ROK && $sv->can("RV")) {
4013 if (class($ref) eq "AV") {
4014 return "[" . $self->list_const(2, $ref->ARRAY) . "]";
4015 } elsif (class($ref) eq "HV") {
4016 my %hash = $ref->ARRAY;
4018 for my $k (sort keys %hash) {
4019 push @elts, "$k => " . $self->const($hash{$k}, 6);
4021 return "{" . join(", ", @elts) . "}";
4022 } elsif (class($ref) eq "CV") {
4024 if ($] > 5.0150051) {
4025 require overloading;
4026 unimport overloading;
4029 if ($] > 5.0150051 && $self->{curcv} &&
4030 $self->{curcv}->object_2svref == $ref->object_2svref) {
4031 return $self->keyword("__SUB__");
4033 return "sub " . $self->deparse_sub($ref);
4035 if ($ref->FLAGS & SVs_SMG) {
4036 for (my $mg = $ref->MAGIC; $mg; $mg = $mg->MOREMAGIC) {
4037 if ($mg->TYPE eq 'r') {
4038 my $re = re_uninterp(escape_str(re_unback($mg->precomp)));
4039 return single_delim("qr", "", $re);
4044 return $self->maybe_parens("\\" . $self->const($ref, 20), $cx, 20);
4045 } elsif ($sv->FLAGS & SVf_POK) {
4047 if ($str =~ /[[:^print:]]/) {
4048 return single_delim("qq", '"', uninterp escape_str unback $str);
4050 return single_delim("q", "'", unback $str);
4060 my $ref = $sv->object_2svref();
4061 my $dumper = Data::Dumper->new([$$ref], ['$v']);
4062 $dumper->Purity(1)->Terse(1)->Deparse(1)->Indent(0)->Useqq(1)->Sortkeys(1);
4063 my $str = $dumper->Dump();
4064 if ($str =~ /^\$v/) {
4065 return '${my ' . $str . ' \$v}';
4075 # the constant could be in the pad (under useithreads)
4076 $sv = $self->padval($op->targ) unless $$sv;
4083 if ($op->private & OPpCONST_ARYBASE) {
4086 # if ($op->private & OPpCONST_BARE) { # trouble with '=>' autoquoting
4087 # return $self->const_sv($op)->PV;
4089 my $sv = $self->const_sv($op);
4090 return $self->const($sv, $cx);
4096 my $type = $op->name;
4097 if ($type eq "const") {
4098 return '$[' if $op->private & OPpCONST_ARYBASE;
4099 return uninterp(escape_str(unback($self->const_sv($op)->as_string)));
4100 } elsif ($type eq "concat") {
4101 my $first = $self->dq($op->first);
4102 my $last = $self->dq($op->last);
4104 # Disambiguate "${foo}bar", "${foo}{bar}", "${foo}[1]", "$foo\::bar"
4105 ($last =~ /^[A-Z\\\^\[\]_?]/ &&
4106 $first =~ s/([\$@])\^$/${1}{^}/) # "${^}W" etc
4107 || ($last =~ /^[:'{\[\w_]/ && #'
4108 $first =~ s/([\$@])([A-Za-z_]\w*)$/${1}{$2}/);
4110 return $first . $last;
4111 } elsif ($type eq "uc") {
4112 return '\U' . $self->dq($op->first->sibling) . '\E';
4113 } elsif ($type eq "lc") {
4114 return '\L' . $self->dq($op->first->sibling) . '\E';
4115 } elsif ($type eq "ucfirst") {
4116 return '\u' . $self->dq($op->first->sibling);
4117 } elsif ($type eq "lcfirst") {
4118 return '\l' . $self->dq($op->first->sibling);
4119 } elsif ($type eq "quotemeta") {
4120 return '\Q' . $self->dq($op->first->sibling) . '\E';
4121 } elsif ($type eq "fc") {
4122 return '\F' . $self->dq($op->first->sibling) . '\E';
4123 } elsif ($type eq "join") {
4124 return $self->deparse($op->last, 26); # was join($", @ary)
4126 return $self->deparse($op, 26);
4133 # skip pushmark if it exists (readpipe() vs ``)
4134 my $child = $op->first->sibling->isa('B::NULL')
4135 ? $op->first : $op->first->sibling;
4136 if ($self->pure_string($child)) {
4137 return single_delim("qx", '`', $self->dq($child, 1));
4139 unop($self, @_, "readpipe");
4145 my $kid = $op->first->sibling; # skip ex-stringify, pushmark
4146 return $self->deparse($kid, $cx) if $self->{'unquote'};
4147 $self->maybe_targmy($kid, $cx,
4148 sub {single_delim("qq", '"', $self->dq($_[1]))});
4151 # OP_STRINGIFY is a listop, but it only ever has one arg
4152 sub pp_stringify { maybe_targmy(@_, \&dquote) }
4154 # tr/// and s/// (and tr[][], tr[]//, tr###, etc)
4155 # note that tr(from)/to/ is OK, but not tr/from/(to)
4157 my($from, $to) = @_;
4158 my($succeed, $delim);
4159 if ($from !~ m[/] and $to !~ m[/]) {
4160 return "/$from/$to/";
4161 } elsif (($succeed, $from) = balanced_delim($from) and $succeed) {
4162 if (($succeed, $to) = balanced_delim($to) and $succeed) {
4165 for $delim ('/', '"', '#') { # note no "'" -- s''' is special
4166 return "$from$delim$to$delim" if index($to, $delim) == -1;
4169 return "$from/$to/";
4172 for $delim ('/', '"', '#') { # note no '
4173 return "$delim$from$delim$to$delim"
4174 if index($to . $from, $delim) == -1;
4176 $from =~ s[/][\\/]g;
4178 return "/$from/$to/";
4182 # Only used by tr///, so backslashes hyphens
4185 if ($n == ord '\\') {
4187 } elsif ($n == ord "-") {
4189 } elsif ($n >= ord(' ') and $n <= ord('~')) {
4191 } elsif ($n == ord "\a") {
4193 } elsif ($n == ord "\b") {
4195 } elsif ($n == ord "\t") {
4197 } elsif ($n == ord "\n") {
4199 } elsif ($n == ord "\e") {
4201 } elsif ($n == ord "\f") {
4203 } elsif ($n == ord "\r") {
4205 } elsif ($n >= ord("\cA") and $n <= ord("\cZ")) {
4206 return '\\c' . chr(ord("@") + $n);
4208 # return '\x' . sprintf("%02x", $n);
4209 return '\\' . sprintf("%03o", $n);
4215 my($str, $c, $tr) = ("");
4216 for ($c = 0; $c < @chars; $c++) {
4219 if ($c <= $#chars - 2 and $chars[$c + 1] == $tr + 1 and
4220 $chars[$c + 2] == $tr + 2)
4222 for (; $c <= $#chars-1 and $chars[$c + 1] == $chars[$c] + 1; $c++)
4225 $str .= pchr($chars[$c]);
4231 sub tr_decode_byte {
4232 my($table, $flags) = @_;
4233 my(@table) = unpack("s*", $table);
4234 splice @table, 0x100, 1; # Number of subsequent elements
4235 my($c, $tr, @from, @to, @delfrom, $delhyphen);
4236 if ($table[ord "-"] != -1 and
4237 $table[ord("-") - 1] == -1 || $table[ord("-") + 1] == -1)
4239 $tr = $table[ord "-"];
4240 $table[ord "-"] = -1;
4244 } else { # -2 ==> delete
4248 for ($c = 0; $c < @table; $c++) {
4251 push @from, $c; push @to, $tr;
4252 } elsif ($tr == -2) {
4256 @from = (@from, @delfrom);
4257 if ($flags & OPpTRANS_COMPLEMENT) {
4260 @from{@from} = (1) x @from;
4261 for ($c = 0; $c < 256; $c++) {
4262 push @newfrom, $c unless $from{$c};
4266 unless ($flags & OPpTRANS_DELETE || !@to) {
4267 pop @to while $#to and $to[$#to] == $to[$#to -1];
4270 $from = collapse(@from);
4271 $to = collapse(@to);
4272 $from .= "-" if $delhyphen;
4273 return ($from, $to);
4278 if ($x == ord "-") {
4280 } elsif ($x == ord "\\") {
4287 # XXX This doesn't yet handle all cases correctly either
4289 sub tr_decode_utf8 {
4290 my($swash_hv, $flags) = @_;
4291 my %swash = $swash_hv->ARRAY;
4293 $final = $swash{'FINAL'}->IV if exists $swash{'FINAL'};
4294 my $none = $swash{"NONE"}->IV;
4295 my $extra = $none + 1;
4296 my(@from, @delfrom, @to);
4298 foreach $line (split /\n/, $swash{'LIST'}->PV) {
4299 my($min, $max, $result) = split(/\t/, $line);
4306 $result = hex $result;
4307 if ($result == $extra) {
4308 push @delfrom, [$min, $max];
4310 push @from, [$min, $max];
4311 push @to, [$result, $result + $max - $min];
4314 for my $i (0 .. $#from) {
4315 if ($from[$i][0] == ord '-') {
4316 unshift @from, splice(@from, $i, 1);
4317 unshift @to, splice(@to, $i, 1);
4319 } elsif ($from[$i][1] == ord '-') {
4322 unshift @from, ord '-';
4323 unshift @to, ord '-';
4327 for my $i (0 .. $#delfrom) {
4328 if ($delfrom[$i][0] == ord '-') {
4329 push @delfrom, splice(@delfrom, $i, 1);
4331 } elsif ($delfrom[$i][1] == ord '-') {
4333 push @delfrom, ord '-';
4337 if (defined $final and $to[$#to][1] != $final) {
4338 push @to, [$final, $final];
4340 push @from, @delfrom;
4341 if ($flags & OPpTRANS_COMPLEMENT) {