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