| // Copyright (c) 2013, 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 "platform/globals.h" |
| #include "vm/globals.h" // Needed here to get TARGET_ARCH_IA32. |
| #if defined(TARGET_ARCH_IA32) |
| |
| #include "vm/compiler/backend/il.h" |
| |
| #include "vm/compiler/backend/flow_graph.h" |
| #include "vm/compiler/backend/flow_graph_compiler.h" |
| #include "vm/compiler/backend/locations.h" |
| #include "vm/compiler/backend/locations_helpers.h" |
| #include "vm/compiler/backend/range_analysis.h" |
| #include "vm/compiler/ffi/native_calling_convention.h" |
| #include "vm/compiler/frontend/flow_graph_builder.h" |
| #include "vm/compiler/jit/compiler.h" |
| #include "vm/dart_entry.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" |
| |
| #define __ compiler->assembler()-> |
| #define Z (compiler->zone()) |
| |
| namespace dart { |
| |
| // Generic summary for call instructions that have all arguments pushed |
| // on the stack and return the result in a fixed register EAX. |
| LocationSummary* Instruction::MakeCallSummary(Zone* zone, |
| const Instruction* instr, |
| LocationSummary* locs) { |
| // This is unused on ia32. |
| ASSERT(locs == nullptr); |
| const intptr_t kNumInputs = 0; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* result = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kCall); |
| result->set_out(0, Location::RegisterLocation(EAX)); |
| return result; |
| } |
| |
| DEFINE_BACKEND(LoadIndexedUnsafe, (Register out, Register index)) { |
| ASSERT(instr->RequiredInputRepresentation(0) == kTagged); // It is a Smi. |
| ASSERT(instr->representation() == kTagged); |
| __ movl(out, compiler::Address(instr->base_reg(), index, TIMES_2, |
| instr->offset())); |
| |
| ASSERT(kSmiTag == 0); |
| ASSERT(kSmiTagSize == 1); |
| } |
| |
| DEFINE_BACKEND(StoreIndexedUnsafe, |
| (NoLocation, Register index, Register value)) { |
| ASSERT(instr->RequiredInputRepresentation( |
| StoreIndexedUnsafeInstr::kIndexPos) == kTagged); // It is a Smi. |
| __ movl(compiler::Address(instr->base_reg(), index, TIMES_2, instr->offset()), |
| value); |
| |
| ASSERT(kSmiTag == 0); |
| ASSERT(kSmiTagSize == 1); |
| } |
| |
| DEFINE_BACKEND(TailCall, |
| (NoLocation, |
| Fixed<Register, ARGS_DESC_REG>, |
| Temp<Register> temp)) { |
| __ LoadObject(CODE_REG, instr->code()); |
| __ LeaveFrame(); // The arguments are still on the stack. |
| __ movl(temp, compiler::FieldAddress(CODE_REG, Code::entry_point_offset())); |
| __ jmp(temp); |
| } |
| |
| LocationSummary* MemoryCopyInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 5; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(kSrcPos, Location::RequiresRegister()); |
| locs->set_in(kDestPos, Location::RegisterLocation(EDI)); |
| locs->set_in(kSrcStartPos, Location::WritableRegister()); |
| locs->set_in(kDestStartPos, Location::WritableRegister()); |
| locs->set_in(kLengthPos, Location::RegisterLocation(ECX)); |
| return locs; |
| } |
| |
| void MemoryCopyInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| const Register src_reg = locs()->in(kSrcPos).reg(); |
| const Register src_start_reg = locs()->in(kSrcStartPos).reg(); |
| const Register dest_start_reg = locs()->in(kDestStartPos).reg(); |
| |
| // Save ESI which is THR. |
| __ pushl(ESI); |
| __ movl(ESI, src_reg); |
| |
| EmitComputeStartPointer(compiler, src_cid_, src_start(), ESI, src_start_reg); |
| EmitComputeStartPointer(compiler, dest_cid_, dest_start(), EDI, |
| dest_start_reg); |
| if (element_size_ <= 4) { |
| __ SmiUntag(ECX); |
| } else if (element_size_ == 16) { |
| __ shll(ECX, compiler::Immediate(1)); |
| } |
| switch (element_size_) { |
| case 1: |
| __ rep_movsb(); |
| break; |
| case 2: |
| __ rep_movsw(); |
| break; |
| case 4: |
| case 8: |
| case 16: |
| __ rep_movsd(); |
| break; |
| } |
| |
| // Restore THR. |
| __ popl(ESI); |
| } |
| |
| void MemoryCopyInstr::EmitComputeStartPointer(FlowGraphCompiler* compiler, |
| classid_t array_cid, |
| Value* start, |
| Register array_reg, |
| Register start_reg) { |
| intptr_t offset; |
| if (IsTypedDataBaseClassId(array_cid)) { |
| __ movl(array_reg, |
| compiler::FieldAddress( |
| array_reg, compiler::target::PointerBase::data_offset())); |
| offset = 0; |
| } else { |
| switch (array_cid) { |
| case kOneByteStringCid: |
| offset = |
| compiler::target::OneByteString::data_offset() - kHeapObjectTag; |
| break; |
| case kTwoByteStringCid: |
| offset = |
| compiler::target::TwoByteString::data_offset() - kHeapObjectTag; |
| break; |
| case kExternalOneByteStringCid: |
| __ movl(array_reg, |
| compiler::FieldAddress(array_reg, |
| compiler::target::ExternalOneByteString:: |
| external_data_offset())); |
| offset = 0; |
| break; |
| case kExternalTwoByteStringCid: |
| __ movl(array_reg, |
| compiler::FieldAddress(array_reg, |
| compiler::target::ExternalTwoByteString:: |
| external_data_offset())); |
| offset = 0; |
| break; |
| default: |
| UNREACHABLE(); |
| break; |
| } |
| } |
| ScaleFactor scale; |
| switch (element_size_) { |
| case 1: |
| __ SmiUntag(start_reg); |
| scale = TIMES_1; |
| break; |
| case 2: |
| scale = TIMES_1; |
| break; |
| case 4: |
| scale = TIMES_2; |
| break; |
| case 8: |
| scale = TIMES_4; |
| break; |
| case 16: |
| scale = TIMES_8; |
| break; |
| default: |
| UNREACHABLE(); |
| break; |
| } |
| __ leal(array_reg, compiler::Address(array_reg, start_reg, scale, offset)); |
| } |
| |
| LocationSummary* PushArgumentInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| ASSERT(representation() == kTagged); |
| locs->set_in(0, LocationAnyOrConstant(value())); |
| return locs; |
| } |
| |
| void PushArgumentInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| // In SSA mode, we need an explicit push. Nothing to do in non-SSA mode |
| // where arguments are pushed by their definitions. |
| if (compiler->is_optimizing()) { |
| Location value = locs()->in(0); |
| if (value.IsRegister()) { |
| __ pushl(value.reg()); |
| } else if (value.IsConstant()) { |
| __ PushObject(value.constant()); |
| } else { |
| ASSERT(value.IsStackSlot()); |
| __ pushl(LocationToStackSlotAddress(value)); |
| } |
| } |
| } |
| |
| LocationSummary* ReturnInstr::MakeLocationSummary(Zone* zone, bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| ASSERT(representation() == kTagged); |
| locs->set_in(0, Location::RegisterLocation(EAX)); |
| return locs; |
| } |
| |
| // Attempt optimized compilation at return instruction instead of at the entry. |
| // The entry needs to be patchable, no inlined objects are allowed in the area |
| // that will be overwritten by the patch instruction: a jump). |
| void ReturnInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Register result = locs()->in(0).reg(); |
| ASSERT(result == EAX); |
| |
| if (compiler->parsed_function().function().IsAsyncFunction() || |
| compiler->parsed_function().function().IsAsyncGenerator()) { |
| ASSERT(compiler->flow_graph().graph_entry()->NeedsFrame()); |
| const Code& stub = GetReturnStub(compiler); |
| compiler->EmitJumpToStub(stub); |
| return; |
| } |
| |
| if (!compiler->flow_graph().graph_entry()->NeedsFrame()) { |
| __ ret(); |
| return; |
| } |
| |
| #if defined(DEBUG) |
| __ Comment("Stack Check"); |
| compiler::Label done; |
| const intptr_t fp_sp_dist = |
| (compiler::target::frame_layout.first_local_from_fp + 1 - |
| compiler->StackSize()) * |
| kWordSize; |
| ASSERT(fp_sp_dist <= 0); |
| __ movl(EDI, ESP); |
| __ subl(EDI, EBP); |
| __ cmpl(EDI, compiler::Immediate(fp_sp_dist)); |
| __ j(EQUAL, &done, compiler::Assembler::kNearJump); |
| __ int3(); |
| __ Bind(&done); |
| #endif |
| if (yield_index() != UntaggedPcDescriptors::kInvalidYieldIndex) { |
| compiler->EmitYieldPositionMetadata(source(), yield_index()); |
| } |
| __ LeaveDartFrame(); |
| __ ret(); |
| } |
| |
| // Keep in sync with NativeEntryInstr::EmitNativeCode. |
| void NativeReturnInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| EmitReturnMoves(compiler); |
| |
| bool return_in_st0 = false; |
| if (marshaller_.Location(compiler::ffi::kResultIndex) |
| .payload_type() |
| .IsFloat()) { |
| ASSERT(locs()->in(0).IsFpuRegister() && locs()->in(0).fpu_reg() == XMM0); |
| return_in_st0 = true; |
| } |
| |
| __ LeaveDartFrame(); |
| |
| // EDI is the only sane choice for a temporary register here because: |
| // |
| // EDX is used for large return values. |
| // ESI == THR. |
| // Could be EBX or ECX, but that would make code below confusing. |
| const Register tmp = EDI; |
| |
| // Pop dummy return address. |
| __ popl(tmp); |
| |
| // Anything besides the return register(s!). Callee-saved registers will be |
| // restored later. |
| const Register vm_tag_reg = EBX; |
| const Register old_exit_frame_reg = ECX; |
| const Register old_exit_through_ffi_reg = tmp; |
| |
| __ popl(old_exit_frame_reg); |
| __ popl(vm_tag_reg); /* old_exit_through_ffi, we still need to use tmp. */ |
| |
| // Restore top_resource. |
| __ popl(tmp); |
| __ movl( |
| compiler::Address(THR, compiler::target::Thread::top_resource_offset()), |
| tmp); |
| |
| __ movl(old_exit_through_ffi_reg, vm_tag_reg); |
| __ popl(vm_tag_reg); |
| |
| // This will reset the exit frame info to old_exit_frame_reg *before* entering |
| // the safepoint. |
| // |
| // If we were called by a trampoline, it will enter the safepoint on our |
| // behalf. |
| __ TransitionGeneratedToNative( |
| vm_tag_reg, old_exit_frame_reg, old_exit_through_ffi_reg, |
| /*enter_safepoint=*/!NativeCallbackTrampolines::Enabled()); |
| |
| // Move XMM0 into ST0 if needed. |
| if (return_in_st0) { |
| if (marshaller_.Location(compiler::ffi::kResultIndex) |
| .payload_type() |
| .SizeInBytes() == 8) { |
| __ movsd(compiler::Address(SPREG, -8), XMM0); |
| __ fldl(compiler::Address(SPREG, -8)); |
| } else { |
| __ movss(compiler::Address(SPREG, -4), XMM0); |
| __ flds(compiler::Address(SPREG, -4)); |
| } |
| } |
| |
| // Restore C++ ABI callee-saved registers. |
| __ popl(EDI); |
| __ popl(ESI); |
| __ popl(EBX); |
| |
| #if defined(DART_TARGET_OS_FUCHSIA) && defined(USING_SHADOW_CALL_STACK) |
| #error Unimplemented |
| #endif |
| |
| // Leave the entry frame. |
| __ LeaveFrame(); |
| |
| // We deal with `ret 4` for structs in the JIT callback trampolines. |
| __ ret(); |
| } |
| |
| LocationSummary* LoadLocalInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 0; |
| const intptr_t stack_index = |
| compiler::target::frame_layout.FrameSlotForVariable(&local()); |
| return LocationSummary::Make(zone, kNumInputs, |
| Location::StackSlot(stack_index, FPREG), |
| LocationSummary::kNoCall); |
| } |
| |
| void LoadLocalInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| ASSERT(!compiler->is_optimizing()); |
| // Nothing to do. |
| } |
| |
| LocationSummary* StoreLocalInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 1; |
| return LocationSummary::Make(zone, kNumInputs, Location::SameAsFirstInput(), |
| LocationSummary::kNoCall); |
| } |
| |
| void StoreLocalInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Register value = locs()->in(0).reg(); |
| Register result = locs()->out(0).reg(); |
| ASSERT(result == value); // Assert that register assignment is correct. |
| __ movl(compiler::Address( |
| EBP, compiler::target::FrameOffsetInBytesForVariable(&local())), |
| value); |
| } |
| |
| LocationSummary* ConstantInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 0; |
| return LocationSummary::Make(zone, kNumInputs, |
| compiler::Assembler::IsSafe(value()) |
| ? Location::Constant(this) |
| : Location::RequiresRegister(), |
| LocationSummary::kNoCall); |
| } |
| |
| void ConstantInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| // The register allocator drops constant definitions that have no uses. |
| Location out = locs()->out(0); |
| ASSERT(out.IsRegister() || out.IsConstant() || out.IsInvalid()); |
| if (out.IsRegister()) { |
| Register result = out.reg(); |
| __ LoadObjectSafely(result, value()); |
| } |
| } |
| |
| void ConstantInstr::EmitMoveToLocation(FlowGraphCompiler* compiler, |
| const Location& destination, |
| Register tmp, |
| intptr_t pair_index) { |
| if (destination.IsRegister()) { |
| if (RepresentationUtils::IsUnboxedInteger(representation())) { |
| int64_t v; |
| const bool ok = compiler::HasIntegerValue(value_, &v); |
| RELEASE_ASSERT(ok); |
| if (value_.IsSmi() && RepresentationUtils::IsUnsigned(representation())) { |
| // If the value is negative, then the sign bit was preserved during |
| // Smi untagging, which means the resulting value may be unexpected. |
| ASSERT(v >= 0); |
| } |
| __ movl(destination.reg(), |
| compiler::Immediate(pair_index == 0 ? Utils::Low32Bits(v) |
| : Utils::High32Bits(v))); |
| } else { |
| ASSERT(representation() == kTagged); |
| __ LoadObjectSafely(destination.reg(), value_); |
| } |
| } else if (destination.IsFpuRegister()) { |
| const double value_as_double = Double::Cast(value_).value(); |
| uword addr = FindDoubleConstant(value_as_double); |
| if (addr == 0) { |
| __ pushl(EAX); |
| __ LoadObject(EAX, value_); |
| __ movsd(destination.fpu_reg(), |
| compiler::FieldAddress(EAX, Double::value_offset())); |
| __ popl(EAX); |
| } else if (Utils::DoublesBitEqual(value_as_double, 0.0)) { |
| __ xorps(destination.fpu_reg(), destination.fpu_reg()); |
| } else { |
| __ movsd(destination.fpu_reg(), compiler::Address::Absolute(addr)); |
| } |
| } else if (destination.IsDoubleStackSlot()) { |
| const double value_as_double = Double::Cast(value_).value(); |
| uword addr = FindDoubleConstant(value_as_double); |
| if (addr == 0) { |
| __ pushl(EAX); |
| __ LoadObject(EAX, value_); |
| __ movsd(FpuTMP, compiler::FieldAddress(EAX, Double::value_offset())); |
| __ popl(EAX); |
| } else if (Utils::DoublesBitEqual(value_as_double, 0.0)) { |
| __ xorps(FpuTMP, FpuTMP); |
| } else { |
| __ movsd(FpuTMP, compiler::Address::Absolute(addr)); |
| } |
| __ movsd(LocationToStackSlotAddress(destination), FpuTMP); |
| } else { |
| ASSERT(destination.IsStackSlot()); |
| if (RepresentationUtils::IsUnboxedInteger(representation())) { |
| int64_t v; |
| const bool ok = compiler::HasIntegerValue(value_, &v); |
| RELEASE_ASSERT(ok); |
| __ movl(LocationToStackSlotAddress(destination), |
| compiler::Immediate(pair_index == 0 ? Utils::Low32Bits(v) |
| : Utils::High32Bits(v))); |
| } else { |
| if (compiler::Assembler::IsSafeSmi(value_) || value_.IsNull()) { |
| __ movl(LocationToStackSlotAddress(destination), |
| compiler::Immediate(static_cast<int32_t>(value_.ptr()))); |
| } else { |
| __ pushl(EAX); |
| __ LoadObjectSafely(EAX, value_); |
| __ movl(LocationToStackSlotAddress(destination), EAX); |
| __ popl(EAX); |
| } |
| } |
| } |
| } |
| |
| LocationSummary* UnboxedConstantInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const bool is_unboxed_int = |
| RepresentationUtils::IsUnboxedInteger(representation()); |
| ASSERT(!is_unboxed_int || RepresentationUtils::ValueSize(representation()) <= |
| compiler::target::kWordSize); |
| const intptr_t kNumInputs = 0; |
| const intptr_t kNumTemps = |
| (constant_address() == 0) && !is_unboxed_int ? 1 : 0; |
| LocationSummary* locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| if (representation() == kUnboxedDouble) { |
| locs->set_out(0, Location::RequiresFpuRegister()); |
| } else { |
| ASSERT(is_unboxed_int); |
| locs->set_out(0, Location::RequiresRegister()); |
| } |
| if (kNumTemps == 1) { |
| locs->set_temp(0, Location::RequiresRegister()); |
| } |
| return locs; |
| } |
| |
| void UnboxedConstantInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| // The register allocator drops constant definitions that have no uses. |
| if (!locs()->out(0).IsInvalid()) { |
| EmitMoveToLocation(compiler, locs()->out(0)); |
| } |
| } |
| |
| LocationSummary* AssertAssignableInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 4; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kCall); |
| summary->set_in(kInstancePos, |
| Location::RegisterLocation(TypeTestABI::kInstanceReg)); |
| summary->set_in(kDstTypePos, LocationFixedRegisterOrConstant( |
| dst_type(), TypeTestABI::kDstTypeReg)); |
| summary->set_in( |
| kInstantiatorTAVPos, |
| Location::RegisterLocation(TypeTestABI::kInstantiatorTypeArgumentsReg)); |
| summary->set_in(kFunctionTAVPos, Location::RegisterLocation( |
| TypeTestABI::kFunctionTypeArgumentsReg)); |
| summary->set_out(0, Location::SameAsFirstInput()); |
| return summary; |
| } |
| |
| void AssertBooleanInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| ASSERT(locs()->always_calls()); |
| |
| auto object_store = compiler->isolate_group()->object_store(); |
| const auto& assert_boolean_stub = |
| Code::ZoneHandle(compiler->zone(), object_store->assert_boolean_stub()); |
| |
| compiler::Label done; |
| __ testl( |
| AssertBooleanABI::kObjectReg, |
| compiler::Immediate(compiler::target::ObjectAlignment::kBoolVsNullMask)); |
| __ j(NOT_ZERO, &done, compiler::Assembler::kNearJump); |
| compiler->GenerateStubCall(source(), assert_boolean_stub, |
| /*kind=*/UntaggedPcDescriptors::kOther, locs(), |
| deopt_id(), env()); |
| __ Bind(&done); |
| } |
| |
| static Condition TokenKindToIntCondition(Token::Kind kind) { |
| switch (kind) { |
| case Token::kEQ: |
| return EQUAL; |
| case Token::kNE: |
| return NOT_EQUAL; |
| case Token::kLT: |
| return LESS; |
| case Token::kGT: |
| return GREATER; |
| case Token::kLTE: |
| return LESS_EQUAL; |
| case Token::kGTE: |
| return GREATER_EQUAL; |
| default: |
| UNREACHABLE(); |
| return OVERFLOW; |
| } |
| } |
| |
| LocationSummary* EqualityCompareInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 2; |
| if (operation_cid() == kMintCid) { |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::Pair(Location::RequiresRegister(), |
| Location::RequiresRegister())); |
| locs->set_in(1, Location::Pair(Location::RequiresRegister(), |
| Location::RequiresRegister())); |
| locs->set_out(0, Location::RequiresRegister()); |
| return locs; |
| } |
| if (operation_cid() == kDoubleCid) { |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::RequiresFpuRegister()); |
| locs->set_in(1, Location::RequiresFpuRegister()); |
| locs->set_out(0, Location::RequiresRegister()); |
| return locs; |
| } |
| if (operation_cid() == kSmiCid) { |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, LocationRegisterOrConstant(left())); |
| // Only one input can be a constant operand. The case of two constant |
| // operands should be handled by constant propagation. |
| // Only right can be a stack slot. |
| locs->set_in(1, locs->in(0).IsConstant() |
| ? Location::RequiresRegister() |
| : LocationRegisterOrConstant(right())); |
| locs->set_out(0, Location::RequiresRegister()); |
| return locs; |
| } |
| UNREACHABLE(); |
| return NULL; |
| } |
| |
| static void LoadValueCid(FlowGraphCompiler* compiler, |
| Register value_cid_reg, |
| Register value_reg, |
| compiler::Label* value_is_smi = NULL) { |
| compiler::Label done; |
| if (value_is_smi == NULL) { |
| __ movl(value_cid_reg, compiler::Immediate(kSmiCid)); |
| } |
| __ testl(value_reg, compiler::Immediate(kSmiTagMask)); |
| if (value_is_smi == NULL) { |
| __ j(ZERO, &done, compiler::Assembler::kNearJump); |
| } else { |
| __ j(ZERO, value_is_smi); |
| } |
| __ LoadClassId(value_cid_reg, value_reg); |
| __ Bind(&done); |
| } |
| |
| static Condition FlipCondition(Condition condition) { |
| switch (condition) { |
| case EQUAL: |
| return EQUAL; |
| case NOT_EQUAL: |
| return NOT_EQUAL; |
| case LESS: |
| return GREATER; |
| case LESS_EQUAL: |
| return GREATER_EQUAL; |
| case GREATER: |
| return LESS; |
| case GREATER_EQUAL: |
| return LESS_EQUAL; |
| case BELOW: |
| return ABOVE; |
| case BELOW_EQUAL: |
| return ABOVE_EQUAL; |
| case ABOVE: |
| return BELOW; |
| case ABOVE_EQUAL: |
| return BELOW_EQUAL; |
| default: |
| UNIMPLEMENTED(); |
| return EQUAL; |
| } |
| } |
| |
| static void EmitBranchOnCondition( |
| FlowGraphCompiler* compiler, |
| Condition true_condition, |
| BranchLabels labels, |
| compiler::Assembler::JumpDistance jump_distance = |
| compiler::Assembler::kFarJump) { |
| if (labels.fall_through == labels.false_label) { |
| // If the next block is the false successor, fall through to it. |
| __ j(true_condition, labels.true_label, jump_distance); |
| } else { |
| // If the next block is not the false successor, branch to it. |
| Condition false_condition = InvertCondition(true_condition); |
| __ j(false_condition, labels.false_label, jump_distance); |
| |
| // Fall through or jump to the true successor. |
| if (labels.fall_through != labels.true_label) { |
| __ jmp(labels.true_label, jump_distance); |
| } |
| } |
| } |
| |
| static Condition EmitSmiComparisonOp(FlowGraphCompiler* compiler, |
| const LocationSummary& locs, |
| Token::Kind kind, |
| BranchLabels labels) { |
| Location left = locs.in(0); |
| Location right = locs.in(1); |
| ASSERT(!left.IsConstant() || !right.IsConstant()); |
| |
| Condition true_condition = TokenKindToIntCondition(kind); |
| |
| if (left.IsConstant()) { |
| __ CompareObject(right.reg(), left.constant()); |
| true_condition = FlipCondition(true_condition); |
| } else if (right.IsConstant()) { |
| __ CompareObject(left.reg(), right.constant()); |
| } else if (right.IsStackSlot()) { |
| __ cmpl(left.reg(), LocationToStackSlotAddress(right)); |
| } else { |
| __ cmpl(left.reg(), right.reg()); |
| } |
| return true_condition; |
| } |
| |
| static Condition EmitUnboxedMintEqualityOp(FlowGraphCompiler* compiler, |
| const LocationSummary& locs, |
| Token::Kind kind, |
| BranchLabels labels) { |
| ASSERT(Token::IsEqualityOperator(kind)); |
| PairLocation* left_pair = locs.in(0).AsPairLocation(); |
| Register left1 = left_pair->At(0).reg(); |
| Register left2 = left_pair->At(1).reg(); |
| PairLocation* right_pair = locs.in(1).AsPairLocation(); |
| Register right1 = right_pair->At(0).reg(); |
| Register right2 = right_pair->At(1).reg(); |
| compiler::Label done; |
| // Compare lower. |
| __ cmpl(left1, right1); |
| __ j(NOT_EQUAL, &done); |
| // Lower is equal, compare upper. |
| __ cmpl(left2, right2); |
| __ Bind(&done); |
| Condition true_condition = TokenKindToIntCondition(kind); |
| return true_condition; |
| } |
| |
| static Condition EmitUnboxedMintComparisonOp(FlowGraphCompiler* compiler, |
| const LocationSummary& locs, |
| Token::Kind kind, |
| BranchLabels labels) { |
| PairLocation* left_pair = locs.in(0).AsPairLocation(); |
| Register left1 = left_pair->At(0).reg(); |
| Register left2 = left_pair->At(1).reg(); |
| PairLocation* right_pair = locs.in(1).AsPairLocation(); |
| Register right1 = right_pair->At(0).reg(); |
| Register right2 = right_pair->At(1).reg(); |
| |
| Condition hi_cond = OVERFLOW, lo_cond = OVERFLOW; |
| switch (kind) { |
| case Token::kLT: |
| hi_cond = LESS; |
| lo_cond = BELOW; |
| break; |
| case Token::kGT: |
| hi_cond = GREATER; |
| lo_cond = ABOVE; |
| break; |
| case Token::kLTE: |
| hi_cond = LESS; |
| lo_cond = BELOW_EQUAL; |
| break; |
| case Token::kGTE: |
| hi_cond = GREATER; |
| lo_cond = ABOVE_EQUAL; |
| break; |
| default: |
| break; |
| } |
| ASSERT(hi_cond != OVERFLOW && lo_cond != OVERFLOW); |
| // Compare upper halves first. |
| __ cmpl(left2, right2); |
| __ j(hi_cond, labels.true_label); |
| __ j(FlipCondition(hi_cond), labels.false_label); |
| |
| // If upper is equal, compare lower half. |
| __ cmpl(left1, right1); |
| return lo_cond; |
| } |
| |
| static Condition TokenKindToDoubleCondition(Token::Kind kind) { |
| switch (kind) { |
| case Token::kEQ: |
| return EQUAL; |
| case Token::kNE: |
| return NOT_EQUAL; |
| case Token::kLT: |
| return BELOW; |
| case Token::kGT: |
| return ABOVE; |
| case Token::kLTE: |
| return BELOW_EQUAL; |
| case Token::kGTE: |
| return ABOVE_EQUAL; |
| default: |
| UNREACHABLE(); |
| return OVERFLOW; |
| } |
| } |
| |
| static Condition EmitDoubleComparisonOp(FlowGraphCompiler* compiler, |
| const LocationSummary& locs, |
| Token::Kind kind, |
| BranchLabels labels) { |
| XmmRegister left = locs.in(0).fpu_reg(); |
| XmmRegister right = locs.in(1).fpu_reg(); |
| |
| __ comisd(left, right); |
| |
| Condition true_condition = TokenKindToDoubleCondition(kind); |
| compiler::Label* nan_result = |
| (true_condition == NOT_EQUAL) ? labels.true_label : labels.false_label; |
| __ j(PARITY_EVEN, nan_result); |
| return true_condition; |
| } |
| |
| Condition EqualityCompareInstr::EmitComparisonCode(FlowGraphCompiler* compiler, |
| BranchLabels labels) { |
| if (is_null_aware()) { |
| // Null-aware EqualityCompare instruction is only used in AOT. |
| UNREACHABLE(); |
| } |
| if (operation_cid() == kSmiCid) { |
| return EmitSmiComparisonOp(compiler, *locs(), kind(), labels); |
| } else if (operation_cid() == kMintCid) { |
| return EmitUnboxedMintEqualityOp(compiler, *locs(), kind(), labels); |
| } else { |
| ASSERT(operation_cid() == kDoubleCid); |
| return EmitDoubleComparisonOp(compiler, *locs(), kind(), labels); |
| } |
| } |
| |
| void ComparisonInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| compiler::Label is_true, is_false; |
| BranchLabels labels = {&is_true, &is_false, &is_false}; |
| Condition true_condition = EmitComparisonCode(compiler, labels); |
| if (true_condition != kInvalidCondition) { |
| EmitBranchOnCondition(compiler, true_condition, labels, |
| compiler::Assembler::kNearJump); |
| } |
| |
| Register result = locs()->out(0).reg(); |
| compiler::Label done; |
| __ Bind(&is_false); |
| __ LoadObject(result, Bool::False()); |
| __ jmp(&done, compiler::Assembler::kNearJump); |
| __ Bind(&is_true); |
| __ LoadObject(result, Bool::True()); |
| __ Bind(&done); |
| } |
| |
| void ComparisonInstr::EmitBranchCode(FlowGraphCompiler* compiler, |
| BranchInstr* branch) { |
| BranchLabels labels = compiler->CreateBranchLabels(branch); |
| Condition true_condition = EmitComparisonCode(compiler, labels); |
| if (true_condition != kInvalidCondition) { |
| EmitBranchOnCondition(compiler, true_condition, labels); |
| } |
| } |
| |
| LocationSummary* TestSmiInstr::MakeLocationSummary(Zone* zone, bool opt) const { |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::RequiresRegister()); |
| // Only one input can be a constant operand. The case of two constant |
| // operands should be handled by constant propagation. |
| locs->set_in(1, LocationRegisterOrConstant(right())); |
| return locs; |
| } |
| |
| Condition TestSmiInstr::EmitComparisonCode(FlowGraphCompiler* compiler, |
| BranchLabels labels) { |
| Register left = locs()->in(0).reg(); |
| Location right = locs()->in(1); |
| if (right.IsConstant()) { |
| ASSERT(right.constant().IsSmi()); |
| const int32_t imm = static_cast<int32_t>(right.constant().ptr()); |
| __ testl(left, compiler::Immediate(imm)); |
| } else { |
| __ testl(left, right.reg()); |
| } |
| Condition true_condition = (kind() == Token::kNE) ? NOT_ZERO : ZERO; |
| return true_condition; |
| } |
| |
| LocationSummary* TestCidsInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 1; |
| LocationSummary* locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::RequiresRegister()); |
| locs->set_temp(0, Location::RequiresRegister()); |
| locs->set_out(0, Location::RequiresRegister()); |
| return locs; |
| } |
| |
| Condition TestCidsInstr::EmitComparisonCode(FlowGraphCompiler* compiler, |
| BranchLabels labels) { |
| ASSERT((kind() == Token::kIS) || (kind() == Token::kISNOT)); |
| Register val_reg = locs()->in(0).reg(); |
| Register cid_reg = locs()->temp(0).reg(); |
| |
| compiler::Label* deopt = |
| CanDeoptimize() |
| ? compiler->AddDeoptStub(deopt_id(), ICData::kDeoptTestCids, |
| licm_hoisted_ ? ICData::kHoisted : 0) |
| : NULL; |
| |
| const intptr_t true_result = (kind() == Token::kIS) ? 1 : 0; |
| const ZoneGrowableArray<intptr_t>& data = cid_results(); |
| ASSERT(data[0] == kSmiCid); |
| bool result = data[1] == true_result; |
| __ testl(val_reg, compiler::Immediate(kSmiTagMask)); |
| __ j(ZERO, result ? labels.true_label : labels.false_label); |
| __ LoadClassId(cid_reg, val_reg); |
| for (intptr_t i = 2; i < data.length(); i += 2) { |
| const intptr_t test_cid = data[i]; |
| ASSERT(test_cid != kSmiCid); |
| result = data[i + 1] == true_result; |
| __ cmpl(cid_reg, compiler::Immediate(test_cid)); |
| __ j(EQUAL, result ? labels.true_label : labels.false_label); |
| } |
| // No match found, deoptimize or default action. |
| if (deopt == NULL) { |
| // If the cid is not in the list, jump to the opposite label from the cids |
| // that are in the list. These must be all the same (see asserts in the |
| // constructor). |
| compiler::Label* target = result ? labels.false_label : labels.true_label; |
| if (target != labels.fall_through) { |
| __ jmp(target); |
| } |
| } else { |
| __ jmp(deopt); |
| } |
| // Dummy result as this method already did the jump, there's no need |
| // for the caller to branch on a condition. |
| return kInvalidCondition; |
| } |
| |
| LocationSummary* RelationalOpInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = 0; |
| if (operation_cid() == kMintCid) { |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::Pair(Location::RequiresRegister(), |
| Location::RequiresRegister())); |
| locs->set_in(1, Location::Pair(Location::RequiresRegister(), |
| Location::RequiresRegister())); |
| locs->set_out(0, Location::RequiresRegister()); |
| return locs; |
| } |
| if (operation_cid() == kDoubleCid) { |
| LocationSummary* summary = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RequiresFpuRegister()); |
| summary->set_in(1, Location::RequiresFpuRegister()); |
| summary->set_out(0, Location::RequiresRegister()); |
| return summary; |
| } |
| ASSERT(operation_cid() == kSmiCid); |
| LocationSummary* summary = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, LocationRegisterOrConstant(left())); |
| // Only one input can be a constant operand. The case of two constant |
| // operands should be handled by constant propagation. |
| summary->set_in(1, summary->in(0).IsConstant() |
| ? Location::RequiresRegister() |
| : LocationRegisterOrConstant(right())); |
| summary->set_out(0, Location::RequiresRegister()); |
| return summary; |
| } |
| |
| Condition RelationalOpInstr::EmitComparisonCode(FlowGraphCompiler* compiler, |
| BranchLabels labels) { |
| if (operation_cid() == kSmiCid) { |
| return EmitSmiComparisonOp(compiler, *locs(), kind(), labels); |
| } else if (operation_cid() == kMintCid) { |
| return EmitUnboxedMintComparisonOp(compiler, *locs(), kind(), labels); |
| } else { |
| ASSERT(operation_cid() == kDoubleCid); |
| return EmitDoubleComparisonOp(compiler, *locs(), kind(), labels); |
| } |
| } |
| |
| void NativeCallInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| SetupNative(); |
| Register result = locs()->out(0).reg(); |
| const intptr_t argc_tag = NativeArguments::ComputeArgcTag(function()); |
| |
| // All arguments are already @ESP due to preceding PushArgument()s. |
| ASSERT(ArgumentCount() == |
| function().NumParameters() + (function().IsGeneric() ? 1 : 0)); |
| |
| // Push the result place holder initialized to NULL. |
| __ PushObject(Object::null_object()); |
| |
| // Pass a pointer to the first argument in EAX. |
| __ leal(EAX, compiler::Address(ESP, ArgumentCount() * kWordSize)); |
| |
| __ movl(EDX, compiler::Immediate(argc_tag)); |
| |
| const Code* stub; |
| |
| // There is no lazy-linking support on ia32. |
| ASSERT(!link_lazily()); |
| if (is_bootstrap_native()) { |
| stub = &StubCode::CallBootstrapNative(); |
| } else if (is_auto_scope()) { |
| stub = &StubCode::CallAutoScopeNative(); |
| } else { |
| stub = &StubCode::CallNoScopeNative(); |
| } |
| const compiler::ExternalLabel label( |
| reinterpret_cast<uword>(native_c_function())); |
| __ movl(ECX, compiler::Immediate(label.address())); |
| // We can never lazy-deopt here because natives are never optimized. |
| ASSERT(!compiler->is_optimizing()); |
| compiler->GenerateNonLazyDeoptableStubCall( |
| source(), *stub, UntaggedPcDescriptors::kOther, locs()); |
| |
| __ popl(result); |
| |
| __ Drop(ArgumentCount()); // Drop the arguments. |
| } |
| |
| #define R(r) (1 << r) |
| |
| LocationSummary* FfiCallInstr::MakeLocationSummary(Zone* zone, |
| bool is_optimizing) const { |
| return MakeLocationSummaryInternal( |
| zone, is_optimizing, |
| (R(CallingConventions::kSecondNonArgumentRegister) | |
| R(CallingConventions::kFfiAnyNonAbiRegister))); |
| } |
| |
| #undef R |
| |
| void FfiCallInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| const Register branch = locs()->in(TargetAddressIndex()).reg(); |
| |
| // The temps are indexed according to their register number. |
| const Register temp = locs()->temp(0).reg(); |
| // For regular calls, this holds the FP for rebasing the original locations |
| // during EmitParamMoves. |
| // For leaf calls, this holds the SP used to restore the pre-aligned SP after |
| // the call. |
| const Register saved_fp_or_sp = locs()->temp(1).reg(); |
| |
| // Ensure these are callee-saved register and are preserved across the call. |
| ASSERT(IsCalleeSavedRegister(saved_fp_or_sp)); |
| // Other temps don't need to be preserved. |
| |
| __ movl(saved_fp_or_sp, is_leaf_ ? SPREG : FPREG); |
| |
| intptr_t stack_required = marshaller_.RequiredStackSpaceInBytes(); |
| |
| if (is_leaf_) { |
| // For leaf calls we need to leave space at the bottom for the pre-align SP. |
| stack_required += compiler::target::kWordSize; |
| } else { |
| // Make a space to put the return address. |
| __ pushl(compiler::Immediate(0)); |
| |
| // We need to create a dummy "exit frame". It will have a null code object. |
| __ LoadObject(CODE_REG, Object::null_object()); |
| __ EnterDartFrame(0); |
| } |
| |
| // Reserve space for the arguments that go on the stack (if any), then align. |
| __ ReserveAlignedFrameSpace(stack_required); |
| |
| // No second temp: PointerToMemoryLocation is not used for arguments in ia32. |
| EmitParamMoves(compiler, is_leaf_ ? FPREG : saved_fp_or_sp, temp, |
| kNoRegister); |
| |
| if (is_leaf_) { |
| // We store the pre-align SP at a fixed offset from the final SP. |
| // Pushing before alignment would mean its placement would vary with how |
| // much the frame was unaligned. |
| __ movl(compiler::Address(SPREG, marshaller_.RequiredStackSpaceInBytes()), |
| saved_fp_or_sp); |
| } |
| |
| if (compiler::Assembler::EmittingComments()) { |
| __ Comment(is_leaf_ ? "Leaf Call" : "Call"); |
| } |
| |
| if (is_leaf_) { |
| #if !defined(PRODUCT) |
| // Set the thread object's top_exit_frame_info and VMTag to enable the |
| // profiler to determine that thread is no longer executing Dart code. |
| __ movl(compiler::Address( |
| THR, compiler::target::Thread::top_exit_frame_info_offset()), |
| FPREG); |
| __ movl(compiler::Assembler::VMTagAddress(), branch); |
| #endif |
| |
| __ call(branch); |
| |
| #if !defined(PRODUCT) |
| __ movl(compiler::Assembler::VMTagAddress(), |
| compiler::Immediate(compiler::target::Thread::vm_tag_dart_id())); |
| __ movl(compiler::Address( |
| THR, compiler::target::Thread::top_exit_frame_info_offset()), |
| compiler::Immediate(0)); |
| #endif |
| } else { |
| // We need to copy a dummy return address up into the dummy stack frame so |
| // the stack walker will know which safepoint to use. Unlike X64, there's no |
| // PC-relative 'leaq' available, so we have do a trick with 'call'. |
| compiler::Label get_pc; |
| __ call(&get_pc); |
| compiler->EmitCallsiteMetadata(InstructionSource(), deopt_id(), |
| UntaggedPcDescriptors::Kind::kOther, locs(), |
| env()); |
| __ Bind(&get_pc); |
| __ popl(temp); |
| __ movl(compiler::Address(FPREG, kSavedCallerPcSlotFromFp * kWordSize), |
| temp); |
| |
| ASSERT(!CanExecuteGeneratedCodeInSafepoint()); |
| // We cannot trust that this code will be executable within a safepoint. |
| // Therefore we delegate the responsibility of entering/exiting the |
| // safepoint to a stub which in the VM isolate's heap, which will never lose |
| // execute permission. |
| __ movl(temp, |
| compiler::Address( |
| THR, compiler::target::Thread:: |
| call_native_through_safepoint_entry_point_offset())); |
| |
| // Calls EAX within a safepoint and clobbers EBX. |
| ASSERT(branch == EAX); |
| __ call(temp); |
| } |
| |
| // Restore the stack when a struct by value is returned into memory pointed |
| // to by a pointer that is passed into the function. |
| if (CallingConventions::kUsesRet4 && |
| marshaller_.Location(compiler::ffi::kResultIndex).IsPointerToMemory()) { |
| // Callee uses `ret 4` instead of `ret` to return. |
| // See: https://c9x.me/x86/html/file_module_x86_id_280.html |
| // Caller does `sub esp, 4` immediately after return to balance stack. |
| __ subl(SPREG, compiler::Immediate(compiler::target::kWordSize)); |
| } |
| |
| // The x86 calling convention requires floating point values to be returned |
| // on the "floating-point stack" (aka. register ST0). We don't use the |
| // floating-point stack in Dart, so we need to move the return value back |
| // into an XMM register. |
| if (representation() == kUnboxedDouble) { |
| __ fstpl(compiler::Address(SPREG, -kDoubleSize)); |
| __ movsd(XMM0, compiler::Address(SPREG, -kDoubleSize)); |
| } else if (representation() == kUnboxedFloat) { |
| __ fstps(compiler::Address(SPREG, -kFloatSize)); |
| __ movss(XMM0, compiler::Address(SPREG, -kFloatSize)); |
| } |
| |
| // Pass both registers for use as clobbered temp registers. |
| EmitReturnMoves(compiler, saved_fp_or_sp, temp); |
| |
| if (is_leaf_) { |
| // Restore pre-align SP. Was stored right before the first stack argument. |
| __ movl(SPREG, |
| compiler::Address(SPREG, marshaller_.RequiredStackSpaceInBytes())); |
| } else { |
| // Leave dummy exit frame. |
| __ LeaveDartFrame(); |
| |
| // Instead of returning to the "fake" return address, we just pop it. |
| __ popl(temp); |
| } |
| } |
| |
| // Keep in sync with NativeReturnInstr::EmitNativeCode. |
| void NativeEntryInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ Bind(compiler->GetJumpLabel(this)); |
| |
| // Enter the entry frame. NativeParameterInstr expects this frame has size |
| // -exit_link_slot_from_entry_fp, verified below. |
| __ EnterFrame(0); |
| |
| // Save a space for the code object. |
| __ xorl(EAX, EAX); |
| __ pushl(EAX); |
| |
| #if defined(DART_TARGET_OS_FUCHSIA) && defined(USING_SHADOW_CALL_STACK) |
| #error Unimplemented |
| #endif |
| |
| // Save ABI callee-saved registers. |
| __ pushl(EBX); |
| __ pushl(ESI); |
| __ pushl(EDI); |
| |
| // Load the thread object. |
| // |
| // Create another frame to align the frame before continuing in "native" code. |
| // If we were called by a trampoline, it has already loaded the thread. |
| ASSERT(!FLAG_precompiled_mode); // No relocation for AOT linking. |
| if (!NativeCallbackTrampolines::Enabled()) { |
| __ EnterFrame(0); |
| __ ReserveAlignedFrameSpace(compiler::target::kWordSize); |
| |
| __ movl(compiler::Address(SPREG, 0), compiler::Immediate(callback_id_)); |
| __ movl(EAX, compiler::Immediate(reinterpret_cast<intptr_t>( |
| DLRT_GetThreadForNativeCallback))); |
| __ call(EAX); |
| __ movl(THR, EAX); |
| |
| __ LeaveFrame(); |
| } |
| |
| // Save the current VMTag on the stack. |
| __ movl(ECX, compiler::Assembler::VMTagAddress()); |
| __ pushl(ECX); |
| |
| // Save top resource. |
| __ pushl( |
| compiler::Address(THR, compiler::target::Thread::top_resource_offset())); |
| __ movl( |
| compiler::Address(THR, compiler::target::Thread::top_resource_offset()), |
| compiler::Immediate(0)); |
| |
| __ pushl(compiler::Address( |
| THR, compiler::target::Thread::exit_through_ffi_offset())); |
| |
| // Save top exit frame info. Stack walker expects it to be here. |
| __ pushl(compiler::Address( |
| THR, compiler::target::Thread::top_exit_frame_info_offset())); |
| |
| // In debug mode, verify that we've pushed the top exit frame info at the |
| // correct offset from FP. |
| __ EmitEntryFrameVerification(); |
| |
| // Either DLRT_GetThreadForNativeCallback or the callback trampoline (caller) |
| // will leave the safepoint for us. |
| __ TransitionNativeToGenerated(EAX, /*exit_safepoint=*/false); |
| |
| // Now that the safepoint has ended, we can hold Dart objects with bare hands. |
| |
| // Load the code object. |
| __ movl(EAX, compiler::Address( |
| THR, compiler::target::Thread::callback_code_offset())); |
| __ movl(EAX, compiler::FieldAddress( |
| EAX, compiler::target::GrowableObjectArray::data_offset())); |
| __ movl(CODE_REG, compiler::FieldAddress( |
| EAX, compiler::target::Array::data_offset() + |
| callback_id_ * compiler::target::kWordSize)); |
| |
| // Put the code object in the reserved slot. |
| __ movl(compiler::Address(FPREG, |
| kPcMarkerSlotFromFp * compiler::target::kWordSize), |
| CODE_REG); |
| |
| // Load a GC-safe value for the arguments descriptor (unused but tagged). |
| __ xorl(ARGS_DESC_REG, ARGS_DESC_REG); |
| |
| // Push a dummy return address which suggests that we are inside of |
| // InvokeDartCodeStub. This is how the stack walker detects an entry frame. |
| __ movl(EAX, |
| compiler::Address( |
| THR, compiler::target::Thread::invoke_dart_code_stub_offset())); |
| __ pushl(compiler::FieldAddress( |
| EAX, compiler::target::Code::entry_point_offset())); |
| |
| // Continue with Dart frame setup. |
| FunctionEntryInstr::EmitNativeCode(compiler); |
| } |
| |
| #define R(r) (1 << r) |
| |
| LocationSummary* CCallInstr::MakeLocationSummary(Zone* zone, |
| bool is_optimizing) const { |
| constexpr Register saved_fp = CallingConventions::kSecondNonArgumentRegister; |
| constexpr Register temp0 = CallingConventions::kFfiAnyNonAbiRegister; |
| static_assert(saved_fp < temp0, "Unexpected ordering of registers in set."); |
| return MakeLocationSummaryInternal(zone, (R(saved_fp) | R(temp0))); |
| } |
| |
| #undef R |
| |
| void CCallInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| const Register saved_fp = locs()->temp(0).reg(); |
| const Register temp0 = locs()->temp(1).reg(); |
| |
| __ MoveRegister(saved_fp, FPREG); |
| const intptr_t frame_space = native_calling_convention_.StackTopInBytes(); |
| __ EnterCFrame(frame_space); |
| |
| EmitParamMoves(compiler, saved_fp, temp0); |
| |
| const Register target_address = locs()->in(TargetAddressIndex()).reg(); |
| __ CallCFunction(target_address); |
| |
| __ LeaveCFrame(); |
| } |
| |
| static bool CanBeImmediateIndex(Value* value, intptr_t cid) { |
| ConstantInstr* constant = value->definition()->AsConstant(); |
| if ((constant == NULL) || |
| !compiler::Assembler::IsSafeSmi(constant->value())) { |
| return false; |
| } |
| const int64_t index = Smi::Cast(constant->value()).AsInt64Value(); |
| const intptr_t scale = Instance::ElementSizeFor(cid); |
| const intptr_t offset = Instance::DataOffsetFor(cid); |
| const int64_t displacement = index * scale + offset; |
| return Utils::IsInt(32, displacement); |
| } |
| |
| LocationSummary* OneByteStringFromCharCodeInstr::MakeLocationSummary( |
| Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 1; |
| // TODO(fschneider): Allow immediate operands for the char code. |
| return LocationSummary::Make(zone, kNumInputs, Location::RequiresRegister(), |
| LocationSummary::kNoCall); |
| } |
| |
| void OneByteStringFromCharCodeInstr::EmitNativeCode( |
| FlowGraphCompiler* compiler) { |
| Register char_code = locs()->in(0).reg(); |
| Register result = locs()->out(0).reg(); |
| __ movl(result, compiler::Immediate( |
| reinterpret_cast<uword>(Symbols::PredefinedAddress()))); |
| __ movl(result, |
| compiler::Address(result, char_code, |
| TIMES_HALF_WORD_SIZE, // Char code is a smi. |
| Symbols::kNullCharCodeSymbolOffset * kWordSize)); |
| } |
| |
| LocationSummary* StringToCharCodeInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 1; |
| return LocationSummary::Make(zone, kNumInputs, Location::RequiresRegister(), |
| LocationSummary::kNoCall); |
| } |
| |
| void StringToCharCodeInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| ASSERT(cid_ == kOneByteStringCid); |
| Register str = locs()->in(0).reg(); |
| Register result = locs()->out(0).reg(); |
| compiler::Label is_one, done; |
| __ movl(result, compiler::FieldAddress(str, String::length_offset())); |
| __ cmpl(result, compiler::Immediate(Smi::RawValue(1))); |
| __ j(EQUAL, &is_one, compiler::Assembler::kNearJump); |
| __ movl(result, compiler::Immediate(Smi::RawValue(-1))); |
| __ jmp(&done); |
| __ Bind(&is_one); |
| __ movzxb(result, compiler::FieldAddress(str, OneByteString::data_offset())); |
| __ SmiTag(result); |
| __ Bind(&done); |
| } |
| |
| LocationSummary* Utf8ScanInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 5; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, Location::Any()); // decoder |
| summary->set_in(1, Location::WritableRegister()); // bytes |
| summary->set_in(2, Location::WritableRegister()); // start |
| summary->set_in(3, Location::WritableRegister()); // end |
| summary->set_in(4, Location::RequiresRegister()); // table |
| summary->set_out(0, Location::RequiresRegister()); |
| return summary; |
| } |
| |
| void Utf8ScanInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| const Register bytes_reg = locs()->in(1).reg(); |
| const Register start_reg = locs()->in(2).reg(); |
| const Register end_reg = locs()->in(3).reg(); |
| const Register table_reg = locs()->in(4).reg(); |
| const Register size_reg = locs()->out(0).reg(); |
| |
| const Register bytes_ptr_reg = start_reg; |
| const Register flags_reg = end_reg; |
| const Register temp_reg = bytes_reg; |
| const XmmRegister vector_reg = FpuTMP; |
| |
| static const intptr_t kBytesEndTempOffset = 1 * compiler::target::kWordSize; |
| static const intptr_t kBytesEndMinus16TempOffset = |
| 0 * compiler::target::kWordSize; |
| |
| static const intptr_t kSizeMask = 0x03; |
| static const intptr_t kFlagsMask = 0x3C; |
| |
| compiler::Label scan_ascii, ascii_loop, ascii_loop_in, nonascii_loop; |
| compiler::Label rest, rest_loop, rest_loop_in, done; |
| |
| // Address of input bytes. |
| __ movl(bytes_reg, |
| compiler::FieldAddress(bytes_reg, |
| compiler::target::PointerBase::data_offset())); |
| |
| // Pointers to start, end and end-16. |
| __ leal(bytes_ptr_reg, compiler::Address(bytes_reg, start_reg, TIMES_1, 0)); |
| __ leal(temp_reg, compiler::Address(bytes_reg, end_reg, TIMES_1, 0)); |
| __ pushl(temp_reg); |
| __ leal(temp_reg, compiler::Address(temp_reg, -16)); |
| __ pushl(temp_reg); |
| |
| // Initialize size and flags. |
| __ xorl(size_reg, size_reg); |
| __ xorl(flags_reg, flags_reg); |
| |
| __ jmp(&scan_ascii, compiler::Assembler::kNearJump); |
| |
| // Loop scanning through ASCII bytes one 16-byte vector at a time. |
| // While scanning, the size register contains the size as it was at the start |
| // of the current block of ASCII bytes, minus the address of the start of the |
| // block. After the block, the end address of the block is added to update the |
| // size to include the bytes in the block. |
| __ Bind(&ascii_loop); |
| __ addl(bytes_ptr_reg, compiler::Immediate(16)); |
| __ Bind(&ascii_loop_in); |
| |
| // Exit vectorized loop when there are less than 16 bytes left. |
| __ cmpl(bytes_ptr_reg, compiler::Address(ESP, kBytesEndMinus16TempOffset)); |
| __ j(UNSIGNED_GREATER, &rest, compiler::Assembler::kNearJump); |
| |
| // Find next non-ASCII byte within the next 16 bytes. |
| // Note: In principle, we should use MOVDQU here, since the loaded value is |
| // used as input to an integer instruction. In practice, according to Agner |
| // Fog, there is no penalty for using the wrong kind of load. |
| __ movups(vector_reg, compiler::Address(bytes_ptr_reg, 0)); |
| __ pmovmskb(temp_reg, vector_reg); |
| __ bsfl(temp_reg, temp_reg); |
| __ j(EQUAL, &ascii_loop, compiler::Assembler::kNearJump); |
| |
| // Point to non-ASCII byte and update size. |
| __ addl(bytes_ptr_reg, temp_reg); |
| __ addl(size_reg, bytes_ptr_reg); |
| |
| // Read first non-ASCII byte. |
| __ movzxb(temp_reg, compiler::Address(bytes_ptr_reg, 0)); |
| |
| // Loop over block of non-ASCII bytes. |
| __ Bind(&nonascii_loop); |
| __ addl(bytes_ptr_reg, compiler::Immediate(1)); |
| |
| // Update size and flags based on byte value. |
| __ movzxb(temp_reg, compiler::FieldAddress( |
| table_reg, temp_reg, TIMES_1, |
| compiler::target::OneByteString::data_offset())); |
| __ orl(flags_reg, temp_reg); |
| __ andl(temp_reg, compiler::Immediate(kSizeMask)); |
| __ addl(size_reg, temp_reg); |
| |
| // Stop if end is reached. |
| __ cmpl(bytes_ptr_reg, compiler::Address(ESP, kBytesEndTempOffset)); |
| __ j(UNSIGNED_GREATER_EQUAL, &done, compiler::Assembler::kNearJump); |
| |
| // Go to ASCII scan if next byte is ASCII, otherwise loop. |
| __ movzxb(temp_reg, compiler::Address(bytes_ptr_reg, 0)); |
| __ testl(temp_reg, compiler::Immediate(0x80)); |
| __ j(NOT_EQUAL, &nonascii_loop, compiler::Assembler::kNearJump); |
| |
| // Enter the ASCII scanning loop. |
| __ Bind(&scan_ascii); |
| __ subl(size_reg, bytes_ptr_reg); |
| __ jmp(&ascii_loop_in); |
| |
| // Less than 16 bytes left. Process the remaining bytes individually. |
| __ Bind(&rest); |
| |
| // Update size after ASCII scanning loop. |
| __ addl(size_reg, bytes_ptr_reg); |
| __ jmp(&rest_loop_in, compiler::Assembler::kNearJump); |
| |
| __ Bind(&rest_loop); |
| |
| // Read byte and increment pointer. |
| __ movzxb(temp_reg, compiler::Address(bytes_ptr_reg, 0)); |
| __ addl(bytes_ptr_reg, compiler::Immediate(1)); |
| |
| // Update size and flags based on byte value. |
| __ movzxb(temp_reg, compiler::FieldAddress( |
| table_reg, temp_reg, TIMES_1, |
| compiler::target::OneByteString::data_offset())); |
| __ orl(flags_reg, temp_reg); |
| __ andl(temp_reg, compiler::Immediate(kSizeMask)); |
| __ addl(size_reg, temp_reg); |
| |
| // Stop if end is reached. |
| __ Bind(&rest_loop_in); |
| __ cmpl(bytes_ptr_reg, compiler::Address(ESP, kBytesEndTempOffset)); |
| __ j(UNSIGNED_LESS, &rest_loop, compiler::Assembler::kNearJump); |
| __ Bind(&done); |
| |
| // Pop temporaries. |
| __ addl(ESP, compiler::Immediate(2 * compiler::target::kWordSize)); |
| |
| // Write flags to field. |
| __ andl(flags_reg, compiler::Immediate(kFlagsMask)); |
| if (!IsScanFlagsUnboxed()) { |
| __ SmiTag(flags_reg); |
| } |
| Register decoder_reg; |
| const Location decoder_location = locs()->in(0); |
| if (decoder_location.IsStackSlot()) { |
| __ movl(temp_reg, LocationToStackSlotAddress(decoder_location)); |
| decoder_reg = temp_reg; |
| } else { |
| decoder_reg = decoder_location.reg(); |
| } |
| const auto scan_flags_field_offset = scan_flags_field_.offset_in_bytes(); |
| __ orl(compiler::FieldAddress(decoder_reg, scan_flags_field_offset), |
| flags_reg); |
| } |
| |
| LocationSummary* LoadUntaggedInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 1; |
| return LocationSummary::Make(zone, kNumInputs, Location::SameAsFirstInput(), |
| LocationSummary::kNoCall); |
| } |
| |
| void LoadUntaggedInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Register obj = locs()->in(0).reg(); |
| Register result = locs()->out(0).reg(); |
| if (object()->definition()->representation() == kUntagged) { |
| __ movl(result, compiler::Address(obj, offset())); |
| } else { |
| ASSERT(object()->definition()->representation() == kTagged); |
| __ movl(result, compiler::FieldAddress(obj, offset())); |
| } |
| } |
| |
| LocationSummary* LoadIndexedInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::RequiresRegister()); |
| if (CanBeImmediateIndex(index(), class_id())) { |
| // CanBeImmediateIndex must return false for unsafe smis. |
| locs->set_in(1, Location::Constant(index()->definition()->AsConstant())); |
| } else { |
| // The index is either untagged (element size == 1) or a smi (for all |
| // element sizes > 1). |
| locs->set_in(1, (index_scale() == 1) ? Location::WritableRegister() |
| : Location::RequiresRegister()); |
| } |
| if ((representation() == kUnboxedFloat) || |
| (representation() == kUnboxedDouble) || |
| (representation() == kUnboxedFloat32x4) || |
| (representation() == kUnboxedInt32x4) || |
| (representation() == kUnboxedFloat64x2)) { |
| locs->set_out(0, Location::RequiresFpuRegister()); |
| } else if (representation() == kUnboxedInt64) { |
| ASSERT(class_id() == kTypedDataInt64ArrayCid || |
| class_id() == kTypedDataUint64ArrayCid); |
| locs->set_out(0, Location::Pair(Location::RequiresRegister(), |
| Location::RequiresRegister())); |
| } else { |
| locs->set_out(0, Location::RequiresRegister()); |
| } |
| return locs; |
| } |
| |
| void LoadIndexedInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| // The array register points to the backing store for external arrays. |
| const Register array = locs()->in(0).reg(); |
| const Location index = locs()->in(1); |
| |
| compiler::Address element_address = |
| index.IsRegister() ? compiler::Assembler::ElementAddressForRegIndex( |
| IsExternal(), class_id(), index_scale(), |
| index_unboxed_, array, index.reg()) |
| : compiler::Assembler::ElementAddressForIntIndex( |
| IsExternal(), class_id(), index_scale(), array, |
| Smi::Cast(index.constant()).Value()); |
| |
| if (index_scale() == 1 && !index_unboxed_) { |
| if (index.IsRegister()) { |
| __ SmiUntag(index.reg()); |
| } else { |
| ASSERT(index.IsConstant()); |
| } |
| } |
| |
| if ((representation() == kUnboxedFloat) || |
| (representation() == kUnboxedDouble) || |
| (representation() == kUnboxedFloat32x4) || |
| (representation() == kUnboxedInt32x4) || |
| (representation() == kUnboxedFloat64x2)) { |
| XmmRegister result = locs()->out(0).fpu_reg(); |
| switch (class_id()) { |
| case kTypedDataFloat32ArrayCid: |
| __ movss(result, element_address); |
| break; |
| case kTypedDataFloat64ArrayCid: |
| __ movsd(result, element_address); |
| break; |
| case kTypedDataInt32x4ArrayCid: |
| case kTypedDataFloat32x4ArrayCid: |
| case kTypedDataFloat64x2ArrayCid: |
| __ movups(result, element_address); |
| break; |
| default: |
| UNREACHABLE(); |
| } |
| return; |
| } |
| |
| switch (class_id()) { |
| case kTypedDataInt32ArrayCid: { |
| const Register result = locs()->out(0).reg(); |
| ASSERT(representation() == kUnboxedInt32); |
| __ movl(result, element_address); |
| break; |
| } |
| case kTypedDataUint32ArrayCid: { |
| const Register result = locs()->out(0).reg(); |
| ASSERT(representation() == kUnboxedUint32); |
| __ movl(result, element_address); |
| break; |
| } |
| case kTypedDataInt64ArrayCid: |
| case kTypedDataUint64ArrayCid: { |
| ASSERT(representation() == kUnboxedInt64); |
| ASSERT(locs()->out(0).IsPairLocation()); |
| PairLocation* result_pair = locs()->out(0).AsPairLocation(); |
| const Register result_lo = result_pair->At(0).reg(); |
| const Register result_hi = result_pair->At(1).reg(); |
| ASSERT(class_id() == kTypedDataInt64ArrayCid || |
| class_id() == kTypedDataUint64ArrayCid); |
| __ movl(result_lo, element_address); |
| element_address = |
| index.IsRegister() |
| ? compiler::Assembler::ElementAddressForRegIndex( |
| IsExternal(), class_id(), index_scale(), index_unboxed_, |
| array, index.reg(), kWordSize) |
| : compiler::Assembler::ElementAddressForIntIndex( |
| IsExternal(), class_id(), index_scale(), array, |
| Smi::Cast(index.constant()).Value(), kWordSize); |
| __ movl(result_hi, element_address); |
| break; |
| } |
| case kTypedDataInt8ArrayCid: { |
| const Register result = locs()->out(0).reg(); |
| ASSERT(representation() == kUnboxedIntPtr); |
| ASSERT(index_scale() == 1); |
| __ movsxb(result, element_address); |
| break; |
| } |
| case kTypedDataUint8ArrayCid: |
| case kTypedDataUint8ClampedArrayCid: |
| case kExternalTypedDataUint8ArrayCid: |
| case kExternalTypedDataUint8ClampedArrayCid: |
| case kOneByteStringCid: |
| case kExternalOneByteStringCid: { |
| const Register result = locs()->out(0).reg(); |
| ASSERT(representation() == kUnboxedIntPtr); |
| ASSERT(index_scale() == 1); |
| __ movzxb(result, element_address); |
| break; |
| } |
| case kTypedDataInt16ArrayCid: { |
| const Register result = locs()->out(0).reg(); |
| ASSERT(representation() == kUnboxedIntPtr); |
| __ movsxw(result, element_address); |
| break; |
| } |
| case kTypedDataUint16ArrayCid: |
| case kTwoByteStringCid: |
| case kExternalTwoByteStringCid: { |
| const Register result = locs()->out(0).reg(); |
| ASSERT(representation() == kUnboxedIntPtr); |
| __ movzxw(result, element_address); |
| break; |
| } |
| default: { |
| const Register result = locs()->out(0).reg(); |
| ASSERT(representation() == kTagged); |
| ASSERT((class_id() == kArrayCid) || (class_id() == kImmutableArrayCid) || |
| (class_id() == kTypeArgumentsCid)); |
| __ movl(result, element_address); |
| break; |
| } |
| } |
| } |
| |
| LocationSummary* StoreIndexedInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 3; |
| const intptr_t kNumTemps = |
| class_id() == kArrayCid && ShouldEmitStoreBarrier() ? 1 : 0; |
| LocationSummary* locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::RequiresRegister()); |
| if (CanBeImmediateIndex(index(), class_id())) { |
| // CanBeImmediateIndex must return false for unsafe smis. |
| locs->set_in(1, Location::Constant(index()->definition()->AsConstant())); |
| } else { |
| // The index is either untagged (element size == 1) or a smi (for all |
| // element sizes > 1). |
| locs->set_in(1, (index_scale() == 1) ? Location::WritableRegister() |
| : Location::RequiresRegister()); |
| } |
| switch (class_id()) { |
| case kArrayCid: |
| locs->set_in(2, ShouldEmitStoreBarrier() |
| ? Location::WritableRegister() |
| : LocationRegisterOrConstant(value())); |
| if (ShouldEmitStoreBarrier()) { |
| locs->set_in(0, Location::RegisterLocation(kWriteBarrierObjectReg)); |
| locs->set_temp(0, Location::RegisterLocation(kWriteBarrierSlotReg)); |
| } |
| break; |
| case kExternalTypedDataUint8ArrayCid: |
| case kExternalTypedDataUint8ClampedArrayCid: |
| case kTypedDataInt8ArrayCid: |
| case kTypedDataUint8ArrayCid: |
| case kTypedDataUint8ClampedArrayCid: |
| case kOneByteStringCid: |
| case kTwoByteStringCid: |
| // TODO(fschneider): Add location constraint for byte registers (EAX, |
| // EBX, ECX, EDX) instead of using a fixed register. |
| locs->set_in(2, LocationFixedRegisterOrSmiConstant(value(), EAX)); |
| break; |
| case kTypedDataInt16ArrayCid: |
| case kTypedDataUint16ArrayCid: |
| // Writable register because the value must be untagged before storing. |
| locs->set_in(2, Location::WritableRegister()); |
| break; |
| case kTypedDataInt32ArrayCid: |
| case kTypedDataUint32ArrayCid: |
| locs->set_in(2, Location::RequiresRegister()); |
| break; |
| case kTypedDataInt64ArrayCid: |
| case kTypedDataUint64ArrayCid: |
| locs->set_in(2, Location::Pair(Location::RequiresRegister(), |
| Location::RequiresRegister())); |
| break; |
| case kTypedDataFloat32ArrayCid: |
| case kTypedDataFloat64ArrayCid: |
| // TODO(srdjan): Support Float64 constants. |
| locs->set_in(2, Location::RequiresFpuRegister()); |
| break; |
| case kTypedDataInt32x4ArrayCid: |
| case kTypedDataFloat32x4ArrayCid: |
| case kTypedDataFloat64x2ArrayCid: |
| locs->set_in(2, Location::RequiresFpuRegister()); |
| break; |
| default: |
| UNREACHABLE(); |
| return NULL; |
| } |
| return locs; |
| } |
| |
| void StoreIndexedInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| // The array register points to the backing store for external arrays. |
| const Register array = locs()->in(0).reg(); |
| const Location index = locs()->in(1); |
| |
| compiler::Address element_address = |
| index.IsRegister() ? compiler::Assembler::ElementAddressForRegIndex( |
| IsExternal(), class_id(), index_scale(), |
| index_unboxed_, array, index.reg()) |
| : compiler::Assembler::ElementAddressForIntIndex( |
| IsExternal(), class_id(), index_scale(), array, |
| Smi::Cast(index.constant()).Value()); |
| |
| if ((index_scale() == 1) && index.IsRegister() && !index_unboxed_) { |
| __ SmiUntag(index.reg()); |
| } |
| switch (class_id()) { |
| case kArrayCid: |
| if (ShouldEmitStoreBarrier()) { |
| Register value = locs()->in(2).reg(); |
| Register slot = locs()->temp(0).reg(); |
| __ leal(slot, element_address); |
| __ StoreIntoArray(array, slot, value, CanValueBeSmi()); |
| } else if (locs()->in(2).IsConstant()) { |
| const Object& constant = locs()->in(2).constant(); |
| __ StoreIntoObjectNoBarrier(array, element_address, constant); |
| } else { |
| Register value = locs()->in(2).reg(); |
| __ StoreIntoObjectNoBarrier(array, element_address, value); |
| } |
| break; |
| case kTypedDataInt8ArrayCid: |
| case kTypedDataUint8ArrayCid: |
| case kExternalTypedDataUint8ArrayCid: |
| case kOneByteStringCid: |
| ASSERT(RequiredInputRepresentation(2) == kUnboxedIntPtr); |
| if (locs()->in(2).IsConstant()) { |
| const Smi& constant = Smi::Cast(locs()->in(2).constant()); |
| __ movb(element_address, |
| compiler::Immediate(static_cast<int8_t>(constant.Value()))); |
| } else { |
| ASSERT(locs()->in(2).reg() == EAX); |
| __ movb(element_address, AL); |
| } |
| break; |
| case kTypedDataUint8ClampedArrayCid: |
| case kExternalTypedDataUint8ClampedArrayCid: { |
| ASSERT(RequiredInputRepresentation(2) == kUnboxedIntPtr); |
| if (locs()->in(2).IsConstant()) { |
| const Smi& constant = Smi::Cast(locs()->in(2).constant()); |
| intptr_t value = constant.Value(); |
| // Clamp to 0x0 or 0xFF respectively. |
| if (value > 0xFF) { |
| value = 0xFF; |
| } else if (value < 0) { |
| value = 0; |
| } |
| __ movb(element_address, |
| compiler::Immediate(static_cast<int8_t>(value))); |
| } else { |
| ASSERT(locs()->in(2).reg() == EAX); |
| compiler::Label store_value, store_0xff; |
| __ cmpl(EAX, compiler::Immediate(0xFF)); |
| __ j(BELOW_EQUAL, &store_value, compiler::Assembler::kNearJump); |
| // Clamp to 0x0 or 0xFF respectively. |
| __ j(GREATER, &store_0xff); |
| __ xorl(EAX, EAX); |
| __ jmp(&store_value, compiler::Assembler::kNearJump); |
| __ Bind(&store_0xff); |
| __ movl(EAX, compiler::Immediate(0xFF)); |
| __ Bind(&store_value); |
| __ movb(element_address, AL); |
| } |
| break; |
| } |
| case kTwoByteStringCid: |
| case kTypedDataInt16ArrayCid: |
| case kTypedDataUint16ArrayCid: { |
| ASSERT(RequiredInputRepresentation(2) == kUnboxedIntPtr); |
| const Register value = locs()->in(2).reg(); |
| __ movw(element_address, value); |
| break; |
| } |
| case kTypedDataInt32ArrayCid: |
| case kTypedDataUint32ArrayCid: |
| __ movl(element_address, locs()->in(2).reg()); |
| break; |
| case kTypedDataInt64ArrayCid: |
| case kTypedDataUint64ArrayCid: { |
| ASSERT(locs()->in(2).IsPairLocation()); |
| PairLocation* value_pair = locs()->in(2).AsPairLocation(); |
| const Register value_lo = value_pair->At(0).reg(); |
| const Register value_hi = value_pair->At(1).reg(); |
| __ movl(element_address, value_lo); |
| element_address = |
| index.IsRegister() |
| ? compiler::Assembler::ElementAddressForRegIndex( |
| IsExternal(), class_id(), index_scale(), index_unboxed_, |
| array, index.reg(), kWordSize) |
| : compiler::Assembler::ElementAddressForIntIndex( |
| IsExternal(), class_id(), index_scale(), array, |
| Smi::Cast(index.constant()).Value(), kWordSize); |
| __ movl(element_address, value_hi); |
| break; |
| } |
| case kTypedDataFloat32ArrayCid: |
| __ movss(element_address, locs()->in(2).fpu_reg()); |
| break; |
| case kTypedDataFloat64ArrayCid: |
| __ movsd(element_address, locs()->in(2).fpu_reg()); |
| break; |
| case kTypedDataInt32x4ArrayCid: |
| case kTypedDataFloat32x4ArrayCid: |
| case kTypedDataFloat64x2ArrayCid: |
| __ movups(element_address, locs()->in(2).fpu_reg()); |
| break; |
| default: |
| UNREACHABLE(); |
| } |
| } |
| |
| DEFINE_UNIMPLEMENTED_INSTRUCTION(GuardFieldTypeInstr) |
| DEFINE_UNIMPLEMENTED_INSTRUCTION(CheckConditionInstr) |
| |
| LocationSummary* GuardFieldClassInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 1; |
| |
| const intptr_t value_cid = value()->Type()->ToCid(); |
| const intptr_t field_cid = field().guarded_cid(); |
| |
| const bool emit_full_guard = !opt || (field_cid == kIllegalCid); |
| const bool needs_value_cid_temp_reg = |
| (value_cid == kDynamicCid) && (emit_full_guard || (field_cid != kSmiCid)); |
| const bool needs_field_temp_reg = emit_full_guard; |
| |
| intptr_t num_temps = 0; |
| if (needs_value_cid_temp_reg) { |
| num_temps++; |
| } |
| if (needs_field_temp_reg) { |
| num_temps++; |
| } |
| |
| LocationSummary* summary = new (zone) |
| LocationSummary(zone, kNumInputs, num_temps, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RequiresRegister()); |
| |
| for (intptr_t i = 0; i < num_temps; i++) { |
| summary->set_temp(i, Location::RequiresRegister()); |
| } |
| |
| return summary; |
| } |
| |
| void GuardFieldClassInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| ASSERT(compiler::target::UntaggedObject::kClassIdTagSize == 16); |
| ASSERT(sizeof(UntaggedField::guarded_cid_) == 2); |
| ASSERT(sizeof(UntaggedField::is_nullable_) == 2); |
| |
| const intptr_t value_cid = value()->Type()->ToCid(); |
| const intptr_t field_cid = field().guarded_cid(); |
| const intptr_t nullability = field().is_nullable() ? kNullCid : kIllegalCid; |
| |
| if (field_cid == kDynamicCid) { |
| return; // Nothing to emit. |
| } |
| |
| const bool emit_full_guard = |
| !compiler->is_optimizing() || (field_cid == kIllegalCid); |
| |
| const bool needs_value_cid_temp_reg = |
| (value_cid == kDynamicCid) && (emit_full_guard || (field_cid != kSmiCid)); |
| |
| const bool needs_field_temp_reg = emit_full_guard; |
| |
| const Register value_reg = locs()->in(0).reg(); |
| |
| const Register value_cid_reg = |
| needs_value_cid_temp_reg ? locs()->temp(0).reg() : kNoRegister; |
| |
| const Register field_reg = needs_field_temp_reg |
| ? locs()->temp(locs()->temp_count() - 1).reg() |
| : kNoRegister; |
| |
| compiler::Label ok, fail_label; |
| |
| compiler::Label* deopt = nullptr; |
| if (compiler->is_optimizing()) { |
| deopt = compiler->AddDeoptStub(deopt_id(), ICData::kDeoptGuardField); |
| } |
| |
| compiler::Label* fail = (deopt != NULL) ? deopt : &fail_label; |
| |
| if (emit_full_guard) { |
| __ LoadObject(field_reg, Field::ZoneHandle(field().Original())); |
| |
| compiler::FieldAddress field_cid_operand(field_reg, |
| Field::guarded_cid_offset()); |
| compiler::FieldAddress field_nullability_operand( |
| field_reg, Field::is_nullable_offset()); |
| |
| if (value_cid == kDynamicCid) { |
| LoadValueCid(compiler, value_cid_reg, value_reg); |
| __ cmpw(value_cid_reg, field_cid_operand); |
| __ j(EQUAL, &ok); |
| __ cmpw(value_cid_reg, field_nullability_operand); |
| } else if (value_cid == kNullCid) { |
| // Value in graph known to be null. |
| // Compare with null. |
| __ cmpw(field_nullability_operand, compiler::Immediate(value_cid)); |
| } else { |
| // Value in graph known to be non-null. |
| // Compare class id with guard field class id. |
| __ cmpw(field_cid_operand, compiler::Immediate(value_cid)); |
| } |
| __ j(EQUAL, &ok); |
| |
| // Check if the tracked state of the guarded field can be initialized |
| // inline. If the field needs length check we fall through to runtime |
| // which is responsible for computing offset of the length field |
| // based on the class id. |
| // Length guard will be emitted separately when needed via GuardFieldLength |
| // instruction after GuardFieldClass. |
| if (!field().needs_length_check()) { |
| // Uninitialized field can be handled inline. Check if the |
| // field is still unitialized. |
| __ cmpw(field_cid_operand, compiler::Immediate(kIllegalCid)); |
| // Jump to failure path when guard field has been initialized and |
| // the field and value class ids do not not match. |
| __ j(NOT_EQUAL, fail); |
| |
| if (value_cid == kDynamicCid) { |
| // Do not know value's class id. |
| __ movw(field_cid_operand, value_cid_reg); |
| __ movw(field_nullability_operand, value_cid_reg); |
| } else { |
| ASSERT(field_reg != kNoRegister); |
| __ movw(field_cid_operand, compiler::Immediate(value_cid)); |
| __ movw(field_nullability_operand, compiler::Immediate(value_cid)); |
| } |
| |
| __ jmp(&ok); |
| } |
| |
| if (deopt == NULL) { |
| __ Bind(fail); |
| |
| __ cmpw(compiler::FieldAddress(field_reg, Field::guarded_cid_offset()), |
| compiler::Immediate(kDynamicCid)); |
| __ j(EQUAL, &ok); |
| |
| __ pushl(field_reg); |
| __ pushl(value_reg); |
| ASSERT(!compiler->is_optimizing()); // No deopt info needed. |
| __ CallRuntime(kUpdateFieldCidRuntimeEntry, 2); |
| __ Drop(2); // Drop the field and the value. |
| } else { |
| __ jmp(fail); |
| } |
| } else { |
| ASSERT(compiler->is_optimizing()); |
| ASSERT(deopt != NULL); |
| ASSERT(fail == deopt); |
| |
| // Field guard class has been initialized and is known. |
| if (value_cid == kDynamicCid) { |
| // Value's class id is not known. |
| __ testl(value_reg, compiler::Immediate(kSmiTagMask)); |
| |
| if (field_cid != kSmiCid) { |
| __ j(ZERO, fail); |
| __ LoadClassId(value_cid_reg, value_reg); |
| __ cmpl(value_cid_reg, compiler::Immediate(field_cid)); |
| } |
| |
| if (field().is_nullable() && (field_cid != kNullCid)) { |
| __ j(EQUAL, &ok); |
| if (field_cid != kSmiCid) { |
| __ cmpl(value_cid_reg, compiler::Immediate(kNullCid)); |
| } else { |
| const compiler::Immediate& raw_null = |
| compiler::Immediate(static_cast<intptr_t>(Object::null())); |
| __ cmpl(value_reg, raw_null); |
| } |
| } |
| __ j(NOT_EQUAL, fail); |
| } else if (value_cid == field_cid) { |
| // This would normaly be caught by Canonicalize, but RemoveRedefinitions |
| // may sometimes produce the situation after the last Canonicalize pass. |
| } else { |
| // Both value's and field's class id is known. |
| ASSERT(value_cid != nullability); |
| __ jmp(fail); |
| } |
| } |
| __ Bind(&ok); |
| } |
| |
| LocationSummary* GuardFieldLengthInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 1; |
| if (!opt || (field().guarded_list_length() == Field::kUnknownFixedLength)) { |
| const intptr_t kNumTemps = 3; |
| LocationSummary* summary = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RequiresRegister()); |
| // We need temporaries for field object, length offset and expected length. |
| summary->set_temp(0, Location::RequiresRegister()); |
| summary->set_temp(1, Location::RequiresRegister()); |
| summary->set_temp(2, Location::RequiresRegister()); |
| return summary; |
| } else { |
| LocationSummary* summary = new (zone) |
| LocationSummary(zone, kNumInputs, 0, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RequiresRegister()); |
| return summary; |
| } |
| UNREACHABLE(); |
| } |
| |
| void GuardFieldLengthInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| if (field().guarded_list_length() == Field::kNoFixedLength) { |
| return; // Nothing to emit. |
| } |
| |
| compiler::Label* deopt = |
| compiler->is_optimizing() |
| ? compiler->AddDeoptStub(deopt_id(), ICData::kDeoptGuardField) |
| : NULL; |
| |
| const Register value_reg = locs()->in(0).reg(); |
| |
| if (!compiler->is_optimizing() || |
| (field().guarded_list_length() == Field::kUnknownFixedLength)) { |
| const Register field_reg = locs()->temp(0).reg(); |
| const Register offset_reg = locs()->temp(1).reg(); |
| const Register length_reg = locs()->temp(2).reg(); |
| |
| compiler::Label ok; |
| |
| __ LoadObject(field_reg, Field::ZoneHandle(field().Original())); |
| |
| __ movsxb( |
| offset_reg, |
| compiler::FieldAddress( |
| field_reg, Field::guarded_list_length_in_object_offset_offset())); |
| __ movl(length_reg, compiler::FieldAddress( |
| field_reg, Field::guarded_list_length_offset())); |
| |
| __ cmpl(offset_reg, compiler::Immediate(0)); |
| __ j(NEGATIVE, &ok); |
| |
| // Load the length from the value. GuardFieldClass already verified that |
| // value's class matches guarded class id of the field. |
| // offset_reg contains offset already corrected by -kHeapObjectTag that is |
| // why we use Address instead of FieldAddress. |
| __ cmpl(length_reg, compiler::Address(value_reg, offset_reg, TIMES_1, 0)); |
| |
| if (deopt == NULL) { |
| __ j(EQUAL, &ok); |
| |
| __ pushl(field_reg); |
| __ pushl(value_reg); |
| ASSERT(!compiler->is_optimizing()); // No deopt info needed. |
| __ CallRuntime(kUpdateFieldCidRuntimeEntry, 2); |
| __ Drop(2); // Drop the field and the value. |
| } else { |
| __ j(NOT_EQUAL, deopt); |
| } |
| |
| __ Bind(&ok); |
| } else { |
| ASSERT(compiler->is_optimizing()); |
| ASSERT(field().guarded_list_length() >= 0); |
| ASSERT(field().guarded_list_length_in_object_offset() != |
| Field::kUnknownLengthOffset); |
| |
| __ cmpl(compiler::FieldAddress( |
| value_reg, field().guarded_list_length_in_object_offset()), |
| compiler::Immediate(Smi::RawValue(field().guarded_list_length()))); |
| __ j(NOT_EQUAL, deopt); |
| } |
| } |
| |
| LocationSummary* StoreInstanceFieldInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = |
| (IsUnboxedDartFieldStore() && opt) |
| ? 2 |
| : ((IsPotentialUnboxedDartFieldStore()) ? 3 : 0); |
| LocationSummary* summary = new (zone) LocationSummary( |
| zone, kNumInputs, kNumTemps, |
| ((IsUnboxedDartFieldStore() && opt && is_initialization()) || |
| IsPotentialUnboxedDartFieldStore()) |
| ? LocationSummary::kCallOnSlowPath |
| : LocationSummary::kNoCall); |
| |
| summary->set_in(kInstancePos, Location::RequiresRegister()); |
| if (slot().representation() != kTagged) { |
| ASSERT(RepresentationUtils::IsUnboxedInteger(slot().representation())); |
| const size_t value_size = |
| RepresentationUtils::ValueSize(slot().representation()); |
| if (value_size <= compiler::target::kWordSize) { |
| summary->set_in(kValuePos, Location::RequiresRegister()); |
| } else { |
| ASSERT(value_size <= 2 * compiler::target::kWordSize); |
| summary->set_in(kValuePos, Location::Pair(Location::RequiresRegister(), |
| Location::RequiresRegister())); |
| } |
| } else if (IsUnboxedDartFieldStore() && opt) { |
| summary->set_in(kValuePos, Location::RequiresFpuRegister()); |
| summary->set_temp(0, Location::RequiresRegister()); |
| summary->set_temp(1, Location::RequiresRegister()); |
| } else if (IsPotentialUnboxedDartFieldStore()) { |
| summary->set_in(kValuePos, ShouldEmitStoreBarrier() |
| ? Location::WritableRegister() |
| : Location::RequiresRegister()); |
| summary->set_temp(0, Location::RequiresRegister()); |
| summary->set_temp(1, Location::RequiresRegister()); |
| summary->set_temp(2, opt ? Location::RequiresFpuRegister() |
| : Location::FpuRegisterLocation(XMM1)); |
| } else { |
| summary->set_in(kValuePos, ShouldEmitStoreBarrier() |
| ? Location::WritableRegister() |
| : LocationRegisterOrConstant(value())); |
| } |
| return summary; |
| } |
| |
| static void EnsureMutableBox(FlowGraphCompiler* compiler, |
| StoreInstanceFieldInstr* instruction, |
| Register box_reg, |
| const Class& cls, |
| Register instance_reg, |
| intptr_t offset, |
| Register temp) { |
| compiler::Label done; |
| const compiler::Immediate& raw_null = |
| compiler::Immediate(static_cast<intptr_t>(Object::null())); |
| __ movl(box_reg, compiler::FieldAddress(instance_reg, offset)); |
| __ cmpl(box_reg, raw_null); |
| __ j(NOT_EQUAL, &done); |
| BoxAllocationSlowPath::Allocate(compiler, instruction, cls, box_reg, temp); |
| __ movl(temp, box_reg); |
| __ StoreIntoObject(instance_reg, compiler::FieldAddress(instance_reg, offset), |
| temp, compiler::Assembler::kValueIsNotSmi); |
| |
| __ Bind(&done); |
| } |
| |
| void StoreInstanceFieldInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| ASSERT(compiler::target::UntaggedObject::kClassIdTagSize == 16); |
| ASSERT(sizeof(UntaggedField::guarded_cid_) == 2); |
| ASSERT(sizeof(UntaggedField::is_nullable_) == 2); |
| |
| compiler::Label skip_store; |
| |
| const Register instance_reg = locs()->in(kInstancePos).reg(); |
| const intptr_t offset_in_bytes = OffsetInBytes(); |
| ASSERT(offset_in_bytes > 0); // Field is finalized and points after header. |
| |
| if (slot().representation() != kTagged) { |
| ASSERT(memory_order_ != compiler::AssemblerBase::kRelease); |
| auto const rep = slot().representation(); |
| ASSERT(RepresentationUtils::IsUnboxedInteger(rep)); |
| const size_t value_size = RepresentationUtils::ValueSize(rep); |
| __ Comment("NativeUnboxedStoreInstanceFieldInstr"); |
| if (value_size <= compiler::target::kWordSize) { |
| const Register value = locs()->in(kValuePos).reg(); |
| __ StoreFieldToOffset(value, instance_reg, offset_in_bytes, |
| RepresentationUtils::OperandSize(rep)); |
| } else { |
| auto const in_pair = locs()->in(kValuePos).AsPairLocation(); |
| const Register in_lo = in_pair->At(0).reg(); |
| const Register in_hi = in_pair->At(1).reg(); |
| const intptr_t offset_lo = OffsetInBytes() - kHeapObjectTag; |
| const intptr_t offset_hi = offset_lo + compiler::target::kWordSize; |
| __ StoreToOffset(in_lo, instance_reg, offset_lo); |
| __ StoreToOffset(in_hi, instance_reg, offset_hi); |
| } |
| return; |
| } |
| |
| if (IsUnboxedDartFieldStore() && compiler->is_optimizing()) { |
| ASSERT(memory_order_ != compiler::AssemblerBase::kRelease); |
| XmmRegister value = locs()->in(kValuePos).fpu_reg(); |
| Register temp = locs()->temp(0).reg(); |
| Register temp2 = locs()->temp(1).reg(); |
| const intptr_t cid = slot().field().UnboxedFieldCid(); |
| |
| if (is_initialization()) { |
| const Class* cls = NULL; |
| switch (cid) { |
| case kDoubleCid: |
| cls = &compiler->double_class(); |
| break; |
| case kFloat32x4Cid: |
| cls = &compiler->float32x4_class(); |
| break; |
| case kFloat64x2Cid: |
| cls = &compiler->float64x2_class(); |
| break; |
| default: |
| UNREACHABLE(); |
| } |
| |
| BoxAllocationSlowPath::Allocate(compiler, this, *cls, temp, temp2); |
| __ movl(temp2, temp); |
| __ StoreIntoObject(instance_reg, |
| compiler::FieldAddress(instance_reg, offset_in_bytes), |
| temp2, compiler::Assembler::kValueIsNotSmi); |
| } else { |
| __ movl(temp, compiler::FieldAddress(instance_reg, offset_in_bytes)); |
| } |
| switch (cid) { |
| case kDoubleCid: |
| __ Comment("UnboxedDoubleStoreInstanceFieldInstr"); |
| __ movsd(compiler::FieldAddress(temp, Double::value_offset()), value); |
| break; |
| case kFloat32x4Cid: |
| __ Comment("UnboxedFloat32x4StoreInstanceFieldInstr"); |
| __ movups(compiler::FieldAddress(temp, Float32x4::value_offset()), |
| value); |
| break; |
| case kFloat64x2Cid: |
| __ Comment("UnboxedFloat64x2StoreInstanceFieldInstr"); |
| __ movups(compiler::FieldAddress(temp, Float64x2::value_offset()), |
| value); |
| break; |
| default: |
| UNREACHABLE(); |
| } |
| return; |
| } |
| |
| if (IsPotentialUnboxedDartFieldStore()) { |
| ASSERT(memory_order_ != compiler::AssemblerBase::kRelease); |
| __ Comment("PotentialUnboxedStore"); |
| Register value_reg = locs()->in(kValuePos).reg(); |
| Register temp = locs()->temp(0).reg(); |
| Register temp2 = locs()->temp(1).reg(); |
| FpuRegister fpu_temp = locs()->temp(2).fpu_reg(); |
| |
| if (ShouldEmitStoreBarrier()) { |
| // Value input is a writable register and should be manually preserved |
| // across allocation slow-path. Add it to live_registers set which |
| // determines which registers to preserve. |
| locs()->live_registers()->Add(locs()->in(kValuePos), kTagged); |
| } |
| |
| compiler::Label store_pointer; |
| compiler::Label store_double; |
| compiler::Label store_float32x4; |
| compiler::Label store_float64x2; |
| |
| __ LoadObject(temp, Field::ZoneHandle(Z, slot().field().Original())); |
| |
| __ cmpw(compiler::FieldAddress(temp, Field::is_nullable_offset()), |
| compiler::Immediate(kNullCid)); |
| __ j(EQUAL, &store_pointer); |
| |
| __ movzxb(temp2, compiler::FieldAddress(temp, Field::kind_bits_offset())); |
| __ testl(temp2, compiler::Immediate(1 << Field::kUnboxingCandidateBit)); |
| __ j(ZERO, &store_pointer); |
| |
| __ cmpw(compiler::FieldAddress(temp, Field::guarded_cid_offset()), |
| compiler::Immediate(kDoubleCid)); |
| __ j(EQUAL, &store_double); |
| |
| __ cmpw(compiler::FieldAddress(temp, Field::guarded_cid_offset()), |
| compiler::Immediate(kFloat32x4Cid)); |
| __ j(EQUAL, &store_float32x4); |
| |
| __ cmpw(compiler::FieldAddress(temp, Field::guarded_cid_offset()), |
| compiler::Immediate(kFloat64x2Cid)); |
| __ j(EQUAL, &store_float64x2); |
| |
| // Fall through. |
| __ jmp(&store_pointer); |
| |
| if (!compiler->is_optimizing()) { |
| locs()->live_registers()->Add(locs()->in(kInstancePos)); |
| locs()->live_registers()->Add(locs()->in(kValuePos)); |
| } |
| |
| { |
| __ Bind(&store_double); |
| EnsureMutableBox(compiler, this, temp, compiler->double_class(), |
| instance_reg, offset_in_bytes, temp2); |
| __ movsd(fpu_temp, |
| compiler::FieldAddress(value_reg, Double::value_offset())); |
| __ movsd(compiler::FieldAddress(temp, Double::value_offset()), fpu_temp); |
| __ jmp(&skip_store); |
| } |
| |
| { |
| __ Bind(&store_float32x4); |
| EnsureMutableBox(compiler, this, temp, compiler->float32x4_class(), |
| instance_reg, offset_in_bytes, temp2); |
| __ movups(fpu_temp, |
| compiler::FieldAddress(value_reg, Float32x4::value_offset())); |
| __ movups(compiler::FieldAddress(temp, Float32x4::value_offset()), |
| fpu_temp); |
| __ jmp(&skip_store); |
| } |
| |
| { |
| __ Bind(&store_float64x2); |
| EnsureMutableBox(compiler, this, temp, compiler->float64x2_class(), |
| instance_reg, offset_in_bytes, temp2); |
| __ movups(fpu_temp, |
| compiler::FieldAddress(value_reg, Float64x2::value_offset())); |
| __ movups(compiler::FieldAddress(temp, Float64x2::value_offset()), |
| fpu_temp); |
| __ jmp(&skip_store); |
| } |
| |
| __ Bind(&store_pointer); |
| } |
| |
| if (ShouldEmitStoreBarrier()) { |
| Register value_reg = locs()->in(kValuePos).reg(); |
| __ StoreIntoObject(instance_reg, |
| compiler::FieldAddress(instance_reg, offset_in_bytes), |
| value_reg, CanValueBeSmi(), memory_order_); |
| } else { |
| if (locs()->in(kValuePos).IsConstant()) { |
| __ StoreIntoObjectNoBarrier( |
| instance_reg, compiler::FieldAddress(instance_reg, offset_in_bytes), |
| locs()->in(kValuePos).constant(), memory_order_); |
| } else { |
| Register value_reg = locs()->in(kValuePos).reg(); |
| __ StoreIntoObjectNoBarrier( |
| instance_reg, compiler::FieldAddress(instance_reg, offset_in_bytes), |
| value_reg, memory_order_); |
| } |
| } |
| __ Bind(&skip_store); |
| } |
| |
| LocationSummary* StoreStaticFieldInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| LocationSummary* locs = |
| new (zone) LocationSummary(zone, 1, 1, LocationSummary::kNoCall); |
| locs->set_in(0, value()->NeedsWriteBarrier() ? Location::WritableRegister() |
| : Location::RequiresRegister()); |
| locs->set_temp(0, Location::RequiresRegister()); |
| return locs; |
| } |
| |
| void StoreStaticFieldInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Register value = locs()->in(0).reg(); |
| Register temp = locs()->temp(0).reg(); |
| |
| compiler->used_static_fields().Add(&field()); |
| |
| __ movl(temp, |
| compiler::Address( |
| THR, compiler::target::Thread::field_table_values_offset())); |
| // Note: static fields ids won't be changed by hot-reload. |
| __ movl( |
| compiler::Address(temp, compiler::target::FieldTable::OffsetOf(field())), |
| value); |
| } |
| |
| LocationSummary* InstanceOfInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 3; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kCall); |
| |
| summary->set_in(0, Location::RegisterLocation(TypeTestABI::kInstanceReg)); |
| summary->set_in(1, Location::RegisterLocation( |
| TypeTestABI::kInstantiatorTypeArgumentsReg)); |
| summary->set_in( |
| 2, Location::RegisterLocation(TypeTestABI::kFunctionTypeArgumentsReg)); |
| summary->set_out(0, Location::RegisterLocation(EAX)); |
| return summary; |
| } |
| |
| void InstanceOfInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| ASSERT(locs()->in(0).reg() == TypeTestABI::kInstanceReg); |
| ASSERT(locs()->in(1).reg() == TypeTestABI::kInstantiatorTypeArgumentsReg); |
| ASSERT(locs()->in(2).reg() == TypeTestABI::kFunctionTypeArgumentsReg); |
| |
| compiler->GenerateInstanceOf(source(), deopt_id(), env(), type(), locs()); |
| ASSERT(locs()->out(0).reg() == EAX); |
| } |
| |
| // TODO(srdjan): In case of constant inputs make CreateArray kNoCall and |
| // use slow path stub. |
| LocationSummary* CreateArrayInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kCall); |
| locs->set_in(kTypeArgumentsPos, |
| Location::RegisterLocation(AllocateArrayABI::kTypeArgumentsReg)); |
| locs->set_in(kLengthPos, |
| Location::RegisterLocation(AllocateArrayABI::kLengthReg)); |
| locs->set_out(0, Location::RegisterLocation(AllocateArrayABI::kResultReg)); |
| return locs; |
| } |
| |
| // Inlines array allocation for known constant values. |
| static void InlineArrayAllocation(FlowGraphCompiler* compiler, |
| intptr_t num_elements, |
| compiler::Label* slow_path, |
| compiler::Label* done) { |
| const int kInlineArraySize = 12; // Same as kInlineInstanceSize. |
| const intptr_t instance_size = Array::InstanceSize(num_elements); |
| |
| // Instance in AllocateArrayABI::kResultReg. |
| // Object end address in EBX. |
| __ TryAllocateArray(kArrayCid, instance_size, slow_path, |
| compiler::Assembler::kFarJump, |
| AllocateArrayABI::kResultReg, // instance |
| EBX, // end address |
| EDI); // temp |
| |
| // Store the type argument field. |
| __ StoreIntoObjectNoBarrier( |
| AllocateArrayABI::kResultReg, |
| compiler::FieldAddress(AllocateArrayABI::kResultReg, |
| Array::type_arguments_offset()), |
| AllocateArrayABI::kTypeArgumentsReg); |
| |
| // Set the length field. |
| __ StoreIntoObjectNoBarrier( |
| AllocateArrayABI::kResultReg, |
| compiler::FieldAddress(AllocateArrayABI::kResultReg, |
| Array::length_offset()), |
| AllocateArrayABI::kLengthReg); |
| |
| // Initialize all array elements to raw_null. |
| // AllocateArrayABI::kResultReg: new object start as a tagged pointer. |
| // EBX: new object end address. |
| // EDI: iterator which initially points to the start of the variable |
| // data area to be initialized. |
| if (num_elements > 0) { |
| const intptr_t array_size = instance_size - sizeof(UntaggedArray); |
| const compiler::Immediate& raw_null = |
| compiler::Immediate(static_cast<intptr_t>(Object::null())); |
| __ leal(EDI, compiler::FieldAddress(AllocateArrayABI::kResultReg, |
| sizeof(UntaggedArray))); |
| if (array_size < (kInlineArraySize * kWordSize)) { |
| intptr_t current_offset = 0; |
| __ movl(EBX, raw_null); |
| while (current_offset < array_size) { |
| __ StoreIntoObjectNoBarrier(AllocateArrayABI::kResultReg, |
| compiler::Address(EDI, current_offset), |
| EBX); |
| current_offset += kWordSize; |
| } |
| } else { |
| compiler::Label init_loop; |
| __ Bind(&init_loop); |
| __ StoreIntoObjectNoBarrier(AllocateArrayABI::kResultReg, |
| compiler::Address(EDI, 0), |
| Object::null_object()); |
| __ addl(EDI, compiler::Immediate(kWordSize)); |
| __ cmpl(EDI, EBX); |
| __ j(BELOW, &init_loop, compiler::Assembler::kNearJump); |
| } |
| } |
| __ jmp(done, compiler::Assembler::kNearJump); |
| } |
| |
| void CreateArrayInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| compiler::Label slow_path, done; |
| if (!FLAG_use_slow_path && FLAG_inline_alloc) { |
| if (compiler->is_optimizing() && num_elements()->BindsToConstant() && |
| num_elements()->BoundConstant().IsSmi()) { |
| const intptr_t length = |
| Smi::Cast(num_elements()->BoundConstant()).Value(); |
| if (Array::IsValidLength(length)) { |
| InlineArrayAllocation(compiler, length, &slow_path, &done); |
| } |
| } |
| } |
| |
| __ Bind(&slow_path); |
| auto object_store = compiler->isolate_group()->object_store(); |
| const auto& allocate_array_stub = |
| Code::ZoneHandle(compiler->zone(), object_store->allocate_array_stub()); |
| compiler->GenerateStubCall(source(), allocate_array_stub, |
| UntaggedPcDescriptors::kOther, locs(), deopt_id(), |
| env()); |
| __ Bind(&done); |
| } |
| |
| LocationSummary* LoadFieldInstr::MakeLocationSummary(Zone* zone, |
| bool opt) const { |
| const intptr_t kNumInputs = 1; |
| LocationSummary* locs = nullptr; |
| if (slot().representation() != kTagged) { |
| ASSERT(!calls_initializer()); |
| ASSERT(RepresentationUtils::IsUnboxedInteger(slot().representation())); |
| const size_t value_size = |
| RepresentationUtils::ValueSize(slot().representation()); |
| |
| const intptr_t kNumTemps = 0; |
| locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::RequiresRegister()); |
| if (value_size <= compiler::target::kWordSize) { |
| locs->set_out(0, Location::RequiresRegister()); |
| } else { |
| ASSERT(value_size <= 2 * compiler::target::kWordSize); |
| locs->set_out(0, Location::Pair(Location::RequiresRegister(), |
| Location::RequiresRegister())); |
| } |
| |
| } else if (IsUnboxedDartFieldLoad() && opt) { |
| ASSERT(!calls_initializer()); |
| const intptr_t kNumTemps = 1; |
| locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::RequiresRegister()); |
| locs->set_temp(0, Location::RequiresRegister()); |
| locs->set_out(0, Location::RequiresFpuRegister()); |
| |
| } else if (IsPotentialUnboxedDartFieldLoad()) { |
| ASSERT(!calls_initializer()); |
| const intptr_t kNumTemps = 2; |
| locs = new (zone) LocationSummary(zone, kNumInputs, kNumTemps, |
| LocationSummary::kCallOnSlowPath); |
| locs->set_in(0, Location::RequiresRegister()); |
| locs->set_temp(0, opt ? Location::RequiresFpuRegister() |
| : Location::FpuRegisterLocation(XMM1)); |
| locs->set_temp(1, Location::RequiresRegister()); |
| locs->set_out(0, Location::RequiresRegister()); |
| |
| } else if (calls_initializer()) { |
| if (throw_exception_on_initialization()) { |
| ASSERT(!UseSharedSlowPathStub(opt)); |
| const intptr_t kNumTemps = 0; |
| locs = new (zone) LocationSummary(zone, kNumInputs, kNumTemps, |
| LocationSummary::kCallOnSlowPath); |
| locs->set_in(0, Location::RequiresRegister()); |
| locs->set_out(0, Location::RequiresRegister()); |
| } else { |
| const intptr_t kNumTemps = 0; |
| locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kCall); |
| locs->set_in( |
| 0, Location::RegisterLocation(InitInstanceFieldABI::kInstanceReg)); |
| locs->set_out( |
| 0, Location::RegisterLocation(InitInstanceFieldABI::kResultReg)); |
| } |
| } else { |
| const intptr_t kNumTemps = 0; |
| locs = new (zone) |
| LocationSummary(zone, kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::RequiresRegister()); |
| locs->set_out(0, Location::RequiresRegister()); |
| } |
| return locs; |
| } |
| |
| void LoadFieldInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| ASSERT(compiler::target::UntaggedObject::kClassIdTagSize == 16); |
| ASSERT(sizeof(UntaggedField::guarded_cid_) == 2); |
| ASSERT(sizeof(UntaggedField::is_nullable_) == 2); |
| |
| const Register instance_reg = locs()->in(0).reg(); |
| if (slot().representation() != kTagged) { |
| ASSERT(!calls_initializer()); |
| auto const rep = slot().representation(); |
| const size_t value_size = RepresentationUtils::ValueSize(rep); |
| __ Comment("NativeUnboxedLoadFieldInstr"); |
| if (value_size <= compiler::target::kWordSize) { |
| auto const result = locs()->out(0).reg(); |
| __ LoadFieldFromOffset(result, instance_reg, OffsetInBytes(), |
| RepresentationUtils::OperandSize(rep)); |
| } else { |
| auto const out_pair = locs()->out(0).AsPairLocation(); |
| const Register out_lo = out_pair->At(0).reg(); |
| const Register out_hi = out_pair->At(1).reg(); |
| const intptr_t offset_lo = OffsetInBytes() - kHeapObjectTag; |
| const intptr_t offset_hi = offset_lo + compiler::target::kWordSize; |
| __ LoadFromOffset(out_lo, instance_reg, offset_lo); |
| __ LoadFromOffset(out_hi, instance_reg, offset_hi); |
| } |
| return; |
| } |
| |
| if (IsUnboxedDartFieldLoad() && compiler->is_optimizing()) { |
| XmmRegister result = locs()->out(0).fpu_reg(); |
| Register temp = locs()->temp(0).reg(); |
| __ movl(temp, compiler::FieldAddress(instance_reg, OffsetInBytes())); |
| const intptr_t cid = slot().field().UnboxedFieldCid(); |
| switch (cid) { |
| case kDoubleCid: |
| __ Comment("UnboxedDoubleLoadFieldInstr"); |
| __ movsd(result, compiler::FieldAddress(temp, Double::value_offset())); |
| break; |
| case kFloat32x4Cid: |
| __ Comment("UnboxedFloat32x4LoadFieldInstr"); |
| __ movups(result, |
| compiler::FieldAddress(temp, Float32x4::value_offset())); |
| break; |
| case kFloat64x2Cid: |
| __ Comment("UnboxedFloat64x2LoadFieldInstr"); |
| __ movups(result, |
| compiler::FieldAddress(temp, Float64x2::value_offset())); |
| break; |
| default: |
| UNREACHABLE(); |
| } |
| return; |
| } |
| |
| compiler::Label done; |
| const Register result = locs()->out(0).reg(); |
| if (IsPotentialUnboxedDartFieldLoad()) { |
| Register temp = locs()->temp(1).reg(); |
| XmmRegister value = locs()->temp(0).fpu_reg(); |
| |
| compiler::Label load_pointer; |
| compiler::Label load_double; |
| compiler::Label load_float32x4; |
| compiler::Label load_float64x2; |
| |
| __ LoadObject(result, Field::ZoneHandle(slot().field().Original())); |
| |
| compiler::FieldAddress field_cid_operand(result, |
| Field::guarded_cid_offset()); |
| compiler::FieldAddress field_nullability_operand( |
| result, Field::is_nullable_offset()); |
| |
| __ cmpw(field_nullability_operand, compiler::Immediate(kNullCid)); |
| __ j(EQUAL, &load_pointer); |
| |
| __ cmpw(field_cid_operand, compiler::Immediate(kDoubleCid)); |
| __ j(EQUAL, &load_double); |
| |
| __ cmpw(field_cid_operand, compiler::Immediate(kFloat32x4Cid)); |
| __ j(EQUAL, &load_float32x4); |
| |
| __ cmpw(field_cid_operand, compiler::Immediate(kFloat64x2Cid)); |
| __ j(EQUAL, &load_float64x2); |
| |
| // Fall through. |
| __ jmp(&load_pointer); |
| |
| if (!compiler->is_optimizing()) { |
| locs()->live_registers()->Add(locs()->in(0)); |
| } |
| |
| { |
| __ Bind(&load_double); |
| BoxAllocationSlowPath::Allocate(compiler, this, compiler->double_class(), |
| result, temp); |
| __ movl(temp, compiler::FieldAddress(instance_reg, OffsetInBytes())); |
| __ movsd(value, compiler::FieldAddress(temp, Double::value_offset())); |
| __ movsd(compiler::FieldAddress(result, Double::value_offset()), value); |
| __ jmp(&done); |
| } |
| |
| { |
| __ Bind(&load_float32x4); |
| BoxAllocationSlowPath::Allocate( |
| compiler, this, compiler->float32x4_class(), result, temp); |
| __ movl(temp, compiler::FieldAddress(instance_reg, OffsetInBytes())); |
| __ movups(value, compiler::FieldAddress(temp, Float32x4::value_offset())); |
| __ movups(compiler::FieldAddress(result, Float32x4::value_offset()), |
|