src/share/vm/opto/phase.cpp

Wed, 10 Aug 2016 14:59:21 +0200

author
simonis
date
Wed, 10 Aug 2016 14:59:21 +0200
changeset 8608
0d78aecb0948
parent 8193
70649f10b88c
child 8604
04d83ba48607
permissions
-rw-r--r--

8152172: PPC64: Support AES intrinsics
Summary: Add support for AES intrinsics on PPC64.
Reviewed-by: kvn, mdoerr, simonis, zmajo
Contributed-by: Hiroshi H Horii <horii@jp.ibm.com>

duke@435 1 /*
mikael@6198 2 * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
duke@435 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435 4 *
duke@435 5 * This code is free software; you can redistribute it and/or modify it
duke@435 6 * under the terms of the GNU General Public License version 2 only, as
duke@435 7 * published by the Free Software Foundation.
duke@435 8 *
duke@435 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@435 13 * accompanied this code).
duke@435 14 *
duke@435 15 * You should have received a copy of the GNU General Public License version
duke@435 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@435 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435 18 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
duke@435 22 *
duke@435 23 */
duke@435 24
stefank@2314 25 #include "precompiled.hpp"
stefank@2314 26 #include "code/nmethod.hpp"
stefank@2314 27 #include "compiler/compileBroker.hpp"
stefank@2314 28 #include "opto/compile.hpp"
goetz@6478 29 #include "opto/matcher.hpp"
stefank@2314 30 #include "opto/node.hpp"
stefank@2314 31 #include "opto/phase.hpp"
duke@435 32
duke@435 33 #ifndef PRODUCT
duke@435 34 int Phase::_total_bytes_compiled = 0;
duke@435 35
duke@435 36 elapsedTimer Phase::_t_totalCompilation;
duke@435 37 elapsedTimer Phase::_t_methodCompilation;
duke@435 38 elapsedTimer Phase::_t_stubCompilation;
duke@435 39 #endif
duke@435 40
duke@435 41 // The next timers used for LogCompilation
duke@435 42 elapsedTimer Phase::_t_parser;
duke@435 43 elapsedTimer Phase::_t_optimizer;
kvn@3651 44 elapsedTimer Phase::_t_escapeAnalysis;
kvn@3651 45 elapsedTimer Phase::_t_connectionGraph;
duke@435 46 elapsedTimer Phase::_t_idealLoop;
duke@435 47 elapsedTimer Phase::_t_ccp;
duke@435 48 elapsedTimer Phase::_t_matcher;
duke@435 49 elapsedTimer Phase::_t_registerAllocation;
duke@435 50 elapsedTimer Phase::_t_output;
duke@435 51
duke@435 52 #ifndef PRODUCT
duke@435 53 elapsedTimer Phase::_t_graphReshaping;
duke@435 54 elapsedTimer Phase::_t_scheduler;
rasbold@853 55 elapsedTimer Phase::_t_blockOrdering;
kvn@3651 56 elapsedTimer Phase::_t_macroEliminate;
duke@435 57 elapsedTimer Phase::_t_macroExpand;
duke@435 58 elapsedTimer Phase::_t_peephole;
goetz@6478 59 elapsedTimer Phase::_t_postalloc_expand;
duke@435 60 elapsedTimer Phase::_t_codeGeneration;
duke@435 61 elapsedTimer Phase::_t_registerMethod;
duke@435 62 elapsedTimer Phase::_t_temporaryTimer1;
duke@435 63 elapsedTimer Phase::_t_temporaryTimer2;
never@1356 64 elapsedTimer Phase::_t_idealLoopVerify;
duke@435 65
duke@435 66 // Subtimers for _t_optimizer
duke@435 67 elapsedTimer Phase::_t_iterGVN;
duke@435 68 elapsedTimer Phase::_t_iterGVN2;
kvn@5110 69 elapsedTimer Phase::_t_incrInline;
zmajo@8193 70 elapsedTimer Phase::_t_renumberLive;
zmajo@8193 71
duke@435 72
duke@435 73 // Subtimers for _t_registerAllocation
duke@435 74 elapsedTimer Phase::_t_ctorChaitin;
duke@435 75 elapsedTimer Phase::_t_buildIFGphysical;
duke@435 76 elapsedTimer Phase::_t_computeLive;
duke@435 77 elapsedTimer Phase::_t_regAllocSplit;
duke@435 78 elapsedTimer Phase::_t_postAllocCopyRemoval;
iveresov@7564 79 elapsedTimer Phase::_t_mergeMultidefs;
duke@435 80 elapsedTimer Phase::_t_fixupSpills;
duke@435 81
duke@435 82 // Subtimers for _t_output
duke@435 83 elapsedTimer Phase::_t_instrSched;
duke@435 84 elapsedTimer Phase::_t_buildOopMaps;
duke@435 85 #endif
duke@435 86
duke@435 87 //------------------------------Phase------------------------------------------
duke@435 88 Phase::Phase( PhaseNumber pnum ) : _pnum(pnum), C( pnum == Compiler ? NULL : Compile::current()) {
twisti@1040 89 // Poll for requests from shutdown mechanism to quiesce compiler (4448539, 4448544).
duke@435 90 // This is an effective place to poll, since the compiler is full of phases.
duke@435 91 // In particular, every inlining site uses a recursively created Parse phase.
duke@435 92 CompileBroker::maybe_block();
duke@435 93 }
duke@435 94
duke@435 95 #ifndef PRODUCT
duke@435 96 static const double minimum_reported_time = 0.0001; // seconds
duke@435 97 static const double expected_method_compile_coverage = 0.97; // %
duke@435 98 static const double minimum_meaningful_method_compile = 2.00; // seconds
duke@435 99
duke@435 100 void Phase::print_timers() {
duke@435 101 tty->print_cr ("Accumulated compiler times:");
duke@435 102 tty->print_cr ("---------------------------");
duke@435 103 tty->print_cr (" Total compilation: %3.3f sec.", Phase::_t_totalCompilation.seconds());
never@1356 104 tty->print (" method compilation : %3.3f sec", Phase::_t_methodCompilation.seconds());
duke@435 105 tty->print ("/%d bytes",_total_bytes_compiled);
duke@435 106 tty->print_cr (" (%3.0f bytes per sec) ", Phase::_total_bytes_compiled / Phase::_t_methodCompilation.seconds());
never@1356 107 tty->print_cr (" stub compilation : %3.3f sec.", Phase::_t_stubCompilation.seconds());
duke@435 108 tty->print_cr (" Phases:");
never@1356 109 tty->print_cr (" parse : %3.3f sec", Phase::_t_parser.seconds());
never@1356 110 tty->print_cr (" optimizer : %3.3f sec", Phase::_t_optimizer.seconds());
duke@435 111 if( Verbose || WizardMode ) {
kvn@2556 112 if (DoEscapeAnalysis) {
kvn@2556 113 // EA is part of Optimizer.
kvn@2556 114 tty->print_cr (" escape analysis: %3.3f sec", Phase::_t_escapeAnalysis.seconds());
kvn@3651 115 tty->print_cr (" connection graph: %3.3f sec", Phase::_t_connectionGraph.seconds());
kvn@3651 116 tty->print_cr (" macroEliminate : %3.3f sec", Phase::_t_macroEliminate.seconds());
kvn@2556 117 }
never@1356 118 tty->print_cr (" iterGVN : %3.3f sec", Phase::_t_iterGVN.seconds());
kvn@5110 119 tty->print_cr (" incrInline : %3.3f sec", Phase::_t_incrInline.seconds());
zmajo@8193 120 tty->print_cr (" renumberLive : %3.3f sec", Phase::_t_renumberLive.seconds());
never@1356 121 tty->print_cr (" idealLoop : %3.3f sec", Phase::_t_idealLoop.seconds());
never@1356 122 tty->print_cr (" idealLoopVerify: %3.3f sec", Phase::_t_idealLoopVerify.seconds());
never@1356 123 tty->print_cr (" ccp : %3.3f sec", Phase::_t_ccp.seconds());
never@1356 124 tty->print_cr (" iterGVN2 : %3.3f sec", Phase::_t_iterGVN2.seconds());
kvn@2556 125 tty->print_cr (" macroExpand : %3.3f sec", Phase::_t_macroExpand.seconds());
never@1356 126 tty->print_cr (" graphReshape : %3.3f sec", Phase::_t_graphReshaping.seconds());
zmajo@8193 127 double optimizer_subtotal = Phase::_t_iterGVN.seconds() + Phase::_t_iterGVN2.seconds() + Phase::_t_renumberLive.seconds() +
kvn@3651 128 Phase::_t_escapeAnalysis.seconds() + Phase::_t_macroEliminate.seconds() +
duke@435 129 Phase::_t_idealLoop.seconds() + Phase::_t_ccp.seconds() +
kvn@3651 130 Phase::_t_macroExpand.seconds() + Phase::_t_graphReshaping.seconds();
duke@435 131 double percent_of_optimizer = ((optimizer_subtotal == 0.0) ? 0.0 : (optimizer_subtotal / Phase::_t_optimizer.seconds() * 100.0));
never@1356 132 tty->print_cr (" subtotal : %3.3f sec, %3.2f %%", optimizer_subtotal, percent_of_optimizer);
duke@435 133 }
never@1356 134 tty->print_cr (" matcher : %3.3f sec", Phase::_t_matcher.seconds());
never@1356 135 tty->print_cr (" scheduler : %3.3f sec", Phase::_t_scheduler.seconds());
never@1356 136 tty->print_cr (" regalloc : %3.3f sec", Phase::_t_registerAllocation.seconds());
duke@435 137 if( Verbose || WizardMode ) {
never@1356 138 tty->print_cr (" ctorChaitin : %3.3f sec", Phase::_t_ctorChaitin.seconds());
never@1356 139 tty->print_cr (" buildIFG : %3.3f sec", Phase::_t_buildIFGphysical.seconds());
never@1356 140 tty->print_cr (" computeLive : %3.3f sec", Phase::_t_computeLive.seconds());
never@1356 141 tty->print_cr (" regAllocSplit : %3.3f sec", Phase::_t_regAllocSplit.seconds());
duke@435 142 tty->print_cr (" postAllocCopyRemoval: %3.3f sec", Phase::_t_postAllocCopyRemoval.seconds());
iveresov@7564 143 tty->print_cr (" mergeMultidefs: %3.3f sec", Phase::_t_mergeMultidefs.seconds());
never@1356 144 tty->print_cr (" fixupSpills : %3.3f sec", Phase::_t_fixupSpills.seconds());
duke@435 145 double regalloc_subtotal = Phase::_t_ctorChaitin.seconds() +
duke@435 146 Phase::_t_buildIFGphysical.seconds() + Phase::_t_computeLive.seconds() +
duke@435 147 Phase::_t_regAllocSplit.seconds() + Phase::_t_fixupSpills.seconds() +
iveresov@7564 148 Phase::_t_postAllocCopyRemoval.seconds() + Phase::_t_mergeMultidefs.seconds();
duke@435 149 double percent_of_regalloc = ((regalloc_subtotal == 0.0) ? 0.0 : (regalloc_subtotal / Phase::_t_registerAllocation.seconds() * 100.0));
never@1356 150 tty->print_cr (" subtotal : %3.3f sec, %3.2f %%", regalloc_subtotal, percent_of_regalloc);
duke@435 151 }
never@1356 152 tty->print_cr (" blockOrdering : %3.3f sec", Phase::_t_blockOrdering.seconds());
never@1356 153 tty->print_cr (" peephole : %3.3f sec", Phase::_t_peephole.seconds());
goetz@6478 154 if (Matcher::require_postalloc_expand) {
goetz@6478 155 tty->print_cr (" postalloc_expand: %3.3f sec", Phase::_t_postalloc_expand.seconds());
goetz@6478 156 }
never@1356 157 tty->print_cr (" codeGen : %3.3f sec", Phase::_t_codeGeneration.seconds());
never@1356 158 tty->print_cr (" install_code : %3.3f sec", Phase::_t_registerMethod.seconds());
never@1356 159 tty->print_cr (" -------------- : ----------");
duke@435 160 double phase_subtotal = Phase::_t_parser.seconds() +
duke@435 161 Phase::_t_optimizer.seconds() + Phase::_t_graphReshaping.seconds() +
duke@435 162 Phase::_t_matcher.seconds() + Phase::_t_scheduler.seconds() +
rasbold@853 163 Phase::_t_registerAllocation.seconds() + Phase::_t_blockOrdering.seconds() +
duke@435 164 Phase::_t_codeGeneration.seconds() + Phase::_t_registerMethod.seconds();
duke@435 165 double percent_of_method_compile = ((phase_subtotal == 0.0) ? 0.0 : phase_subtotal / Phase::_t_methodCompilation.seconds()) * 100.0;
duke@435 166 // counters inside Compile::CodeGen include time for adapters and stubs
duke@435 167 // so phase-total can be greater than 100%
never@1356 168 tty->print_cr (" total : %3.3f sec, %3.2f %%", phase_subtotal, percent_of_method_compile);
duke@435 169
duke@435 170 assert( percent_of_method_compile > expected_method_compile_coverage ||
duke@435 171 phase_subtotal < minimum_meaningful_method_compile,
duke@435 172 "Must account for method compilation");
duke@435 173
duke@435 174 if( Phase::_t_temporaryTimer1.seconds() > minimum_reported_time ) {
duke@435 175 tty->cr();
duke@435 176 tty->print_cr (" temporaryTimer1: %3.3f sec", Phase::_t_temporaryTimer1.seconds());
duke@435 177 }
duke@435 178 if( Phase::_t_temporaryTimer2.seconds() > minimum_reported_time ) {
duke@435 179 tty->cr();
duke@435 180 tty->print_cr (" temporaryTimer2: %3.3f sec", Phase::_t_temporaryTimer2.seconds());
duke@435 181 }
never@1356 182 tty->print_cr (" output : %3.3f sec", Phase::_t_output.seconds());
never@1356 183 tty->print_cr (" isched : %3.3f sec", Phase::_t_instrSched.seconds());
never@1356 184 tty->print_cr (" bldOopMaps : %3.3f sec", Phase::_t_buildOopMaps.seconds());
duke@435 185 }
duke@435 186 #endif

mercurial