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 897 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
908 return VisitUnop(node, kTypeUint32 | kRepFloat64, | 908 return VisitUnop(node, kTypeUint32 | kRepFloat64, |
909 kTypeUint32 | kRepWord32); | 909 kTypeUint32 | kRepWord32); |
910 | 910 |
911 case IrOpcode::kFloat64Add: | 911 case IrOpcode::kFloat64Add: |
912 case IrOpcode::kFloat64Sub: | 912 case IrOpcode::kFloat64Sub: |
913 case IrOpcode::kFloat64Mul: | 913 case IrOpcode::kFloat64Mul: |
914 case IrOpcode::kFloat64Div: | 914 case IrOpcode::kFloat64Div: |
915 case IrOpcode::kFloat64Mod: | 915 case IrOpcode::kFloat64Mod: |
916 return VisitFloat64Binop(node); | 916 return VisitFloat64Binop(node); |
917 case IrOpcode::kFloat64Sqrt: | 917 case IrOpcode::kFloat64Sqrt: |
| 918 case IrOpcode::kFloat64Floor: |
| 919 case IrOpcode::kFloat64Ceil: |
| 920 case IrOpcode::kFloat64RoundTruncate: |
| 921 case IrOpcode::kFloat64RoundTiesAway: |
918 return VisitUnop(node, kMachFloat64, kMachFloat64); | 922 return VisitUnop(node, kMachFloat64, kMachFloat64); |
919 case IrOpcode::kFloat64Equal: | 923 case IrOpcode::kFloat64Equal: |
920 case IrOpcode::kFloat64LessThan: | 924 case IrOpcode::kFloat64LessThan: |
921 case IrOpcode::kFloat64LessThanOrEqual: | 925 case IrOpcode::kFloat64LessThanOrEqual: |
922 return VisitFloat64Cmp(node); | 926 return VisitFloat64Cmp(node); |
923 case IrOpcode::kLoadStackPointer: | 927 case IrOpcode::kLoadStackPointer: |
924 return VisitLeaf(node, kMachPtr); | 928 return VisitLeaf(node, kMachPtr); |
925 case IrOpcode::kStateValues: | 929 case IrOpcode::kStateValues: |
926 for (int i = 0; i < node->InputCount(); i++) { | 930 for (int i = 0; i < node->InputCount(); i++) { |
927 ProcessInput(node, i, kTypeAny); | 931 ProcessInput(node, i, kTypeAny); |
(...skipping 303 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1231 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { | 1235 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { |
1232 node->set_op(machine()->IntLessThanOrEqual()); | 1236 node->set_op(machine()->IntLessThanOrEqual()); |
1233 node->ReplaceInput(0, StringComparison(node, true)); | 1237 node->ReplaceInput(0, StringComparison(node, true)); |
1234 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); | 1238 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); |
1235 } | 1239 } |
1236 | 1240 |
1237 | 1241 |
1238 } // namespace compiler | 1242 } // namespace compiler |
1239 } // namespace internal | 1243 } // namespace internal |
1240 } // namespace v8 | 1244 } // namespace v8 |
OLD | NEW |