src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/extended/BranchProbabilityNode.java
equal
deleted
inserted
replaced
23 package org.graalvm.compiler.nodes.extended; |
23 package org.graalvm.compiler.nodes.extended; |
24 |
24 |
25 import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_0; |
25 import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_0; |
26 import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_0; |
26 import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_0; |
27 |
27 |
28 import org.graalvm.compiler.core.common.calc.Condition; |
28 import org.graalvm.compiler.core.common.calc.CanonicalCondition; |
29 import org.graalvm.compiler.debug.GraalError; |
29 import org.graalvm.compiler.debug.GraalError; |
30 import org.graalvm.compiler.graph.NodeClass; |
30 import org.graalvm.compiler.graph.NodeClass; |
31 import org.graalvm.compiler.graph.iterators.NodePredicates; |
31 import org.graalvm.compiler.graph.iterators.NodePredicates; |
32 import org.graalvm.compiler.graph.spi.Simplifiable; |
32 import org.graalvm.compiler.graph.spi.Simplifiable; |
33 import org.graalvm.compiler.graph.spi.SimplifierTool; |
33 import org.graalvm.compiler.graph.spi.SimplifierTool; |
99 */ |
99 */ |
100 return; |
100 return; |
101 } |
101 } |
102 boolean usageFound = false; |
102 boolean usageFound = false; |
103 for (IntegerEqualsNode node : this.usages().filter(IntegerEqualsNode.class)) { |
103 for (IntegerEqualsNode node : this.usages().filter(IntegerEqualsNode.class)) { |
104 assert node.condition() == Condition.EQ; |
104 assert node.condition() == CanonicalCondition.EQ; |
105 ValueNode other = node.getX(); |
105 ValueNode other = node.getX(); |
106 if (node.getX() == this) { |
106 if (node.getX() == this) { |
107 other = node.getY(); |
107 other = node.getY(); |
108 } |
108 } |
109 if (other.isConstant()) { |
109 if (other.isConstant()) { |