src/share/vm/opto/compile.cpp
Index
Unified diffs
Context diffs
Sdiffs
Patch
New
Old
Previous File
Next File
*** old/src/share/vm/opto/compile.cpp Wed Oct 7 16:08:13 2015
--- new/src/share/vm/opto/compile.cpp Wed Oct 7 16:08:13 2015
*** 315,325 ****
--- 315,325 ----
// Identify all nodes that are reachable from below, useful.
// Use breadth-first pass that records state in a Unique_Node_List,
// recursive traversal is slower.
void Compile::identify_useful_nodes(Unique_Node_List &useful) {
! int estimated_worklist_size = unique();
! int estimated_worklist_size = live_nodes();
useful.map( estimated_worklist_size, NULL ); // preallocate space
// Initialize worklist
if (root() != NULL) { useful.push(root()); }
// If 'top' is cached, declare it useful to preserve cached node
*** 3312,3322 ****
--- 3312,3322 ----
}
Final_Reshape_Counts frc;
// Visit everybody reachable!
! // Allocate stack of size C->unique()/2 to avoid frequent realloc
! // Allocate stack of size C->live_nodes()/2 to avoid frequent realloc
Node_Stack nstack(live_nodes() >> 1);
final_graph_reshaping_walk(nstack, root(), frc);
// Check for unreachable (from below) code (i.e., infinite loops).
for( uint i = 0; i < frc._tests.size(); i++ ) {
src/share/vm/opto/compile.cpp
Index
Unified diffs
Context diffs
Sdiffs
Patch
New
Old
Previous File
Next File