Land the Fan (disabled)

src/compiler/graph.h

Index: src/compiler/graph.h
diff --git a/src/compiler/graph.h b/src/compiler/graph.h
new file mode 100644
index 0000000000000000000000000000000000000000..bc648d61d621beb8369896ffb63f5c224dd33ab5
--- /dev/null
+++ b/src/compiler/graph.h
@@ -0,0 +1,97 @@
+// Copyright 2013 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.
+
+#ifndef V8_COMPILER_GRAPH_H_
+#define V8_COMPILER_GRAPH_H_
+
+#include <map>
+#include <set>
+
+#include "src/compiler/generic-algorithm.h"
+#include "src/compiler/node.h"
+#include "src/compiler/node-aux-data.h"
+#include "src/compiler/source-position.h"
+
+namespace v8 {
+namespace internal {
+namespace compiler {
+
+class GraphDecorator;
+
+
+class Graph : public GenericGraph<Node> {
+ public:
+  explicit Graph(Zone* zone);
+
+  // Base implementation used by all factory methods.
+  Node* NewNode(Operator* op, int input_count, Node** inputs);
+
+  // Factories for nodes with static input counts.
+  Node* NewNode(Operator* op) {
+    return NewNode(op, 0, static_cast<Node**>(NULL));
+  }
+  Node* NewNode(Operator* op, Node* n1) { return NewNode(op, 1, &n1); }
+  Node* NewNode(Operator* op, Node* n1, Node* n2) {
+    Node* nodes[] = {n1, n2};
+    return NewNode(op, ARRAY_SIZE(nodes), nodes);
+  }
+  Node* NewNode(Operator* op, Node* n1, Node* n2, Node* n3) {
+    Node* nodes[] = {n1, n2, n3};
+    return NewNode(op, ARRAY_SIZE(nodes), nodes);
+  }
+  Node* NewNode(Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
+    Node* nodes[] = {n1, n2, n3, n4};
+    return NewNode(op, ARRAY_SIZE(nodes), nodes);
+  }
+  Node* NewNode(Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
+                Node* n5) {
+    Node* nodes[] = {n1, n2, n3, n4, n5};
+    return NewNode(op, ARRAY_SIZE(nodes), nodes);
+  }
+  Node* NewNode(Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5,
+                Node* n6) {
+    Node* nodes[] = {n1, n2, n3, n4, n5, n6};
+    return NewNode(op, ARRAY_SIZE(nodes), nodes);
+  }
+
+  void ChangeOperator(Node* node, Operator* op);
+  void DeleteNode(Node* node);
+
+  template <class Visitor>
+  void VisitNodeUsesFrom(Node* node, Visitor* visitor);
+
+  template <class Visitor>
+  void VisitNodeUsesFromStart(Visitor* visitor);
+
+  template <class Visitor>
+  void VisitNodeInputsFromEnd(Visitor* visitor);
+
+  void AddDecorator(GraphDecorator* decorator) {
+    decorators_.push_back(decorator);
+  }
+
+  void RemoveDecorator(GraphDecorator* decorator) {
+    DecoratorVector::iterator it =
+        std::find(decorators_.begin(), decorators_.end(), decorator);
+    ASSERT(it != decorators_.end());
+    decorators_.erase(it, it + 1);
+  }
+
+ private:
+  typedef std::vector<GraphDecorator*, zone_allocator<GraphDecorator*> >
+      DecoratorVector;
+  DecoratorVector decorators_;
+};
+
+
+class GraphDecorator : public ZoneObject {
+ public:
+  virtual ~GraphDecorator() {}
+  virtual void Decorate(Node* node) = 0;
+};
+}
+}
+}  // namespace v8::internal::compiler
+
+#endif  // V8_COMPILER_GRAPH_H_