Searched defs:predicate_proj (Results 1 - 3 of 3) sorted by relevance
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | loopPredicate.cpp | 297 ProjNode* PhaseIdealLoop::clone_predicate(ProjNode* predicate_proj, Node* new_entry, argument 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); local 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; local 733 predicate_proj [all...] |
H A D | ifnode.cpp | 226 Node* predicate_proj = NULL; local 233 assert(predicate_proj == NULL, "only one predicate entry expected"); 234 predicate_proj = proj; 249 if (r->in(i) == predicate_proj) 250 predicate_c = predicate_proj; 254 if (r->in(i) == predicate_proj) 255 predicate_x = predicate_proj;
|
H A D | loopnode.cpp | 1955 Node* predicate_proj = find_predicate(entry); // loop_limit_check first local 1956 if (predicate_proj != NULL ) { // right pattern that can be used by loop predication 1961 predicate_proj = find_predicate(entry); // Predicate 1962 if (predicate_proj != NULL ) {
|
Completed in 64 milliseconds