Lines Matching defs:predicate_proj
297 ProjNode* PhaseIdealLoop::clone_predicate(ProjNode* predicate_proj, Node* new_entry,
303 new_predicate_proj = loop_phase->create_new_if_for_predicate(predicate_proj, new_entry, reason);
305 new_predicate_proj = igvn->create_new_if_for_predicate(predicate_proj, new_entry, reason);
311 assert(predicate_proj->in(0)->in(1)->in(1)->Opcode()==Op_Opaque1, "must be");
312 Node* opq = new (igvn->C) Opaque1Node(igvn->C, predicate_proj->in(0)->in(1)->in(1)->in(1));
362 ProjNode* predicate_proj = find_predicate_insertion_point(entry, Deoptimization::Reason_predicate);
363 if (predicate_proj != NULL) { // right pattern that can be used by loop predication
365 new_entry = clone_predicate(predicate_proj, new_entry,
730 ProjNode *predicate_proj = NULL;
733 predicate_proj = find_predicate_insertion_point(entry, Deoptimization::Reason_loop_limit_check);
734 if (predicate_proj != NULL)
735 entry = predicate_proj->in(0)->in(0);
738 predicate_proj = find_predicate_insertion_point(entry, Deoptimization::Reason_predicate);
739 if (!predicate_proj) {
800 new_predicate_proj = create_new_if_for_predicate(predicate_proj, NULL,
807 if (proj->_con != predicate_proj->_con) {
825 assert(proj->_con == predicate_proj->_con, "must match");
847 ProjNode* lower_bound_proj = create_new_if_for_predicate(predicate_proj, NULL, Deoptimization::Reason_predicate);
848 ProjNode* upper_bound_proj = create_new_if_for_predicate(predicate_proj, NULL, Deoptimization::Reason_predicate);