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/int64-lowering.h" | 5 #include "src/compiler/int64-lowering.h" |
6 #include "src/compiler/common-operator.h" | 6 #include "src/compiler/common-operator.h" |
7 #include "src/compiler/diamond.h" | 7 #include "src/compiler/diamond.h" |
8 #include "src/compiler/graph.h" | 8 #include "src/compiler/graph.h" |
9 #include "src/compiler/linkage.h" | 9 #include "src/compiler/linkage.h" |
10 #include "src/compiler/machine-operator.h" | 10 #include "src/compiler/machine-operator.h" |
(...skipping 760 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
771 Node* high_node = GetReplacementHigh(node); | 771 Node* high_node = GetReplacementHigh(node); |
772 for (int i = 0; i < node->op()->ValueInputCount(); i++) { | 772 for (int i = 0; i < node->op()->ValueInputCount(); i++) { |
773 low_node->ReplaceInput(i, GetReplacementLow(node->InputAt(i))); | 773 low_node->ReplaceInput(i, GetReplacementLow(node->InputAt(i))); |
774 high_node->ReplaceInput(i, GetReplacementHigh(node->InputAt(i))); | 774 high_node->ReplaceInput(i, GetReplacementHigh(node->InputAt(i))); |
775 } | 775 } |
776 } else { | 776 } else { |
777 DefaultLowering(node); | 777 DefaultLowering(node); |
778 } | 778 } |
779 break; | 779 break; |
780 } | 780 } |
| 781 case IrOpcode::kProjection: { |
| 782 Node* call = node->InputAt(0); |
| 783 DCHECK_EQ(IrOpcode::kCall, call->opcode()); |
| 784 CallDescriptor* descriptor = |
| 785 const_cast<CallDescriptor*>(CallDescriptorOf(call->op())); |
| 786 for (size_t i = 0; i < descriptor->ReturnCount(); i++) { |
| 787 if (descriptor->GetReturnType(i) == MachineType::Int64()) { |
| 788 UNREACHABLE(); // TODO(titzer): implement multiple i64 returns. |
| 789 } |
| 790 } |
| 791 break; |
| 792 } |
781 case IrOpcode::kWord64ReverseBytes: { | 793 case IrOpcode::kWord64ReverseBytes: { |
782 Node* input = node->InputAt(0); | 794 Node* input = node->InputAt(0); |
783 ReplaceNode(node, graph()->NewNode(machine()->Word32ReverseBytes().op(), | 795 ReplaceNode(node, graph()->NewNode(machine()->Word32ReverseBytes().op(), |
784 GetReplacementHigh(input)), | 796 GetReplacementHigh(input)), |
785 graph()->NewNode(machine()->Word32ReverseBytes().op(), | 797 graph()->NewNode(machine()->Word32ReverseBytes().op(), |
786 GetReplacementLow(input))); | 798 GetReplacementLow(input))); |
787 break; | 799 break; |
788 } | 800 } |
789 | 801 |
790 default: { DefaultLowering(node); } | 802 default: { DefaultLowering(node); } |
(...skipping 83 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
874 common()->Phi(MachineRepresentation::kWord32, value_count), | 886 common()->Phi(MachineRepresentation::kWord32, value_count), |
875 value_count + 1, inputs_low, false), | 887 value_count + 1, inputs_low, false), |
876 graph()->NewNode( | 888 graph()->NewNode( |
877 common()->Phi(MachineRepresentation::kWord32, value_count), | 889 common()->Phi(MachineRepresentation::kWord32, value_count), |
878 value_count + 1, inputs_high, false)); | 890 value_count + 1, inputs_high, false)); |
879 } | 891 } |
880 } | 892 } |
881 } // namespace compiler | 893 } // namespace compiler |
882 } // namespace internal | 894 } // namespace internal |
883 } // namespace v8 | 895 } // namespace v8 |
OLD | NEW |