blob: 18ad60db87eb6adbde25923e2c7e3f1d2f862631 [file] [log] [blame]
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +00001/*
2 * Copyright (C) 2014 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17#ifndef ART_COMPILER_OPTIMIZING_CODE_GENERATOR_H_
18#define ART_COMPILER_OPTIMIZING_CODE_GENERATOR_H_
19
Ian Rogersd582fa42014-11-05 23:46:43 -080020#include "arch/instruction_set.h"
Calin Juravle34166012014-12-19 17:22:29 +000021#include "arch/instruction_set_features.h"
Vladimir Markof9f64412015-09-02 14:05:49 +010022#include "base/arena_containers.h"
23#include "base/arena_object.h"
Nicolas Geoffray01bc96d2014-04-11 17:43:50 +010024#include "base/bit_field.h"
Vladimir Marko70e97462016-08-09 11:04:26 +010025#include "base/bit_utils.h"
Andreas Gampe542451c2016-07-26 09:02:02 -070026#include "base/enums.h"
Nicolas Geoffraybab4ed72014-03-11 17:53:17 +000027#include "globals.h"
Alexandre Rameseb7b7392015-06-19 14:47:01 +010028#include "graph_visualizer.h"
Nicolas Geoffray4e3d23a2014-05-22 18:32:45 +010029#include "locations.h"
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000030#include "memory_region.h"
31#include "nodes.h"
Serban Constantinescuecc43662015-08-13 13:33:12 +010032#include "optimizing_compiler_stats.h"
Mathieu Chartier3af00dc2016-11-10 11:25:57 -080033#include "read_barrier_option.h"
Andreas Gampe513061a2017-06-01 09:17:34 -070034#include "stack.h"
Vladimir Marko174b2e22017-10-12 13:34:49 +010035#include "stack_map.h"
Nicolas Geoffray132d8362016-11-16 09:19:42 +000036#include "string_reference.h"
Mathieu Chartierdbddc222017-05-24 12:04:13 -070037#include "type_reference.h"
Andreas Gampe85b62f22015-09-09 13:15:38 -070038#include "utils/label.h"
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000039
40namespace art {
41
Roland Levillain6d0e4832014-11-27 18:31:21 +000042// Binary encoding of 2^32 for type double.
43static int64_t constexpr k2Pow32EncodingForDouble = INT64_C(0x41F0000000000000);
44// Binary encoding of 2^31 for type double.
45static int64_t constexpr k2Pow31EncodingForDouble = INT64_C(0x41E0000000000000);
46
Mark Mendelle82549b2015-05-06 10:55:34 -040047// Minimum value for a primitive integer.
48static int32_t constexpr kPrimIntMin = 0x80000000;
49// Minimum value for a primitive long.
50static int64_t constexpr kPrimLongMin = INT64_C(0x8000000000000000);
51
Roland Levillain3f8f9362014-12-02 17:45:01 +000052// Maximum value for a primitive integer.
53static int32_t constexpr kPrimIntMax = 0x7fffffff;
Roland Levillain624279f2014-12-04 11:54:28 +000054// Maximum value for a primitive long.
Mark Mendelle82549b2015-05-06 10:55:34 -040055static int64_t constexpr kPrimLongMax = INT64_C(0x7fffffffffffffff);
Roland Levillain3f8f9362014-12-02 17:45:01 +000056
Mathieu Chartier3af00dc2016-11-10 11:25:57 -080057static constexpr ReadBarrierOption kCompilerReadBarrierOption =
58 kEmitCompilerReadBarrier ? kWithReadBarrier : kWithoutReadBarrier;
59
Nicolas Geoffray92a73ae2014-10-16 11:12:52 +010060class Assembler;
Nicolas Geoffraye5038322014-07-04 09:41:32 +010061class CodeGenerator;
Nicolas Geoffrayd28b9692015-11-04 14:36:55 +000062class CompilerDriver;
Vladimir Marko3a21e382016-09-02 12:38:38 +010063class CompilerOptions;
Vladimir Marko174b2e22017-10-12 13:34:49 +010064class StackMapStream;
Nicolas Geoffrayf0e39372014-11-12 17:50:07 +000065class ParallelMoveResolver;
Nicolas Geoffray92cf83e2014-03-18 17:59:20 +000066
Vladimir Markod8dbc8d2017-09-20 13:37:47 +010067namespace linker {
68class LinkerPatch;
69} // namespace linker
70
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000071class CodeAllocator {
72 public:
Nicolas Geoffraye5038322014-07-04 09:41:32 +010073 CodeAllocator() {}
74 virtual ~CodeAllocator() {}
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000075
76 virtual uint8_t* Allocate(size_t size) = 0;
77
78 private:
79 DISALLOW_COPY_AND_ASSIGN(CodeAllocator);
80};
81
Alexandre Ramesc01a6642016-04-15 11:54:06 +010082class SlowPathCode : public DeletableArenaObject<kArenaAllocSlowPaths> {
Nicolas Geoffraye5038322014-07-04 09:41:32 +010083 public:
David Srbecky9cd6d372016-02-09 15:24:47 +000084 explicit SlowPathCode(HInstruction* instruction) : instruction_(instruction) {
Nicolas Geoffrayeeefa122015-03-13 18:52:59 +000085 for (size_t i = 0; i < kMaximumNumberOfExpectedRegisters; ++i) {
86 saved_core_stack_offsets_[i] = kRegisterNotSaved;
87 saved_fpu_stack_offsets_[i] = kRegisterNotSaved;
88 }
89 }
90
Nicolas Geoffraye5038322014-07-04 09:41:32 +010091 virtual ~SlowPathCode() {}
92
Nicolas Geoffraye5038322014-07-04 09:41:32 +010093 virtual void EmitNativeCode(CodeGenerator* codegen) = 0;
94
Roland Levillain4359e612016-07-20 11:32:19 +010095 // Save live core and floating-point caller-save registers and
96 // update the stack mask in `locations` for registers holding object
97 // references.
Zheng Xuda403092015-04-24 17:35:39 +080098 virtual void SaveLiveRegisters(CodeGenerator* codegen, LocationSummary* locations);
Roland Levillain4359e612016-07-20 11:32:19 +010099 // Restore live core and floating-point caller-save registers.
Zheng Xuda403092015-04-24 17:35:39 +0800100 virtual void RestoreLiveRegisters(CodeGenerator* codegen, LocationSummary* locations);
Nicolas Geoffraya8ac9132015-03-13 16:36:36 +0000101
Nicolas Geoffrayeeefa122015-03-13 18:52:59 +0000102 bool IsCoreRegisterSaved(int reg) const {
103 return saved_core_stack_offsets_[reg] != kRegisterNotSaved;
104 }
105
106 bool IsFpuRegisterSaved(int reg) const {
107 return saved_fpu_stack_offsets_[reg] != kRegisterNotSaved;
108 }
109
110 uint32_t GetStackOffsetOfCoreRegister(int reg) const {
111 return saved_core_stack_offsets_[reg];
112 }
113
114 uint32_t GetStackOffsetOfFpuRegister(int reg) const {
115 return saved_fpu_stack_offsets_[reg];
116 }
117
Alexandre Rames8158f282015-08-07 10:26:17 +0100118 virtual bool IsFatal() const { return false; }
119
Alexandre Rames9931f312015-06-19 14:47:01 +0100120 virtual const char* GetDescription() const = 0;
121
Andreas Gampe85b62f22015-09-09 13:15:38 -0700122 Label* GetEntryLabel() { return &entry_label_; }
123 Label* GetExitLabel() { return &exit_label_; }
124
David Srbeckyd28f4a02016-03-14 17:14:24 +0000125 HInstruction* GetInstruction() const {
126 return instruction_;
127 }
128
David Srbecky9cd6d372016-02-09 15:24:47 +0000129 uint32_t GetDexPc() const {
130 return instruction_ != nullptr ? instruction_->GetDexPc() : kNoDexPc;
131 }
132
Zheng Xuda403092015-04-24 17:35:39 +0800133 protected:
Nicolas Geoffrayeeefa122015-03-13 18:52:59 +0000134 static constexpr size_t kMaximumNumberOfExpectedRegisters = 32;
135 static constexpr uint32_t kRegisterNotSaved = -1;
David Srbecky9cd6d372016-02-09 15:24:47 +0000136 // The instruction where this slow path is happening.
137 HInstruction* instruction_;
Nicolas Geoffrayeeefa122015-03-13 18:52:59 +0000138 uint32_t saved_core_stack_offsets_[kMaximumNumberOfExpectedRegisters];
139 uint32_t saved_fpu_stack_offsets_[kMaximumNumberOfExpectedRegisters];
Zheng Xuda403092015-04-24 17:35:39 +0800140
141 private:
Andreas Gampe85b62f22015-09-09 13:15:38 -0700142 Label entry_label_;
143 Label exit_label_;
144
Nicolas Geoffraye5038322014-07-04 09:41:32 +0100145 DISALLOW_COPY_AND_ASSIGN(SlowPathCode);
146};
147
Roland Levillain2d27c8e2015-04-28 15:48:45 +0100148class InvokeDexCallingConventionVisitor {
149 public:
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100150 virtual Location GetNextLocation(DataType::Type type) = 0;
151 virtual Location GetReturnLocation(DataType::Type type) const = 0;
Nicolas Geoffrayfd88f162015-06-03 11:23:52 +0100152 virtual Location GetMethodLocation() const = 0;
Roland Levillain2d27c8e2015-04-28 15:48:45 +0100153
154 protected:
155 InvokeDexCallingConventionVisitor() {}
156 virtual ~InvokeDexCallingConventionVisitor() {}
157
158 // The current index for core registers.
159 uint32_t gp_index_ = 0u;
160 // The current index for floating-point registers.
161 uint32_t float_index_ = 0u;
162 // The current stack index.
163 uint32_t stack_index_ = 0u;
164
165 private:
166 DISALLOW_COPY_AND_ASSIGN(InvokeDexCallingConventionVisitor);
167};
168
Calin Juravlee460d1d2015-09-29 04:52:17 +0100169class FieldAccessCallingConvention {
170 public:
171 virtual Location GetObjectLocation() const = 0;
172 virtual Location GetFieldIndexLocation() const = 0;
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100173 virtual Location GetReturnLocation(DataType::Type type) const = 0;
174 virtual Location GetSetValueLocation(DataType::Type type, bool is_instance) const = 0;
175 virtual Location GetFpuLocation(DataType::Type type) const = 0;
Calin Juravlee460d1d2015-09-29 04:52:17 +0100176 virtual ~FieldAccessCallingConvention() {}
177
178 protected:
179 FieldAccessCallingConvention() {}
180
181 private:
182 DISALLOW_COPY_AND_ASSIGN(FieldAccessCallingConvention);
183};
184
Vladimir Markod58b8372016-04-12 18:51:43 +0100185class CodeGenerator : public DeletableArenaObject<kArenaAllocCodeGenerator> {
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000186 public:
David Brazdil58282f42016-01-14 12:45:10 +0000187 // Compiles the graph to executable instructions.
188 void Compile(CodeAllocator* allocator);
Vladimir Markod58b8372016-04-12 18:51:43 +0100189 static std::unique_ptr<CodeGenerator> Create(HGraph* graph,
190 InstructionSet instruction_set,
191 const InstructionSetFeatures& isa_features,
192 const CompilerOptions& compiler_options,
193 OptimizingCompilerStats* stats = nullptr);
Vladimir Marko174b2e22017-10-12 13:34:49 +0100194 virtual ~CodeGenerator();
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000195
Vladimir Markodc151b22015-10-15 18:02:30 +0100196 // Get the graph. This is the outermost graph, never the graph of a method being inlined.
Nicolas Geoffray787c3072014-03-17 10:20:19 +0000197 HGraph* GetGraph() const { return graph_; }
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000198
Nicolas Geoffraydc23d832015-02-16 11:15:43 +0000199 HBasicBlock* GetNextBlockToEmit() const;
200 HBasicBlock* FirstNonEmptyBlock(HBasicBlock* block) const;
Nicolas Geoffraybab4ed72014-03-11 17:53:17 +0000201 bool GoesToNextBlock(HBasicBlock* current, HBasicBlock* next) const;
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000202
Nicolas Geoffray86dbb9a2014-06-04 11:12:39 +0100203 size_t GetStackSlotOfParameter(HParameterValue* parameter) const {
204 // Note that this follows the current calling convention.
205 return GetFrameSize()
Andreas Gampe542451c2016-07-26 09:02:02 -0700206 + static_cast<size_t>(InstructionSetPointerSize(GetInstructionSet())) // Art method
Nicolas Geoffraye27f31a2014-06-12 17:53:14 +0100207 + parameter->GetIndex() * kVRegSize;
Nicolas Geoffray86dbb9a2014-06-04 11:12:39 +0100208 }
209
Nicolas Geoffray92a73ae2014-10-16 11:12:52 +0100210 virtual void Initialize() = 0;
Serban Constantinescu32f5b4d2014-11-25 20:05:46 +0000211 virtual void Finalize(CodeAllocator* allocator);
Vladimir Markod8dbc8d2017-09-20 13:37:47 +0100212 virtual void EmitLinkerPatches(ArenaVector<linker::LinkerPatch>* linker_patches);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000213 virtual void GenerateFrameEntry() = 0;
214 virtual void GenerateFrameExit() = 0;
Nicolas Geoffray92a73ae2014-10-16 11:12:52 +0100215 virtual void Bind(HBasicBlock* block) = 0;
Calin Juravle175dc732015-08-25 15:42:32 +0100216 virtual void MoveConstant(Location destination, int32_t value) = 0;
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100217 virtual void MoveLocation(Location dst, Location src, DataType::Type dst_type) = 0;
Calin Juravlee460d1d2015-09-29 04:52:17 +0100218 virtual void AddLocationAsTemp(Location location, LocationSummary* locations) = 0;
219
Nicolas Geoffray787c3072014-03-17 10:20:19 +0000220 virtual Assembler* GetAssembler() = 0;
Alexandre Rameseb7b7392015-06-19 14:47:01 +0100221 virtual const Assembler& GetAssembler() const = 0;
Nicolas Geoffray707c8092014-04-04 10:50:14 +0100222 virtual size_t GetWordSize() const = 0;
Mark Mendellf85a9ca2015-01-13 09:20:58 -0500223 virtual size_t GetFloatingPointSpillSlotSize() const = 0;
Alexandre Ramesc01a6642016-04-15 11:54:06 +0100224 virtual uintptr_t GetAddressOf(HBasicBlock* block) = 0;
Nicolas Geoffray4c204ba2015-02-03 15:12:35 +0000225 void InitializeCodeGeneration(size_t number_of_spill_slots,
Vladimir Marko70e97462016-08-09 11:04:26 +0100226 size_t maximum_safepoint_spill_size,
Nicolas Geoffray4c204ba2015-02-03 15:12:35 +0000227 size_t number_of_out_slots,
Vladimir Markofa6b93c2015-09-15 10:15:55 +0100228 const ArenaVector<HBasicBlock*>& block_order);
Alexandre Rames68bd9b92016-07-15 17:41:13 +0100229 // Backends can override this as necessary. For most, no special alignment is required.
230 virtual uint32_t GetPreferredSlotsAlignment() const { return 1; }
Nicolas Geoffray787c3072014-03-17 10:20:19 +0000231
232 uint32_t GetFrameSize() const { return frame_size_; }
233 void SetFrameSize(uint32_t size) { frame_size_ = size; }
Nicolas Geoffray8ccc3f52014-03-19 10:34:11 +0000234 uint32_t GetCoreSpillMask() const { return core_spill_mask_; }
Nicolas Geoffrayd97dc402015-01-22 13:50:01 +0000235 uint32_t GetFpuSpillMask() const { return fpu_spill_mask_; }
Nicolas Geoffray787c3072014-03-17 10:20:19 +0000236
Nicolas Geoffray71175b72014-10-09 22:13:55 +0100237 size_t GetNumberOfCoreRegisters() const { return number_of_core_registers_; }
238 size_t GetNumberOfFloatingPointRegisters() const { return number_of_fpu_registers_; }
David Brazdil58282f42016-01-14 12:45:10 +0000239 virtual void SetupBlockedRegisters() const = 0;
Nicolas Geoffray71175b72014-10-09 22:13:55 +0100240
Nicolas Geoffray4dee6362015-01-23 18:23:14 +0000241 virtual void ComputeSpillMask() {
242 core_spill_mask_ = allocated_registers_.GetCoreRegisters() & core_callee_save_mask_;
243 DCHECK_NE(core_spill_mask_, 0u) << "At least the return address register must be saved";
244 fpu_spill_mask_ = allocated_registers_.GetFloatingPointRegisters() & fpu_callee_save_mask_;
245 }
246
247 static uint32_t ComputeRegisterMask(const int* registers, size_t length) {
248 uint32_t mask = 0;
249 for (size_t i = 0, e = length; i < e; ++i) {
250 mask |= (1 << registers[i]);
251 }
252 return mask;
253 }
254
Nicolas Geoffraya7062e02014-05-22 12:50:17 +0100255 virtual void DumpCoreRegister(std::ostream& stream, int reg) const = 0;
256 virtual void DumpFloatingPointRegister(std::ostream& stream, int reg) const = 0;
Nicolas Geoffray412f10c2014-06-19 10:00:34 +0100257 virtual InstructionSet GetInstructionSet() const = 0;
Calin Juravlecd6dffe2015-01-08 17:35:35 +0000258
259 const CompilerOptions& GetCompilerOptions() const { return compiler_options_; }
260
Nicolas Geoffray102cbed2014-10-15 18:31:05 +0100261 // Saves the register in the stack. Returns the size taken on stack.
262 virtual size_t SaveCoreRegister(size_t stack_index, uint32_t reg_id) = 0;
263 // Restores the register from the stack. Returns the size taken on stack.
264 virtual size_t RestoreCoreRegister(size_t stack_index, uint32_t reg_id) = 0;
Nicolas Geoffray234d69d2015-03-09 10:28:50 +0000265
266 virtual size_t SaveFloatingPointRegister(size_t stack_index, uint32_t reg_id) = 0;
267 virtual size_t RestoreFloatingPointRegister(size_t stack_index, uint32_t reg_id) = 0;
268
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100269 virtual bool NeedsTwoRegisters(DataType::Type type) const = 0;
Nicolas Geoffray234d69d2015-03-09 10:28:50 +0000270 // Returns whether we should split long moves in parallel moves.
271 virtual bool ShouldSplitLongMoves() const { return false; }
Nicolas Geoffraya7062e02014-05-22 12:50:17 +0100272
Roland Levillain0d5a2812015-11-13 10:07:31 +0000273 size_t GetNumberOfCoreCalleeSaveRegisters() const {
274 return POPCOUNT(core_callee_save_mask_);
275 }
276
277 size_t GetNumberOfCoreCallerSaveRegisters() const {
278 DCHECK_GE(GetNumberOfCoreRegisters(), GetNumberOfCoreCalleeSaveRegisters());
279 return GetNumberOfCoreRegisters() - GetNumberOfCoreCalleeSaveRegisters();
280 }
281
Nicolas Geoffray98893962015-01-21 12:32:32 +0000282 bool IsCoreCalleeSaveRegister(int reg) const {
283 return (core_callee_save_mask_ & (1 << reg)) != 0;
284 }
285
286 bool IsFloatingPointCalleeSaveRegister(int reg) const {
287 return (fpu_callee_save_mask_ & (1 << reg)) != 0;
288 }
289
Vladimir Marko70e97462016-08-09 11:04:26 +0100290 uint32_t GetSlowPathSpills(LocationSummary* locations, bool core_registers) const {
291 DCHECK(locations->OnlyCallsOnSlowPath() ||
292 (locations->Intrinsified() && locations->CallsOnMainAndSlowPath() &&
293 !locations->HasCustomSlowPathCallingConvention()));
294 uint32_t live_registers = core_registers
295 ? locations->GetLiveRegisters()->GetCoreRegisters()
296 : locations->GetLiveRegisters()->GetFloatingPointRegisters();
297 if (locations->HasCustomSlowPathCallingConvention()) {
298 // Save only the live registers that the custom calling convention wants us to save.
299 uint32_t caller_saves = core_registers
300 ? locations->GetCustomSlowPathCallerSaves().GetCoreRegisters()
301 : locations->GetCustomSlowPathCallerSaves().GetFloatingPointRegisters();
302 return live_registers & caller_saves;
303 } else {
304 // Default ABI, we need to spill non-callee-save live registers.
305 uint32_t callee_saves = core_registers ? core_callee_save_mask_ : fpu_callee_save_mask_;
306 return live_registers & ~callee_saves;
307 }
308 }
309
310 size_t GetNumberOfSlowPathSpills(LocationSummary* locations, bool core_registers) const {
311 return POPCOUNT(GetSlowPathSpills(locations, core_registers));
312 }
313
Mingyao Yang063fc772016-08-02 11:02:54 -0700314 size_t GetStackOffsetOfShouldDeoptimizeFlag() const {
315 DCHECK(GetGraph()->HasShouldDeoptimizeFlag());
316 DCHECK_GE(GetFrameSize(), FrameEntrySpillSize() + kShouldDeoptimizeFlagSize);
317 return GetFrameSize() - FrameEntrySpillSize() - kShouldDeoptimizeFlagSize;
318 }
319
Yevgeny Rouban2a7c1ef2015-07-22 18:36:24 +0600320 // Record native to dex mapping for a suspend point. Required by runtime.
Nicolas Geoffrayeeefa122015-03-13 18:52:59 +0000321 void RecordPcInfo(HInstruction* instruction, uint32_t dex_pc, SlowPathCode* slow_path = nullptr);
David Srbeckyb7070a22016-01-08 18:13:53 +0000322 // Check whether we have already recorded mapping at this PC.
323 bool HasStackMapAtCurrentPc();
David Srbeckyc7098ff2016-02-09 14:30:11 +0000324 // Record extra stack maps if we support native debugging.
David Srbeckyd28f4a02016-03-14 17:14:24 +0000325 void MaybeRecordNativeDebugInfo(HInstruction* instruction,
326 uint32_t dex_pc,
327 SlowPathCode* slow_path = nullptr);
Yevgeny Rouban2a7c1ef2015-07-22 18:36:24 +0600328
Calin Juravle77520bc2015-01-12 18:45:46 +0000329 bool CanMoveNullCheckToUser(HNullCheck* null_check);
330 void MaybeRecordImplicitNullCheck(HInstruction* instruction);
Vladimir Marko804b03f2016-09-14 16:26:36 +0100331 LocationSummary* CreateThrowingSlowPathLocations(
332 HInstruction* instruction, RegisterSet caller_saves = RegisterSet::Empty());
Calin Juravle2ae48182016-03-16 14:05:09 +0000333 void GenerateNullCheck(HNullCheck* null_check);
334 virtual void GenerateImplicitNullCheck(HNullCheck* null_check) = 0;
335 virtual void GenerateExplicitNullCheck(HNullCheck* null_check) = 0;
Nicolas Geoffray8ccc3f52014-03-19 10:34:11 +0000336
David Brazdil77a48ae2015-09-15 12:34:04 +0000337 // Records a stack map which the runtime might use to set catch phi values
338 // during exception delivery.
339 // TODO: Replace with a catch-entering instruction that records the environment.
340 void RecordCatchBlockInfo();
341
Vladimir Marko174b2e22017-10-12 13:34:49 +0100342 // Get the ScopedArenaAllocator used for codegen memory allocation.
343 ScopedArenaAllocator* GetScopedAllocator();
344
345 void AddSlowPath(SlowPathCode* slow_path);
Nicolas Geoffraye5038322014-07-04 09:41:32 +0100346
Mathieu Chartiercbcedbf2017-03-12 22:24:50 -0700347 void BuildStackMaps(MemoryRegion stack_map_region,
348 MemoryRegion method_info_region,
349 const DexFile::CodeItem& code_item);
350 void ComputeStackMapAndMethodInfoSize(size_t* stack_map_size, size_t* method_info_size);
Vladimir Marko174b2e22017-10-12 13:34:49 +0100351 size_t GetNumberOfJitRoots() const;
Nicolas Geoffray132d8362016-11-16 09:19:42 +0000352
353 // Fills the `literals` array with literals collected during code generation.
354 // Also emits literal patches.
355 void EmitJitRoots(uint8_t* code,
356 Handle<mirror::ObjectArray<mirror::Object>> roots,
Nicolas Geoffrayf0acfe72017-01-09 20:54:52 +0000357 const uint8_t* roots_data)
Nicolas Geoffray132d8362016-11-16 09:19:42 +0000358 REQUIRES_SHARED(Locks::mutator_lock_);
Nicolas Geoffray787c3072014-03-17 10:20:19 +0000359
Nicolas Geoffrayf12feb82014-07-17 18:32:41 +0100360 bool IsLeafMethod() const {
361 return is_leaf_;
362 }
363
364 void MarkNotLeaf() {
365 is_leaf_ = false;
Nicolas Geoffrayc0572a42015-02-06 14:35:25 +0000366 requires_current_method_ = true;
367 }
368
369 void SetRequiresCurrentMethod() {
370 requires_current_method_ = true;
371 }
372
373 bool RequiresCurrentMethod() const {
374 return requires_current_method_;
Nicolas Geoffrayf12feb82014-07-17 18:32:41 +0100375 }
376
Nicolas Geoffray3c049742014-09-24 18:10:46 +0100377 // Clears the spill slots taken by loop phis in the `LocationSummary` of the
378 // suspend check. This is called when the code generator generates code
379 // for the suspend check at the back edge (instead of where the suspend check
380 // is, which is the loop entry). At this point, the spill slots for the phis
381 // have not been written to.
Vladimir Markobea75ff2017-10-11 20:39:54 +0100382 void ClearSpillSlotsFromLoopPhisInStackMap(HSuspendCheck* suspend_check,
383 HParallelMove* spills) const;
Nicolas Geoffray3c049742014-09-24 18:10:46 +0100384
Nicolas Geoffray71175b72014-10-09 22:13:55 +0100385 bool* GetBlockedCoreRegisters() const { return blocked_core_registers_; }
Nicolas Geoffray102cbed2014-10-15 18:31:05 +0100386 bool* GetBlockedFloatingPointRegisters() const { return blocked_fpu_registers_; }
Nicolas Geoffray71175b72014-10-09 22:13:55 +0100387
Matthew Gharrityd9ffd0d2016-06-22 10:27:55 -0700388 bool IsBlockedCoreRegister(size_t i) { return blocked_core_registers_[i]; }
389 bool IsBlockedFloatingPointRegister(size_t i) { return blocked_fpu_registers_[i]; }
390
Nicolas Geoffray19a19cf2014-10-22 16:07:05 +0100391 // Helper that returns the pointer offset of an index in an object array.
392 // Note: this method assumes we always have the same pointer size, regardless
393 // of the architecture.
394 static size_t GetCacheOffset(uint32_t index);
Mathieu Chartiere401d142015-04-22 13:56:20 -0700395 // Pointer variant for ArtMethod and ArtField arrays.
396 size_t GetCachePointerOffset(uint32_t index);
Nicolas Geoffray19a19cf2014-10-22 16:07:05 +0100397
Vladimir Markodce016e2016-04-28 13:10:02 +0100398 // Helper that returns the offset of the array's length field.
399 // Note: Besides the normal arrays, we also use the HArrayLength for
400 // accessing the String's `count` field in String intrinsics.
401 static uint32_t GetArrayLengthOffset(HArrayLength* array_length);
402
Vladimir Marko87f3fcb2016-04-28 15:52:11 +0100403 // Helper that returns the offset of the array's data.
404 // Note: Besides the normal arrays, we also use the HArrayGet for
405 // accessing the String's `value` field in String intrinsics.
406 static uint32_t GetArrayDataOffset(HArrayGet* array_get);
407
Nicolas Geoffray90218252015-04-15 11:56:51 +0100408 void EmitParallelMoves(Location from1,
409 Location to1,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100410 DataType::Type type1,
Nicolas Geoffray90218252015-04-15 11:56:51 +0100411 Location from2,
412 Location to2,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100413 DataType::Type type2);
Nicolas Geoffrayf0e39372014-11-12 17:50:07 +0000414
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100415 static bool StoreNeedsWriteBarrier(DataType::Type type, HInstruction* value) {
David Brazdil522e2242015-03-17 18:48:28 +0000416 // Check that null value is not represented as an integer constant.
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100417 DCHECK(type != DataType::Type::kReference || !value->IsIntConstant());
418 return type == DataType::Type::kReference && !value->IsNullConstant();
Nicolas Geoffrayaf07bc12014-11-12 18:08:09 +0000419 }
420
Roland Levillaindec8f632016-07-22 17:10:06 +0100421
Orion Hodsonac141392017-01-13 11:53:47 +0000422 // Performs checks pertaining to an InvokeRuntime call.
Alexandre Rames91a65162016-09-19 13:54:30 +0100423 void ValidateInvokeRuntime(QuickEntrypointEnum entrypoint,
424 HInstruction* instruction,
425 SlowPathCode* slow_path);
Alexandre Rames78e3ef62015-08-12 13:43:29 +0100426
Orion Hodsonac141392017-01-13 11:53:47 +0000427 // Performs checks pertaining to an InvokeRuntimeWithoutRecordingPcInfo call.
Roland Levillaindec8f632016-07-22 17:10:06 +0100428 static void ValidateInvokeRuntimeWithoutRecordingPcInfo(HInstruction* instruction,
429 SlowPathCode* slow_path);
430
Nicolas Geoffray98893962015-01-21 12:32:32 +0000431 void AddAllocatedRegister(Location location) {
432 allocated_registers_.Add(location);
433 }
434
Nicolas Geoffray45b83af2015-07-06 15:12:53 +0000435 bool HasAllocatedRegister(bool is_core, int reg) const {
436 return is_core
437 ? allocated_registers_.ContainsCoreRegister(reg)
438 : allocated_registers_.ContainsFloatingPointRegister(reg);
439 }
440
Nicolas Geoffrayc0572a42015-02-06 14:35:25 +0000441 void AllocateLocations(HInstruction* instruction);
442
Roland Levillainaa9b7c42015-02-17 15:40:09 +0000443 // Tells whether the stack frame of the compiled method is
444 // considered "empty", that is either actually having a size of zero,
445 // or just containing the saved return address register.
446 bool HasEmptyFrame() const {
447 return GetFrameSize() == (CallPushesPC() ? GetWordSize() : 0);
448 }
449
Nicolas Geoffray78612082017-07-24 14:18:53 +0100450 static int8_t GetInt8ValueOf(HConstant* constant) {
451 DCHECK(constant->IsIntConstant());
452 return constant->AsIntConstant()->GetValue();
453 }
454
455 static int16_t GetInt16ValueOf(HConstant* constant) {
456 DCHECK(constant->IsIntConstant());
457 return constant->AsIntConstant()->GetValue();
458 }
459
Nicolas Geoffrayd6138ef2015-02-18 14:48:53 +0000460 static int32_t GetInt32ValueOf(HConstant* constant) {
461 if (constant->IsIntConstant()) {
462 return constant->AsIntConstant()->GetValue();
463 } else if (constant->IsNullConstant()) {
464 return 0;
465 } else {
466 DCHECK(constant->IsFloatConstant());
Roland Levillainda4d79b2015-03-24 14:36:11 +0000467 return bit_cast<int32_t, float>(constant->AsFloatConstant()->GetValue());
Nicolas Geoffrayd6138ef2015-02-18 14:48:53 +0000468 }
469 }
470
471 static int64_t GetInt64ValueOf(HConstant* constant) {
472 if (constant->IsIntConstant()) {
473 return constant->AsIntConstant()->GetValue();
474 } else if (constant->IsNullConstant()) {
475 return 0;
476 } else if (constant->IsFloatConstant()) {
Roland Levillainda4d79b2015-03-24 14:36:11 +0000477 return bit_cast<int32_t, float>(constant->AsFloatConstant()->GetValue());
Nicolas Geoffrayd6138ef2015-02-18 14:48:53 +0000478 } else if (constant->IsLongConstant()) {
479 return constant->AsLongConstant()->GetValue();
480 } else {
481 DCHECK(constant->IsDoubleConstant());
Roland Levillainda4d79b2015-03-24 14:36:11 +0000482 return bit_cast<int64_t, double>(constant->AsDoubleConstant()->GetValue());
Nicolas Geoffrayd6138ef2015-02-18 14:48:53 +0000483 }
484 }
485
Nicolas Geoffraya8ac9132015-03-13 16:36:36 +0000486 size_t GetFirstRegisterSlotInSlowPath() const {
487 return first_register_slot_in_slow_path_;
488 }
489
490 uint32_t FrameEntrySpillSize() const {
491 return GetFpuSpillSize() + GetCoreSpillSize();
492 }
493
Roland Levillainec525fc2015-04-28 15:50:20 +0100494 virtual ParallelMoveResolver* GetMoveResolver() = 0;
Nicolas Geoffraya8ac9132015-03-13 16:36:36 +0000495
Nicolas Geoffrayfd88f162015-06-03 11:23:52 +0100496 static void CreateCommonInvokeLocationSummary(
497 HInvoke* invoke, InvokeDexCallingConventionVisitor* visitor);
498
Vladimir Markoe7197bf2017-06-02 17:00:23 +0100499 void GenerateInvokeStaticOrDirectRuntimeCall(
500 HInvokeStaticOrDirect* invoke, Location temp, SlowPathCode* slow_path);
Calin Juravle175dc732015-08-25 15:42:32 +0100501 void GenerateInvokeUnresolvedRuntimeCall(HInvokeUnresolved* invoke);
502
Orion Hodsonac141392017-01-13 11:53:47 +0000503 void GenerateInvokePolymorphicCall(HInvokePolymorphic* invoke);
504
Calin Juravlee460d1d2015-09-29 04:52:17 +0100505 void CreateUnresolvedFieldLocationSummary(
506 HInstruction* field_access,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100507 DataType::Type field_type,
Calin Juravlee460d1d2015-09-29 04:52:17 +0100508 const FieldAccessCallingConvention& calling_convention);
509
510 void GenerateUnresolvedFieldAccess(
511 HInstruction* field_access,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100512 DataType::Type field_type,
Calin Juravlee460d1d2015-09-29 04:52:17 +0100513 uint32_t field_index,
514 uint32_t dex_pc,
515 const FieldAccessCallingConvention& calling_convention);
516
Vladimir Marko41559982017-01-06 14:04:23 +0000517 static void CreateLoadClassRuntimeCallLocationSummary(HLoadClass* cls,
518 Location runtime_type_index_location,
519 Location runtime_return_location);
520 void GenerateLoadClassRuntimeCall(HLoadClass* cls);
Calin Juravle98893e12015-10-02 21:05:03 +0100521
Nicolas Geoffray5bd05a52015-10-13 09:48:30 +0100522 static void CreateSystemArrayCopyLocationSummary(HInvoke* invoke);
523
Alexandre Rameseb7b7392015-06-19 14:47:01 +0100524 void SetDisassemblyInformation(DisassemblyInformation* info) { disasm_info_ = info; }
525 DisassemblyInformation* GetDisassemblyInformation() const { return disasm_info_; }
526
Calin Juravle175dc732015-08-25 15:42:32 +0100527 virtual void InvokeRuntime(QuickEntrypointEnum entrypoint,
528 HInstruction* instruction,
529 uint32_t dex_pc,
Vladimir Marko41559982017-01-06 14:04:23 +0000530 SlowPathCode* slow_path = nullptr) = 0;
Calin Juravle175dc732015-08-25 15:42:32 +0100531
Vladimir Markocac5a7e2016-02-22 10:39:50 +0000532 // Check if the desired_string_load_kind is supported. If it is, return it,
Vladimir Markodbb7f5b2016-03-30 13:23:58 +0100533 // otherwise return a fall-back kind that should be used instead.
Vladimir Markocac5a7e2016-02-22 10:39:50 +0000534 virtual HLoadString::LoadKind GetSupportedLoadStringKind(
535 HLoadString::LoadKind desired_string_load_kind) = 0;
536
Vladimir Markodbb7f5b2016-03-30 13:23:58 +0100537 // Check if the desired_class_load_kind is supported. If it is, return it,
538 // otherwise return a fall-back kind that should be used instead.
539 virtual HLoadClass::LoadKind GetSupportedLoadClassKind(
540 HLoadClass::LoadKind desired_class_load_kind) = 0;
541
Nicolas Geoffray132d8362016-11-16 09:19:42 +0000542 static LocationSummary::CallKind GetLoadStringCallKind(HLoadString* load) {
543 switch (load->GetLoadKind()) {
544 case HLoadString::LoadKind::kBssEntry:
545 DCHECK(load->NeedsEnvironment());
546 return LocationSummary::kCallOnSlowPath;
Vladimir Marko847e6ce2017-06-02 13:55:07 +0100547 case HLoadString::LoadKind::kRuntimeCall:
Nicolas Geoffray132d8362016-11-16 09:19:42 +0000548 DCHECK(load->NeedsEnvironment());
549 return LocationSummary::kCallOnMainOnly;
550 case HLoadString::LoadKind::kJitTableAddress:
551 DCHECK(!load->NeedsEnvironment());
552 return kEmitCompilerReadBarrier
553 ? LocationSummary::kCallOnSlowPath
554 : LocationSummary::kNoCall;
555 break;
556 default:
557 DCHECK(!load->NeedsEnvironment());
558 return LocationSummary::kNoCall;
559 }
560 }
561
Vladimir Markodc151b22015-10-15 18:02:30 +0100562 // Check if the desired_dispatch_info is supported. If it is, return it,
563 // otherwise return a fall-back info that should be used instead.
564 virtual HInvokeStaticOrDirect::DispatchInfo GetSupportedInvokeStaticOrDirectDispatch(
565 const HInvokeStaticOrDirect::DispatchInfo& desired_dispatch_info,
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +0100566 HInvokeStaticOrDirect* invoke) = 0;
Vladimir Markodc151b22015-10-15 18:02:30 +0100567
Andreas Gampe85b62f22015-09-09 13:15:38 -0700568 // Generate a call to a static or direct method.
Vladimir Markoe7197bf2017-06-02 17:00:23 +0100569 virtual void GenerateStaticOrDirectCall(
570 HInvokeStaticOrDirect* invoke, Location temp, SlowPathCode* slow_path = nullptr) = 0;
Andreas Gampe85b62f22015-09-09 13:15:38 -0700571 // Generate a call to a virtual method.
Vladimir Markoe7197bf2017-06-02 17:00:23 +0100572 virtual void GenerateVirtualCall(
573 HInvokeVirtual* invoke, Location temp, SlowPathCode* slow_path = nullptr) = 0;
Andreas Gampe85b62f22015-09-09 13:15:38 -0700574
575 // Copy the result of a call into the given target.
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100576 virtual void MoveFromReturnRegister(Location trg, DataType::Type type) = 0;
Andreas Gampe85b62f22015-09-09 13:15:38 -0700577
David Srbeckyc7098ff2016-02-09 14:30:11 +0000578 virtual void GenerateNop() = 0;
579
Nicolas Geoffrayb048cb72017-01-23 22:50:24 +0000580 static QuickEntrypointEnum GetArrayAllocationEntrypoint(Handle<mirror::Class> array_klass);
581
Nicolas Geoffray787c3072014-03-17 10:20:19 +0000582 protected:
Vladimir Markoaad75c62016-10-03 08:46:48 +0000583 // Patch info used for recording locations of required linker patches and their targets,
584 // i.e. target method, string, type or code identified by their dex file and index.
Vladimir Marko58155012015-08-19 12:49:41 +0000585 template <typename LabelType>
Vladimir Markoaad75c62016-10-03 08:46:48 +0000586 struct PatchInfo {
587 PatchInfo(const DexFile& target_dex_file, uint32_t target_index)
588 : dex_file(target_dex_file), index(target_index) { }
Vladimir Markocac5a7e2016-02-22 10:39:50 +0000589
590 const DexFile& dex_file;
Vladimir Markoaad75c62016-10-03 08:46:48 +0000591 uint32_t index;
Vladimir Markodbb7f5b2016-03-30 13:23:58 +0100592 LabelType label;
593 };
594
Nicolas Geoffray71175b72014-10-09 22:13:55 +0100595 CodeGenerator(HGraph* graph,
596 size_t number_of_core_registers,
597 size_t number_of_fpu_registers,
Calin Juravlecd6dffe2015-01-08 17:35:35 +0000598 size_t number_of_register_pairs,
Nicolas Geoffray98893962015-01-21 12:32:32 +0000599 uint32_t core_callee_save_mask,
600 uint32_t fpu_callee_save_mask,
Serban Constantinescuecc43662015-08-13 13:33:12 +0100601 const CompilerOptions& compiler_options,
Vladimir Marko174b2e22017-10-12 13:34:49 +0100602 OptimizingCompilerStats* stats);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000603
Nicolas Geoffrayc0572a42015-02-06 14:35:25 +0000604 virtual HGraphVisitor* GetLocationBuilder() = 0;
605 virtual HGraphVisitor* GetInstructionVisitor() = 0;
Nicolas Geoffrayf0e39372014-11-12 17:50:07 +0000606
Nicolas Geoffrayd97dc402015-01-22 13:50:01 +0000607 // Returns the location of the first spilled entry for floating point registers,
608 // relative to the stack pointer.
609 uint32_t GetFpuSpillStart() const {
Nicolas Geoffrayd97dc402015-01-22 13:50:01 +0000610 return GetFrameSize() - FrameEntrySpillSize();
611 }
612
613 uint32_t GetFpuSpillSize() const {
614 return POPCOUNT(fpu_spill_mask_) * GetFloatingPointSpillSlotSize();
615 }
616
617 uint32_t GetCoreSpillSize() const {
618 return POPCOUNT(core_spill_mask_) * GetWordSize();
619 }
620
Alexey Frunze58320ce2016-08-30 21:40:46 -0700621 virtual bool HasAllocatedCalleeSaveRegisters() const {
Nicolas Geoffrayc0572a42015-02-06 14:35:25 +0000622 // We check the core registers against 1 because it always comprises the return PC.
623 return (POPCOUNT(allocated_registers_.GetCoreRegisters() & core_callee_save_mask_) != 1)
624 || (POPCOUNT(allocated_registers_.GetFloatingPointRegisters() & fpu_callee_save_mask_) != 0);
625 }
626
627 bool CallPushesPC() const {
628 InstructionSet instruction_set = GetInstructionSet();
Vladimir Marko33bff252017-11-01 14:35:42 +0000629 return instruction_set == InstructionSet::kX86 || instruction_set == InstructionSet::kX86_64;
Nicolas Geoffrayc0572a42015-02-06 14:35:25 +0000630 }
631
Vladimir Marko225b6462015-09-28 12:17:40 +0100632 // Arm64 has its own type for a label, so we need to templatize these methods
Nicolas Geoffraydc23d832015-02-16 11:15:43 +0000633 // to share the logic.
Vladimir Marko225b6462015-09-28 12:17:40 +0100634
635 template <typename LabelType>
636 LabelType* CommonInitializeLabels() {
Vladimir Markob95fb772015-09-30 13:32:31 +0100637 // We use raw array allocations instead of ArenaVector<> because Labels are
638 // non-constructible and non-movable and as such cannot be held in a vector.
Vladimir Marko225b6462015-09-28 12:17:40 +0100639 size_t size = GetGraph()->GetBlocks().size();
Vladimir Markoca6fff82017-10-03 14:49:14 +0100640 LabelType* labels =
641 GetGraph()->GetAllocator()->AllocArray<LabelType>(size, kArenaAllocCodeGenerator);
Vladimir Marko225b6462015-09-28 12:17:40 +0100642 for (size_t i = 0; i != size; ++i) {
643 new(labels + i) LabelType();
644 }
645 return labels;
646 }
647
Vladimir Marko58155012015-08-19 12:49:41 +0000648 template <typename LabelType>
649 LabelType* CommonGetLabelOf(LabelType* raw_pointer_to_labels_array, HBasicBlock* block) const {
Nicolas Geoffraydc23d832015-02-16 11:15:43 +0000650 block = FirstNonEmptyBlock(block);
651 return raw_pointer_to_labels_array + block->GetBlockId();
652 }
653
Vladimir Marko0f7dca42015-11-02 14:36:43 +0000654 SlowPathCode* GetCurrentSlowPath() {
655 return current_slow_path_;
656 }
657
Vladimir Marko174b2e22017-10-12 13:34:49 +0100658 StackMapStream* GetStackMapStream();
659
660 void ReserveJitStringRoot(StringReference string_reference, Handle<mirror::String> string);
661 uint64_t GetJitStringRootIndex(StringReference string_reference);
662 void ReserveJitClassRoot(TypeReference type_reference, Handle<mirror::Class> klass);
663 uint64_t GetJitClassRootIndex(TypeReference type_reference);
664
Nicolas Geoffray132d8362016-11-16 09:19:42 +0000665 // Emit the patches assocatied with JIT roots. Only applies to JIT compiled code.
Vladimir Marko174b2e22017-10-12 13:34:49 +0100666 virtual void EmitJitRootPatches(uint8_t* code, const uint8_t* roots_data);
Nicolas Geoffray132d8362016-11-16 09:19:42 +0000667
Nicolas Geoffray8ccc3f52014-03-19 10:34:11 +0000668 // Frame size required for this method.
669 uint32_t frame_size_;
670 uint32_t core_spill_mask_;
Nicolas Geoffrayd97dc402015-01-22 13:50:01 +0000671 uint32_t fpu_spill_mask_;
Nicolas Geoffray3bca0df2014-09-19 11:01:00 +0100672 uint32_t first_register_slot_in_slow_path_;
Nicolas Geoffray8ccc3f52014-03-19 10:34:11 +0000673
Nicolas Geoffray98893962015-01-21 12:32:32 +0000674 // Registers that were allocated during linear scan.
675 RegisterSet allocated_registers_;
676
Nicolas Geoffray71175b72014-10-09 22:13:55 +0100677 // Arrays used when doing register allocation to know which
678 // registers we can allocate. `SetupBlockedRegisters` updates the
679 // arrays.
680 bool* const blocked_core_registers_;
681 bool* const blocked_fpu_registers_;
Nicolas Geoffray71175b72014-10-09 22:13:55 +0100682 size_t number_of_core_registers_;
683 size_t number_of_fpu_registers_;
684 size_t number_of_register_pairs_;
Nicolas Geoffray98893962015-01-21 12:32:32 +0000685 const uint32_t core_callee_save_mask_;
686 const uint32_t fpu_callee_save_mask_;
Nicolas Geoffray71175b72014-10-09 22:13:55 +0100687
Vladimir Markocf93a5c2015-06-16 11:33:24 +0000688 // The order to use for code generation.
Vladimir Markofa6b93c2015-09-15 10:15:55 +0100689 const ArenaVector<HBasicBlock*>* block_order_;
Vladimir Markocf93a5c2015-06-16 11:33:24 +0000690
Alexandre Rameseb7b7392015-06-19 14:47:01 +0100691 DisassemblyInformation* disasm_info_;
692
Nicolas Geoffraybab4ed72014-03-11 17:53:17 +0000693 private:
Vladimir Marko174b2e22017-10-12 13:34:49 +0100694 class CodeGenerationData;
695
696 void InitializeCodeGenerationData();
Nicolas Geoffray3bca0df2014-09-19 11:01:00 +0100697 size_t GetStackOffsetOfSavedRegister(size_t index);
Alexandre Rameseb7b7392015-06-19 14:47:01 +0100698 void GenerateSlowPaths();
Mark Mendell5f874182015-03-04 15:42:45 -0500699 void BlockIfInRegister(Location location, bool is_out = false) const;
Nicolas Geoffrayb1d0f3f2015-05-14 12:41:51 +0100700 void EmitEnvironment(HEnvironment* environment, SlowPathCode* slow_path);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000701
Serban Constantinescuecc43662015-08-13 13:33:12 +0100702 OptimizingCompilerStats* stats_;
703
Nicolas Geoffray787c3072014-03-17 10:20:19 +0000704 HGraph* const graph_;
Calin Juravlecd6dffe2015-01-08 17:35:35 +0000705 const CompilerOptions& compiler_options_;
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000706
Aart Bik42249c32016-01-07 15:33:50 -0800707 // The current slow-path that we're generating code for.
Vladimir Marko0f7dca42015-11-02 14:36:43 +0000708 SlowPathCode* current_slow_path_;
709
Nicolas Geoffray4c204ba2015-02-03 15:12:35 +0000710 // The current block index in `block_order_` of the block
711 // we are generating code for.
712 size_t current_block_index_;
713
Nicolas Geoffrayc0572a42015-02-06 14:35:25 +0000714 // Whether the method is a leaf method.
Nicolas Geoffrayf12feb82014-07-17 18:32:41 +0100715 bool is_leaf_;
716
Nicolas Geoffrayc0572a42015-02-06 14:35:25 +0000717 // Whether an instruction in the graph accesses the current method.
Vladimir Marko3b7537b2016-09-13 11:56:01 +0000718 // TODO: Rename: this actually indicates that some instruction in the method
719 // needs the environment including a valid stack frame.
Nicolas Geoffrayc0572a42015-02-06 14:35:25 +0000720 bool requires_current_method_;
721
Vladimir Marko174b2e22017-10-12 13:34:49 +0100722 // The CodeGenerationData contains a ScopedArenaAllocator intended for reusing the
723 // ArenaStack memory allocated in previous passes instead of adding to the memory
724 // held by the ArenaAllocator. This ScopedArenaAllocator is created in
725 // CodeGenerator::Compile() and remains alive until the CodeGenerator is destroyed.
726 std::unique_ptr<CodeGenerationData> code_generation_data_;
727
David Srbeckyc6b4dd82015-04-07 20:32:43 +0100728 friend class OptimizingCFITest;
729
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000730 DISALLOW_COPY_AND_ASSIGN(CodeGenerator);
731};
732
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +0100733template <typename C, typename F>
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100734class CallingConvention {
735 public:
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +0100736 CallingConvention(const C* registers,
737 size_t number_of_registers,
738 const F* fpu_registers,
Mathieu Chartiere401d142015-04-22 13:56:20 -0700739 size_t number_of_fpu_registers,
Andreas Gampe542451c2016-07-26 09:02:02 -0700740 PointerSize pointer_size)
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +0100741 : registers_(registers),
742 number_of_registers_(number_of_registers),
743 fpu_registers_(fpu_registers),
Mathieu Chartiere401d142015-04-22 13:56:20 -0700744 number_of_fpu_registers_(number_of_fpu_registers),
745 pointer_size_(pointer_size) {}
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100746
747 size_t GetNumberOfRegisters() const { return number_of_registers_; }
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +0100748 size_t GetNumberOfFpuRegisters() const { return number_of_fpu_registers_; }
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100749
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +0100750 C GetRegisterAt(size_t index) const {
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100751 DCHECK_LT(index, number_of_registers_);
752 return registers_[index];
753 }
754
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +0100755 F GetFpuRegisterAt(size_t index) const {
756 DCHECK_LT(index, number_of_fpu_registers_);
757 return fpu_registers_[index];
758 }
759
760 size_t GetStackOffsetOf(size_t index) const {
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100761 // We still reserve the space for parameters passed by registers.
Mathieu Chartiere401d142015-04-22 13:56:20 -0700762 // Add space for the method pointer.
Andreas Gampe542451c2016-07-26 09:02:02 -0700763 return static_cast<size_t>(pointer_size_) + index * kVRegSize;
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100764 }
765
766 private:
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +0100767 const C* registers_;
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100768 const size_t number_of_registers_;
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +0100769 const F* fpu_registers_;
770 const size_t number_of_fpu_registers_;
Andreas Gampe542451c2016-07-26 09:02:02 -0700771 const PointerSize pointer_size_;
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100772
773 DISALLOW_COPY_AND_ASSIGN(CallingConvention);
774};
775
Aart Bik42249c32016-01-07 15:33:50 -0800776/**
777 * A templated class SlowPathGenerator with a templated method NewSlowPath()
778 * that can be used by any code generator to share equivalent slow-paths with
779 * the objective of reducing generated code size.
780 *
781 * InstructionType: instruction that requires SlowPathCodeType
782 * SlowPathCodeType: subclass of SlowPathCode, with constructor SlowPathCodeType(InstructionType *)
783 */
784template <typename InstructionType>
785class SlowPathGenerator {
786 static_assert(std::is_base_of<HInstruction, InstructionType>::value,
787 "InstructionType is not a subclass of art::HInstruction");
788
789 public:
790 SlowPathGenerator(HGraph* graph, CodeGenerator* codegen)
791 : graph_(graph),
792 codegen_(codegen),
Vladimir Markoca6fff82017-10-03 14:49:14 +0100793 slow_path_map_(std::less<uint32_t>(),
794 graph->GetAllocator()->Adapter(kArenaAllocSlowPaths)) {}
Aart Bik42249c32016-01-07 15:33:50 -0800795
796 // Creates and adds a new slow-path, if needed, or returns existing one otherwise.
797 // Templating the method (rather than the whole class) on the slow-path type enables
798 // keeping this code at a generic, non architecture-specific place.
799 //
800 // NOTE: This approach assumes each InstructionType only generates one SlowPathCodeType.
801 // To relax this requirement, we would need some RTTI on the stored slow-paths,
802 // or template the class as a whole on SlowPathType.
803 template <typename SlowPathCodeType>
804 SlowPathCodeType* NewSlowPath(InstructionType* instruction) {
805 static_assert(std::is_base_of<SlowPathCode, SlowPathCodeType>::value,
806 "SlowPathCodeType is not a subclass of art::SlowPathCode");
807 static_assert(std::is_constructible<SlowPathCodeType, InstructionType*>::value,
808 "SlowPathCodeType is not constructible from InstructionType*");
809 // Iterate over potential candidates for sharing. Currently, only same-typed
810 // slow-paths with exactly the same dex-pc are viable candidates.
811 // TODO: pass dex-pc/slow-path-type to run-time to allow even more sharing?
812 const uint32_t dex_pc = instruction->GetDexPc();
813 auto iter = slow_path_map_.find(dex_pc);
814 if (iter != slow_path_map_.end()) {
Vladimir Marko7d157fc2017-05-10 16:29:23 +0100815 const ArenaVector<std::pair<InstructionType*, SlowPathCode*>>& candidates = iter->second;
Aart Bik42249c32016-01-07 15:33:50 -0800816 for (const auto& it : candidates) {
817 InstructionType* other_instruction = it.first;
818 SlowPathCodeType* other_slow_path = down_cast<SlowPathCodeType*>(it.second);
819 // Determine if the instructions allow for slow-path sharing.
820 if (HaveSameLiveRegisters(instruction, other_instruction) &&
821 HaveSameStackMap(instruction, other_instruction)) {
822 // Can share: reuse existing one.
823 return other_slow_path;
824 }
825 }
826 } else {
827 // First time this dex-pc is seen.
Vladimir Markoca6fff82017-10-03 14:49:14 +0100828 iter = slow_path_map_.Put(dex_pc,
829 {{}, {graph_->GetAllocator()->Adapter(kArenaAllocSlowPaths)}});
Aart Bik42249c32016-01-07 15:33:50 -0800830 }
831 // Cannot share: create and add new slow-path for this particular dex-pc.
Vladimir Marko174b2e22017-10-12 13:34:49 +0100832 SlowPathCodeType* slow_path =
833 new (codegen_->GetScopedAllocator()) SlowPathCodeType(instruction);
Aart Bik42249c32016-01-07 15:33:50 -0800834 iter->second.emplace_back(std::make_pair(instruction, slow_path));
835 codegen_->AddSlowPath(slow_path);
836 return slow_path;
837 }
838
839 private:
840 // Tests if both instructions have same set of live physical registers. This ensures
841 // the slow-path has exactly the same preamble on saving these registers to stack.
842 bool HaveSameLiveRegisters(const InstructionType* i1, const InstructionType* i2) const {
843 const uint32_t core_spill = ~codegen_->GetCoreSpillMask();
844 const uint32_t fpu_spill = ~codegen_->GetFpuSpillMask();
845 RegisterSet* live1 = i1->GetLocations()->GetLiveRegisters();
846 RegisterSet* live2 = i2->GetLocations()->GetLiveRegisters();
847 return (((live1->GetCoreRegisters() & core_spill) ==
848 (live2->GetCoreRegisters() & core_spill)) &&
849 ((live1->GetFloatingPointRegisters() & fpu_spill) ==
850 (live2->GetFloatingPointRegisters() & fpu_spill)));
851 }
852
853 // Tests if both instructions have the same stack map. This ensures the interpreter
854 // will find exactly the same dex-registers at the same entries.
855 bool HaveSameStackMap(const InstructionType* i1, const InstructionType* i2) const {
856 DCHECK(i1->HasEnvironment());
857 DCHECK(i2->HasEnvironment());
858 // We conservatively test if the two instructions find exactly the same instructions
859 // and location in each dex-register. This guarantees they will have the same stack map.
860 HEnvironment* e1 = i1->GetEnvironment();
861 HEnvironment* e2 = i2->GetEnvironment();
862 if (e1->GetParent() != e2->GetParent() || e1->Size() != e2->Size()) {
863 return false;
864 }
865 for (size_t i = 0, sz = e1->Size(); i < sz; ++i) {
866 if (e1->GetInstructionAt(i) != e2->GetInstructionAt(i) ||
867 !e1->GetLocationAt(i).Equals(e2->GetLocationAt(i))) {
868 return false;
869 }
870 }
871 return true;
872 }
873
874 HGraph* const graph_;
875 CodeGenerator* const codegen_;
876
877 // Map from dex-pc to vector of already existing instruction/slow-path pairs.
878 ArenaSafeMap<uint32_t, ArenaVector<std::pair<InstructionType*, SlowPathCode*>>> slow_path_map_;
879
880 DISALLOW_COPY_AND_ASSIGN(SlowPathGenerator);
881};
882
883class InstructionCodeGenerator : public HGraphVisitor {
884 public:
885 InstructionCodeGenerator(HGraph* graph, CodeGenerator* codegen)
886 : HGraphVisitor(graph),
887 deopt_slow_paths_(graph, codegen) {}
888
889 protected:
890 // Add slow-path generator for each instruction/slow-path combination that desires sharing.
891 // TODO: under current regime, only deopt sharing make sense; extend later.
892 SlowPathGenerator<HDeoptimize> deopt_slow_paths_;
893};
894
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000895} // namespace art
896
897#endif // ART_COMPILER_OPTIMIZING_CODE_GENERATOR_H_