OLD | NEW |
1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 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_CONTROL_REDUCER_H_ | 5 #ifndef V8_COMPILER_CONTROL_REDUCER_H_ |
6 #define V8_COMPILER_CONTROL_REDUCER_H_ | 6 #define V8_COMPILER_CONTROL_REDUCER_H_ |
7 | 7 |
8 namespace v8 { | 8 namespace v8 { |
9 namespace internal { | 9 namespace internal { |
10 | 10 |
(...skipping 12 matching lines...) Expand all Loading... |
23 public: | 23 public: |
24 // Perform branch folding and dead code elimination on the graph. | 24 // Perform branch folding and dead code elimination on the graph. |
25 static void ReduceGraph(Zone* zone, JSGraph* graph, | 25 static void ReduceGraph(Zone* zone, JSGraph* graph, |
26 int max_phis_for_select = 0); | 26 int max_phis_for_select = 0); |
27 | 27 |
28 // Reduces a single merge node and attached phis. | 28 // Reduces a single merge node and attached phis. |
29 static Node* ReduceMerge(JSGraph* graph, Node* node, | 29 static Node* ReduceMerge(JSGraph* graph, Node* node, |
30 int max_phis_for_select = 0); | 30 int max_phis_for_select = 0); |
31 | 31 |
32 // Testing interface. | 32 // Testing interface. |
33 static Node* ReducePhiForTesting(JSGraph* graph, Node* node); | |
34 static Node* ReduceIfNodeForTesting(JSGraph* graph, Node* node); | 33 static Node* ReduceIfNodeForTesting(JSGraph* graph, Node* node); |
35 }; | 34 }; |
36 } | 35 } |
37 } | 36 } |
38 } // namespace v8::internal::compiler | 37 } // namespace v8::internal::compiler |
39 | 38 |
40 #endif // V8_COMPILER_CONTROL_REDUCER_H_ | 39 #endif // V8_COMPILER_CONTROL_REDUCER_H_ |
OLD | NEW |