# HG changeset patch
# User Thomas Wuerthinger <thomas.wuerthinger@oracle.com>
# Date 1424711012 -3600
# Node ID 08d94d9f0b0fb6c541f3346ca6030d865db0e731
# Parent  e9d88438d154fc7049d1a134464c425cf935d946
Fix warning.

diff -r e9d88438d154 -r 08d94d9f0b0f graal/com.oracle.graal.phases/src/com/oracle/graal/phases/schedule/SchedulePhase.java
--- a/graal/com.oracle.graal.phases/src/com/oracle/graal/phases/schedule/SchedulePhase.java	Mon Feb 23 18:02:08 2015 +0100
+++ b/graal/com.oracle.graal.phases/src/com/oracle/graal/phases/schedule/SchedulePhase.java	Mon Feb 23 18:03:32 2015 +0100
@@ -674,13 +674,14 @@
         return earliestBlockHelper(node, earliest);
     }
 
-    private Block earliestBlockHelper(Node node, Block earliest) throws SchedulingError {
+    private Block earliestBlockHelper(Node node, Block earliestStart) throws SchedulingError {
         /*
          * All inputs must be in a dominating block, otherwise the graph cannot be scheduled. This
          * implies that the inputs' blocks have a total ordering via their dominance relation. So in
          * order to find the earliest block placement for this node we need to find the input block
          * that is dominated by all other input blocks.
          */
+        Block earliest = earliestStart;
 
         if (node.predecessor() != null) {
             throw new SchedulingError();