Home
last modified time | relevance | path

Searched refs:reachableSuccessors (Results 1 – 7 of 7) sorted by relevance

/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/
H A DPropagateDeoptimizeProbabilityPhase.java74 … EconomicSet<AbstractBeginNode> reachableSuccessors = reachableSplits.get(controlSplitNode); in run() local
75 if (reachableSuccessors == null) { in run()
76 reachableSuccessors = EconomicSet.create(); in run()
77 reachableSplits.put(controlSplitNode, reachableSuccessors); in run()
80 … if (controlSplitNode.getSuccessorCount() == reachableSuccessors.size() - 1) { in run()
86 reachableSuccessors.add(beginNode); in run()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/
H A DPropagateDeoptimizeProbabilityPhase.java74 … EconomicSet<AbstractBeginNode> reachableSuccessors = reachableSplits.get(controlSplitNode); in run() local
75 if (reachableSuccessors == null) { in run()
76 reachableSuccessors = EconomicSet.create(); in run()
77 reachableSplits.put(controlSplitNode, reachableSuccessors); in run()
80 … if (controlSplitNode.getSuccessorCount() == reachableSuccessors.size() - 1) { in run()
86 reachableSuccessors.add(beginNode); in run()
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/
H A DPropagateDeoptimizeProbabilityPhase.java74 … EconomicSet<AbstractBeginNode> reachableSuccessors = reachableSplits.get(controlSplitNode); in run() local
75 if (reachableSuccessors == null) { in run()
76 reachableSuccessors = EconomicSet.create(); in run()
77 reachableSplits.put(controlSplitNode, reachableSuccessors); in run()
80 … if (controlSplitNode.getSuccessorCount() == reachableSuccessors.size() - 1) { in run()
86 reachableSuccessors.add(beginNode); in run()
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/
H A DPropagateDeoptimizeProbabilityPhase.java74 … EconomicSet<AbstractBeginNode> reachableSuccessors = reachableSplits.get(controlSplitNode); in run() local
75 if (reachableSuccessors == null) { in run()
76 reachableSuccessors = EconomicSet.create(); in run()
77 reachableSplits.put(controlSplitNode, reachableSuccessors); in run()
80 … if (controlSplitNode.getSuccessorCount() == reachableSuccessors.size() - 1) { in run()
86 reachableSuccessors.add(beginNode); in run()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/
H A DPropagateDeoptimizeProbabilityPhase.java75 … EconomicSet<AbstractBeginNode> reachableSuccessors = reachableSplits.get(controlSplitNode); in run() local
76 if (reachableSuccessors == null) { in run()
77 reachableSuccessors = EconomicSet.create(); in run()
78 reachableSplits.put(controlSplitNode, reachableSuccessors); in run()
81 … if (controlSplitNode.getSuccessorCount() == reachableSuccessors.size() - 1) { in run()
87 reachableSuccessors.add(beginNode); in run()
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/
H A DPropagateDeoptimizeProbabilityPhase.java75 … EconomicSet<AbstractBeginNode> reachableSuccessors = reachableSplits.get(controlSplitNode); in run() local
76 if (reachableSuccessors == null) { in run()
77 reachableSuccessors = EconomicSet.create(); in run()
78 reachableSplits.put(controlSplitNode, reachableSuccessors); in run()
81 … if (controlSplitNode.getSuccessorCount() == reachableSuccessors.size() - 1) { in run()
87 reachableSuccessors.add(beginNode); in run()
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/
H A DPropagateDeoptimizeProbabilityPhase.java75 … EconomicSet<AbstractBeginNode> reachableSuccessors = reachableSplits.get(controlSplitNode); in run() local
76 if (reachableSuccessors == null) { in run()
77 reachableSuccessors = EconomicSet.create(); in run()
78 reachableSplits.put(controlSplitNode, reachableSuccessors); in run()
81 … if (controlSplitNode.getSuccessorCount() == reachableSuccessors.size() - 1) { in run()
87 reachableSuccessors.add(beginNode); in run()