Cross Reference: /openjdk7/hotspot/src/share/vm/opto/loopPredicate.cpp

Lines Matching refs:predicate
36  * The general idea of Loop Predication is to insert a predicate on the entry
114 // create a new if above the uct_if_pattern for the predicate to be promoted.
180     // Clonning the predicate to new location.
234 // Create a new if below new_entry for the predicate to be cloned (IGVN optimization)
237   assert(new_entry != 0, "only used for clone predicate");
310   // Match original condition since predicate's projections could be swapped.
364       // clone predicate
368       assert(new_entry != NULL && new_entry->is_Proj(), "IfTrue or IfFalse after clone predicate");
394   Node* predicate = NULL;
396     predicate = find_predicate_insertion_point(entry, Deoptimization::Reason_loop_limit_check);
397     if (predicate != NULL) {
402     predicate = find_predicate_insertion_point(entry, Deoptimization::Reason_predicate);
403     if (predicate != NULL) { // right pattern that can be used by loop predication
421 // Find a good location to insert a predicate
432 // Find a predicate
434   Node* predicate = NULL;
436     predicate = find_predicate_insertion_point(entry, Deoptimization::Reason_loop_limit_check);
437     if (predicate != NULL) { // right pattern that can be used by loop predication
442     predicate = find_predicate_insertion_point(entry, Deoptimization::Reason_predicate);
443     if (predicate != NULL) { // right pattern that can be used by loop predication
583 // Returns true if the predicate of iff is in "scale*iv + offset u< load_range(ptr)" format
631 // Create a range check predicate
637 // Compute max(scale*i + offset) for init <= i < limit and build the predicate
731   // Loop limit check predicate should be near the loop.
742       tty->print("missing predicate:");
770     // Following are changed to nonnull when a predicate can be hoisted
890     // Success - attach condition (new_predicate_bol) to predicate if