Lines Matching defs:phi
169 // Get memory-phi anti-dep loads will be using
198 Node *phi = PhiNode::make_blank(blk1, n);
213 phi->init_req( j, x );
215 // Announce phi to optimizer
216 register_new_node(phi, blk1);
218 // Remove cloned-up value from optimizer; use phi instead
219 _igvn.replace_node( n, phi );
331 // the "while( phi->outcnt() )" loop.
339 // Normal (non-phi) use
363 // far below the merge point can't always be split up (e.g., phi-uses are
498 Node* phi = region->out(k);
499 if (!phi->in(0)) { // Dead phi? Remove it
500 _igvn.remove_dead_node(phi);
501 } else if (phi == region) { // Found the self-reference
503 } else if (phi->is_Phi()) { // Expected common case: Phi hanging off of Region
504 assert(phi->in(0) == region, "Inconsistent graph");
509 for (DUIterator_Last lmin, l = phi->last_outs(lmin); l >= lmin; --l) {
510 Node* use = phi->last_out(l);
516 handle_use(use, phi, &phi_cache, region_dom, new_false, new_true, old_false, old_true);
517 } // End of while phi has uses
519 _igvn.remove_dead_node( phi );
521 assert(phi->in(0) == region, "Inconsistent graph");
523 handle_use(phi, region, ®ion_cache, region_dom, new_false, new_true, old_false, old_true);