diff graal/com.oracle.graal.compiler/src/com/oracle/graal/compiler/phases/ComputeProbabilityPhase.java @ 5074:ad00d1d02ed2

change MergeableState to use List<T> instead of Collection<T>
author Lukas Stadler <lukas.stadler@jku.at>
date Wed, 14 Mar 2012 17:07:30 +0100
parents e808627bd16f
children 25903e52af48
line wrap: on
line diff
--- a/graal/com.oracle.graal.compiler/src/com/oracle/graal/compiler/phases/ComputeProbabilityPhase.java	Wed Mar 14 16:57:18 2012 +0100
+++ b/graal/com.oracle.graal.compiler/src/com/oracle/graal/compiler/phases/ComputeProbabilityPhase.java	Wed Mar 14 17:07:30 2012 +0100
@@ -180,7 +180,7 @@
         }
 
         @Override
-        public boolean merge(MergeNode merge, Collection<Probability> withStates) {
+        public boolean merge(MergeNode merge, List<Probability> withStates) {
             if (merge.forwardEndCount() > 1) {
                 HashSet<LoopInfo> intersection = new HashSet<>(loops);
                 for (Probability other : withStates) {
@@ -223,7 +223,7 @@
         }
 
         @Override
-        public void loopEnds(LoopBeginNode loopBegin, Collection<Probability> loopEndStates) {
+        public void loopEnds(LoopBeginNode loopBegin, List<Probability> loopEndStates) {
             assert loopInfo != null;
             List<LoopEndNode> loopEnds = loopBegin.orderedLoopEnds();
             int i = 0;
@@ -291,7 +291,7 @@
         }
 
         @Override
-        public boolean merge(MergeNode merge, Collection<LoopCount> withStates) {
+        public boolean merge(MergeNode merge, List<LoopCount> withStates) {
             assert merge.forwardEndCount() == withStates.size() + 1;
             if (merge.forwardEndCount() > 1) {
                 Set<LoopInfo> loops = mergeLoops.get(merge);
@@ -311,7 +311,7 @@
         }
 
         @Override
-        public void loopEnds(LoopBeginNode loopBegin, Collection<LoopCount> loopEndStates) {
+        public void loopEnds(LoopBeginNode loopBegin, List<LoopCount> loopEndStates) {
             // nothing to do...
         }