src/hotspot/share/opto/gcm.cpp

*** 1865,1876 ****
        return prob; // taken
      }
    }
  
    case Op_Jump:
!     // Divide the frequency between all successors evenly
!     return 1.0f/_num_succs;
  
    case Op_Catch: {
      const CatchProjNode *ci = get_node(i + eidx + 1)->as_CatchProj();
      if (ci->_con == CatchProjNode::fall_through_index) {
        // Fall-thru path gets the lion's share.
--- 1865,1875 ----
        return prob; // taken
      }
    }
  
    case Op_Jump:
!     return n->as_MachJump()->_probs[get_node(i + eidx + 1)->as_JumpProj()->_con];
  
    case Op_Catch: {
      const CatchProjNode *ci = get_node(i + eidx + 1)->as_CatchProj();
      if (ci->_con == CatchProjNode::fall_through_index) {
        // Fall-thru path gets the lion's share.