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/base/adapters.h" | 5 #include "src/base/adapters.h" |
6 #include "src/compiler/instruction-selector-impl.h" | 6 #include "src/compiler/instruction-selector-impl.h" |
7 #include "src/compiler/node-matchers.h" | 7 #include "src/compiler/node-matchers.h" |
8 #include "src/compiler/node-properties.h" | 8 #include "src/compiler/node-properties.h" |
9 | 9 |
10 namespace v8 { | 10 namespace v8 { |
(...skipping 1311 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
1322 FlagsContinuation cont = | 1322 FlagsContinuation cont = |
1323 FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node); | 1323 FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node); |
1324 VisitWordCompare(this, node, &cont); | 1324 VisitWordCompare(this, node, &cont); |
1325 } | 1325 } |
1326 | 1326 |
1327 | 1327 |
1328 void InstructionSelector::VisitInt32AddWithOverflow(Node* node) { | 1328 void InstructionSelector::VisitInt32AddWithOverflow(Node* node) { |
1329 if (Node* ovf = NodeProperties::FindProjection(node, 1)) { | 1329 if (Node* ovf = NodeProperties::FindProjection(node, 1)) { |
1330 FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf); | 1330 FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf); |
1331 return VisitBinop(this, node, kIA32Add, &cont); | 1331 return VisitBinop(this, node, kIA32Add, &cont); |
1332 } else { | |
Benedikt Meurer
2016/03/03 17:48:08
This doesn't seem to be necessary, since there's a
Mircea Trofin
2016/03/03 21:50:13
Ugh... true. Haven't noticed the return.
| |
1333 FlagsContinuation cont; | |
1334 VisitBinop(this, node, kIA32Add, &cont); | |
1332 } | 1335 } |
1333 FlagsContinuation cont; | |
1334 VisitBinop(this, node, kIA32Add, &cont); | |
1335 } | 1336 } |
1336 | 1337 |
1337 | 1338 |
1338 void InstructionSelector::VisitInt32SubWithOverflow(Node* node) { | 1339 void InstructionSelector::VisitInt32SubWithOverflow(Node* node) { |
1339 if (Node* ovf = NodeProperties::FindProjection(node, 1)) { | 1340 if (Node* ovf = NodeProperties::FindProjection(node, 1)) { |
1340 FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf); | 1341 FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf); |
1341 return VisitBinop(this, node, kIA32Sub, &cont); | 1342 return VisitBinop(this, node, kIA32Sub, &cont); |
1342 } | 1343 } |
1343 FlagsContinuation cont; | 1344 FlagsContinuation cont; |
1344 VisitBinop(this, node, kIA32Sub, &cont); | 1345 VisitBinop(this, node, kIA32Sub, &cont); |
(...skipping 99 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
1444 MachineOperatorBuilder::kFloat64RoundTruncate | | 1445 MachineOperatorBuilder::kFloat64RoundTruncate | |
1445 MachineOperatorBuilder::kFloat32RoundTiesEven | | 1446 MachineOperatorBuilder::kFloat32RoundTiesEven | |
1446 MachineOperatorBuilder::kFloat64RoundTiesEven; | 1447 MachineOperatorBuilder::kFloat64RoundTiesEven; |
1447 } | 1448 } |
1448 return flags; | 1449 return flags; |
1449 } | 1450 } |
1450 | 1451 |
1451 } // namespace compiler | 1452 } // namespace compiler |
1452 } // namespace internal | 1453 } // namespace internal |
1453 } // namespace v8 | 1454 } // namespace v8 |
OLD | NEW |