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 839 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
850 // We use signed int32 as the output type for these word32 operations, | 850 // We use signed int32 as the output type for these word32 operations, |
851 // though the machine bits are the same for either signed or unsigned, | 851 // though the machine bits are the same for either signed or unsigned, |
852 // because JavaScript considers the result from these operations signed. | 852 // because JavaScript considers the result from these operations signed. |
853 return VisitBinop(node, kRepWord32, kRepWord32 | kTypeInt32); | 853 return VisitBinop(node, kRepWord32, kRepWord32 | kTypeInt32); |
854 case IrOpcode::kWord32Equal: | 854 case IrOpcode::kWord32Equal: |
855 return VisitBinop(node, kRepWord32, kRepBit); | 855 return VisitBinop(node, kRepWord32, kRepBit); |
856 | 856 |
857 case IrOpcode::kInt32Add: | 857 case IrOpcode::kInt32Add: |
858 case IrOpcode::kInt32Sub: | 858 case IrOpcode::kInt32Sub: |
859 case IrOpcode::kInt32Mul: | 859 case IrOpcode::kInt32Mul: |
| 860 case IrOpcode::kInt32MulHigh: |
860 case IrOpcode::kInt32Div: | 861 case IrOpcode::kInt32Div: |
861 case IrOpcode::kInt32Mod: | 862 case IrOpcode::kInt32Mod: |
862 return VisitInt32Binop(node); | 863 return VisitInt32Binop(node); |
863 case IrOpcode::kUint32Div: | 864 case IrOpcode::kUint32Div: |
864 case IrOpcode::kUint32Mod: | 865 case IrOpcode::kUint32Mod: |
| 866 case IrOpcode::kUint32MulHigh: |
865 return VisitUint32Binop(node); | 867 return VisitUint32Binop(node); |
866 case IrOpcode::kInt32LessThan: | 868 case IrOpcode::kInt32LessThan: |
867 case IrOpcode::kInt32LessThanOrEqual: | 869 case IrOpcode::kInt32LessThanOrEqual: |
868 return VisitInt32Cmp(node); | 870 return VisitInt32Cmp(node); |
869 | 871 |
870 case IrOpcode::kUint32LessThan: | 872 case IrOpcode::kUint32LessThan: |
871 case IrOpcode::kUint32LessThanOrEqual: | 873 case IrOpcode::kUint32LessThanOrEqual: |
872 return VisitUint32Cmp(node); | 874 return VisitUint32Cmp(node); |
873 | 875 |
874 case IrOpcode::kInt64Add: | 876 case IrOpcode::kInt64Add: |
(...skipping 592 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1467 | 1469 |
1468 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { | 1470 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { |
1469 node->set_op(machine()->IntLessThanOrEqual()); | 1471 node->set_op(machine()->IntLessThanOrEqual()); |
1470 node->ReplaceInput(0, StringComparison(node, true)); | 1472 node->ReplaceInput(0, StringComparison(node, true)); |
1471 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); | 1473 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); |
1472 } | 1474 } |
1473 | 1475 |
1474 } // namespace compiler | 1476 } // namespace compiler |
1475 } // namespace internal | 1477 } // namespace internal |
1476 } // namespace v8 | 1478 } // namespace v8 |
OLD | NEW |