1.1 --- a/src/share/vm/opto/compile.cpp Sun Sep 06 05:02:06 2015 -0700
1.2 +++ b/src/share/vm/opto/compile.cpp Wed Sep 16 11:09:09 2015 +0200
1.3 @@ -327,7 +327,7 @@
1.4 // Use breadth-first pass that records state in a Unique_Node_List,
1.5 // recursive traversal is slower.
1.6 void Compile::identify_useful_nodes(Unique_Node_List &useful) {
1.7 - int estimated_worklist_size = unique();
1.8 + int estimated_worklist_size = live_nodes();
1.9 useful.map( estimated_worklist_size, NULL ); // preallocate space
1.10
1.11 // Initialize worklist
1.12 @@ -3212,8 +3212,8 @@
1.13 Final_Reshape_Counts frc;
1.14
1.15 // Visit everybody reachable!
1.16 - // Allocate stack of size C->unique()/2 to avoid frequent realloc
1.17 - Node_Stack nstack(unique() >> 1);
1.18 + // Allocate stack of size C->live_nodes()/2 to avoid frequent realloc
1.19 + Node_Stack nstack(live_nodes() >> 1);
1.20 final_graph_reshaping_walk(nstack, root(), frc);
1.21
1.22 // Check for unreachable (from below) code (i.e., infinite loops).
