src/share/vm/opto/loopnode.cpp

rev 9745 : 8145322: Code generated from unsafe loops can be slightly improved
Summary: improve code generated from checkIndex and unsafe loops
Reviewed-by:
rev 9746 : fix

*** 813,822 ****
--- 813,827 ----
    }
  #endif
  
    C->print_method(PHASE_AFTER_CLOOPS, 3);
  
+   // Capture bounds of the loop in the induction variable Phi before
+   // subsequent transformation (iteration splitting) obscures the
+   // bounds
+   l->phi()->as_Phi()->set_type(l->phi()->Value(&_igvn));
+ 
    return true;
  }
  
  //----------------------exact_limit-------------------------------------------
  Node* PhaseIdealLoop::exact_limit( IdealLoopTree *loop ) {
*** 3476,3486 ****
  //------------------------------build_loop_late_post---------------------------
  // Put Data nodes into some loop nest, by setting the _nodes[]->loop mapping.
  // Second pass finds latest legal placement, and ideal loop placement.
  void PhaseIdealLoop::build_loop_late_post( Node *n ) {
  
!   if (n->req() == 2 && n->Opcode() == Op_ConvI2L && !C->major_progress() && !_verify_only) {
      _igvn._worklist.push(n);  // Maybe we'll normalize it, if no more loops.
    }
  
  #ifdef ASSERT
    if (_verify_only && !n->is_CFG()) {
--- 3481,3491 ----
  //------------------------------build_loop_late_post---------------------------
  // Put Data nodes into some loop nest, by setting the _nodes[]->loop mapping.
  // Second pass finds latest legal placement, and ideal loop placement.
  void PhaseIdealLoop::build_loop_late_post( Node *n ) {
  
!   if (n->req() == 2 && (n->Opcode() == Op_ConvI2L || n->Opcode() == Op_CastII) && !C->major_progress() && !_verify_only) {
      _igvn._worklist.push(n);  // Maybe we'll normalize it, if no more loops.
    }
  
  #ifdef ASSERT
    if (_verify_only && !n->is_CFG()) {