OLD | NEW |
1 // Copyright 2016 the V8 project authors. All rights reserved. | 1 // Copyright 2016 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 #include "src/compiler/simd-scalar-lowering.h" | 5 #include "src/compiler/simd-scalar-lowering.h" |
6 #include "src/compiler/diamond.h" | 6 #include "src/compiler/diamond.h" |
7 #include "src/compiler/linkage.h" | 7 #include "src/compiler/linkage.h" |
8 #include "src/compiler/node-matchers.h" | 8 #include "src/compiler/node-matchers.h" |
9 #include "src/compiler/node-properties.h" | 9 #include "src/compiler/node-properties.h" |
10 | 10 |
(...skipping 19 matching lines...) Expand all Loading... |
30 placeholder_( | 30 placeholder_( |
31 graph->NewNode(common->Parameter(-2, "placeholder"), graph->start())), | 31 graph->NewNode(common->Parameter(-2, "placeholder"), graph->start())), |
32 parameter_count_after_lowering_(-1) { | 32 parameter_count_after_lowering_(-1) { |
33 DCHECK_NOT_NULL(graph); | 33 DCHECK_NOT_NULL(graph); |
34 DCHECK_NOT_NULL(graph->end()); | 34 DCHECK_NOT_NULL(graph->end()); |
35 replacements_ = zone->NewArray<Replacement>(graph->NodeCount()); | 35 replacements_ = zone->NewArray<Replacement>(graph->NodeCount()); |
36 memset(replacements_, 0, sizeof(Replacement) * graph->NodeCount()); | 36 memset(replacements_, 0, sizeof(Replacement) * graph->NodeCount()); |
37 } | 37 } |
38 | 38 |
39 void SimdScalarLowering::LowerGraph() { | 39 void SimdScalarLowering::LowerGraph() { |
| 40 if (!IsScalarLoweringEnabled()) return; |
40 stack_.push_back({graph()->end(), 0}); | 41 stack_.push_back({graph()->end(), 0}); |
41 state_.Set(graph()->end(), State::kOnStack); | 42 state_.Set(graph()->end(), State::kOnStack); |
42 replacements_[graph()->end()->id()].type = SimdType::kInt32; | 43 replacements_[graph()->end()->id()].type = SimdType::kInt32; |
43 | 44 |
44 while (!stack_.empty()) { | 45 while (!stack_.empty()) { |
45 NodeState& top = stack_.back(); | 46 NodeState& top = stack_.back(); |
46 if (top.input_index == top.node->InputCount()) { | 47 if (top.input_index == top.node->InputCount()) { |
47 // All inputs of top have already been lowered, now lower top. | 48 // All inputs of top have already been lowered, now lower top. |
48 stack_.pop_back(); | 49 stack_.pop_back(); |
49 state_.Set(top.node, State::kVisited); | 50 state_.Set(top.node, State::kVisited); |
(...skipping 351 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
401 } else { | 402 } else { |
402 UNREACHABLE(); | 403 UNREACHABLE(); |
403 } | 404 } |
404 } | 405 } |
405 ReplaceNode(phi, rep_nodes); | 406 ReplaceNode(phi, rep_nodes); |
406 } | 407 } |
407 } | 408 } |
408 } // namespace compiler | 409 } // namespace compiler |
409 } // namespace internal | 410 } // namespace internal |
410 } // namespace v8 | 411 } // namespace v8 |
OLD | NEW |