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_GRAPH_REDUCER_H_ | 5 #ifndef V8_COMPILER_GRAPH_REDUCER_H_ |
6 #define V8_COMPILER_GRAPH_REDUCER_H_ | 6 #define V8_COMPILER_GRAPH_REDUCER_H_ |
7 | 7 |
8 #include "src/zone-containers.h" | 8 #include "src/zone-containers.h" |
9 | 9 |
10 namespace v8 { | 10 namespace v8 { |
(...skipping 37 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
48 static Reduction Changed(Node* node) { return Reduction(node); } | 48 static Reduction Changed(Node* node) { return Reduction(node); } |
49 | 49 |
50 private: | 50 private: |
51 DISALLOW_COPY_AND_ASSIGN(Reducer); | 51 DISALLOW_COPY_AND_ASSIGN(Reducer); |
52 }; | 52 }; |
53 | 53 |
54 | 54 |
55 // Performs an iterative reduction of a node graph. | 55 // Performs an iterative reduction of a node graph. |
56 class GraphReducer FINAL { | 56 class GraphReducer FINAL { |
57 public: | 57 public: |
58 GraphReducer(Graph* graph, Zone* zone); | 58 explicit GraphReducer(Graph* graph); |
59 | 59 |
60 Graph* graph() const { return graph_; } | 60 Graph* graph() const { return graph_; } |
61 | 61 |
62 void AddReducer(Reducer* reducer); | 62 void AddReducer(Reducer* reducer) { reducers_.push_back(reducer); } |
63 | 63 |
64 // Reduce a single node. | 64 // Reduce a single node. |
65 void ReduceNode(Node* const); | 65 void ReduceNode(Node* node); |
66 // Reduce the whole graph. | 66 // Reduce the whole graph. |
67 void ReduceGraph(); | 67 void ReduceGraph(); |
68 | 68 |
69 private: | 69 private: |
70 enum class State : uint8_t; | |
71 | |
72 // Reduce a single node. | |
73 Reduction Reduce(Node* const); | |
74 // Reduce the node on top of the stack. | |
75 void ReduceTop(); | |
76 | |
77 // Node stack operations. | |
78 void Pop(); | |
79 void Push(Node* const); | |
80 Node* Top() const; | |
81 | |
82 // Revisit queue operations. | |
83 bool Recurse(Node* const); | |
84 void Revisit(Node* const); | |
85 | |
86 Graph* graph_; | 70 Graph* graph_; |
87 ZoneVector<Reducer*> reducers_; | 71 ZoneVector<Reducer*> reducers_; |
88 ZoneStack<Node*> revisit_; | |
89 ZoneStack<Node*> stack_; | |
90 ZoneDeque<State> state_; | |
91 | 72 |
92 DISALLOW_COPY_AND_ASSIGN(GraphReducer); | 73 DISALLOW_COPY_AND_ASSIGN(GraphReducer); |
93 }; | 74 }; |
94 | 75 |
95 } // namespace compiler | 76 } // namespace compiler |
96 } // namespace internal | 77 } // namespace internal |
97 } // namespace v8 | 78 } // namespace v8 |
98 | 79 |
99 #endif // V8_COMPILER_GRAPH_REDUCER_H_ | 80 #endif // V8_COMPILER_GRAPH_REDUCER_H_ |
OLD | NEW |