| // 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 "vm/globals.h" // Needed here to get TARGET_ARCH_MIPS. |
| #if defined(TARGET_ARCH_MIPS) |
| |
| #include "vm/intermediate_language.h" |
| |
| #include "vm/dart_entry.h" |
| #include "vm/flow_graph_compiler.h" |
| #include "vm/locations.h" |
| #include "vm/object_store.h" |
| #include "vm/parser.h" |
| #include "vm/simulator.h" |
| #include "vm/stack_frame.h" |
| #include "vm/stub_code.h" |
| #include "vm/symbols.h" |
| |
| #define __ compiler->assembler()-> |
| |
| namespace dart { |
| |
| DECLARE_FLAG(int, optimization_counter_threshold); |
| DECLARE_FLAG(bool, propagate_ic_data); |
| DECLARE_FLAG(bool, use_osr); |
| |
| // Generic summary for call instructions that have all arguments pushed |
| // on the stack and return the result in a fixed register V0. |
| LocationSummary* Instruction::MakeCallSummary() { |
| LocationSummary* result = new LocationSummary(0, 0, LocationSummary::kCall); |
| result->set_out(0, Location::RegisterLocation(V0)); |
| return result; |
| } |
| |
| |
| LocationSummary* PushArgumentInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps= 0; |
| LocationSummary* locs = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::AnyOrConstant(value())); |
| return locs; |
| } |
| |
| |
| void PushArgumentInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| // In SSA mode, we need an explicit push. Nothing to do in non-SSA mode |
| // where PushArgument is handled by BindInstr::EmitNativeCode. |
| __ TraceSimMsg("PushArgumentInstr"); |
| if (compiler->is_optimizing()) { |
| Location value = locs()->in(0); |
| if (value.IsRegister()) { |
| __ Push(value.reg()); |
| } else if (value.IsConstant()) { |
| __ PushObject(value.constant()); |
| } else { |
| ASSERT(value.IsStackSlot()); |
| const intptr_t value_offset = value.ToStackSlotOffset(); |
| __ LoadFromOffset(TMP, FP, value_offset); |
| __ Push(TMP); |
| } |
| } |
| } |
| |
| |
| LocationSummary* ReturnInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::RegisterLocation(V0)); |
| 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 instructions: a branch macro sequence. |
| void ReturnInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("ReturnInstr"); |
| Register result = locs()->in(0).reg(); |
| ASSERT(result == V0); |
| #if defined(DEBUG) |
| Label stack_ok; |
| __ Comment("Stack Check"); |
| __ TraceSimMsg("Stack Check"); |
| const intptr_t fp_sp_dist = |
| (kFirstLocalSlotFromFp + 1 - compiler->StackSize()) * kWordSize; |
| ASSERT(fp_sp_dist <= 0); |
| __ subu(CMPRES1, SP, FP); |
| |
| __ BranchEqual(CMPRES1, fp_sp_dist, &stack_ok); |
| __ break_(0); |
| |
| __ Bind(&stack_ok); |
| #endif |
| __ LeaveDartFrameAndReturn(); |
| } |
| |
| |
| static Condition NegateCondition(Condition condition) { |
| switch (condition) { |
| case EQ: return NE; |
| case NE: return EQ; |
| case LT: return GE; |
| case LE: return GT; |
| case GT: return LE; |
| case GE: return LT; |
| default: |
| OS::Print("Error: Condition not recognized: %d\n", condition); |
| UNIMPLEMENTED(); |
| return EQ; |
| } |
| } |
| |
| |
| // Detect pattern when one value is zero and another is a power of 2. |
| static bool IsPowerOfTwoKind(intptr_t v1, intptr_t v2) { |
| return (Utils::IsPowerOfTwo(v1) && (v2 == 0)) || |
| (Utils::IsPowerOfTwo(v2) && (v1 == 0)); |
| } |
| |
| |
| LocationSummary* IfThenElseInstr::MakeLocationSummary(bool opt) const { |
| comparison()->InitializeLocationSummary(opt); |
| return comparison()->locs(); |
| } |
| |
| |
| void IfThenElseInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| const Register result = locs()->out(0).reg(); |
| |
| Location left = locs()->in(0); |
| Location right = locs()->in(1); |
| ASSERT(!left.IsConstant() || !right.IsConstant()); |
| |
| // Clear out register. |
| __ mov(result, ZR); |
| |
| // Emit comparison code. This must not overwrite the result register. |
| BranchLabels labels = { NULL, NULL, NULL }; |
| Condition true_condition = comparison()->EmitComparisonCode(compiler, labels); |
| |
| const bool is_power_of_two_kind = IsPowerOfTwoKind(if_true_, if_false_); |
| |
| intptr_t true_value = if_true_; |
| intptr_t false_value = if_false_; |
| |
| if (is_power_of_two_kind) { |
| if (true_value == 0) { |
| // We need to have zero in result on true_condition. |
| true_condition = NegateCondition(true_condition); |
| } |
| } else { |
| if (true_value == 0) { |
| // Swap values so that false_value is zero. |
| intptr_t temp = true_value; |
| true_value = false_value; |
| false_value = temp; |
| } else { |
| true_condition = NegateCondition(true_condition); |
| } |
| } |
| |
| switch (true_condition) { |
| case EQ: |
| __ xor_(result, CMPRES1, CMPRES2); |
| __ xori(result, result, Immediate(1)); |
| break; |
| case NE: |
| __ xor_(result, CMPRES1, CMPRES2); |
| break; |
| case GT: |
| __ mov(result, CMPRES2); |
| break; |
| case GE: |
| __ xori(result, CMPRES1, Immediate(1)); |
| break; |
| case LT: |
| __ mov(result, CMPRES1); |
| break; |
| case LE: |
| __ xori(result, CMPRES2, Immediate(1)); |
| break; |
| default: |
| UNREACHABLE(); |
| break; |
| } |
| |
| if (is_power_of_two_kind) { |
| const intptr_t shift = |
| Utils::ShiftForPowerOfTwo(Utils::Maximum(true_value, false_value)); |
| __ sll(result, result, shift + kSmiTagSize); |
| } else { |
| __ AddImmediate(result, result, -1); |
| const int32_t val = |
| Smi::RawValue(true_value) - Smi::RawValue(false_value); |
| __ AndImmediate(result, result, val); |
| if (false_value != 0) { |
| __ AddImmediate(result, result, Smi::RawValue(false_value)); |
| } |
| } |
| } |
| |
| |
| LocationSummary* ClosureCallInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 0; |
| const intptr_t kNumTemps = 1; |
| LocationSummary* result = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kCall); |
| result->set_out(0, Location::RegisterLocation(V0)); |
| result->set_temp(0, Location::RegisterLocation(S4)); // Arg. descriptor. |
| return result; |
| } |
| |
| |
| void ClosureCallInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| // The arguments to the stub include the closure, as does the arguments |
| // descriptor. |
| Register temp_reg = locs()->temp(0).reg(); |
| int argument_count = ArgumentCount(); |
| const Array& arguments_descriptor = |
| Array::ZoneHandle(ArgumentsDescriptor::New(argument_count, |
| argument_names())); |
| ASSERT(temp_reg == S4); |
| __ LoadObject(temp_reg, arguments_descriptor); |
| compiler->GenerateDartCall(deopt_id(), |
| token_pos(), |
| &StubCode::CallClosureFunctionLabel(), |
| PcDescriptors::kClosureCall, |
| locs()); |
| __ Drop(argument_count); |
| } |
| |
| |
| LocationSummary* LoadLocalInstr::MakeLocationSummary(bool opt) const { |
| return LocationSummary::Make(0, |
| Location::RequiresRegister(), |
| LocationSummary::kNoCall); |
| } |
| |
| |
| void LoadLocalInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("LoadLocalInstr"); |
| Register result = locs()->out(0).reg(); |
| __ lw(result, Address(FP, local().index() * kWordSize)); |
| } |
| |
| |
| LocationSummary* StoreLocalInstr::MakeLocationSummary(bool opt) const { |
| return LocationSummary::Make(1, |
| Location::SameAsFirstInput(), |
| LocationSummary::kNoCall); |
| } |
| |
| |
| void StoreLocalInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("StoreLocalInstr"); |
| Register value = locs()->in(0).reg(); |
| Register result = locs()->out(0).reg(); |
| ASSERT(result == value); // Assert that register assignment is correct. |
| __ sw(value, Address(FP, local().index() * kWordSize)); |
| } |
| |
| |
| LocationSummary* ConstantInstr::MakeLocationSummary(bool opt) const { |
| return LocationSummary::Make(0, |
| Location::RequiresRegister(), |
| LocationSummary::kNoCall); |
| } |
| |
| |
| void ConstantInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| // The register allocator drops constant definitions that have no uses. |
| if (!locs()->out(0).IsInvalid()) { |
| __ TraceSimMsg("ConstantInstr"); |
| Register result = locs()->out(0).reg(); |
| __ LoadObject(result, value()); |
| } |
| } |
| |
| |
| LocationSummary* AssertAssignableInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 3; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kCall); |
| summary->set_in(0, Location::RegisterLocation(A0)); // Value. |
| summary->set_in(1, Location::RegisterLocation(A2)); // Instantiator. |
| summary->set_in(2, Location::RegisterLocation(A1)); // Type arguments. |
| summary->set_out(0, Location::RegisterLocation(A0)); |
| return summary; |
| } |
| |
| |
| LocationSummary* AssertBooleanInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kCall); |
| locs->set_in(0, Location::RegisterLocation(A0)); |
| locs->set_out(0, Location::RegisterLocation(A0)); |
| return locs; |
| } |
| |
| |
| static void EmitAssertBoolean(Register reg, |
| intptr_t token_pos, |
| intptr_t deopt_id, |
| LocationSummary* locs, |
| FlowGraphCompiler* compiler) { |
| // Check that the type of the value is allowed in conditional context. |
| // Call the runtime if the object is not bool::true or bool::false. |
| ASSERT(locs->always_calls()); |
| Label done; |
| __ BranchEqual(reg, Bool::True(), &done); |
| __ BranchEqual(reg, Bool::False(), &done); |
| |
| __ Push(reg); // Push the source object. |
| compiler->GenerateRuntimeCall(token_pos, |
| deopt_id, |
| kNonBoolTypeErrorRuntimeEntry, |
| 1, |
| locs); |
| // We should never return here. |
| __ break_(0); |
| __ Bind(&done); |
| } |
| |
| |
| void AssertBooleanInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Register obj = locs()->in(0).reg(); |
| Register result = locs()->out(0).reg(); |
| |
| __ TraceSimMsg("AssertBooleanInstr"); |
| EmitAssertBoolean(obj, token_pos(), deopt_id(), locs(), compiler); |
| ASSERT(obj == result); |
| } |
| |
| |
| LocationSummary* EqualityCompareInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 2; |
| if (operation_cid() == kMintCid) { |
| const intptr_t kNumTemps = 1; |
| LocationSummary* locs = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::RequiresFpuRegister()); |
| locs->set_in(1, Location::RequiresFpuRegister()); |
| locs->set_temp(0, Location::RequiresRegister()); |
| locs->set_out(0, Location::RequiresRegister()); |
| return locs; |
| } |
| if (operation_cid() == kDoubleCid) { |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = |
| new LocationSummary(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 LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::RegisterOrConstant(left())); |
| // Only one input can be a constant operand. The case of two constant |
| // operands should be handled by constant propagation. |
| locs->set_in(1, locs->in(0).IsConstant() |
| ? Location::RequiresRegister() |
| : Location::RegisterOrConstant(right())); |
| locs->set_out(0, Location::RequiresRegister()); |
| return locs; |
| } |
| UNREACHABLE(); |
| return NULL; |
| } |
| |
| |
| static void LoadValueCid(FlowGraphCompiler* compiler, |
| Register value_cid_reg, |
| Register value_reg, |
| Label* value_is_smi = NULL) { |
| __ TraceSimMsg("LoadValueCid"); |
| Label done; |
| if (value_is_smi == NULL) { |
| __ LoadImmediate(value_cid_reg, kSmiCid); |
| } |
| __ andi(CMPRES1, value_reg, Immediate(kSmiTagMask)); |
| if (value_is_smi == NULL) { |
| __ beq(CMPRES1, ZR, &done); |
| } else { |
| __ beq(CMPRES1, ZR, value_is_smi); |
| } |
| __ LoadClassId(value_cid_reg, value_reg); |
| __ Bind(&done); |
| } |
| |
| |
| static Condition TokenKindToSmiCondition(Token::Kind kind) { |
| switch (kind) { |
| case Token::kEQ: return EQ; |
| case Token::kNE: return NE; |
| case Token::kLT: return LT; |
| case Token::kGT: return GT; |
| case Token::kLTE: return LE; |
| case Token::kGTE: return GE; |
| default: |
| UNREACHABLE(); |
| return VS; |
| } |
| } |
| |
| |
| // Branches on condition c assuming comparison results in CMPRES1 and CMPRES2. |
| static void EmitBranchAfterCompare( |
| FlowGraphCompiler* compiler, Condition condition, Label* is_true) { |
| switch (condition) { |
| case EQ: __ beq(CMPRES1, CMPRES2, is_true); break; |
| case NE: __ bne(CMPRES1, CMPRES2, is_true); break; |
| case GT: __ bne(CMPRES2, ZR, is_true); break; |
| case GE: __ beq(CMPRES1, ZR, is_true); break; |
| case LT: __ bne(CMPRES1, ZR, is_true); break; |
| case LE: __ beq(CMPRES2, ZR, is_true); break; |
| default: |
| UNREACHABLE(); |
| break; |
| } |
| } |
| |
| |
| static Condition FlipCondition(Condition condition) { |
| switch (condition) { |
| case EQ: return EQ; |
| case NE: return NE; |
| case LT: return GT; |
| case LE: return GE; |
| case GT: return LT; |
| case GE: return LE; |
| default: |
| UNREACHABLE(); |
| return EQ; |
| } |
| } |
| |
| |
| // The comparison result is in CMPRES1/CMPRES2. |
| static void EmitBranchOnCondition(FlowGraphCompiler* compiler, |
| Condition true_condition, |
| BranchLabels labels) { |
| __ TraceSimMsg("ControlInstruction::EmitBranchOnCondition"); |
| if (labels.fall_through == labels.false_label) { |
| // If the next block is the false successor, fall through to it. |
| EmitBranchAfterCompare(compiler, true_condition, labels.true_label); |
| } else { |
| // If the next block is not the false successor, branch to it. |
| Condition false_condition = NegateCondition(true_condition); |
| EmitBranchAfterCompare(compiler, false_condition, labels.false_label); |
| // Fall through or jump to the true successor. |
| if (labels.fall_through != labels.true_label) { |
| __ b(labels.true_label); |
| } |
| } |
| } |
| |
| |
| static Condition EmitSmiComparisonOp(FlowGraphCompiler* compiler, |
| const LocationSummary& locs, |
| Token::Kind kind, |
| BranchLabels labels) { |
| __ TraceSimMsg("EmitSmiComparisonOp"); |
| __ Comment("EmitSmiComparisonOp"); |
| Location left = locs.in(0); |
| Location right = locs.in(1); |
| ASSERT(!left.IsConstant() || !right.IsConstant()); |
| |
| Condition true_condition = TokenKindToSmiCondition(kind); |
| |
| if (left.IsConstant()) { |
| __ CompareObject(CMPRES1, CMPRES2, right.reg(), left.constant()); |
| true_condition = FlipCondition(true_condition); |
| } else if (right.IsConstant()) { |
| __ CompareObject(CMPRES1, CMPRES2, left.reg(), right.constant()); |
| } else { |
| __ slt(CMPRES1, left.reg(), right.reg()); |
| __ slt(CMPRES2, right.reg(), left.reg()); |
| } |
| return true_condition; |
| } |
| |
| |
| static Condition TokenKindToDoubleCondition(Token::Kind kind) { |
| switch (kind) { |
| case Token::kEQ: return EQ; |
| case Token::kNE: return NE; |
| case Token::kLT: return LT; |
| case Token::kGT: return GT; |
| case Token::kLTE: return LE; |
| case Token::kGTE: return GE; |
| default: |
| UNREACHABLE(); |
| return VS; |
| } |
| } |
| |
| |
| static Condition EmitDoubleComparisonOp(FlowGraphCompiler* compiler, |
| const LocationSummary& locs, |
| Token::Kind kind, |
| BranchLabels labels) { |
| DRegister left = locs.in(0).fpu_reg(); |
| DRegister right = locs.in(1).fpu_reg(); |
| |
| __ Comment("DoubleComparisonOp(left=%d, right=%d)", left, right); |
| |
| Condition true_condition = TokenKindToDoubleCondition(kind); |
| __ cund(left, right); |
| Label* nan_label = (true_condition == NE) |
| ? labels.true_label : labels.false_label; |
| __ bc1t(nan_label); |
| |
| switch (true_condition) { |
| case EQ: __ ceqd(left, right); break; |
| case NE: __ ceqd(left, right); break; |
| case LT: __ coltd(left, right); break; |
| case LE: __ coled(left, right); break; |
| case GT: __ coltd(right, left); break; |
| case GE: __ coled(right, left); break; |
| default: { |
| // Should only passing the above conditions to this function. |
| UNREACHABLE(); |
| break; |
| } |
| } |
| |
| // Ordering is expected to be described by CMPRES1, CMPRES2. |
| __ LoadImmediate(TMP, 1); |
| if (true_condition == NE) { |
| __ movf(CMPRES1, ZR); |
| __ movt(CMPRES1, TMP); |
| } else { |
| __ movf(CMPRES1, TMP); |
| __ movt(CMPRES1, ZR); |
| } |
| __ mov(CMPRES2, ZR); |
| return EQ; |
| } |
| |
| |
| Condition EqualityCompareInstr::EmitComparisonCode(FlowGraphCompiler* compiler, |
| BranchLabels labels) { |
| if (operation_cid() == kSmiCid) { |
| return EmitSmiComparisonOp(compiler, *locs(), kind(), labels); |
| } else { |
| ASSERT(operation_cid() == kDoubleCid); |
| return EmitDoubleComparisonOp(compiler, *locs(), kind(), labels); |
| } |
| } |
| |
| |
| void EqualityCompareInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| ASSERT((kind() == Token::kNE) || (kind() == Token::kEQ)); |
| __ Comment("EqualityCompareInstr"); |
| |
| Label is_true, is_false; |
| BranchLabels labels = { &is_true, &is_false, &is_false }; |
| Condition true_condition = EmitComparisonCode(compiler, labels); |
| EmitBranchOnCondition(compiler, true_condition, labels); |
| |
| Register result = locs()->out(0).reg(); |
| Label done; |
| __ Bind(&is_false); |
| __ LoadObject(result, Bool::False()); |
| __ b(&done); |
| __ Bind(&is_true); |
| __ LoadObject(result, Bool::True()); |
| __ Bind(&done); |
| } |
| |
| |
| void EqualityCompareInstr::EmitBranchCode(FlowGraphCompiler* compiler, |
| BranchInstr* branch) { |
| __ TraceSimMsg("EqualityCompareInstr"); |
| __ Comment("EqualityCompareInstr:BranchCode"); |
| ASSERT((kind() == Token::kNE) || (kind() == Token::kEQ)); |
| |
| BranchLabels labels = compiler->CreateBranchLabels(branch); |
| Condition true_condition = EmitComparisonCode(compiler, labels); |
| EmitBranchOnCondition(compiler, true_condition, labels); |
| } |
| |
| |
| LocationSummary* TestSmiInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = |
| new LocationSummary(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, Location::RegisterOrConstant(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 = |
| reinterpret_cast<int32_t>(right.constant().raw()); |
| __ AndImmediate(CMPRES1, left, imm); |
| } else { |
| __ and_(CMPRES1, left, right.reg()); |
| } |
| __ mov(CMPRES2, ZR); |
| Condition true_condition = (kind() == Token::kNE) ? NE : EQ; |
| return true_condition; |
| } |
| |
| |
| void TestSmiInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| // Never emitted outside of the BranchInstr. |
| UNREACHABLE(); |
| } |
| |
| |
| void TestSmiInstr::EmitBranchCode(FlowGraphCompiler* compiler, |
| BranchInstr* branch) { |
| BranchLabels labels = compiler->CreateBranchLabels(branch); |
| Condition true_condition = EmitComparisonCode(compiler, labels); |
| EmitBranchOnCondition(compiler, true_condition, labels); |
| } |
| |
| |
| LocationSummary* RelationalOpInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = 0; |
| if (operation_cid() == kMintCid) { |
| const intptr_t kNumTemps = 2; |
| LocationSummary* locs = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::RequiresFpuRegister()); |
| locs->set_in(1, Location::RequiresFpuRegister()); |
| locs->set_temp(0, Location::RequiresRegister()); |
| locs->set_temp(1, Location::RequiresRegister()); |
| locs->set_out(0, Location::RequiresRegister()); |
| return locs; |
| } |
| if (operation_cid() == kDoubleCid) { |
| LocationSummary* summary = |
| new LocationSummary(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 LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RegisterOrConstant(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() |
| : Location::RegisterOrConstant(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 { |
| ASSERT(operation_cid() == kDoubleCid); |
| return EmitDoubleComparisonOp(compiler, *locs(), kind(), labels); |
| } |
| } |
| |
| |
| void RelationalOpInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("RelationalOpInstr"); |
| |
| Label is_true, is_false; |
| BranchLabels labels = { &is_true, &is_false, &is_false }; |
| Condition true_condition = EmitComparisonCode(compiler, labels); |
| EmitBranchOnCondition(compiler, true_condition, labels); |
| |
| Register result = locs()->out(0).reg(); |
| Label done; |
| __ Bind(&is_false); |
| __ LoadObject(result, Bool::False()); |
| __ b(&done); |
| __ Bind(&is_true); |
| __ LoadObject(result, Bool::True()); |
| __ Bind(&done); |
| } |
| |
| |
| void RelationalOpInstr::EmitBranchCode(FlowGraphCompiler* compiler, |
| BranchInstr* branch) { |
| __ TraceSimMsg("RelationalOpInstr"); |
| |
| BranchLabels labels = compiler->CreateBranchLabels(branch); |
| Condition true_condition = EmitComparisonCode(compiler, labels); |
| EmitBranchOnCondition(compiler, true_condition, labels); |
| } |
| |
| |
| LocationSummary* NativeCallInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 0; |
| const intptr_t kNumTemps = 3; |
| LocationSummary* locs = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kCall); |
| locs->set_temp(0, Location::RegisterLocation(A1)); |
| locs->set_temp(1, Location::RegisterLocation(A2)); |
| locs->set_temp(2, Location::RegisterLocation(T5)); |
| locs->set_out(0, Location::RegisterLocation(V0)); |
| return locs; |
| } |
| |
| |
| void NativeCallInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("NativeCallInstr"); |
| ASSERT(locs()->temp(0).reg() == A1); |
| ASSERT(locs()->temp(1).reg() == A2); |
| ASSERT(locs()->temp(2).reg() == T5); |
| Register result = locs()->out(0).reg(); |
| |
| // Push the result place holder initialized to NULL. |
| __ PushObject(Object::ZoneHandle()); |
| // Pass a pointer to the first argument in A2. |
| if (!function().HasOptionalParameters()) { |
| __ AddImmediate(A2, FP, (kParamEndSlotFromFp + |
| function().NumParameters()) * kWordSize); |
| } else { |
| __ AddImmediate(A2, FP, kFirstLocalSlotFromFp * kWordSize); |
| } |
| // Compute the effective address. When running under the simulator, |
| // this is a redirection address that forces the simulator to call |
| // into the runtime system. |
| uword entry = reinterpret_cast<uword>(native_c_function()); |
| const ExternalLabel* stub_entry; |
| if (is_bootstrap_native()) { |
| stub_entry = &StubCode::CallBootstrapCFunctionLabel(); |
| #if defined(USING_SIMULATOR) |
| entry = Simulator::RedirectExternalReference( |
| entry, Simulator::kBootstrapNativeCall, function().NumParameters()); |
| #endif |
| } else { |
| // In the case of non bootstrap native methods the CallNativeCFunction |
| // stub generates the redirection address when running under the simulator |
| // and hence we do not change 'entry' here. |
| stub_entry = &StubCode::CallNativeCFunctionLabel(); |
| #if defined(USING_SIMULATOR) |
| if (!function().IsNativeAutoSetupScope()) { |
| entry = Simulator::RedirectExternalReference( |
| entry, Simulator::kBootstrapNativeCall, function().NumParameters()); |
| } |
| #endif |
| } |
| __ LoadImmediate(T5, entry); |
| __ LoadImmediate(A1, NativeArguments::ComputeArgcTag(function())); |
| compiler->GenerateCall(token_pos(), |
| stub_entry, |
| PcDescriptors::kOther, |
| locs()); |
| __ Pop(result); |
| } |
| |
| |
| LocationSummary* StringFromCharCodeInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| // TODO(fschneider): Allow immediate operands for the char code. |
| return LocationSummary::Make(kNumInputs, |
| Location::RequiresRegister(), |
| LocationSummary::kNoCall); |
| } |
| |
| |
| void StringFromCharCodeInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Register char_code = locs()->in(0).reg(); |
| Register result = locs()->out(0).reg(); |
| |
| __ TraceSimMsg("StringFromCharCodeInstr"); |
| |
| __ LoadImmediate(result, |
| reinterpret_cast<uword>(Symbols::PredefinedAddress())); |
| __ AddImmediate(result, Symbols::kNullCharCodeSymbolOffset * kWordSize); |
| __ sll(TMP, char_code, 1); // Char code is a smi. |
| __ addu(TMP, TMP, result); |
| __ lw(result, Address(TMP)); |
| } |
| |
| |
| LocationSummary* StringToCharCodeInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| return LocationSummary::Make(kNumInputs, |
| Location::RequiresRegister(), |
| LocationSummary::kNoCall); |
| } |
| |
| |
| void StringToCharCodeInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("StringToCharCodeInstr"); |
| |
| ASSERT(cid_ == kOneByteStringCid); |
| Register str = locs()->in(0).reg(); |
| Register result = locs()->out(0).reg(); |
| Label done, is_one; |
| __ lw(result, FieldAddress(str, String::length_offset())); |
| __ BranchEqual(result, Smi::RawValue(1), &is_one); |
| __ LoadImmediate(result, Smi::RawValue(-1)); |
| __ b(&done); |
| __ Bind(&is_one); |
| __ lbu(result, FieldAddress(str, OneByteString::data_offset())); |
| __ SmiTag(result); |
| __ Bind(&done); |
| } |
| |
| |
| LocationSummary* StringInterpolateInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kCall); |
| summary->set_in(0, Location::RegisterLocation(A0)); |
| summary->set_out(0, Location::RegisterLocation(V0)); |
| return summary; |
| } |
| |
| |
| void StringInterpolateInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Register array = locs()->in(0).reg(); |
| __ Push(array); |
| const int kNumberOfArguments = 1; |
| const Array& kNoArgumentNames = Object::null_array(); |
| compiler->GenerateStaticCall(deopt_id(), |
| token_pos(), |
| CallFunction(), |
| kNumberOfArguments, |
| kNoArgumentNames, |
| locs()); |
| ASSERT(locs()->out(0).reg() == V0); |
| } |
| |
| |
| LocationSummary* LoadUntaggedInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| return LocationSummary::Make(kNumInputs, |
| Location::RequiresRegister(), |
| LocationSummary::kNoCall); |
| } |
| |
| |
| void LoadUntaggedInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Register object = locs()->in(0).reg(); |
| Register result = locs()->out(0).reg(); |
| __ LoadFromOffset(result, object, offset() - kHeapObjectTag); |
| } |
| |
| |
| LocationSummary* LoadClassIdInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| return LocationSummary::Make(kNumInputs, |
| Location::RequiresRegister(), |
| LocationSummary::kNoCall); |
| } |
| |
| |
| void LoadClassIdInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Register object = locs()->in(0).reg(); |
| Register result = locs()->out(0).reg(); |
| Label load, done; |
| __ andi(CMPRES1, object, Immediate(kSmiTagMask)); |
| __ bne(CMPRES1, ZR, &load); |
| __ LoadImmediate(result, Smi::RawValue(kSmiCid)); |
| __ b(&done); |
| __ Bind(&load); |
| __ LoadClassId(result, object); |
| __ SmiTag(result); |
| __ Bind(&done); |
| } |
| |
| |
| CompileType LoadIndexedInstr::ComputeType() const { |
| switch (class_id_) { |
| case kArrayCid: |
| case kImmutableArrayCid: |
| return CompileType::Dynamic(); |
| |
| case kTypedDataFloat32ArrayCid: |
| case kTypedDataFloat64ArrayCid: |
| return CompileType::FromCid(kDoubleCid); |
| case kTypedDataFloat32x4ArrayCid: |
| return CompileType::FromCid(kFloat32x4Cid); |
| case kTypedDataInt32x4ArrayCid: |
| return CompileType::FromCid(kInt32x4Cid); |
| |
| case kTypedDataInt8ArrayCid: |
| case kTypedDataUint8ArrayCid: |
| case kTypedDataUint8ClampedArrayCid: |
| case kExternalTypedDataUint8ArrayCid: |
| case kExternalTypedDataUint8ClampedArrayCid: |
| case kTypedDataInt16ArrayCid: |
| case kTypedDataUint16ArrayCid: |
| case kOneByteStringCid: |
| case kTwoByteStringCid: |
| return CompileType::FromCid(kSmiCid); |
| |
| case kTypedDataInt32ArrayCid: |
| case kTypedDataUint32ArrayCid: |
| // Result can be Smi or Mint when boxed. |
| // Instruction can deoptimize if we optimistically assumed that the result |
| // fits into Smi. |
| return CanDeoptimize() ? CompileType::FromCid(kSmiCid) |
| : CompileType::Int(); |
| |
| default: |
| UNIMPLEMENTED(); |
| return CompileType::Dynamic(); |
| } |
| } |
| |
| |
| Representation LoadIndexedInstr::representation() const { |
| switch (class_id_) { |
| case kArrayCid: |
| case kImmutableArrayCid: |
| case kTypedDataInt8ArrayCid: |
| case kTypedDataUint8ArrayCid: |
| case kTypedDataUint8ClampedArrayCid: |
| case kExternalTypedDataUint8ArrayCid: |
| case kExternalTypedDataUint8ClampedArrayCid: |
| case kTypedDataInt16ArrayCid: |
| case kTypedDataUint16ArrayCid: |
| case kOneByteStringCid: |
| case kTwoByteStringCid: |
| return kTagged; |
| case kTypedDataInt32ArrayCid: |
| case kTypedDataUint32ArrayCid: |
| // Instruction can deoptimize if we optimistically assumed that the result |
| // fits into Smi. |
| return CanDeoptimize() ? kTagged : kUnboxedMint; |
| case kTypedDataFloat32ArrayCid: |
| case kTypedDataFloat64ArrayCid: |
| return kUnboxedDouble; |
| case kTypedDataInt32x4ArrayCid: |
| return kUnboxedInt32x4; |
| case kTypedDataFloat32x4ArrayCid: |
| return kUnboxedFloat32x4; |
| default: |
| UNIMPLEMENTED(); |
| return kTagged; |
| } |
| } |
| |
| |
| LocationSummary* LoadIndexedInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::RequiresRegister()); |
| // The smi index is either untagged (element size == 1), or it is left smi |
| // tagged (for all element sizes > 1). |
| // TODO(regis): Revisit and see if the index can be immediate. |
| locs->set_in(1, Location::WritableRegister()); |
| if ((representation() == kUnboxedDouble) || |
| (representation() == kUnboxedFloat32x4) || |
| (representation() == kUnboxedInt32x4)) { |
| locs->set_out(0, Location::RequiresFpuRegister()); |
| } else { |
| locs->set_out(0, Location::RequiresRegister()); |
| } |
| return locs; |
| } |
| |
| |
| void LoadIndexedInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("LoadIndexedInstr"); |
| Register array = locs()->in(0).reg(); |
| Location index = locs()->in(1); |
| |
| Address element_address(kNoRegister, 0); |
| |
| ASSERT(index.IsRegister()); // TODO(regis): Revisit. |
| // Note that index is expected smi-tagged, (i.e, times 2) for all arrays |
| // with index scale factor > 1. E.g., for Uint8Array and OneByteString the |
| // index is expected to be untagged before accessing. |
| ASSERT(kSmiTagShift == 1); |
| switch (index_scale()) { |
| case 1: { |
| __ SmiUntag(index.reg()); |
| break; |
| } |
| case 2: { |
| break; |
| } |
| case 4: { |
| __ sll(index.reg(), index.reg(), 1); |
| break; |
| } |
| case 8: { |
| __ sll(index.reg(), index.reg(), 2); |
| break; |
| } |
| case 16: { |
| __ sll(index.reg(), index.reg(), 3); |
| break; |
| } |
| default: |
| UNREACHABLE(); |
| } |
| __ addu(index.reg(), array, index.reg()); |
| |
| if (IsExternal()) { |
| element_address = Address(index.reg(), 0); |
| } else { |
| ASSERT(this->array()->definition()->representation() == kTagged); |
| // If the data offset doesn't fit into the 18 bits we get for the addressing |
| // mode, then we must load the offset into a register and add it to the |
| // index. |
| element_address = Address(index.reg(), |
| FlowGraphCompiler::DataOffsetFor(class_id()) - kHeapObjectTag); |
| } |
| |
| if ((representation() == kUnboxedDouble) || |
| (representation() == kUnboxedMint) || |
| (representation() == kUnboxedFloat32x4) || |
| (representation() == kUnboxedInt32x4)) { |
| DRegister result = locs()->out(0).fpu_reg(); |
| switch (class_id()) { |
| case kTypedDataInt32ArrayCid: |
| UNIMPLEMENTED(); |
| break; |
| case kTypedDataUint32ArrayCid: |
| UNIMPLEMENTED(); |
| break; |
| case kTypedDataFloat32ArrayCid: |
| // Load single precision float. |
| __ lwc1(EvenFRegisterOf(result), element_address); |
| break; |
| case kTypedDataFloat64ArrayCid: |
| __ LoadDFromOffset(result, index.reg(), |
| FlowGraphCompiler::DataOffsetFor(class_id()) - kHeapObjectTag); |
| break; |
| case kTypedDataInt32x4ArrayCid: |
| case kTypedDataFloat32x4ArrayCid: |
| UNIMPLEMENTED(); |
| break; |
| } |
| return; |
| } |
| |
| Register result = locs()->out(0).reg(); |
| switch (class_id()) { |
| case kTypedDataInt8ArrayCid: |
| ASSERT(index_scale() == 1); |
| __ lb(result, element_address); |
| __ SmiTag(result); |
| break; |
| case kTypedDataUint8ArrayCid: |
| case kTypedDataUint8ClampedArrayCid: |
| case kExternalTypedDataUint8ArrayCid: |
| case kExternalTypedDataUint8ClampedArrayCid: |
| case kOneByteStringCid: |
| ASSERT(index_scale() == 1); |
| __ lbu(result, element_address); |
| __ SmiTag(result); |
| break; |
| case kTypedDataInt16ArrayCid: |
| __ lh(result, element_address); |
| __ SmiTag(result); |
| break; |
| case kTypedDataUint16ArrayCid: |
| case kTwoByteStringCid: |
| __ lhu(result, element_address); |
| __ SmiTag(result); |
| break; |
| case kTypedDataInt32ArrayCid: { |
| Label* deopt = compiler->AddDeoptStub(deopt_id(), kDeoptInt32Load); |
| __ lw(result, element_address); |
| // Verify that the signed value in 'result' can fit inside a Smi. |
| __ BranchSignedLess(result, 0xC0000000, deopt); |
| __ SmiTag(result); |
| } |
| break; |
| case kTypedDataUint32ArrayCid: { |
| Label* deopt = compiler->AddDeoptStub(deopt_id(), kDeoptUint32Load); |
| __ lw(result, element_address); |
| // Verify that the unsigned value in 'result' can fit inside a Smi. |
| __ LoadImmediate(TMP, 0xC0000000); |
| __ and_(CMPRES1, result, TMP); |
| __ bne(CMPRES1, ZR, deopt); |
| __ SmiTag(result); |
| } |
| break; |
| default: |
| ASSERT((class_id() == kArrayCid) || (class_id() == kImmutableArrayCid)); |
| __ lw(result, element_address); |
| break; |
| } |
| } |
| |
| |
| Representation StoreIndexedInstr::RequiredInputRepresentation( |
| intptr_t idx) const { |
| // Array can be a Dart object or a pointer to external data. |
| if (idx == 0) return kNoRepresentation; // Flexible input representation. |
| if (idx == 1) return kTagged; // Index is a smi. |
| ASSERT(idx == 2); |
| switch (class_id_) { |
| case kArrayCid: |
| case kOneByteStringCid: |
| case kTypedDataInt8ArrayCid: |
| case kTypedDataUint8ArrayCid: |
| case kExternalTypedDataUint8ArrayCid: |
| case kTypedDataUint8ClampedArrayCid: |
| case kExternalTypedDataUint8ClampedArrayCid: |
| case kTypedDataInt16ArrayCid: |
| case kTypedDataUint16ArrayCid: |
| return kTagged; |
| case kTypedDataInt32ArrayCid: |
| case kTypedDataUint32ArrayCid: |
| return value()->IsSmiValue() ? kTagged : kUnboxedMint; |
| case kTypedDataFloat32ArrayCid: |
| case kTypedDataFloat64ArrayCid: |
| return kUnboxedDouble; |
| case kTypedDataFloat32x4ArrayCid: |
| return kUnboxedFloat32x4; |
| case kTypedDataInt32x4ArrayCid: |
| return kUnboxedInt32x4; |
| default: |
| UNIMPLEMENTED(); |
| return kTagged; |
| } |
| } |
| |
| |
| LocationSummary* StoreIndexedInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 3; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::RequiresRegister()); |
| // The smi index is either untagged (element size == 1), or it is left smi |
| // tagged (for all element sizes > 1). |
| // TODO(regis): Revisit and see if the index can be immediate. |
| locs->set_in(1, Location::WritableRegister()); |
| switch (class_id()) { |
| case kArrayCid: |
| locs->set_in(2, ShouldEmitStoreBarrier() |
| ? Location::WritableRegister() |
| : Location::RegisterOrConstant(value())); |
| break; |
| case kExternalTypedDataUint8ArrayCid: |
| case kExternalTypedDataUint8ClampedArrayCid: |
| case kTypedDataInt8ArrayCid: |
| case kTypedDataUint8ArrayCid: |
| case kTypedDataUint8ClampedArrayCid: |
| case kOneByteStringCid: |
| case kTypedDataInt16ArrayCid: |
| case kTypedDataUint16ArrayCid: |
| case kTypedDataInt32ArrayCid: |
| case kTypedDataUint32ArrayCid: |
| locs->set_in(2, Location::WritableRegister()); |
| break; |
| case kTypedDataFloat32ArrayCid: |
| // TODO(regis): Verify. |
| // Need temp register for float-to-double conversion. |
| locs->AddTemp(Location::RequiresFpuRegister()); |
| // Fall through. |
| case kTypedDataFloat64ArrayCid: // TODO(srdjan): Support Float64 constants. |
| case kTypedDataInt32x4ArrayCid: |
| case kTypedDataFloat32x4ArrayCid: |
| locs->set_in(2, Location::RequiresFpuRegister()); |
| break; |
| default: |
| UNREACHABLE(); |
| return NULL; |
| } |
| return locs; |
| } |
| |
| |
| void StoreIndexedInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("StoreIndexedInstr"); |
| Register array = locs()->in(0).reg(); |
| Location index = locs()->in(1); |
| |
| Address element_address(kNoRegister, 0); |
| ASSERT(index.IsRegister()); // TODO(regis): Revisit. |
| // Note that index is expected smi-tagged, (i.e, times 2) for all arrays |
| // with index scale factor > 1. E.g., for Uint8Array and OneByteString the |
| // index is expected to be untagged before accessing. |
| ASSERT(kSmiTagShift == 1); |
| switch (index_scale()) { |
| case 1: { |
| __ SmiUntag(index.reg()); |
| break; |
| } |
| case 2: { |
| break; |
| } |
| case 4: { |
| __ sll(index.reg(), index.reg(), 1); |
| break; |
| } |
| case 8: { |
| __ sll(index.reg(), index.reg(), 2); |
| break; |
| } |
| case 16: { |
| __ sll(index.reg(), index.reg(), 3); |
| break; |
| } |
| default: |
| UNREACHABLE(); |
| } |
| __ addu(index.reg(), array, index.reg()); |
| |
| if (IsExternal()) { |
| element_address = Address(index.reg(), 0); |
| } else { |
| ASSERT(this->array()->definition()->representation() == kTagged); |
| element_address = Address(index.reg(), |
| FlowGraphCompiler::DataOffsetFor(class_id()) - kHeapObjectTag); |
| } |
| |
| switch (class_id()) { |
| case kArrayCid: |
| if (ShouldEmitStoreBarrier()) { |
| Register value = locs()->in(2).reg(); |
| __ StoreIntoObject(array, element_address, value); |
| } 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: { |
| if (locs()->in(2).IsConstant()) { |
| const Smi& constant = Smi::Cast(locs()->in(2).constant()); |
| __ LoadImmediate(TMP, static_cast<int8_t>(constant.Value())); |
| __ sb(TMP, element_address); |
| } else { |
| Register value = locs()->in(2).reg(); |
| __ SmiUntag(value); |
| __ sb(value, element_address); |
| } |
| break; |
| } |
| case kTypedDataUint8ClampedArrayCid: |
| case kExternalTypedDataUint8ClampedArrayCid: { |
| 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; |
| } |
| __ LoadImmediate(TMP, static_cast<int8_t>(value)); |
| __ sb(TMP, element_address); |
| } else { |
| Register value = locs()->in(2).reg(); |
| Label store_value, bigger, smaller; |
| __ SmiUntag(value); |
| __ BranchUnsignedLess(value, 0xFF + 1, &store_value); |
| __ LoadImmediate(TMP, 0xFF); |
| __ slti(CMPRES1, value, Immediate(1)); |
| __ movn(TMP, ZR, CMPRES1); |
| __ mov(value, TMP); |
| __ Bind(&store_value); |
| __ sb(value, element_address); |
| } |
| break; |
| } |
| case kTypedDataInt16ArrayCid: |
| case kTypedDataUint16ArrayCid: { |
| Register value = locs()->in(2).reg(); |
| __ SmiUntag(value); |
| __ sh(value, element_address); |
| break; |
| } |
| case kTypedDataInt32ArrayCid: |
| case kTypedDataUint32ArrayCid: { |
| if (value()->IsSmiValue()) { |
| ASSERT(RequiredInputRepresentation(2) == kTagged); |
| Register value = locs()->in(2).reg(); |
| __ SmiUntag(value); |
| __ sw(value, element_address); |
| } else { |
| UNIMPLEMENTED(); |
| } |
| break; |
| } |
| case kTypedDataFloat32ArrayCid: { |
| FRegister value = EvenFRegisterOf(locs()->in(2).fpu_reg()); |
| __ swc1(value, element_address); |
| break; |
| } |
| case kTypedDataFloat64ArrayCid: |
| __ StoreDToOffset(locs()->in(2).fpu_reg(), index.reg(), |
| FlowGraphCompiler::DataOffsetFor(class_id()) - kHeapObjectTag); |
| break; |
| case kTypedDataInt32x4ArrayCid: |
| case kTypedDataFloat32x4ArrayCid: |
| UNIMPLEMENTED(); |
| break; |
| default: |
| UNREACHABLE(); |
| } |
| } |
| |
| |
| LocationSummary* GuardFieldInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, 0, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RequiresRegister()); |
| const bool field_has_length = field().needs_length_check(); |
| const bool need_value_temp_reg = |
| (field_has_length || ((value()->Type()->ToCid() == kDynamicCid) && |
| (field().guarded_cid() != kSmiCid))); |
| if (need_value_temp_reg) { |
| summary->AddTemp(Location::RequiresRegister()); |
| } |
| const bool need_field_temp_reg = |
| field_has_length || (field().guarded_cid() == kIllegalCid); |
| if (need_field_temp_reg) { |
| summary->AddTemp(Location::RequiresRegister()); |
| } |
| return summary; |
| } |
| |
| |
| void GuardFieldInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("GuardFieldInstr"); |
| const intptr_t field_cid = field().guarded_cid(); |
| const intptr_t nullability = field().is_nullable() ? kNullCid : kIllegalCid; |
| const intptr_t field_length = field().guarded_list_length(); |
| const bool field_has_length = field().needs_length_check(); |
| const bool needs_value_temp_reg = |
| (field_has_length || ((value()->Type()->ToCid() == kDynamicCid) && |
| (field().guarded_cid() != kSmiCid))); |
| const bool needs_field_temp_reg = |
| field_has_length || (field().guarded_cid() == kIllegalCid); |
| if (field_has_length) { |
| // Currently, we should only see final fields that remember length. |
| ASSERT(field().is_final()); |
| } |
| |
| if (field_cid == kDynamicCid) { |
| ASSERT(!compiler->is_optimizing()); |
| return; // Nothing to emit. |
| } |
| |
| const intptr_t value_cid = value()->Type()->ToCid(); |
| |
| Register value_reg = locs()->in(0).reg(); |
| |
| Register value_cid_reg = needs_value_temp_reg ? |
| locs()->temp(0).reg() : kNoRegister; |
| |
| Register field_reg = needs_field_temp_reg ? |
| locs()->temp(locs()->temp_count() - 1).reg() : kNoRegister; |
| |
| Label ok, fail_label; |
| |
| Label* deopt = compiler->is_optimizing() ? |
| compiler->AddDeoptStub(deopt_id(), kDeoptGuardField) : NULL; |
| |
| Label* fail = (deopt != NULL) ? deopt : &fail_label; |
| |
| if (!compiler->is_optimizing() || (field_cid == kIllegalCid)) { |
| if (!compiler->is_optimizing() && (field_reg == kNoRegister)) { |
| // Currently we can't have different location summaries for optimized |
| // and non-optimized code. So instead we manually pick up a register |
| // that is known to be free because we know how non-optimizing compiler |
| // allocates registers. |
| field_reg = A0; |
| ASSERT((field_reg != value_reg) && (field_reg != value_cid_reg)); |
| } |
| |
| __ LoadObject(field_reg, Field::ZoneHandle(field().raw())); |
| |
| FieldAddress field_cid_operand(field_reg, Field::guarded_cid_offset()); |
| FieldAddress field_nullability_operand( |
| field_reg, Field::is_nullable_offset()); |
| FieldAddress field_length_operand( |
| field_reg, Field::guarded_list_length_offset()); |
| |
| if (value_cid == kDynamicCid) { |
| if (value_cid_reg == kNoRegister) { |
| ASSERT(!compiler->is_optimizing()); |
| value_cid_reg = A1; |
| ASSERT((value_cid_reg != value_reg) && (field_reg != value_cid_reg)); |
| } |
| |
| LoadValueCid(compiler, value_cid_reg, value_reg); |
| |
| Label skip_length_check; |
| |
| __ lw(CMPRES1, field_cid_operand); |
| __ bne(value_cid_reg, CMPRES1, &skip_length_check); |
| if (field_has_length) { |
| // Field guard may have remembered list length, check it. |
| if ((field_cid == kArrayCid) || (field_cid == kImmutableArrayCid)) { |
| __ lw(TMP, FieldAddress(value_reg, Array::length_offset())); |
| __ LoadImmediate(CMPRES1, Smi::RawValue(field_length)); |
| __ subu(CMPRES1, TMP, CMPRES1); |
| } else if (RawObject::IsTypedDataClassId(field_cid)) { |
| __ lw(TMP, FieldAddress(value_reg, TypedData::length_offset())); |
| __ LoadImmediate(CMPRES1, Smi::RawValue(field_length)); |
| __ subu(CMPRES1, TMP, CMPRES1); |
| } else { |
| ASSERT(field_cid == kIllegalCid); |
| ASSERT(field_length == Field::kUnknownFixedLength); |
| // At compile time we do not know the type of the field nor its |
| // length. At execution time we may have set the class id and |
| // list length so we compare the guarded length with the |
| // list length here, without this check the list length could change |
| // without triggering a deoptimization. |
| Label check_array, length_compared, no_fixed_length; |
| // If length is negative the length guard is either disabled or |
| // has not been initialized, either way it is safe to skip the |
| // length check. |
| __ lw(CMPRES1, field_length_operand); |
| __ BranchSignedLess(CMPRES1, 0, &skip_length_check); |
| __ BranchEqual(value_cid_reg, kNullCid, &no_fixed_length); |
| // Check for typed data array. |
| __ BranchSignedGreater(value_cid_reg, kTypedDataInt32x4ArrayCid, |
| &no_fixed_length); |
| __ BranchSignedLess(value_cid_reg, kTypedDataInt8ArrayCid, |
| &check_array); |
| __ lw(TMP, FieldAddress(value_reg, TypedData::length_offset())); |
| __ lw(CMPRES1, field_length_operand); |
| __ subu(CMPRES1, TMP, CMPRES1); |
| __ b(&length_compared); |
| // Check for regular array. |
| __ Bind(&check_array); |
| __ BranchSignedGreater(value_cid_reg, kImmutableArrayCid, |
| &no_fixed_length); |
| __ BranchSignedLess(value_cid_reg, kArrayCid, &no_fixed_length); |
| __ lw(TMP, FieldAddress(value_reg, Array::length_offset())); |
| __ lw(CMPRES1, field_length_operand); |
| __ subu(CMPRES1, TMP, CMPRES1); |
| __ b(&length_compared); |
| __ Bind(&no_fixed_length); |
| __ b(fail); |
| __ Bind(&length_compared); |
| } |
| __ bne(CMPRES1, ZR, fail); |
| } |
| __ Bind(&skip_length_check); |
| __ lw(TMP, field_nullability_operand); |
| __ subu(CMPRES1, value_cid_reg, TMP); |
| } else if (value_cid == kNullCid) { |
| __ lw(TMP, field_nullability_operand); |
| __ LoadImmediate(CMPRES1, value_cid); |
| __ subu(CMPRES1, TMP, CMPRES1); |
| } else { |
| Label skip_length_check; |
| __ lw(TMP, field_cid_operand); |
| __ LoadImmediate(CMPRES1, value_cid); |
| __ subu(CMPRES1, TMP, CMPRES1); |
| __ bne(CMPRES1, ZR, &skip_length_check); |
| // Insert length check. |
| if (field_has_length) { |
| ASSERT(value_cid_reg != kNoRegister); |
| if ((value_cid == kArrayCid) || (value_cid == kImmutableArrayCid)) { |
| __ lw(TMP, FieldAddress(value_reg, Array::length_offset())); |
| __ LoadImmediate(CMPRES1, Smi::RawValue(field_length)); |
| __ subu(CMPRES1, TMP, CMPRES1); |
| } else if (RawObject::IsTypedDataClassId(value_cid)) { |
| __ lw(TMP, FieldAddress(value_reg, TypedData::length_offset())); |
| __ LoadImmediate(CMPRES1, Smi::RawValue(field_length)); |
| __ subu(CMPRES1, TMP, CMPRES1); |
| } else if (field_cid != kIllegalCid) { |
| ASSERT(field_cid != value_cid); |
| ASSERT(field_length >= 0); |
| // Field has a known class id and length. At compile time it is |
| // known that the value's class id is not a fixed length list. |
| __ b(fail); |
| } else { |
| ASSERT(field_cid == kIllegalCid); |
| ASSERT(field_length == Field::kUnknownFixedLength); |
| // Following jump cannot not occur, fall through. |
| } |
| __ bne(CMPRES1, ZR, fail); |
| } |
| __ Bind(&skip_length_check); |
| } |
| __ beq(CMPRES1, ZR, &ok); |
| |
| __ lw(CMPRES1, field_cid_operand); |
| __ BranchNotEqual(CMPRES1, kIllegalCid, fail); |
| |
| if (value_cid == kDynamicCid) { |
| __ sw(value_cid_reg, field_cid_operand); |
| __ sw(value_cid_reg, field_nullability_operand); |
| if (field_has_length) { |
| Label check_array, length_set, no_fixed_length; |
| __ BranchEqual(value_cid_reg, kNullCid, &no_fixed_length); |
| // Check for typed data array. |
| __ BranchSignedGreater(value_cid_reg, kTypedDataInt32x4ArrayCid, |
| &no_fixed_length); |
| __ BranchSignedLess(value_cid_reg, kTypedDataInt8ArrayCid, |
| &check_array); |
| // Destroy value_cid_reg (safe because we are finished with it). |
| __ lw(value_cid_reg, |
| FieldAddress(value_reg, TypedData::length_offset())); |
| __ sw(value_cid_reg, field_length_operand); |
| // Updated field length typed data array. |
| __ b(&length_set); |
| // Check for regular array. |
| __ Bind(&check_array); |
| __ BranchSignedGreater(value_cid_reg, kImmutableArrayCid, |
| &no_fixed_length); |
| __ BranchSignedLess(value_cid_reg, kArrayCid, &no_fixed_length); |
| // Destroy value_cid_reg (safe because we are finished with it). |
| __ lw(value_cid_reg, |
| FieldAddress(value_reg, Array::length_offset())); |
| __ sw(value_cid_reg, field_length_operand); |
| // Updated field length from regular array. |
| __ b(&length_set); |
| __ Bind(&no_fixed_length); |
| __ LoadImmediate(TMP, Smi::RawValue(Field::kNoFixedLength)); |
| __ sw(TMP, field_length_operand); |
| __ Bind(&length_set); |
| } |
| } else { |
| ASSERT(field_reg != kNoRegister); |
| __ LoadImmediate(TMP, value_cid); |
| __ sw(TMP, field_cid_operand); |
| __ sw(TMP, field_nullability_operand); |
| if (field_has_length) { |
| ASSERT(value_cid_reg != kNoRegister); |
| if ((value_cid == kArrayCid) || (value_cid == kImmutableArrayCid)) { |
| // Destroy value_cid_reg (safe because we are finished with it). |
| __ lw(value_cid_reg, |
| FieldAddress(value_reg, Array::length_offset())); |
| __ sw(value_cid_reg, field_length_operand); |
| } else if (RawObject::IsTypedDataClassId(value_cid)) { |
| // Destroy value_cid_reg (safe because we are finished with it). |
| __ lw(value_cid_reg, |
| FieldAddress(value_reg, TypedData::length_offset())); |
| __ sw(value_cid_reg, field_length_operand); |
| } else { |
| // Destroy value_cid_reg (safe because we are finished with it). |
| __ LoadImmediate(value_cid_reg, Smi::RawValue(Field::kNoFixedLength)); |
| __ sw(value_cid_reg, field_length_operand); |
| } |
| } |
| } |
| |
| if (deopt == NULL) { |
| ASSERT(!compiler->is_optimizing()); |
| __ b(&ok); |
| __ Bind(fail); |
| |
| __ lw(CMPRES1, FieldAddress(field_reg, Field::guarded_cid_offset())); |
| __ BranchEqual(CMPRES1, kDynamicCid, &ok); |
| |
| __ addiu(SP, SP, Immediate(-2 * kWordSize)); |
| __ sw(field_reg, Address(SP, 1 * kWordSize)); |
| __ sw(value_reg, Address(SP, 0 * kWordSize)); |
| __ CallRuntime(kUpdateFieldCidRuntimeEntry, 2); |
| __ Drop(2); // Drop the field and the value. |
| } |
| } else { |
| ASSERT(compiler->is_optimizing()); |
| ASSERT(deopt != NULL); |
| // Field guard class has been initialized and is known. |
| if (field_reg != kNoRegister) { |
| __ LoadObject(field_reg, Field::ZoneHandle(field().raw())); |
| } |
| if (value_cid == kDynamicCid) { |
| // Field's guarded class id is fixed by value's class id is not known. |
| __ andi(CMPRES1, value_reg, Immediate(kSmiTagMask)); |
| |
| if (field_cid != kSmiCid) { |
| __ beq(CMPRES1, ZR, fail); |
| __ LoadClassId(value_cid_reg, value_reg); |
| __ LoadImmediate(TMP, field_cid); |
| __ subu(CMPRES1, value_cid_reg, TMP); |
| } |
| |
| if (field_has_length) { |
| // Jump when Value CID != Field guard CID |
| __ bne(CMPRES1, ZR, fail); |
| // Classes are same, perform guarded list length check. |
| ASSERT(field_reg != kNoRegister); |
| ASSERT(value_cid_reg != kNoRegister); |
| FieldAddress field_length_operand( |
| field_reg, Field::guarded_list_length_offset()); |
| if ((field_cid == kArrayCid) || (field_cid == kImmutableArrayCid)) { |
| // Destroy value_cid_reg (safe because we are finished with it). |
| __ lw(value_cid_reg, |
| FieldAddress(value_reg, Array::length_offset())); |
| } else if (RawObject::IsTypedDataClassId(field_cid)) { |
| // Destroy value_cid_reg (safe because we are finished with it). |
| __ lw(value_cid_reg, |
| FieldAddress(value_reg, TypedData::length_offset())); |
| } |
| __ lw(TMP, field_length_operand); |
| __ subu(CMPRES1, value_cid_reg, TMP); |
| } |
| |
| if (field().is_nullable() && (field_cid != kNullCid)) { |
| __ beq(CMPRES1, ZR, &ok); |
| __ LoadImmediate(TMP, reinterpret_cast<int32_t>(Object::null())); |
| __ subu(CMPRES1, value_reg, TMP); |
| } |
| |
| __ bne(CMPRES1, ZR, fail); |
| } else { |
| // Both value's and field's class id is known. |
| if ((value_cid != field_cid) && (value_cid != nullability)) { |
| __ b(fail); |
| } else if (field_has_length && (value_cid == field_cid)) { |
| ASSERT(value_cid_reg != kNoRegister); |
| if ((field_cid == kArrayCid) || (field_cid == kImmutableArrayCid)) { |
| // Destroy value_cid_reg (safe because we are finished with it). |
| __ lw(value_cid_reg, |
| FieldAddress(value_reg, Array::length_offset())); |
| } else if (RawObject::IsTypedDataClassId(field_cid)) { |
| // Destroy value_cid_reg (safe because we are finished with it). |
| __ lw(value_cid_reg, |
| FieldAddress(value_reg, TypedData::length_offset())); |
| } |
| __ LoadImmediate(TMP, Smi::RawValue(field_length)); |
| __ subu(CMPRES1, value_cid_reg, TMP); |
| __ bne(CMPRES1, ZR, fail); |
| } else { |
| UNREACHABLE(); |
| } |
| } |
| } |
| __ Bind(&ok); |
| } |
| |
| |
| class StoreInstanceFieldSlowPath : public SlowPathCode { |
| public: |
| StoreInstanceFieldSlowPath(StoreInstanceFieldInstr* instruction, |
| const Class& cls) |
| : instruction_(instruction), cls_(cls) { } |
| |
| virtual void EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ Comment("StoreInstanceFieldSlowPath"); |
| __ Bind(entry_label()); |
| const Code& stub = |
| Code::Handle(StubCode::GetAllocationStubForClass(cls_)); |
| const ExternalLabel label(cls_.ToCString(), stub.EntryPoint()); |
| |
| LocationSummary* locs = instruction_->locs(); |
| locs->live_registers()->Remove(locs->out(0)); |
| |
| compiler->SaveLiveRegisters(locs); |
| compiler->GenerateCall(Scanner::kNoSourcePos, // No token position. |
| &label, |
| PcDescriptors::kOther, |
| locs); |
| __ mov(locs->temp(0).reg(), V0); |
| compiler->RestoreLiveRegisters(locs); |
| |
| __ b(exit_label()); |
| } |
| |
| private: |
| StoreInstanceFieldInstr* instruction_; |
| const Class& cls_; |
| }; |
| |
| |
| LocationSummary* StoreInstanceFieldInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, |
| !field().IsNull() && |
| ((field().guarded_cid() == kIllegalCid) || is_initialization_) |
| ? LocationSummary::kCallOnSlowPath |
| : LocationSummary::kNoCall); |
| |
| summary->set_in(0, Location::RequiresRegister()); |
| if (IsUnboxedStore() && opt) { |
| summary->set_in(1, Location::RequiresFpuRegister()); |
| summary->AddTemp(Location::RequiresRegister()); |
| summary->AddTemp(Location::RequiresRegister()); |
| } else if (IsPotentialUnboxedStore()) { |
| summary->set_in(1, ShouldEmitStoreBarrier() |
| ? Location::WritableRegister() |
| : Location::RequiresRegister()); |
| summary->AddTemp(Location::RequiresRegister()); |
| summary->AddTemp(Location::RequiresRegister()); |
| summary->AddTemp(opt ? Location::RequiresFpuRegister() |
| : Location::FpuRegisterLocation(D1)); |
| } else { |
| summary->set_in(1, ShouldEmitStoreBarrier() |
| ? Location::WritableRegister() |
| : Location::RegisterOrConstant(value())); |
| } |
| return summary; |
| } |
| |
| |
| void StoreInstanceFieldInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Label skip_store; |
| |
| Register instance_reg = locs()->in(0).reg(); |
| |
| if (IsUnboxedStore() && compiler->is_optimizing()) { |
| DRegister value = locs()->in(1).fpu_reg(); |
| Register temp = locs()->temp(0).reg(); |
| Register temp2 = locs()->temp(1).reg(); |
| const intptr_t cid = field().UnboxedFieldCid(); |
| |
| if (is_initialization_) { |
| const Class* cls = NULL; |
| switch (cid) { |
| case kDoubleCid: |
| cls = &compiler->double_class(); |
| break; |
| default: |
| UNREACHABLE(); |
| } |
| |
| StoreInstanceFieldSlowPath* slow_path = |
| new StoreInstanceFieldSlowPath(this, *cls); |
| compiler->AddSlowPathCode(slow_path); |
| |
| __ TryAllocate(*cls, |
| slow_path->entry_label(), |
| temp, |
| temp2); |
| __ Bind(slow_path->exit_label()); |
| __ mov(temp2, temp); |
| __ StoreIntoObject(instance_reg, |
| FieldAddress(instance_reg, offset_in_bytes_), |
| temp2); |
| } else { |
| __ lw(temp, FieldAddress(instance_reg, offset_in_bytes_)); |
| } |
| switch (cid) { |
| case kDoubleCid: |
| __ StoreDToOffset(value, temp, Double::value_offset() - kHeapObjectTag); |
| break; |
| default: |
| UNREACHABLE(); |
| } |
| return; |
| } |
| |
| if (IsPotentialUnboxedStore()) { |
| Register value_reg = locs()->in(1).reg(); |
| Register temp = locs()->temp(0).reg(); |
| Register temp2 = locs()->temp(1).reg(); |
| DRegister fpu_temp = locs()->temp(2).fpu_reg(); |
| |
| Label store_pointer; |
| Label store_double; |
| |
| __ LoadObject(temp, Field::ZoneHandle(field().raw())); |
| |
| __ lw(temp2, FieldAddress(temp, Field::is_nullable_offset())); |
| __ BranchEqual(temp2, kNullCid, &store_pointer); |
| |
| __ lbu(temp2, FieldAddress(temp, Field::kind_bits_offset())); |
| __ andi(CMPRES1, temp2, Immediate(1 << Field::kUnboxingCandidateBit)); |
| __ beq(CMPRES1, ZR, &store_pointer); |
| |
| __ lw(temp2, FieldAddress(temp, Field::guarded_cid_offset())); |
| __ BranchEqual(temp2, kDoubleCid, &store_double); |
| |
| // Fall through. |
| __ b(&store_pointer); |
| |
| if (!compiler->is_optimizing()) { |
| locs()->live_registers()->Add(locs()->in(0)); |
| locs()->live_registers()->Add(locs()->in(1)); |
| } |
| |
| { |
| __ Bind(&store_double); |
| Label copy_double; |
| |
| __ lw(temp, FieldAddress(instance_reg, offset_in_bytes_)); |
| __ BranchNotEqual(temp, reinterpret_cast<int32_t>(Object::null()), |
| ©_double); |
| |
| StoreInstanceFieldSlowPath* slow_path = |
| new StoreInstanceFieldSlowPath(this, compiler->double_class()); |
| compiler->AddSlowPathCode(slow_path); |
| |
| __ TryAllocate(compiler->double_class(), |
| slow_path->entry_label(), |
| temp, |
| temp2); |
| __ Bind(slow_path->exit_label()); |
| __ mov(temp2, temp); |
| __ StoreIntoObject(instance_reg, |
| FieldAddress(instance_reg, offset_in_bytes_), |
| temp2); |
| |
| __ Bind(©_double); |
| __ LoadDFromOffset(fpu_temp, |
| value_reg, |
| Double::value_offset() - kHeapObjectTag); |
| __ StoreDToOffset(fpu_temp, temp, |
| Double::value_offset() - kHeapObjectTag); |
| __ b(&skip_store); |
| } |
| |
| __ Bind(&store_pointer); |
| } |
| |
| if (ShouldEmitStoreBarrier()) { |
| Register value_reg = locs()->in(1).reg(); |
| __ StoreIntoObject(instance_reg, |
| FieldAddress(instance_reg, offset_in_bytes_), |
| value_reg, |
| CanValueBeSmi()); |
| } else { |
| if (locs()->in(1).IsConstant()) { |
| __ StoreIntoObjectNoBarrier( |
| instance_reg, |
| FieldAddress(instance_reg, offset_in_bytes_), |
| locs()->in(1).constant()); |
| } else { |
| Register value_reg = locs()->in(1).reg(); |
| __ StoreIntoObjectNoBarrier(instance_reg, |
| FieldAddress(instance_reg, offset_in_bytes_), value_reg); |
| } |
| } |
| __ Bind(&skip_store); |
| } |
| |
| |
| LocationSummary* LoadStaticFieldInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RequiresRegister()); |
| summary->set_out(0, Location::RequiresRegister()); |
| return summary; |
| } |
| |
| |
| // When the parser is building an implicit static getter for optimization, |
| // it can generate a function body where deoptimization ids do not line up |
| // with the unoptimized code. |
| // |
| // This is safe only so long as LoadStaticFieldInstr cannot deoptimize. |
| void LoadStaticFieldInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("LoadStaticFieldInstr"); |
| Register field = locs()->in(0).reg(); |
| Register result = locs()->out(0).reg(); |
| __ lw(result, FieldAddress(field, Field::value_offset())); |
| } |
| |
| |
| LocationSummary* StoreStaticFieldInstr::MakeLocationSummary(bool opt) const { |
| LocationSummary* locs = new LocationSummary(1, 1, LocationSummary::kNoCall); |
| locs->set_in(0, value()->NeedsStoreBuffer() ? Location::WritableRegister() |
| : Location::RequiresRegister()); |
| locs->set_temp(0, Location::RequiresRegister()); |
| return locs; |
| } |
| |
| |
| void StoreStaticFieldInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("StoreStaticFieldInstr"); |
| Register value = locs()->in(0).reg(); |
| Register temp = locs()->temp(0).reg(); |
| |
| __ LoadObject(temp, field()); |
| if (this->value()->NeedsStoreBuffer()) { |
| __ StoreIntoObject(temp, |
| FieldAddress(temp, Field::value_offset()), value, CanValueBeSmi()); |
| } else { |
| __ StoreIntoObjectNoBarrier( |
| temp, FieldAddress(temp, Field::value_offset()), value); |
| } |
| } |
| |
| |
| LocationSummary* InstanceOfInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 3; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kCall); |
| summary->set_in(0, Location::RegisterLocation(A0)); |
| summary->set_in(1, Location::RegisterLocation(A2)); |
| summary->set_in(2, Location::RegisterLocation(A1)); |
| summary->set_out(0, Location::RegisterLocation(V0)); |
| return summary; |
| } |
| |
| |
| void InstanceOfInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| ASSERT(locs()->in(0).reg() == A0); // Value. |
| ASSERT(locs()->in(1).reg() == A2); // Instantiator. |
| ASSERT(locs()->in(2).reg() == A1); // Instantiator type arguments. |
| |
| __ Comment("InstanceOfInstr"); |
| compiler->GenerateInstanceOf(token_pos(), |
| deopt_id(), |
| type(), |
| negate_result(), |
| locs()); |
| ASSERT(locs()->out(0).reg() == V0); |
| } |
| |
| |
| LocationSummary* CreateArrayInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kCall); |
| locs->set_in(0, Location::RegisterLocation(A0)); |
| locs->set_in(1, Location::RegisterLocation(A1)); |
| locs->set_out(0, Location::RegisterLocation(V0)); |
| return locs; |
| } |
| |
| |
| void CreateArrayInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("CreateArrayInstr"); |
| // Allocate the array. A1 = length, A0 = element type. |
| ASSERT(locs()->in(0).reg() == A0); |
| ASSERT(locs()->in(1).reg() == A1); |
| compiler->GenerateCall(token_pos(), |
| &StubCode::AllocateArrayLabel(), |
| PcDescriptors::kOther, |
| locs()); |
| ASSERT(locs()->out(0).reg() == V0); |
| } |
| |
| |
| class BoxDoubleSlowPath : public SlowPathCode { |
| public: |
| explicit BoxDoubleSlowPath(Instruction* instruction) |
| : instruction_(instruction) { } |
| |
| virtual void EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ Comment("BoxDoubleSlowPath"); |
| __ Bind(entry_label()); |
| const Class& double_class = compiler->double_class(); |
| const Code& stub = |
| Code::Handle(StubCode::GetAllocationStubForClass(double_class)); |
| const ExternalLabel label(double_class.ToCString(), stub.EntryPoint()); |
| |
| LocationSummary* locs = instruction_->locs(); |
| locs->live_registers()->Remove(locs->out(0)); |
| |
| compiler->SaveLiveRegisters(locs); |
| compiler->GenerateCall(Scanner::kNoSourcePos, // No token position. |
| &label, |
| PcDescriptors::kOther, |
| locs); |
| if (locs->out(0).reg() != V0) { |
| __ mov(locs->out(0).reg(), V0); |
| } |
| compiler->RestoreLiveRegisters(locs); |
| |
| __ b(exit_label()); |
| } |
| |
| private: |
| Instruction* instruction_; |
| }; |
| |
| |
| LocationSummary* LoadFieldInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = |
| new LocationSummary( |
| kNumInputs, kNumTemps, |
| (opt && !IsPotentialUnboxedLoad()) |
| ? LocationSummary::kNoCall |
| : LocationSummary::kCallOnSlowPath); |
| |
| locs->set_in(0, Location::RequiresRegister()); |
| |
| if (IsUnboxedLoad() && opt) { |
| locs->AddTemp(Location::RequiresRegister()); |
| } else if (IsPotentialUnboxedLoad()) { |
| locs->AddTemp(opt ? Location::RequiresFpuRegister() |
| : Location::FpuRegisterLocation(D1)); |
| locs->AddTemp(Location::RequiresRegister()); |
| } |
| locs->set_out(0, Location::RequiresRegister()); |
| return locs; |
| } |
| |
| |
| void LoadFieldInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Register instance_reg = locs()->in(0).reg(); |
| if (IsUnboxedLoad() && compiler->is_optimizing()) { |
| DRegister result = locs()->out(0).fpu_reg(); |
| Register temp = locs()->temp(0).reg(); |
| __ lw(temp, FieldAddress(instance_reg, offset_in_bytes())); |
| intptr_t cid = field()->UnboxedFieldCid(); |
| switch (cid) { |
| case kDoubleCid: |
| __ LoadDFromOffset(result, temp, |
| Double::value_offset() - kHeapObjectTag); |
| break; |
| default: |
| UNREACHABLE(); |
| } |
| return; |
| } |
| |
| Label done; |
| Register result_reg = locs()->out(0).reg(); |
| if (IsPotentialUnboxedLoad()) { |
| Register temp = locs()->temp(1).reg(); |
| DRegister value = locs()->temp(0).fpu_reg(); |
| |
| Label load_pointer; |
| Label load_double; |
| |
| __ LoadObject(result_reg, Field::ZoneHandle(field()->raw())); |
| |
| FieldAddress field_cid_operand(result_reg, Field::guarded_cid_offset()); |
| FieldAddress field_nullability_operand(result_reg, |
| Field::is_nullable_offset()); |
| |
| __ lw(temp, field_nullability_operand); |
| __ BranchEqual(temp, kNullCid, &load_pointer); |
| |
| __ lw(temp, field_cid_operand); |
| __ BranchEqual(temp, kDoubleCid, &load_double); |
| |
| // Fall through. |
| __ b(&load_pointer); |
| |
| if (!compiler->is_optimizing()) { |
| locs()->live_registers()->Add(locs()->in(0)); |
| } |
| |
| { |
| __ Bind(&load_double); |
| BoxDoubleSlowPath* slow_path = new BoxDoubleSlowPath(this); |
| compiler->AddSlowPathCode(slow_path); |
| |
| __ TryAllocate(compiler->double_class(), |
| slow_path->entry_label(), |
| result_reg, |
| temp); |
| __ Bind(slow_path->exit_label()); |
| __ lw(temp, FieldAddress(instance_reg, offset_in_bytes())); |
| __ LoadDFromOffset(value, temp, Double::value_offset() - kHeapObjectTag); |
| __ StoreDToOffset(value, |
| result_reg, |
| Double::value_offset() - kHeapObjectTag); |
| __ b(&done); |
| } |
| |
| __ Bind(&load_pointer); |
| } |
| __ lw(result_reg, Address(instance_reg, offset_in_bytes() - kHeapObjectTag)); |
| __ Bind(&done); |
| } |
| |
| |
| LocationSummary* InstantiateTypeInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kCall); |
| locs->set_in(0, Location::RegisterLocation(T0)); |
| locs->set_out(0, Location::RegisterLocation(T0)); |
| return locs; |
| } |
| |
| |
| void InstantiateTypeInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("InstantiateTypeInstr"); |
| Register instantiator_reg = locs()->in(0).reg(); |
| Register result_reg = locs()->out(0).reg(); |
| |
| // 'instantiator_reg' is the instantiator TypeArguments object (or null). |
| // A runtime call to instantiate the type is required. |
| __ addiu(SP, SP, Immediate(-3 * kWordSize)); |
| __ LoadObject(TMP, Object::ZoneHandle()); |
| __ sw(TMP, Address(SP, 2 * kWordSize)); // Make room for the result. |
| __ LoadObject(TMP, type()); |
| __ sw(TMP, Address(SP, 1 * kWordSize)); |
| // Push instantiator type arguments. |
| __ sw(instantiator_reg, Address(SP, 0 * kWordSize)); |
| |
| compiler->GenerateRuntimeCall(token_pos(), |
| deopt_id(), |
| kInstantiateTypeRuntimeEntry, |
| 2, |
| locs()); |
| // Pop instantiated type. |
| __ lw(result_reg, Address(SP, 2 * kWordSize)); |
| // Drop instantiator and uninstantiated type. |
| __ addiu(SP, SP, Immediate(3 * kWordSize)); |
| ASSERT(instantiator_reg == result_reg); |
| } |
| |
| |
| LocationSummary* InstantiateTypeArgumentsInstr::MakeLocationSummary( |
| bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kCall); |
| locs->set_in(0, Location::RegisterLocation(T0)); |
| locs->set_out(0, Location::RegisterLocation(T0)); |
| return locs; |
| } |
| |
| |
| void InstantiateTypeArgumentsInstr::EmitNativeCode( |
| FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("InstantiateTypeArgumentsInstr"); |
| Register instantiator_reg = locs()->in(0).reg(); |
| Register result_reg = locs()->out(0).reg(); |
| ASSERT(instantiator_reg == T0); |
| ASSERT(instantiator_reg == result_reg); |
| |
| // 'instantiator_reg' is the instantiator TypeArguments object (or null). |
| ASSERT(!type_arguments().IsUninstantiatedIdentity() && |
| !type_arguments().CanShareInstantiatorTypeArguments( |
| instantiator_class())); |
| // If the instantiator is null and if the type argument vector |
| // instantiated from null becomes a vector of dynamic, then use null as |
| // the type arguments. |
| Label type_arguments_instantiated; |
| const intptr_t len = type_arguments().Length(); |
| if (type_arguments().IsRawInstantiatedRaw(len)) { |
| __ BranchEqual(instantiator_reg, reinterpret_cast<int32_t>(Object::null()), |
| &type_arguments_instantiated); |
| } |
| |
| __ LoadObject(T2, type_arguments()); |
| __ lw(T2, FieldAddress(T2, TypeArguments::instantiations_offset())); |
| __ AddImmediate(T2, Array::data_offset() - kHeapObjectTag); |
| // The instantiations cache is initialized with Object::zero_array() and is |
| // therefore guaranteed to contain kNoInstantiator. No length check needed. |
| Label loop, found, slow_case; |
| __ Bind(&loop); |
| __ lw(T1, Address(T2, 0 * kWordSize)); // Cached instantiator. |
| __ beq(T1, T0, &found); |
| __ BranchNotEqual(T1, Smi::RawValue(StubCode::kNoInstantiator), &loop); |
| __ delay_slot()->addiu(T2, T2, Immediate(2 * kWordSize)); |
| __ b(&slow_case); |
| __ Bind(&found); |
| __ lw(T0, Address(T2, 1 * kWordSize)); // Cached instantiated args. |
| __ b(&type_arguments_instantiated); |
| |
| __ Bind(&slow_case); |
| // Instantiate non-null type arguments. |
| // A runtime call to instantiate the type arguments is required. |
| __ addiu(SP, SP, Immediate(-3 * kWordSize)); |
| __ LoadObject(TMP, Object::ZoneHandle()); |
| __ sw(TMP, Address(SP, 2 * kWordSize)); // Make room for the result. |
| __ LoadObject(TMP, type_arguments()); |
| __ sw(TMP, Address(SP, 1 * kWordSize)); |
| // Push instantiator type arguments. |
| __ sw(instantiator_reg, Address(SP, 0 * kWordSize)); |
| |
| compiler->GenerateRuntimeCall(token_pos(), |
| deopt_id(), |
| kInstantiateTypeArgumentsRuntimeEntry, |
| 2, |
| locs()); |
| // Pop instantiated type arguments. |
| __ lw(result_reg, Address(SP, 2 * kWordSize)); |
| // Drop instantiator and uninstantiated type arguments. |
| __ addiu(SP, SP, Immediate(3 * kWordSize)); |
| __ Bind(&type_arguments_instantiated); |
| } |
| |
| |
| LocationSummary* AllocateContextInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 0; |
| const intptr_t kNumTemps = 1; |
| LocationSummary* locs = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kCall); |
| locs->set_temp(0, Location::RegisterLocation(T1)); |
| locs->set_out(0, Location::RegisterLocation(V0)); |
| return locs; |
| } |
| |
| |
| void AllocateContextInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Register temp = T1; |
| ASSERT(locs()->temp(0).reg() == temp); |
| ASSERT(locs()->out(0).reg() == V0); |
| |
| __ TraceSimMsg("AllocateContextInstr"); |
| __ LoadImmediate(temp, num_context_variables()); |
| const ExternalLabel label("alloc_context", |
| StubCode::AllocateContextEntryPoint()); |
| compiler->GenerateCall(token_pos(), |
| &label, |
| PcDescriptors::kOther, |
| locs()); |
| } |
| |
| |
| LocationSummary* CloneContextInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kCall); |
| locs->set_in(0, Location::RegisterLocation(T0)); |
| locs->set_out(0, Location::RegisterLocation(T0)); |
| return locs; |
| } |
| |
| |
| void CloneContextInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Register context_value = locs()->in(0).reg(); |
| Register result = locs()->out(0).reg(); |
| |
| __ TraceSimMsg("CloneContextInstr"); |
| |
| __ addiu(SP, SP, Immediate(-2 * kWordSize)); |
| __ LoadObject(TMP, Object::ZoneHandle()); // Make room for the result. |
| __ sw(TMP, Address(SP, 1 * kWordSize)); |
| __ sw(context_value, Address(SP, 0 * kWordSize)); |
| |
| compiler->GenerateRuntimeCall(token_pos(), |
| deopt_id(), |
| kCloneContextRuntimeEntry, |
| 1, |
| locs()); |
| __ lw(result, Address(SP, 1 * kWordSize)); // Get result (cloned context). |
| __ addiu(SP, SP, Immediate(2 * kWordSize)); |
| } |
| |
| |
| LocationSummary* CatchBlockEntryInstr::MakeLocationSummary(bool opt) const { |
| UNREACHABLE(); |
| return NULL; |
| } |
| |
| |
| void CatchBlockEntryInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ Bind(compiler->GetJumpLabel(this)); |
| compiler->AddExceptionHandler(catch_try_index(), |
| try_index(), |
| compiler->assembler()->CodeSize(), |
| catch_handler_types_, |
| needs_stacktrace()); |
| // Restore pool pointer. |
| __ GetNextPC(CMPRES1, TMP); |
| const intptr_t object_pool_pc_dist = |
| Instructions::HeaderSize() - Instructions::object_pool_offset() + |
| compiler->assembler()->CodeSize() - 1 * Instr::kInstrSize; |
| __ LoadFromOffset(PP, CMPRES1, -object_pool_pc_dist); |
| |
| if (HasParallelMove()) { |
| compiler->parallel_move_resolver()->EmitNativeCode(parallel_move()); |
| } |
| |
| // Restore SP from FP as we are coming from a throw and the code for |
| // popping arguments has not been run. |
| const intptr_t fp_sp_dist = |
| (kFirstLocalSlotFromFp + 1 - compiler->StackSize()) * kWordSize; |
| ASSERT(fp_sp_dist <= 0); |
| __ AddImmediate(SP, FP, fp_sp_dist); |
| |
| // Restore stack and initialize the two exception variables: |
| // exception and stack trace variables. |
| __ sw(kExceptionObjectReg, |
| Address(FP, exception_var().index() * kWordSize)); |
| __ sw(kStackTraceObjectReg, |
| Address(FP, stacktrace_var().index() * kWordSize)); |
| } |
| |
| |
| LocationSummary* CheckStackOverflowInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 0; |
| const intptr_t kNumTemps = 1; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, |
| kNumTemps, |
| LocationSummary::kCallOnSlowPath); |
| summary->set_temp(0, Location::RequiresRegister()); |
| return summary; |
| } |
| |
| |
| class CheckStackOverflowSlowPath : public SlowPathCode { |
| public: |
| explicit CheckStackOverflowSlowPath(CheckStackOverflowInstr* instruction) |
| : instruction_(instruction) { } |
| |
| virtual void EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("CheckStackOverflowSlowPath"); |
| __ Comment("CheckStackOverflowSlowPath"); |
| __ Bind(entry_label()); |
| compiler->SaveLiveRegisters(instruction_->locs()); |
| // pending_deoptimization_env_ is needed to generate a runtime call that |
| // may throw an exception. |
| ASSERT(compiler->pending_deoptimization_env_ == NULL); |
| Environment* env = compiler->SlowPathEnvironmentFor(instruction_); |
| compiler->pending_deoptimization_env_ = env; |
| compiler->GenerateRuntimeCall(instruction_->token_pos(), |
| instruction_->deopt_id(), |
| kStackOverflowRuntimeEntry, |
| 0, |
| instruction_->locs()); |
| |
| if (FLAG_use_osr && !compiler->is_optimizing() && instruction_->in_loop()) { |
| // In unoptimized code, record loop stack checks as possible OSR entries. |
| compiler->AddCurrentDescriptor(PcDescriptors::kOsrEntry, |
| instruction_->deopt_id(), |
| 0); // No token position. |
| } |
| compiler->pending_deoptimization_env_ = NULL; |
| compiler->RestoreLiveRegisters(instruction_->locs()); |
| __ b(exit_label()); |
| } |
| |
| private: |
| CheckStackOverflowInstr* instruction_; |
| }; |
| |
| |
| void CheckStackOverflowInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("CheckStackOverflowInstr"); |
| CheckStackOverflowSlowPath* slow_path = new CheckStackOverflowSlowPath(this); |
| compiler->AddSlowPathCode(slow_path); |
| |
| __ LoadImmediate(TMP, Isolate::Current()->stack_limit_address()); |
| |
| __ lw(CMPRES1, Address(TMP)); |
| __ BranchUnsignedLessEqual(SP, CMPRES1, slow_path->entry_label()); |
| if (compiler->CanOSRFunction() && in_loop()) { |
| Register temp = locs()->temp(0).reg(); |
| // In unoptimized code check the usage counter to trigger OSR at loop |
| // stack checks. Use progressively higher thresholds for more deeply |
| // nested loops to attempt to hit outer loops with OSR when possible. |
| __ LoadObject(temp, compiler->parsed_function().function()); |
| intptr_t threshold = |
| FLAG_optimization_counter_threshold * (loop_depth() + 1); |
| __ lw(temp, FieldAddress(temp, Function::usage_counter_offset())); |
| __ BranchSignedGreaterEqual(temp, threshold, slow_path->entry_label()); |
| } |
| __ Bind(slow_path->exit_label()); |
| } |
| |
| |
| static void EmitSmiShiftLeft(FlowGraphCompiler* compiler, |
| BinarySmiOpInstr* shift_left) { |
| const bool is_truncating = shift_left->is_truncating(); |
| const LocationSummary& locs = *shift_left->locs(); |
| Register left = locs.in(0).reg(); |
| Register result = locs.out(0).reg(); |
| Label* deopt = shift_left->CanDeoptimize() ? |
| compiler->AddDeoptStub(shift_left->deopt_id(), kDeoptBinarySmiOp) : NULL; |
| |
| __ TraceSimMsg("EmitSmiShiftLeft"); |
| |
| if (locs.in(1).IsConstant()) { |
| const Object& constant = locs.in(1).constant(); |
| ASSERT(constant.IsSmi()); |
| // Immediate shift operation takes 5 bits for the count. |
| const intptr_t kCountLimit = 0x1F; |
| const intptr_t value = Smi::Cast(constant).Value(); |
| if (value == 0) { |
| if (result != left) { |
| __ mov(result, left); |
| } |
| } else if ((value < 0) || (value >= kCountLimit)) { |
| // This condition may not be known earlier in some cases because |
| // of constant propagation, inlining, etc. |
| if ((value >= kCountLimit) && is_truncating) { |
| __ mov(result, ZR); |
| } else { |
| // Result is Mint or exception. |
| __ b(deopt); |
| } |
| } else { |
| if (!is_truncating) { |
| // Check for overflow (preserve left). |
| __ sll(TMP, left, value); |
| __ sra(CMPRES1, TMP, value); |
| __ bne(CMPRES1, left, deopt); // Overflow. |
| } |
| // Shift for result now we know there is no overflow. |
| __ sll(result, left, value); |
| } |
| return; |
| } |
| |
| // Right (locs.in(1)) is not constant. |
| Register right = locs.in(1).reg(); |
| Range* right_range = shift_left->right()->definition()->range(); |
| if (shift_left->left()->BindsToConstant() && !is_truncating) { |
| // TODO(srdjan): Implement code below for is_truncating(). |
| // If left is constant, we know the maximal allowed size for right. |
| const Object& obj = shift_left->left()->BoundConstant(); |
| if (obj.IsSmi()) { |
| const intptr_t left_int = Smi::Cast(obj).Value(); |
| if (left_int == 0) { |
| __ bltz(right, deopt); |
| __ mov(result, ZR); |
| return; |
| } |
| const intptr_t max_right = kSmiBits - Utils::HighestBit(left_int); |
| const bool right_needs_check = |
| (right_range == NULL) || |
| !right_range->IsWithin(0, max_right - 1); |
| if (right_needs_check) { |
| __ BranchUnsignedGreaterEqual( |
| right, reinterpret_cast<int32_t>(Smi::New(max_right)), deopt); |
| } |
| __ sra(TMP, right, kSmiTagMask); // SmiUntag right into TMP. |
| __ sllv(result, left, TMP); |
| } |
| return; |
| } |
| |
| const bool right_needs_check = |
| (right_range == NULL) || !right_range->IsWithin(0, (Smi::kBits - 1)); |
| if (is_truncating) { |
| if (right_needs_check) { |
| const bool right_may_be_negative = |
| (right_range == NULL) || |
| !right_range->IsWithin(0, RangeBoundary::kPlusInfinity); |
| if (right_may_be_negative) { |
| ASSERT(shift_left->CanDeoptimize()); |
| __ bltz(right, deopt); |
| } |
| Label done, is_not_zero; |
| |
| __ sltiu(CMPRES1, |
| right, Immediate(reinterpret_cast<int32_t>(Smi::New(Smi::kBits)))); |
| __ movz(result, ZR, CMPRES1); // result = right >= kBits ? 0 : result. |
| __ sra(TMP, right, kSmiTagSize); |
| __ sllv(TMP, left, TMP); |
| // result = right < kBits ? left << right : result. |
| __ movn(result, TMP, CMPRES1); |
| } else { |
| __ sra(TMP, right, kSmiTagSize); |
| __ sllv(result, left, TMP); |
| } |
| } else { |
| if (right_needs_check) { |
| ASSERT(shift_left->CanDeoptimize()); |
| __ BranchUnsignedGreaterEqual( |
| right, reinterpret_cast<int32_t>(Smi::New(Smi::kBits)), deopt); |
| } |
| // Left is not a constant. |
| Register temp = locs.temp(0).reg(); |
| // Check if count too large for handling it inlined. |
| __ sra(temp, right, kSmiTagSize); // SmiUntag right into temp. |
| // Overflow test (preserve left, right, and temp); |
| __ sllv(CMPRES1, left, temp); |
| __ srav(CMPRES1, CMPRES1, temp); |
| __ bne(CMPRES1, left, deopt); // Overflow. |
| // Shift for result now we know there is no overflow. |
| __ sllv(result, left, temp); |
| } |
| } |
| |
| |
| LocationSummary* BinarySmiOpInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = op_kind() == Token::kADD ? 1 : 0; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| if (op_kind() == Token::kTRUNCDIV) { |
| summary->set_in(0, Location::RequiresRegister()); |
| if (RightIsPowerOfTwoConstant()) { |
| ConstantInstr* right_constant = right()->definition()->AsConstant(); |
| summary->set_in(1, Location::Constant(right_constant->value())); |
| } else { |
| summary->set_in(1, Location::RequiresRegister()); |
| } |
| summary->AddTemp(Location::RequiresRegister()); |
| summary->set_out(0, Location::RequiresRegister()); |
| return summary; |
| } |
| if (op_kind() == Token::kMOD) { |
| summary->set_in(0, Location::RequiresRegister()); |
| summary->set_in(1, Location::RequiresRegister()); |
| summary->AddTemp(Location::RequiresRegister()); |
| summary->set_out(0, Location::RequiresRegister()); |
| return summary; |
| } |
| summary->set_in(0, Location::RequiresRegister()); |
| summary->set_in(1, Location::RegisterOrSmiConstant(right())); |
| if (((op_kind() == Token::kSHL) && !is_truncating()) || |
| (op_kind() == Token::kSHR)) { |
| summary->AddTemp(Location::RequiresRegister()); |
| } else if (op_kind() == Token::kADD) { |
| // Need an extra temp for the overflow detection code. |
| summary->set_temp(0, Location::RequiresRegister()); |
| } |
| // We make use of 3-operand instructions by not requiring result register |
| // to be identical to first input register as on Intel. |
| summary->set_out(0, Location::RequiresRegister()); |
| return summary; |
| } |
| |
| |
| void BinarySmiOpInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("BinarySmiOpInstr"); |
| if (op_kind() == Token::kSHL) { |
| EmitSmiShiftLeft(compiler, this); |
| return; |
| } |
| |
| ASSERT(!is_truncating()); |
| Register left = locs()->in(0).reg(); |
| Register result = locs()->out(0).reg(); |
| Label* deopt = NULL; |
| if (CanDeoptimize()) { |
| deopt = compiler->AddDeoptStub(deopt_id(), kDeoptBinarySmiOp); |
| } |
| |
| if (locs()->in(1).IsConstant()) { |
| const Object& constant = locs()->in(1).constant(); |
| ASSERT(constant.IsSmi()); |
| int32_t imm = reinterpret_cast<int32_t>(constant.raw()); |
| switch (op_kind()) { |
| case Token::kSUB: { |
| __ TraceSimMsg("kSUB imm"); |
| if (deopt == NULL) { |
| __ AddImmediate(result, left, -imm); |
| } else { |
| __ SubImmediateDetectOverflow(result, left, imm, CMPRES1); |
| __ bltz(CMPRES1, deopt); |
| } |
| break; |
| } |
| case Token::kADD: { |
| if (deopt == NULL) { |
| __ AddImmediate(result, left, imm); |
| } else { |
| Register temp = locs()->temp(0).reg(); |
| __ AddImmediateDetectOverflow(result, left, imm, CMPRES1, temp); |
| __ bltz(CMPRES1, deopt); |
| } |
| break; |
| } |
| case Token::kMUL: { |
| // Keep left value tagged and untag right value. |
| const intptr_t value = Smi::Cast(constant).Value(); |
| if (deopt == NULL) { |
| if (value == 2) { |
| __ sll(result, left, 1); |
| } else { |
| __ LoadImmediate(TMP, value); |
| __ mult(left, TMP); |
| __ mflo(result); |
| } |
| } else { |
| if (value == 2) { |
| __ sra(CMPRES2, left, 31); // CMPRES2 = sign of left. |
| __ sll(result, left, 1); |
| } else { |
| __ LoadImmediate(TMP, value); |
| __ mult(left, TMP); |
| __ mflo(result); |
| __ mfhi(CMPRES2); |
| } |
| __ sra(CMPRES1, result, 31); |
| __ bne(CMPRES1, CMPRES2, deopt); |
| } |
| break; |
| } |
| case Token::kTRUNCDIV: { |
| const intptr_t value = Smi::Cast(constant).Value(); |
| if (value == 1) { |
| if (result != left) { |
| __ mov(result, left); |
| } |
| break; |
| } else if (value == -1) { |
| // Check the corner case of dividing the 'MIN_SMI' with -1, in which |
| // case we cannot negate the result. |
| __ BranchEqual(left, 0x80000000, deopt); |
| __ subu(result, ZR, left); |
| break; |
| } |
| ASSERT(Utils::IsPowerOfTwo(Utils::Abs(value))); |
| const intptr_t shift_count = |
| Utils::ShiftForPowerOfTwo(Utils::Abs(value)) + kSmiTagSize; |
| ASSERT(kSmiTagSize == 1); |
| __ sra(TMP, left, 31); |
| ASSERT(shift_count > 1); // 1, -1 case handled above. |
| Register temp = locs()->temp(0).reg(); |
| __ srl(TMP, TMP, 32 - shift_count); |
| __ addu(temp, left, TMP); |
| ASSERT(shift_count > 0); |
| __ sra(result, temp, shift_count); |
| if (value < 0) { |
| __ subu(result, ZR, result); |
| } |
| __ SmiTag(result); |
| break; |
| } |
| case Token::kBIT_AND: { |
| // No overflow check. |
| if (Utils::IsUint(kImmBits, imm)) { |
| __ andi(result, left, Immediate(imm)); |
| } else { |
| __ LoadImmediate(TMP, imm); |
| __ and_(result, left, TMP); |
| } |
| break; |
| } |
| case Token::kBIT_OR: { |
| // No overflow check. |
| if (Utils::IsUint(kImmBits, imm)) { |
| __ ori(result, left, Immediate(imm)); |
| } else { |
| __ LoadImmediate(TMP, imm); |
| __ or_(result, left, TMP); |
| } |
| break; |
| } |
| case Token::kBIT_XOR: { |
| // No overflow check. |
| if (Utils::IsUint(kImmBits, imm)) { |
| __ xori(result, left, Immediate(imm)); |
| } else { |
| __ LoadImmediate(TMP, imm); |
| __ xor_(result, left, TMP); |
| } |
| break; |
| } |
| case Token::kSHR: { |
| // sarl operation masks the count to 5 bits. |
| const intptr_t kCountLimit = 0x1F; |
| intptr_t value = Smi::Cast(constant).Value(); |
| |
| __ TraceSimMsg("kSHR"); |
| |
| if (value == 0) { |
| // TODO(vegorov): should be handled outside. |
| if (result != left) { |
| __ mov(result, left); |
| } |
| break; |
| } else if (value < 0) { |
| // TODO(vegorov): should be handled outside. |
| __ b(deopt); |
| break; |
| } |
| |
| value = value + kSmiTagSize; |
| if (value >= kCountLimit) value = kCountLimit; |
| |
| __ sra(result, left, value); |
| __ SmiTag(result); |
| break; |
| } |
| |
| default: |
| UNREACHABLE(); |
| break; |
| } |
| return; |
| } |
| |
| Register right = locs()->in(1).reg(); |
| Range* right_range = this->right()->definition()->range(); |
| switch (op_kind()) { |
| case Token::kADD: { |
| if (deopt == NULL) { |
| __ addu(result, left, right); |
| } else { |
| Register temp = locs()->temp(0).reg(); |
| __ AdduDetectOverflow(result, left, right, CMPRES1, temp); |
| __ bltz(CMPRES1, deopt); |
| } |
| break; |
| } |
| case Token::kSUB: { |
| __ TraceSimMsg("kSUB"); |
| if (deopt == NULL) { |
| __ subu(result, left, right); |
| } else { |
| __ SubuDetectOverflow(result, left, right, CMPRES1); |
| __ bltz(CMPRES1, deopt); |
| } |
| break; |
| } |
| case Token::kMUL: { |
| __ TraceSimMsg("kMUL"); |
| __ sra(TMP, left, kSmiTagSize); |
| __ mult(TMP, right); |
| __ mflo(result); |
| if (deopt != NULL) { |
| __ mfhi(CMPRES2); |
| __ sra(CMPRES1, result, 31); |
| __ bne(CMPRES1, CMPRES2, deopt); |
| } |
| break; |
| } |
| case Token::kBIT_AND: { |
| // No overflow check. |
| __ and_(result, left, right); |
| break; |
| } |
| case Token::kBIT_OR: { |
| // No overflow check. |
| __ or_(result, left, right); |
| break; |
| } |
| case Token::kBIT_XOR: { |
| // No overflow check. |
| __ xor_(result, left, right); |
| break; |
| } |
| case Token::kTRUNCDIV: { |
| if ((right_range == NULL) || right_range->Overlaps(0, 0)) { |
| // Handle divide by zero in runtime. |
| __ beq(right, ZR, deopt); |
| } |
| Register temp = locs()->temp(0).reg(); |
| __ sra(temp, left, kSmiTagSize); // SmiUntag left into temp. |
| __ sra(TMP, right, kSmiTagSize); // SmiUntag right into TMP. |
| __ div(temp, TMP); |
| __ mflo(result); |
| // Check the corner case of dividing the 'MIN_SMI' with -1, in which |
| // case we cannot tag the result. |
| __ BranchEqual(result, 0x40000000, deopt); |
| __ SmiTag(result); |
| break; |
| } |
| case Token::kMOD: { |
| if ((right_range == NULL) || right_range->Overlaps(0, 0)) { |
| // Handle divide by zero in runtime. |
| __ beq(right, ZR, deopt); |
| } |
| Register temp = locs()->temp(0).reg(); |
| __ sra(temp, left, kSmiTagSize); // SmiUntag left into temp. |
| __ sra(TMP, right, kSmiTagSize); // SmiUntag right into TMP. |
| __ div(temp, TMP); |
| __ mfhi(result); |
| // res = left % right; |
| // if (res < 0) { |
| // if (right < 0) { |
| // res = res - right; |
| // } else { |
| // res = res + right; |
| // } |
| // } |
| Label done; |
| __ bgez(result, &done); |
| if ((right_range == NULL) || right_range->Overlaps(-1, 1)) { |
| Label subtract; |
| __ bltz(right, &subtract); |
| __ addu(result, result, TMP); |
| __ b(&done); |
| __ Bind(&subtract); |
| __ subu(result, result, TMP); |
| } else if (right_range->IsWithin(0, RangeBoundary::kPlusInfinity)) { |
| // Right is positive. |
| __ addu(result, result, TMP); |
| } else { |
| // Right is negative. |
| __ subu(result, result, TMP); |
| } |
| __ Bind(&done); |
| __ SmiTag(result); |
| break; |
| } |
| case Token::kSHR: { |
| Register temp = locs()->temp(0).reg(); |
| if (CanDeoptimize()) { |
| __ bltz(right, deopt); |
| } |
| __ sra(temp, right, kSmiTagSize); // SmiUntag right into temp. |
| // sra operation masks the count to 5 bits. |
| const intptr_t kCountLimit = 0x1F; |
| if ((right_range == NULL) || |
| !right_range->IsWithin(RangeBoundary::kMinusInfinity, kCountLimit)) { |
| Label ok; |
| __ BranchSignedLessEqual(temp, kCountLimit, &ok); |
| __ LoadImmediate(temp, kCountLimit); |
| __ Bind(&ok); |
| } |
| |
| __ sra(CMPRES1, left, kSmiTagSize); // SmiUntag left into CMPRES1. |
| __ srav(result, CMPRES1, temp); |
| __ SmiTag(result); |
| break; |
| } |
| case Token::kDIV: { |
| // Dispatches to 'Double./'. |
| // TODO(srdjan): Implement as conversion to double and double division. |
| UNREACHABLE(); |
| break; |
| } |
| case Token::kOR: |
| case Token::kAND: { |
| // Flow graph builder has dissected this operation to guarantee correct |
| // behavior (short-circuit evaluation). |
| UNREACHABLE(); |
| break; |
| } |
| default: |
| UNREACHABLE(); |
| break; |
| } |
| } |
| |
| |
| LocationSummary* CheckEitherNonSmiInstr::MakeLocationSummary(bool opt) const { |
| intptr_t left_cid = left()->Type()->ToCid(); |
| intptr_t right_cid = right()->Type()->ToCid(); |
| ASSERT((left_cid != kDoubleCid) && (right_cid != kDoubleCid)); |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RequiresRegister()); |
| summary->set_in(1, Location::RequiresRegister()); |
| return summary; |
| } |
| |
| |
| void CheckEitherNonSmiInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Label* deopt = compiler->AddDeoptStub(deopt_id(), kDeoptBinaryDoubleOp); |
| intptr_t left_cid = left()->Type()->ToCid(); |
| intptr_t right_cid = right()->Type()->ToCid(); |
| Register left = locs()->in(0).reg(); |
| Register right = locs()->in(1).reg(); |
| if (left_cid == kSmiCid) { |
| __ andi(CMPRES1, right, Immediate(kSmiTagMask)); |
| } else if (right_cid == kSmiCid) { |
| __ andi(CMPRES1, left, Immediate(kSmiTagMask)); |
| } else { |
| __ or_(TMP, left, right); |
| __ andi(CMPRES1, TMP, Immediate(kSmiTagMask)); |
| } |
| __ beq(CMPRES1, ZR, deopt); |
| } |
| |
| |
| LocationSummary* BoxDoubleInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 1; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, |
| kNumTemps, |
| LocationSummary::kCallOnSlowPath); |
| summary->set_in(0, Location::RequiresFpuRegister()); |
| summary->set_temp(0, Location::RequiresRegister()); |
| summary->set_out(0, Location::RequiresRegister()); |
| return summary; |
| } |
| |
| |
| void BoxDoubleInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| BoxDoubleSlowPath* slow_path = new BoxDoubleSlowPath(this); |
| compiler->AddSlowPathCode(slow_path); |
| |
| Register out_reg = locs()->out(0).reg(); |
| DRegister value = locs()->in(0).fpu_reg(); |
| |
| __ TryAllocate(compiler->double_class(), |
| slow_path->entry_label(), |
| out_reg, |
| locs()->temp(0).reg()); |
| __ Bind(slow_path->exit_label()); |
| __ StoreDToOffset(value, out_reg, Double::value_offset() - kHeapObjectTag); |
| } |
| |
| |
| LocationSummary* UnboxDoubleInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t value_cid = value()->Type()->ToCid(); |
| const bool needs_writable_input = (value_cid == kSmiCid); |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, needs_writable_input |
| ? Location::WritableRegister() |
| : Location::RequiresRegister()); |
| summary->set_out(0, Location::RequiresFpuRegister()); |
| return summary; |
| } |
| |
| |
| void UnboxDoubleInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| const intptr_t value_cid = value()->Type()->ToCid(); |
| const Register value = locs()->in(0).reg(); |
| const DRegister result = locs()->out(0).fpu_reg(); |
| |
| if (value_cid == kDoubleCid) { |
| __ LoadDFromOffset(result, value, Double::value_offset() - kHeapObjectTag); |
| } else if (value_cid == kSmiCid) { |
| __ SmiUntag(value); // Untag input before conversion. |
| __ mtc1(value, STMP1); |
| __ cvtdw(result, STMP1); |
| } else { |
| Label* deopt = compiler->AddDeoptStub(deopt_id_, kDeoptBinaryDoubleOp); |
| Label is_smi, done; |
| |
| __ andi(CMPRES1, value, Immediate(kSmiTagMask)); |
| __ beq(CMPRES1, ZR, &is_smi); |
| __ LoadClassId(CMPRES1, value); |
| __ BranchNotEqual(CMPRES1, kDoubleCid, deopt); |
| __ LoadDFromOffset(result, value, Double::value_offset() - kHeapObjectTag); |
| __ b(&done); |
| __ Bind(&is_smi); |
| // TODO(regis): Why do we preserve value here but not above? |
| __ sra(TMP, value, 1); |
| __ mtc1(TMP, STMP1); |
| __ cvtdw(result, STMP1); |
| __ Bind(&done); |
| } |
| } |
| |
| |
| LocationSummary* BoxFloat32x4Instr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void BoxFloat32x4Instr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* UnboxFloat32x4Instr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void UnboxFloat32x4Instr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* BoxFloat64x2Instr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void BoxFloat64x2Instr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* UnboxFloat64x2Instr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void UnboxFloat64x2Instr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* BoxInt32x4Instr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void BoxInt32x4Instr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* UnboxInt32x4Instr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void UnboxInt32x4Instr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* BinaryDoubleOpInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RequiresFpuRegister()); |
| summary->set_in(1, Location::RequiresFpuRegister()); |
| summary->set_out(0, Location::RequiresFpuRegister()); |
| return summary; |
| } |
| |
| |
| void BinaryDoubleOpInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| DRegister left = locs()->in(0).fpu_reg(); |
| DRegister right = locs()->in(1).fpu_reg(); |
| DRegister result = locs()->out(0).fpu_reg(); |
| switch (op_kind()) { |
| case Token::kADD: __ addd(result, left, right); break; |
| case Token::kSUB: __ subd(result, left, right); break; |
| case Token::kMUL: __ muld(result, left, right); break; |
| case Token::kDIV: __ divd(result, left, right); break; |
| default: UNREACHABLE(); |
| } |
| } |
| |
| |
| LocationSummary* BinaryFloat32x4OpInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void BinaryFloat32x4OpInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* BinaryFloat64x2OpInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void BinaryFloat64x2OpInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Simd32x4ShuffleInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Simd32x4ShuffleInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| |
| LocationSummary* Simd32x4ShuffleMixInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Simd32x4ShuffleMixInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float32x4ConstructorInstr::MakeLocationSummary( |
| bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float32x4ConstructorInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float32x4ZeroInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float32x4ZeroInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float32x4SplatInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float32x4SplatInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float32x4ComparisonInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float32x4ComparisonInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float32x4MinMaxInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float32x4MinMaxInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float32x4SqrtInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float32x4SqrtInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float32x4ScaleInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float32x4ScaleInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float32x4ZeroArgInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float32x4ZeroArgInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float32x4ClampInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float32x4ClampInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float32x4WithInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float32x4WithInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float32x4ToInt32x4Instr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float32x4ToInt32x4Instr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Simd64x2ShuffleInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Simd64x2ShuffleInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float64x2ZeroInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float64x2ZeroInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float64x2SplatInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float64x2SplatInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float64x2ConstructorInstr::MakeLocationSummary( |
| bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float64x2ConstructorInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float64x2ToFloat32x4Instr::MakeLocationSummary( |
| bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float64x2ToFloat32x4Instr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float32x4ToFloat64x2Instr::MakeLocationSummary( |
| bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float32x4ToFloat64x2Instr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float64x2ZeroArgInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float64x2ZeroArgInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Float64x2OneArgInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Float64x2OneArgInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Int32x4BoolConstructorInstr::MakeLocationSummary( |
| bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Int32x4BoolConstructorInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Int32x4GetFlagInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Int32x4GetFlagInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Simd32x4GetSignMaskInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Simd32x4GetSignMaskInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Int32x4SelectInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Int32x4SelectInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Int32x4SetFlagInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Int32x4SetFlagInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* Int32x4ToFloat32x4Instr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void Int32x4ToFloat32x4Instr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* BinaryInt32x4OpInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void BinaryInt32x4OpInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* MathUnaryInstr::MakeLocationSummary(bool opt) const { |
| if ((kind() == MethodRecognizer::kMathSin) || |
| (kind() == MethodRecognizer::kMathCos)) { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kCall); |
| summary->set_in(0, Location::FpuRegisterLocation(D6)); |
| summary->set_out(0, Location::FpuRegisterLocation(D0)); |
| return summary; |
| } |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RequiresFpuRegister()); |
| summary->set_out(0, Location::RequiresFpuRegister()); |
| return summary; |
| } |
| |
| |
| void MathUnaryInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| if (kind() == MethodRecognizer::kMathSqrt) { |
| __ sqrtd(locs()->out(0).fpu_reg(), locs()->in(0).fpu_reg()); |
| } else { |
| __ CallRuntime(TargetFunction(), InputCount()); |
| } |
| } |
| |
| |
| LocationSummary* MathMinMaxInstr::MakeLocationSummary(bool opt) const { |
| if (result_cid() == kDoubleCid) { |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = 1; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RequiresFpuRegister()); |
| summary->set_in(1, Location::RequiresFpuRegister()); |
| // Reuse the left register so that code can be made shorter. |
| summary->set_out(0, Location::SameAsFirstInput()); |
| summary->set_temp(0, Location::RequiresRegister()); |
| return summary; |
| } |
| ASSERT(result_cid() == kSmiCid); |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RequiresRegister()); |
| summary->set_in(1, Location::RequiresRegister()); |
| // Reuse the left register so that code can be made shorter. |
| summary->set_out(0, Location::SameAsFirstInput()); |
| return summary; |
| } |
| |
| |
| void MathMinMaxInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| ASSERT((op_kind() == MethodRecognizer::kMathMin) || |
| (op_kind() == MethodRecognizer::kMathMax)); |
| const intptr_t is_min = (op_kind() == MethodRecognizer::kMathMin); |
| if (result_cid() == kDoubleCid) { |
| Label done, returns_nan, are_equal; |
| DRegister left = locs()->in(0).fpu_reg(); |
| DRegister right = locs()->in(1).fpu_reg(); |
| DRegister result = locs()->out(0).fpu_reg(); |
| Register temp = locs()->temp(0).reg(); |
| __ cund(left, right); |
| __ bc1t(&returns_nan); |
| __ ceqd(left, right); |
| __ bc1t(&are_equal); |
| if (is_min) { |
| __ coltd(left, right); |
| } else { |
| __ coltd(right, left); |
| } |
| // TODO(zra): Add conditional moves. |
| ASSERT(left == result); |
| __ bc1t(&done); |
| __ movd(result, right); |
| __ b(&done); |
| |
| __ Bind(&returns_nan); |
| __ LoadImmediate(result, NAN); |
| __ b(&done); |
| |
| __ Bind(&are_equal); |
| Label left_is_negative; |
| // Check for negative zero: -0.0 is equal 0.0 but min or max must return |
| // -0.0 or 0.0 respectively. |
| // Check for negative left value (get the sign bit): |
| // - min -> left is negative ? left : right. |
| // - max -> left is negative ? right : left |
| // Check the sign bit. |
| __ mfc1(temp, OddFRegisterOf(left)); // Moves bits 32...63 of left to temp. |
| if (is_min) { |
| ASSERT(left == result); |
| __ bltz(temp, &done); // Left is negative. |
| } else { |
| __ bgez(temp, &done); // Left is positive. |
| } |
| __ movd(result, right); |
| __ Bind(&done); |
| return; |
| } |
| |
| Label done; |
| ASSERT(result_cid() == kSmiCid); |
| Register left = locs()->in(0).reg(); |
| Register right = locs()->in(1).reg(); |
| Register result = locs()->out(0).reg(); |
| ASSERT(result == left); |
| if (is_min) { |
| __ BranchSignedLessEqual(left, right, &done); |
| } else { |
| __ BranchSignedGreaterEqual(left, right, &done); |
| } |
| __ mov(result, right); |
| __ Bind(&done); |
| } |
| |
| |
| LocationSummary* UnarySmiOpInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RequiresRegister()); |
| // We make use of 3-operand instructions by not requiring result register |
| // to be identical to first input register as on Intel. |
| summary->set_out(0, Location::RequiresRegister()); |
| return summary; |
| } |
| |
| |
| void UnarySmiOpInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Register value = locs()->in(0).reg(); |
| Register result = locs()->out(0).reg(); |
| switch (op_kind()) { |
| case Token::kNEGATE: { |
| Label* deopt = compiler->AddDeoptStub(deopt_id(), |
| kDeoptUnaryOp); |
| __ SubuDetectOverflow(result, ZR, value, CMPRES1); |
| __ bltz(CMPRES1, deopt); |
| break; |
| } |
| case Token::kBIT_NOT: |
| __ nor(result, value, ZR); |
| __ addiu(result, result, Immediate(-1)); // Remove inverted smi-tag. |
| break; |
| default: |
| UNREACHABLE(); |
| } |
| } |
| |
| |
| LocationSummary* UnaryDoubleOpInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 1; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RequiresFpuRegister()); |
| summary->set_out(0, Location::RequiresFpuRegister()); |
| summary->set_temp(0, Location::RequiresFpuRegister()); |
| return summary; |
| } |
| |
| |
| void UnaryDoubleOpInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| // TODO(zra): Implement vneg. |
| const Double& minus_one = Double::ZoneHandle(Double::NewCanonical(-1)); |
| __ LoadObject(TMP, minus_one); |
| FpuRegister result = locs()->out(0).fpu_reg(); |
| FpuRegister value = locs()->in(0).fpu_reg(); |
| FpuRegister temp_fp = locs()->temp(0).fpu_reg(); |
| __ LoadDFromOffset(temp_fp, TMP, Double::value_offset() - kHeapObjectTag); |
| __ muld(result, value, temp_fp); |
| } |
| |
| |
| |
| LocationSummary* SmiToDoubleInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* result = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| result->set_in(0, Location::WritableRegister()); |
| result->set_out(0, Location::RequiresFpuRegister()); |
| return result; |
| } |
| |
| |
| void SmiToDoubleInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Register value = locs()->in(0).reg(); |
| FpuRegister result = locs()->out(0).fpu_reg(); |
| __ SmiUntag(value); |
| __ mtc1(value, STMP1); |
| __ cvtdw(result, STMP1); |
| } |
| |
| |
| LocationSummary* DoubleToIntegerInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* result = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kCall); |
| result->set_in(0, Location::RegisterLocation(T1)); |
| result->set_out(0, Location::RegisterLocation(V0)); |
| return result; |
| } |
| |
| |
| void DoubleToIntegerInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Register result = locs()->out(0).reg(); |
| Register value_obj = locs()->in(0).reg(); |
| ASSERT(result == V0); |
| ASSERT(result != value_obj); |
| __ LoadDFromOffset(DTMP, value_obj, Double::value_offset() - kHeapObjectTag); |
| __ cvtwd(STMP1, DTMP); |
| __ mfc1(result, STMP1); |
| |
| // Overflow is signaled with minint. |
| Label do_call, done; |
| // Check for overflow and that it fits into Smi. |
| __ LoadImmediate(TMP, 0xC0000000); |
| __ subu(CMPRES1, result, TMP); |
| __ bltz(CMPRES1, &do_call); |
| __ SmiTag(result); |
| __ b(&done); |
| __ Bind(&do_call); |
| __ Push(value_obj); |
| ASSERT(instance_call()->HasICData()); |
| const ICData& ic_data = *instance_call()->ic_data(); |
| ASSERT((ic_data.NumberOfChecks() == 1)); |
| const Function& target = Function::ZoneHandle(ic_data.GetTargetAt(0)); |
| |
| const intptr_t kNumberOfArguments = 1; |
| compiler->GenerateStaticCall(deopt_id(), |
| instance_call()->token_pos(), |
| target, |
| kNumberOfArguments, |
| Object::null_array(), // No argument names., |
| locs()); |
| __ Bind(&done); |
| } |
| |
| |
| LocationSummary* DoubleToSmiInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* result = new LocationSummary( |
| kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| result->set_in(0, Location::RequiresFpuRegister()); |
| result->set_out(0, Location::RequiresRegister()); |
| return result; |
| } |
| |
| |
| void DoubleToSmiInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Label* deopt = compiler->AddDeoptStub(deopt_id(), kDeoptDoubleToSmi); |
| Register result = locs()->out(0).reg(); |
| DRegister value = locs()->in(0).fpu_reg(); |
| __ cvtwd(STMP1, value); |
| __ mfc1(result, STMP1); |
| |
| // Check for overflow and that it fits into Smi. |
| __ LoadImmediate(TMP, 0xC0000000); |
| __ subu(CMPRES1, result, TMP); |
| __ bltz(CMPRES1, deopt); |
| __ SmiTag(result); |
| } |
| |
| |
| LocationSummary* DoubleToDoubleInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void DoubleToDoubleInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* DoubleToFloatInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* result = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| result->set_in(0, Location::RequiresFpuRegister()); |
| result->set_out(0, Location::SameAsFirstInput()); |
| return result; |
| } |
| |
| |
| void DoubleToFloatInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| DRegister value = locs()->in(0).fpu_reg(); |
| FRegister result = EvenFRegisterOf(locs()->out(0).fpu_reg()); |
| __ cvtsd(result, value); |
| } |
| |
| |
| LocationSummary* FloatToDoubleInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* result = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| result->set_in(0, Location::RequiresFpuRegister()); |
| result->set_out(0, Location::SameAsFirstInput()); |
| return result; |
| } |
| |
| |
| void FloatToDoubleInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| FRegister value = EvenFRegisterOf(locs()->in(0).fpu_reg()); |
| DRegister result = locs()->out(0).fpu_reg(); |
| __ cvtds(result, value); |
| } |
| |
| |
| LocationSummary* InvokeMathCFunctionInstr::MakeLocationSummary(bool opt) const { |
| // Calling convention on MIPS uses D6 and D7 to pass the first two |
| // double arguments. |
| ASSERT((InputCount() == 1) || (InputCount() == 2)); |
| const intptr_t kNumTemps = 0; |
| LocationSummary* result = |
| new LocationSummary(InputCount(), kNumTemps, LocationSummary::kCall); |
| result->set_in(0, Location::FpuRegisterLocation(D6)); |
| if (InputCount() == 2) { |
| result->set_in(1, Location::FpuRegisterLocation(D7)); |
| } |
| result->set_out(0, Location::FpuRegisterLocation(D0)); |
| return result; |
| } |
| |
| |
| void InvokeMathCFunctionInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| // For pow-function return NaN if exponent is NaN. |
| Label do_call, skip_call; |
| if (recognized_kind() == MethodRecognizer::kMathDoublePow) { |
| // Pseudo code: |
| // if (exponent == 0.0) return 0.0; |
| // if (base == 1.0) return 1.0; |
| // if (base.isNaN || exponent.isNaN) { |
| // return double.NAN; |
| // } |
| DRegister base = locs()->in(0).fpu_reg(); |
| DRegister exp = locs()->in(1).fpu_reg(); |
| DRegister result = locs()->out(0).fpu_reg(); |
| |
| Label check_base_is_one; |
| |
| // Check if exponent is 0.0 -> return 1.0; |
| __ LoadObject(TMP, Double::ZoneHandle(Double::NewCanonical(0))); |
| __ LoadDFromOffset(DTMP, TMP, Double::value_offset() - kHeapObjectTag); |
| __ LoadObject(TMP, Double::ZoneHandle(Double::NewCanonical(1))); |
| __ LoadDFromOffset(result, TMP, Double::value_offset() - kHeapObjectTag); |
| // 'result' contains 1.0. |
| __ cund(exp, exp); |
| __ bc1t(&check_base_is_one); // NaN -> not zero. |
| __ ceqd(exp, DTMP); |
| __ bc1t(&skip_call); // exp is 0.0, result is 1.0. |
| |
| Label base_is_nan; |
| __ Bind(&check_base_is_one); |
| __ cund(base, base); |
| __ bc1t(&base_is_nan); |
| __ ceqd(base, result); |
| __ bc1t(&skip_call); // base and result are 1.0. |
| __ b(&do_call); |
| |
| __ Bind(&base_is_nan); |
| __ movd(result, base); // base is NaN, return NaN. |
| __ b(&skip_call); |
| } |
| __ Bind(&do_call); |
| // double values are passed and returned in vfp registers. |
| __ CallRuntime(TargetFunction(), InputCount()); |
| __ Bind(&skip_call); |
| } |
| |
| |
| LocationSummary* MergedMathInstr::MakeLocationSummary(bool opt) const { |
| if (kind() == MergedMathInstr::kTruncDivMod) { |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = 3; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RequiresRegister()); |
| summary->set_in(1, Location::RequiresRegister()); |
| summary->set_temp(0, Location::RequiresRegister()); |
| summary->set_temp(1, Location::RequiresRegister()); // result_div. |
| summary->set_temp(2, Location::RequiresRegister()); // result_mod. |
| summary->set_out(0, Location::RequiresRegister()); |
| return summary; |
| } |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void MergedMathInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Label* deopt = NULL; |
| if (CanDeoptimize()) { |
| deopt = compiler->AddDeoptStub(deopt_id(), kDeoptBinarySmiOp); |
| } |
| if (kind() == MergedMathInstr::kTruncDivMod) { |
| Register left = locs()->in(0).reg(); |
| Register right = locs()->in(1).reg(); |
| Register result = locs()->out(0).reg(); |
| Register temp = locs()->temp(0).reg(); |
| Register result_div = locs()->temp(1).reg(); |
| Register result_mod = locs()->temp(2).reg(); |
| Range* right_range = InputAt(1)->definition()->range(); |
| if ((right_range == NULL) || right_range->Overlaps(0, 0)) { |
| // Handle divide by zero in runtime. |
| __ beq(right, ZR, deopt); |
| } |
| __ sra(temp, left, kSmiTagSize); // SmiUntag left into temp. |
| __ sra(TMP, right, kSmiTagSize); // SmiUntag right into TMP. |
| __ div(temp, TMP); |
| __ mflo(result_div); |
| __ mfhi(result_mod); |
| // Check the corner case of dividing the 'MIN_SMI' with -1, in which |
| // case we cannot tag the result. |
| __ BranchEqual(result_div, 0x40000000, deopt); |
| // res = left % right; |
| // if (res < 0) { |
| // if (right < 0) { |
| // res = res - right; |
| // } else { |
| // res = res + right; |
| // } |
| // } |
| Label done; |
| __ bgez(result_mod, &done); |
| if ((right_range == NULL) || right_range->Overlaps(-1, 1)) { |
| Label subtract; |
| __ bltz(right, &subtract); |
| __ addu(result_mod, result_mod, TMP); |
| __ b(&done); |
| __ Bind(&subtract); |
| __ subu(result_mod, result_mod, TMP); |
| } else if (right_range->IsWithin(0, RangeBoundary::kPlusInfinity)) { |
| // Right is positive. |
| __ addu(result_mod, result_mod, TMP); |
| } else { |
| // Right is negative. |
| __ subu(result_mod, result_mod, TMP); |
| } |
| __ Bind(&done); |
| |
| __ SmiTag(result_div); |
| __ SmiTag(result_mod); |
| __ LoadObject(result, Array::ZoneHandle(Array::New(2, Heap::kOld))); |
| // Note that index is expected smi-tagged, (i.e, times 2) for all arrays. |
| // [0]: divide resut, [1]: mod result. |
| __ LoadImmediate(temp, |
| FlowGraphCompiler::DataOffsetFor(kArrayCid) - kHeapObjectTag); |
| __ addu(temp, result, temp); |
| Address div_result_address(temp, 0); |
| Address mod_result_address(temp, kWordSize); |
| __ StoreIntoObjectNoBarrier(result, div_result_address, result_div); |
| __ StoreIntoObjectNoBarrier(result, mod_result_address, result_mod); |
| return; |
| } |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* PolymorphicInstanceCallInstr::MakeLocationSummary( |
| bool opt) const { |
| return MakeCallSummary(); |
| } |
| |
| |
| void PolymorphicInstanceCallInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Label* deopt = compiler->AddDeoptStub(deopt_id(), |
| kDeoptPolymorphicInstanceCallTestFail); |
| __ TraceSimMsg("PolymorphicInstanceCallInstr"); |
| if (ic_data().NumberOfChecks() == 0) { |
| __ b(deopt); |
| return; |
| } |
| ASSERT(ic_data().num_args_tested() == 1); |
| if (!with_checks()) { |
| ASSERT(ic_data().HasOneTarget()); |
| const Function& target = Function::ZoneHandle(ic_data().GetTargetAt(0)); |
| compiler->GenerateStaticCall(deopt_id(), |
| instance_call()->token_pos(), |
| target, |
| instance_call()->ArgumentCount(), |
| instance_call()->argument_names(), |
| locs()); |
| return; |
| } |
| |
| // Load receiver into T0. |
| __ lw(T0, Address(SP, (instance_call()->ArgumentCount() - 1) * kWordSize)); |
| |
| LoadValueCid(compiler, T2, T0, |
| (ic_data().GetReceiverClassIdAt(0) == kSmiCid) ? NULL : deopt); |
| |
| compiler->EmitTestAndCall(ic_data(), |
| T2, // Class id register. |
| instance_call()->ArgumentCount(), |
| instance_call()->argument_names(), |
| deopt, |
| deopt_id(), |
| instance_call()->token_pos(), |
| locs()); |
| } |
| |
| |
| LocationSummary* BranchInstr::MakeLocationSummary(bool opt) const { |
| comparison()->InitializeLocationSummary(opt); |
| // Branches don't produce a result. |
| comparison()->locs()->set_out(0, Location::NoLocation()); |
| return comparison()->locs(); |
| } |
| |
| |
| void BranchInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("BranchInstr"); |
| comparison()->EmitBranchCode(compiler, this); |
| } |
| |
| |
| LocationSummary* CheckClassInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RequiresRegister()); |
| if (!IsNullCheck()) { |
| summary->AddTemp(Location::RequiresRegister()); |
| } |
| return summary; |
| } |
| |
| |
| void CheckClassInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| const DeoptReasonId deopt_reason = |
| licm_hoisted_ ? kDeoptHoistedCheckClass : kDeoptCheckClass; |
| if (IsNullCheck()) { |
| Label* deopt = compiler->AddDeoptStub(deopt_id(), deopt_reason); |
| __ BranchEqual(locs()->in(0).reg(), |
| reinterpret_cast<int32_t>(Object::null()), deopt); |
| return; |
| } |
| |
| ASSERT((unary_checks().GetReceiverClassIdAt(0) != kSmiCid) || |
| (unary_checks().NumberOfChecks() > 1)); |
| Register value = locs()->in(0).reg(); |
| Register temp = locs()->temp(0).reg(); |
| Label* deopt = compiler->AddDeoptStub(deopt_id(), deopt_reason); |
| Label is_ok; |
| intptr_t cix = 0; |
| if (unary_checks().GetReceiverClassIdAt(cix) == kSmiCid) { |
| __ andi(CMPRES1, value, Immediate(kSmiTagMask)); |
| __ beq(CMPRES1, ZR, &is_ok); |
| cix++; // Skip first check. |
| } else { |
| __ andi(CMPRES1, value, Immediate(kSmiTagMask)); |
| __ beq(CMPRES1, ZR, deopt); |
| } |
| __ LoadClassId(temp, value); |
| const intptr_t num_checks = unary_checks().NumberOfChecks(); |
| for (intptr_t i = cix; i < num_checks; i++) { |
| ASSERT(unary_checks().GetReceiverClassIdAt(i) != kSmiCid); |
| __ LoadImmediate(TMP, unary_checks().GetReceiverClassIdAt(i)); |
| __ subu(CMPRES1, temp, TMP); |
| if (i == (num_checks - 1)) { |
| __ bne(CMPRES1, ZR, deopt); |
| } else { |
| __ beq(CMPRES1, ZR, &is_ok); |
| } |
| } |
| __ Bind(&is_ok); |
| } |
| |
| |
| LocationSummary* CheckSmiInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 1; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* summary = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| summary->set_in(0, Location::RequiresRegister()); |
| return summary; |
| } |
| |
| |
| void CheckSmiInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("CheckSmiInstr"); |
| Register value = locs()->in(0).reg(); |
| Label* deopt = compiler->AddDeoptStub(deopt_id(), |
| kDeoptCheckSmi); |
| __ andi(CMPRES1, value, Immediate(kSmiTagMask)); |
| __ bne(CMPRES1, ZR, deopt); |
| } |
| |
| |
| LocationSummary* CheckArrayBoundInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = 0; |
| LocationSummary* locs = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(kLengthPos, Location::RegisterOrSmiConstant(length())); |
| locs->set_in(kIndexPos, Location::RegisterOrSmiConstant(index())); |
| return locs; |
| } |
| |
| |
| void CheckArrayBoundInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Label* deopt = compiler->AddDeoptStub(deopt_id(), kDeoptCheckArrayBound); |
| |
| Location length_loc = locs()->in(kLengthPos); |
| Location index_loc = locs()->in(kIndexPos); |
| |
| if (length_loc.IsConstant() && index_loc.IsConstant()) { |
| // TODO(srdjan): remove this code once failures are fixed. |
| if ((Smi::Cast(length_loc.constant()).Value() > |
| Smi::Cast(index_loc.constant()).Value()) && |
| (Smi::Cast(index_loc.constant()).Value() >= 0)) { |
| // This CheckArrayBoundInstr should have been eliminated. |
| return; |
| } |
| ASSERT((Smi::Cast(length_loc.constant()).Value() <= |
| Smi::Cast(index_loc.constant()).Value()) || |
| (Smi::Cast(index_loc.constant()).Value() < 0)); |
| // Unconditionally deoptimize for constant bounds checks because they |
| // only occur only when index is out-of-bounds. |
| __ b(deopt); |
| return; |
| } |
| |
| if (index_loc.IsConstant()) { |
| Register length = length_loc.reg(); |
| const Smi& index = Smi::Cast(index_loc.constant()); |
| __ BranchUnsignedLessEqual( |
| length, reinterpret_cast<int32_t>(index.raw()), deopt); |
| } else if (length_loc.IsConstant()) { |
| const Smi& length = Smi::Cast(length_loc.constant()); |
| Register index = index_loc.reg(); |
| __ BranchUnsignedGreaterEqual( |
| index, reinterpret_cast<int32_t>(length.raw()), deopt); |
| } else { |
| Register length = length_loc.reg(); |
| Register index = index_loc.reg(); |
| __ BranchUnsignedGreaterEqual(index, length, deopt); |
| } |
| } |
| |
| |
| LocationSummary* UnboxIntegerInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void UnboxIntegerInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* BoxIntegerInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void BoxIntegerInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* BinaryMintOpInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void BinaryMintOpInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* ShiftMintOpInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void ShiftMintOpInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* UnaryMintOpInstr::MakeLocationSummary(bool opt) const { |
| UNIMPLEMENTED(); |
| return NULL; |
| } |
| |
| |
| void UnaryMintOpInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| LocationSummary* ThrowInstr::MakeLocationSummary(bool opt) const { |
| return new LocationSummary(0, 0, LocationSummary::kCall); |
| } |
| |
| |
| |
| void ThrowInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| compiler->GenerateRuntimeCall(token_pos(), |
| deopt_id(), |
| kThrowRuntimeEntry, |
| 1, |
| locs()); |
| __ break_(0); |
| } |
| |
| |
| LocationSummary* ReThrowInstr::MakeLocationSummary(bool opt) const { |
| return new LocationSummary(0, 0, LocationSummary::kCall); |
| } |
| |
| |
| void ReThrowInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| compiler->SetNeedsStacktrace(catch_try_index()); |
| compiler->GenerateRuntimeCall(token_pos(), |
| deopt_id(), |
| kReThrowRuntimeEntry, |
| 2, |
| locs()); |
| __ break_(0); |
| } |
| |
| |
| void GraphEntryInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| if (!compiler->CanFallThroughTo(normal_entry())) { |
| __ b(compiler->GetJumpLabel(normal_entry())); |
| } |
| } |
| |
| |
| void TargetEntryInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ Bind(compiler->GetJumpLabel(this)); |
| if (!compiler->is_optimizing()) { |
| compiler->EmitEdgeCounter(); |
| // On MIPS the deoptimization descriptor points after the edge counter |
| // code so that we can reuse the same pattern matching code as at call |
| // sites, which matches backwards from the end of the pattern. |
| compiler->AddCurrentDescriptor(PcDescriptors::kDeopt, |
| deopt_id_, |
| Scanner::kNoSourcePos); |
| } |
| if (HasParallelMove()) { |
| compiler->parallel_move_resolver()->EmitNativeCode(parallel_move()); |
| } |
| } |
| |
| |
| LocationSummary* GotoInstr::MakeLocationSummary(bool opt) const { |
| return new LocationSummary(0, 0, LocationSummary::kNoCall); |
| } |
| |
| |
| void GotoInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("GotoInstr"); |
| if (!compiler->is_optimizing()) { |
| compiler->EmitEdgeCounter(); |
| // Add a deoptimization descriptor for deoptimizing instructions that |
| // may be inserted before this instruction. On MIPS this descriptor |
| // points after the edge counter code so that we can reuse the same |
| // pattern matching code as at call sites, which matches backwards from |
| // the end of the pattern. |
| compiler->AddCurrentDescriptor(PcDescriptors::kDeopt, |
| GetDeoptId(), |
| Scanner::kNoSourcePos); |
| } |
| if (HasParallelMove()) { |
| compiler->parallel_move_resolver()->EmitNativeCode(parallel_move()); |
| } |
| |
| // We can fall through if the successor is the next block in the list. |
| // Otherwise, we need a jump. |
| if (!compiler->CanFallThroughTo(successor())) { |
| __ b(compiler->GetJumpLabel(successor())); |
| } |
| } |
| |
| |
| LocationSummary* CurrentContextInstr::MakeLocationSummary(bool opt) const { |
| return LocationSummary::Make(0, |
| Location::RequiresRegister(), |
| LocationSummary::kNoCall); |
| } |
| |
| |
| void CurrentContextInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ mov(locs()->out(0).reg(), CTX); |
| } |
| |
| |
| LocationSummary* StrictCompareInstr::MakeLocationSummary(bool opt) const { |
| const intptr_t kNumInputs = 2; |
| const intptr_t kNumTemps = 0; |
| if (needs_number_check()) { |
| LocationSummary* locs = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kCall); |
| locs->set_in(0, Location::RegisterLocation(A0)); |
| locs->set_in(1, Location::RegisterLocation(A1)); |
| locs->set_out(0, Location::RegisterLocation(A0)); |
| return locs; |
| } |
| LocationSummary* locs = |
| new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall); |
| locs->set_in(0, Location::RegisterOrConstant(left())); |
| // Only one of the inputs can be a constant. Choose register if the first one |
| // is a constant. |
| locs->set_in(1, locs->in(0).IsConstant() |
| ? Location::RequiresRegister() |
| : Location::RegisterOrConstant(right())); |
| locs->set_out(0, Location::RequiresRegister()); |
| return locs; |
| } |
| |
| |
| Condition StrictCompareInstr::EmitComparisonCode(FlowGraphCompiler* compiler, |
| BranchLabels labels) { |
| Location left = locs()->in(0); |
| Location right = locs()->in(1); |
| ASSERT(!left.IsConstant() || !right.IsConstant()); |
| if (left.IsConstant()) { |
| compiler->EmitEqualityRegConstCompare(right.reg(), |
| left.constant(), |
| needs_number_check(), |
| token_pos()); |
| } else if (right.IsConstant()) { |
| compiler->EmitEqualityRegConstCompare(left.reg(), |
| right.constant(), |
| needs_number_check(), |
| token_pos()); |
| } else { |
| compiler->EmitEqualityRegRegCompare(left.reg(), |
| right.reg(), |
| needs_number_check(), |
| token_pos()); |
| } |
| Condition true_condition = (kind() == Token::kEQ_STRICT) ? EQ : NE; |
| return true_condition; |
| } |
| |
| |
| void StrictCompareInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("StrictCompareInstr"); |
| __ Comment("StrictCompareInstr"); |
| ASSERT(kind() == Token::kEQ_STRICT || kind() == Token::kNE_STRICT); |
| |
| Label is_true, is_false; |
| BranchLabels labels = { &is_true, &is_false, &is_false }; |
| Condition true_condition = EmitComparisonCode(compiler, labels); |
| EmitBranchOnCondition(compiler, true_condition, labels); |
| |
| Register result = locs()->out(0).reg(); |
| Label done; |
| __ Bind(&is_false); |
| __ LoadObject(result, Bool::False()); |
| __ b(&done); |
| __ Bind(&is_true); |
| __ LoadObject(result, Bool::True()); |
| __ Bind(&done); |
| } |
| |
| |
| void StrictCompareInstr::EmitBranchCode(FlowGraphCompiler* compiler, |
| BranchInstr* branch) { |
| __ TraceSimMsg("StrictCompareInstr::EmitBranchCode"); |
| ASSERT(kind() == Token::kEQ_STRICT || kind() == Token::kNE_STRICT); |
| |
| BranchLabels labels = compiler->CreateBranchLabels(branch); |
| Condition true_condition = EmitComparisonCode(compiler, labels); |
| EmitBranchOnCondition(compiler, true_condition, labels); |
| } |
| |
| |
| LocationSummary* BooleanNegateInstr::MakeLocationSummary(bool opt) const { |
| return LocationSummary::Make(1, |
| Location::RequiresRegister(), |
| LocationSummary::kNoCall); |
| } |
| |
| |
| void BooleanNegateInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| Register value = locs()->in(0).reg(); |
| Register result = locs()->out(0).reg(); |
| |
| __ LoadObject(result, Bool::True()); |
| __ LoadObject(TMP, Bool::False()); |
| __ subu(CMPRES1, value, result); |
| __ movz(result, TMP, CMPRES1); // If value is True, move False into result. |
| } |
| |
| |
| LocationSummary* AllocateObjectInstr::MakeLocationSummary(bool opt) const { |
| return MakeCallSummary(); |
| } |
| |
| |
| void AllocateObjectInstr::EmitNativeCode(FlowGraphCompiler* compiler) { |
| __ TraceSimMsg("AllocateObjectInstr"); |
| __ Comment("AllocateObjectInstr"); |
| const Code& stub = Code::Handle(StubCode::GetAllocationStubForClass(cls())); |
| const ExternalLabel label(cls().ToCString(), stub.EntryPoint()); |
| compiler->GenerateCall(token_pos(), |
| &label, |
| PcDescriptors::kOther, |
| locs()); |
| __ Drop(ArgumentCount()); // Discard arguments. |
| } |
| |
| } // namespace dart |
| |
| #endif // defined TARGET_ARCH_MIPS |