Mon, 24 Nov 2014 07:29:03 -0800
8058148: MaxNodeLimit and LiveNodeCountInliningCutoff
Reviewed-by: kvn, roland
duke@435 | 1 | /* |
drchase@6680 | 2 | * Copyright (c) 1998, 2014, 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 "ci/ciMethodData.hpp" |
stefank@2314 | 27 | #include "compiler/compileLog.hpp" |
stefank@2314 | 28 | #include "libadt/vectset.hpp" |
stefank@2314 | 29 | #include "memory/allocation.inline.hpp" |
stefank@2314 | 30 | #include "opto/addnode.hpp" |
stefank@2314 | 31 | #include "opto/callnode.hpp" |
stefank@2314 | 32 | #include "opto/connode.hpp" |
stefank@2314 | 33 | #include "opto/divnode.hpp" |
stefank@2314 | 34 | #include "opto/idealGraphPrinter.hpp" |
stefank@2314 | 35 | #include "opto/loopnode.hpp" |
stefank@2314 | 36 | #include "opto/mulnode.hpp" |
stefank@2314 | 37 | #include "opto/rootnode.hpp" |
stefank@2314 | 38 | #include "opto/superword.hpp" |
duke@435 | 39 | |
duke@435 | 40 | //============================================================================= |
duke@435 | 41 | //------------------------------is_loop_iv------------------------------------- |
duke@435 | 42 | // Determine if a node is Counted loop induction variable. |
duke@435 | 43 | // The method is declared in node.hpp. |
duke@435 | 44 | const Node* Node::is_loop_iv() const { |
duke@435 | 45 | if (this->is_Phi() && !this->as_Phi()->is_copy() && |
duke@435 | 46 | this->as_Phi()->region()->is_CountedLoop() && |
duke@435 | 47 | this->as_Phi()->region()->as_CountedLoop()->phi() == this) { |
duke@435 | 48 | return this; |
duke@435 | 49 | } else { |
duke@435 | 50 | return NULL; |
duke@435 | 51 | } |
duke@435 | 52 | } |
duke@435 | 53 | |
duke@435 | 54 | //============================================================================= |
duke@435 | 55 | //------------------------------dump_spec-------------------------------------- |
duke@435 | 56 | // Dump special per-node info |
duke@435 | 57 | #ifndef PRODUCT |
duke@435 | 58 | void LoopNode::dump_spec(outputStream *st) const { |
kvn@2665 | 59 | if (is_inner_loop()) st->print( "inner " ); |
kvn@2665 | 60 | if (is_partial_peel_loop()) st->print( "partial_peel " ); |
kvn@2665 | 61 | if (partial_peel_has_failed()) st->print( "partial_peel_failed " ); |
duke@435 | 62 | } |
duke@435 | 63 | #endif |
duke@435 | 64 | |
kvn@2665 | 65 | //------------------------------is_valid_counted_loop------------------------- |
kvn@2665 | 66 | bool LoopNode::is_valid_counted_loop() const { |
kvn@2665 | 67 | if (is_CountedLoop()) { |
kvn@2665 | 68 | CountedLoopNode* l = as_CountedLoop(); |
kvn@2665 | 69 | CountedLoopEndNode* le = l->loopexit(); |
kvn@2665 | 70 | if (le != NULL && |
kvn@2665 | 71 | le->proj_out(1 /* true */) == l->in(LoopNode::LoopBackControl)) { |
kvn@2665 | 72 | Node* phi = l->phi(); |
kvn@2665 | 73 | Node* exit = le->proj_out(0 /* false */); |
kvn@2665 | 74 | if (exit != NULL && exit->Opcode() == Op_IfFalse && |
kvn@2665 | 75 | phi != NULL && phi->is_Phi() && |
kvn@2665 | 76 | phi->in(LoopNode::LoopBackControl) == l->incr() && |
kvn@2665 | 77 | le->loopnode() == l && le->stride_is_con()) { |
kvn@2665 | 78 | return true; |
kvn@2665 | 79 | } |
kvn@2665 | 80 | } |
kvn@2665 | 81 | } |
kvn@2665 | 82 | return false; |
kvn@2665 | 83 | } |
kvn@2665 | 84 | |
duke@435 | 85 | //------------------------------get_early_ctrl--------------------------------- |
duke@435 | 86 | // Compute earliest legal control |
duke@435 | 87 | Node *PhaseIdealLoop::get_early_ctrl( Node *n ) { |
duke@435 | 88 | assert( !n->is_Phi() && !n->is_CFG(), "this code only handles data nodes" ); |
duke@435 | 89 | uint i; |
duke@435 | 90 | Node *early; |
roland@4589 | 91 | if (n->in(0) && !n->is_expensive()) { |
duke@435 | 92 | early = n->in(0); |
roland@4589 | 93 | if (!early->is_CFG()) // Might be a non-CFG multi-def |
duke@435 | 94 | early = get_ctrl(early); // So treat input as a straight data input |
duke@435 | 95 | i = 1; |
duke@435 | 96 | } else { |
duke@435 | 97 | early = get_ctrl(n->in(1)); |
duke@435 | 98 | i = 2; |
duke@435 | 99 | } |
duke@435 | 100 | uint e_d = dom_depth(early); |
duke@435 | 101 | assert( early, "" ); |
roland@4589 | 102 | for (; i < n->req(); i++) { |
duke@435 | 103 | Node *cin = get_ctrl(n->in(i)); |
duke@435 | 104 | assert( cin, "" ); |
duke@435 | 105 | // Keep deepest dominator depth |
duke@435 | 106 | uint c_d = dom_depth(cin); |
roland@4589 | 107 | if (c_d > e_d) { // Deeper guy? |
duke@435 | 108 | early = cin; // Keep deepest found so far |
duke@435 | 109 | e_d = c_d; |
roland@4589 | 110 | } else if (c_d == e_d && // Same depth? |
roland@4589 | 111 | early != cin) { // If not equal, must use slower algorithm |
duke@435 | 112 | // If same depth but not equal, one _must_ dominate the other |
duke@435 | 113 | // and we want the deeper (i.e., dominated) guy. |
duke@435 | 114 | Node *n1 = early; |
duke@435 | 115 | Node *n2 = cin; |
roland@4589 | 116 | while (1) { |
duke@435 | 117 | n1 = idom(n1); // Walk up until break cycle |
duke@435 | 118 | n2 = idom(n2); |
roland@4589 | 119 | if (n1 == cin || // Walked early up to cin |
roland@4589 | 120 | dom_depth(n2) < c_d) |
duke@435 | 121 | break; // early is deeper; keep him |
roland@4589 | 122 | if (n2 == early || // Walked cin up to early |
roland@4589 | 123 | dom_depth(n1) < c_d) { |
duke@435 | 124 | early = cin; // cin is deeper; keep him |
duke@435 | 125 | break; |
duke@435 | 126 | } |
duke@435 | 127 | } |
duke@435 | 128 | e_d = dom_depth(early); // Reset depth register cache |
duke@435 | 129 | } |
duke@435 | 130 | } |
duke@435 | 131 | |
duke@435 | 132 | // Return earliest legal location |
duke@435 | 133 | assert(early == find_non_split_ctrl(early), "unexpected early control"); |
duke@435 | 134 | |
roland@4589 | 135 | if (n->is_expensive()) { |
roland@4589 | 136 | assert(n->in(0), "should have control input"); |
roland@4589 | 137 | early = get_early_ctrl_for_expensive(n, early); |
roland@4589 | 138 | } |
roland@4589 | 139 | |
duke@435 | 140 | return early; |
duke@435 | 141 | } |
duke@435 | 142 | |
roland@4589 | 143 | //------------------------------get_early_ctrl_for_expensive--------------------------------- |
roland@4589 | 144 | // Move node up the dominator tree as high as legal while still beneficial |
roland@4589 | 145 | Node *PhaseIdealLoop::get_early_ctrl_for_expensive(Node *n, Node* earliest) { |
roland@4589 | 146 | assert(n->in(0) && n->is_expensive(), "expensive node with control input here"); |
roland@4589 | 147 | assert(OptimizeExpensiveOps, "optimization off?"); |
roland@4589 | 148 | |
roland@4589 | 149 | Node* ctl = n->in(0); |
roland@4589 | 150 | assert(ctl->is_CFG(), "expensive input 0 must be cfg"); |
roland@4589 | 151 | uint min_dom_depth = dom_depth(earliest); |
roland@4589 | 152 | #ifdef ASSERT |
roland@4589 | 153 | if (!is_dominator(ctl, earliest) && !is_dominator(earliest, ctl)) { |
roland@4589 | 154 | dump_bad_graph("Bad graph detected in get_early_ctrl_for_expensive", n, earliest, ctl); |
roland@4589 | 155 | assert(false, "Bad graph detected in get_early_ctrl_for_expensive"); |
roland@4589 | 156 | } |
roland@4589 | 157 | #endif |
roland@4589 | 158 | if (dom_depth(ctl) < min_dom_depth) { |
roland@4589 | 159 | return earliest; |
roland@4589 | 160 | } |
roland@4589 | 161 | |
roland@4589 | 162 | while (1) { |
roland@4589 | 163 | Node *next = ctl; |
roland@4589 | 164 | // Moving the node out of a loop on the projection of a If |
roland@4589 | 165 | // confuses loop predication. So once we hit a Loop in a If branch |
roland@4589 | 166 | // that doesn't branch to an UNC, we stop. The code that process |
roland@4589 | 167 | // expensive nodes will notice the loop and skip over it to try to |
roland@4589 | 168 | // move the node further up. |
roland@4589 | 169 | if (ctl->is_CountedLoop() && ctl->in(1) != NULL && ctl->in(1)->in(0) != NULL && ctl->in(1)->in(0)->is_If()) { |
roland@5981 | 170 | if (!ctl->in(1)->as_Proj()->is_uncommon_trap_if_pattern(Deoptimization::Reason_none)) { |
roland@4589 | 171 | break; |
roland@4589 | 172 | } |
roland@4589 | 173 | next = idom(ctl->in(1)->in(0)); |
roland@4589 | 174 | } else if (ctl->is_Proj()) { |
roland@4589 | 175 | // We only move it up along a projection if the projection is |
roland@4589 | 176 | // the single control projection for its parent: same code path, |
roland@4589 | 177 | // if it's a If with UNC or fallthrough of a call. |
roland@4589 | 178 | Node* parent_ctl = ctl->in(0); |
roland@4589 | 179 | if (parent_ctl == NULL) { |
roland@4589 | 180 | break; |
roland@4589 | 181 | } else if (parent_ctl->is_CountedLoopEnd() && parent_ctl->as_CountedLoopEnd()->loopnode() != NULL) { |
roland@4589 | 182 | next = parent_ctl->as_CountedLoopEnd()->loopnode()->init_control(); |
roland@4589 | 183 | } else if (parent_ctl->is_If()) { |
roland@5981 | 184 | if (!ctl->as_Proj()->is_uncommon_trap_if_pattern(Deoptimization::Reason_none)) { |
roland@4589 | 185 | break; |
roland@4589 | 186 | } |
roland@4589 | 187 | assert(idom(ctl) == parent_ctl, "strange"); |
roland@4589 | 188 | next = idom(parent_ctl); |
roland@4589 | 189 | } else if (ctl->is_CatchProj()) { |
roland@4589 | 190 | if (ctl->as_Proj()->_con != CatchProjNode::fall_through_index) { |
roland@4589 | 191 | break; |
roland@4589 | 192 | } |
roland@4589 | 193 | assert(parent_ctl->in(0)->in(0)->is_Call(), "strange graph"); |
roland@4589 | 194 | next = parent_ctl->in(0)->in(0)->in(0); |
roland@4589 | 195 | } else { |
roland@4589 | 196 | // Check if parent control has a single projection (this |
roland@4589 | 197 | // control is the only possible successor of the parent |
roland@4589 | 198 | // control). If so, we can try to move the node above the |
roland@4589 | 199 | // parent control. |
roland@4589 | 200 | int nb_ctl_proj = 0; |
roland@4589 | 201 | for (DUIterator_Fast imax, i = parent_ctl->fast_outs(imax); i < imax; i++) { |
roland@4589 | 202 | Node *p = parent_ctl->fast_out(i); |
roland@4589 | 203 | if (p->is_Proj() && p->is_CFG()) { |
roland@4589 | 204 | nb_ctl_proj++; |
roland@4589 | 205 | if (nb_ctl_proj > 1) { |
roland@4589 | 206 | break; |
roland@4589 | 207 | } |
roland@4589 | 208 | } |
roland@4589 | 209 | } |
roland@4589 | 210 | |
roland@4589 | 211 | if (nb_ctl_proj > 1) { |
roland@4589 | 212 | break; |
roland@4589 | 213 | } |
roland@4589 | 214 | assert(parent_ctl->is_Start() || parent_ctl->is_MemBar() || parent_ctl->is_Call(), "unexpected node"); |
roland@4589 | 215 | assert(idom(ctl) == parent_ctl, "strange"); |
roland@4589 | 216 | next = idom(parent_ctl); |
roland@4589 | 217 | } |
roland@4589 | 218 | } else { |
roland@4589 | 219 | next = idom(ctl); |
roland@4589 | 220 | } |
roland@4589 | 221 | if (next->is_Root() || next->is_Start() || dom_depth(next) < min_dom_depth) { |
roland@4589 | 222 | break; |
roland@4589 | 223 | } |
roland@4589 | 224 | ctl = next; |
roland@4589 | 225 | } |
roland@4589 | 226 | |
roland@4589 | 227 | if (ctl != n->in(0)) { |
roland@4589 | 228 | _igvn.hash_delete(n); |
roland@4589 | 229 | n->set_req(0, ctl); |
roland@4589 | 230 | _igvn.hash_insert(n); |
roland@4589 | 231 | } |
roland@4589 | 232 | |
roland@4589 | 233 | return ctl; |
roland@4589 | 234 | } |
roland@4589 | 235 | |
roland@4589 | 236 | |
duke@435 | 237 | //------------------------------set_early_ctrl--------------------------------- |
duke@435 | 238 | // Set earliest legal control |
duke@435 | 239 | void PhaseIdealLoop::set_early_ctrl( Node *n ) { |
duke@435 | 240 | Node *early = get_early_ctrl(n); |
duke@435 | 241 | |
duke@435 | 242 | // Record earliest legal location |
duke@435 | 243 | set_ctrl(n, early); |
duke@435 | 244 | } |
duke@435 | 245 | |
duke@435 | 246 | //------------------------------set_subtree_ctrl------------------------------- |
duke@435 | 247 | // set missing _ctrl entries on new nodes |
duke@435 | 248 | void PhaseIdealLoop::set_subtree_ctrl( Node *n ) { |
duke@435 | 249 | // Already set? Get out. |
duke@435 | 250 | if( _nodes[n->_idx] ) return; |
duke@435 | 251 | // Recursively set _nodes array to indicate where the Node goes |
duke@435 | 252 | uint i; |
duke@435 | 253 | for( i = 0; i < n->req(); ++i ) { |
duke@435 | 254 | Node *m = n->in(i); |
duke@435 | 255 | if( m && m != C->root() ) |
duke@435 | 256 | set_subtree_ctrl( m ); |
duke@435 | 257 | } |
duke@435 | 258 | |
duke@435 | 259 | // Fixup self |
duke@435 | 260 | set_early_ctrl( n ); |
duke@435 | 261 | } |
duke@435 | 262 | |
duke@435 | 263 | //------------------------------is_counted_loop-------------------------------- |
kvn@2665 | 264 | bool PhaseIdealLoop::is_counted_loop( Node *x, IdealLoopTree *loop ) { |
duke@435 | 265 | PhaseGVN *gvn = &_igvn; |
duke@435 | 266 | |
duke@435 | 267 | // Counted loop head must be a good RegionNode with only 3 not NULL |
duke@435 | 268 | // control input edges: Self, Entry, LoopBack. |
kvn@6657 | 269 | if (x->in(LoopNode::Self) == NULL || x->req() != 3 || loop->_irreducible) { |
kvn@2665 | 270 | return false; |
kvn@6657 | 271 | } |
duke@435 | 272 | Node *init_control = x->in(LoopNode::EntryControl); |
duke@435 | 273 | Node *back_control = x->in(LoopNode::LoopBackControl); |
kvn@2665 | 274 | if (init_control == NULL || back_control == NULL) // Partially dead |
kvn@2665 | 275 | return false; |
duke@435 | 276 | // Must also check for TOP when looking for a dead loop |
kvn@2665 | 277 | if (init_control->is_top() || back_control->is_top()) |
kvn@2665 | 278 | return false; |
duke@435 | 279 | |
duke@435 | 280 | // Allow funny placement of Safepoint |
kvn@2665 | 281 | if (back_control->Opcode() == Op_SafePoint) |
duke@435 | 282 | back_control = back_control->in(TypeFunc::Control); |
duke@435 | 283 | |
duke@435 | 284 | // Controlling test for loop |
duke@435 | 285 | Node *iftrue = back_control; |
duke@435 | 286 | uint iftrue_op = iftrue->Opcode(); |
kvn@2665 | 287 | if (iftrue_op != Op_IfTrue && |
kvn@2665 | 288 | iftrue_op != Op_IfFalse) |
duke@435 | 289 | // I have a weird back-control. Probably the loop-exit test is in |
duke@435 | 290 | // the middle of the loop and I am looking at some trailing control-flow |
duke@435 | 291 | // merge point. To fix this I would have to partially peel the loop. |
kvn@2665 | 292 | return false; // Obscure back-control |
duke@435 | 293 | |
duke@435 | 294 | // Get boolean guarding loop-back test |
duke@435 | 295 | Node *iff = iftrue->in(0); |
kvn@2665 | 296 | if (get_loop(iff) != loop || !iff->in(1)->is_Bool()) |
kvn@2665 | 297 | return false; |
duke@435 | 298 | BoolNode *test = iff->in(1)->as_Bool(); |
duke@435 | 299 | BoolTest::mask bt = test->_test._test; |
duke@435 | 300 | float cl_prob = iff->as_If()->_prob; |
kvn@2665 | 301 | if (iftrue_op == Op_IfFalse) { |
duke@435 | 302 | bt = BoolTest(bt).negate(); |
duke@435 | 303 | cl_prob = 1.0 - cl_prob; |
duke@435 | 304 | } |
duke@435 | 305 | // Get backedge compare |
duke@435 | 306 | Node *cmp = test->in(1); |
duke@435 | 307 | int cmp_op = cmp->Opcode(); |
kvn@2877 | 308 | if (cmp_op != Op_CmpI) |
kvn@2665 | 309 | return false; // Avoid pointer & float compares |
duke@435 | 310 | |
duke@435 | 311 | // Find the trip-counter increment & limit. Limit must be loop invariant. |
duke@435 | 312 | Node *incr = cmp->in(1); |
duke@435 | 313 | Node *limit = cmp->in(2); |
duke@435 | 314 | |
duke@435 | 315 | // --------- |
duke@435 | 316 | // need 'loop()' test to tell if limit is loop invariant |
duke@435 | 317 | // --------- |
duke@435 | 318 | |
kvn@2665 | 319 | if (!is_member(loop, get_ctrl(incr))) { // Swapped trip counter and limit? |
kvn@2665 | 320 | Node *tmp = incr; // Then reverse order into the CmpI |
duke@435 | 321 | incr = limit; |
duke@435 | 322 | limit = tmp; |
duke@435 | 323 | bt = BoolTest(bt).commute(); // And commute the exit test |
duke@435 | 324 | } |
kvn@2665 | 325 | if (is_member(loop, get_ctrl(limit))) // Limit must be loop-invariant |
kvn@2665 | 326 | return false; |
kvn@2665 | 327 | if (!is_member(loop, get_ctrl(incr))) // Trip counter must be loop-variant |
kvn@2665 | 328 | return false; |
duke@435 | 329 | |
kvn@2665 | 330 | Node* phi_incr = NULL; |
duke@435 | 331 | // Trip-counter increment must be commutative & associative. |
kvn@2665 | 332 | if (incr->is_Phi()) { |
kvn@2665 | 333 | if (incr->as_Phi()->region() != x || incr->req() != 3) |
kvn@2665 | 334 | return false; // Not simple trip counter expression |
kvn@2665 | 335 | phi_incr = incr; |
kvn@2665 | 336 | incr = phi_incr->in(LoopNode::LoopBackControl); // Assume incr is on backedge of Phi |
kvn@2665 | 337 | if (!is_member(loop, get_ctrl(incr))) // Trip counter must be loop-variant |
kvn@2665 | 338 | return false; |
duke@435 | 339 | } |
kvn@2665 | 340 | |
duke@435 | 341 | Node* trunc1 = NULL; |
duke@435 | 342 | Node* trunc2 = NULL; |
duke@435 | 343 | const TypeInt* iv_trunc_t = NULL; |
duke@435 | 344 | if (!(incr = CountedLoopNode::match_incr_with_optional_truncation(incr, &trunc1, &trunc2, &iv_trunc_t))) { |
kvn@2665 | 345 | return false; // Funny increment opcode |
duke@435 | 346 | } |
kvn@2665 | 347 | assert(incr->Opcode() == Op_AddI, "wrong increment code"); |
duke@435 | 348 | |
duke@435 | 349 | // Get merge point |
duke@435 | 350 | Node *xphi = incr->in(1); |
duke@435 | 351 | Node *stride = incr->in(2); |
kvn@2665 | 352 | if (!stride->is_Con()) { // Oops, swap these |
kvn@2665 | 353 | if (!xphi->is_Con()) // Is the other guy a constant? |
kvn@2665 | 354 | return false; // Nope, unknown stride, bail out |
duke@435 | 355 | Node *tmp = xphi; // 'incr' is commutative, so ok to swap |
duke@435 | 356 | xphi = stride; |
duke@435 | 357 | stride = tmp; |
duke@435 | 358 | } |
kvn@2665 | 359 | // Stride must be constant |
kvn@2665 | 360 | int stride_con = stride->get_int(); |
kvn@2877 | 361 | if (stride_con == 0) |
kvn@2877 | 362 | return false; // missed some peephole opt |
kvn@2665 | 363 | |
kvn@2665 | 364 | if (!xphi->is_Phi()) |
kvn@2665 | 365 | return false; // Too much math on the trip counter |
kvn@2665 | 366 | if (phi_incr != NULL && phi_incr != xphi) |
kvn@2665 | 367 | return false; |
duke@435 | 368 | PhiNode *phi = xphi->as_Phi(); |
duke@435 | 369 | |
duke@435 | 370 | // Phi must be of loop header; backedge must wrap to increment |
kvn@2665 | 371 | if (phi->region() != x) |
kvn@2665 | 372 | return false; |
kvn@2665 | 373 | if (trunc1 == NULL && phi->in(LoopNode::LoopBackControl) != incr || |
kvn@2665 | 374 | trunc1 != NULL && phi->in(LoopNode::LoopBackControl) != trunc1) { |
kvn@2665 | 375 | return false; |
duke@435 | 376 | } |
duke@435 | 377 | Node *init_trip = phi->in(LoopNode::EntryControl); |
duke@435 | 378 | |
duke@435 | 379 | // If iv trunc type is smaller than int, check for possible wrap. |
duke@435 | 380 | if (!TypeInt::INT->higher_equal(iv_trunc_t)) { |
duke@435 | 381 | assert(trunc1 != NULL, "must have found some truncation"); |
duke@435 | 382 | |
duke@435 | 383 | // Get a better type for the phi (filtered thru if's) |
duke@435 | 384 | const TypeInt* phi_ft = filtered_type(phi); |
duke@435 | 385 | |
duke@435 | 386 | // Can iv take on a value that will wrap? |
duke@435 | 387 | // |
duke@435 | 388 | // Ensure iv's limit is not within "stride" of the wrap value. |
duke@435 | 389 | // |
duke@435 | 390 | // Example for "short" type |
duke@435 | 391 | // Truncation ensures value is in the range -32768..32767 (iv_trunc_t) |
duke@435 | 392 | // If the stride is +10, then the last value of the induction |
duke@435 | 393 | // variable before the increment (phi_ft->_hi) must be |
duke@435 | 394 | // <= 32767 - 10 and (phi_ft->_lo) must be >= -32768 to |
duke@435 | 395 | // ensure no truncation occurs after the increment. |
duke@435 | 396 | |
duke@435 | 397 | if (stride_con > 0) { |
duke@435 | 398 | if (iv_trunc_t->_hi - phi_ft->_hi < stride_con || |
duke@435 | 399 | iv_trunc_t->_lo > phi_ft->_lo) { |
kvn@2665 | 400 | return false; // truncation may occur |
duke@435 | 401 | } |
duke@435 | 402 | } else if (stride_con < 0) { |
duke@435 | 403 | if (iv_trunc_t->_lo - phi_ft->_lo > stride_con || |
duke@435 | 404 | iv_trunc_t->_hi < phi_ft->_hi) { |
kvn@2665 | 405 | return false; // truncation may occur |
duke@435 | 406 | } |
duke@435 | 407 | } |
duke@435 | 408 | // No possibility of wrap so truncation can be discarded |
duke@435 | 409 | // Promote iv type to Int |
duke@435 | 410 | } else { |
duke@435 | 411 | assert(trunc1 == NULL && trunc2 == NULL, "no truncation for int"); |
duke@435 | 412 | } |
duke@435 | 413 | |
kvn@2665 | 414 | // If the condition is inverted and we will be rolling |
kvn@2665 | 415 | // through MININT to MAXINT, then bail out. |
kvn@2665 | 416 | if (bt == BoolTest::eq || // Bail out, but this loop trips at most twice! |
kvn@2665 | 417 | // Odd stride |
kvn@2665 | 418 | bt == BoolTest::ne && stride_con != 1 && stride_con != -1 || |
kvn@2665 | 419 | // Count down loop rolls through MAXINT |
kvn@2665 | 420 | (bt == BoolTest::le || bt == BoolTest::lt) && stride_con < 0 || |
kvn@2665 | 421 | // Count up loop rolls through MININT |
kvn@2877 | 422 | (bt == BoolTest::ge || bt == BoolTest::gt) && stride_con > 0) { |
kvn@2665 | 423 | return false; // Bail out |
kvn@2665 | 424 | } |
kvn@2665 | 425 | |
kvn@2665 | 426 | const TypeInt* init_t = gvn->type(init_trip)->is_int(); |
kvn@2665 | 427 | const TypeInt* limit_t = gvn->type(limit)->is_int(); |
kvn@2665 | 428 | |
kvn@2665 | 429 | if (stride_con > 0) { |
vlivanov@4157 | 430 | jlong init_p = (jlong)init_t->_lo + stride_con; |
vlivanov@4157 | 431 | if (init_p > (jlong)max_jint || init_p > (jlong)limit_t->_hi) |
kvn@2665 | 432 | return false; // cyclic loop or this loop trips only once |
kvn@2665 | 433 | } else { |
vlivanov@4157 | 434 | jlong init_p = (jlong)init_t->_hi + stride_con; |
vlivanov@4157 | 435 | if (init_p < (jlong)min_jint || init_p < (jlong)limit_t->_lo) |
kvn@2665 | 436 | return false; // cyclic loop or this loop trips only once |
kvn@2665 | 437 | } |
kvn@2665 | 438 | |
duke@435 | 439 | // ================================================= |
duke@435 | 440 | // ---- SUCCESS! Found A Trip-Counted Loop! ----- |
duke@435 | 441 | // |
kvn@2665 | 442 | assert(x->Opcode() == Op_Loop, "regular loops only"); |
sla@5237 | 443 | C->print_method(PHASE_BEFORE_CLOOPS, 3); |
kvn@2877 | 444 | |
kvn@4115 | 445 | Node *hook = new (C) Node(6); |
kvn@2877 | 446 | |
kvn@2877 | 447 | if (LoopLimitCheck) { |
kvn@2877 | 448 | |
kvn@2877 | 449 | // =================================================== |
kvn@2877 | 450 | // Generate loop limit check to avoid integer overflow |
kvn@2877 | 451 | // in cases like next (cyclic loops): |
kvn@2877 | 452 | // |
kvn@2877 | 453 | // for (i=0; i <= max_jint; i++) {} |
kvn@2877 | 454 | // for (i=0; i < max_jint; i+=2) {} |
kvn@2877 | 455 | // |
kvn@2877 | 456 | // |
kvn@2877 | 457 | // Limit check predicate depends on the loop test: |
kvn@2877 | 458 | // |
kvn@2877 | 459 | // for(;i != limit; i++) --> limit <= (max_jint) |
kvn@2877 | 460 | // for(;i < limit; i+=stride) --> limit <= (max_jint - stride + 1) |
kvn@2877 | 461 | // for(;i <= limit; i+=stride) --> limit <= (max_jint - stride ) |
kvn@2877 | 462 | // |
kvn@2877 | 463 | |
kvn@2877 | 464 | // Check if limit is excluded to do more precise int overflow check. |
kvn@2877 | 465 | bool incl_limit = (bt == BoolTest::le || bt == BoolTest::ge); |
kvn@2877 | 466 | int stride_m = stride_con - (incl_limit ? 0 : (stride_con > 0 ? 1 : -1)); |
kvn@2877 | 467 | |
kvn@2877 | 468 | // If compare points directly to the phi we need to adjust |
kvn@2877 | 469 | // the compare so that it points to the incr. Limit have |
kvn@2877 | 470 | // to be adjusted to keep trip count the same and the |
kvn@2877 | 471 | // adjusted limit should be checked for int overflow. |
kvn@2877 | 472 | if (phi_incr != NULL) { |
kvn@2877 | 473 | stride_m += stride_con; |
kvn@2877 | 474 | } |
kvn@2877 | 475 | |
kvn@2877 | 476 | if (limit->is_Con()) { |
kvn@2877 | 477 | int limit_con = limit->get_int(); |
kvn@2877 | 478 | if ((stride_con > 0 && limit_con > (max_jint - stride_m)) || |
kvn@2877 | 479 | (stride_con < 0 && limit_con < (min_jint - stride_m))) { |
kvn@2877 | 480 | // Bailout: it could be integer overflow. |
kvn@2877 | 481 | return false; |
kvn@2877 | 482 | } |
kvn@2877 | 483 | } else if ((stride_con > 0 && limit_t->_hi <= (max_jint - stride_m)) || |
kvn@2877 | 484 | (stride_con < 0 && limit_t->_lo >= (min_jint - stride_m))) { |
kvn@2877 | 485 | // Limit's type may satisfy the condition, for example, |
kvn@2877 | 486 | // when it is an array length. |
kvn@2877 | 487 | } else { |
kvn@2877 | 488 | // Generate loop's limit check. |
kvn@2877 | 489 | // Loop limit check predicate should be near the loop. |
kvn@2877 | 490 | ProjNode *limit_check_proj = find_predicate_insertion_point(init_control, Deoptimization::Reason_loop_limit_check); |
kvn@2877 | 491 | if (!limit_check_proj) { |
kvn@2877 | 492 | // The limit check predicate is not generated if this method trapped here before. |
kvn@2877 | 493 | #ifdef ASSERT |
kvn@2877 | 494 | if (TraceLoopLimitCheck) { |
kvn@2877 | 495 | tty->print("missing loop limit check:"); |
kvn@2877 | 496 | loop->dump_head(); |
kvn@2877 | 497 | x->dump(1); |
kvn@2877 | 498 | } |
kvn@2877 | 499 | #endif |
kvn@2877 | 500 | return false; |
kvn@2877 | 501 | } |
kvn@2877 | 502 | |
kvn@2877 | 503 | IfNode* check_iff = limit_check_proj->in(0)->as_If(); |
kvn@2877 | 504 | Node* cmp_limit; |
kvn@2877 | 505 | Node* bol; |
kvn@2877 | 506 | |
kvn@2877 | 507 | if (stride_con > 0) { |
kvn@4115 | 508 | cmp_limit = new (C) CmpINode(limit, _igvn.intcon(max_jint - stride_m)); |
kvn@4115 | 509 | bol = new (C) BoolNode(cmp_limit, BoolTest::le); |
kvn@2877 | 510 | } else { |
kvn@4115 | 511 | cmp_limit = new (C) CmpINode(limit, _igvn.intcon(min_jint - stride_m)); |
kvn@4115 | 512 | bol = new (C) BoolNode(cmp_limit, BoolTest::ge); |
kvn@2877 | 513 | } |
kvn@2877 | 514 | cmp_limit = _igvn.register_new_node_with_optimizer(cmp_limit); |
kvn@2877 | 515 | bol = _igvn.register_new_node_with_optimizer(bol); |
kvn@2877 | 516 | set_subtree_ctrl(bol); |
kvn@2877 | 517 | |
kvn@2877 | 518 | // Replace condition in original predicate but preserve Opaque node |
kvn@2877 | 519 | // so that previous predicates could be found. |
kvn@2877 | 520 | assert(check_iff->in(1)->Opcode() == Op_Conv2B && |
kvn@2877 | 521 | check_iff->in(1)->in(1)->Opcode() == Op_Opaque1, ""); |
kvn@2877 | 522 | Node* opq = check_iff->in(1)->in(1); |
kvn@2877 | 523 | _igvn.hash_delete(opq); |
kvn@2877 | 524 | opq->set_req(1, bol); |
kvn@2877 | 525 | // Update ctrl. |
kvn@2877 | 526 | set_ctrl(opq, check_iff->in(0)); |
kvn@2877 | 527 | set_ctrl(check_iff->in(1), check_iff->in(0)); |
kvn@2877 | 528 | |
kvn@2727 | 529 | #ifndef PRODUCT |
kvn@2877 | 530 | // report that the loop predication has been actually performed |
kvn@2877 | 531 | // for this loop |
kvn@2877 | 532 | if (TraceLoopLimitCheck) { |
kvn@2877 | 533 | tty->print_cr("Counted Loop Limit Check generated:"); |
kvn@2877 | 534 | debug_only( bol->dump(2); ) |
kvn@2877 | 535 | } |
kvn@2877 | 536 | #endif |
kvn@2727 | 537 | } |
kvn@2877 | 538 | |
kvn@2877 | 539 | if (phi_incr != NULL) { |
kvn@2877 | 540 | // If compare points directly to the phi we need to adjust |
kvn@2877 | 541 | // the compare so that it points to the incr. Limit have |
kvn@2877 | 542 | // to be adjusted to keep trip count the same and we |
kvn@2877 | 543 | // should avoid int overflow. |
kvn@2877 | 544 | // |
kvn@2877 | 545 | // i = init; do {} while(i++ < limit); |
kvn@2877 | 546 | // is converted to |
kvn@2877 | 547 | // i = init; do {} while(++i < limit+1); |
kvn@2877 | 548 | // |
kvn@4115 | 549 | limit = gvn->transform(new (C) AddINode(limit, stride)); |
kvn@2877 | 550 | } |
kvn@2877 | 551 | |
kvn@2877 | 552 | // Now we need to canonicalize loop condition. |
kvn@2877 | 553 | if (bt == BoolTest::ne) { |
kvn@2877 | 554 | assert(stride_con == 1 || stride_con == -1, "simple increment only"); |
kvn@2979 | 555 | // 'ne' can be replaced with 'lt' only when init < limit. |
kvn@2979 | 556 | if (stride_con > 0 && init_t->_hi < limit_t->_lo) |
kvn@2979 | 557 | bt = BoolTest::lt; |
kvn@2979 | 558 | // 'ne' can be replaced with 'gt' only when init > limit. |
kvn@2979 | 559 | if (stride_con < 0 && init_t->_lo > limit_t->_hi) |
kvn@2979 | 560 | bt = BoolTest::gt; |
kvn@2877 | 561 | } |
kvn@2877 | 562 | |
kvn@2877 | 563 | if (incl_limit) { |
kvn@2877 | 564 | // The limit check guaranties that 'limit <= (max_jint - stride)' so |
kvn@2877 | 565 | // we can convert 'i <= limit' to 'i < limit+1' since stride != 0. |
kvn@2877 | 566 | // |
kvn@2877 | 567 | Node* one = (stride_con > 0) ? gvn->intcon( 1) : gvn->intcon(-1); |
kvn@4115 | 568 | limit = gvn->transform(new (C) AddINode(limit, one)); |
kvn@2877 | 569 | if (bt == BoolTest::le) |
kvn@2877 | 570 | bt = BoolTest::lt; |
kvn@2877 | 571 | else if (bt == BoolTest::ge) |
kvn@2877 | 572 | bt = BoolTest::gt; |
kvn@2877 | 573 | else |
kvn@2877 | 574 | ShouldNotReachHere(); |
kvn@2877 | 575 | } |
kvn@2877 | 576 | set_subtree_ctrl( limit ); |
kvn@2877 | 577 | |
kvn@2877 | 578 | } else { // LoopLimitCheck |
kvn@2877 | 579 | |
duke@435 | 580 | // If compare points to incr, we are ok. Otherwise the compare |
duke@435 | 581 | // can directly point to the phi; in this case adjust the compare so that |
twisti@1040 | 582 | // it points to the incr by adjusting the limit. |
kvn@2665 | 583 | if (cmp->in(1) == phi || cmp->in(2) == phi) |
kvn@4115 | 584 | limit = gvn->transform(new (C) AddINode(limit,stride)); |
duke@435 | 585 | |
duke@435 | 586 | // trip-count for +-tive stride should be: (limit - init_trip + stride - 1)/stride. |
duke@435 | 587 | // Final value for iterator should be: trip_count * stride + init_trip. |
duke@435 | 588 | Node *one_p = gvn->intcon( 1); |
duke@435 | 589 | Node *one_m = gvn->intcon(-1); |
duke@435 | 590 | |
duke@435 | 591 | Node *trip_count = NULL; |
duke@435 | 592 | switch( bt ) { |
duke@435 | 593 | case BoolTest::eq: |
kvn@2665 | 594 | ShouldNotReachHere(); |
duke@435 | 595 | case BoolTest::ne: // Ahh, the case we desire |
kvn@2665 | 596 | if (stride_con == 1) |
kvn@4115 | 597 | trip_count = gvn->transform(new (C) SubINode(limit,init_trip)); |
kvn@2665 | 598 | else if (stride_con == -1) |
kvn@4115 | 599 | trip_count = gvn->transform(new (C) SubINode(init_trip,limit)); |
duke@435 | 600 | else |
kvn@2665 | 601 | ShouldNotReachHere(); |
kvn@2665 | 602 | set_subtree_ctrl(trip_count); |
duke@435 | 603 | //_loop.map(trip_count->_idx,loop(limit)); |
duke@435 | 604 | break; |
duke@435 | 605 | case BoolTest::le: // Maybe convert to '<' case |
kvn@4115 | 606 | limit = gvn->transform(new (C) AddINode(limit,one_p)); |
duke@435 | 607 | set_subtree_ctrl( limit ); |
duke@435 | 608 | hook->init_req(4, limit); |
duke@435 | 609 | |
duke@435 | 610 | bt = BoolTest::lt; |
duke@435 | 611 | // Make the new limit be in the same loop nest as the old limit |
duke@435 | 612 | //_loop.map(limit->_idx,limit_loop); |
duke@435 | 613 | // Fall into next case |
duke@435 | 614 | case BoolTest::lt: { // Maybe convert to '!=' case |
kvn@2665 | 615 | if (stride_con < 0) // Count down loop rolls through MAXINT |
kvn@2665 | 616 | ShouldNotReachHere(); |
kvn@4115 | 617 | Node *range = gvn->transform(new (C) SubINode(limit,init_trip)); |
duke@435 | 618 | set_subtree_ctrl( range ); |
duke@435 | 619 | hook->init_req(0, range); |
duke@435 | 620 | |
kvn@4115 | 621 | Node *bias = gvn->transform(new (C) AddINode(range,stride)); |
duke@435 | 622 | set_subtree_ctrl( bias ); |
duke@435 | 623 | hook->init_req(1, bias); |
duke@435 | 624 | |
kvn@4115 | 625 | Node *bias1 = gvn->transform(new (C) AddINode(bias,one_m)); |
duke@435 | 626 | set_subtree_ctrl( bias1 ); |
duke@435 | 627 | hook->init_req(2, bias1); |
duke@435 | 628 | |
kvn@4115 | 629 | trip_count = gvn->transform(new (C) DivINode(0,bias1,stride)); |
duke@435 | 630 | set_subtree_ctrl( trip_count ); |
duke@435 | 631 | hook->init_req(3, trip_count); |
duke@435 | 632 | break; |
duke@435 | 633 | } |
duke@435 | 634 | |
duke@435 | 635 | case BoolTest::ge: // Maybe convert to '>' case |
kvn@4115 | 636 | limit = gvn->transform(new (C) AddINode(limit,one_m)); |
duke@435 | 637 | set_subtree_ctrl( limit ); |
duke@435 | 638 | hook->init_req(4 ,limit); |
duke@435 | 639 | |
duke@435 | 640 | bt = BoolTest::gt; |
duke@435 | 641 | // Make the new limit be in the same loop nest as the old limit |
duke@435 | 642 | //_loop.map(limit->_idx,limit_loop); |
duke@435 | 643 | // Fall into next case |
duke@435 | 644 | case BoolTest::gt: { // Maybe convert to '!=' case |
kvn@2665 | 645 | if (stride_con > 0) // count up loop rolls through MININT |
kvn@2665 | 646 | ShouldNotReachHere(); |
kvn@4115 | 647 | Node *range = gvn->transform(new (C) SubINode(limit,init_trip)); |
duke@435 | 648 | set_subtree_ctrl( range ); |
duke@435 | 649 | hook->init_req(0, range); |
duke@435 | 650 | |
kvn@4115 | 651 | Node *bias = gvn->transform(new (C) AddINode(range,stride)); |
duke@435 | 652 | set_subtree_ctrl( bias ); |
duke@435 | 653 | hook->init_req(1, bias); |
duke@435 | 654 | |
kvn@4115 | 655 | Node *bias1 = gvn->transform(new (C) AddINode(bias,one_p)); |
duke@435 | 656 | set_subtree_ctrl( bias1 ); |
duke@435 | 657 | hook->init_req(2, bias1); |
duke@435 | 658 | |
kvn@4115 | 659 | trip_count = gvn->transform(new (C) DivINode(0,bias1,stride)); |
duke@435 | 660 | set_subtree_ctrl( trip_count ); |
duke@435 | 661 | hook->init_req(3, trip_count); |
duke@435 | 662 | break; |
duke@435 | 663 | } |
kvn@2665 | 664 | } // switch( bt ) |
duke@435 | 665 | |
kvn@4115 | 666 | Node *span = gvn->transform(new (C) MulINode(trip_count,stride)); |
duke@435 | 667 | set_subtree_ctrl( span ); |
duke@435 | 668 | hook->init_req(5, span); |
duke@435 | 669 | |
kvn@4115 | 670 | limit = gvn->transform(new (C) AddINode(span,init_trip)); |
duke@435 | 671 | set_subtree_ctrl( limit ); |
duke@435 | 672 | |
kvn@2877 | 673 | } // LoopLimitCheck |
kvn@2877 | 674 | |
kvn@2665 | 675 | // Check for SafePoint on backedge and remove |
kvn@2665 | 676 | Node *sfpt = x->in(LoopNode::LoopBackControl); |
kvn@2665 | 677 | if (sfpt->Opcode() == Op_SafePoint && is_deleteable_safept(sfpt)) { |
kvn@2665 | 678 | lazy_replace( sfpt, iftrue ); |
kvn@4023 | 679 | if (loop->_safepts != NULL) { |
kvn@4023 | 680 | loop->_safepts->yank(sfpt); |
kvn@4023 | 681 | } |
kvn@2665 | 682 | loop->_tail = iftrue; |
kvn@2665 | 683 | } |
kvn@2665 | 684 | |
duke@435 | 685 | // Build a canonical trip test. |
duke@435 | 686 | // Clone code, as old values may be in use. |
duke@435 | 687 | incr = incr->clone(); |
kvn@3135 | 688 | incr->set_req(1,phi); |
duke@435 | 689 | incr->set_req(2,stride); |
duke@435 | 690 | incr = _igvn.register_new_node_with_optimizer(incr); |
duke@435 | 691 | set_early_ctrl( incr ); |
kvn@3135 | 692 | _igvn.hash_delete(phi); |
kvn@3135 | 693 | phi->set_req_X( LoopNode::LoopBackControl, incr, &_igvn ); |
kvn@3135 | 694 | |
kvn@3135 | 695 | // If phi type is more restrictive than Int, raise to |
kvn@3135 | 696 | // Int to prevent (almost) infinite recursion in igvn |
kvn@3135 | 697 | // which can only handle integer types for constants or minint..maxint. |
kvn@3135 | 698 | if (!TypeInt::INT->higher_equal(phi->bottom_type())) { |
kvn@3135 | 699 | Node* nphi = PhiNode::make(phi->in(0), phi->in(LoopNode::EntryControl), TypeInt::INT); |
kvn@3135 | 700 | nphi->set_req(LoopNode::LoopBackControl, phi->in(LoopNode::LoopBackControl)); |
kvn@3135 | 701 | nphi = _igvn.register_new_node_with_optimizer(nphi); |
kvn@3135 | 702 | set_ctrl(nphi, get_ctrl(phi)); |
kvn@3135 | 703 | _igvn.replace_node(phi, nphi); |
kvn@3135 | 704 | phi = nphi->as_Phi(); |
kvn@3135 | 705 | } |
duke@435 | 706 | cmp = cmp->clone(); |
duke@435 | 707 | cmp->set_req(1,incr); |
duke@435 | 708 | cmp->set_req(2,limit); |
duke@435 | 709 | cmp = _igvn.register_new_node_with_optimizer(cmp); |
duke@435 | 710 | set_ctrl(cmp, iff->in(0)); |
duke@435 | 711 | |
kvn@2665 | 712 | test = test->clone()->as_Bool(); |
kvn@2665 | 713 | (*(BoolTest*)&test->_test)._test = bt; |
duke@435 | 714 | test->set_req(1,cmp); |
duke@435 | 715 | _igvn.register_new_node_with_optimizer(test); |
duke@435 | 716 | set_ctrl(test, iff->in(0)); |
duke@435 | 717 | |
duke@435 | 718 | // Replace the old IfNode with a new LoopEndNode |
kvn@4115 | 719 | Node *lex = _igvn.register_new_node_with_optimizer(new (C) CountedLoopEndNode( iff->in(0), test, cl_prob, iff->as_If()->_fcnt )); |
duke@435 | 720 | IfNode *le = lex->as_If(); |
duke@435 | 721 | uint dd = dom_depth(iff); |
duke@435 | 722 | set_idom(le, le->in(0), dd); // Update dominance for loop exit |
duke@435 | 723 | set_loop(le, loop); |
duke@435 | 724 | |
duke@435 | 725 | // Get the loop-exit control |
kvn@2665 | 726 | Node *iffalse = iff->as_If()->proj_out(!(iftrue_op == Op_IfTrue)); |
duke@435 | 727 | |
duke@435 | 728 | // Need to swap loop-exit and loop-back control? |
kvn@2665 | 729 | if (iftrue_op == Op_IfFalse) { |
kvn@4115 | 730 | Node *ift2=_igvn.register_new_node_with_optimizer(new (C) IfTrueNode (le)); |
kvn@4115 | 731 | Node *iff2=_igvn.register_new_node_with_optimizer(new (C) IfFalseNode(le)); |
duke@435 | 732 | |
duke@435 | 733 | loop->_tail = back_control = ift2; |
duke@435 | 734 | set_loop(ift2, loop); |
kvn@2665 | 735 | set_loop(iff2, get_loop(iffalse)); |
duke@435 | 736 | |
duke@435 | 737 | // Lazy update of 'get_ctrl' mechanism. |
kvn@2665 | 738 | lazy_replace_proj( iffalse, iff2 ); |
kvn@2665 | 739 | lazy_replace_proj( iftrue, ift2 ); |
duke@435 | 740 | |
duke@435 | 741 | // Swap names |
kvn@2665 | 742 | iffalse = iff2; |
kvn@2665 | 743 | iftrue = ift2; |
duke@435 | 744 | } else { |
kvn@2665 | 745 | _igvn.hash_delete(iffalse); |
duke@435 | 746 | _igvn.hash_delete(iftrue); |
kvn@2665 | 747 | iffalse->set_req_X( 0, le, &_igvn ); |
kvn@2665 | 748 | iftrue ->set_req_X( 0, le, &_igvn ); |
duke@435 | 749 | } |
duke@435 | 750 | |
kvn@2665 | 751 | set_idom(iftrue, le, dd+1); |
kvn@2665 | 752 | set_idom(iffalse, le, dd+1); |
kvn@2665 | 753 | assert(iff->outcnt() == 0, "should be dead now"); |
kvn@2665 | 754 | lazy_replace( iff, le ); // fix 'get_ctrl' |
duke@435 | 755 | |
duke@435 | 756 | // Now setup a new CountedLoopNode to replace the existing LoopNode |
kvn@4115 | 757 | CountedLoopNode *l = new (C) CountedLoopNode(init_control, back_control); |
kvn@2665 | 758 | l->set_unswitch_count(x->as_Loop()->unswitch_count()); // Preserve |
duke@435 | 759 | // The following assert is approximately true, and defines the intention |
duke@435 | 760 | // of can_be_counted_loop. It fails, however, because phase->type |
duke@435 | 761 | // is not yet initialized for this loop and its parts. |
duke@435 | 762 | //assert(l->can_be_counted_loop(this), "sanity"); |
duke@435 | 763 | _igvn.register_new_node_with_optimizer(l); |
duke@435 | 764 | set_loop(l, loop); |
duke@435 | 765 | loop->_head = l; |
duke@435 | 766 | // Fix all data nodes placed at the old loop head. |
duke@435 | 767 | // Uses the lazy-update mechanism of 'get_ctrl'. |
duke@435 | 768 | lazy_replace( x, l ); |
duke@435 | 769 | set_idom(l, init_control, dom_depth(x)); |
duke@435 | 770 | |
twisti@1040 | 771 | // Check for immediately preceding SafePoint and remove |
duke@435 | 772 | Node *sfpt2 = le->in(0); |
kvn@4023 | 773 | if (sfpt2->Opcode() == Op_SafePoint && is_deleteable_safept(sfpt2)) { |
duke@435 | 774 | lazy_replace( sfpt2, sfpt2->in(TypeFunc::Control)); |
kvn@4023 | 775 | if (loop->_safepts != NULL) { |
kvn@4023 | 776 | loop->_safepts->yank(sfpt2); |
kvn@4023 | 777 | } |
kvn@4023 | 778 | } |
duke@435 | 779 | |
duke@435 | 780 | // Free up intermediate goo |
duke@435 | 781 | _igvn.remove_dead_node(hook); |
duke@435 | 782 | |
kvn@2665 | 783 | #ifdef ASSERT |
kvn@2665 | 784 | assert(l->is_valid_counted_loop(), "counted loop shape is messed up"); |
kvn@2665 | 785 | assert(l == loop->_head && l->phi() == phi && l->loopexit() == lex, "" ); |
kvn@2665 | 786 | #endif |
kvn@2877 | 787 | #ifndef PRODUCT |
kvn@2877 | 788 | if (TraceLoopOpts) { |
kvn@2877 | 789 | tty->print("Counted "); |
kvn@2877 | 790 | loop->dump_head(); |
kvn@2877 | 791 | } |
kvn@2877 | 792 | #endif |
kvn@2665 | 793 | |
sla@5237 | 794 | C->print_method(PHASE_AFTER_CLOOPS, 3); |
duke@435 | 795 | |
kvn@2665 | 796 | return true; |
duke@435 | 797 | } |
duke@435 | 798 | |
kvn@2877 | 799 | //----------------------exact_limit------------------------------------------- |
kvn@2877 | 800 | Node* PhaseIdealLoop::exact_limit( IdealLoopTree *loop ) { |
kvn@2877 | 801 | assert(loop->_head->is_CountedLoop(), ""); |
kvn@2877 | 802 | CountedLoopNode *cl = loop->_head->as_CountedLoop(); |
kvn@3048 | 803 | assert(cl->is_valid_counted_loop(), ""); |
kvn@2877 | 804 | |
kvn@2877 | 805 | if (!LoopLimitCheck || ABS(cl->stride_con()) == 1 || |
kvn@2877 | 806 | cl->limit()->Opcode() == Op_LoopLimit) { |
kvn@2877 | 807 | // Old code has exact limit (it could be incorrect in case of int overflow). |
kvn@2877 | 808 | // Loop limit is exact with stride == 1. And loop may already have exact limit. |
kvn@2877 | 809 | return cl->limit(); |
kvn@2877 | 810 | } |
kvn@2877 | 811 | Node *limit = NULL; |
kvn@2877 | 812 | #ifdef ASSERT |
kvn@2877 | 813 | BoolTest::mask bt = cl->loopexit()->test_trip(); |
kvn@2877 | 814 | assert(bt == BoolTest::lt || bt == BoolTest::gt, "canonical test is expected"); |
kvn@2877 | 815 | #endif |
kvn@2877 | 816 | if (cl->has_exact_trip_count()) { |
kvn@2877 | 817 | // Simple case: loop has constant boundaries. |
vlivanov@4157 | 818 | // Use jlongs to avoid integer overflow. |
kvn@2877 | 819 | int stride_con = cl->stride_con(); |
vlivanov@4157 | 820 | jlong init_con = cl->init_trip()->get_int(); |
vlivanov@4157 | 821 | jlong limit_con = cl->limit()->get_int(); |
kvn@2877 | 822 | julong trip_cnt = cl->trip_count(); |
vlivanov@4157 | 823 | jlong final_con = init_con + trip_cnt*stride_con; |
kvn@2877 | 824 | int final_int = (int)final_con; |
kvn@2877 | 825 | // The final value should be in integer range since the loop |
kvn@2877 | 826 | // is counted and the limit was checked for overflow. |
vlivanov@4157 | 827 | assert(final_con == (jlong)final_int, "final value should be integer"); |
kvn@2877 | 828 | limit = _igvn.intcon(final_int); |
kvn@2877 | 829 | } else { |
kvn@2877 | 830 | // Create new LoopLimit node to get exact limit (final iv value). |
kvn@4115 | 831 | limit = new (C) LoopLimitNode(C, cl->init_trip(), cl->limit(), cl->stride()); |
kvn@2877 | 832 | register_new_node(limit, cl->in(LoopNode::EntryControl)); |
kvn@2877 | 833 | } |
kvn@2877 | 834 | assert(limit != NULL, "sanity"); |
kvn@2877 | 835 | return limit; |
kvn@2877 | 836 | } |
duke@435 | 837 | |
duke@435 | 838 | //------------------------------Ideal------------------------------------------ |
duke@435 | 839 | // Return a node which is more "ideal" than the current node. |
duke@435 | 840 | // Attempt to convert into a counted-loop. |
duke@435 | 841 | Node *LoopNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 842 | if (!can_be_counted_loop(phase)) { |
duke@435 | 843 | phase->C->set_major_progress(); |
duke@435 | 844 | } |
duke@435 | 845 | return RegionNode::Ideal(phase, can_reshape); |
duke@435 | 846 | } |
duke@435 | 847 | |
duke@435 | 848 | |
duke@435 | 849 | //============================================================================= |
duke@435 | 850 | //------------------------------Ideal------------------------------------------ |
duke@435 | 851 | // Return a node which is more "ideal" than the current node. |
duke@435 | 852 | // Attempt to convert into a counted-loop. |
duke@435 | 853 | Node *CountedLoopNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 854 | return RegionNode::Ideal(phase, can_reshape); |
duke@435 | 855 | } |
duke@435 | 856 | |
duke@435 | 857 | //------------------------------dump_spec-------------------------------------- |
duke@435 | 858 | // Dump special per-node info |
duke@435 | 859 | #ifndef PRODUCT |
duke@435 | 860 | void CountedLoopNode::dump_spec(outputStream *st) const { |
duke@435 | 861 | LoopNode::dump_spec(st); |
kvn@2877 | 862 | if (stride_is_con()) { |
duke@435 | 863 | st->print("stride: %d ",stride_con()); |
duke@435 | 864 | } |
kvn@2877 | 865 | if (is_pre_loop ()) st->print("pre of N%d" , _main_idx); |
kvn@2877 | 866 | if (is_main_loop()) st->print("main of N%d", _idx); |
kvn@2877 | 867 | if (is_post_loop()) st->print("post of N%d", _main_idx); |
duke@435 | 868 | } |
duke@435 | 869 | #endif |
duke@435 | 870 | |
duke@435 | 871 | //============================================================================= |
duke@435 | 872 | int CountedLoopEndNode::stride_con() const { |
duke@435 | 873 | return stride()->bottom_type()->is_int()->get_con(); |
duke@435 | 874 | } |
duke@435 | 875 | |
kvn@2877 | 876 | //============================================================================= |
kvn@2877 | 877 | //------------------------------Value----------------------------------------- |
kvn@2877 | 878 | const Type *LoopLimitNode::Value( PhaseTransform *phase ) const { |
kvn@2877 | 879 | const Type* init_t = phase->type(in(Init)); |
kvn@2877 | 880 | const Type* limit_t = phase->type(in(Limit)); |
kvn@2877 | 881 | const Type* stride_t = phase->type(in(Stride)); |
kvn@2877 | 882 | // Either input is TOP ==> the result is TOP |
kvn@2877 | 883 | if (init_t == Type::TOP) return Type::TOP; |
kvn@2877 | 884 | if (limit_t == Type::TOP) return Type::TOP; |
kvn@2877 | 885 | if (stride_t == Type::TOP) return Type::TOP; |
kvn@2877 | 886 | |
kvn@2877 | 887 | int stride_con = stride_t->is_int()->get_con(); |
kvn@2877 | 888 | if (stride_con == 1) |
kvn@2877 | 889 | return NULL; // Identity |
kvn@2877 | 890 | |
kvn@2877 | 891 | if (init_t->is_int()->is_con() && limit_t->is_int()->is_con()) { |
vlivanov@4157 | 892 | // Use jlongs to avoid integer overflow. |
vlivanov@4157 | 893 | jlong init_con = init_t->is_int()->get_con(); |
vlivanov@4157 | 894 | jlong limit_con = limit_t->is_int()->get_con(); |
kvn@2877 | 895 | int stride_m = stride_con - (stride_con > 0 ? 1 : -1); |
vlivanov@4157 | 896 | jlong trip_count = (limit_con - init_con + stride_m)/stride_con; |
vlivanov@4157 | 897 | jlong final_con = init_con + stride_con*trip_count; |
kvn@2877 | 898 | int final_int = (int)final_con; |
kvn@2877 | 899 | // The final value should be in integer range since the loop |
kvn@2877 | 900 | // is counted and the limit was checked for overflow. |
vlivanov@4157 | 901 | assert(final_con == (jlong)final_int, "final value should be integer"); |
kvn@2877 | 902 | return TypeInt::make(final_int); |
kvn@2877 | 903 | } |
kvn@2877 | 904 | |
kvn@2877 | 905 | return bottom_type(); // TypeInt::INT |
kvn@2877 | 906 | } |
kvn@2877 | 907 | |
kvn@2877 | 908 | //------------------------------Ideal------------------------------------------ |
kvn@2877 | 909 | // Return a node which is more "ideal" than the current node. |
kvn@2877 | 910 | Node *LoopLimitNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
kvn@2877 | 911 | if (phase->type(in(Init)) == Type::TOP || |
kvn@2877 | 912 | phase->type(in(Limit)) == Type::TOP || |
kvn@2877 | 913 | phase->type(in(Stride)) == Type::TOP) |
kvn@2877 | 914 | return NULL; // Dead |
kvn@2877 | 915 | |
kvn@2877 | 916 | int stride_con = phase->type(in(Stride))->is_int()->get_con(); |
kvn@2877 | 917 | if (stride_con == 1) |
kvn@2877 | 918 | return NULL; // Identity |
kvn@2877 | 919 | |
kvn@2877 | 920 | if (in(Init)->is_Con() && in(Limit)->is_Con()) |
kvn@2877 | 921 | return NULL; // Value |
kvn@2877 | 922 | |
kvn@2877 | 923 | // Delay following optimizations until all loop optimizations |
kvn@2877 | 924 | // done to keep Ideal graph simple. |
kvn@2877 | 925 | if (!can_reshape || phase->C->major_progress()) |
kvn@2877 | 926 | return NULL; |
kvn@2877 | 927 | |
kvn@2877 | 928 | const TypeInt* init_t = phase->type(in(Init) )->is_int(); |
kvn@2877 | 929 | const TypeInt* limit_t = phase->type(in(Limit))->is_int(); |
kvn@2877 | 930 | int stride_p; |
vlivanov@4157 | 931 | jlong lim, ini; |
kvn@2877 | 932 | julong max; |
kvn@2877 | 933 | if (stride_con > 0) { |
kvn@2877 | 934 | stride_p = stride_con; |
kvn@2877 | 935 | lim = limit_t->_hi; |
kvn@2877 | 936 | ini = init_t->_lo; |
kvn@2877 | 937 | max = (julong)max_jint; |
kvn@2877 | 938 | } else { |
kvn@2877 | 939 | stride_p = -stride_con; |
kvn@2877 | 940 | lim = init_t->_hi; |
kvn@2877 | 941 | ini = limit_t->_lo; |
kvn@2877 | 942 | max = (julong)min_jint; |
kvn@2877 | 943 | } |
kvn@2877 | 944 | julong range = lim - ini + stride_p; |
kvn@2877 | 945 | if (range <= max) { |
kvn@2877 | 946 | // Convert to integer expression if it is not overflow. |
kvn@2877 | 947 | Node* stride_m = phase->intcon(stride_con - (stride_con > 0 ? 1 : -1)); |
kvn@4115 | 948 | Node *range = phase->transform(new (phase->C) SubINode(in(Limit), in(Init))); |
kvn@4115 | 949 | Node *bias = phase->transform(new (phase->C) AddINode(range, stride_m)); |
kvn@4115 | 950 | Node *trip = phase->transform(new (phase->C) DivINode(0, bias, in(Stride))); |
kvn@4115 | 951 | Node *span = phase->transform(new (phase->C) MulINode(trip, in(Stride))); |
kvn@4115 | 952 | return new (phase->C) AddINode(span, in(Init)); // exact limit |
kvn@2877 | 953 | } |
kvn@2877 | 954 | |
kvn@2877 | 955 | if (is_power_of_2(stride_p) || // divisor is 2^n |
kvn@2877 | 956 | !Matcher::has_match_rule(Op_LoopLimit)) { // or no specialized Mach node? |
kvn@2877 | 957 | // Convert to long expression to avoid integer overflow |
kvn@2877 | 958 | // and let igvn optimizer convert this division. |
kvn@2877 | 959 | // |
kvn@4115 | 960 | Node* init = phase->transform( new (phase->C) ConvI2LNode(in(Init))); |
kvn@4115 | 961 | Node* limit = phase->transform( new (phase->C) ConvI2LNode(in(Limit))); |
kvn@2877 | 962 | Node* stride = phase->longcon(stride_con); |
kvn@2877 | 963 | Node* stride_m = phase->longcon(stride_con - (stride_con > 0 ? 1 : -1)); |
kvn@2877 | 964 | |
kvn@4115 | 965 | Node *range = phase->transform(new (phase->C) SubLNode(limit, init)); |
kvn@4115 | 966 | Node *bias = phase->transform(new (phase->C) AddLNode(range, stride_m)); |
kvn@2877 | 967 | Node *span; |
kvn@2877 | 968 | if (stride_con > 0 && is_power_of_2(stride_p)) { |
kvn@2877 | 969 | // bias >= 0 if stride >0, so if stride is 2^n we can use &(-stride) |
kvn@2877 | 970 | // and avoid generating rounding for division. Zero trip guard should |
kvn@2877 | 971 | // guarantee that init < limit but sometimes the guard is missing and |
kvn@2877 | 972 | // we can get situation when init > limit. Note, for the empty loop |
kvn@2877 | 973 | // optimization zero trip guard is generated explicitly which leaves |
kvn@2877 | 974 | // only RCE predicate where exact limit is used and the predicate |
kvn@2877 | 975 | // will simply fail forcing recompilation. |
kvn@2877 | 976 | Node* neg_stride = phase->longcon(-stride_con); |
kvn@4115 | 977 | span = phase->transform(new (phase->C) AndLNode(bias, neg_stride)); |
kvn@2877 | 978 | } else { |
kvn@4115 | 979 | Node *trip = phase->transform(new (phase->C) DivLNode(0, bias, stride)); |
kvn@4115 | 980 | span = phase->transform(new (phase->C) MulLNode(trip, stride)); |
kvn@2877 | 981 | } |
kvn@2877 | 982 | // Convert back to int |
kvn@4115 | 983 | Node *span_int = phase->transform(new (phase->C) ConvL2INode(span)); |
kvn@4115 | 984 | return new (phase->C) AddINode(span_int, in(Init)); // exact limit |
kvn@2877 | 985 | } |
kvn@2877 | 986 | |
kvn@2877 | 987 | return NULL; // No progress |
kvn@2877 | 988 | } |
kvn@2877 | 989 | |
kvn@2877 | 990 | //------------------------------Identity--------------------------------------- |
kvn@2877 | 991 | // If stride == 1 return limit node. |
kvn@2877 | 992 | Node *LoopLimitNode::Identity( PhaseTransform *phase ) { |
kvn@2877 | 993 | int stride_con = phase->type(in(Stride))->is_int()->get_con(); |
kvn@2877 | 994 | if (stride_con == 1 || stride_con == -1) |
kvn@2877 | 995 | return in(Limit); |
kvn@2877 | 996 | return this; |
kvn@2877 | 997 | } |
kvn@2877 | 998 | |
kvn@2877 | 999 | //============================================================================= |
duke@435 | 1000 | //----------------------match_incr_with_optional_truncation-------------------- |
duke@435 | 1001 | // Match increment with optional truncation: |
duke@435 | 1002 | // CHAR: (i+1)&0x7fff, BYTE: ((i+1)<<8)>>8, or SHORT: ((i+1)<<16)>>16 |
duke@435 | 1003 | // Return NULL for failure. Success returns the increment node. |
duke@435 | 1004 | Node* CountedLoopNode::match_incr_with_optional_truncation( |
duke@435 | 1005 | Node* expr, Node** trunc1, Node** trunc2, const TypeInt** trunc_type) { |
duke@435 | 1006 | // Quick cutouts: |
brutisso@3489 | 1007 | if (expr == NULL || expr->req() != 3) return NULL; |
duke@435 | 1008 | |
duke@435 | 1009 | Node *t1 = NULL; |
duke@435 | 1010 | Node *t2 = NULL; |
duke@435 | 1011 | const TypeInt* trunc_t = TypeInt::INT; |
duke@435 | 1012 | Node* n1 = expr; |
duke@435 | 1013 | int n1op = n1->Opcode(); |
duke@435 | 1014 | |
duke@435 | 1015 | // Try to strip (n1 & M) or (n1 << N >> N) from n1. |
duke@435 | 1016 | if (n1op == Op_AndI && |
duke@435 | 1017 | n1->in(2)->is_Con() && |
duke@435 | 1018 | n1->in(2)->bottom_type()->is_int()->get_con() == 0x7fff) { |
duke@435 | 1019 | // %%% This check should match any mask of 2**K-1. |
duke@435 | 1020 | t1 = n1; |
duke@435 | 1021 | n1 = t1->in(1); |
duke@435 | 1022 | n1op = n1->Opcode(); |
duke@435 | 1023 | trunc_t = TypeInt::CHAR; |
duke@435 | 1024 | } else if (n1op == Op_RShiftI && |
duke@435 | 1025 | n1->in(1) != NULL && |
duke@435 | 1026 | n1->in(1)->Opcode() == Op_LShiftI && |
duke@435 | 1027 | n1->in(2) == n1->in(1)->in(2) && |
duke@435 | 1028 | n1->in(2)->is_Con()) { |
duke@435 | 1029 | jint shift = n1->in(2)->bottom_type()->is_int()->get_con(); |
duke@435 | 1030 | // %%% This check should match any shift in [1..31]. |
duke@435 | 1031 | if (shift == 16 || shift == 8) { |
duke@435 | 1032 | t1 = n1; |
duke@435 | 1033 | t2 = t1->in(1); |
duke@435 | 1034 | n1 = t2->in(1); |
duke@435 | 1035 | n1op = n1->Opcode(); |
duke@435 | 1036 | if (shift == 16) { |
duke@435 | 1037 | trunc_t = TypeInt::SHORT; |
duke@435 | 1038 | } else if (shift == 8) { |
duke@435 | 1039 | trunc_t = TypeInt::BYTE; |
duke@435 | 1040 | } |
duke@435 | 1041 | } |
duke@435 | 1042 | } |
duke@435 | 1043 | |
duke@435 | 1044 | // If (maybe after stripping) it is an AddI, we won: |
duke@435 | 1045 | if (n1op == Op_AddI) { |
duke@435 | 1046 | *trunc1 = t1; |
duke@435 | 1047 | *trunc2 = t2; |
duke@435 | 1048 | *trunc_type = trunc_t; |
duke@435 | 1049 | return n1; |
duke@435 | 1050 | } |
duke@435 | 1051 | |
duke@435 | 1052 | // failed |
duke@435 | 1053 | return NULL; |
duke@435 | 1054 | } |
duke@435 | 1055 | |
duke@435 | 1056 | |
duke@435 | 1057 | //------------------------------filtered_type-------------------------------- |
duke@435 | 1058 | // Return a type based on condition control flow |
duke@435 | 1059 | // A successful return will be a type that is restricted due |
duke@435 | 1060 | // to a series of dominating if-tests, such as: |
duke@435 | 1061 | // if (i < 10) { |
duke@435 | 1062 | // if (i > 0) { |
duke@435 | 1063 | // here: "i" type is [1..10) |
duke@435 | 1064 | // } |
duke@435 | 1065 | // } |
duke@435 | 1066 | // or a control flow merge |
duke@435 | 1067 | // if (i < 10) { |
duke@435 | 1068 | // do { |
duke@435 | 1069 | // phi( , ) -- at top of loop type is [min_int..10) |
duke@435 | 1070 | // i = ? |
duke@435 | 1071 | // } while ( i < 10) |
duke@435 | 1072 | // |
duke@435 | 1073 | const TypeInt* PhaseIdealLoop::filtered_type( Node *n, Node* n_ctrl) { |
duke@435 | 1074 | assert(n && n->bottom_type()->is_int(), "must be int"); |
duke@435 | 1075 | const TypeInt* filtered_t = NULL; |
duke@435 | 1076 | if (!n->is_Phi()) { |
duke@435 | 1077 | assert(n_ctrl != NULL || n_ctrl == C->top(), "valid control"); |
duke@435 | 1078 | filtered_t = filtered_type_from_dominators(n, n_ctrl); |
duke@435 | 1079 | |
duke@435 | 1080 | } else { |
duke@435 | 1081 | Node* phi = n->as_Phi(); |
duke@435 | 1082 | Node* region = phi->in(0); |
duke@435 | 1083 | assert(n_ctrl == NULL || n_ctrl == region, "ctrl parameter must be region"); |
duke@435 | 1084 | if (region && region != C->top()) { |
duke@435 | 1085 | for (uint i = 1; i < phi->req(); i++) { |
duke@435 | 1086 | Node* val = phi->in(i); |
duke@435 | 1087 | Node* use_c = region->in(i); |
duke@435 | 1088 | const TypeInt* val_t = filtered_type_from_dominators(val, use_c); |
duke@435 | 1089 | if (val_t != NULL) { |
duke@435 | 1090 | if (filtered_t == NULL) { |
duke@435 | 1091 | filtered_t = val_t; |
duke@435 | 1092 | } else { |
duke@435 | 1093 | filtered_t = filtered_t->meet(val_t)->is_int(); |
duke@435 | 1094 | } |
duke@435 | 1095 | } |
duke@435 | 1096 | } |
duke@435 | 1097 | } |
duke@435 | 1098 | } |
duke@435 | 1099 | const TypeInt* n_t = _igvn.type(n)->is_int(); |
duke@435 | 1100 | if (filtered_t != NULL) { |
duke@435 | 1101 | n_t = n_t->join(filtered_t)->is_int(); |
duke@435 | 1102 | } |
duke@435 | 1103 | return n_t; |
duke@435 | 1104 | } |
duke@435 | 1105 | |
duke@435 | 1106 | |
duke@435 | 1107 | //------------------------------filtered_type_from_dominators-------------------------------- |
duke@435 | 1108 | // Return a possibly more restrictive type for val based on condition control flow of dominators |
duke@435 | 1109 | const TypeInt* PhaseIdealLoop::filtered_type_from_dominators( Node* val, Node *use_ctrl) { |
duke@435 | 1110 | if (val->is_Con()) { |
duke@435 | 1111 | return val->bottom_type()->is_int(); |
duke@435 | 1112 | } |
duke@435 | 1113 | uint if_limit = 10; // Max number of dominating if's visited |
duke@435 | 1114 | const TypeInt* rtn_t = NULL; |
duke@435 | 1115 | |
duke@435 | 1116 | if (use_ctrl && use_ctrl != C->top()) { |
duke@435 | 1117 | Node* val_ctrl = get_ctrl(val); |
duke@435 | 1118 | uint val_dom_depth = dom_depth(val_ctrl); |
duke@435 | 1119 | Node* pred = use_ctrl; |
duke@435 | 1120 | uint if_cnt = 0; |
duke@435 | 1121 | while (if_cnt < if_limit) { |
duke@435 | 1122 | if ((pred->Opcode() == Op_IfTrue || pred->Opcode() == Op_IfFalse)) { |
duke@435 | 1123 | if_cnt++; |
never@452 | 1124 | const TypeInt* if_t = IfNode::filtered_int_type(&_igvn, val, pred); |
duke@435 | 1125 | if (if_t != NULL) { |
duke@435 | 1126 | if (rtn_t == NULL) { |
duke@435 | 1127 | rtn_t = if_t; |
duke@435 | 1128 | } else { |
duke@435 | 1129 | rtn_t = rtn_t->join(if_t)->is_int(); |
duke@435 | 1130 | } |
duke@435 | 1131 | } |
duke@435 | 1132 | } |
duke@435 | 1133 | pred = idom(pred); |
duke@435 | 1134 | if (pred == NULL || pred == C->top()) { |
duke@435 | 1135 | break; |
duke@435 | 1136 | } |
duke@435 | 1137 | // Stop if going beyond definition block of val |
duke@435 | 1138 | if (dom_depth(pred) < val_dom_depth) { |
duke@435 | 1139 | break; |
duke@435 | 1140 | } |
duke@435 | 1141 | } |
duke@435 | 1142 | } |
duke@435 | 1143 | return rtn_t; |
duke@435 | 1144 | } |
duke@435 | 1145 | |
duke@435 | 1146 | |
duke@435 | 1147 | //------------------------------dump_spec-------------------------------------- |
duke@435 | 1148 | // Dump special per-node info |
duke@435 | 1149 | #ifndef PRODUCT |
duke@435 | 1150 | void CountedLoopEndNode::dump_spec(outputStream *st) const { |
duke@435 | 1151 | if( in(TestValue)->is_Bool() ) { |
duke@435 | 1152 | BoolTest bt( test_trip()); // Added this for g++. |
duke@435 | 1153 | |
duke@435 | 1154 | st->print("["); |
duke@435 | 1155 | bt.dump_on(st); |
duke@435 | 1156 | st->print("]"); |
duke@435 | 1157 | } |
duke@435 | 1158 | st->print(" "); |
duke@435 | 1159 | IfNode::dump_spec(st); |
duke@435 | 1160 | } |
duke@435 | 1161 | #endif |
duke@435 | 1162 | |
duke@435 | 1163 | //============================================================================= |
duke@435 | 1164 | //------------------------------is_member-------------------------------------- |
duke@435 | 1165 | // Is 'l' a member of 'this'? |
duke@435 | 1166 | int IdealLoopTree::is_member( const IdealLoopTree *l ) const { |
duke@435 | 1167 | while( l->_nest > _nest ) l = l->_parent; |
duke@435 | 1168 | return l == this; |
duke@435 | 1169 | } |
duke@435 | 1170 | |
duke@435 | 1171 | //------------------------------set_nest--------------------------------------- |
duke@435 | 1172 | // Set loop tree nesting depth. Accumulate _has_call bits. |
duke@435 | 1173 | int IdealLoopTree::set_nest( uint depth ) { |
duke@435 | 1174 | _nest = depth; |
duke@435 | 1175 | int bits = _has_call; |
duke@435 | 1176 | if( _child ) bits |= _child->set_nest(depth+1); |
duke@435 | 1177 | if( bits ) _has_call = 1; |
duke@435 | 1178 | if( _next ) bits |= _next ->set_nest(depth ); |
duke@435 | 1179 | return bits; |
duke@435 | 1180 | } |
duke@435 | 1181 | |
duke@435 | 1182 | //------------------------------split_fall_in---------------------------------- |
duke@435 | 1183 | // Split out multiple fall-in edges from the loop header. Move them to a |
duke@435 | 1184 | // private RegionNode before the loop. This becomes the loop landing pad. |
duke@435 | 1185 | void IdealLoopTree::split_fall_in( PhaseIdealLoop *phase, int fall_in_cnt ) { |
duke@435 | 1186 | PhaseIterGVN &igvn = phase->_igvn; |
duke@435 | 1187 | uint i; |
duke@435 | 1188 | |
duke@435 | 1189 | // Make a new RegionNode to be the landing pad. |
kvn@4115 | 1190 | Node *landing_pad = new (phase->C) RegionNode( fall_in_cnt+1 ); |
duke@435 | 1191 | phase->set_loop(landing_pad,_parent); |
duke@435 | 1192 | // Gather all the fall-in control paths into the landing pad |
duke@435 | 1193 | uint icnt = fall_in_cnt; |
duke@435 | 1194 | uint oreq = _head->req(); |
duke@435 | 1195 | for( i = oreq-1; i>0; i-- ) |
duke@435 | 1196 | if( !phase->is_member( this, _head->in(i) ) ) |
duke@435 | 1197 | landing_pad->set_req(icnt--,_head->in(i)); |
duke@435 | 1198 | |
duke@435 | 1199 | // Peel off PhiNode edges as well |
duke@435 | 1200 | for (DUIterator_Fast jmax, j = _head->fast_outs(jmax); j < jmax; j++) { |
duke@435 | 1201 | Node *oj = _head->fast_out(j); |
duke@435 | 1202 | if( oj->is_Phi() ) { |
duke@435 | 1203 | PhiNode* old_phi = oj->as_Phi(); |
duke@435 | 1204 | assert( old_phi->region() == _head, "" ); |
duke@435 | 1205 | igvn.hash_delete(old_phi); // Yank from hash before hacking edges |
duke@435 | 1206 | Node *p = PhiNode::make_blank(landing_pad, old_phi); |
duke@435 | 1207 | uint icnt = fall_in_cnt; |
duke@435 | 1208 | for( i = oreq-1; i>0; i-- ) { |
duke@435 | 1209 | if( !phase->is_member( this, _head->in(i) ) ) { |
duke@435 | 1210 | p->init_req(icnt--, old_phi->in(i)); |
duke@435 | 1211 | // Go ahead and clean out old edges from old phi |
duke@435 | 1212 | old_phi->del_req(i); |
duke@435 | 1213 | } |
duke@435 | 1214 | } |
duke@435 | 1215 | // Search for CSE's here, because ZKM.jar does a lot of |
duke@435 | 1216 | // loop hackery and we need to be a little incremental |
duke@435 | 1217 | // with the CSE to avoid O(N^2) node blow-up. |
duke@435 | 1218 | Node *p2 = igvn.hash_find_insert(p); // Look for a CSE |
duke@435 | 1219 | if( p2 ) { // Found CSE |
duke@435 | 1220 | p->destruct(); // Recover useless new node |
duke@435 | 1221 | p = p2; // Use old node |
duke@435 | 1222 | } else { |
duke@435 | 1223 | igvn.register_new_node_with_optimizer(p, old_phi); |
duke@435 | 1224 | } |
duke@435 | 1225 | // Make old Phi refer to new Phi. |
duke@435 | 1226 | old_phi->add_req(p); |
duke@435 | 1227 | // Check for the special case of making the old phi useless and |
duke@435 | 1228 | // disappear it. In JavaGrande I have a case where this useless |
duke@435 | 1229 | // Phi is the loop limit and prevents recognizing a CountedLoop |
duke@435 | 1230 | // which in turn prevents removing an empty loop. |
duke@435 | 1231 | Node *id_old_phi = old_phi->Identity( &igvn ); |
duke@435 | 1232 | if( id_old_phi != old_phi ) { // Found a simple identity? |
kvn@1976 | 1233 | // Note that I cannot call 'replace_node' here, because |
duke@435 | 1234 | // that will yank the edge from old_phi to the Region and |
duke@435 | 1235 | // I'm mid-iteration over the Region's uses. |
duke@435 | 1236 | for (DUIterator_Last imin, i = old_phi->last_outs(imin); i >= imin; ) { |
duke@435 | 1237 | Node* use = old_phi->last_out(i); |
kvn@3847 | 1238 | igvn.rehash_node_delayed(use); |
duke@435 | 1239 | uint uses_found = 0; |
duke@435 | 1240 | for (uint j = 0; j < use->len(); j++) { |
duke@435 | 1241 | if (use->in(j) == old_phi) { |
duke@435 | 1242 | if (j < use->req()) use->set_req (j, id_old_phi); |
duke@435 | 1243 | else use->set_prec(j, id_old_phi); |
duke@435 | 1244 | uses_found++; |
duke@435 | 1245 | } |
duke@435 | 1246 | } |
duke@435 | 1247 | i -= uses_found; // we deleted 1 or more copies of this edge |
duke@435 | 1248 | } |
duke@435 | 1249 | } |
duke@435 | 1250 | igvn._worklist.push(old_phi); |
duke@435 | 1251 | } |
duke@435 | 1252 | } |
duke@435 | 1253 | // Finally clean out the fall-in edges from the RegionNode |
duke@435 | 1254 | for( i = oreq-1; i>0; i-- ) { |
duke@435 | 1255 | if( !phase->is_member( this, _head->in(i) ) ) { |
duke@435 | 1256 | _head->del_req(i); |
duke@435 | 1257 | } |
duke@435 | 1258 | } |
duke@435 | 1259 | // Transform landing pad |
duke@435 | 1260 | igvn.register_new_node_with_optimizer(landing_pad, _head); |
duke@435 | 1261 | // Insert landing pad into the header |
duke@435 | 1262 | _head->add_req(landing_pad); |
duke@435 | 1263 | } |
duke@435 | 1264 | |
duke@435 | 1265 | //------------------------------split_outer_loop------------------------------- |
duke@435 | 1266 | // Split out the outermost loop from this shared header. |
duke@435 | 1267 | void IdealLoopTree::split_outer_loop( PhaseIdealLoop *phase ) { |
duke@435 | 1268 | PhaseIterGVN &igvn = phase->_igvn; |
duke@435 | 1269 | |
duke@435 | 1270 | // Find index of outermost loop; it should also be my tail. |
duke@435 | 1271 | uint outer_idx = 1; |
duke@435 | 1272 | while( _head->in(outer_idx) != _tail ) outer_idx++; |
duke@435 | 1273 | |
duke@435 | 1274 | // Make a LoopNode for the outermost loop. |
duke@435 | 1275 | Node *ctl = _head->in(LoopNode::EntryControl); |
kvn@4115 | 1276 | Node *outer = new (phase->C) LoopNode( ctl, _head->in(outer_idx) ); |
duke@435 | 1277 | outer = igvn.register_new_node_with_optimizer(outer, _head); |
duke@435 | 1278 | phase->set_created_loop_node(); |
kvn@2727 | 1279 | |
duke@435 | 1280 | // Outermost loop falls into '_head' loop |
kvn@3043 | 1281 | _head->set_req(LoopNode::EntryControl, outer); |
duke@435 | 1282 | _head->del_req(outer_idx); |
duke@435 | 1283 | // Split all the Phis up between '_head' loop and 'outer' loop. |
duke@435 | 1284 | for (DUIterator_Fast jmax, j = _head->fast_outs(jmax); j < jmax; j++) { |
duke@435 | 1285 | Node *out = _head->fast_out(j); |
duke@435 | 1286 | if( out->is_Phi() ) { |
duke@435 | 1287 | PhiNode *old_phi = out->as_Phi(); |
duke@435 | 1288 | assert( old_phi->region() == _head, "" ); |
duke@435 | 1289 | Node *phi = PhiNode::make_blank(outer, old_phi); |
duke@435 | 1290 | phi->init_req(LoopNode::EntryControl, old_phi->in(LoopNode::EntryControl)); |
duke@435 | 1291 | phi->init_req(LoopNode::LoopBackControl, old_phi->in(outer_idx)); |
duke@435 | 1292 | phi = igvn.register_new_node_with_optimizer(phi, old_phi); |
duke@435 | 1293 | // Make old Phi point to new Phi on the fall-in path |
kvn@3847 | 1294 | igvn.replace_input_of(old_phi, LoopNode::EntryControl, phi); |
duke@435 | 1295 | old_phi->del_req(outer_idx); |
duke@435 | 1296 | } |
duke@435 | 1297 | } |
duke@435 | 1298 | |
duke@435 | 1299 | // Use the new loop head instead of the old shared one |
duke@435 | 1300 | _head = outer; |
duke@435 | 1301 | phase->set_loop(_head, this); |
duke@435 | 1302 | } |
duke@435 | 1303 | |
duke@435 | 1304 | //------------------------------fix_parent------------------------------------- |
duke@435 | 1305 | static void fix_parent( IdealLoopTree *loop, IdealLoopTree *parent ) { |
duke@435 | 1306 | loop->_parent = parent; |
duke@435 | 1307 | if( loop->_child ) fix_parent( loop->_child, loop ); |
duke@435 | 1308 | if( loop->_next ) fix_parent( loop->_next , parent ); |
duke@435 | 1309 | } |
duke@435 | 1310 | |
duke@435 | 1311 | //------------------------------estimate_path_freq----------------------------- |
duke@435 | 1312 | static float estimate_path_freq( Node *n ) { |
duke@435 | 1313 | // Try to extract some path frequency info |
duke@435 | 1314 | IfNode *iff; |
duke@435 | 1315 | for( int i = 0; i < 50; i++ ) { // Skip through a bunch of uncommon tests |
duke@435 | 1316 | uint nop = n->Opcode(); |
duke@435 | 1317 | if( nop == Op_SafePoint ) { // Skip any safepoint |
duke@435 | 1318 | n = n->in(0); |
duke@435 | 1319 | continue; |
duke@435 | 1320 | } |
duke@435 | 1321 | if( nop == Op_CatchProj ) { // Get count from a prior call |
duke@435 | 1322 | // Assume call does not always throw exceptions: means the call-site |
duke@435 | 1323 | // count is also the frequency of the fall-through path. |
duke@435 | 1324 | assert( n->is_CatchProj(), "" ); |
duke@435 | 1325 | if( ((CatchProjNode*)n)->_con != CatchProjNode::fall_through_index ) |
duke@435 | 1326 | return 0.0f; // Assume call exception path is rare |
duke@435 | 1327 | Node *call = n->in(0)->in(0)->in(0); |
duke@435 | 1328 | assert( call->is_Call(), "expect a call here" ); |
duke@435 | 1329 | const JVMState *jvms = ((CallNode*)call)->jvms(); |
duke@435 | 1330 | ciMethodData* methodData = jvms->method()->method_data(); |
duke@435 | 1331 | if (!methodData->is_mature()) return 0.0f; // No call-site data |
duke@435 | 1332 | ciProfileData* data = methodData->bci_to_data(jvms->bci()); |
duke@435 | 1333 | if ((data == NULL) || !data->is_CounterData()) { |
duke@435 | 1334 | // no call profile available, try call's control input |
duke@435 | 1335 | n = n->in(0); |
duke@435 | 1336 | continue; |
duke@435 | 1337 | } |
duke@435 | 1338 | return data->as_CounterData()->count()/FreqCountInvocations; |
duke@435 | 1339 | } |
duke@435 | 1340 | // See if there's a gating IF test |
duke@435 | 1341 | Node *n_c = n->in(0); |
duke@435 | 1342 | if( !n_c->is_If() ) break; // No estimate available |
duke@435 | 1343 | iff = n_c->as_If(); |
duke@435 | 1344 | if( iff->_fcnt != COUNT_UNKNOWN ) // Have a valid count? |
duke@435 | 1345 | // Compute how much count comes on this path |
duke@435 | 1346 | return ((nop == Op_IfTrue) ? iff->_prob : 1.0f - iff->_prob) * iff->_fcnt; |
duke@435 | 1347 | // Have no count info. Skip dull uncommon-trap like branches. |
duke@435 | 1348 | if( (nop == Op_IfTrue && iff->_prob < PROB_LIKELY_MAG(5)) || |
duke@435 | 1349 | (nop == Op_IfFalse && iff->_prob > PROB_UNLIKELY_MAG(5)) ) |
duke@435 | 1350 | break; |
duke@435 | 1351 | // Skip through never-taken branch; look for a real loop exit. |
duke@435 | 1352 | n = iff->in(0); |
duke@435 | 1353 | } |
duke@435 | 1354 | return 0.0f; // No estimate available |
duke@435 | 1355 | } |
duke@435 | 1356 | |
duke@435 | 1357 | //------------------------------merge_many_backedges--------------------------- |
duke@435 | 1358 | // Merge all the backedges from the shared header into a private Region. |
duke@435 | 1359 | // Feed that region as the one backedge to this loop. |
duke@435 | 1360 | void IdealLoopTree::merge_many_backedges( PhaseIdealLoop *phase ) { |
duke@435 | 1361 | uint i; |
duke@435 | 1362 | |
duke@435 | 1363 | // Scan for the top 2 hottest backedges |
duke@435 | 1364 | float hotcnt = 0.0f; |
duke@435 | 1365 | float warmcnt = 0.0f; |
duke@435 | 1366 | uint hot_idx = 0; |
duke@435 | 1367 | // Loop starts at 2 because slot 1 is the fall-in path |
duke@435 | 1368 | for( i = 2; i < _head->req(); i++ ) { |
duke@435 | 1369 | float cnt = estimate_path_freq(_head->in(i)); |
duke@435 | 1370 | if( cnt > hotcnt ) { // Grab hottest path |
duke@435 | 1371 | warmcnt = hotcnt; |
duke@435 | 1372 | hotcnt = cnt; |
duke@435 | 1373 | hot_idx = i; |
duke@435 | 1374 | } else if( cnt > warmcnt ) { // And 2nd hottest path |
duke@435 | 1375 | warmcnt = cnt; |
duke@435 | 1376 | } |
duke@435 | 1377 | } |
duke@435 | 1378 | |
duke@435 | 1379 | // See if the hottest backedge is worthy of being an inner loop |
duke@435 | 1380 | // by being much hotter than the next hottest backedge. |
duke@435 | 1381 | if( hotcnt <= 0.0001 || |
duke@435 | 1382 | hotcnt < 2.0*warmcnt ) hot_idx = 0;// No hot backedge |
duke@435 | 1383 | |
duke@435 | 1384 | // Peel out the backedges into a private merge point; peel |
duke@435 | 1385 | // them all except optionally hot_idx. |
duke@435 | 1386 | PhaseIterGVN &igvn = phase->_igvn; |
duke@435 | 1387 | |
duke@435 | 1388 | Node *hot_tail = NULL; |
duke@435 | 1389 | // Make a Region for the merge point |
kvn@4115 | 1390 | Node *r = new (phase->C) RegionNode(1); |
duke@435 | 1391 | for( i = 2; i < _head->req(); i++ ) { |
duke@435 | 1392 | if( i != hot_idx ) |
duke@435 | 1393 | r->add_req( _head->in(i) ); |
duke@435 | 1394 | else hot_tail = _head->in(i); |
duke@435 | 1395 | } |
duke@435 | 1396 | igvn.register_new_node_with_optimizer(r, _head); |
duke@435 | 1397 | // Plug region into end of loop _head, followed by hot_tail |
duke@435 | 1398 | while( _head->req() > 3 ) _head->del_req( _head->req()-1 ); |
duke@435 | 1399 | _head->set_req(2, r); |
duke@435 | 1400 | if( hot_idx ) _head->add_req(hot_tail); |
duke@435 | 1401 | |
duke@435 | 1402 | // Split all the Phis up between '_head' loop and the Region 'r' |
duke@435 | 1403 | for (DUIterator_Fast jmax, j = _head->fast_outs(jmax); j < jmax; j++) { |
duke@435 | 1404 | Node *out = _head->fast_out(j); |
duke@435 | 1405 | if( out->is_Phi() ) { |
duke@435 | 1406 | PhiNode* n = out->as_Phi(); |
duke@435 | 1407 | igvn.hash_delete(n); // Delete from hash before hacking edges |
duke@435 | 1408 | Node *hot_phi = NULL; |
kvn@4115 | 1409 | Node *phi = new (phase->C) PhiNode(r, n->type(), n->adr_type()); |
duke@435 | 1410 | // Check all inputs for the ones to peel out |
duke@435 | 1411 | uint j = 1; |
duke@435 | 1412 | for( uint i = 2; i < n->req(); i++ ) { |
duke@435 | 1413 | if( i != hot_idx ) |
duke@435 | 1414 | phi->set_req( j++, n->in(i) ); |
duke@435 | 1415 | else hot_phi = n->in(i); |
duke@435 | 1416 | } |
duke@435 | 1417 | // Register the phi but do not transform until whole place transforms |
duke@435 | 1418 | igvn.register_new_node_with_optimizer(phi, n); |
duke@435 | 1419 | // Add the merge phi to the old Phi |
duke@435 | 1420 | while( n->req() > 3 ) n->del_req( n->req()-1 ); |
duke@435 | 1421 | n->set_req(2, phi); |
duke@435 | 1422 | if( hot_idx ) n->add_req(hot_phi); |
duke@435 | 1423 | } |
duke@435 | 1424 | } |
duke@435 | 1425 | |
duke@435 | 1426 | |
duke@435 | 1427 | // Insert a new IdealLoopTree inserted below me. Turn it into a clone |
duke@435 | 1428 | // of self loop tree. Turn self into a loop headed by _head and with |
duke@435 | 1429 | // tail being the new merge point. |
duke@435 | 1430 | IdealLoopTree *ilt = new IdealLoopTree( phase, _head, _tail ); |
duke@435 | 1431 | phase->set_loop(_tail,ilt); // Adjust tail |
duke@435 | 1432 | _tail = r; // Self's tail is new merge point |
duke@435 | 1433 | phase->set_loop(r,this); |
duke@435 | 1434 | ilt->_child = _child; // New guy has my children |
duke@435 | 1435 | _child = ilt; // Self has new guy as only child |
duke@435 | 1436 | ilt->_parent = this; // new guy has self for parent |
duke@435 | 1437 | ilt->_nest = _nest; // Same nesting depth (for now) |
duke@435 | 1438 | |
duke@435 | 1439 | // Starting with 'ilt', look for child loop trees using the same shared |
duke@435 | 1440 | // header. Flatten these out; they will no longer be loops in the end. |
duke@435 | 1441 | IdealLoopTree **pilt = &_child; |
duke@435 | 1442 | while( ilt ) { |
duke@435 | 1443 | if( ilt->_head == _head ) { |
duke@435 | 1444 | uint i; |
duke@435 | 1445 | for( i = 2; i < _head->req(); i++ ) |
duke@435 | 1446 | if( _head->in(i) == ilt->_tail ) |
duke@435 | 1447 | break; // Still a loop |
duke@435 | 1448 | if( i == _head->req() ) { // No longer a loop |
duke@435 | 1449 | // Flatten ilt. Hang ilt's "_next" list from the end of |
duke@435 | 1450 | // ilt's '_child' list. Move the ilt's _child up to replace ilt. |
duke@435 | 1451 | IdealLoopTree **cp = &ilt->_child; |
duke@435 | 1452 | while( *cp ) cp = &(*cp)->_next; // Find end of child list |
duke@435 | 1453 | *cp = ilt->_next; // Hang next list at end of child list |
duke@435 | 1454 | *pilt = ilt->_child; // Move child up to replace ilt |
duke@435 | 1455 | ilt->_head = NULL; // Flag as a loop UNIONED into parent |
duke@435 | 1456 | ilt = ilt->_child; // Repeat using new ilt |
duke@435 | 1457 | continue; // do not advance over ilt->_child |
duke@435 | 1458 | } |
duke@435 | 1459 | assert( ilt->_tail == hot_tail, "expected to only find the hot inner loop here" ); |
duke@435 | 1460 | phase->set_loop(_head,ilt); |
duke@435 | 1461 | } |
duke@435 | 1462 | pilt = &ilt->_child; // Advance to next |
duke@435 | 1463 | ilt = *pilt; |
duke@435 | 1464 | } |
duke@435 | 1465 | |
duke@435 | 1466 | if( _child ) fix_parent( _child, this ); |
duke@435 | 1467 | } |
duke@435 | 1468 | |
duke@435 | 1469 | //------------------------------beautify_loops--------------------------------- |
duke@435 | 1470 | // Split shared headers and insert loop landing pads. |
duke@435 | 1471 | // Insert a LoopNode to replace the RegionNode. |
duke@435 | 1472 | // Return TRUE if loop tree is structurally changed. |
duke@435 | 1473 | bool IdealLoopTree::beautify_loops( PhaseIdealLoop *phase ) { |
duke@435 | 1474 | bool result = false; |
duke@435 | 1475 | // Cache parts in locals for easy |
duke@435 | 1476 | PhaseIterGVN &igvn = phase->_igvn; |
duke@435 | 1477 | |
duke@435 | 1478 | igvn.hash_delete(_head); // Yank from hash before hacking edges |
duke@435 | 1479 | |
duke@435 | 1480 | // Check for multiple fall-in paths. Peel off a landing pad if need be. |
duke@435 | 1481 | int fall_in_cnt = 0; |
duke@435 | 1482 | for( uint i = 1; i < _head->req(); i++ ) |
duke@435 | 1483 | if( !phase->is_member( this, _head->in(i) ) ) |
duke@435 | 1484 | fall_in_cnt++; |
duke@435 | 1485 | assert( fall_in_cnt, "at least 1 fall-in path" ); |
duke@435 | 1486 | if( fall_in_cnt > 1 ) // Need a loop landing pad to merge fall-ins |
duke@435 | 1487 | split_fall_in( phase, fall_in_cnt ); |
duke@435 | 1488 | |
duke@435 | 1489 | // Swap inputs to the _head and all Phis to move the fall-in edge to |
duke@435 | 1490 | // the left. |
duke@435 | 1491 | fall_in_cnt = 1; |
duke@435 | 1492 | while( phase->is_member( this, _head->in(fall_in_cnt) ) ) |
duke@435 | 1493 | fall_in_cnt++; |
duke@435 | 1494 | if( fall_in_cnt > 1 ) { |
duke@435 | 1495 | // Since I am just swapping inputs I do not need to update def-use info |
duke@435 | 1496 | Node *tmp = _head->in(1); |
duke@435 | 1497 | _head->set_req( 1, _head->in(fall_in_cnt) ); |
duke@435 | 1498 | _head->set_req( fall_in_cnt, tmp ); |
duke@435 | 1499 | // Swap also all Phis |
duke@435 | 1500 | for (DUIterator_Fast imax, i = _head->fast_outs(imax); i < imax; i++) { |
duke@435 | 1501 | Node* phi = _head->fast_out(i); |
duke@435 | 1502 | if( phi->is_Phi() ) { |
duke@435 | 1503 | igvn.hash_delete(phi); // Yank from hash before hacking edges |
duke@435 | 1504 | tmp = phi->in(1); |
duke@435 | 1505 | phi->set_req( 1, phi->in(fall_in_cnt) ); |
duke@435 | 1506 | phi->set_req( fall_in_cnt, tmp ); |
duke@435 | 1507 | } |
duke@435 | 1508 | } |
duke@435 | 1509 | } |
duke@435 | 1510 | assert( !phase->is_member( this, _head->in(1) ), "left edge is fall-in" ); |
duke@435 | 1511 | assert( phase->is_member( this, _head->in(2) ), "right edge is loop" ); |
duke@435 | 1512 | |
duke@435 | 1513 | // If I am a shared header (multiple backedges), peel off the many |
duke@435 | 1514 | // backedges into a private merge point and use the merge point as |
duke@435 | 1515 | // the one true backedge. |
duke@435 | 1516 | if( _head->req() > 3 ) { |
kvn@2727 | 1517 | // Merge the many backedges into a single backedge but leave |
kvn@2727 | 1518 | // the hottest backedge as separate edge for the following peel. |
duke@435 | 1519 | merge_many_backedges( phase ); |
duke@435 | 1520 | result = true; |
duke@435 | 1521 | } |
duke@435 | 1522 | |
kvn@2727 | 1523 | // If I have one hot backedge, peel off myself loop. |
duke@435 | 1524 | // I better be the outermost loop. |
kvn@6657 | 1525 | if (_head->req() > 3 && !_irreducible) { |
duke@435 | 1526 | split_outer_loop( phase ); |
duke@435 | 1527 | result = true; |
duke@435 | 1528 | |
kvn@6657 | 1529 | } else if (!_head->is_Loop() && !_irreducible) { |
duke@435 | 1530 | // Make a new LoopNode to replace the old loop head |
kvn@4115 | 1531 | Node *l = new (phase->C) LoopNode( _head->in(1), _head->in(2) ); |
duke@435 | 1532 | l = igvn.register_new_node_with_optimizer(l, _head); |
duke@435 | 1533 | phase->set_created_loop_node(); |
duke@435 | 1534 | // Go ahead and replace _head |
kvn@1976 | 1535 | phase->_igvn.replace_node( _head, l ); |
duke@435 | 1536 | _head = l; |
duke@435 | 1537 | phase->set_loop(_head, this); |
duke@435 | 1538 | } |
duke@435 | 1539 | |
duke@435 | 1540 | // Now recursively beautify nested loops |
duke@435 | 1541 | if( _child ) result |= _child->beautify_loops( phase ); |
duke@435 | 1542 | if( _next ) result |= _next ->beautify_loops( phase ); |
duke@435 | 1543 | return result; |
duke@435 | 1544 | } |
duke@435 | 1545 | |
duke@435 | 1546 | //------------------------------allpaths_check_safepts---------------------------- |
duke@435 | 1547 | // Allpaths backwards scan from loop tail, terminating each path at first safepoint |
duke@435 | 1548 | // encountered. Helper for check_safepts. |
duke@435 | 1549 | void IdealLoopTree::allpaths_check_safepts(VectorSet &visited, Node_List &stack) { |
duke@435 | 1550 | assert(stack.size() == 0, "empty stack"); |
duke@435 | 1551 | stack.push(_tail); |
duke@435 | 1552 | visited.Clear(); |
duke@435 | 1553 | visited.set(_tail->_idx); |
duke@435 | 1554 | while (stack.size() > 0) { |
duke@435 | 1555 | Node* n = stack.pop(); |
duke@435 | 1556 | if (n->is_Call() && n->as_Call()->guaranteed_safepoint()) { |
duke@435 | 1557 | // Terminate this path |
duke@435 | 1558 | } else if (n->Opcode() == Op_SafePoint) { |
duke@435 | 1559 | if (_phase->get_loop(n) != this) { |
duke@435 | 1560 | if (_required_safept == NULL) _required_safept = new Node_List(); |
duke@435 | 1561 | _required_safept->push(n); // save the one closest to the tail |
duke@435 | 1562 | } |
duke@435 | 1563 | // Terminate this path |
duke@435 | 1564 | } else { |
duke@435 | 1565 | uint start = n->is_Region() ? 1 : 0; |
duke@435 | 1566 | uint end = n->is_Region() && !n->is_Loop() ? n->req() : start + 1; |
duke@435 | 1567 | for (uint i = start; i < end; i++) { |
duke@435 | 1568 | Node* in = n->in(i); |
duke@435 | 1569 | assert(in->is_CFG(), "must be"); |
duke@435 | 1570 | if (!visited.test_set(in->_idx) && is_member(_phase->get_loop(in))) { |
duke@435 | 1571 | stack.push(in); |
duke@435 | 1572 | } |
duke@435 | 1573 | } |
duke@435 | 1574 | } |
duke@435 | 1575 | } |
duke@435 | 1576 | } |
duke@435 | 1577 | |
duke@435 | 1578 | //------------------------------check_safepts---------------------------- |
duke@435 | 1579 | // Given dominators, try to find loops with calls that must always be |
duke@435 | 1580 | // executed (call dominates loop tail). These loops do not need non-call |
duke@435 | 1581 | // safepoints (ncsfpt). |
duke@435 | 1582 | // |
duke@435 | 1583 | // A complication is that a safepoint in a inner loop may be needed |
duke@435 | 1584 | // by an outer loop. In the following, the inner loop sees it has a |
duke@435 | 1585 | // call (block 3) on every path from the head (block 2) to the |
duke@435 | 1586 | // backedge (arc 3->2). So it deletes the ncsfpt (non-call safepoint) |
duke@435 | 1587 | // in block 2, _but_ this leaves the outer loop without a safepoint. |
duke@435 | 1588 | // |
duke@435 | 1589 | // entry 0 |
duke@435 | 1590 | // | |
duke@435 | 1591 | // v |
duke@435 | 1592 | // outer 1,2 +->1 |
duke@435 | 1593 | // | | |
duke@435 | 1594 | // | v |
duke@435 | 1595 | // | 2<---+ ncsfpt in 2 |
duke@435 | 1596 | // |_/|\ | |
duke@435 | 1597 | // | v | |
duke@435 | 1598 | // inner 2,3 / 3 | call in 3 |
duke@435 | 1599 | // / | | |
duke@435 | 1600 | // v +--+ |
duke@435 | 1601 | // exit 4 |
duke@435 | 1602 | // |
duke@435 | 1603 | // |
duke@435 | 1604 | // This method creates a list (_required_safept) of ncsfpt nodes that must |
duke@435 | 1605 | // be protected is created for each loop. When a ncsfpt maybe deleted, it |
duke@435 | 1606 | // is first looked for in the lists for the outer loops of the current loop. |
duke@435 | 1607 | // |
duke@435 | 1608 | // The insights into the problem: |
duke@435 | 1609 | // A) counted loops are okay |
duke@435 | 1610 | // B) innermost loops are okay (only an inner loop can delete |
duke@435 | 1611 | // a ncsfpt needed by an outer loop) |
duke@435 | 1612 | // C) a loop is immune from an inner loop deleting a safepoint |
duke@435 | 1613 | // if the loop has a call on the idom-path |
duke@435 | 1614 | // D) a loop is also immune if it has a ncsfpt (non-call safepoint) on the |
duke@435 | 1615 | // idom-path that is not in a nested loop |
duke@435 | 1616 | // E) otherwise, an ncsfpt on the idom-path that is nested in an inner |
duke@435 | 1617 | // loop needs to be prevented from deletion by an inner loop |
duke@435 | 1618 | // |
duke@435 | 1619 | // There are two analyses: |
duke@435 | 1620 | // 1) The first, and cheaper one, scans the loop body from |
duke@435 | 1621 | // tail to head following the idom (immediate dominator) |
duke@435 | 1622 | // chain, looking for the cases (C,D,E) above. |
duke@435 | 1623 | // Since inner loops are scanned before outer loops, there is summary |
duke@435 | 1624 | // information about inner loops. Inner loops can be skipped over |
duke@435 | 1625 | // when the tail of an inner loop is encountered. |
duke@435 | 1626 | // |
duke@435 | 1627 | // 2) The second, invoked if the first fails to find a call or ncsfpt on |
duke@435 | 1628 | // the idom path (which is rare), scans all predecessor control paths |
duke@435 | 1629 | // from the tail to the head, terminating a path when a call or sfpt |
duke@435 | 1630 | // is encountered, to find the ncsfpt's that are closest to the tail. |
duke@435 | 1631 | // |
duke@435 | 1632 | void IdealLoopTree::check_safepts(VectorSet &visited, Node_List &stack) { |
duke@435 | 1633 | // Bottom up traversal |
duke@435 | 1634 | IdealLoopTree* ch = _child; |
kvn@4023 | 1635 | if (_child) _child->check_safepts(visited, stack); |
kvn@4023 | 1636 | if (_next) _next ->check_safepts(visited, stack); |
duke@435 | 1637 | |
duke@435 | 1638 | if (!_head->is_CountedLoop() && !_has_sfpt && _parent != NULL && !_irreducible) { |
duke@435 | 1639 | bool has_call = false; // call on dom-path |
duke@435 | 1640 | bool has_local_ncsfpt = false; // ncsfpt on dom-path at this loop depth |
duke@435 | 1641 | Node* nonlocal_ncsfpt = NULL; // ncsfpt on dom-path at a deeper depth |
duke@435 | 1642 | // Scan the dom-path nodes from tail to head |
duke@435 | 1643 | for (Node* n = tail(); n != _head; n = _phase->idom(n)) { |
duke@435 | 1644 | if (n->is_Call() && n->as_Call()->guaranteed_safepoint()) { |
duke@435 | 1645 | has_call = true; |
duke@435 | 1646 | _has_sfpt = 1; // Then no need for a safept! |
duke@435 | 1647 | break; |
duke@435 | 1648 | } else if (n->Opcode() == Op_SafePoint) { |
duke@435 | 1649 | if (_phase->get_loop(n) == this) { |
duke@435 | 1650 | has_local_ncsfpt = true; |
duke@435 | 1651 | break; |
duke@435 | 1652 | } |
duke@435 | 1653 | if (nonlocal_ncsfpt == NULL) { |
duke@435 | 1654 | nonlocal_ncsfpt = n; // save the one closest to the tail |
duke@435 | 1655 | } |
duke@435 | 1656 | } else { |
duke@435 | 1657 | IdealLoopTree* nlpt = _phase->get_loop(n); |
duke@435 | 1658 | if (this != nlpt) { |
duke@435 | 1659 | // If at an inner loop tail, see if the inner loop has already |
duke@435 | 1660 | // recorded seeing a call on the dom-path (and stop.) If not, |
duke@435 | 1661 | // jump to the head of the inner loop. |
duke@435 | 1662 | assert(is_member(nlpt), "nested loop"); |
duke@435 | 1663 | Node* tail = nlpt->_tail; |
duke@435 | 1664 | if (tail->in(0)->is_If()) tail = tail->in(0); |
duke@435 | 1665 | if (n == tail) { |
duke@435 | 1666 | // If inner loop has call on dom-path, so does outer loop |
duke@435 | 1667 | if (nlpt->_has_sfpt) { |
duke@435 | 1668 | has_call = true; |
duke@435 | 1669 | _has_sfpt = 1; |
duke@435 | 1670 | break; |
duke@435 | 1671 | } |
duke@435 | 1672 | // Skip to head of inner loop |
duke@435 | 1673 | assert(_phase->is_dominator(_head, nlpt->_head), "inner head dominated by outer head"); |
duke@435 | 1674 | n = nlpt->_head; |
duke@435 | 1675 | } |
duke@435 | 1676 | } |
duke@435 | 1677 | } |
duke@435 | 1678 | } |
duke@435 | 1679 | // Record safept's that this loop needs preserved when an |
duke@435 | 1680 | // inner loop attempts to delete it's safepoints. |
duke@435 | 1681 | if (_child != NULL && !has_call && !has_local_ncsfpt) { |
duke@435 | 1682 | if (nonlocal_ncsfpt != NULL) { |
duke@435 | 1683 | if (_required_safept == NULL) _required_safept = new Node_List(); |
duke@435 | 1684 | _required_safept->push(nonlocal_ncsfpt); |
duke@435 | 1685 | } else { |
duke@435 | 1686 | // Failed to find a suitable safept on the dom-path. Now use |
duke@435 | 1687 | // an all paths walk from tail to head, looking for safepoints to preserve. |
duke@435 | 1688 | allpaths_check_safepts(visited, stack); |
duke@435 | 1689 | } |
duke@435 | 1690 | } |
duke@435 | 1691 | } |
duke@435 | 1692 | } |
duke@435 | 1693 | |
duke@435 | 1694 | //---------------------------is_deleteable_safept---------------------------- |
duke@435 | 1695 | // Is safept not required by an outer loop? |
duke@435 | 1696 | bool PhaseIdealLoop::is_deleteable_safept(Node* sfpt) { |
duke@435 | 1697 | assert(sfpt->Opcode() == Op_SafePoint, ""); |
duke@435 | 1698 | IdealLoopTree* lp = get_loop(sfpt)->_parent; |
duke@435 | 1699 | while (lp != NULL) { |
duke@435 | 1700 | Node_List* sfpts = lp->_required_safept; |
duke@435 | 1701 | if (sfpts != NULL) { |
duke@435 | 1702 | for (uint i = 0; i < sfpts->size(); i++) { |
duke@435 | 1703 | if (sfpt == sfpts->at(i)) |
duke@435 | 1704 | return false; |
duke@435 | 1705 | } |
duke@435 | 1706 | } |
duke@435 | 1707 | lp = lp->_parent; |
duke@435 | 1708 | } |
duke@435 | 1709 | return true; |
duke@435 | 1710 | } |
duke@435 | 1711 | |
kvn@2665 | 1712 | //---------------------------replace_parallel_iv------------------------------- |
kvn@2665 | 1713 | // Replace parallel induction variable (parallel to trip counter) |
kvn@2665 | 1714 | void PhaseIdealLoop::replace_parallel_iv(IdealLoopTree *loop) { |
kvn@2665 | 1715 | assert(loop->_head->is_CountedLoop(), ""); |
kvn@2665 | 1716 | CountedLoopNode *cl = loop->_head->as_CountedLoop(); |
kvn@3048 | 1717 | if (!cl->is_valid_counted_loop()) |
kvn@3048 | 1718 | return; // skip malformed counted loop |
kvn@2665 | 1719 | Node *incr = cl->incr(); |
kvn@2665 | 1720 | if (incr == NULL) |
kvn@2665 | 1721 | return; // Dead loop? |
kvn@2665 | 1722 | Node *init = cl->init_trip(); |
kvn@2665 | 1723 | Node *phi = cl->phi(); |
kvn@2665 | 1724 | int stride_con = cl->stride_con(); |
kvn@2665 | 1725 | |
kvn@2665 | 1726 | // Visit all children, looking for Phis |
kvn@2665 | 1727 | for (DUIterator i = cl->outs(); cl->has_out(i); i++) { |
kvn@2665 | 1728 | Node *out = cl->out(i); |
kvn@2665 | 1729 | // Look for other phis (secondary IVs). Skip dead ones |
kvn@2665 | 1730 | if (!out->is_Phi() || out == phi || !has_node(out)) |
kvn@2665 | 1731 | continue; |
kvn@2665 | 1732 | PhiNode* phi2 = out->as_Phi(); |
kvn@2665 | 1733 | Node *incr2 = phi2->in( LoopNode::LoopBackControl ); |
kvn@2665 | 1734 | // Look for induction variables of the form: X += constant |
kvn@2665 | 1735 | if (phi2->region() != loop->_head || |
kvn@2665 | 1736 | incr2->req() != 3 || |
kvn@2665 | 1737 | incr2->in(1) != phi2 || |
kvn@2665 | 1738 | incr2 == incr || |
kvn@2665 | 1739 | incr2->Opcode() != Op_AddI || |
kvn@2665 | 1740 | !incr2->in(2)->is_Con()) |
kvn@2665 | 1741 | continue; |
kvn@2665 | 1742 | |
kvn@2665 | 1743 | // Check for parallel induction variable (parallel to trip counter) |
kvn@2665 | 1744 | // via an affine function. In particular, count-down loops with |
kvn@2665 | 1745 | // count-up array indices are common. We only RCE references off |
kvn@2665 | 1746 | // the trip-counter, so we need to convert all these to trip-counter |
kvn@2665 | 1747 | // expressions. |
kvn@2665 | 1748 | Node *init2 = phi2->in( LoopNode::EntryControl ); |
kvn@2665 | 1749 | int stride_con2 = incr2->in(2)->get_int(); |
kvn@2665 | 1750 | |
kvn@2665 | 1751 | // The general case here gets a little tricky. We want to find the |
kvn@2665 | 1752 | // GCD of all possible parallel IV's and make a new IV using this |
kvn@2665 | 1753 | // GCD for the loop. Then all possible IVs are simple multiples of |
kvn@2665 | 1754 | // the GCD. In practice, this will cover very few extra loops. |
kvn@2665 | 1755 | // Instead we require 'stride_con2' to be a multiple of 'stride_con', |
kvn@2665 | 1756 | // where +/-1 is the common case, but other integer multiples are |
kvn@2665 | 1757 | // also easy to handle. |
kvn@2665 | 1758 | int ratio_con = stride_con2/stride_con; |
kvn@2665 | 1759 | |
kvn@2665 | 1760 | if ((ratio_con * stride_con) == stride_con2) { // Check for exact |
kvn@3135 | 1761 | #ifndef PRODUCT |
kvn@3135 | 1762 | if (TraceLoopOpts) { |
kvn@3135 | 1763 | tty->print("Parallel IV: %d ", phi2->_idx); |
kvn@3135 | 1764 | loop->dump_head(); |
kvn@3135 | 1765 | } |
kvn@3135 | 1766 | #endif |
kvn@2665 | 1767 | // Convert to using the trip counter. The parallel induction |
kvn@2665 | 1768 | // variable differs from the trip counter by a loop-invariant |
kvn@2665 | 1769 | // amount, the difference between their respective initial values. |
kvn@2665 | 1770 | // It is scaled by the 'ratio_con'. |
kvn@2665 | 1771 | Node* ratio = _igvn.intcon(ratio_con); |
kvn@2665 | 1772 | set_ctrl(ratio, C->root()); |
kvn@4115 | 1773 | Node* ratio_init = new (C) MulINode(init, ratio); |
kvn@3135 | 1774 | _igvn.register_new_node_with_optimizer(ratio_init, init); |
kvn@3135 | 1775 | set_early_ctrl(ratio_init); |
kvn@4115 | 1776 | Node* diff = new (C) SubINode(init2, ratio_init); |
kvn@3135 | 1777 | _igvn.register_new_node_with_optimizer(diff, init2); |
kvn@3135 | 1778 | set_early_ctrl(diff); |
kvn@4115 | 1779 | Node* ratio_idx = new (C) MulINode(phi, ratio); |
kvn@3135 | 1780 | _igvn.register_new_node_with_optimizer(ratio_idx, phi); |
kvn@3135 | 1781 | set_ctrl(ratio_idx, cl); |
kvn@4115 | 1782 | Node* add = new (C) AddINode(ratio_idx, diff); |
kvn@3135 | 1783 | _igvn.register_new_node_with_optimizer(add); |
kvn@3135 | 1784 | set_ctrl(add, cl); |
kvn@2665 | 1785 | _igvn.replace_node( phi2, add ); |
kvn@2665 | 1786 | // Sometimes an induction variable is unused |
kvn@2665 | 1787 | if (add->outcnt() == 0) { |
kvn@2665 | 1788 | _igvn.remove_dead_node(add); |
kvn@2665 | 1789 | } |
kvn@2665 | 1790 | --i; // deleted this phi; rescan starting with next position |
kvn@2665 | 1791 | continue; |
kvn@2665 | 1792 | } |
kvn@2665 | 1793 | } |
kvn@2665 | 1794 | } |
kvn@2665 | 1795 | |
duke@435 | 1796 | //------------------------------counted_loop----------------------------------- |
duke@435 | 1797 | // Convert to counted loops where possible |
duke@435 | 1798 | void IdealLoopTree::counted_loop( PhaseIdealLoop *phase ) { |
duke@435 | 1799 | |
duke@435 | 1800 | // For grins, set the inner-loop flag here |
kvn@2665 | 1801 | if (!_child) { |
kvn@2665 | 1802 | if (_head->is_Loop()) _head->as_Loop()->set_inner_loop(); |
duke@435 | 1803 | } |
duke@435 | 1804 | |
kvn@2665 | 1805 | if (_head->is_CountedLoop() || |
kvn@2665 | 1806 | phase->is_counted_loop(_head, this)) { |
duke@435 | 1807 | _has_sfpt = 1; // Indicate we do not need a safepoint here |
duke@435 | 1808 | |
kvn@4023 | 1809 | // Look for safepoints to remove. |
kvn@4023 | 1810 | Node_List* sfpts = _safepts; |
kvn@4023 | 1811 | if (sfpts != NULL) { |
kvn@4023 | 1812 | for (uint i = 0; i < sfpts->size(); i++) { |
kvn@4023 | 1813 | Node* n = sfpts->at(i); |
kvn@4023 | 1814 | assert(phase->get_loop(n) == this, ""); |
kvn@4023 | 1815 | if (phase->is_deleteable_safept(n)) { |
kvn@4023 | 1816 | phase->lazy_replace(n, n->in(TypeFunc::Control)); |
kvn@4023 | 1817 | } |
kvn@4023 | 1818 | } |
kvn@4023 | 1819 | } |
duke@435 | 1820 | |
kvn@2665 | 1821 | // Look for induction variables |
kvn@2665 | 1822 | phase->replace_parallel_iv(this); |
duke@435 | 1823 | |
duke@435 | 1824 | } else if (_parent != NULL && !_irreducible) { |
duke@435 | 1825 | // Not a counted loop. |
kvn@4023 | 1826 | // Look for a safepoint on the idom-path. |
kvn@4023 | 1827 | Node* sfpt = tail(); |
kvn@4023 | 1828 | for (; sfpt != _head; sfpt = phase->idom(sfpt)) { |
kvn@4023 | 1829 | if (sfpt->Opcode() == Op_SafePoint && phase->get_loop(sfpt) == this) |
kvn@4023 | 1830 | break; // Found one |
duke@435 | 1831 | } |
kvn@4023 | 1832 | // Delete other safepoints in this loop. |
kvn@4023 | 1833 | Node_List* sfpts = _safepts; |
kvn@4023 | 1834 | if (sfpts != NULL && sfpt != _head && sfpt->Opcode() == Op_SafePoint) { |
kvn@4023 | 1835 | for (uint i = 0; i < sfpts->size(); i++) { |
kvn@4023 | 1836 | Node* n = sfpts->at(i); |
kvn@4023 | 1837 | assert(phase->get_loop(n) == this, ""); |
kvn@4023 | 1838 | if (n != sfpt && phase->is_deleteable_safept(n)) { |
kvn@4023 | 1839 | phase->lazy_replace(n, n->in(TypeFunc::Control)); |
kvn@4023 | 1840 | } |
kvn@4023 | 1841 | } |
duke@435 | 1842 | } |
duke@435 | 1843 | } |
duke@435 | 1844 | |
duke@435 | 1845 | // Recursively |
kvn@2665 | 1846 | if (_child) _child->counted_loop( phase ); |
kvn@2665 | 1847 | if (_next) _next ->counted_loop( phase ); |
duke@435 | 1848 | } |
duke@435 | 1849 | |
duke@435 | 1850 | #ifndef PRODUCT |
duke@435 | 1851 | //------------------------------dump_head-------------------------------------- |
duke@435 | 1852 | // Dump 1 liner for loop header info |
duke@435 | 1853 | void IdealLoopTree::dump_head( ) const { |
kvn@2665 | 1854 | for (uint i=0; i<_nest; i++) |
duke@435 | 1855 | tty->print(" "); |
duke@435 | 1856 | tty->print("Loop: N%d/N%d ",_head->_idx,_tail->_idx); |
kvn@2665 | 1857 | if (_irreducible) tty->print(" IRREDUCIBLE"); |
kvn@2877 | 1858 | Node* entry = _head->in(LoopNode::EntryControl); |
kvn@2877 | 1859 | if (LoopLimitCheck) { |
kvn@2877 | 1860 | Node* predicate = PhaseIdealLoop::find_predicate_insertion_point(entry, Deoptimization::Reason_loop_limit_check); |
kvn@2877 | 1861 | if (predicate != NULL ) { |
kvn@2877 | 1862 | tty->print(" limit_check"); |
kvn@2877 | 1863 | entry = entry->in(0)->in(0); |
kvn@2877 | 1864 | } |
kvn@2877 | 1865 | } |
kvn@2665 | 1866 | if (UseLoopPredicate) { |
kvn@2877 | 1867 | entry = PhaseIdealLoop::find_predicate_insertion_point(entry, Deoptimization::Reason_predicate); |
kvn@2727 | 1868 | if (entry != NULL) { |
kvn@2665 | 1869 | tty->print(" predicated"); |
kvn@2665 | 1870 | } |
kvn@2665 | 1871 | } |
kvn@2665 | 1872 | if (_head->is_CountedLoop()) { |
duke@435 | 1873 | CountedLoopNode *cl = _head->as_CountedLoop(); |
duke@435 | 1874 | tty->print(" counted"); |
kvn@2747 | 1875 | |
kvn@2747 | 1876 | Node* init_n = cl->init_trip(); |
kvn@2747 | 1877 | if (init_n != NULL && init_n->is_Con()) |
kvn@2747 | 1878 | tty->print(" [%d,", cl->init_trip()->get_int()); |
kvn@2747 | 1879 | else |
kvn@2747 | 1880 | tty->print(" [int,"); |
kvn@2747 | 1881 | Node* limit_n = cl->limit(); |
kvn@2747 | 1882 | if (limit_n != NULL && limit_n->is_Con()) |
kvn@2747 | 1883 | tty->print("%d),", cl->limit()->get_int()); |
kvn@2747 | 1884 | else |
kvn@2747 | 1885 | tty->print("int),"); |
kvn@2747 | 1886 | int stride_con = cl->stride_con(); |
kvn@2747 | 1887 | if (stride_con > 0) tty->print("+"); |
kvn@2747 | 1888 | tty->print("%d", stride_con); |
kvn@2747 | 1889 | |
kvn@4001 | 1890 | tty->print(" (%d iters) ", (int)cl->profile_trip_cnt()); |
kvn@4001 | 1891 | |
kvn@2665 | 1892 | if (cl->is_pre_loop ()) tty->print(" pre" ); |
kvn@2665 | 1893 | if (cl->is_main_loop()) tty->print(" main"); |
kvn@2665 | 1894 | if (cl->is_post_loop()) tty->print(" post"); |
duke@435 | 1895 | } |
duke@435 | 1896 | tty->cr(); |
duke@435 | 1897 | } |
duke@435 | 1898 | |
duke@435 | 1899 | //------------------------------dump------------------------------------------- |
duke@435 | 1900 | // Dump loops by loop tree |
duke@435 | 1901 | void IdealLoopTree::dump( ) const { |
duke@435 | 1902 | dump_head(); |
kvn@2665 | 1903 | if (_child) _child->dump(); |
kvn@2665 | 1904 | if (_next) _next ->dump(); |
duke@435 | 1905 | } |
duke@435 | 1906 | |
duke@435 | 1907 | #endif |
duke@435 | 1908 | |
never@802 | 1909 | static void log_loop_tree(IdealLoopTree* root, IdealLoopTree* loop, CompileLog* log) { |
never@802 | 1910 | if (loop == root) { |
never@802 | 1911 | if (loop->_child != NULL) { |
never@802 | 1912 | log->begin_head("loop_tree"); |
never@802 | 1913 | log->end_head(); |
never@802 | 1914 | if( loop->_child ) log_loop_tree(root, loop->_child, log); |
never@802 | 1915 | log->tail("loop_tree"); |
never@802 | 1916 | assert(loop->_next == NULL, "what?"); |
never@802 | 1917 | } |
never@802 | 1918 | } else { |
never@802 | 1919 | Node* head = loop->_head; |
never@802 | 1920 | log->begin_head("loop"); |
never@802 | 1921 | log->print(" idx='%d' ", head->_idx); |
never@802 | 1922 | if (loop->_irreducible) log->print("irreducible='1' "); |
never@802 | 1923 | if (head->is_Loop()) { |
never@802 | 1924 | if (head->as_Loop()->is_inner_loop()) log->print("inner_loop='1' "); |
never@802 | 1925 | if (head->as_Loop()->is_partial_peel_loop()) log->print("partial_peel_loop='1' "); |
never@802 | 1926 | } |
never@802 | 1927 | if (head->is_CountedLoop()) { |
never@802 | 1928 | CountedLoopNode* cl = head->as_CountedLoop(); |
never@802 | 1929 | if (cl->is_pre_loop()) log->print("pre_loop='%d' ", cl->main_idx()); |
never@802 | 1930 | if (cl->is_main_loop()) log->print("main_loop='%d' ", cl->_idx); |
never@802 | 1931 | if (cl->is_post_loop()) log->print("post_loop='%d' ", cl->main_idx()); |
never@802 | 1932 | } |
never@802 | 1933 | log->end_head(); |
never@802 | 1934 | if( loop->_child ) log_loop_tree(root, loop->_child, log); |
never@802 | 1935 | log->tail("loop"); |
never@802 | 1936 | if( loop->_next ) log_loop_tree(root, loop->_next, log); |
never@802 | 1937 | } |
never@802 | 1938 | } |
never@802 | 1939 | |
cfang@1607 | 1940 | //---------------------collect_potentially_useful_predicates----------------------- |
cfang@1607 | 1941 | // Helper function to collect potentially useful predicates to prevent them from |
cfang@1607 | 1942 | // being eliminated by PhaseIdealLoop::eliminate_useless_predicates |
cfang@1607 | 1943 | void PhaseIdealLoop::collect_potentially_useful_predicates( |
cfang@1607 | 1944 | IdealLoopTree * loop, Unique_Node_List &useful_predicates) { |
cfang@1607 | 1945 | if (loop->_child) { // child |
cfang@1607 | 1946 | collect_potentially_useful_predicates(loop->_child, useful_predicates); |
cfang@1607 | 1947 | } |
cfang@1607 | 1948 | |
cfang@1607 | 1949 | // self (only loops that we can apply loop predication may use their predicates) |
kvn@2665 | 1950 | if (loop->_head->is_Loop() && |
kvn@2665 | 1951 | !loop->_irreducible && |
cfang@1607 | 1952 | !loop->tail()->is_top()) { |
kvn@2665 | 1953 | LoopNode* lpn = loop->_head->as_Loop(); |
cfang@1607 | 1954 | Node* entry = lpn->in(LoopNode::EntryControl); |
kvn@2877 | 1955 | Node* predicate_proj = find_predicate(entry); // loop_limit_check first |
cfang@1607 | 1956 | if (predicate_proj != NULL ) { // right pattern that can be used by loop predication |
kvn@2665 | 1957 | assert(entry->in(0)->in(1)->in(1)->Opcode() == Op_Opaque1, "must be"); |
cfang@1607 | 1958 | useful_predicates.push(entry->in(0)->in(1)->in(1)); // good one |
kvn@2877 | 1959 | entry = entry->in(0)->in(0); |
kvn@2877 | 1960 | } |
kvn@2877 | 1961 | predicate_proj = find_predicate(entry); // Predicate |
kvn@2877 | 1962 | if (predicate_proj != NULL ) { |
kvn@2877 | 1963 | useful_predicates.push(entry->in(0)->in(1)->in(1)); // good one |
cfang@1607 | 1964 | } |
cfang@1607 | 1965 | } |
cfang@1607 | 1966 | |
kvn@2665 | 1967 | if (loop->_next) { // sibling |
cfang@1607 | 1968 | collect_potentially_useful_predicates(loop->_next, useful_predicates); |
cfang@1607 | 1969 | } |
cfang@1607 | 1970 | } |
cfang@1607 | 1971 | |
cfang@1607 | 1972 | //------------------------eliminate_useless_predicates----------------------------- |
cfang@1607 | 1973 | // Eliminate all inserted predicates if they could not be used by loop predication. |
kvn@2877 | 1974 | // Note: it will also eliminates loop limits check predicate since it also uses |
kvn@2877 | 1975 | // Opaque1 node (see Parse::add_predicate()). |
cfang@1607 | 1976 | void PhaseIdealLoop::eliminate_useless_predicates() { |
kvn@2665 | 1977 | if (C->predicate_count() == 0) |
kvn@2665 | 1978 | return; // no predicate left |
cfang@1607 | 1979 | |
cfang@1607 | 1980 | Unique_Node_List useful_predicates; // to store useful predicates |
cfang@1607 | 1981 | if (C->has_loops()) { |
cfang@1607 | 1982 | collect_potentially_useful_predicates(_ltree_root->_child, useful_predicates); |
cfang@1607 | 1983 | } |
cfang@1607 | 1984 | |
cfang@1607 | 1985 | for (int i = C->predicate_count(); i > 0; i--) { |
cfang@1607 | 1986 | Node * n = C->predicate_opaque1_node(i-1); |
cfang@1607 | 1987 | assert(n->Opcode() == Op_Opaque1, "must be"); |
cfang@1607 | 1988 | if (!useful_predicates.member(n)) { // not in the useful list |
cfang@1607 | 1989 | _igvn.replace_node(n, n->in(1)); |
cfang@1607 | 1990 | } |
cfang@1607 | 1991 | } |
cfang@1607 | 1992 | } |
cfang@1607 | 1993 | |
roland@4589 | 1994 | //------------------------process_expensive_nodes----------------------------- |
roland@4589 | 1995 | // Expensive nodes have their control input set to prevent the GVN |
roland@4589 | 1996 | // from commoning them and as a result forcing the resulting node to |
roland@4589 | 1997 | // be in a more frequent path. Use CFG information here, to change the |
roland@4589 | 1998 | // control inputs so that some expensive nodes can be commoned while |
roland@4589 | 1999 | // not executed more frequently. |
roland@4589 | 2000 | bool PhaseIdealLoop::process_expensive_nodes() { |
roland@4589 | 2001 | assert(OptimizeExpensiveOps, "optimization off?"); |
roland@4589 | 2002 | |
roland@4589 | 2003 | // Sort nodes to bring similar nodes together |
roland@4589 | 2004 | C->sort_expensive_nodes(); |
roland@4589 | 2005 | |
roland@4589 | 2006 | bool progress = false; |
roland@4589 | 2007 | |
roland@4589 | 2008 | for (int i = 0; i < C->expensive_count(); ) { |
roland@4589 | 2009 | Node* n = C->expensive_node(i); |
roland@4589 | 2010 | int start = i; |
roland@4589 | 2011 | // Find nodes similar to n |
roland@4589 | 2012 | i++; |
roland@4589 | 2013 | for (; i < C->expensive_count() && Compile::cmp_expensive_nodes(n, C->expensive_node(i)) == 0; i++); |
roland@4589 | 2014 | int end = i; |
roland@4589 | 2015 | // And compare them two by two |
roland@4589 | 2016 | for (int j = start; j < end; j++) { |
roland@4589 | 2017 | Node* n1 = C->expensive_node(j); |
roland@4589 | 2018 | if (is_node_unreachable(n1)) { |
roland@4589 | 2019 | continue; |
roland@4589 | 2020 | } |
roland@4589 | 2021 | for (int k = j+1; k < end; k++) { |
roland@4589 | 2022 | Node* n2 = C->expensive_node(k); |
roland@4589 | 2023 | if (is_node_unreachable(n2)) { |
roland@4589 | 2024 | continue; |
roland@4589 | 2025 | } |
roland@4589 | 2026 | |
roland@4589 | 2027 | assert(n1 != n2, "should be pair of nodes"); |
roland@4589 | 2028 | |
roland@4589 | 2029 | Node* c1 = n1->in(0); |
roland@4589 | 2030 | Node* c2 = n2->in(0); |
roland@4589 | 2031 | |
roland@4589 | 2032 | Node* parent_c1 = c1; |
roland@4589 | 2033 | Node* parent_c2 = c2; |
roland@4589 | 2034 | |
roland@4589 | 2035 | // The call to get_early_ctrl_for_expensive() moves the |
roland@4589 | 2036 | // expensive nodes up but stops at loops that are in a if |
roland@4589 | 2037 | // branch. See whether we can exit the loop and move above the |
roland@4589 | 2038 | // If. |
roland@4589 | 2039 | if (c1->is_Loop()) { |
roland@4589 | 2040 | parent_c1 = c1->in(1); |
roland@4589 | 2041 | } |
roland@4589 | 2042 | if (c2->is_Loop()) { |
roland@4589 | 2043 | parent_c2 = c2->in(1); |
roland@4589 | 2044 | } |
roland@4589 | 2045 | |
roland@4589 | 2046 | if (parent_c1 == parent_c2) { |
roland@4589 | 2047 | _igvn._worklist.push(n1); |
roland@4589 | 2048 | _igvn._worklist.push(n2); |
roland@4589 | 2049 | continue; |
roland@4589 | 2050 | } |
roland@4589 | 2051 | |
roland@4589 | 2052 | // Look for identical expensive node up the dominator chain. |
roland@4589 | 2053 | if (is_dominator(c1, c2)) { |
roland@4589 | 2054 | c2 = c1; |
roland@4589 | 2055 | } else if (is_dominator(c2, c1)) { |
roland@4589 | 2056 | c1 = c2; |
roland@4589 | 2057 | } else if (parent_c1->is_Proj() && parent_c1->in(0)->is_If() && |
roland@4589 | 2058 | parent_c2->is_Proj() && parent_c1->in(0) == parent_c2->in(0)) { |
roland@4589 | 2059 | // Both branches have the same expensive node so move it up |
roland@4589 | 2060 | // before the if. |
roland@4589 | 2061 | c1 = c2 = idom(parent_c1->in(0)); |
roland@4589 | 2062 | } |
roland@4589 | 2063 | // Do the actual moves |
roland@4589 | 2064 | if (n1->in(0) != c1) { |
roland@4589 | 2065 | _igvn.hash_delete(n1); |
roland@4589 | 2066 | n1->set_req(0, c1); |
roland@4589 | 2067 | _igvn.hash_insert(n1); |
roland@4589 | 2068 | _igvn._worklist.push(n1); |
roland@4589 | 2069 | progress = true; |
roland@4589 | 2070 | } |
roland@4589 | 2071 | if (n2->in(0) != c2) { |
roland@4589 | 2072 | _igvn.hash_delete(n2); |
roland@4589 | 2073 | n2->set_req(0, c2); |
roland@4589 | 2074 | _igvn.hash_insert(n2); |
roland@4589 | 2075 | _igvn._worklist.push(n2); |
roland@4589 | 2076 | progress = true; |
roland@4589 | 2077 | } |
roland@4589 | 2078 | } |
roland@4589 | 2079 | } |
roland@4589 | 2080 | } |
roland@4589 | 2081 | |
roland@4589 | 2082 | return progress; |
roland@4589 | 2083 | } |
roland@4589 | 2084 | |
roland@4589 | 2085 | |
duke@435 | 2086 | //============================================================================= |
never@1356 | 2087 | //----------------------------build_and_optimize------------------------------- |
duke@435 | 2088 | // Create a PhaseLoop. Build the ideal Loop tree. Map each Ideal Node to |
duke@435 | 2089 | // its corresponding LoopNode. If 'optimize' is true, do some loop cleanups. |
kvn@3260 | 2090 | void PhaseIdealLoop::build_and_optimize(bool do_split_ifs, bool skip_loop_opts) { |
kvn@2555 | 2091 | ResourceMark rm; |
kvn@2555 | 2092 | |
never@1356 | 2093 | int old_progress = C->major_progress(); |
never@2685 | 2094 | uint orig_worklist_size = _igvn._worklist.size(); |
never@1356 | 2095 | |
duke@435 | 2096 | // Reset major-progress flag for the driver's heuristics |
duke@435 | 2097 | C->clear_major_progress(); |
duke@435 | 2098 | |
duke@435 | 2099 | #ifndef PRODUCT |
duke@435 | 2100 | // Capture for later assert |
duke@435 | 2101 | uint unique = C->unique(); |
duke@435 | 2102 | _loop_invokes++; |
duke@435 | 2103 | _loop_work += unique; |
duke@435 | 2104 | #endif |
duke@435 | 2105 | |
duke@435 | 2106 | // True if the method has at least 1 irreducible loop |
duke@435 | 2107 | _has_irreducible_loops = false; |
duke@435 | 2108 | |
duke@435 | 2109 | _created_loop_node = false; |
duke@435 | 2110 | |
duke@435 | 2111 | Arena *a = Thread::current()->resource_area(); |
duke@435 | 2112 | VectorSet visited(a); |
duke@435 | 2113 | // Pre-grow the mapping from Nodes to IdealLoopTrees. |
duke@435 | 2114 | _nodes.map(C->unique(), NULL); |
duke@435 | 2115 | memset(_nodes.adr(), 0, wordSize * C->unique()); |
duke@435 | 2116 | |
duke@435 | 2117 | // Pre-build the top-level outermost loop tree entry |
duke@435 | 2118 | _ltree_root = new IdealLoopTree( this, C->root(), C->root() ); |
duke@435 | 2119 | // Do not need a safepoint at the top level |
duke@435 | 2120 | _ltree_root->_has_sfpt = 1; |
duke@435 | 2121 | |
kvn@2727 | 2122 | // Initialize Dominators. |
kvn@2727 | 2123 | // Checked in clone_loop_predicate() during beautify_loops(). |
kvn@2727 | 2124 | _idom_size = 0; |
kvn@2727 | 2125 | _idom = NULL; |
kvn@2727 | 2126 | _dom_depth = NULL; |
kvn@2727 | 2127 | _dom_stk = NULL; |
kvn@2727 | 2128 | |
duke@435 | 2129 | // Empty pre-order array |
duke@435 | 2130 | allocate_preorders(); |
duke@435 | 2131 | |
duke@435 | 2132 | // Build a loop tree on the fly. Build a mapping from CFG nodes to |
duke@435 | 2133 | // IdealLoopTree entries. Data nodes are NOT walked. |
duke@435 | 2134 | build_loop_tree(); |
duke@435 | 2135 | // Check for bailout, and return |
duke@435 | 2136 | if (C->failing()) { |
duke@435 | 2137 | return; |
duke@435 | 2138 | } |
duke@435 | 2139 | |
duke@435 | 2140 | // No loops after all |
never@1356 | 2141 | if( !_ltree_root->_child && !_verify_only ) C->set_has_loops(false); |
duke@435 | 2142 | |
duke@435 | 2143 | // There should always be an outer loop containing the Root and Return nodes. |
duke@435 | 2144 | // If not, we have a degenerate empty program. Bail out in this case. |
duke@435 | 2145 | if (!has_node(C->root())) { |
never@1356 | 2146 | if (!_verify_only) { |
never@1356 | 2147 | C->clear_major_progress(); |
never@1356 | 2148 | C->record_method_not_compilable("empty program detected during loop optimization"); |
never@1356 | 2149 | } |
duke@435 | 2150 | return; |
duke@435 | 2151 | } |
duke@435 | 2152 | |
duke@435 | 2153 | // Nothing to do, so get out |
roland@4589 | 2154 | bool stop_early = !C->has_loops() && !skip_loop_opts && !do_split_ifs && !_verify_me && !_verify_only; |
roland@4589 | 2155 | bool do_expensive_nodes = C->should_optimize_expensive_nodes(_igvn); |
roland@4589 | 2156 | if (stop_early && !do_expensive_nodes) { |
duke@435 | 2157 | _igvn.optimize(); // Cleanup NeverBranches |
duke@435 | 2158 | return; |
duke@435 | 2159 | } |
duke@435 | 2160 | |
duke@435 | 2161 | // Set loop nesting depth |
duke@435 | 2162 | _ltree_root->set_nest( 0 ); |
duke@435 | 2163 | |
duke@435 | 2164 | // Split shared headers and insert loop landing pads. |
duke@435 | 2165 | // Do not bother doing this on the Root loop of course. |
never@1356 | 2166 | if( !_verify_me && !_verify_only && _ltree_root->_child ) { |
sla@5237 | 2167 | C->print_method(PHASE_BEFORE_BEAUTIFY_LOOPS, 3); |
duke@435 | 2168 | if( _ltree_root->_child->beautify_loops( this ) ) { |
duke@435 | 2169 | // Re-build loop tree! |
duke@435 | 2170 | _ltree_root->_child = NULL; |
duke@435 | 2171 | _nodes.clear(); |
duke@435 | 2172 | reallocate_preorders(); |
duke@435 | 2173 | build_loop_tree(); |
duke@435 | 2174 | // Check for bailout, and return |
duke@435 | 2175 | if (C->failing()) { |
duke@435 | 2176 | return; |
duke@435 | 2177 | } |
duke@435 | 2178 | // Reset loop nesting depth |
duke@435 | 2179 | _ltree_root->set_nest( 0 ); |
never@657 | 2180 | |
sla@5237 | 2181 | C->print_method(PHASE_AFTER_BEAUTIFY_LOOPS, 3); |
duke@435 | 2182 | } |
duke@435 | 2183 | } |
duke@435 | 2184 | |
duke@435 | 2185 | // Build Dominators for elision of NULL checks & loop finding. |
duke@435 | 2186 | // Since nodes do not have a slot for immediate dominator, make |
twisti@1040 | 2187 | // a persistent side array for that info indexed on node->_idx. |
duke@435 | 2188 | _idom_size = C->unique(); |
duke@435 | 2189 | _idom = NEW_RESOURCE_ARRAY( Node*, _idom_size ); |
duke@435 | 2190 | _dom_depth = NEW_RESOURCE_ARRAY( uint, _idom_size ); |
duke@435 | 2191 | _dom_stk = NULL; // Allocated on demand in recompute_dom_depth |
duke@435 | 2192 | memset( _dom_depth, 0, _idom_size * sizeof(uint) ); |
duke@435 | 2193 | |
duke@435 | 2194 | Dominators(); |
duke@435 | 2195 | |
never@1356 | 2196 | if (!_verify_only) { |
never@1356 | 2197 | // As a side effect, Dominators removed any unreachable CFG paths |
never@1356 | 2198 | // into RegionNodes. It doesn't do this test against Root, so |
never@1356 | 2199 | // we do it here. |
never@1356 | 2200 | for( uint i = 1; i < C->root()->req(); i++ ) { |
never@1356 | 2201 | if( !_nodes[C->root()->in(i)->_idx] ) { // Dead path into Root? |
kvn@3847 | 2202 | _igvn.delete_input_of(C->root(), i); |
never@1356 | 2203 | i--; // Rerun same iteration on compressed edges |
never@1356 | 2204 | } |
duke@435 | 2205 | } |
never@1356 | 2206 | |
never@1356 | 2207 | // Given dominators, try to find inner loops with calls that must |
never@1356 | 2208 | // always be executed (call dominates loop tail). These loops do |
never@1356 | 2209 | // not need a separate safepoint. |
never@1356 | 2210 | Node_List cisstack(a); |
never@1356 | 2211 | _ltree_root->check_safepts(visited, cisstack); |
duke@435 | 2212 | } |
duke@435 | 2213 | |
duke@435 | 2214 | // Walk the DATA nodes and place into loops. Find earliest control |
duke@435 | 2215 | // node. For CFG nodes, the _nodes array starts out and remains |
duke@435 | 2216 | // holding the associated IdealLoopTree pointer. For DATA nodes, the |
duke@435 | 2217 | // _nodes array holds the earliest legal controlling CFG node. |
duke@435 | 2218 | |
duke@435 | 2219 | // Allocate stack with enough space to avoid frequent realloc |
duke@435 | 2220 | int stack_size = (C->unique() >> 1) + 16; // (unique>>1)+16 from Java2D stats |
duke@435 | 2221 | Node_Stack nstack( a, stack_size ); |
duke@435 | 2222 | |
duke@435 | 2223 | visited.Clear(); |
duke@435 | 2224 | Node_List worklist(a); |
duke@435 | 2225 | // Don't need C->root() on worklist since |
duke@435 | 2226 | // it will be processed among C->top() inputs |
duke@435 | 2227 | worklist.push( C->top() ); |
duke@435 | 2228 | visited.set( C->top()->_idx ); // Set C->top() as visited now |
never@1356 | 2229 | build_loop_early( visited, worklist, nstack ); |
duke@435 | 2230 | |
duke@435 | 2231 | // Given early legal placement, try finding counted loops. This placement |
duke@435 | 2232 | // is good enough to discover most loop invariants. |
never@1356 | 2233 | if( !_verify_me && !_verify_only ) |
duke@435 | 2234 | _ltree_root->counted_loop( this ); |
duke@435 | 2235 | |
duke@435 | 2236 | // Find latest loop placement. Find ideal loop placement. |
duke@435 | 2237 | visited.Clear(); |
duke@435 | 2238 | init_dom_lca_tags(); |
duke@435 | 2239 | // Need C->root() on worklist when processing outs |
duke@435 | 2240 | worklist.push( C->root() ); |
duke@435 | 2241 | NOT_PRODUCT( C->verify_graph_edges(); ) |
duke@435 | 2242 | worklist.push( C->top() ); |
never@1356 | 2243 | build_loop_late( visited, worklist, nstack ); |
never@1356 | 2244 | |
never@1356 | 2245 | if (_verify_only) { |
never@1356 | 2246 | // restore major progress flag |
never@1356 | 2247 | for (int i = 0; i < old_progress; i++) |
never@1356 | 2248 | C->set_major_progress(); |
never@1356 | 2249 | assert(C->unique() == unique, "verification mode made Nodes? ? ?"); |
never@2685 | 2250 | assert(_igvn._worklist.size() == orig_worklist_size, "shouldn't push anything"); |
never@1356 | 2251 | return; |
never@1356 | 2252 | } |
duke@435 | 2253 | |
kvn@4868 | 2254 | // clear out the dead code after build_loop_late |
kvn@4868 | 2255 | while (_deadlist.size()) { |
kvn@4868 | 2256 | _igvn.remove_globally_dead_node(_deadlist.pop()); |
kvn@4868 | 2257 | } |
kvn@4868 | 2258 | |
roland@4589 | 2259 | if (stop_early) { |
roland@4589 | 2260 | assert(do_expensive_nodes, "why are we here?"); |
roland@4589 | 2261 | if (process_expensive_nodes()) { |
roland@4589 | 2262 | // If we made some progress when processing expensive nodes then |
roland@4589 | 2263 | // the IGVN may modify the graph in a way that will allow us to |
roland@4589 | 2264 | // make some more progress: we need to try processing expensive |
roland@4589 | 2265 | // nodes again. |
roland@4589 | 2266 | C->set_major_progress(); |
roland@4589 | 2267 | } |
roland@4589 | 2268 | _igvn.optimize(); |
roland@4589 | 2269 | return; |
roland@4589 | 2270 | } |
roland@4589 | 2271 | |
kvn@2727 | 2272 | // Some parser-inserted loop predicates could never be used by loop |
kvn@2727 | 2273 | // predication or they were moved away from loop during some optimizations. |
kvn@2727 | 2274 | // For example, peeling. Eliminate them before next loop optimizations. |
kvn@2877 | 2275 | if (UseLoopPredicate || LoopLimitCheck) { |
cfang@1607 | 2276 | eliminate_useless_predicates(); |
cfang@1607 | 2277 | } |
cfang@1607 | 2278 | |
duke@435 | 2279 | #ifndef PRODUCT |
duke@435 | 2280 | C->verify_graph_edges(); |
kvn@2665 | 2281 | if (_verify_me) { // Nested verify pass? |
duke@435 | 2282 | // Check to see if the verify mode is broken |
duke@435 | 2283 | assert(C->unique() == unique, "non-optimize mode made Nodes? ? ?"); |
duke@435 | 2284 | return; |
duke@435 | 2285 | } |
kvn@2665 | 2286 | if(VerifyLoopOptimizations) verify(); |
kvn@2665 | 2287 | if(TraceLoopOpts && C->has_loops()) { |
kvn@2665 | 2288 | _ltree_root->dump(); |
kvn@2665 | 2289 | } |
duke@435 | 2290 | #endif |
duke@435 | 2291 | |
kvn@3260 | 2292 | if (skip_loop_opts) { |
kvn@3260 | 2293 | // Cleanup any modified bits |
kvn@3260 | 2294 | _igvn.optimize(); |
kvn@3260 | 2295 | |
kvn@3260 | 2296 | if (C->log() != NULL) { |
kvn@3260 | 2297 | log_loop_tree(_ltree_root, _ltree_root, C->log()); |
kvn@3260 | 2298 | } |
kvn@3260 | 2299 | return; |
kvn@3260 | 2300 | } |
kvn@3260 | 2301 | |
duke@435 | 2302 | if (ReassociateInvariants) { |
duke@435 | 2303 | // Reassociate invariants and prep for split_thru_phi |
duke@435 | 2304 | for (LoopTreeIterator iter(_ltree_root); !iter.done(); iter.next()) { |
duke@435 | 2305 | IdealLoopTree* lpt = iter.current(); |
duke@435 | 2306 | if (!lpt->is_counted() || !lpt->is_inner()) continue; |
duke@435 | 2307 | |
duke@435 | 2308 | lpt->reassociate_invariants(this); |
duke@435 | 2309 | |
duke@435 | 2310 | // Because RCE opportunities can be masked by split_thru_phi, |
duke@435 | 2311 | // look for RCE candidates and inhibit split_thru_phi |
duke@435 | 2312 | // on just their loop-phi's for this pass of loop opts |
cfang@1607 | 2313 | if (SplitIfBlocks && do_split_ifs) { |
duke@435 | 2314 | if (lpt->policy_range_check(this)) { |
kvn@474 | 2315 | lpt->_rce_candidate = 1; // = true |
duke@435 | 2316 | } |
duke@435 | 2317 | } |
duke@435 | 2318 | } |
duke@435 | 2319 | } |
duke@435 | 2320 | |
duke@435 | 2321 | // Check for aggressive application of split-if and other transforms |
duke@435 | 2322 | // that require basic-block info (like cloning through Phi's) |
duke@435 | 2323 | if( SplitIfBlocks && do_split_ifs ) { |
duke@435 | 2324 | visited.Clear(); |
duke@435 | 2325 | split_if_with_blocks( visited, nstack ); |
duke@435 | 2326 | NOT_PRODUCT( if( VerifyLoopOptimizations ) verify(); ); |
duke@435 | 2327 | } |
duke@435 | 2328 | |
roland@4589 | 2329 | if (!C->major_progress() && do_expensive_nodes && process_expensive_nodes()) { |
roland@4589 | 2330 | C->set_major_progress(); |
roland@4589 | 2331 | } |
roland@4589 | 2332 | |
cfang@1607 | 2333 | // Perform loop predication before iteration splitting |
kvn@2727 | 2334 | if (C->has_loops() && !C->major_progress() && (C->predicate_count() > 0)) { |
cfang@1607 | 2335 | _ltree_root->_child->loop_predication(this); |
cfang@1607 | 2336 | } |
cfang@1607 | 2337 | |
never@2118 | 2338 | if (OptimizeFill && UseLoopPredicate && C->has_loops() && !C->major_progress()) { |
never@2118 | 2339 | if (do_intrinsify_fill()) { |
never@2118 | 2340 | C->set_major_progress(); |
never@2118 | 2341 | } |
never@2118 | 2342 | } |
never@2118 | 2343 | |
duke@435 | 2344 | // Perform iteration-splitting on inner loops. Split iterations to avoid |
duke@435 | 2345 | // range checks or one-shot null checks. |
duke@435 | 2346 | |
duke@435 | 2347 | // If split-if's didn't hack the graph too bad (no CFG changes) |
duke@435 | 2348 | // then do loop opts. |
cfang@1607 | 2349 | if (C->has_loops() && !C->major_progress()) { |
duke@435 | 2350 | memset( worklist.adr(), 0, worklist.Size()*sizeof(Node*) ); |
duke@435 | 2351 | _ltree_root->_child->iteration_split( this, worklist ); |
duke@435 | 2352 | // No verify after peeling! GCM has hoisted code out of the loop. |
duke@435 | 2353 | // After peeling, the hoisted code could sink inside the peeled area. |
duke@435 | 2354 | // The peeling code does not try to recompute the best location for |
duke@435 | 2355 | // all the code before the peeled area, so the verify pass will always |
duke@435 | 2356 | // complain about it. |
duke@435 | 2357 | } |
duke@435 | 2358 | // Do verify graph edges in any case |
duke@435 | 2359 | NOT_PRODUCT( C->verify_graph_edges(); ); |
duke@435 | 2360 | |
cfang@1607 | 2361 | if (!do_split_ifs) { |
duke@435 | 2362 | // We saw major progress in Split-If to get here. We forced a |
duke@435 | 2363 | // pass with unrolling and not split-if, however more split-if's |
duke@435 | 2364 | // might make progress. If the unrolling didn't make progress |
duke@435 | 2365 | // then the major-progress flag got cleared and we won't try |
duke@435 | 2366 | // another round of Split-If. In particular the ever-common |
duke@435 | 2367 | // instance-of/check-cast pattern requires at least 2 rounds of |
duke@435 | 2368 | // Split-If to clear out. |
duke@435 | 2369 | C->set_major_progress(); |
duke@435 | 2370 | } |
duke@435 | 2371 | |
duke@435 | 2372 | // Repeat loop optimizations if new loops were seen |
duke@435 | 2373 | if (created_loop_node()) { |
duke@435 | 2374 | C->set_major_progress(); |
duke@435 | 2375 | } |
duke@435 | 2376 | |
kvn@2727 | 2377 | // Keep loop predicates and perform optimizations with them |
kvn@2727 | 2378 | // until no more loop optimizations could be done. |
kvn@2727 | 2379 | // After that switch predicates off and do more loop optimizations. |
kvn@2727 | 2380 | if (!C->major_progress() && (C->predicate_count() > 0)) { |
kvn@2727 | 2381 | C->cleanup_loop_predicates(_igvn); |
kvn@2727 | 2382 | #ifndef PRODUCT |
kvn@2727 | 2383 | if (TraceLoopOpts) { |
kvn@2727 | 2384 | tty->print_cr("PredicatesOff"); |
kvn@2727 | 2385 | } |
kvn@2727 | 2386 | #endif |
kvn@2727 | 2387 | C->set_major_progress(); |
kvn@2727 | 2388 | } |
duke@435 | 2389 | |
kvn@2727 | 2390 | // Convert scalar to superword operations at the end of all loop opts. |
duke@435 | 2391 | if (UseSuperWord && C->has_loops() && !C->major_progress()) { |
duke@435 | 2392 | // SuperWord transform |
duke@435 | 2393 | SuperWord sw(this); |
duke@435 | 2394 | for (LoopTreeIterator iter(_ltree_root); !iter.done(); iter.next()) { |
duke@435 | 2395 | IdealLoopTree* lpt = iter.current(); |
duke@435 | 2396 | if (lpt->is_counted()) { |
duke@435 | 2397 | sw.transform_loop(lpt); |
duke@435 | 2398 | } |
duke@435 | 2399 | } |
duke@435 | 2400 | } |
duke@435 | 2401 | |
duke@435 | 2402 | // Cleanup any modified bits |
duke@435 | 2403 | _igvn.optimize(); |
duke@435 | 2404 | |
never@802 | 2405 | // disable assert until issue with split_flow_path is resolved (6742111) |
never@802 | 2406 | // assert(!_has_irreducible_loops || C->parsed_irreducible_loop() || C->is_osr_compilation(), |
never@802 | 2407 | // "shouldn't introduce irreducible loops"); |
never@802 | 2408 | |
never@802 | 2409 | if (C->log() != NULL) { |
never@802 | 2410 | log_loop_tree(_ltree_root, _ltree_root, C->log()); |
never@802 | 2411 | } |
duke@435 | 2412 | } |
duke@435 | 2413 | |
duke@435 | 2414 | #ifndef PRODUCT |
duke@435 | 2415 | //------------------------------print_statistics------------------------------- |
duke@435 | 2416 | int PhaseIdealLoop::_loop_invokes=0;// Count of PhaseIdealLoop invokes |
duke@435 | 2417 | int PhaseIdealLoop::_loop_work=0; // Sum of PhaseIdealLoop x unique |
duke@435 | 2418 | void PhaseIdealLoop::print_statistics() { |
duke@435 | 2419 | tty->print_cr("PhaseIdealLoop=%d, sum _unique=%d", _loop_invokes, _loop_work); |
duke@435 | 2420 | } |
duke@435 | 2421 | |
duke@435 | 2422 | //------------------------------verify----------------------------------------- |
duke@435 | 2423 | // Build a verify-only PhaseIdealLoop, and see that it agrees with me. |
duke@435 | 2424 | static int fail; // debug only, so its multi-thread dont care |
duke@435 | 2425 | void PhaseIdealLoop::verify() const { |
duke@435 | 2426 | int old_progress = C->major_progress(); |
duke@435 | 2427 | ResourceMark rm; |
never@1356 | 2428 | PhaseIdealLoop loop_verify( _igvn, this ); |
duke@435 | 2429 | VectorSet visited(Thread::current()->resource_area()); |
duke@435 | 2430 | |
duke@435 | 2431 | fail = 0; |
duke@435 | 2432 | verify_compare( C->root(), &loop_verify, visited ); |
duke@435 | 2433 | assert( fail == 0, "verify loops failed" ); |
duke@435 | 2434 | // Verify loop structure is the same |
duke@435 | 2435 | _ltree_root->verify_tree(loop_verify._ltree_root, NULL); |
duke@435 | 2436 | // Reset major-progress. It was cleared by creating a verify version of |
duke@435 | 2437 | // PhaseIdealLoop. |
duke@435 | 2438 | for( int i=0; i<old_progress; i++ ) |
duke@435 | 2439 | C->set_major_progress(); |
duke@435 | 2440 | } |
duke@435 | 2441 | |
duke@435 | 2442 | //------------------------------verify_compare--------------------------------- |
duke@435 | 2443 | // Make sure me and the given PhaseIdealLoop agree on key data structures |
duke@435 | 2444 | void PhaseIdealLoop::verify_compare( Node *n, const PhaseIdealLoop *loop_verify, VectorSet &visited ) const { |
duke@435 | 2445 | if( !n ) return; |
duke@435 | 2446 | if( visited.test_set( n->_idx ) ) return; |
duke@435 | 2447 | if( !_nodes[n->_idx] ) { // Unreachable |
duke@435 | 2448 | assert( !loop_verify->_nodes[n->_idx], "both should be unreachable" ); |
duke@435 | 2449 | return; |
duke@435 | 2450 | } |
duke@435 | 2451 | |
duke@435 | 2452 | uint i; |
duke@435 | 2453 | for( i = 0; i < n->req(); i++ ) |
duke@435 | 2454 | verify_compare( n->in(i), loop_verify, visited ); |
duke@435 | 2455 | |
duke@435 | 2456 | // Check the '_nodes' block/loop structure |
duke@435 | 2457 | i = n->_idx; |
duke@435 | 2458 | if( has_ctrl(n) ) { // We have control; verify has loop or ctrl |
duke@435 | 2459 | if( _nodes[i] != loop_verify->_nodes[i] && |
duke@435 | 2460 | get_ctrl_no_update(n) != loop_verify->get_ctrl_no_update(n) ) { |
duke@435 | 2461 | tty->print("Mismatched control setting for: "); |
duke@435 | 2462 | n->dump(); |
duke@435 | 2463 | if( fail++ > 10 ) return; |
duke@435 | 2464 | Node *c = get_ctrl_no_update(n); |
duke@435 | 2465 | tty->print("We have it as: "); |
duke@435 | 2466 | if( c->in(0) ) c->dump(); |
duke@435 | 2467 | else tty->print_cr("N%d",c->_idx); |
duke@435 | 2468 | tty->print("Verify thinks: "); |
duke@435 | 2469 | if( loop_verify->has_ctrl(n) ) |
duke@435 | 2470 | loop_verify->get_ctrl_no_update(n)->dump(); |
duke@435 | 2471 | else |
duke@435 | 2472 | loop_verify->get_loop_idx(n)->dump(); |
duke@435 | 2473 | tty->cr(); |
duke@435 | 2474 | } |
duke@435 | 2475 | } else { // We have a loop |
duke@435 | 2476 | IdealLoopTree *us = get_loop_idx(n); |
duke@435 | 2477 | if( loop_verify->has_ctrl(n) ) { |
duke@435 | 2478 | tty->print("Mismatched loop setting for: "); |
duke@435 | 2479 | n->dump(); |
duke@435 | 2480 | if( fail++ > 10 ) return; |
duke@435 | 2481 | tty->print("We have it as: "); |
duke@435 | 2482 | us->dump(); |
duke@435 | 2483 | tty->print("Verify thinks: "); |
duke@435 | 2484 | loop_verify->get_ctrl_no_update(n)->dump(); |
duke@435 | 2485 | tty->cr(); |
duke@435 | 2486 | } else if (!C->major_progress()) { |
duke@435 | 2487 | // Loop selection can be messed up if we did a major progress |
duke@435 | 2488 | // operation, like split-if. Do not verify in that case. |
duke@435 | 2489 | IdealLoopTree *them = loop_verify->get_loop_idx(n); |
duke@435 | 2490 | if( us->_head != them->_head || us->_tail != them->_tail ) { |
duke@435 | 2491 | tty->print("Unequals loops for: "); |
duke@435 | 2492 | n->dump(); |
duke@435 | 2493 | if( fail++ > 10 ) return; |
duke@435 | 2494 | tty->print("We have it as: "); |
duke@435 | 2495 | us->dump(); |
duke@435 | 2496 | tty->print("Verify thinks: "); |
duke@435 | 2497 | them->dump(); |
duke@435 | 2498 | tty->cr(); |
duke@435 | 2499 | } |
duke@435 | 2500 | } |
duke@435 | 2501 | } |
duke@435 | 2502 | |
duke@435 | 2503 | // Check for immediate dominators being equal |
duke@435 | 2504 | if( i >= _idom_size ) { |
duke@435 | 2505 | if( !n->is_CFG() ) return; |
duke@435 | 2506 | tty->print("CFG Node with no idom: "); |
duke@435 | 2507 | n->dump(); |
duke@435 | 2508 | return; |
duke@435 | 2509 | } |
duke@435 | 2510 | if( !n->is_CFG() ) return; |
duke@435 | 2511 | if( n == C->root() ) return; // No IDOM here |
duke@435 | 2512 | |
duke@435 | 2513 | assert(n->_idx == i, "sanity"); |
duke@435 | 2514 | Node *id = idom_no_update(n); |
duke@435 | 2515 | if( id != loop_verify->idom_no_update(n) ) { |
duke@435 | 2516 | tty->print("Unequals idoms for: "); |
duke@435 | 2517 | n->dump(); |
duke@435 | 2518 | if( fail++ > 10 ) return; |
duke@435 | 2519 | tty->print("We have it as: "); |
duke@435 | 2520 | id->dump(); |
duke@435 | 2521 | tty->print("Verify thinks: "); |
duke@435 | 2522 | loop_verify->idom_no_update(n)->dump(); |
duke@435 | 2523 | tty->cr(); |
duke@435 | 2524 | } |
duke@435 | 2525 | |
duke@435 | 2526 | } |
duke@435 | 2527 | |
duke@435 | 2528 | //------------------------------verify_tree------------------------------------ |
duke@435 | 2529 | // Verify that tree structures match. Because the CFG can change, siblings |
duke@435 | 2530 | // within the loop tree can be reordered. We attempt to deal with that by |
duke@435 | 2531 | // reordering the verify's loop tree if possible. |
duke@435 | 2532 | void IdealLoopTree::verify_tree(IdealLoopTree *loop, const IdealLoopTree *parent) const { |
duke@435 | 2533 | assert( _parent == parent, "Badly formed loop tree" ); |
duke@435 | 2534 | |
duke@435 | 2535 | // Siblings not in same order? Attempt to re-order. |
duke@435 | 2536 | if( _head != loop->_head ) { |
duke@435 | 2537 | // Find _next pointer to update |
duke@435 | 2538 | IdealLoopTree **pp = &loop->_parent->_child; |
duke@435 | 2539 | while( *pp != loop ) |
duke@435 | 2540 | pp = &((*pp)->_next); |
duke@435 | 2541 | // Find proper sibling to be next |
duke@435 | 2542 | IdealLoopTree **nn = &loop->_next; |
duke@435 | 2543 | while( (*nn) && (*nn)->_head != _head ) |
duke@435 | 2544 | nn = &((*nn)->_next); |
duke@435 | 2545 | |
duke@435 | 2546 | // Check for no match. |
duke@435 | 2547 | if( !(*nn) ) { |
duke@435 | 2548 | // Annoyingly, irreducible loops can pick different headers |
duke@435 | 2549 | // after a major_progress operation, so the rest of the loop |
duke@435 | 2550 | // tree cannot be matched. |
duke@435 | 2551 | if (_irreducible && Compile::current()->major_progress()) return; |
duke@435 | 2552 | assert( 0, "failed to match loop tree" ); |
duke@435 | 2553 | } |
duke@435 | 2554 | |
duke@435 | 2555 | // Move (*nn) to (*pp) |
duke@435 | 2556 | IdealLoopTree *hit = *nn; |
duke@435 | 2557 | *nn = hit->_next; |
duke@435 | 2558 | hit->_next = loop; |
duke@435 | 2559 | *pp = loop; |
duke@435 | 2560 | loop = hit; |
duke@435 | 2561 | // Now try again to verify |
duke@435 | 2562 | } |
duke@435 | 2563 | |
duke@435 | 2564 | assert( _head == loop->_head , "mismatched loop head" ); |
duke@435 | 2565 | Node *tail = _tail; // Inline a non-updating version of |
duke@435 | 2566 | while( !tail->in(0) ) // the 'tail()' call. |
duke@435 | 2567 | tail = tail->in(1); |
duke@435 | 2568 | assert( tail == loop->_tail, "mismatched loop tail" ); |
duke@435 | 2569 | |
duke@435 | 2570 | // Counted loops that are guarded should be able to find their guards |
duke@435 | 2571 | if( _head->is_CountedLoop() && _head->as_CountedLoop()->is_main_loop() ) { |
duke@435 | 2572 | CountedLoopNode *cl = _head->as_CountedLoop(); |
duke@435 | 2573 | Node *init = cl->init_trip(); |
duke@435 | 2574 | Node *ctrl = cl->in(LoopNode::EntryControl); |
duke@435 | 2575 | assert( ctrl->Opcode() == Op_IfTrue || ctrl->Opcode() == Op_IfFalse, "" ); |
duke@435 | 2576 | Node *iff = ctrl->in(0); |
duke@435 | 2577 | assert( iff->Opcode() == Op_If, "" ); |
duke@435 | 2578 | Node *bol = iff->in(1); |
duke@435 | 2579 | assert( bol->Opcode() == Op_Bool, "" ); |
duke@435 | 2580 | Node *cmp = bol->in(1); |
duke@435 | 2581 | assert( cmp->Opcode() == Op_CmpI, "" ); |
duke@435 | 2582 | Node *add = cmp->in(1); |
duke@435 | 2583 | Node *opaq; |
duke@435 | 2584 | if( add->Opcode() == Op_Opaque1 ) { |
duke@435 | 2585 | opaq = add; |
duke@435 | 2586 | } else { |
duke@435 | 2587 | assert( add->Opcode() == Op_AddI || add->Opcode() == Op_ConI , "" ); |
duke@435 | 2588 | assert( add == init, "" ); |
duke@435 | 2589 | opaq = cmp->in(2); |
duke@435 | 2590 | } |
duke@435 | 2591 | assert( opaq->Opcode() == Op_Opaque1, "" ); |
duke@435 | 2592 | |
duke@435 | 2593 | } |
duke@435 | 2594 | |
duke@435 | 2595 | if (_child != NULL) _child->verify_tree(loop->_child, this); |
duke@435 | 2596 | if (_next != NULL) _next ->verify_tree(loop->_next, parent); |
duke@435 | 2597 | // Innermost loops need to verify loop bodies, |
duke@435 | 2598 | // but only if no 'major_progress' |
duke@435 | 2599 | int fail = 0; |
duke@435 | 2600 | if (!Compile::current()->major_progress() && _child == NULL) { |
duke@435 | 2601 | for( uint i = 0; i < _body.size(); i++ ) { |
duke@435 | 2602 | Node *n = _body.at(i); |
duke@435 | 2603 | if (n->outcnt() == 0) continue; // Ignore dead |
duke@435 | 2604 | uint j; |
duke@435 | 2605 | for( j = 0; j < loop->_body.size(); j++ ) |
duke@435 | 2606 | if( loop->_body.at(j) == n ) |
duke@435 | 2607 | break; |
duke@435 | 2608 | if( j == loop->_body.size() ) { // Not found in loop body |
duke@435 | 2609 | // Last ditch effort to avoid assertion: Its possible that we |
duke@435 | 2610 | // have some users (so outcnt not zero) but are still dead. |
duke@435 | 2611 | // Try to find from root. |
duke@435 | 2612 | if (Compile::current()->root()->find(n->_idx)) { |
duke@435 | 2613 | fail++; |
duke@435 | 2614 | tty->print("We have that verify does not: "); |
duke@435 | 2615 | n->dump(); |
duke@435 | 2616 | } |
duke@435 | 2617 | } |
duke@435 | 2618 | } |
duke@435 | 2619 | for( uint i2 = 0; i2 < loop->_body.size(); i2++ ) { |
duke@435 | 2620 | Node *n = loop->_body.at(i2); |
duke@435 | 2621 | if (n->outcnt() == 0) continue; // Ignore dead |
duke@435 | 2622 | uint j; |
duke@435 | 2623 | for( j = 0; j < _body.size(); j++ ) |
duke@435 | 2624 | if( _body.at(j) == n ) |
duke@435 | 2625 | break; |
duke@435 | 2626 | if( j == _body.size() ) { // Not found in loop body |
duke@435 | 2627 | // Last ditch effort to avoid assertion: Its possible that we |
duke@435 | 2628 | // have some users (so outcnt not zero) but are still dead. |
duke@435 | 2629 | // Try to find from root. |
duke@435 | 2630 | if (Compile::current()->root()->find(n->_idx)) { |
duke@435 | 2631 | fail++; |
duke@435 | 2632 | tty->print("Verify has that we do not: "); |
duke@435 | 2633 | n->dump(); |
duke@435 | 2634 | } |
duke@435 | 2635 | } |
duke@435 | 2636 | } |
duke@435 | 2637 | assert( !fail, "loop body mismatch" ); |
duke@435 | 2638 | } |
duke@435 | 2639 | } |
duke@435 | 2640 | |
duke@435 | 2641 | #endif |
duke@435 | 2642 | |
duke@435 | 2643 | //------------------------------set_idom--------------------------------------- |
duke@435 | 2644 | void PhaseIdealLoop::set_idom(Node* d, Node* n, uint dom_depth) { |
duke@435 | 2645 | uint idx = d->_idx; |
duke@435 | 2646 | if (idx >= _idom_size) { |
duke@435 | 2647 | uint newsize = _idom_size<<1; |
duke@435 | 2648 | while( idx >= newsize ) { |
duke@435 | 2649 | newsize <<= 1; |
duke@435 | 2650 | } |
duke@435 | 2651 | _idom = REALLOC_RESOURCE_ARRAY( Node*, _idom,_idom_size,newsize); |
duke@435 | 2652 | _dom_depth = REALLOC_RESOURCE_ARRAY( uint, _dom_depth,_idom_size,newsize); |
duke@435 | 2653 | memset( _dom_depth + _idom_size, 0, (newsize - _idom_size) * sizeof(uint) ); |
duke@435 | 2654 | _idom_size = newsize; |
duke@435 | 2655 | } |
duke@435 | 2656 | _idom[idx] = n; |
duke@435 | 2657 | _dom_depth[idx] = dom_depth; |
duke@435 | 2658 | } |
duke@435 | 2659 | |
duke@435 | 2660 | //------------------------------recompute_dom_depth--------------------------------------- |
duke@435 | 2661 | // The dominator tree is constructed with only parent pointers. |
duke@435 | 2662 | // This recomputes the depth in the tree by first tagging all |
duke@435 | 2663 | // nodes as "no depth yet" marker. The next pass then runs up |
duke@435 | 2664 | // the dom tree from each node marked "no depth yet", and computes |
duke@435 | 2665 | // the depth on the way back down. |
duke@435 | 2666 | void PhaseIdealLoop::recompute_dom_depth() { |
duke@435 | 2667 | uint no_depth_marker = C->unique(); |
duke@435 | 2668 | uint i; |
duke@435 | 2669 | // Initialize depth to "no depth yet" |
duke@435 | 2670 | for (i = 0; i < _idom_size; i++) { |
duke@435 | 2671 | if (_dom_depth[i] > 0 && _idom[i] != NULL) { |
duke@435 | 2672 | _dom_depth[i] = no_depth_marker; |
duke@435 | 2673 | } |
duke@435 | 2674 | } |
duke@435 | 2675 | if (_dom_stk == NULL) { |
duke@435 | 2676 | uint init_size = C->unique() / 100; // Guess that 1/100 is a reasonable initial size. |
duke@435 | 2677 | if (init_size < 10) init_size = 10; |
kvn@2555 | 2678 | _dom_stk = new GrowableArray<uint>(init_size); |
duke@435 | 2679 | } |
duke@435 | 2680 | // Compute new depth for each node. |
duke@435 | 2681 | for (i = 0; i < _idom_size; i++) { |
duke@435 | 2682 | uint j = i; |
duke@435 | 2683 | // Run up the dom tree to find a node with a depth |
duke@435 | 2684 | while (_dom_depth[j] == no_depth_marker) { |
duke@435 | 2685 | _dom_stk->push(j); |
duke@435 | 2686 | j = _idom[j]->_idx; |
duke@435 | 2687 | } |
duke@435 | 2688 | // Compute the depth on the way back down this tree branch |
duke@435 | 2689 | uint dd = _dom_depth[j] + 1; |
duke@435 | 2690 | while (_dom_stk->length() > 0) { |
duke@435 | 2691 | uint j = _dom_stk->pop(); |
duke@435 | 2692 | _dom_depth[j] = dd; |
duke@435 | 2693 | dd++; |
duke@435 | 2694 | } |
duke@435 | 2695 | } |
duke@435 | 2696 | } |
duke@435 | 2697 | |
duke@435 | 2698 | //------------------------------sort------------------------------------------- |
duke@435 | 2699 | // Insert 'loop' into the existing loop tree. 'innermost' is a leaf of the |
duke@435 | 2700 | // loop tree, not the root. |
duke@435 | 2701 | IdealLoopTree *PhaseIdealLoop::sort( IdealLoopTree *loop, IdealLoopTree *innermost ) { |
duke@435 | 2702 | if( !innermost ) return loop; // New innermost loop |
duke@435 | 2703 | |
duke@435 | 2704 | int loop_preorder = get_preorder(loop->_head); // Cache pre-order number |
duke@435 | 2705 | assert( loop_preorder, "not yet post-walked loop" ); |
duke@435 | 2706 | IdealLoopTree **pp = &innermost; // Pointer to previous next-pointer |
duke@435 | 2707 | IdealLoopTree *l = *pp; // Do I go before or after 'l'? |
duke@435 | 2708 | |
duke@435 | 2709 | // Insert at start of list |
duke@435 | 2710 | while( l ) { // Insertion sort based on pre-order |
duke@435 | 2711 | if( l == loop ) return innermost; // Already on list! |
duke@435 | 2712 | int l_preorder = get_preorder(l->_head); // Cache pre-order number |
duke@435 | 2713 | assert( l_preorder, "not yet post-walked l" ); |
duke@435 | 2714 | // Check header pre-order number to figure proper nesting |
duke@435 | 2715 | if( loop_preorder > l_preorder ) |
duke@435 | 2716 | break; // End of insertion |
duke@435 | 2717 | // If headers tie (e.g., shared headers) check tail pre-order numbers. |
duke@435 | 2718 | // Since I split shared headers, you'd think this could not happen. |
duke@435 | 2719 | // BUT: I must first do the preorder numbering before I can discover I |
duke@435 | 2720 | // have shared headers, so the split headers all get the same preorder |
duke@435 | 2721 | // number as the RegionNode they split from. |
duke@435 | 2722 | if( loop_preorder == l_preorder && |
duke@435 | 2723 | get_preorder(loop->_tail) < get_preorder(l->_tail) ) |
duke@435 | 2724 | break; // Also check for shared headers (same pre#) |
duke@435 | 2725 | pp = &l->_parent; // Chain up list |
duke@435 | 2726 | l = *pp; |
duke@435 | 2727 | } |
duke@435 | 2728 | // Link into list |
duke@435 | 2729 | // Point predecessor to me |
duke@435 | 2730 | *pp = loop; |
duke@435 | 2731 | // Point me to successor |
duke@435 | 2732 | IdealLoopTree *p = loop->_parent; |
duke@435 | 2733 | loop->_parent = l; // Point me to successor |
duke@435 | 2734 | if( p ) sort( p, innermost ); // Insert my parents into list as well |
duke@435 | 2735 | return innermost; |
duke@435 | 2736 | } |
duke@435 | 2737 | |
duke@435 | 2738 | //------------------------------build_loop_tree-------------------------------- |
duke@435 | 2739 | // I use a modified Vick/Tarjan algorithm. I need pre- and a post- visit |
duke@435 | 2740 | // bits. The _nodes[] array is mapped by Node index and holds a NULL for |
duke@435 | 2741 | // not-yet-pre-walked, pre-order # for pre-but-not-post-walked and holds the |
duke@435 | 2742 | // tightest enclosing IdealLoopTree for post-walked. |
duke@435 | 2743 | // |
duke@435 | 2744 | // During my forward walk I do a short 1-layer lookahead to see if I can find |
duke@435 | 2745 | // a loop backedge with that doesn't have any work on the backedge. This |
duke@435 | 2746 | // helps me construct nested loops with shared headers better. |
duke@435 | 2747 | // |
duke@435 | 2748 | // Once I've done the forward recursion, I do the post-work. For each child |
duke@435 | 2749 | // I check to see if there is a backedge. Backedges define a loop! I |
duke@435 | 2750 | // insert an IdealLoopTree at the target of the backedge. |
duke@435 | 2751 | // |
duke@435 | 2752 | // During the post-work I also check to see if I have several children |
duke@435 | 2753 | // belonging to different loops. If so, then this Node is a decision point |
duke@435 | 2754 | // where control flow can choose to change loop nests. It is at this |
duke@435 | 2755 | // decision point where I can figure out how loops are nested. At this |
duke@435 | 2756 | // time I can properly order the different loop nests from my children. |
duke@435 | 2757 | // Note that there may not be any backedges at the decision point! |
duke@435 | 2758 | // |
duke@435 | 2759 | // Since the decision point can be far removed from the backedges, I can't |
duke@435 | 2760 | // order my loops at the time I discover them. Thus at the decision point |
duke@435 | 2761 | // I need to inspect loop header pre-order numbers to properly nest my |
duke@435 | 2762 | // loops. This means I need to sort my childrens' loops by pre-order. |
duke@435 | 2763 | // The sort is of size number-of-control-children, which generally limits |
duke@435 | 2764 | // it to size 2 (i.e., I just choose between my 2 target loops). |
duke@435 | 2765 | void PhaseIdealLoop::build_loop_tree() { |
duke@435 | 2766 | // Allocate stack of size C->unique()/2 to avoid frequent realloc |
duke@435 | 2767 | GrowableArray <Node *> bltstack(C->unique() >> 1); |
duke@435 | 2768 | Node *n = C->root(); |
duke@435 | 2769 | bltstack.push(n); |
duke@435 | 2770 | int pre_order = 1; |
duke@435 | 2771 | int stack_size; |
duke@435 | 2772 | |
duke@435 | 2773 | while ( ( stack_size = bltstack.length() ) != 0 ) { |
duke@435 | 2774 | n = bltstack.top(); // Leave node on stack |
duke@435 | 2775 | if ( !is_visited(n) ) { |
duke@435 | 2776 | // ---- Pre-pass Work ---- |
duke@435 | 2777 | // Pre-walked but not post-walked nodes need a pre_order number. |
duke@435 | 2778 | |
duke@435 | 2779 | set_preorder_visited( n, pre_order ); // set as visited |
duke@435 | 2780 | |
duke@435 | 2781 | // ---- Scan over children ---- |
duke@435 | 2782 | // Scan first over control projections that lead to loop headers. |
duke@435 | 2783 | // This helps us find inner-to-outer loops with shared headers better. |
duke@435 | 2784 | |
duke@435 | 2785 | // Scan children's children for loop headers. |
duke@435 | 2786 | for ( int i = n->outcnt() - 1; i >= 0; --i ) { |
duke@435 | 2787 | Node* m = n->raw_out(i); // Child |
duke@435 | 2788 | if( m->is_CFG() && !is_visited(m) ) { // Only for CFG children |
duke@435 | 2789 | // Scan over children's children to find loop |
duke@435 | 2790 | for (DUIterator_Fast jmax, j = m->fast_outs(jmax); j < jmax; j++) { |
duke@435 | 2791 | Node* l = m->fast_out(j); |
duke@435 | 2792 | if( is_visited(l) && // Been visited? |
duke@435 | 2793 | !is_postvisited(l) && // But not post-visited |
duke@435 | 2794 | get_preorder(l) < pre_order ) { // And smaller pre-order |
duke@435 | 2795 | // Found! Scan the DFS down this path before doing other paths |
duke@435 | 2796 | bltstack.push(m); |
duke@435 | 2797 | break; |
duke@435 | 2798 | } |
duke@435 | 2799 | } |
duke@435 | 2800 | } |
duke@435 | 2801 | } |
duke@435 | 2802 | pre_order++; |
duke@435 | 2803 | } |
duke@435 | 2804 | else if ( !is_postvisited(n) ) { |
duke@435 | 2805 | // Note: build_loop_tree_impl() adds out edges on rare occasions, |
duke@435 | 2806 | // such as com.sun.rsasign.am::a. |
duke@435 | 2807 | // For non-recursive version, first, process current children. |
duke@435 | 2808 | // On next iteration, check if additional children were added. |
duke@435 | 2809 | for ( int k = n->outcnt() - 1; k >= 0; --k ) { |
duke@435 | 2810 | Node* u = n->raw_out(k); |
duke@435 | 2811 | if ( u->is_CFG() && !is_visited(u) ) { |
duke@435 | 2812 | bltstack.push(u); |
duke@435 | 2813 | } |
duke@435 | 2814 | } |
duke@435 | 2815 | if ( bltstack.length() == stack_size ) { |
duke@435 | 2816 | // There were no additional children, post visit node now |
duke@435 | 2817 | (void)bltstack.pop(); // Remove node from stack |
duke@435 | 2818 | pre_order = build_loop_tree_impl( n, pre_order ); |
duke@435 | 2819 | // Check for bailout |
duke@435 | 2820 | if (C->failing()) { |
duke@435 | 2821 | return; |
duke@435 | 2822 | } |
duke@435 | 2823 | // Check to grow _preorders[] array for the case when |
duke@435 | 2824 | // build_loop_tree_impl() adds new nodes. |
duke@435 | 2825 | check_grow_preorders(); |
duke@435 | 2826 | } |
duke@435 | 2827 | } |
duke@435 | 2828 | else { |
duke@435 | 2829 | (void)bltstack.pop(); // Remove post-visited node from stack |
duke@435 | 2830 | } |
duke@435 | 2831 | } |
duke@435 | 2832 | } |
duke@435 | 2833 | |
duke@435 | 2834 | //------------------------------build_loop_tree_impl--------------------------- |
duke@435 | 2835 | int PhaseIdealLoop::build_loop_tree_impl( Node *n, int pre_order ) { |
duke@435 | 2836 | // ---- Post-pass Work ---- |
duke@435 | 2837 | // Pre-walked but not post-walked nodes need a pre_order number. |
duke@435 | 2838 | |
duke@435 | 2839 | // Tightest enclosing loop for this Node |
duke@435 | 2840 | IdealLoopTree *innermost = NULL; |
duke@435 | 2841 | |
duke@435 | 2842 | // For all children, see if any edge is a backedge. If so, make a loop |
duke@435 | 2843 | // for it. Then find the tightest enclosing loop for the self Node. |
duke@435 | 2844 | for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) { |
duke@435 | 2845 | Node* m = n->fast_out(i); // Child |
duke@435 | 2846 | if( n == m ) continue; // Ignore control self-cycles |
duke@435 | 2847 | if( !m->is_CFG() ) continue;// Ignore non-CFG edges |
duke@435 | 2848 | |
duke@435 | 2849 | IdealLoopTree *l; // Child's loop |
duke@435 | 2850 | if( !is_postvisited(m) ) { // Child visited but not post-visited? |
duke@435 | 2851 | // Found a backedge |
duke@435 | 2852 | assert( get_preorder(m) < pre_order, "should be backedge" ); |
duke@435 | 2853 | // Check for the RootNode, which is already a LoopNode and is allowed |
duke@435 | 2854 | // to have multiple "backedges". |
duke@435 | 2855 | if( m == C->root()) { // Found the root? |
duke@435 | 2856 | l = _ltree_root; // Root is the outermost LoopNode |
duke@435 | 2857 | } else { // Else found a nested loop |
duke@435 | 2858 | // Insert a LoopNode to mark this loop. |
duke@435 | 2859 | l = new IdealLoopTree(this, m, n); |
duke@435 | 2860 | } // End of Else found a nested loop |
duke@435 | 2861 | if( !has_loop(m) ) // If 'm' does not already have a loop set |
duke@435 | 2862 | set_loop(m, l); // Set loop header to loop now |
duke@435 | 2863 | |
duke@435 | 2864 | } else { // Else not a nested loop |
duke@435 | 2865 | if( !_nodes[m->_idx] ) continue; // Dead code has no loop |
duke@435 | 2866 | l = get_loop(m); // Get previously determined loop |
duke@435 | 2867 | // If successor is header of a loop (nest), move up-loop till it |
duke@435 | 2868 | // is a member of some outer enclosing loop. Since there are no |
duke@435 | 2869 | // shared headers (I've split them already) I only need to go up |
duke@435 | 2870 | // at most 1 level. |
duke@435 | 2871 | while( l && l->_head == m ) // Successor heads loop? |
duke@435 | 2872 | l = l->_parent; // Move up 1 for me |
duke@435 | 2873 | // If this loop is not properly parented, then this loop |
duke@435 | 2874 | // has no exit path out, i.e. its an infinite loop. |
duke@435 | 2875 | if( !l ) { |
duke@435 | 2876 | // Make loop "reachable" from root so the CFG is reachable. Basically |
duke@435 | 2877 | // insert a bogus loop exit that is never taken. 'm', the loop head, |
duke@435 | 2878 | // points to 'n', one (of possibly many) fall-in paths. There may be |
duke@435 | 2879 | // many backedges as well. |
duke@435 | 2880 | |
duke@435 | 2881 | // Here I set the loop to be the root loop. I could have, after |
duke@435 | 2882 | // inserting a bogus loop exit, restarted the recursion and found my |
duke@435 | 2883 | // new loop exit. This would make the infinite loop a first-class |
duke@435 | 2884 | // loop and it would then get properly optimized. What's the use of |
duke@435 | 2885 | // optimizing an infinite loop? |
duke@435 | 2886 | l = _ltree_root; // Oops, found infinite loop |
duke@435 | 2887 | |
never@1356 | 2888 | if (!_verify_only) { |
never@1356 | 2889 | // Insert the NeverBranch between 'm' and it's control user. |
kvn@4115 | 2890 | NeverBranchNode *iff = new (C) NeverBranchNode( m ); |
never@1356 | 2891 | _igvn.register_new_node_with_optimizer(iff); |
never@1356 | 2892 | set_loop(iff, l); |
kvn@4115 | 2893 | Node *if_t = new (C) CProjNode( iff, 0 ); |
never@1356 | 2894 | _igvn.register_new_node_with_optimizer(if_t); |
never@1356 | 2895 | set_loop(if_t, l); |
duke@435 | 2896 | |
never@1356 | 2897 | Node* cfg = NULL; // Find the One True Control User of m |
never@1356 | 2898 | for (DUIterator_Fast jmax, j = m->fast_outs(jmax); j < jmax; j++) { |
never@1356 | 2899 | Node* x = m->fast_out(j); |
never@1356 | 2900 | if (x->is_CFG() && x != m && x != iff) |
never@1356 | 2901 | { cfg = x; break; } |
never@1356 | 2902 | } |
never@1356 | 2903 | assert(cfg != NULL, "must find the control user of m"); |
never@1356 | 2904 | uint k = 0; // Probably cfg->in(0) |
never@1356 | 2905 | while( cfg->in(k) != m ) k++; // But check incase cfg is a Region |
never@1356 | 2906 | cfg->set_req( k, if_t ); // Now point to NeverBranch |
never@1356 | 2907 | |
never@1356 | 2908 | // Now create the never-taken loop exit |
kvn@4115 | 2909 | Node *if_f = new (C) CProjNode( iff, 1 ); |
never@1356 | 2910 | _igvn.register_new_node_with_optimizer(if_f); |
never@1356 | 2911 | set_loop(if_f, l); |
never@1356 | 2912 | // Find frame ptr for Halt. Relies on the optimizer |
never@1356 | 2913 | // V-N'ing. Easier and quicker than searching through |
never@1356 | 2914 | // the program structure. |
kvn@4115 | 2915 | Node *frame = new (C) ParmNode( C->start(), TypeFunc::FramePtr ); |
never@1356 | 2916 | _igvn.register_new_node_with_optimizer(frame); |
never@1356 | 2917 | // Halt & Catch Fire |
kvn@4115 | 2918 | Node *halt = new (C) HaltNode( if_f, frame ); |
never@1356 | 2919 | _igvn.register_new_node_with_optimizer(halt); |
never@1356 | 2920 | set_loop(halt, l); |
never@1356 | 2921 | C->root()->add_req(halt); |
duke@435 | 2922 | } |
duke@435 | 2923 | set_loop(C->root(), _ltree_root); |
duke@435 | 2924 | } |
duke@435 | 2925 | } |
duke@435 | 2926 | // Weeny check for irreducible. This child was already visited (this |
duke@435 | 2927 | // IS the post-work phase). Is this child's loop header post-visited |
duke@435 | 2928 | // as well? If so, then I found another entry into the loop. |
never@1356 | 2929 | if (!_verify_only) { |
never@1356 | 2930 | while( is_postvisited(l->_head) ) { |
never@1356 | 2931 | // found irreducible |
never@1356 | 2932 | l->_irreducible = 1; // = true |
never@1356 | 2933 | l = l->_parent; |
never@1356 | 2934 | _has_irreducible_loops = true; |
never@1356 | 2935 | // Check for bad CFG here to prevent crash, and bailout of compile |
never@1356 | 2936 | if (l == NULL) { |
never@1356 | 2937 | C->record_method_not_compilable("unhandled CFG detected during loop optimization"); |
never@1356 | 2938 | return pre_order; |
never@1356 | 2939 | } |
duke@435 | 2940 | } |
kvn@6657 | 2941 | C->set_has_irreducible_loop(_has_irreducible_loops); |
duke@435 | 2942 | } |
duke@435 | 2943 | |
duke@435 | 2944 | // This Node might be a decision point for loops. It is only if |
duke@435 | 2945 | // it's children belong to several different loops. The sort call |
duke@435 | 2946 | // does a trivial amount of work if there is only 1 child or all |
duke@435 | 2947 | // children belong to the same loop. If however, the children |
duke@435 | 2948 | // belong to different loops, the sort call will properly set the |
duke@435 | 2949 | // _parent pointers to show how the loops nest. |
duke@435 | 2950 | // |
duke@435 | 2951 | // In any case, it returns the tightest enclosing loop. |
duke@435 | 2952 | innermost = sort( l, innermost ); |
duke@435 | 2953 | } |
duke@435 | 2954 | |
duke@435 | 2955 | // Def-use info will have some dead stuff; dead stuff will have no |
duke@435 | 2956 | // loop decided on. |
duke@435 | 2957 | |
duke@435 | 2958 | // Am I a loop header? If so fix up my parent's child and next ptrs. |
duke@435 | 2959 | if( innermost && innermost->_head == n ) { |
duke@435 | 2960 | assert( get_loop(n) == innermost, "" ); |
duke@435 | 2961 | IdealLoopTree *p = innermost->_parent; |
duke@435 | 2962 | IdealLoopTree *l = innermost; |
duke@435 | 2963 | while( p && l->_head == n ) { |
duke@435 | 2964 | l->_next = p->_child; // Put self on parents 'next child' |
duke@435 | 2965 | p->_child = l; // Make self as first child of parent |
duke@435 | 2966 | l = p; // Now walk up the parent chain |
duke@435 | 2967 | p = l->_parent; |
duke@435 | 2968 | } |
duke@435 | 2969 | } else { |
duke@435 | 2970 | // Note that it is possible for a LoopNode to reach here, if the |
duke@435 | 2971 | // backedge has been made unreachable (hence the LoopNode no longer |
duke@435 | 2972 | // denotes a Loop, and will eventually be removed). |
duke@435 | 2973 | |
duke@435 | 2974 | // Record tightest enclosing loop for self. Mark as post-visited. |
duke@435 | 2975 | set_loop(n, innermost); |
duke@435 | 2976 | // Also record has_call flag early on |
duke@435 | 2977 | if( innermost ) { |
duke@435 | 2978 | if( n->is_Call() && !n->is_CallLeaf() && !n->is_macro() ) { |
duke@435 | 2979 | // Do not count uncommon calls |
duke@435 | 2980 | if( !n->is_CallStaticJava() || !n->as_CallStaticJava()->_name ) { |
duke@435 | 2981 | Node *iff = n->in(0)->in(0); |
kvn@3882 | 2982 | // No any calls for vectorized loops. |
kvn@3882 | 2983 | if( UseSuperWord || !iff->is_If() || |
duke@435 | 2984 | (n->in(0)->Opcode() == Op_IfFalse && |
duke@435 | 2985 | (1.0 - iff->as_If()->_prob) >= 0.01) || |
duke@435 | 2986 | (iff->as_If()->_prob >= 0.01) ) |
duke@435 | 2987 | innermost->_has_call = 1; |
duke@435 | 2988 | } |
kvn@474 | 2989 | } else if( n->is_Allocate() && n->as_Allocate()->_is_scalar_replaceable ) { |
kvn@474 | 2990 | // Disable loop optimizations if the loop has a scalar replaceable |
kvn@474 | 2991 | // allocation. This disabling may cause a potential performance lost |
kvn@474 | 2992 | // if the allocation is not eliminated for some reason. |
kvn@474 | 2993 | innermost->_allow_optimizations = false; |
kvn@474 | 2994 | innermost->_has_call = 1; // = true |
kvn@4023 | 2995 | } else if (n->Opcode() == Op_SafePoint) { |
kvn@4023 | 2996 | // Record all safepoints in this loop. |
kvn@4023 | 2997 | if (innermost->_safepts == NULL) innermost->_safepts = new Node_List(); |
kvn@4023 | 2998 | innermost->_safepts->push(n); |
duke@435 | 2999 | } |
duke@435 | 3000 | } |
duke@435 | 3001 | } |
duke@435 | 3002 | |
duke@435 | 3003 | // Flag as post-visited now |
duke@435 | 3004 | set_postvisited(n); |
duke@435 | 3005 | return pre_order; |
duke@435 | 3006 | } |
duke@435 | 3007 | |
duke@435 | 3008 | |
duke@435 | 3009 | //------------------------------build_loop_early------------------------------- |
duke@435 | 3010 | // Put Data nodes into some loop nest, by setting the _nodes[]->loop mapping. |
duke@435 | 3011 | // First pass computes the earliest controlling node possible. This is the |
duke@435 | 3012 | // controlling input with the deepest dominating depth. |
never@1356 | 3013 | void PhaseIdealLoop::build_loop_early( VectorSet &visited, Node_List &worklist, Node_Stack &nstack ) { |
duke@435 | 3014 | while (worklist.size() != 0) { |
duke@435 | 3015 | // Use local variables nstack_top_n & nstack_top_i to cache values |
duke@435 | 3016 | // on nstack's top. |
duke@435 | 3017 | Node *nstack_top_n = worklist.pop(); |
duke@435 | 3018 | uint nstack_top_i = 0; |
duke@435 | 3019 | //while_nstack_nonempty: |
duke@435 | 3020 | while (true) { |
duke@435 | 3021 | // Get parent node and next input's index from stack's top. |
duke@435 | 3022 | Node *n = nstack_top_n; |
duke@435 | 3023 | uint i = nstack_top_i; |
duke@435 | 3024 | uint cnt = n->req(); // Count of inputs |
duke@435 | 3025 | if (i == 0) { // Pre-process the node. |
duke@435 | 3026 | if( has_node(n) && // Have either loop or control already? |
duke@435 | 3027 | !has_ctrl(n) ) { // Have loop picked out already? |
duke@435 | 3028 | // During "merge_many_backedges" we fold up several nested loops |
duke@435 | 3029 | // into a single loop. This makes the members of the original |
duke@435 | 3030 | // loop bodies pointing to dead loops; they need to move up |
duke@435 | 3031 | // to the new UNION'd larger loop. I set the _head field of these |
duke@435 | 3032 | // dead loops to NULL and the _parent field points to the owning |
duke@435 | 3033 | // loop. Shades of UNION-FIND algorithm. |
duke@435 | 3034 | IdealLoopTree *ilt; |
duke@435 | 3035 | while( !(ilt = get_loop(n))->_head ) { |
duke@435 | 3036 | // Normally I would use a set_loop here. But in this one special |
duke@435 | 3037 | // case, it is legal (and expected) to change what loop a Node |
duke@435 | 3038 | // belongs to. |
duke@435 | 3039 | _nodes.map(n->_idx, (Node*)(ilt->_parent) ); |
duke@435 | 3040 | } |
duke@435 | 3041 | // Remove safepoints ONLY if I've already seen I don't need one. |
duke@435 | 3042 | // (the old code here would yank a 2nd safepoint after seeing a |
duke@435 | 3043 | // first one, even though the 1st did not dominate in the loop body |
duke@435 | 3044 | // and thus could be avoided indefinitely) |
never@1356 | 3045 | if( !_verify_only && !_verify_me && ilt->_has_sfpt && n->Opcode() == Op_SafePoint && |
duke@435 | 3046 | is_deleteable_safept(n)) { |
duke@435 | 3047 | Node *in = n->in(TypeFunc::Control); |
duke@435 | 3048 | lazy_replace(n,in); // Pull safepoint now |
kvn@4023 | 3049 | if (ilt->_safepts != NULL) { |
kvn@4023 | 3050 | ilt->_safepts->yank(n); |
kvn@4023 | 3051 | } |
duke@435 | 3052 | // Carry on with the recursion "as if" we are walking |
duke@435 | 3053 | // only the control input |
duke@435 | 3054 | if( !visited.test_set( in->_idx ) ) { |
duke@435 | 3055 | worklist.push(in); // Visit this guy later, using worklist |
duke@435 | 3056 | } |
duke@435 | 3057 | // Get next node from nstack: |
duke@435 | 3058 | // - skip n's inputs processing by setting i > cnt; |
duke@435 | 3059 | // - we also will not call set_early_ctrl(n) since |
duke@435 | 3060 | // has_node(n) == true (see the condition above). |
duke@435 | 3061 | i = cnt + 1; |
duke@435 | 3062 | } |
duke@435 | 3063 | } |
duke@435 | 3064 | } // if (i == 0) |
duke@435 | 3065 | |
duke@435 | 3066 | // Visit all inputs |
duke@435 | 3067 | bool done = true; // Assume all n's inputs will be processed |
duke@435 | 3068 | while (i < cnt) { |
duke@435 | 3069 | Node *in = n->in(i); |
duke@435 | 3070 | ++i; |
duke@435 | 3071 | if (in == NULL) continue; |
duke@435 | 3072 | if (in->pinned() && !in->is_CFG()) |
duke@435 | 3073 | set_ctrl(in, in->in(0)); |
duke@435 | 3074 | int is_visited = visited.test_set( in->_idx ); |
duke@435 | 3075 | if (!has_node(in)) { // No controlling input yet? |
duke@435 | 3076 | assert( !in->is_CFG(), "CFG Node with no controlling input?" ); |
duke@435 | 3077 | assert( !is_visited, "visit only once" ); |
duke@435 | 3078 | nstack.push(n, i); // Save parent node and next input's index. |
duke@435 | 3079 | nstack_top_n = in; // Process current input now. |
duke@435 | 3080 | nstack_top_i = 0; |
duke@435 | 3081 | done = false; // Not all n's inputs processed. |
duke@435 | 3082 | break; // continue while_nstack_nonempty; |
duke@435 | 3083 | } else if (!is_visited) { |
duke@435 | 3084 | // This guy has a location picked out for him, but has not yet |
duke@435 | 3085 | // been visited. Happens to all CFG nodes, for instance. |
duke@435 | 3086 | // Visit him using the worklist instead of recursion, to break |
duke@435 | 3087 | // cycles. Since he has a location already we do not need to |
duke@435 | 3088 | // find his location before proceeding with the current Node. |
duke@435 | 3089 | worklist.push(in); // Visit this guy later, using worklist |
duke@435 | 3090 | } |
duke@435 | 3091 | } |
duke@435 | 3092 | if (done) { |
duke@435 | 3093 | // All of n's inputs have been processed, complete post-processing. |
duke@435 | 3094 | |
twisti@1040 | 3095 | // Compute earliest point this Node can go. |
duke@435 | 3096 | // CFG, Phi, pinned nodes already know their controlling input. |
duke@435 | 3097 | if (!has_node(n)) { |
duke@435 | 3098 | // Record earliest legal location |
duke@435 | 3099 | set_early_ctrl( n ); |
duke@435 | 3100 | } |
duke@435 | 3101 | if (nstack.is_empty()) { |
duke@435 | 3102 | // Finished all nodes on stack. |
duke@435 | 3103 | // Process next node on the worklist. |
duke@435 | 3104 | break; |
duke@435 | 3105 | } |
duke@435 | 3106 | // Get saved parent node and next input's index. |
duke@435 | 3107 | nstack_top_n = nstack.node(); |
duke@435 | 3108 | nstack_top_i = nstack.index(); |
duke@435 | 3109 | nstack.pop(); |
duke@435 | 3110 | } |
duke@435 | 3111 | } // while (true) |
duke@435 | 3112 | } |
duke@435 | 3113 | } |
duke@435 | 3114 | |
duke@435 | 3115 | //------------------------------dom_lca_internal-------------------------------- |
duke@435 | 3116 | // Pair-wise LCA |
duke@435 | 3117 | Node *PhaseIdealLoop::dom_lca_internal( Node *n1, Node *n2 ) const { |
duke@435 | 3118 | if( !n1 ) return n2; // Handle NULL original LCA |
duke@435 | 3119 | assert( n1->is_CFG(), "" ); |
duke@435 | 3120 | assert( n2->is_CFG(), "" ); |
duke@435 | 3121 | // find LCA of all uses |
duke@435 | 3122 | uint d1 = dom_depth(n1); |
duke@435 | 3123 | uint d2 = dom_depth(n2); |
duke@435 | 3124 | while (n1 != n2) { |
duke@435 | 3125 | if (d1 > d2) { |
duke@435 | 3126 | n1 = idom(n1); |
duke@435 | 3127 | d1 = dom_depth(n1); |
duke@435 | 3128 | } else if (d1 < d2) { |
duke@435 | 3129 | n2 = idom(n2); |
duke@435 | 3130 | d2 = dom_depth(n2); |
duke@435 | 3131 | } else { |
duke@435 | 3132 | // Here d1 == d2. Due to edits of the dominator-tree, sections |
duke@435 | 3133 | // of the tree might have the same depth. These sections have |
duke@435 | 3134 | // to be searched more carefully. |
duke@435 | 3135 | |
duke@435 | 3136 | // Scan up all the n1's with equal depth, looking for n2. |
duke@435 | 3137 | Node *t1 = idom(n1); |
duke@435 | 3138 | while (dom_depth(t1) == d1) { |
duke@435 | 3139 | if (t1 == n2) return n2; |
duke@435 | 3140 | t1 = idom(t1); |
duke@435 | 3141 | } |
duke@435 | 3142 | // Scan up all the n2's with equal depth, looking for n1. |
duke@435 | 3143 | Node *t2 = idom(n2); |
duke@435 | 3144 | while (dom_depth(t2) == d2) { |
duke@435 | 3145 | if (t2 == n1) return n1; |
duke@435 | 3146 | t2 = idom(t2); |
duke@435 | 3147 | } |
duke@435 | 3148 | // Move up to a new dominator-depth value as well as up the dom-tree. |
duke@435 | 3149 | n1 = t1; |
duke@435 | 3150 | n2 = t2; |
duke@435 | 3151 | d1 = dom_depth(n1); |
duke@435 | 3152 | d2 = dom_depth(n2); |
duke@435 | 3153 | } |
duke@435 | 3154 | } |
duke@435 | 3155 | return n1; |
duke@435 | 3156 | } |
duke@435 | 3157 | |
duke@435 | 3158 | //------------------------------compute_idom----------------------------------- |
duke@435 | 3159 | // Locally compute IDOM using dom_lca call. Correct only if the incoming |
duke@435 | 3160 | // IDOMs are correct. |
duke@435 | 3161 | Node *PhaseIdealLoop::compute_idom( Node *region ) const { |
duke@435 | 3162 | assert( region->is_Region(), "" ); |
duke@435 | 3163 | Node *LCA = NULL; |
duke@435 | 3164 | for( uint i = 1; i < region->req(); i++ ) { |
duke@435 | 3165 | if( region->in(i) != C->top() ) |
duke@435 | 3166 | LCA = dom_lca( LCA, region->in(i) ); |
duke@435 | 3167 | } |
duke@435 | 3168 | return LCA; |
duke@435 | 3169 | } |
duke@435 | 3170 | |
never@1356 | 3171 | bool PhaseIdealLoop::verify_dominance(Node* n, Node* use, Node* LCA, Node* early) { |
never@1356 | 3172 | bool had_error = false; |
never@1356 | 3173 | #ifdef ASSERT |
never@1356 | 3174 | if (early != C->root()) { |
kvn@6630 | 3175 | // Make sure that there's a dominance path from LCA to early |
kvn@6630 | 3176 | Node* d = LCA; |
kvn@6630 | 3177 | while (d != early) { |
never@1356 | 3178 | if (d == C->root()) { |
kvn@6630 | 3179 | dump_bad_graph("Bad graph detected in compute_lca_of_uses", n, early, LCA); |
kvn@6630 | 3180 | tty->print_cr("*** Use %d isn't dominated by def %d ***", use->_idx, n->_idx); |
never@1356 | 3181 | had_error = true; |
never@1356 | 3182 | break; |
never@1356 | 3183 | } |
kvn@6630 | 3184 | d = idom(d); |
never@1356 | 3185 | } |
never@1356 | 3186 | } |
never@1356 | 3187 | #endif |
never@1356 | 3188 | return had_error; |
never@1356 | 3189 | } |
duke@435 | 3190 | |
never@1356 | 3191 | |
never@1356 | 3192 | Node* PhaseIdealLoop::compute_lca_of_uses(Node* n, Node* early, bool verify) { |
duke@435 | 3193 | // Compute LCA over list of uses |
never@1356 | 3194 | bool had_error = false; |
duke@435 | 3195 | Node *LCA = NULL; |
duke@435 | 3196 | for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax && LCA != early; i++) { |
duke@435 | 3197 | Node* c = n->fast_out(i); |
duke@435 | 3198 | if (_nodes[c->_idx] == NULL) |
duke@435 | 3199 | continue; // Skip the occasional dead node |
duke@435 | 3200 | if( c->is_Phi() ) { // For Phis, we must land above on the path |
duke@435 | 3201 | for( uint j=1; j<c->req(); j++ ) {// For all inputs |
duke@435 | 3202 | if( c->in(j) == n ) { // Found matching input? |
duke@435 | 3203 | Node *use = c->in(0)->in(j); |
never@1356 | 3204 | if (_verify_only && use->is_top()) continue; |
duke@435 | 3205 | LCA = dom_lca_for_get_late_ctrl( LCA, use, n ); |
never@1356 | 3206 | if (verify) had_error = verify_dominance(n, use, LCA, early) || had_error; |
duke@435 | 3207 | } |
duke@435 | 3208 | } |
duke@435 | 3209 | } else { |
duke@435 | 3210 | // For CFG data-users, use is in the block just prior |
duke@435 | 3211 | Node *use = has_ctrl(c) ? get_ctrl(c) : c->in(0); |
duke@435 | 3212 | LCA = dom_lca_for_get_late_ctrl( LCA, use, n ); |
never@1356 | 3213 | if (verify) had_error = verify_dominance(n, use, LCA, early) || had_error; |
duke@435 | 3214 | } |
duke@435 | 3215 | } |
never@1356 | 3216 | assert(!had_error, "bad dominance"); |
never@1356 | 3217 | return LCA; |
never@1356 | 3218 | } |
never@1356 | 3219 | |
never@1356 | 3220 | //------------------------------get_late_ctrl---------------------------------- |
never@1356 | 3221 | // Compute latest legal control. |
never@1356 | 3222 | Node *PhaseIdealLoop::get_late_ctrl( Node *n, Node *early ) { |
never@1356 | 3223 | assert(early != NULL, "early control should not be NULL"); |
never@1356 | 3224 | |
never@1356 | 3225 | Node* LCA = compute_lca_of_uses(n, early); |
never@1356 | 3226 | #ifdef ASSERT |
never@1356 | 3227 | if (LCA == C->root() && LCA != early) { |
never@1356 | 3228 | // def doesn't dominate uses so print some useful debugging output |
never@1356 | 3229 | compute_lca_of_uses(n, early, true); |
never@1356 | 3230 | } |
never@1356 | 3231 | #endif |
duke@435 | 3232 | |
duke@435 | 3233 | // if this is a load, check for anti-dependent stores |
duke@435 | 3234 | // We use a conservative algorithm to identify potential interfering |
duke@435 | 3235 | // instructions and for rescheduling the load. The users of the memory |
duke@435 | 3236 | // input of this load are examined. Any use which is not a load and is |
duke@435 | 3237 | // dominated by early is considered a potentially interfering store. |
duke@435 | 3238 | // This can produce false positives. |
duke@435 | 3239 | if (n->is_Load() && LCA != early) { |
duke@435 | 3240 | Node_List worklist; |
duke@435 | 3241 | |
duke@435 | 3242 | Node *mem = n->in(MemNode::Memory); |
duke@435 | 3243 | for (DUIterator_Fast imax, i = mem->fast_outs(imax); i < imax; i++) { |
duke@435 | 3244 | Node* s = mem->fast_out(i); |
duke@435 | 3245 | worklist.push(s); |
duke@435 | 3246 | } |
duke@435 | 3247 | while(worklist.size() != 0 && LCA != early) { |
duke@435 | 3248 | Node* s = worklist.pop(); |
duke@435 | 3249 | if (s->is_Load()) { |
duke@435 | 3250 | continue; |
duke@435 | 3251 | } else if (s->is_MergeMem()) { |
duke@435 | 3252 | for (DUIterator_Fast imax, i = s->fast_outs(imax); i < imax; i++) { |
duke@435 | 3253 | Node* s1 = s->fast_out(i); |
duke@435 | 3254 | worklist.push(s1); |
duke@435 | 3255 | } |
duke@435 | 3256 | } else { |
duke@435 | 3257 | Node *sctrl = has_ctrl(s) ? get_ctrl(s) : s->in(0); |
duke@435 | 3258 | assert(sctrl != NULL || s->outcnt() == 0, "must have control"); |
duke@435 | 3259 | if (sctrl != NULL && !sctrl->is_top() && is_dominator(early, sctrl)) { |
duke@435 | 3260 | LCA = dom_lca_for_get_late_ctrl(LCA, sctrl, n); |
duke@435 | 3261 | } |
duke@435 | 3262 | } |
duke@435 | 3263 | } |
duke@435 | 3264 | } |
duke@435 | 3265 | |
duke@435 | 3266 | assert(LCA == find_non_split_ctrl(LCA), "unexpected late control"); |
duke@435 | 3267 | return LCA; |
duke@435 | 3268 | } |
duke@435 | 3269 | |
duke@435 | 3270 | // true if CFG node d dominates CFG node n |
duke@435 | 3271 | bool PhaseIdealLoop::is_dominator(Node *d, Node *n) { |
duke@435 | 3272 | if (d == n) |
duke@435 | 3273 | return true; |
duke@435 | 3274 | assert(d->is_CFG() && n->is_CFG(), "must have CFG nodes"); |
duke@435 | 3275 | uint dd = dom_depth(d); |
duke@435 | 3276 | while (dom_depth(n) >= dd) { |
duke@435 | 3277 | if (n == d) |
duke@435 | 3278 | return true; |
duke@435 | 3279 | n = idom(n); |
duke@435 | 3280 | } |
duke@435 | 3281 | return false; |
duke@435 | 3282 | } |
duke@435 | 3283 | |
duke@435 | 3284 | //------------------------------dom_lca_for_get_late_ctrl_internal------------- |
duke@435 | 3285 | // Pair-wise LCA with tags. |
duke@435 | 3286 | // Tag each index with the node 'tag' currently being processed |
duke@435 | 3287 | // before advancing up the dominator chain using idom(). |
duke@435 | 3288 | // Later calls that find a match to 'tag' know that this path has already |
duke@435 | 3289 | // been considered in the current LCA (which is input 'n1' by convention). |
duke@435 | 3290 | // Since get_late_ctrl() is only called once for each node, the tag array |
duke@435 | 3291 | // does not need to be cleared between calls to get_late_ctrl(). |
duke@435 | 3292 | // Algorithm trades a larger constant factor for better asymptotic behavior |
duke@435 | 3293 | // |
duke@435 | 3294 | Node *PhaseIdealLoop::dom_lca_for_get_late_ctrl_internal( Node *n1, Node *n2, Node *tag ) { |
duke@435 | 3295 | uint d1 = dom_depth(n1); |
duke@435 | 3296 | uint d2 = dom_depth(n2); |
duke@435 | 3297 | |
duke@435 | 3298 | do { |
duke@435 | 3299 | if (d1 > d2) { |
duke@435 | 3300 | // current lca is deeper than n2 |
duke@435 | 3301 | _dom_lca_tags.map(n1->_idx, tag); |
duke@435 | 3302 | n1 = idom(n1); |
duke@435 | 3303 | d1 = dom_depth(n1); |
duke@435 | 3304 | } else if (d1 < d2) { |
duke@435 | 3305 | // n2 is deeper than current lca |
duke@435 | 3306 | Node *memo = _dom_lca_tags[n2->_idx]; |
duke@435 | 3307 | if( memo == tag ) { |
duke@435 | 3308 | return n1; // Return the current LCA |
duke@435 | 3309 | } |
duke@435 | 3310 | _dom_lca_tags.map(n2->_idx, tag); |
duke@435 | 3311 | n2 = idom(n2); |
duke@435 | 3312 | d2 = dom_depth(n2); |
duke@435 | 3313 | } else { |
duke@435 | 3314 | // Here d1 == d2. Due to edits of the dominator-tree, sections |
duke@435 | 3315 | // of the tree might have the same depth. These sections have |
duke@435 | 3316 | // to be searched more carefully. |
duke@435 | 3317 | |
duke@435 | 3318 | // Scan up all the n1's with equal depth, looking for n2. |
duke@435 | 3319 | _dom_lca_tags.map(n1->_idx, tag); |
duke@435 | 3320 | Node *t1 = idom(n1); |
duke@435 | 3321 | while (dom_depth(t1) == d1) { |
duke@435 | 3322 | if (t1 == n2) return n2; |
duke@435 | 3323 | _dom_lca_tags.map(t1->_idx, tag); |
duke@435 | 3324 | t1 = idom(t1); |
duke@435 | 3325 | } |
duke@435 | 3326 | // Scan up all the n2's with equal depth, looking for n1. |
duke@435 | 3327 | _dom_lca_tags.map(n2->_idx, tag); |
duke@435 | 3328 | Node *t2 = idom(n2); |
duke@435 | 3329 | while (dom_depth(t2) == d2) { |
duke@435 | 3330 | if (t2 == n1) return n1; |
duke@435 | 3331 | _dom_lca_tags.map(t2->_idx, tag); |
duke@435 | 3332 | t2 = idom(t2); |
duke@435 | 3333 | } |
duke@435 | 3334 | // Move up to a new dominator-depth value as well as up the dom-tree. |
duke@435 | 3335 | n1 = t1; |
duke@435 | 3336 | n2 = t2; |
duke@435 | 3337 | d1 = dom_depth(n1); |
duke@435 | 3338 | d2 = dom_depth(n2); |
duke@435 | 3339 | } |
duke@435 | 3340 | } while (n1 != n2); |
duke@435 | 3341 | return n1; |
duke@435 | 3342 | } |
duke@435 | 3343 | |
duke@435 | 3344 | //------------------------------init_dom_lca_tags------------------------------ |
duke@435 | 3345 | // Tag could be a node's integer index, 32bits instead of 64bits in some cases |
duke@435 | 3346 | // Intended use does not involve any growth for the array, so it could |
duke@435 | 3347 | // be of fixed size. |
duke@435 | 3348 | void PhaseIdealLoop::init_dom_lca_tags() { |
duke@435 | 3349 | uint limit = C->unique() + 1; |
duke@435 | 3350 | _dom_lca_tags.map( limit, NULL ); |
duke@435 | 3351 | #ifdef ASSERT |
duke@435 | 3352 | for( uint i = 0; i < limit; ++i ) { |
duke@435 | 3353 | assert(_dom_lca_tags[i] == NULL, "Must be distinct from each node pointer"); |
duke@435 | 3354 | } |
duke@435 | 3355 | #endif // ASSERT |
duke@435 | 3356 | } |
duke@435 | 3357 | |
duke@435 | 3358 | //------------------------------clear_dom_lca_tags------------------------------ |
duke@435 | 3359 | // Tag could be a node's integer index, 32bits instead of 64bits in some cases |
duke@435 | 3360 | // Intended use does not involve any growth for the array, so it could |
duke@435 | 3361 | // be of fixed size. |
duke@435 | 3362 | void PhaseIdealLoop::clear_dom_lca_tags() { |
duke@435 | 3363 | uint limit = C->unique() + 1; |
duke@435 | 3364 | _dom_lca_tags.map( limit, NULL ); |
duke@435 | 3365 | _dom_lca_tags.clear(); |
duke@435 | 3366 | #ifdef ASSERT |
duke@435 | 3367 | for( uint i = 0; i < limit; ++i ) { |
duke@435 | 3368 | assert(_dom_lca_tags[i] == NULL, "Must be distinct from each node pointer"); |
duke@435 | 3369 | } |
duke@435 | 3370 | #endif // ASSERT |
duke@435 | 3371 | } |
duke@435 | 3372 | |
duke@435 | 3373 | //------------------------------build_loop_late-------------------------------- |
duke@435 | 3374 | // Put Data nodes into some loop nest, by setting the _nodes[]->loop mapping. |
duke@435 | 3375 | // Second pass finds latest legal placement, and ideal loop placement. |
never@1356 | 3376 | void PhaseIdealLoop::build_loop_late( VectorSet &visited, Node_List &worklist, Node_Stack &nstack ) { |
duke@435 | 3377 | while (worklist.size() != 0) { |
duke@435 | 3378 | Node *n = worklist.pop(); |
duke@435 | 3379 | // Only visit once |
duke@435 | 3380 | if (visited.test_set(n->_idx)) continue; |
duke@435 | 3381 | uint cnt = n->outcnt(); |
duke@435 | 3382 | uint i = 0; |
duke@435 | 3383 | while (true) { |
duke@435 | 3384 | assert( _nodes[n->_idx], "no dead nodes" ); |
duke@435 | 3385 | // Visit all children |
duke@435 | 3386 | if (i < cnt) { |
duke@435 | 3387 | Node* use = n->raw_out(i); |
duke@435 | 3388 | ++i; |
duke@435 | 3389 | // Check for dead uses. Aggressively prune such junk. It might be |
duke@435 | 3390 | // dead in the global sense, but still have local uses so I cannot |
duke@435 | 3391 | // easily call 'remove_dead_node'. |
duke@435 | 3392 | if( _nodes[use->_idx] != NULL || use->is_top() ) { // Not dead? |
duke@435 | 3393 | // Due to cycles, we might not hit the same fixed point in the verify |
duke@435 | 3394 | // pass as we do in the regular pass. Instead, visit such phis as |
duke@435 | 3395 | // simple uses of the loop head. |
duke@435 | 3396 | if( use->in(0) && (use->is_CFG() || use->is_Phi()) ) { |
duke@435 | 3397 | if( !visited.test(use->_idx) ) |
duke@435 | 3398 | worklist.push(use); |
duke@435 | 3399 | } else if( !visited.test_set(use->_idx) ) { |
duke@435 | 3400 | nstack.push(n, i); // Save parent and next use's index. |
duke@435 | 3401 | n = use; // Process all children of current use. |
duke@435 | 3402 | cnt = use->outcnt(); |
duke@435 | 3403 | i = 0; |
duke@435 | 3404 | } |
duke@435 | 3405 | } else { |
duke@435 | 3406 | // Do not visit around the backedge of loops via data edges. |
duke@435 | 3407 | // push dead code onto a worklist |
duke@435 | 3408 | _deadlist.push(use); |
duke@435 | 3409 | } |
duke@435 | 3410 | } else { |
duke@435 | 3411 | // All of n's children have been processed, complete post-processing. |
never@1356 | 3412 | build_loop_late_post(n); |
duke@435 | 3413 | if (nstack.is_empty()) { |
duke@435 | 3414 | // Finished all nodes on stack. |
duke@435 | 3415 | // Process next node on the worklist. |
duke@435 | 3416 | break; |
duke@435 | 3417 | } |
duke@435 | 3418 | // Get saved parent node and next use's index. Visit the rest of uses. |
duke@435 | 3419 | n = nstack.node(); |
duke@435 | 3420 | cnt = n->outcnt(); |
duke@435 | 3421 | i = nstack.index(); |
duke@435 | 3422 | nstack.pop(); |
duke@435 | 3423 | } |
duke@435 | 3424 | } |
duke@435 | 3425 | } |
duke@435 | 3426 | } |
duke@435 | 3427 | |
duke@435 | 3428 | //------------------------------build_loop_late_post--------------------------- |
duke@435 | 3429 | // Put Data nodes into some loop nest, by setting the _nodes[]->loop mapping. |
duke@435 | 3430 | // Second pass finds latest legal placement, and ideal loop placement. |
never@1356 | 3431 | void PhaseIdealLoop::build_loop_late_post( Node *n ) { |
duke@435 | 3432 | |
never@1356 | 3433 | if (n->req() == 2 && n->Opcode() == Op_ConvI2L && !C->major_progress() && !_verify_only) { |
duke@435 | 3434 | _igvn._worklist.push(n); // Maybe we'll normalize it, if no more loops. |
duke@435 | 3435 | } |
duke@435 | 3436 | |
kvn@6630 | 3437 | #ifdef ASSERT |
kvn@6630 | 3438 | if (_verify_only && !n->is_CFG()) { |
kvn@6630 | 3439 | // Check def-use domination. |
kvn@6630 | 3440 | compute_lca_of_uses(n, get_ctrl(n), true /* verify */); |
kvn@6630 | 3441 | } |
kvn@6630 | 3442 | #endif |
kvn@6630 | 3443 | |
duke@435 | 3444 | // CFG and pinned nodes already handled |
duke@435 | 3445 | if( n->in(0) ) { |
duke@435 | 3446 | if( n->in(0)->is_top() ) return; // Dead? |
duke@435 | 3447 | |
duke@435 | 3448 | // We'd like +VerifyLoopOptimizations to not believe that Mod's/Loads |
duke@435 | 3449 | // _must_ be pinned (they have to observe their control edge of course). |
duke@435 | 3450 | // Unlike Stores (which modify an unallocable resource, the memory |
duke@435 | 3451 | // state), Mods/Loads can float around. So free them up. |
duke@435 | 3452 | bool pinned = true; |
duke@435 | 3453 | switch( n->Opcode() ) { |
duke@435 | 3454 | case Op_DivI: |
duke@435 | 3455 | case Op_DivF: |
duke@435 | 3456 | case Op_DivD: |
duke@435 | 3457 | case Op_ModI: |
duke@435 | 3458 | case Op_ModF: |
duke@435 | 3459 | case Op_ModD: |
duke@435 | 3460 | case Op_LoadB: // Same with Loads; they can sink |
kvn@3882 | 3461 | case Op_LoadUB: // during loop optimizations. |
kvn@3882 | 3462 | case Op_LoadUS: |
duke@435 | 3463 | case Op_LoadD: |
duke@435 | 3464 | case Op_LoadF: |
duke@435 | 3465 | case Op_LoadI: |
duke@435 | 3466 | case Op_LoadKlass: |
kvn@728 | 3467 | case Op_LoadNKlass: |
duke@435 | 3468 | case Op_LoadL: |
duke@435 | 3469 | case Op_LoadS: |
duke@435 | 3470 | case Op_LoadP: |
kvn@728 | 3471 | case Op_LoadN: |
duke@435 | 3472 | case Op_LoadRange: |
duke@435 | 3473 | case Op_LoadD_unaligned: |
duke@435 | 3474 | case Op_LoadL_unaligned: |
duke@435 | 3475 | case Op_StrComp: // Does a bunch of load-like effects |
cfang@1116 | 3476 | case Op_StrEquals: |
cfang@1116 | 3477 | case Op_StrIndexOf: |
rasbold@604 | 3478 | case Op_AryEq: |
duke@435 | 3479 | pinned = false; |
duke@435 | 3480 | } |
duke@435 | 3481 | if( pinned ) { |
twisti@1040 | 3482 | IdealLoopTree *chosen_loop = get_loop(n->is_CFG() ? n : get_ctrl(n)); |
twisti@1040 | 3483 | if( !chosen_loop->_child ) // Inner loop? |
twisti@1040 | 3484 | chosen_loop->_body.push(n); // Collect inner loops |
duke@435 | 3485 | return; |
duke@435 | 3486 | } |
duke@435 | 3487 | } else { // No slot zero |
duke@435 | 3488 | if( n->is_CFG() ) { // CFG with no slot 0 is dead |
duke@435 | 3489 | _nodes.map(n->_idx,0); // No block setting, it's globally dead |
duke@435 | 3490 | return; |
duke@435 | 3491 | } |
duke@435 | 3492 | assert(!n->is_CFG() || n->outcnt() == 0, ""); |
duke@435 | 3493 | } |
duke@435 | 3494 | |
duke@435 | 3495 | // Do I have a "safe range" I can select over? |
duke@435 | 3496 | Node *early = get_ctrl(n);// Early location already computed |
duke@435 | 3497 | |
duke@435 | 3498 | // Compute latest point this Node can go |
duke@435 | 3499 | Node *LCA = get_late_ctrl( n, early ); |
duke@435 | 3500 | // LCA is NULL due to uses being dead |
duke@435 | 3501 | if( LCA == NULL ) { |
duke@435 | 3502 | #ifdef ASSERT |
duke@435 | 3503 | for (DUIterator i1 = n->outs(); n->has_out(i1); i1++) { |
duke@435 | 3504 | assert( _nodes[n->out(i1)->_idx] == NULL, "all uses must also be dead"); |
duke@435 | 3505 | } |
duke@435 | 3506 | #endif |
duke@435 | 3507 | _nodes.map(n->_idx, 0); // This node is useless |
duke@435 | 3508 | _deadlist.push(n); |
duke@435 | 3509 | return; |
duke@435 | 3510 | } |
duke@435 | 3511 | assert(LCA != NULL && !LCA->is_top(), "no dead nodes"); |
duke@435 | 3512 | |
duke@435 | 3513 | Node *legal = LCA; // Walk 'legal' up the IDOM chain |
duke@435 | 3514 | Node *least = legal; // Best legal position so far |
duke@435 | 3515 | while( early != legal ) { // While not at earliest legal |
cfang@1607 | 3516 | #ifdef ASSERT |
cfang@1607 | 3517 | if (legal->is_Start() && !early->is_Root()) { |
cfang@1607 | 3518 | // Bad graph. Print idom path and fail. |
roland@4589 | 3519 | dump_bad_graph("Bad graph detected in build_loop_late", n, early, LCA); |
cfang@1607 | 3520 | assert(false, "Bad graph detected in build_loop_late"); |
cfang@1607 | 3521 | } |
cfang@1607 | 3522 | #endif |
duke@435 | 3523 | // Find least loop nesting depth |
duke@435 | 3524 | legal = idom(legal); // Bump up the IDOM tree |
duke@435 | 3525 | // Check for lower nesting depth |
duke@435 | 3526 | if( get_loop(legal)->_nest < get_loop(least)->_nest ) |
duke@435 | 3527 | least = legal; |
duke@435 | 3528 | } |
never@1356 | 3529 | assert(early == legal || legal != C->root(), "bad dominance of inputs"); |
duke@435 | 3530 | |
duke@435 | 3531 | // Try not to place code on a loop entry projection |
duke@435 | 3532 | // which can inhibit range check elimination. |
duke@435 | 3533 | if (least != early) { |
duke@435 | 3534 | Node* ctrl_out = least->unique_ctrl_out(); |
duke@435 | 3535 | if (ctrl_out && ctrl_out->is_CountedLoop() && |
duke@435 | 3536 | least == ctrl_out->in(LoopNode::EntryControl)) { |
duke@435 | 3537 | Node* least_dom = idom(least); |
duke@435 | 3538 | if (get_loop(least_dom)->is_member(get_loop(least))) { |
duke@435 | 3539 | least = least_dom; |
duke@435 | 3540 | } |
duke@435 | 3541 | } |
duke@435 | 3542 | } |
duke@435 | 3543 | |
duke@435 | 3544 | #ifdef ASSERT |
duke@435 | 3545 | // If verifying, verify that 'verify_me' has a legal location |
duke@435 | 3546 | // and choose it as our location. |
never@1356 | 3547 | if( _verify_me ) { |
never@1356 | 3548 | Node *v_ctrl = _verify_me->get_ctrl_no_update(n); |
duke@435 | 3549 | Node *legal = LCA; |
duke@435 | 3550 | while( early != legal ) { // While not at earliest legal |
duke@435 | 3551 | if( legal == v_ctrl ) break; // Check for prior good location |
duke@435 | 3552 | legal = idom(legal) ;// Bump up the IDOM tree |
duke@435 | 3553 | } |
duke@435 | 3554 | // Check for prior good location |
duke@435 | 3555 | if( legal == v_ctrl ) least = legal; // Keep prior if found |
duke@435 | 3556 | } |
duke@435 | 3557 | #endif |
duke@435 | 3558 | |
duke@435 | 3559 | // Assign discovered "here or above" point |
duke@435 | 3560 | least = find_non_split_ctrl(least); |
duke@435 | 3561 | set_ctrl(n, least); |
duke@435 | 3562 | |
duke@435 | 3563 | // Collect inner loop bodies |
twisti@1040 | 3564 | IdealLoopTree *chosen_loop = get_loop(least); |
twisti@1040 | 3565 | if( !chosen_loop->_child ) // Inner loop? |
twisti@1040 | 3566 | chosen_loop->_body.push(n);// Collect inner loops |
duke@435 | 3567 | } |
duke@435 | 3568 | |
kvn@3408 | 3569 | #ifdef ASSERT |
roland@4589 | 3570 | void PhaseIdealLoop::dump_bad_graph(const char* msg, Node* n, Node* early, Node* LCA) { |
drchase@6680 | 3571 | tty->print_cr("%s", msg); |
kvn@3408 | 3572 | tty->print("n: "); n->dump(); |
kvn@3408 | 3573 | tty->print("early(n): "); early->dump(); |
kvn@3408 | 3574 | if (n->in(0) != NULL && !n->in(0)->is_top() && |
kvn@3408 | 3575 | n->in(0) != early && !n->in(0)->is_Root()) { |
kvn@3408 | 3576 | tty->print("n->in(0): "); n->in(0)->dump(); |
kvn@3408 | 3577 | } |
kvn@3408 | 3578 | for (uint i = 1; i < n->req(); i++) { |
kvn@3408 | 3579 | Node* in1 = n->in(i); |
kvn@3408 | 3580 | if (in1 != NULL && in1 != n && !in1->is_top()) { |
kvn@3408 | 3581 | tty->print("n->in(%d): ", i); in1->dump(); |
kvn@3408 | 3582 | Node* in1_early = get_ctrl(in1); |
kvn@3408 | 3583 | tty->print("early(n->in(%d)): ", i); in1_early->dump(); |
kvn@3408 | 3584 | if (in1->in(0) != NULL && !in1->in(0)->is_top() && |
kvn@3408 | 3585 | in1->in(0) != in1_early && !in1->in(0)->is_Root()) { |
kvn@3408 | 3586 | tty->print("n->in(%d)->in(0): ", i); in1->in(0)->dump(); |
kvn@3408 | 3587 | } |
kvn@3408 | 3588 | for (uint j = 1; j < in1->req(); j++) { |
kvn@3408 | 3589 | Node* in2 = in1->in(j); |
kvn@3408 | 3590 | if (in2 != NULL && in2 != n && in2 != in1 && !in2->is_top()) { |
kvn@3408 | 3591 | tty->print("n->in(%d)->in(%d): ", i, j); in2->dump(); |
kvn@3408 | 3592 | Node* in2_early = get_ctrl(in2); |
kvn@3408 | 3593 | tty->print("early(n->in(%d)->in(%d)): ", i, j); in2_early->dump(); |
kvn@3408 | 3594 | if (in2->in(0) != NULL && !in2->in(0)->is_top() && |
kvn@3408 | 3595 | in2->in(0) != in2_early && !in2->in(0)->is_Root()) { |
kvn@3408 | 3596 | tty->print("n->in(%d)->in(%d)->in(0): ", i, j); in2->in(0)->dump(); |
kvn@3408 | 3597 | } |
kvn@3408 | 3598 | } |
kvn@3408 | 3599 | } |
kvn@3408 | 3600 | } |
kvn@3408 | 3601 | } |
kvn@3408 | 3602 | tty->cr(); |
kvn@3408 | 3603 | tty->print("LCA(n): "); LCA->dump(); |
kvn@3408 | 3604 | for (uint i = 0; i < n->outcnt(); i++) { |
kvn@3408 | 3605 | Node* u1 = n->raw_out(i); |
kvn@3408 | 3606 | if (u1 == n) |
kvn@3408 | 3607 | continue; |
kvn@3408 | 3608 | tty->print("n->out(%d): ", i); u1->dump(); |
kvn@3408 | 3609 | if (u1->is_CFG()) { |
kvn@3408 | 3610 | for (uint j = 0; j < u1->outcnt(); j++) { |
kvn@3408 | 3611 | Node* u2 = u1->raw_out(j); |
kvn@3408 | 3612 | if (u2 != u1 && u2 != n && u2->is_CFG()) { |
kvn@3408 | 3613 | tty->print("n->out(%d)->out(%d): ", i, j); u2->dump(); |
kvn@3408 | 3614 | } |
kvn@3408 | 3615 | } |
kvn@3408 | 3616 | } else { |
kvn@3408 | 3617 | Node* u1_later = get_ctrl(u1); |
kvn@3408 | 3618 | tty->print("later(n->out(%d)): ", i); u1_later->dump(); |
kvn@3408 | 3619 | if (u1->in(0) != NULL && !u1->in(0)->is_top() && |
kvn@3408 | 3620 | u1->in(0) != u1_later && !u1->in(0)->is_Root()) { |
kvn@3408 | 3621 | tty->print("n->out(%d)->in(0): ", i); u1->in(0)->dump(); |
kvn@3408 | 3622 | } |
kvn@3408 | 3623 | for (uint j = 0; j < u1->outcnt(); j++) { |
kvn@3408 | 3624 | Node* u2 = u1->raw_out(j); |
kvn@3408 | 3625 | if (u2 == n || u2 == u1) |
kvn@3408 | 3626 | continue; |
kvn@3408 | 3627 | tty->print("n->out(%d)->out(%d): ", i, j); u2->dump(); |
kvn@3408 | 3628 | if (!u2->is_CFG()) { |
kvn@3408 | 3629 | Node* u2_later = get_ctrl(u2); |
kvn@3408 | 3630 | tty->print("later(n->out(%d)->out(%d)): ", i, j); u2_later->dump(); |
kvn@3408 | 3631 | if (u2->in(0) != NULL && !u2->in(0)->is_top() && |
kvn@3408 | 3632 | u2->in(0) != u2_later && !u2->in(0)->is_Root()) { |
kvn@3408 | 3633 | tty->print("n->out(%d)->in(0): ", i); u2->in(0)->dump(); |
kvn@3408 | 3634 | } |
kvn@3408 | 3635 | } |
kvn@3408 | 3636 | } |
kvn@3408 | 3637 | } |
kvn@3408 | 3638 | } |
kvn@3408 | 3639 | tty->cr(); |
kvn@3408 | 3640 | int ct = 0; |
kvn@3408 | 3641 | Node *dbg_legal = LCA; |
kvn@3408 | 3642 | while(!dbg_legal->is_Start() && ct < 100) { |
kvn@3408 | 3643 | tty->print("idom[%d] ",ct); dbg_legal->dump(); |
kvn@3408 | 3644 | ct++; |
kvn@3408 | 3645 | dbg_legal = idom(dbg_legal); |
kvn@3408 | 3646 | } |
kvn@3408 | 3647 | tty->cr(); |
kvn@3408 | 3648 | } |
kvn@3408 | 3649 | #endif |
kvn@3408 | 3650 | |
duke@435 | 3651 | #ifndef PRODUCT |
duke@435 | 3652 | //------------------------------dump------------------------------------------- |
duke@435 | 3653 | void PhaseIdealLoop::dump( ) const { |
duke@435 | 3654 | ResourceMark rm; |
duke@435 | 3655 | Arena* arena = Thread::current()->resource_area(); |
duke@435 | 3656 | Node_Stack stack(arena, C->unique() >> 2); |
duke@435 | 3657 | Node_List rpo_list; |
duke@435 | 3658 | VectorSet visited(arena); |
duke@435 | 3659 | visited.set(C->top()->_idx); |
duke@435 | 3660 | rpo( C->root(), stack, visited, rpo_list ); |
duke@435 | 3661 | // Dump root loop indexed by last element in PO order |
duke@435 | 3662 | dump( _ltree_root, rpo_list.size(), rpo_list ); |
duke@435 | 3663 | } |
duke@435 | 3664 | |
duke@435 | 3665 | void PhaseIdealLoop::dump( IdealLoopTree *loop, uint idx, Node_List &rpo_list ) const { |
never@802 | 3666 | loop->dump_head(); |
duke@435 | 3667 | |
duke@435 | 3668 | // Now scan for CFG nodes in the same loop |
duke@435 | 3669 | for( uint j=idx; j > 0; j-- ) { |
duke@435 | 3670 | Node *n = rpo_list[j-1]; |
duke@435 | 3671 | if( !_nodes[n->_idx] ) // Skip dead nodes |
duke@435 | 3672 | continue; |
duke@435 | 3673 | if( get_loop(n) != loop ) { // Wrong loop nest |
duke@435 | 3674 | if( get_loop(n)->_head == n && // Found nested loop? |
duke@435 | 3675 | get_loop(n)->_parent == loop ) |
duke@435 | 3676 | dump(get_loop(n),rpo_list.size(),rpo_list); // Print it nested-ly |
duke@435 | 3677 | continue; |
duke@435 | 3678 | } |
duke@435 | 3679 | |
duke@435 | 3680 | // Dump controlling node |
duke@435 | 3681 | for( uint x = 0; x < loop->_nest; x++ ) |
duke@435 | 3682 | tty->print(" "); |
duke@435 | 3683 | tty->print("C"); |
duke@435 | 3684 | if( n == C->root() ) { |
duke@435 | 3685 | n->dump(); |
duke@435 | 3686 | } else { |
duke@435 | 3687 | Node* cached_idom = idom_no_update(n); |
duke@435 | 3688 | Node *computed_idom = n->in(0); |
duke@435 | 3689 | if( n->is_Region() ) { |
duke@435 | 3690 | computed_idom = compute_idom(n); |
duke@435 | 3691 | // computed_idom() will return n->in(0) when idom(n) is an IfNode (or |
duke@435 | 3692 | // any MultiBranch ctrl node), so apply a similar transform to |
duke@435 | 3693 | // the cached idom returned from idom_no_update. |
duke@435 | 3694 | cached_idom = find_non_split_ctrl(cached_idom); |
duke@435 | 3695 | } |
duke@435 | 3696 | tty->print(" ID:%d",computed_idom->_idx); |
duke@435 | 3697 | n->dump(); |
duke@435 | 3698 | if( cached_idom != computed_idom ) { |
duke@435 | 3699 | tty->print_cr("*** BROKEN IDOM! Computed as: %d, cached as: %d", |
duke@435 | 3700 | computed_idom->_idx, cached_idom->_idx); |
duke@435 | 3701 | } |
duke@435 | 3702 | } |
duke@435 | 3703 | // Dump nodes it controls |
duke@435 | 3704 | for( uint k = 0; k < _nodes.Size(); k++ ) { |
duke@435 | 3705 | // (k < C->unique() && get_ctrl(find(k)) == n) |
duke@435 | 3706 | if (k < C->unique() && _nodes[k] == (Node*)((intptr_t)n + 1)) { |
duke@435 | 3707 | Node *m = C->root()->find(k); |
duke@435 | 3708 | if( m && m->outcnt() > 0 ) { |
duke@435 | 3709 | if (!(has_ctrl(m) && get_ctrl_no_update(m) == n)) { |
duke@435 | 3710 | tty->print_cr("*** BROKEN CTRL ACCESSOR! _nodes[k] is %p, ctrl is %p", |
duke@435 | 3711 | _nodes[k], has_ctrl(m) ? get_ctrl_no_update(m) : NULL); |
duke@435 | 3712 | } |
duke@435 | 3713 | for( uint j = 0; j < loop->_nest; j++ ) |
duke@435 | 3714 | tty->print(" "); |
duke@435 | 3715 | tty->print(" "); |
duke@435 | 3716 | m->dump(); |
duke@435 | 3717 | } |
duke@435 | 3718 | } |
duke@435 | 3719 | } |
duke@435 | 3720 | } |
duke@435 | 3721 | } |
duke@435 | 3722 | |
duke@435 | 3723 | // Collect a R-P-O for the whole CFG. |
duke@435 | 3724 | // Result list is in post-order (scan backwards for RPO) |
duke@435 | 3725 | void PhaseIdealLoop::rpo( Node *start, Node_Stack &stk, VectorSet &visited, Node_List &rpo_list ) const { |
duke@435 | 3726 | stk.push(start, 0); |
duke@435 | 3727 | visited.set(start->_idx); |
duke@435 | 3728 | |
duke@435 | 3729 | while (stk.is_nonempty()) { |
duke@435 | 3730 | Node* m = stk.node(); |
duke@435 | 3731 | uint idx = stk.index(); |
duke@435 | 3732 | if (idx < m->outcnt()) { |
duke@435 | 3733 | stk.set_index(idx + 1); |
duke@435 | 3734 | Node* n = m->raw_out(idx); |
duke@435 | 3735 | if (n->is_CFG() && !visited.test_set(n->_idx)) { |
duke@435 | 3736 | stk.push(n, 0); |
duke@435 | 3737 | } |
duke@435 | 3738 | } else { |
duke@435 | 3739 | rpo_list.push(m); |
duke@435 | 3740 | stk.pop(); |
duke@435 | 3741 | } |
duke@435 | 3742 | } |
duke@435 | 3743 | } |
duke@435 | 3744 | #endif |
duke@435 | 3745 | |
duke@435 | 3746 | |
duke@435 | 3747 | //============================================================================= |
duke@435 | 3748 | //------------------------------LoopTreeIterator----------------------------------- |
duke@435 | 3749 | |
duke@435 | 3750 | // Advance to next loop tree using a preorder, left-to-right traversal. |
duke@435 | 3751 | void LoopTreeIterator::next() { |
duke@435 | 3752 | assert(!done(), "must not be done."); |
duke@435 | 3753 | if (_curnt->_child != NULL) { |
duke@435 | 3754 | _curnt = _curnt->_child; |
duke@435 | 3755 | } else if (_curnt->_next != NULL) { |
duke@435 | 3756 | _curnt = _curnt->_next; |
duke@435 | 3757 | } else { |
duke@435 | 3758 | while (_curnt != _root && _curnt->_next == NULL) { |
duke@435 | 3759 | _curnt = _curnt->_parent; |
duke@435 | 3760 | } |
duke@435 | 3761 | if (_curnt == _root) { |
duke@435 | 3762 | _curnt = NULL; |
duke@435 | 3763 | assert(done(), "must be done."); |
duke@435 | 3764 | } else { |
duke@435 | 3765 | assert(_curnt->_next != NULL, "must be more to do"); |
duke@435 | 3766 | _curnt = _curnt->_next; |
duke@435 | 3767 | } |
duke@435 | 3768 | } |
duke@435 | 3769 | } |