blob: ac3c8394e614537ba4a6916bf0d4e142086ce349 [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"
Nicolas Geoffray39468442014-09-02 15:17:15 +010035#include "stack_map_stream.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;
Nicolas Geoffrayf0e39372014-11-12 17:50:07 +000064class ParallelMoveResolver;
Nicolas Geoffray92cf83e2014-03-18 17:59:20 +000065
Vladimir Markod8dbc8d2017-09-20 13:37:47 +010066namespace linker {
67class LinkerPatch;
68} // namespace linker
69
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000070class CodeAllocator {
71 public:
Nicolas Geoffraye5038322014-07-04 09:41:32 +010072 CodeAllocator() {}
73 virtual ~CodeAllocator() {}
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000074
75 virtual uint8_t* Allocate(size_t size) = 0;
76
77 private:
78 DISALLOW_COPY_AND_ASSIGN(CodeAllocator);
79};
80
Alexandre Ramesc01a6642016-04-15 11:54:06 +010081class SlowPathCode : public DeletableArenaObject<kArenaAllocSlowPaths> {
Nicolas Geoffraye5038322014-07-04 09:41:32 +010082 public:
David Srbecky9cd6d372016-02-09 15:24:47 +000083 explicit SlowPathCode(HInstruction* instruction) : instruction_(instruction) {
Nicolas Geoffrayeeefa122015-03-13 18:52:59 +000084 for (size_t i = 0; i < kMaximumNumberOfExpectedRegisters; ++i) {
85 saved_core_stack_offsets_[i] = kRegisterNotSaved;
86 saved_fpu_stack_offsets_[i] = kRegisterNotSaved;
87 }
88 }
89
Nicolas Geoffraye5038322014-07-04 09:41:32 +010090 virtual ~SlowPathCode() {}
91
Nicolas Geoffraye5038322014-07-04 09:41:32 +010092 virtual void EmitNativeCode(CodeGenerator* codegen) = 0;
93
Roland Levillain4359e612016-07-20 11:32:19 +010094 // Save live core and floating-point caller-save registers and
95 // update the stack mask in `locations` for registers holding object
96 // references.
Zheng Xuda403092015-04-24 17:35:39 +080097 virtual void SaveLiveRegisters(CodeGenerator* codegen, LocationSummary* locations);
Roland Levillain4359e612016-07-20 11:32:19 +010098 // Restore live core and floating-point caller-save registers.
Zheng Xuda403092015-04-24 17:35:39 +080099 virtual void RestoreLiveRegisters(CodeGenerator* codegen, LocationSummary* locations);
Nicolas Geoffraya8ac9132015-03-13 16:36:36 +0000100
Nicolas Geoffrayeeefa122015-03-13 18:52:59 +0000101 bool IsCoreRegisterSaved(int reg) const {
102 return saved_core_stack_offsets_[reg] != kRegisterNotSaved;
103 }
104
105 bool IsFpuRegisterSaved(int reg) const {
106 return saved_fpu_stack_offsets_[reg] != kRegisterNotSaved;
107 }
108
109 uint32_t GetStackOffsetOfCoreRegister(int reg) const {
110 return saved_core_stack_offsets_[reg];
111 }
112
113 uint32_t GetStackOffsetOfFpuRegister(int reg) const {
114 return saved_fpu_stack_offsets_[reg];
115 }
116
Alexandre Rames8158f282015-08-07 10:26:17 +0100117 virtual bool IsFatal() const { return false; }
118
Alexandre Rames9931f312015-06-19 14:47:01 +0100119 virtual const char* GetDescription() const = 0;
120
Andreas Gampe85b62f22015-09-09 13:15:38 -0700121 Label* GetEntryLabel() { return &entry_label_; }
122 Label* GetExitLabel() { return &exit_label_; }
123
David Srbeckyd28f4a02016-03-14 17:14:24 +0000124 HInstruction* GetInstruction() const {
125 return instruction_;
126 }
127
David Srbecky9cd6d372016-02-09 15:24:47 +0000128 uint32_t GetDexPc() const {
129 return instruction_ != nullptr ? instruction_->GetDexPc() : kNoDexPc;
130 }
131
Zheng Xuda403092015-04-24 17:35:39 +0800132 protected:
Nicolas Geoffrayeeefa122015-03-13 18:52:59 +0000133 static constexpr size_t kMaximumNumberOfExpectedRegisters = 32;
134 static constexpr uint32_t kRegisterNotSaved = -1;
David Srbecky9cd6d372016-02-09 15:24:47 +0000135 // The instruction where this slow path is happening.
136 HInstruction* instruction_;
Nicolas Geoffrayeeefa122015-03-13 18:52:59 +0000137 uint32_t saved_core_stack_offsets_[kMaximumNumberOfExpectedRegisters];
138 uint32_t saved_fpu_stack_offsets_[kMaximumNumberOfExpectedRegisters];
Zheng Xuda403092015-04-24 17:35:39 +0800139
140 private:
Andreas Gampe85b62f22015-09-09 13:15:38 -0700141 Label entry_label_;
142 Label exit_label_;
143
Nicolas Geoffraye5038322014-07-04 09:41:32 +0100144 DISALLOW_COPY_AND_ASSIGN(SlowPathCode);
145};
146
Roland Levillain2d27c8e2015-04-28 15:48:45 +0100147class InvokeDexCallingConventionVisitor {
148 public:
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100149 virtual Location GetNextLocation(DataType::Type type) = 0;
150 virtual Location GetReturnLocation(DataType::Type type) const = 0;
Nicolas Geoffrayfd88f162015-06-03 11:23:52 +0100151 virtual Location GetMethodLocation() const = 0;
Roland Levillain2d27c8e2015-04-28 15:48:45 +0100152
153 protected:
154 InvokeDexCallingConventionVisitor() {}
155 virtual ~InvokeDexCallingConventionVisitor() {}
156
157 // The current index for core registers.
158 uint32_t gp_index_ = 0u;
159 // The current index for floating-point registers.
160 uint32_t float_index_ = 0u;
161 // The current stack index.
162 uint32_t stack_index_ = 0u;
163
164 private:
165 DISALLOW_COPY_AND_ASSIGN(InvokeDexCallingConventionVisitor);
166};
167
Calin Juravlee460d1d2015-09-29 04:52:17 +0100168class FieldAccessCallingConvention {
169 public:
170 virtual Location GetObjectLocation() const = 0;
171 virtual Location GetFieldIndexLocation() const = 0;
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100172 virtual Location GetReturnLocation(DataType::Type type) const = 0;
173 virtual Location GetSetValueLocation(DataType::Type type, bool is_instance) const = 0;
174 virtual Location GetFpuLocation(DataType::Type type) const = 0;
Calin Juravlee460d1d2015-09-29 04:52:17 +0100175 virtual ~FieldAccessCallingConvention() {}
176
177 protected:
178 FieldAccessCallingConvention() {}
179
180 private:
181 DISALLOW_COPY_AND_ASSIGN(FieldAccessCallingConvention);
182};
183
Vladimir Markod58b8372016-04-12 18:51:43 +0100184class CodeGenerator : public DeletableArenaObject<kArenaAllocCodeGenerator> {
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000185 public:
David Brazdil58282f42016-01-14 12:45:10 +0000186 // Compiles the graph to executable instructions.
187 void Compile(CodeAllocator* allocator);
Vladimir Markod58b8372016-04-12 18:51:43 +0100188 static std::unique_ptr<CodeGenerator> Create(HGraph* graph,
189 InstructionSet instruction_set,
190 const InstructionSetFeatures& isa_features,
191 const CompilerOptions& compiler_options,
192 OptimizingCompilerStats* stats = nullptr);
Nicolas Geoffray12df9eb2015-01-09 14:53:50 +0000193 virtual ~CodeGenerator() {}
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000194
Vladimir Markodc151b22015-10-15 18:02:30 +0100195 // Get the graph. This is the outermost graph, never the graph of a method being inlined.
Nicolas Geoffray787c3072014-03-17 10:20:19 +0000196 HGraph* GetGraph() const { return graph_; }
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000197
Nicolas Geoffraydc23d832015-02-16 11:15:43 +0000198 HBasicBlock* GetNextBlockToEmit() const;
199 HBasicBlock* FirstNonEmptyBlock(HBasicBlock* block) const;
Nicolas Geoffraybab4ed72014-03-11 17:53:17 +0000200 bool GoesToNextBlock(HBasicBlock* current, HBasicBlock* next) const;
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000201
Nicolas Geoffray86dbb9a2014-06-04 11:12:39 +0100202 size_t GetStackSlotOfParameter(HParameterValue* parameter) const {
203 // Note that this follows the current calling convention.
204 return GetFrameSize()
Andreas Gampe542451c2016-07-26 09:02:02 -0700205 + static_cast<size_t>(InstructionSetPointerSize(GetInstructionSet())) // Art method
Nicolas Geoffraye27f31a2014-06-12 17:53:14 +0100206 + parameter->GetIndex() * kVRegSize;
Nicolas Geoffray86dbb9a2014-06-04 11:12:39 +0100207 }
208
Nicolas Geoffray92a73ae2014-10-16 11:12:52 +0100209 virtual void Initialize() = 0;
Serban Constantinescu32f5b4d2014-11-25 20:05:46 +0000210 virtual void Finalize(CodeAllocator* allocator);
Vladimir Markod8dbc8d2017-09-20 13:37:47 +0100211 virtual void EmitLinkerPatches(ArenaVector<linker::LinkerPatch>* linker_patches);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000212 virtual void GenerateFrameEntry() = 0;
213 virtual void GenerateFrameExit() = 0;
Nicolas Geoffray92a73ae2014-10-16 11:12:52 +0100214 virtual void Bind(HBasicBlock* block) = 0;
Calin Juravle175dc732015-08-25 15:42:32 +0100215 virtual void MoveConstant(Location destination, int32_t value) = 0;
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100216 virtual void MoveLocation(Location dst, Location src, DataType::Type dst_type) = 0;
Calin Juravlee460d1d2015-09-29 04:52:17 +0100217 virtual void AddLocationAsTemp(Location location, LocationSummary* locations) = 0;
218
Nicolas Geoffray787c3072014-03-17 10:20:19 +0000219 virtual Assembler* GetAssembler() = 0;
Alexandre Rameseb7b7392015-06-19 14:47:01 +0100220 virtual const Assembler& GetAssembler() const = 0;
Nicolas Geoffray707c8092014-04-04 10:50:14 +0100221 virtual size_t GetWordSize() const = 0;
Mark Mendellf85a9ca2015-01-13 09:20:58 -0500222 virtual size_t GetFloatingPointSpillSlotSize() const = 0;
Alexandre Ramesc01a6642016-04-15 11:54:06 +0100223 virtual uintptr_t GetAddressOf(HBasicBlock* block) = 0;
Nicolas Geoffray4c204ba2015-02-03 15:12:35 +0000224 void InitializeCodeGeneration(size_t number_of_spill_slots,
Vladimir Marko70e97462016-08-09 11:04:26 +0100225 size_t maximum_safepoint_spill_size,
Nicolas Geoffray4c204ba2015-02-03 15:12:35 +0000226 size_t number_of_out_slots,
Vladimir Markofa6b93c2015-09-15 10:15:55 +0100227 const ArenaVector<HBasicBlock*>& block_order);
Alexandre Rames68bd9b92016-07-15 17:41:13 +0100228 // Backends can override this as necessary. For most, no special alignment is required.
229 virtual uint32_t GetPreferredSlotsAlignment() const { return 1; }
Nicolas Geoffray787c3072014-03-17 10:20:19 +0000230
231 uint32_t GetFrameSize() const { return frame_size_; }
232 void SetFrameSize(uint32_t size) { frame_size_ = size; }
Nicolas Geoffray8ccc3f52014-03-19 10:34:11 +0000233 uint32_t GetCoreSpillMask() const { return core_spill_mask_; }
Nicolas Geoffrayd97dc402015-01-22 13:50:01 +0000234 uint32_t GetFpuSpillMask() const { return fpu_spill_mask_; }
Nicolas Geoffray787c3072014-03-17 10:20:19 +0000235
Nicolas Geoffray71175b72014-10-09 22:13:55 +0100236 size_t GetNumberOfCoreRegisters() const { return number_of_core_registers_; }
237 size_t GetNumberOfFloatingPointRegisters() const { return number_of_fpu_registers_; }
David Brazdil58282f42016-01-14 12:45:10 +0000238 virtual void SetupBlockedRegisters() const = 0;
Nicolas Geoffray71175b72014-10-09 22:13:55 +0100239
Nicolas Geoffray4dee6362015-01-23 18:23:14 +0000240 virtual void ComputeSpillMask() {
241 core_spill_mask_ = allocated_registers_.GetCoreRegisters() & core_callee_save_mask_;
242 DCHECK_NE(core_spill_mask_, 0u) << "At least the return address register must be saved";
243 fpu_spill_mask_ = allocated_registers_.GetFloatingPointRegisters() & fpu_callee_save_mask_;
244 }
245
246 static uint32_t ComputeRegisterMask(const int* registers, size_t length) {
247 uint32_t mask = 0;
248 for (size_t i = 0, e = length; i < e; ++i) {
249 mask |= (1 << registers[i]);
250 }
251 return mask;
252 }
253
Nicolas Geoffraya7062e02014-05-22 12:50:17 +0100254 virtual void DumpCoreRegister(std::ostream& stream, int reg) const = 0;
255 virtual void DumpFloatingPointRegister(std::ostream& stream, int reg) const = 0;
Nicolas Geoffray412f10c2014-06-19 10:00:34 +0100256 virtual InstructionSet GetInstructionSet() const = 0;
Calin Juravlecd6dffe2015-01-08 17:35:35 +0000257
258 const CompilerOptions& GetCompilerOptions() const { return compiler_options_; }
259
Nicolas Geoffray102cbed2014-10-15 18:31:05 +0100260 // Saves the register in the stack. Returns the size taken on stack.
261 virtual size_t SaveCoreRegister(size_t stack_index, uint32_t reg_id) = 0;
262 // Restores the register from the stack. Returns the size taken on stack.
263 virtual size_t RestoreCoreRegister(size_t stack_index, uint32_t reg_id) = 0;
Nicolas Geoffray234d69d2015-03-09 10:28:50 +0000264
265 virtual size_t SaveFloatingPointRegister(size_t stack_index, uint32_t reg_id) = 0;
266 virtual size_t RestoreFloatingPointRegister(size_t stack_index, uint32_t reg_id) = 0;
267
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100268 virtual bool NeedsTwoRegisters(DataType::Type type) const = 0;
Nicolas Geoffray234d69d2015-03-09 10:28:50 +0000269 // Returns whether we should split long moves in parallel moves.
270 virtual bool ShouldSplitLongMoves() const { return false; }
Nicolas Geoffraya7062e02014-05-22 12:50:17 +0100271
Roland Levillain0d5a2812015-11-13 10:07:31 +0000272 size_t GetNumberOfCoreCalleeSaveRegisters() const {
273 return POPCOUNT(core_callee_save_mask_);
274 }
275
276 size_t GetNumberOfCoreCallerSaveRegisters() const {
277 DCHECK_GE(GetNumberOfCoreRegisters(), GetNumberOfCoreCalleeSaveRegisters());
278 return GetNumberOfCoreRegisters() - GetNumberOfCoreCalleeSaveRegisters();
279 }
280
Nicolas Geoffray98893962015-01-21 12:32:32 +0000281 bool IsCoreCalleeSaveRegister(int reg) const {
282 return (core_callee_save_mask_ & (1 << reg)) != 0;
283 }
284
285 bool IsFloatingPointCalleeSaveRegister(int reg) const {
286 return (fpu_callee_save_mask_ & (1 << reg)) != 0;
287 }
288
Vladimir Marko70e97462016-08-09 11:04:26 +0100289 uint32_t GetSlowPathSpills(LocationSummary* locations, bool core_registers) const {
290 DCHECK(locations->OnlyCallsOnSlowPath() ||
291 (locations->Intrinsified() && locations->CallsOnMainAndSlowPath() &&
292 !locations->HasCustomSlowPathCallingConvention()));
293 uint32_t live_registers = core_registers
294 ? locations->GetLiveRegisters()->GetCoreRegisters()
295 : locations->GetLiveRegisters()->GetFloatingPointRegisters();
296 if (locations->HasCustomSlowPathCallingConvention()) {
297 // Save only the live registers that the custom calling convention wants us to save.
298 uint32_t caller_saves = core_registers
299 ? locations->GetCustomSlowPathCallerSaves().GetCoreRegisters()
300 : locations->GetCustomSlowPathCallerSaves().GetFloatingPointRegisters();
301 return live_registers & caller_saves;
302 } else {
303 // Default ABI, we need to spill non-callee-save live registers.
304 uint32_t callee_saves = core_registers ? core_callee_save_mask_ : fpu_callee_save_mask_;
305 return live_registers & ~callee_saves;
306 }
307 }
308
309 size_t GetNumberOfSlowPathSpills(LocationSummary* locations, bool core_registers) const {
310 return POPCOUNT(GetSlowPathSpills(locations, core_registers));
311 }
312
Mingyao Yang063fc772016-08-02 11:02:54 -0700313 size_t GetStackOffsetOfShouldDeoptimizeFlag() const {
314 DCHECK(GetGraph()->HasShouldDeoptimizeFlag());
315 DCHECK_GE(GetFrameSize(), FrameEntrySpillSize() + kShouldDeoptimizeFlagSize);
316 return GetFrameSize() - FrameEntrySpillSize() - kShouldDeoptimizeFlagSize;
317 }
318
Yevgeny Rouban2a7c1ef2015-07-22 18:36:24 +0600319 // Record native to dex mapping for a suspend point. Required by runtime.
Nicolas Geoffrayeeefa122015-03-13 18:52:59 +0000320 void RecordPcInfo(HInstruction* instruction, uint32_t dex_pc, SlowPathCode* slow_path = nullptr);
David Srbeckyb7070a22016-01-08 18:13:53 +0000321 // Check whether we have already recorded mapping at this PC.
322 bool HasStackMapAtCurrentPc();
David Srbeckyc7098ff2016-02-09 14:30:11 +0000323 // Record extra stack maps if we support native debugging.
David Srbeckyd28f4a02016-03-14 17:14:24 +0000324 void MaybeRecordNativeDebugInfo(HInstruction* instruction,
325 uint32_t dex_pc,
326 SlowPathCode* slow_path = nullptr);
Yevgeny Rouban2a7c1ef2015-07-22 18:36:24 +0600327
Calin Juravle77520bc2015-01-12 18:45:46 +0000328 bool CanMoveNullCheckToUser(HNullCheck* null_check);
329 void MaybeRecordImplicitNullCheck(HInstruction* instruction);
Vladimir Marko804b03f2016-09-14 16:26:36 +0100330 LocationSummary* CreateThrowingSlowPathLocations(
331 HInstruction* instruction, RegisterSet caller_saves = RegisterSet::Empty());
Calin Juravle2ae48182016-03-16 14:05:09 +0000332 void GenerateNullCheck(HNullCheck* null_check);
333 virtual void GenerateImplicitNullCheck(HNullCheck* null_check) = 0;
334 virtual void GenerateExplicitNullCheck(HNullCheck* null_check) = 0;
Nicolas Geoffray8ccc3f52014-03-19 10:34:11 +0000335
David Brazdil77a48ae2015-09-15 12:34:04 +0000336 // Records a stack map which the runtime might use to set catch phi values
337 // during exception delivery.
338 // TODO: Replace with a catch-entering instruction that records the environment.
339 void RecordCatchBlockInfo();
340
Alexandre Ramesc01a6642016-04-15 11:54:06 +0100341 // TODO: Avoid creating the `std::unique_ptr` here.
Nicolas Geoffraye5038322014-07-04 09:41:32 +0100342 void AddSlowPath(SlowPathCode* slow_path) {
Alexandre Ramesc01a6642016-04-15 11:54:06 +0100343 slow_paths_.push_back(std::unique_ptr<SlowPathCode>(slow_path));
Nicolas Geoffraye5038322014-07-04 09:41:32 +0100344 }
345
Mathieu Chartiercbcedbf2017-03-12 22:24:50 -0700346 void BuildStackMaps(MemoryRegion stack_map_region,
347 MemoryRegion method_info_region,
348 const DexFile::CodeItem& code_item);
349 void ComputeStackMapAndMethodInfoSize(size_t* stack_map_size, size_t* method_info_size);
Nicolas Geoffray132d8362016-11-16 09:19:42 +0000350 size_t GetNumberOfJitRoots() const {
Nicolas Geoffray22384ae2016-12-12 22:33:36 +0000351 return jit_string_roots_.size() + jit_class_roots_.size();
Nicolas Geoffray132d8362016-11-16 09:19:42 +0000352 }
353
354 // Fills the `literals` array with literals collected during code generation.
355 // Also emits literal patches.
356 void EmitJitRoots(uint8_t* code,
357 Handle<mirror::ObjectArray<mirror::Object>> roots,
Nicolas Geoffrayf0acfe72017-01-09 20:54:52 +0000358 const uint8_t* roots_data)
Nicolas Geoffray132d8362016-11-16 09:19:42 +0000359 REQUIRES_SHARED(Locks::mutator_lock_);
Nicolas Geoffray787c3072014-03-17 10:20:19 +0000360
Nicolas Geoffrayf12feb82014-07-17 18:32:41 +0100361 bool IsLeafMethod() const {
362 return is_leaf_;
363 }
364
365 void MarkNotLeaf() {
366 is_leaf_ = false;
Nicolas Geoffrayc0572a42015-02-06 14:35:25 +0000367 requires_current_method_ = true;
368 }
369
370 void SetRequiresCurrentMethod() {
371 requires_current_method_ = true;
372 }
373
374 bool RequiresCurrentMethod() const {
375 return requires_current_method_;
Nicolas Geoffrayf12feb82014-07-17 18:32:41 +0100376 }
377
Nicolas Geoffray3c049742014-09-24 18:10:46 +0100378 // Clears the spill slots taken by loop phis in the `LocationSummary` of the
379 // suspend check. This is called when the code generator generates code
380 // for the suspend check at the back edge (instead of where the suspend check
381 // is, which is the loop entry). At this point, the spill slots for the phis
382 // have not been written to.
383 void ClearSpillSlotsFromLoopPhisInStackMap(HSuspendCheck* suspend_check) const;
384
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,
602 OptimizingCompilerStats* stats)
Nicolas Geoffrayc0572a42015-02-06 14:35:25 +0000603 : frame_size_(0),
Nicolas Geoffray4361bef2014-08-20 04:59:12 +0100604 core_spill_mask_(0),
Nicolas Geoffrayd97dc402015-01-22 13:50:01 +0000605 fpu_spill_mask_(0),
Nicolas Geoffray3bca0df2014-09-19 11:01:00 +0100606 first_register_slot_in_slow_path_(0),
Vladimir Marko804b03f2016-09-14 16:26:36 +0100607 allocated_registers_(RegisterSet::Empty()),
Vladimir Marko5233f932015-09-29 19:01:15 +0100608 blocked_core_registers_(graph->GetArena()->AllocArray<bool>(number_of_core_registers,
609 kArenaAllocCodeGenerator)),
610 blocked_fpu_registers_(graph->GetArena()->AllocArray<bool>(number_of_fpu_registers,
611 kArenaAllocCodeGenerator)),
Nicolas Geoffray71175b72014-10-09 22:13:55 +0100612 number_of_core_registers_(number_of_core_registers),
613 number_of_fpu_registers_(number_of_fpu_registers),
614 number_of_register_pairs_(number_of_register_pairs),
Nicolas Geoffray98893962015-01-21 12:32:32 +0000615 core_callee_save_mask_(core_callee_save_mask),
616 fpu_callee_save_mask_(fpu_callee_save_mask),
Mathieu Chartiera2f526f2017-01-19 14:48:48 -0800617 stack_map_stream_(graph->GetArena(), graph->GetInstructionSet()),
Vladimir Markocf93a5c2015-06-16 11:33:24 +0000618 block_order_(nullptr),
Nicolas Geoffray132d8362016-11-16 09:19:42 +0000619 jit_string_roots_(StringReferenceValueComparator(),
620 graph->GetArena()->Adapter(kArenaAllocCodeGenerator)),
Nicolas Geoffray22384ae2016-12-12 22:33:36 +0000621 jit_class_roots_(TypeReferenceValueComparator(),
622 graph->GetArena()->Adapter(kArenaAllocCodeGenerator)),
Alexandre Rameseb7b7392015-06-19 14:47:01 +0100623 disasm_info_(nullptr),
Serban Constantinescuecc43662015-08-13 13:33:12 +0100624 stats_(stats),
Nicolas Geoffray787c3072014-03-17 10:20:19 +0000625 graph_(graph),
Calin Juravlecd6dffe2015-01-08 17:35:35 +0000626 compiler_options_(compiler_options),
Vladimir Marko225b6462015-09-28 12:17:40 +0100627 slow_paths_(graph->GetArena()->Adapter(kArenaAllocCodeGenerator)),
Vladimir Marko0f7dca42015-11-02 14:36:43 +0000628 current_slow_path_(nullptr),
Nicolas Geoffray4c204ba2015-02-03 15:12:35 +0000629 current_block_index_(0),
Nicolas Geoffray39468442014-09-02 15:17:15 +0100630 is_leaf_(true),
Vladimir Marko225b6462015-09-28 12:17:40 +0100631 requires_current_method_(false) {
632 slow_paths_.reserve(8);
633 }
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000634
Nicolas Geoffrayc0572a42015-02-06 14:35:25 +0000635 virtual HGraphVisitor* GetLocationBuilder() = 0;
636 virtual HGraphVisitor* GetInstructionVisitor() = 0;
Nicolas Geoffrayf0e39372014-11-12 17:50:07 +0000637
Nicolas Geoffrayd97dc402015-01-22 13:50:01 +0000638 // Returns the location of the first spilled entry for floating point registers,
639 // relative to the stack pointer.
640 uint32_t GetFpuSpillStart() const {
Nicolas Geoffrayd97dc402015-01-22 13:50:01 +0000641 return GetFrameSize() - FrameEntrySpillSize();
642 }
643
644 uint32_t GetFpuSpillSize() const {
645 return POPCOUNT(fpu_spill_mask_) * GetFloatingPointSpillSlotSize();
646 }
647
648 uint32_t GetCoreSpillSize() const {
649 return POPCOUNT(core_spill_mask_) * GetWordSize();
650 }
651
Alexey Frunze58320ce2016-08-30 21:40:46 -0700652 virtual bool HasAllocatedCalleeSaveRegisters() const {
Nicolas Geoffrayc0572a42015-02-06 14:35:25 +0000653 // We check the core registers against 1 because it always comprises the return PC.
654 return (POPCOUNT(allocated_registers_.GetCoreRegisters() & core_callee_save_mask_) != 1)
655 || (POPCOUNT(allocated_registers_.GetFloatingPointRegisters() & fpu_callee_save_mask_) != 0);
656 }
657
658 bool CallPushesPC() const {
659 InstructionSet instruction_set = GetInstructionSet();
660 return instruction_set == kX86 || instruction_set == kX86_64;
661 }
662
Vladimir Marko225b6462015-09-28 12:17:40 +0100663 // Arm64 has its own type for a label, so we need to templatize these methods
Nicolas Geoffraydc23d832015-02-16 11:15:43 +0000664 // to share the logic.
Vladimir Marko225b6462015-09-28 12:17:40 +0100665
666 template <typename LabelType>
667 LabelType* CommonInitializeLabels() {
Vladimir Markob95fb772015-09-30 13:32:31 +0100668 // We use raw array allocations instead of ArenaVector<> because Labels are
669 // non-constructible and non-movable and as such cannot be held in a vector.
Vladimir Marko225b6462015-09-28 12:17:40 +0100670 size_t size = GetGraph()->GetBlocks().size();
671 LabelType* labels = GetGraph()->GetArena()->AllocArray<LabelType>(size,
672 kArenaAllocCodeGenerator);
673 for (size_t i = 0; i != size; ++i) {
674 new(labels + i) LabelType();
675 }
676 return labels;
677 }
678
Vladimir Marko58155012015-08-19 12:49:41 +0000679 template <typename LabelType>
680 LabelType* CommonGetLabelOf(LabelType* raw_pointer_to_labels_array, HBasicBlock* block) const {
Nicolas Geoffraydc23d832015-02-16 11:15:43 +0000681 block = FirstNonEmptyBlock(block);
682 return raw_pointer_to_labels_array + block->GetBlockId();
683 }
684
Vladimir Marko0f7dca42015-11-02 14:36:43 +0000685 SlowPathCode* GetCurrentSlowPath() {
686 return current_slow_path_;
687 }
688
Nicolas Geoffray132d8362016-11-16 09:19:42 +0000689 // Emit the patches assocatied with JIT roots. Only applies to JIT compiled code.
690 virtual void EmitJitRootPatches(uint8_t* code ATTRIBUTE_UNUSED,
691 const uint8_t* roots_data ATTRIBUTE_UNUSED) {
692 DCHECK_EQ(jit_string_roots_.size(), 0u);
Nicolas Geoffray22384ae2016-12-12 22:33:36 +0000693 DCHECK_EQ(jit_class_roots_.size(), 0u);
Nicolas Geoffray132d8362016-11-16 09:19:42 +0000694 }
695
Nicolas Geoffray8ccc3f52014-03-19 10:34:11 +0000696 // Frame size required for this method.
697 uint32_t frame_size_;
698 uint32_t core_spill_mask_;
Nicolas Geoffrayd97dc402015-01-22 13:50:01 +0000699 uint32_t fpu_spill_mask_;
Nicolas Geoffray3bca0df2014-09-19 11:01:00 +0100700 uint32_t first_register_slot_in_slow_path_;
Nicolas Geoffray8ccc3f52014-03-19 10:34:11 +0000701
Nicolas Geoffray98893962015-01-21 12:32:32 +0000702 // Registers that were allocated during linear scan.
703 RegisterSet allocated_registers_;
704
Nicolas Geoffray71175b72014-10-09 22:13:55 +0100705 // Arrays used when doing register allocation to know which
706 // registers we can allocate. `SetupBlockedRegisters` updates the
707 // arrays.
708 bool* const blocked_core_registers_;
709 bool* const blocked_fpu_registers_;
Nicolas Geoffray71175b72014-10-09 22:13:55 +0100710 size_t number_of_core_registers_;
711 size_t number_of_fpu_registers_;
712 size_t number_of_register_pairs_;
Nicolas Geoffray98893962015-01-21 12:32:32 +0000713 const uint32_t core_callee_save_mask_;
714 const uint32_t fpu_callee_save_mask_;
Nicolas Geoffray71175b72014-10-09 22:13:55 +0100715
Vladimir Markocf93a5c2015-06-16 11:33:24 +0000716 StackMapStream stack_map_stream_;
717
718 // The order to use for code generation.
Vladimir Markofa6b93c2015-09-15 10:15:55 +0100719 const ArenaVector<HBasicBlock*>* block_order_;
Vladimir Markocf93a5c2015-06-16 11:33:24 +0000720
Nicolas Geoffray132d8362016-11-16 09:19:42 +0000721 // Maps a StringReference (dex_file, string_index) to the index in the literal table.
Nicolas Geoffrayf0acfe72017-01-09 20:54:52 +0000722 // Entries are intially added with a pointer in the handle zone, and `EmitJitRoots`
723 // will compute all the indices.
724 ArenaSafeMap<StringReference, uint64_t, StringReferenceValueComparator> jit_string_roots_;
Nicolas Geoffray22384ae2016-12-12 22:33:36 +0000725
726 // Maps a ClassReference (dex_file, type_index) to the index in the literal table.
727 // Entries are intially added with a pointer in the handle zone, and `EmitJitRoots`
728 // will compute all the indices.
729 ArenaSafeMap<TypeReference, uint64_t, TypeReferenceValueComparator> jit_class_roots_;
Nicolas Geoffray132d8362016-11-16 09:19:42 +0000730
Alexandre Rameseb7b7392015-06-19 14:47:01 +0100731 DisassemblyInformation* disasm_info_;
732
Nicolas Geoffraybab4ed72014-03-11 17:53:17 +0000733 private:
Nicolas Geoffray3bca0df2014-09-19 11:01:00 +0100734 size_t GetStackOffsetOfSavedRegister(size_t index);
Alexandre Rameseb7b7392015-06-19 14:47:01 +0100735 void GenerateSlowPaths();
Mark Mendell5f874182015-03-04 15:42:45 -0500736 void BlockIfInRegister(Location location, bool is_out = false) const;
Nicolas Geoffrayb1d0f3f2015-05-14 12:41:51 +0100737 void EmitEnvironment(HEnvironment* environment, SlowPathCode* slow_path);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000738
Serban Constantinescuecc43662015-08-13 13:33:12 +0100739 OptimizingCompilerStats* stats_;
740
Nicolas Geoffray787c3072014-03-17 10:20:19 +0000741 HGraph* const graph_;
Calin Juravlecd6dffe2015-01-08 17:35:35 +0000742 const CompilerOptions& compiler_options_;
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000743
Alexandre Ramesc01a6642016-04-15 11:54:06 +0100744 ArenaVector<std::unique_ptr<SlowPathCode>> slow_paths_;
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000745
Aart Bik42249c32016-01-07 15:33:50 -0800746 // The current slow-path that we're generating code for.
Vladimir Marko0f7dca42015-11-02 14:36:43 +0000747 SlowPathCode* current_slow_path_;
748
Nicolas Geoffray4c204ba2015-02-03 15:12:35 +0000749 // The current block index in `block_order_` of the block
750 // we are generating code for.
751 size_t current_block_index_;
752
Nicolas Geoffrayc0572a42015-02-06 14:35:25 +0000753 // Whether the method is a leaf method.
Nicolas Geoffrayf12feb82014-07-17 18:32:41 +0100754 bool is_leaf_;
755
Nicolas Geoffrayc0572a42015-02-06 14:35:25 +0000756 // Whether an instruction in the graph accesses the current method.
Vladimir Marko3b7537b2016-09-13 11:56:01 +0000757 // TODO: Rename: this actually indicates that some instruction in the method
758 // needs the environment including a valid stack frame.
Nicolas Geoffrayc0572a42015-02-06 14:35:25 +0000759 bool requires_current_method_;
760
David Srbeckyc6b4dd82015-04-07 20:32:43 +0100761 friend class OptimizingCFITest;
762
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000763 DISALLOW_COPY_AND_ASSIGN(CodeGenerator);
764};
765
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +0100766template <typename C, typename F>
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100767class CallingConvention {
768 public:
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +0100769 CallingConvention(const C* registers,
770 size_t number_of_registers,
771 const F* fpu_registers,
Mathieu Chartiere401d142015-04-22 13:56:20 -0700772 size_t number_of_fpu_registers,
Andreas Gampe542451c2016-07-26 09:02:02 -0700773 PointerSize pointer_size)
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +0100774 : registers_(registers),
775 number_of_registers_(number_of_registers),
776 fpu_registers_(fpu_registers),
Mathieu Chartiere401d142015-04-22 13:56:20 -0700777 number_of_fpu_registers_(number_of_fpu_registers),
778 pointer_size_(pointer_size) {}
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100779
780 size_t GetNumberOfRegisters() const { return number_of_registers_; }
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +0100781 size_t GetNumberOfFpuRegisters() const { return number_of_fpu_registers_; }
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100782
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +0100783 C GetRegisterAt(size_t index) const {
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100784 DCHECK_LT(index, number_of_registers_);
785 return registers_[index];
786 }
787
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +0100788 F GetFpuRegisterAt(size_t index) const {
789 DCHECK_LT(index, number_of_fpu_registers_);
790 return fpu_registers_[index];
791 }
792
793 size_t GetStackOffsetOf(size_t index) const {
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100794 // We still reserve the space for parameters passed by registers.
Mathieu Chartiere401d142015-04-22 13:56:20 -0700795 // Add space for the method pointer.
Andreas Gampe542451c2016-07-26 09:02:02 -0700796 return static_cast<size_t>(pointer_size_) + index * kVRegSize;
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100797 }
798
799 private:
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +0100800 const C* registers_;
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100801 const size_t number_of_registers_;
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +0100802 const F* fpu_registers_;
803 const size_t number_of_fpu_registers_;
Andreas Gampe542451c2016-07-26 09:02:02 -0700804 const PointerSize pointer_size_;
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100805
806 DISALLOW_COPY_AND_ASSIGN(CallingConvention);
807};
808
Aart Bik42249c32016-01-07 15:33:50 -0800809/**
810 * A templated class SlowPathGenerator with a templated method NewSlowPath()
811 * that can be used by any code generator to share equivalent slow-paths with
812 * the objective of reducing generated code size.
813 *
814 * InstructionType: instruction that requires SlowPathCodeType
815 * SlowPathCodeType: subclass of SlowPathCode, with constructor SlowPathCodeType(InstructionType *)
816 */
817template <typename InstructionType>
818class SlowPathGenerator {
819 static_assert(std::is_base_of<HInstruction, InstructionType>::value,
820 "InstructionType is not a subclass of art::HInstruction");
821
822 public:
823 SlowPathGenerator(HGraph* graph, CodeGenerator* codegen)
824 : graph_(graph),
825 codegen_(codegen),
826 slow_path_map_(std::less<uint32_t>(), graph->GetArena()->Adapter(kArenaAllocSlowPaths)) {}
827
828 // Creates and adds a new slow-path, if needed, or returns existing one otherwise.
829 // Templating the method (rather than the whole class) on the slow-path type enables
830 // keeping this code at a generic, non architecture-specific place.
831 //
832 // NOTE: This approach assumes each InstructionType only generates one SlowPathCodeType.
833 // To relax this requirement, we would need some RTTI on the stored slow-paths,
834 // or template the class as a whole on SlowPathType.
835 template <typename SlowPathCodeType>
836 SlowPathCodeType* NewSlowPath(InstructionType* instruction) {
837 static_assert(std::is_base_of<SlowPathCode, SlowPathCodeType>::value,
838 "SlowPathCodeType is not a subclass of art::SlowPathCode");
839 static_assert(std::is_constructible<SlowPathCodeType, InstructionType*>::value,
840 "SlowPathCodeType is not constructible from InstructionType*");
841 // Iterate over potential candidates for sharing. Currently, only same-typed
842 // slow-paths with exactly the same dex-pc are viable candidates.
843 // TODO: pass dex-pc/slow-path-type to run-time to allow even more sharing?
844 const uint32_t dex_pc = instruction->GetDexPc();
845 auto iter = slow_path_map_.find(dex_pc);
846 if (iter != slow_path_map_.end()) {
Vladimir Marko7d157fc2017-05-10 16:29:23 +0100847 const ArenaVector<std::pair<InstructionType*, SlowPathCode*>>& candidates = iter->second;
Aart Bik42249c32016-01-07 15:33:50 -0800848 for (const auto& it : candidates) {
849 InstructionType* other_instruction = it.first;
850 SlowPathCodeType* other_slow_path = down_cast<SlowPathCodeType*>(it.second);
851 // Determine if the instructions allow for slow-path sharing.
852 if (HaveSameLiveRegisters(instruction, other_instruction) &&
853 HaveSameStackMap(instruction, other_instruction)) {
854 // Can share: reuse existing one.
855 return other_slow_path;
856 }
857 }
858 } else {
859 // First time this dex-pc is seen.
860 iter = slow_path_map_.Put(dex_pc, {{}, {graph_->GetArena()->Adapter(kArenaAllocSlowPaths)}});
861 }
862 // Cannot share: create and add new slow-path for this particular dex-pc.
863 SlowPathCodeType* slow_path = new (graph_->GetArena()) SlowPathCodeType(instruction);
864 iter->second.emplace_back(std::make_pair(instruction, slow_path));
865 codegen_->AddSlowPath(slow_path);
866 return slow_path;
867 }
868
869 private:
870 // Tests if both instructions have same set of live physical registers. This ensures
871 // the slow-path has exactly the same preamble on saving these registers to stack.
872 bool HaveSameLiveRegisters(const InstructionType* i1, const InstructionType* i2) const {
873 const uint32_t core_spill = ~codegen_->GetCoreSpillMask();
874 const uint32_t fpu_spill = ~codegen_->GetFpuSpillMask();
875 RegisterSet* live1 = i1->GetLocations()->GetLiveRegisters();
876 RegisterSet* live2 = i2->GetLocations()->GetLiveRegisters();
877 return (((live1->GetCoreRegisters() & core_spill) ==
878 (live2->GetCoreRegisters() & core_spill)) &&
879 ((live1->GetFloatingPointRegisters() & fpu_spill) ==
880 (live2->GetFloatingPointRegisters() & fpu_spill)));
881 }
882
883 // Tests if both instructions have the same stack map. This ensures the interpreter
884 // will find exactly the same dex-registers at the same entries.
885 bool HaveSameStackMap(const InstructionType* i1, const InstructionType* i2) const {
886 DCHECK(i1->HasEnvironment());
887 DCHECK(i2->HasEnvironment());
888 // We conservatively test if the two instructions find exactly the same instructions
889 // and location in each dex-register. This guarantees they will have the same stack map.
890 HEnvironment* e1 = i1->GetEnvironment();
891 HEnvironment* e2 = i2->GetEnvironment();
892 if (e1->GetParent() != e2->GetParent() || e1->Size() != e2->Size()) {
893 return false;
894 }
895 for (size_t i = 0, sz = e1->Size(); i < sz; ++i) {
896 if (e1->GetInstructionAt(i) != e2->GetInstructionAt(i) ||
897 !e1->GetLocationAt(i).Equals(e2->GetLocationAt(i))) {
898 return false;
899 }
900 }
901 return true;
902 }
903
904 HGraph* const graph_;
905 CodeGenerator* const codegen_;
906
907 // Map from dex-pc to vector of already existing instruction/slow-path pairs.
908 ArenaSafeMap<uint32_t, ArenaVector<std::pair<InstructionType*, SlowPathCode*>>> slow_path_map_;
909
910 DISALLOW_COPY_AND_ASSIGN(SlowPathGenerator);
911};
912
913class InstructionCodeGenerator : public HGraphVisitor {
914 public:
915 InstructionCodeGenerator(HGraph* graph, CodeGenerator* codegen)
916 : HGraphVisitor(graph),
917 deopt_slow_paths_(graph, codegen) {}
918
919 protected:
920 // Add slow-path generator for each instruction/slow-path combination that desires sharing.
921 // TODO: under current regime, only deopt sharing make sense; extend later.
922 SlowPathGenerator<HDeoptimize> deopt_slow_paths_;
923};
924
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000925} // namespace art
926
927#endif // ART_COMPILER_OPTIMIZING_CODE_GENERATOR_H_