Line data Source code
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
3 : // found in the LICENSE file.
4 :
5 : #include <functional>
6 : #include <limits>
7 :
8 : #include "src/compiler/graph.h"
9 : #include "src/compiler/graph-reducer.h"
10 : #include "src/compiler/node.h"
11 : #include "src/compiler/node-properties.h"
12 : #include "src/compiler/verifier.h"
13 :
14 : namespace v8 {
15 : namespace internal {
16 : namespace compiler {
17 :
18 : enum class GraphReducer::State : uint8_t {
19 : kUnvisited,
20 : kRevisit,
21 : kOnStack,
22 : kVisited
23 : };
24 :
25 :
26 32859916 : void Reducer::Finalize() {}
27 :
28 5797091 : GraphReducer::GraphReducer(Zone* zone, Graph* graph, Node* dead)
29 : : graph_(graph),
30 : dead_(dead),
31 : state_(graph, 4),
32 : reducers_(zone),
33 : revisit_(zone),
34 11593509 : stack_(zone) {
35 5795669 : if (dead != nullptr) {
36 5314028 : NodeProperties::SetType(dead_, Type::None());
37 : }
38 5795669 : }
39 :
40 : GraphReducer::~GraphReducer() = default;
41 :
42 :
43 22241176 : void GraphReducer::AddReducer(Reducer* reducer) {
44 22241176 : reducers_.push_back(reducer);
45 22241247 : }
46 :
47 :
48 17477871 : void GraphReducer::ReduceNode(Node* node) {
49 : DCHECK(stack_.empty());
50 : DCHECK(revisit_.empty());
51 : Push(node);
52 : for (;;) {
53 942768717 : if (!stack_.empty()) {
54 : // Process the node on the top of the stack, potentially pushing more or
55 : // popping the node off the stack.
56 904729204 : ReduceTop();
57 38039513 : } else if (!revisit_.empty()) {
58 : // If the stack becomes empty, revisit any nodes in the revisit queue.
59 20505353 : Node* const node = revisit_.front();
60 : revisit_.pop();
61 20505225 : if (state_.Get(node) == State::kRevisit) {
62 : // state can change while in queue.
63 : Push(node);
64 : }
65 : } else {
66 : // Run all finalizers.
67 51889411 : for (Reducer* const reducer : reducers_) reducer->Finalize();
68 :
69 : // Check if we have new nodes to revisit.
70 17534168 : if (revisit_.empty()) break;
71 : }
72 : }
73 : DCHECK(revisit_.empty());
74 : DCHECK(stack_.empty());
75 17481692 : }
76 :
77 :
78 5777943 : void GraphReducer::ReduceGraph() { ReduceNode(graph()->end()); }
79 :
80 :
81 471265557 : Reduction GraphReducer::Reduce(Node* const node) {
82 : auto skip = reducers_.end();
83 2520041553 : for (auto i = reducers_.begin(); i != reducers_.end();) {
84 2056471332 : if (i != skip) {
85 1966714588 : Reduction reduction = (*i)->Reduce(node);
86 1966936113 : if (!reduction.Changed()) {
87 : // No change from this reducer.
88 97657093 : } else if (reduction.replacement() == node) {
89 : // {replacement} == {node} represents an in-place reduction. Rerun
90 : // all the other reducers for this node, as now there may be more
91 : // opportunities for reduction.
92 89740232 : if (FLAG_trace_turbo_reduction) {
93 0 : StdoutStream{} << "- In-place update of " << *node << " by reducer "
94 0 : << (*i)->reducer_name() << std::endl;
95 : }
96 : skip = i;
97 : i = reducers_.begin();
98 : continue;
99 : } else {
100 : // {node} was replaced by another node.
101 7916861 : if (FLAG_trace_turbo_reduction) {
102 0 : StdoutStream{} << "- Replacement of " << *node << " with "
103 0 : << *(reduction.replacement()) << " by reducer "
104 0 : << (*i)->reducer_name() << std::endl;
105 : }
106 7916861 : return reduction;
107 : }
108 : }
109 : ++i;
110 : }
111 463570221 : if (skip == reducers_.end()) {
112 : // No change from any reducer.
113 : return Reducer::NoChange();
114 : }
115 : // At least one reducer did some in-place reduction.
116 : return Reducer::Changed(node);
117 : }
118 :
119 :
120 905115984 : void GraphReducer::ReduceTop() {
121 : NodeState& entry = stack_.top();
122 905115984 : Node* node = entry.node;
123 : DCHECK_EQ(State::kOnStack, state_.Get(node));
124 :
125 905115984 : if (node->IsDead()) return Pop(); // Node was killed while on stack.
126 :
127 : Node::Inputs node_inputs = node->inputs();
128 :
129 : // Recurse on an input if necessary.
130 904538529 : int start = entry.input_index < node_inputs.count() ? entry.input_index : 0;
131 3096471831 : for (int i = start; i < node_inputs.count(); ++i) {
132 : Node* input = node_inputs[i];
133 1528853130 : if (input != node && Recurse(input)) {
134 433128141 : entry.input_index = i + 1;
135 433128141 : return;
136 : }
137 : }
138 1339931220 : for (int i = 0; i < start; ++i) {
139 : Node* input = node_inputs[i];
140 434331202 : if (input != node && Recurse(input)) {
141 149184 : entry.input_index = i + 1;
142 149184 : return;
143 : }
144 : }
145 :
146 : // Remember the max node id before reduction.
147 471460433 : NodeId const max_id = static_cast<NodeId>(graph()->NodeCount() - 1);
148 :
149 : // All inputs should be visited or on stack. Apply reductions to node.
150 471460433 : Reduction reduction = Reduce(node);
151 :
152 : // If there was no reduction, pop {node} and continue.
153 471474903 : if (!reduction.Changed()) return Pop();
154 :
155 : // Check if the reduction is an in-place update of the {node}.
156 : Node* const replacement = reduction.replacement();
157 81967296 : if (replacement == node) {
158 : // In-place update of {node}, may need to recurse on an input.
159 : Node::Inputs node_inputs = node->inputs();
160 573969437 : for (int i = 0; i < node_inputs.count(); ++i) {
161 : Node* input = node_inputs[i];
162 253021096 : if (input != node && Recurse(input)) {
163 3063460 : entry.input_index = i + 1;
164 : return;
165 : }
166 : }
167 : }
168 :
169 : // After reducing the node, pop it off the stack.
170 78903621 : Pop();
171 :
172 : // Check if we have a new replacement.
173 78907209 : if (replacement != node) {
174 7916784 : Replace(node, replacement, max_id);
175 : } else {
176 : // Revisit all uses of the node.
177 320587214 : for (Node* const user : node->uses()) {
178 : // Don't revisit this node if it refers to itself.
179 249596064 : if (user != node) Revisit(user);
180 : }
181 : }
182 : }
183 :
184 :
185 1604711 : void GraphReducer::Replace(Node* node, Node* replacement) {
186 1637743 : Replace(node, replacement, std::numeric_limits<NodeId>::max());
187 1604714 : }
188 :
189 :
190 9554619 : void GraphReducer::Replace(Node* node, Node* replacement, NodeId max_id) {
191 9554619 : if (node == graph()->start()) graph()->SetStart(replacement);
192 9554619 : if (node == graph()->end()) graph()->SetEnd(replacement);
193 9554619 : if (replacement->id() <= max_id) {
194 : // {replacement} is an old node, so unlink {node} and assume that
195 : // {replacement} was already reduced and finish.
196 36647295 : for (Edge edge : node->use_edges()) {
197 : Node* const user = edge.from();
198 : Verifier::VerifyEdgeInputReplacement(edge, replacement);
199 14152754 : edge.UpdateTo(replacement);
200 : // Don't revisit this node if it refers to itself.
201 14152788 : if (user != node) Revisit(user);
202 : }
203 8341787 : node->Kill();
204 : } else {
205 : // Replace all old uses of {node} with {replacement}, but allow new nodes
206 : // created by this reduction to use {node}.
207 14134293 : for (Edge edge : node->use_edges()) {
208 : Node* const user = edge.from();
209 6460725 : if (user->id() <= max_id) {
210 6460656 : edge.UpdateTo(replacement);
211 : // Don't revisit this node if it refers to itself.
212 6460659 : if (user != node) Revisit(user);
213 : }
214 : }
215 : // Unlink {node} if it's no longer used.
216 1212843 : if (node->uses().empty()) node->Kill();
217 :
218 : // If there was a replacement, reduce it after popping {node}.
219 1212836 : Recurse(replacement);
220 : }
221 9554606 : }
222 :
223 :
224 2203717 : void GraphReducer::ReplaceWithValue(Node* node, Node* value, Node* effect,
225 : Node* control) {
226 3537326 : if (effect == nullptr && node->op()->EffectInputCount() > 0) {
227 1110292 : effect = NodeProperties::GetEffectInput(node);
228 : }
229 3901991 : if (control == nullptr && node->op()->ControlInputCount() > 0) {
230 1503221 : control = NodeProperties::GetControlInput(node);
231 : }
232 :
233 : // Requires distinguishing between value, effect and control edges.
234 21229757 : for (Edge edge : node->use_edges()) {
235 : Node* const user = edge.from();
236 : DCHECK(!user->IsDead());
237 9513073 : if (NodeProperties::IsControlEdge(edge)) {
238 2812626 : if (user->opcode() == IrOpcode::kIfSuccess) {
239 : Replace(user, control);
240 2779594 : } else if (user->opcode() == IrOpcode::kIfException) {
241 : DCHECK_NOT_NULL(dead_);
242 32622 : edge.UpdateTo(dead_);
243 32622 : Revisit(user);
244 : } else {
245 : DCHECK_NOT_NULL(control);
246 2746972 : edge.UpdateTo(control);
247 2746972 : Revisit(user);
248 : }
249 6700455 : } else if (NodeProperties::IsEffectEdge(edge)) {
250 : DCHECK_NOT_NULL(effect);
251 2286932 : edge.UpdateTo(effect);
252 2286960 : Revisit(user);
253 : } else {
254 : DCHECK_NOT_NULL(value);
255 4413926 : edge.UpdateTo(value);
256 4413953 : Revisit(user);
257 : }
258 : }
259 2203611 : }
260 :
261 :
262 468849680 : void GraphReducer::Pop() {
263 468849680 : Node* node = stack_.top().node;
264 : state_.Set(node, State::kVisited);
265 : stack_.pop();
266 468831385 : }
267 :
268 :
269 0 : void GraphReducer::Push(Node* const node) {
270 : DCHECK_NE(State::kOnStack, state_.Get(node));
271 : state_.Set(node, State::kOnStack);
272 938304099 : stack_.push({node, 0});
273 0 : }
274 :
275 :
276 2215312259 : bool GraphReducer::Recurse(Node* node) {
277 2215312259 : if (state_.Get(node) > State::kRevisit) return false;
278 : Push(node);
279 437563314 : return true;
280 : }
281 :
282 :
283 280168563 : void GraphReducer::Revisit(Node* node) {
284 560337126 : if (state_.Get(node) == State::kVisited) {
285 : state_.Set(node, State::kRevisit);
286 : revisit_.push(node);
287 : }
288 280168496 : }
289 :
290 : } // namespace compiler
291 : } // namespace internal
292 122036 : } // namespace v8
|
