Lines Matching refs:dead
314 // existing nodes, remove dead nodes.
393 // Update dead node list
621 // Small integer? Check cache! Check that cached node is not dead
637 // Small integer? Check cache! Check that cached node is not dead
739 // Check for a simple dead loop when a data node references itself directly
760 assert(no_dead_loop, "dead loop detected");
1042 assert(i != k || is_new || i->outcnt() > 0, "don't return dead nodes");
1051 // This IF is dead because it is dominated by an equivalent IF When
1082 assert(i != k || is_new || i->outcnt() > 0, "don't return dead nodes");
1132 // Return the pre-existing node if it isn't dead
1150 // Kill a globally dead Node. All uses are also globally dead and are
1152 void PhaseIterGVN::remove_globally_dead_node( Node *dead ) {
1158 _stack.push(dead, PROCESS_INPUTS);
1161 dead = _stack.node();
1163 assert(dead != C->root(), "killing root, eh?");
1164 assert(!dead->is_top(), "add check for top when pushing");
1169 if (!dead->is_Con()) { // Don't kill cons but uses
1172 _table.hash_delete( dead );
1173 // Smash all inputs to 'dead', isolating him completely
1174 for (uint i = 0; i < dead->req(); i++) {
1175 Node *in = dead->in(i);
1177 int nrep = dead->replace_edge(in, NULL); // Kill edges
1179 if (in->outcnt() == 0) { // Made input go dead?
1185 } else if (in->outcnt() <= 2 && dead->is_Phi()) {
1199 if (ReduceFieldZeroing && dead->is_Load() && i == MemNode::Memory &&
1212 } // for (uint i = 0; i < dead->req(); i++)
1216 } // if (!dead->is_Con())
1219 // Aggressively kill globally dead uses
1223 if (dead->outcnt() > 0) {
1225 _stack.push(dead->raw_out(0), PROCESS_INPUTS);
1229 // Remove dead node from iterative worklist
1230 _worklist.remove(dead);
1232 // root is usually dead. However, sometimes reshaping walk makes
1234 // as dead to be conservative about the dead node count at any
1236 if (!dead->is_Con()) {
1237 C->record_dead_node(dead->_idx);
1239 if (dead->is_macro()) {
1240 C->remove_macro_node(dead);
1242 if (dead->is_expensive()) {
1243 C->remove_expensive_node(dead);
1545 // Eagerly remove dead phis to avoid phis copies creation.
1713 assert( is_not_dead(n), "can not use dead node");
1718 // old goes dead?
1723 // recursive kill will delete the current node (this) if dead-loop exists