src/share/vm/opto/multnode.cpp

*** 1,7 ****
  /*
!  * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
   * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   *
   * This code is free software; you can redistribute it and/or modify it
   * under the terms of the GNU General Public License version 2 only, as
   * published by the Free Software Foundation.
--- 1,7 ----
  /*
!  * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved.
   * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   *
   * This code is free software; you can redistribute it and/or modify it
   * under the terms of the GNU General Public License version 2 only, as
   * published by the Free Software Foundation.
*** 192,202 ****
         iff->in(1)->in(1)->Opcode() != Op_Opaque1) {
        return false;
      }
    }
  
!   ProjNode* other_proj = iff->proj_out(1-_con)->as_Proj();
    if (other_proj->is_uncommon_trap_proj(reason)) {
      assert(reason == Deoptimization::Reason_none ||
             Compile::current()->is_predicate_opaq(iff->in(1)->in(1)), "should be on the list");
      return true;
    }
--- 192,205 ----
         iff->in(1)->in(1)->Opcode() != Op_Opaque1) {
        return false;
      }
    }
  
!   ProjNode* other_proj = iff->proj_out(1-_con);
!   if (other_proj == NULL) // Should never happen, but make Parfait happy.
!       return false;
!   other_proj = other_proj -> as_Proj();
    if (other_proj->is_uncommon_trap_proj(reason)) {
      assert(reason == Deoptimization::Reason_none ||
             Compile::current()->is_predicate_opaq(iff->in(1)->in(1)), "should be on the list");
      return true;
    }