# HG changeset patch # User Miguel Garcia # Date 1401804011 -7200 # Node ID 4408391d34a134588e253fe8f383e66f6cf33ca7 # Parent 8beba154719b725a887083fccb848e3cb448d740 [inliner] assertion for result in a single place (producer) not at each consumer diff -r 8beba154719b -r 4408391d34a1 graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/inlining/walker/CallsiteHolder.java --- a/graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/inlining/walker/CallsiteHolder.java Tue Jun 03 11:27:08 2014 +0200 +++ b/graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/inlining/walker/CallsiteHolder.java Tue Jun 03 16:00:11 2014 +0200 @@ -29,7 +29,6 @@ import com.oracle.graal.nodes.StructuredGraph; import com.oracle.graal.phases.graph.FixedNodeProbabilityCache; -import java.util.Iterator; import java.util.LinkedList; import java.util.function.ToDoubleFunction; @@ -59,7 +58,6 @@ computeInliningRelevance = null; } else { remainingInvokes = new InliningIterator(graph).apply(); - assert remainingInvokes.size() == count(graph.getInvokes()); if (remainingInvokes.isEmpty()) { probabilities = null; computeInliningRelevance = null; @@ -71,16 +69,6 @@ } } - private static int count(Iterable invokes) { - int count = 0; - Iterator iterator = invokes.iterator(); - while (iterator.hasNext()) { - iterator.next(); - count++; - } - return count; - } - /** * Gets the method associated with the {@linkplain #graph() graph} represented by this object. */ diff -r 8beba154719b -r 4408391d34a1 graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/inlining/walker/InliningIterator.java --- a/graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/inlining/walker/InliningIterator.java Tue Jun 03 11:27:08 2014 +0200 +++ b/graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/inlining/walker/InliningIterator.java Tue Jun 03 16:00:11 2014 +0200 @@ -29,6 +29,7 @@ import java.util.ArrayDeque; import java.util.Deque; +import java.util.Iterator; import java.util.LinkedList; /** @@ -81,6 +82,7 @@ } } + assert invokes.size() == count(start.graph().getInvokes()); return invokes; } @@ -127,4 +129,14 @@ } return true; } + + private static int count(Iterable invokes) { + int count = 0; + Iterator iterator = invokes.iterator(); + while (iterator.hasNext()) { + iterator.next(); + count++; + } + return count; + } }