| // 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. |
| |
| #include "src/compiler/graph.h" |
| |
| #include "src/compiler/common-operator.h" |
| #include "src/compiler/generic-node-inl.h" |
| #include "src/compiler/graph-inl.h" |
| #include "src/compiler/node.h" |
| #include "src/compiler/node-aux-data-inl.h" |
| #include "src/compiler/node-properties.h" |
| #include "src/compiler/node-properties-inl.h" |
| #include "src/compiler/operator-properties.h" |
| #include "src/compiler/operator-properties-inl.h" |
| |
| namespace v8 { |
| namespace internal { |
| namespace compiler { |
| |
| Graph::Graph(Zone* zone) : GenericGraph<Node>(zone), decorators_(zone) {} |
| |
| |
| Node* Graph::NewNode(const Operator* op, int input_count, Node** inputs) { |
| DCHECK_LE(op->InputCount(), input_count); |
| Node* result = Node::New(this, input_count, inputs); |
| result->Initialize(op); |
| for (ZoneVector<GraphDecorator*>::iterator i = decorators_.begin(); |
| i != decorators_.end(); ++i) { |
| (*i)->Decorate(result); |
| } |
| return result; |
| } |
| |
| } // namespace compiler |
| } // namespace internal |
| } // namespace v8 |