| 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 1001 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
| 1012         return VisitUnop(node, kTypeUint32 | kRepFloat64, | 1012         return VisitUnop(node, kTypeUint32 | kRepFloat64, | 
| 1013                          kTypeUint32 | kRepWord32); | 1013                          kTypeUint32 | kRepWord32); | 
| 1014 | 1014 | 
| 1015       case IrOpcode::kFloat64Add: | 1015       case IrOpcode::kFloat64Add: | 
| 1016       case IrOpcode::kFloat64Sub: | 1016       case IrOpcode::kFloat64Sub: | 
| 1017       case IrOpcode::kFloat64Mul: | 1017       case IrOpcode::kFloat64Mul: | 
| 1018       case IrOpcode::kFloat64Div: | 1018       case IrOpcode::kFloat64Div: | 
| 1019       case IrOpcode::kFloat64Mod: | 1019       case IrOpcode::kFloat64Mod: | 
| 1020       case IrOpcode::kFloat64Min: | 1020       case IrOpcode::kFloat64Min: | 
| 1021         return VisitFloat64Binop(node); | 1021         return VisitFloat64Binop(node); | 
|  | 1022       case IrOpcode::kFloat64Abs: | 
| 1022       case IrOpcode::kFloat64Sqrt: | 1023       case IrOpcode::kFloat64Sqrt: | 
| 1023       case IrOpcode::kFloat64RoundDown: | 1024       case IrOpcode::kFloat64RoundDown: | 
| 1024       case IrOpcode::kFloat64RoundTruncate: | 1025       case IrOpcode::kFloat64RoundTruncate: | 
| 1025       case IrOpcode::kFloat64RoundTiesAway: | 1026       case IrOpcode::kFloat64RoundTiesAway: | 
| 1026         return VisitUnop(node, kMachFloat64, kMachFloat64); | 1027         return VisitUnop(node, kMachFloat64, kMachFloat64); | 
| 1027       case IrOpcode::kFloat64Equal: | 1028       case IrOpcode::kFloat64Equal: | 
| 1028       case IrOpcode::kFloat64LessThan: | 1029       case IrOpcode::kFloat64LessThan: | 
| 1029       case IrOpcode::kFloat64LessThanOrEqual: | 1030       case IrOpcode::kFloat64LessThanOrEqual: | 
| 1030         return VisitFloat64Cmp(node); | 1031         return VisitFloat64Cmp(node); | 
| 1031       case IrOpcode::kFloat64ExtractLowWord32: | 1032       case IrOpcode::kFloat64ExtractLowWord32: | 
| (...skipping 557 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
| 1589 | 1590 | 
| 1590 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { | 1591 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { | 
| 1591   node->set_op(machine()->IntLessThanOrEqual()); | 1592   node->set_op(machine()->IntLessThanOrEqual()); | 
| 1592   node->ReplaceInput(0, StringComparison(node, true)); | 1593   node->ReplaceInput(0, StringComparison(node, true)); | 
| 1593   node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); | 1594   node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); | 
| 1594 } | 1595 } | 
| 1595 | 1596 | 
| 1596 }  // namespace compiler | 1597 }  // namespace compiler | 
| 1597 }  // namespace internal | 1598 }  // namespace internal | 
| 1598 }  // namespace v8 | 1599 }  // namespace v8 | 
| OLD | NEW | 
|---|