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 835 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
846 return VisitUnop(node, kTypeUint32 | kRepFloat64, | 846 return VisitUnop(node, kTypeUint32 | kRepFloat64, |
847 kTypeUint32 | kRepWord32); | 847 kTypeUint32 | kRepWord32); |
848 | 848 |
849 case IrOpcode::kFloat64Add: | 849 case IrOpcode::kFloat64Add: |
850 case IrOpcode::kFloat64Sub: | 850 case IrOpcode::kFloat64Sub: |
851 case IrOpcode::kFloat64Mul: | 851 case IrOpcode::kFloat64Mul: |
852 case IrOpcode::kFloat64Div: | 852 case IrOpcode::kFloat64Div: |
853 case IrOpcode::kFloat64Mod: | 853 case IrOpcode::kFloat64Mod: |
854 return VisitFloat64Binop(node); | 854 return VisitFloat64Binop(node); |
855 case IrOpcode::kFloat64Sqrt: | 855 case IrOpcode::kFloat64Sqrt: |
| 856 case IrOpcode::kFloat64Floor: |
| 857 case IrOpcode::kFloat64Ceil: |
| 858 case IrOpcode::kFloat64RoundAwayFromZero: |
| 859 case IrOpcode::kFloat64RoundToZero: |
856 return VisitUnop(node, kMachFloat64, kMachFloat64); | 860 return VisitUnop(node, kMachFloat64, kMachFloat64); |
857 case IrOpcode::kFloat64Equal: | 861 case IrOpcode::kFloat64Equal: |
858 case IrOpcode::kFloat64LessThan: | 862 case IrOpcode::kFloat64LessThan: |
859 case IrOpcode::kFloat64LessThanOrEqual: | 863 case IrOpcode::kFloat64LessThanOrEqual: |
860 return VisitFloat64Cmp(node); | 864 return VisitFloat64Cmp(node); |
861 case IrOpcode::kLoadStackPointer: | 865 case IrOpcode::kLoadStackPointer: |
862 return VisitLeaf(node, kMachPtr); | 866 return VisitLeaf(node, kMachPtr); |
863 case IrOpcode::kStateValues: | 867 case IrOpcode::kStateValues: |
864 for (int i = 0; i < node->InputCount(); i++) { | 868 for (int i = 0; i < node->InputCount(); i++) { |
865 ProcessInput(node, i, kTypeAny); | 869 ProcessInput(node, i, kTypeAny); |
(...skipping 302 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1168 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { | 1172 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { |
1169 node->set_op(machine()->IntLessThanOrEqual()); | 1173 node->set_op(machine()->IntLessThanOrEqual()); |
1170 node->ReplaceInput(0, StringComparison(node, true)); | 1174 node->ReplaceInput(0, StringComparison(node, true)); |
1171 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); | 1175 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); |
1172 } | 1176 } |
1173 | 1177 |
1174 | 1178 |
1175 } // namespace compiler | 1179 } // namespace compiler |
1176 } // namespace internal | 1180 } // namespace internal |
1177 } // namespace v8 | 1181 } // namespace v8 |
OLD | NEW |