| /* |
| * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved. |
| * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| * |
| * This code is free software; you can redistribute it and/or modify it |
| * under the terms of the GNU General Public License version 2 only, as |
| * published by the Free Software Foundation. |
| * |
| * This code is distributed in the hope that it will be useful, but WITHOUT |
| * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| * version 2 for more details (a copy is included in the LICENSE file that |
| * accompanied this code). |
| * |
| * You should have received a copy of the GNU General Public License version |
| * 2 along with this work; if not, write to the Free Software Foundation, |
| * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| * |
| * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| * or visit www.oracle.com if you need additional information or have any |
| * questions. |
| * |
| */ |
| |
| #include "precompiled.hpp" |
| #include "code/nmethod.hpp" |
| #include "compiler/compileBroker.hpp" |
| #include "opto/compile.hpp" |
| #include "opto/matcher.hpp" |
| #include "opto/node.hpp" |
| #include "opto/phase.hpp" |
| |
| #ifndef PRODUCT |
| int Phase::_total_bytes_compiled = 0; |
| |
| elapsedTimer Phase::_t_totalCompilation; |
| elapsedTimer Phase::_t_methodCompilation; |
| elapsedTimer Phase::_t_stubCompilation; |
| #endif |
| |
| // The next timers used for LogCompilation |
| elapsedTimer Phase::_t_parser; |
| elapsedTimer Phase::_t_optimizer; |
| elapsedTimer Phase::_t_escapeAnalysis; |
| elapsedTimer Phase::_t_connectionGraph; |
| elapsedTimer Phase::_t_idealLoop; |
| elapsedTimer Phase::_t_ccp; |
| elapsedTimer Phase::_t_matcher; |
| elapsedTimer Phase::_t_registerAllocation; |
| elapsedTimer Phase::_t_output; |
| |
| #ifndef PRODUCT |
| elapsedTimer Phase::_t_graphReshaping; |
| elapsedTimer Phase::_t_scheduler; |
| elapsedTimer Phase::_t_blockOrdering; |
| elapsedTimer Phase::_t_macroEliminate; |
| elapsedTimer Phase::_t_macroExpand; |
| elapsedTimer Phase::_t_peephole; |
| elapsedTimer Phase::_t_postalloc_expand; |
| elapsedTimer Phase::_t_codeGeneration; |
| elapsedTimer Phase::_t_registerMethod; |
| elapsedTimer Phase::_t_temporaryTimer1; |
| elapsedTimer Phase::_t_temporaryTimer2; |
| elapsedTimer Phase::_t_idealLoopVerify; |
| |
| // Subtimers for _t_optimizer |
| elapsedTimer Phase::_t_iterGVN; |
| elapsedTimer Phase::_t_iterGVN2; |
| elapsedTimer Phase::_t_incrInline; |
| elapsedTimer Phase::_t_renumberLive; |
| |
| |
| // Subtimers for _t_registerAllocation |
| elapsedTimer Phase::_t_ctorChaitin; |
| elapsedTimer Phase::_t_buildIFGphysical; |
| elapsedTimer Phase::_t_computeLive; |
| elapsedTimer Phase::_t_regAllocSplit; |
| elapsedTimer Phase::_t_postAllocCopyRemoval; |
| elapsedTimer Phase::_t_mergeMultidefs; |
| elapsedTimer Phase::_t_fixupSpills; |
| |
| // Subtimers for _t_output |
| elapsedTimer Phase::_t_instrSched; |
| elapsedTimer Phase::_t_buildOopMaps; |
| #endif |
| |
| //------------------------------Phase------------------------------------------ |
| Phase::Phase( PhaseNumber pnum ) : _pnum(pnum), C( pnum == Compiler ? NULL : Compile::current()) { |
| // Poll for requests from shutdown mechanism to quiesce compiler (4448539, 4448544). |
| // This is an effective place to poll, since the compiler is full of phases. |
| // In particular, every inlining site uses a recursively created Parse phase. |
| CompileBroker::maybe_block(); |
| } |
| |
| #ifndef PRODUCT |
| static const double minimum_reported_time = 0.0001; // seconds |
| static const double expected_method_compile_coverage = 0.97; // % |
| static const double minimum_meaningful_method_compile = 2.00; // seconds |
| |
| void Phase::print_timers() { |
| tty->print_cr ("Accumulated compiler times:"); |
| tty->print_cr ("---------------------------"); |
| tty->print_cr (" Total compilation: %3.3f sec.", Phase::_t_totalCompilation.seconds()); |
| tty->print (" method compilation : %3.3f sec", Phase::_t_methodCompilation.seconds()); |
| tty->print ("/%d bytes",_total_bytes_compiled); |
| tty->print_cr (" (%3.0f bytes per sec) ", Phase::_total_bytes_compiled / Phase::_t_methodCompilation.seconds()); |
| tty->print_cr (" stub compilation : %3.3f sec.", Phase::_t_stubCompilation.seconds()); |
| tty->print_cr (" Phases:"); |
| tty->print_cr (" parse : %3.3f sec", Phase::_t_parser.seconds()); |
| tty->print_cr (" optimizer : %3.3f sec", Phase::_t_optimizer.seconds()); |
| if( Verbose || WizardMode ) { |
| if (DoEscapeAnalysis) { |
| // EA is part of Optimizer. |
| tty->print_cr (" escape analysis: %3.3f sec", Phase::_t_escapeAnalysis.seconds()); |
| tty->print_cr (" connection graph: %3.3f sec", Phase::_t_connectionGraph.seconds()); |
| tty->print_cr (" macroEliminate : %3.3f sec", Phase::_t_macroEliminate.seconds()); |
| } |
| tty->print_cr (" iterGVN : %3.3f sec", Phase::_t_iterGVN.seconds()); |
| tty->print_cr (" incrInline : %3.3f sec", Phase::_t_incrInline.seconds()); |
| tty->print_cr (" renumberLive : %3.3f sec", Phase::_t_renumberLive.seconds()); |
| tty->print_cr (" idealLoop : %3.3f sec", Phase::_t_idealLoop.seconds()); |
| tty->print_cr (" idealLoopVerify: %3.3f sec", Phase::_t_idealLoopVerify.seconds()); |
| tty->print_cr (" ccp : %3.3f sec", Phase::_t_ccp.seconds()); |
| tty->print_cr (" iterGVN2 : %3.3f sec", Phase::_t_iterGVN2.seconds()); |
| tty->print_cr (" macroExpand : %3.3f sec", Phase::_t_macroExpand.seconds()); |
| tty->print_cr (" graphReshape : %3.3f sec", Phase::_t_graphReshaping.seconds()); |
| double optimizer_subtotal = Phase::_t_iterGVN.seconds() + Phase::_t_iterGVN2.seconds() + Phase::_t_renumberLive.seconds() + |
| Phase::_t_escapeAnalysis.seconds() + Phase::_t_macroEliminate.seconds() + |
| Phase::_t_idealLoop.seconds() + Phase::_t_ccp.seconds() + |
| Phase::_t_macroExpand.seconds() + Phase::_t_graphReshaping.seconds(); |
| double percent_of_optimizer = ((optimizer_subtotal == 0.0) ? 0.0 : (optimizer_subtotal / Phase::_t_optimizer.seconds() * 100.0)); |
| tty->print_cr (" subtotal : %3.3f sec, %3.2f %%", optimizer_subtotal, percent_of_optimizer); |
| } |
| tty->print_cr (" matcher : %3.3f sec", Phase::_t_matcher.seconds()); |
| tty->print_cr (" scheduler : %3.3f sec", Phase::_t_scheduler.seconds()); |
| tty->print_cr (" regalloc : %3.3f sec", Phase::_t_registerAllocation.seconds()); |
| if( Verbose || WizardMode ) { |
| tty->print_cr (" ctorChaitin : %3.3f sec", Phase::_t_ctorChaitin.seconds()); |
| tty->print_cr (" buildIFG : %3.3f sec", Phase::_t_buildIFGphysical.seconds()); |
| tty->print_cr (" computeLive : %3.3f sec", Phase::_t_computeLive.seconds()); |
| tty->print_cr (" regAllocSplit : %3.3f sec", Phase::_t_regAllocSplit.seconds()); |
| tty->print_cr (" postAllocCopyRemoval: %3.3f sec", Phase::_t_postAllocCopyRemoval.seconds()); |
| tty->print_cr (" mergeMultidefs: %3.3f sec", Phase::_t_mergeMultidefs.seconds()); |
| tty->print_cr (" fixupSpills : %3.3f sec", Phase::_t_fixupSpills.seconds()); |
| double regalloc_subtotal = Phase::_t_ctorChaitin.seconds() + |
| Phase::_t_buildIFGphysical.seconds() + Phase::_t_computeLive.seconds() + |
| Phase::_t_regAllocSplit.seconds() + Phase::_t_fixupSpills.seconds() + |
| Phase::_t_postAllocCopyRemoval.seconds() + Phase::_t_mergeMultidefs.seconds(); |
| double percent_of_regalloc = ((regalloc_subtotal == 0.0) ? 0.0 : (regalloc_subtotal / Phase::_t_registerAllocation.seconds() * 100.0)); |
| tty->print_cr (" subtotal : %3.3f sec, %3.2f %%", regalloc_subtotal, percent_of_regalloc); |
| } |
| tty->print_cr (" blockOrdering : %3.3f sec", Phase::_t_blockOrdering.seconds()); |
| tty->print_cr (" peephole : %3.3f sec", Phase::_t_peephole.seconds()); |
| if (Matcher::require_postalloc_expand) { |
| tty->print_cr (" postalloc_expand: %3.3f sec", Phase::_t_postalloc_expand.seconds()); |
| } |
| tty->print_cr (" codeGen : %3.3f sec", Phase::_t_codeGeneration.seconds()); |
| tty->print_cr (" install_code : %3.3f sec", Phase::_t_registerMethod.seconds()); |
| tty->print_cr (" -------------- : ----------"); |
| double phase_subtotal = Phase::_t_parser.seconds() + |
| Phase::_t_optimizer.seconds() + Phase::_t_graphReshaping.seconds() + |
| Phase::_t_matcher.seconds() + Phase::_t_scheduler.seconds() + |
| Phase::_t_registerAllocation.seconds() + Phase::_t_blockOrdering.seconds() + |
| Phase::_t_codeGeneration.seconds() + Phase::_t_registerMethod.seconds(); |
| double percent_of_method_compile = ((phase_subtotal == 0.0) ? 0.0 : phase_subtotal / Phase::_t_methodCompilation.seconds()) * 100.0; |
| // counters inside Compile::CodeGen include time for adapters and stubs |
| // so phase-total can be greater than 100% |
| tty->print_cr (" total : %3.3f sec, %3.2f %%", phase_subtotal, percent_of_method_compile); |
| |
| assert( percent_of_method_compile > expected_method_compile_coverage || |
| phase_subtotal < minimum_meaningful_method_compile, |
| "Must account for method compilation"); |
| |
| if( Phase::_t_temporaryTimer1.seconds() > minimum_reported_time ) { |
| tty->cr(); |
| tty->print_cr (" temporaryTimer1: %3.3f sec", Phase::_t_temporaryTimer1.seconds()); |
| } |
| if( Phase::_t_temporaryTimer2.seconds() > minimum_reported_time ) { |
| tty->cr(); |
| tty->print_cr (" temporaryTimer2: %3.3f sec", Phase::_t_temporaryTimer2.seconds()); |
| } |
| tty->print_cr (" output : %3.3f sec", Phase::_t_output.seconds()); |
| tty->print_cr (" isched : %3.3f sec", Phase::_t_instrSched.seconds()); |
| tty->print_cr (" bldOopMaps : %3.3f sec", Phase::_t_buildOopMaps.seconds()); |
| } |
| #endif |