| // 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_ARM. |
| #if defined(TARGET_ARCH_ARM) |
| |
| #include "vm/flow_graph_compiler.h" |
| |
| #include "lib/error.h" |
| #include "vm/ast_printer.h" |
| #include "vm/dart_entry.h" |
| #include "vm/il_printer.h" |
| #include "vm/locations.h" |
| #include "vm/object_store.h" |
| #include "vm/parser.h" |
| #include "vm/stub_code.h" |
| #include "vm/symbols.h" |
| |
| namespace dart { |
| |
| DEFINE_FLAG(bool, trap_on_deoptimization, false, "Trap on deoptimization."); |
| DECLARE_FLAG(int, optimization_counter_threshold); |
| DECLARE_FLAG(bool, print_ast); |
| DECLARE_FLAG(bool, print_scopes); |
| DECLARE_FLAG(bool, enable_type_checks); |
| DECLARE_FLAG(bool, eliminate_type_checks); |
| |
| |
| FlowGraphCompiler::~FlowGraphCompiler() { |
| // BlockInfos are zone-allocated, so their destructors are not called. |
| // Verify the labels explicitly here. |
| for (int i = 0; i < block_info_.length(); ++i) { |
| ASSERT(!block_info_[i]->jump_label()->IsLinked()); |
| } |
| } |
| |
| |
| bool FlowGraphCompiler::SupportsUnboxedMints() { |
| return false; |
| } |
| |
| |
| void CompilerDeoptInfoWithStub::GenerateCode(FlowGraphCompiler* compiler, |
| intptr_t stub_ix) { |
| // Calls do not need stubs, they share a deoptimization trampoline. |
| ASSERT(reason() != kDeoptAtCall); |
| Assembler* assem = compiler->assembler(); |
| #define __ assem-> |
| __ Comment("Deopt stub for id %"Pd"", deopt_id()); |
| __ Bind(entry_label()); |
| if (FLAG_trap_on_deoptimization) __ bkpt(0); |
| |
| ASSERT(deoptimization_env() != NULL); |
| |
| __ BranchLink(&StubCode::DeoptimizeLabel()); |
| set_pc_offset(assem->CodeSize()); |
| #undef __ |
| } |
| |
| |
| #define __ assembler()-> |
| |
| |
| // Fall through if bool_register contains null. |
| void FlowGraphCompiler::GenerateBoolToJump(Register bool_register, |
| Label* is_true, |
| Label* is_false) { |
| Label fall_through; |
| __ CompareImmediate(bool_register, |
| reinterpret_cast<intptr_t>(Object::null())); |
| __ b(&fall_through, EQ); |
| __ CompareObject(bool_register, Bool::True()); |
| __ b(is_true, EQ); |
| __ b(is_false); |
| __ Bind(&fall_through); |
| } |
| |
| |
| // R0: instance (must be preserved). |
| // R1: instantiator type arguments (if used). |
| RawSubtypeTestCache* FlowGraphCompiler::GenerateCallSubtypeTestStub( |
| TypeTestStubKind test_kind, |
| Register instance_reg, |
| Register type_arguments_reg, |
| Register temp_reg, |
| Label* is_instance_lbl, |
| Label* is_not_instance_lbl) { |
| ASSERT(instance_reg == R0); |
| ASSERT(temp_reg == kNoRegister); // Unused on ARM. |
| const SubtypeTestCache& type_test_cache = |
| SubtypeTestCache::ZoneHandle(SubtypeTestCache::New()); |
| __ LoadObject(R2, type_test_cache); |
| if (test_kind == kTestTypeOneArg) { |
| ASSERT(type_arguments_reg == kNoRegister); |
| __ LoadImmediate(R1, reinterpret_cast<intptr_t>(Object::null())); |
| __ BranchLink(&StubCode::Subtype1TestCacheLabel()); |
| } else if (test_kind == kTestTypeTwoArgs) { |
| ASSERT(type_arguments_reg == kNoRegister); |
| __ LoadImmediate(R1, reinterpret_cast<intptr_t>(Object::null())); |
| __ BranchLink(&StubCode::Subtype2TestCacheLabel()); |
| } else if (test_kind == kTestTypeThreeArgs) { |
| ASSERT(type_arguments_reg == R1); |
| __ BranchLink(&StubCode::Subtype3TestCacheLabel()); |
| } else { |
| UNREACHABLE(); |
| } |
| // Result is in R1: null -> not found, otherwise Bool::True or Bool::False. |
| GenerateBoolToJump(R1, is_instance_lbl, is_not_instance_lbl); |
| return type_test_cache.raw(); |
| } |
| |
| |
| // Jumps to labels 'is_instance' or 'is_not_instance' respectively, if |
| // type test is conclusive, otherwise fallthrough if a type test could not |
| // be completed. |
| // R0: instance being type checked (preserved). |
| // Clobbers R2. |
| RawSubtypeTestCache* |
| FlowGraphCompiler::GenerateInstantiatedTypeWithArgumentsTest( |
| intptr_t token_pos, |
| const AbstractType& type, |
| Label* is_instance_lbl, |
| Label* is_not_instance_lbl) { |
| __ Comment("InstantiatedTypeWithArgumentsTest"); |
| ASSERT(type.IsInstantiated()); |
| const Class& type_class = Class::ZoneHandle(type.type_class()); |
| ASSERT(type_class.HasTypeArguments()); |
| const Register kInstanceReg = R0; |
| // A Smi object cannot be the instance of a parameterized class. |
| __ tst(kInstanceReg, ShifterOperand(kSmiTagMask)); |
| __ b(is_not_instance_lbl, EQ); |
| const AbstractTypeArguments& type_arguments = |
| AbstractTypeArguments::ZoneHandle(type.arguments()); |
| const bool is_raw_type = type_arguments.IsNull() || |
| type_arguments.IsRaw(type_arguments.Length()); |
| if (is_raw_type) { |
| const Register kClassIdReg = R2; |
| // dynamic type argument, check only classes. |
| __ LoadClassId(kClassIdReg, kInstanceReg); |
| __ CompareImmediate(kClassIdReg, type_class.id()); |
| __ b(is_instance_lbl, EQ); |
| // List is a very common case. |
| if (type_class.IsListClass()) { |
| GenerateListTypeCheck(kClassIdReg, is_instance_lbl); |
| } |
| return GenerateSubtype1TestCacheLookup( |
| token_pos, type_class, is_instance_lbl, is_not_instance_lbl); |
| } |
| // If one type argument only, check if type argument is Object or dynamic. |
| if (type_arguments.Length() == 1) { |
| const AbstractType& tp_argument = AbstractType::ZoneHandle( |
| type_arguments.TypeAt(0)); |
| ASSERT(!tp_argument.IsMalformed()); |
| if (tp_argument.IsType()) { |
| ASSERT(tp_argument.HasResolvedTypeClass()); |
| // Check if type argument is dynamic or Object. |
| const Type& object_type = Type::Handle(Type::ObjectType()); |
| if (object_type.IsSubtypeOf(tp_argument, NULL)) { |
| // Instance class test only necessary. |
| return GenerateSubtype1TestCacheLookup( |
| token_pos, type_class, is_instance_lbl, is_not_instance_lbl); |
| } |
| } |
| } |
| // Regular subtype test cache involving instance's type arguments. |
| const Register kTypeArgumentsReg = kNoRegister; |
| const Register kTempReg = kNoRegister; |
| // R0: instance (must be preserved). |
| return GenerateCallSubtypeTestStub(kTestTypeTwoArgs, |
| kInstanceReg, |
| kTypeArgumentsReg, |
| kTempReg, |
| is_instance_lbl, |
| is_not_instance_lbl); |
| } |
| |
| |
| void FlowGraphCompiler::CheckClassIds(Register class_id_reg, |
| const GrowableArray<intptr_t>& class_ids, |
| Label* is_equal_lbl, |
| Label* is_not_equal_lbl) { |
| for (intptr_t i = 0; i < class_ids.length(); i++) { |
| __ CompareImmediate(class_id_reg, class_ids[i]); |
| __ b(is_equal_lbl, EQ); |
| } |
| __ b(is_not_equal_lbl); |
| } |
| |
| |
| // Testing against an instantiated type with no arguments, without |
| // SubtypeTestCache. |
| // R0: instance being type checked (preserved). |
| // Clobbers R2, R3. |
| // Returns true if there is a fallthrough. |
| bool FlowGraphCompiler::GenerateInstantiatedTypeNoArgumentsTest( |
| intptr_t token_pos, |
| const AbstractType& type, |
| Label* is_instance_lbl, |
| Label* is_not_instance_lbl) { |
| __ Comment("InstantiatedTypeNoArgumentsTest"); |
| ASSERT(type.IsInstantiated()); |
| const Class& type_class = Class::Handle(type.type_class()); |
| ASSERT(!type_class.HasTypeArguments()); |
| |
| const Register kInstanceReg = R0; |
| __ tst(kInstanceReg, ShifterOperand(kSmiTagMask)); |
| // If instance is Smi, check directly. |
| const Class& smi_class = Class::Handle(Smi::Class()); |
| if (smi_class.IsSubtypeOf(TypeArguments::Handle(), |
| type_class, |
| TypeArguments::Handle(), |
| NULL)) { |
| __ b(is_instance_lbl, EQ); |
| } else { |
| __ b(is_not_instance_lbl, EQ); |
| } |
| // Compare if the classes are equal. |
| const Register kClassIdReg = R2; |
| __ LoadClassId(kClassIdReg, kInstanceReg); |
| __ CompareImmediate(kClassIdReg, type_class.id()); |
| __ b(is_instance_lbl, EQ); |
| // See ClassFinalizer::ResolveSuperTypeAndInterfaces for list of restricted |
| // interfaces. |
| // Bool interface can be implemented only by core class Bool. |
| if (type.IsBoolType()) { |
| __ CompareImmediate(kClassIdReg, kBoolCid); |
| __ b(is_instance_lbl, EQ); |
| __ b(is_not_instance_lbl); |
| return false; |
| } |
| if (type.IsFunctionType()) { |
| // Check if instance is a closure. |
| __ LoadClassById(R3, kClassIdReg); |
| __ ldr(R3, FieldAddress(R3, Class::signature_function_offset())); |
| __ CompareImmediate(R3, reinterpret_cast<int32_t>(Object::null())); |
| __ b(is_instance_lbl, NE); |
| } |
| // Custom checking for numbers (Smi, Mint, Bigint and Double). |
| // Note that instance is not Smi (checked above). |
| if (type.IsSubtypeOf(Type::Handle(Type::Number()), NULL)) { |
| GenerateNumberTypeCheck( |
| kClassIdReg, type, is_instance_lbl, is_not_instance_lbl); |
| return false; |
| } |
| if (type.IsStringType()) { |
| GenerateStringTypeCheck(kClassIdReg, is_instance_lbl, is_not_instance_lbl); |
| return false; |
| } |
| // Otherwise fallthrough. |
| return true; |
| } |
| |
| |
| // Uses SubtypeTestCache to store instance class and result. |
| // R0: instance to test. |
| // Clobbers R1-R5. |
| // Immediate class test already done. |
| // TODO(srdjan): Implement a quicker subtype check, as type test |
| // arrays can grow too high, but they may be useful when optimizing |
| // code (type-feedback). |
| RawSubtypeTestCache* FlowGraphCompiler::GenerateSubtype1TestCacheLookup( |
| intptr_t token_pos, |
| const Class& type_class, |
| Label* is_instance_lbl, |
| Label* is_not_instance_lbl) { |
| __ Comment("Subtype1TestCacheLookup"); |
| const Register kInstanceReg = R0; |
| __ LoadClass(R1, kInstanceReg, R2); |
| // R1: instance class. |
| // Check immediate superclass equality. |
| __ ldr(R2, FieldAddress(R1, Class::super_type_offset())); |
| __ ldr(R2, FieldAddress(R2, Type::type_class_offset())); |
| __ CompareObject(R2, type_class); |
| __ b(is_instance_lbl, EQ); |
| |
| const Register kTypeArgumentsReg = kNoRegister; |
| const Register kTempReg = kNoRegister; |
| return GenerateCallSubtypeTestStub(kTestTypeOneArg, |
| kInstanceReg, |
| kTypeArgumentsReg, |
| kTempReg, |
| is_instance_lbl, |
| is_not_instance_lbl); |
| } |
| |
| |
| // Generates inlined check if 'type' is a type parameter or type itself |
| // R0: instance (preserved). |
| RawSubtypeTestCache* FlowGraphCompiler::GenerateUninstantiatedTypeTest( |
| intptr_t token_pos, |
| const AbstractType& type, |
| Label* is_instance_lbl, |
| Label* is_not_instance_lbl) { |
| __ Comment("UninstantiatedTypeTest"); |
| ASSERT(!type.IsInstantiated()); |
| // Skip check if destination is a dynamic type. |
| if (type.IsTypeParameter()) { |
| const TypeParameter& type_param = TypeParameter::Cast(type); |
| // Load instantiator (or null) and instantiator type arguments on stack. |
| __ ldr(R1, Address(SP, 0)); // Get instantiator type arguments. |
| // R1: instantiator type arguments. |
| // Check if type argument is dynamic. |
| __ CompareImmediate(R1, reinterpret_cast<intptr_t>(Object::null())); |
| __ b(is_instance_lbl, EQ); |
| // Can handle only type arguments that are instances of TypeArguments. |
| // (runtime checks canonicalize type arguments). |
| Label fall_through; |
| __ CompareClassId(R1, kTypeArgumentsCid, R2); |
| __ b(&fall_through, NE); |
| __ ldr(R2, |
| FieldAddress(R1, TypeArguments::type_at_offset(type_param.index()))); |
| // R2: concrete type of type. |
| // Check if type argument is dynamic. |
| __ CompareObject(R2, Type::ZoneHandle(Type::DynamicType())); |
| __ b(is_instance_lbl, EQ); |
| __ CompareImmediate(R2, reinterpret_cast<intptr_t>(Object::null())); |
| __ b(is_instance_lbl, EQ); |
| const Type& object_type = Type::ZoneHandle(Type::ObjectType()); |
| __ CompareObject(R2, object_type); |
| __ b(is_instance_lbl, EQ); |
| |
| // For Smi check quickly against int and num interfaces. |
| Label not_smi; |
| __ tst(R0, ShifterOperand(kSmiTagMask)); // Value is Smi? |
| __ b(¬_smi, NE); |
| __ CompareObject(R2, Type::ZoneHandle(Type::IntType())); |
| __ b(is_instance_lbl, EQ); |
| __ CompareObject(R2, Type::ZoneHandle(Type::Number())); |
| __ b(is_instance_lbl, EQ); |
| // Smi must be handled in runtime. |
| __ b(&fall_through); |
| |
| __ Bind(¬_smi); |
| // R1: instantiator type arguments. |
| // R0: instance. |
| const Register kInstanceReg = R0; |
| const Register kTypeArgumentsReg = R1; |
| const Register kTempReg = kNoRegister; |
| const SubtypeTestCache& type_test_cache = |
| SubtypeTestCache::ZoneHandle( |
| GenerateCallSubtypeTestStub(kTestTypeThreeArgs, |
| kInstanceReg, |
| kTypeArgumentsReg, |
| kTempReg, |
| is_instance_lbl, |
| is_not_instance_lbl)); |
| __ Bind(&fall_through); |
| return type_test_cache.raw(); |
| } |
| if (type.IsType()) { |
| const Register kInstanceReg = R0; |
| const Register kTypeArgumentsReg = R1; |
| __ tst(kInstanceReg, ShifterOperand(kSmiTagMask)); // Is instance Smi? |
| __ b(is_not_instance_lbl, EQ); |
| __ ldr(kTypeArgumentsReg, Address(SP, 0)); // Instantiator type args. |
| // Uninstantiated type class is known at compile time, but the type |
| // arguments are determined at runtime by the instantiator. |
| const Register kTempReg = kNoRegister; |
| return GenerateCallSubtypeTestStub(kTestTypeThreeArgs, |
| kInstanceReg, |
| kTypeArgumentsReg, |
| kTempReg, |
| is_instance_lbl, |
| is_not_instance_lbl); |
| } |
| return SubtypeTestCache::null(); |
| } |
| |
| |
| // Inputs: |
| // - R0: instance being type checked (preserved). |
| // - R1: optional instantiator type arguments (preserved). |
| // Clobbers R2, R3. |
| // Returns: |
| // - preserved instance in R0 and optional instantiator type arguments in R1. |
| // Note that this inlined code must be followed by the runtime_call code, as it |
| // may fall through to it. Otherwise, this inline code will jump to the label |
| // is_instance or to the label is_not_instance. |
| RawSubtypeTestCache* FlowGraphCompiler::GenerateInlineInstanceof( |
| intptr_t token_pos, |
| const AbstractType& type, |
| Label* is_instance_lbl, |
| Label* is_not_instance_lbl) { |
| __ Comment("InlineInstanceof"); |
| if (type.IsVoidType()) { |
| // A non-null value is returned from a void function, which will result in a |
| // type error. A null value is handled prior to executing this inline code. |
| return SubtypeTestCache::null(); |
| } |
| if (TypeCheckAsClassEquality(type)) { |
| const intptr_t type_cid = Class::Handle(type.type_class()).id(); |
| const Register kInstanceReg = R0; |
| __ tst(kInstanceReg, ShifterOperand(kSmiTagMask)); |
| if (type_cid == kSmiCid) { |
| __ b(is_instance_lbl, EQ); |
| } else { |
| __ b(is_not_instance_lbl, EQ); |
| __ CompareClassId(kInstanceReg, type_cid, R3); |
| __ b(is_instance_lbl, EQ); |
| } |
| __ b(is_not_instance_lbl); |
| return SubtypeTestCache::null(); |
| } |
| if (type.IsInstantiated()) { |
| const Class& type_class = Class::ZoneHandle(type.type_class()); |
| // A Smi object cannot be the instance of a parameterized class. |
| // A class equality check is only applicable with a dst type of a |
| // non-parameterized class or with a raw dst type of a parameterized class. |
| if (type_class.HasTypeArguments()) { |
| return GenerateInstantiatedTypeWithArgumentsTest(token_pos, |
| type, |
| is_instance_lbl, |
| is_not_instance_lbl); |
| // Fall through to runtime call. |
| } |
| const bool has_fall_through = |
| GenerateInstantiatedTypeNoArgumentsTest(token_pos, |
| type, |
| is_instance_lbl, |
| is_not_instance_lbl); |
| if (has_fall_through) { |
| // If test non-conclusive so far, try the inlined type-test cache. |
| // 'type' is known at compile time. |
| return GenerateSubtype1TestCacheLookup( |
| token_pos, type_class, is_instance_lbl, is_not_instance_lbl); |
| } else { |
| return SubtypeTestCache::null(); |
| } |
| } |
| return GenerateUninstantiatedTypeTest(token_pos, |
| type, |
| is_instance_lbl, |
| is_not_instance_lbl); |
| } |
| |
| |
| void FlowGraphCompiler::GenerateInstanceOf(intptr_t token_pos, |
| intptr_t deopt_id, |
| const AbstractType& type, |
| bool negate_result, |
| LocationSummary* locs) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| // Optimize assignable type check by adding inlined tests for: |
| // - NULL -> return NULL. |
| // - Smi -> compile time subtype check (only if dst class is not parameterized). |
| // - Class equality (only if class is not parameterized). |
| // Inputs: |
| // - R0: instance being type checked. |
| // - R1: instantiator type arguments or raw_null. |
| // - R2: instantiator or raw_null. |
| // Returns: |
| // - object in R0 for successful assignable check (or throws TypeError). |
| // Performance notes: positive checks must be quick, negative checks can be slow |
| // as they throw an exception. |
| void FlowGraphCompiler::GenerateAssertAssignable(intptr_t token_pos, |
| intptr_t deopt_id, |
| const AbstractType& dst_type, |
| const String& dst_name, |
| LocationSummary* locs) { |
| ASSERT(token_pos >= 0); |
| ASSERT(!dst_type.IsNull()); |
| ASSERT(dst_type.IsFinalized()); |
| // Assignable check is skipped in FlowGraphBuilder, not here. |
| ASSERT(dst_type.IsMalformed() || |
| (!dst_type.IsDynamicType() && !dst_type.IsObjectType())); |
| // Preserve instantiator (R2) and its type arguments (R1). |
| __ PushList((1 << R1) | (1 << R2)); |
| // A null object is always assignable and is returned as result. |
| Label is_assignable, runtime_call; |
| __ CompareImmediate(R0, reinterpret_cast<int32_t>(Object::null())); |
| __ b(&is_assignable, EQ); |
| |
| if (!FLAG_eliminate_type_checks) { |
| // If type checks are not eliminated during the graph building then |
| // a transition sentinel can be seen here. |
| __ CompareObject(R0, Object::transition_sentinel()); |
| __ b(&is_assignable, EQ); |
| } |
| |
| // Generate throw new TypeError() if the type is malformed. |
| if (dst_type.IsMalformed()) { |
| const Error& error = Error::Handle(dst_type.malformed_error()); |
| const String& error_message = String::ZoneHandle( |
| Symbols::New(error.ToErrorCString())); |
| __ PushObject(Object::ZoneHandle()); // Make room for the result. |
| __ Push(R0); // Push the source object. |
| __ PushObject(dst_name); // Push the name of the destination. |
| __ PushObject(error_message); |
| GenerateCallRuntime(token_pos, |
| deopt_id, |
| kMalformedTypeErrorRuntimeEntry, |
| locs); |
| // We should never return here. |
| __ bkpt(0); |
| |
| __ Bind(&is_assignable); // For a null object. |
| // Restore instantiator (R2) and its type arguments (R1). |
| __ PopList((1 << R1) | (1 << R2)); |
| return; |
| } |
| |
| // Generate inline type check, linking to runtime call if not assignable. |
| SubtypeTestCache& test_cache = SubtypeTestCache::ZoneHandle(); |
| test_cache = GenerateInlineInstanceof(token_pos, dst_type, |
| &is_assignable, &runtime_call); |
| |
| __ Bind(&runtime_call); |
| // Load instantiator (R2) and its type arguments (R1). |
| __ ldm(IA, SP, (1 << R1) | (1 << R2)); |
| __ PushObject(Object::ZoneHandle()); // Make room for the result. |
| __ Push(R0); // Push the source object. |
| __ PushObject(dst_type); // Push the type of the destination. |
| // Push instantiator (R2) and its type arguments (R1). |
| __ PushList((1 << R1) | (1 << R2)); |
| __ PushObject(dst_name); // Push the name of the destination. |
| __ LoadObject(R0, test_cache); |
| __ Push(R0); |
| GenerateCallRuntime(token_pos, deopt_id, kTypeCheckRuntimeEntry, locs); |
| // Pop the parameters supplied to the runtime entry. The result of the |
| // type check runtime call is the checked value. |
| __ Drop(6); |
| __ Pop(R0); |
| |
| __ Bind(&is_assignable); |
| // Restore instantiator (R2) and its type arguments (R1). |
| __ PopList((1 << R1) | (1 << R2)); |
| } |
| |
| |
| void FlowGraphCompiler::EmitInstructionPrologue(Instruction* instr) { |
| if (!is_optimizing()) { |
| if (FLAG_enable_type_checks && instr->IsAssertAssignable()) { |
| AssertAssignableInstr* assert = instr->AsAssertAssignable(); |
| AddCurrentDescriptor(PcDescriptors::kDeopt, |
| assert->deopt_id(), |
| assert->token_pos()); |
| } else if (instr->IsGuardField()) { |
| GuardFieldInstr* guard = instr->AsGuardField(); |
| AddCurrentDescriptor(PcDescriptors::kDeopt, |
| guard->deopt_id(), |
| Scanner::kDummyTokenIndex); |
| } else if (instr->CanBeDeoptimizationTarget()) { |
| AddCurrentDescriptor(PcDescriptors::kDeopt, |
| instr->deopt_id(), |
| Scanner::kDummyTokenIndex); |
| } |
| AllocateRegistersLocally(instr); |
| } |
| } |
| |
| |
| void FlowGraphCompiler::EmitInstructionEpilogue(Instruction* instr) { |
| if (is_optimizing()) return; |
| Definition* defn = instr->AsDefinition(); |
| if ((defn != NULL) && defn->is_used()) { |
| __ Push(defn->locs()->out().reg()); |
| } |
| } |
| |
| |
| // Input parameters: |
| // R4: arguments descriptor array. |
| void FlowGraphCompiler::CopyParameters() { |
| __ Comment("Copy parameters"); |
| const Function& function = parsed_function().function(); |
| LocalScope* scope = parsed_function().node_sequence()->scope(); |
| const int num_fixed_params = function.num_fixed_parameters(); |
| const int num_opt_pos_params = function.NumOptionalPositionalParameters(); |
| const int num_opt_named_params = function.NumOptionalNamedParameters(); |
| const int num_params = |
| num_fixed_params + num_opt_pos_params + num_opt_named_params; |
| ASSERT(function.NumParameters() == num_params); |
| ASSERT(parsed_function().first_parameter_index() == kFirstLocalSlotIndex); |
| |
| // Check that min_num_pos_args <= num_pos_args <= max_num_pos_args, |
| // where num_pos_args is the number of positional arguments passed in. |
| const int min_num_pos_args = num_fixed_params; |
| const int max_num_pos_args = num_fixed_params + num_opt_pos_params; |
| |
| __ ldr(R8, FieldAddress(R4, ArgumentsDescriptor::positional_count_offset())); |
| // Check that min_num_pos_args <= num_pos_args. |
| Label wrong_num_arguments; |
| __ CompareImmediate(R8, Smi::RawValue(min_num_pos_args)); |
| __ b(&wrong_num_arguments, LT); |
| // Check that num_pos_args <= max_num_pos_args. |
| __ CompareImmediate(R8, Smi::RawValue(max_num_pos_args)); |
| __ b(&wrong_num_arguments, GT); |
| |
| // Copy positional arguments. |
| // Argument i passed at fp[kLastParamSlotIndex + num_args - 1 - i] is copied |
| // to fp[kFirstLocalSlotIndex - i]. |
| |
| __ ldr(R7, FieldAddress(R4, ArgumentsDescriptor::count_offset())); |
| // Since R7 and R8 are Smi, use LSL 1 instead of LSL 2. |
| // Let R7 point to the last passed positional argument, i.e. to |
| // fp[kLastParamSlotIndex + num_args - 1 - (num_pos_args - 1)]. |
| __ sub(R7, R7, ShifterOperand(R8)); |
| __ add(R7, FP, ShifterOperand(R7, LSL, 1)); |
| __ add(R7, R7, ShifterOperand(kLastParamSlotIndex * kWordSize)); |
| |
| // Let R6 point to the last copied positional argument, i.e. to |
| // fp[kFirstLocalSlotIndex - (num_pos_args - 1)]. |
| __ AddImmediate(R6, FP, (kFirstLocalSlotIndex + 1) * kWordSize); |
| __ sub(R6, R6, ShifterOperand(R8, LSL, 1)); // R8 is a Smi. |
| __ SmiUntag(R8); |
| Label loop, loop_condition; |
| __ b(&loop_condition); |
| // We do not use the final allocation index of the variable here, i.e. |
| // scope->VariableAt(i)->index(), because captured variables still need |
| // to be copied to the context that is not yet allocated. |
| const Address argument_addr(R7, R8, LSL, 2); |
| const Address copy_addr(R6, R8, LSL, 2); |
| __ Bind(&loop); |
| __ ldr(IP, argument_addr); |
| __ str(IP, copy_addr); |
| __ Bind(&loop_condition); |
| __ subs(R8, R8, ShifterOperand(1)); |
| __ b(&loop, PL); |
| |
| // Copy or initialize optional named arguments. |
| Label all_arguments_processed; |
| if (num_opt_named_params > 0) { |
| // Start by alphabetically sorting the names of the optional parameters. |
| LocalVariable** opt_param = new LocalVariable*[num_opt_named_params]; |
| int* opt_param_position = new int[num_opt_named_params]; |
| for (int pos = num_fixed_params; pos < num_params; pos++) { |
| LocalVariable* parameter = scope->VariableAt(pos); |
| const String& opt_param_name = parameter->name(); |
| int i = pos - num_fixed_params; |
| while (--i >= 0) { |
| LocalVariable* param_i = opt_param[i]; |
| const intptr_t result = opt_param_name.CompareTo(param_i->name()); |
| ASSERT(result != 0); |
| if (result > 0) break; |
| opt_param[i + 1] = opt_param[i]; |
| opt_param_position[i + 1] = opt_param_position[i]; |
| } |
| opt_param[i + 1] = parameter; |
| opt_param_position[i + 1] = pos; |
| } |
| // Generate code handling each optional parameter in alphabetical order. |
| __ ldr(R7, FieldAddress(R4, ArgumentsDescriptor::count_offset())); |
| __ ldr(R8, |
| FieldAddress(R4, ArgumentsDescriptor::positional_count_offset())); |
| __ SmiUntag(R8); |
| // Let R7 point to the first passed argument, i.e. to |
| // fp[kLastParamSlotIndex + num_args - 1 - 0]; num_args (R7) is Smi. |
| __ add(R7, FP, ShifterOperand(R7, LSL, 1)); |
| __ AddImmediate(R7, R7, (kLastParamSlotIndex - 1) * kWordSize); |
| // Let R6 point to the entry of the first named argument. |
| __ add(R6, R4, ShifterOperand( |
| ArgumentsDescriptor::first_named_entry_offset() - kHeapObjectTag)); |
| for (int i = 0; i < num_opt_named_params; i++) { |
| Label load_default_value, assign_optional_parameter; |
| const int param_pos = opt_param_position[i]; |
| // Check if this named parameter was passed in. |
| // Load R5 with the name of the argument. |
| __ ldr(R5, Address(R6, ArgumentsDescriptor::name_offset())); |
| ASSERT(opt_param[i]->name().IsSymbol()); |
| __ CompareObject(R5, opt_param[i]->name()); |
| __ b(&load_default_value, NE); |
| // Load R5 with passed-in argument at provided arg_pos, i.e. at |
| // fp[kLastParamSlotIndex + num_args - 1 - arg_pos]. |
| __ ldr(R5, Address(R6, ArgumentsDescriptor::position_offset())); |
| // R5 is arg_pos as Smi. |
| // Point to next named entry. |
| __ add(R6, R6, ShifterOperand(ArgumentsDescriptor::named_entry_size())); |
| __ rsb(R5, R5, ShifterOperand(0)); |
| Address argument_addr(R7, R5, LSL, 1); // R5 is a negative Smi. |
| __ ldr(R5, argument_addr); |
| __ b(&assign_optional_parameter); |
| __ Bind(&load_default_value); |
| // Load R5 with default argument. |
| const Object& value = Object::ZoneHandle( |
| parsed_function().default_parameter_values().At( |
| param_pos - num_fixed_params)); |
| __ LoadObject(R5, value); |
| __ Bind(&assign_optional_parameter); |
| // Assign R5 to fp[kFirstLocalSlotIndex - param_pos]. |
| // We do not use the final allocation index of the variable here, i.e. |
| // scope->VariableAt(i)->index(), because captured variables still need |
| // to be copied to the context that is not yet allocated. |
| const intptr_t computed_param_pos = kFirstLocalSlotIndex - param_pos; |
| const Address param_addr(FP, computed_param_pos * kWordSize); |
| __ str(R5, param_addr); |
| } |
| delete[] opt_param; |
| delete[] opt_param_position; |
| // Check that R6 now points to the null terminator in the array descriptor. |
| __ ldr(R5, Address(R6, 0)); |
| __ CompareImmediate(R5, reinterpret_cast<int32_t>(Object::null())); |
| __ b(&all_arguments_processed, EQ); |
| } else { |
| ASSERT(num_opt_pos_params > 0); |
| __ ldr(R8, |
| FieldAddress(R4, ArgumentsDescriptor::positional_count_offset())); |
| __ SmiUntag(R8); |
| for (int i = 0; i < num_opt_pos_params; i++) { |
| Label next_parameter; |
| // Handle this optional positional parameter only if k or fewer positional |
| // arguments have been passed, where k is param_pos, the position of this |
| // optional parameter in the formal parameter list. |
| const int param_pos = num_fixed_params + i; |
| __ CompareImmediate(R8, param_pos); |
| __ b(&next_parameter, GT); |
| // Load R5 with default argument. |
| const Object& value = Object::ZoneHandle( |
| parsed_function().default_parameter_values().At(i)); |
| __ LoadObject(R5, value); |
| // Assign R5 to fp[kFirstLocalSlotIndex - param_pos]. |
| // We do not use the final allocation index of the variable here, i.e. |
| // scope->VariableAt(i)->index(), because captured variables still need |
| // to be copied to the context that is not yet allocated. |
| const intptr_t computed_param_pos = kFirstLocalSlotIndex - param_pos; |
| const Address param_addr(FP, computed_param_pos * kWordSize); |
| __ str(R5, param_addr); |
| __ Bind(&next_parameter); |
| } |
| __ ldr(R7, FieldAddress(R4, ArgumentsDescriptor::count_offset())); |
| __ SmiUntag(R7); |
| // Check that R8 equals R7, i.e. no named arguments passed. |
| __ cmp(R8, ShifterOperand(R7)); |
| __ b(&all_arguments_processed, EQ); |
| } |
| |
| __ Bind(&wrong_num_arguments); |
| if (StackSize() != 0) { |
| // We need to unwind the space we reserved for locals and copied parameters. |
| // The NoSuchMethodFunction stub does not expect to see that area on the |
| // stack. |
| __ AddImmediate(SP, StackSize() * kWordSize); |
| } |
| // The call below has an empty stackmap because we have just |
| // dropped the spill slots. |
| BitmapBuilder* empty_stack_bitmap = new BitmapBuilder(); |
| |
| // Invoke noSuchMethod function passing the original name of the function. |
| // If the function is a closure function, use "call" as the original name. |
| const String& name = String::Handle( |
| function.IsClosureFunction() ? Symbols::Call().raw() : function.name()); |
| const int kNumArgsChecked = 1; |
| const ICData& ic_data = ICData::ZoneHandle( |
| ICData::New(function, name, Isolate::kNoDeoptId, kNumArgsChecked)); |
| __ LoadObject(R5, ic_data); |
| // FP - 4 : saved PP, object pool pointer of caller. |
| // FP + 0 : previous frame pointer. |
| // FP + 4 : return address. |
| // FP + 8 : PC marker, for easy identification of RawInstruction obj. |
| // FP + 12: last argument (arg n-1). |
| // SP + 0 : saved PP. |
| // SP + 16 + 4*(n-1) : first argument (arg 0). |
| // R5 : ic-data. |
| // R4 : arguments descriptor array. |
| __ BranchLink(&StubCode::CallNoSuchMethodFunctionLabel()); |
| if (is_optimizing()) { |
| stackmap_table_builder_->AddEntry(assembler()->CodeSize(), |
| empty_stack_bitmap, |
| 0); // No registers. |
| } |
| // The noSuchMethod call may return. |
| __ LeaveDartFrame(); |
| __ Ret(); |
| |
| __ Bind(&all_arguments_processed); |
| // Nullify originally passed arguments only after they have been copied and |
| // checked, otherwise noSuchMethod would not see their original values. |
| // This step can be skipped in case we decide that formal parameters are |
| // implicitly final, since garbage collecting the unmodified value is not |
| // an issue anymore. |
| |
| // R4 : arguments descriptor array. |
| __ ldr(R8, FieldAddress(R4, ArgumentsDescriptor::count_offset())); |
| __ SmiUntag(R8); |
| __ add(R7, FP, ShifterOperand(kLastParamSlotIndex * kWordSize)); |
| const Address original_argument_addr(R7, R8, LSL, 2); |
| __ LoadImmediate(IP, reinterpret_cast<intptr_t>(Object::null())); |
| Label null_args_loop, null_args_loop_condition; |
| __ b(&null_args_loop_condition); |
| __ Bind(&null_args_loop); |
| __ str(IP, original_argument_addr); |
| __ Bind(&null_args_loop_condition); |
| __ subs(R8, R8, ShifterOperand(1)); |
| __ b(&null_args_loop, PL); |
| } |
| |
| |
| void FlowGraphCompiler::GenerateInlinedGetter(intptr_t offset) { |
| // LR: return address. |
| // SP: receiver. |
| // Sequence node has one return node, its input is load field node. |
| __ ldr(R0, Address(SP, 0 * kWordSize)); |
| __ LoadFromOffset(kLoadWord, R0, R0, offset - kHeapObjectTag); |
| __ Ret(); |
| } |
| |
| |
| void FlowGraphCompiler::GenerateInlinedSetter(intptr_t offset) { |
| // LR: return address. |
| // SP+1: receiver. |
| // SP+0: value. |
| // Sequence node has one store node and one return NULL node. |
| __ ldr(R0, Address(SP, 1 * kWordSize)); // Receiver. |
| __ ldr(R1, Address(SP, 0 * kWordSize)); // Value. |
| __ StoreIntoObject(R0, FieldAddress(R0, offset), R1); |
| __ LoadImmediate(R0, reinterpret_cast<intptr_t>(Object::null())); |
| __ Ret(); |
| } |
| |
| |
| void FlowGraphCompiler::EmitFrameEntry() { |
| const Function& function = parsed_function().function(); |
| if (CanOptimizeFunction() && function.is_optimizable()) { |
| const bool can_optimize = !is_optimizing() || may_reoptimize(); |
| const Register function_reg = R6; |
| if (can_optimize) { |
| // The pool pointer is not setup before entering the Dart frame. |
| |
| // Preserve PP of caller. |
| __ mov(R7, ShifterOperand(PP)); |
| |
| // Temporarily setup pool pointer for this dart function. |
| __ LoadPoolPointer(); |
| |
| // Load function object from object pool. |
| __ LoadObject(function_reg, function); // Uses PP. |
| |
| // Restore PP of caller. |
| __ mov(PP, ShifterOperand(R7)); |
| } |
| // Patch point is after the eventually inlined function object. |
| AddCurrentDescriptor(PcDescriptors::kEntryPatch, |
| Isolate::kNoDeoptId, |
| 0); // No token position. |
| if (can_optimize) { |
| // Reoptimization of optimized function is triggered by counting in |
| // IC stubs, but not at the entry of the function. |
| if (!is_optimizing()) { |
| __ ldr(R7, FieldAddress(function_reg, |
| Function::usage_counter_offset())); |
| __ add(R7, R7, ShifterOperand(1)); |
| __ str(R7, FieldAddress(function_reg, |
| Function::usage_counter_offset())); |
| } else { |
| __ ldr(R7, FieldAddress(function_reg, |
| Function::usage_counter_offset())); |
| } |
| __ CompareImmediate(R7, FLAG_optimization_counter_threshold); |
| ASSERT(function_reg == R6); |
| __ Branch(&StubCode::OptimizeFunctionLabel(), GE); |
| } |
| } else { |
| AddCurrentDescriptor(PcDescriptors::kEntryPatch, |
| Isolate::kNoDeoptId, |
| 0); // No token position. |
| } |
| __ Comment("Enter frame"); |
| __ EnterDartFrame((StackSize() * kWordSize)); |
| } |
| |
| |
| // Input parameters: |
| // LR: return address. |
| // SP: address of last argument. |
| // FP: caller's frame pointer. |
| // PP: caller's pool pointer. |
| // R5: ic-data. |
| // R4: arguments descriptor array. |
| void FlowGraphCompiler::CompileGraph() { |
| InitCompiler(); |
| if (TryIntrinsify()) { |
| // Although this intrinsified code will never be patched, it must satisfy |
| // CodePatcher::CodeIsPatchable, which verifies that this code has a minimum |
| // code size. |
| __ bkpt(0); |
| __ Branch(&StubCode::FixCallersTargetLabel()); |
| return; |
| } |
| |
| EmitFrameEntry(); |
| |
| const Function& function = parsed_function().function(); |
| |
| const int num_fixed_params = function.num_fixed_parameters(); |
| const int num_copied_params = parsed_function().num_copied_params(); |
| const int num_locals = parsed_function().num_stack_locals(); |
| |
| // We check the number of passed arguments when we have to copy them due to |
| // the presence of optional parameters. |
| // No such checking code is generated if only fixed parameters are declared, |
| // unless we are in debug mode or unless we are compiling a closure. |
| LocalVariable* saved_args_desc_var = |
| parsed_function().GetSavedArgumentsDescriptorVar(); |
| if (num_copied_params == 0) { |
| #ifdef DEBUG |
| ASSERT(!parsed_function().function().HasOptionalParameters()); |
| const bool check_arguments = true; |
| #else |
| const bool check_arguments = function.IsClosureFunction(); |
| #endif |
| if (check_arguments) { |
| __ Comment("Check argument count"); |
| // Check that exactly num_fixed arguments are passed in. |
| Label correct_num_arguments, wrong_num_arguments; |
| __ ldr(R0, FieldAddress(R4, ArgumentsDescriptor::count_offset())); |
| __ CompareImmediate(R0, Smi::RawValue(num_fixed_params)); |
| __ b(&wrong_num_arguments, NE); |
| __ ldr(R1, FieldAddress(R4, |
| ArgumentsDescriptor::positional_count_offset())); |
| __ cmp(R0, ShifterOperand(R1)); |
| __ b(&correct_num_arguments, EQ); |
| __ Bind(&wrong_num_arguments); |
| if (function.IsClosureFunction()) { |
| if (StackSize() != 0) { |
| // We need to unwind the space we reserved for locals and copied |
| // parameters. The NoSuchMethodFunction stub does not expect to see |
| // that area on the stack. |
| __ AddImmediate(SP, StackSize() * kWordSize); |
| } |
| // The call below has an empty stackmap because we have just |
| // dropped the spill slots. |
| BitmapBuilder* empty_stack_bitmap = new BitmapBuilder(); |
| |
| // Invoke noSuchMethod function passing "call" as the function name. |
| const int kNumArgsChecked = 1; |
| const ICData& ic_data = ICData::ZoneHandle( |
| ICData::New(function, Symbols::Call(), |
| Isolate::kNoDeoptId, kNumArgsChecked)); |
| __ LoadObject(R5, ic_data); |
| // FP - 4 : saved PP, object pool pointer of caller. |
| // FP + 0 : previous frame pointer. |
| // FP + 4 : return address. |
| // FP + 8 : PC marker, for easy identification of RawInstruction obj. |
| // FP + 12: last argument (arg n-1). |
| // SP + 0 : saved PP. |
| // SP + 16 + 4*(n-1) : first argument (arg 0). |
| // R5 : ic-data. |
| // R4 : arguments descriptor array. |
| __ BranchLink(&StubCode::CallNoSuchMethodFunctionLabel()); |
| if (is_optimizing()) { |
| stackmap_table_builder_->AddEntry(assembler()->CodeSize(), |
| empty_stack_bitmap, |
| 0); // No registers. |
| } |
| // The noSuchMethod call may return. |
| __ LeaveDartFrame(); |
| __ Ret(); |
| } else { |
| __ Stop("Wrong number of arguments"); |
| } |
| __ Bind(&correct_num_arguments); |
| } |
| // The arguments descriptor is never saved in the absence of optional |
| // parameters, since any argument definition test would always yield true. |
| ASSERT(saved_args_desc_var == NULL); |
| } else { |
| if (saved_args_desc_var != NULL) { |
| __ Comment("Save arguments descriptor"); |
| const Register kArgumentsDescriptorReg = R4; |
| // The saved_args_desc_var is allocated one slot before the first local. |
| const intptr_t slot = parsed_function().first_stack_local_index() + 1; |
| // If the saved_args_desc_var is captured, it is first moved to the stack |
| // and later to the context, once the context is allocated. |
| ASSERT(saved_args_desc_var->is_captured() || |
| (saved_args_desc_var->index() == slot)); |
| __ str(kArgumentsDescriptorReg, Address(FP, slot * kWordSize)); |
| } |
| CopyParameters(); |
| } |
| |
| // In unoptimized code, initialize (non-argument) stack allocated slots to |
| // null. This does not cover the saved_args_desc_var slot. |
| if (!is_optimizing() && (num_locals > 0)) { |
| __ Comment("Initialize spill slots"); |
| const intptr_t slot_base = parsed_function().first_stack_local_index(); |
| __ LoadImmediate(R0, reinterpret_cast<intptr_t>(Object::null())); |
| for (intptr_t i = 0; i < num_locals; ++i) { |
| // Subtract index i (locals lie at lower addresses than FP). |
| __ str(R0, Address(FP, (slot_base - i) * kWordSize)); |
| } |
| } |
| |
| if (FLAG_print_scopes) { |
| // Print the function scope (again) after generating the prologue in order |
| // to see annotations such as allocation indices of locals. |
| if (FLAG_print_ast) { |
| // Second printing. |
| OS::Print("Annotated "); |
| } |
| AstPrinter::PrintFunctionScope(parsed_function()); |
| } |
| |
| VisitBlocks(); |
| |
| __ bkpt(0); |
| GenerateDeferredCode(); |
| // Emit function patching code. This will be swapped with the first 5 bytes |
| // at entry point. |
| AddCurrentDescriptor(PcDescriptors::kPatchCode, |
| Isolate::kNoDeoptId, |
| 0); // No token position. |
| __ Branch(&StubCode::FixCallersTargetLabel()); |
| AddCurrentDescriptor(PcDescriptors::kLazyDeoptJump, |
| Isolate::kNoDeoptId, |
| 0); // No token position. |
| __ Branch(&StubCode::DeoptimizeLazyLabel()); |
| } |
| |
| |
| void FlowGraphCompiler::GenerateCall(intptr_t token_pos, |
| const ExternalLabel* label, |
| PcDescriptors::Kind kind, |
| LocationSummary* locs) { |
| __ BranchLinkPatchable(label); |
| AddCurrentDescriptor(kind, Isolate::kNoDeoptId, token_pos); |
| RecordSafepoint(locs); |
| } |
| |
| |
| void FlowGraphCompiler::GenerateDartCall(intptr_t deopt_id, |
| intptr_t token_pos, |
| const ExternalLabel* label, |
| PcDescriptors::Kind kind, |
| LocationSummary* locs) { |
| __ BranchLinkPatchable(label); |
| AddCurrentDescriptor(kind, deopt_id, token_pos); |
| RecordSafepoint(locs); |
| // Marks either the continuation point in unoptimized code or the |
| // deoptimization point in optimized code, after call. |
| const intptr_t deopt_id_after = Isolate::ToDeoptAfter(deopt_id); |
| if (is_optimizing()) { |
| AddDeoptIndexAtCall(deopt_id_after, token_pos); |
| } else { |
| // Add deoptimization continuation point after the call and before the |
| // arguments are removed. |
| AddCurrentDescriptor(PcDescriptors::kDeopt, deopt_id_after, token_pos); |
| } |
| } |
| |
| |
| void FlowGraphCompiler::GenerateCallRuntime(intptr_t token_pos, |
| intptr_t deopt_id, |
| const RuntimeEntry& entry, |
| LocationSummary* locs) { |
| __ CallRuntime(entry); |
| AddCurrentDescriptor(PcDescriptors::kOther, deopt_id, token_pos); |
| RecordSafepoint(locs); |
| if (deopt_id != Isolate::kNoDeoptId) { |
| // Marks either the continuation point in unoptimized code or the |
| // deoptimization point in optimized code, after call. |
| const intptr_t deopt_id_after = Isolate::ToDeoptAfter(deopt_id); |
| if (is_optimizing()) { |
| AddDeoptIndexAtCall(deopt_id_after, token_pos); |
| } else { |
| // Add deoptimization continuation point after the call and before the |
| // arguments are removed. |
| AddCurrentDescriptor(PcDescriptors::kDeopt, |
| deopt_id_after, |
| token_pos); |
| } |
| } |
| } |
| |
| |
| void FlowGraphCompiler::EmitOptimizedInstanceCall( |
| ExternalLabel* target_label, |
| const ICData& ic_data, |
| const Array& arguments_descriptor, |
| intptr_t argument_count, |
| intptr_t deopt_id, |
| intptr_t token_pos, |
| LocationSummary* locs) { |
| // Each ICData propagated from unoptimized to optimized code contains the |
| // function that corresponds to the Dart function of that IC call. Due |
| // to inlining in optimized code, that function may not correspond to the |
| // top-level function (parsed_function().function()) which could be |
| // reoptimized and which counter needs to be incremented. |
| // Pass the function explicitly, it is used in IC stub. |
| __ LoadObject(R6, parsed_function().function()); |
| __ LoadObject(R4, arguments_descriptor); |
| __ LoadObject(R5, ic_data); |
| GenerateDartCall(deopt_id, |
| token_pos, |
| target_label, |
| PcDescriptors::kIcCall, |
| locs); |
| __ Drop(argument_count); |
| } |
| |
| |
| void FlowGraphCompiler::EmitInstanceCall(ExternalLabel* target_label, |
| const ICData& ic_data, |
| const Array& arguments_descriptor, |
| intptr_t argument_count, |
| intptr_t deopt_id, |
| intptr_t token_pos, |
| LocationSummary* locs) { |
| __ LoadObject(R4, arguments_descriptor); |
| __ LoadObject(R5, ic_data); |
| GenerateDartCall(deopt_id, |
| token_pos, |
| target_label, |
| PcDescriptors::kIcCall, |
| locs); |
| __ Drop(argument_count); |
| } |
| |
| |
| void FlowGraphCompiler::EmitMegamorphicInstanceCall( |
| const ICData& ic_data, |
| const Array& arguments_descriptor, |
| intptr_t argument_count, |
| intptr_t deopt_id, |
| intptr_t token_pos, |
| LocationSummary* locs) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| void FlowGraphCompiler::EmitStaticCall(const Function& function, |
| const Array& arguments_descriptor, |
| intptr_t argument_count, |
| intptr_t deopt_id, |
| intptr_t token_pos, |
| LocationSummary* locs) { |
| __ LoadObject(R4, arguments_descriptor); |
| // Do not use the code from the function, but let the code be patched so that |
| // we can record the outgoing edges to other code. |
| GenerateDartCall(deopt_id, |
| token_pos, |
| &StubCode::CallStaticFunctionLabel(), |
| PcDescriptors::kFuncCall, |
| locs); |
| AddStaticCallTarget(function); |
| __ Drop(argument_count); |
| } |
| |
| |
| void FlowGraphCompiler::EmitEqualityRegConstCompare(Register reg, |
| const Object& obj, |
| bool needs_number_check) { |
| if (needs_number_check && |
| (obj.IsMint() || obj.IsDouble() || obj.IsBigint())) { |
| __ Push(reg); |
| __ PushObject(obj); |
| __ BranchLink(&StubCode::IdenticalWithNumberCheckLabel()); |
| __ Drop(1); // Discard constant. |
| __ Pop(reg); // Restore 'reg'. |
| return; |
| } |
| |
| __ CompareObject(reg, obj); |
| } |
| |
| |
| void FlowGraphCompiler::EmitEqualityRegRegCompare(Register left, |
| Register right, |
| bool needs_number_check) { |
| if (needs_number_check) { |
| __ Push(left); |
| __ Push(right); |
| __ BranchLink(&StubCode::IdenticalWithNumberCheckLabel()); |
| // Stub returns result in flags (result of a cmpl, we need ZF computed). |
| __ Pop(right); |
| __ Pop(left); |
| } else { |
| __ cmp(left, ShifterOperand(right)); |
| } |
| } |
| |
| |
| void FlowGraphCompiler::EmitSuperEqualityCallPrologue(Register result, |
| Label* skip_call) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| void FlowGraphCompiler::SaveLiveRegisters(LocationSummary* locs) { |
| // TODO(vegorov): consider saving only caller save (volatile) registers. |
| const intptr_t fpu_registers = locs->live_registers()->fpu_registers(); |
| if (fpu_registers > 0) { |
| UNIMPLEMENTED(); |
| } |
| |
| // Store general purpose registers with the lowest register number at the |
| // lowest address. |
| const intptr_t cpu_registers = locs->live_registers()->cpu_registers(); |
| ASSERT((cpu_registers & ~kAllCpuRegistersList) == 0); |
| __ PushList(cpu_registers); |
| } |
| |
| |
| void FlowGraphCompiler::RestoreLiveRegisters(LocationSummary* locs) { |
| // General purpose registers have the lowest register number at the |
| // lowest address. |
| const intptr_t cpu_registers = locs->live_registers()->cpu_registers(); |
| ASSERT((cpu_registers & ~kAllCpuRegistersList) == 0); |
| __ PopList(cpu_registers); |
| |
| const intptr_t fpu_registers = locs->live_registers()->fpu_registers(); |
| if (fpu_registers > 0) { |
| UNIMPLEMENTED(); |
| } |
| } |
| |
| |
| void FlowGraphCompiler::EmitTestAndCall(const ICData& ic_data, |
| Register class_id_reg, |
| intptr_t arg_count, |
| const Array& arg_names, |
| Label* deopt, |
| intptr_t deopt_id, |
| intptr_t token_index, |
| LocationSummary* locs) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| void FlowGraphCompiler::EmitDoubleCompareBranch(Condition true_condition, |
| FpuRegister left, |
| FpuRegister right, |
| BranchInstr* branch) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| void FlowGraphCompiler::EmitDoubleCompareBool(Condition true_condition, |
| FpuRegister left, |
| FpuRegister right, |
| Register result) { |
| UNIMPLEMENTED(); |
| } |
| |
| |
| Condition FlowGraphCompiler::FlipCondition(Condition condition) { |
| UNIMPLEMENTED(); |
| return condition; |
| } |
| |
| |
| bool FlowGraphCompiler::EvaluateCondition(Condition condition, |
| intptr_t left, |
| intptr_t right) { |
| UNIMPLEMENTED(); |
| return false; |
| } |
| |
| |
| FieldAddress FlowGraphCompiler::ElementAddressForIntIndex(intptr_t cid, |
| intptr_t index_scale, |
| Register array, |
| intptr_t index) { |
| UNIMPLEMENTED(); |
| return FieldAddress(array, index); |
| } |
| |
| |
| FieldAddress FlowGraphCompiler::ElementAddressForRegIndex(intptr_t cid, |
| intptr_t index_scale, |
| Register array, |
| Register index) { |
| UNREACHABLE(); // No register indexed with offset addressing mode on ARM. |
| return FieldAddress(array, index); |
| } |
| |
| |
| Address FlowGraphCompiler::ExternalElementAddressForIntIndex( |
| intptr_t index_scale, |
| Register array, |
| intptr_t index) { |
| UNIMPLEMENTED(); |
| return FieldAddress(array, index); |
| } |
| |
| |
| Address FlowGraphCompiler::ExternalElementAddressForRegIndex( |
| intptr_t index_scale, |
| Register array, |
| Register index) { |
| UNIMPLEMENTED(); |
| return FieldAddress(array, index); |
| } |
| |
| |
| #undef __ |
| #define __ compiler_->assembler()-> |
| |
| |
| void ParallelMoveResolver::EmitMove(int index) { |
| MoveOperands* move = moves_[index]; |
| const Location source = move->src(); |
| const Location destination = move->dest(); |
| |
| if (source.IsRegister()) { |
| if (destination.IsRegister()) { |
| __ mov(destination.reg(), ShifterOperand(source.reg())); |
| } else { |
| ASSERT(destination.IsStackSlot()); |
| __ str(source.reg(), destination.ToStackSlotAddress()); |
| } |
| } else if (source.IsStackSlot()) { |
| if (destination.IsRegister()) { |
| __ ldr(destination.reg(), source.ToStackSlotAddress()); |
| } else { |
| ASSERT(destination.IsStackSlot()); |
| MoveMemoryToMemory(destination.ToStackSlotAddress(), |
| source.ToStackSlotAddress()); |
| } |
| } else if (source.IsFpuRegister()) { |
| if (destination.IsFpuRegister()) { |
| __ vmovd(destination.fpu_reg(), source.fpu_reg()); |
| } else { |
| if (destination.IsDoubleStackSlot()) { |
| __ vstrd(source.fpu_reg(), destination.ToStackSlotAddress()); |
| } else { |
| ASSERT(destination.IsQuadStackSlot()); |
| UNIMPLEMENTED(); |
| } |
| } |
| } else if (source.IsDoubleStackSlot()) { |
| if (destination.IsFpuRegister()) { |
| __ vldrd(destination.fpu_reg(), source.ToStackSlotAddress()); |
| } else { |
| ASSERT(destination.IsDoubleStackSlot()); |
| __ vldrd(FpuTMP, source.ToStackSlotAddress()); |
| __ vstrd(FpuTMP, destination.ToStackSlotAddress()); |
| } |
| } else if (source.IsQuadStackSlot()) { |
| UNIMPLEMENTED(); |
| } else { |
| ASSERT(source.IsConstant()); |
| if (destination.IsRegister()) { |
| const Object& constant = source.constant(); |
| __ LoadObject(destination.reg(), constant); |
| } else { |
| ASSERT(destination.IsStackSlot()); |
| StoreObject(destination.ToStackSlotAddress(), source.constant()); |
| } |
| } |
| |
| move->Eliminate(); |
| } |
| |
| |
| void ParallelMoveResolver::EmitSwap(int index) { |
| MoveOperands* move = moves_[index]; |
| const Location source = move->src(); |
| const Location destination = move->dest(); |
| |
| if (source.IsRegister() && destination.IsRegister()) { |
| ASSERT(source.reg() != IP); |
| ASSERT(destination.reg() != IP); |
| __ mov(IP, ShifterOperand(source.reg())); |
| __ mov(source.reg(), ShifterOperand(destination.reg())); |
| __ mov(destination.reg(), ShifterOperand(IP)); |
| } else if (source.IsRegister() && destination.IsStackSlot()) { |
| Exchange(source.reg(), destination.ToStackSlotAddress()); |
| } else if (source.IsStackSlot() && destination.IsRegister()) { |
| Exchange(destination.reg(), source.ToStackSlotAddress()); |
| } else if (source.IsStackSlot() && destination.IsStackSlot()) { |
| Exchange(destination.ToStackSlotAddress(), source.ToStackSlotAddress()); |
| } else if (source.IsFpuRegister() && destination.IsFpuRegister()) { |
| __ vmovd(FpuTMP, source.fpu_reg()); |
| __ vmovd(source.fpu_reg(), destination.fpu_reg()); |
| __ vmovd(destination.fpu_reg(), FpuTMP); |
| } else if (source.IsFpuRegister() || destination.IsFpuRegister()) { |
| ASSERT(destination.IsDoubleStackSlot() || |
| destination.IsQuadStackSlot() || |
| source.IsDoubleStackSlot() || |
| source.IsQuadStackSlot()); |
| bool double_width = destination.IsDoubleStackSlot() || |
| source.IsDoubleStackSlot(); |
| DRegister reg = source.IsFpuRegister() ? source.fpu_reg() |
| : destination.fpu_reg(); |
| const Address& slot_address = source.IsFpuRegister() |
| ? destination.ToStackSlotAddress() |
| : source.ToStackSlotAddress(); |
| |
| if (double_width) { |
| __ vldrd(FpuTMP, slot_address); |
| __ vstrd(reg, slot_address); |
| __ vmovd(reg, FpuTMP); |
| } else { |
| UNIMPLEMENTED(); |
| } |
| } else if (source.IsDoubleStackSlot() && destination.IsDoubleStackSlot()) { |
| const Address& source_slot_address = source.ToStackSlotAddress(); |
| const Address& destination_slot_address = destination.ToStackSlotAddress(); |
| |
| ScratchFpuRegisterScope ensure_scratch(this, FpuTMP); |
| __ vldrd(FpuTMP, source_slot_address); |
| __ vldrd(ensure_scratch.reg(), destination_slot_address); |
| __ vstrd(FpuTMP, destination_slot_address); |
| __ vstrd(ensure_scratch.reg(), source_slot_address); |
| } else if (source.IsQuadStackSlot() && destination.IsQuadStackSlot()) { |
| UNIMPLEMENTED(); |
| } else { |
| UNREACHABLE(); |
| } |
| |
| // The swap of source and destination has executed a move from source to |
| // destination. |
| move->Eliminate(); |
| |
| // Any unperformed (including pending) move with a source of either |
| // this move's source or destination needs to have their source |
| // changed to reflect the state of affairs after the swap. |
| for (int i = 0; i < moves_.length(); ++i) { |
| const MoveOperands& other_move = *moves_[i]; |
| if (other_move.Blocks(source)) { |
| moves_[i]->set_src(destination); |
| } else if (other_move.Blocks(destination)) { |
| moves_[i]->set_src(source); |
| } |
| } |
| } |
| |
| |
| void ParallelMoveResolver::MoveMemoryToMemory(const Address& dst, |
| const Address& src) { |
| __ ldr(IP, src); |
| __ str(IP, dst); |
| } |
| |
| |
| void ParallelMoveResolver::StoreObject(const Address& dst, const Object& obj) { |
| __ LoadObject(IP, obj); |
| __ str(IP, dst); |
| } |
| |
| |
| void ParallelMoveResolver::Exchange(Register reg, const Address& mem) { |
| ASSERT(reg != IP); |
| __ mov(IP, ShifterOperand(reg)); |
| __ ldr(reg, mem); |
| __ str(IP, mem); |
| } |
| |
| |
| void ParallelMoveResolver::Exchange(const Address& mem1, const Address& mem2) { |
| ScratchRegisterScope ensure_scratch(this, IP); |
| __ ldr(ensure_scratch.reg(), mem1); |
| __ ldr(IP, mem2); |
| __ str(ensure_scratch.reg(), mem2); |
| __ str(IP, mem1); |
| } |
| |
| |
| void ParallelMoveResolver::SpillScratch(Register reg) { |
| __ Push(reg); |
| } |
| |
| |
| void ParallelMoveResolver::RestoreScratch(Register reg) { |
| __ Pop(reg); |
| } |
| |
| |
| void ParallelMoveResolver::SpillFpuScratch(FpuRegister reg) { |
| __ vstrd(reg, Address(SP, -kDoubleSize, Address::PreIndex)); |
| } |
| |
| |
| void ParallelMoveResolver::RestoreFpuScratch(FpuRegister reg) { |
| __ vldrd(reg, Address(SP, kDoubleSize, Address::PostIndex)); |
| } |
| |
| |
| #undef __ |
| |
| } // namespace dart |
| |
| #endif // defined TARGET_ARCH_ARM |
