Searched refs:dead (Results 1 - 12 of 12) sorted by relevance
/openjdk7/jdk/src/share/classes/com/sun/tools/example/debug/bdi/ |
H A D | Session.java | 55 private boolean dead = false; field in class:Session 74 if (!dead) { 88 if (!dead) { 101 dead = true;
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | node.cpp | 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 nod 1218 kill_dead_code( Node *dead, PhaseIterGVN *igvn ) argument [all...] |
H A D | phaseX.cpp | 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 [all...] |
H A D | phaseX.hpp | 395 // Check for a simple dead loop when a data node references itself. 450 // Kill a globally dead Node. All uses are also globally dead and are 452 void remove_globally_dead_node( Node *dead ); 454 // Kill all inputs to a dead node, recursively making more dead nodes. 455 // The Node must be dead locally, i.e., have no uses. 456 void remove_dead_node( Node *dead ) { 457 assert(dead->outcnt() == 0 && !dead [all...] |
H A D | block.cpp | 454 assert( !prevproj->is_Con(), "dead input not removed" ); 585 Block *dead = b->_succs[1-idx]; 586 for( j = 1; j < dead->num_preds(); j++) 587 if( dead->pred(j)->in(0) == bp ) 589 // Scan through block, yanking dead path from 591 dead->head()->del_req(j); 592 for( int k = 1; dead->_nodes[k]->is_Phi(); k++ ) 593 dead->_nodes[k]->del_req(j);
|
H A D | idealKit.hpp | 50 // - final value of iv is available after end_loop (until dead()) 59 // dead(variable) - variable's value is no longer live 71 // goto_(exit); dead(i); 74 // } end_loop(); dead(i); 161 void dead(IdealVariable& v) { set(v, (Node*)NULL); } function in class:IdealKit
|
H A D | stringopts.cpp | 659 void PhaseStringOpts::record_dead_node(Node* dead) { argument 660 dead_worklist.push(dead); 664 // Delete any dead nodes to make things clean enough that escape 1084 // Statically not equal to MIN_VALUE so this path is dead
|
H A D | library_call.cpp | 1283 } __ end_if(); __ dead(j); 1284 }__ end_if(); __ dead(j); 1289 }__ end_loop(); __ dead(j); 1290 __ set(rtn, __ SubI(__ value(i), sourceOffset)); __ dead(i); 1298 }__ end_loop(); __ dead(i); 3184 // If mirror or obj is dead, only null-path is taken. 3445 // If mirror or obj is dead, only null-path is taken. 3506 // If array is dead, only null-path is taken. 3519 // If control is dead, only non-array-path is taken.
|
/openjdk7/hotspot/src/share/vm/code/ |
H A D | codeCache.cpp | 256 // This method is safe to call without holding the CodeCache_lock, as long as a dead codeblob is not 336 cur->print_on(tty, is_live ? "scavenge root" : "dead scavenge root"); tty->cr(); 916 CodeBlob_sizes dead; local 920 dead.add(p); 934 if (!dead.is_empty()) { 935 dead.print("dead");
|
/openjdk7/jdk/src/share/native/sun/font/layout/ |
H A D | PairPositioningSubtables.cpp | 188 #error dead code - not updated.
|
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/ |
H A D | compactibleFreeListSpace.cpp | 505 const bool dead = _post_remark && !_live_bit_map->isMarked(addr); local 508 dead ? "dead" : "live", 510 (!dead && CMSPrintObjectsInDump) ? ":" : "."); 511 if (CMSPrintObjectsInDump && !dead) { 1146 // the previous concurrent cycle then we may have dead but unswept objects 1153 // when we know that it's dead; if the bitmap is not allocated then 1158 return false; // We can't say for sure if it's live, so we say that it's dead. 2123 // so that later phase can skip dead space quickly. So verification
|
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/ |
H A D | psParallelCompact.cpp | 1247 // "dead wood" (i.e., not reclaimed). The function uses a normal distribution 1256 // fraction allowed as dead wood 1395 // occur in those regions. Then the maximum amount of dead wood to allow is 1397 // the region with approximately that amount of dead space to the left is 1430 space->is_empty(), "no dead space allowed to the left"); 1432 "region must have dead space"); 1469 // Locate the region with the desired amount of dead space to the left. 1473 // Scan from the first region with dead space to the limit region and find the 1671 const size_t dead = pointer_delta(space->top(), _space_info[id].new_top()); local 1684 } else if (dead [all...] |
Completed in 115 milliseconds