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 "src/base/bits.h" | 7 #include "src/base/bits.h" |
8 #include "src/code-factory.h" | 8 #include "src/code-factory.h" |
9 #include "src/compiler/common-operator.h" | 9 #include "src/compiler/common-operator.h" |
10 #include "src/compiler/graph-inl.h" | 10 #include "src/compiler/graph-inl.h" |
(...skipping 704 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
715 case IrOpcode::kChangeFloat64ToUint32: | 715 case IrOpcode::kChangeFloat64ToUint32: |
716 return VisitUnop(node, kTypeUint32 | kRepFloat64, | 716 return VisitUnop(node, kTypeUint32 | kRepFloat64, |
717 kTypeUint32 | kRepWord32); | 717 kTypeUint32 | kRepWord32); |
718 | 718 |
719 case IrOpcode::kFloat64Add: | 719 case IrOpcode::kFloat64Add: |
720 case IrOpcode::kFloat64Sub: | 720 case IrOpcode::kFloat64Sub: |
721 case IrOpcode::kFloat64Mul: | 721 case IrOpcode::kFloat64Mul: |
722 case IrOpcode::kFloat64Div: | 722 case IrOpcode::kFloat64Div: |
723 case IrOpcode::kFloat64Mod: | 723 case IrOpcode::kFloat64Mod: |
724 return VisitFloat64Binop(node); | 724 return VisitFloat64Binop(node); |
| 725 case IrOpcode::kFloat64Sqrt: |
| 726 return VisitUnop(node, kMachFloat64, kMachFloat64); |
725 case IrOpcode::kFloat64Equal: | 727 case IrOpcode::kFloat64Equal: |
726 case IrOpcode::kFloat64LessThan: | 728 case IrOpcode::kFloat64LessThan: |
727 case IrOpcode::kFloat64LessThanOrEqual: | 729 case IrOpcode::kFloat64LessThanOrEqual: |
728 return VisitFloat64Cmp(node); | 730 return VisitFloat64Cmp(node); |
729 default: | 731 default: |
730 VisitInputs(node); | 732 VisitInputs(node); |
731 break; | 733 break; |
732 } | 734 } |
733 } | 735 } |
734 | 736 |
(...skipping 195 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
930 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { | 932 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { |
931 node->set_op(machine()->IntLessThanOrEqual()); | 933 node->set_op(machine()->IntLessThanOrEqual()); |
932 node->ReplaceInput(0, StringComparison(node, true)); | 934 node->ReplaceInput(0, StringComparison(node, true)); |
933 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); | 935 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); |
934 } | 936 } |
935 | 937 |
936 | 938 |
937 } // namespace compiler | 939 } // namespace compiler |
938 } // namespace internal | 940 } // namespace internal |
939 } // namespace v8 | 941 } // namespace v8 |
OLD | NEW |