|  | /* | 
|  | * Copyright (C) 2014 The Android Open Source Project | 
|  | * | 
|  | * Licensed under the Apache License, Version 2.0 (the "License"); | 
|  | * you may not use this file except in compliance with the License. | 
|  | * You may obtain a copy of the License at | 
|  | * | 
|  | *      http://www.apache.org/licenses/LICENSE-2.0 | 
|  | * | 
|  | * Unless required by applicable law or agreed to in writing, software | 
|  | * distributed under the License is distributed on an "AS IS" BASIS, | 
|  | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | 
|  | * See the License for the specific language governing permissions and | 
|  | * limitations under the License. | 
|  | */ | 
|  |  | 
|  | #include "code_generator_arm.h" | 
|  |  | 
|  | #include "arch/arm/instruction_set_features_arm.h" | 
|  | #include "art_method.h" | 
|  | #include "code_generator_utils.h" | 
|  | #include "compiled_method.h" | 
|  | #include "entrypoints/quick/quick_entrypoints.h" | 
|  | #include "gc/accounting/card_table.h" | 
|  | #include "intrinsics.h" | 
|  | #include "intrinsics_arm.h" | 
|  | #include "mirror/array-inl.h" | 
|  | #include "mirror/class-inl.h" | 
|  | #include "thread.h" | 
|  | #include "utils/arm/assembler_arm.h" | 
|  | #include "utils/arm/managed_register_arm.h" | 
|  | #include "utils/assembler.h" | 
|  | #include "utils/stack_checks.h" | 
|  |  | 
|  | namespace art { | 
|  |  | 
|  | namespace arm { | 
|  |  | 
|  | static bool ExpectedPairLayout(Location location) { | 
|  | // We expected this for both core and fpu register pairs. | 
|  | return ((location.low() & 1) == 0) && (location.low() + 1 == location.high()); | 
|  | } | 
|  |  | 
|  | static constexpr int kCurrentMethodStackOffset = 0; | 
|  | static constexpr Register kMethodRegisterArgument = R0; | 
|  |  | 
|  | // We unconditionally allocate R5 to ensure we can do long operations | 
|  | // with baseline. | 
|  | static constexpr Register kCoreSavedRegisterForBaseline = R5; | 
|  | static constexpr Register kCoreCalleeSaves[] = | 
|  | { R5, R6, R7, R8, R10, R11, LR }; | 
|  | static constexpr SRegister kFpuCalleeSaves[] = | 
|  | { S16, S17, S18, S19, S20, S21, S22, S23, S24, S25, S26, S27, S28, S29, S30, S31 }; | 
|  |  | 
|  | // D31 cannot be split into two S registers, and the register allocator only works on | 
|  | // S registers. Therefore there is no need to block it. | 
|  | static constexpr DRegister DTMP = D31; | 
|  |  | 
|  | #define __ down_cast<ArmAssembler*>(codegen->GetAssembler())-> | 
|  | #define QUICK_ENTRY_POINT(x) QUICK_ENTRYPOINT_OFFSET(kArmWordSize, x).Int32Value() | 
|  |  | 
|  | class NullCheckSlowPathARM : public SlowPathCode { | 
|  | public: | 
|  | explicit NullCheckSlowPathARM(HNullCheck* instruction) : instruction_(instruction) {} | 
|  |  | 
|  | void EmitNativeCode(CodeGenerator* codegen) OVERRIDE { | 
|  | CodeGeneratorARM* arm_codegen = down_cast<CodeGeneratorARM*>(codegen); | 
|  | __ Bind(GetEntryLabel()); | 
|  | if (instruction_->CanThrowIntoCatchBlock()) { | 
|  | // Live registers will be restored in the catch block if caught. | 
|  | SaveLiveRegisters(codegen, instruction_->GetLocations()); | 
|  | } | 
|  | arm_codegen->InvokeRuntime( | 
|  | QUICK_ENTRY_POINT(pThrowNullPointer), instruction_, instruction_->GetDexPc(), this); | 
|  | } | 
|  |  | 
|  | bool IsFatal() const OVERRIDE { return true; } | 
|  |  | 
|  | const char* GetDescription() const OVERRIDE { return "NullCheckSlowPathARM"; } | 
|  |  | 
|  | private: | 
|  | HNullCheck* const instruction_; | 
|  | DISALLOW_COPY_AND_ASSIGN(NullCheckSlowPathARM); | 
|  | }; | 
|  |  | 
|  | class DivZeroCheckSlowPathARM : public SlowPathCode { | 
|  | public: | 
|  | explicit DivZeroCheckSlowPathARM(HDivZeroCheck* instruction) : instruction_(instruction) {} | 
|  |  | 
|  | void EmitNativeCode(CodeGenerator* codegen) OVERRIDE { | 
|  | CodeGeneratorARM* arm_codegen = down_cast<CodeGeneratorARM*>(codegen); | 
|  | __ Bind(GetEntryLabel()); | 
|  | if (instruction_->CanThrowIntoCatchBlock()) { | 
|  | // Live registers will be restored in the catch block if caught. | 
|  | SaveLiveRegisters(codegen, instruction_->GetLocations()); | 
|  | } | 
|  | arm_codegen->InvokeRuntime( | 
|  | QUICK_ENTRY_POINT(pThrowDivZero), instruction_, instruction_->GetDexPc(), this); | 
|  | } | 
|  |  | 
|  | bool IsFatal() const OVERRIDE { return true; } | 
|  |  | 
|  | const char* GetDescription() const OVERRIDE { return "DivZeroCheckSlowPathARM"; } | 
|  |  | 
|  | private: | 
|  | HDivZeroCheck* const instruction_; | 
|  | DISALLOW_COPY_AND_ASSIGN(DivZeroCheckSlowPathARM); | 
|  | }; | 
|  |  | 
|  | class SuspendCheckSlowPathARM : public SlowPathCode { | 
|  | public: | 
|  | SuspendCheckSlowPathARM(HSuspendCheck* instruction, HBasicBlock* successor) | 
|  | : instruction_(instruction), successor_(successor) {} | 
|  |  | 
|  | void EmitNativeCode(CodeGenerator* codegen) OVERRIDE { | 
|  | CodeGeneratorARM* arm_codegen = down_cast<CodeGeneratorARM*>(codegen); | 
|  | __ Bind(GetEntryLabel()); | 
|  | SaveLiveRegisters(codegen, instruction_->GetLocations()); | 
|  | arm_codegen->InvokeRuntime( | 
|  | QUICK_ENTRY_POINT(pTestSuspend), instruction_, instruction_->GetDexPc(), this); | 
|  | RestoreLiveRegisters(codegen, instruction_->GetLocations()); | 
|  | if (successor_ == nullptr) { | 
|  | __ b(GetReturnLabel()); | 
|  | } else { | 
|  | __ b(arm_codegen->GetLabelOf(successor_)); | 
|  | } | 
|  | } | 
|  |  | 
|  | Label* GetReturnLabel() { | 
|  | DCHECK(successor_ == nullptr); | 
|  | return &return_label_; | 
|  | } | 
|  |  | 
|  | HBasicBlock* GetSuccessor() const { | 
|  | return successor_; | 
|  | } | 
|  |  | 
|  | const char* GetDescription() const OVERRIDE { return "SuspendCheckSlowPathARM"; } | 
|  |  | 
|  | private: | 
|  | HSuspendCheck* const instruction_; | 
|  | // If not null, the block to branch to after the suspend check. | 
|  | HBasicBlock* const successor_; | 
|  |  | 
|  | // If `successor_` is null, the label to branch to after the suspend check. | 
|  | Label return_label_; | 
|  |  | 
|  | DISALLOW_COPY_AND_ASSIGN(SuspendCheckSlowPathARM); | 
|  | }; | 
|  |  | 
|  | class BoundsCheckSlowPathARM : public SlowPathCode { | 
|  | public: | 
|  | explicit BoundsCheckSlowPathARM(HBoundsCheck* instruction) | 
|  | : instruction_(instruction) {} | 
|  |  | 
|  | void EmitNativeCode(CodeGenerator* codegen) OVERRIDE { | 
|  | CodeGeneratorARM* arm_codegen = down_cast<CodeGeneratorARM*>(codegen); | 
|  | LocationSummary* locations = instruction_->GetLocations(); | 
|  |  | 
|  | __ Bind(GetEntryLabel()); | 
|  | if (instruction_->CanThrowIntoCatchBlock()) { | 
|  | // Live registers will be restored in the catch block if caught. | 
|  | SaveLiveRegisters(codegen, instruction_->GetLocations()); | 
|  | } | 
|  | // We're moving two locations to locations that could overlap, so we need a parallel | 
|  | // move resolver. | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | codegen->EmitParallelMoves( | 
|  | locations->InAt(0), | 
|  | Location::RegisterLocation(calling_convention.GetRegisterAt(0)), | 
|  | Primitive::kPrimInt, | 
|  | locations->InAt(1), | 
|  | Location::RegisterLocation(calling_convention.GetRegisterAt(1)), | 
|  | Primitive::kPrimInt); | 
|  | arm_codegen->InvokeRuntime( | 
|  | QUICK_ENTRY_POINT(pThrowArrayBounds), instruction_, instruction_->GetDexPc(), this); | 
|  | } | 
|  |  | 
|  | bool IsFatal() const OVERRIDE { return true; } | 
|  |  | 
|  | const char* GetDescription() const OVERRIDE { return "BoundsCheckSlowPathARM"; } | 
|  |  | 
|  | private: | 
|  | HBoundsCheck* const instruction_; | 
|  |  | 
|  | DISALLOW_COPY_AND_ASSIGN(BoundsCheckSlowPathARM); | 
|  | }; | 
|  |  | 
|  | class LoadClassSlowPathARM : public SlowPathCode { | 
|  | public: | 
|  | LoadClassSlowPathARM(HLoadClass* cls, | 
|  | HInstruction* at, | 
|  | uint32_t dex_pc, | 
|  | bool do_clinit) | 
|  | : cls_(cls), at_(at), dex_pc_(dex_pc), do_clinit_(do_clinit) { | 
|  | DCHECK(at->IsLoadClass() || at->IsClinitCheck()); | 
|  | } | 
|  |  | 
|  | void EmitNativeCode(CodeGenerator* codegen) OVERRIDE { | 
|  | LocationSummary* locations = at_->GetLocations(); | 
|  |  | 
|  | CodeGeneratorARM* arm_codegen = down_cast<CodeGeneratorARM*>(codegen); | 
|  | __ Bind(GetEntryLabel()); | 
|  | SaveLiveRegisters(codegen, locations); | 
|  |  | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | __ LoadImmediate(calling_convention.GetRegisterAt(0), cls_->GetTypeIndex()); | 
|  | int32_t entry_point_offset = do_clinit_ | 
|  | ? QUICK_ENTRY_POINT(pInitializeStaticStorage) | 
|  | : QUICK_ENTRY_POINT(pInitializeType); | 
|  | arm_codegen->InvokeRuntime(entry_point_offset, at_, dex_pc_, this); | 
|  |  | 
|  | // Move the class to the desired location. | 
|  | Location out = locations->Out(); | 
|  | if (out.IsValid()) { | 
|  | DCHECK(out.IsRegister() && !locations->GetLiveRegisters()->ContainsCoreRegister(out.reg())); | 
|  | arm_codegen->Move32(locations->Out(), Location::RegisterLocation(R0)); | 
|  | } | 
|  | RestoreLiveRegisters(codegen, locations); | 
|  | __ b(GetExitLabel()); | 
|  | } | 
|  |  | 
|  | const char* GetDescription() const OVERRIDE { return "LoadClassSlowPathARM"; } | 
|  |  | 
|  | private: | 
|  | // The class this slow path will load. | 
|  | HLoadClass* const cls_; | 
|  |  | 
|  | // The instruction where this slow path is happening. | 
|  | // (Might be the load class or an initialization check). | 
|  | HInstruction* const at_; | 
|  |  | 
|  | // The dex PC of `at_`. | 
|  | const uint32_t dex_pc_; | 
|  |  | 
|  | // Whether to initialize the class. | 
|  | const bool do_clinit_; | 
|  |  | 
|  | DISALLOW_COPY_AND_ASSIGN(LoadClassSlowPathARM); | 
|  | }; | 
|  |  | 
|  | class LoadStringSlowPathARM : public SlowPathCode { | 
|  | public: | 
|  | explicit LoadStringSlowPathARM(HLoadString* instruction) : instruction_(instruction) {} | 
|  |  | 
|  | void EmitNativeCode(CodeGenerator* codegen) OVERRIDE { | 
|  | LocationSummary* locations = instruction_->GetLocations(); | 
|  | DCHECK(!locations->GetLiveRegisters()->ContainsCoreRegister(locations->Out().reg())); | 
|  |  | 
|  | CodeGeneratorARM* arm_codegen = down_cast<CodeGeneratorARM*>(codegen); | 
|  | __ Bind(GetEntryLabel()); | 
|  | SaveLiveRegisters(codegen, locations); | 
|  |  | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | __ LoadImmediate(calling_convention.GetRegisterAt(0), instruction_->GetStringIndex()); | 
|  | arm_codegen->InvokeRuntime( | 
|  | QUICK_ENTRY_POINT(pResolveString), instruction_, instruction_->GetDexPc(), this); | 
|  | arm_codegen->Move32(locations->Out(), Location::RegisterLocation(R0)); | 
|  |  | 
|  | RestoreLiveRegisters(codegen, locations); | 
|  | __ b(GetExitLabel()); | 
|  | } | 
|  |  | 
|  | const char* GetDescription() const OVERRIDE { return "LoadStringSlowPathARM"; } | 
|  |  | 
|  | private: | 
|  | HLoadString* const instruction_; | 
|  |  | 
|  | DISALLOW_COPY_AND_ASSIGN(LoadStringSlowPathARM); | 
|  | }; | 
|  |  | 
|  | class TypeCheckSlowPathARM : public SlowPathCode { | 
|  | public: | 
|  | TypeCheckSlowPathARM(HInstruction* instruction, bool is_fatal) | 
|  | : instruction_(instruction), is_fatal_(is_fatal) {} | 
|  |  | 
|  | void EmitNativeCode(CodeGenerator* codegen) OVERRIDE { | 
|  | LocationSummary* locations = instruction_->GetLocations(); | 
|  | Location object_class = instruction_->IsCheckCast() ? locations->GetTemp(0) | 
|  | : locations->Out(); | 
|  | DCHECK(instruction_->IsCheckCast() | 
|  | || !locations->GetLiveRegisters()->ContainsCoreRegister(locations->Out().reg())); | 
|  |  | 
|  | CodeGeneratorARM* arm_codegen = down_cast<CodeGeneratorARM*>(codegen); | 
|  | __ Bind(GetEntryLabel()); | 
|  |  | 
|  | if (instruction_->IsCheckCast()) { | 
|  | // The codegen for the instruction overwrites `temp`, so put it back in place. | 
|  | Register obj = locations->InAt(0).AsRegister<Register>(); | 
|  | Register temp = locations->GetTemp(0).AsRegister<Register>(); | 
|  | uint32_t class_offset = mirror::Object::ClassOffset().Int32Value(); | 
|  | __ LoadFromOffset(kLoadWord, temp, obj, class_offset); | 
|  | __ MaybeUnpoisonHeapReference(temp); | 
|  | } | 
|  |  | 
|  | if (!is_fatal_) { | 
|  | SaveLiveRegisters(codegen, locations); | 
|  | } | 
|  |  | 
|  | // We're moving two locations to locations that could overlap, so we need a parallel | 
|  | // move resolver. | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | codegen->EmitParallelMoves( | 
|  | locations->InAt(1), | 
|  | Location::RegisterLocation(calling_convention.GetRegisterAt(0)), | 
|  | Primitive::kPrimNot, | 
|  | object_class, | 
|  | Location::RegisterLocation(calling_convention.GetRegisterAt(1)), | 
|  | Primitive::kPrimNot); | 
|  |  | 
|  | if (instruction_->IsInstanceOf()) { | 
|  | arm_codegen->InvokeRuntime(QUICK_ENTRY_POINT(pInstanceofNonTrivial), | 
|  | instruction_, | 
|  | instruction_->GetDexPc(), | 
|  | this); | 
|  | arm_codegen->Move32(locations->Out(), Location::RegisterLocation(R0)); | 
|  | } else { | 
|  | DCHECK(instruction_->IsCheckCast()); | 
|  | arm_codegen->InvokeRuntime(QUICK_ENTRY_POINT(pCheckCast), | 
|  | instruction_, | 
|  | instruction_->GetDexPc(), | 
|  | this); | 
|  | } | 
|  |  | 
|  | if (!is_fatal_) { | 
|  | RestoreLiveRegisters(codegen, locations); | 
|  | __ b(GetExitLabel()); | 
|  | } | 
|  | } | 
|  |  | 
|  | const char* GetDescription() const OVERRIDE { return "TypeCheckSlowPathARM"; } | 
|  |  | 
|  | bool IsFatal() const OVERRIDE { return is_fatal_; } | 
|  |  | 
|  | private: | 
|  | HInstruction* const instruction_; | 
|  | const bool is_fatal_; | 
|  |  | 
|  | DISALLOW_COPY_AND_ASSIGN(TypeCheckSlowPathARM); | 
|  | }; | 
|  |  | 
|  | class DeoptimizationSlowPathARM : public SlowPathCode { | 
|  | public: | 
|  | explicit DeoptimizationSlowPathARM(HInstruction* instruction) | 
|  | : instruction_(instruction) {} | 
|  |  | 
|  | void EmitNativeCode(CodeGenerator* codegen) OVERRIDE { | 
|  | __ Bind(GetEntryLabel()); | 
|  | SaveLiveRegisters(codegen, instruction_->GetLocations()); | 
|  | DCHECK(instruction_->IsDeoptimize()); | 
|  | HDeoptimize* deoptimize = instruction_->AsDeoptimize(); | 
|  | uint32_t dex_pc = deoptimize->GetDexPc(); | 
|  | CodeGeneratorARM* arm_codegen = down_cast<CodeGeneratorARM*>(codegen); | 
|  | arm_codegen->InvokeRuntime(QUICK_ENTRY_POINT(pDeoptimize), instruction_, dex_pc, this); | 
|  | } | 
|  |  | 
|  | const char* GetDescription() const OVERRIDE { return "DeoptimizationSlowPathARM"; } | 
|  |  | 
|  | private: | 
|  | HInstruction* const instruction_; | 
|  | DISALLOW_COPY_AND_ASSIGN(DeoptimizationSlowPathARM); | 
|  | }; | 
|  |  | 
|  | class ArraySetSlowPathARM : public SlowPathCode { | 
|  | public: | 
|  | explicit ArraySetSlowPathARM(HInstruction* instruction) : instruction_(instruction) {} | 
|  |  | 
|  | void EmitNativeCode(CodeGenerator* codegen) OVERRIDE { | 
|  | LocationSummary* locations = instruction_->GetLocations(); | 
|  | __ Bind(GetEntryLabel()); | 
|  | SaveLiveRegisters(codegen, locations); | 
|  |  | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | HParallelMove parallel_move(codegen->GetGraph()->GetArena()); | 
|  | parallel_move.AddMove( | 
|  | locations->InAt(0), | 
|  | Location::RegisterLocation(calling_convention.GetRegisterAt(0)), | 
|  | Primitive::kPrimNot, | 
|  | nullptr); | 
|  | parallel_move.AddMove( | 
|  | locations->InAt(1), | 
|  | Location::RegisterLocation(calling_convention.GetRegisterAt(1)), | 
|  | Primitive::kPrimInt, | 
|  | nullptr); | 
|  | parallel_move.AddMove( | 
|  | locations->InAt(2), | 
|  | Location::RegisterLocation(calling_convention.GetRegisterAt(2)), | 
|  | Primitive::kPrimNot, | 
|  | nullptr); | 
|  | codegen->GetMoveResolver()->EmitNativeCode(¶llel_move); | 
|  |  | 
|  | CodeGeneratorARM* arm_codegen = down_cast<CodeGeneratorARM*>(codegen); | 
|  | arm_codegen->InvokeRuntime(QUICK_ENTRY_POINT(pAputObject), | 
|  | instruction_, | 
|  | instruction_->GetDexPc(), | 
|  | this); | 
|  | RestoreLiveRegisters(codegen, locations); | 
|  | __ b(GetExitLabel()); | 
|  | } | 
|  |  | 
|  | const char* GetDescription() const OVERRIDE { return "ArraySetSlowPathARM"; } | 
|  |  | 
|  | private: | 
|  | HInstruction* const instruction_; | 
|  |  | 
|  | DISALLOW_COPY_AND_ASSIGN(ArraySetSlowPathARM); | 
|  | }; | 
|  |  | 
|  | #undef __ | 
|  | #define __ down_cast<ArmAssembler*>(GetAssembler())-> | 
|  |  | 
|  | inline Condition ARMSignedOrFPCondition(IfCondition cond) { | 
|  | switch (cond) { | 
|  | case kCondEQ: return EQ; | 
|  | case kCondNE: return NE; | 
|  | case kCondLT: return LT; | 
|  | case kCondLE: return LE; | 
|  | case kCondGT: return GT; | 
|  | case kCondGE: return GE; | 
|  | } | 
|  | LOG(FATAL) << "Unreachable"; | 
|  | UNREACHABLE(); | 
|  | } | 
|  |  | 
|  | inline Condition ARMUnsignedCondition(IfCondition cond) { | 
|  | switch (cond) { | 
|  | case kCondEQ: return EQ; | 
|  | case kCondNE: return NE; | 
|  | case kCondLT: return LO; | 
|  | case kCondLE: return LS; | 
|  | case kCondGT: return HI; | 
|  | case kCondGE: return HS; | 
|  | } | 
|  | LOG(FATAL) << "Unreachable"; | 
|  | UNREACHABLE(); | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::DumpCoreRegister(std::ostream& stream, int reg) const { | 
|  | stream << Register(reg); | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::DumpFloatingPointRegister(std::ostream& stream, int reg) const { | 
|  | stream << SRegister(reg); | 
|  | } | 
|  |  | 
|  | size_t CodeGeneratorARM::SaveCoreRegister(size_t stack_index, uint32_t reg_id) { | 
|  | __ StoreToOffset(kStoreWord, static_cast<Register>(reg_id), SP, stack_index); | 
|  | return kArmWordSize; | 
|  | } | 
|  |  | 
|  | size_t CodeGeneratorARM::RestoreCoreRegister(size_t stack_index, uint32_t reg_id) { | 
|  | __ LoadFromOffset(kLoadWord, static_cast<Register>(reg_id), SP, stack_index); | 
|  | return kArmWordSize; | 
|  | } | 
|  |  | 
|  | size_t CodeGeneratorARM::SaveFloatingPointRegister(size_t stack_index, uint32_t reg_id) { | 
|  | __ StoreSToOffset(static_cast<SRegister>(reg_id), SP, stack_index); | 
|  | return kArmWordSize; | 
|  | } | 
|  |  | 
|  | size_t CodeGeneratorARM::RestoreFloatingPointRegister(size_t stack_index, uint32_t reg_id) { | 
|  | __ LoadSFromOffset(static_cast<SRegister>(reg_id), SP, stack_index); | 
|  | return kArmWordSize; | 
|  | } | 
|  |  | 
|  | CodeGeneratorARM::CodeGeneratorARM(HGraph* graph, | 
|  | const ArmInstructionSetFeatures& isa_features, | 
|  | const CompilerOptions& compiler_options, | 
|  | OptimizingCompilerStats* stats) | 
|  | : CodeGenerator(graph, | 
|  | kNumberOfCoreRegisters, | 
|  | kNumberOfSRegisters, | 
|  | kNumberOfRegisterPairs, | 
|  | ComputeRegisterMask(reinterpret_cast<const int*>(kCoreCalleeSaves), | 
|  | arraysize(kCoreCalleeSaves)), | 
|  | ComputeRegisterMask(reinterpret_cast<const int*>(kFpuCalleeSaves), | 
|  | arraysize(kFpuCalleeSaves)), | 
|  | compiler_options, | 
|  | stats), | 
|  | block_labels_(nullptr), | 
|  | location_builder_(graph, this), | 
|  | instruction_visitor_(graph, this), | 
|  | move_resolver_(graph->GetArena(), this), | 
|  | assembler_(), | 
|  | isa_features_(isa_features), | 
|  | method_patches_(MethodReferenceComparator(), | 
|  | graph->GetArena()->Adapter(kArenaAllocCodeGenerator)), | 
|  | call_patches_(MethodReferenceComparator(), | 
|  | graph->GetArena()->Adapter(kArenaAllocCodeGenerator)), | 
|  | relative_call_patches_(graph->GetArena()->Adapter(kArenaAllocCodeGenerator)) { | 
|  | // Always save the LR register to mimic Quick. | 
|  | AddAllocatedRegister(Location::RegisterLocation(LR)); | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::Finalize(CodeAllocator* allocator) { | 
|  | // Ensure that we fix up branches and literal loads and emit the literal pool. | 
|  | __ FinalizeCode(); | 
|  |  | 
|  | // Adjust native pc offsets in stack maps. | 
|  | for (size_t i = 0, num = stack_map_stream_.GetNumberOfStackMaps(); i != num; ++i) { | 
|  | uint32_t old_position = stack_map_stream_.GetStackMap(i).native_pc_offset; | 
|  | uint32_t new_position = __ GetAdjustedPosition(old_position); | 
|  | stack_map_stream_.SetStackMapNativePcOffset(i, new_position); | 
|  | } | 
|  | // Adjust native pc offsets of block labels. | 
|  | for (HBasicBlock* block : *block_order_) { | 
|  | // Get the label directly from block_labels_ rather than through GetLabelOf() to avoid | 
|  | // FirstNonEmptyBlock() which could lead to adjusting a label more than once. | 
|  | DCHECK_LT(block->GetBlockId(), GetGraph()->GetBlocks().size()); | 
|  | Label* block_label = &block_labels_[block->GetBlockId()]; | 
|  | DCHECK_EQ(block_label->IsBound(), !block->IsSingleJump()); | 
|  | if (block_label->IsBound()) { | 
|  | __ AdjustLabelPosition(block_label); | 
|  | } | 
|  | } | 
|  | // Adjust pc offsets for the disassembly information. | 
|  | if (disasm_info_ != nullptr) { | 
|  | GeneratedCodeInterval* frame_entry_interval = disasm_info_->GetFrameEntryInterval(); | 
|  | frame_entry_interval->start = __ GetAdjustedPosition(frame_entry_interval->start); | 
|  | frame_entry_interval->end = __ GetAdjustedPosition(frame_entry_interval->end); | 
|  | for (auto& it : *disasm_info_->GetInstructionIntervals()) { | 
|  | it.second.start = __ GetAdjustedPosition(it.second.start); | 
|  | it.second.end = __ GetAdjustedPosition(it.second.end); | 
|  | } | 
|  | for (auto& it : *disasm_info_->GetSlowPathIntervals()) { | 
|  | it.code_interval.start = __ GetAdjustedPosition(it.code_interval.start); | 
|  | it.code_interval.end = __ GetAdjustedPosition(it.code_interval.end); | 
|  | } | 
|  | } | 
|  | // Adjust pc offsets for relative call patches. | 
|  | for (MethodPatchInfo<Label>& info : relative_call_patches_) { | 
|  | __ AdjustLabelPosition(&info.label); | 
|  | } | 
|  |  | 
|  | CodeGenerator::Finalize(allocator); | 
|  | } | 
|  |  | 
|  | Location CodeGeneratorARM::AllocateFreeRegister(Primitive::Type type) const { | 
|  | switch (type) { | 
|  | case Primitive::kPrimLong: { | 
|  | size_t reg = FindFreeEntry(blocked_register_pairs_, kNumberOfRegisterPairs); | 
|  | ArmManagedRegister pair = | 
|  | ArmManagedRegister::FromRegisterPair(static_cast<RegisterPair>(reg)); | 
|  | DCHECK(!blocked_core_registers_[pair.AsRegisterPairLow()]); | 
|  | DCHECK(!blocked_core_registers_[pair.AsRegisterPairHigh()]); | 
|  |  | 
|  | blocked_core_registers_[pair.AsRegisterPairLow()] = true; | 
|  | blocked_core_registers_[pair.AsRegisterPairHigh()] = true; | 
|  | UpdateBlockedPairRegisters(); | 
|  | return Location::RegisterPairLocation(pair.AsRegisterPairLow(), pair.AsRegisterPairHigh()); | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimBoolean: | 
|  | case Primitive::kPrimChar: | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimNot: { | 
|  | int reg = FindFreeEntry(blocked_core_registers_, kNumberOfCoreRegisters); | 
|  | // Block all register pairs that contain `reg`. | 
|  | for (int i = 0; i < kNumberOfRegisterPairs; i++) { | 
|  | ArmManagedRegister current = | 
|  | ArmManagedRegister::FromRegisterPair(static_cast<RegisterPair>(i)); | 
|  | if (current.AsRegisterPairLow() == reg || current.AsRegisterPairHigh() == reg) { | 
|  | blocked_register_pairs_[i] = true; | 
|  | } | 
|  | } | 
|  | return Location::RegisterLocation(reg); | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimFloat: { | 
|  | int reg = FindFreeEntry(blocked_fpu_registers_, kNumberOfSRegisters); | 
|  | return Location::FpuRegisterLocation(reg); | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimDouble: { | 
|  | int reg = FindTwoFreeConsecutiveAlignedEntries(blocked_fpu_registers_, kNumberOfSRegisters); | 
|  | DCHECK_EQ(reg % 2, 0); | 
|  | return Location::FpuRegisterPairLocation(reg, reg + 1); | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimVoid: | 
|  | LOG(FATAL) << "Unreachable type " << type; | 
|  | } | 
|  |  | 
|  | return Location(); | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::SetupBlockedRegisters(bool is_baseline) const { | 
|  | // Don't allocate the dalvik style register pair passing. | 
|  | blocked_register_pairs_[R1_R2] = true; | 
|  |  | 
|  | // Stack register, LR and PC are always reserved. | 
|  | blocked_core_registers_[SP] = true; | 
|  | blocked_core_registers_[LR] = true; | 
|  | blocked_core_registers_[PC] = true; | 
|  |  | 
|  | // Reserve thread register. | 
|  | blocked_core_registers_[TR] = true; | 
|  |  | 
|  | // Reserve temp register. | 
|  | blocked_core_registers_[IP] = true; | 
|  |  | 
|  | if (is_baseline) { | 
|  | for (size_t i = 0; i < arraysize(kCoreCalleeSaves); ++i) { | 
|  | blocked_core_registers_[kCoreCalleeSaves[i]] = true; | 
|  | } | 
|  |  | 
|  | blocked_core_registers_[kCoreSavedRegisterForBaseline] = false; | 
|  | } | 
|  |  | 
|  | if (is_baseline || GetGraph()->IsDebuggable()) { | 
|  | // Stubs do not save callee-save floating point registers. If the graph | 
|  | // is debuggable, we need to deal with these registers differently. For | 
|  | // now, just block them. | 
|  | for (size_t i = 0; i < arraysize(kFpuCalleeSaves); ++i) { | 
|  | blocked_fpu_registers_[kFpuCalleeSaves[i]] = true; | 
|  | } | 
|  | } | 
|  |  | 
|  | UpdateBlockedPairRegisters(); | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::UpdateBlockedPairRegisters() const { | 
|  | for (int i = 0; i < kNumberOfRegisterPairs; i++) { | 
|  | ArmManagedRegister current = | 
|  | ArmManagedRegister::FromRegisterPair(static_cast<RegisterPair>(i)); | 
|  | if (blocked_core_registers_[current.AsRegisterPairLow()] | 
|  | || blocked_core_registers_[current.AsRegisterPairHigh()]) { | 
|  | blocked_register_pairs_[i] = true; | 
|  | } | 
|  | } | 
|  | } | 
|  |  | 
|  | InstructionCodeGeneratorARM::InstructionCodeGeneratorARM(HGraph* graph, CodeGeneratorARM* codegen) | 
|  | : HGraphVisitor(graph), | 
|  | assembler_(codegen->GetAssembler()), | 
|  | codegen_(codegen) {} | 
|  |  | 
|  | void CodeGeneratorARM::ComputeSpillMask() { | 
|  | core_spill_mask_ = allocated_registers_.GetCoreRegisters() & core_callee_save_mask_; | 
|  | // Save one extra register for baseline. Note that on thumb2, there is no easy | 
|  | // instruction to restore just the PC, so this actually helps both baseline | 
|  | // and non-baseline to save and restore at least two registers at entry and exit. | 
|  | core_spill_mask_ |= (1 << kCoreSavedRegisterForBaseline); | 
|  | DCHECK_NE(core_spill_mask_, 0u) << "At least the return address register must be saved"; | 
|  | fpu_spill_mask_ = allocated_registers_.GetFloatingPointRegisters() & fpu_callee_save_mask_; | 
|  | // We use vpush and vpop for saving and restoring floating point registers, which take | 
|  | // a SRegister and the number of registers to save/restore after that SRegister. We | 
|  | // therefore update the `fpu_spill_mask_` to also contain those registers not allocated, | 
|  | // but in the range. | 
|  | if (fpu_spill_mask_ != 0) { | 
|  | uint32_t least_significant_bit = LeastSignificantBit(fpu_spill_mask_); | 
|  | uint32_t most_significant_bit = MostSignificantBit(fpu_spill_mask_); | 
|  | for (uint32_t i = least_significant_bit + 1 ; i < most_significant_bit; ++i) { | 
|  | fpu_spill_mask_ |= (1 << i); | 
|  | } | 
|  | } | 
|  | } | 
|  |  | 
|  | static dwarf::Reg DWARFReg(Register reg) { | 
|  | return dwarf::Reg::ArmCore(static_cast<int>(reg)); | 
|  | } | 
|  |  | 
|  | static dwarf::Reg DWARFReg(SRegister reg) { | 
|  | return dwarf::Reg::ArmFp(static_cast<int>(reg)); | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::GenerateFrameEntry() { | 
|  | bool skip_overflow_check = | 
|  | IsLeafMethod() && !FrameNeedsStackCheck(GetFrameSize(), InstructionSet::kArm); | 
|  | DCHECK(GetCompilerOptions().GetImplicitStackOverflowChecks()); | 
|  | __ Bind(&frame_entry_label_); | 
|  |  | 
|  | if (HasEmptyFrame()) { | 
|  | return; | 
|  | } | 
|  |  | 
|  | if (!skip_overflow_check) { | 
|  | __ AddConstant(IP, SP, -static_cast<int32_t>(GetStackOverflowReservedBytes(kArm))); | 
|  | __ LoadFromOffset(kLoadWord, IP, IP, 0); | 
|  | RecordPcInfo(nullptr, 0); | 
|  | } | 
|  |  | 
|  | __ PushList(core_spill_mask_); | 
|  | __ cfi().AdjustCFAOffset(kArmWordSize * POPCOUNT(core_spill_mask_)); | 
|  | __ cfi().RelOffsetForMany(DWARFReg(kMethodRegisterArgument), 0, core_spill_mask_, kArmWordSize); | 
|  | if (fpu_spill_mask_ != 0) { | 
|  | SRegister start_register = SRegister(LeastSignificantBit(fpu_spill_mask_)); | 
|  | __ vpushs(start_register, POPCOUNT(fpu_spill_mask_)); | 
|  | __ cfi().AdjustCFAOffset(kArmWordSize * POPCOUNT(fpu_spill_mask_)); | 
|  | __ cfi().RelOffsetForMany(DWARFReg(S0), 0, fpu_spill_mask_, kArmWordSize); | 
|  | } | 
|  | int adjust = GetFrameSize() - FrameEntrySpillSize(); | 
|  | __ AddConstant(SP, -adjust); | 
|  | __ cfi().AdjustCFAOffset(adjust); | 
|  | __ StoreToOffset(kStoreWord, kMethodRegisterArgument, SP, 0); | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::GenerateFrameExit() { | 
|  | if (HasEmptyFrame()) { | 
|  | __ bx(LR); | 
|  | return; | 
|  | } | 
|  | __ cfi().RememberState(); | 
|  | int adjust = GetFrameSize() - FrameEntrySpillSize(); | 
|  | __ AddConstant(SP, adjust); | 
|  | __ cfi().AdjustCFAOffset(-adjust); | 
|  | if (fpu_spill_mask_ != 0) { | 
|  | SRegister start_register = SRegister(LeastSignificantBit(fpu_spill_mask_)); | 
|  | __ vpops(start_register, POPCOUNT(fpu_spill_mask_)); | 
|  | __ cfi().AdjustCFAOffset(-kArmPointerSize * POPCOUNT(fpu_spill_mask_)); | 
|  | __ cfi().RestoreMany(DWARFReg(SRegister(0)), fpu_spill_mask_); | 
|  | } | 
|  | // Pop LR into PC to return. | 
|  | DCHECK_NE(core_spill_mask_ & (1 << LR), 0U); | 
|  | uint32_t pop_mask = (core_spill_mask_ & (~(1 << LR))) | 1 << PC; | 
|  | __ PopList(pop_mask); | 
|  | __ cfi().RestoreState(); | 
|  | __ cfi().DefCFAOffset(GetFrameSize()); | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::Bind(HBasicBlock* block) { | 
|  | __ Bind(GetLabelOf(block)); | 
|  | } | 
|  |  | 
|  | Location CodeGeneratorARM::GetStackLocation(HLoadLocal* load) const { | 
|  | switch (load->GetType()) { | 
|  | case Primitive::kPrimLong: | 
|  | case Primitive::kPrimDouble: | 
|  | return Location::DoubleStackSlot(GetStackSlot(load->GetLocal())); | 
|  |  | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimNot: | 
|  | case Primitive::kPrimFloat: | 
|  | return Location::StackSlot(GetStackSlot(load->GetLocal())); | 
|  |  | 
|  | case Primitive::kPrimBoolean: | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimChar: | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimVoid: | 
|  | LOG(FATAL) << "Unexpected type " << load->GetType(); | 
|  | UNREACHABLE(); | 
|  | } | 
|  |  | 
|  | LOG(FATAL) << "Unreachable"; | 
|  | UNREACHABLE(); | 
|  | } | 
|  |  | 
|  | Location InvokeDexCallingConventionVisitorARM::GetNextLocation(Primitive::Type type) { | 
|  | switch (type) { | 
|  | case Primitive::kPrimBoolean: | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimChar: | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimNot: { | 
|  | uint32_t index = gp_index_++; | 
|  | uint32_t stack_index = stack_index_++; | 
|  | if (index < calling_convention.GetNumberOfRegisters()) { | 
|  | return Location::RegisterLocation(calling_convention.GetRegisterAt(index)); | 
|  | } else { | 
|  | return Location::StackSlot(calling_convention.GetStackOffsetOf(stack_index)); | 
|  | } | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimLong: { | 
|  | uint32_t index = gp_index_; | 
|  | uint32_t stack_index = stack_index_; | 
|  | gp_index_ += 2; | 
|  | stack_index_ += 2; | 
|  | if (index + 1 < calling_convention.GetNumberOfRegisters()) { | 
|  | if (calling_convention.GetRegisterAt(index) == R1) { | 
|  | // Skip R1, and use R2_R3 instead. | 
|  | gp_index_++; | 
|  | index++; | 
|  | } | 
|  | } | 
|  | if (index + 1 < calling_convention.GetNumberOfRegisters()) { | 
|  | DCHECK_EQ(calling_convention.GetRegisterAt(index) + 1, | 
|  | calling_convention.GetRegisterAt(index + 1)); | 
|  |  | 
|  | return Location::RegisterPairLocation(calling_convention.GetRegisterAt(index), | 
|  | calling_convention.GetRegisterAt(index + 1)); | 
|  | } else { | 
|  | return Location::DoubleStackSlot(calling_convention.GetStackOffsetOf(stack_index)); | 
|  | } | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimFloat: { | 
|  | uint32_t stack_index = stack_index_++; | 
|  | if (float_index_ % 2 == 0) { | 
|  | float_index_ = std::max(double_index_, float_index_); | 
|  | } | 
|  | if (float_index_ < calling_convention.GetNumberOfFpuRegisters()) { | 
|  | return Location::FpuRegisterLocation(calling_convention.GetFpuRegisterAt(float_index_++)); | 
|  | } else { | 
|  | return Location::StackSlot(calling_convention.GetStackOffsetOf(stack_index)); | 
|  | } | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimDouble: { | 
|  | double_index_ = std::max(double_index_, RoundUp(float_index_, 2)); | 
|  | uint32_t stack_index = stack_index_; | 
|  | stack_index_ += 2; | 
|  | if (double_index_ + 1 < calling_convention.GetNumberOfFpuRegisters()) { | 
|  | uint32_t index = double_index_; | 
|  | double_index_ += 2; | 
|  | Location result = Location::FpuRegisterPairLocation( | 
|  | calling_convention.GetFpuRegisterAt(index), | 
|  | calling_convention.GetFpuRegisterAt(index + 1)); | 
|  | DCHECK(ExpectedPairLayout(result)); | 
|  | return result; | 
|  | } else { | 
|  | return Location::DoubleStackSlot(calling_convention.GetStackOffsetOf(stack_index)); | 
|  | } | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimVoid: | 
|  | LOG(FATAL) << "Unexpected parameter type " << type; | 
|  | break; | 
|  | } | 
|  | return Location(); | 
|  | } | 
|  |  | 
|  | Location InvokeDexCallingConventionVisitorARM::GetReturnLocation(Primitive::Type type) const { | 
|  | switch (type) { | 
|  | case Primitive::kPrimBoolean: | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimChar: | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimNot: { | 
|  | return Location::RegisterLocation(R0); | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimFloat: { | 
|  | return Location::FpuRegisterLocation(S0); | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimLong: { | 
|  | return Location::RegisterPairLocation(R0, R1); | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimDouble: { | 
|  | return Location::FpuRegisterPairLocation(S0, S1); | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimVoid: | 
|  | return Location(); | 
|  | } | 
|  |  | 
|  | UNREACHABLE(); | 
|  | } | 
|  |  | 
|  | Location InvokeDexCallingConventionVisitorARM::GetMethodLocation() const { | 
|  | return Location::RegisterLocation(kMethodRegisterArgument); | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::Move32(Location destination, Location source) { | 
|  | if (source.Equals(destination)) { | 
|  | return; | 
|  | } | 
|  | if (destination.IsRegister()) { | 
|  | if (source.IsRegister()) { | 
|  | __ Mov(destination.AsRegister<Register>(), source.AsRegister<Register>()); | 
|  | } else if (source.IsFpuRegister()) { | 
|  | __ vmovrs(destination.AsRegister<Register>(), source.AsFpuRegister<SRegister>()); | 
|  | } else { | 
|  | __ LoadFromOffset(kLoadWord, destination.AsRegister<Register>(), SP, source.GetStackIndex()); | 
|  | } | 
|  | } else if (destination.IsFpuRegister()) { | 
|  | if (source.IsRegister()) { | 
|  | __ vmovsr(destination.AsFpuRegister<SRegister>(), source.AsRegister<Register>()); | 
|  | } else if (source.IsFpuRegister()) { | 
|  | __ vmovs(destination.AsFpuRegister<SRegister>(), source.AsFpuRegister<SRegister>()); | 
|  | } else { | 
|  | __ LoadSFromOffset(destination.AsFpuRegister<SRegister>(), SP, source.GetStackIndex()); | 
|  | } | 
|  | } else { | 
|  | DCHECK(destination.IsStackSlot()) << destination; | 
|  | if (source.IsRegister()) { | 
|  | __ StoreToOffset(kStoreWord, source.AsRegister<Register>(), SP, destination.GetStackIndex()); | 
|  | } else if (source.IsFpuRegister()) { | 
|  | __ StoreSToOffset(source.AsFpuRegister<SRegister>(), SP, destination.GetStackIndex()); | 
|  | } else { | 
|  | DCHECK(source.IsStackSlot()) << source; | 
|  | __ LoadFromOffset(kLoadWord, IP, SP, source.GetStackIndex()); | 
|  | __ StoreToOffset(kStoreWord, IP, SP, destination.GetStackIndex()); | 
|  | } | 
|  | } | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::Move64(Location destination, Location source) { | 
|  | if (source.Equals(destination)) { | 
|  | return; | 
|  | } | 
|  | if (destination.IsRegisterPair()) { | 
|  | if (source.IsRegisterPair()) { | 
|  | EmitParallelMoves( | 
|  | Location::RegisterLocation(source.AsRegisterPairHigh<Register>()), | 
|  | Location::RegisterLocation(destination.AsRegisterPairHigh<Register>()), | 
|  | Primitive::kPrimInt, | 
|  | Location::RegisterLocation(source.AsRegisterPairLow<Register>()), | 
|  | Location::RegisterLocation(destination.AsRegisterPairLow<Register>()), | 
|  | Primitive::kPrimInt); | 
|  | } else if (source.IsFpuRegister()) { | 
|  | UNIMPLEMENTED(FATAL); | 
|  | } else if (source.IsFpuRegisterPair()) { | 
|  | __ vmovrrd(destination.AsRegisterPairLow<Register>(), | 
|  | destination.AsRegisterPairHigh<Register>(), | 
|  | FromLowSToD(source.AsFpuRegisterPairLow<SRegister>())); | 
|  | } else { | 
|  | DCHECK(source.IsDoubleStackSlot()); | 
|  | DCHECK(ExpectedPairLayout(destination)); | 
|  | __ LoadFromOffset(kLoadWordPair, destination.AsRegisterPairLow<Register>(), | 
|  | SP, source.GetStackIndex()); | 
|  | } | 
|  | } else if (destination.IsFpuRegisterPair()) { | 
|  | if (source.IsDoubleStackSlot()) { | 
|  | __ LoadDFromOffset(FromLowSToD(destination.AsFpuRegisterPairLow<SRegister>()), | 
|  | SP, | 
|  | source.GetStackIndex()); | 
|  | } else if (source.IsRegisterPair()) { | 
|  | __ vmovdrr(FromLowSToD(destination.AsFpuRegisterPairLow<SRegister>()), | 
|  | source.AsRegisterPairLow<Register>(), | 
|  | source.AsRegisterPairHigh<Register>()); | 
|  | } else { | 
|  | UNIMPLEMENTED(FATAL); | 
|  | } | 
|  | } else { | 
|  | DCHECK(destination.IsDoubleStackSlot()); | 
|  | if (source.IsRegisterPair()) { | 
|  | // No conflict possible, so just do the moves. | 
|  | if (source.AsRegisterPairLow<Register>() == R1) { | 
|  | DCHECK_EQ(source.AsRegisterPairHigh<Register>(), R2); | 
|  | __ StoreToOffset(kStoreWord, R1, SP, destination.GetStackIndex()); | 
|  | __ StoreToOffset(kStoreWord, R2, SP, destination.GetHighStackIndex(kArmWordSize)); | 
|  | } else { | 
|  | __ StoreToOffset(kStoreWordPair, source.AsRegisterPairLow<Register>(), | 
|  | SP, destination.GetStackIndex()); | 
|  | } | 
|  | } else if (source.IsFpuRegisterPair()) { | 
|  | __ StoreDToOffset(FromLowSToD(source.AsFpuRegisterPairLow<SRegister>()), | 
|  | SP, | 
|  | destination.GetStackIndex()); | 
|  | } else { | 
|  | DCHECK(source.IsDoubleStackSlot()); | 
|  | EmitParallelMoves( | 
|  | Location::StackSlot(source.GetStackIndex()), | 
|  | Location::StackSlot(destination.GetStackIndex()), | 
|  | Primitive::kPrimInt, | 
|  | Location::StackSlot(source.GetHighStackIndex(kArmWordSize)), | 
|  | Location::StackSlot(destination.GetHighStackIndex(kArmWordSize)), | 
|  | Primitive::kPrimInt); | 
|  | } | 
|  | } | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::Move(HInstruction* instruction, Location location, HInstruction* move_for) { | 
|  | LocationSummary* locations = instruction->GetLocations(); | 
|  | if (instruction->IsCurrentMethod()) { | 
|  | Move32(location, Location::StackSlot(kCurrentMethodStackOffset)); | 
|  | } else if (locations != nullptr && locations->Out().Equals(location)) { | 
|  | return; | 
|  | } else if (locations != nullptr && locations->Out().IsConstant()) { | 
|  | HConstant* const_to_move = locations->Out().GetConstant(); | 
|  | if (const_to_move->IsIntConstant() || const_to_move->IsNullConstant()) { | 
|  | int32_t value = GetInt32ValueOf(const_to_move); | 
|  | if (location.IsRegister()) { | 
|  | __ LoadImmediate(location.AsRegister<Register>(), value); | 
|  | } else { | 
|  | DCHECK(location.IsStackSlot()); | 
|  | __ LoadImmediate(IP, value); | 
|  | __ StoreToOffset(kStoreWord, IP, SP, location.GetStackIndex()); | 
|  | } | 
|  | } else { | 
|  | DCHECK(const_to_move->IsLongConstant()) << const_to_move->DebugName(); | 
|  | int64_t value = const_to_move->AsLongConstant()->GetValue(); | 
|  | if (location.IsRegisterPair()) { | 
|  | __ LoadImmediate(location.AsRegisterPairLow<Register>(), Low32Bits(value)); | 
|  | __ LoadImmediate(location.AsRegisterPairHigh<Register>(), High32Bits(value)); | 
|  | } else { | 
|  | DCHECK(location.IsDoubleStackSlot()); | 
|  | __ LoadImmediate(IP, Low32Bits(value)); | 
|  | __ StoreToOffset(kStoreWord, IP, SP, location.GetStackIndex()); | 
|  | __ LoadImmediate(IP, High32Bits(value)); | 
|  | __ StoreToOffset(kStoreWord, IP, SP, location.GetHighStackIndex(kArmWordSize)); | 
|  | } | 
|  | } | 
|  | } else if (instruction->IsLoadLocal()) { | 
|  | uint32_t stack_slot = GetStackSlot(instruction->AsLoadLocal()->GetLocal()); | 
|  | switch (instruction->GetType()) { | 
|  | case Primitive::kPrimBoolean: | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimChar: | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimNot: | 
|  | case Primitive::kPrimFloat: | 
|  | Move32(location, Location::StackSlot(stack_slot)); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimLong: | 
|  | case Primitive::kPrimDouble: | 
|  | Move64(location, Location::DoubleStackSlot(stack_slot)); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type " << instruction->GetType(); | 
|  | } | 
|  | } else if (instruction->IsTemporary()) { | 
|  | Location temp_location = GetTemporaryLocation(instruction->AsTemporary()); | 
|  | if (temp_location.IsStackSlot()) { | 
|  | Move32(location, temp_location); | 
|  | } else { | 
|  | DCHECK(temp_location.IsDoubleStackSlot()); | 
|  | Move64(location, temp_location); | 
|  | } | 
|  | } else { | 
|  | DCHECK((instruction->GetNext() == move_for) || instruction->GetNext()->IsTemporary()); | 
|  | switch (instruction->GetType()) { | 
|  | case Primitive::kPrimBoolean: | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimChar: | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimNot: | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimFloat: | 
|  | Move32(location, locations->Out()); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimLong: | 
|  | case Primitive::kPrimDouble: | 
|  | Move64(location, locations->Out()); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type " << instruction->GetType(); | 
|  | } | 
|  | } | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::MoveConstant(Location location, int32_t value) { | 
|  | DCHECK(location.IsRegister()); | 
|  | __ LoadImmediate(location.AsRegister<Register>(), value); | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::MoveLocation(Location dst, Location src, Primitive::Type dst_type) { | 
|  | if (Primitive::Is64BitType(dst_type)) { | 
|  | Move64(dst, src); | 
|  | } else { | 
|  | Move32(dst, src); | 
|  | } | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::AddLocationAsTemp(Location location, LocationSummary* locations) { | 
|  | if (location.IsRegister()) { | 
|  | locations->AddTemp(location); | 
|  | } else if (location.IsRegisterPair()) { | 
|  | locations->AddTemp(Location::RegisterLocation(location.AsRegisterPairLow<Register>())); | 
|  | locations->AddTemp(Location::RegisterLocation(location.AsRegisterPairHigh<Register>())); | 
|  | } else { | 
|  | UNIMPLEMENTED(FATAL) << "AddLocationAsTemp not implemented for location " << location; | 
|  | } | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::InvokeRuntime(QuickEntrypointEnum entrypoint, | 
|  | HInstruction* instruction, | 
|  | uint32_t dex_pc, | 
|  | SlowPathCode* slow_path) { | 
|  | InvokeRuntime(GetThreadOffset<kArmWordSize>(entrypoint).Int32Value(), | 
|  | instruction, | 
|  | dex_pc, | 
|  | slow_path); | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::InvokeRuntime(int32_t entry_point_offset, | 
|  | HInstruction* instruction, | 
|  | uint32_t dex_pc, | 
|  | SlowPathCode* slow_path) { | 
|  | ValidateInvokeRuntime(instruction, slow_path); | 
|  | __ LoadFromOffset(kLoadWord, LR, TR, entry_point_offset); | 
|  | __ blx(LR); | 
|  | RecordPcInfo(instruction, dex_pc, slow_path); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::HandleGoto(HInstruction* got, HBasicBlock* successor) { | 
|  | DCHECK(!successor->IsExitBlock()); | 
|  |  | 
|  | HBasicBlock* block = got->GetBlock(); | 
|  | HInstruction* previous = got->GetPrevious(); | 
|  |  | 
|  | HLoopInformation* info = block->GetLoopInformation(); | 
|  | if (info != nullptr && info->IsBackEdge(*block) && info->HasSuspendCheck()) { | 
|  | codegen_->ClearSpillSlotsFromLoopPhisInStackMap(info->GetSuspendCheck()); | 
|  | GenerateSuspendCheck(info->GetSuspendCheck(), successor); | 
|  | return; | 
|  | } | 
|  |  | 
|  | if (block->IsEntryBlock() && (previous != nullptr) && previous->IsSuspendCheck()) { | 
|  | GenerateSuspendCheck(previous->AsSuspendCheck(), nullptr); | 
|  | } | 
|  | if (!codegen_->GoesToNextBlock(got->GetBlock(), successor)) { | 
|  | __ b(codegen_->GetLabelOf(successor)); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitGoto(HGoto* got) { | 
|  | got->SetLocations(nullptr); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitGoto(HGoto* got) { | 
|  | HandleGoto(got, got->GetSuccessor()); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitTryBoundary(HTryBoundary* try_boundary) { | 
|  | try_boundary->SetLocations(nullptr); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitTryBoundary(HTryBoundary* try_boundary) { | 
|  | HBasicBlock* successor = try_boundary->GetNormalFlowSuccessor(); | 
|  | if (!successor->IsExitBlock()) { | 
|  | HandleGoto(try_boundary, successor); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitExit(HExit* exit) { | 
|  | exit->SetLocations(nullptr); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitExit(HExit* exit) { | 
|  | UNUSED(exit); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::GenerateCompareWithImmediate(Register left, int32_t right) { | 
|  | ShifterOperand operand; | 
|  | if (GetAssembler()->ShifterOperandCanHold(R0, left, CMP, right, &operand)) { | 
|  | __ cmp(left, operand); | 
|  | } else { | 
|  | Register temp = IP; | 
|  | __ LoadImmediate(temp, right); | 
|  | __ cmp(left, ShifterOperand(temp)); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::GenerateFPJumps(HCondition* cond, | 
|  | Label* true_label, | 
|  | Label* false_label) { | 
|  | __ vmstat();  // transfer FP status register to ARM APSR. | 
|  | if (cond->IsFPConditionTrueIfNaN()) { | 
|  | __ b(true_label, VS);  // VS for unordered. | 
|  | } else if (cond->IsFPConditionFalseIfNaN()) { | 
|  | __ b(false_label, VS);  // VS for unordered. | 
|  | } | 
|  | __ b(true_label, ARMSignedOrFPCondition(cond->GetCondition())); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::GenerateLongComparesAndJumps(HCondition* cond, | 
|  | Label* true_label, | 
|  | Label* false_label) { | 
|  | LocationSummary* locations = cond->GetLocations(); | 
|  | Location left = locations->InAt(0); | 
|  | Location right = locations->InAt(1); | 
|  | IfCondition if_cond = cond->GetCondition(); | 
|  |  | 
|  | Register left_high = left.AsRegisterPairHigh<Register>(); | 
|  | Register left_low = left.AsRegisterPairLow<Register>(); | 
|  | IfCondition true_high_cond = if_cond; | 
|  | IfCondition false_high_cond = cond->GetOppositeCondition(); | 
|  | Condition final_condition = ARMUnsignedCondition(if_cond); | 
|  |  | 
|  | // Set the conditions for the test, remembering that == needs to be | 
|  | // decided using the low words. | 
|  | switch (if_cond) { | 
|  | case kCondEQ: | 
|  | case kCondNE: | 
|  | // Nothing to do. | 
|  | break; | 
|  | case kCondLT: | 
|  | false_high_cond = kCondGT; | 
|  | break; | 
|  | case kCondLE: | 
|  | true_high_cond = kCondLT; | 
|  | break; | 
|  | case kCondGT: | 
|  | false_high_cond = kCondLT; | 
|  | break; | 
|  | case kCondGE: | 
|  | true_high_cond = kCondGT; | 
|  | break; | 
|  | } | 
|  | if (right.IsConstant()) { | 
|  | int64_t value = right.GetConstant()->AsLongConstant()->GetValue(); | 
|  | int32_t val_low = Low32Bits(value); | 
|  | int32_t val_high = High32Bits(value); | 
|  |  | 
|  | GenerateCompareWithImmediate(left_high, val_high); | 
|  | if (if_cond == kCondNE) { | 
|  | __ b(true_label, ARMSignedOrFPCondition(true_high_cond)); | 
|  | } else if (if_cond == kCondEQ) { | 
|  | __ b(false_label, ARMSignedOrFPCondition(false_high_cond)); | 
|  | } else { | 
|  | __ b(true_label, ARMSignedOrFPCondition(true_high_cond)); | 
|  | __ b(false_label, ARMSignedOrFPCondition(false_high_cond)); | 
|  | } | 
|  | // Must be equal high, so compare the lows. | 
|  | GenerateCompareWithImmediate(left_low, val_low); | 
|  | } else { | 
|  | Register right_high = right.AsRegisterPairHigh<Register>(); | 
|  | Register right_low = right.AsRegisterPairLow<Register>(); | 
|  |  | 
|  | __ cmp(left_high, ShifterOperand(right_high)); | 
|  | if (if_cond == kCondNE) { | 
|  | __ b(true_label, ARMSignedOrFPCondition(true_high_cond)); | 
|  | } else if (if_cond == kCondEQ) { | 
|  | __ b(false_label, ARMSignedOrFPCondition(false_high_cond)); | 
|  | } else { | 
|  | __ b(true_label, ARMSignedOrFPCondition(true_high_cond)); | 
|  | __ b(false_label, ARMSignedOrFPCondition(false_high_cond)); | 
|  | } | 
|  | // Must be equal high, so compare the lows. | 
|  | __ cmp(left_low, ShifterOperand(right_low)); | 
|  | } | 
|  | // The last comparison might be unsigned. | 
|  | __ b(true_label, final_condition); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::GenerateCompareTestAndBranch(HIf* if_instr, | 
|  | HCondition* condition, | 
|  | Label* true_target, | 
|  | Label* false_target, | 
|  | Label* always_true_target) { | 
|  | LocationSummary* locations = condition->GetLocations(); | 
|  | Location left = locations->InAt(0); | 
|  | Location right = locations->InAt(1); | 
|  |  | 
|  | // We don't want true_target as a nullptr. | 
|  | if (true_target == nullptr) { | 
|  | true_target = always_true_target; | 
|  | } | 
|  | bool falls_through = (false_target == nullptr); | 
|  |  | 
|  | // FP compares don't like null false_targets. | 
|  | if (false_target == nullptr) { | 
|  | false_target = codegen_->GetLabelOf(if_instr->IfFalseSuccessor()); | 
|  | } | 
|  |  | 
|  | Primitive::Type type = condition->InputAt(0)->GetType(); | 
|  | switch (type) { | 
|  | case Primitive::kPrimLong: | 
|  | GenerateLongComparesAndJumps(condition, true_target, false_target); | 
|  | break; | 
|  | case Primitive::kPrimFloat: | 
|  | __ vcmps(left.AsFpuRegister<SRegister>(), right.AsFpuRegister<SRegister>()); | 
|  | GenerateFPJumps(condition, true_target, false_target); | 
|  | break; | 
|  | case Primitive::kPrimDouble: | 
|  | __ vcmpd(FromLowSToD(left.AsFpuRegisterPairLow<SRegister>()), | 
|  | FromLowSToD(right.AsFpuRegisterPairLow<SRegister>())); | 
|  | GenerateFPJumps(condition, true_target, false_target); | 
|  | break; | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected compare type " << type; | 
|  | } | 
|  |  | 
|  | if (!falls_through) { | 
|  | __ b(false_target); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::GenerateTestAndBranch(HInstruction* instruction, | 
|  | Label* true_target, | 
|  | Label* false_target, | 
|  | Label* always_true_target) { | 
|  | HInstruction* cond = instruction->InputAt(0); | 
|  | if (cond->IsIntConstant()) { | 
|  | // Constant condition, statically compared against 1. | 
|  | int32_t cond_value = cond->AsIntConstant()->GetValue(); | 
|  | if (cond_value == 1) { | 
|  | if (always_true_target != nullptr) { | 
|  | __ b(always_true_target); | 
|  | } | 
|  | return; | 
|  | } else { | 
|  | DCHECK_EQ(cond_value, 0); | 
|  | } | 
|  | } else { | 
|  | if (!cond->IsCondition() || cond->AsCondition()->NeedsMaterialization()) { | 
|  | // Condition has been materialized, compare the output to 0 | 
|  | DCHECK(instruction->GetLocations()->InAt(0).IsRegister()); | 
|  | __ CompareAndBranchIfNonZero(instruction->GetLocations()->InAt(0).AsRegister<Register>(), | 
|  | true_target); | 
|  | } else { | 
|  | // Condition has not been materialized, use its inputs as the | 
|  | // comparison and its condition as the branch condition. | 
|  | Primitive::Type type = | 
|  | cond->IsCondition() ? cond->InputAt(0)->GetType() : Primitive::kPrimInt; | 
|  | // Is this a long or FP comparison that has been folded into the HCondition? | 
|  | if (type == Primitive::kPrimLong || Primitive::IsFloatingPointType(type)) { | 
|  | // Generate the comparison directly. | 
|  | GenerateCompareTestAndBranch(instruction->AsIf(), cond->AsCondition(), | 
|  | true_target, false_target, always_true_target); | 
|  | return; | 
|  | } | 
|  |  | 
|  | LocationSummary* locations = cond->GetLocations(); | 
|  | DCHECK(locations->InAt(0).IsRegister()) << locations->InAt(0); | 
|  | Register left = locations->InAt(0).AsRegister<Register>(); | 
|  | Location right = locations->InAt(1); | 
|  | if (right.IsRegister()) { | 
|  | __ cmp(left, ShifterOperand(right.AsRegister<Register>())); | 
|  | } else { | 
|  | DCHECK(right.IsConstant()); | 
|  | GenerateCompareWithImmediate(left, CodeGenerator::GetInt32ValueOf(right.GetConstant())); | 
|  | } | 
|  | __ b(true_target, ARMSignedOrFPCondition(cond->AsCondition()->GetCondition())); | 
|  | } | 
|  | } | 
|  | if (false_target != nullptr) { | 
|  | __ b(false_target); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitIf(HIf* if_instr) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(if_instr, LocationSummary::kNoCall); | 
|  | HInstruction* cond = if_instr->InputAt(0); | 
|  | if (!cond->IsCondition() || cond->AsCondition()->NeedsMaterialization()) { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitIf(HIf* if_instr) { | 
|  | Label* true_target = codegen_->GetLabelOf(if_instr->IfTrueSuccessor()); | 
|  | Label* false_target = codegen_->GetLabelOf(if_instr->IfFalseSuccessor()); | 
|  | Label* always_true_target = true_target; | 
|  | if (codegen_->GoesToNextBlock(if_instr->GetBlock(), | 
|  | if_instr->IfTrueSuccessor())) { | 
|  | always_true_target = nullptr; | 
|  | } | 
|  | if (codegen_->GoesToNextBlock(if_instr->GetBlock(), | 
|  | if_instr->IfFalseSuccessor())) { | 
|  | false_target = nullptr; | 
|  | } | 
|  | GenerateTestAndBranch(if_instr, true_target, false_target, always_true_target); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitDeoptimize(HDeoptimize* deoptimize) { | 
|  | LocationSummary* locations = new (GetGraph()->GetArena()) | 
|  | LocationSummary(deoptimize, LocationSummary::kCallOnSlowPath); | 
|  | HInstruction* cond = deoptimize->InputAt(0); | 
|  | DCHECK(cond->IsCondition()); | 
|  | if (cond->AsCondition()->NeedsMaterialization()) { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitDeoptimize(HDeoptimize* deoptimize) { | 
|  | SlowPathCode* slow_path = new (GetGraph()->GetArena()) | 
|  | DeoptimizationSlowPathARM(deoptimize); | 
|  | codegen_->AddSlowPath(slow_path); | 
|  | Label* slow_path_entry = slow_path->GetEntryLabel(); | 
|  | GenerateTestAndBranch(deoptimize, slow_path_entry, nullptr, slow_path_entry); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitCondition(HCondition* cond) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(cond, LocationSummary::kNoCall); | 
|  | // Handle the long/FP comparisons made in instruction simplification. | 
|  | switch (cond->InputAt(0)->GetType()) { | 
|  | case Primitive::kPrimLong: | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RegisterOrConstant(cond->InputAt(1))); | 
|  | if (cond->NeedsMaterialization()) { | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kOutputOverlap); | 
|  | } | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimFloat: | 
|  | case Primitive::kPrimDouble: | 
|  | locations->SetInAt(0, Location::RequiresFpuRegister()); | 
|  | locations->SetInAt(1, Location::RequiresFpuRegister()); | 
|  | if (cond->NeedsMaterialization()) { | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | } | 
|  | break; | 
|  |  | 
|  | default: | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RegisterOrConstant(cond->InputAt(1))); | 
|  | if (cond->NeedsMaterialization()) { | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | } | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitCondition(HCondition* cond) { | 
|  | if (!cond->NeedsMaterialization()) { | 
|  | return; | 
|  | } | 
|  |  | 
|  | LocationSummary* locations = cond->GetLocations(); | 
|  | Location left = locations->InAt(0); | 
|  | Location right = locations->InAt(1); | 
|  | Register out = locations->Out().AsRegister<Register>(); | 
|  | Label true_label, false_label; | 
|  |  | 
|  | switch (cond->InputAt(0)->GetType()) { | 
|  | default: { | 
|  | // Integer case. | 
|  | if (right.IsRegister()) { | 
|  | __ cmp(left.AsRegister<Register>(), ShifterOperand(right.AsRegister<Register>())); | 
|  | } else { | 
|  | DCHECK(right.IsConstant()); | 
|  | GenerateCompareWithImmediate(left.AsRegister<Register>(), | 
|  | CodeGenerator::GetInt32ValueOf(right.GetConstant())); | 
|  | } | 
|  | __ it(ARMSignedOrFPCondition(cond->GetCondition()), kItElse); | 
|  | __ mov(locations->Out().AsRegister<Register>(), ShifterOperand(1), | 
|  | ARMSignedOrFPCondition(cond->GetCondition())); | 
|  | __ mov(locations->Out().AsRegister<Register>(), ShifterOperand(0), | 
|  | ARMSignedOrFPCondition(cond->GetOppositeCondition())); | 
|  | return; | 
|  | } | 
|  | case Primitive::kPrimLong: | 
|  | GenerateLongComparesAndJumps(cond, &true_label, &false_label); | 
|  | break; | 
|  | case Primitive::kPrimFloat: | 
|  | __ vcmps(left.AsFpuRegister<SRegister>(), right.AsFpuRegister<SRegister>()); | 
|  | GenerateFPJumps(cond, &true_label, &false_label); | 
|  | break; | 
|  | case Primitive::kPrimDouble: | 
|  | __ vcmpd(FromLowSToD(left.AsFpuRegisterPairLow<SRegister>()), | 
|  | FromLowSToD(right.AsFpuRegisterPairLow<SRegister>())); | 
|  | GenerateFPJumps(cond, &true_label, &false_label); | 
|  | break; | 
|  | } | 
|  |  | 
|  | // Convert the jumps into the result. | 
|  | Label done_label; | 
|  |  | 
|  | // False case: result = 0. | 
|  | __ Bind(&false_label); | 
|  | __ LoadImmediate(out, 0); | 
|  | __ b(&done_label); | 
|  |  | 
|  | // True case: result = 1. | 
|  | __ Bind(&true_label); | 
|  | __ LoadImmediate(out, 1); | 
|  | __ Bind(&done_label); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitEqual(HEqual* comp) { | 
|  | VisitCondition(comp); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitEqual(HEqual* comp) { | 
|  | VisitCondition(comp); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitNotEqual(HNotEqual* comp) { | 
|  | VisitCondition(comp); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitNotEqual(HNotEqual* comp) { | 
|  | VisitCondition(comp); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitLessThan(HLessThan* comp) { | 
|  | VisitCondition(comp); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitLessThan(HLessThan* comp) { | 
|  | VisitCondition(comp); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitLessThanOrEqual(HLessThanOrEqual* comp) { | 
|  | VisitCondition(comp); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitLessThanOrEqual(HLessThanOrEqual* comp) { | 
|  | VisitCondition(comp); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitGreaterThan(HGreaterThan* comp) { | 
|  | VisitCondition(comp); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitGreaterThan(HGreaterThan* comp) { | 
|  | VisitCondition(comp); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitGreaterThanOrEqual(HGreaterThanOrEqual* comp) { | 
|  | VisitCondition(comp); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitGreaterThanOrEqual(HGreaterThanOrEqual* comp) { | 
|  | VisitCondition(comp); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitLocal(HLocal* local) { | 
|  | local->SetLocations(nullptr); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitLocal(HLocal* local) { | 
|  | DCHECK_EQ(local->GetBlock(), GetGraph()->GetEntryBlock()); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitLoadLocal(HLoadLocal* load) { | 
|  | load->SetLocations(nullptr); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitLoadLocal(HLoadLocal* load) { | 
|  | // Nothing to do, this is driven by the code generator. | 
|  | UNUSED(load); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitStoreLocal(HStoreLocal* store) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(store, LocationSummary::kNoCall); | 
|  | switch (store->InputAt(1)->GetType()) { | 
|  | case Primitive::kPrimBoolean: | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimChar: | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimNot: | 
|  | case Primitive::kPrimFloat: | 
|  | locations->SetInAt(1, Location::StackSlot(codegen_->GetStackSlot(store->GetLocal()))); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimLong: | 
|  | case Primitive::kPrimDouble: | 
|  | locations->SetInAt(1, Location::DoubleStackSlot(codegen_->GetStackSlot(store->GetLocal()))); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected local type " << store->InputAt(1)->GetType(); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitStoreLocal(HStoreLocal* store) { | 
|  | UNUSED(store); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitIntConstant(HIntConstant* constant) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(constant, LocationSummary::kNoCall); | 
|  | locations->SetOut(Location::ConstantLocation(constant)); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitIntConstant(HIntConstant* constant) { | 
|  | // Will be generated at use site. | 
|  | UNUSED(constant); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitNullConstant(HNullConstant* constant) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(constant, LocationSummary::kNoCall); | 
|  | locations->SetOut(Location::ConstantLocation(constant)); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitNullConstant(HNullConstant* constant) { | 
|  | // Will be generated at use site. | 
|  | UNUSED(constant); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitLongConstant(HLongConstant* constant) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(constant, LocationSummary::kNoCall); | 
|  | locations->SetOut(Location::ConstantLocation(constant)); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitLongConstant(HLongConstant* constant) { | 
|  | // Will be generated at use site. | 
|  | UNUSED(constant); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitFloatConstant(HFloatConstant* constant) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(constant, LocationSummary::kNoCall); | 
|  | locations->SetOut(Location::ConstantLocation(constant)); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitFloatConstant(HFloatConstant* constant) { | 
|  | // Will be generated at use site. | 
|  | UNUSED(constant); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitDoubleConstant(HDoubleConstant* constant) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(constant, LocationSummary::kNoCall); | 
|  | locations->SetOut(Location::ConstantLocation(constant)); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitDoubleConstant(HDoubleConstant* constant) { | 
|  | // Will be generated at use site. | 
|  | UNUSED(constant); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitMemoryBarrier(HMemoryBarrier* memory_barrier) { | 
|  | memory_barrier->SetLocations(nullptr); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitMemoryBarrier(HMemoryBarrier* memory_barrier) { | 
|  | GenerateMemoryBarrier(memory_barrier->GetBarrierKind()); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitReturnVoid(HReturnVoid* ret) { | 
|  | ret->SetLocations(nullptr); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitReturnVoid(HReturnVoid* ret) { | 
|  | UNUSED(ret); | 
|  | codegen_->GenerateFrameExit(); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitReturn(HReturn* ret) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(ret, LocationSummary::kNoCall); | 
|  | locations->SetInAt(0, parameter_visitor_.GetReturnLocation(ret->InputAt(0)->GetType())); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitReturn(HReturn* ret) { | 
|  | UNUSED(ret); | 
|  | codegen_->GenerateFrameExit(); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitInvokeUnresolved(HInvokeUnresolved* invoke) { | 
|  | // The trampoline uses the same calling convention as dex calling conventions, | 
|  | // except instead of loading arg0/r0 with the target Method*, arg0/r0 will contain | 
|  | // the method_idx. | 
|  | HandleInvoke(invoke); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitInvokeUnresolved(HInvokeUnresolved* invoke) { | 
|  | codegen_->GenerateInvokeUnresolvedRuntimeCall(invoke); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitInvokeStaticOrDirect(HInvokeStaticOrDirect* invoke) { | 
|  | // When we do not run baseline, explicit clinit checks triggered by static | 
|  | // invokes must have been pruned by art::PrepareForRegisterAllocation. | 
|  | DCHECK(codegen_->IsBaseline() || !invoke->IsStaticWithExplicitClinitCheck()); | 
|  |  | 
|  | IntrinsicLocationsBuilderARM intrinsic(GetGraph()->GetArena(), | 
|  | codegen_->GetInstructionSetFeatures()); | 
|  | if (intrinsic.TryDispatch(invoke)) { | 
|  | return; | 
|  | } | 
|  |  | 
|  | HandleInvoke(invoke); | 
|  | } | 
|  |  | 
|  | static bool TryGenerateIntrinsicCode(HInvoke* invoke, CodeGeneratorARM* codegen) { | 
|  | if (invoke->GetLocations()->Intrinsified()) { | 
|  | IntrinsicCodeGeneratorARM intrinsic(codegen); | 
|  | intrinsic.Dispatch(invoke); | 
|  | return true; | 
|  | } | 
|  | return false; | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitInvokeStaticOrDirect(HInvokeStaticOrDirect* invoke) { | 
|  | // When we do not run baseline, explicit clinit checks triggered by static | 
|  | // invokes must have been pruned by art::PrepareForRegisterAllocation. | 
|  | DCHECK(codegen_->IsBaseline() || !invoke->IsStaticWithExplicitClinitCheck()); | 
|  |  | 
|  | if (TryGenerateIntrinsicCode(invoke, codegen_)) { | 
|  | return; | 
|  | } | 
|  |  | 
|  | LocationSummary* locations = invoke->GetLocations(); | 
|  | codegen_->GenerateStaticOrDirectCall( | 
|  | invoke, locations->HasTemps() ? locations->GetTemp(0) : Location::NoLocation()); | 
|  | codegen_->RecordPcInfo(invoke, invoke->GetDexPc()); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::HandleInvoke(HInvoke* invoke) { | 
|  | InvokeDexCallingConventionVisitorARM calling_convention_visitor; | 
|  | CodeGenerator::CreateCommonInvokeLocationSummary(invoke, &calling_convention_visitor); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitInvokeVirtual(HInvokeVirtual* invoke) { | 
|  | IntrinsicLocationsBuilderARM intrinsic(GetGraph()->GetArena(), | 
|  | codegen_->GetInstructionSetFeatures()); | 
|  | if (intrinsic.TryDispatch(invoke)) { | 
|  | return; | 
|  | } | 
|  |  | 
|  | HandleInvoke(invoke); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitInvokeVirtual(HInvokeVirtual* invoke) { | 
|  | if (TryGenerateIntrinsicCode(invoke, codegen_)) { | 
|  | return; | 
|  | } | 
|  |  | 
|  | codegen_->GenerateVirtualCall(invoke, invoke->GetLocations()->GetTemp(0)); | 
|  | DCHECK(!codegen_->IsLeafMethod()); | 
|  | codegen_->RecordPcInfo(invoke, invoke->GetDexPc()); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitInvokeInterface(HInvokeInterface* invoke) { | 
|  | HandleInvoke(invoke); | 
|  | // Add the hidden argument. | 
|  | invoke->GetLocations()->AddTemp(Location::RegisterLocation(R12)); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitInvokeInterface(HInvokeInterface* invoke) { | 
|  | // TODO: b/18116999, our IMTs can miss an IncompatibleClassChangeError. | 
|  | Register temp = invoke->GetLocations()->GetTemp(0).AsRegister<Register>(); | 
|  | uint32_t method_offset = mirror::Class::EmbeddedImTableEntryOffset( | 
|  | invoke->GetImtIndex() % mirror::Class::kImtSize, kArmPointerSize).Uint32Value(); | 
|  | LocationSummary* locations = invoke->GetLocations(); | 
|  | Location receiver = locations->InAt(0); | 
|  | uint32_t class_offset = mirror::Object::ClassOffset().Int32Value(); | 
|  |  | 
|  | // Set the hidden argument. | 
|  | __ LoadImmediate(invoke->GetLocations()->GetTemp(1).AsRegister<Register>(), | 
|  | invoke->GetDexMethodIndex()); | 
|  |  | 
|  | // temp = object->GetClass(); | 
|  | if (receiver.IsStackSlot()) { | 
|  | __ LoadFromOffset(kLoadWord, temp, SP, receiver.GetStackIndex()); | 
|  | __ LoadFromOffset(kLoadWord, temp, temp, class_offset); | 
|  | } else { | 
|  | __ LoadFromOffset(kLoadWord, temp, receiver.AsRegister<Register>(), class_offset); | 
|  | } | 
|  | codegen_->MaybeRecordImplicitNullCheck(invoke); | 
|  | __ MaybeUnpoisonHeapReference(temp); | 
|  | // temp = temp->GetImtEntryAt(method_offset); | 
|  | uint32_t entry_point = ArtMethod::EntryPointFromQuickCompiledCodeOffset( | 
|  | kArmWordSize).Int32Value(); | 
|  | __ LoadFromOffset(kLoadWord, temp, temp, method_offset); | 
|  | // LR = temp->GetEntryPoint(); | 
|  | __ LoadFromOffset(kLoadWord, LR, temp, entry_point); | 
|  | // LR(); | 
|  | __ blx(LR); | 
|  | DCHECK(!codegen_->IsLeafMethod()); | 
|  | codegen_->RecordPcInfo(invoke, invoke->GetDexPc()); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitNeg(HNeg* neg) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(neg, LocationSummary::kNoCall); | 
|  | switch (neg->GetResultType()) { | 
|  | case Primitive::kPrimInt: { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  | } | 
|  | case Primitive::kPrimLong: { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kOutputOverlap); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimFloat: | 
|  | case Primitive::kPrimDouble: | 
|  | locations->SetInAt(0, Location::RequiresFpuRegister()); | 
|  | locations->SetOut(Location::RequiresFpuRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected neg type " << neg->GetResultType(); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitNeg(HNeg* neg) { | 
|  | LocationSummary* locations = neg->GetLocations(); | 
|  | Location out = locations->Out(); | 
|  | Location in = locations->InAt(0); | 
|  | switch (neg->GetResultType()) { | 
|  | case Primitive::kPrimInt: | 
|  | DCHECK(in.IsRegister()); | 
|  | __ rsb(out.AsRegister<Register>(), in.AsRegister<Register>(), ShifterOperand(0)); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimLong: | 
|  | DCHECK(in.IsRegisterPair()); | 
|  | // out.lo = 0 - in.lo (and update the carry/borrow (C) flag) | 
|  | __ rsbs(out.AsRegisterPairLow<Register>(), | 
|  | in.AsRegisterPairLow<Register>(), | 
|  | ShifterOperand(0)); | 
|  | // We cannot emit an RSC (Reverse Subtract with Carry) | 
|  | // instruction here, as it does not exist in the Thumb-2 | 
|  | // instruction set.  We use the following approach | 
|  | // using SBC and SUB instead. | 
|  | // | 
|  | // out.hi = -C | 
|  | __ sbc(out.AsRegisterPairHigh<Register>(), | 
|  | out.AsRegisterPairHigh<Register>(), | 
|  | ShifterOperand(out.AsRegisterPairHigh<Register>())); | 
|  | // out.hi = out.hi - in.hi | 
|  | __ sub(out.AsRegisterPairHigh<Register>(), | 
|  | out.AsRegisterPairHigh<Register>(), | 
|  | ShifterOperand(in.AsRegisterPairHigh<Register>())); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimFloat: | 
|  | DCHECK(in.IsFpuRegister()); | 
|  | __ vnegs(out.AsFpuRegister<SRegister>(), in.AsFpuRegister<SRegister>()); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimDouble: | 
|  | DCHECK(in.IsFpuRegisterPair()); | 
|  | __ vnegd(FromLowSToD(out.AsFpuRegisterPairLow<SRegister>()), | 
|  | FromLowSToD(in.AsFpuRegisterPairLow<SRegister>())); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected neg type " << neg->GetResultType(); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitTypeConversion(HTypeConversion* conversion) { | 
|  | Primitive::Type result_type = conversion->GetResultType(); | 
|  | Primitive::Type input_type = conversion->GetInputType(); | 
|  | DCHECK_NE(result_type, input_type); | 
|  |  | 
|  | // The float-to-long, double-to-long and long-to-float type conversions | 
|  | // rely on a call to the runtime. | 
|  | LocationSummary::CallKind call_kind = | 
|  | (((input_type == Primitive::kPrimFloat || input_type == Primitive::kPrimDouble) | 
|  | && result_type == Primitive::kPrimLong) | 
|  | || (input_type == Primitive::kPrimLong && result_type == Primitive::kPrimFloat)) | 
|  | ? LocationSummary::kCall | 
|  | : LocationSummary::kNoCall; | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(conversion, call_kind); | 
|  |  | 
|  | // The Java language does not allow treating boolean as an integral type but | 
|  | // our bit representation makes it safe. | 
|  |  | 
|  | switch (result_type) { | 
|  | case Primitive::kPrimByte: | 
|  | switch (input_type) { | 
|  | case Primitive::kPrimBoolean: | 
|  | // Boolean input is a result of code transformations. | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimChar: | 
|  | // Processing a Dex `int-to-byte' instruction. | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type conversion from " << input_type | 
|  | << " to " << result_type; | 
|  | } | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimShort: | 
|  | switch (input_type) { | 
|  | case Primitive::kPrimBoolean: | 
|  | // Boolean input is a result of code transformations. | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimChar: | 
|  | // Processing a Dex `int-to-short' instruction. | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type conversion from " << input_type | 
|  | << " to " << result_type; | 
|  | } | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimInt: | 
|  | switch (input_type) { | 
|  | case Primitive::kPrimLong: | 
|  | // Processing a Dex `long-to-int' instruction. | 
|  | locations->SetInAt(0, Location::Any()); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimFloat: | 
|  | // Processing a Dex `float-to-int' instruction. | 
|  | locations->SetInAt(0, Location::RequiresFpuRegister()); | 
|  | locations->SetOut(Location::RequiresRegister()); | 
|  | locations->AddTemp(Location::RequiresFpuRegister()); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimDouble: | 
|  | // Processing a Dex `double-to-int' instruction. | 
|  | locations->SetInAt(0, Location::RequiresFpuRegister()); | 
|  | locations->SetOut(Location::RequiresRegister()); | 
|  | locations->AddTemp(Location::RequiresFpuRegister()); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type conversion from " << input_type | 
|  | << " to " << result_type; | 
|  | } | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimLong: | 
|  | switch (input_type) { | 
|  | case Primitive::kPrimBoolean: | 
|  | // Boolean input is a result of code transformations. | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimChar: | 
|  | // Processing a Dex `int-to-long' instruction. | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimFloat: { | 
|  | // Processing a Dex `float-to-long' instruction. | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | locations->SetInAt(0, Location::FpuRegisterLocation( | 
|  | calling_convention.GetFpuRegisterAt(0))); | 
|  | locations->SetOut(Location::RegisterPairLocation(R0, R1)); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimDouble: { | 
|  | // Processing a Dex `double-to-long' instruction. | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | locations->SetInAt(0, Location::FpuRegisterPairLocation( | 
|  | calling_convention.GetFpuRegisterAt(0), | 
|  | calling_convention.GetFpuRegisterAt(1))); | 
|  | locations->SetOut(Location::RegisterPairLocation(R0, R1)); | 
|  | break; | 
|  | } | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type conversion from " << input_type | 
|  | << " to " << result_type; | 
|  | } | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimChar: | 
|  | switch (input_type) { | 
|  | case Primitive::kPrimBoolean: | 
|  | // Boolean input is a result of code transformations. | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimInt: | 
|  | // Processing a Dex `int-to-char' instruction. | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type conversion from " << input_type | 
|  | << " to " << result_type; | 
|  | } | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimFloat: | 
|  | switch (input_type) { | 
|  | case Primitive::kPrimBoolean: | 
|  | // Boolean input is a result of code transformations. | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimChar: | 
|  | // Processing a Dex `int-to-float' instruction. | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresFpuRegister()); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimLong: { | 
|  | // Processing a Dex `long-to-float' instruction. | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | locations->SetInAt(0, Location::RegisterPairLocation( | 
|  | calling_convention.GetRegisterAt(0), calling_convention.GetRegisterAt(1))); | 
|  | locations->SetOut(Location::FpuRegisterLocation(calling_convention.GetFpuRegisterAt(0))); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimDouble: | 
|  | // Processing a Dex `double-to-float' instruction. | 
|  | locations->SetInAt(0, Location::RequiresFpuRegister()); | 
|  | locations->SetOut(Location::RequiresFpuRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type conversion from " << input_type | 
|  | << " to " << result_type; | 
|  | }; | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimDouble: | 
|  | switch (input_type) { | 
|  | case Primitive::kPrimBoolean: | 
|  | // Boolean input is a result of code transformations. | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimChar: | 
|  | // Processing a Dex `int-to-double' instruction. | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresFpuRegister()); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimLong: | 
|  | // Processing a Dex `long-to-double' instruction. | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresFpuRegister()); | 
|  | locations->AddTemp(Location::RequiresFpuRegister()); | 
|  | locations->AddTemp(Location::RequiresFpuRegister()); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimFloat: | 
|  | // Processing a Dex `float-to-double' instruction. | 
|  | locations->SetInAt(0, Location::RequiresFpuRegister()); | 
|  | locations->SetOut(Location::RequiresFpuRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type conversion from " << input_type | 
|  | << " to " << result_type; | 
|  | }; | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type conversion from " << input_type | 
|  | << " to " << result_type; | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitTypeConversion(HTypeConversion* conversion) { | 
|  | LocationSummary* locations = conversion->GetLocations(); | 
|  | Location out = locations->Out(); | 
|  | Location in = locations->InAt(0); | 
|  | Primitive::Type result_type = conversion->GetResultType(); | 
|  | Primitive::Type input_type = conversion->GetInputType(); | 
|  | DCHECK_NE(result_type, input_type); | 
|  | switch (result_type) { | 
|  | case Primitive::kPrimByte: | 
|  | switch (input_type) { | 
|  | case Primitive::kPrimBoolean: | 
|  | // Boolean input is a result of code transformations. | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimChar: | 
|  | // Processing a Dex `int-to-byte' instruction. | 
|  | __ sbfx(out.AsRegister<Register>(), in.AsRegister<Register>(), 0, 8); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type conversion from " << input_type | 
|  | << " to " << result_type; | 
|  | } | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimShort: | 
|  | switch (input_type) { | 
|  | case Primitive::kPrimBoolean: | 
|  | // Boolean input is a result of code transformations. | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimChar: | 
|  | // Processing a Dex `int-to-short' instruction. | 
|  | __ sbfx(out.AsRegister<Register>(), in.AsRegister<Register>(), 0, 16); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type conversion from " << input_type | 
|  | << " to " << result_type; | 
|  | } | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimInt: | 
|  | switch (input_type) { | 
|  | case Primitive::kPrimLong: | 
|  | // Processing a Dex `long-to-int' instruction. | 
|  | DCHECK(out.IsRegister()); | 
|  | if (in.IsRegisterPair()) { | 
|  | __ Mov(out.AsRegister<Register>(), in.AsRegisterPairLow<Register>()); | 
|  | } else if (in.IsDoubleStackSlot()) { | 
|  | __ LoadFromOffset(kLoadWord, out.AsRegister<Register>(), SP, in.GetStackIndex()); | 
|  | } else { | 
|  | DCHECK(in.IsConstant()); | 
|  | DCHECK(in.GetConstant()->IsLongConstant()); | 
|  | int64_t value = in.GetConstant()->AsLongConstant()->GetValue(); | 
|  | __ LoadImmediate(out.AsRegister<Register>(), static_cast<int32_t>(value)); | 
|  | } | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimFloat: { | 
|  | // Processing a Dex `float-to-int' instruction. | 
|  | SRegister temp = locations->GetTemp(0).AsFpuRegisterPairLow<SRegister>(); | 
|  | __ vmovs(temp, in.AsFpuRegister<SRegister>()); | 
|  | __ vcvtis(temp, temp); | 
|  | __ vmovrs(out.AsRegister<Register>(), temp); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimDouble: { | 
|  | // Processing a Dex `double-to-int' instruction. | 
|  | SRegister temp_s = locations->GetTemp(0).AsFpuRegisterPairLow<SRegister>(); | 
|  | DRegister temp_d = FromLowSToD(temp_s); | 
|  | __ vmovd(temp_d, FromLowSToD(in.AsFpuRegisterPairLow<SRegister>())); | 
|  | __ vcvtid(temp_s, temp_d); | 
|  | __ vmovrs(out.AsRegister<Register>(), temp_s); | 
|  | break; | 
|  | } | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type conversion from " << input_type | 
|  | << " to " << result_type; | 
|  | } | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimLong: | 
|  | switch (input_type) { | 
|  | case Primitive::kPrimBoolean: | 
|  | // Boolean input is a result of code transformations. | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimChar: | 
|  | // Processing a Dex `int-to-long' instruction. | 
|  | DCHECK(out.IsRegisterPair()); | 
|  | DCHECK(in.IsRegister()); | 
|  | __ Mov(out.AsRegisterPairLow<Register>(), in.AsRegister<Register>()); | 
|  | // Sign extension. | 
|  | __ Asr(out.AsRegisterPairHigh<Register>(), | 
|  | out.AsRegisterPairLow<Register>(), | 
|  | 31); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimFloat: | 
|  | // Processing a Dex `float-to-long' instruction. | 
|  | codegen_->InvokeRuntime(QUICK_ENTRY_POINT(pF2l), | 
|  | conversion, | 
|  | conversion->GetDexPc(), | 
|  | nullptr); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimDouble: | 
|  | // Processing a Dex `double-to-long' instruction. | 
|  | codegen_->InvokeRuntime(QUICK_ENTRY_POINT(pD2l), | 
|  | conversion, | 
|  | conversion->GetDexPc(), | 
|  | nullptr); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type conversion from " << input_type | 
|  | << " to " << result_type; | 
|  | } | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimChar: | 
|  | switch (input_type) { | 
|  | case Primitive::kPrimBoolean: | 
|  | // Boolean input is a result of code transformations. | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimInt: | 
|  | // Processing a Dex `int-to-char' instruction. | 
|  | __ ubfx(out.AsRegister<Register>(), in.AsRegister<Register>(), 0, 16); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type conversion from " << input_type | 
|  | << " to " << result_type; | 
|  | } | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimFloat: | 
|  | switch (input_type) { | 
|  | case Primitive::kPrimBoolean: | 
|  | // Boolean input is a result of code transformations. | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimChar: { | 
|  | // Processing a Dex `int-to-float' instruction. | 
|  | __ vmovsr(out.AsFpuRegister<SRegister>(), in.AsRegister<Register>()); | 
|  | __ vcvtsi(out.AsFpuRegister<SRegister>(), out.AsFpuRegister<SRegister>()); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimLong: | 
|  | // Processing a Dex `long-to-float' instruction. | 
|  | codegen_->InvokeRuntime(QUICK_ENTRY_POINT(pL2f), | 
|  | conversion, | 
|  | conversion->GetDexPc(), | 
|  | nullptr); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimDouble: | 
|  | // Processing a Dex `double-to-float' instruction. | 
|  | __ vcvtsd(out.AsFpuRegister<SRegister>(), | 
|  | FromLowSToD(in.AsFpuRegisterPairLow<SRegister>())); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type conversion from " << input_type | 
|  | << " to " << result_type; | 
|  | }; | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimDouble: | 
|  | switch (input_type) { | 
|  | case Primitive::kPrimBoolean: | 
|  | // Boolean input is a result of code transformations. | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimChar: { | 
|  | // Processing a Dex `int-to-double' instruction. | 
|  | __ vmovsr(out.AsFpuRegisterPairLow<SRegister>(), in.AsRegister<Register>()); | 
|  | __ vcvtdi(FromLowSToD(out.AsFpuRegisterPairLow<SRegister>()), | 
|  | out.AsFpuRegisterPairLow<SRegister>()); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimLong: { | 
|  | // Processing a Dex `long-to-double' instruction. | 
|  | Register low = in.AsRegisterPairLow<Register>(); | 
|  | Register high = in.AsRegisterPairHigh<Register>(); | 
|  | SRegister out_s = out.AsFpuRegisterPairLow<SRegister>(); | 
|  | DRegister out_d = FromLowSToD(out_s); | 
|  | SRegister temp_s = locations->GetTemp(0).AsFpuRegisterPairLow<SRegister>(); | 
|  | DRegister temp_d = FromLowSToD(temp_s); | 
|  | SRegister constant_s = locations->GetTemp(1).AsFpuRegisterPairLow<SRegister>(); | 
|  | DRegister constant_d = FromLowSToD(constant_s); | 
|  |  | 
|  | // temp_d = int-to-double(high) | 
|  | __ vmovsr(temp_s, high); | 
|  | __ vcvtdi(temp_d, temp_s); | 
|  | // constant_d = k2Pow32EncodingForDouble | 
|  | __ LoadDImmediate(constant_d, bit_cast<double, int64_t>(k2Pow32EncodingForDouble)); | 
|  | // out_d = unsigned-to-double(low) | 
|  | __ vmovsr(out_s, low); | 
|  | __ vcvtdu(out_d, out_s); | 
|  | // out_d += temp_d * constant_d | 
|  | __ vmlad(out_d, temp_d, constant_d); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimFloat: | 
|  | // Processing a Dex `float-to-double' instruction. | 
|  | __ vcvtds(FromLowSToD(out.AsFpuRegisterPairLow<SRegister>()), | 
|  | in.AsFpuRegister<SRegister>()); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type conversion from " << input_type | 
|  | << " to " << result_type; | 
|  | }; | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type conversion from " << input_type | 
|  | << " to " << result_type; | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitAdd(HAdd* add) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(add, LocationSummary::kNoCall); | 
|  | switch (add->GetResultType()) { | 
|  | case Primitive::kPrimInt: { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RegisterOrConstant(add->InputAt(1))); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimLong: { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimFloat: | 
|  | case Primitive::kPrimDouble: { | 
|  | locations->SetInAt(0, Location::RequiresFpuRegister()); | 
|  | locations->SetInAt(1, Location::RequiresFpuRegister()); | 
|  | locations->SetOut(Location::RequiresFpuRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  | } | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected add type " << add->GetResultType(); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitAdd(HAdd* add) { | 
|  | LocationSummary* locations = add->GetLocations(); | 
|  | Location out = locations->Out(); | 
|  | Location first = locations->InAt(0); | 
|  | Location second = locations->InAt(1); | 
|  | switch (add->GetResultType()) { | 
|  | case Primitive::kPrimInt: | 
|  | if (second.IsRegister()) { | 
|  | __ add(out.AsRegister<Register>(), | 
|  | first.AsRegister<Register>(), | 
|  | ShifterOperand(second.AsRegister<Register>())); | 
|  | } else { | 
|  | __ AddConstant(out.AsRegister<Register>(), | 
|  | first.AsRegister<Register>(), | 
|  | second.GetConstant()->AsIntConstant()->GetValue()); | 
|  | } | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimLong: { | 
|  | DCHECK(second.IsRegisterPair()); | 
|  | __ adds(out.AsRegisterPairLow<Register>(), | 
|  | first.AsRegisterPairLow<Register>(), | 
|  | ShifterOperand(second.AsRegisterPairLow<Register>())); | 
|  | __ adc(out.AsRegisterPairHigh<Register>(), | 
|  | first.AsRegisterPairHigh<Register>(), | 
|  | ShifterOperand(second.AsRegisterPairHigh<Register>())); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimFloat: | 
|  | __ vadds(out.AsFpuRegister<SRegister>(), | 
|  | first.AsFpuRegister<SRegister>(), | 
|  | second.AsFpuRegister<SRegister>()); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimDouble: | 
|  | __ vaddd(FromLowSToD(out.AsFpuRegisterPairLow<SRegister>()), | 
|  | FromLowSToD(first.AsFpuRegisterPairLow<SRegister>()), | 
|  | FromLowSToD(second.AsFpuRegisterPairLow<SRegister>())); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected add type " << add->GetResultType(); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitSub(HSub* sub) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(sub, LocationSummary::kNoCall); | 
|  | switch (sub->GetResultType()) { | 
|  | case Primitive::kPrimInt: { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RegisterOrConstant(sub->InputAt(1))); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimLong: { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  | } | 
|  | case Primitive::kPrimFloat: | 
|  | case Primitive::kPrimDouble: { | 
|  | locations->SetInAt(0, Location::RequiresFpuRegister()); | 
|  | locations->SetInAt(1, Location::RequiresFpuRegister()); | 
|  | locations->SetOut(Location::RequiresFpuRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  | } | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected sub type " << sub->GetResultType(); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitSub(HSub* sub) { | 
|  | LocationSummary* locations = sub->GetLocations(); | 
|  | Location out = locations->Out(); | 
|  | Location first = locations->InAt(0); | 
|  | Location second = locations->InAt(1); | 
|  | switch (sub->GetResultType()) { | 
|  | case Primitive::kPrimInt: { | 
|  | if (second.IsRegister()) { | 
|  | __ sub(out.AsRegister<Register>(), | 
|  | first.AsRegister<Register>(), | 
|  | ShifterOperand(second.AsRegister<Register>())); | 
|  | } else { | 
|  | __ AddConstant(out.AsRegister<Register>(), | 
|  | first.AsRegister<Register>(), | 
|  | -second.GetConstant()->AsIntConstant()->GetValue()); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimLong: { | 
|  | DCHECK(second.IsRegisterPair()); | 
|  | __ subs(out.AsRegisterPairLow<Register>(), | 
|  | first.AsRegisterPairLow<Register>(), | 
|  | ShifterOperand(second.AsRegisterPairLow<Register>())); | 
|  | __ sbc(out.AsRegisterPairHigh<Register>(), | 
|  | first.AsRegisterPairHigh<Register>(), | 
|  | ShifterOperand(second.AsRegisterPairHigh<Register>())); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimFloat: { | 
|  | __ vsubs(out.AsFpuRegister<SRegister>(), | 
|  | first.AsFpuRegister<SRegister>(), | 
|  | second.AsFpuRegister<SRegister>()); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimDouble: { | 
|  | __ vsubd(FromLowSToD(out.AsFpuRegisterPairLow<SRegister>()), | 
|  | FromLowSToD(first.AsFpuRegisterPairLow<SRegister>()), | 
|  | FromLowSToD(second.AsFpuRegisterPairLow<SRegister>())); | 
|  | break; | 
|  | } | 
|  |  | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected sub type " << sub->GetResultType(); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitMul(HMul* mul) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(mul, LocationSummary::kNoCall); | 
|  | switch (mul->GetResultType()) { | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimLong:  { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimFloat: | 
|  | case Primitive::kPrimDouble: { | 
|  | locations->SetInAt(0, Location::RequiresFpuRegister()); | 
|  | locations->SetInAt(1, Location::RequiresFpuRegister()); | 
|  | locations->SetOut(Location::RequiresFpuRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  | } | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected mul type " << mul->GetResultType(); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitMul(HMul* mul) { | 
|  | LocationSummary* locations = mul->GetLocations(); | 
|  | Location out = locations->Out(); | 
|  | Location first = locations->InAt(0); | 
|  | Location second = locations->InAt(1); | 
|  | switch (mul->GetResultType()) { | 
|  | case Primitive::kPrimInt: { | 
|  | __ mul(out.AsRegister<Register>(), | 
|  | first.AsRegister<Register>(), | 
|  | second.AsRegister<Register>()); | 
|  | break; | 
|  | } | 
|  | case Primitive::kPrimLong: { | 
|  | Register out_hi = out.AsRegisterPairHigh<Register>(); | 
|  | Register out_lo = out.AsRegisterPairLow<Register>(); | 
|  | Register in1_hi = first.AsRegisterPairHigh<Register>(); | 
|  | Register in1_lo = first.AsRegisterPairLow<Register>(); | 
|  | Register in2_hi = second.AsRegisterPairHigh<Register>(); | 
|  | Register in2_lo = second.AsRegisterPairLow<Register>(); | 
|  |  | 
|  | // Extra checks to protect caused by the existence of R1_R2. | 
|  | // The algorithm is wrong if out.hi is either in1.lo or in2.lo: | 
|  | // (e.g. in1=r0_r1, in2=r2_r3 and out=r1_r2); | 
|  | DCHECK_NE(out_hi, in1_lo); | 
|  | DCHECK_NE(out_hi, in2_lo); | 
|  |  | 
|  | // input: in1 - 64 bits, in2 - 64 bits | 
|  | // output: out | 
|  | // formula: out.hi : out.lo = (in1.lo * in2.hi + in1.hi * in2.lo)* 2^32 + in1.lo * in2.lo | 
|  | // parts: out.hi = in1.lo * in2.hi + in1.hi * in2.lo + (in1.lo * in2.lo)[63:32] | 
|  | // parts: out.lo = (in1.lo * in2.lo)[31:0] | 
|  |  | 
|  | // IP <- in1.lo * in2.hi | 
|  | __ mul(IP, in1_lo, in2_hi); | 
|  | // out.hi <- in1.lo * in2.hi + in1.hi * in2.lo | 
|  | __ mla(out_hi, in1_hi, in2_lo, IP); | 
|  | // out.lo <- (in1.lo * in2.lo)[31:0]; | 
|  | __ umull(out_lo, IP, in1_lo, in2_lo); | 
|  | // out.hi <- in2.hi * in1.lo +  in2.lo * in1.hi + (in1.lo * in2.lo)[63:32] | 
|  | __ add(out_hi, out_hi, ShifterOperand(IP)); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimFloat: { | 
|  | __ vmuls(out.AsFpuRegister<SRegister>(), | 
|  | first.AsFpuRegister<SRegister>(), | 
|  | second.AsFpuRegister<SRegister>()); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimDouble: { | 
|  | __ vmuld(FromLowSToD(out.AsFpuRegisterPairLow<SRegister>()), | 
|  | FromLowSToD(first.AsFpuRegisterPairLow<SRegister>()), | 
|  | FromLowSToD(second.AsFpuRegisterPairLow<SRegister>())); | 
|  | break; | 
|  | } | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected mul type " << mul->GetResultType(); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::DivRemOneOrMinusOne(HBinaryOperation* instruction) { | 
|  | DCHECK(instruction->IsDiv() || instruction->IsRem()); | 
|  | DCHECK(instruction->GetResultType() == Primitive::kPrimInt); | 
|  |  | 
|  | LocationSummary* locations = instruction->GetLocations(); | 
|  | Location second = locations->InAt(1); | 
|  | DCHECK(second.IsConstant()); | 
|  |  | 
|  | Register out = locations->Out().AsRegister<Register>(); | 
|  | Register dividend = locations->InAt(0).AsRegister<Register>(); | 
|  | int32_t imm = second.GetConstant()->AsIntConstant()->GetValue(); | 
|  | DCHECK(imm == 1 || imm == -1); | 
|  |  | 
|  | if (instruction->IsRem()) { | 
|  | __ LoadImmediate(out, 0); | 
|  | } else { | 
|  | if (imm == 1) { | 
|  | __ Mov(out, dividend); | 
|  | } else { | 
|  | __ rsb(out, dividend, ShifterOperand(0)); | 
|  | } | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::DivRemByPowerOfTwo(HBinaryOperation* instruction) { | 
|  | DCHECK(instruction->IsDiv() || instruction->IsRem()); | 
|  | DCHECK(instruction->GetResultType() == Primitive::kPrimInt); | 
|  |  | 
|  | LocationSummary* locations = instruction->GetLocations(); | 
|  | Location second = locations->InAt(1); | 
|  | DCHECK(second.IsConstant()); | 
|  |  | 
|  | Register out = locations->Out().AsRegister<Register>(); | 
|  | Register dividend = locations->InAt(0).AsRegister<Register>(); | 
|  | Register temp = locations->GetTemp(0).AsRegister<Register>(); | 
|  | int32_t imm = second.GetConstant()->AsIntConstant()->GetValue(); | 
|  | uint32_t abs_imm = static_cast<uint32_t>(std::abs(imm)); | 
|  | DCHECK(IsPowerOfTwo(abs_imm)); | 
|  | int ctz_imm = CTZ(abs_imm); | 
|  |  | 
|  | if (ctz_imm == 1) { | 
|  | __ Lsr(temp, dividend, 32 - ctz_imm); | 
|  | } else { | 
|  | __ Asr(temp, dividend, 31); | 
|  | __ Lsr(temp, temp, 32 - ctz_imm); | 
|  | } | 
|  | __ add(out, temp, ShifterOperand(dividend)); | 
|  |  | 
|  | if (instruction->IsDiv()) { | 
|  | __ Asr(out, out, ctz_imm); | 
|  | if (imm < 0) { | 
|  | __ rsb(out, out, ShifterOperand(0)); | 
|  | } | 
|  | } else { | 
|  | __ ubfx(out, out, 0, ctz_imm); | 
|  | __ sub(out, out, ShifterOperand(temp)); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::GenerateDivRemWithAnyConstant(HBinaryOperation* instruction) { | 
|  | DCHECK(instruction->IsDiv() || instruction->IsRem()); | 
|  | DCHECK(instruction->GetResultType() == Primitive::kPrimInt); | 
|  |  | 
|  | LocationSummary* locations = instruction->GetLocations(); | 
|  | Location second = locations->InAt(1); | 
|  | DCHECK(second.IsConstant()); | 
|  |  | 
|  | Register out = locations->Out().AsRegister<Register>(); | 
|  | Register dividend = locations->InAt(0).AsRegister<Register>(); | 
|  | Register temp1 = locations->GetTemp(0).AsRegister<Register>(); | 
|  | Register temp2 = locations->GetTemp(1).AsRegister<Register>(); | 
|  | int64_t imm = second.GetConstant()->AsIntConstant()->GetValue(); | 
|  |  | 
|  | int64_t magic; | 
|  | int shift; | 
|  | CalculateMagicAndShiftForDivRem(imm, false /* is_long */, &magic, &shift); | 
|  |  | 
|  | __ LoadImmediate(temp1, magic); | 
|  | __ smull(temp2, temp1, dividend, temp1); | 
|  |  | 
|  | if (imm > 0 && magic < 0) { | 
|  | __ add(temp1, temp1, ShifterOperand(dividend)); | 
|  | } else if (imm < 0 && magic > 0) { | 
|  | __ sub(temp1, temp1, ShifterOperand(dividend)); | 
|  | } | 
|  |  | 
|  | if (shift != 0) { | 
|  | __ Asr(temp1, temp1, shift); | 
|  | } | 
|  |  | 
|  | if (instruction->IsDiv()) { | 
|  | __ sub(out, temp1, ShifterOperand(temp1, ASR, 31)); | 
|  | } else { | 
|  | __ sub(temp1, temp1, ShifterOperand(temp1, ASR, 31)); | 
|  | // TODO: Strength reduction for mls. | 
|  | __ LoadImmediate(temp2, imm); | 
|  | __ mls(out, temp1, temp2, dividend); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::GenerateDivRemConstantIntegral(HBinaryOperation* instruction) { | 
|  | DCHECK(instruction->IsDiv() || instruction->IsRem()); | 
|  | DCHECK(instruction->GetResultType() == Primitive::kPrimInt); | 
|  |  | 
|  | LocationSummary* locations = instruction->GetLocations(); | 
|  | Location second = locations->InAt(1); | 
|  | DCHECK(second.IsConstant()); | 
|  |  | 
|  | int32_t imm = second.GetConstant()->AsIntConstant()->GetValue(); | 
|  | if (imm == 0) { | 
|  | // Do not generate anything. DivZeroCheck would prevent any code to be executed. | 
|  | } else if (imm == 1 || imm == -1) { | 
|  | DivRemOneOrMinusOne(instruction); | 
|  | } else if (IsPowerOfTwo(std::abs(imm))) { | 
|  | DivRemByPowerOfTwo(instruction); | 
|  | } else { | 
|  | DCHECK(imm <= -2 || imm >= 2); | 
|  | GenerateDivRemWithAnyConstant(instruction); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitDiv(HDiv* div) { | 
|  | LocationSummary::CallKind call_kind = LocationSummary::kNoCall; | 
|  | if (div->GetResultType() == Primitive::kPrimLong) { | 
|  | // pLdiv runtime call. | 
|  | call_kind = LocationSummary::kCall; | 
|  | } else if (div->GetResultType() == Primitive::kPrimInt && div->InputAt(1)->IsConstant()) { | 
|  | // sdiv will be replaced by other instruction sequence. | 
|  | } else if (div->GetResultType() == Primitive::kPrimInt && | 
|  | !codegen_->GetInstructionSetFeatures().HasDivideInstruction()) { | 
|  | // pIdivmod runtime call. | 
|  | call_kind = LocationSummary::kCall; | 
|  | } | 
|  |  | 
|  | LocationSummary* locations = new (GetGraph()->GetArena()) LocationSummary(div, call_kind); | 
|  |  | 
|  | switch (div->GetResultType()) { | 
|  | case Primitive::kPrimInt: { | 
|  | if (div->InputAt(1)->IsConstant()) { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RegisterOrConstant(div->InputAt(1))); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | int32_t abs_imm = std::abs(div->InputAt(1)->AsIntConstant()->GetValue()); | 
|  | if (abs_imm <= 1) { | 
|  | // No temp register required. | 
|  | } else { | 
|  | locations->AddTemp(Location::RequiresRegister()); | 
|  | if (!IsPowerOfTwo(abs_imm)) { | 
|  | locations->AddTemp(Location::RequiresRegister()); | 
|  | } | 
|  | } | 
|  | } else if (codegen_->GetInstructionSetFeatures().HasDivideInstruction()) { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | } else { | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | locations->SetInAt(0, Location::RegisterLocation(calling_convention.GetRegisterAt(0))); | 
|  | locations->SetInAt(1, Location::RegisterLocation(calling_convention.GetRegisterAt(1))); | 
|  | // Note: divrem will compute both the quotient and the remainder as the pair R0 and R1, but | 
|  | //       we only need the former. | 
|  | locations->SetOut(Location::RegisterLocation(R0)); | 
|  | } | 
|  | break; | 
|  | } | 
|  | case Primitive::kPrimLong: { | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | locations->SetInAt(0, Location::RegisterPairLocation( | 
|  | calling_convention.GetRegisterAt(0), calling_convention.GetRegisterAt(1))); | 
|  | locations->SetInAt(1, Location::RegisterPairLocation( | 
|  | calling_convention.GetRegisterAt(2), calling_convention.GetRegisterAt(3))); | 
|  | locations->SetOut(Location::RegisterPairLocation(R0, R1)); | 
|  | break; | 
|  | } | 
|  | case Primitive::kPrimFloat: | 
|  | case Primitive::kPrimDouble: { | 
|  | locations->SetInAt(0, Location::RequiresFpuRegister()); | 
|  | locations->SetInAt(1, Location::RequiresFpuRegister()); | 
|  | locations->SetOut(Location::RequiresFpuRegister(), Location::kNoOutputOverlap); | 
|  | break; | 
|  | } | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected div type " << div->GetResultType(); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitDiv(HDiv* div) { | 
|  | LocationSummary* locations = div->GetLocations(); | 
|  | Location out = locations->Out(); | 
|  | Location first = locations->InAt(0); | 
|  | Location second = locations->InAt(1); | 
|  |  | 
|  | switch (div->GetResultType()) { | 
|  | case Primitive::kPrimInt: { | 
|  | if (second.IsConstant()) { | 
|  | GenerateDivRemConstantIntegral(div); | 
|  | } else if (codegen_->GetInstructionSetFeatures().HasDivideInstruction()) { | 
|  | __ sdiv(out.AsRegister<Register>(), | 
|  | first.AsRegister<Register>(), | 
|  | second.AsRegister<Register>()); | 
|  | } else { | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | DCHECK_EQ(calling_convention.GetRegisterAt(0), first.AsRegister<Register>()); | 
|  | DCHECK_EQ(calling_convention.GetRegisterAt(1), second.AsRegister<Register>()); | 
|  | DCHECK_EQ(R0, out.AsRegister<Register>()); | 
|  |  | 
|  | codegen_->InvokeRuntime(QUICK_ENTRY_POINT(pIdivmod), div, div->GetDexPc(), nullptr); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimLong: { | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | DCHECK_EQ(calling_convention.GetRegisterAt(0), first.AsRegisterPairLow<Register>()); | 
|  | DCHECK_EQ(calling_convention.GetRegisterAt(1), first.AsRegisterPairHigh<Register>()); | 
|  | DCHECK_EQ(calling_convention.GetRegisterAt(2), second.AsRegisterPairLow<Register>()); | 
|  | DCHECK_EQ(calling_convention.GetRegisterAt(3), second.AsRegisterPairHigh<Register>()); | 
|  | DCHECK_EQ(R0, out.AsRegisterPairLow<Register>()); | 
|  | DCHECK_EQ(R1, out.AsRegisterPairHigh<Register>()); | 
|  |  | 
|  | codegen_->InvokeRuntime(QUICK_ENTRY_POINT(pLdiv), div, div->GetDexPc(), nullptr); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimFloat: { | 
|  | __ vdivs(out.AsFpuRegister<SRegister>(), | 
|  | first.AsFpuRegister<SRegister>(), | 
|  | second.AsFpuRegister<SRegister>()); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimDouble: { | 
|  | __ vdivd(FromLowSToD(out.AsFpuRegisterPairLow<SRegister>()), | 
|  | FromLowSToD(first.AsFpuRegisterPairLow<SRegister>()), | 
|  | FromLowSToD(second.AsFpuRegisterPairLow<SRegister>())); | 
|  | break; | 
|  | } | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected div type " << div->GetResultType(); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitRem(HRem* rem) { | 
|  | Primitive::Type type = rem->GetResultType(); | 
|  |  | 
|  | // Most remainders are implemented in the runtime. | 
|  | LocationSummary::CallKind call_kind = LocationSummary::kCall; | 
|  | if (rem->GetResultType() == Primitive::kPrimInt && rem->InputAt(1)->IsConstant()) { | 
|  | // sdiv will be replaced by other instruction sequence. | 
|  | call_kind = LocationSummary::kNoCall; | 
|  | } else if ((rem->GetResultType() == Primitive::kPrimInt) | 
|  | && codegen_->GetInstructionSetFeatures().HasDivideInstruction()) { | 
|  | // Have hardware divide instruction for int, do it with three instructions. | 
|  | call_kind = LocationSummary::kNoCall; | 
|  | } | 
|  |  | 
|  | LocationSummary* locations = new (GetGraph()->GetArena()) LocationSummary(rem, call_kind); | 
|  |  | 
|  | switch (type) { | 
|  | case Primitive::kPrimInt: { | 
|  | if (rem->InputAt(1)->IsConstant()) { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RegisterOrConstant(rem->InputAt(1))); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | int32_t abs_imm = std::abs(rem->InputAt(1)->AsIntConstant()->GetValue()); | 
|  | if (abs_imm <= 1) { | 
|  | // No temp register required. | 
|  | } else { | 
|  | locations->AddTemp(Location::RequiresRegister()); | 
|  | if (!IsPowerOfTwo(abs_imm)) { | 
|  | locations->AddTemp(Location::RequiresRegister()); | 
|  | } | 
|  | } | 
|  | } else if (codegen_->GetInstructionSetFeatures().HasDivideInstruction()) { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | locations->AddTemp(Location::RequiresRegister()); | 
|  | } else { | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | locations->SetInAt(0, Location::RegisterLocation(calling_convention.GetRegisterAt(0))); | 
|  | locations->SetInAt(1, Location::RegisterLocation(calling_convention.GetRegisterAt(1))); | 
|  | // Note: divrem will compute both the quotient and the remainder as the pair R0 and R1, but | 
|  | //       we only need the latter. | 
|  | locations->SetOut(Location::RegisterLocation(R1)); | 
|  | } | 
|  | break; | 
|  | } | 
|  | case Primitive::kPrimLong: { | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | locations->SetInAt(0, Location::RegisterPairLocation( | 
|  | calling_convention.GetRegisterAt(0), calling_convention.GetRegisterAt(1))); | 
|  | locations->SetInAt(1, Location::RegisterPairLocation( | 
|  | calling_convention.GetRegisterAt(2), calling_convention.GetRegisterAt(3))); | 
|  | // The runtime helper puts the output in R2,R3. | 
|  | locations->SetOut(Location::RegisterPairLocation(R2, R3)); | 
|  | break; | 
|  | } | 
|  | case Primitive::kPrimFloat: { | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | locations->SetInAt(0, Location::FpuRegisterLocation(calling_convention.GetFpuRegisterAt(0))); | 
|  | locations->SetInAt(1, Location::FpuRegisterLocation(calling_convention.GetFpuRegisterAt(1))); | 
|  | locations->SetOut(Location::FpuRegisterLocation(S0)); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimDouble: { | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | locations->SetInAt(0, Location::FpuRegisterPairLocation( | 
|  | calling_convention.GetFpuRegisterAt(0), calling_convention.GetFpuRegisterAt(1))); | 
|  | locations->SetInAt(1, Location::FpuRegisterPairLocation( | 
|  | calling_convention.GetFpuRegisterAt(2), calling_convention.GetFpuRegisterAt(3))); | 
|  | locations->SetOut(Location::Location::FpuRegisterPairLocation(S0, S1)); | 
|  | break; | 
|  | } | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected rem type " << type; | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitRem(HRem* rem) { | 
|  | LocationSummary* locations = rem->GetLocations(); | 
|  | Location out = locations->Out(); | 
|  | Location first = locations->InAt(0); | 
|  | Location second = locations->InAt(1); | 
|  |  | 
|  | Primitive::Type type = rem->GetResultType(); | 
|  | switch (type) { | 
|  | case Primitive::kPrimInt: { | 
|  | if (second.IsConstant()) { | 
|  | GenerateDivRemConstantIntegral(rem); | 
|  | } else if (codegen_->GetInstructionSetFeatures().HasDivideInstruction()) { | 
|  | Register reg1 = first.AsRegister<Register>(); | 
|  | Register reg2 = second.AsRegister<Register>(); | 
|  | Register temp = locations->GetTemp(0).AsRegister<Register>(); | 
|  |  | 
|  | // temp = reg1 / reg2  (integer division) | 
|  | // dest = reg1 - temp * reg2 | 
|  | __ sdiv(temp, reg1, reg2); | 
|  | __ mls(out.AsRegister<Register>(), temp, reg2, reg1); | 
|  | } else { | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | DCHECK_EQ(calling_convention.GetRegisterAt(0), first.AsRegister<Register>()); | 
|  | DCHECK_EQ(calling_convention.GetRegisterAt(1), second.AsRegister<Register>()); | 
|  | DCHECK_EQ(R1, out.AsRegister<Register>()); | 
|  |  | 
|  | codegen_->InvokeRuntime(QUICK_ENTRY_POINT(pIdivmod), rem, rem->GetDexPc(), nullptr); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimLong: { | 
|  | codegen_->InvokeRuntime(QUICK_ENTRY_POINT(pLmod), rem, rem->GetDexPc(), nullptr); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimFloat: { | 
|  | codegen_->InvokeRuntime(QUICK_ENTRY_POINT(pFmodf), rem, rem->GetDexPc(), nullptr); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimDouble: { | 
|  | codegen_->InvokeRuntime(QUICK_ENTRY_POINT(pFmod), rem, rem->GetDexPc(), nullptr); | 
|  | break; | 
|  | } | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected rem type " << type; | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitDivZeroCheck(HDivZeroCheck* instruction) { | 
|  | LocationSummary::CallKind call_kind = instruction->CanThrowIntoCatchBlock() | 
|  | ? LocationSummary::kCallOnSlowPath | 
|  | : LocationSummary::kNoCall; | 
|  | LocationSummary* locations = new (GetGraph()->GetArena()) LocationSummary(instruction, call_kind); | 
|  | locations->SetInAt(0, Location::RegisterOrConstant(instruction->InputAt(0))); | 
|  | if (instruction->HasUses()) { | 
|  | locations->SetOut(Location::SameAsFirstInput()); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitDivZeroCheck(HDivZeroCheck* instruction) { | 
|  | SlowPathCode* slow_path = new (GetGraph()->GetArena()) DivZeroCheckSlowPathARM(instruction); | 
|  | codegen_->AddSlowPath(slow_path); | 
|  |  | 
|  | LocationSummary* locations = instruction->GetLocations(); | 
|  | Location value = locations->InAt(0); | 
|  |  | 
|  | switch (instruction->GetType()) { | 
|  | case Primitive::kPrimByte: | 
|  | case Primitive::kPrimChar: | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimInt: { | 
|  | if (value.IsRegister()) { | 
|  | __ CompareAndBranchIfZero(value.AsRegister<Register>(), slow_path->GetEntryLabel()); | 
|  | } else { | 
|  | DCHECK(value.IsConstant()) << value; | 
|  | if (value.GetConstant()->AsIntConstant()->GetValue() == 0) { | 
|  | __ b(slow_path->GetEntryLabel()); | 
|  | } | 
|  | } | 
|  | break; | 
|  | } | 
|  | case Primitive::kPrimLong: { | 
|  | if (value.IsRegisterPair()) { | 
|  | __ orrs(IP, | 
|  | value.AsRegisterPairLow<Register>(), | 
|  | ShifterOperand(value.AsRegisterPairHigh<Register>())); | 
|  | __ b(slow_path->GetEntryLabel(), EQ); | 
|  | } else { | 
|  | DCHECK(value.IsConstant()) << value; | 
|  | if (value.GetConstant()->AsLongConstant()->GetValue() == 0) { | 
|  | __ b(slow_path->GetEntryLabel()); | 
|  | } | 
|  | } | 
|  | break; | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type for HDivZeroCheck " << instruction->GetType(); | 
|  | } | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::HandleShift(HBinaryOperation* op) { | 
|  | DCHECK(op->IsShl() || op->IsShr() || op->IsUShr()); | 
|  |  | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(op, LocationSummary::kNoCall); | 
|  |  | 
|  | switch (op->GetResultType()) { | 
|  | case Primitive::kPrimInt: { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RegisterOrConstant(op->InputAt(1))); | 
|  | // Make the output overlap, as it will be used to hold the masked | 
|  | // second input. | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kOutputOverlap); | 
|  | break; | 
|  | } | 
|  | case Primitive::kPrimLong: { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RequiresRegister()); | 
|  | locations->AddTemp(Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister()); | 
|  | break; | 
|  | } | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected operation type " << op->GetResultType(); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::HandleShift(HBinaryOperation* op) { | 
|  | DCHECK(op->IsShl() || op->IsShr() || op->IsUShr()); | 
|  |  | 
|  | LocationSummary* locations = op->GetLocations(); | 
|  | Location out = locations->Out(); | 
|  | Location first = locations->InAt(0); | 
|  | Location second = locations->InAt(1); | 
|  |  | 
|  | Primitive::Type type = op->GetResultType(); | 
|  | switch (type) { | 
|  | case Primitive::kPrimInt: { | 
|  | Register out_reg = out.AsRegister<Register>(); | 
|  | Register first_reg = first.AsRegister<Register>(); | 
|  | // Arm doesn't mask the shift count so we need to do it ourselves. | 
|  | if (second.IsRegister()) { | 
|  | Register second_reg = second.AsRegister<Register>(); | 
|  | __ and_(out_reg, second_reg, ShifterOperand(kMaxIntShiftValue)); | 
|  | if (op->IsShl()) { | 
|  | __ Lsl(out_reg, first_reg, out_reg); | 
|  | } else if (op->IsShr()) { | 
|  | __ Asr(out_reg, first_reg, out_reg); | 
|  | } else { | 
|  | __ Lsr(out_reg, first_reg, out_reg); | 
|  | } | 
|  | } else { | 
|  | int32_t cst = second.GetConstant()->AsIntConstant()->GetValue(); | 
|  | uint32_t shift_value = static_cast<uint32_t>(cst & kMaxIntShiftValue); | 
|  | if (shift_value == 0) {  // arm does not support shifting with 0 immediate. | 
|  | __ Mov(out_reg, first_reg); | 
|  | } else if (op->IsShl()) { | 
|  | __ Lsl(out_reg, first_reg, shift_value); | 
|  | } else if (op->IsShr()) { | 
|  | __ Asr(out_reg, first_reg, shift_value); | 
|  | } else { | 
|  | __ Lsr(out_reg, first_reg, shift_value); | 
|  | } | 
|  | } | 
|  | break; | 
|  | } | 
|  | case Primitive::kPrimLong: { | 
|  | Register o_h = out.AsRegisterPairHigh<Register>(); | 
|  | Register o_l = out.AsRegisterPairLow<Register>(); | 
|  |  | 
|  | Register temp = locations->GetTemp(0).AsRegister<Register>(); | 
|  |  | 
|  | Register high = first.AsRegisterPairHigh<Register>(); | 
|  | Register low = first.AsRegisterPairLow<Register>(); | 
|  |  | 
|  | Register second_reg = second.AsRegister<Register>(); | 
|  |  | 
|  | if (op->IsShl()) { | 
|  | __ and_(o_l, second_reg, ShifterOperand(kMaxLongShiftValue)); | 
|  | // Shift the high part | 
|  | __ Lsl(o_h, high, o_l); | 
|  | // Shift the low part and `or` what overflew on the high part | 
|  | __ rsb(temp, o_l, ShifterOperand(kArmBitsPerWord)); | 
|  | __ Lsr(temp, low, temp); | 
|  | __ orr(o_h, o_h, ShifterOperand(temp)); | 
|  | // If the shift is > 32 bits, override the high part | 
|  | __ subs(temp, o_l, ShifterOperand(kArmBitsPerWord)); | 
|  | __ it(PL); | 
|  | __ Lsl(o_h, low, temp, PL); | 
|  | // Shift the low part | 
|  | __ Lsl(o_l, low, o_l); | 
|  | } else if (op->IsShr()) { | 
|  | __ and_(o_h, second_reg, ShifterOperand(kMaxLongShiftValue)); | 
|  | // Shift the low part | 
|  | __ Lsr(o_l, low, o_h); | 
|  | // Shift the high part and `or` what underflew on the low part | 
|  | __ rsb(temp, o_h, ShifterOperand(kArmBitsPerWord)); | 
|  | __ Lsl(temp, high, temp); | 
|  | __ orr(o_l, o_l, ShifterOperand(temp)); | 
|  | // If the shift is > 32 bits, override the low part | 
|  | __ subs(temp, o_h, ShifterOperand(kArmBitsPerWord)); | 
|  | __ it(PL); | 
|  | __ Asr(o_l, high, temp, PL); | 
|  | // Shift the high part | 
|  | __ Asr(o_h, high, o_h); | 
|  | } else { | 
|  | __ and_(o_h, second_reg, ShifterOperand(kMaxLongShiftValue)); | 
|  | // same as Shr except we use `Lsr`s and not `Asr`s | 
|  | __ Lsr(o_l, low, o_h); | 
|  | __ rsb(temp, o_h, ShifterOperand(kArmBitsPerWord)); | 
|  | __ Lsl(temp, high, temp); | 
|  | __ orr(o_l, o_l, ShifterOperand(temp)); | 
|  | __ subs(temp, o_h, ShifterOperand(kArmBitsPerWord)); | 
|  | __ it(PL); | 
|  | __ Lsr(o_l, high, temp, PL); | 
|  | __ Lsr(o_h, high, o_h); | 
|  | } | 
|  | break; | 
|  | } | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected operation type " << type; | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitShl(HShl* shl) { | 
|  | HandleShift(shl); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitShl(HShl* shl) { | 
|  | HandleShift(shl); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitShr(HShr* shr) { | 
|  | HandleShift(shr); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitShr(HShr* shr) { | 
|  | HandleShift(shr); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitUShr(HUShr* ushr) { | 
|  | HandleShift(ushr); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitUShr(HUShr* ushr) { | 
|  | HandleShift(ushr); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitNewInstance(HNewInstance* instruction) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(instruction, LocationSummary::kCall); | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | locations->AddTemp(Location::RegisterLocation(calling_convention.GetRegisterAt(0))); | 
|  | locations->SetInAt(0, Location::RegisterLocation(calling_convention.GetRegisterAt(1))); | 
|  | locations->SetOut(Location::RegisterLocation(R0)); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitNewInstance(HNewInstance* instruction) { | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | __ LoadImmediate(calling_convention.GetRegisterAt(0), instruction->GetTypeIndex()); | 
|  | // Note: if heap poisoning is enabled, the entry point takes cares | 
|  | // of poisoning the reference. | 
|  | codegen_->InvokeRuntime(instruction->GetEntrypoint(), | 
|  | instruction, | 
|  | instruction->GetDexPc(), | 
|  | nullptr); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitNewArray(HNewArray* instruction) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(instruction, LocationSummary::kCall); | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | locations->AddTemp(Location::RegisterLocation(calling_convention.GetRegisterAt(0))); | 
|  | locations->SetOut(Location::RegisterLocation(R0)); | 
|  | locations->SetInAt(0, Location::RegisterLocation(calling_convention.GetRegisterAt(1))); | 
|  | locations->SetInAt(1, Location::RegisterLocation(calling_convention.GetRegisterAt(2))); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitNewArray(HNewArray* instruction) { | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | __ LoadImmediate(calling_convention.GetRegisterAt(0), instruction->GetTypeIndex()); | 
|  | // Note: if heap poisoning is enabled, the entry point takes cares | 
|  | // of poisoning the reference. | 
|  | codegen_->InvokeRuntime(instruction->GetEntrypoint(), | 
|  | instruction, | 
|  | instruction->GetDexPc(), | 
|  | nullptr); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitParameterValue(HParameterValue* instruction) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(instruction, LocationSummary::kNoCall); | 
|  | Location location = parameter_visitor_.GetNextLocation(instruction->GetType()); | 
|  | if (location.IsStackSlot()) { | 
|  | location = Location::StackSlot(location.GetStackIndex() + codegen_->GetFrameSize()); | 
|  | } else if (location.IsDoubleStackSlot()) { | 
|  | location = Location::DoubleStackSlot(location.GetStackIndex() + codegen_->GetFrameSize()); | 
|  | } | 
|  | locations->SetOut(location); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitParameterValue( | 
|  | HParameterValue* instruction ATTRIBUTE_UNUSED) { | 
|  | // Nothing to do, the parameter is already at its location. | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitCurrentMethod(HCurrentMethod* instruction) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(instruction, LocationSummary::kNoCall); | 
|  | locations->SetOut(Location::RegisterLocation(kMethodRegisterArgument)); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitCurrentMethod(HCurrentMethod* instruction ATTRIBUTE_UNUSED) { | 
|  | // Nothing to do, the method is already at its location. | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitNot(HNot* not_) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(not_, LocationSummary::kNoCall); | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitNot(HNot* not_) { | 
|  | LocationSummary* locations = not_->GetLocations(); | 
|  | Location out = locations->Out(); | 
|  | Location in = locations->InAt(0); | 
|  | switch (not_->GetResultType()) { | 
|  | case Primitive::kPrimInt: | 
|  | __ mvn(out.AsRegister<Register>(), ShifterOperand(in.AsRegister<Register>())); | 
|  | break; | 
|  |  | 
|  | case Primitive::kPrimLong: | 
|  | __ mvn(out.AsRegisterPairLow<Register>(), | 
|  | ShifterOperand(in.AsRegisterPairLow<Register>())); | 
|  | __ mvn(out.AsRegisterPairHigh<Register>(), | 
|  | ShifterOperand(in.AsRegisterPairHigh<Register>())); | 
|  | break; | 
|  |  | 
|  | default: | 
|  | LOG(FATAL) << "Unimplemented type for not operation " << not_->GetResultType(); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitBooleanNot(HBooleanNot* bool_not) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(bool_not, LocationSummary::kNoCall); | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitBooleanNot(HBooleanNot* bool_not) { | 
|  | LocationSummary* locations = bool_not->GetLocations(); | 
|  | Location out = locations->Out(); | 
|  | Location in = locations->InAt(0); | 
|  | __ eor(out.AsRegister<Register>(), in.AsRegister<Register>(), ShifterOperand(1)); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitCompare(HCompare* compare) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(compare, LocationSummary::kNoCall); | 
|  | switch (compare->InputAt(0)->GetType()) { | 
|  | case Primitive::kPrimLong: { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RequiresRegister()); | 
|  | // Output overlaps because it is written before doing the low comparison. | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kOutputOverlap); | 
|  | break; | 
|  | } | 
|  | case Primitive::kPrimFloat: | 
|  | case Primitive::kPrimDouble: { | 
|  | locations->SetInAt(0, Location::RequiresFpuRegister()); | 
|  | locations->SetInAt(1, Location::RequiresFpuRegister()); | 
|  | locations->SetOut(Location::RequiresRegister()); | 
|  | break; | 
|  | } | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected type for compare operation " << compare->InputAt(0)->GetType(); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitCompare(HCompare* compare) { | 
|  | LocationSummary* locations = compare->GetLocations(); | 
|  | Register out = locations->Out().AsRegister<Register>(); | 
|  | Location left = locations->InAt(0); | 
|  | Location right = locations->InAt(1); | 
|  |  | 
|  | Label less, greater, done; | 
|  | Primitive::Type type = compare->InputAt(0)->GetType(); | 
|  | switch (type) { | 
|  | case Primitive::kPrimLong: { | 
|  | __ cmp(left.AsRegisterPairHigh<Register>(), | 
|  | ShifterOperand(right.AsRegisterPairHigh<Register>()));  // Signed compare. | 
|  | __ b(&less, LT); | 
|  | __ b(&greater, GT); | 
|  | // Do LoadImmediate before the last `cmp`, as LoadImmediate might affect the status flags. | 
|  | __ LoadImmediate(out, 0); | 
|  | __ cmp(left.AsRegisterPairLow<Register>(), | 
|  | ShifterOperand(right.AsRegisterPairLow<Register>()));  // Unsigned compare. | 
|  | break; | 
|  | } | 
|  | case Primitive::kPrimFloat: | 
|  | case Primitive::kPrimDouble: { | 
|  | __ LoadImmediate(out, 0); | 
|  | if (type == Primitive::kPrimFloat) { | 
|  | __ vcmps(left.AsFpuRegister<SRegister>(), right.AsFpuRegister<SRegister>()); | 
|  | } else { | 
|  | __ vcmpd(FromLowSToD(left.AsFpuRegisterPairLow<SRegister>()), | 
|  | FromLowSToD(right.AsFpuRegisterPairLow<SRegister>())); | 
|  | } | 
|  | __ vmstat();  // transfer FP status register to ARM APSR. | 
|  | __ b(compare->IsGtBias() ? &greater : &less, VS);  // VS for unordered. | 
|  | break; | 
|  | } | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected compare type " << type; | 
|  | } | 
|  | __ b(&done, EQ); | 
|  | __ b(&less, LO);  // LO is for both: unsigned compare for longs and 'less than' for floats. | 
|  |  | 
|  | __ Bind(&greater); | 
|  | __ LoadImmediate(out, 1); | 
|  | __ b(&done); | 
|  |  | 
|  | __ Bind(&less); | 
|  | __ LoadImmediate(out, -1); | 
|  |  | 
|  | __ Bind(&done); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitPhi(HPhi* instruction) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(instruction, LocationSummary::kNoCall); | 
|  | for (size_t i = 0, e = instruction->InputCount(); i < e; ++i) { | 
|  | locations->SetInAt(i, Location::Any()); | 
|  | } | 
|  | locations->SetOut(Location::Any()); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitPhi(HPhi* instruction) { | 
|  | UNUSED(instruction); | 
|  | LOG(FATAL) << "Unreachable"; | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::GenerateMemoryBarrier(MemBarrierKind kind) { | 
|  | // TODO (ported from quick): revisit Arm barrier kinds | 
|  | DmbOptions flavor = DmbOptions::ISH;  // quiet c++ warnings | 
|  | switch (kind) { | 
|  | case MemBarrierKind::kAnyStore: | 
|  | case MemBarrierKind::kLoadAny: | 
|  | case MemBarrierKind::kAnyAny: { | 
|  | flavor = DmbOptions::ISH; | 
|  | break; | 
|  | } | 
|  | case MemBarrierKind::kStoreStore: { | 
|  | flavor = DmbOptions::ISHST; | 
|  | break; | 
|  | } | 
|  | default: | 
|  | LOG(FATAL) << "Unexpected memory barrier " << kind; | 
|  | } | 
|  | __ dmb(flavor); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::GenerateWideAtomicLoad(Register addr, | 
|  | uint32_t offset, | 
|  | Register out_lo, | 
|  | Register out_hi) { | 
|  | if (offset != 0) { | 
|  | __ LoadImmediate(out_lo, offset); | 
|  | __ add(IP, addr, ShifterOperand(out_lo)); | 
|  | addr = IP; | 
|  | } | 
|  | __ ldrexd(out_lo, out_hi, addr); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::GenerateWideAtomicStore(Register addr, | 
|  | uint32_t offset, | 
|  | Register value_lo, | 
|  | Register value_hi, | 
|  | Register temp1, | 
|  | Register temp2, | 
|  | HInstruction* instruction) { | 
|  | Label fail; | 
|  | if (offset != 0) { | 
|  | __ LoadImmediate(temp1, offset); | 
|  | __ add(IP, addr, ShifterOperand(temp1)); | 
|  | addr = IP; | 
|  | } | 
|  | __ Bind(&fail); | 
|  | // We need a load followed by store. (The address used in a STREX instruction must | 
|  | // be the same as the address in the most recently executed LDREX instruction.) | 
|  | __ ldrexd(temp1, temp2, addr); | 
|  | codegen_->MaybeRecordImplicitNullCheck(instruction); | 
|  | __ strexd(temp1, value_lo, value_hi, addr); | 
|  | __ CompareAndBranchIfNonZero(temp1, &fail); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::HandleFieldSet(HInstruction* instruction, const FieldInfo& field_info) { | 
|  | DCHECK(instruction->IsInstanceFieldSet() || instruction->IsStaticFieldSet()); | 
|  |  | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(instruction, LocationSummary::kNoCall); | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  |  | 
|  | Primitive::Type field_type = field_info.GetFieldType(); | 
|  | if (Primitive::IsFloatingPointType(field_type)) { | 
|  | locations->SetInAt(1, Location::RequiresFpuRegister()); | 
|  | } else { | 
|  | locations->SetInAt(1, Location::RequiresRegister()); | 
|  | } | 
|  |  | 
|  | bool is_wide = field_type == Primitive::kPrimLong || field_type == Primitive::kPrimDouble; | 
|  | bool generate_volatile = field_info.IsVolatile() | 
|  | && is_wide | 
|  | && !codegen_->GetInstructionSetFeatures().HasAtomicLdrdAndStrd(); | 
|  | bool needs_write_barrier = | 
|  | CodeGenerator::StoreNeedsWriteBarrier(field_type, instruction->InputAt(1)); | 
|  | // Temporary registers for the write barrier. | 
|  | // TODO: consider renaming StoreNeedsWriteBarrier to StoreNeedsGCMark. | 
|  | if (needs_write_barrier) { | 
|  | locations->AddTemp(Location::RequiresRegister());  // Possibly used for reference poisoning too. | 
|  | locations->AddTemp(Location::RequiresRegister()); | 
|  | } else if (generate_volatile) { | 
|  | // Arm encoding have some additional constraints for ldrexd/strexd: | 
|  | // - registers need to be consecutive | 
|  | // - the first register should be even but not R14. | 
|  | // We don't test for Arm yet, and the assertion makes sure that we revisit this if we ever | 
|  | // enable Arm encoding. | 
|  | DCHECK_EQ(InstructionSet::kThumb2, codegen_->GetInstructionSet()); | 
|  |  | 
|  | locations->AddTemp(Location::RequiresRegister()); | 
|  | locations->AddTemp(Location::RequiresRegister()); | 
|  | if (field_type == Primitive::kPrimDouble) { | 
|  | // For doubles we need two more registers to copy the value. | 
|  | locations->AddTemp(Location::RegisterLocation(R2)); | 
|  | locations->AddTemp(Location::RegisterLocation(R3)); | 
|  | } | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::HandleFieldSet(HInstruction* instruction, | 
|  | const FieldInfo& field_info, | 
|  | bool value_can_be_null) { | 
|  | DCHECK(instruction->IsInstanceFieldSet() || instruction->IsStaticFieldSet()); | 
|  |  | 
|  | LocationSummary* locations = instruction->GetLocations(); | 
|  | Register base = locations->InAt(0).AsRegister<Register>(); | 
|  | Location value = locations->InAt(1); | 
|  |  | 
|  | bool is_volatile = field_info.IsVolatile(); | 
|  | bool atomic_ldrd_strd = codegen_->GetInstructionSetFeatures().HasAtomicLdrdAndStrd(); | 
|  | Primitive::Type field_type = field_info.GetFieldType(); | 
|  | uint32_t offset = field_info.GetFieldOffset().Uint32Value(); | 
|  | bool needs_write_barrier = | 
|  | CodeGenerator::StoreNeedsWriteBarrier(field_type, instruction->InputAt(1)); | 
|  |  | 
|  | if (is_volatile) { | 
|  | GenerateMemoryBarrier(MemBarrierKind::kAnyStore); | 
|  | } | 
|  |  | 
|  | switch (field_type) { | 
|  | case Primitive::kPrimBoolean: | 
|  | case Primitive::kPrimByte: { | 
|  | __ StoreToOffset(kStoreByte, value.AsRegister<Register>(), base, offset); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimChar: { | 
|  | __ StoreToOffset(kStoreHalfword, value.AsRegister<Register>(), base, offset); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimNot: { | 
|  | if (kPoisonHeapReferences && needs_write_barrier) { | 
|  | // Note that in the case where `value` is a null reference, | 
|  | // we do not enter this block, as a null reference does not | 
|  | // need poisoning. | 
|  | DCHECK_EQ(field_type, Primitive::kPrimNot); | 
|  | Register temp = locations->GetTemp(0).AsRegister<Register>(); | 
|  | __ Mov(temp, value.AsRegister<Register>()); | 
|  | __ PoisonHeapReference(temp); | 
|  | __ StoreToOffset(kStoreWord, temp, base, offset); | 
|  | } else { | 
|  | __ StoreToOffset(kStoreWord, value.AsRegister<Register>(), base, offset); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimLong: { | 
|  | if (is_volatile && !atomic_ldrd_strd) { | 
|  | GenerateWideAtomicStore(base, offset, | 
|  | value.AsRegisterPairLow<Register>(), | 
|  | value.AsRegisterPairHigh<Register>(), | 
|  | locations->GetTemp(0).AsRegister<Register>(), | 
|  | locations->GetTemp(1).AsRegister<Register>(), | 
|  | instruction); | 
|  | } else { | 
|  | __ StoreToOffset(kStoreWordPair, value.AsRegisterPairLow<Register>(), base, offset); | 
|  | codegen_->MaybeRecordImplicitNullCheck(instruction); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimFloat: { | 
|  | __ StoreSToOffset(value.AsFpuRegister<SRegister>(), base, offset); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimDouble: { | 
|  | DRegister value_reg = FromLowSToD(value.AsFpuRegisterPairLow<SRegister>()); | 
|  | if (is_volatile && !atomic_ldrd_strd) { | 
|  | Register value_reg_lo = locations->GetTemp(0).AsRegister<Register>(); | 
|  | Register value_reg_hi = locations->GetTemp(1).AsRegister<Register>(); | 
|  |  | 
|  | __ vmovrrd(value_reg_lo, value_reg_hi, value_reg); | 
|  |  | 
|  | GenerateWideAtomicStore(base, offset, | 
|  | value_reg_lo, | 
|  | value_reg_hi, | 
|  | locations->GetTemp(2).AsRegister<Register>(), | 
|  | locations->GetTemp(3).AsRegister<Register>(), | 
|  | instruction); | 
|  | } else { | 
|  | __ StoreDToOffset(value_reg, base, offset); | 
|  | codegen_->MaybeRecordImplicitNullCheck(instruction); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimVoid: | 
|  | LOG(FATAL) << "Unreachable type " << field_type; | 
|  | UNREACHABLE(); | 
|  | } | 
|  |  | 
|  | // Longs and doubles are handled in the switch. | 
|  | if (field_type != Primitive::kPrimLong && field_type != Primitive::kPrimDouble) { | 
|  | codegen_->MaybeRecordImplicitNullCheck(instruction); | 
|  | } | 
|  |  | 
|  | if (CodeGenerator::StoreNeedsWriteBarrier(field_type, instruction->InputAt(1))) { | 
|  | Register temp = locations->GetTemp(0).AsRegister<Register>(); | 
|  | Register card = locations->GetTemp(1).AsRegister<Register>(); | 
|  | codegen_->MarkGCCard( | 
|  | temp, card, base, value.AsRegister<Register>(), value_can_be_null); | 
|  | } | 
|  |  | 
|  | if (is_volatile) { | 
|  | GenerateMemoryBarrier(MemBarrierKind::kAnyAny); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::HandleFieldGet(HInstruction* instruction, const FieldInfo& field_info) { | 
|  | DCHECK(instruction->IsInstanceFieldGet() || instruction->IsStaticFieldGet()); | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(instruction, LocationSummary::kNoCall); | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  |  | 
|  | bool volatile_for_double = field_info.IsVolatile() | 
|  | && (field_info.GetFieldType() == Primitive::kPrimDouble) | 
|  | && !codegen_->GetInstructionSetFeatures().HasAtomicLdrdAndStrd(); | 
|  | bool overlap = field_info.IsVolatile() && (field_info.GetFieldType() == Primitive::kPrimLong); | 
|  |  | 
|  | if (Primitive::IsFloatingPointType(instruction->GetType())) { | 
|  | locations->SetOut(Location::RequiresFpuRegister()); | 
|  | } else { | 
|  | locations->SetOut(Location::RequiresRegister(), | 
|  | (overlap ? Location::kOutputOverlap : Location::kNoOutputOverlap)); | 
|  | } | 
|  | if (volatile_for_double) { | 
|  | // Arm encoding have some additional constraints for ldrexd/strexd: | 
|  | // - registers need to be consecutive | 
|  | // - the first register should be even but not R14. | 
|  | // We don't test for Arm yet, and the assertion makes sure that we revisit this if we ever | 
|  | // enable Arm encoding. | 
|  | DCHECK_EQ(InstructionSet::kThumb2, codegen_->GetInstructionSet()); | 
|  | locations->AddTemp(Location::RequiresRegister()); | 
|  | locations->AddTemp(Location::RequiresRegister()); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::HandleFieldGet(HInstruction* instruction, | 
|  | const FieldInfo& field_info) { | 
|  | DCHECK(instruction->IsInstanceFieldGet() || instruction->IsStaticFieldGet()); | 
|  |  | 
|  | LocationSummary* locations = instruction->GetLocations(); | 
|  | Register base = locations->InAt(0).AsRegister<Register>(); | 
|  | Location out = locations->Out(); | 
|  | bool is_volatile = field_info.IsVolatile(); | 
|  | bool atomic_ldrd_strd = codegen_->GetInstructionSetFeatures().HasAtomicLdrdAndStrd(); | 
|  | Primitive::Type field_type = field_info.GetFieldType(); | 
|  | uint32_t offset = field_info.GetFieldOffset().Uint32Value(); | 
|  |  | 
|  | switch (field_type) { | 
|  | case Primitive::kPrimBoolean: { | 
|  | __ LoadFromOffset(kLoadUnsignedByte, out.AsRegister<Register>(), base, offset); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimByte: { | 
|  | __ LoadFromOffset(kLoadSignedByte, out.AsRegister<Register>(), base, offset); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimShort: { | 
|  | __ LoadFromOffset(kLoadSignedHalfword, out.AsRegister<Register>(), base, offset); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimChar: { | 
|  | __ LoadFromOffset(kLoadUnsignedHalfword, out.AsRegister<Register>(), base, offset); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimNot: { | 
|  | __ LoadFromOffset(kLoadWord, out.AsRegister<Register>(), base, offset); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimLong: { | 
|  | if (is_volatile && !atomic_ldrd_strd) { | 
|  | GenerateWideAtomicLoad(base, offset, | 
|  | out.AsRegisterPairLow<Register>(), | 
|  | out.AsRegisterPairHigh<Register>()); | 
|  | } else { | 
|  | __ LoadFromOffset(kLoadWordPair, out.AsRegisterPairLow<Register>(), base, offset); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimFloat: { | 
|  | __ LoadSFromOffset(out.AsFpuRegister<SRegister>(), base, offset); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimDouble: { | 
|  | DRegister out_reg = FromLowSToD(out.AsFpuRegisterPairLow<SRegister>()); | 
|  | if (is_volatile && !atomic_ldrd_strd) { | 
|  | Register lo = locations->GetTemp(0).AsRegister<Register>(); | 
|  | Register hi = locations->GetTemp(1).AsRegister<Register>(); | 
|  | GenerateWideAtomicLoad(base, offset, lo, hi); | 
|  | codegen_->MaybeRecordImplicitNullCheck(instruction); | 
|  | __ vmovdrr(out_reg, lo, hi); | 
|  | } else { | 
|  | __ LoadDFromOffset(out_reg, base, offset); | 
|  | codegen_->MaybeRecordImplicitNullCheck(instruction); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimVoid: | 
|  | LOG(FATAL) << "Unreachable type " << field_type; | 
|  | UNREACHABLE(); | 
|  | } | 
|  |  | 
|  | // Doubles are handled in the switch. | 
|  | if (field_type != Primitive::kPrimDouble) { | 
|  | codegen_->MaybeRecordImplicitNullCheck(instruction); | 
|  | } | 
|  |  | 
|  | if (is_volatile) { | 
|  | GenerateMemoryBarrier(MemBarrierKind::kLoadAny); | 
|  | } | 
|  |  | 
|  | if (field_type == Primitive::kPrimNot) { | 
|  | __ MaybeUnpoisonHeapReference(out.AsRegister<Register>()); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitInstanceFieldSet(HInstanceFieldSet* instruction) { | 
|  | HandleFieldSet(instruction, instruction->GetFieldInfo()); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitInstanceFieldSet(HInstanceFieldSet* instruction) { | 
|  | HandleFieldSet(instruction, instruction->GetFieldInfo(), instruction->GetValueCanBeNull()); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitInstanceFieldGet(HInstanceFieldGet* instruction) { | 
|  | HandleFieldGet(instruction, instruction->GetFieldInfo()); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitInstanceFieldGet(HInstanceFieldGet* instruction) { | 
|  | HandleFieldGet(instruction, instruction->GetFieldInfo()); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitStaticFieldGet(HStaticFieldGet* instruction) { | 
|  | HandleFieldGet(instruction, instruction->GetFieldInfo()); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitStaticFieldGet(HStaticFieldGet* instruction) { | 
|  | HandleFieldGet(instruction, instruction->GetFieldInfo()); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitStaticFieldSet(HStaticFieldSet* instruction) { | 
|  | HandleFieldSet(instruction, instruction->GetFieldInfo()); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitStaticFieldSet(HStaticFieldSet* instruction) { | 
|  | HandleFieldSet(instruction, instruction->GetFieldInfo(), instruction->GetValueCanBeNull()); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitUnresolvedInstanceFieldGet( | 
|  | HUnresolvedInstanceFieldGet* instruction) { | 
|  | FieldAccessCallingConventionARM calling_convention; | 
|  | codegen_->CreateUnresolvedFieldLocationSummary( | 
|  | instruction, instruction->GetFieldType(), calling_convention); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitUnresolvedInstanceFieldGet( | 
|  | HUnresolvedInstanceFieldGet* instruction) { | 
|  | FieldAccessCallingConventionARM calling_convention; | 
|  | codegen_->GenerateUnresolvedFieldAccess(instruction, | 
|  | instruction->GetFieldType(), | 
|  | instruction->GetFieldIndex(), | 
|  | instruction->GetDexPc(), | 
|  | calling_convention); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitUnresolvedInstanceFieldSet( | 
|  | HUnresolvedInstanceFieldSet* instruction) { | 
|  | FieldAccessCallingConventionARM calling_convention; | 
|  | codegen_->CreateUnresolvedFieldLocationSummary( | 
|  | instruction, instruction->GetFieldType(), calling_convention); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitUnresolvedInstanceFieldSet( | 
|  | HUnresolvedInstanceFieldSet* instruction) { | 
|  | FieldAccessCallingConventionARM calling_convention; | 
|  | codegen_->GenerateUnresolvedFieldAccess(instruction, | 
|  | instruction->GetFieldType(), | 
|  | instruction->GetFieldIndex(), | 
|  | instruction->GetDexPc(), | 
|  | calling_convention); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitUnresolvedStaticFieldGet( | 
|  | HUnresolvedStaticFieldGet* instruction) { | 
|  | FieldAccessCallingConventionARM calling_convention; | 
|  | codegen_->CreateUnresolvedFieldLocationSummary( | 
|  | instruction, instruction->GetFieldType(), calling_convention); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitUnresolvedStaticFieldGet( | 
|  | HUnresolvedStaticFieldGet* instruction) { | 
|  | FieldAccessCallingConventionARM calling_convention; | 
|  | codegen_->GenerateUnresolvedFieldAccess(instruction, | 
|  | instruction->GetFieldType(), | 
|  | instruction->GetFieldIndex(), | 
|  | instruction->GetDexPc(), | 
|  | calling_convention); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitUnresolvedStaticFieldSet( | 
|  | HUnresolvedStaticFieldSet* instruction) { | 
|  | FieldAccessCallingConventionARM calling_convention; | 
|  | codegen_->CreateUnresolvedFieldLocationSummary( | 
|  | instruction, instruction->GetFieldType(), calling_convention); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitUnresolvedStaticFieldSet( | 
|  | HUnresolvedStaticFieldSet* instruction) { | 
|  | FieldAccessCallingConventionARM calling_convention; | 
|  | codegen_->GenerateUnresolvedFieldAccess(instruction, | 
|  | instruction->GetFieldType(), | 
|  | instruction->GetFieldIndex(), | 
|  | instruction->GetDexPc(), | 
|  | calling_convention); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitNullCheck(HNullCheck* instruction) { | 
|  | LocationSummary::CallKind call_kind = instruction->CanThrowIntoCatchBlock() | 
|  | ? LocationSummary::kCallOnSlowPath | 
|  | : LocationSummary::kNoCall; | 
|  | LocationSummary* locations = new (GetGraph()->GetArena()) LocationSummary(instruction, call_kind); | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | if (instruction->HasUses()) { | 
|  | locations->SetOut(Location::SameAsFirstInput()); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::GenerateImplicitNullCheck(HNullCheck* instruction) { | 
|  | if (codegen_->CanMoveNullCheckToUser(instruction)) { | 
|  | return; | 
|  | } | 
|  | Location obj = instruction->GetLocations()->InAt(0); | 
|  |  | 
|  | __ LoadFromOffset(kLoadWord, IP, obj.AsRegister<Register>(), 0); | 
|  | codegen_->RecordPcInfo(instruction, instruction->GetDexPc()); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::GenerateExplicitNullCheck(HNullCheck* instruction) { | 
|  | SlowPathCode* slow_path = new (GetGraph()->GetArena()) NullCheckSlowPathARM(instruction); | 
|  | codegen_->AddSlowPath(slow_path); | 
|  |  | 
|  | LocationSummary* locations = instruction->GetLocations(); | 
|  | Location obj = locations->InAt(0); | 
|  |  | 
|  | __ CompareAndBranchIfZero(obj.AsRegister<Register>(), slow_path->GetEntryLabel()); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitNullCheck(HNullCheck* instruction) { | 
|  | if (codegen_->IsImplicitNullCheckAllowed(instruction)) { | 
|  | GenerateImplicitNullCheck(instruction); | 
|  | } else { | 
|  | GenerateExplicitNullCheck(instruction); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitArrayGet(HArrayGet* instruction) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(instruction, LocationSummary::kNoCall); | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RegisterOrConstant(instruction->InputAt(1))); | 
|  | if (Primitive::IsFloatingPointType(instruction->GetType())) { | 
|  | locations->SetOut(Location::RequiresFpuRegister(), Location::kNoOutputOverlap); | 
|  | } else { | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitArrayGet(HArrayGet* instruction) { | 
|  | LocationSummary* locations = instruction->GetLocations(); | 
|  | Register obj = locations->InAt(0).AsRegister<Register>(); | 
|  | Location index = locations->InAt(1); | 
|  | Primitive::Type type = instruction->GetType(); | 
|  |  | 
|  | switch (type) { | 
|  | case Primitive::kPrimBoolean: { | 
|  | uint32_t data_offset = mirror::Array::DataOffset(sizeof(uint8_t)).Uint32Value(); | 
|  | Register out = locations->Out().AsRegister<Register>(); | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = | 
|  | (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_1) + data_offset; | 
|  | __ LoadFromOffset(kLoadUnsignedByte, out, obj, offset); | 
|  | } else { | 
|  | __ add(IP, obj, ShifterOperand(index.AsRegister<Register>())); | 
|  | __ LoadFromOffset(kLoadUnsignedByte, out, IP, data_offset); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimByte: { | 
|  | uint32_t data_offset = mirror::Array::DataOffset(sizeof(int8_t)).Uint32Value(); | 
|  | Register out = locations->Out().AsRegister<Register>(); | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = | 
|  | (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_1) + data_offset; | 
|  | __ LoadFromOffset(kLoadSignedByte, out, obj, offset); | 
|  | } else { | 
|  | __ add(IP, obj, ShifterOperand(index.AsRegister<Register>())); | 
|  | __ LoadFromOffset(kLoadSignedByte, out, IP, data_offset); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimShort: { | 
|  | uint32_t data_offset = mirror::Array::DataOffset(sizeof(int16_t)).Uint32Value(); | 
|  | Register out = locations->Out().AsRegister<Register>(); | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = | 
|  | (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_2) + data_offset; | 
|  | __ LoadFromOffset(kLoadSignedHalfword, out, obj, offset); | 
|  | } else { | 
|  | __ add(IP, obj, ShifterOperand(index.AsRegister<Register>(), LSL, TIMES_2)); | 
|  | __ LoadFromOffset(kLoadSignedHalfword, out, IP, data_offset); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimChar: { | 
|  | uint32_t data_offset = mirror::Array::DataOffset(sizeof(uint16_t)).Uint32Value(); | 
|  | Register out = locations->Out().AsRegister<Register>(); | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = | 
|  | (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_2) + data_offset; | 
|  | __ LoadFromOffset(kLoadUnsignedHalfword, out, obj, offset); | 
|  | } else { | 
|  | __ add(IP, obj, ShifterOperand(index.AsRegister<Register>(), LSL, TIMES_2)); | 
|  | __ LoadFromOffset(kLoadUnsignedHalfword, out, IP, data_offset); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimInt: | 
|  | case Primitive::kPrimNot: { | 
|  | static_assert(sizeof(mirror::HeapReference<mirror::Object>) == sizeof(int32_t), | 
|  | "art::mirror::HeapReference<mirror::Object> and int32_t have different sizes."); | 
|  | uint32_t data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Uint32Value(); | 
|  | Register out = locations->Out().AsRegister<Register>(); | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = | 
|  | (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_4) + data_offset; | 
|  | __ LoadFromOffset(kLoadWord, out, obj, offset); | 
|  | } else { | 
|  | __ add(IP, obj, ShifterOperand(index.AsRegister<Register>(), LSL, TIMES_4)); | 
|  | __ LoadFromOffset(kLoadWord, out, IP, data_offset); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimLong: { | 
|  | uint32_t data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Uint32Value(); | 
|  | Location out = locations->Out(); | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = | 
|  | (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_8) + data_offset; | 
|  | __ LoadFromOffset(kLoadWordPair, out.AsRegisterPairLow<Register>(), obj, offset); | 
|  | } else { | 
|  | __ add(IP, obj, ShifterOperand(index.AsRegister<Register>(), LSL, TIMES_8)); | 
|  | __ LoadFromOffset(kLoadWordPair, out.AsRegisterPairLow<Register>(), IP, data_offset); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimFloat: { | 
|  | uint32_t data_offset = mirror::Array::DataOffset(sizeof(float)).Uint32Value(); | 
|  | Location out = locations->Out(); | 
|  | DCHECK(out.IsFpuRegister()); | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_4) + data_offset; | 
|  | __ LoadSFromOffset(out.AsFpuRegister<SRegister>(), obj, offset); | 
|  | } else { | 
|  | __ add(IP, obj, ShifterOperand(index.AsRegister<Register>(), LSL, TIMES_4)); | 
|  | __ LoadSFromOffset(out.AsFpuRegister<SRegister>(), IP, data_offset); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimDouble: { | 
|  | uint32_t data_offset = mirror::Array::DataOffset(sizeof(double)).Uint32Value(); | 
|  | Location out = locations->Out(); | 
|  | DCHECK(out.IsFpuRegisterPair()); | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_8) + data_offset; | 
|  | __ LoadDFromOffset(FromLowSToD(out.AsFpuRegisterPairLow<SRegister>()), obj, offset); | 
|  | } else { | 
|  | __ add(IP, obj, ShifterOperand(index.AsRegister<Register>(), LSL, TIMES_8)); | 
|  | __ LoadDFromOffset(FromLowSToD(out.AsFpuRegisterPairLow<SRegister>()), IP, data_offset); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimVoid: | 
|  | LOG(FATAL) << "Unreachable type " << type; | 
|  | UNREACHABLE(); | 
|  | } | 
|  | codegen_->MaybeRecordImplicitNullCheck(instruction); | 
|  |  | 
|  | if (type == Primitive::kPrimNot) { | 
|  | Register out = locations->Out().AsRegister<Register>(); | 
|  | __ MaybeUnpoisonHeapReference(out); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitArraySet(HArraySet* instruction) { | 
|  | Primitive::Type value_type = instruction->GetComponentType(); | 
|  |  | 
|  | bool needs_write_barrier = | 
|  | CodeGenerator::StoreNeedsWriteBarrier(value_type, instruction->GetValue()); | 
|  | bool may_need_runtime_call = instruction->NeedsTypeCheck(); | 
|  |  | 
|  | LocationSummary* locations = new (GetGraph()->GetArena()) LocationSummary( | 
|  | instruction, | 
|  | may_need_runtime_call ? LocationSummary::kCallOnSlowPath : LocationSummary::kNoCall); | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RegisterOrConstant(instruction->InputAt(1))); | 
|  | if (Primitive::IsFloatingPointType(value_type)) { | 
|  | locations->SetInAt(2, Location::RequiresFpuRegister()); | 
|  | } else { | 
|  | locations->SetInAt(2, Location::RequiresRegister()); | 
|  | } | 
|  |  | 
|  | if (needs_write_barrier) { | 
|  | // Temporary registers for the write barrier. | 
|  | locations->AddTemp(Location::RequiresRegister());  // Possibly used for ref. poisoning too. | 
|  | locations->AddTemp(Location::RequiresRegister()); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitArraySet(HArraySet* instruction) { | 
|  | LocationSummary* locations = instruction->GetLocations(); | 
|  | Register array = locations->InAt(0).AsRegister<Register>(); | 
|  | Location index = locations->InAt(1); | 
|  | Primitive::Type value_type = instruction->GetComponentType(); | 
|  | bool may_need_runtime_call = locations->CanCall(); | 
|  | bool needs_write_barrier = | 
|  | CodeGenerator::StoreNeedsWriteBarrier(value_type, instruction->GetValue()); | 
|  |  | 
|  | switch (value_type) { | 
|  | case Primitive::kPrimBoolean: | 
|  | case Primitive::kPrimByte: { | 
|  | uint32_t data_offset = mirror::Array::DataOffset(sizeof(uint8_t)).Uint32Value(); | 
|  | Register value = locations->InAt(2).AsRegister<Register>(); | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = | 
|  | (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_1) + data_offset; | 
|  | __ StoreToOffset(kStoreByte, value, array, offset); | 
|  | } else { | 
|  | __ add(IP, array, ShifterOperand(index.AsRegister<Register>())); | 
|  | __ StoreToOffset(kStoreByte, value, IP, data_offset); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimShort: | 
|  | case Primitive::kPrimChar: { | 
|  | uint32_t data_offset = mirror::Array::DataOffset(sizeof(uint16_t)).Uint32Value(); | 
|  | Register value = locations->InAt(2).AsRegister<Register>(); | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = | 
|  | (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_2) + data_offset; | 
|  | __ StoreToOffset(kStoreHalfword, value, array, offset); | 
|  | } else { | 
|  | __ add(IP, array, ShifterOperand(index.AsRegister<Register>(), LSL, TIMES_2)); | 
|  | __ StoreToOffset(kStoreHalfword, value, IP, data_offset); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimNot: { | 
|  | uint32_t data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Uint32Value(); | 
|  | Register value = locations->InAt(2).AsRegister<Register>(); | 
|  | Register source = value; | 
|  |  | 
|  | if (instruction->InputAt(2)->IsNullConstant()) { | 
|  | // Just setting null. | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = | 
|  | (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_4) + data_offset; | 
|  | __ StoreToOffset(kStoreWord, source, array, offset); | 
|  | } else { | 
|  | DCHECK(index.IsRegister()) << index; | 
|  | __ add(IP, array, ShifterOperand(index.AsRegister<Register>(), LSL, TIMES_4)); | 
|  | __ StoreToOffset(kStoreWord, source, IP, data_offset); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | DCHECK(needs_write_barrier); | 
|  | Register temp1 = locations->GetTemp(0).AsRegister<Register>(); | 
|  | Register temp2 = locations->GetTemp(1).AsRegister<Register>(); | 
|  | uint32_t class_offset = mirror::Object::ClassOffset().Int32Value(); | 
|  | uint32_t super_offset = mirror::Class::SuperClassOffset().Int32Value(); | 
|  | uint32_t component_offset = mirror::Class::ComponentTypeOffset().Int32Value(); | 
|  | Label done; | 
|  | SlowPathCode* slow_path = nullptr; | 
|  |  | 
|  | if (may_need_runtime_call) { | 
|  | slow_path = new (GetGraph()->GetArena()) ArraySetSlowPathARM(instruction); | 
|  | codegen_->AddSlowPath(slow_path); | 
|  | if (instruction->GetValueCanBeNull()) { | 
|  | Label non_zero; | 
|  | __ CompareAndBranchIfNonZero(value, &non_zero); | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = | 
|  | (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_4) + data_offset; | 
|  | __ StoreToOffset(kStoreWord, value, array, offset); | 
|  | } else { | 
|  | DCHECK(index.IsRegister()) << index; | 
|  | __ add(IP, array, ShifterOperand(index.AsRegister<Register>(), LSL, TIMES_4)); | 
|  | __ StoreToOffset(kStoreWord, value, IP, data_offset); | 
|  | } | 
|  | codegen_->MaybeRecordImplicitNullCheck(instruction); | 
|  | __ b(&done); | 
|  | __ Bind(&non_zero); | 
|  | } | 
|  |  | 
|  | __ LoadFromOffset(kLoadWord, temp1, array, class_offset); | 
|  | codegen_->MaybeRecordImplicitNullCheck(instruction); | 
|  | __ MaybeUnpoisonHeapReference(temp1); | 
|  | __ LoadFromOffset(kLoadWord, temp1, temp1, component_offset); | 
|  | __ LoadFromOffset(kLoadWord, temp2, value, class_offset); | 
|  | // No need to poison/unpoison, we're comparing two poisoined references. | 
|  | __ cmp(temp1, ShifterOperand(temp2)); | 
|  | if (instruction->StaticTypeOfArrayIsObjectArray()) { | 
|  | Label do_put; | 
|  | __ b(&do_put, EQ); | 
|  | __ MaybeUnpoisonHeapReference(temp1); | 
|  | __ LoadFromOffset(kLoadWord, temp1, temp1, super_offset); | 
|  | // No need to poison/unpoison, we're comparing against null. | 
|  | __ CompareAndBranchIfNonZero(temp1, slow_path->GetEntryLabel()); | 
|  | __ Bind(&do_put); | 
|  | } else { | 
|  | __ b(slow_path->GetEntryLabel(), NE); | 
|  | } | 
|  | } | 
|  |  | 
|  | if (kPoisonHeapReferences) { | 
|  | // Note that in the case where `value` is a null reference, | 
|  | // we do not enter this block, as a null reference does not | 
|  | // need poisoning. | 
|  | DCHECK_EQ(value_type, Primitive::kPrimNot); | 
|  | __ Mov(temp1, value); | 
|  | __ PoisonHeapReference(temp1); | 
|  | source = temp1; | 
|  | } | 
|  |  | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = | 
|  | (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_4) + data_offset; | 
|  | __ StoreToOffset(kStoreWord, source, array, offset); | 
|  | } else { | 
|  | DCHECK(index.IsRegister()) << index; | 
|  | __ add(IP, array, ShifterOperand(index.AsRegister<Register>(), LSL, TIMES_4)); | 
|  | __ StoreToOffset(kStoreWord, source, IP, data_offset); | 
|  | } | 
|  |  | 
|  | if (!may_need_runtime_call) { | 
|  | codegen_->MaybeRecordImplicitNullCheck(instruction); | 
|  | } | 
|  |  | 
|  | codegen_->MarkGCCard(temp1, temp2, array, value, instruction->GetValueCanBeNull()); | 
|  |  | 
|  | if (done.IsLinked()) { | 
|  | __ Bind(&done); | 
|  | } | 
|  |  | 
|  | if (slow_path != nullptr) { | 
|  | __ Bind(slow_path->GetExitLabel()); | 
|  | } | 
|  |  | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimInt: { | 
|  | uint32_t data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Uint32Value(); | 
|  | Register value = locations->InAt(2).AsRegister<Register>(); | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = | 
|  | (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_4) + data_offset; | 
|  | __ StoreToOffset(kStoreWord, value, array, offset); | 
|  | } else { | 
|  | DCHECK(index.IsRegister()) << index; | 
|  | __ add(IP, array, ShifterOperand(index.AsRegister<Register>(), LSL, TIMES_4)); | 
|  | __ StoreToOffset(kStoreWord, value, IP, data_offset); | 
|  | } | 
|  |  | 
|  | codegen_->MaybeRecordImplicitNullCheck(instruction); | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimLong: { | 
|  | uint32_t data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Uint32Value(); | 
|  | Location value = locations->InAt(2); | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = | 
|  | (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_8) + data_offset; | 
|  | __ StoreToOffset(kStoreWordPair, value.AsRegisterPairLow<Register>(), array, offset); | 
|  | } else { | 
|  | __ add(IP, array, ShifterOperand(index.AsRegister<Register>(), LSL, TIMES_8)); | 
|  | __ StoreToOffset(kStoreWordPair, value.AsRegisterPairLow<Register>(), IP, data_offset); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimFloat: { | 
|  | uint32_t data_offset = mirror::Array::DataOffset(sizeof(float)).Uint32Value(); | 
|  | Location value = locations->InAt(2); | 
|  | DCHECK(value.IsFpuRegister()); | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_4) + data_offset; | 
|  | __ StoreSToOffset(value.AsFpuRegister<SRegister>(), array, offset); | 
|  | } else { | 
|  | __ add(IP, array, ShifterOperand(index.AsRegister<Register>(), LSL, TIMES_4)); | 
|  | __ StoreSToOffset(value.AsFpuRegister<SRegister>(), IP, data_offset); | 
|  | } | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimDouble: { | 
|  | uint32_t data_offset = mirror::Array::DataOffset(sizeof(double)).Uint32Value(); | 
|  | Location value = locations->InAt(2); | 
|  | DCHECK(value.IsFpuRegisterPair()); | 
|  | if (index.IsConstant()) { | 
|  | size_t offset = (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_8) + data_offset; | 
|  | __ StoreDToOffset(FromLowSToD(value.AsFpuRegisterPairLow<SRegister>()), array, offset); | 
|  | } else { | 
|  | __ add(IP, array, ShifterOperand(index.AsRegister<Register>(), LSL, TIMES_8)); | 
|  | __ StoreDToOffset(FromLowSToD(value.AsFpuRegisterPairLow<SRegister>()), IP, data_offset); | 
|  | } | 
|  |  | 
|  | break; | 
|  | } | 
|  |  | 
|  | case Primitive::kPrimVoid: | 
|  | LOG(FATAL) << "Unreachable type " << value_type; | 
|  | UNREACHABLE(); | 
|  | } | 
|  |  | 
|  | // Ints and objects are handled in the switch. | 
|  | if (value_type != Primitive::kPrimInt && value_type != Primitive::kPrimNot) { | 
|  | codegen_->MaybeRecordImplicitNullCheck(instruction); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitArrayLength(HArrayLength* instruction) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(instruction, LocationSummary::kNoCall); | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitArrayLength(HArrayLength* instruction) { | 
|  | LocationSummary* locations = instruction->GetLocations(); | 
|  | uint32_t offset = mirror::Array::LengthOffset().Uint32Value(); | 
|  | Register obj = locations->InAt(0).AsRegister<Register>(); | 
|  | Register out = locations->Out().AsRegister<Register>(); | 
|  | __ LoadFromOffset(kLoadWord, out, obj, offset); | 
|  | codegen_->MaybeRecordImplicitNullCheck(instruction); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitBoundsCheck(HBoundsCheck* instruction) { | 
|  | LocationSummary::CallKind call_kind = instruction->CanThrowIntoCatchBlock() | 
|  | ? LocationSummary::kCallOnSlowPath | 
|  | : LocationSummary::kNoCall; | 
|  | LocationSummary* locations = new (GetGraph()->GetArena()) LocationSummary(instruction, call_kind); | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RequiresRegister()); | 
|  | if (instruction->HasUses()) { | 
|  | locations->SetOut(Location::SameAsFirstInput()); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitBoundsCheck(HBoundsCheck* instruction) { | 
|  | LocationSummary* locations = instruction->GetLocations(); | 
|  | SlowPathCode* slow_path = | 
|  | new (GetGraph()->GetArena()) BoundsCheckSlowPathARM(instruction); | 
|  | codegen_->AddSlowPath(slow_path); | 
|  |  | 
|  | Register index = locations->InAt(0).AsRegister<Register>(); | 
|  | Register length = locations->InAt(1).AsRegister<Register>(); | 
|  |  | 
|  | __ cmp(index, ShifterOperand(length)); | 
|  | __ b(slow_path->GetEntryLabel(), HS); | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::MarkGCCard(Register temp, | 
|  | Register card, | 
|  | Register object, | 
|  | Register value, | 
|  | bool can_be_null) { | 
|  | Label is_null; | 
|  | if (can_be_null) { | 
|  | __ CompareAndBranchIfZero(value, &is_null); | 
|  | } | 
|  | __ LoadFromOffset(kLoadWord, card, TR, Thread::CardTableOffset<kArmWordSize>().Int32Value()); | 
|  | __ Lsr(temp, object, gc::accounting::CardTable::kCardShift); | 
|  | __ strb(card, Address(card, temp)); | 
|  | if (can_be_null) { | 
|  | __ Bind(&is_null); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitTemporary(HTemporary* temp) { | 
|  | temp->SetLocations(nullptr); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitTemporary(HTemporary* temp) { | 
|  | // Nothing to do, this is driven by the code generator. | 
|  | UNUSED(temp); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitParallelMove(HParallelMove* instruction) { | 
|  | UNUSED(instruction); | 
|  | LOG(FATAL) << "Unreachable"; | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitParallelMove(HParallelMove* instruction) { | 
|  | codegen_->GetMoveResolver()->EmitNativeCode(instruction); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitSuspendCheck(HSuspendCheck* instruction) { | 
|  | new (GetGraph()->GetArena()) LocationSummary(instruction, LocationSummary::kCallOnSlowPath); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitSuspendCheck(HSuspendCheck* instruction) { | 
|  | HBasicBlock* block = instruction->GetBlock(); | 
|  | if (block->GetLoopInformation() != nullptr) { | 
|  | DCHECK(block->GetLoopInformation()->GetSuspendCheck() == instruction); | 
|  | // The back edge will generate the suspend check. | 
|  | return; | 
|  | } | 
|  | if (block->IsEntryBlock() && instruction->GetNext()->IsGoto()) { | 
|  | // The goto will generate the suspend check. | 
|  | return; | 
|  | } | 
|  | GenerateSuspendCheck(instruction, nullptr); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::GenerateSuspendCheck(HSuspendCheck* instruction, | 
|  | HBasicBlock* successor) { | 
|  | SuspendCheckSlowPathARM* slow_path = | 
|  | down_cast<SuspendCheckSlowPathARM*>(instruction->GetSlowPath()); | 
|  | if (slow_path == nullptr) { | 
|  | slow_path = new (GetGraph()->GetArena()) SuspendCheckSlowPathARM(instruction, successor); | 
|  | instruction->SetSlowPath(slow_path); | 
|  | codegen_->AddSlowPath(slow_path); | 
|  | if (successor != nullptr) { | 
|  | DCHECK(successor->IsLoopHeader()); | 
|  | codegen_->ClearSpillSlotsFromLoopPhisInStackMap(instruction); | 
|  | } | 
|  | } else { | 
|  | DCHECK_EQ(slow_path->GetSuccessor(), successor); | 
|  | } | 
|  |  | 
|  | __ LoadFromOffset( | 
|  | kLoadUnsignedHalfword, IP, TR, Thread::ThreadFlagsOffset<kArmWordSize>().Int32Value()); | 
|  | if (successor == nullptr) { | 
|  | __ CompareAndBranchIfNonZero(IP, slow_path->GetEntryLabel()); | 
|  | __ Bind(slow_path->GetReturnLabel()); | 
|  | } else { | 
|  | __ CompareAndBranchIfZero(IP, codegen_->GetLabelOf(successor)); | 
|  | __ b(slow_path->GetEntryLabel()); | 
|  | } | 
|  | } | 
|  |  | 
|  | ArmAssembler* ParallelMoveResolverARM::GetAssembler() const { | 
|  | return codegen_->GetAssembler(); | 
|  | } | 
|  |  | 
|  | void ParallelMoveResolverARM::EmitMove(size_t index) { | 
|  | MoveOperands* move = moves_[index]; | 
|  | Location source = move->GetSource(); | 
|  | Location destination = move->GetDestination(); | 
|  |  | 
|  | if (source.IsRegister()) { | 
|  | if (destination.IsRegister()) { | 
|  | __ Mov(destination.AsRegister<Register>(), source.AsRegister<Register>()); | 
|  | } else { | 
|  | DCHECK(destination.IsStackSlot()); | 
|  | __ StoreToOffset(kStoreWord, source.AsRegister<Register>(), | 
|  | SP, destination.GetStackIndex()); | 
|  | } | 
|  | } else if (source.IsStackSlot()) { | 
|  | if (destination.IsRegister()) { | 
|  | __ LoadFromOffset(kLoadWord, destination.AsRegister<Register>(), | 
|  | SP, source.GetStackIndex()); | 
|  | } else if (destination.IsFpuRegister()) { | 
|  | __ LoadSFromOffset(destination.AsFpuRegister<SRegister>(), SP, source.GetStackIndex()); | 
|  | } else { | 
|  | DCHECK(destination.IsStackSlot()); | 
|  | __ LoadFromOffset(kLoadWord, IP, SP, source.GetStackIndex()); | 
|  | __ StoreToOffset(kStoreWord, IP, SP, destination.GetStackIndex()); | 
|  | } | 
|  | } else if (source.IsFpuRegister()) { | 
|  | if (destination.IsFpuRegister()) { | 
|  | __ vmovs(destination.AsFpuRegister<SRegister>(), source.AsFpuRegister<SRegister>()); | 
|  | } else { | 
|  | DCHECK(destination.IsStackSlot()); | 
|  | __ StoreSToOffset(source.AsFpuRegister<SRegister>(), SP, destination.GetStackIndex()); | 
|  | } | 
|  | } else if (source.IsDoubleStackSlot()) { | 
|  | if (destination.IsDoubleStackSlot()) { | 
|  | __ LoadDFromOffset(DTMP, SP, source.GetStackIndex()); | 
|  | __ StoreDToOffset(DTMP, SP, destination.GetStackIndex()); | 
|  | } else if (destination.IsRegisterPair()) { | 
|  | DCHECK(ExpectedPairLayout(destination)); | 
|  | __ LoadFromOffset( | 
|  | kLoadWordPair, destination.AsRegisterPairLow<Register>(), SP, source.GetStackIndex()); | 
|  | } else { | 
|  | DCHECK(destination.IsFpuRegisterPair()) << destination; | 
|  | __ LoadDFromOffset(FromLowSToD(destination.AsFpuRegisterPairLow<SRegister>()), | 
|  | SP, | 
|  | source.GetStackIndex()); | 
|  | } | 
|  | } else if (source.IsRegisterPair()) { | 
|  | if (destination.IsRegisterPair()) { | 
|  | __ Mov(destination.AsRegisterPairLow<Register>(), source.AsRegisterPairLow<Register>()); | 
|  | __ Mov(destination.AsRegisterPairHigh<Register>(), source.AsRegisterPairHigh<Register>()); | 
|  | } else { | 
|  | DCHECK(destination.IsDoubleStackSlot()) << destination; | 
|  | DCHECK(ExpectedPairLayout(source)); | 
|  | __ StoreToOffset( | 
|  | kStoreWordPair, source.AsRegisterPairLow<Register>(), SP, destination.GetStackIndex()); | 
|  | } | 
|  | } else if (source.IsFpuRegisterPair()) { | 
|  | if (destination.IsFpuRegisterPair()) { | 
|  | __ vmovd(FromLowSToD(destination.AsFpuRegisterPairLow<SRegister>()), | 
|  | FromLowSToD(source.AsFpuRegisterPairLow<SRegister>())); | 
|  | } else { | 
|  | DCHECK(destination.IsDoubleStackSlot()) << destination; | 
|  | __ StoreDToOffset(FromLowSToD(source.AsFpuRegisterPairLow<SRegister>()), | 
|  | SP, | 
|  | destination.GetStackIndex()); | 
|  | } | 
|  | } else { | 
|  | DCHECK(source.IsConstant()) << source; | 
|  | HConstant* constant = source.GetConstant(); | 
|  | if (constant->IsIntConstant() || constant->IsNullConstant()) { | 
|  | int32_t value = CodeGenerator::GetInt32ValueOf(constant); | 
|  | if (destination.IsRegister()) { | 
|  | __ LoadImmediate(destination.AsRegister<Register>(), value); | 
|  | } else { | 
|  | DCHECK(destination.IsStackSlot()); | 
|  | __ LoadImmediate(IP, value); | 
|  | __ StoreToOffset(kStoreWord, IP, SP, destination.GetStackIndex()); | 
|  | } | 
|  | } else if (constant->IsLongConstant()) { | 
|  | int64_t value = constant->AsLongConstant()->GetValue(); | 
|  | if (destination.IsRegisterPair()) { | 
|  | __ LoadImmediate(destination.AsRegisterPairLow<Register>(), Low32Bits(value)); | 
|  | __ LoadImmediate(destination.AsRegisterPairHigh<Register>(), High32Bits(value)); | 
|  | } else { | 
|  | DCHECK(destination.IsDoubleStackSlot()) << destination; | 
|  | __ LoadImmediate(IP, Low32Bits(value)); | 
|  | __ StoreToOffset(kStoreWord, IP, SP, destination.GetStackIndex()); | 
|  | __ LoadImmediate(IP, High32Bits(value)); | 
|  | __ StoreToOffset(kStoreWord, IP, SP, destination.GetHighStackIndex(kArmWordSize)); | 
|  | } | 
|  | } else if (constant->IsDoubleConstant()) { | 
|  | double value = constant->AsDoubleConstant()->GetValue(); | 
|  | if (destination.IsFpuRegisterPair()) { | 
|  | __ LoadDImmediate(FromLowSToD(destination.AsFpuRegisterPairLow<SRegister>()), value); | 
|  | } else { | 
|  | DCHECK(destination.IsDoubleStackSlot()) << destination; | 
|  | uint64_t int_value = bit_cast<uint64_t, double>(value); | 
|  | __ LoadImmediate(IP, Low32Bits(int_value)); | 
|  | __ StoreToOffset(kStoreWord, IP, SP, destination.GetStackIndex()); | 
|  | __ LoadImmediate(IP, High32Bits(int_value)); | 
|  | __ StoreToOffset(kStoreWord, IP, SP, destination.GetHighStackIndex(kArmWordSize)); | 
|  | } | 
|  | } else { | 
|  | DCHECK(constant->IsFloatConstant()) << constant->DebugName(); | 
|  | float value = constant->AsFloatConstant()->GetValue(); | 
|  | if (destination.IsFpuRegister()) { | 
|  | __ LoadSImmediate(destination.AsFpuRegister<SRegister>(), value); | 
|  | } else { | 
|  | DCHECK(destination.IsStackSlot()); | 
|  | __ LoadImmediate(IP, bit_cast<int32_t, float>(value)); | 
|  | __ StoreToOffset(kStoreWord, IP, SP, destination.GetStackIndex()); | 
|  | } | 
|  | } | 
|  | } | 
|  | } | 
|  |  | 
|  | void ParallelMoveResolverARM::Exchange(Register reg, int mem) { | 
|  | __ Mov(IP, reg); | 
|  | __ LoadFromOffset(kLoadWord, reg, SP, mem); | 
|  | __ StoreToOffset(kStoreWord, IP, SP, mem); | 
|  | } | 
|  |  | 
|  | void ParallelMoveResolverARM::Exchange(int mem1, int mem2) { | 
|  | ScratchRegisterScope ensure_scratch(this, IP, R0, codegen_->GetNumberOfCoreRegisters()); | 
|  | int stack_offset = ensure_scratch.IsSpilled() ? kArmWordSize : 0; | 
|  | __ LoadFromOffset(kLoadWord, static_cast<Register>(ensure_scratch.GetRegister()), | 
|  | SP, mem1 + stack_offset); | 
|  | __ LoadFromOffset(kLoadWord, IP, SP, mem2 + stack_offset); | 
|  | __ StoreToOffset(kStoreWord, static_cast<Register>(ensure_scratch.GetRegister()), | 
|  | SP, mem2 + stack_offset); | 
|  | __ StoreToOffset(kStoreWord, IP, SP, mem1 + stack_offset); | 
|  | } | 
|  |  | 
|  | void ParallelMoveResolverARM::EmitSwap(size_t index) { | 
|  | MoveOperands* move = moves_[index]; | 
|  | Location source = move->GetSource(); | 
|  | Location destination = move->GetDestination(); | 
|  |  | 
|  | if (source.IsRegister() && destination.IsRegister()) { | 
|  | DCHECK_NE(source.AsRegister<Register>(), IP); | 
|  | DCHECK_NE(destination.AsRegister<Register>(), IP); | 
|  | __ Mov(IP, source.AsRegister<Register>()); | 
|  | __ Mov(source.AsRegister<Register>(), destination.AsRegister<Register>()); | 
|  | __ Mov(destination.AsRegister<Register>(), IP); | 
|  | } else if (source.IsRegister() && destination.IsStackSlot()) { | 
|  | Exchange(source.AsRegister<Register>(), destination.GetStackIndex()); | 
|  | } else if (source.IsStackSlot() && destination.IsRegister()) { | 
|  | Exchange(destination.AsRegister<Register>(), source.GetStackIndex()); | 
|  | } else if (source.IsStackSlot() && destination.IsStackSlot()) { | 
|  | Exchange(source.GetStackIndex(), destination.GetStackIndex()); | 
|  | } else if (source.IsFpuRegister() && destination.IsFpuRegister()) { | 
|  | __ vmovrs(IP, source.AsFpuRegister<SRegister>()); | 
|  | __ vmovs(source.AsFpuRegister<SRegister>(), destination.AsFpuRegister<SRegister>()); | 
|  | __ vmovsr(destination.AsFpuRegister<SRegister>(), IP); | 
|  | } else if (source.IsRegisterPair() && destination.IsRegisterPair()) { | 
|  | __ vmovdrr(DTMP, source.AsRegisterPairLow<Register>(), source.AsRegisterPairHigh<Register>()); | 
|  | __ Mov(source.AsRegisterPairLow<Register>(), destination.AsRegisterPairLow<Register>()); | 
|  | __ Mov(source.AsRegisterPairHigh<Register>(), destination.AsRegisterPairHigh<Register>()); | 
|  | __ vmovrrd(destination.AsRegisterPairLow<Register>(), | 
|  | destination.AsRegisterPairHigh<Register>(), | 
|  | DTMP); | 
|  | } else if (source.IsRegisterPair() || destination.IsRegisterPair()) { | 
|  | Register low_reg = source.IsRegisterPair() | 
|  | ? source.AsRegisterPairLow<Register>() | 
|  | : destination.AsRegisterPairLow<Register>(); | 
|  | int mem = source.IsRegisterPair() | 
|  | ? destination.GetStackIndex() | 
|  | : source.GetStackIndex(); | 
|  | DCHECK(ExpectedPairLayout(source.IsRegisterPair() ? source : destination)); | 
|  | __ vmovdrr(DTMP, low_reg, static_cast<Register>(low_reg + 1)); | 
|  | __ LoadFromOffset(kLoadWordPair, low_reg, SP, mem); | 
|  | __ StoreDToOffset(DTMP, SP, mem); | 
|  | } else if (source.IsFpuRegisterPair() && destination.IsFpuRegisterPair()) { | 
|  | DRegister first = FromLowSToD(source.AsFpuRegisterPairLow<SRegister>()); | 
|  | DRegister second = FromLowSToD(destination.AsFpuRegisterPairLow<SRegister>()); | 
|  | __ vmovd(DTMP, first); | 
|  | __ vmovd(first, second); | 
|  | __ vmovd(second, DTMP); | 
|  | } else if (source.IsFpuRegisterPair() || destination.IsFpuRegisterPair()) { | 
|  | DRegister reg = source.IsFpuRegisterPair() | 
|  | ? FromLowSToD(source.AsFpuRegisterPairLow<SRegister>()) | 
|  | : FromLowSToD(destination.AsFpuRegisterPairLow<SRegister>()); | 
|  | int mem = source.IsFpuRegisterPair() | 
|  | ? destination.GetStackIndex() | 
|  | : source.GetStackIndex(); | 
|  | __ vmovd(DTMP, reg); | 
|  | __ LoadDFromOffset(reg, SP, mem); | 
|  | __ StoreDToOffset(DTMP, SP, mem); | 
|  | } else if (source.IsFpuRegister() || destination.IsFpuRegister()) { | 
|  | SRegister reg = source.IsFpuRegister() ? source.AsFpuRegister<SRegister>() | 
|  | : destination.AsFpuRegister<SRegister>(); | 
|  | int mem = source.IsFpuRegister() | 
|  | ? destination.GetStackIndex() | 
|  | : source.GetStackIndex(); | 
|  |  | 
|  | __ vmovrs(IP, reg); | 
|  | __ LoadSFromOffset(reg, SP, mem); | 
|  | __ StoreToOffset(kStoreWord, IP, SP, mem); | 
|  | } else if (source.IsDoubleStackSlot() && destination.IsDoubleStackSlot()) { | 
|  | Exchange(source.GetStackIndex(), destination.GetStackIndex()); | 
|  | Exchange(source.GetHighStackIndex(kArmWordSize), destination.GetHighStackIndex(kArmWordSize)); | 
|  | } else { | 
|  | LOG(FATAL) << "Unimplemented" << source << " <-> " << destination; | 
|  | } | 
|  | } | 
|  |  | 
|  | void ParallelMoveResolverARM::SpillScratch(int reg) { | 
|  | __ Push(static_cast<Register>(reg)); | 
|  | } | 
|  |  | 
|  | void ParallelMoveResolverARM::RestoreScratch(int reg) { | 
|  | __ Pop(static_cast<Register>(reg)); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitLoadClass(HLoadClass* cls) { | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | CodeGenerator::CreateLoadClassLocationSummary( | 
|  | cls, | 
|  | Location::RegisterLocation(calling_convention.GetRegisterAt(0)), | 
|  | Location::RegisterLocation(R0)); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitLoadClass(HLoadClass* cls) { | 
|  | LocationSummary* locations = cls->GetLocations(); | 
|  | if (cls->NeedsAccessCheck()) { | 
|  | codegen_->MoveConstant(locations->GetTemp(0), cls->GetTypeIndex()); | 
|  | codegen_->InvokeRuntime(QUICK_ENTRY_POINT(pInitializeTypeAndVerifyAccess), | 
|  | cls, | 
|  | cls->GetDexPc(), | 
|  | nullptr); | 
|  | return; | 
|  | } | 
|  |  | 
|  | Register out = locations->Out().AsRegister<Register>(); | 
|  | Register current_method = locations->InAt(0).AsRegister<Register>(); | 
|  | if (cls->IsReferrersClass()) { | 
|  | DCHECK(!cls->CanCallRuntime()); | 
|  | DCHECK(!cls->MustGenerateClinitCheck()); | 
|  | __ LoadFromOffset( | 
|  | kLoadWord, out, current_method, ArtMethod::DeclaringClassOffset().Int32Value()); | 
|  | } else { | 
|  | DCHECK(cls->CanCallRuntime()); | 
|  | __ LoadFromOffset(kLoadWord, | 
|  | out, | 
|  | current_method, | 
|  | ArtMethod::DexCacheResolvedTypesOffset(kArmPointerSize).Int32Value()); | 
|  | __ LoadFromOffset(kLoadWord, out, out, CodeGenerator::GetCacheOffset(cls->GetTypeIndex())); | 
|  | // TODO: We will need a read barrier here. | 
|  |  | 
|  | SlowPathCode* slow_path = new (GetGraph()->GetArena()) LoadClassSlowPathARM( | 
|  | cls, cls, cls->GetDexPc(), cls->MustGenerateClinitCheck()); | 
|  | codegen_->AddSlowPath(slow_path); | 
|  | __ CompareAndBranchIfZero(out, slow_path->GetEntryLabel()); | 
|  | if (cls->MustGenerateClinitCheck()) { | 
|  | GenerateClassInitializationCheck(slow_path, out); | 
|  | } else { | 
|  | __ Bind(slow_path->GetExitLabel()); | 
|  | } | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitClinitCheck(HClinitCheck* check) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(check, LocationSummary::kCallOnSlowPath); | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | if (check->HasUses()) { | 
|  | locations->SetOut(Location::SameAsFirstInput()); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitClinitCheck(HClinitCheck* check) { | 
|  | // We assume the class is not null. | 
|  | SlowPathCode* slow_path = new (GetGraph()->GetArena()) LoadClassSlowPathARM( | 
|  | check->GetLoadClass(), check, check->GetDexPc(), true); | 
|  | codegen_->AddSlowPath(slow_path); | 
|  | GenerateClassInitializationCheck(slow_path, | 
|  | check->GetLocations()->InAt(0).AsRegister<Register>()); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::GenerateClassInitializationCheck( | 
|  | SlowPathCode* slow_path, Register class_reg) { | 
|  | __ LoadFromOffset(kLoadWord, IP, class_reg, mirror::Class::StatusOffset().Int32Value()); | 
|  | __ cmp(IP, ShifterOperand(mirror::Class::kStatusInitialized)); | 
|  | __ b(slow_path->GetEntryLabel(), LT); | 
|  | // Even if the initialized flag is set, we may be in a situation where caches are not synced | 
|  | // properly. Therefore, we do a memory fence. | 
|  | __ dmb(ISH); | 
|  | __ Bind(slow_path->GetExitLabel()); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitLoadString(HLoadString* load) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(load, LocationSummary::kCallOnSlowPath); | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister()); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitLoadString(HLoadString* load) { | 
|  | SlowPathCode* slow_path = new (GetGraph()->GetArena()) LoadStringSlowPathARM(load); | 
|  | codegen_->AddSlowPath(slow_path); | 
|  |  | 
|  | LocationSummary* locations = load->GetLocations(); | 
|  | Register out = locations->Out().AsRegister<Register>(); | 
|  | Register current_method = locations->InAt(0).AsRegister<Register>(); | 
|  | __ LoadFromOffset( | 
|  | kLoadWord, out, current_method, ArtMethod::DeclaringClassOffset().Int32Value()); | 
|  | __ LoadFromOffset(kLoadWord, out, out, mirror::Class::DexCacheStringsOffset().Int32Value()); | 
|  | __ LoadFromOffset(kLoadWord, out, out, CodeGenerator::GetCacheOffset(load->GetStringIndex())); | 
|  | // TODO: We will need a read barrier here. | 
|  | __ CompareAndBranchIfZero(out, slow_path->GetEntryLabel()); | 
|  | __ Bind(slow_path->GetExitLabel()); | 
|  | } | 
|  |  | 
|  | static int32_t GetExceptionTlsOffset() { | 
|  | return Thread::ExceptionOffset<kArmWordSize>().Int32Value(); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitLoadException(HLoadException* load) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(load, LocationSummary::kNoCall); | 
|  | locations->SetOut(Location::RequiresRegister()); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitLoadException(HLoadException* load) { | 
|  | Register out = load->GetLocations()->Out().AsRegister<Register>(); | 
|  | __ LoadFromOffset(kLoadWord, out, TR, GetExceptionTlsOffset()); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitClearException(HClearException* clear) { | 
|  | new (GetGraph()->GetArena()) LocationSummary(clear, LocationSummary::kNoCall); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitClearException(HClearException* clear ATTRIBUTE_UNUSED) { | 
|  | __ LoadImmediate(IP, 0); | 
|  | __ StoreToOffset(kStoreWord, IP, TR, GetExceptionTlsOffset()); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitThrow(HThrow* instruction) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(instruction, LocationSummary::kCall); | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | locations->SetInAt(0, Location::RegisterLocation(calling_convention.GetRegisterAt(0))); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitThrow(HThrow* instruction) { | 
|  | codegen_->InvokeRuntime( | 
|  | QUICK_ENTRY_POINT(pDeliverException), instruction, instruction->GetDexPc(), nullptr); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitInstanceOf(HInstanceOf* instruction) { | 
|  | LocationSummary::CallKind call_kind = LocationSummary::kNoCall; | 
|  | switch (instruction->GetTypeCheckKind()) { | 
|  | case TypeCheckKind::kExactCheck: | 
|  | case TypeCheckKind::kAbstractClassCheck: | 
|  | case TypeCheckKind::kClassHierarchyCheck: | 
|  | case TypeCheckKind::kArrayObjectCheck: | 
|  | call_kind = LocationSummary::kNoCall; | 
|  | break; | 
|  | case TypeCheckKind::kUnresolvedCheck: | 
|  | case TypeCheckKind::kInterfaceCheck: | 
|  | call_kind = LocationSummary::kCall; | 
|  | break; | 
|  | case TypeCheckKind::kArrayCheck: | 
|  | call_kind = LocationSummary::kCallOnSlowPath; | 
|  | break; | 
|  | } | 
|  | LocationSummary* locations = new (GetGraph()->GetArena()) LocationSummary(instruction, call_kind); | 
|  | if (call_kind != LocationSummary::kCall) { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RequiresRegister()); | 
|  | // The out register is used as a temporary, so it overlaps with the inputs. | 
|  | // Note that TypeCheckSlowPathARM uses this register too. | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kOutputOverlap); | 
|  | } else { | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | locations->SetInAt(1, Location::RegisterLocation(calling_convention.GetRegisterAt(0))); | 
|  | locations->SetInAt(0, Location::RegisterLocation(calling_convention.GetRegisterAt(1))); | 
|  | locations->SetOut(Location::RegisterLocation(R0)); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitInstanceOf(HInstanceOf* instruction) { | 
|  | LocationSummary* locations = instruction->GetLocations(); | 
|  | Register obj = locations->InAt(0).AsRegister<Register>(); | 
|  | Register cls = locations->InAt(1).AsRegister<Register>(); | 
|  | Register out = locations->Out().AsRegister<Register>(); | 
|  | uint32_t class_offset = mirror::Object::ClassOffset().Int32Value(); | 
|  | uint32_t super_offset = mirror::Class::SuperClassOffset().Int32Value(); | 
|  | uint32_t component_offset = mirror::Class::ComponentTypeOffset().Int32Value(); | 
|  | uint32_t primitive_offset = mirror::Class::PrimitiveTypeOffset().Int32Value(); | 
|  | Label done, zero; | 
|  | SlowPathCode* slow_path = nullptr; | 
|  |  | 
|  | // Return 0 if `obj` is null. | 
|  | // avoid null check if we know obj is not null. | 
|  | if (instruction->MustDoNullCheck()) { | 
|  | __ CompareAndBranchIfZero(obj, &zero); | 
|  | } | 
|  |  | 
|  | // In case of an interface/unresolved check, we put the object class into the object register. | 
|  | // This is safe, as the register is caller-save, and the object must be in another | 
|  | // register if it survives the runtime call. | 
|  | Register target = (instruction->GetTypeCheckKind() == TypeCheckKind::kInterfaceCheck) || | 
|  | (instruction->GetTypeCheckKind() == TypeCheckKind::kUnresolvedCheck) | 
|  | ? obj | 
|  | : out; | 
|  | __ LoadFromOffset(kLoadWord, target, obj, class_offset); | 
|  | __ MaybeUnpoisonHeapReference(target); | 
|  |  | 
|  | switch (instruction->GetTypeCheckKind()) { | 
|  | case TypeCheckKind::kExactCheck: { | 
|  | __ cmp(out, ShifterOperand(cls)); | 
|  | // Classes must be equal for the instanceof to succeed. | 
|  | __ b(&zero, NE); | 
|  | __ LoadImmediate(out, 1); | 
|  | __ b(&done); | 
|  | break; | 
|  | } | 
|  | case TypeCheckKind::kAbstractClassCheck: { | 
|  | // If the class is abstract, we eagerly fetch the super class of the | 
|  | // object to avoid doing a comparison we know will fail. | 
|  | Label loop; | 
|  | __ Bind(&loop); | 
|  | __ LoadFromOffset(kLoadWord, out, out, super_offset); | 
|  | __ MaybeUnpoisonHeapReference(out); | 
|  | // If `out` is null, we use it for the result, and jump to `done`. | 
|  | __ CompareAndBranchIfZero(out, &done); | 
|  | __ cmp(out, ShifterOperand(cls)); | 
|  | __ b(&loop, NE); | 
|  | __ LoadImmediate(out, 1); | 
|  | if (zero.IsLinked()) { | 
|  | __ b(&done); | 
|  | } | 
|  | break; | 
|  | } | 
|  | case TypeCheckKind::kClassHierarchyCheck: { | 
|  | // Walk over the class hierarchy to find a match. | 
|  | Label loop, success; | 
|  | __ Bind(&loop); | 
|  | __ cmp(out, ShifterOperand(cls)); | 
|  | __ b(&success, EQ); | 
|  | __ LoadFromOffset(kLoadWord, out, out, super_offset); | 
|  | __ MaybeUnpoisonHeapReference(out); | 
|  | __ CompareAndBranchIfNonZero(out, &loop); | 
|  | // If `out` is null, we use it for the result, and jump to `done`. | 
|  | __ b(&done); | 
|  | __ Bind(&success); | 
|  | __ LoadImmediate(out, 1); | 
|  | if (zero.IsLinked()) { | 
|  | __ b(&done); | 
|  | } | 
|  | break; | 
|  | } | 
|  | case TypeCheckKind::kArrayObjectCheck: { | 
|  | // Do an exact check. | 
|  | Label exact_check; | 
|  | __ cmp(out, ShifterOperand(cls)); | 
|  | __ b(&exact_check, EQ); | 
|  | // Otherwise, we need to check that the object's class is a non primitive array. | 
|  | __ LoadFromOffset(kLoadWord, out, out, component_offset); | 
|  | __ MaybeUnpoisonHeapReference(out); | 
|  | // If `out` is null, we use it for the result, and jump to `done`. | 
|  | __ CompareAndBranchIfZero(out, &done); | 
|  | __ LoadFromOffset(kLoadUnsignedHalfword, out, out, primitive_offset); | 
|  | static_assert(Primitive::kPrimNot == 0, "Expected 0 for kPrimNot"); | 
|  | __ CompareAndBranchIfNonZero(out, &zero); | 
|  | __ Bind(&exact_check); | 
|  | __ LoadImmediate(out, 1); | 
|  | __ b(&done); | 
|  | break; | 
|  | } | 
|  | case TypeCheckKind::kArrayCheck: { | 
|  | __ cmp(out, ShifterOperand(cls)); | 
|  | DCHECK(locations->OnlyCallsOnSlowPath()); | 
|  | slow_path = new (GetGraph()->GetArena()) TypeCheckSlowPathARM( | 
|  | instruction, /* is_fatal */ false); | 
|  | codegen_->AddSlowPath(slow_path); | 
|  | __ b(slow_path->GetEntryLabel(), NE); | 
|  | __ LoadImmediate(out, 1); | 
|  | if (zero.IsLinked()) { | 
|  | __ b(&done); | 
|  | } | 
|  | break; | 
|  | } | 
|  | case TypeCheckKind::kUnresolvedCheck: | 
|  | case TypeCheckKind::kInterfaceCheck: | 
|  | default: { | 
|  | codegen_->InvokeRuntime(QUICK_ENTRY_POINT(pInstanceofNonTrivial), | 
|  | instruction, | 
|  | instruction->GetDexPc(), | 
|  | nullptr); | 
|  | if (zero.IsLinked()) { | 
|  | __ b(&done); | 
|  | } | 
|  | break; | 
|  | } | 
|  | } | 
|  |  | 
|  | if (zero.IsLinked()) { | 
|  | __ Bind(&zero); | 
|  | __ LoadImmediate(out, 0); | 
|  | } | 
|  |  | 
|  | if (done.IsLinked()) { | 
|  | __ Bind(&done); | 
|  | } | 
|  |  | 
|  | if (slow_path != nullptr) { | 
|  | __ Bind(slow_path->GetExitLabel()); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitCheckCast(HCheckCast* instruction) { | 
|  | LocationSummary::CallKind call_kind = LocationSummary::kNoCall; | 
|  | bool throws_into_catch = instruction->CanThrowIntoCatchBlock(); | 
|  |  | 
|  | switch (instruction->GetTypeCheckKind()) { | 
|  | case TypeCheckKind::kExactCheck: | 
|  | case TypeCheckKind::kAbstractClassCheck: | 
|  | case TypeCheckKind::kClassHierarchyCheck: | 
|  | case TypeCheckKind::kArrayObjectCheck: | 
|  | call_kind = throws_into_catch | 
|  | ? LocationSummary::kCallOnSlowPath | 
|  | : LocationSummary::kNoCall; | 
|  | break; | 
|  | case TypeCheckKind::kUnresolvedCheck: | 
|  | case TypeCheckKind::kInterfaceCheck: | 
|  | call_kind = LocationSummary::kCall; | 
|  | break; | 
|  | case TypeCheckKind::kArrayCheck: | 
|  | call_kind = LocationSummary::kCallOnSlowPath; | 
|  | break; | 
|  | } | 
|  |  | 
|  | LocationSummary* locations = new (GetGraph()->GetArena()) LocationSummary( | 
|  | instruction, call_kind); | 
|  | if (call_kind != LocationSummary::kCall) { | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RequiresRegister()); | 
|  | // Note that TypeCheckSlowPathARM uses this register too. | 
|  | locations->AddTemp(Location::RequiresRegister()); | 
|  | } else { | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | locations->SetInAt(1, Location::RegisterLocation(calling_convention.GetRegisterAt(0))); | 
|  | locations->SetInAt(0, Location::RegisterLocation(calling_convention.GetRegisterAt(1))); | 
|  | } | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitCheckCast(HCheckCast* instruction) { | 
|  | LocationSummary* locations = instruction->GetLocations(); | 
|  | Register obj = locations->InAt(0).AsRegister<Register>(); | 
|  | Register cls = locations->InAt(1).AsRegister<Register>(); | 
|  | Register temp = locations->WillCall() | 
|  | ? Register(kNoRegister) | 
|  | : locations->GetTemp(0).AsRegister<Register>(); | 
|  |  | 
|  | uint32_t class_offset = mirror::Object::ClassOffset().Int32Value(); | 
|  | uint32_t super_offset = mirror::Class::SuperClassOffset().Int32Value(); | 
|  | uint32_t component_offset = mirror::Class::ComponentTypeOffset().Int32Value(); | 
|  | uint32_t primitive_offset = mirror::Class::PrimitiveTypeOffset().Int32Value(); | 
|  | SlowPathCode* slow_path = nullptr; | 
|  |  | 
|  | if (!locations->WillCall()) { | 
|  | slow_path = new (GetGraph()->GetArena()) TypeCheckSlowPathARM( | 
|  | instruction, !locations->CanCall()); | 
|  | codegen_->AddSlowPath(slow_path); | 
|  | } | 
|  |  | 
|  | Label done; | 
|  | // Avoid null check if we know obj is not null. | 
|  | if (instruction->MustDoNullCheck()) { | 
|  | __ CompareAndBranchIfZero(obj, &done); | 
|  | } | 
|  |  | 
|  | if (locations->WillCall()) { | 
|  | __ LoadFromOffset(kLoadWord, obj, obj, class_offset); | 
|  | __ MaybeUnpoisonHeapReference(obj); | 
|  | } else { | 
|  | __ LoadFromOffset(kLoadWord, temp, obj, class_offset); | 
|  | __ MaybeUnpoisonHeapReference(temp); | 
|  | } | 
|  |  | 
|  | switch (instruction->GetTypeCheckKind()) { | 
|  | case TypeCheckKind::kExactCheck: | 
|  | case TypeCheckKind::kArrayCheck: { | 
|  | __ cmp(temp, ShifterOperand(cls)); | 
|  | // Jump to slow path for throwing the exception or doing a | 
|  | // more involved array check. | 
|  | __ b(slow_path->GetEntryLabel(), NE); | 
|  | break; | 
|  | } | 
|  | case TypeCheckKind::kAbstractClassCheck: { | 
|  | // If the class is abstract, we eagerly fetch the super class of the | 
|  | // object to avoid doing a comparison we know will fail. | 
|  | Label loop; | 
|  | __ Bind(&loop); | 
|  | __ LoadFromOffset(kLoadWord, temp, temp, super_offset); | 
|  | __ MaybeUnpoisonHeapReference(temp); | 
|  | // Jump to the slow path to throw the exception. | 
|  | __ CompareAndBranchIfZero(temp, slow_path->GetEntryLabel()); | 
|  | __ cmp(temp, ShifterOperand(cls)); | 
|  | __ b(&loop, NE); | 
|  | break; | 
|  | } | 
|  | case TypeCheckKind::kClassHierarchyCheck: { | 
|  | // Walk over the class hierarchy to find a match. | 
|  | Label loop; | 
|  | __ Bind(&loop); | 
|  | __ cmp(temp, ShifterOperand(cls)); | 
|  | __ b(&done, EQ); | 
|  | __ LoadFromOffset(kLoadWord, temp, temp, super_offset); | 
|  | __ MaybeUnpoisonHeapReference(temp); | 
|  | __ CompareAndBranchIfNonZero(temp, &loop); | 
|  | // Jump to the slow path to throw the exception. | 
|  | __ b(slow_path->GetEntryLabel()); | 
|  | break; | 
|  | } | 
|  | case TypeCheckKind::kArrayObjectCheck: { | 
|  | // Do an exact check. | 
|  | __ cmp(temp, ShifterOperand(cls)); | 
|  | __ b(&done, EQ); | 
|  | // Otherwise, we need to check that the object's class is a non primitive array. | 
|  | __ LoadFromOffset(kLoadWord, temp, temp, component_offset); | 
|  | __ MaybeUnpoisonHeapReference(temp); | 
|  | __ CompareAndBranchIfZero(temp, slow_path->GetEntryLabel()); | 
|  | __ LoadFromOffset(kLoadUnsignedHalfword, temp, temp, primitive_offset); | 
|  | static_assert(Primitive::kPrimNot == 0, "Expected 0 for kPrimNot"); | 
|  | __ CompareAndBranchIfNonZero(temp, slow_path->GetEntryLabel()); | 
|  | break; | 
|  | } | 
|  | case TypeCheckKind::kUnresolvedCheck: | 
|  | case TypeCheckKind::kInterfaceCheck: | 
|  | default: | 
|  | codegen_->InvokeRuntime(QUICK_ENTRY_POINT(pCheckCast), | 
|  | instruction, | 
|  | instruction->GetDexPc(), | 
|  | nullptr); | 
|  | break; | 
|  | } | 
|  | __ Bind(&done); | 
|  |  | 
|  | if (slow_path != nullptr) { | 
|  | __ Bind(slow_path->GetExitLabel()); | 
|  | } | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitMonitorOperation(HMonitorOperation* instruction) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(instruction, LocationSummary::kCall); | 
|  | InvokeRuntimeCallingConvention calling_convention; | 
|  | locations->SetInAt(0, Location::RegisterLocation(calling_convention.GetRegisterAt(0))); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitMonitorOperation(HMonitorOperation* instruction) { | 
|  | codegen_->InvokeRuntime(instruction->IsEnter() | 
|  | ? QUICK_ENTRY_POINT(pLockObject) : QUICK_ENTRY_POINT(pUnlockObject), | 
|  | instruction, | 
|  | instruction->GetDexPc(), | 
|  | nullptr); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitAnd(HAnd* instruction) { HandleBitwiseOperation(instruction); } | 
|  | void LocationsBuilderARM::VisitOr(HOr* instruction) { HandleBitwiseOperation(instruction); } | 
|  | void LocationsBuilderARM::VisitXor(HXor* instruction) { HandleBitwiseOperation(instruction); } | 
|  |  | 
|  | void LocationsBuilderARM::HandleBitwiseOperation(HBinaryOperation* instruction) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(instruction, LocationSummary::kNoCall); | 
|  | DCHECK(instruction->GetResultType() == Primitive::kPrimInt | 
|  | || instruction->GetResultType() == Primitive::kPrimLong); | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | locations->SetInAt(1, Location::RequiresRegister()); | 
|  | locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitAnd(HAnd* instruction) { | 
|  | HandleBitwiseOperation(instruction); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitOr(HOr* instruction) { | 
|  | HandleBitwiseOperation(instruction); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitXor(HXor* instruction) { | 
|  | HandleBitwiseOperation(instruction); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::HandleBitwiseOperation(HBinaryOperation* instruction) { | 
|  | LocationSummary* locations = instruction->GetLocations(); | 
|  |  | 
|  | if (instruction->GetResultType() == Primitive::kPrimInt) { | 
|  | Register first = locations->InAt(0).AsRegister<Register>(); | 
|  | Register second = locations->InAt(1).AsRegister<Register>(); | 
|  | Register out = locations->Out().AsRegister<Register>(); | 
|  | if (instruction->IsAnd()) { | 
|  | __ and_(out, first, ShifterOperand(second)); | 
|  | } else if (instruction->IsOr()) { | 
|  | __ orr(out, first, ShifterOperand(second)); | 
|  | } else { | 
|  | DCHECK(instruction->IsXor()); | 
|  | __ eor(out, first, ShifterOperand(second)); | 
|  | } | 
|  | } else { | 
|  | DCHECK_EQ(instruction->GetResultType(), Primitive::kPrimLong); | 
|  | Location first = locations->InAt(0); | 
|  | Location second = locations->InAt(1); | 
|  | Location out = locations->Out(); | 
|  | if (instruction->IsAnd()) { | 
|  | __ and_(out.AsRegisterPairLow<Register>(), | 
|  | first.AsRegisterPairLow<Register>(), | 
|  | ShifterOperand(second.AsRegisterPairLow<Register>())); | 
|  | __ and_(out.AsRegisterPairHigh<Register>(), | 
|  | first.AsRegisterPairHigh<Register>(), | 
|  | ShifterOperand(second.AsRegisterPairHigh<Register>())); | 
|  | } else if (instruction->IsOr()) { | 
|  | __ orr(out.AsRegisterPairLow<Register>(), | 
|  | first.AsRegisterPairLow<Register>(), | 
|  | ShifterOperand(second.AsRegisterPairLow<Register>())); | 
|  | __ orr(out.AsRegisterPairHigh<Register>(), | 
|  | first.AsRegisterPairHigh<Register>(), | 
|  | ShifterOperand(second.AsRegisterPairHigh<Register>())); | 
|  | } else { | 
|  | DCHECK(instruction->IsXor()); | 
|  | __ eor(out.AsRegisterPairLow<Register>(), | 
|  | first.AsRegisterPairLow<Register>(), | 
|  | ShifterOperand(second.AsRegisterPairLow<Register>())); | 
|  | __ eor(out.AsRegisterPairHigh<Register>(), | 
|  | first.AsRegisterPairHigh<Register>(), | 
|  | ShifterOperand(second.AsRegisterPairHigh<Register>())); | 
|  | } | 
|  | } | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::GenerateStaticOrDirectCall(HInvokeStaticOrDirect* invoke, Location temp) { | 
|  | // For better instruction scheduling we load the direct code pointer before the method pointer. | 
|  | bool direct_code_loaded = false; | 
|  | switch (invoke->GetCodePtrLocation()) { | 
|  | case HInvokeStaticOrDirect::CodePtrLocation::kCallPCRelative: | 
|  | if (IsSameDexFile(*invoke->GetTargetMethod().dex_file, GetGraph()->GetDexFile())) { | 
|  | break; | 
|  | } | 
|  | // Calls across dex files are more likely to exceed the available BL range, | 
|  | // so use absolute patch by falling through to kDirectCodeFixup. | 
|  | FALLTHROUGH_INTENDED; | 
|  | case HInvokeStaticOrDirect::CodePtrLocation::kCallDirectWithFixup: | 
|  | // LR = code address from literal pool with link-time patch. | 
|  | __ LoadLiteral(LR, DeduplicateMethodCodeLiteral(invoke->GetTargetMethod())); | 
|  | direct_code_loaded = true; | 
|  | break; | 
|  | case HInvokeStaticOrDirect::CodePtrLocation::kCallDirect: | 
|  | // LR = invoke->GetDirectCodePtr(); | 
|  | __ LoadImmediate(LR, invoke->GetDirectCodePtr()); | 
|  | direct_code_loaded = true; | 
|  | break; | 
|  | default: | 
|  | break; | 
|  | } | 
|  |  | 
|  | Location callee_method = temp;  // For all kinds except kRecursive, callee will be in temp. | 
|  | switch (invoke->GetMethodLoadKind()) { | 
|  | case HInvokeStaticOrDirect::MethodLoadKind::kStringInit: | 
|  | // temp = thread->string_init_entrypoint | 
|  | __ LoadFromOffset(kLoadWord, temp.AsRegister<Register>(), TR, invoke->GetStringInitOffset()); | 
|  | break; | 
|  | case HInvokeStaticOrDirect::MethodLoadKind::kRecursive: | 
|  | callee_method = invoke->GetLocations()->InAt(invoke->GetCurrentMethodInputIndex()); | 
|  | break; | 
|  | case HInvokeStaticOrDirect::MethodLoadKind::kDirectAddress: | 
|  | __ LoadImmediate(temp.AsRegister<Register>(), invoke->GetMethodAddress()); | 
|  | break; | 
|  | case HInvokeStaticOrDirect::MethodLoadKind::kDirectAddressWithFixup: | 
|  | __ LoadLiteral(temp.AsRegister<Register>(), | 
|  | DeduplicateMethodAddressLiteral(invoke->GetTargetMethod())); | 
|  | break; | 
|  | case HInvokeStaticOrDirect::MethodLoadKind::kDexCachePcRelative: | 
|  | // TODO: Implement this type. For the moment, we fall back to kDexCacheViaMethod. | 
|  | FALLTHROUGH_INTENDED; | 
|  | case HInvokeStaticOrDirect::MethodLoadKind::kDexCacheViaMethod: { | 
|  | Location current_method = invoke->GetLocations()->InAt(invoke->GetCurrentMethodInputIndex()); | 
|  | Register method_reg; | 
|  | Register reg = temp.AsRegister<Register>(); | 
|  | if (current_method.IsRegister()) { | 
|  | method_reg = current_method.AsRegister<Register>(); | 
|  | } else { | 
|  | DCHECK(invoke->GetLocations()->Intrinsified()); | 
|  | DCHECK(!current_method.IsValid()); | 
|  | method_reg = reg; | 
|  | __ LoadFromOffset(kLoadWord, reg, SP, kCurrentMethodStackOffset); | 
|  | } | 
|  | // temp = current_method->dex_cache_resolved_methods_; | 
|  | __ LoadFromOffset( | 
|  | kLoadWord, reg, method_reg, ArtMethod::DexCacheResolvedMethodsOffset( | 
|  | kArmPointerSize).Int32Value()); | 
|  | // temp = temp[index_in_cache] | 
|  | uint32_t index_in_cache = invoke->GetTargetMethod().dex_method_index; | 
|  | __ LoadFromOffset(kLoadWord, reg, reg, CodeGenerator::GetCachePointerOffset(index_in_cache)); | 
|  | break; | 
|  | } | 
|  | } | 
|  |  | 
|  | switch (invoke->GetCodePtrLocation()) { | 
|  | case HInvokeStaticOrDirect::CodePtrLocation::kCallSelf: | 
|  | __ bl(GetFrameEntryLabel()); | 
|  | break; | 
|  | case HInvokeStaticOrDirect::CodePtrLocation::kCallPCRelative: | 
|  | if (!direct_code_loaded) { | 
|  | relative_call_patches_.emplace_back(invoke->GetTargetMethod()); | 
|  | __ Bind(&relative_call_patches_.back().label); | 
|  | Label label; | 
|  | __ bl(&label);  // Arbitrarily branch to the instruction after BL, override at link time. | 
|  | __ Bind(&label); | 
|  | break; | 
|  | } | 
|  | // If we loaded the direct code above, fall through. | 
|  | FALLTHROUGH_INTENDED; | 
|  | case HInvokeStaticOrDirect::CodePtrLocation::kCallDirectWithFixup: | 
|  | case HInvokeStaticOrDirect::CodePtrLocation::kCallDirect: | 
|  | // LR prepared above for better instruction scheduling. | 
|  | DCHECK(direct_code_loaded); | 
|  | // LR() | 
|  | __ blx(LR); | 
|  | break; | 
|  | case HInvokeStaticOrDirect::CodePtrLocation::kCallArtMethod: | 
|  | // LR = callee_method->entry_point_from_quick_compiled_code_ | 
|  | __ LoadFromOffset( | 
|  | kLoadWord, LR, callee_method.AsRegister<Register>(), | 
|  | ArtMethod::EntryPointFromQuickCompiledCodeOffset(kArmWordSize).Int32Value()); | 
|  | // LR() | 
|  | __ blx(LR); | 
|  | break; | 
|  | } | 
|  |  | 
|  | DCHECK(!IsLeafMethod()); | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::GenerateVirtualCall(HInvokeVirtual* invoke, Location temp_location) { | 
|  | Register temp = temp_location.AsRegister<Register>(); | 
|  | uint32_t method_offset = mirror::Class::EmbeddedVTableEntryOffset( | 
|  | invoke->GetVTableIndex(), kArmPointerSize).Uint32Value(); | 
|  | LocationSummary* locations = invoke->GetLocations(); | 
|  | Location receiver = locations->InAt(0); | 
|  | uint32_t class_offset = mirror::Object::ClassOffset().Int32Value(); | 
|  | // temp = object->GetClass(); | 
|  | DCHECK(receiver.IsRegister()); | 
|  | __ LoadFromOffset(kLoadWord, temp, receiver.AsRegister<Register>(), class_offset); | 
|  | MaybeRecordImplicitNullCheck(invoke); | 
|  | __ MaybeUnpoisonHeapReference(temp); | 
|  | // temp = temp->GetMethodAt(method_offset); | 
|  | uint32_t entry_point = ArtMethod::EntryPointFromQuickCompiledCodeOffset( | 
|  | kArmWordSize).Int32Value(); | 
|  | __ LoadFromOffset(kLoadWord, temp, temp, method_offset); | 
|  | // LR = temp->GetEntryPoint(); | 
|  | __ LoadFromOffset(kLoadWord, LR, temp, entry_point); | 
|  | // LR(); | 
|  | __ blx(LR); | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::EmitLinkerPatches(ArenaVector<LinkerPatch>* linker_patches) { | 
|  | DCHECK(linker_patches->empty()); | 
|  | size_t size = method_patches_.size() + call_patches_.size() + relative_call_patches_.size(); | 
|  | linker_patches->reserve(size); | 
|  | for (const auto& entry : method_patches_) { | 
|  | const MethodReference& target_method = entry.first; | 
|  | Literal* literal = entry.second; | 
|  | DCHECK(literal->GetLabel()->IsBound()); | 
|  | uint32_t literal_offset = literal->GetLabel()->Position(); | 
|  | linker_patches->push_back(LinkerPatch::MethodPatch(literal_offset, | 
|  | target_method.dex_file, | 
|  | target_method.dex_method_index)); | 
|  | } | 
|  | for (const auto& entry : call_patches_) { | 
|  | const MethodReference& target_method = entry.first; | 
|  | Literal* literal = entry.second; | 
|  | DCHECK(literal->GetLabel()->IsBound()); | 
|  | uint32_t literal_offset = literal->GetLabel()->Position(); | 
|  | linker_patches->push_back(LinkerPatch::CodePatch(literal_offset, | 
|  | target_method.dex_file, | 
|  | target_method.dex_method_index)); | 
|  | } | 
|  | for (const MethodPatchInfo<Label>& info : relative_call_patches_) { | 
|  | uint32_t literal_offset = info.label.Position(); | 
|  | linker_patches->push_back(LinkerPatch::RelativeCodePatch(literal_offset, | 
|  | info.target_method.dex_file, | 
|  | info.target_method.dex_method_index)); | 
|  | } | 
|  | } | 
|  |  | 
|  | Literal* CodeGeneratorARM::DeduplicateMethodLiteral(MethodReference target_method, | 
|  | MethodToLiteralMap* map) { | 
|  | // Look up the literal for target_method. | 
|  | auto lb = map->lower_bound(target_method); | 
|  | if (lb != map->end() && !map->key_comp()(target_method, lb->first)) { | 
|  | return lb->second; | 
|  | } | 
|  | // We don't have a literal for this method yet, insert a new one. | 
|  | Literal* literal = __ NewLiteral<uint32_t>(0u); | 
|  | map->PutBefore(lb, target_method, literal); | 
|  | return literal; | 
|  | } | 
|  |  | 
|  | Literal* CodeGeneratorARM::DeduplicateMethodAddressLiteral(MethodReference target_method) { | 
|  | return DeduplicateMethodLiteral(target_method, &method_patches_); | 
|  | } | 
|  |  | 
|  | Literal* CodeGeneratorARM::DeduplicateMethodCodeLiteral(MethodReference target_method) { | 
|  | return DeduplicateMethodLiteral(target_method, &call_patches_); | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitBoundType(HBoundType* instruction) { | 
|  | // Nothing to do, this should be removed during prepare for register allocator. | 
|  | UNUSED(instruction); | 
|  | LOG(FATAL) << "Unreachable"; | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitBoundType(HBoundType* instruction) { | 
|  | // Nothing to do, this should be removed during prepare for register allocator. | 
|  | UNUSED(instruction); | 
|  | LOG(FATAL) << "Unreachable"; | 
|  | } | 
|  |  | 
|  | void LocationsBuilderARM::VisitFakeString(HFakeString* instruction) { | 
|  | DCHECK(codegen_->IsBaseline()); | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(instruction, LocationSummary::kNoCall); | 
|  | locations->SetOut(Location::ConstantLocation(GetGraph()->GetNullConstant())); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitFakeString(HFakeString* instruction ATTRIBUTE_UNUSED) { | 
|  | DCHECK(codegen_->IsBaseline()); | 
|  | // Will be generated at use site. | 
|  | } | 
|  |  | 
|  | // Simple implementation of packed switch - generate cascaded compare/jumps. | 
|  | void LocationsBuilderARM::VisitPackedSwitch(HPackedSwitch* switch_instr) { | 
|  | LocationSummary* locations = | 
|  | new (GetGraph()->GetArena()) LocationSummary(switch_instr, LocationSummary::kNoCall); | 
|  | locations->SetInAt(0, Location::RequiresRegister()); | 
|  | } | 
|  |  | 
|  | void InstructionCodeGeneratorARM::VisitPackedSwitch(HPackedSwitch* switch_instr) { | 
|  | int32_t lower_bound = switch_instr->GetStartValue(); | 
|  | int32_t num_entries = switch_instr->GetNumEntries(); | 
|  | LocationSummary* locations = switch_instr->GetLocations(); | 
|  | Register value_reg = locations->InAt(0).AsRegister<Register>(); | 
|  | HBasicBlock* default_block = switch_instr->GetDefaultBlock(); | 
|  |  | 
|  | // Create a series of compare/jumps. | 
|  | const ArenaVector<HBasicBlock*>& successors = switch_instr->GetBlock()->GetSuccessors(); | 
|  | for (int32_t i = 0; i < num_entries; i++) { | 
|  | GenerateCompareWithImmediate(value_reg, lower_bound + i); | 
|  | __ b(codegen_->GetLabelOf(successors[i]), EQ); | 
|  | } | 
|  |  | 
|  | // And the default for any other value. | 
|  | if (!codegen_->GoesToNextBlock(switch_instr->GetBlock(), default_block)) { | 
|  | __ b(codegen_->GetLabelOf(default_block)); | 
|  | } | 
|  | } | 
|  |  | 
|  | void CodeGeneratorARM::MoveFromReturnRegister(Location trg, Primitive::Type type) { | 
|  | if (!trg.IsValid()) { | 
|  | DCHECK(type == Primitive::kPrimVoid); | 
|  | return; | 
|  | } | 
|  |  | 
|  | DCHECK_NE(type, Primitive::kPrimVoid); | 
|  |  | 
|  | Location return_loc = InvokeDexCallingConventionVisitorARM().GetReturnLocation(type); | 
|  | if (return_loc.Equals(trg)) { | 
|  | return; | 
|  | } | 
|  |  | 
|  | // TODO: Consider pairs in the parallel move resolver, then this could be nicely merged | 
|  | //       with the last branch. | 
|  | if (type == Primitive::kPrimLong) { | 
|  | HParallelMove parallel_move(GetGraph()->GetArena()); | 
|  | parallel_move.AddMove(return_loc.ToLow(), trg.ToLow(), Primitive::kPrimInt, nullptr); | 
|  | parallel_move.AddMove(return_loc.ToHigh(), trg.ToHigh(), Primitive::kPrimInt, nullptr); | 
|  | GetMoveResolver()->EmitNativeCode(¶llel_move); | 
|  | } else if (type == Primitive::kPrimDouble) { | 
|  | HParallelMove parallel_move(GetGraph()->GetArena()); | 
|  | parallel_move.AddMove(return_loc.ToLow(), trg.ToLow(), Primitive::kPrimFloat, nullptr); | 
|  | parallel_move.AddMove(return_loc.ToHigh(), trg.ToHigh(), Primitive::kPrimFloat, nullptr); | 
|  | GetMoveResolver()->EmitNativeCode(¶llel_move); | 
|  | } else { | 
|  | // Let the parallel move resolver take care of all of this. | 
|  | HParallelMove parallel_move(GetGraph()->GetArena()); | 
|  | parallel_move.AddMove(return_loc, trg, type, nullptr); | 
|  | GetMoveResolver()->EmitNativeCode(¶llel_move); | 
|  | } | 
|  | } | 
|  |  | 
|  | #undef __ | 
|  | #undef QUICK_ENTRY_POINT | 
|  |  | 
|  | }  // namespace arm | 
|  | }  // namespace art |