src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/extended/BranchProbabilityNode.java

rev 56282 : [mq]: graal

*** 1,7 ****
  /*
!  * Copyright (c) 2012, 2018, 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) 2012, 2019, 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.
*** 72,81 ****
--- 72,83 ----
      public static final double SLOW_PATH_PROBABILITY = 1 - FAST_PATH_PROBABILITY;
  
      public static final double VERY_FAST_PATH_PROBABILITY = 0.999;
      public static final double VERY_SLOW_PATH_PROBABILITY = 1 - VERY_FAST_PATH_PROBABILITY;
  
+     public static final double DEOPT_PROBABILITY = 0.0;
+ 
      /*
       * This probability may seem excessive, but it makes a difference in long running loops. Lets
       * say a loop is executed 100k times and it has a few null checks with probability 0.999. As
       * these probabilities multiply for every loop iteration, the overall loop frequency will be
       * calculated as approximately 30 while it should be 100k.