| // Copyright (c) 2021, the Dart project authors. Please see the AUTHORS file |
| // for details. All rights reserved. Use of this source code is governed by a |
| // BSD-style license that can be found in the LICENSE file. |
| |
| #include "vm/globals.h" // Needed here to get TARGET_ARCH_RISCV. |
| #if defined(TARGET_ARCH_RISCV32) || defined(TARGET_ARCH_RISCV64) |
| |
| #include "vm/compiler/backend/flow_graph_compiler.h" |
| |
| #include "vm/compiler/api/type_check_mode.h" |
| #include "vm/compiler/backend/il_printer.h" |
| #include "vm/compiler/backend/locations.h" |
| #include "vm/compiler/backend/parallel_move_resolver.h" |
| #include "vm/compiler/jit/compiler.h" |
| #include "vm/cpu.h" |
| #include "vm/dart_entry.h" |
| #include "vm/deopt_instructions.h" |
| #include "vm/dispatch_table.h" |
| #include "vm/instructions.h" |
| #include "vm/object_store.h" |
| #include "vm/parser.h" |
| #include "vm/stack_frame.h" |
| #include "vm/stub_code.h" |
| #include "vm/symbols.h" |
| |
| namespace dart { |
| |
| DEFINE_FLAG(bool, trap_on_deoptimization, false, "Trap on deoptimization."); |
| DECLARE_FLAG(bool, enable_simd_inline); |
| |
| void FlowGraphCompiler::ArchSpecificInitialization() { |
| // Note: Unlike the other architectures, we are not using PC-relative calls |
| // in AOT to call the write barrier stubs. We are making use of TMP as an |
| // alternate link register to avoid spilling RA inline and don't want to |
| // introduce another relocation type. |
| } |
| |
| FlowGraphCompiler::~FlowGraphCompiler() { |
| // BlockInfos are zone-allocated, so their destructors are not called. |
| // Verify the labels explicitly here. |
| for (int i = 0; i < block_info_.length(); ++i) { |
| ASSERT(!block_info_[i]->jump_label()->IsLinked()); |
| } |
| } |
| |
| bool FlowGraphCompiler::SupportsUnboxedSimd128() { |
| // TODO(riscv): Dynamically test for the vector extension and otherwise |
| // allocate SIMD values to register-pairs or quads? |
| return false; |
| } |
| |
| bool FlowGraphCompiler::CanConvertInt64ToDouble() { |
| #if XLEN == 32 |
| return false; |
| #else |
| return true; |
| #endif |
| } |
| |
| void FlowGraphCompiler::EnterIntrinsicMode() { |
| ASSERT(!intrinsic_mode()); |
| intrinsic_mode_ = true; |
| ASSERT(!assembler()->constant_pool_allowed()); |
| } |
| |
| void FlowGraphCompiler::ExitIntrinsicMode() { |
| ASSERT(intrinsic_mode()); |
| intrinsic_mode_ = false; |
| } |
| |
| TypedDataPtr CompilerDeoptInfo::CreateDeoptInfo(FlowGraphCompiler* compiler, |
| DeoptInfoBuilder* builder, |
| const Array& deopt_table) { |
| if (deopt_env_ == nullptr) { |
| ++builder->current_info_number_; |
| return TypedData::null(); |
| } |
| |
| AllocateOutgoingArguments(deopt_env_); |
| |
| intptr_t slot_ix = 0; |
| Environment* current = deopt_env_; |
| |
| // Emit all kMaterializeObject instructions describing objects to be |
| // materialized on the deoptimization as a prefix to the deoptimization info. |
| EmitMaterializations(deopt_env_, builder); |
| |
| // The real frame starts here. |
| builder->MarkFrameStart(); |
| |
| Zone* zone = compiler->zone(); |
| |
| builder->AddPp(current->function(), slot_ix++); |
| builder->AddPcMarker(Function::ZoneHandle(zone), slot_ix++); |
| builder->AddCallerFp(slot_ix++); |
| builder->AddReturnAddress(current->function(), deopt_id(), slot_ix++); |
| |
| // Emit all values that are needed for materialization as a part of the |
| // expression stack for the bottom-most frame. This guarantees that GC |
| // will be able to find them during materialization. |
| slot_ix = builder->EmitMaterializationArguments(slot_ix); |
| |
| // For the innermost environment, set outgoing arguments and the locals. |
| for (intptr_t i = current->Length() - 1; |
| i >= current->fixed_parameter_count(); i--) { |
| builder->AddCopy(current->ValueAt(i), current->LocationAt(i), slot_ix++); |
| } |
| |
| Environment* previous = current; |
| current = current->outer(); |
| while (current != nullptr) { |
| builder->AddPp(current->function(), slot_ix++); |
| builder->AddPcMarker(previous->function(), slot_ix++); |
| builder->AddCallerFp(slot_ix++); |
| |
| // For any outer environment the deopt id is that of the call instruction |
| // which is recorded in the outer environment. |
| builder->AddReturnAddress(current->function(), |
| DeoptId::ToDeoptAfter(current->GetDeoptId()), |
| slot_ix++); |
| |
| // The values of outgoing arguments can be changed from the inlined call so |
| // we must read them from the previous environment. |
| for (intptr_t i = previous->fixed_parameter_count() - 1; i >= 0; i--) { |
| builder->AddCopy(previous->ValueAt(i), previous->LocationAt(i), |
| slot_ix++); |
| } |
| |
| // Set the locals, note that outgoing arguments are not in the environment. |
| for (intptr_t i = current->Length() - 1; |
| i >= current->fixed_parameter_count(); i--) { |
| builder->AddCopy(current->ValueAt(i), current->LocationAt(i), slot_ix++); |
| } |
| |
| // Iterate on the outer environment. |
| previous = current; |
| current = current->outer(); |
| } |
| // The previous pointer is now the outermost environment. |
| ASSERT(previous != nullptr); |
| |
| // Add slots for the outermost environment. |
| builder->AddCallerPp(slot_ix++); |
| builder->AddPcMarker(previous->function(), slot_ix++); |
| builder->AddCallerFp(slot_ix++); |
| builder->AddCallerPc(slot_ix++); |
| |
| // For the outermost environment, set the incoming arguments. |
| for (intptr_t i = previous->fixed_parameter_count() - 1; i >= 0; i--) { |
| builder->AddCopy(previous->ValueAt(i), previous->LocationAt(i), slot_ix++); |
| } |
| |
| return builder->CreateDeoptInfo(deopt_table); |
| } |
| |
| void CompilerDeoptInfoWithStub::GenerateCode(FlowGraphCompiler* compiler, |
| intptr_t stub_ix) { |
| // Calls do not need stubs, they share a deoptimization trampoline. |
| ASSERT(reason() != ICData::kDeoptAtCall); |
| compiler::Assembler* assembler = compiler->assembler(); |
| #define __ assembler-> |
| __ Comment("%s", Name()); |
| __ Bind(entry_label()); |
| if (FLAG_trap_on_deoptimization) { |
| __ trap(); |
| } |
| |
| ASSERT(deopt_env() != nullptr); |
| __ Call(compiler::Address(THR, Thread::deoptimize_entry_offset())); |
| set_pc_offset(assembler->CodeSize()); |
| #undef __ |
| } |
| |
| #define __ assembler-> |
| // Static methods of FlowGraphCompiler that take an assembler. |
| |
| void FlowGraphCompiler::GenerateIndirectTTSCall(compiler::Assembler* assembler, |
| Register reg_to_call, |
| intptr_t sub_type_cache_index) { |
| __ LoadField( |
| TTSInternalRegs::kScratchReg, |
| compiler::FieldAddress( |
| reg_to_call, |
| compiler::target::AbstractType::type_test_stub_entry_point_offset())); |
| __ LoadWordFromPoolIndex(TypeTestABI::kSubtypeTestCacheReg, |
| sub_type_cache_index); |
| __ jalr(TTSInternalRegs::kScratchReg); |
| } |
| |
| #undef __ |
| #define __ assembler()-> |
| // Instance methods of FlowGraphCompiler. |
| |
| // Fall through if bool_register contains null. |
| void FlowGraphCompiler::GenerateBoolToJump(Register bool_register, |
| compiler::Label* is_true, |
| compiler::Label* is_false) { |
| compiler::Label fall_through; |
| __ beq(bool_register, NULL_REG, &fall_through, |
| compiler::Assembler::kNearJump); |
| BranchLabels labels = {is_true, is_false, &fall_through}; |
| Condition true_condition = |
| EmitBoolTest(bool_register, labels, /*invert=*/false); |
| ASSERT(true_condition != kInvalidCondition); |
| __ BranchIf(true_condition, is_true); |
| __ j(is_false); |
| __ Bind(&fall_through); |
| } |
| |
| void FlowGraphCompiler::EmitFrameEntry() { |
| const Function& function = parsed_function().function(); |
| if (CanOptimizeFunction() && function.IsOptimizable() && |
| (!is_optimizing() || may_reoptimize())) { |
| __ Comment("Invocation Count Check"); |
| const Register function_reg = A0; |
| const Register usage_reg = A1; |
| __ lx(function_reg, compiler::FieldAddress(CODE_REG, Code::owner_offset())); |
| |
| __ LoadFieldFromOffset(usage_reg, function_reg, |
| Function::usage_counter_offset(), |
| compiler::kFourBytes); |
| // Reoptimization of an optimized function is triggered by counting in |
| // IC stubs, but not at the entry of the function. |
| if (!is_optimizing()) { |
| __ addi(usage_reg, usage_reg, 1); |
| __ StoreFieldToOffset(usage_reg, function_reg, |
| Function::usage_counter_offset(), |
| compiler::kFourBytes); |
| } |
| __ CompareImmediate(usage_reg, GetOptimizationThreshold()); |
| compiler::Label dont_optimize; |
| __ BranchIf(LT, &dont_optimize, compiler::Assembler::kNearJump); |
| __ lx(TMP, compiler::Address(THR, Thread::optimize_entry_offset())); |
| __ jr(TMP); |
| __ Bind(&dont_optimize); |
| } |
| |
| if (flow_graph().graph_entry()->NeedsFrame()) { |
| __ Comment("Enter frame"); |
| if (flow_graph().IsCompiledForOsr()) { |
| const intptr_t extra_slots = ExtraStackSlotsOnOsrEntry(); |
| ASSERT(extra_slots >= 0); |
| __ EnterOsrFrame(extra_slots * kWordSize); |
| } else { |
| ASSERT(StackSize() >= 0); |
| __ EnterDartFrame(StackSize() * kWordSize); |
| } |
| } else if (FLAG_precompiled_mode) { |
| assembler()->set_constant_pool_allowed(true); |
| } |
| } |
| |
| const InstructionSource& PrologueSource() { |
| static InstructionSource prologue_source(TokenPosition::kDartCodePrologue, |
| /*inlining_id=*/0); |
| return prologue_source; |
| } |
| |
| void FlowGraphCompiler::EmitPrologue() { |
| BeginCodeSourceRange(PrologueSource()); |
| |
| EmitFrameEntry(); |
| ASSERT(assembler()->constant_pool_allowed()); |
| |
| // In unoptimized code, initialize (non-argument) stack allocated slots. |
| if (!is_optimizing()) { |
| const int num_locals = parsed_function().num_stack_locals(); |
| |
| intptr_t args_desc_slot = -1; |
| if (parsed_function().has_arg_desc_var()) { |
| args_desc_slot = compiler::target::frame_layout.FrameSlotForVariable( |
| parsed_function().arg_desc_var()); |
| } |
| |
| __ Comment("Initialize spill slots"); |
| const intptr_t fp_to_sp_delta = |
| num_locals + compiler::target::frame_layout.dart_fixed_frame_size; |
| for (intptr_t i = 0; i < num_locals; ++i) { |
| const intptr_t slot_index = |
| compiler::target::frame_layout.FrameSlotForVariableIndex(-i); |
| Register value_reg = |
| slot_index == args_desc_slot ? ARGS_DESC_REG : NULL_REG; |
| // SP-relative addresses allow for compressed instructions. |
| __ StoreToOffset(value_reg, SP, |
| (slot_index + fp_to_sp_delta) * kWordSize); |
| } |
| } else if (parsed_function().suspend_state_var() != nullptr && |
| !flow_graph().IsCompiledForOsr()) { |
| // Initialize synthetic :suspend_state variable early |
| // as it may be accessed by GC and exception handling before |
| // InitSuspendableFunction stub is called. |
| const intptr_t slot_index = |
| compiler::target::frame_layout.FrameSlotForVariable( |
| parsed_function().suspend_state_var()); |
| const intptr_t fp_to_sp_delta = |
| StackSize() + compiler::target::frame_layout.dart_fixed_frame_size; |
| __ StoreToOffset(NULL_REG, SP, (slot_index + fp_to_sp_delta) * kWordSize); |
| } |
| |
| EndCodeSourceRange(PrologueSource()); |
| } |
| |
| void FlowGraphCompiler::EmitCallToStub( |
| const Code& stub, |
| ObjectPool::SnapshotBehavior snapshot_behavior) { |
| ASSERT(!stub.IsNull()); |
| if (CanPcRelativeCall(stub)) { |
| __ GenerateUnRelocatedPcRelativeCall(); |
| AddPcRelativeCallStubTarget(stub); |
| } else { |
| __ JumpAndLink(stub, compiler::ObjectPoolBuilderEntry::kNotPatchable, |
| CodeEntryKind::kNormal, snapshot_behavior); |
| AddStubCallTarget(stub); |
| } |
| } |
| |
| void FlowGraphCompiler::EmitJumpToStub(const Code& stub) { |
| ASSERT(!stub.IsNull()); |
| if (CanPcRelativeCall(stub)) { |
| __ GenerateUnRelocatedPcRelativeTailCall(); |
| AddPcRelativeTailCallStubTarget(stub); |
| } else { |
| __ LoadObject(CODE_REG, stub); |
| __ lx(TMP, compiler::FieldAddress( |
| CODE_REG, compiler::target::Code::entry_point_offset())); |
| __ jr(TMP); |
| AddStubCallTarget(stub); |
| } |
| } |
| |
| void FlowGraphCompiler::EmitTailCallToStub(const Code& stub) { |
| ASSERT(!stub.IsNull()); |
| if (CanPcRelativeCall(stub)) { |
| if (flow_graph().graph_entry()->NeedsFrame()) { |
| __ LeaveDartFrame(); |
| } |
| __ GenerateUnRelocatedPcRelativeTailCall(); |
| AddPcRelativeTailCallStubTarget(stub); |
| #if defined(DEBUG) |
| __ Breakpoint(); |
| #endif |
| } else { |
| __ LoadObject(CODE_REG, stub); |
| if (flow_graph().graph_entry()->NeedsFrame()) { |
| __ LeaveDartFrame(); |
| } |
| __ lx(TMP, compiler::FieldAddress( |
| CODE_REG, compiler::target::Code::entry_point_offset())); |
| __ jr(TMP); |
| AddStubCallTarget(stub); |
| } |
| } |
| |
| void FlowGraphCompiler::GeneratePatchableCall( |
| const InstructionSource& source, |
| const Code& stub, |
| UntaggedPcDescriptors::Kind kind, |
| LocationSummary* locs, |
| ObjectPool::SnapshotBehavior snapshot_behavior) { |
| __ JumpAndLinkPatchable(stub, CodeEntryKind::kNormal, snapshot_behavior); |
| EmitCallsiteMetadata(source, DeoptId::kNone, kind, locs, |
| pending_deoptimization_env_); |
| } |
| |
| void FlowGraphCompiler::GenerateDartCall(intptr_t deopt_id, |
| const InstructionSource& source, |
| const Code& stub, |
| UntaggedPcDescriptors::Kind kind, |
| LocationSummary* locs, |
| Code::EntryKind entry_kind) { |
| ASSERT(CanCallDart()); |
| __ JumpAndLinkPatchable(stub, entry_kind); |
| EmitCallsiteMetadata(source, deopt_id, kind, locs, |
| pending_deoptimization_env_); |
| } |
| |
| void FlowGraphCompiler::GenerateStaticDartCall(intptr_t deopt_id, |
| const InstructionSource& source, |
| UntaggedPcDescriptors::Kind kind, |
| LocationSummary* locs, |
| const Function& target, |
| Code::EntryKind entry_kind) { |
| ASSERT(CanCallDart()); |
| if (CanPcRelativeCall(target)) { |
| __ GenerateUnRelocatedPcRelativeCall(); |
| AddPcRelativeCallTarget(target, entry_kind); |
| EmitCallsiteMetadata(source, deopt_id, kind, locs, |
| pending_deoptimization_env_); |
| } else { |
| // Call sites to the same target can share object pool entries. These |
| // call sites are never patched for breakpoints: the function is deoptimized |
| // and the unoptimized code with IC calls for static calls is patched |
| // instead. |
| ASSERT(is_optimizing()); |
| const auto& stub = StubCode::CallStaticFunction(); |
| __ JumpAndLinkWithEquivalence(stub, target, entry_kind); |
| EmitCallsiteMetadata(source, deopt_id, kind, locs, |
| pending_deoptimization_env_); |
| AddStaticCallTarget(target, entry_kind); |
| } |
| } |
| |
| void FlowGraphCompiler::EmitEdgeCounter(intptr_t edge_id) { |
| // We do not check for overflow when incrementing the edge counter. The |
| // function should normally be optimized long before the counter can |
| // overflow; and though we do not reset the counters when we optimize or |
| // deoptimize, there is a bound on the number of |
| // optimization/deoptimization cycles we will attempt. |
| ASSERT(!edge_counters_array_.IsNull()); |
| ASSERT(assembler_->constant_pool_allowed()); |
| __ Comment("Edge counter"); |
| __ LoadObject(A0, edge_counters_array_); |
| __ LoadFieldFromOffset(TMP, A0, Array::element_offset(edge_id)); |
| __ addi(TMP, TMP, Smi::RawValue(1)); |
| __ StoreFieldToOffset(TMP, A0, Array::element_offset(edge_id)); |
| } |
| |
| void FlowGraphCompiler::EmitOptimizedInstanceCall( |
| const Code& stub, |
| const ICData& ic_data, |
| intptr_t deopt_id, |
| const InstructionSource& source, |
| LocationSummary* locs, |
| Code::EntryKind entry_kind) { |
| ASSERT(CanCallDart()); |
| ASSERT(Array::Handle(zone(), ic_data.arguments_descriptor()).Length() > 0); |
| // Each ICData propagated from unoptimized to optimized code contains the |
| // function that corresponds to the Dart function of that IC call. Due |
| // to inlining in optimized code, that function may not correspond to the |
| // top-level function (parsed_function().function()) which could be |
| // reoptimized and which counter needs to be incremented. |
| // Pass the function explicitly, it is used in IC stub. |
| |
| __ LoadObject(A6, parsed_function().function()); |
| __ LoadFromOffset(A0, SP, (ic_data.SizeWithoutTypeArgs() - 1) * kWordSize); |
| __ LoadUniqueObject(IC_DATA_REG, ic_data); |
| GenerateDartCall(deopt_id, source, stub, UntaggedPcDescriptors::kIcCall, locs, |
| entry_kind); |
| EmitDropArguments(ic_data.SizeWithTypeArgs()); |
| } |
| |
| void FlowGraphCompiler::EmitInstanceCallJIT(const Code& stub, |
| const ICData& ic_data, |
| intptr_t deopt_id, |
| const InstructionSource& source, |
| LocationSummary* locs, |
| Code::EntryKind entry_kind) { |
| ASSERT(CanCallDart()); |
| ASSERT(entry_kind == Code::EntryKind::kNormal || |
| entry_kind == Code::EntryKind::kUnchecked); |
| ASSERT(Array::Handle(zone(), ic_data.arguments_descriptor()).Length() > 0); |
| __ LoadFromOffset(A0, SP, (ic_data.SizeWithoutTypeArgs() - 1) * kWordSize); |
| __ LoadUniqueObject(IC_DATA_REG, ic_data); |
| __ LoadUniqueObject(CODE_REG, stub); |
| const intptr_t entry_point_offset = |
| entry_kind == Code::EntryKind::kNormal |
| ? Code::entry_point_offset(Code::EntryKind::kMonomorphic) |
| : Code::entry_point_offset(Code::EntryKind::kMonomorphicUnchecked); |
| __ lx(RA, compiler::FieldAddress(CODE_REG, entry_point_offset)); |
| __ jalr(RA); |
| EmitCallsiteMetadata(source, deopt_id, UntaggedPcDescriptors::kIcCall, locs, |
| pending_deoptimization_env_); |
| EmitDropArguments(ic_data.SizeWithTypeArgs()); |
| } |
| |
| void FlowGraphCompiler::EmitMegamorphicInstanceCall( |
| const String& name, |
| const Array& arguments_descriptor, |
| intptr_t deopt_id, |
| const InstructionSource& source, |
| LocationSummary* locs) { |
| ASSERT(CanCallDart()); |
| ASSERT(!arguments_descriptor.IsNull() && (arguments_descriptor.Length() > 0)); |
| ASSERT(!FLAG_precompiled_mode); |
| const ArgumentsDescriptor args_desc(arguments_descriptor); |
| const MegamorphicCache& cache = MegamorphicCache::ZoneHandle( |
| zone(), |
| MegamorphicCacheTable::Lookup(thread(), name, arguments_descriptor)); |
| |
| __ Comment("MegamorphicCall"); |
| // Load receiver into A0. |
| __ LoadFromOffset(A0, SP, |
| (args_desc.Count() - 1) * compiler::target::kWordSize); |
| // Use same code pattern as instance call so it can be parsed by code patcher. |
| __ LoadUniqueObject(IC_DATA_REG, cache); |
| __ LoadUniqueObject(CODE_REG, StubCode::MegamorphicCall()); |
| __ Call(compiler::FieldAddress( |
| CODE_REG, Code::entry_point_offset(Code::EntryKind::kMonomorphic))); |
| |
| RecordSafepoint(locs); |
| AddCurrentDescriptor(UntaggedPcDescriptors::kOther, DeoptId::kNone, source); |
| const intptr_t deopt_id_after = DeoptId::ToDeoptAfter(deopt_id); |
| if (is_optimizing()) { |
| AddDeoptIndexAtCall(deopt_id_after, pending_deoptimization_env_); |
| } else { |
| // Add deoptimization continuation point after the call and before the |
| // arguments are removed. |
| AddCurrentDescriptor(UntaggedPcDescriptors::kDeopt, deopt_id_after, source); |
| } |
| RecordCatchEntryMoves(pending_deoptimization_env_); |
| EmitDropArguments(args_desc.SizeWithTypeArgs()); |
| } |
| |
| void FlowGraphCompiler::EmitInstanceCallAOT(const ICData& ic_data, |
| intptr_t deopt_id, |
| const InstructionSource& source, |
| LocationSummary* locs, |
| Code::EntryKind entry_kind, |
| bool receiver_can_be_smi) { |
| ASSERT(CanCallDart()); |
| ASSERT(ic_data.NumArgsTested() == 1); |
| const Code& initial_stub = StubCode::SwitchableCallMiss(); |
| const char* switchable_call_mode = "smiable"; |
| if (!receiver_can_be_smi) { |
| switchable_call_mode = "non-smi"; |
| ic_data.set_receiver_cannot_be_smi(true); |
| } |
| const UnlinkedCall& data = |
| UnlinkedCall::ZoneHandle(zone(), ic_data.AsUnlinkedCall()); |
| |
| __ Comment("InstanceCallAOT (%s)", switchable_call_mode); |
| // Clear argument descriptor to keep gc happy when it gets pushed on to |
| // the stack. |
| __ LoadImmediate(ARGS_DESC_REG, 0); |
| __ LoadFromOffset(A0, SP, (ic_data.SizeWithoutTypeArgs() - 1) * kWordSize); |
| // The AOT runtime will replace the slot in the object pool with the |
| // entrypoint address - see app_snapshot.cc. |
| const auto snapshot_behavior = |
| compiler::ObjectPoolBuilderEntry::kResetToSwitchableCallMissEntryPoint; |
| __ LoadUniqueObject(RA, initial_stub, snapshot_behavior); |
| __ LoadUniqueObject(IC_DATA_REG, data); |
| __ jalr(RA); |
| |
| EmitCallsiteMetadata(source, DeoptId::kNone, UntaggedPcDescriptors::kOther, |
| locs, pending_deoptimization_env_); |
| EmitDropArguments(ic_data.SizeWithTypeArgs()); |
| } |
| |
| void FlowGraphCompiler::EmitUnoptimizedStaticCall( |
| intptr_t size_with_type_args, |
| intptr_t deopt_id, |
| const InstructionSource& source, |
| LocationSummary* locs, |
| const ICData& ic_data, |
| Code::EntryKind entry_kind) { |
| ASSERT(CanCallDart()); |
| const Code& stub = |
| StubCode::UnoptimizedStaticCallEntry(ic_data.NumArgsTested()); |
| __ LoadObject(IC_DATA_REG, ic_data); |
| GenerateDartCall(deopt_id, source, stub, |
| UntaggedPcDescriptors::kUnoptStaticCall, locs, entry_kind); |
| EmitDropArguments(size_with_type_args); |
| } |
| |
| void FlowGraphCompiler::EmitOptimizedStaticCall( |
| const Function& function, |
| const Array& arguments_descriptor, |
| intptr_t size_with_type_args, |
| intptr_t deopt_id, |
| const InstructionSource& source, |
| LocationSummary* locs, |
| Code::EntryKind entry_kind) { |
| ASSERT(CanCallDart()); |
| ASSERT(!function.IsClosureFunction()); |
| if (function.PrologueNeedsArgumentsDescriptor()) { |
| __ LoadObject(ARGS_DESC_REG, arguments_descriptor); |
| } else { |
| if (!FLAG_precompiled_mode) { |
| __ LoadImmediate(ARGS_DESC_REG, 0); // GC safe smi zero because of stub. |
| } |
| } |
| // Do not use the code from the function, but let the code be patched so that |
| // we can record the outgoing edges to other code. |
| GenerateStaticDartCall(deopt_id, source, UntaggedPcDescriptors::kOther, locs, |
| function, entry_kind); |
| EmitDropArguments(size_with_type_args); |
| } |
| |
| void FlowGraphCompiler::EmitDispatchTableCall( |
| int32_t selector_offset, |
| const Array& arguments_descriptor) { |
| const auto cid_reg = DispatchTableNullErrorABI::kClassIdReg; |
| ASSERT(CanCallDart()); |
| ASSERT(cid_reg != ARGS_DESC_REG); |
| if (!arguments_descriptor.IsNull()) { |
| __ LoadObject(ARGS_DESC_REG, arguments_descriptor); |
| } |
| const uintptr_t offset = selector_offset - DispatchTable::kOriginElement; |
| // Would like cid_reg to be available on entry to the target function |
| // for checking purposes. |
| ASSERT(cid_reg != TMP); |
| __ AddShifted(TMP, DISPATCH_TABLE_REG, cid_reg, |
| compiler::target::kWordSizeLog2); |
| __ LoadFromOffset(TMP, TMP, offset << compiler::target::kWordSizeLog2); |
| __ jalr(TMP); |
| } |
| |
| Condition FlowGraphCompiler::EmitEqualityRegConstCompare( |
| Register reg, |
| const Object& obj, |
| bool needs_number_check, |
| const InstructionSource& source, |
| intptr_t deopt_id) { |
| if (needs_number_check) { |
| ASSERT(!obj.IsMint() && !obj.IsDouble()); |
| __ LoadObject(TMP, obj); |
| __ PushRegisterPair(TMP, reg); |
| if (is_optimizing()) { |
| // No breakpoints in optimized code. |
| __ JumpAndLink(StubCode::OptimizedIdenticalWithNumberCheck()); |
| AddCurrentDescriptor(UntaggedPcDescriptors::kOther, deopt_id, source); |
| } else { |
| // Patchable to support breakpoints. |
| __ JumpAndLinkPatchable(StubCode::UnoptimizedIdenticalWithNumberCheck()); |
| AddCurrentDescriptor(UntaggedPcDescriptors::kRuntimeCall, deopt_id, |
| source); |
| } |
| __ PopRegisterPair(ZR, reg); |
| // RISC-V has no condition flags, so the result is instead returned as |
| // TMP zero if equal, non-zero if non-equal. |
| ASSERT(reg != TMP); |
| __ CompareImmediate(TMP, 0); |
| } else { |
| __ CompareObject(reg, obj); |
| } |
| return EQ; |
| } |
| |
| Condition FlowGraphCompiler::EmitEqualityRegRegCompare( |
| Register left, |
| Register right, |
| bool needs_number_check, |
| const InstructionSource& source, |
| intptr_t deopt_id) { |
| if (needs_number_check) { |
| __ PushRegisterPair(right, left); |
| if (is_optimizing()) { |
| __ JumpAndLink(StubCode::OptimizedIdenticalWithNumberCheck()); |
| } else { |
| __ JumpAndLinkPatchable(StubCode::UnoptimizedIdenticalWithNumberCheck()); |
| } |
| AddCurrentDescriptor(UntaggedPcDescriptors::kRuntimeCall, deopt_id, source); |
| __ PopRegisterPair(right, left); |
| // RISC-V has no condition flags, so the result is instead returned as |
| // TMP zero if equal, non-zero if non-equal. |
| ASSERT(left != TMP); |
| ASSERT(right != TMP); |
| __ CompareImmediate(TMP, 0); |
| } else { |
| __ CompareObjectRegisters(left, right); |
| } |
| return EQ; |
| } |
| |
| Condition FlowGraphCompiler::EmitBoolTest(Register value, |
| BranchLabels labels, |
| bool invert) { |
| __ Comment("BoolTest"); |
| __ TestImmediate(value, compiler::target::ObjectAlignment::kBoolValueMask); |
| return invert ? NE : EQ; |
| } |
| |
| // This function must be in sync with FlowGraphCompiler::RecordSafepoint and |
| // FlowGraphCompiler::SlowPathEnvironmentFor. |
| void FlowGraphCompiler::SaveLiveRegisters(LocationSummary* locs) { |
| #if defined(DEBUG) |
| locs->CheckWritableInputs(); |
| ClobberDeadTempRegisters(locs); |
| #endif |
| // TODO(vegorov): consider saving only caller save (volatile) registers. |
| __ PushRegisters(*locs->live_registers()); |
| } |
| |
| void FlowGraphCompiler::RestoreLiveRegisters(LocationSummary* locs) { |
| __ PopRegisters(*locs->live_registers()); |
| } |
| |
| #if defined(DEBUG) |
| void FlowGraphCompiler::ClobberDeadTempRegisters(LocationSummary* locs) { |
| // Clobber temporaries that have not been manually preserved. |
| for (intptr_t i = 0; i < locs->temp_count(); ++i) { |
| Location tmp = locs->temp(i); |
| // TODO(zerny): clobber non-live temporary FPU registers. |
| if (tmp.IsRegister() && |
| !locs->live_registers()->ContainsRegister(tmp.reg())) { |
| __ li(tmp.reg(), 0xf7); |
| } |
| } |
| } |
| #endif |
| |
| Register FlowGraphCompiler::EmitTestCidRegister() { |
| return A1; |
| } |
| |
| void FlowGraphCompiler::EmitTestAndCallLoadReceiver( |
| intptr_t count_without_type_args, |
| const Array& arguments_descriptor) { |
| __ Comment("EmitTestAndCall"); |
| // Load receiver into A0. |
| __ LoadFromOffset(A0, SP, (count_without_type_args - 1) * kWordSize); |
| __ LoadObject(ARGS_DESC_REG, arguments_descriptor); |
| } |
| |
| void FlowGraphCompiler::EmitTestAndCallSmiBranch(compiler::Label* label, |
| bool if_smi) { |
| if (if_smi) { |
| __ BranchIfSmi(A0, label); |
| } else { |
| __ BranchIfNotSmi(A0, label); |
| } |
| } |
| |
| void FlowGraphCompiler::EmitTestAndCallLoadCid(Register class_id_reg) { |
| ASSERT(class_id_reg != A0); |
| __ LoadClassId(class_id_reg, A0); |
| } |
| |
| Location FlowGraphCompiler::RebaseIfImprovesAddressing(Location loc) const { |
| if (loc.IsStackSlot() && (loc.base_reg() == FP)) { |
| intptr_t fp_sp_dist = |
| (compiler::target::frame_layout.first_local_from_fp + 1 - StackSize()); |
| __ CheckFpSpDist(fp_sp_dist * compiler::target::kWordSize); |
| return Location::StackSlot(loc.stack_index() - fp_sp_dist, SP); |
| } |
| if (loc.IsDoubleStackSlot() && (loc.base_reg() == FP)) { |
| intptr_t fp_sp_dist = |
| (compiler::target::frame_layout.first_local_from_fp + 1 - StackSize()); |
| __ CheckFpSpDist(fp_sp_dist * compiler::target::kWordSize); |
| return Location::DoubleStackSlot(loc.stack_index() - fp_sp_dist, SP); |
| } |
| return loc; |
| } |
| |
| void FlowGraphCompiler::EmitMove(Location destination, |
| Location source, |
| TemporaryRegisterAllocator* allocator) { |
| if (destination.Equals(source)) return; |
| |
| if (source.IsRegister()) { |
| if (destination.IsRegister()) { |
| __ mv(destination.reg(), source.reg()); |
| } else { |
| ASSERT(destination.IsStackSlot()); |
| const intptr_t dest_offset = destination.ToStackSlotOffset(); |
| __ StoreToOffset(source.reg(), destination.base_reg(), dest_offset); |
| } |
| } else if (source.IsStackSlot()) { |
| if (destination.IsRegister()) { |
| const intptr_t source_offset = source.ToStackSlotOffset(); |
| __ LoadFromOffset(destination.reg(), source.base_reg(), source_offset); |
| } else if (destination.IsFpuRegister()) { |
| const intptr_t src_offset = source.ToStackSlotOffset(); |
| FRegister dst = destination.fpu_reg(); |
| __ LoadDFromOffset(dst, source.base_reg(), src_offset); |
| } else { |
| ASSERT(destination.IsStackSlot()); |
| const intptr_t source_offset = source.ToStackSlotOffset(); |
| const intptr_t dest_offset = destination.ToStackSlotOffset(); |
| __ LoadFromOffset(TMP, source.base_reg(), source_offset); |
| __ StoreToOffset(TMP, destination.base_reg(), dest_offset); |
| } |
| } else if (source.IsFpuRegister()) { |
| if (destination.IsFpuRegister()) { |
| __ fmvd(destination.fpu_reg(), source.fpu_reg()); |
| } else { |
| if (destination.IsStackSlot() /*32-bit float*/ || |
| destination.IsDoubleStackSlot()) { |
| const intptr_t dest_offset = destination.ToStackSlotOffset(); |
| FRegister src = source.fpu_reg(); |
| __ StoreDToOffset(src, destination.base_reg(), dest_offset); |
| } else { |
| ASSERT(destination.IsQuadStackSlot()); |
| UNIMPLEMENTED(); |
| } |
| } |
| } else if (source.IsDoubleStackSlot()) { |
| if (destination.IsFpuRegister()) { |
| const intptr_t source_offset = source.ToStackSlotOffset(); |
| const FRegister dst = destination.fpu_reg(); |
| __ LoadDFromOffset(dst, source.base_reg(), source_offset); |
| } else { |
| ASSERT(destination.IsDoubleStackSlot() || |
| destination.IsStackSlot() /*32-bit float*/); |
| const intptr_t source_offset = source.ToStackSlotOffset(); |
| const intptr_t dest_offset = destination.ToStackSlotOffset(); |
| __ LoadDFromOffset(FTMP, source.base_reg(), source_offset); |
| __ StoreDToOffset(FTMP, destination.base_reg(), dest_offset); |
| } |
| } else if (source.IsQuadStackSlot()) { |
| UNIMPLEMENTED(); |
| } else if (source.IsPairLocation()) { |
| #if XLEN == 32 |
| ASSERT(destination.IsPairLocation()); |
| for (intptr_t i : {0, 1}) { |
| EmitMove(destination.Component(i), source.Component(i), allocator); |
| } |
| #else |
| UNREACHABLE(); |
| #endif |
| } else { |
| ASSERT(source.IsConstant()); |
| source.constant_instruction()->EmitMoveToLocation(this, destination, TMP, |
| source.pair_index()); |
| } |
| } |
| |
| static compiler::OperandSize BytesToOperandSize(intptr_t bytes) { |
| switch (bytes) { |
| case 8: |
| return compiler::OperandSize::kEightBytes; |
| case 4: |
| return compiler::OperandSize::kFourBytes; |
| case 2: |
| return compiler::OperandSize::kTwoBytes; |
| case 1: |
| return compiler::OperandSize::kByte; |
| default: |
| UNIMPLEMENTED(); |
| } |
| } |
| |
| void FlowGraphCompiler::EmitNativeMoveArchitecture( |
| const compiler::ffi::NativeLocation& destination, |
| const compiler::ffi::NativeLocation& source) { |
| const auto& src_type = source.payload_type(); |
| const auto& dst_type = destination.payload_type(); |
| |
| ASSERT(src_type.IsSigned() == dst_type.IsSigned()); |
| ASSERT(src_type.IsPrimitive()); |
| ASSERT(dst_type.IsPrimitive()); |
| const intptr_t src_size = src_type.SizeInBytes(); |
| const intptr_t dst_size = dst_type.SizeInBytes(); |
| const bool sign_or_zero_extend = dst_size > src_size; |
| |
| if (source.IsRegisters()) { |
| const auto& src = source.AsRegisters(); |
| ASSERT(src.num_regs() == 1); |
| const auto src_reg = src.reg_at(0); |
| |
| if (destination.IsRegisters()) { |
| const auto& dst = destination.AsRegisters(); |
| ASSERT(dst.num_regs() == 1); |
| const auto dst_reg = dst.reg_at(0); |
| ASSERT(destination.container_type().SizeInBytes() <= |
| compiler::target::kWordSize); |
| if (!sign_or_zero_extend) { |
| #if XLEN == 32 |
| __ MoveRegister(dst_reg, src_reg); |
| #else |
| if (src_size <= 4) { |
| // Signed-extended to XLEN, even unsigned types. |
| __ addiw(dst_reg, src_reg, 0); |
| } else { |
| __ MoveRegister(dst_reg, src_reg); |
| } |
| #endif |
| } else { |
| switch (src_type.AsPrimitive().representation()) { |
| // Calling convention: scalars are extended according to the sign of |
| // their type to 32-bits, then sign-extended to XLEN bits. |
| case compiler::ffi::kInt8: |
| __ slli(dst_reg, src_reg, XLEN - 8); |
| __ srai(dst_reg, dst_reg, XLEN - 8); |
| return; |
| case compiler::ffi::kInt16: |
| __ slli(dst_reg, src_reg, XLEN - 16); |
| __ srai(dst_reg, dst_reg, XLEN - 16); |
| return; |
| case compiler::ffi::kUint8: |
| __ andi(dst_reg, src_reg, 0xFF); |
| return; |
| case compiler::ffi::kUint16: |
| __ slli(dst_reg, src_reg, 16); |
| #if XLEN == 32 |
| __ srli(dst_reg, dst_reg, 16); |
| #else |
| __ srliw(dst_reg, dst_reg, 16); |
| #endif |
| return; |
| #if XLEN >= 64 |
| case compiler::ffi::kUint32: |
| case compiler::ffi::kInt32: |
| // Note even uint32 is sign-extended to XLEN. |
| __ addiw(dst_reg, src_reg, 0); |
| return; |
| #endif |
| case compiler::ffi::kInt24: |
| #if XLEN >= 64 |
| case compiler::ffi::kInt40: |
| case compiler::ffi::kInt48: |
| case compiler::ffi::kInt56: |
| #endif |
| __ slli(dst_reg, src_reg, XLEN - src_size * kBitsPerByte); |
| __ srai(dst_reg, dst_reg, XLEN - src_size * kBitsPerByte); |
| return; |
| case compiler::ffi::kUint24: |
| #if XLEN >= 64 |
| case compiler::ffi::kUint40: |
| case compiler::ffi::kUint48: |
| case compiler::ffi::kUint56: |
| #endif |
| __ slli(dst_reg, src_reg, XLEN - src_size * kBitsPerByte); |
| __ srli(dst_reg, dst_reg, XLEN - src_size * kBitsPerByte); |
| return; |
| default: |
| UNREACHABLE(); |
| } |
| } |
| |
| } else if (destination.IsFpuRegisters()) { |
| const auto& dst = destination.AsFpuRegisters(); |
| ASSERT(src_size == dst_size); |
| ASSERT(src.num_regs() == 1); |
| switch (src_size) { |
| case 4: |
| __ fmvwx(dst.fpu_reg(), src.reg_at(0)); |
| return; |
| case 8: |
| #if XLEN == 32 |
| UNIMPLEMENTED(); |
| #else |
| __ fmvdx(dst.fpu_reg(), src.reg_at(0)); |
| #endif |
| return; |
| default: |
| UNREACHABLE(); |
| } |
| |
| } else { |
| ASSERT(destination.IsStack()); |
| const auto& dst = destination.AsStack(); |
| ASSERT(!sign_or_zero_extend); |
| auto const op_size = |
| BytesToOperandSize(destination.container_type().SizeInBytes()); |
| __ StoreToOffset(src.reg_at(0), dst.base_register(), |
| dst.offset_in_bytes(), op_size); |
| } |
| } else if (source.IsFpuRegisters()) { |
| const auto& src = source.AsFpuRegisters(); |
| // We have not implemented conversions here, use IL convert instructions. |
| ASSERT(src_type.Equals(dst_type)); |
| |
| if (destination.IsRegisters()) { |
| const auto& dst = destination.AsRegisters(); |
| ASSERT(src_size == dst_size); |
| ASSERT(dst.num_regs() == 1); |
| switch (src_size) { |
| case 4: |
| __ fmvxw(dst.reg_at(0), src.fpu_reg()); |
| return; |
| case 8: |
| #if XLEN == 32 |
| UNIMPLEMENTED(); |
| #else |
| __ fmvxd(dst.reg_at(0), src.fpu_reg()); |
| #endif |
| return; |
| default: |
| UNREACHABLE(); |
| } |
| |
| } else if (destination.IsFpuRegisters()) { |
| const auto& dst = destination.AsFpuRegisters(); |
| __ fmvd(dst.fpu_reg(), src.fpu_reg()); |
| |
| } else { |
| ASSERT(destination.IsStack()); |
| ASSERT(src_type.IsFloat()); |
| const auto& dst = destination.AsStack(); |
| switch (dst_size) { |
| case 8: |
| __ StoreDToOffset(src.fpu_reg(), dst.base_register(), |
| dst.offset_in_bytes()); |
| return; |
| case 4: |
| __ StoreSToOffset(src.fpu_reg(), dst.base_register(), |
| dst.offset_in_bytes()); |
| return; |
| default: |
| UNREACHABLE(); |
| } |
| } |
| |
| } else { |
| ASSERT(source.IsStack()); |
| const auto& src = source.AsStack(); |
| if (destination.IsRegisters()) { |
| const auto& dst = destination.AsRegisters(); |
| ASSERT(dst.num_regs() == 1); |
| const auto dst_reg = dst.reg_at(0); |
| EmitNativeLoad(dst_reg, src.base_register(), src.offset_in_bytes(), |
| src_type.AsPrimitive().representation()); |
| } else if (destination.IsFpuRegisters()) { |
| ASSERT(src_type.Equals(dst_type)); |
| ASSERT(src_type.IsFloat()); |
| const auto& dst = destination.AsFpuRegisters(); |
| switch (src_size) { |
| case 8: |
| __ LoadDFromOffset(dst.fpu_reg(), src.base_register(), |
| src.offset_in_bytes()); |
| return; |
| case 4: |
| __ LoadSFromOffset(dst.fpu_reg(), src.base_register(), |
| src.offset_in_bytes()); |
| return; |
| default: |
| UNIMPLEMENTED(); |
| } |
| } else { |
| ASSERT(destination.IsStack()); |
| UNREACHABLE(); |
| } |
| } |
| } |
| |
| void FlowGraphCompiler::EmitNativeLoad(Register dst, |
| Register base, |
| intptr_t offset, |
| compiler::ffi::PrimitiveType type) { |
| switch (type) { |
| case compiler::ffi::kInt8: |
| __ lb(dst, compiler::Address(base, offset)); |
| return; |
| case compiler::ffi::kUint8: |
| __ lbu(dst, compiler::Address(base, offset)); |
| return; |
| case compiler::ffi::kInt16: |
| __ lh(dst, compiler::Address(base, offset)); |
| return; |
| case compiler::ffi::kUint16: |
| __ lhu(dst, compiler::Address(base, offset)); |
| return; |
| case compiler::ffi::kInt32: |
| __ lw(dst, compiler::Address(base, offset)); |
| return; |
| case compiler::ffi::kUint32: |
| case compiler::ffi::kFloat: |
| #if XLEN == 32 |
| __ lw(dst, compiler::Address(base, offset)); |
| #else |
| __ lwu(dst, compiler::Address(base, offset)); |
| #endif |
| return; |
| #if XLEN >= 64 |
| case compiler::ffi::kInt64: |
| case compiler::ffi::kUint64: |
| case compiler::ffi::kDouble: |
| __ ld(dst, compiler::Address(base, offset)); |
| return; |
| #endif |
| default: |
| break; |
| } |
| |
| Register tmp = kNoRegister; |
| if (dst != T1 && base != T1) tmp = T1; |
| if (dst != T2 && base != T2) tmp = T2; |
| if (dst != T3 && base != T3) tmp = T3; |
| ASSERT(tmp != kNoRegister); |
| if (base == SP) offset += compiler::target::kWordSize; |
| __ PushRegister(tmp); |
| |
| switch (type) { |
| case compiler::ffi::kInt24: |
| __ lhu(dst, compiler::Address(base, offset)); |
| __ lb(tmp, compiler::Address(base, offset + 2)); |
| __ slli(tmp, tmp, 16); |
| __ or_(dst, dst, tmp); |
| break; |
| case compiler::ffi::kUint24: |
| __ lhu(dst, compiler::Address(base, offset)); |
| __ lbu(tmp, compiler::Address(base, offset + 2)); |
| __ slli(tmp, tmp, 16); |
| __ or_(dst, dst, tmp); |
| break; |
| #if XLEN >= 64 |
| case compiler::ffi::kInt40: |
| __ lwu(dst, compiler::Address(base, offset)); |
| __ lb(tmp, compiler::Address(base, offset + 4)); |
| __ slli(tmp, tmp, 32); |
| __ or_(dst, dst, tmp); |
| break; |
| case compiler::ffi::kUint40: |
| __ lwu(dst, compiler::Address(base, offset)); |
| __ lbu(tmp, compiler::Address(base, offset + 4)); |
| __ slli(tmp, tmp, 32); |
| __ or_(dst, dst, tmp); |
| break; |
| case compiler::ffi::kInt48: |
| __ lwu(dst, compiler::Address(base, offset)); |
| __ lh(tmp, compiler::Address(base, offset + 4)); |
| __ slli(tmp, tmp, 32); |
| __ or_(dst, dst, tmp); |
| break; |
| case compiler::ffi::kUint48: |
| __ lwu(dst, compiler::Address(base, offset)); |
| __ lhu(tmp, compiler::Address(base, offset + 4)); |
| __ slli(tmp, tmp, 32); |
| __ or_(dst, dst, tmp); |
| break; |
| case compiler::ffi::kInt56: |
| __ lwu(dst, compiler::Address(base, offset)); |
| __ lhu(tmp, compiler::Address(base, offset + 4)); |
| __ slli(tmp, tmp, 32); |
| __ or_(dst, dst, tmp); |
| __ lb(tmp, compiler::Address(base, offset + 6)); |
| __ slli(tmp, tmp, 48); |
| __ or_(dst, dst, tmp); |
| break; |
| case compiler::ffi::kUint56: |
| __ lwu(dst, compiler::Address(base, offset)); |
| __ lhu(tmp, compiler::Address(base, offset + 4)); |
| __ slli(tmp, tmp, 32); |
| __ or_(dst, dst, tmp); |
| __ lbu(tmp, compiler::Address(base, offset + 6)); |
| __ slli(tmp, tmp, 48); |
| __ or_(dst, dst, tmp); |
| break; |
| #endif |
| default: |
| UNREACHABLE(); |
| } |
| |
| __ PopRegister(tmp); |
| } |
| |
| void FlowGraphCompiler::LoadBSSEntry(BSS::Relocation relocation, |
| Register dst, |
| Register tmp) { |
| compiler::Label skip_reloc; |
| __ j(&skip_reloc, compiler::Assembler::kNearJump); |
| InsertBSSRelocation(relocation); |
| __ Bind(&skip_reloc); |
| |
| __ auipc(tmp, 0); |
| __ addi(tmp, tmp, -compiler::target::kWordSize); |
| |
| // tmp holds the address of the relocation. |
| __ lx(dst, compiler::Address(tmp)); |
| |
| // dst holds the relocation itself: tmp - bss_start. |
| // tmp = tmp + (bss_start - tmp) = bss_start |
| __ add(tmp, tmp, dst); |
| |
| // tmp holds the start of the BSS section. |
| // Load the "get-thread" routine: *bss_start. |
| __ lx(dst, compiler::Address(tmp)); |
| } |
| |
| #undef __ |
| #define __ compiler_->assembler()-> |
| |
| void ParallelMoveEmitter::EmitSwap(const MoveOperands& move) { |
| const Location source = move.src(); |
| const Location destination = move.dest(); |
| |
| if (source.IsRegister() && destination.IsRegister()) { |
| ASSERT(source.reg() != TMP); |
| ASSERT(destination.reg() != TMP); |
| __ mv(TMP, source.reg()); |
| __ mv(source.reg(), destination.reg()); |
| __ mv(destination.reg(), TMP); |
| } else if (source.IsRegister() && destination.IsStackSlot()) { |
| Exchange(source.reg(), destination.base_reg(), |
| destination.ToStackSlotOffset()); |
| } else if (source.IsStackSlot() && destination.IsRegister()) { |
| Exchange(destination.reg(), source.base_reg(), source.ToStackSlotOffset()); |
| } else if (source.IsStackSlot() && destination.IsStackSlot()) { |
| Exchange(source.base_reg(), source.ToStackSlotOffset(), |
| destination.base_reg(), destination.ToStackSlotOffset()); |
| } else if (source.IsFpuRegister() && destination.IsFpuRegister()) { |
| const FRegister dst = destination.fpu_reg(); |
| const FRegister src = source.fpu_reg(); |
| __ fmvd(FTMP, src); |
| __ fmvd(src, dst); |
| __ fmvd(dst, FTMP); |
| } else if (source.IsFpuRegister() || destination.IsFpuRegister()) { |
| UNIMPLEMENTED(); |
| } else if (source.IsDoubleStackSlot() && destination.IsDoubleStackSlot()) { |
| const intptr_t source_offset = source.ToStackSlotOffset(); |
| const intptr_t dest_offset = destination.ToStackSlotOffset(); |
| |
| ScratchFpuRegisterScope ensure_scratch(this, kNoFpuRegister); |
| FRegister scratch = ensure_scratch.reg(); |
| __ LoadDFromOffset(FTMP, source.base_reg(), source_offset); |
| __ LoadDFromOffset(scratch, destination.base_reg(), dest_offset); |
| __ StoreDToOffset(FTMP, destination.base_reg(), dest_offset); |
| __ StoreDToOffset(scratch, source.base_reg(), source_offset); |
| } else if (source.IsQuadStackSlot() && destination.IsQuadStackSlot()) { |
| UNIMPLEMENTED(); |
| } else { |
| UNREACHABLE(); |
| } |
| } |
| |
| void ParallelMoveEmitter::MoveMemoryToMemory(const compiler::Address& dst, |
| const compiler::Address& src) { |
| UNREACHABLE(); |
| } |
| |
| // Do not call or implement this function. Instead, use the form below that |
| // uses an offset from the frame pointer instead of an Address. |
| void ParallelMoveEmitter::Exchange(Register reg, const compiler::Address& mem) { |
| UNREACHABLE(); |
| } |
| |
| // Do not call or implement this function. Instead, use the form below that |
| // uses offsets from the frame pointer instead of Addresses. |
| void ParallelMoveEmitter::Exchange(const compiler::Address& mem1, |
| const compiler::Address& mem2) { |
| UNREACHABLE(); |
| } |
| |
| void ParallelMoveEmitter::Exchange(Register reg, |
| Register base_reg, |
| intptr_t stack_offset) { |
| __ mv(TMP, reg); |
| __ LoadFromOffset(reg, base_reg, stack_offset); |
| __ StoreToOffset(TMP, base_reg, stack_offset); |
| } |
| |
| void ParallelMoveEmitter::Exchange(Register base_reg1, |
| intptr_t stack_offset1, |
| Register base_reg2, |
| intptr_t stack_offset2) { |
| ScratchRegisterScope tmp1(this, kNoRegister); |
| ScratchRegisterScope tmp2(this, tmp1.reg()); |
| __ LoadFromOffset(tmp1.reg(), base_reg1, stack_offset1); |
| __ LoadFromOffset(tmp2.reg(), base_reg2, stack_offset2); |
| __ StoreToOffset(tmp1.reg(), base_reg2, stack_offset2); |
| __ StoreToOffset(tmp2.reg(), base_reg1, stack_offset1); |
| } |
| |
| void ParallelMoveEmitter::SpillScratch(Register reg) { |
| __ PushRegister(reg); |
| } |
| |
| void ParallelMoveEmitter::RestoreScratch(Register reg) { |
| __ PopRegister(reg); |
| } |
| |
| void ParallelMoveEmitter::SpillFpuScratch(FpuRegister reg) { |
| __ subi(SP, SP, sizeof(double)); |
| __ fsd(reg, compiler::Address(SP, 0)); |
| } |
| |
| void ParallelMoveEmitter::RestoreFpuScratch(FpuRegister reg) { |
| __ fld(reg, compiler::Address(SP, 0)); |
| __ addi(SP, SP, sizeof(double)); |
| } |
| |
| #undef __ |
| |
| } // namespace dart |
| |
| #endif // defined(TARGET_ARCH_RISCV) |
