src/share/vm/opto/loopTransform.cpp

*** 688,698 ****
    // Step A2: Build a zero-trip guard for the post-loop.  After leaving the
    // main-loop, the post-loop may not execute at all.  We 'opaque' the incr
    // (the main-loop trip-counter exit value) because we will be changing
    // the exit value (via unrolling) so we cannot constant-fold away the zero
    // trip guard until all unrolling is done.
!   Node *zer_opaq = new (C, 2) Opaque1Node(incr);
    Node *zer_cmp  = new (C, 3) CmpINode( zer_opaq, limit );
    Node *zer_bol  = new (C, 2) BoolNode( zer_cmp, b_test );
    register_new_node( zer_opaq, new_main_exit );
    register_new_node( zer_cmp , new_main_exit );
    register_new_node( zer_bol , new_main_exit );
--- 688,698 ----
    // Step A2: Build a zero-trip guard for the post-loop.  After leaving the
    // main-loop, the post-loop may not execute at all.  We 'opaque' the incr
    // (the main-loop trip-counter exit value) because we will be changing
    // the exit value (via unrolling) so we cannot constant-fold away the zero
    // trip guard until all unrolling is done.
!   Node *zer_opaq = new (C, 2) Opaque1Node(C, incr);
    Node *zer_cmp  = new (C, 3) CmpINode( zer_opaq, limit );
    Node *zer_bol  = new (C, 2) BoolNode( zer_cmp, b_test );
    register_new_node( zer_opaq, new_main_exit );
    register_new_node( zer_cmp , new_main_exit );
    register_new_node( zer_bol , new_main_exit );
*** 758,768 ****
  
    // Step B2: Build a zero-trip guard for the main-loop.  After leaving the
    // pre-loop, the main-loop may not execute at all.  Later in life this
    // zero-trip guard will become the minimum-trip guard when we unroll
    // the main-loop.
!   Node *min_opaq = new (C, 2) Opaque1Node(limit);
    Node *min_cmp  = new (C, 3) CmpINode( pre_incr, min_opaq );
    Node *min_bol  = new (C, 2) BoolNode( min_cmp, b_test );
    register_new_node( min_opaq, new_pre_exit );
    register_new_node( min_cmp , new_pre_exit );
    register_new_node( min_bol , new_pre_exit );
--- 758,768 ----
  
    // Step B2: Build a zero-trip guard for the main-loop.  After leaving the
    // pre-loop, the main-loop may not execute at all.  Later in life this
    // zero-trip guard will become the minimum-trip guard when we unroll
    // the main-loop.
!   Node *min_opaq = new (C, 2) Opaque1Node(C, limit);
    Node *min_cmp  = new (C, 3) CmpINode( pre_incr, min_opaq );
    Node *min_bol  = new (C, 2) BoolNode( min_cmp, b_test );
    register_new_node( min_opaq, new_pre_exit );
    register_new_node( min_cmp , new_pre_exit );
    register_new_node( min_bol , new_pre_exit );
*** 808,818 ****
    assert( cmp_end->in(2) == limit, "" );
    Node *pre_limit = new (C, 3) AddINode( init, stride );
  
    // Save the original loop limit in this Opaque1 node for
    // use by range check elimination.
!   Node *pre_opaq  = new (C, 3) Opaque1Node(pre_limit, limit);
  
    register_new_node( pre_limit, pre_head->in(0) );
    register_new_node( pre_opaq , pre_head->in(0) );
  
    // Since no other users of pre-loop compare, I can hack limit directly
--- 808,818 ----
    assert( cmp_end->in(2) == limit, "" );
    Node *pre_limit = new (C, 3) AddINode( init, stride );
  
    // Save the original loop limit in this Opaque1 node for
    // use by range check elimination.
!   Node *pre_opaq  = new (C, 3) Opaque1Node(C, pre_limit, limit);
  
    register_new_node( pre_limit, pre_head->in(0) );
    register_new_node( pre_opaq , pre_head->in(0) );
  
    // Since no other users of pre-loop compare, I can hack limit directly