blob: 034761db5771b3410a5260a782d2e9bfdbb0649c [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"
22#include "block_builder.h"
David Brazdildee58d62016-04-07 09:54:26 +000023#include "class_linker.h"
Vladimir Marko0ebe0d82017-09-21 22:50:39 +010024#include "data_type-inl.h"
David Sehr312f3b22018-03-19 08:39:26 -070025#include "dex/bytecode_utils.h"
David Sehr9e734c72018-01-04 17:56:19 -080026#include "dex/dex_instruction-inl.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010027#include "driver/compiler_driver-inl.h"
28#include "driver/dex_compilation_unit.h"
David Brazdildee58d62016-04-07 09:54:26 +000029#include "driver/compiler_options.h"
Andreas Gampe75a7db62016-09-26 12:04:26 -070030#include "imtable-inl.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010031#include "mirror/dex_cache.h"
Nicolas Geoffray58cc1cb2017-11-20 13:27:29 +000032#include "oat_file.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010033#include "optimizing_compiler_stats.h"
Mathieu Chartierde4b08f2017-07-10 14:13:41 -070034#include "quicken_info.h"
Mathieu Chartier0795f232016-09-27 18:43:30 -070035#include "scoped_thread_state_change-inl.h"
Andreas Gampe8cf9cb32017-07-19 09:28:38 -070036#include "sharpening.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010037#include "ssa_builder.h"
Andreas Gampea7c83ac2017-09-11 08:14:23 -070038#include "well_known_classes.h"
David Brazdildee58d62016-04-07 09:54:26 +000039
40namespace art {
41
Mathieu Chartier808c7a52017-12-15 11:19:33 -080042HInstructionBuilder::HInstructionBuilder(HGraph* graph,
43 HBasicBlockBuilder* block_builder,
44 SsaBuilder* ssa_builder,
45 const DexFile* dex_file,
46 const CodeItemDebugInfoAccessor& accessor,
47 DataType::Type return_type,
48 const DexCompilationUnit* dex_compilation_unit,
49 const DexCompilationUnit* outer_compilation_unit,
50 CompilerDriver* compiler_driver,
51 CodeGenerator* code_generator,
Mathieu Chartier210531f2018-01-12 10:15:51 -080052 ArrayRef<const uint8_t> interpreter_metadata,
Mathieu Chartier808c7a52017-12-15 11:19:33 -080053 OptimizingCompilerStats* compiler_stats,
54 VariableSizedHandleScope* handles,
55 ScopedArenaAllocator* local_allocator)
56 : allocator_(graph->GetAllocator()),
57 graph_(graph),
58 handles_(handles),
59 dex_file_(dex_file),
60 code_item_accessor_(accessor),
61 return_type_(return_type),
62 block_builder_(block_builder),
63 ssa_builder_(ssa_builder),
64 compiler_driver_(compiler_driver),
65 code_generator_(code_generator),
66 dex_compilation_unit_(dex_compilation_unit),
67 outer_compilation_unit_(outer_compilation_unit),
68 quicken_info_(interpreter_metadata),
69 compilation_stats_(compiler_stats),
70 local_allocator_(local_allocator),
71 locals_for_(local_allocator->Adapter(kArenaAllocGraphBuilder)),
72 current_block_(nullptr),
73 current_locals_(nullptr),
74 latest_result_(nullptr),
75 current_this_parameter_(nullptr),
76 loop_headers_(local_allocator->Adapter(kArenaAllocGraphBuilder)) {
77 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.
322 const bool native_debuggable = compiler_driver_ != nullptr &&
323 compiler_driver_->GetCompilerOptions().GetNativeDebuggable();
324 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
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800384 if (!ProcessDexInstruction(pair.Inst(), dex_pc, quicken_index)) {
David Brazdildee58d62016-04-07 09:54:26 +0000385 return false;
386 }
Mathieu Chartierde4b08f2017-07-10 14:13:41 -0700387
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800388 if (QuickenInfoTable::NeedsIndexForInstruction(&pair.Inst())) {
Mathieu Chartierde4b08f2017-07-10 14:13:41 -0700389 ++quicken_index;
390 }
David Brazdildee58d62016-04-07 09:54:26 +0000391 }
392
393 if (current_block_ != nullptr) {
394 // Branching instructions clear current_block, so we know the last
395 // instruction of the current block is not a branching instruction.
396 // We add an unconditional Goto to the next block.
397 DCHECK_EQ(current_block_->GetSuccessors().size(), 1u);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100398 AppendInstruction(new (allocator_) HGoto());
David Brazdildee58d62016-04-07 09:54:26 +0000399 }
400 }
401
402 SetLoopHeaderPhiInputs();
403
404 return true;
405}
406
Vladimir Marko92f7f3c2017-10-31 11:38:30 +0000407void HInstructionBuilder::BuildIntrinsic(ArtMethod* method) {
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800408 DCHECK(!code_item_accessor_.HasCodeItem());
Vladimir Marko92f7f3c2017-10-31 11:38:30 +0000409 DCHECK(method->IsIntrinsic());
410
411 locals_for_.resize(
412 graph_->GetBlocks().size(),
413 ScopedArenaVector<HInstruction*>(local_allocator_->Adapter(kArenaAllocGraphBuilder)));
414
415 // Fill the entry block. Do not add suspend check, we do not want a suspend
416 // check in intrinsics; intrinsic methods are supposed to be fast.
417 current_block_ = graph_->GetEntryBlock();
418 InitializeBlockLocals();
419 InitializeParameters();
420 AppendInstruction(new (allocator_) HGoto(0u));
421
422 // Fill the body.
423 current_block_ = current_block_->GetSingleSuccessor();
424 InitializeBlockLocals();
425 DCHECK(!IsBlockPopulated(current_block_));
426
427 // Add the invoke and return instruction. Use HInvokeStaticOrDirect even
428 // for methods that would normally use an HInvokeVirtual (sharpen the call).
429 size_t in_vregs = graph_->GetNumberOfInVRegs();
430 size_t number_of_arguments =
431 in_vregs - std::count(current_locals_->end() - in_vregs, current_locals_->end(), nullptr);
432 uint32_t method_idx = dex_compilation_unit_->GetDexMethodIndex();
433 MethodReference target_method(dex_file_, method_idx);
434 HInvokeStaticOrDirect::DispatchInfo dispatch_info = {
435 HInvokeStaticOrDirect::MethodLoadKind::kRuntimeCall,
436 HInvokeStaticOrDirect::CodePtrLocation::kCallArtMethod,
437 /* method_load_data */ 0u
438 };
439 InvokeType invoke_type = dex_compilation_unit_->IsStatic() ? kStatic : kDirect;
440 HInvokeStaticOrDirect* invoke = new (allocator_) HInvokeStaticOrDirect(
441 allocator_,
442 number_of_arguments,
443 return_type_,
444 kNoDexPc,
445 method_idx,
446 method,
447 dispatch_info,
448 invoke_type,
449 target_method,
450 HInvokeStaticOrDirect::ClinitCheckRequirement::kNone);
Treehugger Robot2c5827a2018-05-17 22:26:08 +0000451 RangeInstructionOperands operands(graph_->GetNumberOfVRegs() - in_vregs, in_vregs);
Orion Hodson4c8e12e2018-05-18 08:33:20 +0100452 HandleInvoke(invoke, operands, dex_file_->GetMethodShorty(method_idx), /* is_unresolved */ false);
Vladimir Marko92f7f3c2017-10-31 11:38:30 +0000453
454 // Add the return instruction.
455 if (return_type_ == DataType::Type::kVoid) {
456 AppendInstruction(new (allocator_) HReturnVoid());
457 } else {
458 AppendInstruction(new (allocator_) HReturn(invoke));
459 }
460
461 // Fill the exit block.
462 DCHECK_EQ(current_block_->GetSingleSuccessor(), graph_->GetExitBlock());
463 current_block_ = graph_->GetExitBlock();
464 InitializeBlockLocals();
465 AppendInstruction(new (allocator_) HExit());
466}
467
Vladimir Marko69d310e2017-10-09 14:12:23 +0100468ArenaBitVector* HInstructionBuilder::FindNativeDebugInfoLocations() {
Vladimir Marko69d310e2017-10-09 14:12:23 +0100469 ArenaBitVector* locations = ArenaBitVector::Create(local_allocator_,
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800470 code_item_accessor_.InsnsSizeInCodeUnits(),
Vladimir Marko69d310e2017-10-09 14:12:23 +0100471 /* expandable */ false,
472 kArenaAllocGraphBuilder);
473 locations->ClearAllBits();
Mathieu Chartier3e2e1232018-09-11 12:35:30 -0700474 // The visitor gets called when the line number changes.
475 // In other words, it marks the start of new java statement.
476 code_item_accessor_.DecodeDebugPositionInfo([&](const DexFile::PositionInfo& entry) {
477 locations->SetBit(entry.address_);
478 return false;
479 });
David Brazdildee58d62016-04-07 09:54:26 +0000480 // Instruction-specific tweaks.
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800481 for (const DexInstructionPcPair& inst : code_item_accessor_) {
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800482 switch (inst->Opcode()) {
David Brazdildee58d62016-04-07 09:54:26 +0000483 case Instruction::MOVE_EXCEPTION: {
484 // Stop in native debugger after the exception has been moved.
485 // The compiler also expects the move at the start of basic block so
486 // we do not want to interfere by inserting native-debug-info before it.
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800487 locations->ClearBit(inst.DexPc());
488 DexInstructionIterator next = std::next(DexInstructionIterator(inst));
489 DCHECK(next.DexPc() != inst.DexPc());
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800490 if (next != code_item_accessor_.end()) {
Mathieu Chartier2b2bef22017-10-26 17:10:19 -0700491 locations->SetBit(next.DexPc());
David Brazdildee58d62016-04-07 09:54:26 +0000492 }
493 break;
494 }
495 default:
496 break;
497 }
498 }
Vladimir Marko69d310e2017-10-09 14:12:23 +0100499 return locations;
David Brazdildee58d62016-04-07 09:54:26 +0000500}
501
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100502HInstruction* HInstructionBuilder::LoadLocal(uint32_t reg_number, DataType::Type type) const {
David Brazdildee58d62016-04-07 09:54:26 +0000503 HInstruction* value = (*current_locals_)[reg_number];
504 DCHECK(value != nullptr);
505
506 // If the operation requests a specific type, we make sure its input is of that type.
507 if (type != value->GetType()) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100508 if (DataType::IsFloatingPointType(type)) {
Aart Bik31883642016-06-06 15:02:44 -0700509 value = ssa_builder_->GetFloatOrDoubleEquivalent(value, type);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100510 } else if (type == DataType::Type::kReference) {
Aart Bik31883642016-06-06 15:02:44 -0700511 value = ssa_builder_->GetReferenceTypeEquivalent(value);
David Brazdildee58d62016-04-07 09:54:26 +0000512 }
Aart Bik31883642016-06-06 15:02:44 -0700513 DCHECK(value != nullptr);
David Brazdildee58d62016-04-07 09:54:26 +0000514 }
515
516 return value;
517}
518
519void HInstructionBuilder::UpdateLocal(uint32_t reg_number, HInstruction* stored_value) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100520 DataType::Type stored_type = stored_value->GetType();
521 DCHECK_NE(stored_type, DataType::Type::kVoid);
David Brazdildee58d62016-04-07 09:54:26 +0000522
523 // Storing into vreg `reg_number` may implicitly invalidate the surrounding
524 // registers. Consider the following cases:
525 // (1) Storing a wide value must overwrite previous values in both `reg_number`
526 // and `reg_number+1`. We store `nullptr` in `reg_number+1`.
527 // (2) If vreg `reg_number-1` holds a wide value, writing into `reg_number`
528 // must invalidate it. We store `nullptr` in `reg_number-1`.
529 // Consequently, storing a wide value into the high vreg of another wide value
530 // will invalidate both `reg_number-1` and `reg_number+1`.
531
532 if (reg_number != 0) {
533 HInstruction* local_low = (*current_locals_)[reg_number - 1];
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100534 if (local_low != nullptr && DataType::Is64BitType(local_low->GetType())) {
David Brazdildee58d62016-04-07 09:54:26 +0000535 // The vreg we are storing into was previously the high vreg of a pair.
536 // We need to invalidate its low vreg.
537 DCHECK((*current_locals_)[reg_number] == nullptr);
538 (*current_locals_)[reg_number - 1] = nullptr;
539 }
540 }
541
542 (*current_locals_)[reg_number] = stored_value;
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100543 if (DataType::Is64BitType(stored_type)) {
David Brazdildee58d62016-04-07 09:54:26 +0000544 // We are storing a pair. Invalidate the instruction in the high vreg.
545 (*current_locals_)[reg_number + 1] = nullptr;
546 }
547}
548
549void HInstructionBuilder::InitializeParameters() {
550 DCHECK(current_block_->IsEntryBlock());
551
Vladimir Marko69d310e2017-10-09 14:12:23 +0100552 // outer_compilation_unit_ is null only when unit testing.
553 if (outer_compilation_unit_ == nullptr) {
David Brazdildee58d62016-04-07 09:54:26 +0000554 return;
555 }
556
557 const char* shorty = dex_compilation_unit_->GetShorty();
558 uint16_t number_of_parameters = graph_->GetNumberOfInVRegs();
559 uint16_t locals_index = graph_->GetNumberOfLocalVRegs();
560 uint16_t parameter_index = 0;
561
562 const DexFile::MethodId& referrer_method_id =
563 dex_file_->GetMethodId(dex_compilation_unit_->GetDexMethodIndex());
564 if (!dex_compilation_unit_->IsStatic()) {
565 // Add the implicit 'this' argument, not expressed in the signature.
Vladimir Markoca6fff82017-10-03 14:49:14 +0100566 HParameterValue* parameter = new (allocator_) HParameterValue(*dex_file_,
David Brazdildee58d62016-04-07 09:54:26 +0000567 referrer_method_id.class_idx_,
568 parameter_index++,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100569 DataType::Type::kReference,
Igor Murashkind01745e2017-04-05 16:40:31 -0700570 /* is_this */ true);
David Brazdildee58d62016-04-07 09:54:26 +0000571 AppendInstruction(parameter);
572 UpdateLocal(locals_index++, parameter);
573 number_of_parameters--;
Igor Murashkind01745e2017-04-05 16:40:31 -0700574 current_this_parameter_ = parameter;
575 } else {
576 DCHECK(current_this_parameter_ == nullptr);
David Brazdildee58d62016-04-07 09:54:26 +0000577 }
578
579 const DexFile::ProtoId& proto = dex_file_->GetMethodPrototype(referrer_method_id);
580 const DexFile::TypeList* arg_types = dex_file_->GetProtoParameters(proto);
581 for (int i = 0, shorty_pos = 1; i < number_of_parameters; i++) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100582 HParameterValue* parameter = new (allocator_) HParameterValue(
David Brazdildee58d62016-04-07 09:54:26 +0000583 *dex_file_,
584 arg_types->GetTypeItem(shorty_pos - 1).type_idx_,
585 parameter_index++,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100586 DataType::FromShorty(shorty[shorty_pos]),
Igor Murashkind01745e2017-04-05 16:40:31 -0700587 /* is_this */ false);
David Brazdildee58d62016-04-07 09:54:26 +0000588 ++shorty_pos;
589 AppendInstruction(parameter);
590 // Store the parameter value in the local that the dex code will use
591 // to reference that parameter.
592 UpdateLocal(locals_index++, parameter);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100593 if (DataType::Is64BitType(parameter->GetType())) {
David Brazdildee58d62016-04-07 09:54:26 +0000594 i++;
595 locals_index++;
596 parameter_index++;
597 }
598 }
599}
600
601template<typename T>
602void HInstructionBuilder::If_22t(const Instruction& instruction, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100603 HInstruction* first = LoadLocal(instruction.VRegA(), DataType::Type::kInt32);
604 HInstruction* second = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100605 T* comparison = new (allocator_) T(first, second, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +0000606 AppendInstruction(comparison);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100607 AppendInstruction(new (allocator_) HIf(comparison, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000608 current_block_ = nullptr;
609}
610
611template<typename T>
612void HInstructionBuilder::If_21t(const Instruction& instruction, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100613 HInstruction* value = LoadLocal(instruction.VRegA(), DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100614 T* comparison = new (allocator_) T(value, graph_->GetIntConstant(0, dex_pc), dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +0000615 AppendInstruction(comparison);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100616 AppendInstruction(new (allocator_) HIf(comparison, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000617 current_block_ = nullptr;
618}
619
620template<typename T>
621void HInstructionBuilder::Unop_12x(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100622 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000623 uint32_t dex_pc) {
624 HInstruction* first = LoadLocal(instruction.VRegB(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100625 AppendInstruction(new (allocator_) T(type, first, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000626 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
627}
628
629void HInstructionBuilder::Conversion_12x(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100630 DataType::Type input_type,
631 DataType::Type result_type,
David Brazdildee58d62016-04-07 09:54:26 +0000632 uint32_t dex_pc) {
633 HInstruction* first = LoadLocal(instruction.VRegB(), input_type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100634 AppendInstruction(new (allocator_) HTypeConversion(result_type, first, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000635 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
636}
637
638template<typename T>
639void HInstructionBuilder::Binop_23x(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100640 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000641 uint32_t dex_pc) {
642 HInstruction* first = LoadLocal(instruction.VRegB(), type);
643 HInstruction* second = LoadLocal(instruction.VRegC(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100644 AppendInstruction(new (allocator_) T(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000645 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
646}
647
648template<typename T>
649void HInstructionBuilder::Binop_23x_shift(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100650 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000651 uint32_t dex_pc) {
652 HInstruction* first = LoadLocal(instruction.VRegB(), type);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100653 HInstruction* second = LoadLocal(instruction.VRegC(), DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100654 AppendInstruction(new (allocator_) T(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000655 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
656}
657
658void HInstructionBuilder::Binop_23x_cmp(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100659 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000660 ComparisonBias bias,
661 uint32_t dex_pc) {
662 HInstruction* first = LoadLocal(instruction.VRegB(), type);
663 HInstruction* second = LoadLocal(instruction.VRegC(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100664 AppendInstruction(new (allocator_) HCompare(type, first, second, bias, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000665 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
666}
667
668template<typename T>
669void HInstructionBuilder::Binop_12x_shift(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100670 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000671 uint32_t dex_pc) {
672 HInstruction* first = LoadLocal(instruction.VRegA(), type);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100673 HInstruction* second = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100674 AppendInstruction(new (allocator_) T(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000675 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
676}
677
678template<typename T>
679void HInstructionBuilder::Binop_12x(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100680 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000681 uint32_t dex_pc) {
682 HInstruction* first = LoadLocal(instruction.VRegA(), type);
683 HInstruction* second = LoadLocal(instruction.VRegB(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100684 AppendInstruction(new (allocator_) T(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000685 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
686}
687
688template<typename T>
689void HInstructionBuilder::Binop_22s(const Instruction& instruction, bool reverse, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100690 HInstruction* first = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
David Brazdildee58d62016-04-07 09:54:26 +0000691 HInstruction* second = graph_->GetIntConstant(instruction.VRegC_22s(), dex_pc);
692 if (reverse) {
693 std::swap(first, second);
694 }
Vladimir Markoca6fff82017-10-03 14:49:14 +0100695 AppendInstruction(new (allocator_) T(DataType::Type::kInt32, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000696 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
697}
698
699template<typename T>
700void HInstructionBuilder::Binop_22b(const Instruction& instruction, bool reverse, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100701 HInstruction* first = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
David Brazdildee58d62016-04-07 09:54:26 +0000702 HInstruction* second = graph_->GetIntConstant(instruction.VRegC_22b(), dex_pc);
703 if (reverse) {
704 std::swap(first, second);
705 }
Vladimir Markoca6fff82017-10-03 14:49:14 +0100706 AppendInstruction(new (allocator_) T(DataType::Type::kInt32, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000707 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
708}
709
Igor Murashkind01745e2017-04-05 16:40:31 -0700710// Does the method being compiled need any constructor barriers being inserted?
711// (Always 'false' for methods that aren't <init>.)
Mathieu Chartierc4ae9162016-04-07 13:19:19 -0700712static bool RequiresConstructorBarrier(const DexCompilationUnit* cu, CompilerDriver* driver) {
Igor Murashkin032cacd2017-04-06 14:40:08 -0700713 // Can be null in unit tests only.
714 if (UNLIKELY(cu == nullptr)) {
715 return false;
716 }
717
David Brazdildee58d62016-04-07 09:54:26 +0000718 Thread* self = Thread::Current();
719 return cu->IsConstructor()
Igor Murashkind01745e2017-04-05 16:40:31 -0700720 && !cu->IsStatic()
721 // RequiresConstructorBarrier must only be queried for <init> methods;
722 // it's effectively "false" for every other method.
723 //
724 // See CompilerDriver::RequiresConstructBarrier for more explanation.
Mathieu Chartierc4ae9162016-04-07 13:19:19 -0700725 && driver->RequiresConstructorBarrier(self, cu->GetDexFile(), cu->GetClassDefIndex());
David Brazdildee58d62016-04-07 09:54:26 +0000726}
727
728// Returns true if `block` has only one successor which starts at the next
729// dex_pc after `instruction` at `dex_pc`.
730static bool IsFallthroughInstruction(const Instruction& instruction,
731 uint32_t dex_pc,
732 HBasicBlock* block) {
733 uint32_t next_dex_pc = dex_pc + instruction.SizeInCodeUnits();
734 return block->GetSingleSuccessor()->GetDexPc() == next_dex_pc;
735}
736
737void HInstructionBuilder::BuildSwitch(const Instruction& instruction, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100738 HInstruction* value = LoadLocal(instruction.VRegA(), DataType::Type::kInt32);
David Brazdildee58d62016-04-07 09:54:26 +0000739 DexSwitchTable table(instruction, dex_pc);
740
741 if (table.GetNumEntries() == 0) {
742 // Empty Switch. Code falls through to the next block.
743 DCHECK(IsFallthroughInstruction(instruction, dex_pc, current_block_));
Vladimir Markoca6fff82017-10-03 14:49:14 +0100744 AppendInstruction(new (allocator_) HGoto(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000745 } else if (table.ShouldBuildDecisionTree()) {
746 for (DexSwitchTableIterator it(table); !it.Done(); it.Advance()) {
747 HInstruction* case_value = graph_->GetIntConstant(it.CurrentKey(), dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100748 HEqual* comparison = new (allocator_) HEqual(value, case_value, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +0000749 AppendInstruction(comparison);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100750 AppendInstruction(new (allocator_) HIf(comparison, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000751
752 if (!it.IsLast()) {
753 current_block_ = FindBlockStartingAt(it.GetDexPcForCurrentIndex());
754 }
755 }
756 } else {
757 AppendInstruction(
Vladimir Markoca6fff82017-10-03 14:49:14 +0100758 new (allocator_) HPackedSwitch(table.GetEntryAt(0), table.GetNumEntries(), value, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000759 }
760
761 current_block_ = nullptr;
762}
763
764void HInstructionBuilder::BuildReturn(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100765 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000766 uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100767 if (type == DataType::Type::kVoid) {
Igor Murashkind01745e2017-04-05 16:40:31 -0700768 // Only <init> (which is a return-void) could possibly have a constructor fence.
Igor Murashkin032cacd2017-04-06 14:40:08 -0700769 // This may insert additional redundant constructor fences from the super constructors.
770 // TODO: remove redundant constructor fences (b/36656456).
771 if (RequiresConstructorBarrier(dex_compilation_unit_, compiler_driver_)) {
Igor Murashkind01745e2017-04-05 16:40:31 -0700772 // Compiling instance constructor.
Vladimir Markoba118822017-06-12 15:41:56 +0100773 DCHECK_STREQ("<init>", graph_->GetMethodName());
Igor Murashkind01745e2017-04-05 16:40:31 -0700774
775 HInstruction* fence_target = current_this_parameter_;
776 DCHECK(fence_target != nullptr);
777
Vladimir Markoca6fff82017-10-03 14:49:14 +0100778 AppendInstruction(new (allocator_) HConstructorFence(fence_target, dex_pc, allocator_));
Igor Murashkin6ef45672017-08-08 13:59:55 -0700779 MaybeRecordStat(
780 compilation_stats_,
781 MethodCompilationStat::kConstructorFenceGeneratedFinal);
David Brazdildee58d62016-04-07 09:54:26 +0000782 }
Vladimir Markoca6fff82017-10-03 14:49:14 +0100783 AppendInstruction(new (allocator_) HReturnVoid(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000784 } else {
Igor Murashkind01745e2017-04-05 16:40:31 -0700785 DCHECK(!RequiresConstructorBarrier(dex_compilation_unit_, compiler_driver_));
David Brazdildee58d62016-04-07 09:54:26 +0000786 HInstruction* value = LoadLocal(instruction.VRegA(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100787 AppendInstruction(new (allocator_) HReturn(value, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000788 }
789 current_block_ = nullptr;
790}
791
792static InvokeType GetInvokeTypeFromOpCode(Instruction::Code opcode) {
793 switch (opcode) {
794 case Instruction::INVOKE_STATIC:
795 case Instruction::INVOKE_STATIC_RANGE:
796 return kStatic;
797 case Instruction::INVOKE_DIRECT:
798 case Instruction::INVOKE_DIRECT_RANGE:
799 return kDirect;
800 case Instruction::INVOKE_VIRTUAL:
801 case Instruction::INVOKE_VIRTUAL_QUICK:
802 case Instruction::INVOKE_VIRTUAL_RANGE:
803 case Instruction::INVOKE_VIRTUAL_RANGE_QUICK:
804 return kVirtual;
805 case Instruction::INVOKE_INTERFACE:
806 case Instruction::INVOKE_INTERFACE_RANGE:
807 return kInterface;
808 case Instruction::INVOKE_SUPER_RANGE:
809 case Instruction::INVOKE_SUPER:
810 return kSuper;
811 default:
812 LOG(FATAL) << "Unexpected invoke opcode: " << opcode;
813 UNREACHABLE();
814 }
815}
816
817ArtMethod* HInstructionBuilder::ResolveMethod(uint16_t method_idx, InvokeType invoke_type) {
818 ScopedObjectAccess soa(Thread::Current());
David Brazdildee58d62016-04-07 09:54:26 +0000819
820 ClassLinker* class_linker = dex_compilation_unit_->GetClassLinker();
Vladimir Marko8d6768d2017-03-14 10:13:21 +0000821 Handle<mirror::ClassLoader> class_loader = dex_compilation_unit_->GetClassLoader();
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100822
Vladimir Markoba118822017-06-12 15:41:56 +0100823 ArtMethod* resolved_method =
824 class_linker->ResolveMethod<ClassLinker::ResolveMode::kCheckICCEAndIAE>(
Vladimir Markoba118822017-06-12 15:41:56 +0100825 method_idx,
826 dex_compilation_unit_->GetDexCache(),
827 class_loader,
828 graph_->GetArtMethod(),
829 invoke_type);
David Brazdildee58d62016-04-07 09:54:26 +0000830
831 if (UNLIKELY(resolved_method == nullptr)) {
832 // Clean up any exception left by type resolution.
833 soa.Self()->ClearException();
834 return nullptr;
835 }
836
Vladimir Markoba118822017-06-12 15:41:56 +0100837 // The referrer may be unresolved for AOT if we're compiling a class that cannot be
838 // resolved because, for example, we don't find a superclass in the classpath.
839 if (graph_->GetArtMethod() == nullptr) {
840 // The class linker cannot check access without a referrer, so we have to do it.
841 // Fall back to HInvokeUnresolved if the method isn't public.
David Brazdildee58d62016-04-07 09:54:26 +0000842 if (!resolved_method->IsPublic()) {
843 return nullptr;
844 }
David Brazdildee58d62016-04-07 09:54:26 +0000845 }
846
847 // We have to special case the invoke-super case, as ClassLinker::ResolveMethod does not.
848 // We need to look at the referrer's super class vtable. We need to do this to know if we need to
849 // make this an invoke-unresolved to handle cross-dex invokes or abstract super methods, both of
850 // which require runtime handling.
851 if (invoke_type == kSuper) {
Vladimir Markofca0b492018-07-23 15:30:52 +0100852 ObjPtr<mirror::Class> compiling_class = ResolveCompilingClass(soa);
Andreas Gampefa4333d2017-02-14 11:10:34 -0800853 if (compiling_class == nullptr) {
David Brazdildee58d62016-04-07 09:54:26 +0000854 // We could not determine the method's class we need to wait until runtime.
855 DCHECK(Runtime::Current()->IsAotCompiler());
856 return nullptr;
857 }
Vladimir Markoba118822017-06-12 15:41:56 +0100858 ObjPtr<mirror::Class> referenced_class = class_linker->LookupResolvedType(
Vladimir Markoba118822017-06-12 15:41:56 +0100859 dex_compilation_unit_->GetDexFile()->GetMethodId(method_idx).class_idx_,
860 dex_compilation_unit_->GetDexCache().Get(),
861 class_loader.Get());
862 DCHECK(referenced_class != nullptr); // We have already resolved a method from this class.
863 if (!referenced_class->IsAssignableFrom(compiling_class)) {
Aart Bikf663e342016-04-04 17:28:59 -0700864 // We cannot statically determine the target method. The runtime will throw a
865 // NoSuchMethodError on this one.
866 return nullptr;
867 }
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100868 ArtMethod* actual_method;
Vladimir Markoba118822017-06-12 15:41:56 +0100869 if (referenced_class->IsInterface()) {
870 actual_method = referenced_class->FindVirtualMethodForInterfaceSuper(
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100871 resolved_method, class_linker->GetImagePointerSize());
David Brazdildee58d62016-04-07 09:54:26 +0000872 } else {
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100873 uint16_t vtable_index = resolved_method->GetMethodIndex();
874 actual_method = compiling_class->GetSuperClass()->GetVTableEntry(
875 vtable_index, class_linker->GetImagePointerSize());
David Brazdildee58d62016-04-07 09:54:26 +0000876 }
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100877 if (actual_method != resolved_method &&
878 !IsSameDexFile(*actual_method->GetDexFile(), *dex_compilation_unit_->GetDexFile())) {
879 // The back-end code generator relies on this check in order to ensure that it will not
880 // attempt to read the dex_cache with a dex_method_index that is not from the correct
881 // dex_file. If we didn't do this check then the dex_method_index will not be updated in the
882 // builder, which means that the code-generator (and compiler driver during sharpening and
883 // inliner, maybe) might invoke an incorrect method.
884 // TODO: The actual method could still be referenced in the current dex file, so we
885 // could try locating it.
886 // TODO: Remove the dex_file restriction.
887 return nullptr;
888 }
889 if (!actual_method->IsInvokable()) {
890 // Fail if the actual method cannot be invoked. Otherwise, the runtime resolution stub
891 // could resolve the callee to the wrong method.
892 return nullptr;
893 }
894 resolved_method = actual_method;
David Brazdildee58d62016-04-07 09:54:26 +0000895 }
896
David Brazdildee58d62016-04-07 09:54:26 +0000897 return resolved_method;
898}
899
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100900static bool IsStringConstructor(ArtMethod* method) {
901 ScopedObjectAccess soa(Thread::Current());
902 return method->GetDeclaringClass()->IsStringClass() && method->IsConstructor();
903}
904
David Brazdildee58d62016-04-07 09:54:26 +0000905bool HInstructionBuilder::BuildInvoke(const Instruction& instruction,
906 uint32_t dex_pc,
907 uint32_t method_idx,
Treehugger Robot2c5827a2018-05-17 22:26:08 +0000908 const InstructionOperands& operands) {
David Brazdildee58d62016-04-07 09:54:26 +0000909 InvokeType invoke_type = GetInvokeTypeFromOpCode(instruction.Opcode());
Orion Hodson4c8e12e2018-05-18 08:33:20 +0100910 const char* shorty = dex_file_->GetMethodShorty(method_idx);
911 DataType::Type return_type = DataType::FromShorty(shorty[0]);
David Brazdildee58d62016-04-07 09:54:26 +0000912
913 // Remove the return type from the 'proto'.
Orion Hodson4c8e12e2018-05-18 08:33:20 +0100914 size_t number_of_arguments = strlen(shorty) - 1;
David Brazdildee58d62016-04-07 09:54:26 +0000915 if (invoke_type != kStatic) { // instance call
916 // One extra argument for 'this'.
917 number_of_arguments++;
918 }
919
David Brazdildee58d62016-04-07 09:54:26 +0000920 ArtMethod* resolved_method = ResolveMethod(method_idx, invoke_type);
921
922 if (UNLIKELY(resolved_method == nullptr)) {
Igor Murashkin1e065a52017-08-09 13:20:34 -0700923 MaybeRecordStat(compilation_stats_,
924 MethodCompilationStat::kUnresolvedMethod);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100925 HInvoke* invoke = new (allocator_) HInvokeUnresolved(allocator_,
926 number_of_arguments,
927 return_type,
928 dex_pc,
929 method_idx,
930 invoke_type);
Orion Hodson4c8e12e2018-05-18 08:33:20 +0100931 return HandleInvoke(invoke, operands, shorty, /* is_unresolved */ true);
David Brazdildee58d62016-04-07 09:54:26 +0000932 }
933
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100934 // Replace calls to String.<init> with StringFactory.
935 if (IsStringConstructor(resolved_method)) {
936 uint32_t string_init_entry_point = WellKnownClasses::StringInitToEntryPoint(resolved_method);
937 HInvokeStaticOrDirect::DispatchInfo dispatch_info = {
938 HInvokeStaticOrDirect::MethodLoadKind::kStringInit,
939 HInvokeStaticOrDirect::CodePtrLocation::kCallArtMethod,
Nicolas Geoffrayc1a42cf2016-12-18 15:52:36 +0000940 dchecked_integral_cast<uint64_t>(string_init_entry_point)
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100941 };
Nicolas Geoffrayf665f842018-02-15 12:29:06 +0000942 ScopedObjectAccess soa(Thread::Current());
943 MethodReference target_method(resolved_method->GetDexFile(),
944 resolved_method->GetDexMethodIndex());
945 // We pass null for the resolved_method to ensure optimizations
946 // don't rely on it.
Vladimir Markoca6fff82017-10-03 14:49:14 +0100947 HInvoke* invoke = new (allocator_) HInvokeStaticOrDirect(
948 allocator_,
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100949 number_of_arguments - 1,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100950 DataType::Type::kReference /*return_type */,
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100951 dex_pc,
952 method_idx,
Nicolas Geoffrayf665f842018-02-15 12:29:06 +0000953 nullptr /* resolved_method */,
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100954 dispatch_info,
955 invoke_type,
956 target_method,
957 HInvokeStaticOrDirect::ClinitCheckRequirement::kImplicit);
Orion Hodson4c8e12e2018-05-18 08:33:20 +0100958 return HandleStringInit(invoke, operands, shorty);
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100959 }
960
David Brazdildee58d62016-04-07 09:54:26 +0000961 // Potential class initialization check, in the case of a static method call.
962 HClinitCheck* clinit_check = nullptr;
963 HInvoke* invoke = nullptr;
964 if (invoke_type == kDirect || invoke_type == kStatic || invoke_type == kSuper) {
965 // By default, consider that the called method implicitly requires
966 // an initialization check of its declaring method.
967 HInvokeStaticOrDirect::ClinitCheckRequirement clinit_check_requirement
968 = HInvokeStaticOrDirect::ClinitCheckRequirement::kImplicit;
969 ScopedObjectAccess soa(Thread::Current());
970 if (invoke_type == kStatic) {
Vladimir Markofca0b492018-07-23 15:30:52 +0100971 clinit_check =
972 ProcessClinitCheckForInvoke(soa, dex_pc, resolved_method, &clinit_check_requirement);
David Brazdildee58d62016-04-07 09:54:26 +0000973 } else if (invoke_type == kSuper) {
974 if (IsSameDexFile(*resolved_method->GetDexFile(), *dex_compilation_unit_->GetDexFile())) {
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +0100975 // Update the method index to the one resolved. Note that this may be a no-op if
David Brazdildee58d62016-04-07 09:54:26 +0000976 // we resolved to the method referenced by the instruction.
977 method_idx = resolved_method->GetDexMethodIndex();
David Brazdildee58d62016-04-07 09:54:26 +0000978 }
979 }
980
981 HInvokeStaticOrDirect::DispatchInfo dispatch_info = {
Vladimir Markoe7197bf2017-06-02 17:00:23 +0100982 HInvokeStaticOrDirect::MethodLoadKind::kRuntimeCall,
David Brazdildee58d62016-04-07 09:54:26 +0000983 HInvokeStaticOrDirect::CodePtrLocation::kCallArtMethod,
Nicolas Geoffrayc1a42cf2016-12-18 15:52:36 +0000984 0u
David Brazdildee58d62016-04-07 09:54:26 +0000985 };
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +0100986 MethodReference target_method(resolved_method->GetDexFile(),
987 resolved_method->GetDexMethodIndex());
Vladimir Markoca6fff82017-10-03 14:49:14 +0100988 invoke = new (allocator_) HInvokeStaticOrDirect(allocator_,
989 number_of_arguments,
990 return_type,
991 dex_pc,
992 method_idx,
993 resolved_method,
994 dispatch_info,
995 invoke_type,
996 target_method,
997 clinit_check_requirement);
David Brazdildee58d62016-04-07 09:54:26 +0000998 } else if (invoke_type == kVirtual) {
999 ScopedObjectAccess soa(Thread::Current()); // Needed for the method index
Vladimir Markoca6fff82017-10-03 14:49:14 +01001000 invoke = new (allocator_) HInvokeVirtual(allocator_,
1001 number_of_arguments,
1002 return_type,
1003 dex_pc,
1004 method_idx,
1005 resolved_method,
1006 resolved_method->GetMethodIndex());
David Brazdildee58d62016-04-07 09:54:26 +00001007 } else {
1008 DCHECK_EQ(invoke_type, kInterface);
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +01001009 ScopedObjectAccess soa(Thread::Current()); // Needed for the IMT index.
Vladimir Markoca6fff82017-10-03 14:49:14 +01001010 invoke = new (allocator_) HInvokeInterface(allocator_,
1011 number_of_arguments,
1012 return_type,
1013 dex_pc,
1014 method_idx,
1015 resolved_method,
1016 ImTable::GetImtIndex(resolved_method));
David Brazdildee58d62016-04-07 09:54:26 +00001017 }
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001018 return HandleInvoke(invoke, operands, shorty, /* is_unresolved */ false, clinit_check);
David Brazdildee58d62016-04-07 09:54:26 +00001019}
1020
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001021bool HInstructionBuilder::BuildInvokePolymorphic(uint32_t dex_pc,
Orion Hodsonac141392017-01-13 11:53:47 +00001022 uint32_t method_idx,
Orion Hodson06d10a72018-05-14 08:53:38 +01001023 dex::ProtoIndex proto_idx,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001024 const InstructionOperands& operands) {
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001025 const char* shorty = dex_file_->GetShorty(proto_idx);
1026 DCHECK_EQ(1 + ArtMethod::NumArgRegisters(shorty), operands.GetNumberOfOperands());
1027 DataType::Type return_type = DataType::FromShorty(shorty[0]);
1028 size_t number_of_arguments = strlen(shorty);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001029 HInvoke* invoke = new (allocator_) HInvokePolymorphic(allocator_,
1030 number_of_arguments,
1031 return_type,
1032 dex_pc,
1033 method_idx);
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001034 return HandleInvoke(invoke, operands, shorty, /* is_unresolved */ false);
1035}
1036
1037
1038bool HInstructionBuilder::BuildInvokeCustom(uint32_t dex_pc,
1039 uint32_t call_site_idx,
1040 const InstructionOperands& operands) {
1041 dex::ProtoIndex proto_idx = dex_file_->GetProtoIndexForCallSite(call_site_idx);
1042 const char* shorty = dex_file_->GetShorty(proto_idx);
1043 DataType::Type return_type = DataType::FromShorty(shorty[0]);
1044 size_t number_of_arguments = strlen(shorty) - 1;
1045 HInvoke* invoke = new (allocator_) HInvokeCustom(allocator_,
1046 number_of_arguments,
1047 call_site_idx,
1048 return_type,
1049 dex_pc);
1050 return HandleInvoke(invoke, operands, shorty, /* is_unresolved */ false);
Orion Hodsonac141392017-01-13 11:53:47 +00001051}
1052
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001053HNewInstance* HInstructionBuilder::BuildNewInstance(dex::TypeIndex type_index, uint32_t dex_pc) {
Vladimir Marko3cd50df2016-04-13 19:29:26 +01001054 ScopedObjectAccess soa(Thread::Current());
David Brazdildee58d62016-04-07 09:54:26 +00001055
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001056 HLoadClass* load_class = BuildLoadClass(type_index, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001057
David Brazdildee58d62016-04-07 09:54:26 +00001058 HInstruction* cls = load_class;
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001059 Handle<mirror::Class> klass = load_class->GetClass();
1060
Vladimir Markofca0b492018-07-23 15:30:52 +01001061 if (!IsInitialized(soa, klass)) {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001062 cls = new (allocator_) HClinitCheck(load_class, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001063 AppendInstruction(cls);
1064 }
1065
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001066 // Only the access check entrypoint handles the finalizable class case. If we
1067 // need access checks, then we haven't resolved the method and the class may
1068 // again be finalizable.
1069 QuickEntrypointEnum entrypoint = kQuickAllocObjectInitialized;
1070 if (load_class->NeedsAccessCheck() || klass->IsFinalizable() || !klass->IsInstantiable()) {
1071 entrypoint = kQuickAllocObjectWithChecks;
1072 }
Alex Lightd109e302018-06-27 10:25:41 -07001073 // We will always be able to resolve the string class since it is in the BCP.
1074 if (!klass.IsNull() && klass->IsStringClass()) {
1075 entrypoint = kQuickAllocStringObject;
1076 }
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001077
1078 // Consider classes we haven't resolved as potentially finalizable.
Andreas Gampefa4333d2017-02-14 11:10:34 -08001079 bool finalizable = (klass == nullptr) || klass->IsFinalizable();
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001080
Vladimir Markoca6fff82017-10-03 14:49:14 +01001081 HNewInstance* new_instance = new (allocator_) HNewInstance(
David Brazdildee58d62016-04-07 09:54:26 +00001082 cls,
David Brazdildee58d62016-04-07 09:54:26 +00001083 dex_pc,
1084 type_index,
1085 *dex_compilation_unit_->GetDexFile(),
David Brazdildee58d62016-04-07 09:54:26 +00001086 finalizable,
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001087 entrypoint);
1088 AppendInstruction(new_instance);
1089
1090 return new_instance;
1091}
1092
1093void HInstructionBuilder::BuildConstructorFenceForAllocation(HInstruction* allocation) {
1094 DCHECK(allocation != nullptr &&
George Burgess IVf2072992017-05-23 15:36:41 -07001095 (allocation->IsNewInstance() ||
1096 allocation->IsNewArray())); // corresponding to "new" keyword in JLS.
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001097
1098 if (allocation->IsNewInstance()) {
1099 // STRING SPECIAL HANDLING:
1100 // -------------------------------
1101 // Strings have a real HNewInstance node but they end up always having 0 uses.
1102 // All uses of a String HNewInstance are always transformed to replace their input
1103 // of the HNewInstance with an input of the invoke to StringFactory.
1104 //
1105 // Do not emit an HConstructorFence here since it can inhibit some String new-instance
1106 // optimizations (to pass checker tests that rely on those optimizations).
1107 HNewInstance* new_inst = allocation->AsNewInstance();
1108 HLoadClass* load_class = new_inst->GetLoadClass();
1109
1110 Thread* self = Thread::Current();
1111 ScopedObjectAccess soa(self);
1112 StackHandleScope<1> hs(self);
1113 Handle<mirror::Class> klass = load_class->GetClass();
1114 if (klass != nullptr && klass->IsStringClass()) {
1115 return;
1116 // Note: Do not use allocation->IsStringAlloc which requires
1117 // a valid ReferenceTypeInfo, but that doesn't get made until after reference type
1118 // propagation (and instruction builder is too early).
1119 }
1120 // (In terms of correctness, the StringFactory needs to provide its own
1121 // default initialization barrier, see below.)
1122 }
1123
1124 // JLS 17.4.5 "Happens-before Order" describes:
1125 //
1126 // The default initialization of any object happens-before any other actions (other than
1127 // default-writes) of a program.
1128 //
1129 // In our implementation the default initialization of an object to type T means
1130 // setting all of its initial data (object[0..size)) to 0, and setting the
1131 // object's class header (i.e. object.getClass() == T.class).
1132 //
1133 // In practice this fence ensures that the writes to the object header
1134 // are visible to other threads if this object escapes the current thread.
1135 // (and in theory the 0-initializing, but that happens automatically
1136 // when new memory pages are mapped in by the OS).
1137 HConstructorFence* ctor_fence =
Vladimir Markoca6fff82017-10-03 14:49:14 +01001138 new (allocator_) HConstructorFence(allocation, allocation->GetDexPc(), allocator_);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001139 AppendInstruction(ctor_fence);
Igor Murashkin6ef45672017-08-08 13:59:55 -07001140 MaybeRecordStat(
1141 compilation_stats_,
1142 MethodCompilationStat::kConstructorFenceGeneratedNew);
David Brazdildee58d62016-04-07 09:54:26 +00001143}
1144
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001145static bool IsInBootImage(ObjPtr<mirror::Class> cls, const CompilerOptions& compiler_options)
1146 REQUIRES_SHARED(Locks::mutator_lock_) {
1147 if (compiler_options.IsBootImage()) {
1148 std::string temp;
1149 const char* descriptor = cls->GetDescriptor(&temp);
1150 return compiler_options.IsImageClass(descriptor);
1151 } else {
1152 return Runtime::Current()->GetHeap()->FindSpaceFromObject(cls, false)->IsImageSpace();
1153 }
1154}
1155
1156static bool IsSubClass(ObjPtr<mirror::Class> to_test, ObjPtr<mirror::Class> super_class)
1157 REQUIRES_SHARED(Locks::mutator_lock_) {
1158 return to_test != nullptr && !to_test->IsInterface() && to_test->IsSubClass(super_class);
1159}
1160
1161static bool HasTrivialClinit(ObjPtr<mirror::Class> klass, PointerSize pointer_size)
1162 REQUIRES_SHARED(Locks::mutator_lock_) {
1163 // Check if the class has encoded fields that trigger bytecode execution.
1164 // (Encoded fields are just a different representation of <clinit>.)
1165 if (klass->NumStaticFields() != 0u) {
1166 DCHECK(klass->GetClassDef() != nullptr);
1167 EncodedStaticFieldValueIterator it(klass->GetDexFile(), *klass->GetClassDef());
1168 for (; it.HasNext(); it.Next()) {
1169 switch (it.GetValueType()) {
1170 case EncodedArrayValueIterator::ValueType::kBoolean:
1171 case EncodedArrayValueIterator::ValueType::kByte:
1172 case EncodedArrayValueIterator::ValueType::kShort:
1173 case EncodedArrayValueIterator::ValueType::kChar:
1174 case EncodedArrayValueIterator::ValueType::kInt:
1175 case EncodedArrayValueIterator::ValueType::kLong:
1176 case EncodedArrayValueIterator::ValueType::kFloat:
1177 case EncodedArrayValueIterator::ValueType::kDouble:
1178 case EncodedArrayValueIterator::ValueType::kNull:
1179 case EncodedArrayValueIterator::ValueType::kString:
1180 // Primitive, null or j.l.String initialization is permitted.
1181 break;
1182 case EncodedArrayValueIterator::ValueType::kType:
1183 // Type initialization can load classes and execute bytecode through a class loader
1184 // which can execute arbitrary bytecode. We do not optimize for known class loaders;
1185 // kType is rarely used (if ever).
1186 return false;
1187 default:
1188 // Other types in the encoded static field list are rejected by the DexFileVerifier.
1189 LOG(FATAL) << "Unexpected type " << it.GetValueType();
1190 UNREACHABLE();
1191 }
1192 }
1193 }
1194 // Check if the class has <clinit> that executes arbitrary code.
1195 // Initialization of static fields of the class itself with constants is allowed.
1196 ArtMethod* clinit = klass->FindClassInitializer(pointer_size);
1197 if (clinit != nullptr) {
1198 const DexFile& dex_file = *clinit->GetDexFile();
1199 CodeItemInstructionAccessor accessor(dex_file, clinit->GetCodeItem());
1200 for (DexInstructionPcPair it : accessor) {
1201 switch (it->Opcode()) {
1202 case Instruction::CONST_4:
1203 case Instruction::CONST_16:
1204 case Instruction::CONST:
1205 case Instruction::CONST_HIGH16:
1206 case Instruction::CONST_WIDE_16:
1207 case Instruction::CONST_WIDE_32:
1208 case Instruction::CONST_WIDE:
1209 case Instruction::CONST_WIDE_HIGH16:
1210 case Instruction::CONST_STRING:
1211 case Instruction::CONST_STRING_JUMBO:
1212 // Primitive, null or j.l.String initialization is permitted.
1213 break;
1214 case Instruction::RETURN_VOID:
1215 case Instruction::RETURN_VOID_NO_BARRIER:
1216 break;
1217 case Instruction::SPUT:
1218 case Instruction::SPUT_WIDE:
1219 case Instruction::SPUT_OBJECT:
1220 case Instruction::SPUT_BOOLEAN:
1221 case Instruction::SPUT_BYTE:
1222 case Instruction::SPUT_CHAR:
1223 case Instruction::SPUT_SHORT:
1224 // Only initialization of a static field of the same class is permitted.
1225 if (dex_file.GetFieldId(it->VRegB_21c()).class_idx_ != klass->GetDexTypeIndex()) {
1226 return false;
1227 }
1228 break;
1229 case Instruction::NEW_ARRAY:
1230 // Only primitive arrays are permitted.
1231 if (Primitive::GetType(dex_file.GetTypeDescriptor(dex_file.GetTypeId(
1232 dex::TypeIndex(it->VRegC_22c())))[1]) == Primitive::kPrimNot) {
1233 return false;
1234 }
1235 break;
1236 case Instruction::APUT:
1237 case Instruction::APUT_WIDE:
1238 case Instruction::APUT_BOOLEAN:
1239 case Instruction::APUT_BYTE:
1240 case Instruction::APUT_CHAR:
1241 case Instruction::APUT_SHORT:
1242 case Instruction::FILL_ARRAY_DATA:
1243 case Instruction::NOP:
1244 // Allow initialization of primitive arrays (only constants can be stored).
1245 // Note: We expect NOPs used for fill-array-data-payload but accept all NOPs
1246 // (even unreferenced switch payloads if they make it through the verifier).
1247 break;
1248 default:
1249 return false;
1250 }
1251 }
1252 }
1253 return true;
1254}
1255
1256static bool HasTrivialInitialization(ObjPtr<mirror::Class> cls,
1257 const CompilerOptions& compiler_options)
1258 REQUIRES_SHARED(Locks::mutator_lock_) {
1259 Runtime* runtime = Runtime::Current();
1260 PointerSize pointer_size = runtime->GetClassLinker()->GetImagePointerSize();
1261
1262 // Check the superclass chain.
1263 for (ObjPtr<mirror::Class> klass = cls; klass != nullptr; klass = klass->GetSuperClass()) {
1264 if (klass->IsInitialized() && IsInBootImage(klass, compiler_options)) {
1265 break; // `klass` and its superclasses are already initialized in the boot image.
1266 }
1267 if (!HasTrivialClinit(klass, pointer_size)) {
1268 return false;
1269 }
1270 }
1271
1272 // Also check interfaces with default methods as they need to be initialized as well.
1273 ObjPtr<mirror::IfTable> iftable = cls->GetIfTable();
1274 DCHECK(iftable != nullptr);
1275 for (int32_t i = 0, count = iftable->Count(); i != count; ++i) {
1276 ObjPtr<mirror::Class> iface = iftable->GetInterface(i);
1277 if (!iface->HasDefaultMethods()) {
1278 continue; // Initializing `cls` does not initialize this interface.
1279 }
1280 if (iface->IsInitialized() && IsInBootImage(iface, compiler_options)) {
1281 continue; // This interface is already initialized in the boot image.
1282 }
1283 if (!HasTrivialClinit(iface, pointer_size)) {
1284 return false;
1285 }
1286 }
1287 return true;
1288}
1289
Vladimir Markofca0b492018-07-23 15:30:52 +01001290bool HInstructionBuilder::IsInitialized(ScopedObjectAccess& soa, Handle<mirror::Class> cls) const {
Andreas Gampefa4333d2017-02-14 11:10:34 -08001291 if (cls == nullptr) {
David Brazdildee58d62016-04-07 09:54:26 +00001292 return false;
1293 }
1294
Vladimir Marko51b8aaf2017-06-09 15:17:05 +01001295 // Check if the class will be initialized at runtime.
1296 if (cls->IsInitialized()) {
1297 Runtime* runtime = Runtime::Current();
1298 if (!runtime->IsAotCompiler()) {
1299 DCHECK(runtime->UseJitCompilation());
1300 // For JIT, the class cannot revert to an uninitialized state.
1301 return true;
1302 }
1303 // Assume loaded only if klass is in the boot image. App classes cannot be assumed
1304 // loaded because we don't even know what class loader will be used to load them.
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001305 if (IsInBootImage(cls.Get(), compiler_driver_->GetCompilerOptions())) {
1306 return true;
Vladimir Marko51b8aaf2017-06-09 15:17:05 +01001307 }
1308 }
1309
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001310 // We can avoid the class initialization check for `cls` in static methods in the
Vladimir Marko51b8aaf2017-06-09 15:17:05 +01001311 // very same class. Instance methods of the same class can run on an escaped instance
1312 // of an erroneous class. Even a superclass may need to be checked as the subclass
1313 // can be completely initialized while the superclass is initializing and the subclass
1314 // remains initialized when the superclass initializer throws afterwards. b/62478025
1315 // Note: The HClinitCheck+HInvokeStaticOrDirect merging can still apply.
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001316 ObjPtr<mirror::Class> outermost_cls = ResolveOutermostCompilingClass(soa);
1317 bool is_static = (dex_compilation_unit_->GetAccessFlags() & kAccStatic) != 0u;
1318 if (is_static && outermost_cls == cls.Get()) {
1319 return true;
1320 }
1321 // Remember if the compiled class is a subclass of `cls`. By the time this is used
1322 // below the `outermost_cls` may be invalidated by calling ResolveCompilingClass().
1323 bool is_subclass = IsSubClass(outermost_cls, cls.Get());
1324 if (dex_compilation_unit_ != outer_compilation_unit_) {
1325 // Check also the innermost method. Though excessive copies of ClinitCheck can be
1326 // eliminated by GVN, that happens only after the decision whether to inline the
1327 // graph or not and that may depend on the presence of the ClinitCheck.
1328 // TODO: We should walk over the entire inlined method chain, but we don't pass that
1329 // information to the builder.
1330 ObjPtr<mirror::Class> innermost_cls = ResolveCompilingClass(soa);
1331 if (is_static && innermost_cls == cls.Get()) {
Vladimir Markofca0b492018-07-23 15:30:52 +01001332 return true;
1333 }
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001334 is_subclass = is_subclass || IsSubClass(innermost_cls, cls.Get());
David Brazdildee58d62016-04-07 09:54:26 +00001335 }
1336
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001337 // Otherwise, we may be able to avoid the check if `cls` is a superclass of a method being
1338 // compiled here (anywhere in the inlining chain) as the `cls` must have started initializing
1339 // before calling any `cls` or subclass methods. Static methods require a clinit check and
1340 // instance methods require an instance which cannot be created before doing a clinit check.
1341 // When a subclass of `cls` starts initializing, it starts initializing its superclass
1342 // chain up to `cls` without running any bytecode, i.e. without any opportunity for circular
1343 // initialization weirdness.
1344 //
1345 // If the initialization of `cls` is trivial (`cls` and its superclasses and superinterfaces
1346 // with default methods initialize only their own static fields using constant values), it must
1347 // complete, either successfully or by throwing and marking `cls` erroneous, without allocating
1348 // any instances of `cls` or subclasses (or any other class) and without calling any methods.
1349 // If it completes by throwing, no instances of `cls` shall be created and no subclass method
1350 // bytecode shall execute (see above), therefore the instruction we're building shall be
1351 // unreachable. By reaching the instruction, we know that `cls` was initialized successfully.
1352 //
1353 // TODO: We should walk over the entire inlined methods chain, but we don't pass that
1354 // information to the builder. (We could also check if we're guaranteed a non-null instance
1355 // of `cls` at this location but that's outside the scope of the instruction builder.)
1356 if (is_subclass && HasTrivialInitialization(cls.Get(), compiler_driver_->GetCompilerOptions())) {
1357 return true;
1358 }
David Brazdildee58d62016-04-07 09:54:26 +00001359
1360 return false;
1361}
1362
1363HClinitCheck* HInstructionBuilder::ProcessClinitCheckForInvoke(
Vladimir Markofca0b492018-07-23 15:30:52 +01001364 ScopedObjectAccess& soa,
1365 uint32_t dex_pc,
1366 ArtMethod* resolved_method,
1367 HInvokeStaticOrDirect::ClinitCheckRequirement* clinit_check_requirement) {
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001368 Handle<mirror::Class> klass = handles_->NewHandle(resolved_method->GetDeclaringClass());
David Brazdildee58d62016-04-07 09:54:26 +00001369
1370 HClinitCheck* clinit_check = nullptr;
Vladimir Markofca0b492018-07-23 15:30:52 +01001371 if (IsInitialized(soa, klass)) {
David Brazdildee58d62016-04-07 09:54:26 +00001372 *clinit_check_requirement = HInvokeStaticOrDirect::ClinitCheckRequirement::kNone;
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001373 } else {
Vladimir Markofca0b492018-07-23 15:30:52 +01001374 HLoadClass* cls = BuildLoadClass(soa,
1375 klass->GetDexTypeIndex(),
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001376 klass->GetDexFile(),
1377 klass,
1378 dex_pc,
1379 /* needs_access_check */ false);
1380 if (cls != nullptr) {
1381 *clinit_check_requirement = HInvokeStaticOrDirect::ClinitCheckRequirement::kExplicit;
Vladimir Markoca6fff82017-10-03 14:49:14 +01001382 clinit_check = new (allocator_) HClinitCheck(cls, dex_pc);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001383 AppendInstruction(clinit_check);
1384 }
David Brazdildee58d62016-04-07 09:54:26 +00001385 }
1386 return clinit_check;
1387}
1388
1389bool HInstructionBuilder::SetupInvokeArguments(HInvoke* invoke,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001390 const InstructionOperands& operands,
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001391 const char* shorty,
David Brazdildee58d62016-04-07 09:54:26 +00001392 size_t start_index,
1393 size_t* argument_index) {
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001394 uint32_t shorty_index = 1; // Skip the return type.
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001395 const size_t number_of_operands = operands.GetNumberOfOperands();
David Brazdildee58d62016-04-07 09:54:26 +00001396 for (size_t i = start_index;
1397 // Make sure we don't go over the expected arguments or over the number of
1398 // dex registers given. If the instruction was seen as dead by the verifier,
1399 // it hasn't been properly checked.
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001400 (i < number_of_operands) && (*argument_index < invoke->GetNumberOfArguments());
David Brazdildee58d62016-04-07 09:54:26 +00001401 i++, (*argument_index)++) {
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001402 DataType::Type type = DataType::FromShorty(shorty[shorty_index++]);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001403 bool is_wide = (type == DataType::Type::kInt64) || (type == DataType::Type::kFloat64);
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001404 if (is_wide && ((i + 1 == number_of_operands) ||
1405 (operands.GetOperand(i) + 1 != operands.GetOperand(i + 1)))) {
David Brazdildee58d62016-04-07 09:54:26 +00001406 // Longs and doubles should be in pairs, that is, sequential registers. The verifier should
1407 // reject any class where this is violated. However, the verifier only does these checks
1408 // on non trivially dead instructions, so we just bailout the compilation.
1409 VLOG(compiler) << "Did not compile "
David Sehr709b0702016-10-13 09:12:37 -07001410 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
David Brazdildee58d62016-04-07 09:54:26 +00001411 << " because of non-sequential dex register pair in wide argument";
Igor Murashkin1e065a52017-08-09 13:20:34 -07001412 MaybeRecordStat(compilation_stats_,
1413 MethodCompilationStat::kNotCompiledMalformedOpcode);
David Brazdildee58d62016-04-07 09:54:26 +00001414 return false;
1415 }
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001416 HInstruction* arg = LoadLocal(operands.GetOperand(i), type);
David Brazdildee58d62016-04-07 09:54:26 +00001417 invoke->SetArgumentAt(*argument_index, arg);
1418 if (is_wide) {
1419 i++;
1420 }
1421 }
1422
1423 if (*argument_index != invoke->GetNumberOfArguments()) {
1424 VLOG(compiler) << "Did not compile "
David Sehr709b0702016-10-13 09:12:37 -07001425 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
David Brazdildee58d62016-04-07 09:54:26 +00001426 << " because of wrong number of arguments in invoke instruction";
Igor Murashkin1e065a52017-08-09 13:20:34 -07001427 MaybeRecordStat(compilation_stats_,
1428 MethodCompilationStat::kNotCompiledMalformedOpcode);
David Brazdildee58d62016-04-07 09:54:26 +00001429 return false;
1430 }
1431
1432 if (invoke->IsInvokeStaticOrDirect() &&
1433 HInvokeStaticOrDirect::NeedsCurrentMethodInput(
1434 invoke->AsInvokeStaticOrDirect()->GetMethodLoadKind())) {
1435 invoke->SetArgumentAt(*argument_index, graph_->GetCurrentMethod());
1436 (*argument_index)++;
1437 }
1438
1439 return true;
1440}
1441
1442bool HInstructionBuilder::HandleInvoke(HInvoke* invoke,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001443 const InstructionOperands& operands,
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001444 const char* shorty,
1445 bool is_unresolved,
1446 HClinitCheck* clinit_check) {
David Brazdildee58d62016-04-07 09:54:26 +00001447 DCHECK(!invoke->IsInvokeStaticOrDirect() || !invoke->AsInvokeStaticOrDirect()->IsStringInit());
1448
1449 size_t start_index = 0;
1450 size_t argument_index = 0;
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +01001451 if (invoke->GetInvokeType() != InvokeType::kStatic) { // Instance call.
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001452 uint32_t obj_reg = operands.GetOperand(0);
Aart Bik296fbb42016-06-07 13:49:12 -07001453 HInstruction* arg = is_unresolved
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001454 ? LoadLocal(obj_reg, DataType::Type::kReference)
Aart Bik296fbb42016-06-07 13:49:12 -07001455 : LoadNullCheckedLocal(obj_reg, invoke->GetDexPc());
David Brazdilc120bbe2016-04-22 16:57:00 +01001456 invoke->SetArgumentAt(0, arg);
David Brazdildee58d62016-04-07 09:54:26 +00001457 start_index = 1;
1458 argument_index = 1;
1459 }
1460
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001461 if (!SetupInvokeArguments(invoke, operands, shorty, start_index, &argument_index)) {
David Brazdildee58d62016-04-07 09:54:26 +00001462 return false;
1463 }
1464
1465 if (clinit_check != nullptr) {
1466 // Add the class initialization check as last input of `invoke`.
1467 DCHECK(invoke->IsInvokeStaticOrDirect());
1468 DCHECK(invoke->AsInvokeStaticOrDirect()->GetClinitCheckRequirement()
1469 == HInvokeStaticOrDirect::ClinitCheckRequirement::kExplicit);
1470 invoke->SetArgumentAt(argument_index, clinit_check);
1471 argument_index++;
1472 }
1473
1474 AppendInstruction(invoke);
1475 latest_result_ = invoke;
1476
1477 return true;
1478}
1479
1480bool HInstructionBuilder::HandleStringInit(HInvoke* invoke,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001481 const InstructionOperands& operands,
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001482 const char* shorty) {
David Brazdildee58d62016-04-07 09:54:26 +00001483 DCHECK(invoke->IsInvokeStaticOrDirect());
1484 DCHECK(invoke->AsInvokeStaticOrDirect()->IsStringInit());
1485
1486 size_t start_index = 1;
1487 size_t argument_index = 0;
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001488 if (!SetupInvokeArguments(invoke, operands, shorty, start_index, &argument_index)) {
David Brazdildee58d62016-04-07 09:54:26 +00001489 return false;
1490 }
1491
1492 AppendInstruction(invoke);
1493
1494 // This is a StringFactory call, not an actual String constructor. Its result
1495 // replaces the empty String pre-allocated by NewInstance.
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001496 uint32_t orig_this_reg = operands.GetOperand(0);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001497 HInstruction* arg_this = LoadLocal(orig_this_reg, DataType::Type::kReference);
David Brazdildee58d62016-04-07 09:54:26 +00001498
1499 // Replacing the NewInstance might render it redundant. Keep a list of these
Nicolas Geoffray8a62a4c2018-07-03 09:39:07 +01001500 // to be visited once it is clear whether it has remaining uses.
David Brazdildee58d62016-04-07 09:54:26 +00001501 if (arg_this->IsNewInstance()) {
1502 ssa_builder_->AddUninitializedString(arg_this->AsNewInstance());
Nicolas Geoffray8a62a4c2018-07-03 09:39:07 +01001503 // Walk over all vregs and replace any occurrence of `arg_this` with `invoke`.
1504 for (size_t vreg = 0, e = current_locals_->size(); vreg < e; ++vreg) {
1505 if ((*current_locals_)[vreg] == arg_this) {
1506 (*current_locals_)[vreg] = invoke;
1507 }
David Brazdildee58d62016-04-07 09:54:26 +00001508 }
Nicolas Geoffray8a62a4c2018-07-03 09:39:07 +01001509 } else {
1510 DCHECK(arg_this->IsPhi());
1511 // We can get a phi as input of a String.<init> if there is a loop between the
1512 // allocation and the String.<init> call. As we don't know which other phis might alias
1513 // with `arg_this`, we keep a record of these phis and will analyze their inputs and
1514 // uses once the inputs and users are populated (in ssa_builder.cc).
1515 // Note: we only do this for phis, as it is a somewhat more expensive operation than
1516 // what we're doing above when the input is the `HNewInstance`.
1517 ssa_builder_->AddUninitializedStringPhi(arg_this->AsPhi(), invoke);
David Brazdildee58d62016-04-07 09:54:26 +00001518 }
David Brazdildee58d62016-04-07 09:54:26 +00001519 return true;
1520}
1521
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001522static DataType::Type GetFieldAccessType(const DexFile& dex_file, uint16_t field_index) {
David Brazdildee58d62016-04-07 09:54:26 +00001523 const DexFile::FieldId& field_id = dex_file.GetFieldId(field_index);
1524 const char* type = dex_file.GetFieldTypeDescriptor(field_id);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001525 return DataType::FromShorty(type[0]);
David Brazdildee58d62016-04-07 09:54:26 +00001526}
1527
1528bool HInstructionBuilder::BuildInstanceFieldAccess(const Instruction& instruction,
1529 uint32_t dex_pc,
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07001530 bool is_put,
1531 size_t quicken_index) {
David Brazdildee58d62016-04-07 09:54:26 +00001532 uint32_t source_or_dest_reg = instruction.VRegA_22c();
1533 uint32_t obj_reg = instruction.VRegB_22c();
1534 uint16_t field_index;
1535 if (instruction.IsQuickened()) {
1536 if (!CanDecodeQuickenedInfo()) {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00001537 VLOG(compiler) << "Not compiled: Could not decode quickened instruction "
1538 << instruction.Opcode();
David Brazdildee58d62016-04-07 09:54:26 +00001539 return false;
1540 }
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07001541 field_index = LookupQuickenedInfo(quicken_index);
David Brazdildee58d62016-04-07 09:54:26 +00001542 } else {
1543 field_index = instruction.VRegC_22c();
1544 }
1545
1546 ScopedObjectAccess soa(Thread::Current());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001547 ArtField* resolved_field = ResolveField(field_index, /* is_static */ false, is_put);
David Brazdildee58d62016-04-07 09:54:26 +00001548
Aart Bik14154132016-06-02 17:53:58 -07001549 // Generate an explicit null check on the reference, unless the field access
1550 // is unresolved. In that case, we rely on the runtime to perform various
1551 // checks first, followed by a null check.
1552 HInstruction* object = (resolved_field == nullptr)
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001553 ? LoadLocal(obj_reg, DataType::Type::kReference)
Aart Bik14154132016-06-02 17:53:58 -07001554 : LoadNullCheckedLocal(obj_reg, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001555
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001556 DataType::Type field_type = GetFieldAccessType(*dex_file_, field_index);
David Brazdildee58d62016-04-07 09:54:26 +00001557 if (is_put) {
1558 HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
1559 HInstruction* field_set = nullptr;
1560 if (resolved_field == nullptr) {
Igor Murashkin1e065a52017-08-09 13:20:34 -07001561 MaybeRecordStat(compilation_stats_,
1562 MethodCompilationStat::kUnresolvedField);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001563 field_set = new (allocator_) HUnresolvedInstanceFieldSet(object,
1564 value,
1565 field_type,
1566 field_index,
1567 dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001568 } else {
1569 uint16_t class_def_index = resolved_field->GetDeclaringClass()->GetDexClassDefIndex();
Vladimir Markoca6fff82017-10-03 14:49:14 +01001570 field_set = new (allocator_) HInstanceFieldSet(object,
1571 value,
1572 resolved_field,
1573 field_type,
1574 resolved_field->GetOffset(),
1575 resolved_field->IsVolatile(),
1576 field_index,
1577 class_def_index,
1578 *dex_file_,
1579 dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001580 }
1581 AppendInstruction(field_set);
1582 } else {
1583 HInstruction* field_get = nullptr;
1584 if (resolved_field == nullptr) {
Igor Murashkin1e065a52017-08-09 13:20:34 -07001585 MaybeRecordStat(compilation_stats_,
1586 MethodCompilationStat::kUnresolvedField);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001587 field_get = new (allocator_) HUnresolvedInstanceFieldGet(object,
1588 field_type,
1589 field_index,
1590 dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001591 } else {
1592 uint16_t class_def_index = resolved_field->GetDeclaringClass()->GetDexClassDefIndex();
Vladimir Markoca6fff82017-10-03 14:49:14 +01001593 field_get = new (allocator_) HInstanceFieldGet(object,
1594 resolved_field,
1595 field_type,
1596 resolved_field->GetOffset(),
1597 resolved_field->IsVolatile(),
1598 field_index,
1599 class_def_index,
1600 *dex_file_,
1601 dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001602 }
1603 AppendInstruction(field_get);
1604 UpdateLocal(source_or_dest_reg, field_get);
1605 }
1606
1607 return true;
1608}
1609
Vladimir Markofca0b492018-07-23 15:30:52 +01001610static ObjPtr<mirror::Class> ResolveClassFrom(ScopedObjectAccess& soa,
1611 CompilerDriver* driver,
1612 const DexCompilationUnit& compilation_unit)
1613 REQUIRES_SHARED(Locks::mutator_lock_) {
Vladimir Marko8d6768d2017-03-14 10:13:21 +00001614 Handle<mirror::ClassLoader> class_loader = compilation_unit.GetClassLoader();
Vladimir Marko3cd50df2016-04-13 19:29:26 +01001615 Handle<mirror::DexCache> dex_cache = compilation_unit.GetDexCache();
David Brazdildee58d62016-04-07 09:54:26 +00001616
1617 return driver->ResolveCompilingMethodsClass(soa, dex_cache, class_loader, &compilation_unit);
1618}
1619
Vladimir Markofca0b492018-07-23 15:30:52 +01001620ObjPtr<mirror::Class> HInstructionBuilder::ResolveOutermostCompilingClass(
1621 ScopedObjectAccess& soa) const {
1622 return ResolveClassFrom(soa, compiler_driver_, *outer_compilation_unit_);
David Brazdildee58d62016-04-07 09:54:26 +00001623}
1624
Vladimir Markofca0b492018-07-23 15:30:52 +01001625ObjPtr<mirror::Class> HInstructionBuilder::ResolveCompilingClass(ScopedObjectAccess& soa) const {
1626 return ResolveClassFrom(soa, compiler_driver_, *dex_compilation_unit_);
David Brazdildee58d62016-04-07 09:54:26 +00001627}
1628
Andreas Gampea5b09a62016-11-17 15:21:22 -08001629bool HInstructionBuilder::IsOutermostCompilingClass(dex::TypeIndex type_index) const {
David Brazdildee58d62016-04-07 09:54:26 +00001630 ScopedObjectAccess soa(Thread::Current());
Vladimir Marko8d6768d2017-03-14 10:13:21 +00001631 StackHandleScope<2> hs(soa.Self());
Vladimir Marko3cd50df2016-04-13 19:29:26 +01001632 Handle<mirror::DexCache> dex_cache = dex_compilation_unit_->GetDexCache();
Vladimir Marko8d6768d2017-03-14 10:13:21 +00001633 Handle<mirror::ClassLoader> class_loader = dex_compilation_unit_->GetClassLoader();
David Brazdildee58d62016-04-07 09:54:26 +00001634 Handle<mirror::Class> cls(hs.NewHandle(compiler_driver_->ResolveClass(
1635 soa, dex_cache, class_loader, type_index, dex_compilation_unit_)));
Vladimir Markofca0b492018-07-23 15:30:52 +01001636 Handle<mirror::Class> outer_class(hs.NewHandle(ResolveOutermostCompilingClass(soa)));
David Brazdildee58d62016-04-07 09:54:26 +00001637
1638 // GetOutermostCompilingClass returns null when the class is unresolved
1639 // (e.g. if it derives from an unresolved class). This is bogus knowing that
1640 // we are compiling it.
1641 // When this happens we cannot establish a direct relation between the current
1642 // class and the outer class, so we return false.
1643 // (Note that this is only used for optimizing invokes and field accesses)
Andreas Gampefa4333d2017-02-14 11:10:34 -08001644 return (cls != nullptr) && (outer_class.Get() == cls.Get());
David Brazdildee58d62016-04-07 09:54:26 +00001645}
1646
1647void HInstructionBuilder::BuildUnresolvedStaticFieldAccess(const Instruction& instruction,
Nicolas Geoffrayc52b26d2016-12-19 09:18:07 +00001648 uint32_t dex_pc,
1649 bool is_put,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001650 DataType::Type field_type) {
David Brazdildee58d62016-04-07 09:54:26 +00001651 uint32_t source_or_dest_reg = instruction.VRegA_21c();
1652 uint16_t field_index = instruction.VRegB_21c();
1653
1654 if (is_put) {
1655 HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
1656 AppendInstruction(
Vladimir Markoca6fff82017-10-03 14:49:14 +01001657 new (allocator_) HUnresolvedStaticFieldSet(value, field_type, field_index, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001658 } else {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001659 AppendInstruction(new (allocator_) HUnresolvedStaticFieldGet(field_type, field_index, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001660 UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
1661 }
1662}
1663
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001664ArtField* HInstructionBuilder::ResolveField(uint16_t field_idx, bool is_static, bool is_put) {
1665 ScopedObjectAccess soa(Thread::Current());
1666 StackHandleScope<2> hs(soa.Self());
1667
1668 ClassLinker* class_linker = dex_compilation_unit_->GetClassLinker();
Vladimir Marko8d6768d2017-03-14 10:13:21 +00001669 Handle<mirror::ClassLoader> class_loader = dex_compilation_unit_->GetClassLoader();
Vladimir Markofca0b492018-07-23 15:30:52 +01001670 Handle<mirror::Class> compiling_class(hs.NewHandle(ResolveCompilingClass(soa)));
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001671
Vladimir Markoe11dd502017-12-08 14:09:45 +00001672 ArtField* resolved_field = class_linker->ResolveField(field_idx,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001673 dex_compilation_unit_->GetDexCache(),
1674 class_loader,
1675 is_static);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001676 if (UNLIKELY(resolved_field == nullptr)) {
1677 // Clean up any exception left by type resolution.
1678 soa.Self()->ClearException();
1679 return nullptr;
1680 }
1681
1682 // Check static/instance. The class linker has a fast path for looking into the dex cache
1683 // and does not check static/instance if it hits it.
1684 if (UNLIKELY(resolved_field->IsStatic() != is_static)) {
1685 return nullptr;
1686 }
1687
1688 // Check access.
Andreas Gampefa4333d2017-02-14 11:10:34 -08001689 if (compiling_class == nullptr) {
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001690 if (!resolved_field->IsPublic()) {
1691 return nullptr;
1692 }
1693 } else if (!compiling_class->CanAccessResolvedField(resolved_field->GetDeclaringClass(),
1694 resolved_field,
1695 dex_compilation_unit_->GetDexCache().Get(),
1696 field_idx)) {
1697 return nullptr;
1698 }
1699
1700 if (is_put &&
1701 resolved_field->IsFinal() &&
1702 (compiling_class.Get() != resolved_field->GetDeclaringClass())) {
1703 // Final fields can only be updated within their own class.
1704 // TODO: Only allow it in constructors. b/34966607.
1705 return nullptr;
1706 }
1707
1708 return resolved_field;
1709}
1710
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00001711void HInstructionBuilder::BuildStaticFieldAccess(const Instruction& instruction,
David Brazdildee58d62016-04-07 09:54:26 +00001712 uint32_t dex_pc,
1713 bool is_put) {
1714 uint32_t source_or_dest_reg = instruction.VRegA_21c();
1715 uint16_t field_index = instruction.VRegB_21c();
1716
1717 ScopedObjectAccess soa(Thread::Current());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001718 ArtField* resolved_field = ResolveField(field_index, /* is_static */ true, is_put);
David Brazdildee58d62016-04-07 09:54:26 +00001719
1720 if (resolved_field == nullptr) {
Igor Murashkin1e065a52017-08-09 13:20:34 -07001721 MaybeRecordStat(compilation_stats_,
1722 MethodCompilationStat::kUnresolvedField);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001723 DataType::Type field_type = GetFieldAccessType(*dex_file_, field_index);
David Brazdildee58d62016-04-07 09:54:26 +00001724 BuildUnresolvedStaticFieldAccess(instruction, dex_pc, is_put, field_type);
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00001725 return;
David Brazdildee58d62016-04-07 09:54:26 +00001726 }
1727
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001728 DataType::Type field_type = GetFieldAccessType(*dex_file_, field_index);
David Brazdildee58d62016-04-07 09:54:26 +00001729
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001730 Handle<mirror::Class> klass = handles_->NewHandle(resolved_field->GetDeclaringClass());
Vladimir Markofca0b492018-07-23 15:30:52 +01001731 HLoadClass* constant = BuildLoadClass(soa,
1732 klass->GetDexTypeIndex(),
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001733 klass->GetDexFile(),
1734 klass,
1735 dex_pc,
1736 /* needs_access_check */ false);
1737
1738 if (constant == nullptr) {
1739 // The class cannot be referenced from this compiled code. Generate
1740 // an unresolved access.
Igor Murashkin1e065a52017-08-09 13:20:34 -07001741 MaybeRecordStat(compilation_stats_,
1742 MethodCompilationStat::kUnresolvedFieldNotAFastAccess);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001743 BuildUnresolvedStaticFieldAccess(instruction, dex_pc, is_put, field_type);
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00001744 return;
David Brazdildee58d62016-04-07 09:54:26 +00001745 }
1746
David Brazdildee58d62016-04-07 09:54:26 +00001747 HInstruction* cls = constant;
Vladimir Markofca0b492018-07-23 15:30:52 +01001748 if (!IsInitialized(soa, klass)) {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001749 cls = new (allocator_) HClinitCheck(constant, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001750 AppendInstruction(cls);
1751 }
1752
1753 uint16_t class_def_index = klass->GetDexClassDefIndex();
1754 if (is_put) {
1755 // We need to keep the class alive before loading the value.
1756 HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
1757 DCHECK_EQ(HPhi::ToPhiType(value->GetType()), HPhi::ToPhiType(field_type));
Vladimir Markoca6fff82017-10-03 14:49:14 +01001758 AppendInstruction(new (allocator_) HStaticFieldSet(cls,
1759 value,
1760 resolved_field,
1761 field_type,
1762 resolved_field->GetOffset(),
1763 resolved_field->IsVolatile(),
1764 field_index,
1765 class_def_index,
1766 *dex_file_,
1767 dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001768 } else {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001769 AppendInstruction(new (allocator_) HStaticFieldGet(cls,
1770 resolved_field,
1771 field_type,
1772 resolved_field->GetOffset(),
1773 resolved_field->IsVolatile(),
1774 field_index,
1775 class_def_index,
1776 *dex_file_,
1777 dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001778 UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
1779 }
David Brazdildee58d62016-04-07 09:54:26 +00001780}
1781
1782void HInstructionBuilder::BuildCheckedDivRem(uint16_t out_vreg,
Vladimir Markoca6fff82017-10-03 14:49:14 +01001783 uint16_t first_vreg,
1784 int64_t second_vreg_or_constant,
1785 uint32_t dex_pc,
1786 DataType::Type type,
1787 bool second_is_constant,
1788 bool isDiv) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001789 DCHECK(type == DataType::Type::kInt32 || type == DataType::Type::kInt64);
David Brazdildee58d62016-04-07 09:54:26 +00001790
1791 HInstruction* first = LoadLocal(first_vreg, type);
1792 HInstruction* second = nullptr;
1793 if (second_is_constant) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001794 if (type == DataType::Type::kInt32) {
David Brazdildee58d62016-04-07 09:54:26 +00001795 second = graph_->GetIntConstant(second_vreg_or_constant, dex_pc);
1796 } else {
1797 second = graph_->GetLongConstant(second_vreg_or_constant, dex_pc);
1798 }
1799 } else {
1800 second = LoadLocal(second_vreg_or_constant, type);
1801 }
1802
1803 if (!second_is_constant
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001804 || (type == DataType::Type::kInt32 && second->AsIntConstant()->GetValue() == 0)
1805 || (type == DataType::Type::kInt64 && second->AsLongConstant()->GetValue() == 0)) {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001806 second = new (allocator_) HDivZeroCheck(second, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001807 AppendInstruction(second);
1808 }
1809
1810 if (isDiv) {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001811 AppendInstruction(new (allocator_) HDiv(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001812 } else {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001813 AppendInstruction(new (allocator_) HRem(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001814 }
1815 UpdateLocal(out_vreg, current_block_->GetLastInstruction());
1816}
1817
1818void HInstructionBuilder::BuildArrayAccess(const Instruction& instruction,
1819 uint32_t dex_pc,
1820 bool is_put,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001821 DataType::Type anticipated_type) {
David Brazdildee58d62016-04-07 09:54:26 +00001822 uint8_t source_or_dest_reg = instruction.VRegA_23x();
1823 uint8_t array_reg = instruction.VRegB_23x();
1824 uint8_t index_reg = instruction.VRegC_23x();
1825
David Brazdilc120bbe2016-04-22 16:57:00 +01001826 HInstruction* object = LoadNullCheckedLocal(array_reg, dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001827 HInstruction* length = new (allocator_) HArrayLength(object, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001828 AppendInstruction(length);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001829 HInstruction* index = LoadLocal(index_reg, DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001830 index = new (allocator_) HBoundsCheck(index, length, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001831 AppendInstruction(index);
1832 if (is_put) {
1833 HInstruction* value = LoadLocal(source_or_dest_reg, anticipated_type);
1834 // TODO: Insert a type check node if the type is Object.
Vladimir Markoca6fff82017-10-03 14:49:14 +01001835 HArraySet* aset = new (allocator_) HArraySet(object, index, value, anticipated_type, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001836 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
1837 AppendInstruction(aset);
1838 } else {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001839 HArrayGet* aget = new (allocator_) HArrayGet(object, index, anticipated_type, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001840 ssa_builder_->MaybeAddAmbiguousArrayGet(aget);
1841 AppendInstruction(aget);
1842 UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
1843 }
1844 graph_->SetHasBoundsChecks(true);
1845}
1846
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001847HNewArray* HInstructionBuilder::BuildFilledNewArray(uint32_t dex_pc,
1848 dex::TypeIndex type_index,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001849 const InstructionOperands& operands) {
1850 const size_t number_of_operands = operands.GetNumberOfOperands();
1851 HInstruction* length = graph_->GetIntConstant(number_of_operands, dex_pc);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001852 HLoadClass* cls = BuildLoadClass(type_index, dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001853 HNewArray* const object = new (allocator_) HNewArray(cls, length, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001854 AppendInstruction(object);
1855
1856 const char* descriptor = dex_file_->StringByTypeIdx(type_index);
1857 DCHECK_EQ(descriptor[0], '[') << descriptor;
1858 char primitive = descriptor[1];
1859 DCHECK(primitive == 'I'
1860 || primitive == 'L'
1861 || primitive == '[') << descriptor;
1862 bool is_reference_array = (primitive == 'L') || (primitive == '[');
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001863 DataType::Type type = is_reference_array ? DataType::Type::kReference : DataType::Type::kInt32;
David Brazdildee58d62016-04-07 09:54:26 +00001864
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001865 for (size_t i = 0; i < number_of_operands; ++i) {
1866 HInstruction* value = LoadLocal(operands.GetOperand(i), type);
David Brazdildee58d62016-04-07 09:54:26 +00001867 HInstruction* index = graph_->GetIntConstant(i, dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001868 HArraySet* aset = new (allocator_) HArraySet(object, index, value, type, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001869 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
1870 AppendInstruction(aset);
1871 }
1872 latest_result_ = object;
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001873
1874 return object;
David Brazdildee58d62016-04-07 09:54:26 +00001875}
1876
1877template <typename T>
1878void HInstructionBuilder::BuildFillArrayData(HInstruction* object,
1879 const T* data,
1880 uint32_t element_count,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001881 DataType::Type anticipated_type,
David Brazdildee58d62016-04-07 09:54:26 +00001882 uint32_t dex_pc) {
1883 for (uint32_t i = 0; i < element_count; ++i) {
1884 HInstruction* index = graph_->GetIntConstant(i, dex_pc);
1885 HInstruction* value = graph_->GetIntConstant(data[i], dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001886 HArraySet* aset = new (allocator_) HArraySet(object, index, value, anticipated_type, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001887 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
1888 AppendInstruction(aset);
1889 }
1890}
1891
1892void HInstructionBuilder::BuildFillArrayData(const Instruction& instruction, uint32_t dex_pc) {
David Brazdilc120bbe2016-04-22 16:57:00 +01001893 HInstruction* array = LoadNullCheckedLocal(instruction.VRegA_31t(), dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001894
1895 int32_t payload_offset = instruction.VRegB_31t() + dex_pc;
1896 const Instruction::ArrayDataPayload* payload =
Mathieu Chartier808c7a52017-12-15 11:19:33 -08001897 reinterpret_cast<const Instruction::ArrayDataPayload*>(
1898 code_item_accessor_.Insns() + payload_offset);
David Brazdildee58d62016-04-07 09:54:26 +00001899 const uint8_t* data = payload->data;
1900 uint32_t element_count = payload->element_count;
1901
Vladimir Markoc69fba22016-09-06 16:49:15 +01001902 if (element_count == 0u) {
1903 // For empty payload we emit only the null check above.
1904 return;
1905 }
1906
Vladimir Markoca6fff82017-10-03 14:49:14 +01001907 HInstruction* length = new (allocator_) HArrayLength(array, dex_pc);
Vladimir Markoc69fba22016-09-06 16:49:15 +01001908 AppendInstruction(length);
1909
David Brazdildee58d62016-04-07 09:54:26 +00001910 // Implementation of this DEX instruction seems to be that the bounds check is
1911 // done before doing any stores.
1912 HInstruction* last_index = graph_->GetIntConstant(payload->element_count - 1, dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001913 AppendInstruction(new (allocator_) HBoundsCheck(last_index, length, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001914
1915 switch (payload->element_width) {
1916 case 1:
David Brazdilc120bbe2016-04-22 16:57:00 +01001917 BuildFillArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00001918 reinterpret_cast<const int8_t*>(data),
1919 element_count,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001920 DataType::Type::kInt8,
David Brazdildee58d62016-04-07 09:54:26 +00001921 dex_pc);
1922 break;
1923 case 2:
David Brazdilc120bbe2016-04-22 16:57:00 +01001924 BuildFillArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00001925 reinterpret_cast<const int16_t*>(data),
1926 element_count,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001927 DataType::Type::kInt16,
David Brazdildee58d62016-04-07 09:54:26 +00001928 dex_pc);
1929 break;
1930 case 4:
David Brazdilc120bbe2016-04-22 16:57:00 +01001931 BuildFillArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00001932 reinterpret_cast<const int32_t*>(data),
1933 element_count,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001934 DataType::Type::kInt32,
David Brazdildee58d62016-04-07 09:54:26 +00001935 dex_pc);
1936 break;
1937 case 8:
David Brazdilc120bbe2016-04-22 16:57:00 +01001938 BuildFillWideArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00001939 reinterpret_cast<const int64_t*>(data),
1940 element_count,
1941 dex_pc);
1942 break;
1943 default:
1944 LOG(FATAL) << "Unknown element width for " << payload->element_width;
1945 }
1946 graph_->SetHasBoundsChecks(true);
1947}
1948
1949void HInstructionBuilder::BuildFillWideArrayData(HInstruction* object,
1950 const int64_t* data,
1951 uint32_t element_count,
1952 uint32_t dex_pc) {
1953 for (uint32_t i = 0; i < element_count; ++i) {
1954 HInstruction* index = graph_->GetIntConstant(i, dex_pc);
1955 HInstruction* value = graph_->GetLongConstant(data[i], dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001956 HArraySet* aset =
1957 new (allocator_) HArraySet(object, index, value, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001958 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
1959 AppendInstruction(aset);
1960 }
1961}
1962
Vladimir Marko28e012a2017-12-07 11:22:59 +00001963void HInstructionBuilder::BuildLoadString(dex::StringIndex string_index, uint32_t dex_pc) {
1964 HLoadString* load_string =
1965 new (allocator_) HLoadString(graph_->GetCurrentMethod(), string_index, *dex_file_, dex_pc);
1966 HSharpening::ProcessLoadString(load_string,
1967 code_generator_,
Vladimir Marko28e012a2017-12-07 11:22:59 +00001968 *dex_compilation_unit_,
1969 handles_);
1970 AppendInstruction(load_string);
1971}
1972
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001973HLoadClass* HInstructionBuilder::BuildLoadClass(dex::TypeIndex type_index, uint32_t dex_pc) {
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001974 ScopedObjectAccess soa(Thread::Current());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001975 const DexFile& dex_file = *dex_compilation_unit_->GetDexFile();
Vladimir Marko175e7862018-03-27 09:03:13 +00001976 Handle<mirror::Class> klass = ResolveClass(soa, type_index);
Vladimir Markofca0b492018-07-23 15:30:52 +01001977 bool needs_access_check = LoadClassNeedsAccessCheck(soa, klass);
1978 return BuildLoadClass(soa, type_index, dex_file, klass, dex_pc, needs_access_check);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001979}
1980
Vladimir Markofca0b492018-07-23 15:30:52 +01001981HLoadClass* HInstructionBuilder::BuildLoadClass(ScopedObjectAccess& soa,
1982 dex::TypeIndex type_index,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001983 const DexFile& dex_file,
1984 Handle<mirror::Class> klass,
1985 uint32_t dex_pc,
1986 bool needs_access_check) {
1987 // Try to find a reference in the compiling dex file.
1988 const DexFile* actual_dex_file = &dex_file;
1989 if (!IsSameDexFile(dex_file, *dex_compilation_unit_->GetDexFile())) {
1990 dex::TypeIndex local_type_index =
1991 klass->FindTypeIndexInOtherDexFile(*dex_compilation_unit_->GetDexFile());
1992 if (local_type_index.IsValid()) {
1993 type_index = local_type_index;
1994 actual_dex_file = dex_compilation_unit_->GetDexFile();
1995 }
1996 }
1997
1998 // Note: `klass` must be from `handles_`.
Vladimir Markofca0b492018-07-23 15:30:52 +01001999 bool is_referrers_class = false;
2000 if (klass != nullptr) {
2001 ObjPtr<mirror::Class> outermost_cls = ResolveOutermostCompilingClass(soa);
2002 is_referrers_class = (outermost_cls == klass.Get());
2003 }
Vladimir Markoca6fff82017-10-03 14:49:14 +01002004 HLoadClass* load_class = new (allocator_) HLoadClass(
Nicolas Geoffray5247c082017-01-13 14:17:29 +00002005 graph_->GetCurrentMethod(),
2006 type_index,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00002007 *actual_dex_file,
Nicolas Geoffray5247c082017-01-13 14:17:29 +00002008 klass,
Vladimir Markofca0b492018-07-23 15:30:52 +01002009 is_referrers_class,
Nicolas Geoffray5247c082017-01-13 14:17:29 +00002010 dex_pc,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00002011 needs_access_check);
Nicolas Geoffray5247c082017-01-13 14:17:29 +00002012
Nicolas Geoffrayc4aa82c2017-03-06 14:38:52 +00002013 HLoadClass::LoadKind load_kind = HSharpening::ComputeLoadClassKind(load_class,
2014 code_generator_,
Nicolas Geoffrayc4aa82c2017-03-06 14:38:52 +00002015 *dex_compilation_unit_);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00002016
2017 if (load_kind == HLoadClass::LoadKind::kInvalid) {
2018 // We actually cannot reference this class, we're forced to bail.
2019 return nullptr;
2020 }
Vladimir Marko28e012a2017-12-07 11:22:59 +00002021 // Load kind must be set before inserting the instruction into the graph.
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00002022 load_class->SetLoadKind(load_kind);
Vladimir Marko28e012a2017-12-07 11:22:59 +00002023 AppendInstruction(load_class);
Nicolas Geoffray5247c082017-01-13 14:17:29 +00002024 return load_class;
2025}
2026
Vladimir Marko175e7862018-03-27 09:03:13 +00002027Handle<mirror::Class> HInstructionBuilder::ResolveClass(ScopedObjectAccess& soa,
2028 dex::TypeIndex type_index) {
2029 Handle<mirror::ClassLoader> class_loader = dex_compilation_unit_->GetClassLoader();
2030 ObjPtr<mirror::Class> klass = compiler_driver_->ResolveClass(
2031 soa, dex_compilation_unit_->GetDexCache(), class_loader, type_index, dex_compilation_unit_);
2032 // TODO: Avoid creating excessive handles if the method references the same class repeatedly.
2033 // (Use a map on the local_allocator_.)
2034 return handles_->NewHandle(klass);
2035}
2036
Vladimir Markofca0b492018-07-23 15:30:52 +01002037bool HInstructionBuilder::LoadClassNeedsAccessCheck(ScopedObjectAccess& soa,
2038 Handle<mirror::Class> klass) {
Vladimir Marko175e7862018-03-27 09:03:13 +00002039 if (klass == nullptr) {
2040 return true;
2041 } else if (klass->IsPublic()) {
2042 return false;
2043 } else {
Vladimir Markofca0b492018-07-23 15:30:52 +01002044 ObjPtr<mirror::Class> compiling_class = ResolveCompilingClass(soa);
Vladimir Marko175e7862018-03-27 09:03:13 +00002045 return compiling_class == nullptr || !compiling_class->CanAccess(klass.Get());
2046 }
2047}
2048
Orion Hodson06d10a72018-05-14 08:53:38 +01002049void HInstructionBuilder::BuildLoadMethodHandle(uint16_t method_handle_index, uint32_t dex_pc) {
Orion Hodsondbaa5c72018-05-10 08:22:46 +01002050 const DexFile& dex_file = *dex_compilation_unit_->GetDexFile();
Orion Hodson06d10a72018-05-14 08:53:38 +01002051 HLoadMethodHandle* load_method_handle = new (allocator_) HLoadMethodHandle(
2052 graph_->GetCurrentMethod(), method_handle_index, dex_file, dex_pc);
Orion Hodsondbaa5c72018-05-10 08:22:46 +01002053 AppendInstruction(load_method_handle);
2054}
2055
Orion Hodson06d10a72018-05-14 08:53:38 +01002056void HInstructionBuilder::BuildLoadMethodType(dex::ProtoIndex proto_index, uint32_t dex_pc) {
Orion Hodson18259d72018-04-12 11:18:23 +01002057 const DexFile& dex_file = *dex_compilation_unit_->GetDexFile();
2058 HLoadMethodType* load_method_type =
Orion Hodson06d10a72018-05-14 08:53:38 +01002059 new (allocator_) HLoadMethodType(graph_->GetCurrentMethod(), proto_index, dex_file, dex_pc);
Orion Hodson18259d72018-04-12 11:18:23 +01002060 AppendInstruction(load_method_type);
2061}
2062
David Brazdildee58d62016-04-07 09:54:26 +00002063void HInstructionBuilder::BuildTypeCheck(const Instruction& instruction,
2064 uint8_t destination,
2065 uint8_t reference,
Andreas Gampea5b09a62016-11-17 15:21:22 -08002066 dex::TypeIndex type_index,
David Brazdildee58d62016-04-07 09:54:26 +00002067 uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002068 HInstruction* object = LoadLocal(reference, DataType::Type::kReference);
David Brazdildee58d62016-04-07 09:54:26 +00002069
Nicolas Geoffray5247c082017-01-13 14:17:29 +00002070 ScopedObjectAccess soa(Thread::Current());
Vladimir Marko175e7862018-03-27 09:03:13 +00002071 const DexFile& dex_file = *dex_compilation_unit_->GetDexFile();
2072 Handle<mirror::Class> klass = ResolveClass(soa, type_index);
Vladimir Markofca0b492018-07-23 15:30:52 +01002073 bool needs_access_check = LoadClassNeedsAccessCheck(soa, klass);
Vladimir Marko175e7862018-03-27 09:03:13 +00002074 TypeCheckKind check_kind = HSharpening::ComputeTypeCheckKind(
Vladimir Markodc4bcce2018-06-21 16:15:42 +01002075 klass.Get(), code_generator_, needs_access_check);
Vladimir Marko175e7862018-03-27 09:03:13 +00002076
2077 HInstruction* class_or_null = nullptr;
2078 HIntConstant* bitstring_path_to_root = nullptr;
2079 HIntConstant* bitstring_mask = nullptr;
2080 if (check_kind == TypeCheckKind::kBitstringCheck) {
2081 // TODO: Allow using the bitstring check also if we need an access check.
2082 DCHECK(!needs_access_check);
2083 class_or_null = graph_->GetNullConstant(dex_pc);
2084 MutexLock subtype_check_lock(Thread::Current(), *Locks::subtype_check_lock_);
2085 uint32_t path_to_root =
2086 SubtypeCheck<ObjPtr<mirror::Class>>::GetEncodedPathToRootForTarget(klass.Get());
2087 uint32_t mask = SubtypeCheck<ObjPtr<mirror::Class>>::GetEncodedPathToRootMask(klass.Get());
2088 bitstring_path_to_root = graph_->GetIntConstant(static_cast<int32_t>(path_to_root), dex_pc);
2089 bitstring_mask = graph_->GetIntConstant(static_cast<int32_t>(mask), dex_pc);
2090 } else {
Vladimir Markofca0b492018-07-23 15:30:52 +01002091 class_or_null = BuildLoadClass(soa, type_index, dex_file, klass, dex_pc, needs_access_check);
Vladimir Marko175e7862018-03-27 09:03:13 +00002092 }
2093 DCHECK(class_or_null != nullptr);
2094
David Brazdildee58d62016-04-07 09:54:26 +00002095 if (instruction.Opcode() == Instruction::INSTANCE_OF) {
Vladimir Marko175e7862018-03-27 09:03:13 +00002096 AppendInstruction(new (allocator_) HInstanceOf(object,
2097 class_or_null,
2098 check_kind,
2099 klass,
2100 dex_pc,
2101 allocator_,
2102 bitstring_path_to_root,
2103 bitstring_mask));
David Brazdildee58d62016-04-07 09:54:26 +00002104 UpdateLocal(destination, current_block_->GetLastInstruction());
2105 } else {
2106 DCHECK_EQ(instruction.Opcode(), Instruction::CHECK_CAST);
2107 // We emit a CheckCast followed by a BoundType. CheckCast is a statement
2108 // which may throw. If it succeeds BoundType sets the new type of `object`
2109 // for all subsequent uses.
Vladimir Marko175e7862018-03-27 09:03:13 +00002110 AppendInstruction(
2111 new (allocator_) HCheckCast(object,
2112 class_or_null,
2113 check_kind,
2114 klass,
2115 dex_pc,
2116 allocator_,
2117 bitstring_path_to_root,
2118 bitstring_mask));
Vladimir Markoca6fff82017-10-03 14:49:14 +01002119 AppendInstruction(new (allocator_) HBoundType(object, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00002120 UpdateLocal(reference, current_block_->GetLastInstruction());
2121 }
2122}
2123
David Brazdildee58d62016-04-07 09:54:26 +00002124bool HInstructionBuilder::CanDecodeQuickenedInfo() const {
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002125 return !quicken_info_.IsNull();
David Brazdildee58d62016-04-07 09:54:26 +00002126}
2127
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002128uint16_t HInstructionBuilder::LookupQuickenedInfo(uint32_t quicken_index) {
2129 DCHECK(CanDecodeQuickenedInfo());
2130 return quicken_info_.GetData(quicken_index);
David Brazdildee58d62016-04-07 09:54:26 +00002131}
2132
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002133bool HInstructionBuilder::ProcessDexInstruction(const Instruction& instruction,
2134 uint32_t dex_pc,
2135 size_t quicken_index) {
David Brazdildee58d62016-04-07 09:54:26 +00002136 switch (instruction.Opcode()) {
2137 case Instruction::CONST_4: {
2138 int32_t register_index = instruction.VRegA();
2139 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_11n(), dex_pc);
2140 UpdateLocal(register_index, constant);
2141 break;
2142 }
2143
2144 case Instruction::CONST_16: {
2145 int32_t register_index = instruction.VRegA();
2146 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_21s(), dex_pc);
2147 UpdateLocal(register_index, constant);
2148 break;
2149 }
2150
2151 case Instruction::CONST: {
2152 int32_t register_index = instruction.VRegA();
2153 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_31i(), dex_pc);
2154 UpdateLocal(register_index, constant);
2155 break;
2156 }
2157
2158 case Instruction::CONST_HIGH16: {
2159 int32_t register_index = instruction.VRegA();
2160 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_21h() << 16, dex_pc);
2161 UpdateLocal(register_index, constant);
2162 break;
2163 }
2164
2165 case Instruction::CONST_WIDE_16: {
2166 int32_t register_index = instruction.VRegA();
2167 // Get 16 bits of constant value, sign extended to 64 bits.
2168 int64_t value = instruction.VRegB_21s();
2169 value <<= 48;
2170 value >>= 48;
2171 HLongConstant* constant = graph_->GetLongConstant(value, dex_pc);
2172 UpdateLocal(register_index, constant);
2173 break;
2174 }
2175
2176 case Instruction::CONST_WIDE_32: {
2177 int32_t register_index = instruction.VRegA();
2178 // Get 32 bits of constant value, sign extended to 64 bits.
2179 int64_t value = instruction.VRegB_31i();
2180 value <<= 32;
2181 value >>= 32;
2182 HLongConstant* constant = graph_->GetLongConstant(value, dex_pc);
2183 UpdateLocal(register_index, constant);
2184 break;
2185 }
2186
2187 case Instruction::CONST_WIDE: {
2188 int32_t register_index = instruction.VRegA();
2189 HLongConstant* constant = graph_->GetLongConstant(instruction.VRegB_51l(), dex_pc);
2190 UpdateLocal(register_index, constant);
2191 break;
2192 }
2193
2194 case Instruction::CONST_WIDE_HIGH16: {
2195 int32_t register_index = instruction.VRegA();
2196 int64_t value = static_cast<int64_t>(instruction.VRegB_21h()) << 48;
2197 HLongConstant* constant = graph_->GetLongConstant(value, dex_pc);
2198 UpdateLocal(register_index, constant);
2199 break;
2200 }
2201
2202 // Note that the SSA building will refine the types.
2203 case Instruction::MOVE:
2204 case Instruction::MOVE_FROM16:
2205 case Instruction::MOVE_16: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002206 HInstruction* value = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
David Brazdildee58d62016-04-07 09:54:26 +00002207 UpdateLocal(instruction.VRegA(), value);
2208 break;
2209 }
2210
2211 // Note that the SSA building will refine the types.
2212 case Instruction::MOVE_WIDE:
2213 case Instruction::MOVE_WIDE_FROM16:
2214 case Instruction::MOVE_WIDE_16: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002215 HInstruction* value = LoadLocal(instruction.VRegB(), DataType::Type::kInt64);
David Brazdildee58d62016-04-07 09:54:26 +00002216 UpdateLocal(instruction.VRegA(), value);
2217 break;
2218 }
2219
2220 case Instruction::MOVE_OBJECT:
2221 case Instruction::MOVE_OBJECT_16:
2222 case Instruction::MOVE_OBJECT_FROM16: {
Nicolas Geoffray50a9ed02016-09-23 15:40:41 +01002223 // The verifier has no notion of a null type, so a move-object of constant 0
2224 // will lead to the same constant 0 in the destination register. To mimic
2225 // this behavior, we just pretend we haven't seen a type change (int to reference)
2226 // for the 0 constant and phis. We rely on our type propagation to eventually get the
2227 // types correct.
2228 uint32_t reg_number = instruction.VRegB();
2229 HInstruction* value = (*current_locals_)[reg_number];
2230 if (value->IsIntConstant()) {
2231 DCHECK_EQ(value->AsIntConstant()->GetValue(), 0);
2232 } else if (value->IsPhi()) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002233 DCHECK(value->GetType() == DataType::Type::kInt32 ||
2234 value->GetType() == DataType::Type::kReference);
Nicolas Geoffray50a9ed02016-09-23 15:40:41 +01002235 } else {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002236 value = LoadLocal(reg_number, DataType::Type::kReference);
Nicolas Geoffray50a9ed02016-09-23 15:40:41 +01002237 }
David Brazdildee58d62016-04-07 09:54:26 +00002238 UpdateLocal(instruction.VRegA(), value);
2239 break;
2240 }
2241
2242 case Instruction::RETURN_VOID_NO_BARRIER:
2243 case Instruction::RETURN_VOID: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002244 BuildReturn(instruction, DataType::Type::kVoid, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002245 break;
2246 }
2247
2248#define IF_XX(comparison, cond) \
2249 case Instruction::IF_##cond: If_22t<comparison>(instruction, dex_pc); break; \
2250 case Instruction::IF_##cond##Z: If_21t<comparison>(instruction, dex_pc); break
2251
2252 IF_XX(HEqual, EQ);
2253 IF_XX(HNotEqual, NE);
2254 IF_XX(HLessThan, LT);
2255 IF_XX(HLessThanOrEqual, LE);
2256 IF_XX(HGreaterThan, GT);
2257 IF_XX(HGreaterThanOrEqual, GE);
2258
2259 case Instruction::GOTO:
2260 case Instruction::GOTO_16:
2261 case Instruction::GOTO_32: {
Vladimir Markoca6fff82017-10-03 14:49:14 +01002262 AppendInstruction(new (allocator_) HGoto(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00002263 current_block_ = nullptr;
2264 break;
2265 }
2266
2267 case Instruction::RETURN: {
2268 BuildReturn(instruction, return_type_, dex_pc);
2269 break;
2270 }
2271
2272 case Instruction::RETURN_OBJECT: {
2273 BuildReturn(instruction, return_type_, dex_pc);
2274 break;
2275 }
2276
2277 case Instruction::RETURN_WIDE: {
2278 BuildReturn(instruction, return_type_, dex_pc);
2279 break;
2280 }
2281
2282 case Instruction::INVOKE_DIRECT:
2283 case Instruction::INVOKE_INTERFACE:
2284 case Instruction::INVOKE_STATIC:
2285 case Instruction::INVOKE_SUPER:
2286 case Instruction::INVOKE_VIRTUAL:
2287 case Instruction::INVOKE_VIRTUAL_QUICK: {
2288 uint16_t method_idx;
2289 if (instruction.Opcode() == Instruction::INVOKE_VIRTUAL_QUICK) {
2290 if (!CanDecodeQuickenedInfo()) {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00002291 VLOG(compiler) << "Not compiled: Could not decode quickened instruction "
2292 << instruction.Opcode();
David Brazdildee58d62016-04-07 09:54:26 +00002293 return false;
2294 }
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002295 method_idx = LookupQuickenedInfo(quicken_index);
David Brazdildee58d62016-04-07 09:54:26 +00002296 } else {
2297 method_idx = instruction.VRegB_35c();
2298 }
David Brazdildee58d62016-04-07 09:54:26 +00002299 uint32_t args[5];
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002300 uint32_t number_of_vreg_arguments = instruction.GetVarArgs(args);
2301 VarArgsInstructionOperands operands(args, number_of_vreg_arguments);
2302 if (!BuildInvoke(instruction, dex_pc, method_idx, operands)) {
David Brazdildee58d62016-04-07 09:54:26 +00002303 return false;
2304 }
2305 break;
2306 }
2307
2308 case Instruction::INVOKE_DIRECT_RANGE:
2309 case Instruction::INVOKE_INTERFACE_RANGE:
2310 case Instruction::INVOKE_STATIC_RANGE:
2311 case Instruction::INVOKE_SUPER_RANGE:
2312 case Instruction::INVOKE_VIRTUAL_RANGE:
2313 case Instruction::INVOKE_VIRTUAL_RANGE_QUICK: {
2314 uint16_t method_idx;
2315 if (instruction.Opcode() == Instruction::INVOKE_VIRTUAL_RANGE_QUICK) {
2316 if (!CanDecodeQuickenedInfo()) {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00002317 VLOG(compiler) << "Not compiled: Could not decode quickened instruction "
2318 << instruction.Opcode();
David Brazdildee58d62016-04-07 09:54:26 +00002319 return false;
2320 }
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002321 method_idx = LookupQuickenedInfo(quicken_index);
David Brazdildee58d62016-04-07 09:54:26 +00002322 } else {
2323 method_idx = instruction.VRegB_3rc();
2324 }
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002325 RangeInstructionOperands operands(instruction.VRegC(), instruction.VRegA_3rc());
2326 if (!BuildInvoke(instruction, dex_pc, method_idx, operands)) {
David Brazdildee58d62016-04-07 09:54:26 +00002327 return false;
2328 }
2329 break;
2330 }
2331
Orion Hodsonac141392017-01-13 11:53:47 +00002332 case Instruction::INVOKE_POLYMORPHIC: {
2333 uint16_t method_idx = instruction.VRegB_45cc();
Orion Hodson06d10a72018-05-14 08:53:38 +01002334 dex::ProtoIndex proto_idx(instruction.VRegH_45cc());
Orion Hodsonac141392017-01-13 11:53:47 +00002335 uint32_t args[5];
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002336 uint32_t number_of_vreg_arguments = instruction.GetVarArgs(args);
2337 VarArgsInstructionOperands operands(args, number_of_vreg_arguments);
Orion Hodson4c8e12e2018-05-18 08:33:20 +01002338 return BuildInvokePolymorphic(dex_pc, method_idx, proto_idx, operands);
Orion Hodsonac141392017-01-13 11:53:47 +00002339 }
2340
2341 case Instruction::INVOKE_POLYMORPHIC_RANGE: {
2342 uint16_t method_idx = instruction.VRegB_4rcc();
Orion Hodson06d10a72018-05-14 08:53:38 +01002343 dex::ProtoIndex proto_idx(instruction.VRegH_4rcc());
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002344 RangeInstructionOperands operands(instruction.VRegC_4rcc(), instruction.VRegA_4rcc());
Orion Hodson4c8e12e2018-05-18 08:33:20 +01002345 return BuildInvokePolymorphic(dex_pc, method_idx, proto_idx, operands);
2346 }
2347
2348 case Instruction::INVOKE_CUSTOM: {
2349 uint16_t call_site_idx = instruction.VRegB_35c();
2350 uint32_t args[5];
2351 uint32_t number_of_vreg_arguments = instruction.GetVarArgs(args);
2352 VarArgsInstructionOperands operands(args, number_of_vreg_arguments);
2353 return BuildInvokeCustom(dex_pc, call_site_idx, operands);
2354 }
2355
2356 case Instruction::INVOKE_CUSTOM_RANGE: {
2357 uint16_t call_site_idx = instruction.VRegB_3rc();
2358 RangeInstructionOperands operands(instruction.VRegC_3rc(), instruction.VRegA_3rc());
2359 return BuildInvokeCustom(dex_pc, call_site_idx, operands);
Orion Hodsonac141392017-01-13 11:53:47 +00002360 }
2361
David Brazdildee58d62016-04-07 09:54:26 +00002362 case Instruction::NEG_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002363 Unop_12x<HNeg>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002364 break;
2365 }
2366
2367 case Instruction::NEG_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002368 Unop_12x<HNeg>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002369 break;
2370 }
2371
2372 case Instruction::NEG_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002373 Unop_12x<HNeg>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002374 break;
2375 }
2376
2377 case Instruction::NEG_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002378 Unop_12x<HNeg>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002379 break;
2380 }
2381
2382 case Instruction::NOT_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002383 Unop_12x<HNot>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002384 break;
2385 }
2386
2387 case Instruction::NOT_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002388 Unop_12x<HNot>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002389 break;
2390 }
2391
2392 case Instruction::INT_TO_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002393 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002394 break;
2395 }
2396
2397 case Instruction::INT_TO_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002398 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002399 break;
2400 }
2401
2402 case Instruction::INT_TO_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002403 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002404 break;
2405 }
2406
2407 case Instruction::LONG_TO_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002408 Conversion_12x(instruction, DataType::Type::kInt64, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002409 break;
2410 }
2411
2412 case Instruction::LONG_TO_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002413 Conversion_12x(instruction, DataType::Type::kInt64, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002414 break;
2415 }
2416
2417 case Instruction::LONG_TO_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002418 Conversion_12x(instruction, DataType::Type::kInt64, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002419 break;
2420 }
2421
2422 case Instruction::FLOAT_TO_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002423 Conversion_12x(instruction, DataType::Type::kFloat32, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002424 break;
2425 }
2426
2427 case Instruction::FLOAT_TO_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002428 Conversion_12x(instruction, DataType::Type::kFloat32, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002429 break;
2430 }
2431
2432 case Instruction::FLOAT_TO_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002433 Conversion_12x(instruction, DataType::Type::kFloat32, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002434 break;
2435 }
2436
2437 case Instruction::DOUBLE_TO_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002438 Conversion_12x(instruction, DataType::Type::kFloat64, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002439 break;
2440 }
2441
2442 case Instruction::DOUBLE_TO_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002443 Conversion_12x(instruction, DataType::Type::kFloat64, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002444 break;
2445 }
2446
2447 case Instruction::DOUBLE_TO_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002448 Conversion_12x(instruction, DataType::Type::kFloat64, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002449 break;
2450 }
2451
2452 case Instruction::INT_TO_BYTE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002453 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kInt8, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002454 break;
2455 }
2456
2457 case Instruction::INT_TO_SHORT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002458 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kInt16, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002459 break;
2460 }
2461
2462 case Instruction::INT_TO_CHAR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002463 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kUint16, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002464 break;
2465 }
2466
2467 case Instruction::ADD_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002468 Binop_23x<HAdd>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002469 break;
2470 }
2471
2472 case Instruction::ADD_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002473 Binop_23x<HAdd>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002474 break;
2475 }
2476
2477 case Instruction::ADD_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002478 Binop_23x<HAdd>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002479 break;
2480 }
2481
2482 case Instruction::ADD_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002483 Binop_23x<HAdd>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002484 break;
2485 }
2486
2487 case Instruction::SUB_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002488 Binop_23x<HSub>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002489 break;
2490 }
2491
2492 case Instruction::SUB_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002493 Binop_23x<HSub>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002494 break;
2495 }
2496
2497 case Instruction::SUB_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002498 Binop_23x<HSub>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002499 break;
2500 }
2501
2502 case Instruction::SUB_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002503 Binop_23x<HSub>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002504 break;
2505 }
2506
2507 case Instruction::ADD_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002508 Binop_12x<HAdd>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002509 break;
2510 }
2511
2512 case Instruction::MUL_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002513 Binop_23x<HMul>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002514 break;
2515 }
2516
2517 case Instruction::MUL_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002518 Binop_23x<HMul>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002519 break;
2520 }
2521
2522 case Instruction::MUL_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002523 Binop_23x<HMul>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002524 break;
2525 }
2526
2527 case Instruction::MUL_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002528 Binop_23x<HMul>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002529 break;
2530 }
2531
2532 case Instruction::DIV_INT: {
2533 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002534 dex_pc, DataType::Type::kInt32, false, true);
David Brazdildee58d62016-04-07 09:54:26 +00002535 break;
2536 }
2537
2538 case Instruction::DIV_LONG: {
2539 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002540 dex_pc, DataType::Type::kInt64, false, true);
David Brazdildee58d62016-04-07 09:54:26 +00002541 break;
2542 }
2543
2544 case Instruction::DIV_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002545 Binop_23x<HDiv>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002546 break;
2547 }
2548
2549 case Instruction::DIV_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002550 Binop_23x<HDiv>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002551 break;
2552 }
2553
2554 case Instruction::REM_INT: {
2555 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002556 dex_pc, DataType::Type::kInt32, false, false);
David Brazdildee58d62016-04-07 09:54:26 +00002557 break;
2558 }
2559
2560 case Instruction::REM_LONG: {
2561 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002562 dex_pc, DataType::Type::kInt64, false, false);
David Brazdildee58d62016-04-07 09:54:26 +00002563 break;
2564 }
2565
2566 case Instruction::REM_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002567 Binop_23x<HRem>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002568 break;
2569 }
2570
2571 case Instruction::REM_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002572 Binop_23x<HRem>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002573 break;
2574 }
2575
2576 case Instruction::AND_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002577 Binop_23x<HAnd>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002578 break;
2579 }
2580
2581 case Instruction::AND_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002582 Binop_23x<HAnd>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002583 break;
2584 }
2585
2586 case Instruction::SHL_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002587 Binop_23x_shift<HShl>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002588 break;
2589 }
2590
2591 case Instruction::SHL_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002592 Binop_23x_shift<HShl>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002593 break;
2594 }
2595
2596 case Instruction::SHR_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002597 Binop_23x_shift<HShr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002598 break;
2599 }
2600
2601 case Instruction::SHR_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002602 Binop_23x_shift<HShr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002603 break;
2604 }
2605
2606 case Instruction::USHR_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002607 Binop_23x_shift<HUShr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002608 break;
2609 }
2610
2611 case Instruction::USHR_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002612 Binop_23x_shift<HUShr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002613 break;
2614 }
2615
2616 case Instruction::OR_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002617 Binop_23x<HOr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002618 break;
2619 }
2620
2621 case Instruction::OR_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002622 Binop_23x<HOr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002623 break;
2624 }
2625
2626 case Instruction::XOR_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002627 Binop_23x<HXor>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002628 break;
2629 }
2630
2631 case Instruction::XOR_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002632 Binop_23x<HXor>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002633 break;
2634 }
2635
2636 case Instruction::ADD_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002637 Binop_12x<HAdd>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002638 break;
2639 }
2640
2641 case Instruction::ADD_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002642 Binop_12x<HAdd>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002643 break;
2644 }
2645
2646 case Instruction::ADD_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002647 Binop_12x<HAdd>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002648 break;
2649 }
2650
2651 case Instruction::SUB_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002652 Binop_12x<HSub>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002653 break;
2654 }
2655
2656 case Instruction::SUB_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002657 Binop_12x<HSub>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002658 break;
2659 }
2660
2661 case Instruction::SUB_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002662 Binop_12x<HSub>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002663 break;
2664 }
2665
2666 case Instruction::SUB_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002667 Binop_12x<HSub>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002668 break;
2669 }
2670
2671 case Instruction::MUL_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002672 Binop_12x<HMul>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002673 break;
2674 }
2675
2676 case Instruction::MUL_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002677 Binop_12x<HMul>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002678 break;
2679 }
2680
2681 case Instruction::MUL_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002682 Binop_12x<HMul>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002683 break;
2684 }
2685
2686 case Instruction::MUL_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002687 Binop_12x<HMul>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002688 break;
2689 }
2690
2691 case Instruction::DIV_INT_2ADDR: {
2692 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002693 dex_pc, DataType::Type::kInt32, false, true);
David Brazdildee58d62016-04-07 09:54:26 +00002694 break;
2695 }
2696
2697 case Instruction::DIV_LONG_2ADDR: {
2698 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002699 dex_pc, DataType::Type::kInt64, false, true);
David Brazdildee58d62016-04-07 09:54:26 +00002700 break;
2701 }
2702
2703 case Instruction::REM_INT_2ADDR: {
2704 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002705 dex_pc, DataType::Type::kInt32, false, false);
David Brazdildee58d62016-04-07 09:54:26 +00002706 break;
2707 }
2708
2709 case Instruction::REM_LONG_2ADDR: {
2710 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002711 dex_pc, DataType::Type::kInt64, false, false);
David Brazdildee58d62016-04-07 09:54:26 +00002712 break;
2713 }
2714
2715 case Instruction::REM_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002716 Binop_12x<HRem>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002717 break;
2718 }
2719
2720 case Instruction::REM_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002721 Binop_12x<HRem>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002722 break;
2723 }
2724
2725 case Instruction::SHL_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002726 Binop_12x_shift<HShl>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002727 break;
2728 }
2729
2730 case Instruction::SHL_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002731 Binop_12x_shift<HShl>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002732 break;
2733 }
2734
2735 case Instruction::SHR_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002736 Binop_12x_shift<HShr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002737 break;
2738 }
2739
2740 case Instruction::SHR_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002741 Binop_12x_shift<HShr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002742 break;
2743 }
2744
2745 case Instruction::USHR_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002746 Binop_12x_shift<HUShr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002747 break;
2748 }
2749
2750 case Instruction::USHR_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002751 Binop_12x_shift<HUShr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002752 break;
2753 }
2754
2755 case Instruction::DIV_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002756 Binop_12x<HDiv>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002757 break;
2758 }
2759
2760 case Instruction::DIV_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002761 Binop_12x<HDiv>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002762 break;
2763 }
2764
2765 case Instruction::AND_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002766 Binop_12x<HAnd>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002767 break;
2768 }
2769
2770 case Instruction::AND_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002771 Binop_12x<HAnd>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002772 break;
2773 }
2774
2775 case Instruction::OR_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002776 Binop_12x<HOr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002777 break;
2778 }
2779
2780 case Instruction::OR_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002781 Binop_12x<HOr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002782 break;
2783 }
2784
2785 case Instruction::XOR_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002786 Binop_12x<HXor>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002787 break;
2788 }
2789
2790 case Instruction::XOR_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002791 Binop_12x<HXor>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002792 break;
2793 }
2794
2795 case Instruction::ADD_INT_LIT16: {
2796 Binop_22s<HAdd>(instruction, false, dex_pc);
2797 break;
2798 }
2799
2800 case Instruction::AND_INT_LIT16: {
2801 Binop_22s<HAnd>(instruction, false, dex_pc);
2802 break;
2803 }
2804
2805 case Instruction::OR_INT_LIT16: {
2806 Binop_22s<HOr>(instruction, false, dex_pc);
2807 break;
2808 }
2809
2810 case Instruction::XOR_INT_LIT16: {
2811 Binop_22s<HXor>(instruction, false, dex_pc);
2812 break;
2813 }
2814
2815 case Instruction::RSUB_INT: {
2816 Binop_22s<HSub>(instruction, true, dex_pc);
2817 break;
2818 }
2819
2820 case Instruction::MUL_INT_LIT16: {
2821 Binop_22s<HMul>(instruction, false, dex_pc);
2822 break;
2823 }
2824
2825 case Instruction::ADD_INT_LIT8: {
2826 Binop_22b<HAdd>(instruction, false, dex_pc);
2827 break;
2828 }
2829
2830 case Instruction::AND_INT_LIT8: {
2831 Binop_22b<HAnd>(instruction, false, dex_pc);
2832 break;
2833 }
2834
2835 case Instruction::OR_INT_LIT8: {
2836 Binop_22b<HOr>(instruction, false, dex_pc);
2837 break;
2838 }
2839
2840 case Instruction::XOR_INT_LIT8: {
2841 Binop_22b<HXor>(instruction, false, dex_pc);
2842 break;
2843 }
2844
2845 case Instruction::RSUB_INT_LIT8: {
2846 Binop_22b<HSub>(instruction, true, dex_pc);
2847 break;
2848 }
2849
2850 case Instruction::MUL_INT_LIT8: {
2851 Binop_22b<HMul>(instruction, false, dex_pc);
2852 break;
2853 }
2854
2855 case Instruction::DIV_INT_LIT16:
2856 case Instruction::DIV_INT_LIT8: {
2857 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002858 dex_pc, DataType::Type::kInt32, true, true);
David Brazdildee58d62016-04-07 09:54:26 +00002859 break;
2860 }
2861
2862 case Instruction::REM_INT_LIT16:
2863 case Instruction::REM_INT_LIT8: {
2864 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002865 dex_pc, DataType::Type::kInt32, true, false);
David Brazdildee58d62016-04-07 09:54:26 +00002866 break;
2867 }
2868
2869 case Instruction::SHL_INT_LIT8: {
2870 Binop_22b<HShl>(instruction, false, dex_pc);
2871 break;
2872 }
2873
2874 case Instruction::SHR_INT_LIT8: {
2875 Binop_22b<HShr>(instruction, false, dex_pc);
2876 break;
2877 }
2878
2879 case Instruction::USHR_INT_LIT8: {
2880 Binop_22b<HUShr>(instruction, false, dex_pc);
2881 break;
2882 }
2883
2884 case Instruction::NEW_INSTANCE: {
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002885 HNewInstance* new_instance =
2886 BuildNewInstance(dex::TypeIndex(instruction.VRegB_21c()), dex_pc);
2887 DCHECK(new_instance != nullptr);
2888
David Brazdildee58d62016-04-07 09:54:26 +00002889 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002890 BuildConstructorFenceForAllocation(new_instance);
David Brazdildee58d62016-04-07 09:54:26 +00002891 break;
2892 }
2893
2894 case Instruction::NEW_ARRAY: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08002895 dex::TypeIndex type_index(instruction.VRegC_22c());
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002896 HInstruction* length = LoadLocal(instruction.VRegB_22c(), DataType::Type::kInt32);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00002897 HLoadClass* cls = BuildLoadClass(type_index, dex_pc);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002898
Vladimir Markoca6fff82017-10-03 14:49:14 +01002899 HNewArray* new_array = new (allocator_) HNewArray(cls, length, dex_pc);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002900 AppendInstruction(new_array);
David Brazdildee58d62016-04-07 09:54:26 +00002901 UpdateLocal(instruction.VRegA_22c(), current_block_->GetLastInstruction());
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002902 BuildConstructorFenceForAllocation(new_array);
David Brazdildee58d62016-04-07 09:54:26 +00002903 break;
2904 }
2905
2906 case Instruction::FILLED_NEW_ARRAY: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08002907 dex::TypeIndex type_index(instruction.VRegB_35c());
David Brazdildee58d62016-04-07 09:54:26 +00002908 uint32_t args[5];
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002909 uint32_t number_of_vreg_arguments = instruction.GetVarArgs(args);
2910 VarArgsInstructionOperands operands(args, number_of_vreg_arguments);
2911 HNewArray* new_array = BuildFilledNewArray(dex_pc, type_index, operands);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002912 BuildConstructorFenceForAllocation(new_array);
David Brazdildee58d62016-04-07 09:54:26 +00002913 break;
2914 }
2915
2916 case Instruction::FILLED_NEW_ARRAY_RANGE: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08002917 dex::TypeIndex type_index(instruction.VRegB_3rc());
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002918 RangeInstructionOperands operands(instruction.VRegC_3rc(), instruction.VRegA_3rc());
2919 HNewArray* new_array = BuildFilledNewArray(dex_pc, type_index, operands);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002920 BuildConstructorFenceForAllocation(new_array);
David Brazdildee58d62016-04-07 09:54:26 +00002921 break;
2922 }
2923
2924 case Instruction::FILL_ARRAY_DATA: {
2925 BuildFillArrayData(instruction, dex_pc);
2926 break;
2927 }
2928
2929 case Instruction::MOVE_RESULT:
2930 case Instruction::MOVE_RESULT_WIDE:
2931 case Instruction::MOVE_RESULT_OBJECT: {
2932 DCHECK(latest_result_ != nullptr);
2933 UpdateLocal(instruction.VRegA(), latest_result_);
2934 latest_result_ = nullptr;
2935 break;
2936 }
2937
2938 case Instruction::CMP_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002939 Binop_23x_cmp(instruction, DataType::Type::kInt64, ComparisonBias::kNoBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002940 break;
2941 }
2942
2943 case Instruction::CMPG_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002944 Binop_23x_cmp(instruction, DataType::Type::kFloat32, ComparisonBias::kGtBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002945 break;
2946 }
2947
2948 case Instruction::CMPG_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002949 Binop_23x_cmp(instruction, DataType::Type::kFloat64, ComparisonBias::kGtBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002950 break;
2951 }
2952
2953 case Instruction::CMPL_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002954 Binop_23x_cmp(instruction, DataType::Type::kFloat32, ComparisonBias::kLtBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002955 break;
2956 }
2957
2958 case Instruction::CMPL_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002959 Binop_23x_cmp(instruction, DataType::Type::kFloat64, ComparisonBias::kLtBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002960 break;
2961 }
2962
2963 case Instruction::NOP:
2964 break;
2965
2966 case Instruction::IGET:
2967 case Instruction::IGET_QUICK:
2968 case Instruction::IGET_WIDE:
2969 case Instruction::IGET_WIDE_QUICK:
2970 case Instruction::IGET_OBJECT:
2971 case Instruction::IGET_OBJECT_QUICK:
2972 case Instruction::IGET_BOOLEAN:
2973 case Instruction::IGET_BOOLEAN_QUICK:
2974 case Instruction::IGET_BYTE:
2975 case Instruction::IGET_BYTE_QUICK:
2976 case Instruction::IGET_CHAR:
2977 case Instruction::IGET_CHAR_QUICK:
2978 case Instruction::IGET_SHORT:
2979 case Instruction::IGET_SHORT_QUICK: {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00002980 if (!BuildInstanceFieldAccess(instruction, dex_pc, /* is_put */ false, quicken_index)) {
David Brazdildee58d62016-04-07 09:54:26 +00002981 return false;
2982 }
2983 break;
2984 }
2985
2986 case Instruction::IPUT:
2987 case Instruction::IPUT_QUICK:
2988 case Instruction::IPUT_WIDE:
2989 case Instruction::IPUT_WIDE_QUICK:
2990 case Instruction::IPUT_OBJECT:
2991 case Instruction::IPUT_OBJECT_QUICK:
2992 case Instruction::IPUT_BOOLEAN:
2993 case Instruction::IPUT_BOOLEAN_QUICK:
2994 case Instruction::IPUT_BYTE:
2995 case Instruction::IPUT_BYTE_QUICK:
2996 case Instruction::IPUT_CHAR:
2997 case Instruction::IPUT_CHAR_QUICK:
2998 case Instruction::IPUT_SHORT:
2999 case Instruction::IPUT_SHORT_QUICK: {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00003000 if (!BuildInstanceFieldAccess(instruction, dex_pc, /* is_put */ true, quicken_index)) {
David Brazdildee58d62016-04-07 09:54:26 +00003001 return false;
3002 }
3003 break;
3004 }
3005
3006 case Instruction::SGET:
3007 case Instruction::SGET_WIDE:
3008 case Instruction::SGET_OBJECT:
3009 case Instruction::SGET_BOOLEAN:
3010 case Instruction::SGET_BYTE:
3011 case Instruction::SGET_CHAR:
3012 case Instruction::SGET_SHORT: {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00003013 BuildStaticFieldAccess(instruction, dex_pc, /* is_put */ false);
David Brazdildee58d62016-04-07 09:54:26 +00003014 break;
3015 }
3016
3017 case Instruction::SPUT:
3018 case Instruction::SPUT_WIDE:
3019 case Instruction::SPUT_OBJECT:
3020 case Instruction::SPUT_BOOLEAN:
3021 case Instruction::SPUT_BYTE:
3022 case Instruction::SPUT_CHAR:
3023 case Instruction::SPUT_SHORT: {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00003024 BuildStaticFieldAccess(instruction, dex_pc, /* is_put */ true);
David Brazdildee58d62016-04-07 09:54:26 +00003025 break;
3026 }
3027
3028#define ARRAY_XX(kind, anticipated_type) \
3029 case Instruction::AGET##kind: { \
3030 BuildArrayAccess(instruction, dex_pc, false, anticipated_type); \
3031 break; \
3032 } \
3033 case Instruction::APUT##kind: { \
3034 BuildArrayAccess(instruction, dex_pc, true, anticipated_type); \
3035 break; \
3036 }
3037
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003038 ARRAY_XX(, DataType::Type::kInt32);
3039 ARRAY_XX(_WIDE, DataType::Type::kInt64);
3040 ARRAY_XX(_OBJECT, DataType::Type::kReference);
3041 ARRAY_XX(_BOOLEAN, DataType::Type::kBool);
3042 ARRAY_XX(_BYTE, DataType::Type::kInt8);
3043 ARRAY_XX(_CHAR, DataType::Type::kUint16);
3044 ARRAY_XX(_SHORT, DataType::Type::kInt16);
David Brazdildee58d62016-04-07 09:54:26 +00003045
3046 case Instruction::ARRAY_LENGTH: {
David Brazdilc120bbe2016-04-22 16:57:00 +01003047 HInstruction* object = LoadNullCheckedLocal(instruction.VRegB_12x(), dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01003048 AppendInstruction(new (allocator_) HArrayLength(object, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00003049 UpdateLocal(instruction.VRegA_12x(), current_block_->GetLastInstruction());
3050 break;
3051 }
3052
3053 case Instruction::CONST_STRING: {
Andreas Gampe8a0128a2016-11-28 07:38:35 -08003054 dex::StringIndex string_index(instruction.VRegB_21c());
Vladimir Marko28e012a2017-12-07 11:22:59 +00003055 BuildLoadString(string_index, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003056 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
3057 break;
3058 }
3059
3060 case Instruction::CONST_STRING_JUMBO: {
Andreas Gampe8a0128a2016-11-28 07:38:35 -08003061 dex::StringIndex string_index(instruction.VRegB_31c());
Vladimir Marko28e012a2017-12-07 11:22:59 +00003062 BuildLoadString(string_index, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003063 UpdateLocal(instruction.VRegA_31c(), current_block_->GetLastInstruction());
3064 break;
3065 }
3066
3067 case Instruction::CONST_CLASS: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08003068 dex::TypeIndex type_index(instruction.VRegB_21c());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00003069 BuildLoadClass(type_index, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003070 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
3071 break;
3072 }
3073
Orion Hodsondbaa5c72018-05-10 08:22:46 +01003074 case Instruction::CONST_METHOD_HANDLE: {
3075 uint16_t method_handle_idx = instruction.VRegB_21c();
3076 BuildLoadMethodHandle(method_handle_idx, dex_pc);
3077 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
3078 break;
3079 }
3080
Orion Hodson18259d72018-04-12 11:18:23 +01003081 case Instruction::CONST_METHOD_TYPE: {
Orion Hodson06d10a72018-05-14 08:53:38 +01003082 dex::ProtoIndex proto_idx(instruction.VRegB_21c());
Orion Hodson18259d72018-04-12 11:18:23 +01003083 BuildLoadMethodType(proto_idx, dex_pc);
3084 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
3085 break;
3086 }
3087
David Brazdildee58d62016-04-07 09:54:26 +00003088 case Instruction::MOVE_EXCEPTION: {
Vladimir Markoca6fff82017-10-03 14:49:14 +01003089 AppendInstruction(new (allocator_) HLoadException(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00003090 UpdateLocal(instruction.VRegA_11x(), current_block_->GetLastInstruction());
Vladimir Markoca6fff82017-10-03 14:49:14 +01003091 AppendInstruction(new (allocator_) HClearException(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00003092 break;
3093 }
3094
3095 case Instruction::THROW: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003096 HInstruction* exception = LoadLocal(instruction.VRegA_11x(), DataType::Type::kReference);
Vladimir Markoca6fff82017-10-03 14:49:14 +01003097 AppendInstruction(new (allocator_) HThrow(exception, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00003098 // We finished building this block. Set the current block to null to avoid
3099 // adding dead instructions to it.
3100 current_block_ = nullptr;
3101 break;
3102 }
3103
3104 case Instruction::INSTANCE_OF: {
3105 uint8_t destination = instruction.VRegA_22c();
3106 uint8_t reference = instruction.VRegB_22c();
Andreas Gampea5b09a62016-11-17 15:21:22 -08003107 dex::TypeIndex type_index(instruction.VRegC_22c());
David Brazdildee58d62016-04-07 09:54:26 +00003108 BuildTypeCheck(instruction, destination, reference, type_index, dex_pc);
3109 break;
3110 }
3111
3112 case Instruction::CHECK_CAST: {
3113 uint8_t reference = instruction.VRegA_21c();
Andreas Gampea5b09a62016-11-17 15:21:22 -08003114 dex::TypeIndex type_index(instruction.VRegB_21c());
David Brazdildee58d62016-04-07 09:54:26 +00003115 BuildTypeCheck(instruction, -1, reference, type_index, dex_pc);
3116 break;
3117 }
3118
3119 case Instruction::MONITOR_ENTER: {
Vladimir Markoca6fff82017-10-03 14:49:14 +01003120 AppendInstruction(new (allocator_) HMonitorOperation(
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003121 LoadLocal(instruction.VRegA_11x(), DataType::Type::kReference),
David Brazdildee58d62016-04-07 09:54:26 +00003122 HMonitorOperation::OperationKind::kEnter,
3123 dex_pc));
3124 break;
3125 }
3126
3127 case Instruction::MONITOR_EXIT: {
Vladimir Markoca6fff82017-10-03 14:49:14 +01003128 AppendInstruction(new (allocator_) HMonitorOperation(
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003129 LoadLocal(instruction.VRegA_11x(), DataType::Type::kReference),
David Brazdildee58d62016-04-07 09:54:26 +00003130 HMonitorOperation::OperationKind::kExit,
3131 dex_pc));
3132 break;
3133 }
3134
3135 case Instruction::SPARSE_SWITCH:
3136 case Instruction::PACKED_SWITCH: {
3137 BuildSwitch(instruction, dex_pc);
3138 break;
3139 }
3140
Orion Hodson4c8e12e2018-05-18 08:33:20 +01003141 case Instruction::UNUSED_3E:
3142 case Instruction::UNUSED_3F:
3143 case Instruction::UNUSED_40:
3144 case Instruction::UNUSED_41:
3145 case Instruction::UNUSED_42:
3146 case Instruction::UNUSED_43:
3147 case Instruction::UNUSED_79:
3148 case Instruction::UNUSED_7A:
3149 case Instruction::UNUSED_F3:
3150 case Instruction::UNUSED_F4:
3151 case Instruction::UNUSED_F5:
3152 case Instruction::UNUSED_F6:
3153 case Instruction::UNUSED_F7:
3154 case Instruction::UNUSED_F8:
3155 case Instruction::UNUSED_F9: {
David Brazdildee58d62016-04-07 09:54:26 +00003156 VLOG(compiler) << "Did not compile "
David Sehr709b0702016-10-13 09:12:37 -07003157 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
David Brazdildee58d62016-04-07 09:54:26 +00003158 << " because of unhandled instruction "
3159 << instruction.Name();
Igor Murashkin1e065a52017-08-09 13:20:34 -07003160 MaybeRecordStat(compilation_stats_,
3161 MethodCompilationStat::kNotCompiledUnhandledInstruction);
David Brazdildee58d62016-04-07 09:54:26 +00003162 return false;
Orion Hodson4c8e12e2018-05-18 08:33:20 +01003163 }
David Brazdildee58d62016-04-07 09:54:26 +00003164 }
3165 return true;
3166} // NOLINT(readability/fn_size)
3167
Vladimir Marko8d6768d2017-03-14 10:13:21 +00003168ObjPtr<mirror::Class> HInstructionBuilder::LookupResolvedType(
3169 dex::TypeIndex type_index,
3170 const DexCompilationUnit& compilation_unit) const {
Vladimir Marko666ee3d2017-12-11 18:37:36 +00003171 return compilation_unit.GetClassLinker()->LookupResolvedType(
Vladimir Marko8d6768d2017-03-14 10:13:21 +00003172 type_index, compilation_unit.GetDexCache().Get(), compilation_unit.GetClassLoader().Get());
3173}
3174
3175ObjPtr<mirror::Class> HInstructionBuilder::LookupReferrerClass() const {
3176 // TODO: Cache the result in a Handle<mirror::Class>.
3177 const DexFile::MethodId& method_id =
3178 dex_compilation_unit_->GetDexFile()->GetMethodId(dex_compilation_unit_->GetDexMethodIndex());
3179 return LookupResolvedType(method_id.class_idx_, *dex_compilation_unit_);
3180}
3181
David Brazdildee58d62016-04-07 09:54:26 +00003182} // namespace art