| 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 1012 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1023 return VisitUnop(node, kTypeUint32 | kRepFloat64, | 1023 return VisitUnop(node, kTypeUint32 | kRepFloat64, |
| 1024 kTypeUint32 | kRepWord32); | 1024 kTypeUint32 | kRepWord32); |
| 1025 | 1025 |
| 1026 case IrOpcode::kFloat64Add: | 1026 case IrOpcode::kFloat64Add: |
| 1027 case IrOpcode::kFloat64Sub: | 1027 case IrOpcode::kFloat64Sub: |
| 1028 case IrOpcode::kFloat64Mul: | 1028 case IrOpcode::kFloat64Mul: |
| 1029 case IrOpcode::kFloat64Div: | 1029 case IrOpcode::kFloat64Div: |
| 1030 case IrOpcode::kFloat64Mod: | 1030 case IrOpcode::kFloat64Mod: |
| 1031 return VisitFloat64Binop(node); | 1031 return VisitFloat64Binop(node); |
| 1032 case IrOpcode::kFloat64Sqrt: | 1032 case IrOpcode::kFloat64Sqrt: |
| 1033 case IrOpcode::kFloat64Floor: | 1033 case IrOpcode::kFloat64RoundDown: |
| 1034 case IrOpcode::kFloat64Ceil: | |
| 1035 case IrOpcode::kFloat64RoundTruncate: | 1034 case IrOpcode::kFloat64RoundTruncate: |
| 1036 case IrOpcode::kFloat64RoundTiesAway: | 1035 case IrOpcode::kFloat64RoundTiesAway: |
| 1037 return VisitUnop(node, kMachFloat64, kMachFloat64); | 1036 return VisitUnop(node, kMachFloat64, kMachFloat64); |
| 1038 case IrOpcode::kFloat64Equal: | 1037 case IrOpcode::kFloat64Equal: |
| 1039 case IrOpcode::kFloat64LessThan: | 1038 case IrOpcode::kFloat64LessThan: |
| 1040 case IrOpcode::kFloat64LessThanOrEqual: | 1039 case IrOpcode::kFloat64LessThanOrEqual: |
| 1041 return VisitFloat64Cmp(node); | 1040 return VisitFloat64Cmp(node); |
| 1042 case IrOpcode::kFloat64ExtractLowWord32: | 1041 case IrOpcode::kFloat64ExtractLowWord32: |
| 1043 case IrOpcode::kFloat64ExtractHighWord32: | 1042 case IrOpcode::kFloat64ExtractHighWord32: |
| 1044 return VisitUnop(node, kMachFloat64, kMachInt32); | 1043 return VisitUnop(node, kMachFloat64, kMachInt32); |
| (...skipping 559 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1604 | 1603 |
| 1605 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { | 1604 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { |
| 1606 node->set_op(machine()->IntLessThanOrEqual()); | 1605 node->set_op(machine()->IntLessThanOrEqual()); |
| 1607 node->ReplaceInput(0, StringComparison(node, true)); | 1606 node->ReplaceInput(0, StringComparison(node, true)); |
| 1608 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); | 1607 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); |
| 1609 } | 1608 } |
| 1610 | 1609 |
| 1611 } // namespace compiler | 1610 } // namespace compiler |
| 1612 } // namespace internal | 1611 } // namespace internal |
| 1613 } // namespace v8 | 1612 } // namespace v8 |
| OLD | NEW |