# HG changeset patch
# User Roland Schatz <roland.schatz@oracle.com>
# Date 1366111282 -7200
# Node ID c5fa76a208686767818f05f556d251ebfc5a7b0e
# Parent  da92cfd1ceaf9623a996bc491da791e0ac22b822
Remove unused field.

diff -r da92cfd1ceaf -r c5fa76a20868 graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/ReadEliminationPhase.java
--- a/graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/ReadEliminationPhase.java	Tue Apr 16 13:21:20 2013 +0200
+++ b/graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/ReadEliminationPhase.java	Tue Apr 16 13:21:22 2013 +0200
@@ -22,8 +22,6 @@
  */
 package com.oracle.graal.phases.common;
 
-import java.util.*;
-
 import com.oracle.graal.debug.*;
 import com.oracle.graal.graph.*;
 import com.oracle.graal.nodes.*;
@@ -32,11 +30,8 @@
 
 public class ReadEliminationPhase extends Phase {
 
-    private Queue<PhiNode> newPhis;
-
     @Override
     protected void run(StructuredGraph graph) {
-        newPhis = new LinkedList<>();
         for (FloatingReadNode n : graph.getNodes(FloatingReadNode.class)) {
             if (isReadEliminable(n)) {
                 NodeMap<ValueNode> nodeMap = n.graph().createNodeMap();
@@ -47,11 +42,11 @@
         }
     }
 
-    private boolean isReadEliminable(FloatingReadNode n) {
+    private static boolean isReadEliminable(FloatingReadNode n) {
         return isWrites(n, n.lastLocationAccess(), n.graph().createNodeBitMap());
     }
 
-    private boolean isWrites(FloatingReadNode n, Node lastLocationAccess, NodeBitMap visited) {
+    private static boolean isWrites(FloatingReadNode n, Node lastLocationAccess, NodeBitMap visited) {
         if (lastLocationAccess == null) {
             return false;
         }
@@ -77,7 +72,7 @@
         return false;
     }
 
-    private ValueNode getValue(FloatingReadNode n, Node lastLocationAccess, NodeMap<ValueNode> nodeMap) {
+    private static ValueNode getValue(FloatingReadNode n, Node lastLocationAccess, NodeMap<ValueNode> nodeMap) {
         ValueNode exisiting = nodeMap.get(lastLocationAccess);
         if (exisiting != null) {
             return exisiting;
@@ -97,7 +92,6 @@
             for (ValueNode value : phi.values()) {
                 newPhi.addInput(getValue(n, value, nodeMap));
             }
-            newPhis.add(newPhi);
             return newPhi;
         }
         throw GraalInternalError.shouldNotReachHere();