1.1 --- a/src/share/vm/opto/domgraph.cpp Mon Aug 26 16:12:20 2013 +0200 1.2 +++ b/src/share/vm/opto/domgraph.cpp Mon Aug 26 12:50:23 2013 +0200 1.3 @@ -211,21 +211,21 @@ 1.4 uint Block_Stack::most_frequent_successor( Block *b ) { 1.5 uint freq_idx = 0; 1.6 int eidx = b->end_idx(); 1.7 - Node *n = b->_nodes[eidx]; 1.8 + Node *n = b->get_node(eidx); 1.9 int op = n->is_Mach() ? n->as_Mach()->ideal_Opcode() : n->Opcode(); 1.10 switch( op ) { 1.11 case Op_CountedLoopEnd: 1.12 case Op_If: { // Split frequency amongst children 1.13 float prob = n->as_MachIf()->_prob; 1.14 // Is succ[0] the TRUE branch or the FALSE branch? 1.15 - if( b->_nodes[eidx+1]->Opcode() == Op_IfFalse ) 1.16 + if( b->get_node(eidx+1)->Opcode() == Op_IfFalse ) 1.17 prob = 1.0f - prob; 1.18 freq_idx = prob < PROB_FAIR; // freq=1 for succ[0] < 0.5 prob 1.19 break; 1.20 } 1.21 case Op_Catch: // Split frequency amongst children 1.22 for( freq_idx = 0; freq_idx < b->_num_succs; freq_idx++ ) 1.23 - if( b->_nodes[eidx+1+freq_idx]->as_CatchProj()->_con == CatchProjNode::fall_through_index ) 1.24 + if( b->get_node(eidx+1+freq_idx)->as_CatchProj()->_con == CatchProjNode::fall_through_index ) 1.25 break; 1.26 // Handle case of no fall-thru (e.g., check-cast MUST throw an exception) 1.27 if( freq_idx == b->_num_succs ) freq_idx = 0;