equal
deleted
inserted
replaced
981 // Find a predicate |
981 // Find a predicate |
982 static Node* find_predicate(Node* entry); |
982 static Node* find_predicate(Node* entry); |
983 // Construct a range check for a predicate if |
983 // Construct a range check for a predicate if |
984 BoolNode* rc_predicate(IdealLoopTree *loop, Node* ctrl, |
984 BoolNode* rc_predicate(IdealLoopTree *loop, Node* ctrl, |
985 int scale, Node* offset, |
985 int scale, Node* offset, |
986 Node* init, Node* limit, Node* stride, |
986 Node* init, Node* limit, jint stride, |
987 Node* range, bool upper); |
987 Node* range, bool upper, bool &overflow); |
988 |
988 |
989 // Implementation of the loop predication to promote checks outside the loop |
989 // Implementation of the loop predication to promote checks outside the loop |
990 bool loop_predication_impl(IdealLoopTree *loop); |
990 bool loop_predication_impl(IdealLoopTree *loop); |
991 |
991 |
992 // Helper function to collect predicate for eliminating the useless ones |
992 // Helper function to collect predicate for eliminating the useless ones |