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