src/share/vm/opto/loopnode.hpp

rev 9032 : 8215265: C2: range check elimination may allow illegal out of bound access
Reviewed-by: thartmann, kvn

*** 957,967 ****
    // always holds true.  That is, either increase the number of iterations in
    // the pre-loop or the post-loop until the condition holds true in the main
    // loop.  Scale_con, offset and limit are all loop invariant.
    void add_constraint( int stride_con, int scale_con, Node *offset, Node *low_limit, Node *upper_limit, Node *pre_ctrl, Node **pre_limit, Node **main_limit );
    // Helper function for add_constraint().
!   Node* adjust_limit( int stride_con, Node * scale, Node *offset, Node *rc_limit, Node *loop_limit, Node *pre_ctrl );
  
    // Partially peel loop up through last_peel node.
    bool partial_peel( IdealLoopTree *loop, Node_List &old_new );
  
    // Create a scheduled list of nodes control dependent on ctrl set.
--- 957,967 ----
    // always holds true.  That is, either increase the number of iterations in
    // the pre-loop or the post-loop until the condition holds true in the main
    // loop.  Scale_con, offset and limit are all loop invariant.
    void add_constraint( int stride_con, int scale_con, Node *offset, Node *low_limit, Node *upper_limit, Node *pre_ctrl, Node **pre_limit, Node **main_limit );
    // Helper function for add_constraint().
!   Node* adjust_limit(int stride_con, Node * scale, Node *offset, Node *rc_limit, Node *loop_limit, Node *pre_ctrl, bool round_up);
  
    // Partially peel loop up through last_peel node.
    bool partial_peel( IdealLoopTree *loop, Node_List &old_new );
  
    // Create a scheduled list of nodes control dependent on ctrl set.