| 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 1020 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1031 case IrOpcode::kFloat64LessThan: | 1031 case IrOpcode::kFloat64LessThan: |
| 1032 case IrOpcode::kFloat64LessThanOrEqual: | 1032 case IrOpcode::kFloat64LessThanOrEqual: |
| 1033 return VisitFloat64Cmp(node); | 1033 return VisitFloat64Cmp(node); |
| 1034 case IrOpcode::kFloat64ExtractLowWord32: | 1034 case IrOpcode::kFloat64ExtractLowWord32: |
| 1035 case IrOpcode::kFloat64ExtractHighWord32: | 1035 case IrOpcode::kFloat64ExtractHighWord32: |
| 1036 return VisitUnop(node, kMachFloat64, kMachInt32); | 1036 return VisitUnop(node, kMachFloat64, kMachInt32); |
| 1037 case IrOpcode::kFloat64InsertLowWord32: | 1037 case IrOpcode::kFloat64InsertLowWord32: |
| 1038 case IrOpcode::kFloat64InsertHighWord32: | 1038 case IrOpcode::kFloat64InsertHighWord32: |
| 1039 return VisitBinop(node, kMachFloat64, kMachInt32, kMachFloat64); | 1039 return VisitBinop(node, kMachFloat64, kMachInt32, kMachFloat64); |
| 1040 case IrOpcode::kLoadStackPointer: | 1040 case IrOpcode::kLoadStackPointer: |
| 1041 case IrOpcode::kLoadFramePointer: |
| 1041 return VisitLeaf(node, kMachPtr); | 1042 return VisitLeaf(node, kMachPtr); |
| 1042 case IrOpcode::kStateValues: | 1043 case IrOpcode::kStateValues: |
| 1043 VisitStateValues(node); | 1044 VisitStateValues(node); |
| 1044 break; | 1045 break; |
| 1045 default: | 1046 default: |
| 1046 VisitInputs(node); | 1047 VisitInputs(node); |
| 1047 break; | 1048 break; |
| 1048 } | 1049 } |
| 1049 } | 1050 } |
| 1050 | 1051 |
| (...skipping 540 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1591 | 1592 |
| 1592 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { | 1593 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { |
| 1593 node->set_op(machine()->IntLessThanOrEqual()); | 1594 node->set_op(machine()->IntLessThanOrEqual()); |
| 1594 node->ReplaceInput(0, StringComparison(node, true)); | 1595 node->ReplaceInput(0, StringComparison(node, true)); |
| 1595 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); | 1596 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); |
| 1596 } | 1597 } |
| 1597 | 1598 |
| 1598 } // namespace compiler | 1599 } // namespace compiler |
| 1599 } // namespace internal | 1600 } // namespace internal |
| 1600 } // namespace v8 | 1601 } // namespace v8 |
| OLD | NEW |