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