blob: 4ae94b7b3f156ff69992cf872b3386a2e468eb22 [file] [log] [blame]
David Brazdildee58d62016-04-07 09:54:26 +00001/*
2 * Copyright (C) 2016 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17#include "instruction_builder.h"
18
Matthew Gharrity465ecc82016-07-19 21:32:52 +000019#include "art_method-inl.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010020#include "base/arena_bit_vector.h"
21#include "base/bit_vector-inl.h"
Andreas Gampe85f1c572018-11-21 13:52:48 -080022#include "base/logging.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010023#include "block_builder.h"
Vladimir Marko3b506202018-10-31 14:33:58 +000024#include "class_linker-inl.h"
25#include "code_generator.h"
Vladimir Marko0ebe0d82017-09-21 22:50:39 +010026#include "data_type-inl.h"
David Sehr312f3b22018-03-19 08:39:26 -070027#include "dex/bytecode_utils.h"
David Sehr9e734c72018-01-04 17:56:19 -080028#include "dex/dex_instruction-inl.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010029#include "driver/dex_compilation_unit.h"
David Brazdildee58d62016-04-07 09:54:26 +000030#include "driver/compiler_options.h"
Andreas Gampe75a7db62016-09-26 12:04:26 -070031#include "imtable-inl.h"
Nicolas Geoffraya48c3df2019-06-27 13:11:12 +000032#include "jit/jit.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010033#include "mirror/dex_cache.h"
Nicolas Geoffray58cc1cb2017-11-20 13:27:29 +000034#include "oat_file.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010035#include "optimizing_compiler_stats.h"
Mathieu Chartierde4b08f2017-07-10 14:13:41 -070036#include "quicken_info.h"
Mathieu Chartier0795f232016-09-27 18:43:30 -070037#include "scoped_thread_state_change-inl.h"
Andreas Gampe8cf9cb32017-07-19 09:28:38 -070038#include "sharpening.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010039#include "ssa_builder.h"
Andreas Gampea7c83ac2017-09-11 08:14:23 -070040#include "well_known_classes.h"
David Brazdildee58d62016-04-07 09:54:26 +000041
Vladimir Marko0a516052019-10-14 13:00:44 +000042namespace art {
David Brazdildee58d62016-04-07 09:54:26 +000043
Mathieu Chartier808c7a52017-12-15 11:19:33 -080044HInstructionBuilder::HInstructionBuilder(HGraph* graph,
45 HBasicBlockBuilder* block_builder,
46 SsaBuilder* ssa_builder,
47 const DexFile* dex_file,
48 const CodeItemDebugInfoAccessor& accessor,
49 DataType::Type return_type,
50 const DexCompilationUnit* dex_compilation_unit,
51 const DexCompilationUnit* outer_compilation_unit,
Mathieu Chartier808c7a52017-12-15 11:19:33 -080052 CodeGenerator* code_generator,
Mathieu Chartier210531f2018-01-12 10:15:51 -080053 ArrayRef<const uint8_t> interpreter_metadata,
Mathieu Chartier808c7a52017-12-15 11:19:33 -080054 OptimizingCompilerStats* compiler_stats,
55 VariableSizedHandleScope* handles,
56 ScopedArenaAllocator* local_allocator)
57 : allocator_(graph->GetAllocator()),
58 graph_(graph),
59 handles_(handles),
60 dex_file_(dex_file),
61 code_item_accessor_(accessor),
62 return_type_(return_type),
63 block_builder_(block_builder),
64 ssa_builder_(ssa_builder),
Mathieu Chartier808c7a52017-12-15 11:19:33 -080065 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),
Vladimir Marko3b506202018-10-31 14:33:58 +000076 loop_headers_(local_allocator->Adapter(kArenaAllocGraphBuilder)),
77 class_cache_(std::less<dex::TypeIndex>(), local_allocator->Adapter(kArenaAllocGraphBuilder)) {
Mathieu Chartier808c7a52017-12-15 11:19:33 -080078 loop_headers_.reserve(kDefaultNumberOfLoops);
79}
80
David Brazdildee58d62016-04-07 09:54:26 +000081HBasicBlock* HInstructionBuilder::FindBlockStartingAt(uint32_t dex_pc) const {
82 return block_builder_->GetBlockAt(dex_pc);
83}
84
Vladimir Marko69d310e2017-10-09 14:12:23 +010085inline ScopedArenaVector<HInstruction*>* HInstructionBuilder::GetLocalsFor(HBasicBlock* block) {
86 ScopedArenaVector<HInstruction*>* locals = &locals_for_[block->GetBlockId()];
David Brazdildee58d62016-04-07 09:54:26 +000087 const size_t vregs = graph_->GetNumberOfVRegs();
Mingyao Yang01b47b02017-02-03 12:09:57 -080088 if (locals->size() == vregs) {
89 return locals;
90 }
91 return GetLocalsForWithAllocation(block, locals, vregs);
92}
David Brazdildee58d62016-04-07 09:54:26 +000093
Vladimir Marko69d310e2017-10-09 14:12:23 +010094ScopedArenaVector<HInstruction*>* HInstructionBuilder::GetLocalsForWithAllocation(
Mingyao Yang01b47b02017-02-03 12:09:57 -080095 HBasicBlock* block,
Vladimir Marko69d310e2017-10-09 14:12:23 +010096 ScopedArenaVector<HInstruction*>* locals,
Mingyao Yang01b47b02017-02-03 12:09:57 -080097 const size_t vregs) {
98 DCHECK_NE(locals->size(), vregs);
99 locals->resize(vregs, nullptr);
100 if (block->IsCatchBlock()) {
101 // We record incoming inputs of catch phis at throwing instructions and
102 // must therefore eagerly create the phis. Phis for undefined vregs will
103 // be deleted when the first throwing instruction with the vreg undefined
104 // is encountered. Unused phis will be removed by dead phi analysis.
105 for (size_t i = 0; i < vregs; ++i) {
106 // No point in creating the catch phi if it is already undefined at
107 // the first throwing instruction.
108 HInstruction* current_local_value = (*current_locals_)[i];
109 if (current_local_value != nullptr) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100110 HPhi* phi = new (allocator_) HPhi(
111 allocator_,
Mingyao Yang01b47b02017-02-03 12:09:57 -0800112 i,
113 0,
114 current_local_value->GetType());
115 block->AddPhi(phi);
116 (*locals)[i] = phi;
David Brazdildee58d62016-04-07 09:54:26 +0000117 }
118 }
119 }
120 return locals;
121}
122
Mingyao Yang01b47b02017-02-03 12:09:57 -0800123inline HInstruction* HInstructionBuilder::ValueOfLocalAt(HBasicBlock* block, size_t local) {
Vladimir Marko69d310e2017-10-09 14:12:23 +0100124 ScopedArenaVector<HInstruction*>* locals = GetLocalsFor(block);
David Brazdildee58d62016-04-07 09:54:26 +0000125 return (*locals)[local];
126}
127
128void HInstructionBuilder::InitializeBlockLocals() {
129 current_locals_ = GetLocalsFor(current_block_);
130
131 if (current_block_->IsCatchBlock()) {
132 // Catch phis were already created and inputs collected from throwing sites.
133 if (kIsDebugBuild) {
134 // Make sure there was at least one throwing instruction which initialized
135 // locals (guaranteed by HGraphBuilder) and that all try blocks have been
136 // visited already (from HTryBoundary scoping and reverse post order).
137 bool catch_block_visited = false;
Vladimir Marko2c45bc92016-10-25 16:54:12 +0100138 for (HBasicBlock* current : graph_->GetReversePostOrder()) {
David Brazdildee58d62016-04-07 09:54:26 +0000139 if (current == current_block_) {
140 catch_block_visited = true;
141 } else if (current->IsTryBlock()) {
142 const HTryBoundary& try_entry = current->GetTryCatchInformation()->GetTryEntry();
143 if (try_entry.HasExceptionHandler(*current_block_)) {
144 DCHECK(!catch_block_visited) << "Catch block visited before its try block.";
145 }
146 }
147 }
148 DCHECK_EQ(current_locals_->size(), graph_->GetNumberOfVRegs())
149 << "No instructions throwing into a live catch block.";
150 }
151 } else if (current_block_->IsLoopHeader()) {
152 // If the block is a loop header, we know we only have visited the pre header
153 // because we are visiting in reverse post order. We create phis for all initialized
154 // locals from the pre header. Their inputs will be populated at the end of
155 // the analysis.
156 for (size_t local = 0; local < current_locals_->size(); ++local) {
157 HInstruction* incoming =
158 ValueOfLocalAt(current_block_->GetLoopInformation()->GetPreHeader(), local);
159 if (incoming != nullptr) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100160 HPhi* phi = new (allocator_) HPhi(
161 allocator_,
David Brazdildee58d62016-04-07 09:54:26 +0000162 local,
163 0,
164 incoming->GetType());
165 current_block_->AddPhi(phi);
166 (*current_locals_)[local] = phi;
167 }
168 }
169
170 // Save the loop header so that the last phase of the analysis knows which
171 // blocks need to be updated.
172 loop_headers_.push_back(current_block_);
173 } else if (current_block_->GetPredecessors().size() > 0) {
174 // All predecessors have already been visited because we are visiting in reverse post order.
175 // We merge the values of all locals, creating phis if those values differ.
176 for (size_t local = 0; local < current_locals_->size(); ++local) {
177 bool one_predecessor_has_no_value = false;
178 bool is_different = false;
179 HInstruction* value = ValueOfLocalAt(current_block_->GetPredecessors()[0], local);
180
181 for (HBasicBlock* predecessor : current_block_->GetPredecessors()) {
182 HInstruction* current = ValueOfLocalAt(predecessor, local);
183 if (current == nullptr) {
184 one_predecessor_has_no_value = true;
185 break;
186 } else if (current != value) {
187 is_different = true;
188 }
189 }
190
191 if (one_predecessor_has_no_value) {
192 // If one predecessor has no value for this local, we trust the verifier has
193 // successfully checked that there is a store dominating any read after this block.
194 continue;
195 }
196
197 if (is_different) {
198 HInstruction* first_input = ValueOfLocalAt(current_block_->GetPredecessors()[0], local);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100199 HPhi* phi = new (allocator_) HPhi(
200 allocator_,
David Brazdildee58d62016-04-07 09:54:26 +0000201 local,
202 current_block_->GetPredecessors().size(),
203 first_input->GetType());
204 for (size_t i = 0; i < current_block_->GetPredecessors().size(); i++) {
205 HInstruction* pred_value = ValueOfLocalAt(current_block_->GetPredecessors()[i], local);
206 phi->SetRawInputAt(i, pred_value);
207 }
208 current_block_->AddPhi(phi);
209 value = phi;
210 }
211 (*current_locals_)[local] = value;
212 }
213 }
214}
215
216void HInstructionBuilder::PropagateLocalsToCatchBlocks() {
217 const HTryBoundary& try_entry = current_block_->GetTryCatchInformation()->GetTryEntry();
218 for (HBasicBlock* catch_block : try_entry.GetExceptionHandlers()) {
Vladimir Marko69d310e2017-10-09 14:12:23 +0100219 ScopedArenaVector<HInstruction*>* handler_locals = GetLocalsFor(catch_block);
David Brazdildee58d62016-04-07 09:54:26 +0000220 DCHECK_EQ(handler_locals->size(), current_locals_->size());
221 for (size_t vreg = 0, e = current_locals_->size(); vreg < e; ++vreg) {
222 HInstruction* handler_value = (*handler_locals)[vreg];
223 if (handler_value == nullptr) {
224 // Vreg was undefined at a previously encountered throwing instruction
225 // and the catch phi was deleted. Do not record the local value.
226 continue;
227 }
228 DCHECK(handler_value->IsPhi());
229
230 HInstruction* local_value = (*current_locals_)[vreg];
231 if (local_value == nullptr) {
232 // This is the first instruction throwing into `catch_block` where
233 // `vreg` is undefined. Delete the catch phi.
234 catch_block->RemovePhi(handler_value->AsPhi());
235 (*handler_locals)[vreg] = nullptr;
236 } else {
237 // Vreg has been defined at all instructions throwing into `catch_block`
238 // encountered so far. Record the local value in the catch phi.
239 handler_value->AsPhi()->AddInput(local_value);
240 }
241 }
242 }
243}
244
245void HInstructionBuilder::AppendInstruction(HInstruction* instruction) {
246 current_block_->AddInstruction(instruction);
247 InitializeInstruction(instruction);
248}
249
250void HInstructionBuilder::InsertInstructionAtTop(HInstruction* instruction) {
251 if (current_block_->GetInstructions().IsEmpty()) {
252 current_block_->AddInstruction(instruction);
253 } else {
254 current_block_->InsertInstructionBefore(instruction, current_block_->GetFirstInstruction());
255 }
256 InitializeInstruction(instruction);
257}
258
259void HInstructionBuilder::InitializeInstruction(HInstruction* instruction) {
260 if (instruction->NeedsEnvironment()) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100261 HEnvironment* environment = new (allocator_) HEnvironment(
262 allocator_,
David Brazdildee58d62016-04-07 09:54:26 +0000263 current_locals_->size(),
Nicolas Geoffray5d37c152017-01-12 13:25:19 +0000264 graph_->GetArtMethod(),
David Brazdildee58d62016-04-07 09:54:26 +0000265 instruction->GetDexPc(),
David Brazdildee58d62016-04-07 09:54:26 +0000266 instruction);
Vladimir Marko69d310e2017-10-09 14:12:23 +0100267 environment->CopyFrom(ArrayRef<HInstruction* const>(*current_locals_));
David Brazdildee58d62016-04-07 09:54:26 +0000268 instruction->SetRawEnvironment(environment);
269 }
270}
271
David Brazdilc120bbe2016-04-22 16:57:00 +0100272HInstruction* HInstructionBuilder::LoadNullCheckedLocal(uint32_t register_index, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100273 HInstruction* ref = LoadLocal(register_index, DataType::Type::kReference);
David Brazdilc120bbe2016-04-22 16:57:00 +0100274 if (!ref->CanBeNull()) {
275 return ref;
276 }
277
Vladimir Markoca6fff82017-10-03 14:49:14 +0100278 HNullCheck* null_check = new (allocator_) HNullCheck(ref, dex_pc);
David Brazdilc120bbe2016-04-22 16:57:00 +0100279 AppendInstruction(null_check);
280 return null_check;
281}
282
David Brazdildee58d62016-04-07 09:54:26 +0000283void HInstructionBuilder::SetLoopHeaderPhiInputs() {
284 for (size_t i = loop_headers_.size(); i > 0; --i) {
285 HBasicBlock* block = loop_headers_[i - 1];
286 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) {
287 HPhi* phi = it.Current()->AsPhi();
288 size_t vreg = phi->GetRegNumber();
289 for (HBasicBlock* predecessor : block->GetPredecessors()) {
290 HInstruction* value = ValueOfLocalAt(predecessor, vreg);
291 if (value == nullptr) {
292 // Vreg is undefined at this predecessor. Mark it dead and leave with
293 // fewer inputs than predecessors. SsaChecker will fail if not removed.
294 phi->SetDead();
295 break;
296 } else {
297 phi->AddInput(value);
298 }
299 }
300 }
301 }
302}
303
304static bool IsBlockPopulated(HBasicBlock* block) {
305 if (block->IsLoopHeader()) {
306 // Suspend checks were inserted into loop headers during building of dominator tree.
307 DCHECK(block->GetFirstInstruction()->IsSuspendCheck());
308 return block->GetFirstInstruction() != block->GetLastInstruction();
309 } else {
310 return !block->GetInstructions().IsEmpty();
311 }
312}
313
314bool HInstructionBuilder::Build() {
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800315 DCHECK(code_item_accessor_.HasCodeItem());
Vladimir Marko69d310e2017-10-09 14:12:23 +0100316 locals_for_.resize(
317 graph_->GetBlocks().size(),
318 ScopedArenaVector<HInstruction*>(local_allocator_->Adapter(kArenaAllocGraphBuilder)));
David Brazdildee58d62016-04-07 09:54:26 +0000319
320 // Find locations where we want to generate extra stackmaps for native debugging.
321 // This allows us to generate the info only at interesting points (for example,
322 // at start of java statement) rather than before every dex instruction.
Vladimir Marko3b506202018-10-31 14:33:58 +0000323 const bool native_debuggable = code_generator_ != nullptr &&
324 code_generator_->GetCompilerOptions().GetNativeDebuggable();
David Brazdildee58d62016-04-07 09:54:26 +0000325 ArenaBitVector* native_debug_info_locations = nullptr;
326 if (native_debuggable) {
Vladimir Marko69d310e2017-10-09 14:12:23 +0100327 native_debug_info_locations = FindNativeDebugInfoLocations();
David Brazdildee58d62016-04-07 09:54:26 +0000328 }
329
Vladimir Marko2c45bc92016-10-25 16:54:12 +0100330 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
331 current_block_ = block;
David Brazdildee58d62016-04-07 09:54:26 +0000332 uint32_t block_dex_pc = current_block_->GetDexPc();
333
334 InitializeBlockLocals();
335
336 if (current_block_->IsEntryBlock()) {
337 InitializeParameters();
Vladimir Markoca6fff82017-10-03 14:49:14 +0100338 AppendInstruction(new (allocator_) HSuspendCheck(0u));
339 AppendInstruction(new (allocator_) HGoto(0u));
David Brazdildee58d62016-04-07 09:54:26 +0000340 continue;
341 } else if (current_block_->IsExitBlock()) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100342 AppendInstruction(new (allocator_) HExit());
David Brazdildee58d62016-04-07 09:54:26 +0000343 continue;
344 } else if (current_block_->IsLoopHeader()) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100345 HSuspendCheck* suspend_check = new (allocator_) HSuspendCheck(current_block_->GetDexPc());
David Brazdildee58d62016-04-07 09:54:26 +0000346 current_block_->GetLoopInformation()->SetSuspendCheck(suspend_check);
347 // This is slightly odd because the loop header might not be empty (TryBoundary).
348 // But we're still creating the environment with locals from the top of the block.
349 InsertInstructionAtTop(suspend_check);
350 }
351
352 if (block_dex_pc == kNoDexPc || current_block_ != block_builder_->GetBlockAt(block_dex_pc)) {
353 // Synthetic block that does not need to be populated.
354 DCHECK(IsBlockPopulated(current_block_));
355 continue;
356 }
357
358 DCHECK(!IsBlockPopulated(current_block_));
359
Mathieu Chartierde4b08f2017-07-10 14:13:41 -0700360 uint32_t quicken_index = 0;
361 if (CanDecodeQuickenedInfo()) {
362 quicken_index = block_builder_->GetQuickenIndex(block_dex_pc);
363 }
364
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800365 for (const DexInstructionPcPair& pair : code_item_accessor_.InstructionsFrom(block_dex_pc)) {
David Brazdildee58d62016-04-07 09:54:26 +0000366 if (current_block_ == nullptr) {
367 // The previous instruction ended this block.
368 break;
369 }
370
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800371 const uint32_t dex_pc = pair.DexPc();
David Brazdildee58d62016-04-07 09:54:26 +0000372 if (dex_pc != block_dex_pc && FindBlockStartingAt(dex_pc) != nullptr) {
373 // This dex_pc starts a new basic block.
374 break;
375 }
376
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800377 if (current_block_->IsTryBlock() && IsThrowingDexInstruction(pair.Inst())) {
David Brazdildee58d62016-04-07 09:54:26 +0000378 PropagateLocalsToCatchBlocks();
379 }
380
381 if (native_debuggable && native_debug_info_locations->IsBitSet(dex_pc)) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100382 AppendInstruction(new (allocator_) HNativeDebugInfo(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000383 }
384
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800385 if (!ProcessDexInstruction(pair.Inst(), dex_pc, quicken_index)) {
David Brazdildee58d62016-04-07 09:54:26 +0000386 return false;
387 }
Mathieu Chartierde4b08f2017-07-10 14:13:41 -0700388
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800389 if (QuickenInfoTable::NeedsIndexForInstruction(&pair.Inst())) {
Mathieu Chartierde4b08f2017-07-10 14:13:41 -0700390 ++quicken_index;
391 }
David Brazdildee58d62016-04-07 09:54:26 +0000392 }
393
394 if (current_block_ != nullptr) {
395 // Branching instructions clear current_block, so we know the last
396 // instruction of the current block is not a branching instruction.
397 // We add an unconditional Goto to the next block.
398 DCHECK_EQ(current_block_->GetSuccessors().size(), 1u);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100399 AppendInstruction(new (allocator_) HGoto());
David Brazdildee58d62016-04-07 09:54:26 +0000400 }
401 }
402
403 SetLoopHeaderPhiInputs();
404
405 return true;
406}
407
Vladimir Marko92f7f3c2017-10-31 11:38:30 +0000408void HInstructionBuilder::BuildIntrinsic(ArtMethod* method) {
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800409 DCHECK(!code_item_accessor_.HasCodeItem());
Vladimir Marko92f7f3c2017-10-31 11:38:30 +0000410 DCHECK(method->IsIntrinsic());
411
412 locals_for_.resize(
413 graph_->GetBlocks().size(),
414 ScopedArenaVector<HInstruction*>(local_allocator_->Adapter(kArenaAllocGraphBuilder)));
415
416 // Fill the entry block. Do not add suspend check, we do not want a suspend
417 // check in intrinsics; intrinsic methods are supposed to be fast.
418 current_block_ = graph_->GetEntryBlock();
419 InitializeBlockLocals();
420 InitializeParameters();
421 AppendInstruction(new (allocator_) HGoto(0u));
422
423 // Fill the body.
424 current_block_ = current_block_->GetSingleSuccessor();
425 InitializeBlockLocals();
426 DCHECK(!IsBlockPopulated(current_block_));
427
428 // Add the invoke and return instruction. Use HInvokeStaticOrDirect even
429 // for methods that would normally use an HInvokeVirtual (sharpen the call).
430 size_t in_vregs = graph_->GetNumberOfInVRegs();
431 size_t number_of_arguments =
432 in_vregs - std::count(current_locals_->end() - in_vregs, current_locals_->end(), nullptr);
433 uint32_t method_idx = dex_compilation_unit_->GetDexMethodIndex();
434 MethodReference target_method(dex_file_, method_idx);
435 HInvokeStaticOrDirect::DispatchInfo dispatch_info = {
436 HInvokeStaticOrDirect::MethodLoadKind::kRuntimeCall,
437 HInvokeStaticOrDirect::CodePtrLocation::kCallArtMethod,
Andreas Gampe3db70682018-12-26 15:12:03 -0800438 /* method_load_data= */ 0u
Vladimir Marko92f7f3c2017-10-31 11:38:30 +0000439 };
440 InvokeType invoke_type = dex_compilation_unit_->IsStatic() ? kStatic : kDirect;
441 HInvokeStaticOrDirect* invoke = new (allocator_) HInvokeStaticOrDirect(
442 allocator_,
443 number_of_arguments,
444 return_type_,
445 kNoDexPc,
446 method_idx,
447 method,
448 dispatch_info,
449 invoke_type,
450 target_method,
451 HInvokeStaticOrDirect::ClinitCheckRequirement::kNone);
Treehugger Robot2c5827a2018-05-17 22:26:08 +0000452 RangeInstructionOperands operands(graph_->GetNumberOfVRegs() - in_vregs, in_vregs);
Andreas Gampe3db70682018-12-26 15:12:03 -0800453 HandleInvoke(invoke, operands, dex_file_->GetMethodShorty(method_idx), /* is_unresolved= */ false);
Vladimir Marko92f7f3c2017-10-31 11:38:30 +0000454
455 // Add the return instruction.
456 if (return_type_ == DataType::Type::kVoid) {
457 AppendInstruction(new (allocator_) HReturnVoid());
458 } else {
459 AppendInstruction(new (allocator_) HReturn(invoke));
460 }
461
462 // Fill the exit block.
463 DCHECK_EQ(current_block_->GetSingleSuccessor(), graph_->GetExitBlock());
464 current_block_ = graph_->GetExitBlock();
465 InitializeBlockLocals();
466 AppendInstruction(new (allocator_) HExit());
467}
468
Vladimir Marko69d310e2017-10-09 14:12:23 +0100469ArenaBitVector* HInstructionBuilder::FindNativeDebugInfoLocations() {
Vladimir Marko69d310e2017-10-09 14:12:23 +0100470 ArenaBitVector* locations = ArenaBitVector::Create(local_allocator_,
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800471 code_item_accessor_.InsnsSizeInCodeUnits(),
Andreas Gampe3db70682018-12-26 15:12:03 -0800472 /* expandable= */ false,
Vladimir Marko69d310e2017-10-09 14:12:23 +0100473 kArenaAllocGraphBuilder);
474 locations->ClearAllBits();
Mathieu Chartier3e2e1232018-09-11 12:35:30 -0700475 // The visitor gets called when the line number changes.
476 // In other words, it marks the start of new java statement.
477 code_item_accessor_.DecodeDebugPositionInfo([&](const DexFile::PositionInfo& entry) {
478 locations->SetBit(entry.address_);
479 return false;
480 });
David Brazdildee58d62016-04-07 09:54:26 +0000481 // Instruction-specific tweaks.
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800482 for (const DexInstructionPcPair& inst : code_item_accessor_) {
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800483 switch (inst->Opcode()) {
David Brazdildee58d62016-04-07 09:54:26 +0000484 case Instruction::MOVE_EXCEPTION: {
485 // Stop in native debugger after the exception has been moved.
486 // The compiler also expects the move at the start of basic block so
487 // we do not want to interfere by inserting native-debug-info before it.
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800488 locations->ClearBit(inst.DexPc());
489 DexInstructionIterator next = std::next(DexInstructionIterator(inst));
490 DCHECK(next.DexPc() != inst.DexPc());
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800491 if (next != code_item_accessor_.end()) {
Mathieu Chartier2b2bef22017-10-26 17:10:19 -0700492 locations->SetBit(next.DexPc());
David Brazdildee58d62016-04-07 09:54:26 +0000493 }
494 break;
495 }
496 default:
497 break;
498 }
499 }
Vladimir Marko69d310e2017-10-09 14:12:23 +0100500 return locations;
David Brazdildee58d62016-04-07 09:54:26 +0000501}
502
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100503HInstruction* HInstructionBuilder::LoadLocal(uint32_t reg_number, DataType::Type type) const {
David Brazdildee58d62016-04-07 09:54:26 +0000504 HInstruction* value = (*current_locals_)[reg_number];
505 DCHECK(value != nullptr);
506
507 // If the operation requests a specific type, we make sure its input is of that type.
508 if (type != value->GetType()) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100509 if (DataType::IsFloatingPointType(type)) {
Aart Bik31883642016-06-06 15:02:44 -0700510 value = ssa_builder_->GetFloatOrDoubleEquivalent(value, type);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100511 } else if (type == DataType::Type::kReference) {
Aart Bik31883642016-06-06 15:02:44 -0700512 value = ssa_builder_->GetReferenceTypeEquivalent(value);
David Brazdildee58d62016-04-07 09:54:26 +0000513 }
Aart Bik31883642016-06-06 15:02:44 -0700514 DCHECK(value != nullptr);
David Brazdildee58d62016-04-07 09:54:26 +0000515 }
516
517 return value;
518}
519
520void HInstructionBuilder::UpdateLocal(uint32_t reg_number, HInstruction* stored_value) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100521 DataType::Type stored_type = stored_value->GetType();
522 DCHECK_NE(stored_type, DataType::Type::kVoid);
David Brazdildee58d62016-04-07 09:54:26 +0000523
524 // Storing into vreg `reg_number` may implicitly invalidate the surrounding
525 // registers. Consider the following cases:
526 // (1) Storing a wide value must overwrite previous values in both `reg_number`
527 // and `reg_number+1`. We store `nullptr` in `reg_number+1`.
528 // (2) If vreg `reg_number-1` holds a wide value, writing into `reg_number`
529 // must invalidate it. We store `nullptr` in `reg_number-1`.
530 // Consequently, storing a wide value into the high vreg of another wide value
531 // will invalidate both `reg_number-1` and `reg_number+1`.
532
533 if (reg_number != 0) {
534 HInstruction* local_low = (*current_locals_)[reg_number - 1];
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100535 if (local_low != nullptr && DataType::Is64BitType(local_low->GetType())) {
David Brazdildee58d62016-04-07 09:54:26 +0000536 // The vreg we are storing into was previously the high vreg of a pair.
537 // We need to invalidate its low vreg.
538 DCHECK((*current_locals_)[reg_number] == nullptr);
539 (*current_locals_)[reg_number - 1] = nullptr;
540 }
541 }
542
543 (*current_locals_)[reg_number] = stored_value;
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100544 if (DataType::Is64BitType(stored_type)) {
David Brazdildee58d62016-04-07 09:54:26 +0000545 // We are storing a pair. Invalidate the instruction in the high vreg.
546 (*current_locals_)[reg_number + 1] = nullptr;
547 }
548}
549
550void HInstructionBuilder::InitializeParameters() {
551 DCHECK(current_block_->IsEntryBlock());
552
Vladimir Marko69d310e2017-10-09 14:12:23 +0100553 // outer_compilation_unit_ is null only when unit testing.
554 if (outer_compilation_unit_ == nullptr) {
David Brazdildee58d62016-04-07 09:54:26 +0000555 return;
556 }
557
558 const char* shorty = dex_compilation_unit_->GetShorty();
559 uint16_t number_of_parameters = graph_->GetNumberOfInVRegs();
560 uint16_t locals_index = graph_->GetNumberOfLocalVRegs();
561 uint16_t parameter_index = 0;
562
Andreas Gampe3f1dcd32018-12-28 09:39:56 -0800563 const dex::MethodId& referrer_method_id =
David Brazdildee58d62016-04-07 09:54:26 +0000564 dex_file_->GetMethodId(dex_compilation_unit_->GetDexMethodIndex());
565 if (!dex_compilation_unit_->IsStatic()) {
566 // Add the implicit 'this' argument, not expressed in the signature.
Vladimir Markoca6fff82017-10-03 14:49:14 +0100567 HParameterValue* parameter = new (allocator_) HParameterValue(*dex_file_,
David Brazdildee58d62016-04-07 09:54:26 +0000568 referrer_method_id.class_idx_,
569 parameter_index++,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100570 DataType::Type::kReference,
Andreas Gampe3db70682018-12-26 15:12:03 -0800571 /* is_this= */ true);
David Brazdildee58d62016-04-07 09:54:26 +0000572 AppendInstruction(parameter);
573 UpdateLocal(locals_index++, parameter);
574 number_of_parameters--;
Igor Murashkind01745e2017-04-05 16:40:31 -0700575 current_this_parameter_ = parameter;
576 } else {
577 DCHECK(current_this_parameter_ == nullptr);
David Brazdildee58d62016-04-07 09:54:26 +0000578 }
579
Andreas Gampe3f1dcd32018-12-28 09:39:56 -0800580 const dex::ProtoId& proto = dex_file_->GetMethodPrototype(referrer_method_id);
581 const dex::TypeList* arg_types = dex_file_->GetProtoParameters(proto);
David Brazdildee58d62016-04-07 09:54:26 +0000582 for (int i = 0, shorty_pos = 1; i < number_of_parameters; i++) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100583 HParameterValue* parameter = new (allocator_) HParameterValue(
David Brazdildee58d62016-04-07 09:54:26 +0000584 *dex_file_,
585 arg_types->GetTypeItem(shorty_pos - 1).type_idx_,
586 parameter_index++,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100587 DataType::FromShorty(shorty[shorty_pos]),
Andreas Gampe3db70682018-12-26 15:12:03 -0800588 /* is_this= */ false);
David Brazdildee58d62016-04-07 09:54:26 +0000589 ++shorty_pos;
590 AppendInstruction(parameter);
591 // Store the parameter value in the local that the dex code will use
592 // to reference that parameter.
593 UpdateLocal(locals_index++, parameter);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100594 if (DataType::Is64BitType(parameter->GetType())) {
David Brazdildee58d62016-04-07 09:54:26 +0000595 i++;
596 locals_index++;
597 parameter_index++;
598 }
599 }
600}
601
602template<typename T>
603void HInstructionBuilder::If_22t(const Instruction& instruction, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100604 HInstruction* first = LoadLocal(instruction.VRegA(), DataType::Type::kInt32);
605 HInstruction* second = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100606 T* comparison = new (allocator_) T(first, second, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +0000607 AppendInstruction(comparison);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100608 AppendInstruction(new (allocator_) HIf(comparison, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000609 current_block_ = nullptr;
610}
611
612template<typename T>
613void HInstructionBuilder::If_21t(const Instruction& instruction, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100614 HInstruction* value = LoadLocal(instruction.VRegA(), DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100615 T* comparison = new (allocator_) T(value, graph_->GetIntConstant(0, dex_pc), dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +0000616 AppendInstruction(comparison);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100617 AppendInstruction(new (allocator_) HIf(comparison, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000618 current_block_ = nullptr;
619}
620
621template<typename T>
622void HInstructionBuilder::Unop_12x(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100623 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000624 uint32_t dex_pc) {
625 HInstruction* first = LoadLocal(instruction.VRegB(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100626 AppendInstruction(new (allocator_) T(type, first, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000627 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
628}
629
630void HInstructionBuilder::Conversion_12x(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100631 DataType::Type input_type,
632 DataType::Type result_type,
David Brazdildee58d62016-04-07 09:54:26 +0000633 uint32_t dex_pc) {
634 HInstruction* first = LoadLocal(instruction.VRegB(), input_type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100635 AppendInstruction(new (allocator_) HTypeConversion(result_type, first, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000636 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
637}
638
639template<typename T>
640void HInstructionBuilder::Binop_23x(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100641 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000642 uint32_t dex_pc) {
643 HInstruction* first = LoadLocal(instruction.VRegB(), type);
644 HInstruction* second = LoadLocal(instruction.VRegC(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100645 AppendInstruction(new (allocator_) T(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000646 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
647}
648
649template<typename T>
650void HInstructionBuilder::Binop_23x_shift(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100651 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000652 uint32_t dex_pc) {
653 HInstruction* first = LoadLocal(instruction.VRegB(), type);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100654 HInstruction* second = LoadLocal(instruction.VRegC(), DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100655 AppendInstruction(new (allocator_) T(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000656 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
657}
658
659void HInstructionBuilder::Binop_23x_cmp(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100660 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000661 ComparisonBias bias,
662 uint32_t dex_pc) {
663 HInstruction* first = LoadLocal(instruction.VRegB(), type);
664 HInstruction* second = LoadLocal(instruction.VRegC(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100665 AppendInstruction(new (allocator_) HCompare(type, first, second, bias, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000666 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
667}
668
669template<typename T>
670void HInstructionBuilder::Binop_12x_shift(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100671 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000672 uint32_t dex_pc) {
673 HInstruction* first = LoadLocal(instruction.VRegA(), type);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100674 HInstruction* second = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100675 AppendInstruction(new (allocator_) T(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000676 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
677}
678
679template<typename T>
680void HInstructionBuilder::Binop_12x(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100681 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000682 uint32_t dex_pc) {
683 HInstruction* first = LoadLocal(instruction.VRegA(), type);
684 HInstruction* second = LoadLocal(instruction.VRegB(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100685 AppendInstruction(new (allocator_) T(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000686 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
687}
688
689template<typename T>
690void HInstructionBuilder::Binop_22s(const Instruction& instruction, bool reverse, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100691 HInstruction* first = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
David Brazdildee58d62016-04-07 09:54:26 +0000692 HInstruction* second = graph_->GetIntConstant(instruction.VRegC_22s(), dex_pc);
693 if (reverse) {
694 std::swap(first, second);
695 }
Vladimir Markoca6fff82017-10-03 14:49:14 +0100696 AppendInstruction(new (allocator_) T(DataType::Type::kInt32, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000697 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
698}
699
700template<typename T>
701void HInstructionBuilder::Binop_22b(const Instruction& instruction, bool reverse, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100702 HInstruction* first = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
David Brazdildee58d62016-04-07 09:54:26 +0000703 HInstruction* second = graph_->GetIntConstant(instruction.VRegC_22b(), dex_pc);
704 if (reverse) {
705 std::swap(first, second);
706 }
Vladimir Markoca6fff82017-10-03 14:49:14 +0100707 AppendInstruction(new (allocator_) T(DataType::Type::kInt32, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000708 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
709}
710
Igor Murashkind01745e2017-04-05 16:40:31 -0700711// Does the method being compiled need any constructor barriers being inserted?
712// (Always 'false' for methods that aren't <init>.)
Vladimir Markoc1c34522018-10-31 13:56:49 +0000713static bool RequiresConstructorBarrier(const DexCompilationUnit* cu) {
Igor Murashkin032cacd2017-04-06 14:40:08 -0700714 // Can be null in unit tests only.
715 if (UNLIKELY(cu == nullptr)) {
716 return false;
717 }
718
Vladimir Markoc1c34522018-10-31 13:56:49 +0000719 // Constructor barriers are applicable only for <init> methods.
720 if (LIKELY(!cu->IsConstructor() || cu->IsStatic())) {
721 return false;
722 }
723
724 return cu->RequiresConstructorBarrier();
David Brazdildee58d62016-04-07 09:54:26 +0000725}
726
727// Returns true if `block` has only one successor which starts at the next
728// dex_pc after `instruction` at `dex_pc`.
729static bool IsFallthroughInstruction(const Instruction& instruction,
730 uint32_t dex_pc,
731 HBasicBlock* block) {
732 uint32_t next_dex_pc = dex_pc + instruction.SizeInCodeUnits();
733 return block->GetSingleSuccessor()->GetDexPc() == next_dex_pc;
734}
735
736void HInstructionBuilder::BuildSwitch(const Instruction& instruction, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100737 HInstruction* value = LoadLocal(instruction.VRegA(), DataType::Type::kInt32);
David Brazdildee58d62016-04-07 09:54:26 +0000738 DexSwitchTable table(instruction, dex_pc);
739
740 if (table.GetNumEntries() == 0) {
741 // Empty Switch. Code falls through to the next block.
742 DCHECK(IsFallthroughInstruction(instruction, dex_pc, current_block_));
Vladimir Markoca6fff82017-10-03 14:49:14 +0100743 AppendInstruction(new (allocator_) HGoto(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000744 } else if (table.ShouldBuildDecisionTree()) {
745 for (DexSwitchTableIterator it(table); !it.Done(); it.Advance()) {
746 HInstruction* case_value = graph_->GetIntConstant(it.CurrentKey(), dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100747 HEqual* comparison = new (allocator_) HEqual(value, case_value, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +0000748 AppendInstruction(comparison);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100749 AppendInstruction(new (allocator_) HIf(comparison, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000750
751 if (!it.IsLast()) {
752 current_block_ = FindBlockStartingAt(it.GetDexPcForCurrentIndex());
753 }
754 }
755 } else {
756 AppendInstruction(
Vladimir Markoca6fff82017-10-03 14:49:14 +0100757 new (allocator_) HPackedSwitch(table.GetEntryAt(0), table.GetNumEntries(), value, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000758 }
759
760 current_block_ = nullptr;
761}
762
763void HInstructionBuilder::BuildReturn(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100764 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000765 uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100766 if (type == DataType::Type::kVoid) {
Igor Murashkind01745e2017-04-05 16:40:31 -0700767 // Only <init> (which is a return-void) could possibly have a constructor fence.
Igor Murashkin032cacd2017-04-06 14:40:08 -0700768 // This may insert additional redundant constructor fences from the super constructors.
769 // TODO: remove redundant constructor fences (b/36656456).
Vladimir Markoc1c34522018-10-31 13:56:49 +0000770 if (RequiresConstructorBarrier(dex_compilation_unit_)) {
Igor Murashkind01745e2017-04-05 16:40:31 -0700771 // Compiling instance constructor.
Vladimir Markoba118822017-06-12 15:41:56 +0100772 DCHECK_STREQ("<init>", graph_->GetMethodName());
Igor Murashkind01745e2017-04-05 16:40:31 -0700773
774 HInstruction* fence_target = current_this_parameter_;
775 DCHECK(fence_target != nullptr);
776
Vladimir Markoca6fff82017-10-03 14:49:14 +0100777 AppendInstruction(new (allocator_) HConstructorFence(fence_target, dex_pc, allocator_));
Igor Murashkin6ef45672017-08-08 13:59:55 -0700778 MaybeRecordStat(
779 compilation_stats_,
780 MethodCompilationStat::kConstructorFenceGeneratedFinal);
David Brazdildee58d62016-04-07 09:54:26 +0000781 }
Vladimir Markoca6fff82017-10-03 14:49:14 +0100782 AppendInstruction(new (allocator_) HReturnVoid(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000783 } else {
Vladimir Markoc1c34522018-10-31 13:56:49 +0000784 DCHECK(!RequiresConstructorBarrier(dex_compilation_unit_));
David Brazdildee58d62016-04-07 09:54:26 +0000785 HInstruction* value = LoadLocal(instruction.VRegA(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100786 AppendInstruction(new (allocator_) HReturn(value, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000787 }
788 current_block_ = nullptr;
789}
790
791static InvokeType GetInvokeTypeFromOpCode(Instruction::Code opcode) {
792 switch (opcode) {
793 case Instruction::INVOKE_STATIC:
794 case Instruction::INVOKE_STATIC_RANGE:
795 return kStatic;
796 case Instruction::INVOKE_DIRECT:
797 case Instruction::INVOKE_DIRECT_RANGE:
798 return kDirect;
799 case Instruction::INVOKE_VIRTUAL:
800 case Instruction::INVOKE_VIRTUAL_QUICK:
801 case Instruction::INVOKE_VIRTUAL_RANGE:
802 case Instruction::INVOKE_VIRTUAL_RANGE_QUICK:
803 return kVirtual;
804 case Instruction::INVOKE_INTERFACE:
805 case Instruction::INVOKE_INTERFACE_RANGE:
806 return kInterface;
807 case Instruction::INVOKE_SUPER_RANGE:
808 case Instruction::INVOKE_SUPER:
809 return kSuper;
810 default:
811 LOG(FATAL) << "Unexpected invoke opcode: " << opcode;
812 UNREACHABLE();
813 }
814}
815
816ArtMethod* HInstructionBuilder::ResolveMethod(uint16_t method_idx, InvokeType invoke_type) {
817 ScopedObjectAccess soa(Thread::Current());
David Brazdildee58d62016-04-07 09:54:26 +0000818
819 ClassLinker* class_linker = dex_compilation_unit_->GetClassLinker();
Vladimir Marko8d6768d2017-03-14 10:13:21 +0000820 Handle<mirror::ClassLoader> class_loader = dex_compilation_unit_->GetClassLoader();
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100821
Vladimir Markoba118822017-06-12 15:41:56 +0100822 ArtMethod* resolved_method =
823 class_linker->ResolveMethod<ClassLinker::ResolveMode::kCheckICCEAndIAE>(
Vladimir Markoba118822017-06-12 15:41:56 +0100824 method_idx,
825 dex_compilation_unit_->GetDexCache(),
826 class_loader,
827 graph_->GetArtMethod(),
828 invoke_type);
David Brazdildee58d62016-04-07 09:54:26 +0000829
830 if (UNLIKELY(resolved_method == nullptr)) {
831 // Clean up any exception left by type resolution.
832 soa.Self()->ClearException();
833 return nullptr;
834 }
835
Vladimir Markoba118822017-06-12 15:41:56 +0100836 // The referrer may be unresolved for AOT if we're compiling a class that cannot be
837 // resolved because, for example, we don't find a superclass in the classpath.
838 if (graph_->GetArtMethod() == nullptr) {
839 // The class linker cannot check access without a referrer, so we have to do it.
840 // Fall back to HInvokeUnresolved if the method isn't public.
David Brazdildee58d62016-04-07 09:54:26 +0000841 if (!resolved_method->IsPublic()) {
842 return nullptr;
843 }
David Brazdildee58d62016-04-07 09:54:26 +0000844 }
845
846 // We have to special case the invoke-super case, as ClassLinker::ResolveMethod does not.
847 // We need to look at the referrer's super class vtable. We need to do this to know if we need to
848 // make this an invoke-unresolved to handle cross-dex invokes or abstract super methods, both of
849 // which require runtime handling.
850 if (invoke_type == kSuper) {
Vladimir Markoa2c211c2018-11-01 09:50:52 +0000851 ObjPtr<mirror::Class> compiling_class = dex_compilation_unit_->GetCompilingClass().Get();
Andreas Gampefa4333d2017-02-14 11:10:34 -0800852 if (compiling_class == nullptr) {
David Brazdildee58d62016-04-07 09:54:26 +0000853 // We could not determine the method's class we need to wait until runtime.
854 DCHECK(Runtime::Current()->IsAotCompiler());
855 return nullptr;
856 }
Vladimir Markoba118822017-06-12 15:41:56 +0100857 ObjPtr<mirror::Class> referenced_class = class_linker->LookupResolvedType(
Vladimir Markoba118822017-06-12 15:41:56 +0100858 dex_compilation_unit_->GetDexFile()->GetMethodId(method_idx).class_idx_,
859 dex_compilation_unit_->GetDexCache().Get(),
860 class_loader.Get());
861 DCHECK(referenced_class != nullptr); // We have already resolved a method from this class.
862 if (!referenced_class->IsAssignableFrom(compiling_class)) {
Aart Bikf663e342016-04-04 17:28:59 -0700863 // We cannot statically determine the target method. The runtime will throw a
864 // NoSuchMethodError on this one.
865 return nullptr;
866 }
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100867 ArtMethod* actual_method;
Vladimir Markoba118822017-06-12 15:41:56 +0100868 if (referenced_class->IsInterface()) {
869 actual_method = referenced_class->FindVirtualMethodForInterfaceSuper(
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100870 resolved_method, class_linker->GetImagePointerSize());
David Brazdildee58d62016-04-07 09:54:26 +0000871 } else {
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100872 uint16_t vtable_index = resolved_method->GetMethodIndex();
873 actual_method = compiling_class->GetSuperClass()->GetVTableEntry(
874 vtable_index, class_linker->GetImagePointerSize());
David Brazdildee58d62016-04-07 09:54:26 +0000875 }
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100876 if (actual_method != resolved_method &&
877 !IsSameDexFile(*actual_method->GetDexFile(), *dex_compilation_unit_->GetDexFile())) {
878 // The back-end code generator relies on this check in order to ensure that it will not
879 // attempt to read the dex_cache with a dex_method_index that is not from the correct
880 // dex_file. If we didn't do this check then the dex_method_index will not be updated in the
Vladimir Markoc1c34522018-10-31 13:56:49 +0000881 // builder, which means that the code-generator (and sharpening and inliner, maybe)
882 // might invoke an incorrect method.
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100883 // TODO: The actual method could still be referenced in the current dex file, so we
884 // could try locating it.
885 // TODO: Remove the dex_file restriction.
886 return nullptr;
887 }
888 if (!actual_method->IsInvokable()) {
889 // Fail if the actual method cannot be invoked. Otherwise, the runtime resolution stub
890 // could resolve the callee to the wrong method.
891 return nullptr;
892 }
893 resolved_method = actual_method;
David Brazdildee58d62016-04-07 09:54:26 +0000894 }
895
David Brazdildee58d62016-04-07 09:54:26 +0000896 return resolved_method;
897}
898
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100899static bool IsStringConstructor(ArtMethod* method) {
900 ScopedObjectAccess soa(Thread::Current());
901 return method->GetDeclaringClass()->IsStringClass() && method->IsConstructor();
902}
903
David Brazdildee58d62016-04-07 09:54:26 +0000904bool HInstructionBuilder::BuildInvoke(const Instruction& instruction,
905 uint32_t dex_pc,
906 uint32_t method_idx,
Treehugger Robot2c5827a2018-05-17 22:26:08 +0000907 const InstructionOperands& operands) {
David Brazdildee58d62016-04-07 09:54:26 +0000908 InvokeType invoke_type = GetInvokeTypeFromOpCode(instruction.Opcode());
Orion Hodson4c8e12e2018-05-18 08:33:20 +0100909 const char* shorty = dex_file_->GetMethodShorty(method_idx);
910 DataType::Type return_type = DataType::FromShorty(shorty[0]);
David Brazdildee58d62016-04-07 09:54:26 +0000911
912 // Remove the return type from the 'proto'.
Orion Hodson4c8e12e2018-05-18 08:33:20 +0100913 size_t number_of_arguments = strlen(shorty) - 1;
David Brazdildee58d62016-04-07 09:54:26 +0000914 if (invoke_type != kStatic) { // instance call
915 // One extra argument for 'this'.
916 number_of_arguments++;
917 }
918
David Brazdildee58d62016-04-07 09:54:26 +0000919 ArtMethod* resolved_method = ResolveMethod(method_idx, invoke_type);
920
921 if (UNLIKELY(resolved_method == nullptr)) {
Igor Murashkin1e065a52017-08-09 13:20:34 -0700922 MaybeRecordStat(compilation_stats_,
923 MethodCompilationStat::kUnresolvedMethod);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100924 HInvoke* invoke = new (allocator_) HInvokeUnresolved(allocator_,
925 number_of_arguments,
926 return_type,
927 dex_pc,
928 method_idx,
929 invoke_type);
Andreas Gampe3db70682018-12-26 15:12:03 -0800930 return HandleInvoke(invoke, operands, shorty, /* is_unresolved= */ true);
David Brazdildee58d62016-04-07 09:54:26 +0000931 }
932
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100933 // Replace calls to String.<init> with StringFactory.
934 if (IsStringConstructor(resolved_method)) {
935 uint32_t string_init_entry_point = WellKnownClasses::StringInitToEntryPoint(resolved_method);
936 HInvokeStaticOrDirect::DispatchInfo dispatch_info = {
937 HInvokeStaticOrDirect::MethodLoadKind::kStringInit,
938 HInvokeStaticOrDirect::CodePtrLocation::kCallArtMethod,
Nicolas Geoffrayc1a42cf2016-12-18 15:52:36 +0000939 dchecked_integral_cast<uint64_t>(string_init_entry_point)
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100940 };
Nicolas Geoffrayf665f842018-02-15 12:29:06 +0000941 ScopedObjectAccess soa(Thread::Current());
942 MethodReference target_method(resolved_method->GetDexFile(),
943 resolved_method->GetDexMethodIndex());
944 // We pass null for the resolved_method to ensure optimizations
945 // don't rely on it.
Vladimir Markoca6fff82017-10-03 14:49:14 +0100946 HInvoke* invoke = new (allocator_) HInvokeStaticOrDirect(
947 allocator_,
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100948 number_of_arguments - 1,
Andreas Gampe3db70682018-12-26 15:12:03 -0800949 /* return_type= */ DataType::Type::kReference,
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100950 dex_pc,
951 method_idx,
Andreas Gampe3db70682018-12-26 15:12:03 -0800952 /* resolved_method= */ nullptr,
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100953 dispatch_info,
954 invoke_type,
955 target_method,
956 HInvokeStaticOrDirect::ClinitCheckRequirement::kImplicit);
Orion Hodson4c8e12e2018-05-18 08:33:20 +0100957 return HandleStringInit(invoke, operands, shorty);
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100958 }
959
David Brazdildee58d62016-04-07 09:54:26 +0000960 // Potential class initialization check, in the case of a static method call.
961 HClinitCheck* clinit_check = nullptr;
962 HInvoke* invoke = nullptr;
963 if (invoke_type == kDirect || invoke_type == kStatic || invoke_type == kSuper) {
964 // By default, consider that the called method implicitly requires
965 // an initialization check of its declaring method.
966 HInvokeStaticOrDirect::ClinitCheckRequirement clinit_check_requirement
967 = HInvokeStaticOrDirect::ClinitCheckRequirement::kImplicit;
968 ScopedObjectAccess soa(Thread::Current());
969 if (invoke_type == kStatic) {
Vladimir Markofca0b492018-07-23 15:30:52 +0100970 clinit_check =
Vladimir Markoa2c211c2018-11-01 09:50:52 +0000971 ProcessClinitCheckForInvoke(dex_pc, resolved_method, &clinit_check_requirement);
David Brazdildee58d62016-04-07 09:54:26 +0000972 } else if (invoke_type == kSuper) {
973 if (IsSameDexFile(*resolved_method->GetDexFile(), *dex_compilation_unit_->GetDexFile())) {
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +0100974 // Update the method index to the one resolved. Note that this may be a no-op if
David Brazdildee58d62016-04-07 09:54:26 +0000975 // we resolved to the method referenced by the instruction.
976 method_idx = resolved_method->GetDexMethodIndex();
David Brazdildee58d62016-04-07 09:54:26 +0000977 }
978 }
979
Nicolas Geoffraybdb2ecc2018-09-18 14:33:55 +0100980 HInvokeStaticOrDirect::DispatchInfo dispatch_info =
981 HSharpening::SharpenInvokeStaticOrDirect(resolved_method, code_generator_);
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +0100982 MethodReference target_method(resolved_method->GetDexFile(),
983 resolved_method->GetDexMethodIndex());
Vladimir Markoca6fff82017-10-03 14:49:14 +0100984 invoke = new (allocator_) HInvokeStaticOrDirect(allocator_,
985 number_of_arguments,
986 return_type,
987 dex_pc,
988 method_idx,
989 resolved_method,
990 dispatch_info,
991 invoke_type,
992 target_method,
993 clinit_check_requirement);
David Brazdildee58d62016-04-07 09:54:26 +0000994 } else if (invoke_type == kVirtual) {
995 ScopedObjectAccess soa(Thread::Current()); // Needed for the method index
Vladimir Markoca6fff82017-10-03 14:49:14 +0100996 invoke = new (allocator_) HInvokeVirtual(allocator_,
997 number_of_arguments,
998 return_type,
999 dex_pc,
1000 method_idx,
1001 resolved_method,
1002 resolved_method->GetMethodIndex());
David Brazdildee58d62016-04-07 09:54:26 +00001003 } else {
1004 DCHECK_EQ(invoke_type, kInterface);
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +01001005 ScopedObjectAccess soa(Thread::Current()); // Needed for the IMT index.
Vladimir Markoca6fff82017-10-03 14:49:14 +01001006 invoke = new (allocator_) HInvokeInterface(allocator_,
1007 number_of_arguments,
1008 return_type,
1009 dex_pc,
1010 method_idx,
1011 resolved_method,
1012 ImTable::GetImtIndex(resolved_method));
David Brazdildee58d62016-04-07 09:54:26 +00001013 }
Andreas Gampe3db70682018-12-26 15:12:03 -08001014 return HandleInvoke(invoke, operands, shorty, /* is_unresolved= */ false, clinit_check);
David Brazdildee58d62016-04-07 09:54:26 +00001015}
1016
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001017bool HInstructionBuilder::BuildInvokePolymorphic(uint32_t dex_pc,
Orion Hodsonac141392017-01-13 11:53:47 +00001018 uint32_t method_idx,
Orion Hodson06d10a72018-05-14 08:53:38 +01001019 dex::ProtoIndex proto_idx,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001020 const InstructionOperands& operands) {
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001021 const char* shorty = dex_file_->GetShorty(proto_idx);
1022 DCHECK_EQ(1 + ArtMethod::NumArgRegisters(shorty), operands.GetNumberOfOperands());
1023 DataType::Type return_type = DataType::FromShorty(shorty[0]);
1024 size_t number_of_arguments = strlen(shorty);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001025 HInvoke* invoke = new (allocator_) HInvokePolymorphic(allocator_,
1026 number_of_arguments,
1027 return_type,
1028 dex_pc,
1029 method_idx);
Andreas Gampe3db70682018-12-26 15:12:03 -08001030 return HandleInvoke(invoke, operands, shorty, /* is_unresolved= */ false);
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001031}
1032
1033
1034bool HInstructionBuilder::BuildInvokeCustom(uint32_t dex_pc,
1035 uint32_t call_site_idx,
1036 const InstructionOperands& operands) {
1037 dex::ProtoIndex proto_idx = dex_file_->GetProtoIndexForCallSite(call_site_idx);
1038 const char* shorty = dex_file_->GetShorty(proto_idx);
1039 DataType::Type return_type = DataType::FromShorty(shorty[0]);
1040 size_t number_of_arguments = strlen(shorty) - 1;
1041 HInvoke* invoke = new (allocator_) HInvokeCustom(allocator_,
1042 number_of_arguments,
1043 call_site_idx,
1044 return_type,
1045 dex_pc);
Andreas Gampe3db70682018-12-26 15:12:03 -08001046 return HandleInvoke(invoke, operands, shorty, /* is_unresolved= */ false);
Orion Hodsonac141392017-01-13 11:53:47 +00001047}
1048
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001049HNewInstance* HInstructionBuilder::BuildNewInstance(dex::TypeIndex type_index, uint32_t dex_pc) {
Vladimir Marko3cd50df2016-04-13 19:29:26 +01001050 ScopedObjectAccess soa(Thread::Current());
David Brazdildee58d62016-04-07 09:54:26 +00001051
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001052 HLoadClass* load_class = BuildLoadClass(type_index, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001053
David Brazdildee58d62016-04-07 09:54:26 +00001054 HInstruction* cls = load_class;
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001055 Handle<mirror::Class> klass = load_class->GetClass();
1056
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001057 if (!IsInitialized(klass)) {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001058 cls = new (allocator_) HClinitCheck(load_class, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001059 AppendInstruction(cls);
1060 }
1061
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001062 // Only the access check entrypoint handles the finalizable class case. If we
1063 // need access checks, then we haven't resolved the method and the class may
1064 // again be finalizable.
1065 QuickEntrypointEnum entrypoint = kQuickAllocObjectInitialized;
1066 if (load_class->NeedsAccessCheck() || klass->IsFinalizable() || !klass->IsInstantiable()) {
1067 entrypoint = kQuickAllocObjectWithChecks;
1068 }
Alex Lightd109e302018-06-27 10:25:41 -07001069 // We will always be able to resolve the string class since it is in the BCP.
1070 if (!klass.IsNull() && klass->IsStringClass()) {
1071 entrypoint = kQuickAllocStringObject;
1072 }
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001073
1074 // Consider classes we haven't resolved as potentially finalizable.
Andreas Gampefa4333d2017-02-14 11:10:34 -08001075 bool finalizable = (klass == nullptr) || klass->IsFinalizable();
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001076
Vladimir Markoca6fff82017-10-03 14:49:14 +01001077 HNewInstance* new_instance = new (allocator_) HNewInstance(
David Brazdildee58d62016-04-07 09:54:26 +00001078 cls,
David Brazdildee58d62016-04-07 09:54:26 +00001079 dex_pc,
1080 type_index,
1081 *dex_compilation_unit_->GetDexFile(),
David Brazdildee58d62016-04-07 09:54:26 +00001082 finalizable,
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001083 entrypoint);
1084 AppendInstruction(new_instance);
1085
1086 return new_instance;
1087}
1088
1089void HInstructionBuilder::BuildConstructorFenceForAllocation(HInstruction* allocation) {
1090 DCHECK(allocation != nullptr &&
George Burgess IVf2072992017-05-23 15:36:41 -07001091 (allocation->IsNewInstance() ||
1092 allocation->IsNewArray())); // corresponding to "new" keyword in JLS.
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001093
1094 if (allocation->IsNewInstance()) {
1095 // STRING SPECIAL HANDLING:
1096 // -------------------------------
1097 // Strings have a real HNewInstance node but they end up always having 0 uses.
1098 // All uses of a String HNewInstance are always transformed to replace their input
1099 // of the HNewInstance with an input of the invoke to StringFactory.
1100 //
1101 // Do not emit an HConstructorFence here since it can inhibit some String new-instance
1102 // optimizations (to pass checker tests that rely on those optimizations).
1103 HNewInstance* new_inst = allocation->AsNewInstance();
1104 HLoadClass* load_class = new_inst->GetLoadClass();
1105
1106 Thread* self = Thread::Current();
1107 ScopedObjectAccess soa(self);
1108 StackHandleScope<1> hs(self);
1109 Handle<mirror::Class> klass = load_class->GetClass();
1110 if (klass != nullptr && klass->IsStringClass()) {
1111 return;
1112 // Note: Do not use allocation->IsStringAlloc which requires
1113 // a valid ReferenceTypeInfo, but that doesn't get made until after reference type
1114 // propagation (and instruction builder is too early).
1115 }
1116 // (In terms of correctness, the StringFactory needs to provide its own
1117 // default initialization barrier, see below.)
1118 }
1119
1120 // JLS 17.4.5 "Happens-before Order" describes:
1121 //
1122 // The default initialization of any object happens-before any other actions (other than
1123 // default-writes) of a program.
1124 //
1125 // In our implementation the default initialization of an object to type T means
1126 // setting all of its initial data (object[0..size)) to 0, and setting the
1127 // object's class header (i.e. object.getClass() == T.class).
1128 //
1129 // In practice this fence ensures that the writes to the object header
1130 // are visible to other threads if this object escapes the current thread.
1131 // (and in theory the 0-initializing, but that happens automatically
1132 // when new memory pages are mapped in by the OS).
1133 HConstructorFence* ctor_fence =
Vladimir Markoca6fff82017-10-03 14:49:14 +01001134 new (allocator_) HConstructorFence(allocation, allocation->GetDexPc(), allocator_);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001135 AppendInstruction(ctor_fence);
Igor Murashkin6ef45672017-08-08 13:59:55 -07001136 MaybeRecordStat(
1137 compilation_stats_,
1138 MethodCompilationStat::kConstructorFenceGeneratedNew);
David Brazdildee58d62016-04-07 09:54:26 +00001139}
1140
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001141static bool IsInBootImage(ObjPtr<mirror::Class> cls, const CompilerOptions& compiler_options)
1142 REQUIRES_SHARED(Locks::mutator_lock_) {
Vladimir Marko6a67bea2020-01-20 13:05:55 +00001143 if (Runtime::Current()->GetHeap()->ObjectIsInBootImageSpace(cls)) {
1144 return true;
1145 }
1146 if (compiler_options.IsBootImage() || compiler_options.IsBootImageExtension()) {
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001147 std::string temp;
1148 const char* descriptor = cls->GetDescriptor(&temp);
1149 return compiler_options.IsImageClass(descriptor);
1150 } else {
Vladimir Marko6a67bea2020-01-20 13:05:55 +00001151 return false;
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001152 }
1153}
1154
1155static bool IsSubClass(ObjPtr<mirror::Class> to_test, ObjPtr<mirror::Class> super_class)
1156 REQUIRES_SHARED(Locks::mutator_lock_) {
1157 return to_test != nullptr && !to_test->IsInterface() && to_test->IsSubClass(super_class);
1158}
1159
1160static bool HasTrivialClinit(ObjPtr<mirror::Class> klass, PointerSize pointer_size)
1161 REQUIRES_SHARED(Locks::mutator_lock_) {
1162 // Check if the class has encoded fields that trigger bytecode execution.
1163 // (Encoded fields are just a different representation of <clinit>.)
1164 if (klass->NumStaticFields() != 0u) {
1165 DCHECK(klass->GetClassDef() != nullptr);
1166 EncodedStaticFieldValueIterator it(klass->GetDexFile(), *klass->GetClassDef());
1167 for (; it.HasNext(); it.Next()) {
1168 switch (it.GetValueType()) {
1169 case EncodedArrayValueIterator::ValueType::kBoolean:
1170 case EncodedArrayValueIterator::ValueType::kByte:
1171 case EncodedArrayValueIterator::ValueType::kShort:
1172 case EncodedArrayValueIterator::ValueType::kChar:
1173 case EncodedArrayValueIterator::ValueType::kInt:
1174 case EncodedArrayValueIterator::ValueType::kLong:
1175 case EncodedArrayValueIterator::ValueType::kFloat:
1176 case EncodedArrayValueIterator::ValueType::kDouble:
1177 case EncodedArrayValueIterator::ValueType::kNull:
1178 case EncodedArrayValueIterator::ValueType::kString:
1179 // Primitive, null or j.l.String initialization is permitted.
1180 break;
1181 case EncodedArrayValueIterator::ValueType::kType:
1182 // Type initialization can load classes and execute bytecode through a class loader
1183 // which can execute arbitrary bytecode. We do not optimize for known class loaders;
1184 // kType is rarely used (if ever).
1185 return false;
1186 default:
1187 // Other types in the encoded static field list are rejected by the DexFileVerifier.
1188 LOG(FATAL) << "Unexpected type " << it.GetValueType();
1189 UNREACHABLE();
1190 }
1191 }
1192 }
1193 // Check if the class has <clinit> that executes arbitrary code.
1194 // Initialization of static fields of the class itself with constants is allowed.
1195 ArtMethod* clinit = klass->FindClassInitializer(pointer_size);
1196 if (clinit != nullptr) {
1197 const DexFile& dex_file = *clinit->GetDexFile();
1198 CodeItemInstructionAccessor accessor(dex_file, clinit->GetCodeItem());
1199 for (DexInstructionPcPair it : accessor) {
1200 switch (it->Opcode()) {
1201 case Instruction::CONST_4:
1202 case Instruction::CONST_16:
1203 case Instruction::CONST:
1204 case Instruction::CONST_HIGH16:
1205 case Instruction::CONST_WIDE_16:
1206 case Instruction::CONST_WIDE_32:
1207 case Instruction::CONST_WIDE:
1208 case Instruction::CONST_WIDE_HIGH16:
1209 case Instruction::CONST_STRING:
1210 case Instruction::CONST_STRING_JUMBO:
1211 // Primitive, null or j.l.String initialization is permitted.
1212 break;
1213 case Instruction::RETURN_VOID:
1214 case Instruction::RETURN_VOID_NO_BARRIER:
1215 break;
1216 case Instruction::SPUT:
1217 case Instruction::SPUT_WIDE:
1218 case Instruction::SPUT_OBJECT:
1219 case Instruction::SPUT_BOOLEAN:
1220 case Instruction::SPUT_BYTE:
1221 case Instruction::SPUT_CHAR:
1222 case Instruction::SPUT_SHORT:
1223 // Only initialization of a static field of the same class is permitted.
1224 if (dex_file.GetFieldId(it->VRegB_21c()).class_idx_ != klass->GetDexTypeIndex()) {
1225 return false;
1226 }
1227 break;
1228 case Instruction::NEW_ARRAY:
1229 // Only primitive arrays are permitted.
1230 if (Primitive::GetType(dex_file.GetTypeDescriptor(dex_file.GetTypeId(
1231 dex::TypeIndex(it->VRegC_22c())))[1]) == Primitive::kPrimNot) {
1232 return false;
1233 }
1234 break;
1235 case Instruction::APUT:
1236 case Instruction::APUT_WIDE:
1237 case Instruction::APUT_BOOLEAN:
1238 case Instruction::APUT_BYTE:
1239 case Instruction::APUT_CHAR:
1240 case Instruction::APUT_SHORT:
1241 case Instruction::FILL_ARRAY_DATA:
1242 case Instruction::NOP:
1243 // Allow initialization of primitive arrays (only constants can be stored).
1244 // Note: We expect NOPs used for fill-array-data-payload but accept all NOPs
1245 // (even unreferenced switch payloads if they make it through the verifier).
1246 break;
1247 default:
1248 return false;
1249 }
1250 }
1251 }
1252 return true;
1253}
1254
1255static bool HasTrivialInitialization(ObjPtr<mirror::Class> cls,
1256 const CompilerOptions& compiler_options)
1257 REQUIRES_SHARED(Locks::mutator_lock_) {
1258 Runtime* runtime = Runtime::Current();
1259 PointerSize pointer_size = runtime->GetClassLinker()->GetImagePointerSize();
1260
1261 // Check the superclass chain.
1262 for (ObjPtr<mirror::Class> klass = cls; klass != nullptr; klass = klass->GetSuperClass()) {
1263 if (klass->IsInitialized() && IsInBootImage(klass, compiler_options)) {
1264 break; // `klass` and its superclasses are already initialized in the boot image.
1265 }
1266 if (!HasTrivialClinit(klass, pointer_size)) {
1267 return false;
1268 }
1269 }
1270
1271 // Also check interfaces with default methods as they need to be initialized as well.
1272 ObjPtr<mirror::IfTable> iftable = cls->GetIfTable();
1273 DCHECK(iftable != nullptr);
1274 for (int32_t i = 0, count = iftable->Count(); i != count; ++i) {
1275 ObjPtr<mirror::Class> iface = iftable->GetInterface(i);
1276 if (!iface->HasDefaultMethods()) {
1277 continue; // Initializing `cls` does not initialize this interface.
1278 }
1279 if (iface->IsInitialized() && IsInBootImage(iface, compiler_options)) {
1280 continue; // This interface is already initialized in the boot image.
1281 }
1282 if (!HasTrivialClinit(iface, pointer_size)) {
1283 return false;
1284 }
1285 }
1286 return true;
1287}
1288
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001289bool HInstructionBuilder::IsInitialized(Handle<mirror::Class> cls) const {
Andreas Gampefa4333d2017-02-14 11:10:34 -08001290 if (cls == nullptr) {
David Brazdildee58d62016-04-07 09:54:26 +00001291 return false;
1292 }
1293
Vladimir Marko51b8aaf2017-06-09 15:17:05 +01001294 // Check if the class will be initialized at runtime.
1295 if (cls->IsInitialized()) {
1296 Runtime* runtime = Runtime::Current();
Nicolas Geoffraya48c3df2019-06-27 13:11:12 +00001297 if (runtime->IsAotCompiler()) {
1298 // Assume loaded only if klass is in the boot image. App classes cannot be assumed
1299 // loaded because we don't even know what class loader will be used to load them.
1300 if (IsInBootImage(cls.Get(), code_generator_->GetCompilerOptions())) {
1301 return true;
1302 }
1303 } else {
Vladimir Marko51b8aaf2017-06-09 15:17:05 +01001304 DCHECK(runtime->UseJitCompilation());
Nicolas Geoffraya48c3df2019-06-27 13:11:12 +00001305 if (Runtime::Current()->GetJit()->CanAssumeInitialized(
1306 cls.Get(),
1307 graph_->IsCompilingForSharedJitCode())) {
1308 // For JIT, the class cannot revert to an uninitialized state.
1309 return true;
1310 }
Vladimir Marko51b8aaf2017-06-09 15:17:05 +01001311 }
1312 }
1313
Vladimir Marko7f260d42018-10-30 18:09:55 +00001314 // We can avoid the class initialization check for `cls` in static methods and constructors
1315 // in the very same class; invoking a static method involves a class initialization check
1316 // and so does the instance allocation that must be executed before invoking a constructor.
1317 // Other instance methods of the same class can run on an escaped instance
Vladimir Marko51b8aaf2017-06-09 15:17:05 +01001318 // of an erroneous class. Even a superclass may need to be checked as the subclass
1319 // can be completely initialized while the superclass is initializing and the subclass
1320 // remains initialized when the superclass initializer throws afterwards. b/62478025
1321 // Note: The HClinitCheck+HInvokeStaticOrDirect merging can still apply.
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001322 auto is_static_method_or_constructor_of_cls = [cls](const DexCompilationUnit& compilation_unit)
1323 REQUIRES_SHARED(Locks::mutator_lock_) {
1324 return (compilation_unit.GetAccessFlags() & (kAccStatic | kAccConstructor)) != 0u &&
1325 compilation_unit.GetCompilingClass().Get() == cls.Get();
1326 };
1327 if (is_static_method_or_constructor_of_cls(*outer_compilation_unit_) ||
1328 // Check also the innermost method. Though excessive copies of ClinitCheck can be
1329 // eliminated by GVN, that happens only after the decision whether to inline the
1330 // graph or not and that may depend on the presence of the ClinitCheck.
1331 // TODO: We should walk over the entire inlined method chain, but we don't pass that
1332 // information to the builder.
1333 is_static_method_or_constructor_of_cls(*dex_compilation_unit_)) {
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001334 return true;
1335 }
David Brazdildee58d62016-04-07 09:54:26 +00001336
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.)
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001356 bool is_subclass = IsSubClass(outer_compilation_unit_->GetCompilingClass().Get(), cls.Get());
1357 if (dex_compilation_unit_ != outer_compilation_unit_) {
1358 is_subclass = is_subclass ||
1359 IsSubClass(dex_compilation_unit_->GetCompilingClass().Get(), cls.Get());
1360 }
Vladimir Marko3b506202018-10-31 14:33:58 +00001361 if (is_subclass && HasTrivialInitialization(cls.Get(), code_generator_->GetCompilerOptions())) {
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001362 return true;
1363 }
David Brazdildee58d62016-04-07 09:54:26 +00001364
1365 return false;
1366}
1367
1368HClinitCheck* HInstructionBuilder::ProcessClinitCheckForInvoke(
Vladimir Markofca0b492018-07-23 15:30:52 +01001369 uint32_t dex_pc,
1370 ArtMethod* resolved_method,
1371 HInvokeStaticOrDirect::ClinitCheckRequirement* clinit_check_requirement) {
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001372 Handle<mirror::Class> klass = handles_->NewHandle(resolved_method->GetDeclaringClass());
David Brazdildee58d62016-04-07 09:54:26 +00001373
1374 HClinitCheck* clinit_check = nullptr;
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001375 if (IsInitialized(klass)) {
David Brazdildee58d62016-04-07 09:54:26 +00001376 *clinit_check_requirement = HInvokeStaticOrDirect::ClinitCheckRequirement::kNone;
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001377 } else {
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001378 HLoadClass* cls = BuildLoadClass(klass->GetDexTypeIndex(),
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001379 klass->GetDexFile(),
1380 klass,
1381 dex_pc,
Andreas Gampe3db70682018-12-26 15:12:03 -08001382 /* needs_access_check= */ false);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001383 if (cls != nullptr) {
1384 *clinit_check_requirement = HInvokeStaticOrDirect::ClinitCheckRequirement::kExplicit;
Vladimir Markoca6fff82017-10-03 14:49:14 +01001385 clinit_check = new (allocator_) HClinitCheck(cls, dex_pc);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001386 AppendInstruction(clinit_check);
1387 }
David Brazdildee58d62016-04-07 09:54:26 +00001388 }
1389 return clinit_check;
1390}
1391
1392bool HInstructionBuilder::SetupInvokeArguments(HInvoke* invoke,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001393 const InstructionOperands& operands,
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001394 const char* shorty,
David Brazdildee58d62016-04-07 09:54:26 +00001395 size_t start_index,
1396 size_t* argument_index) {
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001397 uint32_t shorty_index = 1; // Skip the return type.
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001398 const size_t number_of_operands = operands.GetNumberOfOperands();
David Brazdildee58d62016-04-07 09:54:26 +00001399 for (size_t i = start_index;
1400 // Make sure we don't go over the expected arguments or over the number of
1401 // dex registers given. If the instruction was seen as dead by the verifier,
1402 // it hasn't been properly checked.
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001403 (i < number_of_operands) && (*argument_index < invoke->GetNumberOfArguments());
David Brazdildee58d62016-04-07 09:54:26 +00001404 i++, (*argument_index)++) {
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001405 DataType::Type type = DataType::FromShorty(shorty[shorty_index++]);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001406 bool is_wide = (type == DataType::Type::kInt64) || (type == DataType::Type::kFloat64);
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001407 if (is_wide && ((i + 1 == number_of_operands) ||
1408 (operands.GetOperand(i) + 1 != operands.GetOperand(i + 1)))) {
David Brazdildee58d62016-04-07 09:54:26 +00001409 // Longs and doubles should be in pairs, that is, sequential registers. The verifier should
1410 // reject any class where this is violated. However, the verifier only does these checks
1411 // on non trivially dead instructions, so we just bailout the compilation.
1412 VLOG(compiler) << "Did not compile "
David Sehr709b0702016-10-13 09:12:37 -07001413 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
David Brazdildee58d62016-04-07 09:54:26 +00001414 << " because of non-sequential dex register pair in wide argument";
Igor Murashkin1e065a52017-08-09 13:20:34 -07001415 MaybeRecordStat(compilation_stats_,
1416 MethodCompilationStat::kNotCompiledMalformedOpcode);
David Brazdildee58d62016-04-07 09:54:26 +00001417 return false;
1418 }
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001419 HInstruction* arg = LoadLocal(operands.GetOperand(i), type);
David Brazdildee58d62016-04-07 09:54:26 +00001420 invoke->SetArgumentAt(*argument_index, arg);
1421 if (is_wide) {
1422 i++;
1423 }
1424 }
1425
1426 if (*argument_index != invoke->GetNumberOfArguments()) {
1427 VLOG(compiler) << "Did not compile "
David Sehr709b0702016-10-13 09:12:37 -07001428 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
David Brazdildee58d62016-04-07 09:54:26 +00001429 << " because of wrong number of arguments in invoke instruction";
Igor Murashkin1e065a52017-08-09 13:20:34 -07001430 MaybeRecordStat(compilation_stats_,
1431 MethodCompilationStat::kNotCompiledMalformedOpcode);
David Brazdildee58d62016-04-07 09:54:26 +00001432 return false;
1433 }
1434
1435 if (invoke->IsInvokeStaticOrDirect() &&
1436 HInvokeStaticOrDirect::NeedsCurrentMethodInput(
1437 invoke->AsInvokeStaticOrDirect()->GetMethodLoadKind())) {
1438 invoke->SetArgumentAt(*argument_index, graph_->GetCurrentMethod());
1439 (*argument_index)++;
1440 }
1441
1442 return true;
1443}
1444
1445bool HInstructionBuilder::HandleInvoke(HInvoke* invoke,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001446 const InstructionOperands& operands,
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001447 const char* shorty,
1448 bool is_unresolved,
1449 HClinitCheck* clinit_check) {
David Brazdildee58d62016-04-07 09:54:26 +00001450 DCHECK(!invoke->IsInvokeStaticOrDirect() || !invoke->AsInvokeStaticOrDirect()->IsStringInit());
1451
1452 size_t start_index = 0;
1453 size_t argument_index = 0;
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +01001454 if (invoke->GetInvokeType() != InvokeType::kStatic) { // Instance call.
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001455 uint32_t obj_reg = operands.GetOperand(0);
Aart Bik296fbb42016-06-07 13:49:12 -07001456 HInstruction* arg = is_unresolved
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001457 ? LoadLocal(obj_reg, DataType::Type::kReference)
Aart Bik296fbb42016-06-07 13:49:12 -07001458 : LoadNullCheckedLocal(obj_reg, invoke->GetDexPc());
David Brazdilc120bbe2016-04-22 16:57:00 +01001459 invoke->SetArgumentAt(0, arg);
David Brazdildee58d62016-04-07 09:54:26 +00001460 start_index = 1;
1461 argument_index = 1;
1462 }
1463
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001464 if (!SetupInvokeArguments(invoke, operands, shorty, start_index, &argument_index)) {
David Brazdildee58d62016-04-07 09:54:26 +00001465 return false;
1466 }
1467
1468 if (clinit_check != nullptr) {
1469 // Add the class initialization check as last input of `invoke`.
1470 DCHECK(invoke->IsInvokeStaticOrDirect());
1471 DCHECK(invoke->AsInvokeStaticOrDirect()->GetClinitCheckRequirement()
1472 == HInvokeStaticOrDirect::ClinitCheckRequirement::kExplicit);
1473 invoke->SetArgumentAt(argument_index, clinit_check);
1474 argument_index++;
1475 }
1476
1477 AppendInstruction(invoke);
1478 latest_result_ = invoke;
1479
1480 return true;
1481}
1482
1483bool HInstructionBuilder::HandleStringInit(HInvoke* invoke,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001484 const InstructionOperands& operands,
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001485 const char* shorty) {
David Brazdildee58d62016-04-07 09:54:26 +00001486 DCHECK(invoke->IsInvokeStaticOrDirect());
1487 DCHECK(invoke->AsInvokeStaticOrDirect()->IsStringInit());
1488
1489 size_t start_index = 1;
1490 size_t argument_index = 0;
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001491 if (!SetupInvokeArguments(invoke, operands, shorty, start_index, &argument_index)) {
David Brazdildee58d62016-04-07 09:54:26 +00001492 return false;
1493 }
1494
1495 AppendInstruction(invoke);
1496
1497 // This is a StringFactory call, not an actual String constructor. Its result
1498 // replaces the empty String pre-allocated by NewInstance.
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001499 uint32_t orig_this_reg = operands.GetOperand(0);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001500 HInstruction* arg_this = LoadLocal(orig_this_reg, DataType::Type::kReference);
David Brazdildee58d62016-04-07 09:54:26 +00001501
1502 // Replacing the NewInstance might render it redundant. Keep a list of these
Nicolas Geoffray8a62a4c2018-07-03 09:39:07 +01001503 // to be visited once it is clear whether it has remaining uses.
David Brazdildee58d62016-04-07 09:54:26 +00001504 if (arg_this->IsNewInstance()) {
1505 ssa_builder_->AddUninitializedString(arg_this->AsNewInstance());
Nicolas Geoffray8a62a4c2018-07-03 09:39:07 +01001506 } else {
1507 DCHECK(arg_this->IsPhi());
1508 // We can get a phi as input of a String.<init> if there is a loop between the
1509 // allocation and the String.<init> call. As we don't know which other phis might alias
Nicolas Geoffray0846a8f2018-09-12 15:21:07 +01001510 // with `arg_this`, we keep a record of those invocations so we can later replace
1511 // the allocation with the invocation.
1512 // Add the actual 'this' input so the analysis knows what is the allocation instruction.
1513 // The input will be removed during the analysis.
1514 invoke->AddInput(arg_this);
1515 ssa_builder_->AddUninitializedStringPhi(invoke);
1516 }
1517 // Walk over all vregs and replace any occurrence of `arg_this` with `invoke`.
1518 for (size_t vreg = 0, e = current_locals_->size(); vreg < e; ++vreg) {
1519 if ((*current_locals_)[vreg] == arg_this) {
1520 (*current_locals_)[vreg] = invoke;
1521 }
David Brazdildee58d62016-04-07 09:54:26 +00001522 }
David Brazdildee58d62016-04-07 09:54:26 +00001523 return true;
1524}
1525
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001526static DataType::Type GetFieldAccessType(const DexFile& dex_file, uint16_t field_index) {
Andreas Gampe3f1dcd32018-12-28 09:39:56 -08001527 const dex::FieldId& field_id = dex_file.GetFieldId(field_index);
David Brazdildee58d62016-04-07 09:54:26 +00001528 const char* type = dex_file.GetFieldTypeDescriptor(field_id);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001529 return DataType::FromShorty(type[0]);
David Brazdildee58d62016-04-07 09:54:26 +00001530}
1531
1532bool HInstructionBuilder::BuildInstanceFieldAccess(const Instruction& instruction,
1533 uint32_t dex_pc,
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07001534 bool is_put,
1535 size_t quicken_index) {
David Brazdildee58d62016-04-07 09:54:26 +00001536 uint32_t source_or_dest_reg = instruction.VRegA_22c();
1537 uint32_t obj_reg = instruction.VRegB_22c();
1538 uint16_t field_index;
1539 if (instruction.IsQuickened()) {
1540 if (!CanDecodeQuickenedInfo()) {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00001541 VLOG(compiler) << "Not compiled: Could not decode quickened instruction "
1542 << instruction.Opcode();
David Brazdildee58d62016-04-07 09:54:26 +00001543 return false;
1544 }
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07001545 field_index = LookupQuickenedInfo(quicken_index);
David Brazdildee58d62016-04-07 09:54:26 +00001546 } else {
1547 field_index = instruction.VRegC_22c();
1548 }
1549
1550 ScopedObjectAccess soa(Thread::Current());
Andreas Gampe3db70682018-12-26 15:12:03 -08001551 ArtField* resolved_field = ResolveField(field_index, /* is_static= */ false, is_put);
David Brazdildee58d62016-04-07 09:54:26 +00001552
Aart Bik14154132016-06-02 17:53:58 -07001553 // Generate an explicit null check on the reference, unless the field access
1554 // is unresolved. In that case, we rely on the runtime to perform various
1555 // checks first, followed by a null check.
1556 HInstruction* object = (resolved_field == nullptr)
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001557 ? LoadLocal(obj_reg, DataType::Type::kReference)
Aart Bik14154132016-06-02 17:53:58 -07001558 : LoadNullCheckedLocal(obj_reg, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001559
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001560 DataType::Type field_type = GetFieldAccessType(*dex_file_, field_index);
David Brazdildee58d62016-04-07 09:54:26 +00001561 if (is_put) {
1562 HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
1563 HInstruction* field_set = nullptr;
1564 if (resolved_field == nullptr) {
Igor Murashkin1e065a52017-08-09 13:20:34 -07001565 MaybeRecordStat(compilation_stats_,
1566 MethodCompilationStat::kUnresolvedField);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001567 field_set = new (allocator_) HUnresolvedInstanceFieldSet(object,
1568 value,
1569 field_type,
1570 field_index,
1571 dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001572 } else {
1573 uint16_t class_def_index = resolved_field->GetDeclaringClass()->GetDexClassDefIndex();
Vladimir Markoca6fff82017-10-03 14:49:14 +01001574 field_set = new (allocator_) HInstanceFieldSet(object,
1575 value,
1576 resolved_field,
1577 field_type,
1578 resolved_field->GetOffset(),
1579 resolved_field->IsVolatile(),
1580 field_index,
1581 class_def_index,
1582 *dex_file_,
1583 dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001584 }
1585 AppendInstruction(field_set);
1586 } else {
1587 HInstruction* field_get = nullptr;
1588 if (resolved_field == nullptr) {
Igor Murashkin1e065a52017-08-09 13:20:34 -07001589 MaybeRecordStat(compilation_stats_,
1590 MethodCompilationStat::kUnresolvedField);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001591 field_get = new (allocator_) HUnresolvedInstanceFieldGet(object,
1592 field_type,
1593 field_index,
1594 dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001595 } else {
1596 uint16_t class_def_index = resolved_field->GetDeclaringClass()->GetDexClassDefIndex();
Vladimir Markoca6fff82017-10-03 14:49:14 +01001597 field_get = new (allocator_) HInstanceFieldGet(object,
1598 resolved_field,
1599 field_type,
1600 resolved_field->GetOffset(),
1601 resolved_field->IsVolatile(),
1602 field_index,
1603 class_def_index,
1604 *dex_file_,
1605 dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001606 }
1607 AppendInstruction(field_get);
1608 UpdateLocal(source_or_dest_reg, field_get);
1609 }
1610
1611 return true;
1612}
1613
David Brazdildee58d62016-04-07 09:54:26 +00001614void HInstructionBuilder::BuildUnresolvedStaticFieldAccess(const Instruction& instruction,
Nicolas Geoffrayc52b26d2016-12-19 09:18:07 +00001615 uint32_t dex_pc,
1616 bool is_put,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001617 DataType::Type field_type) {
David Brazdildee58d62016-04-07 09:54:26 +00001618 uint32_t source_or_dest_reg = instruction.VRegA_21c();
1619 uint16_t field_index = instruction.VRegB_21c();
1620
1621 if (is_put) {
1622 HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
1623 AppendInstruction(
Vladimir Markoca6fff82017-10-03 14:49:14 +01001624 new (allocator_) HUnresolvedStaticFieldSet(value, field_type, field_index, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001625 } else {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001626 AppendInstruction(new (allocator_) HUnresolvedStaticFieldGet(field_type, field_index, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001627 UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
1628 }
1629}
1630
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001631ArtField* HInstructionBuilder::ResolveField(uint16_t field_idx, bool is_static, bool is_put) {
1632 ScopedObjectAccess soa(Thread::Current());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001633
1634 ClassLinker* class_linker = dex_compilation_unit_->GetClassLinker();
Vladimir Marko8d6768d2017-03-14 10:13:21 +00001635 Handle<mirror::ClassLoader> class_loader = dex_compilation_unit_->GetClassLoader();
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001636
Vladimir Markoe11dd502017-12-08 14:09:45 +00001637 ArtField* resolved_field = class_linker->ResolveField(field_idx,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001638 dex_compilation_unit_->GetDexCache(),
1639 class_loader,
1640 is_static);
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001641 DCHECK_EQ(resolved_field == nullptr, soa.Self()->IsExceptionPending());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001642 if (UNLIKELY(resolved_field == nullptr)) {
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001643 // Clean up any exception left by field resolution.
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001644 soa.Self()->ClearException();
1645 return nullptr;
1646 }
1647
1648 // Check static/instance. The class linker has a fast path for looking into the dex cache
1649 // and does not check static/instance if it hits it.
1650 if (UNLIKELY(resolved_field->IsStatic() != is_static)) {
1651 return nullptr;
1652 }
1653
1654 // Check access.
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001655 Handle<mirror::Class> compiling_class = dex_compilation_unit_->GetCompilingClass();
Andreas Gampefa4333d2017-02-14 11:10:34 -08001656 if (compiling_class == nullptr) {
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001657 if (!resolved_field->IsPublic()) {
1658 return nullptr;
1659 }
1660 } else if (!compiling_class->CanAccessResolvedField(resolved_field->GetDeclaringClass(),
1661 resolved_field,
1662 dex_compilation_unit_->GetDexCache().Get(),
1663 field_idx)) {
1664 return nullptr;
1665 }
1666
1667 if (is_put &&
1668 resolved_field->IsFinal() &&
1669 (compiling_class.Get() != resolved_field->GetDeclaringClass())) {
1670 // Final fields can only be updated within their own class.
1671 // TODO: Only allow it in constructors. b/34966607.
1672 return nullptr;
1673 }
1674
1675 return resolved_field;
1676}
1677
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00001678void HInstructionBuilder::BuildStaticFieldAccess(const Instruction& instruction,
David Brazdildee58d62016-04-07 09:54:26 +00001679 uint32_t dex_pc,
1680 bool is_put) {
1681 uint32_t source_or_dest_reg = instruction.VRegA_21c();
1682 uint16_t field_index = instruction.VRegB_21c();
1683
1684 ScopedObjectAccess soa(Thread::Current());
Andreas Gampe3db70682018-12-26 15:12:03 -08001685 ArtField* resolved_field = ResolveField(field_index, /* is_static= */ true, is_put);
David Brazdildee58d62016-04-07 09:54:26 +00001686
1687 if (resolved_field == nullptr) {
Igor Murashkin1e065a52017-08-09 13:20:34 -07001688 MaybeRecordStat(compilation_stats_,
1689 MethodCompilationStat::kUnresolvedField);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001690 DataType::Type field_type = GetFieldAccessType(*dex_file_, field_index);
David Brazdildee58d62016-04-07 09:54:26 +00001691 BuildUnresolvedStaticFieldAccess(instruction, dex_pc, is_put, field_type);
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00001692 return;
David Brazdildee58d62016-04-07 09:54:26 +00001693 }
1694
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001695 DataType::Type field_type = GetFieldAccessType(*dex_file_, field_index);
David Brazdildee58d62016-04-07 09:54:26 +00001696
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001697 Handle<mirror::Class> klass = handles_->NewHandle(resolved_field->GetDeclaringClass());
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001698 HLoadClass* constant = BuildLoadClass(klass->GetDexTypeIndex(),
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001699 klass->GetDexFile(),
1700 klass,
1701 dex_pc,
Andreas Gampe3db70682018-12-26 15:12:03 -08001702 /* needs_access_check= */ false);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001703
1704 if (constant == nullptr) {
1705 // The class cannot be referenced from this compiled code. Generate
1706 // an unresolved access.
Igor Murashkin1e065a52017-08-09 13:20:34 -07001707 MaybeRecordStat(compilation_stats_,
1708 MethodCompilationStat::kUnresolvedFieldNotAFastAccess);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001709 BuildUnresolvedStaticFieldAccess(instruction, dex_pc, is_put, field_type);
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00001710 return;
David Brazdildee58d62016-04-07 09:54:26 +00001711 }
1712
David Brazdildee58d62016-04-07 09:54:26 +00001713 HInstruction* cls = constant;
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001714 if (!IsInitialized(klass)) {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001715 cls = new (allocator_) HClinitCheck(constant, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001716 AppendInstruction(cls);
1717 }
1718
1719 uint16_t class_def_index = klass->GetDexClassDefIndex();
1720 if (is_put) {
1721 // We need to keep the class alive before loading the value.
1722 HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
1723 DCHECK_EQ(HPhi::ToPhiType(value->GetType()), HPhi::ToPhiType(field_type));
Vladimir Markoca6fff82017-10-03 14:49:14 +01001724 AppendInstruction(new (allocator_) HStaticFieldSet(cls,
1725 value,
1726 resolved_field,
1727 field_type,
1728 resolved_field->GetOffset(),
1729 resolved_field->IsVolatile(),
1730 field_index,
1731 class_def_index,
1732 *dex_file_,
1733 dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001734 } else {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001735 AppendInstruction(new (allocator_) HStaticFieldGet(cls,
1736 resolved_field,
1737 field_type,
1738 resolved_field->GetOffset(),
1739 resolved_field->IsVolatile(),
1740 field_index,
1741 class_def_index,
1742 *dex_file_,
1743 dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001744 UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
1745 }
David Brazdildee58d62016-04-07 09:54:26 +00001746}
1747
1748void HInstructionBuilder::BuildCheckedDivRem(uint16_t out_vreg,
Vladimir Markoca6fff82017-10-03 14:49:14 +01001749 uint16_t first_vreg,
1750 int64_t second_vreg_or_constant,
1751 uint32_t dex_pc,
1752 DataType::Type type,
1753 bool second_is_constant,
1754 bool isDiv) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001755 DCHECK(type == DataType::Type::kInt32 || type == DataType::Type::kInt64);
David Brazdildee58d62016-04-07 09:54:26 +00001756
1757 HInstruction* first = LoadLocal(first_vreg, type);
1758 HInstruction* second = nullptr;
1759 if (second_is_constant) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001760 if (type == DataType::Type::kInt32) {
David Brazdildee58d62016-04-07 09:54:26 +00001761 second = graph_->GetIntConstant(second_vreg_or_constant, dex_pc);
1762 } else {
1763 second = graph_->GetLongConstant(second_vreg_or_constant, dex_pc);
1764 }
1765 } else {
1766 second = LoadLocal(second_vreg_or_constant, type);
1767 }
1768
1769 if (!second_is_constant
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001770 || (type == DataType::Type::kInt32 && second->AsIntConstant()->GetValue() == 0)
1771 || (type == DataType::Type::kInt64 && second->AsLongConstant()->GetValue() == 0)) {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001772 second = new (allocator_) HDivZeroCheck(second, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001773 AppendInstruction(second);
1774 }
1775
1776 if (isDiv) {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001777 AppendInstruction(new (allocator_) HDiv(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001778 } else {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001779 AppendInstruction(new (allocator_) HRem(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001780 }
1781 UpdateLocal(out_vreg, current_block_->GetLastInstruction());
1782}
1783
1784void HInstructionBuilder::BuildArrayAccess(const Instruction& instruction,
1785 uint32_t dex_pc,
1786 bool is_put,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001787 DataType::Type anticipated_type) {
David Brazdildee58d62016-04-07 09:54:26 +00001788 uint8_t source_or_dest_reg = instruction.VRegA_23x();
1789 uint8_t array_reg = instruction.VRegB_23x();
1790 uint8_t index_reg = instruction.VRegC_23x();
1791
David Brazdilc120bbe2016-04-22 16:57:00 +01001792 HInstruction* object = LoadNullCheckedLocal(array_reg, dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001793 HInstruction* length = new (allocator_) HArrayLength(object, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001794 AppendInstruction(length);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001795 HInstruction* index = LoadLocal(index_reg, DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001796 index = new (allocator_) HBoundsCheck(index, length, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001797 AppendInstruction(index);
1798 if (is_put) {
1799 HInstruction* value = LoadLocal(source_or_dest_reg, anticipated_type);
1800 // TODO: Insert a type check node if the type is Object.
Vladimir Markoca6fff82017-10-03 14:49:14 +01001801 HArraySet* aset = new (allocator_) HArraySet(object, index, value, anticipated_type, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001802 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
1803 AppendInstruction(aset);
1804 } else {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001805 HArrayGet* aget = new (allocator_) HArrayGet(object, index, anticipated_type, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001806 ssa_builder_->MaybeAddAmbiguousArrayGet(aget);
1807 AppendInstruction(aget);
1808 UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
1809 }
1810 graph_->SetHasBoundsChecks(true);
1811}
1812
Vladimir Markob5461632018-10-15 14:24:21 +01001813HNewArray* HInstructionBuilder::BuildNewArray(uint32_t dex_pc,
1814 dex::TypeIndex type_index,
1815 HInstruction* length) {
1816 HLoadClass* cls = BuildLoadClass(type_index, dex_pc);
1817
1818 const char* descriptor = dex_file_->GetTypeDescriptor(dex_file_->GetTypeId(type_index));
1819 DCHECK_EQ(descriptor[0], '[');
1820 size_t component_type_shift = Primitive::ComponentSizeShift(Primitive::GetType(descriptor[1]));
1821
1822 HNewArray* new_array = new (allocator_) HNewArray(cls, length, dex_pc, component_type_shift);
1823 AppendInstruction(new_array);
1824 return new_array;
1825}
1826
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001827HNewArray* HInstructionBuilder::BuildFilledNewArray(uint32_t dex_pc,
1828 dex::TypeIndex type_index,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001829 const InstructionOperands& operands) {
1830 const size_t number_of_operands = operands.GetNumberOfOperands();
1831 HInstruction* length = graph_->GetIntConstant(number_of_operands, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001832
Vladimir Markob5461632018-10-15 14:24:21 +01001833 HNewArray* new_array = BuildNewArray(dex_pc, type_index, length);
David Brazdildee58d62016-04-07 09:54:26 +00001834 const char* descriptor = dex_file_->StringByTypeIdx(type_index);
1835 DCHECK_EQ(descriptor[0], '[') << descriptor;
1836 char primitive = descriptor[1];
1837 DCHECK(primitive == 'I'
1838 || primitive == 'L'
1839 || primitive == '[') << descriptor;
1840 bool is_reference_array = (primitive == 'L') || (primitive == '[');
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001841 DataType::Type type = is_reference_array ? DataType::Type::kReference : DataType::Type::kInt32;
David Brazdildee58d62016-04-07 09:54:26 +00001842
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001843 for (size_t i = 0; i < number_of_operands; ++i) {
1844 HInstruction* value = LoadLocal(operands.GetOperand(i), type);
David Brazdildee58d62016-04-07 09:54:26 +00001845 HInstruction* index = graph_->GetIntConstant(i, dex_pc);
Vladimir Markob5461632018-10-15 14:24:21 +01001846 HArraySet* aset = new (allocator_) HArraySet(new_array, index, value, type, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001847 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
1848 AppendInstruction(aset);
1849 }
Vladimir Markob5461632018-10-15 14:24:21 +01001850 latest_result_ = new_array;
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001851
Vladimir Markob5461632018-10-15 14:24:21 +01001852 return new_array;
David Brazdildee58d62016-04-07 09:54:26 +00001853}
1854
1855template <typename T>
1856void HInstructionBuilder::BuildFillArrayData(HInstruction* object,
1857 const T* data,
1858 uint32_t element_count,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001859 DataType::Type anticipated_type,
David Brazdildee58d62016-04-07 09:54:26 +00001860 uint32_t dex_pc) {
1861 for (uint32_t i = 0; i < element_count; ++i) {
1862 HInstruction* index = graph_->GetIntConstant(i, dex_pc);
1863 HInstruction* value = graph_->GetIntConstant(data[i], dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001864 HArraySet* aset = new (allocator_) HArraySet(object, index, value, anticipated_type, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001865 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
1866 AppendInstruction(aset);
1867 }
1868}
1869
1870void HInstructionBuilder::BuildFillArrayData(const Instruction& instruction, uint32_t dex_pc) {
David Brazdilc120bbe2016-04-22 16:57:00 +01001871 HInstruction* array = LoadNullCheckedLocal(instruction.VRegA_31t(), dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001872
1873 int32_t payload_offset = instruction.VRegB_31t() + dex_pc;
1874 const Instruction::ArrayDataPayload* payload =
Mathieu Chartier808c7a52017-12-15 11:19:33 -08001875 reinterpret_cast<const Instruction::ArrayDataPayload*>(
1876 code_item_accessor_.Insns() + payload_offset);
David Brazdildee58d62016-04-07 09:54:26 +00001877 const uint8_t* data = payload->data;
1878 uint32_t element_count = payload->element_count;
1879
Vladimir Markoc69fba22016-09-06 16:49:15 +01001880 if (element_count == 0u) {
1881 // For empty payload we emit only the null check above.
1882 return;
1883 }
1884
Vladimir Markoca6fff82017-10-03 14:49:14 +01001885 HInstruction* length = new (allocator_) HArrayLength(array, dex_pc);
Vladimir Markoc69fba22016-09-06 16:49:15 +01001886 AppendInstruction(length);
1887
David Brazdildee58d62016-04-07 09:54:26 +00001888 // Implementation of this DEX instruction seems to be that the bounds check is
1889 // done before doing any stores.
1890 HInstruction* last_index = graph_->GetIntConstant(payload->element_count - 1, dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001891 AppendInstruction(new (allocator_) HBoundsCheck(last_index, length, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001892
1893 switch (payload->element_width) {
1894 case 1:
David Brazdilc120bbe2016-04-22 16:57:00 +01001895 BuildFillArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00001896 reinterpret_cast<const int8_t*>(data),
1897 element_count,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001898 DataType::Type::kInt8,
David Brazdildee58d62016-04-07 09:54:26 +00001899 dex_pc);
1900 break;
1901 case 2:
David Brazdilc120bbe2016-04-22 16:57:00 +01001902 BuildFillArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00001903 reinterpret_cast<const int16_t*>(data),
1904 element_count,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001905 DataType::Type::kInt16,
David Brazdildee58d62016-04-07 09:54:26 +00001906 dex_pc);
1907 break;
1908 case 4:
David Brazdilc120bbe2016-04-22 16:57:00 +01001909 BuildFillArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00001910 reinterpret_cast<const int32_t*>(data),
1911 element_count,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001912 DataType::Type::kInt32,
David Brazdildee58d62016-04-07 09:54:26 +00001913 dex_pc);
1914 break;
1915 case 8:
David Brazdilc120bbe2016-04-22 16:57:00 +01001916 BuildFillWideArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00001917 reinterpret_cast<const int64_t*>(data),
1918 element_count,
1919 dex_pc);
1920 break;
1921 default:
1922 LOG(FATAL) << "Unknown element width for " << payload->element_width;
1923 }
1924 graph_->SetHasBoundsChecks(true);
1925}
1926
1927void HInstructionBuilder::BuildFillWideArrayData(HInstruction* object,
1928 const int64_t* data,
1929 uint32_t element_count,
1930 uint32_t dex_pc) {
1931 for (uint32_t i = 0; i < element_count; ++i) {
1932 HInstruction* index = graph_->GetIntConstant(i, dex_pc);
1933 HInstruction* value = graph_->GetLongConstant(data[i], dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001934 HArraySet* aset =
1935 new (allocator_) HArraySet(object, index, value, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001936 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
1937 AppendInstruction(aset);
1938 }
1939}
1940
Vladimir Marko28e012a2017-12-07 11:22:59 +00001941void HInstructionBuilder::BuildLoadString(dex::StringIndex string_index, uint32_t dex_pc) {
1942 HLoadString* load_string =
1943 new (allocator_) HLoadString(graph_->GetCurrentMethod(), string_index, *dex_file_, dex_pc);
1944 HSharpening::ProcessLoadString(load_string,
1945 code_generator_,
Vladimir Marko28e012a2017-12-07 11:22:59 +00001946 *dex_compilation_unit_,
1947 handles_);
1948 AppendInstruction(load_string);
1949}
1950
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001951HLoadClass* HInstructionBuilder::BuildLoadClass(dex::TypeIndex type_index, uint32_t dex_pc) {
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001952 ScopedObjectAccess soa(Thread::Current());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001953 const DexFile& dex_file = *dex_compilation_unit_->GetDexFile();
Vladimir Marko175e7862018-03-27 09:03:13 +00001954 Handle<mirror::Class> klass = ResolveClass(soa, type_index);
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001955 bool needs_access_check = LoadClassNeedsAccessCheck(klass);
1956 return BuildLoadClass(type_index, dex_file, klass, dex_pc, needs_access_check);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001957}
1958
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001959HLoadClass* HInstructionBuilder::BuildLoadClass(dex::TypeIndex type_index,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001960 const DexFile& dex_file,
1961 Handle<mirror::Class> klass,
1962 uint32_t dex_pc,
1963 bool needs_access_check) {
1964 // Try to find a reference in the compiling dex file.
1965 const DexFile* actual_dex_file = &dex_file;
1966 if (!IsSameDexFile(dex_file, *dex_compilation_unit_->GetDexFile())) {
1967 dex::TypeIndex local_type_index =
1968 klass->FindTypeIndexInOtherDexFile(*dex_compilation_unit_->GetDexFile());
1969 if (local_type_index.IsValid()) {
1970 type_index = local_type_index;
1971 actual_dex_file = dex_compilation_unit_->GetDexFile();
1972 }
1973 }
1974
1975 // Note: `klass` must be from `handles_`.
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001976 bool is_referrers_class =
1977 (klass != nullptr) && (outer_compilation_unit_->GetCompilingClass().Get() == klass.Get());
Vladimir Markoca6fff82017-10-03 14:49:14 +01001978 HLoadClass* load_class = new (allocator_) HLoadClass(
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001979 graph_->GetCurrentMethod(),
1980 type_index,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001981 *actual_dex_file,
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001982 klass,
Vladimir Markofca0b492018-07-23 15:30:52 +01001983 is_referrers_class,
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001984 dex_pc,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001985 needs_access_check);
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001986
Nicolas Geoffrayc4aa82c2017-03-06 14:38:52 +00001987 HLoadClass::LoadKind load_kind = HSharpening::ComputeLoadClassKind(load_class,
1988 code_generator_,
Nicolas Geoffrayc4aa82c2017-03-06 14:38:52 +00001989 *dex_compilation_unit_);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001990
1991 if (load_kind == HLoadClass::LoadKind::kInvalid) {
1992 // We actually cannot reference this class, we're forced to bail.
1993 return nullptr;
1994 }
Vladimir Marko28e012a2017-12-07 11:22:59 +00001995 // Load kind must be set before inserting the instruction into the graph.
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001996 load_class->SetLoadKind(load_kind);
Vladimir Marko28e012a2017-12-07 11:22:59 +00001997 AppendInstruction(load_class);
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001998 return load_class;
1999}
2000
Vladimir Marko175e7862018-03-27 09:03:13 +00002001Handle<mirror::Class> HInstructionBuilder::ResolveClass(ScopedObjectAccess& soa,
2002 dex::TypeIndex type_index) {
Vladimir Marko3b506202018-10-31 14:33:58 +00002003 auto it = class_cache_.find(type_index);
2004 if (it != class_cache_.end()) {
2005 return it->second;
2006 }
2007
2008 ObjPtr<mirror::Class> klass = dex_compilation_unit_->GetClassLinker()->ResolveType(
2009 type_index, dex_compilation_unit_->GetDexCache(), dex_compilation_unit_->GetClassLoader());
2010 DCHECK_EQ(klass == nullptr, soa.Self()->IsExceptionPending());
2011 soa.Self()->ClearException(); // Clean up the exception left by type resolution if any.
2012
2013 Handle<mirror::Class> h_klass = handles_->NewHandle(klass);
2014 class_cache_.Put(type_index, h_klass);
2015 return h_klass;
Vladimir Marko175e7862018-03-27 09:03:13 +00002016}
2017
Vladimir Markoa2c211c2018-11-01 09:50:52 +00002018bool HInstructionBuilder::LoadClassNeedsAccessCheck(Handle<mirror::Class> klass) {
Vladimir Marko175e7862018-03-27 09:03:13 +00002019 if (klass == nullptr) {
2020 return true;
2021 } else if (klass->IsPublic()) {
2022 return false;
2023 } else {
Vladimir Markoa2c211c2018-11-01 09:50:52 +00002024 ObjPtr<mirror::Class> compiling_class = dex_compilation_unit_->GetCompilingClass().Get();
Vladimir Marko175e7862018-03-27 09:03:13 +00002025 return compiling_class == nullptr || !compiling_class->CanAccess(klass.Get());
2026 }
2027}
2028
Orion Hodson06d10a72018-05-14 08:53:38 +01002029void HInstructionBuilder::BuildLoadMethodHandle(uint16_t method_handle_index, uint32_t dex_pc) {
Orion Hodsondbaa5c72018-05-10 08:22:46 +01002030 const DexFile& dex_file = *dex_compilation_unit_->GetDexFile();
Orion Hodson06d10a72018-05-14 08:53:38 +01002031 HLoadMethodHandle* load_method_handle = new (allocator_) HLoadMethodHandle(
2032 graph_->GetCurrentMethod(), method_handle_index, dex_file, dex_pc);
Orion Hodsondbaa5c72018-05-10 08:22:46 +01002033 AppendInstruction(load_method_handle);
2034}
2035
Orion Hodson06d10a72018-05-14 08:53:38 +01002036void HInstructionBuilder::BuildLoadMethodType(dex::ProtoIndex proto_index, uint32_t dex_pc) {
Orion Hodson18259d72018-04-12 11:18:23 +01002037 const DexFile& dex_file = *dex_compilation_unit_->GetDexFile();
2038 HLoadMethodType* load_method_type =
Orion Hodson06d10a72018-05-14 08:53:38 +01002039 new (allocator_) HLoadMethodType(graph_->GetCurrentMethod(), proto_index, dex_file, dex_pc);
Orion Hodson18259d72018-04-12 11:18:23 +01002040 AppendInstruction(load_method_type);
2041}
2042
David Brazdildee58d62016-04-07 09:54:26 +00002043void HInstructionBuilder::BuildTypeCheck(const Instruction& instruction,
2044 uint8_t destination,
2045 uint8_t reference,
Andreas Gampea5b09a62016-11-17 15:21:22 -08002046 dex::TypeIndex type_index,
David Brazdildee58d62016-04-07 09:54:26 +00002047 uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002048 HInstruction* object = LoadLocal(reference, DataType::Type::kReference);
David Brazdildee58d62016-04-07 09:54:26 +00002049
Nicolas Geoffray5247c082017-01-13 14:17:29 +00002050 ScopedObjectAccess soa(Thread::Current());
Vladimir Marko175e7862018-03-27 09:03:13 +00002051 const DexFile& dex_file = *dex_compilation_unit_->GetDexFile();
2052 Handle<mirror::Class> klass = ResolveClass(soa, type_index);
Vladimir Markoa2c211c2018-11-01 09:50:52 +00002053 bool needs_access_check = LoadClassNeedsAccessCheck(klass);
Vladimir Marko175e7862018-03-27 09:03:13 +00002054 TypeCheckKind check_kind = HSharpening::ComputeTypeCheckKind(
Vladimir Markodc4bcce2018-06-21 16:15:42 +01002055 klass.Get(), code_generator_, needs_access_check);
Vladimir Marko175e7862018-03-27 09:03:13 +00002056
2057 HInstruction* class_or_null = nullptr;
2058 HIntConstant* bitstring_path_to_root = nullptr;
2059 HIntConstant* bitstring_mask = nullptr;
2060 if (check_kind == TypeCheckKind::kBitstringCheck) {
2061 // TODO: Allow using the bitstring check also if we need an access check.
2062 DCHECK(!needs_access_check);
2063 class_or_null = graph_->GetNullConstant(dex_pc);
2064 MutexLock subtype_check_lock(Thread::Current(), *Locks::subtype_check_lock_);
2065 uint32_t path_to_root =
2066 SubtypeCheck<ObjPtr<mirror::Class>>::GetEncodedPathToRootForTarget(klass.Get());
2067 uint32_t mask = SubtypeCheck<ObjPtr<mirror::Class>>::GetEncodedPathToRootMask(klass.Get());
2068 bitstring_path_to_root = graph_->GetIntConstant(static_cast<int32_t>(path_to_root), dex_pc);
2069 bitstring_mask = graph_->GetIntConstant(static_cast<int32_t>(mask), dex_pc);
2070 } else {
Vladimir Markoa2c211c2018-11-01 09:50:52 +00002071 class_or_null = BuildLoadClass(type_index, dex_file, klass, dex_pc, needs_access_check);
Vladimir Marko175e7862018-03-27 09:03:13 +00002072 }
2073 DCHECK(class_or_null != nullptr);
2074
David Brazdildee58d62016-04-07 09:54:26 +00002075 if (instruction.Opcode() == Instruction::INSTANCE_OF) {
Vladimir Marko175e7862018-03-27 09:03:13 +00002076 AppendInstruction(new (allocator_) HInstanceOf(object,
2077 class_or_null,
2078 check_kind,
2079 klass,
2080 dex_pc,
2081 allocator_,
2082 bitstring_path_to_root,
2083 bitstring_mask));
David Brazdildee58d62016-04-07 09:54:26 +00002084 UpdateLocal(destination, current_block_->GetLastInstruction());
2085 } else {
2086 DCHECK_EQ(instruction.Opcode(), Instruction::CHECK_CAST);
2087 // We emit a CheckCast followed by a BoundType. CheckCast is a statement
2088 // which may throw. If it succeeds BoundType sets the new type of `object`
2089 // for all subsequent uses.
Vladimir Marko175e7862018-03-27 09:03:13 +00002090 AppendInstruction(
2091 new (allocator_) HCheckCast(object,
2092 class_or_null,
2093 check_kind,
2094 klass,
2095 dex_pc,
2096 allocator_,
2097 bitstring_path_to_root,
2098 bitstring_mask));
Vladimir Markoca6fff82017-10-03 14:49:14 +01002099 AppendInstruction(new (allocator_) HBoundType(object, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00002100 UpdateLocal(reference, current_block_->GetLastInstruction());
2101 }
2102}
2103
David Brazdildee58d62016-04-07 09:54:26 +00002104bool HInstructionBuilder::CanDecodeQuickenedInfo() const {
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002105 return !quicken_info_.IsNull();
David Brazdildee58d62016-04-07 09:54:26 +00002106}
2107
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002108uint16_t HInstructionBuilder::LookupQuickenedInfo(uint32_t quicken_index) {
2109 DCHECK(CanDecodeQuickenedInfo());
2110 return quicken_info_.GetData(quicken_index);
David Brazdildee58d62016-04-07 09:54:26 +00002111}
2112
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002113bool HInstructionBuilder::ProcessDexInstruction(const Instruction& instruction,
2114 uint32_t dex_pc,
2115 size_t quicken_index) {
David Brazdildee58d62016-04-07 09:54:26 +00002116 switch (instruction.Opcode()) {
2117 case Instruction::CONST_4: {
2118 int32_t register_index = instruction.VRegA();
2119 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_11n(), dex_pc);
2120 UpdateLocal(register_index, constant);
2121 break;
2122 }
2123
2124 case Instruction::CONST_16: {
2125 int32_t register_index = instruction.VRegA();
2126 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_21s(), dex_pc);
2127 UpdateLocal(register_index, constant);
2128 break;
2129 }
2130
2131 case Instruction::CONST: {
2132 int32_t register_index = instruction.VRegA();
2133 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_31i(), dex_pc);
2134 UpdateLocal(register_index, constant);
2135 break;
2136 }
2137
2138 case Instruction::CONST_HIGH16: {
2139 int32_t register_index = instruction.VRegA();
2140 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_21h() << 16, dex_pc);
2141 UpdateLocal(register_index, constant);
2142 break;
2143 }
2144
2145 case Instruction::CONST_WIDE_16: {
2146 int32_t register_index = instruction.VRegA();
2147 // Get 16 bits of constant value, sign extended to 64 bits.
2148 int64_t value = instruction.VRegB_21s();
2149 value <<= 48;
2150 value >>= 48;
2151 HLongConstant* constant = graph_->GetLongConstant(value, dex_pc);
2152 UpdateLocal(register_index, constant);
2153 break;
2154 }
2155
2156 case Instruction::CONST_WIDE_32: {
2157 int32_t register_index = instruction.VRegA();
2158 // Get 32 bits of constant value, sign extended to 64 bits.
2159 int64_t value = instruction.VRegB_31i();
2160 value <<= 32;
2161 value >>= 32;
2162 HLongConstant* constant = graph_->GetLongConstant(value, dex_pc);
2163 UpdateLocal(register_index, constant);
2164 break;
2165 }
2166
2167 case Instruction::CONST_WIDE: {
2168 int32_t register_index = instruction.VRegA();
2169 HLongConstant* constant = graph_->GetLongConstant(instruction.VRegB_51l(), dex_pc);
2170 UpdateLocal(register_index, constant);
2171 break;
2172 }
2173
2174 case Instruction::CONST_WIDE_HIGH16: {
2175 int32_t register_index = instruction.VRegA();
2176 int64_t value = static_cast<int64_t>(instruction.VRegB_21h()) << 48;
2177 HLongConstant* constant = graph_->GetLongConstant(value, dex_pc);
2178 UpdateLocal(register_index, constant);
2179 break;
2180 }
2181
2182 // Note that the SSA building will refine the types.
2183 case Instruction::MOVE:
2184 case Instruction::MOVE_FROM16:
2185 case Instruction::MOVE_16: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002186 HInstruction* value = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
David Brazdildee58d62016-04-07 09:54:26 +00002187 UpdateLocal(instruction.VRegA(), value);
2188 break;
2189 }
2190
2191 // Note that the SSA building will refine the types.
2192 case Instruction::MOVE_WIDE:
2193 case Instruction::MOVE_WIDE_FROM16:
2194 case Instruction::MOVE_WIDE_16: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002195 HInstruction* value = LoadLocal(instruction.VRegB(), DataType::Type::kInt64);
David Brazdildee58d62016-04-07 09:54:26 +00002196 UpdateLocal(instruction.VRegA(), value);
2197 break;
2198 }
2199
2200 case Instruction::MOVE_OBJECT:
2201 case Instruction::MOVE_OBJECT_16:
2202 case Instruction::MOVE_OBJECT_FROM16: {
Nicolas Geoffray50a9ed02016-09-23 15:40:41 +01002203 // The verifier has no notion of a null type, so a move-object of constant 0
2204 // will lead to the same constant 0 in the destination register. To mimic
2205 // this behavior, we just pretend we haven't seen a type change (int to reference)
2206 // for the 0 constant and phis. We rely on our type propagation to eventually get the
2207 // types correct.
2208 uint32_t reg_number = instruction.VRegB();
2209 HInstruction* value = (*current_locals_)[reg_number];
2210 if (value->IsIntConstant()) {
2211 DCHECK_EQ(value->AsIntConstant()->GetValue(), 0);
2212 } else if (value->IsPhi()) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002213 DCHECK(value->GetType() == DataType::Type::kInt32 ||
2214 value->GetType() == DataType::Type::kReference);
Nicolas Geoffray50a9ed02016-09-23 15:40:41 +01002215 } else {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002216 value = LoadLocal(reg_number, DataType::Type::kReference);
Nicolas Geoffray50a9ed02016-09-23 15:40:41 +01002217 }
David Brazdildee58d62016-04-07 09:54:26 +00002218 UpdateLocal(instruction.VRegA(), value);
2219 break;
2220 }
2221
2222 case Instruction::RETURN_VOID_NO_BARRIER:
2223 case Instruction::RETURN_VOID: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002224 BuildReturn(instruction, DataType::Type::kVoid, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002225 break;
2226 }
2227
2228#define IF_XX(comparison, cond) \
2229 case Instruction::IF_##cond: If_22t<comparison>(instruction, dex_pc); break; \
2230 case Instruction::IF_##cond##Z: If_21t<comparison>(instruction, dex_pc); break
2231
2232 IF_XX(HEqual, EQ);
2233 IF_XX(HNotEqual, NE);
2234 IF_XX(HLessThan, LT);
2235 IF_XX(HLessThanOrEqual, LE);
2236 IF_XX(HGreaterThan, GT);
2237 IF_XX(HGreaterThanOrEqual, GE);
2238
2239 case Instruction::GOTO:
2240 case Instruction::GOTO_16:
2241 case Instruction::GOTO_32: {
Vladimir Markoca6fff82017-10-03 14:49:14 +01002242 AppendInstruction(new (allocator_) HGoto(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00002243 current_block_ = nullptr;
2244 break;
2245 }
2246
2247 case Instruction::RETURN: {
2248 BuildReturn(instruction, return_type_, dex_pc);
2249 break;
2250 }
2251
2252 case Instruction::RETURN_OBJECT: {
2253 BuildReturn(instruction, return_type_, dex_pc);
2254 break;
2255 }
2256
2257 case Instruction::RETURN_WIDE: {
2258 BuildReturn(instruction, return_type_, dex_pc);
2259 break;
2260 }
2261
2262 case Instruction::INVOKE_DIRECT:
2263 case Instruction::INVOKE_INTERFACE:
2264 case Instruction::INVOKE_STATIC:
2265 case Instruction::INVOKE_SUPER:
2266 case Instruction::INVOKE_VIRTUAL:
2267 case Instruction::INVOKE_VIRTUAL_QUICK: {
2268 uint16_t method_idx;
2269 if (instruction.Opcode() == Instruction::INVOKE_VIRTUAL_QUICK) {
2270 if (!CanDecodeQuickenedInfo()) {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00002271 VLOG(compiler) << "Not compiled: Could not decode quickened instruction "
2272 << instruction.Opcode();
David Brazdildee58d62016-04-07 09:54:26 +00002273 return false;
2274 }
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002275 method_idx = LookupQuickenedInfo(quicken_index);
David Brazdildee58d62016-04-07 09:54:26 +00002276 } else {
2277 method_idx = instruction.VRegB_35c();
2278 }
David Brazdildee58d62016-04-07 09:54:26 +00002279 uint32_t args[5];
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002280 uint32_t number_of_vreg_arguments = instruction.GetVarArgs(args);
2281 VarArgsInstructionOperands operands(args, number_of_vreg_arguments);
2282 if (!BuildInvoke(instruction, dex_pc, method_idx, operands)) {
David Brazdildee58d62016-04-07 09:54:26 +00002283 return false;
2284 }
2285 break;
2286 }
2287
2288 case Instruction::INVOKE_DIRECT_RANGE:
2289 case Instruction::INVOKE_INTERFACE_RANGE:
2290 case Instruction::INVOKE_STATIC_RANGE:
2291 case Instruction::INVOKE_SUPER_RANGE:
2292 case Instruction::INVOKE_VIRTUAL_RANGE:
2293 case Instruction::INVOKE_VIRTUAL_RANGE_QUICK: {
2294 uint16_t method_idx;
2295 if (instruction.Opcode() == Instruction::INVOKE_VIRTUAL_RANGE_QUICK) {
2296 if (!CanDecodeQuickenedInfo()) {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00002297 VLOG(compiler) << "Not compiled: Could not decode quickened instruction "
2298 << instruction.Opcode();
David Brazdildee58d62016-04-07 09:54:26 +00002299 return false;
2300 }
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002301 method_idx = LookupQuickenedInfo(quicken_index);
David Brazdildee58d62016-04-07 09:54:26 +00002302 } else {
2303 method_idx = instruction.VRegB_3rc();
2304 }
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002305 RangeInstructionOperands operands(instruction.VRegC(), instruction.VRegA_3rc());
2306 if (!BuildInvoke(instruction, dex_pc, method_idx, operands)) {
David Brazdildee58d62016-04-07 09:54:26 +00002307 return false;
2308 }
2309 break;
2310 }
2311
Orion Hodsonac141392017-01-13 11:53:47 +00002312 case Instruction::INVOKE_POLYMORPHIC: {
2313 uint16_t method_idx = instruction.VRegB_45cc();
Orion Hodson06d10a72018-05-14 08:53:38 +01002314 dex::ProtoIndex proto_idx(instruction.VRegH_45cc());
Orion Hodsonac141392017-01-13 11:53:47 +00002315 uint32_t args[5];
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002316 uint32_t number_of_vreg_arguments = instruction.GetVarArgs(args);
2317 VarArgsInstructionOperands operands(args, number_of_vreg_arguments);
Orion Hodson4c8e12e2018-05-18 08:33:20 +01002318 return BuildInvokePolymorphic(dex_pc, method_idx, proto_idx, operands);
Orion Hodsonac141392017-01-13 11:53:47 +00002319 }
2320
2321 case Instruction::INVOKE_POLYMORPHIC_RANGE: {
2322 uint16_t method_idx = instruction.VRegB_4rcc();
Orion Hodson06d10a72018-05-14 08:53:38 +01002323 dex::ProtoIndex proto_idx(instruction.VRegH_4rcc());
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002324 RangeInstructionOperands operands(instruction.VRegC_4rcc(), instruction.VRegA_4rcc());
Orion Hodson4c8e12e2018-05-18 08:33:20 +01002325 return BuildInvokePolymorphic(dex_pc, method_idx, proto_idx, operands);
2326 }
2327
2328 case Instruction::INVOKE_CUSTOM: {
2329 uint16_t call_site_idx = instruction.VRegB_35c();
2330 uint32_t args[5];
2331 uint32_t number_of_vreg_arguments = instruction.GetVarArgs(args);
2332 VarArgsInstructionOperands operands(args, number_of_vreg_arguments);
2333 return BuildInvokeCustom(dex_pc, call_site_idx, operands);
2334 }
2335
2336 case Instruction::INVOKE_CUSTOM_RANGE: {
2337 uint16_t call_site_idx = instruction.VRegB_3rc();
2338 RangeInstructionOperands operands(instruction.VRegC_3rc(), instruction.VRegA_3rc());
2339 return BuildInvokeCustom(dex_pc, call_site_idx, operands);
Orion Hodsonac141392017-01-13 11:53:47 +00002340 }
2341
David Brazdildee58d62016-04-07 09:54:26 +00002342 case Instruction::NEG_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002343 Unop_12x<HNeg>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002344 break;
2345 }
2346
2347 case Instruction::NEG_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002348 Unop_12x<HNeg>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002349 break;
2350 }
2351
2352 case Instruction::NEG_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002353 Unop_12x<HNeg>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002354 break;
2355 }
2356
2357 case Instruction::NEG_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002358 Unop_12x<HNeg>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002359 break;
2360 }
2361
2362 case Instruction::NOT_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002363 Unop_12x<HNot>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002364 break;
2365 }
2366
2367 case Instruction::NOT_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002368 Unop_12x<HNot>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002369 break;
2370 }
2371
2372 case Instruction::INT_TO_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002373 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002374 break;
2375 }
2376
2377 case Instruction::INT_TO_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002378 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002379 break;
2380 }
2381
2382 case Instruction::INT_TO_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002383 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002384 break;
2385 }
2386
2387 case Instruction::LONG_TO_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002388 Conversion_12x(instruction, DataType::Type::kInt64, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002389 break;
2390 }
2391
2392 case Instruction::LONG_TO_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002393 Conversion_12x(instruction, DataType::Type::kInt64, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002394 break;
2395 }
2396
2397 case Instruction::LONG_TO_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002398 Conversion_12x(instruction, DataType::Type::kInt64, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002399 break;
2400 }
2401
2402 case Instruction::FLOAT_TO_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002403 Conversion_12x(instruction, DataType::Type::kFloat32, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002404 break;
2405 }
2406
2407 case Instruction::FLOAT_TO_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002408 Conversion_12x(instruction, DataType::Type::kFloat32, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002409 break;
2410 }
2411
2412 case Instruction::FLOAT_TO_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002413 Conversion_12x(instruction, DataType::Type::kFloat32, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002414 break;
2415 }
2416
2417 case Instruction::DOUBLE_TO_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002418 Conversion_12x(instruction, DataType::Type::kFloat64, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002419 break;
2420 }
2421
2422 case Instruction::DOUBLE_TO_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002423 Conversion_12x(instruction, DataType::Type::kFloat64, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002424 break;
2425 }
2426
2427 case Instruction::DOUBLE_TO_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002428 Conversion_12x(instruction, DataType::Type::kFloat64, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002429 break;
2430 }
2431
2432 case Instruction::INT_TO_BYTE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002433 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kInt8, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002434 break;
2435 }
2436
2437 case Instruction::INT_TO_SHORT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002438 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kInt16, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002439 break;
2440 }
2441
2442 case Instruction::INT_TO_CHAR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002443 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kUint16, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002444 break;
2445 }
2446
2447 case Instruction::ADD_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002448 Binop_23x<HAdd>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002449 break;
2450 }
2451
2452 case Instruction::ADD_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002453 Binop_23x<HAdd>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002454 break;
2455 }
2456
2457 case Instruction::ADD_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002458 Binop_23x<HAdd>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002459 break;
2460 }
2461
2462 case Instruction::ADD_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002463 Binop_23x<HAdd>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002464 break;
2465 }
2466
2467 case Instruction::SUB_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002468 Binop_23x<HSub>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002469 break;
2470 }
2471
2472 case Instruction::SUB_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002473 Binop_23x<HSub>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002474 break;
2475 }
2476
2477 case Instruction::SUB_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002478 Binop_23x<HSub>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002479 break;
2480 }
2481
2482 case Instruction::SUB_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002483 Binop_23x<HSub>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002484 break;
2485 }
2486
2487 case Instruction::ADD_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002488 Binop_12x<HAdd>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002489 break;
2490 }
2491
2492 case Instruction::MUL_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002493 Binop_23x<HMul>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002494 break;
2495 }
2496
2497 case Instruction::MUL_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002498 Binop_23x<HMul>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002499 break;
2500 }
2501
2502 case Instruction::MUL_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002503 Binop_23x<HMul>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002504 break;
2505 }
2506
2507 case Instruction::MUL_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002508 Binop_23x<HMul>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002509 break;
2510 }
2511
2512 case Instruction::DIV_INT: {
2513 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002514 dex_pc, DataType::Type::kInt32, false, true);
David Brazdildee58d62016-04-07 09:54:26 +00002515 break;
2516 }
2517
2518 case Instruction::DIV_LONG: {
2519 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002520 dex_pc, DataType::Type::kInt64, false, true);
David Brazdildee58d62016-04-07 09:54:26 +00002521 break;
2522 }
2523
2524 case Instruction::DIV_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002525 Binop_23x<HDiv>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002526 break;
2527 }
2528
2529 case Instruction::DIV_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002530 Binop_23x<HDiv>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002531 break;
2532 }
2533
2534 case Instruction::REM_INT: {
2535 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002536 dex_pc, DataType::Type::kInt32, false, false);
David Brazdildee58d62016-04-07 09:54:26 +00002537 break;
2538 }
2539
2540 case Instruction::REM_LONG: {
2541 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002542 dex_pc, DataType::Type::kInt64, false, false);
David Brazdildee58d62016-04-07 09:54:26 +00002543 break;
2544 }
2545
2546 case Instruction::REM_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002547 Binop_23x<HRem>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002548 break;
2549 }
2550
2551 case Instruction::REM_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002552 Binop_23x<HRem>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002553 break;
2554 }
2555
2556 case Instruction::AND_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002557 Binop_23x<HAnd>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002558 break;
2559 }
2560
2561 case Instruction::AND_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002562 Binop_23x<HAnd>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002563 break;
2564 }
2565
2566 case Instruction::SHL_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002567 Binop_23x_shift<HShl>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002568 break;
2569 }
2570
2571 case Instruction::SHL_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002572 Binop_23x_shift<HShl>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002573 break;
2574 }
2575
2576 case Instruction::SHR_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002577 Binop_23x_shift<HShr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002578 break;
2579 }
2580
2581 case Instruction::SHR_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002582 Binop_23x_shift<HShr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002583 break;
2584 }
2585
2586 case Instruction::USHR_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002587 Binop_23x_shift<HUShr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002588 break;
2589 }
2590
2591 case Instruction::USHR_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002592 Binop_23x_shift<HUShr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002593 break;
2594 }
2595
2596 case Instruction::OR_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002597 Binop_23x<HOr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002598 break;
2599 }
2600
2601 case Instruction::OR_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002602 Binop_23x<HOr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002603 break;
2604 }
2605
2606 case Instruction::XOR_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002607 Binop_23x<HXor>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002608 break;
2609 }
2610
2611 case Instruction::XOR_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002612 Binop_23x<HXor>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002613 break;
2614 }
2615
2616 case Instruction::ADD_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002617 Binop_12x<HAdd>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002618 break;
2619 }
2620
2621 case Instruction::ADD_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002622 Binop_12x<HAdd>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002623 break;
2624 }
2625
2626 case Instruction::ADD_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002627 Binop_12x<HAdd>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002628 break;
2629 }
2630
2631 case Instruction::SUB_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002632 Binop_12x<HSub>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002633 break;
2634 }
2635
2636 case Instruction::SUB_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002637 Binop_12x<HSub>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002638 break;
2639 }
2640
2641 case Instruction::SUB_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002642 Binop_12x<HSub>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002643 break;
2644 }
2645
2646 case Instruction::SUB_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002647 Binop_12x<HSub>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002648 break;
2649 }
2650
2651 case Instruction::MUL_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002652 Binop_12x<HMul>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002653 break;
2654 }
2655
2656 case Instruction::MUL_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002657 Binop_12x<HMul>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002658 break;
2659 }
2660
2661 case Instruction::MUL_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002662 Binop_12x<HMul>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002663 break;
2664 }
2665
2666 case Instruction::MUL_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002667 Binop_12x<HMul>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002668 break;
2669 }
2670
2671 case Instruction::DIV_INT_2ADDR: {
2672 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002673 dex_pc, DataType::Type::kInt32, false, true);
David Brazdildee58d62016-04-07 09:54:26 +00002674 break;
2675 }
2676
2677 case Instruction::DIV_LONG_2ADDR: {
2678 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002679 dex_pc, DataType::Type::kInt64, false, true);
David Brazdildee58d62016-04-07 09:54:26 +00002680 break;
2681 }
2682
2683 case Instruction::REM_INT_2ADDR: {
2684 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002685 dex_pc, DataType::Type::kInt32, false, false);
David Brazdildee58d62016-04-07 09:54:26 +00002686 break;
2687 }
2688
2689 case Instruction::REM_LONG_2ADDR: {
2690 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002691 dex_pc, DataType::Type::kInt64, false, false);
David Brazdildee58d62016-04-07 09:54:26 +00002692 break;
2693 }
2694
2695 case Instruction::REM_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002696 Binop_12x<HRem>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002697 break;
2698 }
2699
2700 case Instruction::REM_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002701 Binop_12x<HRem>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002702 break;
2703 }
2704
2705 case Instruction::SHL_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002706 Binop_12x_shift<HShl>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002707 break;
2708 }
2709
2710 case Instruction::SHL_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002711 Binop_12x_shift<HShl>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002712 break;
2713 }
2714
2715 case Instruction::SHR_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002716 Binop_12x_shift<HShr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002717 break;
2718 }
2719
2720 case Instruction::SHR_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002721 Binop_12x_shift<HShr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002722 break;
2723 }
2724
2725 case Instruction::USHR_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002726 Binop_12x_shift<HUShr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002727 break;
2728 }
2729
2730 case Instruction::USHR_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002731 Binop_12x_shift<HUShr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002732 break;
2733 }
2734
2735 case Instruction::DIV_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002736 Binop_12x<HDiv>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002737 break;
2738 }
2739
2740 case Instruction::DIV_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002741 Binop_12x<HDiv>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002742 break;
2743 }
2744
2745 case Instruction::AND_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002746 Binop_12x<HAnd>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002747 break;
2748 }
2749
2750 case Instruction::AND_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002751 Binop_12x<HAnd>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002752 break;
2753 }
2754
2755 case Instruction::OR_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002756 Binop_12x<HOr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002757 break;
2758 }
2759
2760 case Instruction::OR_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002761 Binop_12x<HOr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002762 break;
2763 }
2764
2765 case Instruction::XOR_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002766 Binop_12x<HXor>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002767 break;
2768 }
2769
2770 case Instruction::XOR_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002771 Binop_12x<HXor>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002772 break;
2773 }
2774
2775 case Instruction::ADD_INT_LIT16: {
2776 Binop_22s<HAdd>(instruction, false, dex_pc);
2777 break;
2778 }
2779
2780 case Instruction::AND_INT_LIT16: {
2781 Binop_22s<HAnd>(instruction, false, dex_pc);
2782 break;
2783 }
2784
2785 case Instruction::OR_INT_LIT16: {
2786 Binop_22s<HOr>(instruction, false, dex_pc);
2787 break;
2788 }
2789
2790 case Instruction::XOR_INT_LIT16: {
2791 Binop_22s<HXor>(instruction, false, dex_pc);
2792 break;
2793 }
2794
2795 case Instruction::RSUB_INT: {
2796 Binop_22s<HSub>(instruction, true, dex_pc);
2797 break;
2798 }
2799
2800 case Instruction::MUL_INT_LIT16: {
2801 Binop_22s<HMul>(instruction, false, dex_pc);
2802 break;
2803 }
2804
2805 case Instruction::ADD_INT_LIT8: {
2806 Binop_22b<HAdd>(instruction, false, dex_pc);
2807 break;
2808 }
2809
2810 case Instruction::AND_INT_LIT8: {
2811 Binop_22b<HAnd>(instruction, false, dex_pc);
2812 break;
2813 }
2814
2815 case Instruction::OR_INT_LIT8: {
2816 Binop_22b<HOr>(instruction, false, dex_pc);
2817 break;
2818 }
2819
2820 case Instruction::XOR_INT_LIT8: {
2821 Binop_22b<HXor>(instruction, false, dex_pc);
2822 break;
2823 }
2824
2825 case Instruction::RSUB_INT_LIT8: {
2826 Binop_22b<HSub>(instruction, true, dex_pc);
2827 break;
2828 }
2829
2830 case Instruction::MUL_INT_LIT8: {
2831 Binop_22b<HMul>(instruction, false, dex_pc);
2832 break;
2833 }
2834
2835 case Instruction::DIV_INT_LIT16:
2836 case Instruction::DIV_INT_LIT8: {
2837 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002838 dex_pc, DataType::Type::kInt32, true, true);
David Brazdildee58d62016-04-07 09:54:26 +00002839 break;
2840 }
2841
2842 case Instruction::REM_INT_LIT16:
2843 case Instruction::REM_INT_LIT8: {
2844 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002845 dex_pc, DataType::Type::kInt32, true, false);
David Brazdildee58d62016-04-07 09:54:26 +00002846 break;
2847 }
2848
2849 case Instruction::SHL_INT_LIT8: {
2850 Binop_22b<HShl>(instruction, false, dex_pc);
2851 break;
2852 }
2853
2854 case Instruction::SHR_INT_LIT8: {
2855 Binop_22b<HShr>(instruction, false, dex_pc);
2856 break;
2857 }
2858
2859 case Instruction::USHR_INT_LIT8: {
2860 Binop_22b<HUShr>(instruction, false, dex_pc);
2861 break;
2862 }
2863
2864 case Instruction::NEW_INSTANCE: {
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002865 HNewInstance* new_instance =
2866 BuildNewInstance(dex::TypeIndex(instruction.VRegB_21c()), dex_pc);
2867 DCHECK(new_instance != nullptr);
2868
David Brazdildee58d62016-04-07 09:54:26 +00002869 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002870 BuildConstructorFenceForAllocation(new_instance);
David Brazdildee58d62016-04-07 09:54:26 +00002871 break;
2872 }
2873
2874 case Instruction::NEW_ARRAY: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08002875 dex::TypeIndex type_index(instruction.VRegC_22c());
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002876 HInstruction* length = LoadLocal(instruction.VRegB_22c(), DataType::Type::kInt32);
Vladimir Markob5461632018-10-15 14:24:21 +01002877 HNewArray* new_array = BuildNewArray(dex_pc, type_index, length);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002878
David Brazdildee58d62016-04-07 09:54:26 +00002879 UpdateLocal(instruction.VRegA_22c(), current_block_->GetLastInstruction());
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002880 BuildConstructorFenceForAllocation(new_array);
David Brazdildee58d62016-04-07 09:54:26 +00002881 break;
2882 }
2883
2884 case Instruction::FILLED_NEW_ARRAY: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08002885 dex::TypeIndex type_index(instruction.VRegB_35c());
David Brazdildee58d62016-04-07 09:54:26 +00002886 uint32_t args[5];
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002887 uint32_t number_of_vreg_arguments = instruction.GetVarArgs(args);
2888 VarArgsInstructionOperands operands(args, number_of_vreg_arguments);
2889 HNewArray* new_array = BuildFilledNewArray(dex_pc, type_index, operands);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002890 BuildConstructorFenceForAllocation(new_array);
David Brazdildee58d62016-04-07 09:54:26 +00002891 break;
2892 }
2893
2894 case Instruction::FILLED_NEW_ARRAY_RANGE: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08002895 dex::TypeIndex type_index(instruction.VRegB_3rc());
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002896 RangeInstructionOperands operands(instruction.VRegC_3rc(), instruction.VRegA_3rc());
2897 HNewArray* new_array = BuildFilledNewArray(dex_pc, type_index, operands);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002898 BuildConstructorFenceForAllocation(new_array);
David Brazdildee58d62016-04-07 09:54:26 +00002899 break;
2900 }
2901
2902 case Instruction::FILL_ARRAY_DATA: {
2903 BuildFillArrayData(instruction, dex_pc);
2904 break;
2905 }
2906
2907 case Instruction::MOVE_RESULT:
2908 case Instruction::MOVE_RESULT_WIDE:
2909 case Instruction::MOVE_RESULT_OBJECT: {
2910 DCHECK(latest_result_ != nullptr);
2911 UpdateLocal(instruction.VRegA(), latest_result_);
2912 latest_result_ = nullptr;
2913 break;
2914 }
2915
2916 case Instruction::CMP_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002917 Binop_23x_cmp(instruction, DataType::Type::kInt64, ComparisonBias::kNoBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002918 break;
2919 }
2920
2921 case Instruction::CMPG_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002922 Binop_23x_cmp(instruction, DataType::Type::kFloat32, ComparisonBias::kGtBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002923 break;
2924 }
2925
2926 case Instruction::CMPG_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002927 Binop_23x_cmp(instruction, DataType::Type::kFloat64, ComparisonBias::kGtBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002928 break;
2929 }
2930
2931 case Instruction::CMPL_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002932 Binop_23x_cmp(instruction, DataType::Type::kFloat32, ComparisonBias::kLtBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002933 break;
2934 }
2935
2936 case Instruction::CMPL_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002937 Binop_23x_cmp(instruction, DataType::Type::kFloat64, ComparisonBias::kLtBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002938 break;
2939 }
2940
2941 case Instruction::NOP:
2942 break;
2943
2944 case Instruction::IGET:
2945 case Instruction::IGET_QUICK:
2946 case Instruction::IGET_WIDE:
2947 case Instruction::IGET_WIDE_QUICK:
2948 case Instruction::IGET_OBJECT:
2949 case Instruction::IGET_OBJECT_QUICK:
2950 case Instruction::IGET_BOOLEAN:
2951 case Instruction::IGET_BOOLEAN_QUICK:
2952 case Instruction::IGET_BYTE:
2953 case Instruction::IGET_BYTE_QUICK:
2954 case Instruction::IGET_CHAR:
2955 case Instruction::IGET_CHAR_QUICK:
2956 case Instruction::IGET_SHORT:
2957 case Instruction::IGET_SHORT_QUICK: {
Andreas Gampe3db70682018-12-26 15:12:03 -08002958 if (!BuildInstanceFieldAccess(instruction, dex_pc, /* is_put= */ false, quicken_index)) {
David Brazdildee58d62016-04-07 09:54:26 +00002959 return false;
2960 }
2961 break;
2962 }
2963
2964 case Instruction::IPUT:
2965 case Instruction::IPUT_QUICK:
2966 case Instruction::IPUT_WIDE:
2967 case Instruction::IPUT_WIDE_QUICK:
2968 case Instruction::IPUT_OBJECT:
2969 case Instruction::IPUT_OBJECT_QUICK:
2970 case Instruction::IPUT_BOOLEAN:
2971 case Instruction::IPUT_BOOLEAN_QUICK:
2972 case Instruction::IPUT_BYTE:
2973 case Instruction::IPUT_BYTE_QUICK:
2974 case Instruction::IPUT_CHAR:
2975 case Instruction::IPUT_CHAR_QUICK:
2976 case Instruction::IPUT_SHORT:
2977 case Instruction::IPUT_SHORT_QUICK: {
Andreas Gampe3db70682018-12-26 15:12:03 -08002978 if (!BuildInstanceFieldAccess(instruction, dex_pc, /* is_put= */ true, quicken_index)) {
David Brazdildee58d62016-04-07 09:54:26 +00002979 return false;
2980 }
2981 break;
2982 }
2983
2984 case Instruction::SGET:
2985 case Instruction::SGET_WIDE:
2986 case Instruction::SGET_OBJECT:
2987 case Instruction::SGET_BOOLEAN:
2988 case Instruction::SGET_BYTE:
2989 case Instruction::SGET_CHAR:
2990 case Instruction::SGET_SHORT: {
Andreas Gampe3db70682018-12-26 15:12:03 -08002991 BuildStaticFieldAccess(instruction, dex_pc, /* is_put= */ false);
David Brazdildee58d62016-04-07 09:54:26 +00002992 break;
2993 }
2994
2995 case Instruction::SPUT:
2996 case Instruction::SPUT_WIDE:
2997 case Instruction::SPUT_OBJECT:
2998 case Instruction::SPUT_BOOLEAN:
2999 case Instruction::SPUT_BYTE:
3000 case Instruction::SPUT_CHAR:
3001 case Instruction::SPUT_SHORT: {
Andreas Gampe3db70682018-12-26 15:12:03 -08003002 BuildStaticFieldAccess(instruction, dex_pc, /* is_put= */ true);
David Brazdildee58d62016-04-07 09:54:26 +00003003 break;
3004 }
3005
3006#define ARRAY_XX(kind, anticipated_type) \
3007 case Instruction::AGET##kind: { \
3008 BuildArrayAccess(instruction, dex_pc, false, anticipated_type); \
3009 break; \
3010 } \
3011 case Instruction::APUT##kind: { \
3012 BuildArrayAccess(instruction, dex_pc, true, anticipated_type); \
3013 break; \
3014 }
3015
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003016 ARRAY_XX(, DataType::Type::kInt32);
3017 ARRAY_XX(_WIDE, DataType::Type::kInt64);
3018 ARRAY_XX(_OBJECT, DataType::Type::kReference);
3019 ARRAY_XX(_BOOLEAN, DataType::Type::kBool);
3020 ARRAY_XX(_BYTE, DataType::Type::kInt8);
3021 ARRAY_XX(_CHAR, DataType::Type::kUint16);
3022 ARRAY_XX(_SHORT, DataType::Type::kInt16);
David Brazdildee58d62016-04-07 09:54:26 +00003023
3024 case Instruction::ARRAY_LENGTH: {
David Brazdilc120bbe2016-04-22 16:57:00 +01003025 HInstruction* object = LoadNullCheckedLocal(instruction.VRegB_12x(), dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01003026 AppendInstruction(new (allocator_) HArrayLength(object, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00003027 UpdateLocal(instruction.VRegA_12x(), current_block_->GetLastInstruction());
3028 break;
3029 }
3030
3031 case Instruction::CONST_STRING: {
Andreas Gampe8a0128a2016-11-28 07:38:35 -08003032 dex::StringIndex string_index(instruction.VRegB_21c());
Vladimir Marko28e012a2017-12-07 11:22:59 +00003033 BuildLoadString(string_index, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003034 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
3035 break;
3036 }
3037
3038 case Instruction::CONST_STRING_JUMBO: {
Andreas Gampe8a0128a2016-11-28 07:38:35 -08003039 dex::StringIndex string_index(instruction.VRegB_31c());
Vladimir Marko28e012a2017-12-07 11:22:59 +00003040 BuildLoadString(string_index, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003041 UpdateLocal(instruction.VRegA_31c(), current_block_->GetLastInstruction());
3042 break;
3043 }
3044
3045 case Instruction::CONST_CLASS: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08003046 dex::TypeIndex type_index(instruction.VRegB_21c());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00003047 BuildLoadClass(type_index, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003048 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
3049 break;
3050 }
3051
Orion Hodsondbaa5c72018-05-10 08:22:46 +01003052 case Instruction::CONST_METHOD_HANDLE: {
3053 uint16_t method_handle_idx = instruction.VRegB_21c();
3054 BuildLoadMethodHandle(method_handle_idx, dex_pc);
3055 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
3056 break;
3057 }
3058
Orion Hodson18259d72018-04-12 11:18:23 +01003059 case Instruction::CONST_METHOD_TYPE: {
Orion Hodson06d10a72018-05-14 08:53:38 +01003060 dex::ProtoIndex proto_idx(instruction.VRegB_21c());
Orion Hodson18259d72018-04-12 11:18:23 +01003061 BuildLoadMethodType(proto_idx, dex_pc);
3062 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
3063 break;
3064 }
3065
David Brazdildee58d62016-04-07 09:54:26 +00003066 case Instruction::MOVE_EXCEPTION: {
Vladimir Markoca6fff82017-10-03 14:49:14 +01003067 AppendInstruction(new (allocator_) HLoadException(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00003068 UpdateLocal(instruction.VRegA_11x(), current_block_->GetLastInstruction());
Vladimir Markoca6fff82017-10-03 14:49:14 +01003069 AppendInstruction(new (allocator_) HClearException(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00003070 break;
3071 }
3072
3073 case Instruction::THROW: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003074 HInstruction* exception = LoadLocal(instruction.VRegA_11x(), DataType::Type::kReference);
Vladimir Markoca6fff82017-10-03 14:49:14 +01003075 AppendInstruction(new (allocator_) HThrow(exception, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00003076 // We finished building this block. Set the current block to null to avoid
3077 // adding dead instructions to it.
3078 current_block_ = nullptr;
3079 break;
3080 }
3081
3082 case Instruction::INSTANCE_OF: {
3083 uint8_t destination = instruction.VRegA_22c();
3084 uint8_t reference = instruction.VRegB_22c();
Andreas Gampea5b09a62016-11-17 15:21:22 -08003085 dex::TypeIndex type_index(instruction.VRegC_22c());
David Brazdildee58d62016-04-07 09:54:26 +00003086 BuildTypeCheck(instruction, destination, reference, type_index, dex_pc);
3087 break;
3088 }
3089
3090 case Instruction::CHECK_CAST: {
3091 uint8_t reference = instruction.VRegA_21c();
Andreas Gampea5b09a62016-11-17 15:21:22 -08003092 dex::TypeIndex type_index(instruction.VRegB_21c());
David Brazdildee58d62016-04-07 09:54:26 +00003093 BuildTypeCheck(instruction, -1, reference, type_index, dex_pc);
3094 break;
3095 }
3096
3097 case Instruction::MONITOR_ENTER: {
Vladimir Markoca6fff82017-10-03 14:49:14 +01003098 AppendInstruction(new (allocator_) HMonitorOperation(
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003099 LoadLocal(instruction.VRegA_11x(), DataType::Type::kReference),
David Brazdildee58d62016-04-07 09:54:26 +00003100 HMonitorOperation::OperationKind::kEnter,
3101 dex_pc));
Artem Serov2808be82018-12-20 19:15:11 +00003102 graph_->SetHasMonitorOperations(true);
David Brazdildee58d62016-04-07 09:54:26 +00003103 break;
3104 }
3105
3106 case Instruction::MONITOR_EXIT: {
Vladimir Markoca6fff82017-10-03 14:49:14 +01003107 AppendInstruction(new (allocator_) HMonitorOperation(
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003108 LoadLocal(instruction.VRegA_11x(), DataType::Type::kReference),
David Brazdildee58d62016-04-07 09:54:26 +00003109 HMonitorOperation::OperationKind::kExit,
3110 dex_pc));
Artem Serov2808be82018-12-20 19:15:11 +00003111 graph_->SetHasMonitorOperations(true);
David Brazdildee58d62016-04-07 09:54:26 +00003112 break;
3113 }
3114
3115 case Instruction::SPARSE_SWITCH:
3116 case Instruction::PACKED_SWITCH: {
3117 BuildSwitch(instruction, dex_pc);
3118 break;
3119 }
3120
Orion Hodson4c8e12e2018-05-18 08:33:20 +01003121 case Instruction::UNUSED_3E:
3122 case Instruction::UNUSED_3F:
3123 case Instruction::UNUSED_40:
3124 case Instruction::UNUSED_41:
3125 case Instruction::UNUSED_42:
3126 case Instruction::UNUSED_43:
3127 case Instruction::UNUSED_79:
3128 case Instruction::UNUSED_7A:
3129 case Instruction::UNUSED_F3:
3130 case Instruction::UNUSED_F4:
3131 case Instruction::UNUSED_F5:
3132 case Instruction::UNUSED_F6:
3133 case Instruction::UNUSED_F7:
3134 case Instruction::UNUSED_F8:
3135 case Instruction::UNUSED_F9: {
David Brazdildee58d62016-04-07 09:54:26 +00003136 VLOG(compiler) << "Did not compile "
David Sehr709b0702016-10-13 09:12:37 -07003137 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
David Brazdildee58d62016-04-07 09:54:26 +00003138 << " because of unhandled instruction "
3139 << instruction.Name();
Igor Murashkin1e065a52017-08-09 13:20:34 -07003140 MaybeRecordStat(compilation_stats_,
3141 MethodCompilationStat::kNotCompiledUnhandledInstruction);
David Brazdildee58d62016-04-07 09:54:26 +00003142 return false;
Orion Hodson4c8e12e2018-05-18 08:33:20 +01003143 }
David Brazdildee58d62016-04-07 09:54:26 +00003144 }
3145 return true;
3146} // NOLINT(readability/fn_size)
3147
Vladimir Marko8d6768d2017-03-14 10:13:21 +00003148ObjPtr<mirror::Class> HInstructionBuilder::LookupResolvedType(
3149 dex::TypeIndex type_index,
3150 const DexCompilationUnit& compilation_unit) const {
Vladimir Marko666ee3d2017-12-11 18:37:36 +00003151 return compilation_unit.GetClassLinker()->LookupResolvedType(
Vladimir Marko8d6768d2017-03-14 10:13:21 +00003152 type_index, compilation_unit.GetDexCache().Get(), compilation_unit.GetClassLoader().Get());
3153}
3154
3155ObjPtr<mirror::Class> HInstructionBuilder::LookupReferrerClass() const {
3156 // TODO: Cache the result in a Handle<mirror::Class>.
Andreas Gampe3f1dcd32018-12-28 09:39:56 -08003157 const dex::MethodId& method_id =
Vladimir Marko8d6768d2017-03-14 10:13:21 +00003158 dex_compilation_unit_->GetDexFile()->GetMethodId(dex_compilation_unit_->GetDexMethodIndex());
3159 return LookupResolvedType(method_id.class_idx_, *dex_compilation_unit_);
3160}
3161
David Brazdildee58d62016-04-07 09:54:26 +00003162} // namespace art