| 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_INL_H_ | 5 #ifndef V8_COMPILER_GRAPH_INL_H_ |
| 6 #define V8_COMPILER_GRAPH_INL_H_ | 6 #define V8_COMPILER_GRAPH_INL_H_ |
| 7 | 7 |
| 8 #include "src/compiler/generic-algorithm-inl.h" | 8 #include "src/compiler/generic-algorithm.h" |
| 9 #include "src/compiler/graph.h" | 9 #include "src/compiler/graph.h" |
| 10 | 10 |
| 11 namespace v8 { | 11 namespace v8 { |
| 12 namespace internal { | 12 namespace internal { |
| 13 namespace compiler { | 13 namespace compiler { |
| 14 | 14 |
| 15 template <class Visitor> | 15 template <class Visitor> |
| 16 void Graph::VisitNodeInputsFromEnd(Visitor* visitor) { | 16 void Graph::VisitNodeInputsFromEnd(Visitor* visitor) { |
| 17 Zone tmp_zone(zone()->isolate()); | 17 Zone tmp_zone(zone()->isolate()); |
| 18 GenericGraphVisit::Visit<Visitor, NodeInputIterationTraits<Node> >( | 18 GenericGraphVisit::Visit<Visitor>(this, &tmp_zone, end(), visitor); |
| 19 this, &tmp_zone, end(), visitor); | |
| 20 } | 19 } |
| 21 | 20 |
| 22 } // namespace compiler | 21 } // namespace compiler |
| 23 } // namespace internal | 22 } // namespace internal |
| 24 } // namespace v8 | 23 } // namespace v8 |
| 25 | 24 |
| 26 #endif // V8_COMPILER_GRAPH_INL_H_ | 25 #endif // V8_COMPILER_GRAPH_INL_H_ |
| OLD | NEW |
|---|
Chromium Code Reviews
Issue 760493003:
Make generic algorithm a little less generic. (Closed)
Base URL: https://chromium.googlesource.com/v8/v8.git@local_cleanup-generic-stuff-3