Tue, 11 Sep 2012 16:20:57 +0200
7195816: NPG: Crash in c1_ValueType - ShouldNotReachHere
Summary: C1 needs knowledge of T_METADATA at the LIR level.
Reviewed-by: kvn, coleenp
duke@435 | 1 | /* |
trims@2708 | 2 | * Copyright (c) 1997, 2011, 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 "libadt/vectset.hpp" |
stefank@2314 | 27 | #include "memory/allocation.inline.hpp" |
stefank@2314 | 28 | #include "opto/block.hpp" |
stefank@2314 | 29 | #include "opto/c2compiler.hpp" |
stefank@2314 | 30 | #include "opto/callnode.hpp" |
stefank@2314 | 31 | #include "opto/cfgnode.hpp" |
stefank@2314 | 32 | #include "opto/machnode.hpp" |
stefank@2314 | 33 | #include "opto/opcodes.hpp" |
stefank@2314 | 34 | #include "opto/phaseX.hpp" |
stefank@2314 | 35 | #include "opto/rootnode.hpp" |
stefank@2314 | 36 | #include "opto/runtime.hpp" |
stefank@2314 | 37 | #include "runtime/deoptimization.hpp" |
stefank@2314 | 38 | #ifdef TARGET_ARCH_MODEL_x86_32 |
stefank@2314 | 39 | # include "adfiles/ad_x86_32.hpp" |
stefank@2314 | 40 | #endif |
stefank@2314 | 41 | #ifdef TARGET_ARCH_MODEL_x86_64 |
stefank@2314 | 42 | # include "adfiles/ad_x86_64.hpp" |
stefank@2314 | 43 | #endif |
stefank@2314 | 44 | #ifdef TARGET_ARCH_MODEL_sparc |
stefank@2314 | 45 | # include "adfiles/ad_sparc.hpp" |
stefank@2314 | 46 | #endif |
stefank@2314 | 47 | #ifdef TARGET_ARCH_MODEL_zero |
stefank@2314 | 48 | # include "adfiles/ad_zero.hpp" |
stefank@2314 | 49 | #endif |
bobv@2508 | 50 | #ifdef TARGET_ARCH_MODEL_arm |
bobv@2508 | 51 | # include "adfiles/ad_arm.hpp" |
bobv@2508 | 52 | #endif |
bobv@2508 | 53 | #ifdef TARGET_ARCH_MODEL_ppc |
bobv@2508 | 54 | # include "adfiles/ad_ppc.hpp" |
bobv@2508 | 55 | #endif |
stefank@2314 | 56 | |
duke@435 | 57 | // Portions of code courtesy of Clifford Click |
duke@435 | 58 | |
duke@435 | 59 | // Optimization - Graph Style |
duke@435 | 60 | |
kvn@987 | 61 | // To avoid float value underflow |
kvn@987 | 62 | #define MIN_BLOCK_FREQUENCY 1.e-35f |
kvn@987 | 63 | |
duke@435 | 64 | //----------------------------schedule_node_into_block------------------------- |
duke@435 | 65 | // Insert node n into block b. Look for projections of n and make sure they |
duke@435 | 66 | // are in b also. |
duke@435 | 67 | void PhaseCFG::schedule_node_into_block( Node *n, Block *b ) { |
duke@435 | 68 | // Set basic block of n, Add n to b, |
duke@435 | 69 | _bbs.map(n->_idx, b); |
duke@435 | 70 | b->add_inst(n); |
duke@435 | 71 | |
duke@435 | 72 | // After Matching, nearly any old Node may have projections trailing it. |
duke@435 | 73 | // These are usually machine-dependent flags. In any case, they might |
duke@435 | 74 | // float to another block below this one. Move them up. |
duke@435 | 75 | for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) { |
duke@435 | 76 | Node* use = n->fast_out(i); |
duke@435 | 77 | if (use->is_Proj()) { |
duke@435 | 78 | Block* buse = _bbs[use->_idx]; |
duke@435 | 79 | if (buse != b) { // In wrong block? |
duke@435 | 80 | if (buse != NULL) |
duke@435 | 81 | buse->find_remove(use); // Remove from wrong block |
duke@435 | 82 | _bbs.map(use->_idx, b); // Re-insert in this block |
duke@435 | 83 | b->add_inst(use); |
duke@435 | 84 | } |
duke@435 | 85 | } |
duke@435 | 86 | } |
duke@435 | 87 | } |
duke@435 | 88 | |
kvn@1036 | 89 | //----------------------------replace_block_proj_ctrl------------------------- |
kvn@1036 | 90 | // Nodes that have is_block_proj() nodes as their control need to use |
kvn@1036 | 91 | // the appropriate Region for their actual block as their control since |
kvn@1036 | 92 | // the projection will be in a predecessor block. |
kvn@1036 | 93 | void PhaseCFG::replace_block_proj_ctrl( Node *n ) { |
kvn@1036 | 94 | const Node *in0 = n->in(0); |
kvn@1036 | 95 | assert(in0 != NULL, "Only control-dependent"); |
kvn@1036 | 96 | const Node *p = in0->is_block_proj(); |
kvn@1036 | 97 | if (p != NULL && p != n) { // Control from a block projection? |
kvn@3311 | 98 | assert(!n->pinned() || n->is_MachConstantBase(), "only pinned MachConstantBase node is expected here"); |
kvn@1036 | 99 | // Find trailing Region |
kvn@1036 | 100 | Block *pb = _bbs[in0->_idx]; // Block-projection already has basic block |
kvn@1036 | 101 | uint j = 0; |
kvn@1036 | 102 | if (pb->_num_succs != 1) { // More then 1 successor? |
kvn@1036 | 103 | // Search for successor |
kvn@1036 | 104 | uint max = pb->_nodes.size(); |
kvn@1036 | 105 | assert( max > 1, "" ); |
kvn@1036 | 106 | uint start = max - pb->_num_succs; |
kvn@1036 | 107 | // Find which output path belongs to projection |
kvn@1036 | 108 | for (j = start; j < max; j++) { |
kvn@1036 | 109 | if( pb->_nodes[j] == in0 ) |
kvn@1036 | 110 | break; |
kvn@1036 | 111 | } |
kvn@1036 | 112 | assert( j < max, "must find" ); |
kvn@1036 | 113 | // Change control to match head of successor basic block |
kvn@1036 | 114 | j -= start; |
kvn@1036 | 115 | } |
kvn@1036 | 116 | n->set_req(0, pb->_succs[j]->head()); |
kvn@1036 | 117 | } |
kvn@1036 | 118 | } |
kvn@1036 | 119 | |
duke@435 | 120 | |
duke@435 | 121 | //------------------------------schedule_pinned_nodes-------------------------- |
duke@435 | 122 | // Set the basic block for Nodes pinned into blocks |
duke@435 | 123 | void PhaseCFG::schedule_pinned_nodes( VectorSet &visited ) { |
duke@435 | 124 | // Allocate node stack of size C->unique()+8 to avoid frequent realloc |
duke@435 | 125 | GrowableArray <Node *> spstack(C->unique()+8); |
duke@435 | 126 | spstack.push(_root); |
duke@435 | 127 | while ( spstack.is_nonempty() ) { |
duke@435 | 128 | Node *n = spstack.pop(); |
duke@435 | 129 | if( !visited.test_set(n->_idx) ) { // Test node and flag it as visited |
duke@435 | 130 | if( n->pinned() && !_bbs.lookup(n->_idx) ) { // Pinned? Nail it down! |
kvn@1036 | 131 | assert( n->in(0), "pinned Node must have Control" ); |
kvn@1036 | 132 | // Before setting block replace block_proj control edge |
kvn@1036 | 133 | replace_block_proj_ctrl(n); |
duke@435 | 134 | Node *input = n->in(0); |
duke@435 | 135 | while( !input->is_block_start() ) |
duke@435 | 136 | input = input->in(0); |
duke@435 | 137 | Block *b = _bbs[input->_idx]; // Basic block of controlling input |
duke@435 | 138 | schedule_node_into_block(n, b); |
duke@435 | 139 | } |
duke@435 | 140 | for( int i = n->req() - 1; i >= 0; --i ) { // For all inputs |
duke@435 | 141 | if( n->in(i) != NULL ) |
duke@435 | 142 | spstack.push(n->in(i)); |
duke@435 | 143 | } |
duke@435 | 144 | } |
duke@435 | 145 | } |
duke@435 | 146 | } |
duke@435 | 147 | |
duke@435 | 148 | #ifdef ASSERT |
duke@435 | 149 | // Assert that new input b2 is dominated by all previous inputs. |
duke@435 | 150 | // Check this by by seeing that it is dominated by b1, the deepest |
duke@435 | 151 | // input observed until b2. |
duke@435 | 152 | static void assert_dom(Block* b1, Block* b2, Node* n, Block_Array &bbs) { |
duke@435 | 153 | if (b1 == NULL) return; |
duke@435 | 154 | assert(b1->_dom_depth < b2->_dom_depth, "sanity"); |
duke@435 | 155 | Block* tmp = b2; |
duke@435 | 156 | while (tmp != b1 && tmp != NULL) { |
duke@435 | 157 | tmp = tmp->_idom; |
duke@435 | 158 | } |
duke@435 | 159 | if (tmp != b1) { |
duke@435 | 160 | // Detected an unschedulable graph. Print some nice stuff and die. |
duke@435 | 161 | tty->print_cr("!!! Unschedulable graph !!!"); |
duke@435 | 162 | for (uint j=0; j<n->len(); j++) { // For all inputs |
duke@435 | 163 | Node* inn = n->in(j); // Get input |
duke@435 | 164 | if (inn == NULL) continue; // Ignore NULL, missing inputs |
duke@435 | 165 | Block* inb = bbs[inn->_idx]; |
duke@435 | 166 | tty->print("B%d idom=B%d depth=%2d ",inb->_pre_order, |
duke@435 | 167 | inb->_idom ? inb->_idom->_pre_order : 0, inb->_dom_depth); |
duke@435 | 168 | inn->dump(); |
duke@435 | 169 | } |
duke@435 | 170 | tty->print("Failing node: "); |
duke@435 | 171 | n->dump(); |
duke@435 | 172 | assert(false, "unscheduable graph"); |
duke@435 | 173 | } |
duke@435 | 174 | } |
duke@435 | 175 | #endif |
duke@435 | 176 | |
duke@435 | 177 | static Block* find_deepest_input(Node* n, Block_Array &bbs) { |
duke@435 | 178 | // Find the last input dominated by all other inputs. |
duke@435 | 179 | Block* deepb = NULL; // Deepest block so far |
duke@435 | 180 | int deepb_dom_depth = 0; |
duke@435 | 181 | for (uint k = 0; k < n->len(); k++) { // For all inputs |
duke@435 | 182 | Node* inn = n->in(k); // Get input |
duke@435 | 183 | if (inn == NULL) continue; // Ignore NULL, missing inputs |
duke@435 | 184 | Block* inb = bbs[inn->_idx]; |
duke@435 | 185 | assert(inb != NULL, "must already have scheduled this input"); |
duke@435 | 186 | if (deepb_dom_depth < (int) inb->_dom_depth) { |
duke@435 | 187 | // The new inb must be dominated by the previous deepb. |
duke@435 | 188 | // The various inputs must be linearly ordered in the dom |
duke@435 | 189 | // tree, or else there will not be a unique deepest block. |
duke@435 | 190 | DEBUG_ONLY(assert_dom(deepb, inb, n, bbs)); |
duke@435 | 191 | deepb = inb; // Save deepest block |
duke@435 | 192 | deepb_dom_depth = deepb->_dom_depth; |
duke@435 | 193 | } |
duke@435 | 194 | } |
duke@435 | 195 | assert(deepb != NULL, "must be at least one input to n"); |
duke@435 | 196 | return deepb; |
duke@435 | 197 | } |
duke@435 | 198 | |
duke@435 | 199 | |
duke@435 | 200 | //------------------------------schedule_early--------------------------------- |
duke@435 | 201 | // Find the earliest Block any instruction can be placed in. Some instructions |
duke@435 | 202 | // are pinned into Blocks. Unpinned instructions can appear in last block in |
duke@435 | 203 | // which all their inputs occur. |
duke@435 | 204 | bool PhaseCFG::schedule_early(VectorSet &visited, Node_List &roots) { |
duke@435 | 205 | // Allocate stack with enough space to avoid frequent realloc |
duke@435 | 206 | Node_Stack nstack(roots.Size() + 8); // (unique >> 1) + 24 from Java2D stats |
duke@435 | 207 | // roots.push(_root); _root will be processed among C->top() inputs |
duke@435 | 208 | roots.push(C->top()); |
duke@435 | 209 | visited.set(C->top()->_idx); |
duke@435 | 210 | |
duke@435 | 211 | while (roots.size() != 0) { |
duke@435 | 212 | // Use local variables nstack_top_n & nstack_top_i to cache values |
duke@435 | 213 | // on stack's top. |
duke@435 | 214 | Node *nstack_top_n = roots.pop(); |
duke@435 | 215 | uint nstack_top_i = 0; |
duke@435 | 216 | //while_nstack_nonempty: |
duke@435 | 217 | while (true) { |
duke@435 | 218 | // Get parent node and next input's index from stack's top. |
duke@435 | 219 | Node *n = nstack_top_n; |
duke@435 | 220 | uint i = nstack_top_i; |
duke@435 | 221 | |
duke@435 | 222 | if (i == 0) { |
kvn@1036 | 223 | // Fixup some control. Constants without control get attached |
kvn@1036 | 224 | // to root and nodes that use is_block_proj() nodes should be attached |
kvn@1036 | 225 | // to the region that starts their block. |
duke@435 | 226 | const Node *in0 = n->in(0); |
duke@435 | 227 | if (in0 != NULL) { // Control-dependent? |
kvn@1036 | 228 | replace_block_proj_ctrl(n); |
duke@435 | 229 | } else { // n->in(0) == NULL |
duke@435 | 230 | if (n->req() == 1) { // This guy is a constant with NO inputs? |
duke@435 | 231 | n->set_req(0, _root); |
duke@435 | 232 | } |
duke@435 | 233 | } |
duke@435 | 234 | } |
duke@435 | 235 | |
duke@435 | 236 | // First, visit all inputs and force them to get a block. If an |
duke@435 | 237 | // input is already in a block we quit following inputs (to avoid |
duke@435 | 238 | // cycles). Instead we put that Node on a worklist to be handled |
duke@435 | 239 | // later (since IT'S inputs may not have a block yet). |
duke@435 | 240 | bool done = true; // Assume all n's inputs will be processed |
duke@435 | 241 | while (i < n->len()) { // For all inputs |
duke@435 | 242 | Node *in = n->in(i); // Get input |
duke@435 | 243 | ++i; |
duke@435 | 244 | if (in == NULL) continue; // Ignore NULL, missing inputs |
duke@435 | 245 | int is_visited = visited.test_set(in->_idx); |
duke@435 | 246 | if (!_bbs.lookup(in->_idx)) { // Missing block selection? |
duke@435 | 247 | if (is_visited) { |
duke@435 | 248 | // assert( !visited.test(in->_idx), "did not schedule early" ); |
duke@435 | 249 | return false; |
duke@435 | 250 | } |
duke@435 | 251 | nstack.push(n, i); // Save parent node and next input's index. |
duke@435 | 252 | nstack_top_n = in; // Process current input now. |
duke@435 | 253 | nstack_top_i = 0; |
duke@435 | 254 | done = false; // Not all n's inputs processed. |
duke@435 | 255 | break; // continue while_nstack_nonempty; |
duke@435 | 256 | } else if (!is_visited) { // Input not yet visited? |
duke@435 | 257 | roots.push(in); // Visit this guy later, using worklist |
duke@435 | 258 | } |
duke@435 | 259 | } |
duke@435 | 260 | if (done) { |
duke@435 | 261 | // All of n's inputs have been processed, complete post-processing. |
duke@435 | 262 | |
duke@435 | 263 | // Some instructions are pinned into a block. These include Region, |
duke@435 | 264 | // Phi, Start, Return, and other control-dependent instructions and |
duke@435 | 265 | // any projections which depend on them. |
duke@435 | 266 | if (!n->pinned()) { |
duke@435 | 267 | // Set earliest legal block. |
duke@435 | 268 | _bbs.map(n->_idx, find_deepest_input(n, _bbs)); |
kvn@1036 | 269 | } else { |
kvn@1036 | 270 | assert(_bbs[n->_idx] == _bbs[n->in(0)->_idx], "Pinned Node should be at the same block as its control edge"); |
duke@435 | 271 | } |
duke@435 | 272 | |
duke@435 | 273 | if (nstack.is_empty()) { |
duke@435 | 274 | // Finished all nodes on stack. |
duke@435 | 275 | // Process next node on the worklist 'roots'. |
duke@435 | 276 | break; |
duke@435 | 277 | } |
duke@435 | 278 | // Get saved parent node and next input's index. |
duke@435 | 279 | nstack_top_n = nstack.node(); |
duke@435 | 280 | nstack_top_i = nstack.index(); |
duke@435 | 281 | nstack.pop(); |
duke@435 | 282 | } // if (done) |
duke@435 | 283 | } // while (true) |
duke@435 | 284 | } // while (roots.size() != 0) |
duke@435 | 285 | return true; |
duke@435 | 286 | } |
duke@435 | 287 | |
duke@435 | 288 | //------------------------------dom_lca---------------------------------------- |
duke@435 | 289 | // Find least common ancestor in dominator tree |
duke@435 | 290 | // LCA is a current notion of LCA, to be raised above 'this'. |
duke@435 | 291 | // As a convenient boundary condition, return 'this' if LCA is NULL. |
duke@435 | 292 | // Find the LCA of those two nodes. |
duke@435 | 293 | Block* Block::dom_lca(Block* LCA) { |
duke@435 | 294 | if (LCA == NULL || LCA == this) return this; |
duke@435 | 295 | |
duke@435 | 296 | Block* anc = this; |
duke@435 | 297 | while (anc->_dom_depth > LCA->_dom_depth) |
duke@435 | 298 | anc = anc->_idom; // Walk up till anc is as high as LCA |
duke@435 | 299 | |
duke@435 | 300 | while (LCA->_dom_depth > anc->_dom_depth) |
duke@435 | 301 | LCA = LCA->_idom; // Walk up till LCA is as high as anc |
duke@435 | 302 | |
duke@435 | 303 | while (LCA != anc) { // Walk both up till they are the same |
duke@435 | 304 | LCA = LCA->_idom; |
duke@435 | 305 | anc = anc->_idom; |
duke@435 | 306 | } |
duke@435 | 307 | |
duke@435 | 308 | return LCA; |
duke@435 | 309 | } |
duke@435 | 310 | |
duke@435 | 311 | //--------------------------raise_LCA_above_use-------------------------------- |
duke@435 | 312 | // We are placing a definition, and have been given a def->use edge. |
duke@435 | 313 | // The definition must dominate the use, so move the LCA upward in the |
duke@435 | 314 | // dominator tree to dominate the use. If the use is a phi, adjust |
duke@435 | 315 | // the LCA only with the phi input paths which actually use this def. |
duke@435 | 316 | static Block* raise_LCA_above_use(Block* LCA, Node* use, Node* def, Block_Array &bbs) { |
duke@435 | 317 | Block* buse = bbs[use->_idx]; |
duke@435 | 318 | if (buse == NULL) return LCA; // Unused killing Projs have no use block |
duke@435 | 319 | if (!use->is_Phi()) return buse->dom_lca(LCA); |
duke@435 | 320 | uint pmax = use->req(); // Number of Phi inputs |
duke@435 | 321 | // Why does not this loop just break after finding the matching input to |
duke@435 | 322 | // the Phi? Well...it's like this. I do not have true def-use/use-def |
duke@435 | 323 | // chains. Means I cannot distinguish, from the def-use direction, which |
duke@435 | 324 | // of many use-defs lead from the same use to the same def. That is, this |
duke@435 | 325 | // Phi might have several uses of the same def. Each use appears in a |
duke@435 | 326 | // different predecessor block. But when I enter here, I cannot distinguish |
duke@435 | 327 | // which use-def edge I should find the predecessor block for. So I find |
duke@435 | 328 | // them all. Means I do a little extra work if a Phi uses the same value |
duke@435 | 329 | // more than once. |
duke@435 | 330 | for (uint j=1; j<pmax; j++) { // For all inputs |
duke@435 | 331 | if (use->in(j) == def) { // Found matching input? |
duke@435 | 332 | Block* pred = bbs[buse->pred(j)->_idx]; |
duke@435 | 333 | LCA = pred->dom_lca(LCA); |
duke@435 | 334 | } |
duke@435 | 335 | } |
duke@435 | 336 | return LCA; |
duke@435 | 337 | } |
duke@435 | 338 | |
duke@435 | 339 | //----------------------------raise_LCA_above_marks---------------------------- |
duke@435 | 340 | // Return a new LCA that dominates LCA and any of its marked predecessors. |
duke@435 | 341 | // Search all my parents up to 'early' (exclusive), looking for predecessors |
duke@435 | 342 | // which are marked with the given index. Return the LCA (in the dom tree) |
duke@435 | 343 | // of all marked blocks. If there are none marked, return the original |
duke@435 | 344 | // LCA. |
duke@435 | 345 | static Block* raise_LCA_above_marks(Block* LCA, node_idx_t mark, |
duke@435 | 346 | Block* early, Block_Array &bbs) { |
duke@435 | 347 | Block_List worklist; |
duke@435 | 348 | worklist.push(LCA); |
duke@435 | 349 | while (worklist.size() > 0) { |
duke@435 | 350 | Block* mid = worklist.pop(); |
duke@435 | 351 | if (mid == early) continue; // stop searching here |
duke@435 | 352 | |
duke@435 | 353 | // Test and set the visited bit. |
duke@435 | 354 | if (mid->raise_LCA_visited() == mark) continue; // already visited |
duke@435 | 355 | |
duke@435 | 356 | // Don't process the current LCA, otherwise the search may terminate early |
duke@435 | 357 | if (mid != LCA && mid->raise_LCA_mark() == mark) { |
duke@435 | 358 | // Raise the LCA. |
duke@435 | 359 | LCA = mid->dom_lca(LCA); |
duke@435 | 360 | if (LCA == early) break; // stop searching everywhere |
duke@435 | 361 | assert(early->dominates(LCA), "early is high enough"); |
duke@435 | 362 | // Resume searching at that point, skipping intermediate levels. |
duke@435 | 363 | worklist.push(LCA); |
kvn@650 | 364 | if (LCA == mid) |
kvn@650 | 365 | continue; // Don't mark as visited to avoid early termination. |
duke@435 | 366 | } else { |
duke@435 | 367 | // Keep searching through this block's predecessors. |
duke@435 | 368 | for (uint j = 1, jmax = mid->num_preds(); j < jmax; j++) { |
duke@435 | 369 | Block* mid_parent = bbs[ mid->pred(j)->_idx ]; |
duke@435 | 370 | worklist.push(mid_parent); |
duke@435 | 371 | } |
duke@435 | 372 | } |
kvn@650 | 373 | mid->set_raise_LCA_visited(mark); |
duke@435 | 374 | } |
duke@435 | 375 | return LCA; |
duke@435 | 376 | } |
duke@435 | 377 | |
duke@435 | 378 | //--------------------------memory_early_block-------------------------------- |
duke@435 | 379 | // This is a variation of find_deepest_input, the heart of schedule_early. |
duke@435 | 380 | // Find the "early" block for a load, if we considered only memory and |
duke@435 | 381 | // address inputs, that is, if other data inputs were ignored. |
duke@435 | 382 | // |
duke@435 | 383 | // Because a subset of edges are considered, the resulting block will |
duke@435 | 384 | // be earlier (at a shallower dom_depth) than the true schedule_early |
duke@435 | 385 | // point of the node. We compute this earlier block as a more permissive |
duke@435 | 386 | // site for anti-dependency insertion, but only if subsume_loads is enabled. |
duke@435 | 387 | static Block* memory_early_block(Node* load, Block* early, Block_Array &bbs) { |
duke@435 | 388 | Node* base; |
duke@435 | 389 | Node* index; |
duke@435 | 390 | Node* store = load->in(MemNode::Memory); |
duke@435 | 391 | load->as_Mach()->memory_inputs(base, index); |
duke@435 | 392 | |
duke@435 | 393 | assert(base != NodeSentinel && index != NodeSentinel, |
duke@435 | 394 | "unexpected base/index inputs"); |
duke@435 | 395 | |
duke@435 | 396 | Node* mem_inputs[4]; |
duke@435 | 397 | int mem_inputs_length = 0; |
duke@435 | 398 | if (base != NULL) mem_inputs[mem_inputs_length++] = base; |
duke@435 | 399 | if (index != NULL) mem_inputs[mem_inputs_length++] = index; |
duke@435 | 400 | if (store != NULL) mem_inputs[mem_inputs_length++] = store; |
duke@435 | 401 | |
duke@435 | 402 | // In the comparision below, add one to account for the control input, |
duke@435 | 403 | // which may be null, but always takes up a spot in the in array. |
duke@435 | 404 | if (mem_inputs_length + 1 < (int) load->req()) { |
duke@435 | 405 | // This "load" has more inputs than just the memory, base and index inputs. |
duke@435 | 406 | // For purposes of checking anti-dependences, we need to start |
duke@435 | 407 | // from the early block of only the address portion of the instruction, |
duke@435 | 408 | // and ignore other blocks that may have factored into the wider |
duke@435 | 409 | // schedule_early calculation. |
duke@435 | 410 | if (load->in(0) != NULL) mem_inputs[mem_inputs_length++] = load->in(0); |
duke@435 | 411 | |
duke@435 | 412 | Block* deepb = NULL; // Deepest block so far |
duke@435 | 413 | int deepb_dom_depth = 0; |
duke@435 | 414 | for (int i = 0; i < mem_inputs_length; i++) { |
duke@435 | 415 | Block* inb = bbs[mem_inputs[i]->_idx]; |
duke@435 | 416 | if (deepb_dom_depth < (int) inb->_dom_depth) { |
duke@435 | 417 | // The new inb must be dominated by the previous deepb. |
duke@435 | 418 | // The various inputs must be linearly ordered in the dom |
duke@435 | 419 | // tree, or else there will not be a unique deepest block. |
duke@435 | 420 | DEBUG_ONLY(assert_dom(deepb, inb, load, bbs)); |
duke@435 | 421 | deepb = inb; // Save deepest block |
duke@435 | 422 | deepb_dom_depth = deepb->_dom_depth; |
duke@435 | 423 | } |
duke@435 | 424 | } |
duke@435 | 425 | early = deepb; |
duke@435 | 426 | } |
duke@435 | 427 | |
duke@435 | 428 | return early; |
duke@435 | 429 | } |
duke@435 | 430 | |
duke@435 | 431 | //--------------------------insert_anti_dependences--------------------------- |
duke@435 | 432 | // A load may need to witness memory that nearby stores can overwrite. |
duke@435 | 433 | // For each nearby store, either insert an "anti-dependence" edge |
duke@435 | 434 | // from the load to the store, or else move LCA upward to force the |
duke@435 | 435 | // load to (eventually) be scheduled in a block above the store. |
duke@435 | 436 | // |
duke@435 | 437 | // Do not add edges to stores on distinct control-flow paths; |
duke@435 | 438 | // only add edges to stores which might interfere. |
duke@435 | 439 | // |
duke@435 | 440 | // Return the (updated) LCA. There will not be any possibly interfering |
duke@435 | 441 | // store between the load's "early block" and the updated LCA. |
duke@435 | 442 | // Any stores in the updated LCA will have new precedence edges |
duke@435 | 443 | // back to the load. The caller is expected to schedule the load |
duke@435 | 444 | // in the LCA, in which case the precedence edges will make LCM |
duke@435 | 445 | // preserve anti-dependences. The caller may also hoist the load |
duke@435 | 446 | // above the LCA, if it is not the early block. |
duke@435 | 447 | Block* PhaseCFG::insert_anti_dependences(Block* LCA, Node* load, bool verify) { |
duke@435 | 448 | assert(load->needs_anti_dependence_check(), "must be a load of some sort"); |
duke@435 | 449 | assert(LCA != NULL, ""); |
duke@435 | 450 | DEBUG_ONLY(Block* LCA_orig = LCA); |
duke@435 | 451 | |
duke@435 | 452 | // Compute the alias index. Loads and stores with different alias indices |
duke@435 | 453 | // do not need anti-dependence edges. |
duke@435 | 454 | uint load_alias_idx = C->get_alias_index(load->adr_type()); |
duke@435 | 455 | #ifdef ASSERT |
duke@435 | 456 | if (load_alias_idx == Compile::AliasIdxBot && C->AliasLevel() > 0 && |
duke@435 | 457 | (PrintOpto || VerifyAliases || |
duke@435 | 458 | PrintMiscellaneous && (WizardMode || Verbose))) { |
duke@435 | 459 | // Load nodes should not consume all of memory. |
duke@435 | 460 | // Reporting a bottom type indicates a bug in adlc. |
duke@435 | 461 | // If some particular type of node validly consumes all of memory, |
duke@435 | 462 | // sharpen the preceding "if" to exclude it, so we can catch bugs here. |
duke@435 | 463 | tty->print_cr("*** Possible Anti-Dependence Bug: Load consumes all of memory."); |
duke@435 | 464 | load->dump(2); |
duke@435 | 465 | if (VerifyAliases) assert(load_alias_idx != Compile::AliasIdxBot, ""); |
duke@435 | 466 | } |
duke@435 | 467 | #endif |
duke@435 | 468 | assert(load_alias_idx || (load->is_Mach() && load->as_Mach()->ideal_Opcode() == Op_StrComp), |
duke@435 | 469 | "String compare is only known 'load' that does not conflict with any stores"); |
cfang@1116 | 470 | assert(load_alias_idx || (load->is_Mach() && load->as_Mach()->ideal_Opcode() == Op_StrEquals), |
cfang@1116 | 471 | "String equals is a 'load' that does not conflict with any stores"); |
cfang@1116 | 472 | assert(load_alias_idx || (load->is_Mach() && load->as_Mach()->ideal_Opcode() == Op_StrIndexOf), |
cfang@1116 | 473 | "String indexOf is a 'load' that does not conflict with any stores"); |
cfang@1116 | 474 | assert(load_alias_idx || (load->is_Mach() && load->as_Mach()->ideal_Opcode() == Op_AryEq), |
cfang@1116 | 475 | "Arrays equals is a 'load' that do not conflict with any stores"); |
duke@435 | 476 | |
duke@435 | 477 | if (!C->alias_type(load_alias_idx)->is_rewritable()) { |
duke@435 | 478 | // It is impossible to spoil this load by putting stores before it, |
duke@435 | 479 | // because we know that the stores will never update the value |
duke@435 | 480 | // which 'load' must witness. |
duke@435 | 481 | return LCA; |
duke@435 | 482 | } |
duke@435 | 483 | |
duke@435 | 484 | node_idx_t load_index = load->_idx; |
duke@435 | 485 | |
duke@435 | 486 | // Note the earliest legal placement of 'load', as determined by |
duke@435 | 487 | // by the unique point in the dom tree where all memory effects |
duke@435 | 488 | // and other inputs are first available. (Computed by schedule_early.) |
duke@435 | 489 | // For normal loads, 'early' is the shallowest place (dom graph wise) |
duke@435 | 490 | // to look for anti-deps between this load and any store. |
duke@435 | 491 | Block* early = _bbs[load_index]; |
duke@435 | 492 | |
duke@435 | 493 | // If we are subsuming loads, compute an "early" block that only considers |
duke@435 | 494 | // memory or address inputs. This block may be different than the |
duke@435 | 495 | // schedule_early block in that it could be at an even shallower depth in the |
duke@435 | 496 | // dominator tree, and allow for a broader discovery of anti-dependences. |
duke@435 | 497 | if (C->subsume_loads()) { |
duke@435 | 498 | early = memory_early_block(load, early, _bbs); |
duke@435 | 499 | } |
duke@435 | 500 | |
duke@435 | 501 | ResourceArea *area = Thread::current()->resource_area(); |
duke@435 | 502 | Node_List worklist_mem(area); // prior memory state to store |
duke@435 | 503 | Node_List worklist_store(area); // possible-def to explore |
kvn@466 | 504 | Node_List worklist_visited(area); // visited mergemem nodes |
duke@435 | 505 | Node_List non_early_stores(area); // all relevant stores outside of early |
duke@435 | 506 | bool must_raise_LCA = false; |
duke@435 | 507 | |
duke@435 | 508 | #ifdef TRACK_PHI_INPUTS |
duke@435 | 509 | // %%% This extra checking fails because MergeMem nodes are not GVNed. |
duke@435 | 510 | // Provide "phi_inputs" to check if every input to a PhiNode is from the |
duke@435 | 511 | // original memory state. This indicates a PhiNode for which should not |
duke@435 | 512 | // prevent the load from sinking. For such a block, set_raise_LCA_mark |
duke@435 | 513 | // may be overly conservative. |
duke@435 | 514 | // Mechanism: count inputs seen for each Phi encountered in worklist_store. |
duke@435 | 515 | DEBUG_ONLY(GrowableArray<uint> phi_inputs(area, C->unique(),0,0)); |
duke@435 | 516 | #endif |
duke@435 | 517 | |
duke@435 | 518 | // 'load' uses some memory state; look for users of the same state. |
duke@435 | 519 | // Recurse through MergeMem nodes to the stores that use them. |
duke@435 | 520 | |
duke@435 | 521 | // Each of these stores is a possible definition of memory |
duke@435 | 522 | // that 'load' needs to use. We need to force 'load' |
duke@435 | 523 | // to occur before each such store. When the store is in |
duke@435 | 524 | // the same block as 'load', we insert an anti-dependence |
duke@435 | 525 | // edge load->store. |
duke@435 | 526 | |
duke@435 | 527 | // The relevant stores "nearby" the load consist of a tree rooted |
duke@435 | 528 | // at initial_mem, with internal nodes of type MergeMem. |
duke@435 | 529 | // Therefore, the branches visited by the worklist are of this form: |
duke@435 | 530 | // initial_mem -> (MergeMem ->)* store |
duke@435 | 531 | // The anti-dependence constraints apply only to the fringe of this tree. |
duke@435 | 532 | |
duke@435 | 533 | Node* initial_mem = load->in(MemNode::Memory); |
duke@435 | 534 | worklist_store.push(initial_mem); |
kvn@466 | 535 | worklist_visited.push(initial_mem); |
duke@435 | 536 | worklist_mem.push(NULL); |
duke@435 | 537 | while (worklist_store.size() > 0) { |
duke@435 | 538 | // Examine a nearby store to see if it might interfere with our load. |
duke@435 | 539 | Node* mem = worklist_mem.pop(); |
duke@435 | 540 | Node* store = worklist_store.pop(); |
duke@435 | 541 | uint op = store->Opcode(); |
duke@435 | 542 | |
duke@435 | 543 | // MergeMems do not directly have anti-deps. |
duke@435 | 544 | // Treat them as internal nodes in a forward tree of memory states, |
duke@435 | 545 | // the leaves of which are each a 'possible-def'. |
duke@435 | 546 | if (store == initial_mem // root (exclusive) of tree we are searching |
duke@435 | 547 | || op == Op_MergeMem // internal node of tree we are searching |
duke@435 | 548 | ) { |
duke@435 | 549 | mem = store; // It's not a possibly interfering store. |
kvn@466 | 550 | if (store == initial_mem) |
kvn@466 | 551 | initial_mem = NULL; // only process initial memory once |
kvn@466 | 552 | |
duke@435 | 553 | for (DUIterator_Fast imax, i = mem->fast_outs(imax); i < imax; i++) { |
duke@435 | 554 | store = mem->fast_out(i); |
duke@435 | 555 | if (store->is_MergeMem()) { |
duke@435 | 556 | // Be sure we don't get into combinatorial problems. |
duke@435 | 557 | // (Allow phis to be repeated; they can merge two relevant states.) |
kvn@466 | 558 | uint j = worklist_visited.size(); |
kvn@466 | 559 | for (; j > 0; j--) { |
kvn@466 | 560 | if (worklist_visited.at(j-1) == store) break; |
duke@435 | 561 | } |
kvn@466 | 562 | if (j > 0) continue; // already on work list; do not repeat |
kvn@466 | 563 | worklist_visited.push(store); |
duke@435 | 564 | } |
duke@435 | 565 | worklist_mem.push(mem); |
duke@435 | 566 | worklist_store.push(store); |
duke@435 | 567 | } |
duke@435 | 568 | continue; |
duke@435 | 569 | } |
duke@435 | 570 | |
duke@435 | 571 | if (op == Op_MachProj || op == Op_Catch) continue; |
duke@435 | 572 | if (store->needs_anti_dependence_check()) continue; // not really a store |
duke@435 | 573 | |
duke@435 | 574 | // Compute the alias index. Loads and stores with different alias |
duke@435 | 575 | // indices do not need anti-dependence edges. Wide MemBar's are |
duke@435 | 576 | // anti-dependent on everything (except immutable memories). |
duke@435 | 577 | const TypePtr* adr_type = store->adr_type(); |
duke@435 | 578 | if (!C->can_alias(adr_type, load_alias_idx)) continue; |
duke@435 | 579 | |
duke@435 | 580 | // Most slow-path runtime calls do NOT modify Java memory, but |
duke@435 | 581 | // they can block and so write Raw memory. |
duke@435 | 582 | if (store->is_Mach()) { |
duke@435 | 583 | MachNode* mstore = store->as_Mach(); |
duke@435 | 584 | if (load_alias_idx != Compile::AliasIdxRaw) { |
duke@435 | 585 | // Check for call into the runtime using the Java calling |
duke@435 | 586 | // convention (and from there into a wrapper); it has no |
duke@435 | 587 | // _method. Can't do this optimization for Native calls because |
duke@435 | 588 | // they CAN write to Java memory. |
duke@435 | 589 | if (mstore->ideal_Opcode() == Op_CallStaticJava) { |
duke@435 | 590 | assert(mstore->is_MachSafePoint(), ""); |
duke@435 | 591 | MachSafePointNode* ms = (MachSafePointNode*) mstore; |
duke@435 | 592 | assert(ms->is_MachCallJava(), ""); |
duke@435 | 593 | MachCallJavaNode* mcj = (MachCallJavaNode*) ms; |
duke@435 | 594 | if (mcj->_method == NULL) { |
duke@435 | 595 | // These runtime calls do not write to Java visible memory |
duke@435 | 596 | // (other than Raw) and so do not require anti-dependence edges. |
duke@435 | 597 | continue; |
duke@435 | 598 | } |
duke@435 | 599 | } |
duke@435 | 600 | // Same for SafePoints: they read/write Raw but only read otherwise. |
duke@435 | 601 | // This is basically a workaround for SafePoints only defining control |
duke@435 | 602 | // instead of control + memory. |
duke@435 | 603 | if (mstore->ideal_Opcode() == Op_SafePoint) |
duke@435 | 604 | continue; |
duke@435 | 605 | } else { |
duke@435 | 606 | // Some raw memory, such as the load of "top" at an allocation, |
duke@435 | 607 | // can be control dependent on the previous safepoint. See |
duke@435 | 608 | // comments in GraphKit::allocate_heap() about control input. |
duke@435 | 609 | // Inserting an anti-dep between such a safepoint and a use |
duke@435 | 610 | // creates a cycle, and will cause a subsequent failure in |
duke@435 | 611 | // local scheduling. (BugId 4919904) |
duke@435 | 612 | // (%%% How can a control input be a safepoint and not a projection??) |
duke@435 | 613 | if (mstore->ideal_Opcode() == Op_SafePoint && load->in(0) == mstore) |
duke@435 | 614 | continue; |
duke@435 | 615 | } |
duke@435 | 616 | } |
duke@435 | 617 | |
duke@435 | 618 | // Identify a block that the current load must be above, |
duke@435 | 619 | // or else observe that 'store' is all the way up in the |
duke@435 | 620 | // earliest legal block for 'load'. In the latter case, |
duke@435 | 621 | // immediately insert an anti-dependence edge. |
duke@435 | 622 | Block* store_block = _bbs[store->_idx]; |
duke@435 | 623 | assert(store_block != NULL, "unused killing projections skipped above"); |
duke@435 | 624 | |
duke@435 | 625 | if (store->is_Phi()) { |
duke@435 | 626 | // 'load' uses memory which is one (or more) of the Phi's inputs. |
duke@435 | 627 | // It must be scheduled not before the Phi, but rather before |
duke@435 | 628 | // each of the relevant Phi inputs. |
duke@435 | 629 | // |
duke@435 | 630 | // Instead of finding the LCA of all inputs to a Phi that match 'mem', |
duke@435 | 631 | // we mark each corresponding predecessor block and do a combined |
duke@435 | 632 | // hoisting operation later (raise_LCA_above_marks). |
duke@435 | 633 | // |
duke@435 | 634 | // Do not assert(store_block != early, "Phi merging memory after access") |
duke@435 | 635 | // PhiNode may be at start of block 'early' with backedge to 'early' |
duke@435 | 636 | DEBUG_ONLY(bool found_match = false); |
duke@435 | 637 | for (uint j = PhiNode::Input, jmax = store->req(); j < jmax; j++) { |
duke@435 | 638 | if (store->in(j) == mem) { // Found matching input? |
duke@435 | 639 | DEBUG_ONLY(found_match = true); |
duke@435 | 640 | Block* pred_block = _bbs[store_block->pred(j)->_idx]; |
duke@435 | 641 | if (pred_block != early) { |
duke@435 | 642 | // If any predecessor of the Phi matches the load's "early block", |
duke@435 | 643 | // we do not need a precedence edge between the Phi and 'load' |
twisti@1040 | 644 | // since the load will be forced into a block preceding the Phi. |
duke@435 | 645 | pred_block->set_raise_LCA_mark(load_index); |
duke@435 | 646 | assert(!LCA_orig->dominates(pred_block) || |
duke@435 | 647 | early->dominates(pred_block), "early is high enough"); |
duke@435 | 648 | must_raise_LCA = true; |
kvn@1223 | 649 | } else { |
kvn@1223 | 650 | // anti-dependent upon PHI pinned below 'early', no edge needed |
kvn@1223 | 651 | LCA = early; // but can not schedule below 'early' |
duke@435 | 652 | } |
duke@435 | 653 | } |
duke@435 | 654 | } |
duke@435 | 655 | assert(found_match, "no worklist bug"); |
duke@435 | 656 | #ifdef TRACK_PHI_INPUTS |
duke@435 | 657 | #ifdef ASSERT |
duke@435 | 658 | // This assert asks about correct handling of PhiNodes, which may not |
duke@435 | 659 | // have all input edges directly from 'mem'. See BugId 4621264 |
duke@435 | 660 | int num_mem_inputs = phi_inputs.at_grow(store->_idx,0) + 1; |
duke@435 | 661 | // Increment by exactly one even if there are multiple copies of 'mem' |
duke@435 | 662 | // coming into the phi, because we will run this block several times |
duke@435 | 663 | // if there are several copies of 'mem'. (That's how DU iterators work.) |
duke@435 | 664 | phi_inputs.at_put(store->_idx, num_mem_inputs); |
duke@435 | 665 | assert(PhiNode::Input + num_mem_inputs < store->req(), |
duke@435 | 666 | "Expect at least one phi input will not be from original memory state"); |
duke@435 | 667 | #endif //ASSERT |
duke@435 | 668 | #endif //TRACK_PHI_INPUTS |
duke@435 | 669 | } else if (store_block != early) { |
duke@435 | 670 | // 'store' is between the current LCA and earliest possible block. |
duke@435 | 671 | // Label its block, and decide later on how to raise the LCA |
duke@435 | 672 | // to include the effect on LCA of this store. |
duke@435 | 673 | // If this store's block gets chosen as the raised LCA, we |
duke@435 | 674 | // will find him on the non_early_stores list and stick him |
duke@435 | 675 | // with a precedence edge. |
duke@435 | 676 | // (But, don't bother if LCA is already raised all the way.) |
duke@435 | 677 | if (LCA != early) { |
duke@435 | 678 | store_block->set_raise_LCA_mark(load_index); |
duke@435 | 679 | must_raise_LCA = true; |
duke@435 | 680 | non_early_stores.push(store); |
duke@435 | 681 | } |
duke@435 | 682 | } else { |
duke@435 | 683 | // Found a possibly-interfering store in the load's 'early' block. |
duke@435 | 684 | // This means 'load' cannot sink at all in the dominator tree. |
duke@435 | 685 | // Add an anti-dep edge, and squeeze 'load' into the highest block. |
duke@435 | 686 | assert(store != load->in(0), "dependence cycle found"); |
duke@435 | 687 | if (verify) { |
duke@435 | 688 | assert(store->find_edge(load) != -1, "missing precedence edge"); |
duke@435 | 689 | } else { |
duke@435 | 690 | store->add_prec(load); |
duke@435 | 691 | } |
duke@435 | 692 | LCA = early; |
duke@435 | 693 | // This turns off the process of gathering non_early_stores. |
duke@435 | 694 | } |
duke@435 | 695 | } |
duke@435 | 696 | // (Worklist is now empty; all nearby stores have been visited.) |
duke@435 | 697 | |
duke@435 | 698 | // Finished if 'load' must be scheduled in its 'early' block. |
duke@435 | 699 | // If we found any stores there, they have already been given |
duke@435 | 700 | // precedence edges. |
duke@435 | 701 | if (LCA == early) return LCA; |
duke@435 | 702 | |
duke@435 | 703 | // We get here only if there are no possibly-interfering stores |
duke@435 | 704 | // in the load's 'early' block. Move LCA up above all predecessors |
duke@435 | 705 | // which contain stores we have noted. |
duke@435 | 706 | // |
duke@435 | 707 | // The raised LCA block can be a home to such interfering stores, |
duke@435 | 708 | // but its predecessors must not contain any such stores. |
duke@435 | 709 | // |
duke@435 | 710 | // The raised LCA will be a lower bound for placing the load, |
duke@435 | 711 | // preventing the load from sinking past any block containing |
duke@435 | 712 | // a store that may invalidate the memory state required by 'load'. |
duke@435 | 713 | if (must_raise_LCA) |
duke@435 | 714 | LCA = raise_LCA_above_marks(LCA, load->_idx, early, _bbs); |
duke@435 | 715 | if (LCA == early) return LCA; |
duke@435 | 716 | |
duke@435 | 717 | // Insert anti-dependence edges from 'load' to each store |
duke@435 | 718 | // in the non-early LCA block. |
duke@435 | 719 | // Mine the non_early_stores list for such stores. |
duke@435 | 720 | if (LCA->raise_LCA_mark() == load_index) { |
duke@435 | 721 | while (non_early_stores.size() > 0) { |
duke@435 | 722 | Node* store = non_early_stores.pop(); |
duke@435 | 723 | Block* store_block = _bbs[store->_idx]; |
duke@435 | 724 | if (store_block == LCA) { |
duke@435 | 725 | // add anti_dependence from store to load in its own block |
duke@435 | 726 | assert(store != load->in(0), "dependence cycle found"); |
duke@435 | 727 | if (verify) { |
duke@435 | 728 | assert(store->find_edge(load) != -1, "missing precedence edge"); |
duke@435 | 729 | } else { |
duke@435 | 730 | store->add_prec(load); |
duke@435 | 731 | } |
duke@435 | 732 | } else { |
duke@435 | 733 | assert(store_block->raise_LCA_mark() == load_index, "block was marked"); |
duke@435 | 734 | // Any other stores we found must be either inside the new LCA |
duke@435 | 735 | // or else outside the original LCA. In the latter case, they |
duke@435 | 736 | // did not interfere with any use of 'load'. |
duke@435 | 737 | assert(LCA->dominates(store_block) |
duke@435 | 738 | || !LCA_orig->dominates(store_block), "no stray stores"); |
duke@435 | 739 | } |
duke@435 | 740 | } |
duke@435 | 741 | } |
duke@435 | 742 | |
duke@435 | 743 | // Return the highest block containing stores; any stores |
duke@435 | 744 | // within that block have been given anti-dependence edges. |
duke@435 | 745 | return LCA; |
duke@435 | 746 | } |
duke@435 | 747 | |
duke@435 | 748 | // This class is used to iterate backwards over the nodes in the graph. |
duke@435 | 749 | |
duke@435 | 750 | class Node_Backward_Iterator { |
duke@435 | 751 | |
duke@435 | 752 | private: |
duke@435 | 753 | Node_Backward_Iterator(); |
duke@435 | 754 | |
duke@435 | 755 | public: |
duke@435 | 756 | // Constructor for the iterator |
duke@435 | 757 | Node_Backward_Iterator(Node *root, VectorSet &visited, Node_List &stack, Block_Array &bbs); |
duke@435 | 758 | |
duke@435 | 759 | // Postincrement operator to iterate over the nodes |
duke@435 | 760 | Node *next(); |
duke@435 | 761 | |
duke@435 | 762 | private: |
duke@435 | 763 | VectorSet &_visited; |
duke@435 | 764 | Node_List &_stack; |
duke@435 | 765 | Block_Array &_bbs; |
duke@435 | 766 | }; |
duke@435 | 767 | |
duke@435 | 768 | // Constructor for the Node_Backward_Iterator |
duke@435 | 769 | Node_Backward_Iterator::Node_Backward_Iterator( Node *root, VectorSet &visited, Node_List &stack, Block_Array &bbs ) |
duke@435 | 770 | : _visited(visited), _stack(stack), _bbs(bbs) { |
duke@435 | 771 | // The stack should contain exactly the root |
duke@435 | 772 | stack.clear(); |
duke@435 | 773 | stack.push(root); |
duke@435 | 774 | |
duke@435 | 775 | // Clear the visited bits |
duke@435 | 776 | visited.Clear(); |
duke@435 | 777 | } |
duke@435 | 778 | |
duke@435 | 779 | // Iterator for the Node_Backward_Iterator |
duke@435 | 780 | Node *Node_Backward_Iterator::next() { |
duke@435 | 781 | |
duke@435 | 782 | // If the _stack is empty, then just return NULL: finished. |
duke@435 | 783 | if ( !_stack.size() ) |
duke@435 | 784 | return NULL; |
duke@435 | 785 | |
duke@435 | 786 | // '_stack' is emulating a real _stack. The 'visit-all-users' loop has been |
duke@435 | 787 | // made stateless, so I do not need to record the index 'i' on my _stack. |
duke@435 | 788 | // Instead I visit all users each time, scanning for unvisited users. |
duke@435 | 789 | // I visit unvisited not-anti-dependence users first, then anti-dependent |
duke@435 | 790 | // children next. |
duke@435 | 791 | Node *self = _stack.pop(); |
duke@435 | 792 | |
duke@435 | 793 | // I cycle here when I am entering a deeper level of recursion. |
duke@435 | 794 | // The key variable 'self' was set prior to jumping here. |
duke@435 | 795 | while( 1 ) { |
duke@435 | 796 | |
duke@435 | 797 | _visited.set(self->_idx); |
duke@435 | 798 | |
duke@435 | 799 | // Now schedule all uses as late as possible. |
duke@435 | 800 | uint src = self->is_Proj() ? self->in(0)->_idx : self->_idx; |
duke@435 | 801 | uint src_rpo = _bbs[src]->_rpo; |
duke@435 | 802 | |
duke@435 | 803 | // Schedule all nodes in a post-order visit |
duke@435 | 804 | Node *unvisited = NULL; // Unvisited anti-dependent Node, if any |
duke@435 | 805 | |
duke@435 | 806 | // Scan for unvisited nodes |
duke@435 | 807 | for (DUIterator_Fast imax, i = self->fast_outs(imax); i < imax; i++) { |
duke@435 | 808 | // For all uses, schedule late |
duke@435 | 809 | Node* n = self->fast_out(i); // Use |
duke@435 | 810 | |
duke@435 | 811 | // Skip already visited children |
duke@435 | 812 | if ( _visited.test(n->_idx) ) |
duke@435 | 813 | continue; |
duke@435 | 814 | |
duke@435 | 815 | // do not traverse backward control edges |
duke@435 | 816 | Node *use = n->is_Proj() ? n->in(0) : n; |
duke@435 | 817 | uint use_rpo = _bbs[use->_idx]->_rpo; |
duke@435 | 818 | |
duke@435 | 819 | if ( use_rpo < src_rpo ) |
duke@435 | 820 | continue; |
duke@435 | 821 | |
duke@435 | 822 | // Phi nodes always precede uses in a basic block |
duke@435 | 823 | if ( use_rpo == src_rpo && use->is_Phi() ) |
duke@435 | 824 | continue; |
duke@435 | 825 | |
duke@435 | 826 | unvisited = n; // Found unvisited |
duke@435 | 827 | |
duke@435 | 828 | // Check for possible-anti-dependent |
duke@435 | 829 | if( !n->needs_anti_dependence_check() ) |
duke@435 | 830 | break; // Not visited, not anti-dep; schedule it NOW |
duke@435 | 831 | } |
duke@435 | 832 | |
duke@435 | 833 | // Did I find an unvisited not-anti-dependent Node? |
duke@435 | 834 | if ( !unvisited ) |
duke@435 | 835 | break; // All done with children; post-visit 'self' |
duke@435 | 836 | |
duke@435 | 837 | // Visit the unvisited Node. Contains the obvious push to |
duke@435 | 838 | // indicate I'm entering a deeper level of recursion. I push the |
duke@435 | 839 | // old state onto the _stack and set a new state and loop (recurse). |
duke@435 | 840 | _stack.push(self); |
duke@435 | 841 | self = unvisited; |
duke@435 | 842 | } // End recursion loop |
duke@435 | 843 | |
duke@435 | 844 | return self; |
duke@435 | 845 | } |
duke@435 | 846 | |
duke@435 | 847 | //------------------------------ComputeLatenciesBackwards---------------------- |
duke@435 | 848 | // Compute the latency of all the instructions. |
duke@435 | 849 | void PhaseCFG::ComputeLatenciesBackwards(VectorSet &visited, Node_List &stack) { |
duke@435 | 850 | #ifndef PRODUCT |
duke@435 | 851 | if (trace_opto_pipelining()) |
duke@435 | 852 | tty->print("\n#---- ComputeLatenciesBackwards ----\n"); |
duke@435 | 853 | #endif |
duke@435 | 854 | |
duke@435 | 855 | Node_Backward_Iterator iter((Node *)_root, visited, stack, _bbs); |
duke@435 | 856 | Node *n; |
duke@435 | 857 | |
duke@435 | 858 | // Walk over all the nodes from last to first |
duke@435 | 859 | while (n = iter.next()) { |
duke@435 | 860 | // Set the latency for the definitions of this instruction |
duke@435 | 861 | partial_latency_of_defs(n); |
duke@435 | 862 | } |
duke@435 | 863 | } // end ComputeLatenciesBackwards |
duke@435 | 864 | |
duke@435 | 865 | //------------------------------partial_latency_of_defs------------------------ |
duke@435 | 866 | // Compute the latency impact of this node on all defs. This computes |
duke@435 | 867 | // a number that increases as we approach the beginning of the routine. |
duke@435 | 868 | void PhaseCFG::partial_latency_of_defs(Node *n) { |
duke@435 | 869 | // Set the latency for this instruction |
duke@435 | 870 | #ifndef PRODUCT |
duke@435 | 871 | if (trace_opto_pipelining()) { |
duke@435 | 872 | tty->print("# latency_to_inputs: node_latency[%d] = %d for node", |
kvn@2040 | 873 | n->_idx, _node_latency->at_grow(n->_idx)); |
duke@435 | 874 | dump(); |
duke@435 | 875 | } |
duke@435 | 876 | #endif |
duke@435 | 877 | |
duke@435 | 878 | if (n->is_Proj()) |
duke@435 | 879 | n = n->in(0); |
duke@435 | 880 | |
duke@435 | 881 | if (n->is_Root()) |
duke@435 | 882 | return; |
duke@435 | 883 | |
duke@435 | 884 | uint nlen = n->len(); |
kvn@2040 | 885 | uint use_latency = _node_latency->at_grow(n->_idx); |
duke@435 | 886 | uint use_pre_order = _bbs[n->_idx]->_pre_order; |
duke@435 | 887 | |
duke@435 | 888 | for ( uint j=0; j<nlen; j++ ) { |
duke@435 | 889 | Node *def = n->in(j); |
duke@435 | 890 | |
duke@435 | 891 | if (!def || def == n) |
duke@435 | 892 | continue; |
duke@435 | 893 | |
duke@435 | 894 | // Walk backwards thru projections |
duke@435 | 895 | if (def->is_Proj()) |
duke@435 | 896 | def = def->in(0); |
duke@435 | 897 | |
duke@435 | 898 | #ifndef PRODUCT |
duke@435 | 899 | if (trace_opto_pipelining()) { |
duke@435 | 900 | tty->print("# in(%2d): ", j); |
duke@435 | 901 | def->dump(); |
duke@435 | 902 | } |
duke@435 | 903 | #endif |
duke@435 | 904 | |
duke@435 | 905 | // If the defining block is not known, assume it is ok |
duke@435 | 906 | Block *def_block = _bbs[def->_idx]; |
duke@435 | 907 | uint def_pre_order = def_block ? def_block->_pre_order : 0; |
duke@435 | 908 | |
duke@435 | 909 | if ( (use_pre_order < def_pre_order) || |
duke@435 | 910 | (use_pre_order == def_pre_order && n->is_Phi()) ) |
duke@435 | 911 | continue; |
duke@435 | 912 | |
duke@435 | 913 | uint delta_latency = n->latency(j); |
duke@435 | 914 | uint current_latency = delta_latency + use_latency; |
duke@435 | 915 | |
kvn@2040 | 916 | if (_node_latency->at_grow(def->_idx) < current_latency) { |
kvn@2040 | 917 | _node_latency->at_put_grow(def->_idx, current_latency); |
duke@435 | 918 | } |
duke@435 | 919 | |
duke@435 | 920 | #ifndef PRODUCT |
duke@435 | 921 | if (trace_opto_pipelining()) { |
duke@435 | 922 | tty->print_cr("# %d + edge_latency(%d) == %d -> %d, node_latency[%d] = %d", |
duke@435 | 923 | use_latency, j, delta_latency, current_latency, def->_idx, |
kvn@2040 | 924 | _node_latency->at_grow(def->_idx)); |
duke@435 | 925 | } |
duke@435 | 926 | #endif |
duke@435 | 927 | } |
duke@435 | 928 | } |
duke@435 | 929 | |
duke@435 | 930 | //------------------------------latency_from_use------------------------------- |
duke@435 | 931 | // Compute the latency of a specific use |
duke@435 | 932 | int PhaseCFG::latency_from_use(Node *n, const Node *def, Node *use) { |
duke@435 | 933 | // If self-reference, return no latency |
duke@435 | 934 | if (use == n || use->is_Root()) |
duke@435 | 935 | return 0; |
duke@435 | 936 | |
duke@435 | 937 | uint def_pre_order = _bbs[def->_idx]->_pre_order; |
duke@435 | 938 | uint latency = 0; |
duke@435 | 939 | |
duke@435 | 940 | // If the use is not a projection, then it is simple... |
duke@435 | 941 | if (!use->is_Proj()) { |
duke@435 | 942 | #ifndef PRODUCT |
duke@435 | 943 | if (trace_opto_pipelining()) { |
duke@435 | 944 | tty->print("# out(): "); |
duke@435 | 945 | use->dump(); |
duke@435 | 946 | } |
duke@435 | 947 | #endif |
duke@435 | 948 | |
duke@435 | 949 | uint use_pre_order = _bbs[use->_idx]->_pre_order; |
duke@435 | 950 | |
duke@435 | 951 | if (use_pre_order < def_pre_order) |
duke@435 | 952 | return 0; |
duke@435 | 953 | |
duke@435 | 954 | if (use_pre_order == def_pre_order && use->is_Phi()) |
duke@435 | 955 | return 0; |
duke@435 | 956 | |
duke@435 | 957 | uint nlen = use->len(); |
kvn@2040 | 958 | uint nl = _node_latency->at_grow(use->_idx); |
duke@435 | 959 | |
duke@435 | 960 | for ( uint j=0; j<nlen; j++ ) { |
duke@435 | 961 | if (use->in(j) == n) { |
duke@435 | 962 | // Change this if we want local latencies |
duke@435 | 963 | uint ul = use->latency(j); |
duke@435 | 964 | uint l = ul + nl; |
duke@435 | 965 | if (latency < l) latency = l; |
duke@435 | 966 | #ifndef PRODUCT |
duke@435 | 967 | if (trace_opto_pipelining()) { |
duke@435 | 968 | tty->print_cr("# %d + edge_latency(%d) == %d -> %d, latency = %d", |
duke@435 | 969 | nl, j, ul, l, latency); |
duke@435 | 970 | } |
duke@435 | 971 | #endif |
duke@435 | 972 | } |
duke@435 | 973 | } |
duke@435 | 974 | } else { |
duke@435 | 975 | // This is a projection, just grab the latency of the use(s) |
duke@435 | 976 | for (DUIterator_Fast jmax, j = use->fast_outs(jmax); j < jmax; j++) { |
duke@435 | 977 | uint l = latency_from_use(use, def, use->fast_out(j)); |
duke@435 | 978 | if (latency < l) latency = l; |
duke@435 | 979 | } |
duke@435 | 980 | } |
duke@435 | 981 | |
duke@435 | 982 | return latency; |
duke@435 | 983 | } |
duke@435 | 984 | |
duke@435 | 985 | //------------------------------latency_from_uses------------------------------ |
duke@435 | 986 | // Compute the latency of this instruction relative to all of it's uses. |
duke@435 | 987 | // This computes a number that increases as we approach the beginning of the |
duke@435 | 988 | // routine. |
duke@435 | 989 | void PhaseCFG::latency_from_uses(Node *n) { |
duke@435 | 990 | // Set the latency for this instruction |
duke@435 | 991 | #ifndef PRODUCT |
duke@435 | 992 | if (trace_opto_pipelining()) { |
duke@435 | 993 | tty->print("# latency_from_outputs: node_latency[%d] = %d for node", |
kvn@2040 | 994 | n->_idx, _node_latency->at_grow(n->_idx)); |
duke@435 | 995 | dump(); |
duke@435 | 996 | } |
duke@435 | 997 | #endif |
duke@435 | 998 | uint latency=0; |
duke@435 | 999 | const Node *def = n->is_Proj() ? n->in(0): n; |
duke@435 | 1000 | |
duke@435 | 1001 | for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) { |
duke@435 | 1002 | uint l = latency_from_use(n, def, n->fast_out(i)); |
duke@435 | 1003 | |
duke@435 | 1004 | if (latency < l) latency = l; |
duke@435 | 1005 | } |
duke@435 | 1006 | |
kvn@2040 | 1007 | _node_latency->at_put_grow(n->_idx, latency); |
duke@435 | 1008 | } |
duke@435 | 1009 | |
duke@435 | 1010 | //------------------------------hoist_to_cheaper_block------------------------- |
duke@435 | 1011 | // Pick a block for node self, between early and LCA, that is a cheaper |
duke@435 | 1012 | // alternative to LCA. |
duke@435 | 1013 | Block* PhaseCFG::hoist_to_cheaper_block(Block* LCA, Block* early, Node* self) { |
duke@435 | 1014 | const double delta = 1+PROB_UNLIKELY_MAG(4); |
duke@435 | 1015 | Block* least = LCA; |
duke@435 | 1016 | double least_freq = least->_freq; |
kvn@2040 | 1017 | uint target = _node_latency->at_grow(self->_idx); |
kvn@2040 | 1018 | uint start_latency = _node_latency->at_grow(LCA->_nodes[0]->_idx); |
kvn@2040 | 1019 | uint end_latency = _node_latency->at_grow(LCA->_nodes[LCA->end_idx()]->_idx); |
duke@435 | 1020 | bool in_latency = (target <= start_latency); |
duke@435 | 1021 | const Block* root_block = _bbs[_root->_idx]; |
duke@435 | 1022 | |
duke@435 | 1023 | // Turn off latency scheduling if scheduling is just plain off |
duke@435 | 1024 | if (!C->do_scheduling()) |
duke@435 | 1025 | in_latency = true; |
duke@435 | 1026 | |
duke@435 | 1027 | // Do not hoist (to cover latency) instructions which target a |
duke@435 | 1028 | // single register. Hoisting stretches the live range of the |
duke@435 | 1029 | // single register and may force spilling. |
duke@435 | 1030 | MachNode* mach = self->is_Mach() ? self->as_Mach() : NULL; |
duke@435 | 1031 | if (mach && mach->out_RegMask().is_bound1() && mach->out_RegMask().is_NotEmpty()) |
duke@435 | 1032 | in_latency = true; |
duke@435 | 1033 | |
duke@435 | 1034 | #ifndef PRODUCT |
duke@435 | 1035 | if (trace_opto_pipelining()) { |
duke@435 | 1036 | tty->print("# Find cheaper block for latency %d: ", |
kvn@2040 | 1037 | _node_latency->at_grow(self->_idx)); |
duke@435 | 1038 | self->dump(); |
duke@435 | 1039 | tty->print_cr("# B%d: start latency for [%4d]=%d, end latency for [%4d]=%d, freq=%g", |
duke@435 | 1040 | LCA->_pre_order, |
duke@435 | 1041 | LCA->_nodes[0]->_idx, |
duke@435 | 1042 | start_latency, |
duke@435 | 1043 | LCA->_nodes[LCA->end_idx()]->_idx, |
duke@435 | 1044 | end_latency, |
duke@435 | 1045 | least_freq); |
duke@435 | 1046 | } |
duke@435 | 1047 | #endif |
duke@435 | 1048 | |
duke@435 | 1049 | // Walk up the dominator tree from LCA (Lowest common ancestor) to |
duke@435 | 1050 | // the earliest legal location. Capture the least execution frequency. |
duke@435 | 1051 | while (LCA != early) { |
duke@435 | 1052 | LCA = LCA->_idom; // Follow up the dominator tree |
duke@435 | 1053 | |
duke@435 | 1054 | if (LCA == NULL) { |
duke@435 | 1055 | // Bailout without retry |
duke@435 | 1056 | C->record_method_not_compilable("late schedule failed: LCA == NULL"); |
duke@435 | 1057 | return least; |
duke@435 | 1058 | } |
duke@435 | 1059 | |
duke@435 | 1060 | // Don't hoist machine instructions to the root basic block |
duke@435 | 1061 | if (mach && LCA == root_block) |
duke@435 | 1062 | break; |
duke@435 | 1063 | |
kvn@2040 | 1064 | uint start_lat = _node_latency->at_grow(LCA->_nodes[0]->_idx); |
duke@435 | 1065 | uint end_idx = LCA->end_idx(); |
kvn@2040 | 1066 | uint end_lat = _node_latency->at_grow(LCA->_nodes[end_idx]->_idx); |
duke@435 | 1067 | double LCA_freq = LCA->_freq; |
duke@435 | 1068 | #ifndef PRODUCT |
duke@435 | 1069 | if (trace_opto_pipelining()) { |
duke@435 | 1070 | tty->print_cr("# B%d: start latency for [%4d]=%d, end latency for [%4d]=%d, freq=%g", |
duke@435 | 1071 | LCA->_pre_order, LCA->_nodes[0]->_idx, start_lat, end_idx, end_lat, LCA_freq); |
duke@435 | 1072 | } |
duke@435 | 1073 | #endif |
duke@435 | 1074 | if (LCA_freq < least_freq || // Better Frequency |
duke@435 | 1075 | ( !in_latency && // No block containing latency |
duke@435 | 1076 | LCA_freq < least_freq * delta && // No worse frequency |
duke@435 | 1077 | target >= end_lat && // within latency range |
duke@435 | 1078 | !self->is_iteratively_computed() ) // But don't hoist IV increments |
duke@435 | 1079 | // because they may end up above other uses of their phi forcing |
duke@435 | 1080 | // their result register to be different from their input. |
duke@435 | 1081 | ) { |
duke@435 | 1082 | least = LCA; // Found cheaper block |
duke@435 | 1083 | least_freq = LCA_freq; |
duke@435 | 1084 | start_latency = start_lat; |
duke@435 | 1085 | end_latency = end_lat; |
duke@435 | 1086 | if (target <= start_lat) |
duke@435 | 1087 | in_latency = true; |
duke@435 | 1088 | } |
duke@435 | 1089 | } |
duke@435 | 1090 | |
duke@435 | 1091 | #ifndef PRODUCT |
duke@435 | 1092 | if (trace_opto_pipelining()) { |
duke@435 | 1093 | tty->print_cr("# Choose block B%d with start latency=%d and freq=%g", |
duke@435 | 1094 | least->_pre_order, start_latency, least_freq); |
duke@435 | 1095 | } |
duke@435 | 1096 | #endif |
duke@435 | 1097 | |
duke@435 | 1098 | // See if the latency needs to be updated |
duke@435 | 1099 | if (target < end_latency) { |
duke@435 | 1100 | #ifndef PRODUCT |
duke@435 | 1101 | if (trace_opto_pipelining()) { |
duke@435 | 1102 | tty->print_cr("# Change latency for [%4d] from %d to %d", self->_idx, target, end_latency); |
duke@435 | 1103 | } |
duke@435 | 1104 | #endif |
kvn@2040 | 1105 | _node_latency->at_put_grow(self->_idx, end_latency); |
duke@435 | 1106 | partial_latency_of_defs(self); |
duke@435 | 1107 | } |
duke@435 | 1108 | |
duke@435 | 1109 | return least; |
duke@435 | 1110 | } |
duke@435 | 1111 | |
duke@435 | 1112 | |
duke@435 | 1113 | //------------------------------schedule_late----------------------------------- |
duke@435 | 1114 | // Now schedule all codes as LATE as possible. This is the LCA in the |
duke@435 | 1115 | // dominator tree of all USES of a value. Pick the block with the least |
duke@435 | 1116 | // loop nesting depth that is lowest in the dominator tree. |
duke@435 | 1117 | extern const char must_clone[]; |
duke@435 | 1118 | void PhaseCFG::schedule_late(VectorSet &visited, Node_List &stack) { |
duke@435 | 1119 | #ifndef PRODUCT |
duke@435 | 1120 | if (trace_opto_pipelining()) |
duke@435 | 1121 | tty->print("\n#---- schedule_late ----\n"); |
duke@435 | 1122 | #endif |
duke@435 | 1123 | |
duke@435 | 1124 | Node_Backward_Iterator iter((Node *)_root, visited, stack, _bbs); |
duke@435 | 1125 | Node *self; |
duke@435 | 1126 | |
duke@435 | 1127 | // Walk over all the nodes from last to first |
duke@435 | 1128 | while (self = iter.next()) { |
duke@435 | 1129 | Block* early = _bbs[self->_idx]; // Earliest legal placement |
duke@435 | 1130 | |
duke@435 | 1131 | if (self->is_top()) { |
duke@435 | 1132 | // Top node goes in bb #2 with other constants. |
duke@435 | 1133 | // It must be special-cased, because it has no out edges. |
duke@435 | 1134 | early->add_inst(self); |
duke@435 | 1135 | continue; |
duke@435 | 1136 | } |
duke@435 | 1137 | |
duke@435 | 1138 | // No uses, just terminate |
duke@435 | 1139 | if (self->outcnt() == 0) { |
kvn@3040 | 1140 | assert(self->is_MachProj(), "sanity"); |
duke@435 | 1141 | continue; // Must be a dead machine projection |
duke@435 | 1142 | } |
duke@435 | 1143 | |
duke@435 | 1144 | // If node is pinned in the block, then no scheduling can be done. |
duke@435 | 1145 | if( self->pinned() ) // Pinned in block? |
duke@435 | 1146 | continue; |
duke@435 | 1147 | |
duke@435 | 1148 | MachNode* mach = self->is_Mach() ? self->as_Mach() : NULL; |
duke@435 | 1149 | if (mach) { |
duke@435 | 1150 | switch (mach->ideal_Opcode()) { |
duke@435 | 1151 | case Op_CreateEx: |
duke@435 | 1152 | // Don't move exception creation |
duke@435 | 1153 | early->add_inst(self); |
duke@435 | 1154 | continue; |
duke@435 | 1155 | break; |
duke@435 | 1156 | case Op_CheckCastPP: |
duke@435 | 1157 | // Don't move CheckCastPP nodes away from their input, if the input |
duke@435 | 1158 | // is a rawptr (5071820). |
duke@435 | 1159 | Node *def = self->in(1); |
duke@435 | 1160 | if (def != NULL && def->bottom_type()->base() == Type::RawPtr) { |
duke@435 | 1161 | early->add_inst(self); |
kvn@1268 | 1162 | #ifdef ASSERT |
kvn@1268 | 1163 | _raw_oops.push(def); |
kvn@1268 | 1164 | #endif |
duke@435 | 1165 | continue; |
duke@435 | 1166 | } |
duke@435 | 1167 | break; |
duke@435 | 1168 | } |
duke@435 | 1169 | } |
duke@435 | 1170 | |
duke@435 | 1171 | // Gather LCA of all uses |
duke@435 | 1172 | Block *LCA = NULL; |
duke@435 | 1173 | { |
duke@435 | 1174 | for (DUIterator_Fast imax, i = self->fast_outs(imax); i < imax; i++) { |
duke@435 | 1175 | // For all uses, find LCA |
duke@435 | 1176 | Node* use = self->fast_out(i); |
duke@435 | 1177 | LCA = raise_LCA_above_use(LCA, use, self, _bbs); |
duke@435 | 1178 | } |
duke@435 | 1179 | } // (Hide defs of imax, i from rest of block.) |
duke@435 | 1180 | |
duke@435 | 1181 | // Place temps in the block of their use. This isn't a |
duke@435 | 1182 | // requirement for correctness but it reduces useless |
duke@435 | 1183 | // interference between temps and other nodes. |
duke@435 | 1184 | if (mach != NULL && mach->is_MachTemp()) { |
duke@435 | 1185 | _bbs.map(self->_idx, LCA); |
duke@435 | 1186 | LCA->add_inst(self); |
duke@435 | 1187 | continue; |
duke@435 | 1188 | } |
duke@435 | 1189 | |
duke@435 | 1190 | // Check if 'self' could be anti-dependent on memory |
duke@435 | 1191 | if (self->needs_anti_dependence_check()) { |
duke@435 | 1192 | // Hoist LCA above possible-defs and insert anti-dependences to |
duke@435 | 1193 | // defs in new LCA block. |
duke@435 | 1194 | LCA = insert_anti_dependences(LCA, self); |
duke@435 | 1195 | } |
duke@435 | 1196 | |
duke@435 | 1197 | if (early->_dom_depth > LCA->_dom_depth) { |
duke@435 | 1198 | // Somehow the LCA has moved above the earliest legal point. |
duke@435 | 1199 | // (One way this can happen is via memory_early_block.) |
duke@435 | 1200 | if (C->subsume_loads() == true && !C->failing()) { |
duke@435 | 1201 | // Retry with subsume_loads == false |
duke@435 | 1202 | // If this is the first failure, the sentinel string will "stick" |
duke@435 | 1203 | // to the Compile object, and the C2Compiler will see it and retry. |
duke@435 | 1204 | C->record_failure(C2Compiler::retry_no_subsuming_loads()); |
duke@435 | 1205 | } else { |
duke@435 | 1206 | // Bailout without retry when (early->_dom_depth > LCA->_dom_depth) |
duke@435 | 1207 | C->record_method_not_compilable("late schedule failed: incorrect graph"); |
duke@435 | 1208 | } |
duke@435 | 1209 | return; |
duke@435 | 1210 | } |
duke@435 | 1211 | |
duke@435 | 1212 | // If there is no opportunity to hoist, then we're done. |
duke@435 | 1213 | bool try_to_hoist = (LCA != early); |
duke@435 | 1214 | |
duke@435 | 1215 | // Must clone guys stay next to use; no hoisting allowed. |
duke@435 | 1216 | // Also cannot hoist guys that alter memory or are otherwise not |
duke@435 | 1217 | // allocatable (hoisting can make a value live longer, leading to |
duke@435 | 1218 | // anti and output dependency problems which are normally resolved |
duke@435 | 1219 | // by the register allocator giving everyone a different register). |
duke@435 | 1220 | if (mach != NULL && must_clone[mach->ideal_Opcode()]) |
duke@435 | 1221 | try_to_hoist = false; |
duke@435 | 1222 | |
duke@435 | 1223 | Block* late = NULL; |
duke@435 | 1224 | if (try_to_hoist) { |
duke@435 | 1225 | // Now find the block with the least execution frequency. |
duke@435 | 1226 | // Start at the latest schedule and work up to the earliest schedule |
duke@435 | 1227 | // in the dominator tree. Thus the Node will dominate all its uses. |
duke@435 | 1228 | late = hoist_to_cheaper_block(LCA, early, self); |
duke@435 | 1229 | } else { |
duke@435 | 1230 | // Just use the LCA of the uses. |
duke@435 | 1231 | late = LCA; |
duke@435 | 1232 | } |
duke@435 | 1233 | |
duke@435 | 1234 | // Put the node into target block |
duke@435 | 1235 | schedule_node_into_block(self, late); |
duke@435 | 1236 | |
duke@435 | 1237 | #ifdef ASSERT |
duke@435 | 1238 | if (self->needs_anti_dependence_check()) { |
duke@435 | 1239 | // since precedence edges are only inserted when we're sure they |
duke@435 | 1240 | // are needed make sure that after placement in a block we don't |
duke@435 | 1241 | // need any new precedence edges. |
duke@435 | 1242 | verify_anti_dependences(late, self); |
duke@435 | 1243 | } |
duke@435 | 1244 | #endif |
duke@435 | 1245 | } // Loop until all nodes have been visited |
duke@435 | 1246 | |
duke@435 | 1247 | } // end ScheduleLate |
duke@435 | 1248 | |
duke@435 | 1249 | //------------------------------GlobalCodeMotion------------------------------- |
duke@435 | 1250 | void PhaseCFG::GlobalCodeMotion( Matcher &matcher, uint unique, Node_List &proj_list ) { |
duke@435 | 1251 | ResourceMark rm; |
duke@435 | 1252 | |
duke@435 | 1253 | #ifndef PRODUCT |
duke@435 | 1254 | if (trace_opto_pipelining()) { |
duke@435 | 1255 | tty->print("\n---- Start GlobalCodeMotion ----\n"); |
duke@435 | 1256 | } |
duke@435 | 1257 | #endif |
duke@435 | 1258 | |
duke@435 | 1259 | // Initialize the bbs.map for things on the proj_list |
duke@435 | 1260 | uint i; |
duke@435 | 1261 | for( i=0; i < proj_list.size(); i++ ) |
duke@435 | 1262 | _bbs.map(proj_list[i]->_idx, NULL); |
duke@435 | 1263 | |
duke@435 | 1264 | // Set the basic block for Nodes pinned into blocks |
duke@435 | 1265 | Arena *a = Thread::current()->resource_area(); |
duke@435 | 1266 | VectorSet visited(a); |
duke@435 | 1267 | schedule_pinned_nodes( visited ); |
duke@435 | 1268 | |
duke@435 | 1269 | // Find the earliest Block any instruction can be placed in. Some |
duke@435 | 1270 | // instructions are pinned into Blocks. Unpinned instructions can |
duke@435 | 1271 | // appear in last block in which all their inputs occur. |
duke@435 | 1272 | visited.Clear(); |
duke@435 | 1273 | Node_List stack(a); |
duke@435 | 1274 | stack.map( (unique >> 1) + 16, NULL); // Pre-grow the list |
duke@435 | 1275 | if (!schedule_early(visited, stack)) { |
duke@435 | 1276 | // Bailout without retry |
duke@435 | 1277 | C->record_method_not_compilable("early schedule failed"); |
duke@435 | 1278 | return; |
duke@435 | 1279 | } |
duke@435 | 1280 | |
duke@435 | 1281 | // Build Def-Use edges. |
duke@435 | 1282 | proj_list.push(_root); // Add real root as another root |
duke@435 | 1283 | proj_list.pop(); |
duke@435 | 1284 | |
duke@435 | 1285 | // Compute the latency information (via backwards walk) for all the |
duke@435 | 1286 | // instructions in the graph |
kvn@2040 | 1287 | _node_latency = new GrowableArray<uint>(); // resource_area allocation |
duke@435 | 1288 | |
duke@435 | 1289 | if( C->do_scheduling() ) |
duke@435 | 1290 | ComputeLatenciesBackwards(visited, stack); |
duke@435 | 1291 | |
duke@435 | 1292 | // Now schedule all codes as LATE as possible. This is the LCA in the |
duke@435 | 1293 | // dominator tree of all USES of a value. Pick the block with the least |
duke@435 | 1294 | // loop nesting depth that is lowest in the dominator tree. |
duke@435 | 1295 | // ( visited.Clear() called in schedule_late()->Node_Backward_Iterator() ) |
duke@435 | 1296 | schedule_late(visited, stack); |
duke@435 | 1297 | if( C->failing() ) { |
duke@435 | 1298 | // schedule_late fails only when graph is incorrect. |
duke@435 | 1299 | assert(!VerifyGraphEdges, "verification should have failed"); |
duke@435 | 1300 | return; |
duke@435 | 1301 | } |
duke@435 | 1302 | |
duke@435 | 1303 | unique = C->unique(); |
duke@435 | 1304 | |
duke@435 | 1305 | #ifndef PRODUCT |
duke@435 | 1306 | if (trace_opto_pipelining()) { |
duke@435 | 1307 | tty->print("\n---- Detect implicit null checks ----\n"); |
duke@435 | 1308 | } |
duke@435 | 1309 | #endif |
duke@435 | 1310 | |
duke@435 | 1311 | // Detect implicit-null-check opportunities. Basically, find NULL checks |
duke@435 | 1312 | // with suitable memory ops nearby. Use the memory op to do the NULL check. |
duke@435 | 1313 | // I can generate a memory op if there is not one nearby. |
duke@435 | 1314 | if (C->is_method_compilation()) { |
duke@435 | 1315 | // Don't do it for natives, adapters, or runtime stubs |
duke@435 | 1316 | int allowed_reasons = 0; |
duke@435 | 1317 | // ...and don't do it when there have been too many traps, globally. |
duke@435 | 1318 | for (int reason = (int)Deoptimization::Reason_none+1; |
duke@435 | 1319 | reason < Compile::trapHistLength; reason++) { |
duke@435 | 1320 | assert(reason < BitsPerInt, "recode bit map"); |
duke@435 | 1321 | if (!C->too_many_traps((Deoptimization::DeoptReason) reason)) |
duke@435 | 1322 | allowed_reasons |= nth_bit(reason); |
duke@435 | 1323 | } |
duke@435 | 1324 | // By reversing the loop direction we get a very minor gain on mpegaudio. |
duke@435 | 1325 | // Feel free to revert to a forward loop for clarity. |
duke@435 | 1326 | // for( int i=0; i < (int)matcher._null_check_tests.size(); i+=2 ) { |
duke@435 | 1327 | for( int i= matcher._null_check_tests.size()-2; i>=0; i-=2 ) { |
duke@435 | 1328 | Node *proj = matcher._null_check_tests[i ]; |
duke@435 | 1329 | Node *val = matcher._null_check_tests[i+1]; |
duke@435 | 1330 | _bbs[proj->_idx]->implicit_null_check(this, proj, val, allowed_reasons); |
duke@435 | 1331 | // The implicit_null_check will only perform the transformation |
duke@435 | 1332 | // if the null branch is truly uncommon, *and* it leads to an |
duke@435 | 1333 | // uncommon trap. Combined with the too_many_traps guards |
duke@435 | 1334 | // above, this prevents SEGV storms reported in 6366351, |
duke@435 | 1335 | // by recompiling offending methods without this optimization. |
duke@435 | 1336 | } |
duke@435 | 1337 | } |
duke@435 | 1338 | |
duke@435 | 1339 | #ifndef PRODUCT |
duke@435 | 1340 | if (trace_opto_pipelining()) { |
duke@435 | 1341 | tty->print("\n---- Start Local Scheduling ----\n"); |
duke@435 | 1342 | } |
duke@435 | 1343 | #endif |
duke@435 | 1344 | |
duke@435 | 1345 | // Schedule locally. Right now a simple topological sort. |
duke@435 | 1346 | // Later, do a real latency aware scheduler. |
roland@3447 | 1347 | uint max_idx = C->unique(); |
roland@3447 | 1348 | GrowableArray<int> ready_cnt(max_idx, max_idx, -1); |
duke@435 | 1349 | visited.Clear(); |
duke@435 | 1350 | for (i = 0; i < _num_blocks; i++) { |
duke@435 | 1351 | if (!_blocks[i]->schedule_local(this, matcher, ready_cnt, visited)) { |
duke@435 | 1352 | if (!C->failure_reason_is(C2Compiler::retry_no_subsuming_loads())) { |
duke@435 | 1353 | C->record_method_not_compilable("local schedule failed"); |
duke@435 | 1354 | } |
duke@435 | 1355 | return; |
duke@435 | 1356 | } |
duke@435 | 1357 | } |
duke@435 | 1358 | |
duke@435 | 1359 | // If we inserted any instructions between a Call and his CatchNode, |
duke@435 | 1360 | // clone the instructions on all paths below the Catch. |
duke@435 | 1361 | for( i=0; i < _num_blocks; i++ ) |
duke@435 | 1362 | _blocks[i]->call_catch_cleanup(_bbs); |
duke@435 | 1363 | |
duke@435 | 1364 | #ifndef PRODUCT |
duke@435 | 1365 | if (trace_opto_pipelining()) { |
duke@435 | 1366 | tty->print("\n---- After GlobalCodeMotion ----\n"); |
duke@435 | 1367 | for (uint i = 0; i < _num_blocks; i++) { |
duke@435 | 1368 | _blocks[i]->dump(); |
duke@435 | 1369 | } |
duke@435 | 1370 | } |
duke@435 | 1371 | #endif |
kvn@2040 | 1372 | // Dead. |
kvn@2040 | 1373 | _node_latency = (GrowableArray<uint> *)0xdeadbeef; |
duke@435 | 1374 | } |
duke@435 | 1375 | |
duke@435 | 1376 | |
duke@435 | 1377 | //------------------------------Estimate_Block_Frequency----------------------- |
duke@435 | 1378 | // Estimate block frequencies based on IfNode probabilities. |
duke@435 | 1379 | void PhaseCFG::Estimate_Block_Frequency() { |
rasbold@853 | 1380 | |
rasbold@853 | 1381 | // Force conditional branches leading to uncommon traps to be unlikely, |
rasbold@853 | 1382 | // not because we get to the uncommon_trap with less relative frequency, |
rasbold@853 | 1383 | // but because an uncommon_trap typically causes a deopt, so we only get |
rasbold@853 | 1384 | // there once. |
rasbold@853 | 1385 | if (C->do_freq_based_layout()) { |
rasbold@853 | 1386 | Block_List worklist; |
rasbold@853 | 1387 | Block* root_blk = _blocks[0]; |
rasbold@853 | 1388 | for (uint i = 1; i < root_blk->num_preds(); i++) { |
rasbold@853 | 1389 | Block *pb = _bbs[root_blk->pred(i)->_idx]; |
rasbold@853 | 1390 | if (pb->has_uncommon_code()) { |
rasbold@853 | 1391 | worklist.push(pb); |
rasbold@853 | 1392 | } |
rasbold@853 | 1393 | } |
rasbold@853 | 1394 | while (worklist.size() > 0) { |
rasbold@853 | 1395 | Block* uct = worklist.pop(); |
rasbold@853 | 1396 | if (uct == _broot) continue; |
rasbold@853 | 1397 | for (uint i = 1; i < uct->num_preds(); i++) { |
rasbold@853 | 1398 | Block *pb = _bbs[uct->pred(i)->_idx]; |
rasbold@853 | 1399 | if (pb->_num_succs == 1) { |
rasbold@853 | 1400 | worklist.push(pb); |
rasbold@853 | 1401 | } else if (pb->num_fall_throughs() == 2) { |
rasbold@853 | 1402 | pb->update_uncommon_branch(uct); |
rasbold@853 | 1403 | } |
rasbold@853 | 1404 | } |
rasbold@853 | 1405 | } |
rasbold@853 | 1406 | } |
duke@435 | 1407 | |
duke@435 | 1408 | // Create the loop tree and calculate loop depth. |
duke@435 | 1409 | _root_loop = create_loop_tree(); |
duke@435 | 1410 | _root_loop->compute_loop_depth(0); |
duke@435 | 1411 | |
duke@435 | 1412 | // Compute block frequency of each block, relative to a single loop entry. |
duke@435 | 1413 | _root_loop->compute_freq(); |
duke@435 | 1414 | |
duke@435 | 1415 | // Adjust all frequencies to be relative to a single method entry |
rasbold@853 | 1416 | _root_loop->_freq = 1.0; |
duke@435 | 1417 | _root_loop->scale_freq(); |
duke@435 | 1418 | |
kvn@1108 | 1419 | // Save outmost loop frequency for LRG frequency threshold |
kvn@1108 | 1420 | _outer_loop_freq = _root_loop->outer_loop_freq(); |
kvn@1108 | 1421 | |
duke@435 | 1422 | // force paths ending at uncommon traps to be infrequent |
rasbold@853 | 1423 | if (!C->do_freq_based_layout()) { |
rasbold@853 | 1424 | Block_List worklist; |
rasbold@853 | 1425 | Block* root_blk = _blocks[0]; |
rasbold@853 | 1426 | for (uint i = 1; i < root_blk->num_preds(); i++) { |
rasbold@853 | 1427 | Block *pb = _bbs[root_blk->pred(i)->_idx]; |
rasbold@853 | 1428 | if (pb->has_uncommon_code()) { |
rasbold@853 | 1429 | worklist.push(pb); |
rasbold@853 | 1430 | } |
duke@435 | 1431 | } |
rasbold@853 | 1432 | while (worklist.size() > 0) { |
rasbold@853 | 1433 | Block* uct = worklist.pop(); |
rasbold@853 | 1434 | uct->_freq = PROB_MIN; |
rasbold@853 | 1435 | for (uint i = 1; i < uct->num_preds(); i++) { |
rasbold@853 | 1436 | Block *pb = _bbs[uct->pred(i)->_idx]; |
rasbold@853 | 1437 | if (pb->_num_succs == 1 && pb->_freq > PROB_MIN) { |
rasbold@853 | 1438 | worklist.push(pb); |
rasbold@853 | 1439 | } |
duke@435 | 1440 | } |
duke@435 | 1441 | } |
duke@435 | 1442 | } |
duke@435 | 1443 | |
kvn@987 | 1444 | #ifdef ASSERT |
kvn@987 | 1445 | for (uint i = 0; i < _num_blocks; i++ ) { |
kvn@987 | 1446 | Block *b = _blocks[i]; |
twisti@1040 | 1447 | assert(b->_freq >= MIN_BLOCK_FREQUENCY, "Register Allocator requires meaningful block frequency"); |
kvn@987 | 1448 | } |
kvn@987 | 1449 | #endif |
kvn@987 | 1450 | |
duke@435 | 1451 | #ifndef PRODUCT |
duke@435 | 1452 | if (PrintCFGBlockFreq) { |
duke@435 | 1453 | tty->print_cr("CFG Block Frequencies"); |
duke@435 | 1454 | _root_loop->dump_tree(); |
duke@435 | 1455 | if (Verbose) { |
duke@435 | 1456 | tty->print_cr("PhaseCFG dump"); |
duke@435 | 1457 | dump(); |
duke@435 | 1458 | tty->print_cr("Node dump"); |
duke@435 | 1459 | _root->dump(99999); |
duke@435 | 1460 | } |
duke@435 | 1461 | } |
duke@435 | 1462 | #endif |
duke@435 | 1463 | } |
duke@435 | 1464 | |
duke@435 | 1465 | //----------------------------create_loop_tree-------------------------------- |
duke@435 | 1466 | // Create a loop tree from the CFG |
duke@435 | 1467 | CFGLoop* PhaseCFG::create_loop_tree() { |
duke@435 | 1468 | |
duke@435 | 1469 | #ifdef ASSERT |
duke@435 | 1470 | assert( _blocks[0] == _broot, "" ); |
duke@435 | 1471 | for (uint i = 0; i < _num_blocks; i++ ) { |
duke@435 | 1472 | Block *b = _blocks[i]; |
duke@435 | 1473 | // Check that _loop field are clear...we could clear them if not. |
duke@435 | 1474 | assert(b->_loop == NULL, "clear _loop expected"); |
duke@435 | 1475 | // Sanity check that the RPO numbering is reflected in the _blocks array. |
duke@435 | 1476 | // It doesn't have to be for the loop tree to be built, but if it is not, |
duke@435 | 1477 | // then the blocks have been reordered since dom graph building...which |
duke@435 | 1478 | // may question the RPO numbering |
duke@435 | 1479 | assert(b->_rpo == i, "unexpected reverse post order number"); |
duke@435 | 1480 | } |
duke@435 | 1481 | #endif |
duke@435 | 1482 | |
duke@435 | 1483 | int idct = 0; |
duke@435 | 1484 | CFGLoop* root_loop = new CFGLoop(idct++); |
duke@435 | 1485 | |
duke@435 | 1486 | Block_List worklist; |
duke@435 | 1487 | |
duke@435 | 1488 | // Assign blocks to loops |
duke@435 | 1489 | for(uint i = _num_blocks - 1; i > 0; i-- ) { // skip Root block |
duke@435 | 1490 | Block *b = _blocks[i]; |
duke@435 | 1491 | |
duke@435 | 1492 | if (b->head()->is_Loop()) { |
duke@435 | 1493 | Block* loop_head = b; |
duke@435 | 1494 | assert(loop_head->num_preds() - 1 == 2, "loop must have 2 predecessors"); |
duke@435 | 1495 | Node* tail_n = loop_head->pred(LoopNode::LoopBackControl); |
duke@435 | 1496 | Block* tail = _bbs[tail_n->_idx]; |
duke@435 | 1497 | |
duke@435 | 1498 | // Defensively filter out Loop nodes for non-single-entry loops. |
duke@435 | 1499 | // For all reasonable loops, the head occurs before the tail in RPO. |
duke@435 | 1500 | if (i <= tail->_rpo) { |
duke@435 | 1501 | |
duke@435 | 1502 | // The tail and (recursive) predecessors of the tail |
duke@435 | 1503 | // are made members of a new loop. |
duke@435 | 1504 | |
duke@435 | 1505 | assert(worklist.size() == 0, "nonempty worklist"); |
duke@435 | 1506 | CFGLoop* nloop = new CFGLoop(idct++); |
duke@435 | 1507 | assert(loop_head->_loop == NULL, "just checking"); |
duke@435 | 1508 | loop_head->_loop = nloop; |
duke@435 | 1509 | // Add to nloop so push_pred() will skip over inner loops |
duke@435 | 1510 | nloop->add_member(loop_head); |
duke@435 | 1511 | nloop->push_pred(loop_head, LoopNode::LoopBackControl, worklist, _bbs); |
duke@435 | 1512 | |
duke@435 | 1513 | while (worklist.size() > 0) { |
duke@435 | 1514 | Block* member = worklist.pop(); |
duke@435 | 1515 | if (member != loop_head) { |
duke@435 | 1516 | for (uint j = 1; j < member->num_preds(); j++) { |
duke@435 | 1517 | nloop->push_pred(member, j, worklist, _bbs); |
duke@435 | 1518 | } |
duke@435 | 1519 | } |
duke@435 | 1520 | } |
duke@435 | 1521 | } |
duke@435 | 1522 | } |
duke@435 | 1523 | } |
duke@435 | 1524 | |
duke@435 | 1525 | // Create a member list for each loop consisting |
duke@435 | 1526 | // of both blocks and (immediate child) loops. |
duke@435 | 1527 | for (uint i = 0; i < _num_blocks; i++) { |
duke@435 | 1528 | Block *b = _blocks[i]; |
duke@435 | 1529 | CFGLoop* lp = b->_loop; |
duke@435 | 1530 | if (lp == NULL) { |
duke@435 | 1531 | // Not assigned to a loop. Add it to the method's pseudo loop. |
duke@435 | 1532 | b->_loop = root_loop; |
duke@435 | 1533 | lp = root_loop; |
duke@435 | 1534 | } |
duke@435 | 1535 | if (lp == root_loop || b != lp->head()) { // loop heads are already members |
duke@435 | 1536 | lp->add_member(b); |
duke@435 | 1537 | } |
duke@435 | 1538 | if (lp != root_loop) { |
duke@435 | 1539 | if (lp->parent() == NULL) { |
duke@435 | 1540 | // Not a nested loop. Make it a child of the method's pseudo loop. |
duke@435 | 1541 | root_loop->add_nested_loop(lp); |
duke@435 | 1542 | } |
duke@435 | 1543 | if (b == lp->head()) { |
duke@435 | 1544 | // Add nested loop to member list of parent loop. |
duke@435 | 1545 | lp->parent()->add_member(lp); |
duke@435 | 1546 | } |
duke@435 | 1547 | } |
duke@435 | 1548 | } |
duke@435 | 1549 | |
duke@435 | 1550 | return root_loop; |
duke@435 | 1551 | } |
duke@435 | 1552 | |
duke@435 | 1553 | //------------------------------push_pred-------------------------------------- |
duke@435 | 1554 | void CFGLoop::push_pred(Block* blk, int i, Block_List& worklist, Block_Array& node_to_blk) { |
duke@435 | 1555 | Node* pred_n = blk->pred(i); |
duke@435 | 1556 | Block* pred = node_to_blk[pred_n->_idx]; |
duke@435 | 1557 | CFGLoop *pred_loop = pred->_loop; |
duke@435 | 1558 | if (pred_loop == NULL) { |
duke@435 | 1559 | // Filter out blocks for non-single-entry loops. |
duke@435 | 1560 | // For all reasonable loops, the head occurs before the tail in RPO. |
duke@435 | 1561 | if (pred->_rpo > head()->_rpo) { |
duke@435 | 1562 | pred->_loop = this; |
duke@435 | 1563 | worklist.push(pred); |
duke@435 | 1564 | } |
duke@435 | 1565 | } else if (pred_loop != this) { |
duke@435 | 1566 | // Nested loop. |
duke@435 | 1567 | while (pred_loop->_parent != NULL && pred_loop->_parent != this) { |
duke@435 | 1568 | pred_loop = pred_loop->_parent; |
duke@435 | 1569 | } |
duke@435 | 1570 | // Make pred's loop be a child |
duke@435 | 1571 | if (pred_loop->_parent == NULL) { |
duke@435 | 1572 | add_nested_loop(pred_loop); |
duke@435 | 1573 | // Continue with loop entry predecessor. |
duke@435 | 1574 | Block* pred_head = pred_loop->head(); |
duke@435 | 1575 | assert(pred_head->num_preds() - 1 == 2, "loop must have 2 predecessors"); |
duke@435 | 1576 | assert(pred_head != head(), "loop head in only one loop"); |
duke@435 | 1577 | push_pred(pred_head, LoopNode::EntryControl, worklist, node_to_blk); |
duke@435 | 1578 | } else { |
duke@435 | 1579 | assert(pred_loop->_parent == this && _parent == NULL, "just checking"); |
duke@435 | 1580 | } |
duke@435 | 1581 | } |
duke@435 | 1582 | } |
duke@435 | 1583 | |
duke@435 | 1584 | //------------------------------add_nested_loop-------------------------------- |
duke@435 | 1585 | // Make cl a child of the current loop in the loop tree. |
duke@435 | 1586 | void CFGLoop::add_nested_loop(CFGLoop* cl) { |
duke@435 | 1587 | assert(_parent == NULL, "no parent yet"); |
duke@435 | 1588 | assert(cl != this, "not my own parent"); |
duke@435 | 1589 | cl->_parent = this; |
duke@435 | 1590 | CFGLoop* ch = _child; |
duke@435 | 1591 | if (ch == NULL) { |
duke@435 | 1592 | _child = cl; |
duke@435 | 1593 | } else { |
duke@435 | 1594 | while (ch->_sibling != NULL) { ch = ch->_sibling; } |
duke@435 | 1595 | ch->_sibling = cl; |
duke@435 | 1596 | } |
duke@435 | 1597 | } |
duke@435 | 1598 | |
duke@435 | 1599 | //------------------------------compute_loop_depth----------------------------- |
duke@435 | 1600 | // Store the loop depth in each CFGLoop object. |
duke@435 | 1601 | // Recursively walk the children to do the same for them. |
duke@435 | 1602 | void CFGLoop::compute_loop_depth(int depth) { |
duke@435 | 1603 | _depth = depth; |
duke@435 | 1604 | CFGLoop* ch = _child; |
duke@435 | 1605 | while (ch != NULL) { |
duke@435 | 1606 | ch->compute_loop_depth(depth + 1); |
duke@435 | 1607 | ch = ch->_sibling; |
duke@435 | 1608 | } |
duke@435 | 1609 | } |
duke@435 | 1610 | |
duke@435 | 1611 | //------------------------------compute_freq----------------------------------- |
duke@435 | 1612 | // Compute the frequency of each block and loop, relative to a single entry |
duke@435 | 1613 | // into the dominating loop head. |
duke@435 | 1614 | void CFGLoop::compute_freq() { |
duke@435 | 1615 | // Bottom up traversal of loop tree (visit inner loops first.) |
duke@435 | 1616 | // Set loop head frequency to 1.0, then transitively |
duke@435 | 1617 | // compute frequency for all successors in the loop, |
duke@435 | 1618 | // as well as for each exit edge. Inner loops are |
duke@435 | 1619 | // treated as single blocks with loop exit targets |
duke@435 | 1620 | // as the successor blocks. |
duke@435 | 1621 | |
duke@435 | 1622 | // Nested loops first |
duke@435 | 1623 | CFGLoop* ch = _child; |
duke@435 | 1624 | while (ch != NULL) { |
duke@435 | 1625 | ch->compute_freq(); |
duke@435 | 1626 | ch = ch->_sibling; |
duke@435 | 1627 | } |
duke@435 | 1628 | assert (_members.length() > 0, "no empty loops"); |
duke@435 | 1629 | Block* hd = head(); |
duke@435 | 1630 | hd->_freq = 1.0f; |
duke@435 | 1631 | for (int i = 0; i < _members.length(); i++) { |
duke@435 | 1632 | CFGElement* s = _members.at(i); |
duke@435 | 1633 | float freq = s->_freq; |
duke@435 | 1634 | if (s->is_block()) { |
duke@435 | 1635 | Block* b = s->as_Block(); |
duke@435 | 1636 | for (uint j = 0; j < b->_num_succs; j++) { |
duke@435 | 1637 | Block* sb = b->_succs[j]; |
duke@435 | 1638 | update_succ_freq(sb, freq * b->succ_prob(j)); |
duke@435 | 1639 | } |
duke@435 | 1640 | } else { |
duke@435 | 1641 | CFGLoop* lp = s->as_CFGLoop(); |
duke@435 | 1642 | assert(lp->_parent == this, "immediate child"); |
duke@435 | 1643 | for (int k = 0; k < lp->_exits.length(); k++) { |
duke@435 | 1644 | Block* eb = lp->_exits.at(k).get_target(); |
duke@435 | 1645 | float prob = lp->_exits.at(k).get_prob(); |
duke@435 | 1646 | update_succ_freq(eb, freq * prob); |
duke@435 | 1647 | } |
duke@435 | 1648 | } |
duke@435 | 1649 | } |
duke@435 | 1650 | |
duke@435 | 1651 | // For all loops other than the outer, "method" loop, |
duke@435 | 1652 | // sum and normalize the exit probability. The "method" loop |
duke@435 | 1653 | // should keep the initial exit probability of 1, so that |
duke@435 | 1654 | // inner blocks do not get erroneously scaled. |
duke@435 | 1655 | if (_depth != 0) { |
duke@435 | 1656 | // Total the exit probabilities for this loop. |
duke@435 | 1657 | float exits_sum = 0.0f; |
duke@435 | 1658 | for (int i = 0; i < _exits.length(); i++) { |
duke@435 | 1659 | exits_sum += _exits.at(i).get_prob(); |
duke@435 | 1660 | } |
duke@435 | 1661 | |
duke@435 | 1662 | // Normalize the exit probabilities. Until now, the |
duke@435 | 1663 | // probabilities estimate the possibility of exit per |
duke@435 | 1664 | // a single loop iteration; afterward, they estimate |
duke@435 | 1665 | // the probability of exit per loop entry. |
duke@435 | 1666 | for (int i = 0; i < _exits.length(); i++) { |
duke@435 | 1667 | Block* et = _exits.at(i).get_target(); |
rasbold@853 | 1668 | float new_prob = 0.0f; |
rasbold@853 | 1669 | if (_exits.at(i).get_prob() > 0.0f) { |
rasbold@853 | 1670 | new_prob = _exits.at(i).get_prob() / exits_sum; |
rasbold@853 | 1671 | } |
duke@435 | 1672 | BlockProbPair bpp(et, new_prob); |
duke@435 | 1673 | _exits.at_put(i, bpp); |
duke@435 | 1674 | } |
duke@435 | 1675 | |
rasbold@853 | 1676 | // Save the total, but guard against unreasonable probability, |
duke@435 | 1677 | // as the value is used to estimate the loop trip count. |
duke@435 | 1678 | // An infinite trip count would blur relative block |
duke@435 | 1679 | // frequencies. |
duke@435 | 1680 | if (exits_sum > 1.0f) exits_sum = 1.0; |
duke@435 | 1681 | if (exits_sum < PROB_MIN) exits_sum = PROB_MIN; |
duke@435 | 1682 | _exit_prob = exits_sum; |
duke@435 | 1683 | } |
duke@435 | 1684 | } |
duke@435 | 1685 | |
duke@435 | 1686 | //------------------------------succ_prob------------------------------------- |
duke@435 | 1687 | // Determine the probability of reaching successor 'i' from the receiver block. |
duke@435 | 1688 | float Block::succ_prob(uint i) { |
duke@435 | 1689 | int eidx = end_idx(); |
duke@435 | 1690 | Node *n = _nodes[eidx]; // Get ending Node |
rasbold@743 | 1691 | |
rasbold@743 | 1692 | int op = n->Opcode(); |
rasbold@743 | 1693 | if (n->is_Mach()) { |
rasbold@743 | 1694 | if (n->is_MachNullCheck()) { |
rasbold@743 | 1695 | // Can only reach here if called after lcm. The original Op_If is gone, |
rasbold@743 | 1696 | // so we attempt to infer the probability from one or both of the |
rasbold@743 | 1697 | // successor blocks. |
rasbold@743 | 1698 | assert(_num_succs == 2, "expecting 2 successors of a null check"); |
rasbold@743 | 1699 | // If either successor has only one predecessor, then the |
twisti@1040 | 1700 | // probability estimate can be derived using the |
rasbold@743 | 1701 | // relative frequency of the successor and this block. |
rasbold@743 | 1702 | if (_succs[i]->num_preds() == 2) { |
rasbold@743 | 1703 | return _succs[i]->_freq / _freq; |
rasbold@743 | 1704 | } else if (_succs[1-i]->num_preds() == 2) { |
rasbold@743 | 1705 | return 1 - (_succs[1-i]->_freq / _freq); |
rasbold@743 | 1706 | } else { |
rasbold@743 | 1707 | // Estimate using both successor frequencies |
rasbold@743 | 1708 | float freq = _succs[i]->_freq; |
rasbold@743 | 1709 | return freq / (freq + _succs[1-i]->_freq); |
rasbold@743 | 1710 | } |
rasbold@743 | 1711 | } |
rasbold@743 | 1712 | op = n->as_Mach()->ideal_Opcode(); |
rasbold@743 | 1713 | } |
rasbold@743 | 1714 | |
duke@435 | 1715 | |
duke@435 | 1716 | // Switch on branch type |
duke@435 | 1717 | switch( op ) { |
duke@435 | 1718 | case Op_CountedLoopEnd: |
duke@435 | 1719 | case Op_If: { |
duke@435 | 1720 | assert (i < 2, "just checking"); |
duke@435 | 1721 | // Conditionals pass on only part of their frequency |
duke@435 | 1722 | float prob = n->as_MachIf()->_prob; |
duke@435 | 1723 | assert(prob >= 0.0 && prob <= 1.0, "out of range probability"); |
duke@435 | 1724 | // If succ[i] is the FALSE branch, invert path info |
duke@435 | 1725 | if( _nodes[i + eidx + 1]->Opcode() == Op_IfFalse ) { |
duke@435 | 1726 | return 1.0f - prob; // not taken |
duke@435 | 1727 | } else { |
duke@435 | 1728 | return prob; // taken |
duke@435 | 1729 | } |
duke@435 | 1730 | } |
duke@435 | 1731 | |
duke@435 | 1732 | case Op_Jump: |
duke@435 | 1733 | // Divide the frequency between all successors evenly |
duke@435 | 1734 | return 1.0f/_num_succs; |
duke@435 | 1735 | |
duke@435 | 1736 | case Op_Catch: { |
duke@435 | 1737 | const CatchProjNode *ci = _nodes[i + eidx + 1]->as_CatchProj(); |
duke@435 | 1738 | if (ci->_con == CatchProjNode::fall_through_index) { |
duke@435 | 1739 | // Fall-thru path gets the lion's share. |
duke@435 | 1740 | return 1.0f - PROB_UNLIKELY_MAG(5)*_num_succs; |
duke@435 | 1741 | } else { |
duke@435 | 1742 | // Presume exceptional paths are equally unlikely |
duke@435 | 1743 | return PROB_UNLIKELY_MAG(5); |
duke@435 | 1744 | } |
duke@435 | 1745 | } |
duke@435 | 1746 | |
duke@435 | 1747 | case Op_Root: |
duke@435 | 1748 | case Op_Goto: |
duke@435 | 1749 | // Pass frequency straight thru to target |
duke@435 | 1750 | return 1.0f; |
duke@435 | 1751 | |
duke@435 | 1752 | case Op_NeverBranch: |
duke@435 | 1753 | return 0.0f; |
duke@435 | 1754 | |
duke@435 | 1755 | case Op_TailCall: |
duke@435 | 1756 | case Op_TailJump: |
duke@435 | 1757 | case Op_Return: |
duke@435 | 1758 | case Op_Halt: |
duke@435 | 1759 | case Op_Rethrow: |
duke@435 | 1760 | // Do not push out freq to root block |
duke@435 | 1761 | return 0.0f; |
duke@435 | 1762 | |
duke@435 | 1763 | default: |
duke@435 | 1764 | ShouldNotReachHere(); |
duke@435 | 1765 | } |
duke@435 | 1766 | |
duke@435 | 1767 | return 0.0f; |
duke@435 | 1768 | } |
duke@435 | 1769 | |
rasbold@853 | 1770 | //------------------------------num_fall_throughs----------------------------- |
rasbold@853 | 1771 | // Return the number of fall-through candidates for a block |
rasbold@853 | 1772 | int Block::num_fall_throughs() { |
rasbold@853 | 1773 | int eidx = end_idx(); |
rasbold@853 | 1774 | Node *n = _nodes[eidx]; // Get ending Node |
rasbold@853 | 1775 | |
rasbold@853 | 1776 | int op = n->Opcode(); |
rasbold@853 | 1777 | if (n->is_Mach()) { |
rasbold@853 | 1778 | if (n->is_MachNullCheck()) { |
rasbold@853 | 1779 | // In theory, either side can fall-thru, for simplicity sake, |
rasbold@853 | 1780 | // let's say only the false branch can now. |
rasbold@853 | 1781 | return 1; |
rasbold@853 | 1782 | } |
rasbold@853 | 1783 | op = n->as_Mach()->ideal_Opcode(); |
rasbold@853 | 1784 | } |
rasbold@853 | 1785 | |
rasbold@853 | 1786 | // Switch on branch type |
rasbold@853 | 1787 | switch( op ) { |
rasbold@853 | 1788 | case Op_CountedLoopEnd: |
rasbold@853 | 1789 | case Op_If: |
rasbold@853 | 1790 | return 2; |
rasbold@853 | 1791 | |
rasbold@853 | 1792 | case Op_Root: |
rasbold@853 | 1793 | case Op_Goto: |
rasbold@853 | 1794 | return 1; |
rasbold@853 | 1795 | |
rasbold@853 | 1796 | case Op_Catch: { |
rasbold@853 | 1797 | for (uint i = 0; i < _num_succs; i++) { |
rasbold@853 | 1798 | const CatchProjNode *ci = _nodes[i + eidx + 1]->as_CatchProj(); |
rasbold@853 | 1799 | if (ci->_con == CatchProjNode::fall_through_index) { |
rasbold@853 | 1800 | return 1; |
rasbold@853 | 1801 | } |
rasbold@853 | 1802 | } |
rasbold@853 | 1803 | return 0; |
rasbold@853 | 1804 | } |
rasbold@853 | 1805 | |
rasbold@853 | 1806 | case Op_Jump: |
rasbold@853 | 1807 | case Op_NeverBranch: |
rasbold@853 | 1808 | case Op_TailCall: |
rasbold@853 | 1809 | case Op_TailJump: |
rasbold@853 | 1810 | case Op_Return: |
rasbold@853 | 1811 | case Op_Halt: |
rasbold@853 | 1812 | case Op_Rethrow: |
rasbold@853 | 1813 | return 0; |
rasbold@853 | 1814 | |
rasbold@853 | 1815 | default: |
rasbold@853 | 1816 | ShouldNotReachHere(); |
rasbold@853 | 1817 | } |
rasbold@853 | 1818 | |
rasbold@853 | 1819 | return 0; |
rasbold@853 | 1820 | } |
rasbold@853 | 1821 | |
rasbold@853 | 1822 | //------------------------------succ_fall_through----------------------------- |
rasbold@853 | 1823 | // Return true if a specific successor could be fall-through target. |
rasbold@853 | 1824 | bool Block::succ_fall_through(uint i) { |
rasbold@853 | 1825 | int eidx = end_idx(); |
rasbold@853 | 1826 | Node *n = _nodes[eidx]; // Get ending Node |
rasbold@853 | 1827 | |
rasbold@853 | 1828 | int op = n->Opcode(); |
rasbold@853 | 1829 | if (n->is_Mach()) { |
rasbold@853 | 1830 | if (n->is_MachNullCheck()) { |
rasbold@853 | 1831 | // In theory, either side can fall-thru, for simplicity sake, |
rasbold@853 | 1832 | // let's say only the false branch can now. |
rasbold@853 | 1833 | return _nodes[i + eidx + 1]->Opcode() == Op_IfFalse; |
rasbold@853 | 1834 | } |
rasbold@853 | 1835 | op = n->as_Mach()->ideal_Opcode(); |
rasbold@853 | 1836 | } |
rasbold@853 | 1837 | |
rasbold@853 | 1838 | // Switch on branch type |
rasbold@853 | 1839 | switch( op ) { |
rasbold@853 | 1840 | case Op_CountedLoopEnd: |
rasbold@853 | 1841 | case Op_If: |
rasbold@853 | 1842 | case Op_Root: |
rasbold@853 | 1843 | case Op_Goto: |
rasbold@853 | 1844 | return true; |
rasbold@853 | 1845 | |
rasbold@853 | 1846 | case Op_Catch: { |
rasbold@853 | 1847 | const CatchProjNode *ci = _nodes[i + eidx + 1]->as_CatchProj(); |
rasbold@853 | 1848 | return ci->_con == CatchProjNode::fall_through_index; |
rasbold@853 | 1849 | } |
rasbold@853 | 1850 | |
rasbold@853 | 1851 | case Op_Jump: |
rasbold@853 | 1852 | case Op_NeverBranch: |
rasbold@853 | 1853 | case Op_TailCall: |
rasbold@853 | 1854 | case Op_TailJump: |
rasbold@853 | 1855 | case Op_Return: |
rasbold@853 | 1856 | case Op_Halt: |
rasbold@853 | 1857 | case Op_Rethrow: |
rasbold@853 | 1858 | return false; |
rasbold@853 | 1859 | |
rasbold@853 | 1860 | default: |
rasbold@853 | 1861 | ShouldNotReachHere(); |
rasbold@853 | 1862 | } |
rasbold@853 | 1863 | |
rasbold@853 | 1864 | return false; |
rasbold@853 | 1865 | } |
rasbold@853 | 1866 | |
rasbold@853 | 1867 | //------------------------------update_uncommon_branch------------------------ |
rasbold@853 | 1868 | // Update the probability of a two-branch to be uncommon |
rasbold@853 | 1869 | void Block::update_uncommon_branch(Block* ub) { |
rasbold@853 | 1870 | int eidx = end_idx(); |
rasbold@853 | 1871 | Node *n = _nodes[eidx]; // Get ending Node |
rasbold@853 | 1872 | |
rasbold@853 | 1873 | int op = n->as_Mach()->ideal_Opcode(); |
rasbold@853 | 1874 | |
rasbold@853 | 1875 | assert(op == Op_CountedLoopEnd || op == Op_If, "must be a If"); |
rasbold@853 | 1876 | assert(num_fall_throughs() == 2, "must be a two way branch block"); |
rasbold@853 | 1877 | |
rasbold@853 | 1878 | // Which successor is ub? |
rasbold@853 | 1879 | uint s; |
rasbold@853 | 1880 | for (s = 0; s <_num_succs; s++) { |
rasbold@853 | 1881 | if (_succs[s] == ub) break; |
rasbold@853 | 1882 | } |
rasbold@853 | 1883 | assert(s < 2, "uncommon successor must be found"); |
rasbold@853 | 1884 | |
rasbold@853 | 1885 | // If ub is the true path, make the proability small, else |
rasbold@853 | 1886 | // ub is the false path, and make the probability large |
rasbold@853 | 1887 | bool invert = (_nodes[s + eidx + 1]->Opcode() == Op_IfFalse); |
rasbold@853 | 1888 | |
rasbold@853 | 1889 | // Get existing probability |
rasbold@853 | 1890 | float p = n->as_MachIf()->_prob; |
rasbold@853 | 1891 | |
rasbold@853 | 1892 | if (invert) p = 1.0 - p; |
rasbold@853 | 1893 | if (p > PROB_MIN) { |
rasbold@853 | 1894 | p = PROB_MIN; |
rasbold@853 | 1895 | } |
rasbold@853 | 1896 | if (invert) p = 1.0 - p; |
rasbold@853 | 1897 | |
rasbold@853 | 1898 | n->as_MachIf()->_prob = p; |
rasbold@853 | 1899 | } |
rasbold@853 | 1900 | |
duke@435 | 1901 | //------------------------------update_succ_freq------------------------------- |
twisti@1040 | 1902 | // Update the appropriate frequency associated with block 'b', a successor of |
duke@435 | 1903 | // a block in this loop. |
duke@435 | 1904 | void CFGLoop::update_succ_freq(Block* b, float freq) { |
duke@435 | 1905 | if (b->_loop == this) { |
duke@435 | 1906 | if (b == head()) { |
duke@435 | 1907 | // back branch within the loop |
duke@435 | 1908 | // Do nothing now, the loop carried frequency will be |
duke@435 | 1909 | // adjust later in scale_freq(). |
duke@435 | 1910 | } else { |
duke@435 | 1911 | // simple branch within the loop |
duke@435 | 1912 | b->_freq += freq; |
duke@435 | 1913 | } |
duke@435 | 1914 | } else if (!in_loop_nest(b)) { |
duke@435 | 1915 | // branch is exit from this loop |
duke@435 | 1916 | BlockProbPair bpp(b, freq); |
duke@435 | 1917 | _exits.append(bpp); |
duke@435 | 1918 | } else { |
duke@435 | 1919 | // branch into nested loop |
duke@435 | 1920 | CFGLoop* ch = b->_loop; |
duke@435 | 1921 | ch->_freq += freq; |
duke@435 | 1922 | } |
duke@435 | 1923 | } |
duke@435 | 1924 | |
duke@435 | 1925 | //------------------------------in_loop_nest----------------------------------- |
duke@435 | 1926 | // Determine if block b is in the receiver's loop nest. |
duke@435 | 1927 | bool CFGLoop::in_loop_nest(Block* b) { |
duke@435 | 1928 | int depth = _depth; |
duke@435 | 1929 | CFGLoop* b_loop = b->_loop; |
duke@435 | 1930 | int b_depth = b_loop->_depth; |
duke@435 | 1931 | if (depth == b_depth) { |
duke@435 | 1932 | return true; |
duke@435 | 1933 | } |
duke@435 | 1934 | while (b_depth > depth) { |
duke@435 | 1935 | b_loop = b_loop->_parent; |
duke@435 | 1936 | b_depth = b_loop->_depth; |
duke@435 | 1937 | } |
duke@435 | 1938 | return b_loop == this; |
duke@435 | 1939 | } |
duke@435 | 1940 | |
duke@435 | 1941 | //------------------------------scale_freq------------------------------------- |
duke@435 | 1942 | // Scale frequency of loops and blocks by trip counts from outer loops |
duke@435 | 1943 | // Do a top down traversal of loop tree (visit outer loops first.) |
duke@435 | 1944 | void CFGLoop::scale_freq() { |
duke@435 | 1945 | float loop_freq = _freq * trip_count(); |
kvn@1108 | 1946 | _freq = loop_freq; |
duke@435 | 1947 | for (int i = 0; i < _members.length(); i++) { |
duke@435 | 1948 | CFGElement* s = _members.at(i); |
kvn@987 | 1949 | float block_freq = s->_freq * loop_freq; |
kvn@1056 | 1950 | if (g_isnan(block_freq) || block_freq < MIN_BLOCK_FREQUENCY) |
kvn@1056 | 1951 | block_freq = MIN_BLOCK_FREQUENCY; |
kvn@987 | 1952 | s->_freq = block_freq; |
duke@435 | 1953 | } |
duke@435 | 1954 | CFGLoop* ch = _child; |
duke@435 | 1955 | while (ch != NULL) { |
duke@435 | 1956 | ch->scale_freq(); |
duke@435 | 1957 | ch = ch->_sibling; |
duke@435 | 1958 | } |
duke@435 | 1959 | } |
duke@435 | 1960 | |
kvn@1108 | 1961 | // Frequency of outer loop |
kvn@1108 | 1962 | float CFGLoop::outer_loop_freq() const { |
kvn@1108 | 1963 | if (_child != NULL) { |
kvn@1108 | 1964 | return _child->_freq; |
kvn@1108 | 1965 | } |
kvn@1108 | 1966 | return _freq; |
kvn@1108 | 1967 | } |
kvn@1108 | 1968 | |
duke@435 | 1969 | #ifndef PRODUCT |
duke@435 | 1970 | //------------------------------dump_tree-------------------------------------- |
duke@435 | 1971 | void CFGLoop::dump_tree() const { |
duke@435 | 1972 | dump(); |
duke@435 | 1973 | if (_child != NULL) _child->dump_tree(); |
duke@435 | 1974 | if (_sibling != NULL) _sibling->dump_tree(); |
duke@435 | 1975 | } |
duke@435 | 1976 | |
duke@435 | 1977 | //------------------------------dump------------------------------------------- |
duke@435 | 1978 | void CFGLoop::dump() const { |
duke@435 | 1979 | for (int i = 0; i < _depth; i++) tty->print(" "); |
duke@435 | 1980 | tty->print("%s: %d trip_count: %6.0f freq: %6.0f\n", |
duke@435 | 1981 | _depth == 0 ? "Method" : "Loop", _id, trip_count(), _freq); |
duke@435 | 1982 | for (int i = 0; i < _depth; i++) tty->print(" "); |
duke@435 | 1983 | tty->print(" members:", _id); |
duke@435 | 1984 | int k = 0; |
duke@435 | 1985 | for (int i = 0; i < _members.length(); i++) { |
duke@435 | 1986 | if (k++ >= 6) { |
duke@435 | 1987 | tty->print("\n "); |
duke@435 | 1988 | for (int j = 0; j < _depth+1; j++) tty->print(" "); |
duke@435 | 1989 | k = 0; |
duke@435 | 1990 | } |
duke@435 | 1991 | CFGElement *s = _members.at(i); |
duke@435 | 1992 | if (s->is_block()) { |
duke@435 | 1993 | Block *b = s->as_Block(); |
duke@435 | 1994 | tty->print(" B%d(%6.3f)", b->_pre_order, b->_freq); |
duke@435 | 1995 | } else { |
duke@435 | 1996 | CFGLoop* lp = s->as_CFGLoop(); |
duke@435 | 1997 | tty->print(" L%d(%6.3f)", lp->_id, lp->_freq); |
duke@435 | 1998 | } |
duke@435 | 1999 | } |
duke@435 | 2000 | tty->print("\n"); |
duke@435 | 2001 | for (int i = 0; i < _depth; i++) tty->print(" "); |
duke@435 | 2002 | tty->print(" exits: "); |
duke@435 | 2003 | k = 0; |
duke@435 | 2004 | for (int i = 0; i < _exits.length(); i++) { |
duke@435 | 2005 | if (k++ >= 7) { |
duke@435 | 2006 | tty->print("\n "); |
duke@435 | 2007 | for (int j = 0; j < _depth+1; j++) tty->print(" "); |
duke@435 | 2008 | k = 0; |
duke@435 | 2009 | } |
duke@435 | 2010 | Block *blk = _exits.at(i).get_target(); |
duke@435 | 2011 | float prob = _exits.at(i).get_prob(); |
duke@435 | 2012 | tty->print(" ->%d@%d%%", blk->_pre_order, (int)(prob*100)); |
duke@435 | 2013 | } |
duke@435 | 2014 | tty->print("\n"); |
duke@435 | 2015 | } |
duke@435 | 2016 | #endif |