blob: ac714abd59a090c4cbefc3a4abe01a82b8cd30f6 [file] [log] [blame]
David Brazdildee58d62016-04-07 09:54:26 +00001/*
2 * Copyright (C) 2016 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#include "instruction_builder.h"
18
Matthew Gharrity465ecc82016-07-19 21:32:52 +000019#include "art_method-inl.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010020#include "base/arena_bit_vector.h"
21#include "base/bit_vector-inl.h"
Andreas Gampe85f1c572018-11-21 13:52:48 -080022#include "base/logging.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010023#include "block_builder.h"
Vladimir Marko3b506202018-10-31 14:33:58 +000024#include "class_linker-inl.h"
25#include "code_generator.h"
Vladimir Marko0ebe0d82017-09-21 22:50:39 +010026#include "data_type-inl.h"
David Sehr312f3b22018-03-19 08:39:26 -070027#include "dex/bytecode_utils.h"
David Sehr9e734c72018-01-04 17:56:19 -080028#include "dex/dex_instruction-inl.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010029#include "driver/dex_compilation_unit.h"
David Brazdildee58d62016-04-07 09:54:26 +000030#include "driver/compiler_options.h"
Andreas Gampe75a7db62016-09-26 12:04:26 -070031#include "imtable-inl.h"
Nicolas Geoffraya48c3df2019-06-27 13:11:12 +000032#include "jit/jit.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010033#include "mirror/dex_cache.h"
Nicolas Geoffray58cc1cb2017-11-20 13:27:29 +000034#include "oat_file.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010035#include "optimizing_compiler_stats.h"
Mathieu Chartierde4b08f2017-07-10 14:13:41 -070036#include "quicken_info.h"
Nicolas Geoffray396198b2020-06-16 12:02:45 +010037#include "reflective_handle_scope-inl.h"
Mathieu Chartier0795f232016-09-27 18:43:30 -070038#include "scoped_thread_state_change-inl.h"
Andreas Gampe8cf9cb32017-07-19 09:28:38 -070039#include "sharpening.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010040#include "ssa_builder.h"
Andreas Gampea7c83ac2017-09-11 08:14:23 -070041#include "well_known_classes.h"
David Brazdildee58d62016-04-07 09:54:26 +000042
Vladimir Marko0a516052019-10-14 13:00:44 +000043namespace art {
David Brazdildee58d62016-04-07 09:54:26 +000044
Mathieu Chartier808c7a52017-12-15 11:19:33 -080045HInstructionBuilder::HInstructionBuilder(HGraph* graph,
46 HBasicBlockBuilder* block_builder,
47 SsaBuilder* ssa_builder,
48 const DexFile* dex_file,
49 const CodeItemDebugInfoAccessor& accessor,
50 DataType::Type return_type,
51 const DexCompilationUnit* dex_compilation_unit,
52 const DexCompilationUnit* outer_compilation_unit,
Mathieu Chartier808c7a52017-12-15 11:19:33 -080053 CodeGenerator* code_generator,
Mathieu Chartier210531f2018-01-12 10:15:51 -080054 ArrayRef<const uint8_t> interpreter_metadata,
Mathieu Chartier808c7a52017-12-15 11:19:33 -080055 OptimizingCompilerStats* compiler_stats,
Mathieu Chartier808c7a52017-12-15 11:19:33 -080056 ScopedArenaAllocator* local_allocator)
57 : allocator_(graph->GetAllocator()),
58 graph_(graph),
Mathieu Chartier808c7a52017-12-15 11:19:33 -080059 dex_file_(dex_file),
60 code_item_accessor_(accessor),
61 return_type_(return_type),
62 block_builder_(block_builder),
63 ssa_builder_(ssa_builder),
Mathieu Chartier808c7a52017-12-15 11:19:33 -080064 code_generator_(code_generator),
65 dex_compilation_unit_(dex_compilation_unit),
66 outer_compilation_unit_(outer_compilation_unit),
67 quicken_info_(interpreter_metadata),
68 compilation_stats_(compiler_stats),
69 local_allocator_(local_allocator),
70 locals_for_(local_allocator->Adapter(kArenaAllocGraphBuilder)),
71 current_block_(nullptr),
72 current_locals_(nullptr),
73 latest_result_(nullptr),
74 current_this_parameter_(nullptr),
Vladimir Marko3b506202018-10-31 14:33:58 +000075 loop_headers_(local_allocator->Adapter(kArenaAllocGraphBuilder)),
76 class_cache_(std::less<dex::TypeIndex>(), local_allocator->Adapter(kArenaAllocGraphBuilder)) {
Mathieu Chartier808c7a52017-12-15 11:19:33 -080077 loop_headers_.reserve(kDefaultNumberOfLoops);
78}
79
David Brazdildee58d62016-04-07 09:54:26 +000080HBasicBlock* HInstructionBuilder::FindBlockStartingAt(uint32_t dex_pc) const {
81 return block_builder_->GetBlockAt(dex_pc);
82}
83
Vladimir Marko69d310e2017-10-09 14:12:23 +010084inline ScopedArenaVector<HInstruction*>* HInstructionBuilder::GetLocalsFor(HBasicBlock* block) {
85 ScopedArenaVector<HInstruction*>* locals = &locals_for_[block->GetBlockId()];
David Brazdildee58d62016-04-07 09:54:26 +000086 const size_t vregs = graph_->GetNumberOfVRegs();
Mingyao Yang01b47b02017-02-03 12:09:57 -080087 if (locals->size() == vregs) {
88 return locals;
89 }
90 return GetLocalsForWithAllocation(block, locals, vregs);
91}
David Brazdildee58d62016-04-07 09:54:26 +000092
Vladimir Marko69d310e2017-10-09 14:12:23 +010093ScopedArenaVector<HInstruction*>* HInstructionBuilder::GetLocalsForWithAllocation(
Mingyao Yang01b47b02017-02-03 12:09:57 -080094 HBasicBlock* block,
Vladimir Marko69d310e2017-10-09 14:12:23 +010095 ScopedArenaVector<HInstruction*>* locals,
Mingyao Yang01b47b02017-02-03 12:09:57 -080096 const size_t vregs) {
97 DCHECK_NE(locals->size(), vregs);
98 locals->resize(vregs, nullptr);
99 if (block->IsCatchBlock()) {
100 // We record incoming inputs of catch phis at throwing instructions and
101 // must therefore eagerly create the phis. Phis for undefined vregs will
102 // be deleted when the first throwing instruction with the vreg undefined
103 // is encountered. Unused phis will be removed by dead phi analysis.
104 for (size_t i = 0; i < vregs; ++i) {
105 // No point in creating the catch phi if it is already undefined at
106 // the first throwing instruction.
107 HInstruction* current_local_value = (*current_locals_)[i];
108 if (current_local_value != nullptr) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100109 HPhi* phi = new (allocator_) HPhi(
110 allocator_,
Mingyao Yang01b47b02017-02-03 12:09:57 -0800111 i,
112 0,
113 current_local_value->GetType());
114 block->AddPhi(phi);
115 (*locals)[i] = phi;
David Brazdildee58d62016-04-07 09:54:26 +0000116 }
117 }
118 }
119 return locals;
120}
121
Mingyao Yang01b47b02017-02-03 12:09:57 -0800122inline HInstruction* HInstructionBuilder::ValueOfLocalAt(HBasicBlock* block, size_t local) {
Vladimir Marko69d310e2017-10-09 14:12:23 +0100123 ScopedArenaVector<HInstruction*>* locals = GetLocalsFor(block);
David Brazdildee58d62016-04-07 09:54:26 +0000124 return (*locals)[local];
125}
126
127void HInstructionBuilder::InitializeBlockLocals() {
128 current_locals_ = GetLocalsFor(current_block_);
129
130 if (current_block_->IsCatchBlock()) {
131 // Catch phis were already created and inputs collected from throwing sites.
132 if (kIsDebugBuild) {
133 // Make sure there was at least one throwing instruction which initialized
134 // locals (guaranteed by HGraphBuilder) and that all try blocks have been
135 // visited already (from HTryBoundary scoping and reverse post order).
136 bool catch_block_visited = false;
Vladimir Marko2c45bc92016-10-25 16:54:12 +0100137 for (HBasicBlock* current : graph_->GetReversePostOrder()) {
David Brazdildee58d62016-04-07 09:54:26 +0000138 if (current == current_block_) {
139 catch_block_visited = true;
140 } else if (current->IsTryBlock()) {
141 const HTryBoundary& try_entry = current->GetTryCatchInformation()->GetTryEntry();
142 if (try_entry.HasExceptionHandler(*current_block_)) {
143 DCHECK(!catch_block_visited) << "Catch block visited before its try block.";
144 }
145 }
146 }
147 DCHECK_EQ(current_locals_->size(), graph_->GetNumberOfVRegs())
148 << "No instructions throwing into a live catch block.";
149 }
150 } else if (current_block_->IsLoopHeader()) {
151 // If the block is a loop header, we know we only have visited the pre header
152 // because we are visiting in reverse post order. We create phis for all initialized
153 // locals from the pre header. Their inputs will be populated at the end of
154 // the analysis.
155 for (size_t local = 0; local < current_locals_->size(); ++local) {
156 HInstruction* incoming =
157 ValueOfLocalAt(current_block_->GetLoopInformation()->GetPreHeader(), local);
158 if (incoming != nullptr) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100159 HPhi* phi = new (allocator_) HPhi(
160 allocator_,
David Brazdildee58d62016-04-07 09:54:26 +0000161 local,
162 0,
163 incoming->GetType());
164 current_block_->AddPhi(phi);
165 (*current_locals_)[local] = phi;
166 }
167 }
168
169 // Save the loop header so that the last phase of the analysis knows which
170 // blocks need to be updated.
171 loop_headers_.push_back(current_block_);
172 } else if (current_block_->GetPredecessors().size() > 0) {
173 // All predecessors have already been visited because we are visiting in reverse post order.
174 // We merge the values of all locals, creating phis if those values differ.
175 for (size_t local = 0; local < current_locals_->size(); ++local) {
176 bool one_predecessor_has_no_value = false;
177 bool is_different = false;
178 HInstruction* value = ValueOfLocalAt(current_block_->GetPredecessors()[0], local);
179
180 for (HBasicBlock* predecessor : current_block_->GetPredecessors()) {
181 HInstruction* current = ValueOfLocalAt(predecessor, local);
182 if (current == nullptr) {
183 one_predecessor_has_no_value = true;
184 break;
185 } else if (current != value) {
186 is_different = true;
187 }
188 }
189
190 if (one_predecessor_has_no_value) {
191 // If one predecessor has no value for this local, we trust the verifier has
192 // successfully checked that there is a store dominating any read after this block.
193 continue;
194 }
195
196 if (is_different) {
197 HInstruction* first_input = ValueOfLocalAt(current_block_->GetPredecessors()[0], local);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100198 HPhi* phi = new (allocator_) HPhi(
199 allocator_,
David Brazdildee58d62016-04-07 09:54:26 +0000200 local,
201 current_block_->GetPredecessors().size(),
202 first_input->GetType());
203 for (size_t i = 0; i < current_block_->GetPredecessors().size(); i++) {
204 HInstruction* pred_value = ValueOfLocalAt(current_block_->GetPredecessors()[i], local);
205 phi->SetRawInputAt(i, pred_value);
206 }
207 current_block_->AddPhi(phi);
208 value = phi;
209 }
210 (*current_locals_)[local] = value;
211 }
212 }
213}
214
215void HInstructionBuilder::PropagateLocalsToCatchBlocks() {
216 const HTryBoundary& try_entry = current_block_->GetTryCatchInformation()->GetTryEntry();
217 for (HBasicBlock* catch_block : try_entry.GetExceptionHandlers()) {
Vladimir Marko69d310e2017-10-09 14:12:23 +0100218 ScopedArenaVector<HInstruction*>* handler_locals = GetLocalsFor(catch_block);
David Brazdildee58d62016-04-07 09:54:26 +0000219 DCHECK_EQ(handler_locals->size(), current_locals_->size());
220 for (size_t vreg = 0, e = current_locals_->size(); vreg < e; ++vreg) {
221 HInstruction* handler_value = (*handler_locals)[vreg];
222 if (handler_value == nullptr) {
223 // Vreg was undefined at a previously encountered throwing instruction
224 // and the catch phi was deleted. Do not record the local value.
225 continue;
226 }
227 DCHECK(handler_value->IsPhi());
228
229 HInstruction* local_value = (*current_locals_)[vreg];
230 if (local_value == nullptr) {
231 // This is the first instruction throwing into `catch_block` where
232 // `vreg` is undefined. Delete the catch phi.
233 catch_block->RemovePhi(handler_value->AsPhi());
234 (*handler_locals)[vreg] = nullptr;
235 } else {
236 // Vreg has been defined at all instructions throwing into `catch_block`
237 // encountered so far. Record the local value in the catch phi.
238 handler_value->AsPhi()->AddInput(local_value);
239 }
240 }
241 }
242}
243
244void HInstructionBuilder::AppendInstruction(HInstruction* instruction) {
245 current_block_->AddInstruction(instruction);
246 InitializeInstruction(instruction);
247}
248
249void HInstructionBuilder::InsertInstructionAtTop(HInstruction* instruction) {
250 if (current_block_->GetInstructions().IsEmpty()) {
251 current_block_->AddInstruction(instruction);
252 } else {
253 current_block_->InsertInstructionBefore(instruction, current_block_->GetFirstInstruction());
254 }
255 InitializeInstruction(instruction);
256}
257
258void HInstructionBuilder::InitializeInstruction(HInstruction* instruction) {
259 if (instruction->NeedsEnvironment()) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100260 HEnvironment* environment = new (allocator_) HEnvironment(
261 allocator_,
David Brazdildee58d62016-04-07 09:54:26 +0000262 current_locals_->size(),
Nicolas Geoffray5d37c152017-01-12 13:25:19 +0000263 graph_->GetArtMethod(),
David Brazdildee58d62016-04-07 09:54:26 +0000264 instruction->GetDexPc(),
David Brazdildee58d62016-04-07 09:54:26 +0000265 instruction);
Vladimir Marko69d310e2017-10-09 14:12:23 +0100266 environment->CopyFrom(ArrayRef<HInstruction* const>(*current_locals_));
David Brazdildee58d62016-04-07 09:54:26 +0000267 instruction->SetRawEnvironment(environment);
268 }
269}
270
David Brazdilc120bbe2016-04-22 16:57:00 +0100271HInstruction* HInstructionBuilder::LoadNullCheckedLocal(uint32_t register_index, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100272 HInstruction* ref = LoadLocal(register_index, DataType::Type::kReference);
David Brazdilc120bbe2016-04-22 16:57:00 +0100273 if (!ref->CanBeNull()) {
274 return ref;
275 }
276
Vladimir Markoca6fff82017-10-03 14:49:14 +0100277 HNullCheck* null_check = new (allocator_) HNullCheck(ref, dex_pc);
David Brazdilc120bbe2016-04-22 16:57:00 +0100278 AppendInstruction(null_check);
279 return null_check;
280}
281
David Brazdildee58d62016-04-07 09:54:26 +0000282void HInstructionBuilder::SetLoopHeaderPhiInputs() {
283 for (size_t i = loop_headers_.size(); i > 0; --i) {
284 HBasicBlock* block = loop_headers_[i - 1];
285 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) {
286 HPhi* phi = it.Current()->AsPhi();
287 size_t vreg = phi->GetRegNumber();
288 for (HBasicBlock* predecessor : block->GetPredecessors()) {
289 HInstruction* value = ValueOfLocalAt(predecessor, vreg);
290 if (value == nullptr) {
291 // Vreg is undefined at this predecessor. Mark it dead and leave with
292 // fewer inputs than predecessors. SsaChecker will fail if not removed.
293 phi->SetDead();
294 break;
295 } else {
296 phi->AddInput(value);
297 }
298 }
299 }
300 }
301}
302
303static bool IsBlockPopulated(HBasicBlock* block) {
304 if (block->IsLoopHeader()) {
305 // Suspend checks were inserted into loop headers during building of dominator tree.
306 DCHECK(block->GetFirstInstruction()->IsSuspendCheck());
307 return block->GetFirstInstruction() != block->GetLastInstruction();
308 } else {
309 return !block->GetInstructions().IsEmpty();
310 }
311}
312
313bool HInstructionBuilder::Build() {
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800314 DCHECK(code_item_accessor_.HasCodeItem());
Vladimir Marko69d310e2017-10-09 14:12:23 +0100315 locals_for_.resize(
316 graph_->GetBlocks().size(),
317 ScopedArenaVector<HInstruction*>(local_allocator_->Adapter(kArenaAllocGraphBuilder)));
David Brazdildee58d62016-04-07 09:54:26 +0000318
319 // Find locations where we want to generate extra stackmaps for native debugging.
320 // This allows us to generate the info only at interesting points (for example,
321 // at start of java statement) rather than before every dex instruction.
Vladimir Marko3b506202018-10-31 14:33:58 +0000322 const bool native_debuggable = code_generator_ != nullptr &&
323 code_generator_->GetCompilerOptions().GetNativeDebuggable();
David Brazdildee58d62016-04-07 09:54:26 +0000324 ArenaBitVector* native_debug_info_locations = nullptr;
325 if (native_debuggable) {
Vladimir Marko69d310e2017-10-09 14:12:23 +0100326 native_debug_info_locations = FindNativeDebugInfoLocations();
David Brazdildee58d62016-04-07 09:54:26 +0000327 }
328
Vladimir Marko2c45bc92016-10-25 16:54:12 +0100329 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
330 current_block_ = block;
David Brazdildee58d62016-04-07 09:54:26 +0000331 uint32_t block_dex_pc = current_block_->GetDexPc();
332
333 InitializeBlockLocals();
334
335 if (current_block_->IsEntryBlock()) {
336 InitializeParameters();
Vladimir Markoca6fff82017-10-03 14:49:14 +0100337 AppendInstruction(new (allocator_) HSuspendCheck(0u));
338 AppendInstruction(new (allocator_) HGoto(0u));
David Brazdildee58d62016-04-07 09:54:26 +0000339 continue;
340 } else if (current_block_->IsExitBlock()) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100341 AppendInstruction(new (allocator_) HExit());
David Brazdildee58d62016-04-07 09:54:26 +0000342 continue;
343 } else if (current_block_->IsLoopHeader()) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100344 HSuspendCheck* suspend_check = new (allocator_) HSuspendCheck(current_block_->GetDexPc());
David Brazdildee58d62016-04-07 09:54:26 +0000345 current_block_->GetLoopInformation()->SetSuspendCheck(suspend_check);
346 // This is slightly odd because the loop header might not be empty (TryBoundary).
347 // But we're still creating the environment with locals from the top of the block.
348 InsertInstructionAtTop(suspend_check);
349 }
350
351 if (block_dex_pc == kNoDexPc || current_block_ != block_builder_->GetBlockAt(block_dex_pc)) {
352 // Synthetic block that does not need to be populated.
353 DCHECK(IsBlockPopulated(current_block_));
354 continue;
355 }
356
357 DCHECK(!IsBlockPopulated(current_block_));
358
Mathieu Chartierde4b08f2017-07-10 14:13:41 -0700359 uint32_t quicken_index = 0;
360 if (CanDecodeQuickenedInfo()) {
361 quicken_index = block_builder_->GetQuickenIndex(block_dex_pc);
362 }
363
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800364 for (const DexInstructionPcPair& pair : code_item_accessor_.InstructionsFrom(block_dex_pc)) {
David Brazdildee58d62016-04-07 09:54:26 +0000365 if (current_block_ == nullptr) {
366 // The previous instruction ended this block.
367 break;
368 }
369
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800370 const uint32_t dex_pc = pair.DexPc();
David Brazdildee58d62016-04-07 09:54:26 +0000371 if (dex_pc != block_dex_pc && FindBlockStartingAt(dex_pc) != nullptr) {
372 // This dex_pc starts a new basic block.
373 break;
374 }
375
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800376 if (current_block_->IsTryBlock() && IsThrowingDexInstruction(pair.Inst())) {
David Brazdildee58d62016-04-07 09:54:26 +0000377 PropagateLocalsToCatchBlocks();
378 }
379
380 if (native_debuggable && native_debug_info_locations->IsBitSet(dex_pc)) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100381 AppendInstruction(new (allocator_) HNativeDebugInfo(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000382 }
383
Vladimir Markof91fc122020-05-13 09:21:00 +0100384 // Note: There may be no Thread for gtests.
385 DCHECK(Thread::Current() == nullptr || !Thread::Current()->IsExceptionPending())
Nicolas Geoffray605c5912020-04-08 15:12:39 +0100386 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
387 << " " << pair.Inst().Name() << "@" << dex_pc;
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800388 if (!ProcessDexInstruction(pair.Inst(), dex_pc, quicken_index)) {
David Brazdildee58d62016-04-07 09:54:26 +0000389 return false;
390 }
Vladimir Markof91fc122020-05-13 09:21:00 +0100391 DCHECK(Thread::Current() == nullptr || !Thread::Current()->IsExceptionPending())
Nicolas Geoffrayfbf53b52020-04-01 15:20:14 +0100392 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
Nicolas Geoffray605c5912020-04-08 15:12:39 +0100393 << " " << pair.Inst().Name() << "@" << dex_pc;
Mathieu Chartierde4b08f2017-07-10 14:13:41 -0700394
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800395 if (QuickenInfoTable::NeedsIndexForInstruction(&pair.Inst())) {
Mathieu Chartierde4b08f2017-07-10 14:13:41 -0700396 ++quicken_index;
397 }
David Brazdildee58d62016-04-07 09:54:26 +0000398 }
399
400 if (current_block_ != nullptr) {
401 // Branching instructions clear current_block, so we know the last
402 // instruction of the current block is not a branching instruction.
403 // We add an unconditional Goto to the next block.
404 DCHECK_EQ(current_block_->GetSuccessors().size(), 1u);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100405 AppendInstruction(new (allocator_) HGoto());
David Brazdildee58d62016-04-07 09:54:26 +0000406 }
407 }
408
409 SetLoopHeaderPhiInputs();
410
411 return true;
412}
413
Vladimir Marko92f7f3c2017-10-31 11:38:30 +0000414void HInstructionBuilder::BuildIntrinsic(ArtMethod* method) {
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800415 DCHECK(!code_item_accessor_.HasCodeItem());
Vladimir Marko92f7f3c2017-10-31 11:38:30 +0000416 DCHECK(method->IsIntrinsic());
417
418 locals_for_.resize(
419 graph_->GetBlocks().size(),
420 ScopedArenaVector<HInstruction*>(local_allocator_->Adapter(kArenaAllocGraphBuilder)));
421
422 // Fill the entry block. Do not add suspend check, we do not want a suspend
423 // check in intrinsics; intrinsic methods are supposed to be fast.
424 current_block_ = graph_->GetEntryBlock();
425 InitializeBlockLocals();
426 InitializeParameters();
427 AppendInstruction(new (allocator_) HGoto(0u));
428
429 // Fill the body.
430 current_block_ = current_block_->GetSingleSuccessor();
431 InitializeBlockLocals();
432 DCHECK(!IsBlockPopulated(current_block_));
433
Vladimir Marko5f846072020-04-09 13:20:11 +0100434 // Add the intermediate representation, if available, or invoke instruction.
Vladimir Marko92f7f3c2017-10-31 11:38:30 +0000435 size_t in_vregs = graph_->GetNumberOfInVRegs();
436 size_t number_of_arguments =
437 in_vregs - std::count(current_locals_->end() - in_vregs, current_locals_->end(), nullptr);
438 uint32_t method_idx = dex_compilation_unit_->GetDexMethodIndex();
Vladimir Marko5f846072020-04-09 13:20:11 +0100439 const char* shorty = dex_file_->GetMethodShorty(method_idx);
Treehugger Robot2c5827a2018-05-17 22:26:08 +0000440 RangeInstructionOperands operands(graph_->GetNumberOfVRegs() - in_vregs, in_vregs);
Vladimir Marko5f846072020-04-09 13:20:11 +0100441 if (!BuildSimpleIntrinsic(method, kNoDexPc, operands, shorty)) {
442 // Some intrinsics without intermediate representation still yield a leaf method,
443 // so build the invoke. Use HInvokeStaticOrDirect even for methods that would
444 // normally use an HInvokeVirtual (sharpen the call).
445 MethodReference target_method(dex_file_, method_idx);
446 HInvokeStaticOrDirect::DispatchInfo dispatch_info = {
447 HInvokeStaticOrDirect::MethodLoadKind::kRuntimeCall,
448 HInvokeStaticOrDirect::CodePtrLocation::kCallArtMethod,
449 /* method_load_data= */ 0u
450 };
451 InvokeType invoke_type = dex_compilation_unit_->IsStatic() ? kStatic : kDirect;
452 HInvokeStaticOrDirect* invoke = new (allocator_) HInvokeStaticOrDirect(
453 allocator_,
454 number_of_arguments,
455 return_type_,
456 kNoDexPc,
457 method_idx,
458 method,
459 dispatch_info,
460 invoke_type,
461 target_method,
462 HInvokeStaticOrDirect::ClinitCheckRequirement::kNone);
463 HandleInvoke(invoke, operands, shorty, /* is_unresolved= */ false);
464 }
Vladimir Marko92f7f3c2017-10-31 11:38:30 +0000465
466 // Add the return instruction.
467 if (return_type_ == DataType::Type::kVoid) {
468 AppendInstruction(new (allocator_) HReturnVoid());
469 } else {
Vladimir Marko5f846072020-04-09 13:20:11 +0100470 AppendInstruction(new (allocator_) HReturn(latest_result_));
Vladimir Marko92f7f3c2017-10-31 11:38:30 +0000471 }
472
473 // Fill the exit block.
474 DCHECK_EQ(current_block_->GetSingleSuccessor(), graph_->GetExitBlock());
475 current_block_ = graph_->GetExitBlock();
476 InitializeBlockLocals();
477 AppendInstruction(new (allocator_) HExit());
478}
479
Vladimir Marko69d310e2017-10-09 14:12:23 +0100480ArenaBitVector* HInstructionBuilder::FindNativeDebugInfoLocations() {
Vladimir Marko69d310e2017-10-09 14:12:23 +0100481 ArenaBitVector* locations = ArenaBitVector::Create(local_allocator_,
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800482 code_item_accessor_.InsnsSizeInCodeUnits(),
Andreas Gampe3db70682018-12-26 15:12:03 -0800483 /* expandable= */ false,
Vladimir Marko69d310e2017-10-09 14:12:23 +0100484 kArenaAllocGraphBuilder);
485 locations->ClearAllBits();
Mathieu Chartier3e2e1232018-09-11 12:35:30 -0700486 // The visitor gets called when the line number changes.
487 // In other words, it marks the start of new java statement.
488 code_item_accessor_.DecodeDebugPositionInfo([&](const DexFile::PositionInfo& entry) {
489 locations->SetBit(entry.address_);
490 return false;
491 });
David Brazdildee58d62016-04-07 09:54:26 +0000492 // Instruction-specific tweaks.
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800493 for (const DexInstructionPcPair& inst : code_item_accessor_) {
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800494 switch (inst->Opcode()) {
David Brazdildee58d62016-04-07 09:54:26 +0000495 case Instruction::MOVE_EXCEPTION: {
496 // Stop in native debugger after the exception has been moved.
497 // The compiler also expects the move at the start of basic block so
498 // we do not want to interfere by inserting native-debug-info before it.
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800499 locations->ClearBit(inst.DexPc());
500 DexInstructionIterator next = std::next(DexInstructionIterator(inst));
501 DCHECK(next.DexPc() != inst.DexPc());
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800502 if (next != code_item_accessor_.end()) {
Mathieu Chartier2b2bef22017-10-26 17:10:19 -0700503 locations->SetBit(next.DexPc());
David Brazdildee58d62016-04-07 09:54:26 +0000504 }
505 break;
506 }
507 default:
508 break;
509 }
510 }
Vladimir Marko69d310e2017-10-09 14:12:23 +0100511 return locations;
David Brazdildee58d62016-04-07 09:54:26 +0000512}
513
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100514HInstruction* HInstructionBuilder::LoadLocal(uint32_t reg_number, DataType::Type type) const {
David Brazdildee58d62016-04-07 09:54:26 +0000515 HInstruction* value = (*current_locals_)[reg_number];
516 DCHECK(value != nullptr);
517
518 // If the operation requests a specific type, we make sure its input is of that type.
519 if (type != value->GetType()) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100520 if (DataType::IsFloatingPointType(type)) {
Aart Bik31883642016-06-06 15:02:44 -0700521 value = ssa_builder_->GetFloatOrDoubleEquivalent(value, type);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100522 } else if (type == DataType::Type::kReference) {
Aart Bik31883642016-06-06 15:02:44 -0700523 value = ssa_builder_->GetReferenceTypeEquivalent(value);
David Brazdildee58d62016-04-07 09:54:26 +0000524 }
Aart Bik31883642016-06-06 15:02:44 -0700525 DCHECK(value != nullptr);
David Brazdildee58d62016-04-07 09:54:26 +0000526 }
527
528 return value;
529}
530
531void HInstructionBuilder::UpdateLocal(uint32_t reg_number, HInstruction* stored_value) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100532 DataType::Type stored_type = stored_value->GetType();
533 DCHECK_NE(stored_type, DataType::Type::kVoid);
David Brazdildee58d62016-04-07 09:54:26 +0000534
535 // Storing into vreg `reg_number` may implicitly invalidate the surrounding
536 // registers. Consider the following cases:
537 // (1) Storing a wide value must overwrite previous values in both `reg_number`
538 // and `reg_number+1`. We store `nullptr` in `reg_number+1`.
539 // (2) If vreg `reg_number-1` holds a wide value, writing into `reg_number`
540 // must invalidate it. We store `nullptr` in `reg_number-1`.
541 // Consequently, storing a wide value into the high vreg of another wide value
542 // will invalidate both `reg_number-1` and `reg_number+1`.
543
544 if (reg_number != 0) {
545 HInstruction* local_low = (*current_locals_)[reg_number - 1];
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100546 if (local_low != nullptr && DataType::Is64BitType(local_low->GetType())) {
David Brazdildee58d62016-04-07 09:54:26 +0000547 // The vreg we are storing into was previously the high vreg of a pair.
548 // We need to invalidate its low vreg.
549 DCHECK((*current_locals_)[reg_number] == nullptr);
550 (*current_locals_)[reg_number - 1] = nullptr;
551 }
552 }
553
554 (*current_locals_)[reg_number] = stored_value;
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100555 if (DataType::Is64BitType(stored_type)) {
David Brazdildee58d62016-04-07 09:54:26 +0000556 // We are storing a pair. Invalidate the instruction in the high vreg.
557 (*current_locals_)[reg_number + 1] = nullptr;
558 }
559}
560
561void HInstructionBuilder::InitializeParameters() {
562 DCHECK(current_block_->IsEntryBlock());
563
Vladimir Marko69d310e2017-10-09 14:12:23 +0100564 // outer_compilation_unit_ is null only when unit testing.
565 if (outer_compilation_unit_ == nullptr) {
David Brazdildee58d62016-04-07 09:54:26 +0000566 return;
567 }
568
569 const char* shorty = dex_compilation_unit_->GetShorty();
570 uint16_t number_of_parameters = graph_->GetNumberOfInVRegs();
571 uint16_t locals_index = graph_->GetNumberOfLocalVRegs();
572 uint16_t parameter_index = 0;
573
Andreas Gampe3f1dcd32018-12-28 09:39:56 -0800574 const dex::MethodId& referrer_method_id =
David Brazdildee58d62016-04-07 09:54:26 +0000575 dex_file_->GetMethodId(dex_compilation_unit_->GetDexMethodIndex());
576 if (!dex_compilation_unit_->IsStatic()) {
577 // Add the implicit 'this' argument, not expressed in the signature.
Vladimir Markoca6fff82017-10-03 14:49:14 +0100578 HParameterValue* parameter = new (allocator_) HParameterValue(*dex_file_,
David Brazdildee58d62016-04-07 09:54:26 +0000579 referrer_method_id.class_idx_,
580 parameter_index++,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100581 DataType::Type::kReference,
Andreas Gampe3db70682018-12-26 15:12:03 -0800582 /* is_this= */ true);
David Brazdildee58d62016-04-07 09:54:26 +0000583 AppendInstruction(parameter);
584 UpdateLocal(locals_index++, parameter);
585 number_of_parameters--;
Igor Murashkind01745e2017-04-05 16:40:31 -0700586 current_this_parameter_ = parameter;
587 } else {
588 DCHECK(current_this_parameter_ == nullptr);
David Brazdildee58d62016-04-07 09:54:26 +0000589 }
590
Andreas Gampe3f1dcd32018-12-28 09:39:56 -0800591 const dex::ProtoId& proto = dex_file_->GetMethodPrototype(referrer_method_id);
592 const dex::TypeList* arg_types = dex_file_->GetProtoParameters(proto);
David Brazdildee58d62016-04-07 09:54:26 +0000593 for (int i = 0, shorty_pos = 1; i < number_of_parameters; i++) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100594 HParameterValue* parameter = new (allocator_) HParameterValue(
David Brazdildee58d62016-04-07 09:54:26 +0000595 *dex_file_,
596 arg_types->GetTypeItem(shorty_pos - 1).type_idx_,
597 parameter_index++,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100598 DataType::FromShorty(shorty[shorty_pos]),
Andreas Gampe3db70682018-12-26 15:12:03 -0800599 /* is_this= */ false);
David Brazdildee58d62016-04-07 09:54:26 +0000600 ++shorty_pos;
601 AppendInstruction(parameter);
602 // Store the parameter value in the local that the dex code will use
603 // to reference that parameter.
604 UpdateLocal(locals_index++, parameter);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100605 if (DataType::Is64BitType(parameter->GetType())) {
David Brazdildee58d62016-04-07 09:54:26 +0000606 i++;
607 locals_index++;
608 parameter_index++;
609 }
610 }
611}
612
613template<typename T>
614void HInstructionBuilder::If_22t(const Instruction& instruction, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100615 HInstruction* first = LoadLocal(instruction.VRegA(), DataType::Type::kInt32);
616 HInstruction* second = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100617 T* comparison = new (allocator_) T(first, second, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +0000618 AppendInstruction(comparison);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100619 AppendInstruction(new (allocator_) HIf(comparison, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000620 current_block_ = nullptr;
621}
622
623template<typename T>
624void HInstructionBuilder::If_21t(const Instruction& instruction, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100625 HInstruction* value = LoadLocal(instruction.VRegA(), DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100626 T* comparison = new (allocator_) T(value, graph_->GetIntConstant(0, dex_pc), dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +0000627 AppendInstruction(comparison);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100628 AppendInstruction(new (allocator_) HIf(comparison, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000629 current_block_ = nullptr;
630}
631
632template<typename T>
633void HInstructionBuilder::Unop_12x(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100634 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000635 uint32_t dex_pc) {
636 HInstruction* first = LoadLocal(instruction.VRegB(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100637 AppendInstruction(new (allocator_) T(type, first, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000638 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
639}
640
641void HInstructionBuilder::Conversion_12x(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100642 DataType::Type input_type,
643 DataType::Type result_type,
David Brazdildee58d62016-04-07 09:54:26 +0000644 uint32_t dex_pc) {
645 HInstruction* first = LoadLocal(instruction.VRegB(), input_type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100646 AppendInstruction(new (allocator_) HTypeConversion(result_type, first, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000647 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
648}
649
650template<typename T>
651void HInstructionBuilder::Binop_23x(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100652 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000653 uint32_t dex_pc) {
654 HInstruction* first = LoadLocal(instruction.VRegB(), type);
655 HInstruction* second = LoadLocal(instruction.VRegC(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100656 AppendInstruction(new (allocator_) T(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000657 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
658}
659
660template<typename T>
661void HInstructionBuilder::Binop_23x_shift(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100662 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000663 uint32_t dex_pc) {
664 HInstruction* first = LoadLocal(instruction.VRegB(), type);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100665 HInstruction* second = LoadLocal(instruction.VRegC(), DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100666 AppendInstruction(new (allocator_) T(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000667 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
668}
669
670void HInstructionBuilder::Binop_23x_cmp(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100671 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000672 ComparisonBias bias,
673 uint32_t dex_pc) {
674 HInstruction* first = LoadLocal(instruction.VRegB(), type);
675 HInstruction* second = LoadLocal(instruction.VRegC(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100676 AppendInstruction(new (allocator_) HCompare(type, first, second, bias, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000677 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
678}
679
680template<typename T>
681void HInstructionBuilder::Binop_12x_shift(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100682 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000683 uint32_t dex_pc) {
684 HInstruction* first = LoadLocal(instruction.VRegA(), type);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100685 HInstruction* second = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100686 AppendInstruction(new (allocator_) T(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000687 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
688}
689
690template<typename T>
691void HInstructionBuilder::Binop_12x(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100692 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000693 uint32_t dex_pc) {
694 HInstruction* first = LoadLocal(instruction.VRegA(), type);
695 HInstruction* second = LoadLocal(instruction.VRegB(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100696 AppendInstruction(new (allocator_) T(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000697 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
698}
699
700template<typename T>
701void HInstructionBuilder::Binop_22s(const Instruction& instruction, bool reverse, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100702 HInstruction* first = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
David Brazdildee58d62016-04-07 09:54:26 +0000703 HInstruction* second = graph_->GetIntConstant(instruction.VRegC_22s(), dex_pc);
704 if (reverse) {
705 std::swap(first, second);
706 }
Vladimir Markoca6fff82017-10-03 14:49:14 +0100707 AppendInstruction(new (allocator_) T(DataType::Type::kInt32, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000708 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
709}
710
711template<typename T>
712void HInstructionBuilder::Binop_22b(const Instruction& instruction, bool reverse, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100713 HInstruction* first = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
David Brazdildee58d62016-04-07 09:54:26 +0000714 HInstruction* second = graph_->GetIntConstant(instruction.VRegC_22b(), dex_pc);
715 if (reverse) {
716 std::swap(first, second);
717 }
Vladimir Markoca6fff82017-10-03 14:49:14 +0100718 AppendInstruction(new (allocator_) T(DataType::Type::kInt32, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000719 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
720}
721
Igor Murashkind01745e2017-04-05 16:40:31 -0700722// Does the method being compiled need any constructor barriers being inserted?
723// (Always 'false' for methods that aren't <init>.)
Vladimir Markoc1c34522018-10-31 13:56:49 +0000724static bool RequiresConstructorBarrier(const DexCompilationUnit* cu) {
Igor Murashkin032cacd2017-04-06 14:40:08 -0700725 // Can be null in unit tests only.
726 if (UNLIKELY(cu == nullptr)) {
727 return false;
728 }
729
Vladimir Markoc1c34522018-10-31 13:56:49 +0000730 // Constructor barriers are applicable only for <init> methods.
731 if (LIKELY(!cu->IsConstructor() || cu->IsStatic())) {
732 return false;
733 }
734
735 return cu->RequiresConstructorBarrier();
David Brazdildee58d62016-04-07 09:54:26 +0000736}
737
738// Returns true if `block` has only one successor which starts at the next
739// dex_pc after `instruction` at `dex_pc`.
740static bool IsFallthroughInstruction(const Instruction& instruction,
741 uint32_t dex_pc,
742 HBasicBlock* block) {
743 uint32_t next_dex_pc = dex_pc + instruction.SizeInCodeUnits();
744 return block->GetSingleSuccessor()->GetDexPc() == next_dex_pc;
745}
746
747void HInstructionBuilder::BuildSwitch(const Instruction& instruction, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100748 HInstruction* value = LoadLocal(instruction.VRegA(), DataType::Type::kInt32);
David Brazdildee58d62016-04-07 09:54:26 +0000749 DexSwitchTable table(instruction, dex_pc);
750
751 if (table.GetNumEntries() == 0) {
752 // Empty Switch. Code falls through to the next block.
753 DCHECK(IsFallthroughInstruction(instruction, dex_pc, current_block_));
Vladimir Markoca6fff82017-10-03 14:49:14 +0100754 AppendInstruction(new (allocator_) HGoto(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000755 } else if (table.ShouldBuildDecisionTree()) {
756 for (DexSwitchTableIterator it(table); !it.Done(); it.Advance()) {
757 HInstruction* case_value = graph_->GetIntConstant(it.CurrentKey(), dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100758 HEqual* comparison = new (allocator_) HEqual(value, case_value, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +0000759 AppendInstruction(comparison);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100760 AppendInstruction(new (allocator_) HIf(comparison, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000761
762 if (!it.IsLast()) {
763 current_block_ = FindBlockStartingAt(it.GetDexPcForCurrentIndex());
764 }
765 }
766 } else {
767 AppendInstruction(
Vladimir Markoca6fff82017-10-03 14:49:14 +0100768 new (allocator_) HPackedSwitch(table.GetEntryAt(0), table.GetNumEntries(), value, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000769 }
770
771 current_block_ = nullptr;
772}
773
774void HInstructionBuilder::BuildReturn(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100775 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000776 uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100777 if (type == DataType::Type::kVoid) {
Igor Murashkind01745e2017-04-05 16:40:31 -0700778 // Only <init> (which is a return-void) could possibly have a constructor fence.
Igor Murashkin032cacd2017-04-06 14:40:08 -0700779 // This may insert additional redundant constructor fences from the super constructors.
780 // TODO: remove redundant constructor fences (b/36656456).
Vladimir Markoc1c34522018-10-31 13:56:49 +0000781 if (RequiresConstructorBarrier(dex_compilation_unit_)) {
Igor Murashkind01745e2017-04-05 16:40:31 -0700782 // Compiling instance constructor.
Vladimir Markoba118822017-06-12 15:41:56 +0100783 DCHECK_STREQ("<init>", graph_->GetMethodName());
Igor Murashkind01745e2017-04-05 16:40:31 -0700784
785 HInstruction* fence_target = current_this_parameter_;
786 DCHECK(fence_target != nullptr);
787
Vladimir Markoca6fff82017-10-03 14:49:14 +0100788 AppendInstruction(new (allocator_) HConstructorFence(fence_target, dex_pc, allocator_));
Igor Murashkin6ef45672017-08-08 13:59:55 -0700789 MaybeRecordStat(
790 compilation_stats_,
791 MethodCompilationStat::kConstructorFenceGeneratedFinal);
David Brazdildee58d62016-04-07 09:54:26 +0000792 }
Vladimir Markoca6fff82017-10-03 14:49:14 +0100793 AppendInstruction(new (allocator_) HReturnVoid(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000794 } else {
Vladimir Markoc1c34522018-10-31 13:56:49 +0000795 DCHECK(!RequiresConstructorBarrier(dex_compilation_unit_));
David Brazdildee58d62016-04-07 09:54:26 +0000796 HInstruction* value = LoadLocal(instruction.VRegA(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100797 AppendInstruction(new (allocator_) HReturn(value, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000798 }
799 current_block_ = nullptr;
800}
801
802static InvokeType GetInvokeTypeFromOpCode(Instruction::Code opcode) {
803 switch (opcode) {
804 case Instruction::INVOKE_STATIC:
805 case Instruction::INVOKE_STATIC_RANGE:
806 return kStatic;
807 case Instruction::INVOKE_DIRECT:
808 case Instruction::INVOKE_DIRECT_RANGE:
809 return kDirect;
810 case Instruction::INVOKE_VIRTUAL:
811 case Instruction::INVOKE_VIRTUAL_QUICK:
812 case Instruction::INVOKE_VIRTUAL_RANGE:
813 case Instruction::INVOKE_VIRTUAL_RANGE_QUICK:
814 return kVirtual;
815 case Instruction::INVOKE_INTERFACE:
816 case Instruction::INVOKE_INTERFACE_RANGE:
817 return kInterface;
818 case Instruction::INVOKE_SUPER_RANGE:
819 case Instruction::INVOKE_SUPER:
820 return kSuper;
821 default:
822 LOG(FATAL) << "Unexpected invoke opcode: " << opcode;
823 UNREACHABLE();
824 }
825}
826
Vladimir Marko2f40d242020-04-08 12:56:45 +0100827// Try to resolve a method using the class linker. Return null if a method could
828// not be resolved or the resolved method cannot be used for some reason.
829// Also retrieve method data needed for creating the invoke intermediate
830// representation while we hold the mutator lock here.
831static ArtMethod* ResolveMethod(uint16_t method_idx,
832 ArtMethod* referrer,
833 const DexCompilationUnit& dex_compilation_unit,
834 /*inout*/InvokeType* invoke_type,
835 /*out*/MethodReference* target_method,
836 /*out*/bool* is_string_constructor) {
David Brazdildee58d62016-04-07 09:54:26 +0000837 ScopedObjectAccess soa(Thread::Current());
David Brazdildee58d62016-04-07 09:54:26 +0000838
Vladimir Marko2f40d242020-04-08 12:56:45 +0100839 ClassLinker* class_linker = dex_compilation_unit.GetClassLinker();
840 Handle<mirror::ClassLoader> class_loader = dex_compilation_unit.GetClassLoader();
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100841
Vladimir Markoba118822017-06-12 15:41:56 +0100842 ArtMethod* resolved_method =
843 class_linker->ResolveMethod<ClassLinker::ResolveMode::kCheckICCEAndIAE>(
Vladimir Markoba118822017-06-12 15:41:56 +0100844 method_idx,
Vladimir Marko2f40d242020-04-08 12:56:45 +0100845 dex_compilation_unit.GetDexCache(),
Vladimir Markoba118822017-06-12 15:41:56 +0100846 class_loader,
Vladimir Marko2f40d242020-04-08 12:56:45 +0100847 referrer,
848 *invoke_type);
David Brazdildee58d62016-04-07 09:54:26 +0000849
850 if (UNLIKELY(resolved_method == nullptr)) {
851 // Clean up any exception left by type resolution.
852 soa.Self()->ClearException();
853 return nullptr;
854 }
Nicolas Geoffray605c5912020-04-08 15:12:39 +0100855 DCHECK(!soa.Self()->IsExceptionPending());
David Brazdildee58d62016-04-07 09:54:26 +0000856
Vladimir Markoba118822017-06-12 15:41:56 +0100857 // The referrer may be unresolved for AOT if we're compiling a class that cannot be
858 // resolved because, for example, we don't find a superclass in the classpath.
Vladimir Marko2f40d242020-04-08 12:56:45 +0100859 if (referrer == nullptr) {
Vladimir Markoba118822017-06-12 15:41:56 +0100860 // The class linker cannot check access without a referrer, so we have to do it.
861 // Fall back to HInvokeUnresolved if the method isn't public.
David Brazdildee58d62016-04-07 09:54:26 +0000862 if (!resolved_method->IsPublic()) {
863 return nullptr;
864 }
David Brazdildee58d62016-04-07 09:54:26 +0000865 }
866
867 // We have to special case the invoke-super case, as ClassLinker::ResolveMethod does not.
868 // We need to look at the referrer's super class vtable. We need to do this to know if we need to
869 // make this an invoke-unresolved to handle cross-dex invokes or abstract super methods, both of
870 // which require runtime handling.
Vladimir Marko2f40d242020-04-08 12:56:45 +0100871 if (*invoke_type == kSuper) {
872 ObjPtr<mirror::Class> compiling_class = dex_compilation_unit.GetCompilingClass().Get();
Andreas Gampefa4333d2017-02-14 11:10:34 -0800873 if (compiling_class == nullptr) {
David Brazdildee58d62016-04-07 09:54:26 +0000874 // We could not determine the method's class we need to wait until runtime.
875 DCHECK(Runtime::Current()->IsAotCompiler());
876 return nullptr;
877 }
Vladimir Markoba118822017-06-12 15:41:56 +0100878 ObjPtr<mirror::Class> referenced_class = class_linker->LookupResolvedType(
Vladimir Marko2f40d242020-04-08 12:56:45 +0100879 dex_compilation_unit.GetDexFile()->GetMethodId(method_idx).class_idx_,
880 dex_compilation_unit.GetDexCache().Get(),
Vladimir Markoba118822017-06-12 15:41:56 +0100881 class_loader.Get());
882 DCHECK(referenced_class != nullptr); // We have already resolved a method from this class.
883 if (!referenced_class->IsAssignableFrom(compiling_class)) {
Aart Bikf663e342016-04-04 17:28:59 -0700884 // We cannot statically determine the target method. The runtime will throw a
885 // NoSuchMethodError on this one.
886 return nullptr;
887 }
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100888 ArtMethod* actual_method;
Vladimir Markoba118822017-06-12 15:41:56 +0100889 if (referenced_class->IsInterface()) {
890 actual_method = referenced_class->FindVirtualMethodForInterfaceSuper(
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100891 resolved_method, class_linker->GetImagePointerSize());
David Brazdildee58d62016-04-07 09:54:26 +0000892 } else {
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100893 uint16_t vtable_index = resolved_method->GetMethodIndex();
894 actual_method = compiling_class->GetSuperClass()->GetVTableEntry(
895 vtable_index, class_linker->GetImagePointerSize());
David Brazdildee58d62016-04-07 09:54:26 +0000896 }
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100897 if (actual_method != resolved_method &&
Vladimir Marko2f40d242020-04-08 12:56:45 +0100898 !IsSameDexFile(*actual_method->GetDexFile(), *dex_compilation_unit.GetDexFile())) {
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100899 // The back-end code generator relies on this check in order to ensure that it will not
900 // attempt to read the dex_cache with a dex_method_index that is not from the correct
901 // dex_file. If we didn't do this check then the dex_method_index will not be updated in the
Vladimir Markoc1c34522018-10-31 13:56:49 +0000902 // builder, which means that the code-generator (and sharpening and inliner, maybe)
903 // might invoke an incorrect method.
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100904 // TODO: The actual method could still be referenced in the current dex file, so we
905 // could try locating it.
906 // TODO: Remove the dex_file restriction.
907 return nullptr;
908 }
909 if (!actual_method->IsInvokable()) {
910 // Fail if the actual method cannot be invoked. Otherwise, the runtime resolution stub
911 // could resolve the callee to the wrong method.
912 return nullptr;
913 }
914 resolved_method = actual_method;
David Brazdildee58d62016-04-07 09:54:26 +0000915 }
916
Vladimir Marko2f40d242020-04-08 12:56:45 +0100917 if (*invoke_type == kInterface) {
918 if (resolved_method->GetDeclaringClass()->IsObjectClass()) {
919 // If the resolved method is from j.l.Object, emit a virtual call instead.
920 // The IMT conflict stub only handles interface methods.
921 *invoke_type = kVirtual;
922 } else {
923 DCHECK(resolved_method->GetDeclaringClass()->IsInterface());
924 }
925 }
David Brazdildee58d62016-04-07 09:54:26 +0000926
Vladimir Marko2f40d242020-04-08 12:56:45 +0100927 if (*invoke_type == kDirect || *invoke_type == kStatic || *invoke_type == kSuper) {
928 // Record the target method needed for HInvokeStaticOrDirect.
929 *target_method =
930 MethodReference(resolved_method->GetDexFile(), resolved_method->GetDexMethodIndex());
931 } else if (*invoke_type == kVirtual) {
932 // For HInvokeVirtual we need the vtable index.
933 *target_method = MethodReference(/*file=*/ nullptr, resolved_method->GetVtableIndex());
Andra Danciua0130e82020-07-23 12:34:56 +0000934 } else if (*invoke_type == kInterface) {
Vladimir Marko2f40d242020-04-08 12:56:45 +0100935 // For HInvokeInterface we need the IMT index.
936 *target_method = MethodReference(/*file=*/ nullptr, ImTable::GetImtIndex(resolved_method));
Andra Danciua0130e82020-07-23 12:34:56 +0000937 } else {
938 // For HInvokePolymorphic we don't need the target method yet
939 DCHECK_EQ(*invoke_type, kPolymorphic);
940 DCHECK(target_method == nullptr);
Vladimir Marko2f40d242020-04-08 12:56:45 +0100941 }
942
943 *is_string_constructor =
944 resolved_method->IsConstructor() && resolved_method->GetDeclaringClass()->IsStringClass();
945
946 return resolved_method;
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100947}
948
David Brazdildee58d62016-04-07 09:54:26 +0000949bool HInstructionBuilder::BuildInvoke(const Instruction& instruction,
950 uint32_t dex_pc,
951 uint32_t method_idx,
Treehugger Robot2c5827a2018-05-17 22:26:08 +0000952 const InstructionOperands& operands) {
David Brazdildee58d62016-04-07 09:54:26 +0000953 InvokeType invoke_type = GetInvokeTypeFromOpCode(instruction.Opcode());
Orion Hodson4c8e12e2018-05-18 08:33:20 +0100954 const char* shorty = dex_file_->GetMethodShorty(method_idx);
955 DataType::Type return_type = DataType::FromShorty(shorty[0]);
David Brazdildee58d62016-04-07 09:54:26 +0000956
957 // Remove the return type from the 'proto'.
Orion Hodson4c8e12e2018-05-18 08:33:20 +0100958 size_t number_of_arguments = strlen(shorty) - 1;
David Brazdildee58d62016-04-07 09:54:26 +0000959 if (invoke_type != kStatic) { // instance call
960 // One extra argument for 'this'.
961 number_of_arguments++;
962 }
963
Vladimir Marko2f40d242020-04-08 12:56:45 +0100964 MethodReference target_method(nullptr, 0u);
965 bool is_string_constructor = false;
966 ArtMethod* resolved_method = ResolveMethod(method_idx,
967 graph_->GetArtMethod(),
968 *dex_compilation_unit_,
969 &invoke_type,
970 &target_method,
971 &is_string_constructor);
David Brazdildee58d62016-04-07 09:54:26 +0000972
973 if (UNLIKELY(resolved_method == nullptr)) {
Nicolas Geoffray605c5912020-04-08 15:12:39 +0100974 DCHECK(!Thread::Current()->IsExceptionPending());
Igor Murashkin1e065a52017-08-09 13:20:34 -0700975 MaybeRecordStat(compilation_stats_,
976 MethodCompilationStat::kUnresolvedMethod);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100977 HInvoke* invoke = new (allocator_) HInvokeUnresolved(allocator_,
978 number_of_arguments,
979 return_type,
980 dex_pc,
981 method_idx,
982 invoke_type);
Andreas Gampe3db70682018-12-26 15:12:03 -0800983 return HandleInvoke(invoke, operands, shorty, /* is_unresolved= */ true);
David Brazdildee58d62016-04-07 09:54:26 +0000984 }
985
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100986 // Replace calls to String.<init> with StringFactory.
Vladimir Marko2f40d242020-04-08 12:56:45 +0100987 if (is_string_constructor) {
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100988 uint32_t string_init_entry_point = WellKnownClasses::StringInitToEntryPoint(resolved_method);
989 HInvokeStaticOrDirect::DispatchInfo dispatch_info = {
990 HInvokeStaticOrDirect::MethodLoadKind::kStringInit,
991 HInvokeStaticOrDirect::CodePtrLocation::kCallArtMethod,
Nicolas Geoffrayc1a42cf2016-12-18 15:52:36 +0000992 dchecked_integral_cast<uint64_t>(string_init_entry_point)
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100993 };
Nicolas Geoffrayf665f842018-02-15 12:29:06 +0000994 // We pass null for the resolved_method to ensure optimizations
995 // don't rely on it.
Vladimir Markoca6fff82017-10-03 14:49:14 +0100996 HInvoke* invoke = new (allocator_) HInvokeStaticOrDirect(
997 allocator_,
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100998 number_of_arguments - 1,
Andreas Gampe3db70682018-12-26 15:12:03 -0800999 /* return_type= */ DataType::Type::kReference,
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +01001000 dex_pc,
1001 method_idx,
Andreas Gampe3db70682018-12-26 15:12:03 -08001002 /* resolved_method= */ nullptr,
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +01001003 dispatch_info,
1004 invoke_type,
1005 target_method,
1006 HInvokeStaticOrDirect::ClinitCheckRequirement::kImplicit);
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001007 return HandleStringInit(invoke, operands, shorty);
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +01001008 }
1009
David Brazdildee58d62016-04-07 09:54:26 +00001010 // Potential class initialization check, in the case of a static method call.
Vladimir Marko2f40d242020-04-08 12:56:45 +01001011 HInvokeStaticOrDirect::ClinitCheckRequirement clinit_check_requirement =
1012 HInvokeStaticOrDirect::ClinitCheckRequirement::kNone;
David Brazdildee58d62016-04-07 09:54:26 +00001013 HClinitCheck* clinit_check = nullptr;
Vladimir Marko2f40d242020-04-08 12:56:45 +01001014 if (invoke_type == kStatic) {
1015 clinit_check = ProcessClinitCheckForInvoke(dex_pc, resolved_method, &clinit_check_requirement);
1016 }
1017
Vladimir Marko5f846072020-04-09 13:20:11 +01001018 // Try to build an HIR replacement for the intrinsic.
1019 if (UNLIKELY(resolved_method->IsIntrinsic())) {
1020 // All intrinsics are in the primary boot image, so their class can always be referenced
1021 // and we do not need to rely on the implicit class initialization check. The class should
1022 // be initialized but we do not require that here.
1023 DCHECK_NE(clinit_check_requirement, HInvokeStaticOrDirect::ClinitCheckRequirement::kImplicit);
1024 if (BuildSimpleIntrinsic(resolved_method, dex_pc, operands, shorty)) {
1025 return true;
1026 }
1027 }
1028
David Brazdildee58d62016-04-07 09:54:26 +00001029 HInvoke* invoke = nullptr;
1030 if (invoke_type == kDirect || invoke_type == kStatic || invoke_type == kSuper) {
Vladimir Marko2f40d242020-04-08 12:56:45 +01001031 if (invoke_type == kSuper) {
1032 if (IsSameDexFile(*target_method.dex_file, *dex_compilation_unit_->GetDexFile())) {
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +01001033 // Update the method index to the one resolved. Note that this may be a no-op if
David Brazdildee58d62016-04-07 09:54:26 +00001034 // we resolved to the method referenced by the instruction.
Vladimir Marko2f40d242020-04-08 12:56:45 +01001035 method_idx = target_method.index;
David Brazdildee58d62016-04-07 09:54:26 +00001036 }
1037 }
1038
Nicolas Geoffraybdb2ecc2018-09-18 14:33:55 +01001039 HInvokeStaticOrDirect::DispatchInfo dispatch_info =
1040 HSharpening::SharpenInvokeStaticOrDirect(resolved_method, code_generator_);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001041 invoke = new (allocator_) HInvokeStaticOrDirect(allocator_,
1042 number_of_arguments,
1043 return_type,
1044 dex_pc,
1045 method_idx,
1046 resolved_method,
1047 dispatch_info,
1048 invoke_type,
1049 target_method,
1050 clinit_check_requirement);
Vladimir Marko5f846072020-04-09 13:20:11 +01001051 if (clinit_check != nullptr) {
1052 // Add the class initialization check as last input of `invoke`.
1053 DCHECK_EQ(clinit_check_requirement, HInvokeStaticOrDirect::ClinitCheckRequirement::kExplicit);
1054 size_t clinit_check_index = invoke->InputCount() - 1u;
1055 DCHECK(invoke->InputAt(clinit_check_index) == nullptr);
1056 invoke->SetArgumentAt(clinit_check_index, clinit_check);
1057 }
David Brazdildee58d62016-04-07 09:54:26 +00001058 } else if (invoke_type == kVirtual) {
Vladimir Marko2f40d242020-04-08 12:56:45 +01001059 DCHECK(target_method.dex_file == nullptr);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001060 invoke = new (allocator_) HInvokeVirtual(allocator_,
1061 number_of_arguments,
1062 return_type,
1063 dex_pc,
1064 method_idx,
1065 resolved_method,
Vladimir Marko2f40d242020-04-08 12:56:45 +01001066 /*vtable_index=*/ target_method.index);
David Brazdildee58d62016-04-07 09:54:26 +00001067 } else {
1068 DCHECK_EQ(invoke_type, kInterface);
Vladimir Marko2f40d242020-04-08 12:56:45 +01001069 invoke = new (allocator_) HInvokeInterface(allocator_,
Vladimir Markoca6fff82017-10-03 14:49:14 +01001070 number_of_arguments,
1071 return_type,
1072 dex_pc,
1073 method_idx,
1074 resolved_method,
Vladimir Marko2f40d242020-04-08 12:56:45 +01001075 /*imt_index=*/ target_method.index);
David Brazdildee58d62016-04-07 09:54:26 +00001076 }
Vladimir Marko5f846072020-04-09 13:20:11 +01001077 return HandleInvoke(invoke, operands, shorty, /* is_unresolved= */ false);
David Brazdildee58d62016-04-07 09:54:26 +00001078}
1079
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001080bool HInstructionBuilder::BuildInvokePolymorphic(uint32_t dex_pc,
Orion Hodsonac141392017-01-13 11:53:47 +00001081 uint32_t method_idx,
Orion Hodson06d10a72018-05-14 08:53:38 +01001082 dex::ProtoIndex proto_idx,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001083 const InstructionOperands& operands) {
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001084 const char* shorty = dex_file_->GetShorty(proto_idx);
1085 DCHECK_EQ(1 + ArtMethod::NumArgRegisters(shorty), operands.GetNumberOfOperands());
1086 DataType::Type return_type = DataType::FromShorty(shorty[0]);
1087 size_t number_of_arguments = strlen(shorty);
Andra Danciua0130e82020-07-23 12:34:56 +00001088 // We use ResolveMethod which is also used in BuildInvoke in order to
1089 // not duplicate code. As such, we need to provide is_string_constructor
1090 // even if we don't need it afterwards.
1091 InvokeType invoke_type = InvokeType::kPolymorphic;
1092 bool is_string_constructor = false;
1093 ArtMethod* resolved_method = ResolveMethod(method_idx,
1094 graph_->GetArtMethod(),
1095 *dex_compilation_unit_,
1096 &invoke_type,
1097 /* target_method= */ nullptr,
1098 &is_string_constructor);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001099 HInvoke* invoke = new (allocator_) HInvokePolymorphic(allocator_,
1100 number_of_arguments,
1101 return_type,
1102 dex_pc,
Andra Danciua0130e82020-07-23 12:34:56 +00001103 method_idx,
1104 resolved_method);
Andreas Gampe3db70682018-12-26 15:12:03 -08001105 return HandleInvoke(invoke, operands, shorty, /* is_unresolved= */ false);
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001106}
1107
1108
1109bool HInstructionBuilder::BuildInvokeCustom(uint32_t dex_pc,
1110 uint32_t call_site_idx,
1111 const InstructionOperands& operands) {
1112 dex::ProtoIndex proto_idx = dex_file_->GetProtoIndexForCallSite(call_site_idx);
1113 const char* shorty = dex_file_->GetShorty(proto_idx);
1114 DataType::Type return_type = DataType::FromShorty(shorty[0]);
1115 size_t number_of_arguments = strlen(shorty) - 1;
1116 HInvoke* invoke = new (allocator_) HInvokeCustom(allocator_,
1117 number_of_arguments,
1118 call_site_idx,
1119 return_type,
1120 dex_pc);
Andreas Gampe3db70682018-12-26 15:12:03 -08001121 return HandleInvoke(invoke, operands, shorty, /* is_unresolved= */ false);
Orion Hodsonac141392017-01-13 11:53:47 +00001122}
1123
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001124HNewInstance* HInstructionBuilder::BuildNewInstance(dex::TypeIndex type_index, uint32_t dex_pc) {
Vladimir Marko3cd50df2016-04-13 19:29:26 +01001125 ScopedObjectAccess soa(Thread::Current());
David Brazdildee58d62016-04-07 09:54:26 +00001126
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001127 HLoadClass* load_class = BuildLoadClass(type_index, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001128
David Brazdildee58d62016-04-07 09:54:26 +00001129 HInstruction* cls = load_class;
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001130 Handle<mirror::Class> klass = load_class->GetClass();
1131
Vladimir Marko2f40d242020-04-08 12:56:45 +01001132 if (!IsInitialized(klass.Get())) {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001133 cls = new (allocator_) HClinitCheck(load_class, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001134 AppendInstruction(cls);
1135 }
1136
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001137 // Only the access check entrypoint handles the finalizable class case. If we
1138 // need access checks, then we haven't resolved the method and the class may
1139 // again be finalizable.
1140 QuickEntrypointEnum entrypoint = kQuickAllocObjectInitialized;
1141 if (load_class->NeedsAccessCheck() || klass->IsFinalizable() || !klass->IsInstantiable()) {
1142 entrypoint = kQuickAllocObjectWithChecks;
1143 }
Alex Lightd109e302018-06-27 10:25:41 -07001144 // We will always be able to resolve the string class since it is in the BCP.
1145 if (!klass.IsNull() && klass->IsStringClass()) {
1146 entrypoint = kQuickAllocStringObject;
1147 }
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001148
1149 // Consider classes we haven't resolved as potentially finalizable.
Andreas Gampefa4333d2017-02-14 11:10:34 -08001150 bool finalizable = (klass == nullptr) || klass->IsFinalizable();
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001151
Vladimir Markoca6fff82017-10-03 14:49:14 +01001152 HNewInstance* new_instance = new (allocator_) HNewInstance(
David Brazdildee58d62016-04-07 09:54:26 +00001153 cls,
David Brazdildee58d62016-04-07 09:54:26 +00001154 dex_pc,
1155 type_index,
1156 *dex_compilation_unit_->GetDexFile(),
David Brazdildee58d62016-04-07 09:54:26 +00001157 finalizable,
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001158 entrypoint);
1159 AppendInstruction(new_instance);
1160
1161 return new_instance;
1162}
1163
1164void HInstructionBuilder::BuildConstructorFenceForAllocation(HInstruction* allocation) {
1165 DCHECK(allocation != nullptr &&
George Burgess IVf2072992017-05-23 15:36:41 -07001166 (allocation->IsNewInstance() ||
1167 allocation->IsNewArray())); // corresponding to "new" keyword in JLS.
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001168
1169 if (allocation->IsNewInstance()) {
1170 // STRING SPECIAL HANDLING:
1171 // -------------------------------
1172 // Strings have a real HNewInstance node but they end up always having 0 uses.
1173 // All uses of a String HNewInstance are always transformed to replace their input
1174 // of the HNewInstance with an input of the invoke to StringFactory.
1175 //
1176 // Do not emit an HConstructorFence here since it can inhibit some String new-instance
1177 // optimizations (to pass checker tests that rely on those optimizations).
1178 HNewInstance* new_inst = allocation->AsNewInstance();
1179 HLoadClass* load_class = new_inst->GetLoadClass();
1180
1181 Thread* self = Thread::Current();
1182 ScopedObjectAccess soa(self);
1183 StackHandleScope<1> hs(self);
1184 Handle<mirror::Class> klass = load_class->GetClass();
1185 if (klass != nullptr && klass->IsStringClass()) {
1186 return;
1187 // Note: Do not use allocation->IsStringAlloc which requires
1188 // a valid ReferenceTypeInfo, but that doesn't get made until after reference type
1189 // propagation (and instruction builder is too early).
1190 }
1191 // (In terms of correctness, the StringFactory needs to provide its own
1192 // default initialization barrier, see below.)
1193 }
1194
1195 // JLS 17.4.5 "Happens-before Order" describes:
1196 //
1197 // The default initialization of any object happens-before any other actions (other than
1198 // default-writes) of a program.
1199 //
1200 // In our implementation the default initialization of an object to type T means
1201 // setting all of its initial data (object[0..size)) to 0, and setting the
1202 // object's class header (i.e. object.getClass() == T.class).
1203 //
1204 // In practice this fence ensures that the writes to the object header
1205 // are visible to other threads if this object escapes the current thread.
1206 // (and in theory the 0-initializing, but that happens automatically
1207 // when new memory pages are mapped in by the OS).
1208 HConstructorFence* ctor_fence =
Vladimir Markoca6fff82017-10-03 14:49:14 +01001209 new (allocator_) HConstructorFence(allocation, allocation->GetDexPc(), allocator_);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001210 AppendInstruction(ctor_fence);
Igor Murashkin6ef45672017-08-08 13:59:55 -07001211 MaybeRecordStat(
1212 compilation_stats_,
1213 MethodCompilationStat::kConstructorFenceGeneratedNew);
David Brazdildee58d62016-04-07 09:54:26 +00001214}
1215
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001216static bool IsInBootImage(ObjPtr<mirror::Class> cls, const CompilerOptions& compiler_options)
1217 REQUIRES_SHARED(Locks::mutator_lock_) {
Vladimir Marko6a67bea2020-01-20 13:05:55 +00001218 if (Runtime::Current()->GetHeap()->ObjectIsInBootImageSpace(cls)) {
1219 return true;
1220 }
1221 if (compiler_options.IsBootImage() || compiler_options.IsBootImageExtension()) {
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001222 std::string temp;
1223 const char* descriptor = cls->GetDescriptor(&temp);
1224 return compiler_options.IsImageClass(descriptor);
1225 } else {
Vladimir Marko6a67bea2020-01-20 13:05:55 +00001226 return false;
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001227 }
1228}
1229
1230static bool IsSubClass(ObjPtr<mirror::Class> to_test, ObjPtr<mirror::Class> super_class)
1231 REQUIRES_SHARED(Locks::mutator_lock_) {
1232 return to_test != nullptr && !to_test->IsInterface() && to_test->IsSubClass(super_class);
1233}
1234
1235static bool HasTrivialClinit(ObjPtr<mirror::Class> klass, PointerSize pointer_size)
1236 REQUIRES_SHARED(Locks::mutator_lock_) {
1237 // Check if the class has encoded fields that trigger bytecode execution.
1238 // (Encoded fields are just a different representation of <clinit>.)
1239 if (klass->NumStaticFields() != 0u) {
1240 DCHECK(klass->GetClassDef() != nullptr);
1241 EncodedStaticFieldValueIterator it(klass->GetDexFile(), *klass->GetClassDef());
1242 for (; it.HasNext(); it.Next()) {
1243 switch (it.GetValueType()) {
1244 case EncodedArrayValueIterator::ValueType::kBoolean:
1245 case EncodedArrayValueIterator::ValueType::kByte:
1246 case EncodedArrayValueIterator::ValueType::kShort:
1247 case EncodedArrayValueIterator::ValueType::kChar:
1248 case EncodedArrayValueIterator::ValueType::kInt:
1249 case EncodedArrayValueIterator::ValueType::kLong:
1250 case EncodedArrayValueIterator::ValueType::kFloat:
1251 case EncodedArrayValueIterator::ValueType::kDouble:
1252 case EncodedArrayValueIterator::ValueType::kNull:
1253 case EncodedArrayValueIterator::ValueType::kString:
1254 // Primitive, null or j.l.String initialization is permitted.
1255 break;
1256 case EncodedArrayValueIterator::ValueType::kType:
1257 // Type initialization can load classes and execute bytecode through a class loader
1258 // which can execute arbitrary bytecode. We do not optimize for known class loaders;
1259 // kType is rarely used (if ever).
1260 return false;
1261 default:
1262 // Other types in the encoded static field list are rejected by the DexFileVerifier.
1263 LOG(FATAL) << "Unexpected type " << it.GetValueType();
1264 UNREACHABLE();
1265 }
1266 }
1267 }
1268 // Check if the class has <clinit> that executes arbitrary code.
1269 // Initialization of static fields of the class itself with constants is allowed.
1270 ArtMethod* clinit = klass->FindClassInitializer(pointer_size);
1271 if (clinit != nullptr) {
1272 const DexFile& dex_file = *clinit->GetDexFile();
1273 CodeItemInstructionAccessor accessor(dex_file, clinit->GetCodeItem());
1274 for (DexInstructionPcPair it : accessor) {
1275 switch (it->Opcode()) {
1276 case Instruction::CONST_4:
1277 case Instruction::CONST_16:
1278 case Instruction::CONST:
1279 case Instruction::CONST_HIGH16:
1280 case Instruction::CONST_WIDE_16:
1281 case Instruction::CONST_WIDE_32:
1282 case Instruction::CONST_WIDE:
1283 case Instruction::CONST_WIDE_HIGH16:
1284 case Instruction::CONST_STRING:
1285 case Instruction::CONST_STRING_JUMBO:
1286 // Primitive, null or j.l.String initialization is permitted.
1287 break;
1288 case Instruction::RETURN_VOID:
1289 case Instruction::RETURN_VOID_NO_BARRIER:
1290 break;
1291 case Instruction::SPUT:
1292 case Instruction::SPUT_WIDE:
1293 case Instruction::SPUT_OBJECT:
1294 case Instruction::SPUT_BOOLEAN:
1295 case Instruction::SPUT_BYTE:
1296 case Instruction::SPUT_CHAR:
1297 case Instruction::SPUT_SHORT:
1298 // Only initialization of a static field of the same class is permitted.
1299 if (dex_file.GetFieldId(it->VRegB_21c()).class_idx_ != klass->GetDexTypeIndex()) {
1300 return false;
1301 }
1302 break;
1303 case Instruction::NEW_ARRAY:
1304 // Only primitive arrays are permitted.
1305 if (Primitive::GetType(dex_file.GetTypeDescriptor(dex_file.GetTypeId(
1306 dex::TypeIndex(it->VRegC_22c())))[1]) == Primitive::kPrimNot) {
1307 return false;
1308 }
1309 break;
1310 case Instruction::APUT:
1311 case Instruction::APUT_WIDE:
1312 case Instruction::APUT_BOOLEAN:
1313 case Instruction::APUT_BYTE:
1314 case Instruction::APUT_CHAR:
1315 case Instruction::APUT_SHORT:
1316 case Instruction::FILL_ARRAY_DATA:
1317 case Instruction::NOP:
1318 // Allow initialization of primitive arrays (only constants can be stored).
1319 // Note: We expect NOPs used for fill-array-data-payload but accept all NOPs
1320 // (even unreferenced switch payloads if they make it through the verifier).
1321 break;
1322 default:
1323 return false;
1324 }
1325 }
1326 }
1327 return true;
1328}
1329
1330static bool HasTrivialInitialization(ObjPtr<mirror::Class> cls,
1331 const CompilerOptions& compiler_options)
1332 REQUIRES_SHARED(Locks::mutator_lock_) {
1333 Runtime* runtime = Runtime::Current();
1334 PointerSize pointer_size = runtime->GetClassLinker()->GetImagePointerSize();
1335
1336 // Check the superclass chain.
1337 for (ObjPtr<mirror::Class> klass = cls; klass != nullptr; klass = klass->GetSuperClass()) {
1338 if (klass->IsInitialized() && IsInBootImage(klass, compiler_options)) {
1339 break; // `klass` and its superclasses are already initialized in the boot image.
1340 }
1341 if (!HasTrivialClinit(klass, pointer_size)) {
1342 return false;
1343 }
1344 }
1345
1346 // Also check interfaces with default methods as they need to be initialized as well.
1347 ObjPtr<mirror::IfTable> iftable = cls->GetIfTable();
1348 DCHECK(iftable != nullptr);
1349 for (int32_t i = 0, count = iftable->Count(); i != count; ++i) {
1350 ObjPtr<mirror::Class> iface = iftable->GetInterface(i);
1351 if (!iface->HasDefaultMethods()) {
1352 continue; // Initializing `cls` does not initialize this interface.
1353 }
1354 if (iface->IsInitialized() && IsInBootImage(iface, compiler_options)) {
1355 continue; // This interface is already initialized in the boot image.
1356 }
1357 if (!HasTrivialClinit(iface, pointer_size)) {
1358 return false;
1359 }
1360 }
1361 return true;
1362}
1363
Vladimir Marko2f40d242020-04-08 12:56:45 +01001364bool HInstructionBuilder::IsInitialized(ObjPtr<mirror::Class> cls) const {
Andreas Gampefa4333d2017-02-14 11:10:34 -08001365 if (cls == nullptr) {
David Brazdildee58d62016-04-07 09:54:26 +00001366 return false;
1367 }
1368
Vladimir Marko51b8aaf2017-06-09 15:17:05 +01001369 // Check if the class will be initialized at runtime.
1370 if (cls->IsInitialized()) {
Vladimir Marko695348f2020-05-19 14:42:02 +01001371 const CompilerOptions& compiler_options = code_generator_->GetCompilerOptions();
1372 if (compiler_options.IsAotCompiler()) {
Nicolas Geoffraya48c3df2019-06-27 13:11:12 +00001373 // Assume loaded only if klass is in the boot image. App classes cannot be assumed
1374 // loaded because we don't even know what class loader will be used to load them.
Vladimir Marko695348f2020-05-19 14:42:02 +01001375 if (IsInBootImage(cls, compiler_options)) {
Nicolas Geoffraya48c3df2019-06-27 13:11:12 +00001376 return true;
1377 }
1378 } else {
Vladimir Marko695348f2020-05-19 14:42:02 +01001379 DCHECK(compiler_options.IsJitCompiler());
Nicolas Geoffraya48c3df2019-06-27 13:11:12 +00001380 if (Runtime::Current()->GetJit()->CanAssumeInitialized(
Vladimir Marko2f40d242020-04-08 12:56:45 +01001381 cls,
Vladimir Marko695348f2020-05-19 14:42:02 +01001382 compiler_options.IsJitCompilerForSharedCode())) {
Nicolas Geoffraya48c3df2019-06-27 13:11:12 +00001383 // For JIT, the class cannot revert to an uninitialized state.
1384 return true;
1385 }
Vladimir Marko51b8aaf2017-06-09 15:17:05 +01001386 }
1387 }
1388
Vladimir Marko7f260d42018-10-30 18:09:55 +00001389 // We can avoid the class initialization check for `cls` in static methods and constructors
1390 // in the very same class; invoking a static method involves a class initialization check
1391 // and so does the instance allocation that must be executed before invoking a constructor.
1392 // Other instance methods of the same class can run on an escaped instance
Vladimir Marko51b8aaf2017-06-09 15:17:05 +01001393 // of an erroneous class. Even a superclass may need to be checked as the subclass
1394 // can be completely initialized while the superclass is initializing and the subclass
1395 // remains initialized when the superclass initializer throws afterwards. b/62478025
1396 // Note: The HClinitCheck+HInvokeStaticOrDirect merging can still apply.
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001397 auto is_static_method_or_constructor_of_cls = [cls](const DexCompilationUnit& compilation_unit)
1398 REQUIRES_SHARED(Locks::mutator_lock_) {
1399 return (compilation_unit.GetAccessFlags() & (kAccStatic | kAccConstructor)) != 0u &&
Vladimir Marko2f40d242020-04-08 12:56:45 +01001400 compilation_unit.GetCompilingClass().Get() == cls;
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001401 };
1402 if (is_static_method_or_constructor_of_cls(*outer_compilation_unit_) ||
1403 // Check also the innermost method. Though excessive copies of ClinitCheck can be
1404 // eliminated by GVN, that happens only after the decision whether to inline the
1405 // graph or not and that may depend on the presence of the ClinitCheck.
1406 // TODO: We should walk over the entire inlined method chain, but we don't pass that
1407 // information to the builder.
1408 is_static_method_or_constructor_of_cls(*dex_compilation_unit_)) {
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001409 return true;
1410 }
David Brazdildee58d62016-04-07 09:54:26 +00001411
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001412 // Otherwise, we may be able to avoid the check if `cls` is a superclass of a method being
1413 // compiled here (anywhere in the inlining chain) as the `cls` must have started initializing
1414 // before calling any `cls` or subclass methods. Static methods require a clinit check and
1415 // instance methods require an instance which cannot be created before doing a clinit check.
1416 // When a subclass of `cls` starts initializing, it starts initializing its superclass
1417 // chain up to `cls` without running any bytecode, i.e. without any opportunity for circular
1418 // initialization weirdness.
1419 //
1420 // If the initialization of `cls` is trivial (`cls` and its superclasses and superinterfaces
1421 // with default methods initialize only their own static fields using constant values), it must
1422 // complete, either successfully or by throwing and marking `cls` erroneous, without allocating
1423 // any instances of `cls` or subclasses (or any other class) and without calling any methods.
1424 // If it completes by throwing, no instances of `cls` shall be created and no subclass method
1425 // bytecode shall execute (see above), therefore the instruction we're building shall be
1426 // unreachable. By reaching the instruction, we know that `cls` was initialized successfully.
1427 //
1428 // TODO: We should walk over the entire inlined methods chain, but we don't pass that
1429 // information to the builder. (We could also check if we're guaranteed a non-null instance
1430 // of `cls` at this location but that's outside the scope of the instruction builder.)
Vladimir Marko2f40d242020-04-08 12:56:45 +01001431 bool is_subclass = IsSubClass(outer_compilation_unit_->GetCompilingClass().Get(), cls);
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001432 if (dex_compilation_unit_ != outer_compilation_unit_) {
1433 is_subclass = is_subclass ||
Vladimir Marko2f40d242020-04-08 12:56:45 +01001434 IsSubClass(dex_compilation_unit_->GetCompilingClass().Get(), cls);
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001435 }
Vladimir Marko2f40d242020-04-08 12:56:45 +01001436 if (is_subclass && HasTrivialInitialization(cls, code_generator_->GetCompilerOptions())) {
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001437 return true;
1438 }
David Brazdildee58d62016-04-07 09:54:26 +00001439
1440 return false;
1441}
1442
1443HClinitCheck* HInstructionBuilder::ProcessClinitCheckForInvoke(
Vladimir Markofca0b492018-07-23 15:30:52 +01001444 uint32_t dex_pc,
1445 ArtMethod* resolved_method,
1446 HInvokeStaticOrDirect::ClinitCheckRequirement* clinit_check_requirement) {
Vladimir Marko2f40d242020-04-08 12:56:45 +01001447 ScopedObjectAccess soa(Thread::Current());
1448 ObjPtr<mirror::Class> klass = resolved_method->GetDeclaringClass();
David Brazdildee58d62016-04-07 09:54:26 +00001449
1450 HClinitCheck* clinit_check = nullptr;
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001451 if (IsInitialized(klass)) {
David Brazdildee58d62016-04-07 09:54:26 +00001452 *clinit_check_requirement = HInvokeStaticOrDirect::ClinitCheckRequirement::kNone;
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001453 } else {
Vladimir Marko02ca05a2020-05-12 13:58:51 +01001454 Handle<mirror::Class> h_klass = graph_->GetHandleCache()->NewHandle(klass);
Vladimir Marko2f40d242020-04-08 12:56:45 +01001455 HLoadClass* cls = BuildLoadClass(h_klass->GetDexTypeIndex(),
1456 h_klass->GetDexFile(),
1457 h_klass,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001458 dex_pc,
Andreas Gampe3db70682018-12-26 15:12:03 -08001459 /* needs_access_check= */ false);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001460 if (cls != nullptr) {
1461 *clinit_check_requirement = HInvokeStaticOrDirect::ClinitCheckRequirement::kExplicit;
Vladimir Markoca6fff82017-10-03 14:49:14 +01001462 clinit_check = new (allocator_) HClinitCheck(cls, dex_pc);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001463 AppendInstruction(clinit_check);
Vladimir Marko2f40d242020-04-08 12:56:45 +01001464 } else {
1465 // Let the invoke handle this with an implicit class initialization check.
1466 *clinit_check_requirement = HInvokeStaticOrDirect::ClinitCheckRequirement::kImplicit;
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001467 }
David Brazdildee58d62016-04-07 09:54:26 +00001468 }
1469 return clinit_check;
1470}
1471
Vladimir Marko5f846072020-04-09 13:20:11 +01001472bool HInstructionBuilder::SetupInvokeArguments(HInstruction* invoke,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001473 const InstructionOperands& operands,
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001474 const char* shorty,
Vladimir Marko5f846072020-04-09 13:20:11 +01001475 ReceiverArg receiver_arg) {
1476 // Note: The `invoke` can be an intrinsic replacement, so not necessaritly HInvoke.
1477 // In that case, do not log errors, they shall be reported when we try to build the HInvoke.
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001478 uint32_t shorty_index = 1; // Skip the return type.
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001479 const size_t number_of_operands = operands.GetNumberOfOperands();
Vladimir Marko5f846072020-04-09 13:20:11 +01001480 bool argument_length_error = false;
1481
1482 size_t start_index = 0u;
1483 size_t argument_index = 0u;
1484 if (receiver_arg != ReceiverArg::kNone) {
1485 if (number_of_operands == 0u) {
1486 argument_length_error = true;
1487 } else {
1488 start_index = 1u;
1489 if (receiver_arg != ReceiverArg::kIgnored) {
1490 uint32_t obj_reg = operands.GetOperand(0u);
1491 HInstruction* arg = (receiver_arg == ReceiverArg::kPlainArg)
1492 ? LoadLocal(obj_reg, DataType::Type::kReference)
1493 : LoadNullCheckedLocal(obj_reg, invoke->GetDexPc());
1494 if (receiver_arg != ReceiverArg::kNullCheckedOnly) {
1495 invoke->SetRawInputAt(0u, arg);
1496 argument_index = 1u;
1497 }
1498 }
1499 }
1500 }
1501
1502 for (size_t i = start_index; i < number_of_operands; ++i, ++argument_index) {
1503 // Make sure we don't go over the expected arguments or over the number of
1504 // dex registers given. If the instruction was seen as dead by the verifier,
1505 // it hasn't been properly checked.
1506 if (UNLIKELY(shorty[shorty_index] == 0)) {
1507 argument_length_error = true;
1508 break;
1509 }
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001510 DataType::Type type = DataType::FromShorty(shorty[shorty_index++]);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001511 bool is_wide = (type == DataType::Type::kInt64) || (type == DataType::Type::kFloat64);
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001512 if (is_wide && ((i + 1 == number_of_operands) ||
1513 (operands.GetOperand(i) + 1 != operands.GetOperand(i + 1)))) {
Vladimir Marko5f846072020-04-09 13:20:11 +01001514 if (invoke->IsInvoke()) {
1515 // Longs and doubles should be in pairs, that is, sequential registers. The verifier should
1516 // reject any class where this is violated. However, the verifier only does these checks
1517 // on non trivially dead instructions, so we just bailout the compilation.
1518 VLOG(compiler) << "Did not compile "
1519 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
1520 << " because of non-sequential dex register pair in wide argument";
1521 MaybeRecordStat(compilation_stats_,
1522 MethodCompilationStat::kNotCompiledMalformedOpcode);
1523 }
David Brazdildee58d62016-04-07 09:54:26 +00001524 return false;
1525 }
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001526 HInstruction* arg = LoadLocal(operands.GetOperand(i), type);
Vladimir Marko5f846072020-04-09 13:20:11 +01001527 DCHECK(invoke->InputAt(argument_index) == nullptr);
1528 invoke->SetRawInputAt(argument_index, arg);
David Brazdildee58d62016-04-07 09:54:26 +00001529 if (is_wide) {
Vladimir Marko5f846072020-04-09 13:20:11 +01001530 ++i;
David Brazdildee58d62016-04-07 09:54:26 +00001531 }
1532 }
1533
Vladimir Marko5f846072020-04-09 13:20:11 +01001534 argument_length_error = argument_length_error || shorty[shorty_index] != 0;
1535 if (argument_length_error) {
1536 if (invoke->IsInvoke()) {
1537 VLOG(compiler) << "Did not compile "
1538 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
1539 << " because of wrong number of arguments in invoke instruction";
1540 MaybeRecordStat(compilation_stats_,
1541 MethodCompilationStat::kNotCompiledMalformedOpcode);
1542 }
David Brazdildee58d62016-04-07 09:54:26 +00001543 return false;
1544 }
1545
1546 if (invoke->IsInvokeStaticOrDirect() &&
1547 HInvokeStaticOrDirect::NeedsCurrentMethodInput(
Vladimir Marko86c87522020-05-11 16:55:55 +01001548 invoke->AsInvokeStaticOrDirect()->GetDispatchInfo())) {
1549 DCHECK_EQ(argument_index, invoke->AsInvokeStaticOrDirect()->GetCurrentMethodIndex());
Vladimir Marko5f846072020-04-09 13:20:11 +01001550 DCHECK(invoke->InputAt(argument_index) == nullptr);
1551 invoke->SetRawInputAt(argument_index, graph_->GetCurrentMethod());
David Brazdildee58d62016-04-07 09:54:26 +00001552 }
1553
1554 return true;
1555}
1556
1557bool HInstructionBuilder::HandleInvoke(HInvoke* invoke,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001558 const InstructionOperands& operands,
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001559 const char* shorty,
Vladimir Marko5f846072020-04-09 13:20:11 +01001560 bool is_unresolved) {
David Brazdildee58d62016-04-07 09:54:26 +00001561 DCHECK(!invoke->IsInvokeStaticOrDirect() || !invoke->AsInvokeStaticOrDirect()->IsStringInit());
1562
Vladimir Marko5f846072020-04-09 13:20:11 +01001563 ReceiverArg receiver_arg = (invoke->GetInvokeType() == InvokeType::kStatic)
1564 ? ReceiverArg::kNone
1565 : (is_unresolved ? ReceiverArg::kPlainArg : ReceiverArg::kNullCheckedArg);
1566 if (!SetupInvokeArguments(invoke, operands, shorty, receiver_arg)) {
David Brazdildee58d62016-04-07 09:54:26 +00001567 return false;
1568 }
1569
David Brazdildee58d62016-04-07 09:54:26 +00001570 AppendInstruction(invoke);
1571 latest_result_ = invoke;
1572
1573 return true;
1574}
1575
Vladimir Marko5f846072020-04-09 13:20:11 +01001576bool HInstructionBuilder::BuildSimpleIntrinsic(ArtMethod* method,
1577 uint32_t dex_pc,
1578 const InstructionOperands& operands,
1579 const char* shorty) {
1580 Intrinsics intrinsic = static_cast<Intrinsics>(method->GetIntrinsic());
1581 DCHECK_NE(intrinsic, Intrinsics::kNone);
1582 constexpr DataType::Type kInt32 = DataType::Type::kInt32;
1583 constexpr DataType::Type kInt64 = DataType::Type::kInt64;
1584 constexpr DataType::Type kFloat32 = DataType::Type::kFloat32;
1585 constexpr DataType::Type kFloat64 = DataType::Type::kFloat64;
1586 ReceiverArg receiver_arg = method->IsStatic() ? ReceiverArg::kNone : ReceiverArg::kNullCheckedArg;
1587 HInstruction* instruction = nullptr;
1588 switch (intrinsic) {
1589 case Intrinsics::kIntegerRotateRight:
1590 case Intrinsics::kIntegerRotateLeft:
1591 // For rotate left, we negate the distance below.
1592 instruction = new (allocator_) HRor(kInt32, /*value=*/ nullptr, /*distance=*/ nullptr);
1593 break;
1594 case Intrinsics::kLongRotateRight:
1595 case Intrinsics::kLongRotateLeft:
1596 // For rotate left, we negate the distance below.
1597 instruction = new (allocator_) HRor(kInt64, /*value=*/ nullptr, /*distance=*/ nullptr);
1598 break;
1599 case Intrinsics::kIntegerCompare:
1600 instruction = new (allocator_) HCompare(
1601 kInt32, /*first=*/ nullptr, /*second=*/ nullptr, ComparisonBias::kNoBias, dex_pc);
1602 break;
1603 case Intrinsics::kLongCompare:
1604 instruction = new (allocator_) HCompare(
1605 kInt64, /*first=*/ nullptr, /*second=*/ nullptr, ComparisonBias::kNoBias, dex_pc);
1606 break;
1607 case Intrinsics::kIntegerSignum:
1608 instruction = new (allocator_) HCompare(
1609 kInt32, /*first=*/ nullptr, graph_->GetIntConstant(0), ComparisonBias::kNoBias, dex_pc);
1610 break;
1611 case Intrinsics::kLongSignum:
1612 instruction = new (allocator_) HCompare(
1613 kInt64, /*first=*/ nullptr, graph_->GetLongConstant(0), ComparisonBias::kNoBias, dex_pc);
1614 break;
1615 case Intrinsics::kFloatIsNaN:
1616 case Intrinsics::kDoubleIsNaN: {
1617 // IsNaN(x) is the same as x != x.
1618 instruction = new (allocator_) HNotEqual(/*first=*/ nullptr, /*second=*/ nullptr, dex_pc);
1619 instruction->AsCondition()->SetBias(ComparisonBias::kLtBias);
1620 break;
1621 }
1622 case Intrinsics::kStringCharAt:
1623 // We treat String as an array to allow DCE and BCE to seamlessly work on strings.
1624 instruction = new (allocator_) HArrayGet(/*array=*/ nullptr,
1625 /*index=*/ nullptr,
1626 DataType::Type::kUint16,
1627 SideEffects::None(), // Strings are immutable.
1628 dex_pc,
1629 /*is_string_char_at=*/ true);
1630 break;
1631 case Intrinsics::kStringIsEmpty:
1632 case Intrinsics::kStringLength:
1633 // We treat String as an array to allow DCE and BCE to seamlessly work on strings.
1634 // For String.isEmpty(), we add a comparison with 0 below.
1635 instruction =
1636 new (allocator_) HArrayLength(/*array=*/ nullptr, dex_pc, /* is_string_length= */ true);
1637 break;
1638 case Intrinsics::kUnsafeLoadFence:
1639 receiver_arg = ReceiverArg::kNullCheckedOnly;
1640 instruction = new (allocator_) HMemoryBarrier(MemBarrierKind::kLoadAny, dex_pc);
1641 break;
1642 case Intrinsics::kUnsafeStoreFence:
1643 receiver_arg = ReceiverArg::kNullCheckedOnly;
1644 instruction = new (allocator_) HMemoryBarrier(MemBarrierKind::kAnyStore, dex_pc);
1645 break;
1646 case Intrinsics::kUnsafeFullFence:
1647 receiver_arg = ReceiverArg::kNullCheckedOnly;
1648 instruction = new (allocator_) HMemoryBarrier(MemBarrierKind::kAnyAny, dex_pc);
1649 break;
1650 case Intrinsics::kVarHandleFullFence:
1651 instruction = new (allocator_) HMemoryBarrier(MemBarrierKind::kAnyAny, dex_pc);
1652 break;
1653 case Intrinsics::kVarHandleAcquireFence:
1654 instruction = new (allocator_) HMemoryBarrier(MemBarrierKind::kLoadAny, dex_pc);
1655 break;
1656 case Intrinsics::kVarHandleReleaseFence:
1657 instruction = new (allocator_) HMemoryBarrier(MemBarrierKind::kAnyStore, dex_pc);
1658 break;
1659 case Intrinsics::kVarHandleLoadLoadFence:
1660 instruction = new (allocator_) HMemoryBarrier(MemBarrierKind::kLoadAny, dex_pc);
1661 break;
1662 case Intrinsics::kVarHandleStoreStoreFence:
1663 instruction = new (allocator_) HMemoryBarrier(MemBarrierKind::kStoreStore, dex_pc);
1664 break;
1665 case Intrinsics::kMathMinIntInt:
1666 instruction = new (allocator_) HMin(kInt32, /*left=*/ nullptr, /*right=*/ nullptr, dex_pc);
1667 break;
1668 case Intrinsics::kMathMinLongLong:
1669 instruction = new (allocator_) HMin(kInt64, /*left=*/ nullptr, /*right=*/ nullptr, dex_pc);
1670 break;
1671 case Intrinsics::kMathMinFloatFloat:
1672 instruction = new (allocator_) HMin(kFloat32, /*left=*/ nullptr, /*right=*/ nullptr, dex_pc);
1673 break;
1674 case Intrinsics::kMathMinDoubleDouble:
1675 instruction = new (allocator_) HMin(kFloat64, /*left=*/ nullptr, /*right=*/ nullptr, dex_pc);
1676 break;
1677 case Intrinsics::kMathMaxIntInt:
1678 instruction = new (allocator_) HMax(kInt32, /*left=*/ nullptr, /*right=*/ nullptr, dex_pc);
1679 break;
1680 case Intrinsics::kMathMaxLongLong:
1681 instruction = new (allocator_) HMax(kInt64, /*left=*/ nullptr, /*right=*/ nullptr, dex_pc);
1682 break;
1683 case Intrinsics::kMathMaxFloatFloat:
1684 instruction = new (allocator_) HMax(kFloat32, /*left=*/ nullptr, /*right=*/ nullptr, dex_pc);
1685 break;
1686 case Intrinsics::kMathMaxDoubleDouble:
1687 instruction = new (allocator_) HMax(kFloat64, /*left=*/ nullptr, /*right=*/ nullptr, dex_pc);
1688 break;
1689 case Intrinsics::kMathAbsInt:
1690 instruction = new (allocator_) HAbs(kInt32, /*input=*/ nullptr, dex_pc);
1691 break;
1692 case Intrinsics::kMathAbsLong:
1693 instruction = new (allocator_) HAbs(kInt64, /*input=*/ nullptr, dex_pc);
1694 break;
1695 case Intrinsics::kMathAbsFloat:
1696 instruction = new (allocator_) HAbs(kFloat32, /*input=*/ nullptr, dex_pc);
1697 break;
1698 case Intrinsics::kMathAbsDouble:
1699 instruction = new (allocator_) HAbs(kFloat64, /*input=*/ nullptr, dex_pc);
1700 break;
1701 default:
1702 // We do not have intermediate representation for other intrinsics.
1703 return false;
1704 }
1705 DCHECK(instruction != nullptr);
1706 if (!SetupInvokeArguments(instruction, operands, shorty, receiver_arg)) {
1707 return false;
1708 }
1709
1710 switch (intrinsic) {
1711 case Intrinsics::kIntegerRotateLeft:
1712 case Intrinsics::kLongRotateLeft: {
1713 // Negate the distance value for rotate left.
1714 DCHECK(instruction->IsRor());
1715 HNeg* neg = new (allocator_) HNeg(kInt32, instruction->InputAt(1u));
1716 AppendInstruction(neg);
1717 instruction->SetRawInputAt(1u, neg);
1718 break;
1719 }
1720 case Intrinsics::kFloatIsNaN:
1721 case Intrinsics::kDoubleIsNaN:
1722 // Set the second input to be the same as first.
1723 DCHECK(instruction->IsNotEqual());
1724 DCHECK(instruction->InputAt(1u) == nullptr);
1725 instruction->SetRawInputAt(1u, instruction->InputAt(0u));
1726 break;
1727 case Intrinsics::kStringCharAt: {
1728 // Add bounds check.
1729 HInstruction* array = instruction->InputAt(0u);
1730 HInstruction* index = instruction->InputAt(1u);
1731 HInstruction* length =
1732 new (allocator_) HArrayLength(array, dex_pc, /*is_string_length=*/ true);
1733 AppendInstruction(length);
1734 HBoundsCheck* bounds_check =
1735 new (allocator_) HBoundsCheck(index, length, dex_pc, /*is_string_char_at=*/ true);
1736 AppendInstruction(bounds_check);
1737 graph_->SetHasBoundsChecks(true);
1738 instruction->SetRawInputAt(1u, bounds_check);
1739 break;
1740 }
1741 case Intrinsics::kStringIsEmpty: {
1742 // Compare the length with 0.
1743 DCHECK(instruction->IsArrayLength());
1744 AppendInstruction(instruction);
1745 HEqual* equal = new (allocator_) HEqual(instruction, graph_->GetIntConstant(0), dex_pc);
1746 instruction = equal;
1747 break;
1748 }
1749 default:
1750 break;
1751 }
1752
1753 AppendInstruction(instruction);
1754 latest_result_ = instruction;
1755
1756 return true;
1757}
1758
David Brazdildee58d62016-04-07 09:54:26 +00001759bool HInstructionBuilder::HandleStringInit(HInvoke* invoke,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001760 const InstructionOperands& operands,
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001761 const char* shorty) {
David Brazdildee58d62016-04-07 09:54:26 +00001762 DCHECK(invoke->IsInvokeStaticOrDirect());
1763 DCHECK(invoke->AsInvokeStaticOrDirect()->IsStringInit());
1764
Vladimir Marko5f846072020-04-09 13:20:11 +01001765 if (!SetupInvokeArguments(invoke, operands, shorty, ReceiverArg::kIgnored)) {
David Brazdildee58d62016-04-07 09:54:26 +00001766 return false;
1767 }
1768
1769 AppendInstruction(invoke);
1770
1771 // This is a StringFactory call, not an actual String constructor. Its result
1772 // replaces the empty String pre-allocated by NewInstance.
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001773 uint32_t orig_this_reg = operands.GetOperand(0);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001774 HInstruction* arg_this = LoadLocal(orig_this_reg, DataType::Type::kReference);
David Brazdildee58d62016-04-07 09:54:26 +00001775
1776 // Replacing the NewInstance might render it redundant. Keep a list of these
Nicolas Geoffray8a62a4c2018-07-03 09:39:07 +01001777 // to be visited once it is clear whether it has remaining uses.
David Brazdildee58d62016-04-07 09:54:26 +00001778 if (arg_this->IsNewInstance()) {
1779 ssa_builder_->AddUninitializedString(arg_this->AsNewInstance());
Nicolas Geoffray8a62a4c2018-07-03 09:39:07 +01001780 } else {
1781 DCHECK(arg_this->IsPhi());
1782 // We can get a phi as input of a String.<init> if there is a loop between the
1783 // allocation and the String.<init> call. As we don't know which other phis might alias
Nicolas Geoffray0846a8f2018-09-12 15:21:07 +01001784 // with `arg_this`, we keep a record of those invocations so we can later replace
1785 // the allocation with the invocation.
1786 // Add the actual 'this' input so the analysis knows what is the allocation instruction.
1787 // The input will be removed during the analysis.
1788 invoke->AddInput(arg_this);
1789 ssa_builder_->AddUninitializedStringPhi(invoke);
1790 }
1791 // Walk over all vregs and replace any occurrence of `arg_this` with `invoke`.
1792 for (size_t vreg = 0, e = current_locals_->size(); vreg < e; ++vreg) {
1793 if ((*current_locals_)[vreg] == arg_this) {
1794 (*current_locals_)[vreg] = invoke;
1795 }
David Brazdildee58d62016-04-07 09:54:26 +00001796 }
David Brazdildee58d62016-04-07 09:54:26 +00001797 return true;
1798}
1799
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001800static DataType::Type GetFieldAccessType(const DexFile& dex_file, uint16_t field_index) {
Andreas Gampe3f1dcd32018-12-28 09:39:56 -08001801 const dex::FieldId& field_id = dex_file.GetFieldId(field_index);
David Brazdildee58d62016-04-07 09:54:26 +00001802 const char* type = dex_file.GetFieldTypeDescriptor(field_id);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001803 return DataType::FromShorty(type[0]);
David Brazdildee58d62016-04-07 09:54:26 +00001804}
1805
1806bool HInstructionBuilder::BuildInstanceFieldAccess(const Instruction& instruction,
1807 uint32_t dex_pc,
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07001808 bool is_put,
1809 size_t quicken_index) {
David Brazdildee58d62016-04-07 09:54:26 +00001810 uint32_t source_or_dest_reg = instruction.VRegA_22c();
1811 uint32_t obj_reg = instruction.VRegB_22c();
1812 uint16_t field_index;
1813 if (instruction.IsQuickened()) {
1814 if (!CanDecodeQuickenedInfo()) {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00001815 VLOG(compiler) << "Not compiled: Could not decode quickened instruction "
1816 << instruction.Opcode();
David Brazdildee58d62016-04-07 09:54:26 +00001817 return false;
1818 }
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07001819 field_index = LookupQuickenedInfo(quicken_index);
David Brazdildee58d62016-04-07 09:54:26 +00001820 } else {
1821 field_index = instruction.VRegC_22c();
1822 }
1823
1824 ScopedObjectAccess soa(Thread::Current());
Andreas Gampe3db70682018-12-26 15:12:03 -08001825 ArtField* resolved_field = ResolveField(field_index, /* is_static= */ false, is_put);
David Brazdildee58d62016-04-07 09:54:26 +00001826
Aart Bik14154132016-06-02 17:53:58 -07001827 // Generate an explicit null check on the reference, unless the field access
1828 // is unresolved. In that case, we rely on the runtime to perform various
1829 // checks first, followed by a null check.
1830 HInstruction* object = (resolved_field == nullptr)
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001831 ? LoadLocal(obj_reg, DataType::Type::kReference)
Aart Bik14154132016-06-02 17:53:58 -07001832 : LoadNullCheckedLocal(obj_reg, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001833
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001834 DataType::Type field_type = GetFieldAccessType(*dex_file_, field_index);
David Brazdildee58d62016-04-07 09:54:26 +00001835 if (is_put) {
1836 HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
1837 HInstruction* field_set = nullptr;
1838 if (resolved_field == nullptr) {
Igor Murashkin1e065a52017-08-09 13:20:34 -07001839 MaybeRecordStat(compilation_stats_,
1840 MethodCompilationStat::kUnresolvedField);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001841 field_set = new (allocator_) HUnresolvedInstanceFieldSet(object,
1842 value,
1843 field_type,
1844 field_index,
1845 dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001846 } else {
1847 uint16_t class_def_index = resolved_field->GetDeclaringClass()->GetDexClassDefIndex();
Vladimir Markoca6fff82017-10-03 14:49:14 +01001848 field_set = new (allocator_) HInstanceFieldSet(object,
1849 value,
1850 resolved_field,
1851 field_type,
1852 resolved_field->GetOffset(),
1853 resolved_field->IsVolatile(),
1854 field_index,
1855 class_def_index,
1856 *dex_file_,
1857 dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001858 }
1859 AppendInstruction(field_set);
1860 } else {
1861 HInstruction* field_get = nullptr;
1862 if (resolved_field == nullptr) {
Igor Murashkin1e065a52017-08-09 13:20:34 -07001863 MaybeRecordStat(compilation_stats_,
1864 MethodCompilationStat::kUnresolvedField);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001865 field_get = new (allocator_) HUnresolvedInstanceFieldGet(object,
1866 field_type,
1867 field_index,
1868 dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001869 } else {
1870 uint16_t class_def_index = resolved_field->GetDeclaringClass()->GetDexClassDefIndex();
Vladimir Markoca6fff82017-10-03 14:49:14 +01001871 field_get = new (allocator_) HInstanceFieldGet(object,
1872 resolved_field,
1873 field_type,
1874 resolved_field->GetOffset(),
1875 resolved_field->IsVolatile(),
1876 field_index,
1877 class_def_index,
1878 *dex_file_,
1879 dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001880 }
1881 AppendInstruction(field_get);
1882 UpdateLocal(source_or_dest_reg, field_get);
1883 }
1884
1885 return true;
1886}
1887
David Brazdildee58d62016-04-07 09:54:26 +00001888void HInstructionBuilder::BuildUnresolvedStaticFieldAccess(const Instruction& instruction,
Nicolas Geoffrayc52b26d2016-12-19 09:18:07 +00001889 uint32_t dex_pc,
1890 bool is_put,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001891 DataType::Type field_type) {
David Brazdildee58d62016-04-07 09:54:26 +00001892 uint32_t source_or_dest_reg = instruction.VRegA_21c();
1893 uint16_t field_index = instruction.VRegB_21c();
1894
1895 if (is_put) {
1896 HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
1897 AppendInstruction(
Vladimir Markoca6fff82017-10-03 14:49:14 +01001898 new (allocator_) HUnresolvedStaticFieldSet(value, field_type, field_index, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001899 } else {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001900 AppendInstruction(new (allocator_) HUnresolvedStaticFieldGet(field_type, field_index, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001901 UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
1902 }
1903}
1904
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001905ArtField* HInstructionBuilder::ResolveField(uint16_t field_idx, bool is_static, bool is_put) {
1906 ScopedObjectAccess soa(Thread::Current());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001907
1908 ClassLinker* class_linker = dex_compilation_unit_->GetClassLinker();
Vladimir Marko8d6768d2017-03-14 10:13:21 +00001909 Handle<mirror::ClassLoader> class_loader = dex_compilation_unit_->GetClassLoader();
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001910
Vladimir Markoe11dd502017-12-08 14:09:45 +00001911 ArtField* resolved_field = class_linker->ResolveField(field_idx,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001912 dex_compilation_unit_->GetDexCache(),
1913 class_loader,
1914 is_static);
Nicolas Geoffrayf3688822020-03-25 15:04:03 +00001915 DCHECK_EQ(resolved_field == nullptr, soa.Self()->IsExceptionPending())
1916 << "field="
1917 << ((resolved_field == nullptr) ? "null" : resolved_field->PrettyField())
1918 << ", exception="
1919 << (soa.Self()->IsExceptionPending() ? soa.Self()->GetException()->Dump() : "null");
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001920 if (UNLIKELY(resolved_field == nullptr)) {
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001921 // Clean up any exception left by field resolution.
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001922 soa.Self()->ClearException();
1923 return nullptr;
1924 }
1925
1926 // Check static/instance. The class linker has a fast path for looking into the dex cache
1927 // and does not check static/instance if it hits it.
1928 if (UNLIKELY(resolved_field->IsStatic() != is_static)) {
1929 return nullptr;
1930 }
1931
1932 // Check access.
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001933 Handle<mirror::Class> compiling_class = dex_compilation_unit_->GetCompilingClass();
Andreas Gampefa4333d2017-02-14 11:10:34 -08001934 if (compiling_class == nullptr) {
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001935 if (!resolved_field->IsPublic()) {
1936 return nullptr;
1937 }
1938 } else if (!compiling_class->CanAccessResolvedField(resolved_field->GetDeclaringClass(),
1939 resolved_field,
1940 dex_compilation_unit_->GetDexCache().Get(),
1941 field_idx)) {
1942 return nullptr;
1943 }
1944
1945 if (is_put &&
1946 resolved_field->IsFinal() &&
1947 (compiling_class.Get() != resolved_field->GetDeclaringClass())) {
1948 // Final fields can only be updated within their own class.
1949 // TODO: Only allow it in constructors. b/34966607.
1950 return nullptr;
1951 }
1952
Nicolas Geoffray396198b2020-06-16 12:02:45 +01001953 StackArtFieldHandleScope<1> rhs(soa.Self());
1954 ReflectiveHandle<ArtField> resolved_field_handle(rhs.NewHandle(resolved_field));
1955 if (resolved_field->ResolveType().IsNull()) {
1956 // ArtField::ResolveType() may fail as evidenced with a dexing bug (b/78788577).
1957 soa.Self()->ClearException();
1958 return nullptr; // Failure
1959 }
1960 return resolved_field_handle.Get();
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001961}
1962
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00001963void HInstructionBuilder::BuildStaticFieldAccess(const Instruction& instruction,
David Brazdildee58d62016-04-07 09:54:26 +00001964 uint32_t dex_pc,
1965 bool is_put) {
1966 uint32_t source_or_dest_reg = instruction.VRegA_21c();
1967 uint16_t field_index = instruction.VRegB_21c();
1968
1969 ScopedObjectAccess soa(Thread::Current());
Andreas Gampe3db70682018-12-26 15:12:03 -08001970 ArtField* resolved_field = ResolveField(field_index, /* is_static= */ true, is_put);
David Brazdildee58d62016-04-07 09:54:26 +00001971
1972 if (resolved_field == nullptr) {
Igor Murashkin1e065a52017-08-09 13:20:34 -07001973 MaybeRecordStat(compilation_stats_,
1974 MethodCompilationStat::kUnresolvedField);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001975 DataType::Type field_type = GetFieldAccessType(*dex_file_, field_index);
David Brazdildee58d62016-04-07 09:54:26 +00001976 BuildUnresolvedStaticFieldAccess(instruction, dex_pc, is_put, field_type);
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00001977 return;
David Brazdildee58d62016-04-07 09:54:26 +00001978 }
1979
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001980 DataType::Type field_type = GetFieldAccessType(*dex_file_, field_index);
David Brazdildee58d62016-04-07 09:54:26 +00001981
Vladimir Marko02ca05a2020-05-12 13:58:51 +01001982 Handle<mirror::Class> klass =
1983 graph_->GetHandleCache()->NewHandle(resolved_field->GetDeclaringClass());
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001984 HLoadClass* constant = BuildLoadClass(klass->GetDexTypeIndex(),
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001985 klass->GetDexFile(),
1986 klass,
1987 dex_pc,
Andreas Gampe3db70682018-12-26 15:12:03 -08001988 /* needs_access_check= */ false);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001989
1990 if (constant == nullptr) {
1991 // The class cannot be referenced from this compiled code. Generate
1992 // an unresolved access.
Igor Murashkin1e065a52017-08-09 13:20:34 -07001993 MaybeRecordStat(compilation_stats_,
1994 MethodCompilationStat::kUnresolvedFieldNotAFastAccess);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001995 BuildUnresolvedStaticFieldAccess(instruction, dex_pc, is_put, field_type);
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00001996 return;
David Brazdildee58d62016-04-07 09:54:26 +00001997 }
1998
David Brazdildee58d62016-04-07 09:54:26 +00001999 HInstruction* cls = constant;
Vladimir Marko2f40d242020-04-08 12:56:45 +01002000 if (!IsInitialized(klass.Get())) {
Vladimir Markoca6fff82017-10-03 14:49:14 +01002001 cls = new (allocator_) HClinitCheck(constant, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002002 AppendInstruction(cls);
2003 }
2004
2005 uint16_t class_def_index = klass->GetDexClassDefIndex();
2006 if (is_put) {
2007 // We need to keep the class alive before loading the value.
2008 HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
2009 DCHECK_EQ(HPhi::ToPhiType(value->GetType()), HPhi::ToPhiType(field_type));
Vladimir Markoca6fff82017-10-03 14:49:14 +01002010 AppendInstruction(new (allocator_) HStaticFieldSet(cls,
2011 value,
2012 resolved_field,
2013 field_type,
2014 resolved_field->GetOffset(),
2015 resolved_field->IsVolatile(),
2016 field_index,
2017 class_def_index,
2018 *dex_file_,
2019 dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00002020 } else {
Vladimir Markoca6fff82017-10-03 14:49:14 +01002021 AppendInstruction(new (allocator_) HStaticFieldGet(cls,
2022 resolved_field,
2023 field_type,
2024 resolved_field->GetOffset(),
2025 resolved_field->IsVolatile(),
2026 field_index,
2027 class_def_index,
2028 *dex_file_,
2029 dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00002030 UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
2031 }
David Brazdildee58d62016-04-07 09:54:26 +00002032}
2033
2034void HInstructionBuilder::BuildCheckedDivRem(uint16_t out_vreg,
Vladimir Markoca6fff82017-10-03 14:49:14 +01002035 uint16_t first_vreg,
2036 int64_t second_vreg_or_constant,
2037 uint32_t dex_pc,
2038 DataType::Type type,
2039 bool second_is_constant,
2040 bool isDiv) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002041 DCHECK(type == DataType::Type::kInt32 || type == DataType::Type::kInt64);
David Brazdildee58d62016-04-07 09:54:26 +00002042
2043 HInstruction* first = LoadLocal(first_vreg, type);
2044 HInstruction* second = nullptr;
2045 if (second_is_constant) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002046 if (type == DataType::Type::kInt32) {
David Brazdildee58d62016-04-07 09:54:26 +00002047 second = graph_->GetIntConstant(second_vreg_or_constant, dex_pc);
2048 } else {
2049 second = graph_->GetLongConstant(second_vreg_or_constant, dex_pc);
2050 }
2051 } else {
2052 second = LoadLocal(second_vreg_or_constant, type);
2053 }
2054
2055 if (!second_is_constant
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002056 || (type == DataType::Type::kInt32 && second->AsIntConstant()->GetValue() == 0)
2057 || (type == DataType::Type::kInt64 && second->AsLongConstant()->GetValue() == 0)) {
Vladimir Markoca6fff82017-10-03 14:49:14 +01002058 second = new (allocator_) HDivZeroCheck(second, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002059 AppendInstruction(second);
2060 }
2061
2062 if (isDiv) {
Vladimir Markoca6fff82017-10-03 14:49:14 +01002063 AppendInstruction(new (allocator_) HDiv(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00002064 } else {
Vladimir Markoca6fff82017-10-03 14:49:14 +01002065 AppendInstruction(new (allocator_) HRem(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00002066 }
2067 UpdateLocal(out_vreg, current_block_->GetLastInstruction());
2068}
2069
2070void HInstructionBuilder::BuildArrayAccess(const Instruction& instruction,
2071 uint32_t dex_pc,
2072 bool is_put,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002073 DataType::Type anticipated_type) {
David Brazdildee58d62016-04-07 09:54:26 +00002074 uint8_t source_or_dest_reg = instruction.VRegA_23x();
2075 uint8_t array_reg = instruction.VRegB_23x();
2076 uint8_t index_reg = instruction.VRegC_23x();
2077
David Brazdilc120bbe2016-04-22 16:57:00 +01002078 HInstruction* object = LoadNullCheckedLocal(array_reg, dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01002079 HInstruction* length = new (allocator_) HArrayLength(object, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002080 AppendInstruction(length);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002081 HInstruction* index = LoadLocal(index_reg, DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +01002082 index = new (allocator_) HBoundsCheck(index, length, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002083 AppendInstruction(index);
2084 if (is_put) {
2085 HInstruction* value = LoadLocal(source_or_dest_reg, anticipated_type);
2086 // TODO: Insert a type check node if the type is Object.
Vladimir Markoca6fff82017-10-03 14:49:14 +01002087 HArraySet* aset = new (allocator_) HArraySet(object, index, value, anticipated_type, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002088 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
2089 AppendInstruction(aset);
2090 } else {
Vladimir Markoca6fff82017-10-03 14:49:14 +01002091 HArrayGet* aget = new (allocator_) HArrayGet(object, index, anticipated_type, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002092 ssa_builder_->MaybeAddAmbiguousArrayGet(aget);
2093 AppendInstruction(aget);
2094 UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
2095 }
2096 graph_->SetHasBoundsChecks(true);
2097}
2098
Vladimir Markob5461632018-10-15 14:24:21 +01002099HNewArray* HInstructionBuilder::BuildNewArray(uint32_t dex_pc,
2100 dex::TypeIndex type_index,
2101 HInstruction* length) {
2102 HLoadClass* cls = BuildLoadClass(type_index, dex_pc);
2103
2104 const char* descriptor = dex_file_->GetTypeDescriptor(dex_file_->GetTypeId(type_index));
2105 DCHECK_EQ(descriptor[0], '[');
2106 size_t component_type_shift = Primitive::ComponentSizeShift(Primitive::GetType(descriptor[1]));
2107
2108 HNewArray* new_array = new (allocator_) HNewArray(cls, length, dex_pc, component_type_shift);
2109 AppendInstruction(new_array);
2110 return new_array;
2111}
2112
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002113HNewArray* HInstructionBuilder::BuildFilledNewArray(uint32_t dex_pc,
2114 dex::TypeIndex type_index,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002115 const InstructionOperands& operands) {
2116 const size_t number_of_operands = operands.GetNumberOfOperands();
2117 HInstruction* length = graph_->GetIntConstant(number_of_operands, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002118
Vladimir Markob5461632018-10-15 14:24:21 +01002119 HNewArray* new_array = BuildNewArray(dex_pc, type_index, length);
David Brazdildee58d62016-04-07 09:54:26 +00002120 const char* descriptor = dex_file_->StringByTypeIdx(type_index);
2121 DCHECK_EQ(descriptor[0], '[') << descriptor;
2122 char primitive = descriptor[1];
2123 DCHECK(primitive == 'I'
2124 || primitive == 'L'
2125 || primitive == '[') << descriptor;
2126 bool is_reference_array = (primitive == 'L') || (primitive == '[');
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002127 DataType::Type type = is_reference_array ? DataType::Type::kReference : DataType::Type::kInt32;
David Brazdildee58d62016-04-07 09:54:26 +00002128
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002129 for (size_t i = 0; i < number_of_operands; ++i) {
2130 HInstruction* value = LoadLocal(operands.GetOperand(i), type);
David Brazdildee58d62016-04-07 09:54:26 +00002131 HInstruction* index = graph_->GetIntConstant(i, dex_pc);
Vladimir Markob5461632018-10-15 14:24:21 +01002132 HArraySet* aset = new (allocator_) HArraySet(new_array, index, value, type, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002133 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
2134 AppendInstruction(aset);
2135 }
Vladimir Markob5461632018-10-15 14:24:21 +01002136 latest_result_ = new_array;
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002137
Vladimir Markob5461632018-10-15 14:24:21 +01002138 return new_array;
David Brazdildee58d62016-04-07 09:54:26 +00002139}
2140
2141template <typename T>
2142void HInstructionBuilder::BuildFillArrayData(HInstruction* object,
2143 const T* data,
2144 uint32_t element_count,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002145 DataType::Type anticipated_type,
David Brazdildee58d62016-04-07 09:54:26 +00002146 uint32_t dex_pc) {
2147 for (uint32_t i = 0; i < element_count; ++i) {
2148 HInstruction* index = graph_->GetIntConstant(i, dex_pc);
2149 HInstruction* value = graph_->GetIntConstant(data[i], dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01002150 HArraySet* aset = new (allocator_) HArraySet(object, index, value, anticipated_type, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002151 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
2152 AppendInstruction(aset);
2153 }
2154}
2155
2156void HInstructionBuilder::BuildFillArrayData(const Instruction& instruction, uint32_t dex_pc) {
David Brazdilc120bbe2016-04-22 16:57:00 +01002157 HInstruction* array = LoadNullCheckedLocal(instruction.VRegA_31t(), dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002158
2159 int32_t payload_offset = instruction.VRegB_31t() + dex_pc;
2160 const Instruction::ArrayDataPayload* payload =
Mathieu Chartier808c7a52017-12-15 11:19:33 -08002161 reinterpret_cast<const Instruction::ArrayDataPayload*>(
2162 code_item_accessor_.Insns() + payload_offset);
David Brazdildee58d62016-04-07 09:54:26 +00002163 const uint8_t* data = payload->data;
2164 uint32_t element_count = payload->element_count;
2165
Vladimir Markoc69fba22016-09-06 16:49:15 +01002166 if (element_count == 0u) {
2167 // For empty payload we emit only the null check above.
2168 return;
2169 }
2170
Vladimir Markoca6fff82017-10-03 14:49:14 +01002171 HInstruction* length = new (allocator_) HArrayLength(array, dex_pc);
Vladimir Markoc69fba22016-09-06 16:49:15 +01002172 AppendInstruction(length);
2173
David Brazdildee58d62016-04-07 09:54:26 +00002174 // Implementation of this DEX instruction seems to be that the bounds check is
2175 // done before doing any stores.
2176 HInstruction* last_index = graph_->GetIntConstant(payload->element_count - 1, dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01002177 AppendInstruction(new (allocator_) HBoundsCheck(last_index, length, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00002178
2179 switch (payload->element_width) {
2180 case 1:
David Brazdilc120bbe2016-04-22 16:57:00 +01002181 BuildFillArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00002182 reinterpret_cast<const int8_t*>(data),
2183 element_count,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002184 DataType::Type::kInt8,
David Brazdildee58d62016-04-07 09:54:26 +00002185 dex_pc);
2186 break;
2187 case 2:
David Brazdilc120bbe2016-04-22 16:57:00 +01002188 BuildFillArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00002189 reinterpret_cast<const int16_t*>(data),
2190 element_count,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002191 DataType::Type::kInt16,
David Brazdildee58d62016-04-07 09:54:26 +00002192 dex_pc);
2193 break;
2194 case 4:
David Brazdilc120bbe2016-04-22 16:57:00 +01002195 BuildFillArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00002196 reinterpret_cast<const int32_t*>(data),
2197 element_count,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002198 DataType::Type::kInt32,
David Brazdildee58d62016-04-07 09:54:26 +00002199 dex_pc);
2200 break;
2201 case 8:
David Brazdilc120bbe2016-04-22 16:57:00 +01002202 BuildFillWideArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00002203 reinterpret_cast<const int64_t*>(data),
2204 element_count,
2205 dex_pc);
2206 break;
2207 default:
2208 LOG(FATAL) << "Unknown element width for " << payload->element_width;
2209 }
2210 graph_->SetHasBoundsChecks(true);
2211}
2212
2213void HInstructionBuilder::BuildFillWideArrayData(HInstruction* object,
2214 const int64_t* data,
2215 uint32_t element_count,
2216 uint32_t dex_pc) {
2217 for (uint32_t i = 0; i < element_count; ++i) {
2218 HInstruction* index = graph_->GetIntConstant(i, dex_pc);
2219 HInstruction* value = graph_->GetLongConstant(data[i], dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01002220 HArraySet* aset =
2221 new (allocator_) HArraySet(object, index, value, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002222 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
2223 AppendInstruction(aset);
2224 }
2225}
2226
Vladimir Marko28e012a2017-12-07 11:22:59 +00002227void HInstructionBuilder::BuildLoadString(dex::StringIndex string_index, uint32_t dex_pc) {
2228 HLoadString* load_string =
2229 new (allocator_) HLoadString(graph_->GetCurrentMethod(), string_index, *dex_file_, dex_pc);
2230 HSharpening::ProcessLoadString(load_string,
2231 code_generator_,
Vladimir Marko28e012a2017-12-07 11:22:59 +00002232 *dex_compilation_unit_,
Vladimir Marko02ca05a2020-05-12 13:58:51 +01002233 graph_->GetHandleCache()->GetHandles());
Vladimir Marko28e012a2017-12-07 11:22:59 +00002234 AppendInstruction(load_string);
2235}
2236
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00002237HLoadClass* HInstructionBuilder::BuildLoadClass(dex::TypeIndex type_index, uint32_t dex_pc) {
Nicolas Geoffray5247c082017-01-13 14:17:29 +00002238 ScopedObjectAccess soa(Thread::Current());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00002239 const DexFile& dex_file = *dex_compilation_unit_->GetDexFile();
Vladimir Marko175e7862018-03-27 09:03:13 +00002240 Handle<mirror::Class> klass = ResolveClass(soa, type_index);
Vladimir Marko2f40d242020-04-08 12:56:45 +01002241 bool needs_access_check = LoadClassNeedsAccessCheck(klass.Get());
Vladimir Markoa2c211c2018-11-01 09:50:52 +00002242 return BuildLoadClass(type_index, dex_file, klass, dex_pc, needs_access_check);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00002243}
2244
Vladimir Markoa2c211c2018-11-01 09:50:52 +00002245HLoadClass* HInstructionBuilder::BuildLoadClass(dex::TypeIndex type_index,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00002246 const DexFile& dex_file,
2247 Handle<mirror::Class> klass,
2248 uint32_t dex_pc,
2249 bool needs_access_check) {
2250 // Try to find a reference in the compiling dex file.
2251 const DexFile* actual_dex_file = &dex_file;
2252 if (!IsSameDexFile(dex_file, *dex_compilation_unit_->GetDexFile())) {
2253 dex::TypeIndex local_type_index =
2254 klass->FindTypeIndexInOtherDexFile(*dex_compilation_unit_->GetDexFile());
2255 if (local_type_index.IsValid()) {
2256 type_index = local_type_index;
2257 actual_dex_file = dex_compilation_unit_->GetDexFile();
2258 }
2259 }
2260
Vladimir Marko02ca05a2020-05-12 13:58:51 +01002261 // Note: `klass` must be from `graph_->GetHandleCache()`.
Vladimir Markoa2c211c2018-11-01 09:50:52 +00002262 bool is_referrers_class =
2263 (klass != nullptr) && (outer_compilation_unit_->GetCompilingClass().Get() == klass.Get());
Vladimir Markoca6fff82017-10-03 14:49:14 +01002264 HLoadClass* load_class = new (allocator_) HLoadClass(
Nicolas Geoffray5247c082017-01-13 14:17:29 +00002265 graph_->GetCurrentMethod(),
2266 type_index,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00002267 *actual_dex_file,
Nicolas Geoffray5247c082017-01-13 14:17:29 +00002268 klass,
Vladimir Markofca0b492018-07-23 15:30:52 +01002269 is_referrers_class,
Nicolas Geoffray5247c082017-01-13 14:17:29 +00002270 dex_pc,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00002271 needs_access_check);
Nicolas Geoffray5247c082017-01-13 14:17:29 +00002272
Nicolas Geoffrayc4aa82c2017-03-06 14:38:52 +00002273 HLoadClass::LoadKind load_kind = HSharpening::ComputeLoadClassKind(load_class,
2274 code_generator_,
Nicolas Geoffrayc4aa82c2017-03-06 14:38:52 +00002275 *dex_compilation_unit_);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00002276
2277 if (load_kind == HLoadClass::LoadKind::kInvalid) {
2278 // We actually cannot reference this class, we're forced to bail.
2279 return nullptr;
2280 }
Vladimir Marko28e012a2017-12-07 11:22:59 +00002281 // Load kind must be set before inserting the instruction into the graph.
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00002282 load_class->SetLoadKind(load_kind);
Vladimir Marko28e012a2017-12-07 11:22:59 +00002283 AppendInstruction(load_class);
Nicolas Geoffray5247c082017-01-13 14:17:29 +00002284 return load_class;
2285}
2286
Vladimir Marko175e7862018-03-27 09:03:13 +00002287Handle<mirror::Class> HInstructionBuilder::ResolveClass(ScopedObjectAccess& soa,
2288 dex::TypeIndex type_index) {
Vladimir Marko3b506202018-10-31 14:33:58 +00002289 auto it = class_cache_.find(type_index);
2290 if (it != class_cache_.end()) {
2291 return it->second;
2292 }
2293
2294 ObjPtr<mirror::Class> klass = dex_compilation_unit_->GetClassLinker()->ResolveType(
2295 type_index, dex_compilation_unit_->GetDexCache(), dex_compilation_unit_->GetClassLoader());
2296 DCHECK_EQ(klass == nullptr, soa.Self()->IsExceptionPending());
2297 soa.Self()->ClearException(); // Clean up the exception left by type resolution if any.
2298
Vladimir Marko02ca05a2020-05-12 13:58:51 +01002299 Handle<mirror::Class> h_klass = graph_->GetHandleCache()->NewHandle(klass);
Vladimir Marko3b506202018-10-31 14:33:58 +00002300 class_cache_.Put(type_index, h_klass);
2301 return h_klass;
Vladimir Marko175e7862018-03-27 09:03:13 +00002302}
2303
Vladimir Marko2f40d242020-04-08 12:56:45 +01002304bool HInstructionBuilder::LoadClassNeedsAccessCheck(ObjPtr<mirror::Class> klass) {
Vladimir Marko175e7862018-03-27 09:03:13 +00002305 if (klass == nullptr) {
2306 return true;
2307 } else if (klass->IsPublic()) {
2308 return false;
2309 } else {
Vladimir Markoa2c211c2018-11-01 09:50:52 +00002310 ObjPtr<mirror::Class> compiling_class = dex_compilation_unit_->GetCompilingClass().Get();
Vladimir Marko2f40d242020-04-08 12:56:45 +01002311 return compiling_class == nullptr || !compiling_class->CanAccess(klass);
Vladimir Marko175e7862018-03-27 09:03:13 +00002312 }
2313}
2314
Orion Hodson06d10a72018-05-14 08:53:38 +01002315void HInstructionBuilder::BuildLoadMethodHandle(uint16_t method_handle_index, uint32_t dex_pc) {
Orion Hodsondbaa5c72018-05-10 08:22:46 +01002316 const DexFile& dex_file = *dex_compilation_unit_->GetDexFile();
Orion Hodson06d10a72018-05-14 08:53:38 +01002317 HLoadMethodHandle* load_method_handle = new (allocator_) HLoadMethodHandle(
2318 graph_->GetCurrentMethod(), method_handle_index, dex_file, dex_pc);
Orion Hodsondbaa5c72018-05-10 08:22:46 +01002319 AppendInstruction(load_method_handle);
2320}
2321
Orion Hodson06d10a72018-05-14 08:53:38 +01002322void HInstructionBuilder::BuildLoadMethodType(dex::ProtoIndex proto_index, uint32_t dex_pc) {
Orion Hodson18259d72018-04-12 11:18:23 +01002323 const DexFile& dex_file = *dex_compilation_unit_->GetDexFile();
2324 HLoadMethodType* load_method_type =
Orion Hodson06d10a72018-05-14 08:53:38 +01002325 new (allocator_) HLoadMethodType(graph_->GetCurrentMethod(), proto_index, dex_file, dex_pc);
Orion Hodson18259d72018-04-12 11:18:23 +01002326 AppendInstruction(load_method_type);
2327}
2328
David Brazdildee58d62016-04-07 09:54:26 +00002329void HInstructionBuilder::BuildTypeCheck(const Instruction& instruction,
2330 uint8_t destination,
2331 uint8_t reference,
Andreas Gampea5b09a62016-11-17 15:21:22 -08002332 dex::TypeIndex type_index,
David Brazdildee58d62016-04-07 09:54:26 +00002333 uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002334 HInstruction* object = LoadLocal(reference, DataType::Type::kReference);
David Brazdildee58d62016-04-07 09:54:26 +00002335
Nicolas Geoffray5247c082017-01-13 14:17:29 +00002336 ScopedObjectAccess soa(Thread::Current());
Vladimir Marko175e7862018-03-27 09:03:13 +00002337 const DexFile& dex_file = *dex_compilation_unit_->GetDexFile();
2338 Handle<mirror::Class> klass = ResolveClass(soa, type_index);
Vladimir Marko2f40d242020-04-08 12:56:45 +01002339 bool needs_access_check = LoadClassNeedsAccessCheck(klass.Get());
Vladimir Marko175e7862018-03-27 09:03:13 +00002340 TypeCheckKind check_kind = HSharpening::ComputeTypeCheckKind(
Vladimir Markodc4bcce2018-06-21 16:15:42 +01002341 klass.Get(), code_generator_, needs_access_check);
Vladimir Marko175e7862018-03-27 09:03:13 +00002342
2343 HInstruction* class_or_null = nullptr;
2344 HIntConstant* bitstring_path_to_root = nullptr;
2345 HIntConstant* bitstring_mask = nullptr;
2346 if (check_kind == TypeCheckKind::kBitstringCheck) {
2347 // TODO: Allow using the bitstring check also if we need an access check.
2348 DCHECK(!needs_access_check);
2349 class_or_null = graph_->GetNullConstant(dex_pc);
2350 MutexLock subtype_check_lock(Thread::Current(), *Locks::subtype_check_lock_);
2351 uint32_t path_to_root =
2352 SubtypeCheck<ObjPtr<mirror::Class>>::GetEncodedPathToRootForTarget(klass.Get());
2353 uint32_t mask = SubtypeCheck<ObjPtr<mirror::Class>>::GetEncodedPathToRootMask(klass.Get());
2354 bitstring_path_to_root = graph_->GetIntConstant(static_cast<int32_t>(path_to_root), dex_pc);
2355 bitstring_mask = graph_->GetIntConstant(static_cast<int32_t>(mask), dex_pc);
2356 } else {
Vladimir Markoa2c211c2018-11-01 09:50:52 +00002357 class_or_null = BuildLoadClass(type_index, dex_file, klass, dex_pc, needs_access_check);
Vladimir Marko175e7862018-03-27 09:03:13 +00002358 }
2359 DCHECK(class_or_null != nullptr);
2360
David Brazdildee58d62016-04-07 09:54:26 +00002361 if (instruction.Opcode() == Instruction::INSTANCE_OF) {
Vladimir Marko175e7862018-03-27 09:03:13 +00002362 AppendInstruction(new (allocator_) HInstanceOf(object,
2363 class_or_null,
2364 check_kind,
2365 klass,
2366 dex_pc,
2367 allocator_,
2368 bitstring_path_to_root,
2369 bitstring_mask));
David Brazdildee58d62016-04-07 09:54:26 +00002370 UpdateLocal(destination, current_block_->GetLastInstruction());
2371 } else {
2372 DCHECK_EQ(instruction.Opcode(), Instruction::CHECK_CAST);
2373 // We emit a CheckCast followed by a BoundType. CheckCast is a statement
2374 // which may throw. If it succeeds BoundType sets the new type of `object`
2375 // for all subsequent uses.
Vladimir Marko175e7862018-03-27 09:03:13 +00002376 AppendInstruction(
2377 new (allocator_) HCheckCast(object,
2378 class_or_null,
2379 check_kind,
2380 klass,
2381 dex_pc,
2382 allocator_,
2383 bitstring_path_to_root,
2384 bitstring_mask));
Vladimir Markoca6fff82017-10-03 14:49:14 +01002385 AppendInstruction(new (allocator_) HBoundType(object, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00002386 UpdateLocal(reference, current_block_->GetLastInstruction());
2387 }
2388}
2389
David Brazdildee58d62016-04-07 09:54:26 +00002390bool HInstructionBuilder::CanDecodeQuickenedInfo() const {
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002391 return !quicken_info_.IsNull();
David Brazdildee58d62016-04-07 09:54:26 +00002392}
2393
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002394uint16_t HInstructionBuilder::LookupQuickenedInfo(uint32_t quicken_index) {
2395 DCHECK(CanDecodeQuickenedInfo());
2396 return quicken_info_.GetData(quicken_index);
David Brazdildee58d62016-04-07 09:54:26 +00002397}
2398
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002399bool HInstructionBuilder::ProcessDexInstruction(const Instruction& instruction,
2400 uint32_t dex_pc,
2401 size_t quicken_index) {
David Brazdildee58d62016-04-07 09:54:26 +00002402 switch (instruction.Opcode()) {
2403 case Instruction::CONST_4: {
2404 int32_t register_index = instruction.VRegA();
2405 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_11n(), dex_pc);
2406 UpdateLocal(register_index, constant);
2407 break;
2408 }
2409
2410 case Instruction::CONST_16: {
2411 int32_t register_index = instruction.VRegA();
2412 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_21s(), dex_pc);
2413 UpdateLocal(register_index, constant);
2414 break;
2415 }
2416
2417 case Instruction::CONST: {
2418 int32_t register_index = instruction.VRegA();
2419 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_31i(), dex_pc);
2420 UpdateLocal(register_index, constant);
2421 break;
2422 }
2423
2424 case Instruction::CONST_HIGH16: {
2425 int32_t register_index = instruction.VRegA();
2426 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_21h() << 16, dex_pc);
2427 UpdateLocal(register_index, constant);
2428 break;
2429 }
2430
2431 case Instruction::CONST_WIDE_16: {
2432 int32_t register_index = instruction.VRegA();
2433 // Get 16 bits of constant value, sign extended to 64 bits.
2434 int64_t value = instruction.VRegB_21s();
2435 value <<= 48;
2436 value >>= 48;
2437 HLongConstant* constant = graph_->GetLongConstant(value, dex_pc);
2438 UpdateLocal(register_index, constant);
2439 break;
2440 }
2441
2442 case Instruction::CONST_WIDE_32: {
2443 int32_t register_index = instruction.VRegA();
2444 // Get 32 bits of constant value, sign extended to 64 bits.
2445 int64_t value = instruction.VRegB_31i();
2446 value <<= 32;
2447 value >>= 32;
2448 HLongConstant* constant = graph_->GetLongConstant(value, dex_pc);
2449 UpdateLocal(register_index, constant);
2450 break;
2451 }
2452
2453 case Instruction::CONST_WIDE: {
2454 int32_t register_index = instruction.VRegA();
2455 HLongConstant* constant = graph_->GetLongConstant(instruction.VRegB_51l(), dex_pc);
2456 UpdateLocal(register_index, constant);
2457 break;
2458 }
2459
2460 case Instruction::CONST_WIDE_HIGH16: {
2461 int32_t register_index = instruction.VRegA();
2462 int64_t value = static_cast<int64_t>(instruction.VRegB_21h()) << 48;
2463 HLongConstant* constant = graph_->GetLongConstant(value, dex_pc);
2464 UpdateLocal(register_index, constant);
2465 break;
2466 }
2467
2468 // Note that the SSA building will refine the types.
2469 case Instruction::MOVE:
2470 case Instruction::MOVE_FROM16:
2471 case Instruction::MOVE_16: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002472 HInstruction* value = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
David Brazdildee58d62016-04-07 09:54:26 +00002473 UpdateLocal(instruction.VRegA(), value);
2474 break;
2475 }
2476
2477 // Note that the SSA building will refine the types.
2478 case Instruction::MOVE_WIDE:
2479 case Instruction::MOVE_WIDE_FROM16:
2480 case Instruction::MOVE_WIDE_16: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002481 HInstruction* value = LoadLocal(instruction.VRegB(), DataType::Type::kInt64);
David Brazdildee58d62016-04-07 09:54:26 +00002482 UpdateLocal(instruction.VRegA(), value);
2483 break;
2484 }
2485
2486 case Instruction::MOVE_OBJECT:
2487 case Instruction::MOVE_OBJECT_16:
2488 case Instruction::MOVE_OBJECT_FROM16: {
Nicolas Geoffray50a9ed02016-09-23 15:40:41 +01002489 // The verifier has no notion of a null type, so a move-object of constant 0
2490 // will lead to the same constant 0 in the destination register. To mimic
2491 // this behavior, we just pretend we haven't seen a type change (int to reference)
2492 // for the 0 constant and phis. We rely on our type propagation to eventually get the
2493 // types correct.
2494 uint32_t reg_number = instruction.VRegB();
2495 HInstruction* value = (*current_locals_)[reg_number];
2496 if (value->IsIntConstant()) {
2497 DCHECK_EQ(value->AsIntConstant()->GetValue(), 0);
2498 } else if (value->IsPhi()) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002499 DCHECK(value->GetType() == DataType::Type::kInt32 ||
2500 value->GetType() == DataType::Type::kReference);
Nicolas Geoffray50a9ed02016-09-23 15:40:41 +01002501 } else {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002502 value = LoadLocal(reg_number, DataType::Type::kReference);
Nicolas Geoffray50a9ed02016-09-23 15:40:41 +01002503 }
David Brazdildee58d62016-04-07 09:54:26 +00002504 UpdateLocal(instruction.VRegA(), value);
2505 break;
2506 }
2507
2508 case Instruction::RETURN_VOID_NO_BARRIER:
2509 case Instruction::RETURN_VOID: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002510 BuildReturn(instruction, DataType::Type::kVoid, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002511 break;
2512 }
2513
2514#define IF_XX(comparison, cond) \
2515 case Instruction::IF_##cond: If_22t<comparison>(instruction, dex_pc); break; \
2516 case Instruction::IF_##cond##Z: If_21t<comparison>(instruction, dex_pc); break
2517
2518 IF_XX(HEqual, EQ);
2519 IF_XX(HNotEqual, NE);
2520 IF_XX(HLessThan, LT);
2521 IF_XX(HLessThanOrEqual, LE);
2522 IF_XX(HGreaterThan, GT);
2523 IF_XX(HGreaterThanOrEqual, GE);
2524
2525 case Instruction::GOTO:
2526 case Instruction::GOTO_16:
2527 case Instruction::GOTO_32: {
Vladimir Markoca6fff82017-10-03 14:49:14 +01002528 AppendInstruction(new (allocator_) HGoto(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00002529 current_block_ = nullptr;
2530 break;
2531 }
2532
2533 case Instruction::RETURN: {
2534 BuildReturn(instruction, return_type_, dex_pc);
2535 break;
2536 }
2537
2538 case Instruction::RETURN_OBJECT: {
2539 BuildReturn(instruction, return_type_, dex_pc);
2540 break;
2541 }
2542
2543 case Instruction::RETURN_WIDE: {
2544 BuildReturn(instruction, return_type_, dex_pc);
2545 break;
2546 }
2547
2548 case Instruction::INVOKE_DIRECT:
2549 case Instruction::INVOKE_INTERFACE:
2550 case Instruction::INVOKE_STATIC:
2551 case Instruction::INVOKE_SUPER:
2552 case Instruction::INVOKE_VIRTUAL:
2553 case Instruction::INVOKE_VIRTUAL_QUICK: {
2554 uint16_t method_idx;
2555 if (instruction.Opcode() == Instruction::INVOKE_VIRTUAL_QUICK) {
2556 if (!CanDecodeQuickenedInfo()) {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00002557 VLOG(compiler) << "Not compiled: Could not decode quickened instruction "
2558 << instruction.Opcode();
David Brazdildee58d62016-04-07 09:54:26 +00002559 return false;
2560 }
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002561 method_idx = LookupQuickenedInfo(quicken_index);
David Brazdildee58d62016-04-07 09:54:26 +00002562 } else {
2563 method_idx = instruction.VRegB_35c();
2564 }
David Brazdildee58d62016-04-07 09:54:26 +00002565 uint32_t args[5];
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002566 uint32_t number_of_vreg_arguments = instruction.GetVarArgs(args);
2567 VarArgsInstructionOperands operands(args, number_of_vreg_arguments);
2568 if (!BuildInvoke(instruction, dex_pc, method_idx, operands)) {
David Brazdildee58d62016-04-07 09:54:26 +00002569 return false;
2570 }
2571 break;
2572 }
2573
2574 case Instruction::INVOKE_DIRECT_RANGE:
2575 case Instruction::INVOKE_INTERFACE_RANGE:
2576 case Instruction::INVOKE_STATIC_RANGE:
2577 case Instruction::INVOKE_SUPER_RANGE:
2578 case Instruction::INVOKE_VIRTUAL_RANGE:
2579 case Instruction::INVOKE_VIRTUAL_RANGE_QUICK: {
2580 uint16_t method_idx;
2581 if (instruction.Opcode() == Instruction::INVOKE_VIRTUAL_RANGE_QUICK) {
2582 if (!CanDecodeQuickenedInfo()) {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00002583 VLOG(compiler) << "Not compiled: Could not decode quickened instruction "
2584 << instruction.Opcode();
David Brazdildee58d62016-04-07 09:54:26 +00002585 return false;
2586 }
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002587 method_idx = LookupQuickenedInfo(quicken_index);
David Brazdildee58d62016-04-07 09:54:26 +00002588 } else {
2589 method_idx = instruction.VRegB_3rc();
2590 }
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002591 RangeInstructionOperands operands(instruction.VRegC(), instruction.VRegA_3rc());
2592 if (!BuildInvoke(instruction, dex_pc, method_idx, operands)) {
David Brazdildee58d62016-04-07 09:54:26 +00002593 return false;
2594 }
2595 break;
2596 }
2597
Orion Hodsonac141392017-01-13 11:53:47 +00002598 case Instruction::INVOKE_POLYMORPHIC: {
2599 uint16_t method_idx = instruction.VRegB_45cc();
Orion Hodson06d10a72018-05-14 08:53:38 +01002600 dex::ProtoIndex proto_idx(instruction.VRegH_45cc());
Orion Hodsonac141392017-01-13 11:53:47 +00002601 uint32_t args[5];
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002602 uint32_t number_of_vreg_arguments = instruction.GetVarArgs(args);
2603 VarArgsInstructionOperands operands(args, number_of_vreg_arguments);
Orion Hodson4c8e12e2018-05-18 08:33:20 +01002604 return BuildInvokePolymorphic(dex_pc, method_idx, proto_idx, operands);
Orion Hodsonac141392017-01-13 11:53:47 +00002605 }
2606
2607 case Instruction::INVOKE_POLYMORPHIC_RANGE: {
2608 uint16_t method_idx = instruction.VRegB_4rcc();
Orion Hodson06d10a72018-05-14 08:53:38 +01002609 dex::ProtoIndex proto_idx(instruction.VRegH_4rcc());
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002610 RangeInstructionOperands operands(instruction.VRegC_4rcc(), instruction.VRegA_4rcc());
Orion Hodson4c8e12e2018-05-18 08:33:20 +01002611 return BuildInvokePolymorphic(dex_pc, method_idx, proto_idx, operands);
2612 }
2613
2614 case Instruction::INVOKE_CUSTOM: {
2615 uint16_t call_site_idx = instruction.VRegB_35c();
2616 uint32_t args[5];
2617 uint32_t number_of_vreg_arguments = instruction.GetVarArgs(args);
2618 VarArgsInstructionOperands operands(args, number_of_vreg_arguments);
2619 return BuildInvokeCustom(dex_pc, call_site_idx, operands);
2620 }
2621
2622 case Instruction::INVOKE_CUSTOM_RANGE: {
2623 uint16_t call_site_idx = instruction.VRegB_3rc();
2624 RangeInstructionOperands operands(instruction.VRegC_3rc(), instruction.VRegA_3rc());
2625 return BuildInvokeCustom(dex_pc, call_site_idx, operands);
Orion Hodsonac141392017-01-13 11:53:47 +00002626 }
2627
David Brazdildee58d62016-04-07 09:54:26 +00002628 case Instruction::NEG_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002629 Unop_12x<HNeg>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002630 break;
2631 }
2632
2633 case Instruction::NEG_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002634 Unop_12x<HNeg>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002635 break;
2636 }
2637
2638 case Instruction::NEG_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002639 Unop_12x<HNeg>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002640 break;
2641 }
2642
2643 case Instruction::NEG_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002644 Unop_12x<HNeg>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002645 break;
2646 }
2647
2648 case Instruction::NOT_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002649 Unop_12x<HNot>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002650 break;
2651 }
2652
2653 case Instruction::NOT_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002654 Unop_12x<HNot>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002655 break;
2656 }
2657
2658 case Instruction::INT_TO_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002659 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002660 break;
2661 }
2662
2663 case Instruction::INT_TO_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002664 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002665 break;
2666 }
2667
2668 case Instruction::INT_TO_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002669 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002670 break;
2671 }
2672
2673 case Instruction::LONG_TO_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002674 Conversion_12x(instruction, DataType::Type::kInt64, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002675 break;
2676 }
2677
2678 case Instruction::LONG_TO_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002679 Conversion_12x(instruction, DataType::Type::kInt64, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002680 break;
2681 }
2682
2683 case Instruction::LONG_TO_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002684 Conversion_12x(instruction, DataType::Type::kInt64, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002685 break;
2686 }
2687
2688 case Instruction::FLOAT_TO_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002689 Conversion_12x(instruction, DataType::Type::kFloat32, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002690 break;
2691 }
2692
2693 case Instruction::FLOAT_TO_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002694 Conversion_12x(instruction, DataType::Type::kFloat32, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002695 break;
2696 }
2697
2698 case Instruction::FLOAT_TO_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002699 Conversion_12x(instruction, DataType::Type::kFloat32, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002700 break;
2701 }
2702
2703 case Instruction::DOUBLE_TO_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002704 Conversion_12x(instruction, DataType::Type::kFloat64, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002705 break;
2706 }
2707
2708 case Instruction::DOUBLE_TO_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002709 Conversion_12x(instruction, DataType::Type::kFloat64, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002710 break;
2711 }
2712
2713 case Instruction::DOUBLE_TO_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002714 Conversion_12x(instruction, DataType::Type::kFloat64, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002715 break;
2716 }
2717
2718 case Instruction::INT_TO_BYTE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002719 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kInt8, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002720 break;
2721 }
2722
2723 case Instruction::INT_TO_SHORT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002724 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kInt16, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002725 break;
2726 }
2727
2728 case Instruction::INT_TO_CHAR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002729 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kUint16, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002730 break;
2731 }
2732
2733 case Instruction::ADD_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002734 Binop_23x<HAdd>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002735 break;
2736 }
2737
2738 case Instruction::ADD_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002739 Binop_23x<HAdd>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002740 break;
2741 }
2742
2743 case Instruction::ADD_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002744 Binop_23x<HAdd>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002745 break;
2746 }
2747
2748 case Instruction::ADD_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002749 Binop_23x<HAdd>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002750 break;
2751 }
2752
2753 case Instruction::SUB_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002754 Binop_23x<HSub>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002755 break;
2756 }
2757
2758 case Instruction::SUB_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002759 Binop_23x<HSub>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002760 break;
2761 }
2762
2763 case Instruction::SUB_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002764 Binop_23x<HSub>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002765 break;
2766 }
2767
2768 case Instruction::SUB_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002769 Binop_23x<HSub>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002770 break;
2771 }
2772
2773 case Instruction::ADD_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002774 Binop_12x<HAdd>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002775 break;
2776 }
2777
2778 case Instruction::MUL_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002779 Binop_23x<HMul>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002780 break;
2781 }
2782
2783 case Instruction::MUL_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002784 Binop_23x<HMul>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002785 break;
2786 }
2787
2788 case Instruction::MUL_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002789 Binop_23x<HMul>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002790 break;
2791 }
2792
2793 case Instruction::MUL_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002794 Binop_23x<HMul>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002795 break;
2796 }
2797
2798 case Instruction::DIV_INT: {
2799 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002800 dex_pc, DataType::Type::kInt32, false, true);
David Brazdildee58d62016-04-07 09:54:26 +00002801 break;
2802 }
2803
2804 case Instruction::DIV_LONG: {
2805 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002806 dex_pc, DataType::Type::kInt64, false, true);
David Brazdildee58d62016-04-07 09:54:26 +00002807 break;
2808 }
2809
2810 case Instruction::DIV_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002811 Binop_23x<HDiv>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002812 break;
2813 }
2814
2815 case Instruction::DIV_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002816 Binop_23x<HDiv>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002817 break;
2818 }
2819
2820 case Instruction::REM_INT: {
2821 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002822 dex_pc, DataType::Type::kInt32, false, false);
David Brazdildee58d62016-04-07 09:54:26 +00002823 break;
2824 }
2825
2826 case Instruction::REM_LONG: {
2827 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002828 dex_pc, DataType::Type::kInt64, false, false);
David Brazdildee58d62016-04-07 09:54:26 +00002829 break;
2830 }
2831
2832 case Instruction::REM_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002833 Binop_23x<HRem>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002834 break;
2835 }
2836
2837 case Instruction::REM_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002838 Binop_23x<HRem>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002839 break;
2840 }
2841
2842 case Instruction::AND_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002843 Binop_23x<HAnd>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002844 break;
2845 }
2846
2847 case Instruction::AND_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002848 Binop_23x<HAnd>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002849 break;
2850 }
2851
2852 case Instruction::SHL_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002853 Binop_23x_shift<HShl>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002854 break;
2855 }
2856
2857 case Instruction::SHL_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002858 Binop_23x_shift<HShl>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002859 break;
2860 }
2861
2862 case Instruction::SHR_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002863 Binop_23x_shift<HShr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002864 break;
2865 }
2866
2867 case Instruction::SHR_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002868 Binop_23x_shift<HShr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002869 break;
2870 }
2871
2872 case Instruction::USHR_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002873 Binop_23x_shift<HUShr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002874 break;
2875 }
2876
2877 case Instruction::USHR_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002878 Binop_23x_shift<HUShr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002879 break;
2880 }
2881
2882 case Instruction::OR_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002883 Binop_23x<HOr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002884 break;
2885 }
2886
2887 case Instruction::OR_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002888 Binop_23x<HOr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002889 break;
2890 }
2891
2892 case Instruction::XOR_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002893 Binop_23x<HXor>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002894 break;
2895 }
2896
2897 case Instruction::XOR_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002898 Binop_23x<HXor>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002899 break;
2900 }
2901
2902 case Instruction::ADD_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002903 Binop_12x<HAdd>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002904 break;
2905 }
2906
2907 case Instruction::ADD_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002908 Binop_12x<HAdd>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002909 break;
2910 }
2911
2912 case Instruction::ADD_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002913 Binop_12x<HAdd>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002914 break;
2915 }
2916
2917 case Instruction::SUB_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002918 Binop_12x<HSub>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002919 break;
2920 }
2921
2922 case Instruction::SUB_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002923 Binop_12x<HSub>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002924 break;
2925 }
2926
2927 case Instruction::SUB_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002928 Binop_12x<HSub>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002929 break;
2930 }
2931
2932 case Instruction::SUB_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002933 Binop_12x<HSub>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002934 break;
2935 }
2936
2937 case Instruction::MUL_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002938 Binop_12x<HMul>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002939 break;
2940 }
2941
2942 case Instruction::MUL_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002943 Binop_12x<HMul>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002944 break;
2945 }
2946
2947 case Instruction::MUL_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002948 Binop_12x<HMul>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002949 break;
2950 }
2951
2952 case Instruction::MUL_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002953 Binop_12x<HMul>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002954 break;
2955 }
2956
2957 case Instruction::DIV_INT_2ADDR: {
2958 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002959 dex_pc, DataType::Type::kInt32, false, true);
David Brazdildee58d62016-04-07 09:54:26 +00002960 break;
2961 }
2962
2963 case Instruction::DIV_LONG_2ADDR: {
2964 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002965 dex_pc, DataType::Type::kInt64, false, true);
David Brazdildee58d62016-04-07 09:54:26 +00002966 break;
2967 }
2968
2969 case Instruction::REM_INT_2ADDR: {
2970 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002971 dex_pc, DataType::Type::kInt32, false, false);
David Brazdildee58d62016-04-07 09:54:26 +00002972 break;
2973 }
2974
2975 case Instruction::REM_LONG_2ADDR: {
2976 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002977 dex_pc, DataType::Type::kInt64, false, false);
David Brazdildee58d62016-04-07 09:54:26 +00002978 break;
2979 }
2980
2981 case Instruction::REM_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002982 Binop_12x<HRem>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002983 break;
2984 }
2985
2986 case Instruction::REM_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002987 Binop_12x<HRem>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002988 break;
2989 }
2990
2991 case Instruction::SHL_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002992 Binop_12x_shift<HShl>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002993 break;
2994 }
2995
2996 case Instruction::SHL_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002997 Binop_12x_shift<HShl>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002998 break;
2999 }
3000
3001 case Instruction::SHR_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003002 Binop_12x_shift<HShr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003003 break;
3004 }
3005
3006 case Instruction::SHR_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003007 Binop_12x_shift<HShr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003008 break;
3009 }
3010
3011 case Instruction::USHR_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003012 Binop_12x_shift<HUShr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003013 break;
3014 }
3015
3016 case Instruction::USHR_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003017 Binop_12x_shift<HUShr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003018 break;
3019 }
3020
3021 case Instruction::DIV_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003022 Binop_12x<HDiv>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003023 break;
3024 }
3025
3026 case Instruction::DIV_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003027 Binop_12x<HDiv>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003028 break;
3029 }
3030
3031 case Instruction::AND_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003032 Binop_12x<HAnd>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003033 break;
3034 }
3035
3036 case Instruction::AND_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003037 Binop_12x<HAnd>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003038 break;
3039 }
3040
3041 case Instruction::OR_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003042 Binop_12x<HOr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003043 break;
3044 }
3045
3046 case Instruction::OR_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003047 Binop_12x<HOr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003048 break;
3049 }
3050
3051 case Instruction::XOR_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003052 Binop_12x<HXor>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003053 break;
3054 }
3055
3056 case Instruction::XOR_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003057 Binop_12x<HXor>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003058 break;
3059 }
3060
3061 case Instruction::ADD_INT_LIT16: {
3062 Binop_22s<HAdd>(instruction, false, dex_pc);
3063 break;
3064 }
3065
3066 case Instruction::AND_INT_LIT16: {
3067 Binop_22s<HAnd>(instruction, false, dex_pc);
3068 break;
3069 }
3070
3071 case Instruction::OR_INT_LIT16: {
3072 Binop_22s<HOr>(instruction, false, dex_pc);
3073 break;
3074 }
3075
3076 case Instruction::XOR_INT_LIT16: {
3077 Binop_22s<HXor>(instruction, false, dex_pc);
3078 break;
3079 }
3080
3081 case Instruction::RSUB_INT: {
3082 Binop_22s<HSub>(instruction, true, dex_pc);
3083 break;
3084 }
3085
3086 case Instruction::MUL_INT_LIT16: {
3087 Binop_22s<HMul>(instruction, false, dex_pc);
3088 break;
3089 }
3090
3091 case Instruction::ADD_INT_LIT8: {
3092 Binop_22b<HAdd>(instruction, false, dex_pc);
3093 break;
3094 }
3095
3096 case Instruction::AND_INT_LIT8: {
3097 Binop_22b<HAnd>(instruction, false, dex_pc);
3098 break;
3099 }
3100
3101 case Instruction::OR_INT_LIT8: {
3102 Binop_22b<HOr>(instruction, false, dex_pc);
3103 break;
3104 }
3105
3106 case Instruction::XOR_INT_LIT8: {
3107 Binop_22b<HXor>(instruction, false, dex_pc);
3108 break;
3109 }
3110
3111 case Instruction::RSUB_INT_LIT8: {
3112 Binop_22b<HSub>(instruction, true, dex_pc);
3113 break;
3114 }
3115
3116 case Instruction::MUL_INT_LIT8: {
3117 Binop_22b<HMul>(instruction, false, dex_pc);
3118 break;
3119 }
3120
3121 case Instruction::DIV_INT_LIT16:
3122 case Instruction::DIV_INT_LIT8: {
3123 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003124 dex_pc, DataType::Type::kInt32, true, true);
David Brazdildee58d62016-04-07 09:54:26 +00003125 break;
3126 }
3127
3128 case Instruction::REM_INT_LIT16:
3129 case Instruction::REM_INT_LIT8: {
3130 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003131 dex_pc, DataType::Type::kInt32, true, false);
David Brazdildee58d62016-04-07 09:54:26 +00003132 break;
3133 }
3134
3135 case Instruction::SHL_INT_LIT8: {
3136 Binop_22b<HShl>(instruction, false, dex_pc);
3137 break;
3138 }
3139
3140 case Instruction::SHR_INT_LIT8: {
3141 Binop_22b<HShr>(instruction, false, dex_pc);
3142 break;
3143 }
3144
3145 case Instruction::USHR_INT_LIT8: {
3146 Binop_22b<HUShr>(instruction, false, dex_pc);
3147 break;
3148 }
3149
3150 case Instruction::NEW_INSTANCE: {
Igor Murashkin79d8fa72017-04-18 09:37:23 -07003151 HNewInstance* new_instance =
3152 BuildNewInstance(dex::TypeIndex(instruction.VRegB_21c()), dex_pc);
3153 DCHECK(new_instance != nullptr);
3154
David Brazdildee58d62016-04-07 09:54:26 +00003155 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
Igor Murashkin79d8fa72017-04-18 09:37:23 -07003156 BuildConstructorFenceForAllocation(new_instance);
David Brazdildee58d62016-04-07 09:54:26 +00003157 break;
3158 }
3159
3160 case Instruction::NEW_ARRAY: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08003161 dex::TypeIndex type_index(instruction.VRegC_22c());
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003162 HInstruction* length = LoadLocal(instruction.VRegB_22c(), DataType::Type::kInt32);
Vladimir Markob5461632018-10-15 14:24:21 +01003163 HNewArray* new_array = BuildNewArray(dex_pc, type_index, length);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07003164
David Brazdildee58d62016-04-07 09:54:26 +00003165 UpdateLocal(instruction.VRegA_22c(), current_block_->GetLastInstruction());
Igor Murashkin79d8fa72017-04-18 09:37:23 -07003166 BuildConstructorFenceForAllocation(new_array);
David Brazdildee58d62016-04-07 09:54:26 +00003167 break;
3168 }
3169
3170 case Instruction::FILLED_NEW_ARRAY: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08003171 dex::TypeIndex type_index(instruction.VRegB_35c());
David Brazdildee58d62016-04-07 09:54:26 +00003172 uint32_t args[5];
Treehugger Robot2c5827a2018-05-17 22:26:08 +00003173 uint32_t number_of_vreg_arguments = instruction.GetVarArgs(args);
3174 VarArgsInstructionOperands operands(args, number_of_vreg_arguments);
3175 HNewArray* new_array = BuildFilledNewArray(dex_pc, type_index, operands);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07003176 BuildConstructorFenceForAllocation(new_array);
David Brazdildee58d62016-04-07 09:54:26 +00003177 break;
3178 }
3179
3180 case Instruction::FILLED_NEW_ARRAY_RANGE: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08003181 dex::TypeIndex type_index(instruction.VRegB_3rc());
Treehugger Robot2c5827a2018-05-17 22:26:08 +00003182 RangeInstructionOperands operands(instruction.VRegC_3rc(), instruction.VRegA_3rc());
3183 HNewArray* new_array = BuildFilledNewArray(dex_pc, type_index, operands);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07003184 BuildConstructorFenceForAllocation(new_array);
David Brazdildee58d62016-04-07 09:54:26 +00003185 break;
3186 }
3187
3188 case Instruction::FILL_ARRAY_DATA: {
3189 BuildFillArrayData(instruction, dex_pc);
3190 break;
3191 }
3192
3193 case Instruction::MOVE_RESULT:
3194 case Instruction::MOVE_RESULT_WIDE:
3195 case Instruction::MOVE_RESULT_OBJECT: {
3196 DCHECK(latest_result_ != nullptr);
3197 UpdateLocal(instruction.VRegA(), latest_result_);
3198 latest_result_ = nullptr;
3199 break;
3200 }
3201
3202 case Instruction::CMP_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003203 Binop_23x_cmp(instruction, DataType::Type::kInt64, ComparisonBias::kNoBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003204 break;
3205 }
3206
3207 case Instruction::CMPG_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003208 Binop_23x_cmp(instruction, DataType::Type::kFloat32, ComparisonBias::kGtBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003209 break;
3210 }
3211
3212 case Instruction::CMPG_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003213 Binop_23x_cmp(instruction, DataType::Type::kFloat64, ComparisonBias::kGtBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003214 break;
3215 }
3216
3217 case Instruction::CMPL_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003218 Binop_23x_cmp(instruction, DataType::Type::kFloat32, ComparisonBias::kLtBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003219 break;
3220 }
3221
3222 case Instruction::CMPL_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003223 Binop_23x_cmp(instruction, DataType::Type::kFloat64, ComparisonBias::kLtBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003224 break;
3225 }
3226
3227 case Instruction::NOP:
3228 break;
3229
3230 case Instruction::IGET:
3231 case Instruction::IGET_QUICK:
3232 case Instruction::IGET_WIDE:
3233 case Instruction::IGET_WIDE_QUICK:
3234 case Instruction::IGET_OBJECT:
3235 case Instruction::IGET_OBJECT_QUICK:
3236 case Instruction::IGET_BOOLEAN:
3237 case Instruction::IGET_BOOLEAN_QUICK:
3238 case Instruction::IGET_BYTE:
3239 case Instruction::IGET_BYTE_QUICK:
3240 case Instruction::IGET_CHAR:
3241 case Instruction::IGET_CHAR_QUICK:
3242 case Instruction::IGET_SHORT:
3243 case Instruction::IGET_SHORT_QUICK: {
Andreas Gampe3db70682018-12-26 15:12:03 -08003244 if (!BuildInstanceFieldAccess(instruction, dex_pc, /* is_put= */ false, quicken_index)) {
David Brazdildee58d62016-04-07 09:54:26 +00003245 return false;
3246 }
3247 break;
3248 }
3249
3250 case Instruction::IPUT:
3251 case Instruction::IPUT_QUICK:
3252 case Instruction::IPUT_WIDE:
3253 case Instruction::IPUT_WIDE_QUICK:
3254 case Instruction::IPUT_OBJECT:
3255 case Instruction::IPUT_OBJECT_QUICK:
3256 case Instruction::IPUT_BOOLEAN:
3257 case Instruction::IPUT_BOOLEAN_QUICK:
3258 case Instruction::IPUT_BYTE:
3259 case Instruction::IPUT_BYTE_QUICK:
3260 case Instruction::IPUT_CHAR:
3261 case Instruction::IPUT_CHAR_QUICK:
3262 case Instruction::IPUT_SHORT:
3263 case Instruction::IPUT_SHORT_QUICK: {
Andreas Gampe3db70682018-12-26 15:12:03 -08003264 if (!BuildInstanceFieldAccess(instruction, dex_pc, /* is_put= */ true, quicken_index)) {
David Brazdildee58d62016-04-07 09:54:26 +00003265 return false;
3266 }
3267 break;
3268 }
3269
3270 case Instruction::SGET:
3271 case Instruction::SGET_WIDE:
3272 case Instruction::SGET_OBJECT:
3273 case Instruction::SGET_BOOLEAN:
3274 case Instruction::SGET_BYTE:
3275 case Instruction::SGET_CHAR:
3276 case Instruction::SGET_SHORT: {
Andreas Gampe3db70682018-12-26 15:12:03 -08003277 BuildStaticFieldAccess(instruction, dex_pc, /* is_put= */ false);
David Brazdildee58d62016-04-07 09:54:26 +00003278 break;
3279 }
3280
3281 case Instruction::SPUT:
3282 case Instruction::SPUT_WIDE:
3283 case Instruction::SPUT_OBJECT:
3284 case Instruction::SPUT_BOOLEAN:
3285 case Instruction::SPUT_BYTE:
3286 case Instruction::SPUT_CHAR:
3287 case Instruction::SPUT_SHORT: {
Andreas Gampe3db70682018-12-26 15:12:03 -08003288 BuildStaticFieldAccess(instruction, dex_pc, /* is_put= */ true);
David Brazdildee58d62016-04-07 09:54:26 +00003289 break;
3290 }
3291
3292#define ARRAY_XX(kind, anticipated_type) \
3293 case Instruction::AGET##kind: { \
3294 BuildArrayAccess(instruction, dex_pc, false, anticipated_type); \
3295 break; \
3296 } \
3297 case Instruction::APUT##kind: { \
3298 BuildArrayAccess(instruction, dex_pc, true, anticipated_type); \
3299 break; \
3300 }
3301
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003302 ARRAY_XX(, DataType::Type::kInt32);
3303 ARRAY_XX(_WIDE, DataType::Type::kInt64);
3304 ARRAY_XX(_OBJECT, DataType::Type::kReference);
3305 ARRAY_XX(_BOOLEAN, DataType::Type::kBool);
3306 ARRAY_XX(_BYTE, DataType::Type::kInt8);
3307 ARRAY_XX(_CHAR, DataType::Type::kUint16);
3308 ARRAY_XX(_SHORT, DataType::Type::kInt16);
David Brazdildee58d62016-04-07 09:54:26 +00003309
3310 case Instruction::ARRAY_LENGTH: {
David Brazdilc120bbe2016-04-22 16:57:00 +01003311 HInstruction* object = LoadNullCheckedLocal(instruction.VRegB_12x(), dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01003312 AppendInstruction(new (allocator_) HArrayLength(object, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00003313 UpdateLocal(instruction.VRegA_12x(), current_block_->GetLastInstruction());
3314 break;
3315 }
3316
3317 case Instruction::CONST_STRING: {
Andreas Gampe8a0128a2016-11-28 07:38:35 -08003318 dex::StringIndex string_index(instruction.VRegB_21c());
Vladimir Marko28e012a2017-12-07 11:22:59 +00003319 BuildLoadString(string_index, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003320 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
3321 break;
3322 }
3323
3324 case Instruction::CONST_STRING_JUMBO: {
Andreas Gampe8a0128a2016-11-28 07:38:35 -08003325 dex::StringIndex string_index(instruction.VRegB_31c());
Vladimir Marko28e012a2017-12-07 11:22:59 +00003326 BuildLoadString(string_index, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003327 UpdateLocal(instruction.VRegA_31c(), current_block_->GetLastInstruction());
3328 break;
3329 }
3330
3331 case Instruction::CONST_CLASS: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08003332 dex::TypeIndex type_index(instruction.VRegB_21c());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00003333 BuildLoadClass(type_index, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003334 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
3335 break;
3336 }
3337
Orion Hodsondbaa5c72018-05-10 08:22:46 +01003338 case Instruction::CONST_METHOD_HANDLE: {
3339 uint16_t method_handle_idx = instruction.VRegB_21c();
3340 BuildLoadMethodHandle(method_handle_idx, dex_pc);
3341 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
3342 break;
3343 }
3344
Orion Hodson18259d72018-04-12 11:18:23 +01003345 case Instruction::CONST_METHOD_TYPE: {
Orion Hodson06d10a72018-05-14 08:53:38 +01003346 dex::ProtoIndex proto_idx(instruction.VRegB_21c());
Orion Hodson18259d72018-04-12 11:18:23 +01003347 BuildLoadMethodType(proto_idx, dex_pc);
3348 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
3349 break;
3350 }
3351
David Brazdildee58d62016-04-07 09:54:26 +00003352 case Instruction::MOVE_EXCEPTION: {
Vladimir Markoca6fff82017-10-03 14:49:14 +01003353 AppendInstruction(new (allocator_) HLoadException(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00003354 UpdateLocal(instruction.VRegA_11x(), current_block_->GetLastInstruction());
Vladimir Markoca6fff82017-10-03 14:49:14 +01003355 AppendInstruction(new (allocator_) HClearException(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00003356 break;
3357 }
3358
3359 case Instruction::THROW: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003360 HInstruction* exception = LoadLocal(instruction.VRegA_11x(), DataType::Type::kReference);
Vladimir Markoca6fff82017-10-03 14:49:14 +01003361 AppendInstruction(new (allocator_) HThrow(exception, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00003362 // We finished building this block. Set the current block to null to avoid
3363 // adding dead instructions to it.
3364 current_block_ = nullptr;
3365 break;
3366 }
3367
3368 case Instruction::INSTANCE_OF: {
3369 uint8_t destination = instruction.VRegA_22c();
3370 uint8_t reference = instruction.VRegB_22c();
Andreas Gampea5b09a62016-11-17 15:21:22 -08003371 dex::TypeIndex type_index(instruction.VRegC_22c());
David Brazdildee58d62016-04-07 09:54:26 +00003372 BuildTypeCheck(instruction, destination, reference, type_index, dex_pc);
3373 break;
3374 }
3375
3376 case Instruction::CHECK_CAST: {
3377 uint8_t reference = instruction.VRegA_21c();
Andreas Gampea5b09a62016-11-17 15:21:22 -08003378 dex::TypeIndex type_index(instruction.VRegB_21c());
David Brazdildee58d62016-04-07 09:54:26 +00003379 BuildTypeCheck(instruction, -1, reference, type_index, dex_pc);
3380 break;
3381 }
3382
3383 case Instruction::MONITOR_ENTER: {
Vladimir Markoca6fff82017-10-03 14:49:14 +01003384 AppendInstruction(new (allocator_) HMonitorOperation(
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003385 LoadLocal(instruction.VRegA_11x(), DataType::Type::kReference),
David Brazdildee58d62016-04-07 09:54:26 +00003386 HMonitorOperation::OperationKind::kEnter,
3387 dex_pc));
Artem Serov2808be82018-12-20 19:15:11 +00003388 graph_->SetHasMonitorOperations(true);
David Brazdildee58d62016-04-07 09:54:26 +00003389 break;
3390 }
3391
3392 case Instruction::MONITOR_EXIT: {
Vladimir Markoca6fff82017-10-03 14:49:14 +01003393 AppendInstruction(new (allocator_) HMonitorOperation(
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003394 LoadLocal(instruction.VRegA_11x(), DataType::Type::kReference),
David Brazdildee58d62016-04-07 09:54:26 +00003395 HMonitorOperation::OperationKind::kExit,
3396 dex_pc));
Artem Serov2808be82018-12-20 19:15:11 +00003397 graph_->SetHasMonitorOperations(true);
David Brazdildee58d62016-04-07 09:54:26 +00003398 break;
3399 }
3400
3401 case Instruction::SPARSE_SWITCH:
3402 case Instruction::PACKED_SWITCH: {
3403 BuildSwitch(instruction, dex_pc);
3404 break;
3405 }
3406
Orion Hodson4c8e12e2018-05-18 08:33:20 +01003407 case Instruction::UNUSED_3E:
3408 case Instruction::UNUSED_3F:
3409 case Instruction::UNUSED_40:
3410 case Instruction::UNUSED_41:
3411 case Instruction::UNUSED_42:
3412 case Instruction::UNUSED_43:
3413 case Instruction::UNUSED_79:
3414 case Instruction::UNUSED_7A:
3415 case Instruction::UNUSED_F3:
3416 case Instruction::UNUSED_F4:
3417 case Instruction::UNUSED_F5:
3418 case Instruction::UNUSED_F6:
3419 case Instruction::UNUSED_F7:
3420 case Instruction::UNUSED_F8:
3421 case Instruction::UNUSED_F9: {
David Brazdildee58d62016-04-07 09:54:26 +00003422 VLOG(compiler) << "Did not compile "
David Sehr709b0702016-10-13 09:12:37 -07003423 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
David Brazdildee58d62016-04-07 09:54:26 +00003424 << " because of unhandled instruction "
3425 << instruction.Name();
Igor Murashkin1e065a52017-08-09 13:20:34 -07003426 MaybeRecordStat(compilation_stats_,
3427 MethodCompilationStat::kNotCompiledUnhandledInstruction);
David Brazdildee58d62016-04-07 09:54:26 +00003428 return false;
Orion Hodson4c8e12e2018-05-18 08:33:20 +01003429 }
David Brazdildee58d62016-04-07 09:54:26 +00003430 }
3431 return true;
3432} // NOLINT(readability/fn_size)
3433
Vladimir Marko8d6768d2017-03-14 10:13:21 +00003434ObjPtr<mirror::Class> HInstructionBuilder::LookupResolvedType(
3435 dex::TypeIndex type_index,
3436 const DexCompilationUnit& compilation_unit) const {
Vladimir Marko666ee3d2017-12-11 18:37:36 +00003437 return compilation_unit.GetClassLinker()->LookupResolvedType(
Vladimir Marko8d6768d2017-03-14 10:13:21 +00003438 type_index, compilation_unit.GetDexCache().Get(), compilation_unit.GetClassLoader().Get());
3439}
3440
3441ObjPtr<mirror::Class> HInstructionBuilder::LookupReferrerClass() const {
3442 // TODO: Cache the result in a Handle<mirror::Class>.
Andreas Gampe3f1dcd32018-12-28 09:39:56 -08003443 const dex::MethodId& method_id =
Vladimir Marko8d6768d2017-03-14 10:13:21 +00003444 dex_compilation_unit_->GetDexFile()->GetMethodId(dex_compilation_unit_->GetDexMethodIndex());
3445 return LookupResolvedType(method_id.class_idx_, *dex_compilation_unit_);
3446}
3447
David Brazdildee58d62016-04-07 09:54:26 +00003448} // namespace art