Lines Matching defs:dead
311 // Note: At this point, C is dead,
350 assert( is_not_dead(n0), "can not use dead node");
362 assert( is_not_dead(n0), "can not use dead node");
363 assert( is_not_dead(n1), "can not use dead node");
376 assert( is_not_dead(n0), "can not use dead node");
377 assert( is_not_dead(n1), "can not use dead node");
378 assert( is_not_dead(n2), "can not use dead node");
392 assert( is_not_dead(n0), "can not use dead node");
393 assert( is_not_dead(n1), "can not use dead node");
394 assert( is_not_dead(n2), "can not use dead node");
395 assert( is_not_dead(n3), "can not use dead node");
410 assert( is_not_dead(n0), "can not use dead node");
411 assert( is_not_dead(n1), "can not use dead node");
412 assert( is_not_dead(n2), "can not use dead node");
413 assert( is_not_dead(n3), "can not use dead node");
414 assert( is_not_dead(n4), "can not use dead node");
431 assert( is_not_dead(n0), "can not use dead node");
432 assert( is_not_dead(n1), "can not use dead node");
433 assert( is_not_dead(n2), "can not use dead node");
434 assert( is_not_dead(n3), "can not use dead node");
435 assert( is_not_dead(n4), "can not use dead node");
436 assert( is_not_dead(n5), "can not use dead node");
454 assert( is_not_dead(n0), "can not use dead node");
455 assert( is_not_dead(n1), "can not use dead node");
456 assert( is_not_dead(n2), "can not use dead node");
457 assert( is_not_dead(n3), "can not use dead node");
458 assert( is_not_dead(n4), "can not use dead node");
459 assert( is_not_dead(n5), "can not use dead node");
460 assert( is_not_dead(n6), "can not use dead node");
686 // Mach and pinch point nodes may look like dead.
707 assert( is_not_dead(n), "can not use dead node");
728 assert( is_not_dead(n), "can not use dead node");
779 assert( is_not_dead(n), "can not use dead node");
890 assert( is_not_dead(n), "can not use dead node");
1098 // detect dead cycle without regions
1114 if (sub->is_top()) break; // Conservative answer for dead code.
1203 break; // dead cycle
1209 // Conservative answer for dead code.
1214 // This control node is dead. Follow the subgraph below it making everything
1215 // using it dead as well. This will happen normally via the usual IterGVN
1217 // inside the dead region, just at the borders.
1218 static void kill_dead_code( Node *dead, PhaseIterGVN *igvn ) {
1220 if( dead->is_Con() ) return;
1227 nstack.push(dead);
1230 dead = nstack.pop();
1231 if (dead->outcnt() > 0) {
1232 // Keep dead node on stack until all uses are processed.
1233 nstack.push(dead);
1235 for (DUIterator_Last kmin, k = dead->last_outs(kmin); k >= kmin; ) {
1236 Node* use = dead->last_out(k);
1238 if (use->in(0) == dead) { // Found another dead node
1240 use->set_req(0, top); // Cut dead edge to prevent processing
1241 nstack.push(use); // the dead node again.
1242 } else { // Else found a not-dead user
1244 if (use->in(j) == dead) { // Turn all dead inputs into TOP
1251 k = dead->last_outs(kmin);
1253 } else { // (dead->outcnt() == 0)
1255 igvn->hash_delete(dead);
1256 igvn->_worklist.remove(dead);
1257 igvn->set_type(dead, Type::TOP);
1258 if (dead->is_macro()) {
1259 igvn->C->remove_macro_node(dead);
1261 if (dead->is_expensive()) {
1262 igvn->C->remove_expensive_node(dead);
1264 igvn->C->record_dead_node(dead->_idx);
1265 // Kill all inputs to the dead guy
1266 for (uint i=0; i < dead->req(); i++) {
1267 Node *n = dead->in(i); // Get input to dead guy
1269 dead->set_req(i, top); // Smash input away
1270 if (n->outcnt() == 0) { // Input also goes dead?
1285 } // (dead->outcnt() == 0)
1298 return false; // Node is dead.
1418 // Used in debugging code to avoid walking across dead or uninitialized edges.
1584 return; // don't process dead nodes