[turbofan] Cleanup Graph and related classes.

test/cctest/compiler/test-graph-reducer.cc

 // Copyright 2014 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+#include <set>
+
 #include "src/v8.h"
 
 #include "graph-tester.h"
 #include "src/compiler/graph-reducer.h"
+#include "src/compiler/node.h"
+#include "src/compiler/operator.h"
 
 using namespace v8::internal;
 using namespace v8::internal::compiler;
 
 const uint8_t OPCODE_A0 = 10;
 const uint8_t OPCODE_A1 = 11;
 const uint8_t OPCODE_A2 = 12;
 const uint8_t OPCODE_B0 = 20;
 const uint8_t OPCODE_B1 = 21;
 const uint8_t OPCODE_B2 = 22;
@@ skipping 155 matching lines @@
         }
     }
     return NoChange();
   }
 };
 
 
 // Simply records the nodes visited.
 class ReducerRecorder : public Reducer {
  public:
+  typedef std::set<Node*, std::less<Node*>, zone_allocator<Node*>> NodeSet;
   explicit ReducerRecorder(Zone* zone)
       : set(NodeSet::key_compare(), NodeSet::allocator_type(zone)) {}
   virtual Reduction Reduce(Node* node) {
     set.insert(node);
     return NoChange();
   }
   void CheckContains(Node* node) {
     CHECK_EQ(1, static_cast<int>(set.count(node)));
   }
   NodeSet set;
@@ skipping 419 matching lines @@
     for (int i = 0; i < 3; i++) {
       int before = graph.NodeCount();
       reducer.ReduceGraph();
       CHECK_EQ(before, graph.NodeCount());
       CHECK_EQ(&OPC0, n1->op());
       CHECK_EQ(&OPC1, end->op());
       CHECK_EQ(n1, end->InputAt(0));
     }
   }
 }