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 #include "src/compiler/simplified-lowering.h" | 5 #include "src/compiler/simplified-lowering.h" |
6 | 6 |
7 #include <limits> | 7 #include <limits> |
8 | 8 |
9 #include "src/base/bits.h" | 9 #include "src/base/bits.h" |
10 #include "src/code-factory.h" | 10 #include "src/code-factory.h" |
(...skipping 1252 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1263 vfalse = | 1263 vfalse = |
1264 jsgraph()->Float32Constant(std::numeric_limits<float>::quiet_NaN()); | 1264 jsgraph()->Float32Constant(std::numeric_limits<float>::quiet_NaN()); |
1265 } else { | 1265 } else { |
1266 vfalse = jsgraph()->Int32Constant(0); | 1266 vfalse = jsgraph()->Int32Constant(0); |
1267 } | 1267 } |
1268 | 1268 |
1269 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); | 1269 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); |
1270 Node* ephi = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, merge); | 1270 Node* ephi = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, merge); |
1271 | 1271 |
1272 // Replace effect uses of {node} with the {ephi}. | 1272 // Replace effect uses of {node} with the {ephi}. |
1273 NodeProperties::ReplaceWithValue(node, node, ephi); | 1273 NodeProperties::ReplaceUses(node, node, ephi); |
1274 | 1274 |
1275 // Turn the {node} into a Phi. | 1275 // Turn the {node} into a Phi. |
1276 node->set_op(common()->Phi(output_type, 2)); | 1276 node->set_op(common()->Phi(output_type, 2)); |
1277 node->ReplaceInput(0, vtrue); | 1277 node->ReplaceInput(0, vtrue); |
1278 node->ReplaceInput(1, vfalse); | 1278 node->ReplaceInput(1, vfalse); |
1279 node->ReplaceInput(2, merge); | 1279 node->ReplaceInput(2, merge); |
1280 node->TrimInputCount(3); | 1280 node->TrimInputCount(3); |
1281 } else { | 1281 } else { |
1282 node->set_op(machine()->CheckedLoad(type)); | 1282 node->set_op(machine()->CheckedLoad(type)); |
1283 } | 1283 } |
(...skipping 308 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1592 | 1592 |
1593 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { | 1593 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { |
1594 node->set_op(machine()->IntLessThanOrEqual()); | 1594 node->set_op(machine()->IntLessThanOrEqual()); |
1595 node->ReplaceInput(0, StringComparison(node, true)); | 1595 node->ReplaceInput(0, StringComparison(node, true)); |
1596 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); | 1596 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); |
1597 } | 1597 } |
1598 | 1598 |
1599 } // namespace compiler | 1599 } // namespace compiler |
1600 } // namespace internal | 1600 } // namespace internal |
1601 } // namespace v8 | 1601 } // namespace v8 |
OLD | NEW |