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 #ifndef V8_COMPILER_GRAPH_H_ | 5 #ifndef V8_COMPILER_GRAPH_H_ |
6 #define V8_COMPILER_GRAPH_H_ | 6 #define V8_COMPILER_GRAPH_H_ |
7 | 7 |
8 #include <map> | 8 #include <map> |
9 #include <set> | 9 #include <set> |
10 | 10 |
(...skipping 36 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
47 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, | 47 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, |
48 Node* n5) { | 48 Node* n5) { |
49 Node* nodes[] = {n1, n2, n3, n4, n5}; | 49 Node* nodes[] = {n1, n2, n3, n4, n5}; |
50 return NewNode(op, arraysize(nodes), nodes); | 50 return NewNode(op, arraysize(nodes), nodes); |
51 } | 51 } |
52 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, | 52 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, |
53 Node* n5, Node* n6) { | 53 Node* n5, Node* n6) { |
54 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; | 54 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; |
55 return NewNode(op, arraysize(nodes), nodes); | 55 return NewNode(op, arraysize(nodes), nodes); |
56 } | 56 } |
| 57 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, |
| 58 Node* n5, Node* n6, Node* n7) { |
| 59 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7}; |
| 60 return NewNode(op, arraysize(nodes), nodes); |
| 61 } |
57 | 62 |
58 template <class Visitor> | 63 template <class Visitor> |
59 void VisitNodeUsesFrom(Node* node, Visitor* visitor); | 64 void VisitNodeUsesFrom(Node* node, Visitor* visitor); |
60 | 65 |
61 template <class Visitor> | 66 template <class Visitor> |
62 void VisitNodeUsesFromStart(Visitor* visitor); | 67 void VisitNodeUsesFromStart(Visitor* visitor); |
63 | 68 |
64 template <class Visitor> | 69 template <class Visitor> |
65 void VisitNodeInputsFromEnd(Visitor* visitor); | 70 void VisitNodeInputsFromEnd(Visitor* visitor); |
66 | 71 |
(...skipping 17 matching lines...) Expand all Loading... |
84 public: | 89 public: |
85 virtual ~GraphDecorator() {} | 90 virtual ~GraphDecorator() {} |
86 virtual void Decorate(Node* node) = 0; | 91 virtual void Decorate(Node* node) = 0; |
87 }; | 92 }; |
88 | 93 |
89 } // namespace compiler | 94 } // namespace compiler |
90 } // namespace internal | 95 } // namespace internal |
91 } // namespace v8 | 96 } // namespace v8 |
92 | 97 |
93 #endif // V8_COMPILER_GRAPH_H_ | 98 #endif // V8_COMPILER_GRAPH_H_ |
OLD | NEW |