Lines Matching refs:node
308 // Find if the Region node is reachable from the root.
313 // region's phis references itself directly or through a data node.
329 // Check when phi references itself directly or through an other node.
337 // Unsafe case - check if the Region node is reachable from root.
355 return false; // We reached the Region node - it is not dead.
363 return true; // The Region node is unreachable - it is dead.
410 // Return a node which is more "ideal" than the current node. Must preserve
510 // Loop node may have only one input because entry path
512 assert(!this->is_Loop() || cnt_orig <= 3, "Loop node should have 3 or less inputs");
555 if( cnt == 0 && !can_reshape) { // Parse phase - leave the node as it is.
558 } else if (can_reshape) { // Optimization phase - remove the node
563 // During IGVN phase such region will be subsumed by TOP node
564 // so region's phis will have TOP as control node.
673 // update input edges to region node
681 // Return transformed region node
780 // Check if an appropriate node already exists.
800 PhiNode *ophi = stack.node()->as_Phi();
1055 // If check_control_only is true, do not inspect the If node at the
1376 // Check other phi input for subtract node
1416 // Register the new node but do not transform it. Cannot transform until the
1420 // Now I can point to the new node.
1495 // Try to determining if the phi node in a simple safe/unsafe data loop.
1504 // unsafe data node.
1505 // Note: a safe data node is a node which could/never reference itself during
1507 // I mark Phi nodes as safe node not only because they can reference itself
1511 // It is unsafe loop if the phi node references itself directly.
1514 // Unsafe loop if the phi node references itself through an unsafe data node.
1536 // The phi references an unsafe node - need full analysis.
1541 return Safe; // Safe case - we can optimize the phi node.
1549 // through an other node.
1587 // Return a node which is more "ideal" than the current node. Must preserve
1649 // Loop node may have only one input because entry path
1651 assert(!r->is_Loop() || r->req() <= 3, "Loop node should have 3 or less inputs");
1834 // Otherwise the returned node represents memory for every slice
1934 // The rest of phi graph will transform by split EncodeP node though phis up.
2064 // Return a node which is more "ideal" than the current node. Strip out