OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "src/compiler/graph.h" | 5 #include "src/compiler/graph.h" |
6 | 6 |
7 #include "src/compiler/common-operator.h" | 7 #include "src/compiler/common-operator.h" |
8 #include "src/compiler/generic-node-inl.h" | 8 #include "src/compiler/generic-node-inl.h" |
9 #include "src/compiler/graph-inl.h" | 9 #include "src/compiler/graph-inl.h" |
10 #include "src/compiler/node.h" | 10 #include "src/compiler/node.h" |
11 #include "src/compiler/node-aux-data-inl.h" | 11 #include "src/compiler/node-aux-data-inl.h" |
12 #include "src/compiler/node-properties.h" | 12 #include "src/compiler/node-properties.h" |
13 #include "src/compiler/node-properties-inl.h" | 13 #include "src/compiler/node-properties-inl.h" |
14 #include "src/compiler/operator-properties.h" | 14 #include "src/compiler/operator-properties.h" |
15 #include "src/compiler/operator-properties-inl.h" | 15 #include "src/compiler/operator-properties-inl.h" |
16 | 16 |
17 namespace v8 { | 17 namespace v8 { |
18 namespace internal { | 18 namespace internal { |
19 namespace compiler { | 19 namespace compiler { |
20 | 20 |
21 Graph::Graph(Zone* zone) | 21 Graph::Graph(Zone* zone) |
22 : GenericGraph<Node>(zone), | 22 : GenericGraph<Node>(zone), |
23 decorators_(DecoratorVector::allocator_type(zone)) {} | 23 decorators_(DecoratorVector::allocator_type(zone)) {} |
24 | 24 |
25 | 25 |
26 Node* Graph::NewNode(Operator* op, int input_count, Node** inputs) { | 26 Node* Graph::NewNode(Operator* op, int input_count, Node** inputs) { |
27 ASSERT(op->InputCount() <= input_count); | 27 DCHECK(op->InputCount() <= input_count); |
28 Node* result = Node::New(this, input_count, inputs); | 28 Node* result = Node::New(this, input_count, inputs); |
29 result->Initialize(op); | 29 result->Initialize(op); |
30 for (DecoratorVector::iterator i = decorators_.begin(); | 30 for (DecoratorVector::iterator i = decorators_.begin(); |
31 i != decorators_.end(); ++i) { | 31 i != decorators_.end(); ++i) { |
32 (*i)->Decorate(result); | 32 (*i)->Decorate(result); |
33 } | 33 } |
34 return result; | 34 return result; |
35 } | 35 } |
36 | 36 |
37 | 37 |
38 void Graph::ChangeOperator(Node* node, Operator* op) { node->set_op(op); } | 38 void Graph::ChangeOperator(Node* node, Operator* op) { node->set_op(op); } |
39 | 39 |
40 | 40 |
41 void Graph::DeleteNode(Node* node) { | 41 void Graph::DeleteNode(Node* node) { |
42 #if DEBUG | 42 #if DEBUG |
43 // Nodes can't be deleted if they have uses. | 43 // Nodes can't be deleted if they have uses. |
44 Node::Uses::iterator use_iterator(node->uses().begin()); | 44 Node::Uses::iterator use_iterator(node->uses().begin()); |
45 ASSERT(use_iterator == node->uses().end()); | 45 DCHECK(use_iterator == node->uses().end()); |
46 #endif | 46 #endif |
47 | 47 |
48 #if DEBUG | 48 #if DEBUG |
49 memset(node, 0xDE, sizeof(Node)); | 49 memset(node, 0xDE, sizeof(Node)); |
50 #endif | 50 #endif |
51 } | 51 } |
52 } | 52 } |
53 } | 53 } |
54 } // namespace v8::internal::compiler | 54 } // namespace v8::internal::compiler |
OLD | NEW |