Chromium Code Reviews| 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 "src/zone.h" | 8 #include "src/zone.h" |
| 9 #include "src/zone-containers.h" | 9 #include "src/zone-containers.h" |
| 10 | 10 |
| (...skipping 61 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 72 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, | 72 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, |
| 73 Node* n5, Node* n6, Node* n7, Node* n8) { | 73 Node* n5, Node* n6, Node* n7, Node* n8) { |
| 74 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8}; | 74 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8}; |
| 75 return NewNode(op, arraysize(nodes), nodes); | 75 return NewNode(op, arraysize(nodes), nodes); |
| 76 } | 76 } |
| 77 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, | 77 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, |
| 78 Node* n5, Node* n6, Node* n7, Node* n8, Node* n9) { | 78 Node* n5, Node* n6, Node* n7, Node* n8, Node* n9) { |
| 79 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8, n9}; | 79 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8, n9}; |
| 80 return NewNode(op, arraysize(nodes), nodes); | 80 return NewNode(op, arraysize(nodes), nodes); |
| 81 } | 81 } |
| 82 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, | |
|
titzer
2015/08/21 10:31:52
We've got too many overloads here already, can we
rmcilroy
2015/08/21 13:10:15
Done.
| |
| 83 Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10) { | |
| 84 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8, n9, n10}; | |
| 85 return NewNode(op, arraysize(nodes), nodes); | |
| 86 } | |
| 87 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, | |
| 88 Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10, | |
| 89 Node* n11) { | |
| 90 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8, n9, n10, n11}; | |
| 91 return NewNode(op, arraysize(nodes), nodes); | |
| 92 } | |
| 82 | 93 |
| 83 // Clone the {node}, and assign a new node id to the copy. | 94 // Clone the {node}, and assign a new node id to the copy. |
| 84 Node* CloneNode(const Node* node); | 95 Node* CloneNode(const Node* node); |
| 85 | 96 |
| 86 template <class Visitor> | 97 template <class Visitor> |
| 87 inline void VisitNodeInputsFromEnd(Visitor* visitor); | 98 inline void VisitNodeInputsFromEnd(Visitor* visitor); |
| 88 | 99 |
| 89 Zone* zone() const { return zone_; } | 100 Zone* zone() const { return zone_; } |
| 90 Node* start() const { return start_; } | 101 Node* start() const { return start_; } |
| 91 Node* end() const { return end_; } | 102 Node* end() const { return end_; } |
| (...skipping 29 matching lines...) Expand all Loading... | |
| 121 public: | 132 public: |
| 122 virtual ~GraphDecorator() {} | 133 virtual ~GraphDecorator() {} |
| 123 virtual void Decorate(Node* node) = 0; | 134 virtual void Decorate(Node* node) = 0; |
| 124 }; | 135 }; |
| 125 | 136 |
| 126 } // namespace compiler | 137 } // namespace compiler |
| 127 } // namespace internal | 138 } // namespace internal |
| 128 } // namespace v8 | 139 } // namespace v8 |
| 129 | 140 |
| 130 #endif // V8_COMPILER_GRAPH_H_ | 141 #endif // V8_COMPILER_GRAPH_H_ |
| OLD | NEW |