blob: 3747d8224b1346a4e5a7a910ee4b79fafb06323a [file] [log] [blame]
David Brazdildee58d62016-04-07 09:54:26 +00001/*
2 * Copyright (C) 2016 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17#include "instruction_builder.h"
18
Matthew Gharrity465ecc82016-07-19 21:32:52 +000019#include "art_method-inl.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010020#include "base/arena_bit_vector.h"
21#include "base/bit_vector-inl.h"
22#include "block_builder.h"
David Brazdildee58d62016-04-07 09:54:26 +000023#include "class_linker.h"
Vladimir Marko0ebe0d82017-09-21 22:50:39 +010024#include "data_type-inl.h"
David Sehr312f3b22018-03-19 08:39:26 -070025#include "dex/bytecode_utils.h"
David Sehr9e734c72018-01-04 17:56:19 -080026#include "dex/dex_instruction-inl.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010027#include "driver/compiler_driver-inl.h"
28#include "driver/dex_compilation_unit.h"
David Brazdildee58d62016-04-07 09:54:26 +000029#include "driver/compiler_options.h"
Andreas Gampe75a7db62016-09-26 12:04:26 -070030#include "imtable-inl.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010031#include "mirror/dex_cache.h"
Nicolas Geoffray58cc1cb2017-11-20 13:27:29 +000032#include "oat_file.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010033#include "optimizing_compiler_stats.h"
Mathieu Chartierde4b08f2017-07-10 14:13:41 -070034#include "quicken_info.h"
Mathieu Chartier0795f232016-09-27 18:43:30 -070035#include "scoped_thread_state_change-inl.h"
Andreas Gampe8cf9cb32017-07-19 09:28:38 -070036#include "sharpening.h"
Vladimir Marko69d310e2017-10-09 14:12:23 +010037#include "ssa_builder.h"
Andreas Gampea7c83ac2017-09-11 08:14:23 -070038#include "well_known_classes.h"
David Brazdildee58d62016-04-07 09:54:26 +000039
40namespace art {
41
Mathieu Chartier808c7a52017-12-15 11:19:33 -080042HInstructionBuilder::HInstructionBuilder(HGraph* graph,
43 HBasicBlockBuilder* block_builder,
44 SsaBuilder* ssa_builder,
45 const DexFile* dex_file,
46 const CodeItemDebugInfoAccessor& accessor,
47 DataType::Type return_type,
48 const DexCompilationUnit* dex_compilation_unit,
49 const DexCompilationUnit* outer_compilation_unit,
50 CompilerDriver* compiler_driver,
51 CodeGenerator* code_generator,
Mathieu Chartier210531f2018-01-12 10:15:51 -080052 ArrayRef<const uint8_t> interpreter_metadata,
Mathieu Chartier808c7a52017-12-15 11:19:33 -080053 OptimizingCompilerStats* compiler_stats,
54 VariableSizedHandleScope* handles,
55 ScopedArenaAllocator* local_allocator)
56 : allocator_(graph->GetAllocator()),
57 graph_(graph),
58 handles_(handles),
59 dex_file_(dex_file),
60 code_item_accessor_(accessor),
61 return_type_(return_type),
62 block_builder_(block_builder),
63 ssa_builder_(ssa_builder),
64 compiler_driver_(compiler_driver),
65 code_generator_(code_generator),
66 dex_compilation_unit_(dex_compilation_unit),
67 outer_compilation_unit_(outer_compilation_unit),
68 quicken_info_(interpreter_metadata),
69 compilation_stats_(compiler_stats),
70 local_allocator_(local_allocator),
71 locals_for_(local_allocator->Adapter(kArenaAllocGraphBuilder)),
72 current_block_(nullptr),
73 current_locals_(nullptr),
74 latest_result_(nullptr),
75 current_this_parameter_(nullptr),
76 loop_headers_(local_allocator->Adapter(kArenaAllocGraphBuilder)) {
77 loop_headers_.reserve(kDefaultNumberOfLoops);
78}
79
David Brazdildee58d62016-04-07 09:54:26 +000080HBasicBlock* HInstructionBuilder::FindBlockStartingAt(uint32_t dex_pc) const {
81 return block_builder_->GetBlockAt(dex_pc);
82}
83
Vladimir Marko69d310e2017-10-09 14:12:23 +010084inline ScopedArenaVector<HInstruction*>* HInstructionBuilder::GetLocalsFor(HBasicBlock* block) {
85 ScopedArenaVector<HInstruction*>* locals = &locals_for_[block->GetBlockId()];
David Brazdildee58d62016-04-07 09:54:26 +000086 const size_t vregs = graph_->GetNumberOfVRegs();
Mingyao Yang01b47b02017-02-03 12:09:57 -080087 if (locals->size() == vregs) {
88 return locals;
89 }
90 return GetLocalsForWithAllocation(block, locals, vregs);
91}
David Brazdildee58d62016-04-07 09:54:26 +000092
Vladimir Marko69d310e2017-10-09 14:12:23 +010093ScopedArenaVector<HInstruction*>* HInstructionBuilder::GetLocalsForWithAllocation(
Mingyao Yang01b47b02017-02-03 12:09:57 -080094 HBasicBlock* block,
Vladimir Marko69d310e2017-10-09 14:12:23 +010095 ScopedArenaVector<HInstruction*>* locals,
Mingyao Yang01b47b02017-02-03 12:09:57 -080096 const size_t vregs) {
97 DCHECK_NE(locals->size(), vregs);
98 locals->resize(vregs, nullptr);
99 if (block->IsCatchBlock()) {
100 // We record incoming inputs of catch phis at throwing instructions and
101 // must therefore eagerly create the phis. Phis for undefined vregs will
102 // be deleted when the first throwing instruction with the vreg undefined
103 // is encountered. Unused phis will be removed by dead phi analysis.
104 for (size_t i = 0; i < vregs; ++i) {
105 // No point in creating the catch phi if it is already undefined at
106 // the first throwing instruction.
107 HInstruction* current_local_value = (*current_locals_)[i];
108 if (current_local_value != nullptr) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100109 HPhi* phi = new (allocator_) HPhi(
110 allocator_,
Mingyao Yang01b47b02017-02-03 12:09:57 -0800111 i,
112 0,
113 current_local_value->GetType());
114 block->AddPhi(phi);
115 (*locals)[i] = phi;
David Brazdildee58d62016-04-07 09:54:26 +0000116 }
117 }
118 }
119 return locals;
120}
121
Mingyao Yang01b47b02017-02-03 12:09:57 -0800122inline HInstruction* HInstructionBuilder::ValueOfLocalAt(HBasicBlock* block, size_t local) {
Vladimir Marko69d310e2017-10-09 14:12:23 +0100123 ScopedArenaVector<HInstruction*>* locals = GetLocalsFor(block);
David Brazdildee58d62016-04-07 09:54:26 +0000124 return (*locals)[local];
125}
126
127void HInstructionBuilder::InitializeBlockLocals() {
128 current_locals_ = GetLocalsFor(current_block_);
129
130 if (current_block_->IsCatchBlock()) {
131 // Catch phis were already created and inputs collected from throwing sites.
132 if (kIsDebugBuild) {
133 // Make sure there was at least one throwing instruction which initialized
134 // locals (guaranteed by HGraphBuilder) and that all try blocks have been
135 // visited already (from HTryBoundary scoping and reverse post order).
136 bool catch_block_visited = false;
Vladimir Marko2c45bc92016-10-25 16:54:12 +0100137 for (HBasicBlock* current : graph_->GetReversePostOrder()) {
David Brazdildee58d62016-04-07 09:54:26 +0000138 if (current == current_block_) {
139 catch_block_visited = true;
140 } else if (current->IsTryBlock()) {
141 const HTryBoundary& try_entry = current->GetTryCatchInformation()->GetTryEntry();
142 if (try_entry.HasExceptionHandler(*current_block_)) {
143 DCHECK(!catch_block_visited) << "Catch block visited before its try block.";
144 }
145 }
146 }
147 DCHECK_EQ(current_locals_->size(), graph_->GetNumberOfVRegs())
148 << "No instructions throwing into a live catch block.";
149 }
150 } else if (current_block_->IsLoopHeader()) {
151 // If the block is a loop header, we know we only have visited the pre header
152 // because we are visiting in reverse post order. We create phis for all initialized
153 // locals from the pre header. Their inputs will be populated at the end of
154 // the analysis.
155 for (size_t local = 0; local < current_locals_->size(); ++local) {
156 HInstruction* incoming =
157 ValueOfLocalAt(current_block_->GetLoopInformation()->GetPreHeader(), local);
158 if (incoming != nullptr) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100159 HPhi* phi = new (allocator_) HPhi(
160 allocator_,
David Brazdildee58d62016-04-07 09:54:26 +0000161 local,
162 0,
163 incoming->GetType());
164 current_block_->AddPhi(phi);
165 (*current_locals_)[local] = phi;
166 }
167 }
168
169 // Save the loop header so that the last phase of the analysis knows which
170 // blocks need to be updated.
171 loop_headers_.push_back(current_block_);
172 } else if (current_block_->GetPredecessors().size() > 0) {
173 // All predecessors have already been visited because we are visiting in reverse post order.
174 // We merge the values of all locals, creating phis if those values differ.
175 for (size_t local = 0; local < current_locals_->size(); ++local) {
176 bool one_predecessor_has_no_value = false;
177 bool is_different = false;
178 HInstruction* value = ValueOfLocalAt(current_block_->GetPredecessors()[0], local);
179
180 for (HBasicBlock* predecessor : current_block_->GetPredecessors()) {
181 HInstruction* current = ValueOfLocalAt(predecessor, local);
182 if (current == nullptr) {
183 one_predecessor_has_no_value = true;
184 break;
185 } else if (current != value) {
186 is_different = true;
187 }
188 }
189
190 if (one_predecessor_has_no_value) {
191 // If one predecessor has no value for this local, we trust the verifier has
192 // successfully checked that there is a store dominating any read after this block.
193 continue;
194 }
195
196 if (is_different) {
197 HInstruction* first_input = ValueOfLocalAt(current_block_->GetPredecessors()[0], local);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100198 HPhi* phi = new (allocator_) HPhi(
199 allocator_,
David Brazdildee58d62016-04-07 09:54:26 +0000200 local,
201 current_block_->GetPredecessors().size(),
202 first_input->GetType());
203 for (size_t i = 0; i < current_block_->GetPredecessors().size(); i++) {
204 HInstruction* pred_value = ValueOfLocalAt(current_block_->GetPredecessors()[i], local);
205 phi->SetRawInputAt(i, pred_value);
206 }
207 current_block_->AddPhi(phi);
208 value = phi;
209 }
210 (*current_locals_)[local] = value;
211 }
212 }
213}
214
215void HInstructionBuilder::PropagateLocalsToCatchBlocks() {
216 const HTryBoundary& try_entry = current_block_->GetTryCatchInformation()->GetTryEntry();
217 for (HBasicBlock* catch_block : try_entry.GetExceptionHandlers()) {
Vladimir Marko69d310e2017-10-09 14:12:23 +0100218 ScopedArenaVector<HInstruction*>* handler_locals = GetLocalsFor(catch_block);
David Brazdildee58d62016-04-07 09:54:26 +0000219 DCHECK_EQ(handler_locals->size(), current_locals_->size());
220 for (size_t vreg = 0, e = current_locals_->size(); vreg < e; ++vreg) {
221 HInstruction* handler_value = (*handler_locals)[vreg];
222 if (handler_value == nullptr) {
223 // Vreg was undefined at a previously encountered throwing instruction
224 // and the catch phi was deleted. Do not record the local value.
225 continue;
226 }
227 DCHECK(handler_value->IsPhi());
228
229 HInstruction* local_value = (*current_locals_)[vreg];
230 if (local_value == nullptr) {
231 // This is the first instruction throwing into `catch_block` where
232 // `vreg` is undefined. Delete the catch phi.
233 catch_block->RemovePhi(handler_value->AsPhi());
234 (*handler_locals)[vreg] = nullptr;
235 } else {
236 // Vreg has been defined at all instructions throwing into `catch_block`
237 // encountered so far. Record the local value in the catch phi.
238 handler_value->AsPhi()->AddInput(local_value);
239 }
240 }
241 }
242}
243
244void HInstructionBuilder::AppendInstruction(HInstruction* instruction) {
245 current_block_->AddInstruction(instruction);
246 InitializeInstruction(instruction);
247}
248
249void HInstructionBuilder::InsertInstructionAtTop(HInstruction* instruction) {
250 if (current_block_->GetInstructions().IsEmpty()) {
251 current_block_->AddInstruction(instruction);
252 } else {
253 current_block_->InsertInstructionBefore(instruction, current_block_->GetFirstInstruction());
254 }
255 InitializeInstruction(instruction);
256}
257
258void HInstructionBuilder::InitializeInstruction(HInstruction* instruction) {
259 if (instruction->NeedsEnvironment()) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100260 HEnvironment* environment = new (allocator_) HEnvironment(
261 allocator_,
David Brazdildee58d62016-04-07 09:54:26 +0000262 current_locals_->size(),
Nicolas Geoffray5d37c152017-01-12 13:25:19 +0000263 graph_->GetArtMethod(),
David Brazdildee58d62016-04-07 09:54:26 +0000264 instruction->GetDexPc(),
David Brazdildee58d62016-04-07 09:54:26 +0000265 instruction);
Vladimir Marko69d310e2017-10-09 14:12:23 +0100266 environment->CopyFrom(ArrayRef<HInstruction* const>(*current_locals_));
David Brazdildee58d62016-04-07 09:54:26 +0000267 instruction->SetRawEnvironment(environment);
268 }
269}
270
David Brazdilc120bbe2016-04-22 16:57:00 +0100271HInstruction* HInstructionBuilder::LoadNullCheckedLocal(uint32_t register_index, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100272 HInstruction* ref = LoadLocal(register_index, DataType::Type::kReference);
David Brazdilc120bbe2016-04-22 16:57:00 +0100273 if (!ref->CanBeNull()) {
274 return ref;
275 }
276
Vladimir Markoca6fff82017-10-03 14:49:14 +0100277 HNullCheck* null_check = new (allocator_) HNullCheck(ref, dex_pc);
David Brazdilc120bbe2016-04-22 16:57:00 +0100278 AppendInstruction(null_check);
279 return null_check;
280}
281
David Brazdildee58d62016-04-07 09:54:26 +0000282void HInstructionBuilder::SetLoopHeaderPhiInputs() {
283 for (size_t i = loop_headers_.size(); i > 0; --i) {
284 HBasicBlock* block = loop_headers_[i - 1];
285 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) {
286 HPhi* phi = it.Current()->AsPhi();
287 size_t vreg = phi->GetRegNumber();
288 for (HBasicBlock* predecessor : block->GetPredecessors()) {
289 HInstruction* value = ValueOfLocalAt(predecessor, vreg);
290 if (value == nullptr) {
291 // Vreg is undefined at this predecessor. Mark it dead and leave with
292 // fewer inputs than predecessors. SsaChecker will fail if not removed.
293 phi->SetDead();
294 break;
295 } else {
296 phi->AddInput(value);
297 }
298 }
299 }
300 }
301}
302
303static bool IsBlockPopulated(HBasicBlock* block) {
304 if (block->IsLoopHeader()) {
305 // Suspend checks were inserted into loop headers during building of dominator tree.
306 DCHECK(block->GetFirstInstruction()->IsSuspendCheck());
307 return block->GetFirstInstruction() != block->GetLastInstruction();
308 } else {
309 return !block->GetInstructions().IsEmpty();
310 }
311}
312
313bool HInstructionBuilder::Build() {
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800314 DCHECK(code_item_accessor_.HasCodeItem());
Vladimir Marko69d310e2017-10-09 14:12:23 +0100315 locals_for_.resize(
316 graph_->GetBlocks().size(),
317 ScopedArenaVector<HInstruction*>(local_allocator_->Adapter(kArenaAllocGraphBuilder)));
David Brazdildee58d62016-04-07 09:54:26 +0000318
319 // Find locations where we want to generate extra stackmaps for native debugging.
320 // This allows us to generate the info only at interesting points (for example,
321 // at start of java statement) rather than before every dex instruction.
322 const bool native_debuggable = compiler_driver_ != nullptr &&
323 compiler_driver_->GetCompilerOptions().GetNativeDebuggable();
324 ArenaBitVector* native_debug_info_locations = nullptr;
325 if (native_debuggable) {
Vladimir Marko69d310e2017-10-09 14:12:23 +0100326 native_debug_info_locations = FindNativeDebugInfoLocations();
David Brazdildee58d62016-04-07 09:54:26 +0000327 }
328
Vladimir Marko2c45bc92016-10-25 16:54:12 +0100329 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
330 current_block_ = block;
David Brazdildee58d62016-04-07 09:54:26 +0000331 uint32_t block_dex_pc = current_block_->GetDexPc();
332
333 InitializeBlockLocals();
334
335 if (current_block_->IsEntryBlock()) {
336 InitializeParameters();
Vladimir Markoca6fff82017-10-03 14:49:14 +0100337 AppendInstruction(new (allocator_) HSuspendCheck(0u));
338 AppendInstruction(new (allocator_) HGoto(0u));
David Brazdildee58d62016-04-07 09:54:26 +0000339 continue;
340 } else if (current_block_->IsExitBlock()) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100341 AppendInstruction(new (allocator_) HExit());
David Brazdildee58d62016-04-07 09:54:26 +0000342 continue;
343 } else if (current_block_->IsLoopHeader()) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100344 HSuspendCheck* suspend_check = new (allocator_) HSuspendCheck(current_block_->GetDexPc());
David Brazdildee58d62016-04-07 09:54:26 +0000345 current_block_->GetLoopInformation()->SetSuspendCheck(suspend_check);
346 // This is slightly odd because the loop header might not be empty (TryBoundary).
347 // But we're still creating the environment with locals from the top of the block.
348 InsertInstructionAtTop(suspend_check);
349 }
350
351 if (block_dex_pc == kNoDexPc || current_block_ != block_builder_->GetBlockAt(block_dex_pc)) {
352 // Synthetic block that does not need to be populated.
353 DCHECK(IsBlockPopulated(current_block_));
354 continue;
355 }
356
357 DCHECK(!IsBlockPopulated(current_block_));
358
Mathieu Chartierde4b08f2017-07-10 14:13:41 -0700359 uint32_t quicken_index = 0;
360 if (CanDecodeQuickenedInfo()) {
361 quicken_index = block_builder_->GetQuickenIndex(block_dex_pc);
362 }
363
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800364 for (const DexInstructionPcPair& pair : code_item_accessor_.InstructionsFrom(block_dex_pc)) {
David Brazdildee58d62016-04-07 09:54:26 +0000365 if (current_block_ == nullptr) {
366 // The previous instruction ended this block.
367 break;
368 }
369
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800370 const uint32_t dex_pc = pair.DexPc();
David Brazdildee58d62016-04-07 09:54:26 +0000371 if (dex_pc != block_dex_pc && FindBlockStartingAt(dex_pc) != nullptr) {
372 // This dex_pc starts a new basic block.
373 break;
374 }
375
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800376 if (current_block_->IsTryBlock() && IsThrowingDexInstruction(pair.Inst())) {
David Brazdildee58d62016-04-07 09:54:26 +0000377 PropagateLocalsToCatchBlocks();
378 }
379
380 if (native_debuggable && native_debug_info_locations->IsBitSet(dex_pc)) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100381 AppendInstruction(new (allocator_) HNativeDebugInfo(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000382 }
383
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800384 if (!ProcessDexInstruction(pair.Inst(), dex_pc, quicken_index)) {
David Brazdildee58d62016-04-07 09:54:26 +0000385 return false;
386 }
Mathieu Chartierde4b08f2017-07-10 14:13:41 -0700387
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800388 if (QuickenInfoTable::NeedsIndexForInstruction(&pair.Inst())) {
Mathieu Chartierde4b08f2017-07-10 14:13:41 -0700389 ++quicken_index;
390 }
David Brazdildee58d62016-04-07 09:54:26 +0000391 }
392
393 if (current_block_ != nullptr) {
394 // Branching instructions clear current_block, so we know the last
395 // instruction of the current block is not a branching instruction.
396 // We add an unconditional Goto to the next block.
397 DCHECK_EQ(current_block_->GetSuccessors().size(), 1u);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100398 AppendInstruction(new (allocator_) HGoto());
David Brazdildee58d62016-04-07 09:54:26 +0000399 }
400 }
401
402 SetLoopHeaderPhiInputs();
403
404 return true;
405}
406
Vladimir Marko92f7f3c2017-10-31 11:38:30 +0000407void HInstructionBuilder::BuildIntrinsic(ArtMethod* method) {
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800408 DCHECK(!code_item_accessor_.HasCodeItem());
Vladimir Marko92f7f3c2017-10-31 11:38:30 +0000409 DCHECK(method->IsIntrinsic());
410
411 locals_for_.resize(
412 graph_->GetBlocks().size(),
413 ScopedArenaVector<HInstruction*>(local_allocator_->Adapter(kArenaAllocGraphBuilder)));
414
415 // Fill the entry block. Do not add suspend check, we do not want a suspend
416 // check in intrinsics; intrinsic methods are supposed to be fast.
417 current_block_ = graph_->GetEntryBlock();
418 InitializeBlockLocals();
419 InitializeParameters();
420 AppendInstruction(new (allocator_) HGoto(0u));
421
422 // Fill the body.
423 current_block_ = current_block_->GetSingleSuccessor();
424 InitializeBlockLocals();
425 DCHECK(!IsBlockPopulated(current_block_));
426
427 // Add the invoke and return instruction. Use HInvokeStaticOrDirect even
428 // for methods that would normally use an HInvokeVirtual (sharpen the call).
429 size_t in_vregs = graph_->GetNumberOfInVRegs();
430 size_t number_of_arguments =
431 in_vregs - std::count(current_locals_->end() - in_vregs, current_locals_->end(), nullptr);
432 uint32_t method_idx = dex_compilation_unit_->GetDexMethodIndex();
433 MethodReference target_method(dex_file_, method_idx);
434 HInvokeStaticOrDirect::DispatchInfo dispatch_info = {
435 HInvokeStaticOrDirect::MethodLoadKind::kRuntimeCall,
436 HInvokeStaticOrDirect::CodePtrLocation::kCallArtMethod,
437 /* method_load_data */ 0u
438 };
439 InvokeType invoke_type = dex_compilation_unit_->IsStatic() ? kStatic : kDirect;
440 HInvokeStaticOrDirect* invoke = new (allocator_) HInvokeStaticOrDirect(
441 allocator_,
442 number_of_arguments,
443 return_type_,
444 kNoDexPc,
445 method_idx,
446 method,
447 dispatch_info,
448 invoke_type,
449 target_method,
450 HInvokeStaticOrDirect::ClinitCheckRequirement::kNone);
Treehugger Robot2c5827a2018-05-17 22:26:08 +0000451 RangeInstructionOperands operands(graph_->GetNumberOfVRegs() - in_vregs, in_vregs);
Orion Hodson4c8e12e2018-05-18 08:33:20 +0100452 HandleInvoke(invoke, operands, dex_file_->GetMethodShorty(method_idx), /* is_unresolved */ false);
Vladimir Marko92f7f3c2017-10-31 11:38:30 +0000453
454 // Add the return instruction.
455 if (return_type_ == DataType::Type::kVoid) {
456 AppendInstruction(new (allocator_) HReturnVoid());
457 } else {
458 AppendInstruction(new (allocator_) HReturn(invoke));
459 }
460
461 // Fill the exit block.
462 DCHECK_EQ(current_block_->GetSingleSuccessor(), graph_->GetExitBlock());
463 current_block_ = graph_->GetExitBlock();
464 InitializeBlockLocals();
465 AppendInstruction(new (allocator_) HExit());
466}
467
Vladimir Marko69d310e2017-10-09 14:12:23 +0100468ArenaBitVector* HInstructionBuilder::FindNativeDebugInfoLocations() {
Vladimir Marko69d310e2017-10-09 14:12:23 +0100469 ArenaBitVector* locations = ArenaBitVector::Create(local_allocator_,
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800470 code_item_accessor_.InsnsSizeInCodeUnits(),
Vladimir Marko69d310e2017-10-09 14:12:23 +0100471 /* expandable */ false,
472 kArenaAllocGraphBuilder);
473 locations->ClearAllBits();
Mathieu Chartier3e2e1232018-09-11 12:35:30 -0700474 // The visitor gets called when the line number changes.
475 // In other words, it marks the start of new java statement.
476 code_item_accessor_.DecodeDebugPositionInfo([&](const DexFile::PositionInfo& entry) {
477 locations->SetBit(entry.address_);
478 return false;
479 });
David Brazdildee58d62016-04-07 09:54:26 +0000480 // Instruction-specific tweaks.
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800481 for (const DexInstructionPcPair& inst : code_item_accessor_) {
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800482 switch (inst->Opcode()) {
David Brazdildee58d62016-04-07 09:54:26 +0000483 case Instruction::MOVE_EXCEPTION: {
484 // Stop in native debugger after the exception has been moved.
485 // The compiler also expects the move at the start of basic block so
486 // we do not want to interfere by inserting native-debug-info before it.
Mathieu Chartier0021feb2017-11-07 00:08:52 -0800487 locations->ClearBit(inst.DexPc());
488 DexInstructionIterator next = std::next(DexInstructionIterator(inst));
489 DCHECK(next.DexPc() != inst.DexPc());
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800490 if (next != code_item_accessor_.end()) {
Mathieu Chartier2b2bef22017-10-26 17:10:19 -0700491 locations->SetBit(next.DexPc());
David Brazdildee58d62016-04-07 09:54:26 +0000492 }
493 break;
494 }
495 default:
496 break;
497 }
498 }
Vladimir Marko69d310e2017-10-09 14:12:23 +0100499 return locations;
David Brazdildee58d62016-04-07 09:54:26 +0000500}
501
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100502HInstruction* HInstructionBuilder::LoadLocal(uint32_t reg_number, DataType::Type type) const {
David Brazdildee58d62016-04-07 09:54:26 +0000503 HInstruction* value = (*current_locals_)[reg_number];
504 DCHECK(value != nullptr);
505
506 // If the operation requests a specific type, we make sure its input is of that type.
507 if (type != value->GetType()) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100508 if (DataType::IsFloatingPointType(type)) {
Aart Bik31883642016-06-06 15:02:44 -0700509 value = ssa_builder_->GetFloatOrDoubleEquivalent(value, type);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100510 } else if (type == DataType::Type::kReference) {
Aart Bik31883642016-06-06 15:02:44 -0700511 value = ssa_builder_->GetReferenceTypeEquivalent(value);
David Brazdildee58d62016-04-07 09:54:26 +0000512 }
Aart Bik31883642016-06-06 15:02:44 -0700513 DCHECK(value != nullptr);
David Brazdildee58d62016-04-07 09:54:26 +0000514 }
515
516 return value;
517}
518
519void HInstructionBuilder::UpdateLocal(uint32_t reg_number, HInstruction* stored_value) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100520 DataType::Type stored_type = stored_value->GetType();
521 DCHECK_NE(stored_type, DataType::Type::kVoid);
David Brazdildee58d62016-04-07 09:54:26 +0000522
523 // Storing into vreg `reg_number` may implicitly invalidate the surrounding
524 // registers. Consider the following cases:
525 // (1) Storing a wide value must overwrite previous values in both `reg_number`
526 // and `reg_number+1`. We store `nullptr` in `reg_number+1`.
527 // (2) If vreg `reg_number-1` holds a wide value, writing into `reg_number`
528 // must invalidate it. We store `nullptr` in `reg_number-1`.
529 // Consequently, storing a wide value into the high vreg of another wide value
530 // will invalidate both `reg_number-1` and `reg_number+1`.
531
532 if (reg_number != 0) {
533 HInstruction* local_low = (*current_locals_)[reg_number - 1];
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100534 if (local_low != nullptr && DataType::Is64BitType(local_low->GetType())) {
David Brazdildee58d62016-04-07 09:54:26 +0000535 // The vreg we are storing into was previously the high vreg of a pair.
536 // We need to invalidate its low vreg.
537 DCHECK((*current_locals_)[reg_number] == nullptr);
538 (*current_locals_)[reg_number - 1] = nullptr;
539 }
540 }
541
542 (*current_locals_)[reg_number] = stored_value;
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100543 if (DataType::Is64BitType(stored_type)) {
David Brazdildee58d62016-04-07 09:54:26 +0000544 // We are storing a pair. Invalidate the instruction in the high vreg.
545 (*current_locals_)[reg_number + 1] = nullptr;
546 }
547}
548
549void HInstructionBuilder::InitializeParameters() {
550 DCHECK(current_block_->IsEntryBlock());
551
Vladimir Marko69d310e2017-10-09 14:12:23 +0100552 // outer_compilation_unit_ is null only when unit testing.
553 if (outer_compilation_unit_ == nullptr) {
David Brazdildee58d62016-04-07 09:54:26 +0000554 return;
555 }
556
557 const char* shorty = dex_compilation_unit_->GetShorty();
558 uint16_t number_of_parameters = graph_->GetNumberOfInVRegs();
559 uint16_t locals_index = graph_->GetNumberOfLocalVRegs();
560 uint16_t parameter_index = 0;
561
562 const DexFile::MethodId& referrer_method_id =
563 dex_file_->GetMethodId(dex_compilation_unit_->GetDexMethodIndex());
564 if (!dex_compilation_unit_->IsStatic()) {
565 // Add the implicit 'this' argument, not expressed in the signature.
Vladimir Markoca6fff82017-10-03 14:49:14 +0100566 HParameterValue* parameter = new (allocator_) HParameterValue(*dex_file_,
David Brazdildee58d62016-04-07 09:54:26 +0000567 referrer_method_id.class_idx_,
568 parameter_index++,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100569 DataType::Type::kReference,
Igor Murashkind01745e2017-04-05 16:40:31 -0700570 /* is_this */ true);
David Brazdildee58d62016-04-07 09:54:26 +0000571 AppendInstruction(parameter);
572 UpdateLocal(locals_index++, parameter);
573 number_of_parameters--;
Igor Murashkind01745e2017-04-05 16:40:31 -0700574 current_this_parameter_ = parameter;
575 } else {
576 DCHECK(current_this_parameter_ == nullptr);
David Brazdildee58d62016-04-07 09:54:26 +0000577 }
578
579 const DexFile::ProtoId& proto = dex_file_->GetMethodPrototype(referrer_method_id);
580 const DexFile::TypeList* arg_types = dex_file_->GetProtoParameters(proto);
581 for (int i = 0, shorty_pos = 1; i < number_of_parameters; i++) {
Vladimir Markoca6fff82017-10-03 14:49:14 +0100582 HParameterValue* parameter = new (allocator_) HParameterValue(
David Brazdildee58d62016-04-07 09:54:26 +0000583 *dex_file_,
584 arg_types->GetTypeItem(shorty_pos - 1).type_idx_,
585 parameter_index++,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100586 DataType::FromShorty(shorty[shorty_pos]),
Igor Murashkind01745e2017-04-05 16:40:31 -0700587 /* is_this */ false);
David Brazdildee58d62016-04-07 09:54:26 +0000588 ++shorty_pos;
589 AppendInstruction(parameter);
590 // Store the parameter value in the local that the dex code will use
591 // to reference that parameter.
592 UpdateLocal(locals_index++, parameter);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100593 if (DataType::Is64BitType(parameter->GetType())) {
David Brazdildee58d62016-04-07 09:54:26 +0000594 i++;
595 locals_index++;
596 parameter_index++;
597 }
598 }
599}
600
601template<typename T>
602void HInstructionBuilder::If_22t(const Instruction& instruction, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100603 HInstruction* first = LoadLocal(instruction.VRegA(), DataType::Type::kInt32);
604 HInstruction* second = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100605 T* comparison = new (allocator_) T(first, second, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +0000606 AppendInstruction(comparison);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100607 AppendInstruction(new (allocator_) HIf(comparison, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000608 current_block_ = nullptr;
609}
610
611template<typename T>
612void HInstructionBuilder::If_21t(const Instruction& instruction, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100613 HInstruction* value = LoadLocal(instruction.VRegA(), DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100614 T* comparison = new (allocator_) T(value, graph_->GetIntConstant(0, dex_pc), dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +0000615 AppendInstruction(comparison);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100616 AppendInstruction(new (allocator_) HIf(comparison, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000617 current_block_ = nullptr;
618}
619
620template<typename T>
621void HInstructionBuilder::Unop_12x(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100622 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000623 uint32_t dex_pc) {
624 HInstruction* first = LoadLocal(instruction.VRegB(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100625 AppendInstruction(new (allocator_) T(type, first, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000626 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
627}
628
629void HInstructionBuilder::Conversion_12x(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100630 DataType::Type input_type,
631 DataType::Type result_type,
David Brazdildee58d62016-04-07 09:54:26 +0000632 uint32_t dex_pc) {
633 HInstruction* first = LoadLocal(instruction.VRegB(), input_type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100634 AppendInstruction(new (allocator_) HTypeConversion(result_type, first, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000635 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
636}
637
638template<typename T>
639void HInstructionBuilder::Binop_23x(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100640 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000641 uint32_t dex_pc) {
642 HInstruction* first = LoadLocal(instruction.VRegB(), type);
643 HInstruction* second = LoadLocal(instruction.VRegC(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100644 AppendInstruction(new (allocator_) T(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000645 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
646}
647
648template<typename T>
649void HInstructionBuilder::Binop_23x_shift(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100650 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000651 uint32_t dex_pc) {
652 HInstruction* first = LoadLocal(instruction.VRegB(), type);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100653 HInstruction* second = LoadLocal(instruction.VRegC(), DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100654 AppendInstruction(new (allocator_) T(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000655 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
656}
657
658void HInstructionBuilder::Binop_23x_cmp(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100659 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000660 ComparisonBias bias,
661 uint32_t dex_pc) {
662 HInstruction* first = LoadLocal(instruction.VRegB(), type);
663 HInstruction* second = LoadLocal(instruction.VRegC(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100664 AppendInstruction(new (allocator_) HCompare(type, first, second, bias, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000665 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
666}
667
668template<typename T>
669void HInstructionBuilder::Binop_12x_shift(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100670 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000671 uint32_t dex_pc) {
672 HInstruction* first = LoadLocal(instruction.VRegA(), type);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100673 HInstruction* second = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100674 AppendInstruction(new (allocator_) T(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000675 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
676}
677
678template<typename T>
679void HInstructionBuilder::Binop_12x(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100680 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000681 uint32_t dex_pc) {
682 HInstruction* first = LoadLocal(instruction.VRegA(), type);
683 HInstruction* second = LoadLocal(instruction.VRegB(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100684 AppendInstruction(new (allocator_) T(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000685 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
686}
687
688template<typename T>
689void HInstructionBuilder::Binop_22s(const Instruction& instruction, bool reverse, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100690 HInstruction* first = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
David Brazdildee58d62016-04-07 09:54:26 +0000691 HInstruction* second = graph_->GetIntConstant(instruction.VRegC_22s(), dex_pc);
692 if (reverse) {
693 std::swap(first, second);
694 }
Vladimir Markoca6fff82017-10-03 14:49:14 +0100695 AppendInstruction(new (allocator_) T(DataType::Type::kInt32, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000696 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
697}
698
699template<typename T>
700void HInstructionBuilder::Binop_22b(const Instruction& instruction, bool reverse, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100701 HInstruction* first = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
David Brazdildee58d62016-04-07 09:54:26 +0000702 HInstruction* second = graph_->GetIntConstant(instruction.VRegC_22b(), dex_pc);
703 if (reverse) {
704 std::swap(first, second);
705 }
Vladimir Markoca6fff82017-10-03 14:49:14 +0100706 AppendInstruction(new (allocator_) T(DataType::Type::kInt32, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000707 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
708}
709
Igor Murashkind01745e2017-04-05 16:40:31 -0700710// Does the method being compiled need any constructor barriers being inserted?
711// (Always 'false' for methods that aren't <init>.)
Mathieu Chartierc4ae9162016-04-07 13:19:19 -0700712static bool RequiresConstructorBarrier(const DexCompilationUnit* cu, CompilerDriver* driver) {
Igor Murashkin032cacd2017-04-06 14:40:08 -0700713 // Can be null in unit tests only.
714 if (UNLIKELY(cu == nullptr)) {
715 return false;
716 }
717
David Brazdildee58d62016-04-07 09:54:26 +0000718 Thread* self = Thread::Current();
719 return cu->IsConstructor()
Igor Murashkind01745e2017-04-05 16:40:31 -0700720 && !cu->IsStatic()
721 // RequiresConstructorBarrier must only be queried for <init> methods;
722 // it's effectively "false" for every other method.
723 //
724 // See CompilerDriver::RequiresConstructBarrier for more explanation.
Mathieu Chartierc4ae9162016-04-07 13:19:19 -0700725 && driver->RequiresConstructorBarrier(self, cu->GetDexFile(), cu->GetClassDefIndex());
David Brazdildee58d62016-04-07 09:54:26 +0000726}
727
728// Returns true if `block` has only one successor which starts at the next
729// dex_pc after `instruction` at `dex_pc`.
730static bool IsFallthroughInstruction(const Instruction& instruction,
731 uint32_t dex_pc,
732 HBasicBlock* block) {
733 uint32_t next_dex_pc = dex_pc + instruction.SizeInCodeUnits();
734 return block->GetSingleSuccessor()->GetDexPc() == next_dex_pc;
735}
736
737void HInstructionBuilder::BuildSwitch(const Instruction& instruction, uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100738 HInstruction* value = LoadLocal(instruction.VRegA(), DataType::Type::kInt32);
David Brazdildee58d62016-04-07 09:54:26 +0000739 DexSwitchTable table(instruction, dex_pc);
740
741 if (table.GetNumEntries() == 0) {
742 // Empty Switch. Code falls through to the next block.
743 DCHECK(IsFallthroughInstruction(instruction, dex_pc, current_block_));
Vladimir Markoca6fff82017-10-03 14:49:14 +0100744 AppendInstruction(new (allocator_) HGoto(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000745 } else if (table.ShouldBuildDecisionTree()) {
746 for (DexSwitchTableIterator it(table); !it.Done(); it.Advance()) {
747 HInstruction* case_value = graph_->GetIntConstant(it.CurrentKey(), dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100748 HEqual* comparison = new (allocator_) HEqual(value, case_value, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +0000749 AppendInstruction(comparison);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100750 AppendInstruction(new (allocator_) HIf(comparison, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000751
752 if (!it.IsLast()) {
753 current_block_ = FindBlockStartingAt(it.GetDexPcForCurrentIndex());
754 }
755 }
756 } else {
757 AppendInstruction(
Vladimir Markoca6fff82017-10-03 14:49:14 +0100758 new (allocator_) HPackedSwitch(table.GetEntryAt(0), table.GetNumEntries(), value, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000759 }
760
761 current_block_ = nullptr;
762}
763
764void HInstructionBuilder::BuildReturn(const Instruction& instruction,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100765 DataType::Type type,
David Brazdildee58d62016-04-07 09:54:26 +0000766 uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100767 if (type == DataType::Type::kVoid) {
Igor Murashkind01745e2017-04-05 16:40:31 -0700768 // Only <init> (which is a return-void) could possibly have a constructor fence.
Igor Murashkin032cacd2017-04-06 14:40:08 -0700769 // This may insert additional redundant constructor fences from the super constructors.
770 // TODO: remove redundant constructor fences (b/36656456).
771 if (RequiresConstructorBarrier(dex_compilation_unit_, compiler_driver_)) {
Igor Murashkind01745e2017-04-05 16:40:31 -0700772 // Compiling instance constructor.
Vladimir Markoba118822017-06-12 15:41:56 +0100773 DCHECK_STREQ("<init>", graph_->GetMethodName());
Igor Murashkind01745e2017-04-05 16:40:31 -0700774
775 HInstruction* fence_target = current_this_parameter_;
776 DCHECK(fence_target != nullptr);
777
Vladimir Markoca6fff82017-10-03 14:49:14 +0100778 AppendInstruction(new (allocator_) HConstructorFence(fence_target, dex_pc, allocator_));
Igor Murashkin6ef45672017-08-08 13:59:55 -0700779 MaybeRecordStat(
780 compilation_stats_,
781 MethodCompilationStat::kConstructorFenceGeneratedFinal);
David Brazdildee58d62016-04-07 09:54:26 +0000782 }
Vladimir Markoca6fff82017-10-03 14:49:14 +0100783 AppendInstruction(new (allocator_) HReturnVoid(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000784 } else {
Igor Murashkind01745e2017-04-05 16:40:31 -0700785 DCHECK(!RequiresConstructorBarrier(dex_compilation_unit_, compiler_driver_));
David Brazdildee58d62016-04-07 09:54:26 +0000786 HInstruction* value = LoadLocal(instruction.VRegA(), type);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100787 AppendInstruction(new (allocator_) HReturn(value, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +0000788 }
789 current_block_ = nullptr;
790}
791
792static InvokeType GetInvokeTypeFromOpCode(Instruction::Code opcode) {
793 switch (opcode) {
794 case Instruction::INVOKE_STATIC:
795 case Instruction::INVOKE_STATIC_RANGE:
796 return kStatic;
797 case Instruction::INVOKE_DIRECT:
798 case Instruction::INVOKE_DIRECT_RANGE:
799 return kDirect;
800 case Instruction::INVOKE_VIRTUAL:
801 case Instruction::INVOKE_VIRTUAL_QUICK:
802 case Instruction::INVOKE_VIRTUAL_RANGE:
803 case Instruction::INVOKE_VIRTUAL_RANGE_QUICK:
804 return kVirtual;
805 case Instruction::INVOKE_INTERFACE:
806 case Instruction::INVOKE_INTERFACE_RANGE:
807 return kInterface;
808 case Instruction::INVOKE_SUPER_RANGE:
809 case Instruction::INVOKE_SUPER:
810 return kSuper;
811 default:
812 LOG(FATAL) << "Unexpected invoke opcode: " << opcode;
813 UNREACHABLE();
814 }
815}
816
817ArtMethod* HInstructionBuilder::ResolveMethod(uint16_t method_idx, InvokeType invoke_type) {
818 ScopedObjectAccess soa(Thread::Current());
David Brazdildee58d62016-04-07 09:54:26 +0000819
820 ClassLinker* class_linker = dex_compilation_unit_->GetClassLinker();
Vladimir Marko8d6768d2017-03-14 10:13:21 +0000821 Handle<mirror::ClassLoader> class_loader = dex_compilation_unit_->GetClassLoader();
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100822
Vladimir Markoba118822017-06-12 15:41:56 +0100823 ArtMethod* resolved_method =
824 class_linker->ResolveMethod<ClassLinker::ResolveMode::kCheckICCEAndIAE>(
Vladimir Markoba118822017-06-12 15:41:56 +0100825 method_idx,
826 dex_compilation_unit_->GetDexCache(),
827 class_loader,
828 graph_->GetArtMethod(),
829 invoke_type);
David Brazdildee58d62016-04-07 09:54:26 +0000830
831 if (UNLIKELY(resolved_method == nullptr)) {
832 // Clean up any exception left by type resolution.
833 soa.Self()->ClearException();
834 return nullptr;
835 }
836
Vladimir Markoba118822017-06-12 15:41:56 +0100837 // The referrer may be unresolved for AOT if we're compiling a class that cannot be
838 // resolved because, for example, we don't find a superclass in the classpath.
839 if (graph_->GetArtMethod() == nullptr) {
840 // The class linker cannot check access without a referrer, so we have to do it.
841 // Fall back to HInvokeUnresolved if the method isn't public.
David Brazdildee58d62016-04-07 09:54:26 +0000842 if (!resolved_method->IsPublic()) {
843 return nullptr;
844 }
David Brazdildee58d62016-04-07 09:54:26 +0000845 }
846
847 // We have to special case the invoke-super case, as ClassLinker::ResolveMethod does not.
848 // We need to look at the referrer's super class vtable. We need to do this to know if we need to
849 // make this an invoke-unresolved to handle cross-dex invokes or abstract super methods, both of
850 // which require runtime handling.
851 if (invoke_type == kSuper) {
Vladimir Markoa2c211c2018-11-01 09:50:52 +0000852 ObjPtr<mirror::Class> compiling_class = dex_compilation_unit_->GetCompilingClass().Get();
Andreas Gampefa4333d2017-02-14 11:10:34 -0800853 if (compiling_class == nullptr) {
David Brazdildee58d62016-04-07 09:54:26 +0000854 // We could not determine the method's class we need to wait until runtime.
855 DCHECK(Runtime::Current()->IsAotCompiler());
856 return nullptr;
857 }
Vladimir Markoba118822017-06-12 15:41:56 +0100858 ObjPtr<mirror::Class> referenced_class = class_linker->LookupResolvedType(
Vladimir Markoba118822017-06-12 15:41:56 +0100859 dex_compilation_unit_->GetDexFile()->GetMethodId(method_idx).class_idx_,
860 dex_compilation_unit_->GetDexCache().Get(),
861 class_loader.Get());
862 DCHECK(referenced_class != nullptr); // We have already resolved a method from this class.
863 if (!referenced_class->IsAssignableFrom(compiling_class)) {
Aart Bikf663e342016-04-04 17:28:59 -0700864 // We cannot statically determine the target method. The runtime will throw a
865 // NoSuchMethodError on this one.
866 return nullptr;
867 }
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100868 ArtMethod* actual_method;
Vladimir Markoba118822017-06-12 15:41:56 +0100869 if (referenced_class->IsInterface()) {
870 actual_method = referenced_class->FindVirtualMethodForInterfaceSuper(
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100871 resolved_method, class_linker->GetImagePointerSize());
David Brazdildee58d62016-04-07 09:54:26 +0000872 } else {
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100873 uint16_t vtable_index = resolved_method->GetMethodIndex();
874 actual_method = compiling_class->GetSuperClass()->GetVTableEntry(
875 vtable_index, class_linker->GetImagePointerSize());
David Brazdildee58d62016-04-07 09:54:26 +0000876 }
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100877 if (actual_method != resolved_method &&
878 !IsSameDexFile(*actual_method->GetDexFile(), *dex_compilation_unit_->GetDexFile())) {
879 // The back-end code generator relies on this check in order to ensure that it will not
880 // attempt to read the dex_cache with a dex_method_index that is not from the correct
881 // dex_file. If we didn't do this check then the dex_method_index will not be updated in the
882 // builder, which means that the code-generator (and compiler driver during sharpening and
883 // inliner, maybe) might invoke an incorrect method.
884 // TODO: The actual method could still be referenced in the current dex file, so we
885 // could try locating it.
886 // TODO: Remove the dex_file restriction.
887 return nullptr;
888 }
889 if (!actual_method->IsInvokable()) {
890 // Fail if the actual method cannot be invoked. Otherwise, the runtime resolution stub
891 // could resolve the callee to the wrong method.
892 return nullptr;
893 }
894 resolved_method = actual_method;
David Brazdildee58d62016-04-07 09:54:26 +0000895 }
896
David Brazdildee58d62016-04-07 09:54:26 +0000897 return resolved_method;
898}
899
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100900static bool IsStringConstructor(ArtMethod* method) {
901 ScopedObjectAccess soa(Thread::Current());
902 return method->GetDeclaringClass()->IsStringClass() && method->IsConstructor();
903}
904
David Brazdildee58d62016-04-07 09:54:26 +0000905bool HInstructionBuilder::BuildInvoke(const Instruction& instruction,
906 uint32_t dex_pc,
907 uint32_t method_idx,
Treehugger Robot2c5827a2018-05-17 22:26:08 +0000908 const InstructionOperands& operands) {
David Brazdildee58d62016-04-07 09:54:26 +0000909 InvokeType invoke_type = GetInvokeTypeFromOpCode(instruction.Opcode());
Orion Hodson4c8e12e2018-05-18 08:33:20 +0100910 const char* shorty = dex_file_->GetMethodShorty(method_idx);
911 DataType::Type return_type = DataType::FromShorty(shorty[0]);
David Brazdildee58d62016-04-07 09:54:26 +0000912
913 // Remove the return type from the 'proto'.
Orion Hodson4c8e12e2018-05-18 08:33:20 +0100914 size_t number_of_arguments = strlen(shorty) - 1;
David Brazdildee58d62016-04-07 09:54:26 +0000915 if (invoke_type != kStatic) { // instance call
916 // One extra argument for 'this'.
917 number_of_arguments++;
918 }
919
David Brazdildee58d62016-04-07 09:54:26 +0000920 ArtMethod* resolved_method = ResolveMethod(method_idx, invoke_type);
921
922 if (UNLIKELY(resolved_method == nullptr)) {
Igor Murashkin1e065a52017-08-09 13:20:34 -0700923 MaybeRecordStat(compilation_stats_,
924 MethodCompilationStat::kUnresolvedMethod);
Vladimir Markoca6fff82017-10-03 14:49:14 +0100925 HInvoke* invoke = new (allocator_) HInvokeUnresolved(allocator_,
926 number_of_arguments,
927 return_type,
928 dex_pc,
929 method_idx,
930 invoke_type);
Orion Hodson4c8e12e2018-05-18 08:33:20 +0100931 return HandleInvoke(invoke, operands, shorty, /* is_unresolved */ true);
David Brazdildee58d62016-04-07 09:54:26 +0000932 }
933
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100934 // Replace calls to String.<init> with StringFactory.
935 if (IsStringConstructor(resolved_method)) {
936 uint32_t string_init_entry_point = WellKnownClasses::StringInitToEntryPoint(resolved_method);
937 HInvokeStaticOrDirect::DispatchInfo dispatch_info = {
938 HInvokeStaticOrDirect::MethodLoadKind::kStringInit,
939 HInvokeStaticOrDirect::CodePtrLocation::kCallArtMethod,
Nicolas Geoffrayc1a42cf2016-12-18 15:52:36 +0000940 dchecked_integral_cast<uint64_t>(string_init_entry_point)
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100941 };
Nicolas Geoffrayf665f842018-02-15 12:29:06 +0000942 ScopedObjectAccess soa(Thread::Current());
943 MethodReference target_method(resolved_method->GetDexFile(),
944 resolved_method->GetDexMethodIndex());
945 // We pass null for the resolved_method to ensure optimizations
946 // don't rely on it.
Vladimir Markoca6fff82017-10-03 14:49:14 +0100947 HInvoke* invoke = new (allocator_) HInvokeStaticOrDirect(
948 allocator_,
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100949 number_of_arguments - 1,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +0100950 DataType::Type::kReference /*return_type */,
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100951 dex_pc,
952 method_idx,
Nicolas Geoffrayf665f842018-02-15 12:29:06 +0000953 nullptr /* resolved_method */,
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100954 dispatch_info,
955 invoke_type,
956 target_method,
957 HInvokeStaticOrDirect::ClinitCheckRequirement::kImplicit);
Orion Hodson4c8e12e2018-05-18 08:33:20 +0100958 return HandleStringInit(invoke, operands, shorty);
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100959 }
960
David Brazdildee58d62016-04-07 09:54:26 +0000961 // Potential class initialization check, in the case of a static method call.
962 HClinitCheck* clinit_check = nullptr;
963 HInvoke* invoke = nullptr;
964 if (invoke_type == kDirect || invoke_type == kStatic || invoke_type == kSuper) {
965 // By default, consider that the called method implicitly requires
966 // an initialization check of its declaring method.
967 HInvokeStaticOrDirect::ClinitCheckRequirement clinit_check_requirement
968 = HInvokeStaticOrDirect::ClinitCheckRequirement::kImplicit;
969 ScopedObjectAccess soa(Thread::Current());
970 if (invoke_type == kStatic) {
Vladimir Markofca0b492018-07-23 15:30:52 +0100971 clinit_check =
Vladimir Markoa2c211c2018-11-01 09:50:52 +0000972 ProcessClinitCheckForInvoke(dex_pc, resolved_method, &clinit_check_requirement);
David Brazdildee58d62016-04-07 09:54:26 +0000973 } else if (invoke_type == kSuper) {
974 if (IsSameDexFile(*resolved_method->GetDexFile(), *dex_compilation_unit_->GetDexFile())) {
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +0100975 // Update the method index to the one resolved. Note that this may be a no-op if
David Brazdildee58d62016-04-07 09:54:26 +0000976 // we resolved to the method referenced by the instruction.
977 method_idx = resolved_method->GetDexMethodIndex();
David Brazdildee58d62016-04-07 09:54:26 +0000978 }
979 }
980
Nicolas Geoffraybdb2ecc2018-09-18 14:33:55 +0100981 HInvokeStaticOrDirect::DispatchInfo dispatch_info =
982 HSharpening::SharpenInvokeStaticOrDirect(resolved_method, code_generator_);
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +0100983 MethodReference target_method(resolved_method->GetDexFile(),
984 resolved_method->GetDexMethodIndex());
Vladimir Markoca6fff82017-10-03 14:49:14 +0100985 invoke = new (allocator_) HInvokeStaticOrDirect(allocator_,
986 number_of_arguments,
987 return_type,
988 dex_pc,
989 method_idx,
990 resolved_method,
991 dispatch_info,
992 invoke_type,
993 target_method,
994 clinit_check_requirement);
David Brazdildee58d62016-04-07 09:54:26 +0000995 } else if (invoke_type == kVirtual) {
996 ScopedObjectAccess soa(Thread::Current()); // Needed for the method index
Vladimir Markoca6fff82017-10-03 14:49:14 +0100997 invoke = new (allocator_) HInvokeVirtual(allocator_,
998 number_of_arguments,
999 return_type,
1000 dex_pc,
1001 method_idx,
1002 resolved_method,
1003 resolved_method->GetMethodIndex());
David Brazdildee58d62016-04-07 09:54:26 +00001004 } else {
1005 DCHECK_EQ(invoke_type, kInterface);
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +01001006 ScopedObjectAccess soa(Thread::Current()); // Needed for the IMT index.
Vladimir Markoca6fff82017-10-03 14:49:14 +01001007 invoke = new (allocator_) HInvokeInterface(allocator_,
1008 number_of_arguments,
1009 return_type,
1010 dex_pc,
1011 method_idx,
1012 resolved_method,
1013 ImTable::GetImtIndex(resolved_method));
David Brazdildee58d62016-04-07 09:54:26 +00001014 }
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001015 return HandleInvoke(invoke, operands, shorty, /* is_unresolved */ false, clinit_check);
David Brazdildee58d62016-04-07 09:54:26 +00001016}
1017
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001018bool HInstructionBuilder::BuildInvokePolymorphic(uint32_t dex_pc,
Orion Hodsonac141392017-01-13 11:53:47 +00001019 uint32_t method_idx,
Orion Hodson06d10a72018-05-14 08:53:38 +01001020 dex::ProtoIndex proto_idx,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001021 const InstructionOperands& operands) {
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001022 const char* shorty = dex_file_->GetShorty(proto_idx);
1023 DCHECK_EQ(1 + ArtMethod::NumArgRegisters(shorty), operands.GetNumberOfOperands());
1024 DataType::Type return_type = DataType::FromShorty(shorty[0]);
1025 size_t number_of_arguments = strlen(shorty);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001026 HInvoke* invoke = new (allocator_) HInvokePolymorphic(allocator_,
1027 number_of_arguments,
1028 return_type,
1029 dex_pc,
1030 method_idx);
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001031 return HandleInvoke(invoke, operands, shorty, /* is_unresolved */ false);
1032}
1033
1034
1035bool HInstructionBuilder::BuildInvokeCustom(uint32_t dex_pc,
1036 uint32_t call_site_idx,
1037 const InstructionOperands& operands) {
1038 dex::ProtoIndex proto_idx = dex_file_->GetProtoIndexForCallSite(call_site_idx);
1039 const char* shorty = dex_file_->GetShorty(proto_idx);
1040 DataType::Type return_type = DataType::FromShorty(shorty[0]);
1041 size_t number_of_arguments = strlen(shorty) - 1;
1042 HInvoke* invoke = new (allocator_) HInvokeCustom(allocator_,
1043 number_of_arguments,
1044 call_site_idx,
1045 return_type,
1046 dex_pc);
1047 return HandleInvoke(invoke, operands, shorty, /* is_unresolved */ false);
Orion Hodsonac141392017-01-13 11:53:47 +00001048}
1049
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001050HNewInstance* HInstructionBuilder::BuildNewInstance(dex::TypeIndex type_index, uint32_t dex_pc) {
Vladimir Marko3cd50df2016-04-13 19:29:26 +01001051 ScopedObjectAccess soa(Thread::Current());
David Brazdildee58d62016-04-07 09:54:26 +00001052
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001053 HLoadClass* load_class = BuildLoadClass(type_index, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001054
David Brazdildee58d62016-04-07 09:54:26 +00001055 HInstruction* cls = load_class;
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001056 Handle<mirror::Class> klass = load_class->GetClass();
1057
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001058 if (!IsInitialized(klass)) {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001059 cls = new (allocator_) HClinitCheck(load_class, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001060 AppendInstruction(cls);
1061 }
1062
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001063 // Only the access check entrypoint handles the finalizable class case. If we
1064 // need access checks, then we haven't resolved the method and the class may
1065 // again be finalizable.
1066 QuickEntrypointEnum entrypoint = kQuickAllocObjectInitialized;
1067 if (load_class->NeedsAccessCheck() || klass->IsFinalizable() || !klass->IsInstantiable()) {
1068 entrypoint = kQuickAllocObjectWithChecks;
1069 }
Alex Lightd109e302018-06-27 10:25:41 -07001070 // We will always be able to resolve the string class since it is in the BCP.
1071 if (!klass.IsNull() && klass->IsStringClass()) {
1072 entrypoint = kQuickAllocStringObject;
1073 }
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001074
1075 // Consider classes we haven't resolved as potentially finalizable.
Andreas Gampefa4333d2017-02-14 11:10:34 -08001076 bool finalizable = (klass == nullptr) || klass->IsFinalizable();
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001077
Vladimir Markoca6fff82017-10-03 14:49:14 +01001078 HNewInstance* new_instance = new (allocator_) HNewInstance(
David Brazdildee58d62016-04-07 09:54:26 +00001079 cls,
David Brazdildee58d62016-04-07 09:54:26 +00001080 dex_pc,
1081 type_index,
1082 *dex_compilation_unit_->GetDexFile(),
David Brazdildee58d62016-04-07 09:54:26 +00001083 finalizable,
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001084 entrypoint);
1085 AppendInstruction(new_instance);
1086
1087 return new_instance;
1088}
1089
1090void HInstructionBuilder::BuildConstructorFenceForAllocation(HInstruction* allocation) {
1091 DCHECK(allocation != nullptr &&
George Burgess IVf2072992017-05-23 15:36:41 -07001092 (allocation->IsNewInstance() ||
1093 allocation->IsNewArray())); // corresponding to "new" keyword in JLS.
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001094
1095 if (allocation->IsNewInstance()) {
1096 // STRING SPECIAL HANDLING:
1097 // -------------------------------
1098 // Strings have a real HNewInstance node but they end up always having 0 uses.
1099 // All uses of a String HNewInstance are always transformed to replace their input
1100 // of the HNewInstance with an input of the invoke to StringFactory.
1101 //
1102 // Do not emit an HConstructorFence here since it can inhibit some String new-instance
1103 // optimizations (to pass checker tests that rely on those optimizations).
1104 HNewInstance* new_inst = allocation->AsNewInstance();
1105 HLoadClass* load_class = new_inst->GetLoadClass();
1106
1107 Thread* self = Thread::Current();
1108 ScopedObjectAccess soa(self);
1109 StackHandleScope<1> hs(self);
1110 Handle<mirror::Class> klass = load_class->GetClass();
1111 if (klass != nullptr && klass->IsStringClass()) {
1112 return;
1113 // Note: Do not use allocation->IsStringAlloc which requires
1114 // a valid ReferenceTypeInfo, but that doesn't get made until after reference type
1115 // propagation (and instruction builder is too early).
1116 }
1117 // (In terms of correctness, the StringFactory needs to provide its own
1118 // default initialization barrier, see below.)
1119 }
1120
1121 // JLS 17.4.5 "Happens-before Order" describes:
1122 //
1123 // The default initialization of any object happens-before any other actions (other than
1124 // default-writes) of a program.
1125 //
1126 // In our implementation the default initialization of an object to type T means
1127 // setting all of its initial data (object[0..size)) to 0, and setting the
1128 // object's class header (i.e. object.getClass() == T.class).
1129 //
1130 // In practice this fence ensures that the writes to the object header
1131 // are visible to other threads if this object escapes the current thread.
1132 // (and in theory the 0-initializing, but that happens automatically
1133 // when new memory pages are mapped in by the OS).
1134 HConstructorFence* ctor_fence =
Vladimir Markoca6fff82017-10-03 14:49:14 +01001135 new (allocator_) HConstructorFence(allocation, allocation->GetDexPc(), allocator_);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001136 AppendInstruction(ctor_fence);
Igor Murashkin6ef45672017-08-08 13:59:55 -07001137 MaybeRecordStat(
1138 compilation_stats_,
1139 MethodCompilationStat::kConstructorFenceGeneratedNew);
David Brazdildee58d62016-04-07 09:54:26 +00001140}
1141
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001142static bool IsInBootImage(ObjPtr<mirror::Class> cls, const CompilerOptions& compiler_options)
1143 REQUIRES_SHARED(Locks::mutator_lock_) {
1144 if (compiler_options.IsBootImage()) {
1145 std::string temp;
1146 const char* descriptor = cls->GetDescriptor(&temp);
1147 return compiler_options.IsImageClass(descriptor);
1148 } else {
1149 return Runtime::Current()->GetHeap()->FindSpaceFromObject(cls, false)->IsImageSpace();
1150 }
1151}
1152
1153static bool IsSubClass(ObjPtr<mirror::Class> to_test, ObjPtr<mirror::Class> super_class)
1154 REQUIRES_SHARED(Locks::mutator_lock_) {
1155 return to_test != nullptr && !to_test->IsInterface() && to_test->IsSubClass(super_class);
1156}
1157
1158static bool HasTrivialClinit(ObjPtr<mirror::Class> klass, PointerSize pointer_size)
1159 REQUIRES_SHARED(Locks::mutator_lock_) {
1160 // Check if the class has encoded fields that trigger bytecode execution.
1161 // (Encoded fields are just a different representation of <clinit>.)
1162 if (klass->NumStaticFields() != 0u) {
1163 DCHECK(klass->GetClassDef() != nullptr);
1164 EncodedStaticFieldValueIterator it(klass->GetDexFile(), *klass->GetClassDef());
1165 for (; it.HasNext(); it.Next()) {
1166 switch (it.GetValueType()) {
1167 case EncodedArrayValueIterator::ValueType::kBoolean:
1168 case EncodedArrayValueIterator::ValueType::kByte:
1169 case EncodedArrayValueIterator::ValueType::kShort:
1170 case EncodedArrayValueIterator::ValueType::kChar:
1171 case EncodedArrayValueIterator::ValueType::kInt:
1172 case EncodedArrayValueIterator::ValueType::kLong:
1173 case EncodedArrayValueIterator::ValueType::kFloat:
1174 case EncodedArrayValueIterator::ValueType::kDouble:
1175 case EncodedArrayValueIterator::ValueType::kNull:
1176 case EncodedArrayValueIterator::ValueType::kString:
1177 // Primitive, null or j.l.String initialization is permitted.
1178 break;
1179 case EncodedArrayValueIterator::ValueType::kType:
1180 // Type initialization can load classes and execute bytecode through a class loader
1181 // which can execute arbitrary bytecode. We do not optimize for known class loaders;
1182 // kType is rarely used (if ever).
1183 return false;
1184 default:
1185 // Other types in the encoded static field list are rejected by the DexFileVerifier.
1186 LOG(FATAL) << "Unexpected type " << it.GetValueType();
1187 UNREACHABLE();
1188 }
1189 }
1190 }
1191 // Check if the class has <clinit> that executes arbitrary code.
1192 // Initialization of static fields of the class itself with constants is allowed.
1193 ArtMethod* clinit = klass->FindClassInitializer(pointer_size);
1194 if (clinit != nullptr) {
1195 const DexFile& dex_file = *clinit->GetDexFile();
1196 CodeItemInstructionAccessor accessor(dex_file, clinit->GetCodeItem());
1197 for (DexInstructionPcPair it : accessor) {
1198 switch (it->Opcode()) {
1199 case Instruction::CONST_4:
1200 case Instruction::CONST_16:
1201 case Instruction::CONST:
1202 case Instruction::CONST_HIGH16:
1203 case Instruction::CONST_WIDE_16:
1204 case Instruction::CONST_WIDE_32:
1205 case Instruction::CONST_WIDE:
1206 case Instruction::CONST_WIDE_HIGH16:
1207 case Instruction::CONST_STRING:
1208 case Instruction::CONST_STRING_JUMBO:
1209 // Primitive, null or j.l.String initialization is permitted.
1210 break;
1211 case Instruction::RETURN_VOID:
1212 case Instruction::RETURN_VOID_NO_BARRIER:
1213 break;
1214 case Instruction::SPUT:
1215 case Instruction::SPUT_WIDE:
1216 case Instruction::SPUT_OBJECT:
1217 case Instruction::SPUT_BOOLEAN:
1218 case Instruction::SPUT_BYTE:
1219 case Instruction::SPUT_CHAR:
1220 case Instruction::SPUT_SHORT:
1221 // Only initialization of a static field of the same class is permitted.
1222 if (dex_file.GetFieldId(it->VRegB_21c()).class_idx_ != klass->GetDexTypeIndex()) {
1223 return false;
1224 }
1225 break;
1226 case Instruction::NEW_ARRAY:
1227 // Only primitive arrays are permitted.
1228 if (Primitive::GetType(dex_file.GetTypeDescriptor(dex_file.GetTypeId(
1229 dex::TypeIndex(it->VRegC_22c())))[1]) == Primitive::kPrimNot) {
1230 return false;
1231 }
1232 break;
1233 case Instruction::APUT:
1234 case Instruction::APUT_WIDE:
1235 case Instruction::APUT_BOOLEAN:
1236 case Instruction::APUT_BYTE:
1237 case Instruction::APUT_CHAR:
1238 case Instruction::APUT_SHORT:
1239 case Instruction::FILL_ARRAY_DATA:
1240 case Instruction::NOP:
1241 // Allow initialization of primitive arrays (only constants can be stored).
1242 // Note: We expect NOPs used for fill-array-data-payload but accept all NOPs
1243 // (even unreferenced switch payloads if they make it through the verifier).
1244 break;
1245 default:
1246 return false;
1247 }
1248 }
1249 }
1250 return true;
1251}
1252
1253static bool HasTrivialInitialization(ObjPtr<mirror::Class> cls,
1254 const CompilerOptions& compiler_options)
1255 REQUIRES_SHARED(Locks::mutator_lock_) {
1256 Runtime* runtime = Runtime::Current();
1257 PointerSize pointer_size = runtime->GetClassLinker()->GetImagePointerSize();
1258
1259 // Check the superclass chain.
1260 for (ObjPtr<mirror::Class> klass = cls; klass != nullptr; klass = klass->GetSuperClass()) {
1261 if (klass->IsInitialized() && IsInBootImage(klass, compiler_options)) {
1262 break; // `klass` and its superclasses are already initialized in the boot image.
1263 }
1264 if (!HasTrivialClinit(klass, pointer_size)) {
1265 return false;
1266 }
1267 }
1268
1269 // Also check interfaces with default methods as they need to be initialized as well.
1270 ObjPtr<mirror::IfTable> iftable = cls->GetIfTable();
1271 DCHECK(iftable != nullptr);
1272 for (int32_t i = 0, count = iftable->Count(); i != count; ++i) {
1273 ObjPtr<mirror::Class> iface = iftable->GetInterface(i);
1274 if (!iface->HasDefaultMethods()) {
1275 continue; // Initializing `cls` does not initialize this interface.
1276 }
1277 if (iface->IsInitialized() && IsInBootImage(iface, compiler_options)) {
1278 continue; // This interface is already initialized in the boot image.
1279 }
1280 if (!HasTrivialClinit(iface, pointer_size)) {
1281 return false;
1282 }
1283 }
1284 return true;
1285}
1286
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001287bool HInstructionBuilder::IsInitialized(Handle<mirror::Class> cls) const {
Andreas Gampefa4333d2017-02-14 11:10:34 -08001288 if (cls == nullptr) {
David Brazdildee58d62016-04-07 09:54:26 +00001289 return false;
1290 }
1291
Vladimir Marko51b8aaf2017-06-09 15:17:05 +01001292 // Check if the class will be initialized at runtime.
1293 if (cls->IsInitialized()) {
1294 Runtime* runtime = Runtime::Current();
1295 if (!runtime->IsAotCompiler()) {
1296 DCHECK(runtime->UseJitCompilation());
1297 // For JIT, the class cannot revert to an uninitialized state.
1298 return true;
1299 }
1300 // Assume loaded only if klass is in the boot image. App classes cannot be assumed
1301 // loaded because we don't even know what class loader will be used to load them.
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001302 if (IsInBootImage(cls.Get(), compiler_driver_->GetCompilerOptions())) {
1303 return true;
Vladimir Marko51b8aaf2017-06-09 15:17:05 +01001304 }
1305 }
1306
Vladimir Marko7f260d42018-10-30 18:09:55 +00001307 // We can avoid the class initialization check for `cls` in static methods and constructors
1308 // in the very same class; invoking a static method involves a class initialization check
1309 // and so does the instance allocation that must be executed before invoking a constructor.
1310 // Other instance methods of the same class can run on an escaped instance
Vladimir Marko51b8aaf2017-06-09 15:17:05 +01001311 // of an erroneous class. Even a superclass may need to be checked as the subclass
1312 // can be completely initialized while the superclass is initializing and the subclass
1313 // remains initialized when the superclass initializer throws afterwards. b/62478025
1314 // Note: The HClinitCheck+HInvokeStaticOrDirect merging can still apply.
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001315 auto is_static_method_or_constructor_of_cls = [cls](const DexCompilationUnit& compilation_unit)
1316 REQUIRES_SHARED(Locks::mutator_lock_) {
1317 return (compilation_unit.GetAccessFlags() & (kAccStatic | kAccConstructor)) != 0u &&
1318 compilation_unit.GetCompilingClass().Get() == cls.Get();
1319 };
1320 if (is_static_method_or_constructor_of_cls(*outer_compilation_unit_) ||
1321 // Check also the innermost method. Though excessive copies of ClinitCheck can be
1322 // eliminated by GVN, that happens only after the decision whether to inline the
1323 // graph or not and that may depend on the presence of the ClinitCheck.
1324 // TODO: We should walk over the entire inlined method chain, but we don't pass that
1325 // information to the builder.
1326 is_static_method_or_constructor_of_cls(*dex_compilation_unit_)) {
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001327 return true;
1328 }
David Brazdildee58d62016-04-07 09:54:26 +00001329
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001330 // Otherwise, we may be able to avoid the check if `cls` is a superclass of a method being
1331 // compiled here (anywhere in the inlining chain) as the `cls` must have started initializing
1332 // before calling any `cls` or subclass methods. Static methods require a clinit check and
1333 // instance methods require an instance which cannot be created before doing a clinit check.
1334 // When a subclass of `cls` starts initializing, it starts initializing its superclass
1335 // chain up to `cls` without running any bytecode, i.e. without any opportunity for circular
1336 // initialization weirdness.
1337 //
1338 // If the initialization of `cls` is trivial (`cls` and its superclasses and superinterfaces
1339 // with default methods initialize only their own static fields using constant values), it must
1340 // complete, either successfully or by throwing and marking `cls` erroneous, without allocating
1341 // any instances of `cls` or subclasses (or any other class) and without calling any methods.
1342 // If it completes by throwing, no instances of `cls` shall be created and no subclass method
1343 // bytecode shall execute (see above), therefore the instruction we're building shall be
1344 // unreachable. By reaching the instruction, we know that `cls` was initialized successfully.
1345 //
1346 // TODO: We should walk over the entire inlined methods chain, but we don't pass that
1347 // information to the builder. (We could also check if we're guaranteed a non-null instance
1348 // of `cls` at this location but that's outside the scope of the instruction builder.)
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001349 bool is_subclass = IsSubClass(outer_compilation_unit_->GetCompilingClass().Get(), cls.Get());
1350 if (dex_compilation_unit_ != outer_compilation_unit_) {
1351 is_subclass = is_subclass ||
1352 IsSubClass(dex_compilation_unit_->GetCompilingClass().Get(), cls.Get());
1353 }
Vladimir Marko2ab1bdd2018-07-12 09:59:56 +01001354 if (is_subclass && HasTrivialInitialization(cls.Get(), compiler_driver_->GetCompilerOptions())) {
1355 return true;
1356 }
David Brazdildee58d62016-04-07 09:54:26 +00001357
1358 return false;
1359}
1360
1361HClinitCheck* HInstructionBuilder::ProcessClinitCheckForInvoke(
Vladimir Markofca0b492018-07-23 15:30:52 +01001362 uint32_t dex_pc,
1363 ArtMethod* resolved_method,
1364 HInvokeStaticOrDirect::ClinitCheckRequirement* clinit_check_requirement) {
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001365 Handle<mirror::Class> klass = handles_->NewHandle(resolved_method->GetDeclaringClass());
David Brazdildee58d62016-04-07 09:54:26 +00001366
1367 HClinitCheck* clinit_check = nullptr;
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001368 if (IsInitialized(klass)) {
David Brazdildee58d62016-04-07 09:54:26 +00001369 *clinit_check_requirement = HInvokeStaticOrDirect::ClinitCheckRequirement::kNone;
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001370 } else {
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001371 HLoadClass* cls = BuildLoadClass(klass->GetDexTypeIndex(),
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001372 klass->GetDexFile(),
1373 klass,
1374 dex_pc,
1375 /* needs_access_check */ false);
1376 if (cls != nullptr) {
1377 *clinit_check_requirement = HInvokeStaticOrDirect::ClinitCheckRequirement::kExplicit;
Vladimir Markoca6fff82017-10-03 14:49:14 +01001378 clinit_check = new (allocator_) HClinitCheck(cls, dex_pc);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001379 AppendInstruction(clinit_check);
1380 }
David Brazdildee58d62016-04-07 09:54:26 +00001381 }
1382 return clinit_check;
1383}
1384
1385bool HInstructionBuilder::SetupInvokeArguments(HInvoke* invoke,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001386 const InstructionOperands& operands,
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001387 const char* shorty,
David Brazdildee58d62016-04-07 09:54:26 +00001388 size_t start_index,
1389 size_t* argument_index) {
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001390 uint32_t shorty_index = 1; // Skip the return type.
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001391 const size_t number_of_operands = operands.GetNumberOfOperands();
David Brazdildee58d62016-04-07 09:54:26 +00001392 for (size_t i = start_index;
1393 // Make sure we don't go over the expected arguments or over the number of
1394 // dex registers given. If the instruction was seen as dead by the verifier,
1395 // it hasn't been properly checked.
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001396 (i < number_of_operands) && (*argument_index < invoke->GetNumberOfArguments());
David Brazdildee58d62016-04-07 09:54:26 +00001397 i++, (*argument_index)++) {
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001398 DataType::Type type = DataType::FromShorty(shorty[shorty_index++]);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001399 bool is_wide = (type == DataType::Type::kInt64) || (type == DataType::Type::kFloat64);
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001400 if (is_wide && ((i + 1 == number_of_operands) ||
1401 (operands.GetOperand(i) + 1 != operands.GetOperand(i + 1)))) {
David Brazdildee58d62016-04-07 09:54:26 +00001402 // Longs and doubles should be in pairs, that is, sequential registers. The verifier should
1403 // reject any class where this is violated. However, the verifier only does these checks
1404 // on non trivially dead instructions, so we just bailout the compilation.
1405 VLOG(compiler) << "Did not compile "
David Sehr709b0702016-10-13 09:12:37 -07001406 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
David Brazdildee58d62016-04-07 09:54:26 +00001407 << " because of non-sequential dex register pair in wide argument";
Igor Murashkin1e065a52017-08-09 13:20:34 -07001408 MaybeRecordStat(compilation_stats_,
1409 MethodCompilationStat::kNotCompiledMalformedOpcode);
David Brazdildee58d62016-04-07 09:54:26 +00001410 return false;
1411 }
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001412 HInstruction* arg = LoadLocal(operands.GetOperand(i), type);
David Brazdildee58d62016-04-07 09:54:26 +00001413 invoke->SetArgumentAt(*argument_index, arg);
1414 if (is_wide) {
1415 i++;
1416 }
1417 }
1418
1419 if (*argument_index != invoke->GetNumberOfArguments()) {
1420 VLOG(compiler) << "Did not compile "
David Sehr709b0702016-10-13 09:12:37 -07001421 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
David Brazdildee58d62016-04-07 09:54:26 +00001422 << " because of wrong number of arguments in invoke instruction";
Igor Murashkin1e065a52017-08-09 13:20:34 -07001423 MaybeRecordStat(compilation_stats_,
1424 MethodCompilationStat::kNotCompiledMalformedOpcode);
David Brazdildee58d62016-04-07 09:54:26 +00001425 return false;
1426 }
1427
1428 if (invoke->IsInvokeStaticOrDirect() &&
1429 HInvokeStaticOrDirect::NeedsCurrentMethodInput(
1430 invoke->AsInvokeStaticOrDirect()->GetMethodLoadKind())) {
1431 invoke->SetArgumentAt(*argument_index, graph_->GetCurrentMethod());
1432 (*argument_index)++;
1433 }
1434
1435 return true;
1436}
1437
1438bool HInstructionBuilder::HandleInvoke(HInvoke* invoke,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001439 const InstructionOperands& operands,
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001440 const char* shorty,
1441 bool is_unresolved,
1442 HClinitCheck* clinit_check) {
David Brazdildee58d62016-04-07 09:54:26 +00001443 DCHECK(!invoke->IsInvokeStaticOrDirect() || !invoke->AsInvokeStaticOrDirect()->IsStringInit());
1444
1445 size_t start_index = 0;
1446 size_t argument_index = 0;
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +01001447 if (invoke->GetInvokeType() != InvokeType::kStatic) { // Instance call.
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001448 uint32_t obj_reg = operands.GetOperand(0);
Aart Bik296fbb42016-06-07 13:49:12 -07001449 HInstruction* arg = is_unresolved
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001450 ? LoadLocal(obj_reg, DataType::Type::kReference)
Aart Bik296fbb42016-06-07 13:49:12 -07001451 : LoadNullCheckedLocal(obj_reg, invoke->GetDexPc());
David Brazdilc120bbe2016-04-22 16:57:00 +01001452 invoke->SetArgumentAt(0, arg);
David Brazdildee58d62016-04-07 09:54:26 +00001453 start_index = 1;
1454 argument_index = 1;
1455 }
1456
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001457 if (!SetupInvokeArguments(invoke, operands, shorty, start_index, &argument_index)) {
David Brazdildee58d62016-04-07 09:54:26 +00001458 return false;
1459 }
1460
1461 if (clinit_check != nullptr) {
1462 // Add the class initialization check as last input of `invoke`.
1463 DCHECK(invoke->IsInvokeStaticOrDirect());
1464 DCHECK(invoke->AsInvokeStaticOrDirect()->GetClinitCheckRequirement()
1465 == HInvokeStaticOrDirect::ClinitCheckRequirement::kExplicit);
1466 invoke->SetArgumentAt(argument_index, clinit_check);
1467 argument_index++;
1468 }
1469
1470 AppendInstruction(invoke);
1471 latest_result_ = invoke;
1472
1473 return true;
1474}
1475
1476bool HInstructionBuilder::HandleStringInit(HInvoke* invoke,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001477 const InstructionOperands& operands,
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001478 const char* shorty) {
David Brazdildee58d62016-04-07 09:54:26 +00001479 DCHECK(invoke->IsInvokeStaticOrDirect());
1480 DCHECK(invoke->AsInvokeStaticOrDirect()->IsStringInit());
1481
1482 size_t start_index = 1;
1483 size_t argument_index = 0;
Orion Hodson4c8e12e2018-05-18 08:33:20 +01001484 if (!SetupInvokeArguments(invoke, operands, shorty, start_index, &argument_index)) {
David Brazdildee58d62016-04-07 09:54:26 +00001485 return false;
1486 }
1487
1488 AppendInstruction(invoke);
1489
1490 // This is a StringFactory call, not an actual String constructor. Its result
1491 // replaces the empty String pre-allocated by NewInstance.
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001492 uint32_t orig_this_reg = operands.GetOperand(0);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001493 HInstruction* arg_this = LoadLocal(orig_this_reg, DataType::Type::kReference);
David Brazdildee58d62016-04-07 09:54:26 +00001494
1495 // Replacing the NewInstance might render it redundant. Keep a list of these
Nicolas Geoffray8a62a4c2018-07-03 09:39:07 +01001496 // to be visited once it is clear whether it has remaining uses.
David Brazdildee58d62016-04-07 09:54:26 +00001497 if (arg_this->IsNewInstance()) {
1498 ssa_builder_->AddUninitializedString(arg_this->AsNewInstance());
Nicolas Geoffray8a62a4c2018-07-03 09:39:07 +01001499 } else {
1500 DCHECK(arg_this->IsPhi());
1501 // We can get a phi as input of a String.<init> if there is a loop between the
1502 // allocation and the String.<init> call. As we don't know which other phis might alias
Nicolas Geoffray0846a8f2018-09-12 15:21:07 +01001503 // with `arg_this`, we keep a record of those invocations so we can later replace
1504 // the allocation with the invocation.
1505 // Add the actual 'this' input so the analysis knows what is the allocation instruction.
1506 // The input will be removed during the analysis.
1507 invoke->AddInput(arg_this);
1508 ssa_builder_->AddUninitializedStringPhi(invoke);
1509 }
1510 // Walk over all vregs and replace any occurrence of `arg_this` with `invoke`.
1511 for (size_t vreg = 0, e = current_locals_->size(); vreg < e; ++vreg) {
1512 if ((*current_locals_)[vreg] == arg_this) {
1513 (*current_locals_)[vreg] = invoke;
1514 }
David Brazdildee58d62016-04-07 09:54:26 +00001515 }
David Brazdildee58d62016-04-07 09:54:26 +00001516 return true;
1517}
1518
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001519static DataType::Type GetFieldAccessType(const DexFile& dex_file, uint16_t field_index) {
David Brazdildee58d62016-04-07 09:54:26 +00001520 const DexFile::FieldId& field_id = dex_file.GetFieldId(field_index);
1521 const char* type = dex_file.GetFieldTypeDescriptor(field_id);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001522 return DataType::FromShorty(type[0]);
David Brazdildee58d62016-04-07 09:54:26 +00001523}
1524
1525bool HInstructionBuilder::BuildInstanceFieldAccess(const Instruction& instruction,
1526 uint32_t dex_pc,
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07001527 bool is_put,
1528 size_t quicken_index) {
David Brazdildee58d62016-04-07 09:54:26 +00001529 uint32_t source_or_dest_reg = instruction.VRegA_22c();
1530 uint32_t obj_reg = instruction.VRegB_22c();
1531 uint16_t field_index;
1532 if (instruction.IsQuickened()) {
1533 if (!CanDecodeQuickenedInfo()) {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00001534 VLOG(compiler) << "Not compiled: Could not decode quickened instruction "
1535 << instruction.Opcode();
David Brazdildee58d62016-04-07 09:54:26 +00001536 return false;
1537 }
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07001538 field_index = LookupQuickenedInfo(quicken_index);
David Brazdildee58d62016-04-07 09:54:26 +00001539 } else {
1540 field_index = instruction.VRegC_22c();
1541 }
1542
1543 ScopedObjectAccess soa(Thread::Current());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001544 ArtField* resolved_field = ResolveField(field_index, /* is_static */ false, is_put);
David Brazdildee58d62016-04-07 09:54:26 +00001545
Aart Bik14154132016-06-02 17:53:58 -07001546 // Generate an explicit null check on the reference, unless the field access
1547 // is unresolved. In that case, we rely on the runtime to perform various
1548 // checks first, followed by a null check.
1549 HInstruction* object = (resolved_field == nullptr)
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001550 ? LoadLocal(obj_reg, DataType::Type::kReference)
Aart Bik14154132016-06-02 17:53:58 -07001551 : LoadNullCheckedLocal(obj_reg, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001552
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001553 DataType::Type field_type = GetFieldAccessType(*dex_file_, field_index);
David Brazdildee58d62016-04-07 09:54:26 +00001554 if (is_put) {
1555 HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
1556 HInstruction* field_set = nullptr;
1557 if (resolved_field == nullptr) {
Igor Murashkin1e065a52017-08-09 13:20:34 -07001558 MaybeRecordStat(compilation_stats_,
1559 MethodCompilationStat::kUnresolvedField);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001560 field_set = new (allocator_) HUnresolvedInstanceFieldSet(object,
1561 value,
1562 field_type,
1563 field_index,
1564 dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001565 } else {
1566 uint16_t class_def_index = resolved_field->GetDeclaringClass()->GetDexClassDefIndex();
Vladimir Markoca6fff82017-10-03 14:49:14 +01001567 field_set = new (allocator_) HInstanceFieldSet(object,
1568 value,
1569 resolved_field,
1570 field_type,
1571 resolved_field->GetOffset(),
1572 resolved_field->IsVolatile(),
1573 field_index,
1574 class_def_index,
1575 *dex_file_,
1576 dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001577 }
1578 AppendInstruction(field_set);
1579 } else {
1580 HInstruction* field_get = nullptr;
1581 if (resolved_field == nullptr) {
Igor Murashkin1e065a52017-08-09 13:20:34 -07001582 MaybeRecordStat(compilation_stats_,
1583 MethodCompilationStat::kUnresolvedField);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001584 field_get = new (allocator_) HUnresolvedInstanceFieldGet(object,
1585 field_type,
1586 field_index,
1587 dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001588 } else {
1589 uint16_t class_def_index = resolved_field->GetDeclaringClass()->GetDexClassDefIndex();
Vladimir Markoca6fff82017-10-03 14:49:14 +01001590 field_get = new (allocator_) HInstanceFieldGet(object,
1591 resolved_field,
1592 field_type,
1593 resolved_field->GetOffset(),
1594 resolved_field->IsVolatile(),
1595 field_index,
1596 class_def_index,
1597 *dex_file_,
1598 dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001599 }
1600 AppendInstruction(field_get);
1601 UpdateLocal(source_or_dest_reg, field_get);
1602 }
1603
1604 return true;
1605}
1606
David Brazdildee58d62016-04-07 09:54:26 +00001607void HInstructionBuilder::BuildUnresolvedStaticFieldAccess(const Instruction& instruction,
Nicolas Geoffrayc52b26d2016-12-19 09:18:07 +00001608 uint32_t dex_pc,
1609 bool is_put,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001610 DataType::Type field_type) {
David Brazdildee58d62016-04-07 09:54:26 +00001611 uint32_t source_or_dest_reg = instruction.VRegA_21c();
1612 uint16_t field_index = instruction.VRegB_21c();
1613
1614 if (is_put) {
1615 HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
1616 AppendInstruction(
Vladimir Markoca6fff82017-10-03 14:49:14 +01001617 new (allocator_) HUnresolvedStaticFieldSet(value, field_type, field_index, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001618 } else {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001619 AppendInstruction(new (allocator_) HUnresolvedStaticFieldGet(field_type, field_index, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001620 UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
1621 }
1622}
1623
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001624ArtField* HInstructionBuilder::ResolveField(uint16_t field_idx, bool is_static, bool is_put) {
1625 ScopedObjectAccess soa(Thread::Current());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001626
1627 ClassLinker* class_linker = dex_compilation_unit_->GetClassLinker();
Vladimir Marko8d6768d2017-03-14 10:13:21 +00001628 Handle<mirror::ClassLoader> class_loader = dex_compilation_unit_->GetClassLoader();
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001629
Vladimir Markoe11dd502017-12-08 14:09:45 +00001630 ArtField* resolved_field = class_linker->ResolveField(field_idx,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001631 dex_compilation_unit_->GetDexCache(),
1632 class_loader,
1633 is_static);
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001634 DCHECK_EQ(resolved_field == nullptr, soa.Self()->IsExceptionPending());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001635 if (UNLIKELY(resolved_field == nullptr)) {
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001636 // Clean up any exception left by field resolution.
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001637 soa.Self()->ClearException();
1638 return nullptr;
1639 }
1640
1641 // Check static/instance. The class linker has a fast path for looking into the dex cache
1642 // and does not check static/instance if it hits it.
1643 if (UNLIKELY(resolved_field->IsStatic() != is_static)) {
1644 return nullptr;
1645 }
1646
1647 // Check access.
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001648 Handle<mirror::Class> compiling_class = dex_compilation_unit_->GetCompilingClass();
Andreas Gampefa4333d2017-02-14 11:10:34 -08001649 if (compiling_class == nullptr) {
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001650 if (!resolved_field->IsPublic()) {
1651 return nullptr;
1652 }
1653 } else if (!compiling_class->CanAccessResolvedField(resolved_field->GetDeclaringClass(),
1654 resolved_field,
1655 dex_compilation_unit_->GetDexCache().Get(),
1656 field_idx)) {
1657 return nullptr;
1658 }
1659
1660 if (is_put &&
1661 resolved_field->IsFinal() &&
1662 (compiling_class.Get() != resolved_field->GetDeclaringClass())) {
1663 // Final fields can only be updated within their own class.
1664 // TODO: Only allow it in constructors. b/34966607.
1665 return nullptr;
1666 }
1667
1668 return resolved_field;
1669}
1670
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00001671void HInstructionBuilder::BuildStaticFieldAccess(const Instruction& instruction,
David Brazdildee58d62016-04-07 09:54:26 +00001672 uint32_t dex_pc,
1673 bool is_put) {
1674 uint32_t source_or_dest_reg = instruction.VRegA_21c();
1675 uint16_t field_index = instruction.VRegB_21c();
1676
1677 ScopedObjectAccess soa(Thread::Current());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001678 ArtField* resolved_field = ResolveField(field_index, /* is_static */ true, is_put);
David Brazdildee58d62016-04-07 09:54:26 +00001679
1680 if (resolved_field == nullptr) {
Igor Murashkin1e065a52017-08-09 13:20:34 -07001681 MaybeRecordStat(compilation_stats_,
1682 MethodCompilationStat::kUnresolvedField);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001683 DataType::Type field_type = GetFieldAccessType(*dex_file_, field_index);
David Brazdildee58d62016-04-07 09:54:26 +00001684 BuildUnresolvedStaticFieldAccess(instruction, dex_pc, is_put, field_type);
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00001685 return;
David Brazdildee58d62016-04-07 09:54:26 +00001686 }
1687
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001688 DataType::Type field_type = GetFieldAccessType(*dex_file_, field_index);
David Brazdildee58d62016-04-07 09:54:26 +00001689
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001690 Handle<mirror::Class> klass = handles_->NewHandle(resolved_field->GetDeclaringClass());
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001691 HLoadClass* constant = BuildLoadClass(klass->GetDexTypeIndex(),
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001692 klass->GetDexFile(),
1693 klass,
1694 dex_pc,
1695 /* needs_access_check */ false);
1696
1697 if (constant == nullptr) {
1698 // The class cannot be referenced from this compiled code. Generate
1699 // an unresolved access.
Igor Murashkin1e065a52017-08-09 13:20:34 -07001700 MaybeRecordStat(compilation_stats_,
1701 MethodCompilationStat::kUnresolvedFieldNotAFastAccess);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001702 BuildUnresolvedStaticFieldAccess(instruction, dex_pc, is_put, field_type);
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00001703 return;
David Brazdildee58d62016-04-07 09:54:26 +00001704 }
1705
David Brazdildee58d62016-04-07 09:54:26 +00001706 HInstruction* cls = constant;
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001707 if (!IsInitialized(klass)) {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001708 cls = new (allocator_) HClinitCheck(constant, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001709 AppendInstruction(cls);
1710 }
1711
1712 uint16_t class_def_index = klass->GetDexClassDefIndex();
1713 if (is_put) {
1714 // We need to keep the class alive before loading the value.
1715 HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
1716 DCHECK_EQ(HPhi::ToPhiType(value->GetType()), HPhi::ToPhiType(field_type));
Vladimir Markoca6fff82017-10-03 14:49:14 +01001717 AppendInstruction(new (allocator_) HStaticFieldSet(cls,
1718 value,
1719 resolved_field,
1720 field_type,
1721 resolved_field->GetOffset(),
1722 resolved_field->IsVolatile(),
1723 field_index,
1724 class_def_index,
1725 *dex_file_,
1726 dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001727 } else {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001728 AppendInstruction(new (allocator_) HStaticFieldGet(cls,
1729 resolved_field,
1730 field_type,
1731 resolved_field->GetOffset(),
1732 resolved_field->IsVolatile(),
1733 field_index,
1734 class_def_index,
1735 *dex_file_,
1736 dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001737 UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
1738 }
David Brazdildee58d62016-04-07 09:54:26 +00001739}
1740
1741void HInstructionBuilder::BuildCheckedDivRem(uint16_t out_vreg,
Vladimir Markoca6fff82017-10-03 14:49:14 +01001742 uint16_t first_vreg,
1743 int64_t second_vreg_or_constant,
1744 uint32_t dex_pc,
1745 DataType::Type type,
1746 bool second_is_constant,
1747 bool isDiv) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001748 DCHECK(type == DataType::Type::kInt32 || type == DataType::Type::kInt64);
David Brazdildee58d62016-04-07 09:54:26 +00001749
1750 HInstruction* first = LoadLocal(first_vreg, type);
1751 HInstruction* second = nullptr;
1752 if (second_is_constant) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001753 if (type == DataType::Type::kInt32) {
David Brazdildee58d62016-04-07 09:54:26 +00001754 second = graph_->GetIntConstant(second_vreg_or_constant, dex_pc);
1755 } else {
1756 second = graph_->GetLongConstant(second_vreg_or_constant, dex_pc);
1757 }
1758 } else {
1759 second = LoadLocal(second_vreg_or_constant, type);
1760 }
1761
1762 if (!second_is_constant
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001763 || (type == DataType::Type::kInt32 && second->AsIntConstant()->GetValue() == 0)
1764 || (type == DataType::Type::kInt64 && second->AsLongConstant()->GetValue() == 0)) {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001765 second = new (allocator_) HDivZeroCheck(second, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001766 AppendInstruction(second);
1767 }
1768
1769 if (isDiv) {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001770 AppendInstruction(new (allocator_) HDiv(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001771 } else {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001772 AppendInstruction(new (allocator_) HRem(type, first, second, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001773 }
1774 UpdateLocal(out_vreg, current_block_->GetLastInstruction());
1775}
1776
1777void HInstructionBuilder::BuildArrayAccess(const Instruction& instruction,
1778 uint32_t dex_pc,
1779 bool is_put,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001780 DataType::Type anticipated_type) {
David Brazdildee58d62016-04-07 09:54:26 +00001781 uint8_t source_or_dest_reg = instruction.VRegA_23x();
1782 uint8_t array_reg = instruction.VRegB_23x();
1783 uint8_t index_reg = instruction.VRegC_23x();
1784
David Brazdilc120bbe2016-04-22 16:57:00 +01001785 HInstruction* object = LoadNullCheckedLocal(array_reg, dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001786 HInstruction* length = new (allocator_) HArrayLength(object, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001787 AppendInstruction(length);
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001788 HInstruction* index = LoadLocal(index_reg, DataType::Type::kInt32);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001789 index = new (allocator_) HBoundsCheck(index, length, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001790 AppendInstruction(index);
1791 if (is_put) {
1792 HInstruction* value = LoadLocal(source_or_dest_reg, anticipated_type);
1793 // TODO: Insert a type check node if the type is Object.
Vladimir Markoca6fff82017-10-03 14:49:14 +01001794 HArraySet* aset = new (allocator_) HArraySet(object, index, value, anticipated_type, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001795 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
1796 AppendInstruction(aset);
1797 } else {
Vladimir Markoca6fff82017-10-03 14:49:14 +01001798 HArrayGet* aget = new (allocator_) HArrayGet(object, index, anticipated_type, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001799 ssa_builder_->MaybeAddAmbiguousArrayGet(aget);
1800 AppendInstruction(aget);
1801 UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
1802 }
1803 graph_->SetHasBoundsChecks(true);
1804}
1805
Vladimir Markob5461632018-10-15 14:24:21 +01001806HNewArray* HInstructionBuilder::BuildNewArray(uint32_t dex_pc,
1807 dex::TypeIndex type_index,
1808 HInstruction* length) {
1809 HLoadClass* cls = BuildLoadClass(type_index, dex_pc);
1810
1811 const char* descriptor = dex_file_->GetTypeDescriptor(dex_file_->GetTypeId(type_index));
1812 DCHECK_EQ(descriptor[0], '[');
1813 size_t component_type_shift = Primitive::ComponentSizeShift(Primitive::GetType(descriptor[1]));
1814
1815 HNewArray* new_array = new (allocator_) HNewArray(cls, length, dex_pc, component_type_shift);
1816 AppendInstruction(new_array);
1817 return new_array;
1818}
1819
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001820HNewArray* HInstructionBuilder::BuildFilledNewArray(uint32_t dex_pc,
1821 dex::TypeIndex type_index,
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001822 const InstructionOperands& operands) {
1823 const size_t number_of_operands = operands.GetNumberOfOperands();
1824 HInstruction* length = graph_->GetIntConstant(number_of_operands, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001825
Vladimir Markob5461632018-10-15 14:24:21 +01001826 HNewArray* new_array = BuildNewArray(dex_pc, type_index, length);
David Brazdildee58d62016-04-07 09:54:26 +00001827 const char* descriptor = dex_file_->StringByTypeIdx(type_index);
1828 DCHECK_EQ(descriptor[0], '[') << descriptor;
1829 char primitive = descriptor[1];
1830 DCHECK(primitive == 'I'
1831 || primitive == 'L'
1832 || primitive == '[') << descriptor;
1833 bool is_reference_array = (primitive == 'L') || (primitive == '[');
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001834 DataType::Type type = is_reference_array ? DataType::Type::kReference : DataType::Type::kInt32;
David Brazdildee58d62016-04-07 09:54:26 +00001835
Treehugger Robot2c5827a2018-05-17 22:26:08 +00001836 for (size_t i = 0; i < number_of_operands; ++i) {
1837 HInstruction* value = LoadLocal(operands.GetOperand(i), type);
David Brazdildee58d62016-04-07 09:54:26 +00001838 HInstruction* index = graph_->GetIntConstant(i, dex_pc);
Vladimir Markob5461632018-10-15 14:24:21 +01001839 HArraySet* aset = new (allocator_) HArraySet(new_array, index, value, type, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001840 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
1841 AppendInstruction(aset);
1842 }
Vladimir Markob5461632018-10-15 14:24:21 +01001843 latest_result_ = new_array;
Igor Murashkin79d8fa72017-04-18 09:37:23 -07001844
Vladimir Markob5461632018-10-15 14:24:21 +01001845 return new_array;
David Brazdildee58d62016-04-07 09:54:26 +00001846}
1847
1848template <typename T>
1849void HInstructionBuilder::BuildFillArrayData(HInstruction* object,
1850 const T* data,
1851 uint32_t element_count,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001852 DataType::Type anticipated_type,
David Brazdildee58d62016-04-07 09:54:26 +00001853 uint32_t dex_pc) {
1854 for (uint32_t i = 0; i < element_count; ++i) {
1855 HInstruction* index = graph_->GetIntConstant(i, dex_pc);
1856 HInstruction* value = graph_->GetIntConstant(data[i], dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001857 HArraySet* aset = new (allocator_) HArraySet(object, index, value, anticipated_type, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001858 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
1859 AppendInstruction(aset);
1860 }
1861}
1862
1863void HInstructionBuilder::BuildFillArrayData(const Instruction& instruction, uint32_t dex_pc) {
David Brazdilc120bbe2016-04-22 16:57:00 +01001864 HInstruction* array = LoadNullCheckedLocal(instruction.VRegA_31t(), dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001865
1866 int32_t payload_offset = instruction.VRegB_31t() + dex_pc;
1867 const Instruction::ArrayDataPayload* payload =
Mathieu Chartier808c7a52017-12-15 11:19:33 -08001868 reinterpret_cast<const Instruction::ArrayDataPayload*>(
1869 code_item_accessor_.Insns() + payload_offset);
David Brazdildee58d62016-04-07 09:54:26 +00001870 const uint8_t* data = payload->data;
1871 uint32_t element_count = payload->element_count;
1872
Vladimir Markoc69fba22016-09-06 16:49:15 +01001873 if (element_count == 0u) {
1874 // For empty payload we emit only the null check above.
1875 return;
1876 }
1877
Vladimir Markoca6fff82017-10-03 14:49:14 +01001878 HInstruction* length = new (allocator_) HArrayLength(array, dex_pc);
Vladimir Markoc69fba22016-09-06 16:49:15 +01001879 AppendInstruction(length);
1880
David Brazdildee58d62016-04-07 09:54:26 +00001881 // Implementation of this DEX instruction seems to be that the bounds check is
1882 // done before doing any stores.
1883 HInstruction* last_index = graph_->GetIntConstant(payload->element_count - 1, dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001884 AppendInstruction(new (allocator_) HBoundsCheck(last_index, length, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00001885
1886 switch (payload->element_width) {
1887 case 1:
David Brazdilc120bbe2016-04-22 16:57:00 +01001888 BuildFillArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00001889 reinterpret_cast<const int8_t*>(data),
1890 element_count,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001891 DataType::Type::kInt8,
David Brazdildee58d62016-04-07 09:54:26 +00001892 dex_pc);
1893 break;
1894 case 2:
David Brazdilc120bbe2016-04-22 16:57:00 +01001895 BuildFillArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00001896 reinterpret_cast<const int16_t*>(data),
1897 element_count,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001898 DataType::Type::kInt16,
David Brazdildee58d62016-04-07 09:54:26 +00001899 dex_pc);
1900 break;
1901 case 4:
David Brazdilc120bbe2016-04-22 16:57:00 +01001902 BuildFillArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00001903 reinterpret_cast<const int32_t*>(data),
1904 element_count,
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01001905 DataType::Type::kInt32,
David Brazdildee58d62016-04-07 09:54:26 +00001906 dex_pc);
1907 break;
1908 case 8:
David Brazdilc120bbe2016-04-22 16:57:00 +01001909 BuildFillWideArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00001910 reinterpret_cast<const int64_t*>(data),
1911 element_count,
1912 dex_pc);
1913 break;
1914 default:
1915 LOG(FATAL) << "Unknown element width for " << payload->element_width;
1916 }
1917 graph_->SetHasBoundsChecks(true);
1918}
1919
1920void HInstructionBuilder::BuildFillWideArrayData(HInstruction* object,
1921 const int64_t* data,
1922 uint32_t element_count,
1923 uint32_t dex_pc) {
1924 for (uint32_t i = 0; i < element_count; ++i) {
1925 HInstruction* index = graph_->GetIntConstant(i, dex_pc);
1926 HInstruction* value = graph_->GetLongConstant(data[i], dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01001927 HArraySet* aset =
1928 new (allocator_) HArraySet(object, index, value, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001929 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
1930 AppendInstruction(aset);
1931 }
1932}
1933
Vladimir Marko28e012a2017-12-07 11:22:59 +00001934void HInstructionBuilder::BuildLoadString(dex::StringIndex string_index, uint32_t dex_pc) {
1935 HLoadString* load_string =
1936 new (allocator_) HLoadString(graph_->GetCurrentMethod(), string_index, *dex_file_, dex_pc);
1937 HSharpening::ProcessLoadString(load_string,
1938 code_generator_,
Vladimir Marko28e012a2017-12-07 11:22:59 +00001939 *dex_compilation_unit_,
1940 handles_);
1941 AppendInstruction(load_string);
1942}
1943
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001944HLoadClass* HInstructionBuilder::BuildLoadClass(dex::TypeIndex type_index, uint32_t dex_pc) {
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001945 ScopedObjectAccess soa(Thread::Current());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001946 const DexFile& dex_file = *dex_compilation_unit_->GetDexFile();
Vladimir Marko175e7862018-03-27 09:03:13 +00001947 Handle<mirror::Class> klass = ResolveClass(soa, type_index);
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001948 bool needs_access_check = LoadClassNeedsAccessCheck(klass);
1949 return BuildLoadClass(type_index, dex_file, klass, dex_pc, needs_access_check);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001950}
1951
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001952HLoadClass* HInstructionBuilder::BuildLoadClass(dex::TypeIndex type_index,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001953 const DexFile& dex_file,
1954 Handle<mirror::Class> klass,
1955 uint32_t dex_pc,
1956 bool needs_access_check) {
1957 // Try to find a reference in the compiling dex file.
1958 const DexFile* actual_dex_file = &dex_file;
1959 if (!IsSameDexFile(dex_file, *dex_compilation_unit_->GetDexFile())) {
1960 dex::TypeIndex local_type_index =
1961 klass->FindTypeIndexInOtherDexFile(*dex_compilation_unit_->GetDexFile());
1962 if (local_type_index.IsValid()) {
1963 type_index = local_type_index;
1964 actual_dex_file = dex_compilation_unit_->GetDexFile();
1965 }
1966 }
1967
1968 // Note: `klass` must be from `handles_`.
Vladimir Markoa2c211c2018-11-01 09:50:52 +00001969 bool is_referrers_class =
1970 (klass != nullptr) && (outer_compilation_unit_->GetCompilingClass().Get() == klass.Get());
Vladimir Markoca6fff82017-10-03 14:49:14 +01001971 HLoadClass* load_class = new (allocator_) HLoadClass(
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001972 graph_->GetCurrentMethod(),
1973 type_index,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001974 *actual_dex_file,
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001975 klass,
Vladimir Markofca0b492018-07-23 15:30:52 +01001976 is_referrers_class,
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001977 dex_pc,
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001978 needs_access_check);
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001979
Nicolas Geoffrayc4aa82c2017-03-06 14:38:52 +00001980 HLoadClass::LoadKind load_kind = HSharpening::ComputeLoadClassKind(load_class,
1981 code_generator_,
Nicolas Geoffrayc4aa82c2017-03-06 14:38:52 +00001982 *dex_compilation_unit_);
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001983
1984 if (load_kind == HLoadClass::LoadKind::kInvalid) {
1985 // We actually cannot reference this class, we're forced to bail.
1986 return nullptr;
1987 }
Vladimir Marko28e012a2017-12-07 11:22:59 +00001988 // Load kind must be set before inserting the instruction into the graph.
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00001989 load_class->SetLoadKind(load_kind);
Vladimir Marko28e012a2017-12-07 11:22:59 +00001990 AppendInstruction(load_class);
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001991 return load_class;
1992}
1993
Vladimir Marko175e7862018-03-27 09:03:13 +00001994Handle<mirror::Class> HInstructionBuilder::ResolveClass(ScopedObjectAccess& soa,
1995 dex::TypeIndex type_index) {
1996 Handle<mirror::ClassLoader> class_loader = dex_compilation_unit_->GetClassLoader();
1997 ObjPtr<mirror::Class> klass = compiler_driver_->ResolveClass(
1998 soa, dex_compilation_unit_->GetDexCache(), class_loader, type_index, dex_compilation_unit_);
1999 // TODO: Avoid creating excessive handles if the method references the same class repeatedly.
2000 // (Use a map on the local_allocator_.)
2001 return handles_->NewHandle(klass);
2002}
2003
Vladimir Markoa2c211c2018-11-01 09:50:52 +00002004bool HInstructionBuilder::LoadClassNeedsAccessCheck(Handle<mirror::Class> klass) {
Vladimir Marko175e7862018-03-27 09:03:13 +00002005 if (klass == nullptr) {
2006 return true;
2007 } else if (klass->IsPublic()) {
2008 return false;
2009 } else {
Vladimir Markoa2c211c2018-11-01 09:50:52 +00002010 ObjPtr<mirror::Class> compiling_class = dex_compilation_unit_->GetCompilingClass().Get();
Vladimir Marko175e7862018-03-27 09:03:13 +00002011 return compiling_class == nullptr || !compiling_class->CanAccess(klass.Get());
2012 }
2013}
2014
Orion Hodson06d10a72018-05-14 08:53:38 +01002015void HInstructionBuilder::BuildLoadMethodHandle(uint16_t method_handle_index, uint32_t dex_pc) {
Orion Hodsondbaa5c72018-05-10 08:22:46 +01002016 const DexFile& dex_file = *dex_compilation_unit_->GetDexFile();
Orion Hodson06d10a72018-05-14 08:53:38 +01002017 HLoadMethodHandle* load_method_handle = new (allocator_) HLoadMethodHandle(
2018 graph_->GetCurrentMethod(), method_handle_index, dex_file, dex_pc);
Orion Hodsondbaa5c72018-05-10 08:22:46 +01002019 AppendInstruction(load_method_handle);
2020}
2021
Orion Hodson06d10a72018-05-14 08:53:38 +01002022void HInstructionBuilder::BuildLoadMethodType(dex::ProtoIndex proto_index, uint32_t dex_pc) {
Orion Hodson18259d72018-04-12 11:18:23 +01002023 const DexFile& dex_file = *dex_compilation_unit_->GetDexFile();
2024 HLoadMethodType* load_method_type =
Orion Hodson06d10a72018-05-14 08:53:38 +01002025 new (allocator_) HLoadMethodType(graph_->GetCurrentMethod(), proto_index, dex_file, dex_pc);
Orion Hodson18259d72018-04-12 11:18:23 +01002026 AppendInstruction(load_method_type);
2027}
2028
David Brazdildee58d62016-04-07 09:54:26 +00002029void HInstructionBuilder::BuildTypeCheck(const Instruction& instruction,
2030 uint8_t destination,
2031 uint8_t reference,
Andreas Gampea5b09a62016-11-17 15:21:22 -08002032 dex::TypeIndex type_index,
David Brazdildee58d62016-04-07 09:54:26 +00002033 uint32_t dex_pc) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002034 HInstruction* object = LoadLocal(reference, DataType::Type::kReference);
David Brazdildee58d62016-04-07 09:54:26 +00002035
Nicolas Geoffray5247c082017-01-13 14:17:29 +00002036 ScopedObjectAccess soa(Thread::Current());
Vladimir Marko175e7862018-03-27 09:03:13 +00002037 const DexFile& dex_file = *dex_compilation_unit_->GetDexFile();
2038 Handle<mirror::Class> klass = ResolveClass(soa, type_index);
Vladimir Markoa2c211c2018-11-01 09:50:52 +00002039 bool needs_access_check = LoadClassNeedsAccessCheck(klass);
Vladimir Marko175e7862018-03-27 09:03:13 +00002040 TypeCheckKind check_kind = HSharpening::ComputeTypeCheckKind(
Vladimir Markodc4bcce2018-06-21 16:15:42 +01002041 klass.Get(), code_generator_, needs_access_check);
Vladimir Marko175e7862018-03-27 09:03:13 +00002042
2043 HInstruction* class_or_null = nullptr;
2044 HIntConstant* bitstring_path_to_root = nullptr;
2045 HIntConstant* bitstring_mask = nullptr;
2046 if (check_kind == TypeCheckKind::kBitstringCheck) {
2047 // TODO: Allow using the bitstring check also if we need an access check.
2048 DCHECK(!needs_access_check);
2049 class_or_null = graph_->GetNullConstant(dex_pc);
2050 MutexLock subtype_check_lock(Thread::Current(), *Locks::subtype_check_lock_);
2051 uint32_t path_to_root =
2052 SubtypeCheck<ObjPtr<mirror::Class>>::GetEncodedPathToRootForTarget(klass.Get());
2053 uint32_t mask = SubtypeCheck<ObjPtr<mirror::Class>>::GetEncodedPathToRootMask(klass.Get());
2054 bitstring_path_to_root = graph_->GetIntConstant(static_cast<int32_t>(path_to_root), dex_pc);
2055 bitstring_mask = graph_->GetIntConstant(static_cast<int32_t>(mask), dex_pc);
2056 } else {
Vladimir Markoa2c211c2018-11-01 09:50:52 +00002057 class_or_null = BuildLoadClass(type_index, dex_file, klass, dex_pc, needs_access_check);
Vladimir Marko175e7862018-03-27 09:03:13 +00002058 }
2059 DCHECK(class_or_null != nullptr);
2060
David Brazdildee58d62016-04-07 09:54:26 +00002061 if (instruction.Opcode() == Instruction::INSTANCE_OF) {
Vladimir Marko175e7862018-03-27 09:03:13 +00002062 AppendInstruction(new (allocator_) HInstanceOf(object,
2063 class_or_null,
2064 check_kind,
2065 klass,
2066 dex_pc,
2067 allocator_,
2068 bitstring_path_to_root,
2069 bitstring_mask));
David Brazdildee58d62016-04-07 09:54:26 +00002070 UpdateLocal(destination, current_block_->GetLastInstruction());
2071 } else {
2072 DCHECK_EQ(instruction.Opcode(), Instruction::CHECK_CAST);
2073 // We emit a CheckCast followed by a BoundType. CheckCast is a statement
2074 // which may throw. If it succeeds BoundType sets the new type of `object`
2075 // for all subsequent uses.
Vladimir Marko175e7862018-03-27 09:03:13 +00002076 AppendInstruction(
2077 new (allocator_) HCheckCast(object,
2078 class_or_null,
2079 check_kind,
2080 klass,
2081 dex_pc,
2082 allocator_,
2083 bitstring_path_to_root,
2084 bitstring_mask));
Vladimir Markoca6fff82017-10-03 14:49:14 +01002085 AppendInstruction(new (allocator_) HBoundType(object, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00002086 UpdateLocal(reference, current_block_->GetLastInstruction());
2087 }
2088}
2089
David Brazdildee58d62016-04-07 09:54:26 +00002090bool HInstructionBuilder::CanDecodeQuickenedInfo() const {
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002091 return !quicken_info_.IsNull();
David Brazdildee58d62016-04-07 09:54:26 +00002092}
2093
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002094uint16_t HInstructionBuilder::LookupQuickenedInfo(uint32_t quicken_index) {
2095 DCHECK(CanDecodeQuickenedInfo());
2096 return quicken_info_.GetData(quicken_index);
David Brazdildee58d62016-04-07 09:54:26 +00002097}
2098
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002099bool HInstructionBuilder::ProcessDexInstruction(const Instruction& instruction,
2100 uint32_t dex_pc,
2101 size_t quicken_index) {
David Brazdildee58d62016-04-07 09:54:26 +00002102 switch (instruction.Opcode()) {
2103 case Instruction::CONST_4: {
2104 int32_t register_index = instruction.VRegA();
2105 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_11n(), dex_pc);
2106 UpdateLocal(register_index, constant);
2107 break;
2108 }
2109
2110 case Instruction::CONST_16: {
2111 int32_t register_index = instruction.VRegA();
2112 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_21s(), dex_pc);
2113 UpdateLocal(register_index, constant);
2114 break;
2115 }
2116
2117 case Instruction::CONST: {
2118 int32_t register_index = instruction.VRegA();
2119 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_31i(), dex_pc);
2120 UpdateLocal(register_index, constant);
2121 break;
2122 }
2123
2124 case Instruction::CONST_HIGH16: {
2125 int32_t register_index = instruction.VRegA();
2126 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_21h() << 16, dex_pc);
2127 UpdateLocal(register_index, constant);
2128 break;
2129 }
2130
2131 case Instruction::CONST_WIDE_16: {
2132 int32_t register_index = instruction.VRegA();
2133 // Get 16 bits of constant value, sign extended to 64 bits.
2134 int64_t value = instruction.VRegB_21s();
2135 value <<= 48;
2136 value >>= 48;
2137 HLongConstant* constant = graph_->GetLongConstant(value, dex_pc);
2138 UpdateLocal(register_index, constant);
2139 break;
2140 }
2141
2142 case Instruction::CONST_WIDE_32: {
2143 int32_t register_index = instruction.VRegA();
2144 // Get 32 bits of constant value, sign extended to 64 bits.
2145 int64_t value = instruction.VRegB_31i();
2146 value <<= 32;
2147 value >>= 32;
2148 HLongConstant* constant = graph_->GetLongConstant(value, dex_pc);
2149 UpdateLocal(register_index, constant);
2150 break;
2151 }
2152
2153 case Instruction::CONST_WIDE: {
2154 int32_t register_index = instruction.VRegA();
2155 HLongConstant* constant = graph_->GetLongConstant(instruction.VRegB_51l(), dex_pc);
2156 UpdateLocal(register_index, constant);
2157 break;
2158 }
2159
2160 case Instruction::CONST_WIDE_HIGH16: {
2161 int32_t register_index = instruction.VRegA();
2162 int64_t value = static_cast<int64_t>(instruction.VRegB_21h()) << 48;
2163 HLongConstant* constant = graph_->GetLongConstant(value, dex_pc);
2164 UpdateLocal(register_index, constant);
2165 break;
2166 }
2167
2168 // Note that the SSA building will refine the types.
2169 case Instruction::MOVE:
2170 case Instruction::MOVE_FROM16:
2171 case Instruction::MOVE_16: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002172 HInstruction* value = LoadLocal(instruction.VRegB(), DataType::Type::kInt32);
David Brazdildee58d62016-04-07 09:54:26 +00002173 UpdateLocal(instruction.VRegA(), value);
2174 break;
2175 }
2176
2177 // Note that the SSA building will refine the types.
2178 case Instruction::MOVE_WIDE:
2179 case Instruction::MOVE_WIDE_FROM16:
2180 case Instruction::MOVE_WIDE_16: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002181 HInstruction* value = LoadLocal(instruction.VRegB(), DataType::Type::kInt64);
David Brazdildee58d62016-04-07 09:54:26 +00002182 UpdateLocal(instruction.VRegA(), value);
2183 break;
2184 }
2185
2186 case Instruction::MOVE_OBJECT:
2187 case Instruction::MOVE_OBJECT_16:
2188 case Instruction::MOVE_OBJECT_FROM16: {
Nicolas Geoffray50a9ed02016-09-23 15:40:41 +01002189 // The verifier has no notion of a null type, so a move-object of constant 0
2190 // will lead to the same constant 0 in the destination register. To mimic
2191 // this behavior, we just pretend we haven't seen a type change (int to reference)
2192 // for the 0 constant and phis. We rely on our type propagation to eventually get the
2193 // types correct.
2194 uint32_t reg_number = instruction.VRegB();
2195 HInstruction* value = (*current_locals_)[reg_number];
2196 if (value->IsIntConstant()) {
2197 DCHECK_EQ(value->AsIntConstant()->GetValue(), 0);
2198 } else if (value->IsPhi()) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002199 DCHECK(value->GetType() == DataType::Type::kInt32 ||
2200 value->GetType() == DataType::Type::kReference);
Nicolas Geoffray50a9ed02016-09-23 15:40:41 +01002201 } else {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002202 value = LoadLocal(reg_number, DataType::Type::kReference);
Nicolas Geoffray50a9ed02016-09-23 15:40:41 +01002203 }
David Brazdildee58d62016-04-07 09:54:26 +00002204 UpdateLocal(instruction.VRegA(), value);
2205 break;
2206 }
2207
2208 case Instruction::RETURN_VOID_NO_BARRIER:
2209 case Instruction::RETURN_VOID: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002210 BuildReturn(instruction, DataType::Type::kVoid, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002211 break;
2212 }
2213
2214#define IF_XX(comparison, cond) \
2215 case Instruction::IF_##cond: If_22t<comparison>(instruction, dex_pc); break; \
2216 case Instruction::IF_##cond##Z: If_21t<comparison>(instruction, dex_pc); break
2217
2218 IF_XX(HEqual, EQ);
2219 IF_XX(HNotEqual, NE);
2220 IF_XX(HLessThan, LT);
2221 IF_XX(HLessThanOrEqual, LE);
2222 IF_XX(HGreaterThan, GT);
2223 IF_XX(HGreaterThanOrEqual, GE);
2224
2225 case Instruction::GOTO:
2226 case Instruction::GOTO_16:
2227 case Instruction::GOTO_32: {
Vladimir Markoca6fff82017-10-03 14:49:14 +01002228 AppendInstruction(new (allocator_) HGoto(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00002229 current_block_ = nullptr;
2230 break;
2231 }
2232
2233 case Instruction::RETURN: {
2234 BuildReturn(instruction, return_type_, dex_pc);
2235 break;
2236 }
2237
2238 case Instruction::RETURN_OBJECT: {
2239 BuildReturn(instruction, return_type_, dex_pc);
2240 break;
2241 }
2242
2243 case Instruction::RETURN_WIDE: {
2244 BuildReturn(instruction, return_type_, dex_pc);
2245 break;
2246 }
2247
2248 case Instruction::INVOKE_DIRECT:
2249 case Instruction::INVOKE_INTERFACE:
2250 case Instruction::INVOKE_STATIC:
2251 case Instruction::INVOKE_SUPER:
2252 case Instruction::INVOKE_VIRTUAL:
2253 case Instruction::INVOKE_VIRTUAL_QUICK: {
2254 uint16_t method_idx;
2255 if (instruction.Opcode() == Instruction::INVOKE_VIRTUAL_QUICK) {
2256 if (!CanDecodeQuickenedInfo()) {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00002257 VLOG(compiler) << "Not compiled: Could not decode quickened instruction "
2258 << instruction.Opcode();
David Brazdildee58d62016-04-07 09:54:26 +00002259 return false;
2260 }
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002261 method_idx = LookupQuickenedInfo(quicken_index);
David Brazdildee58d62016-04-07 09:54:26 +00002262 } else {
2263 method_idx = instruction.VRegB_35c();
2264 }
David Brazdildee58d62016-04-07 09:54:26 +00002265 uint32_t args[5];
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002266 uint32_t number_of_vreg_arguments = instruction.GetVarArgs(args);
2267 VarArgsInstructionOperands operands(args, number_of_vreg_arguments);
2268 if (!BuildInvoke(instruction, dex_pc, method_idx, operands)) {
David Brazdildee58d62016-04-07 09:54:26 +00002269 return false;
2270 }
2271 break;
2272 }
2273
2274 case Instruction::INVOKE_DIRECT_RANGE:
2275 case Instruction::INVOKE_INTERFACE_RANGE:
2276 case Instruction::INVOKE_STATIC_RANGE:
2277 case Instruction::INVOKE_SUPER_RANGE:
2278 case Instruction::INVOKE_VIRTUAL_RANGE:
2279 case Instruction::INVOKE_VIRTUAL_RANGE_QUICK: {
2280 uint16_t method_idx;
2281 if (instruction.Opcode() == Instruction::INVOKE_VIRTUAL_RANGE_QUICK) {
2282 if (!CanDecodeQuickenedInfo()) {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00002283 VLOG(compiler) << "Not compiled: Could not decode quickened instruction "
2284 << instruction.Opcode();
David Brazdildee58d62016-04-07 09:54:26 +00002285 return false;
2286 }
Mathieu Chartierde4b08f2017-07-10 14:13:41 -07002287 method_idx = LookupQuickenedInfo(quicken_index);
David Brazdildee58d62016-04-07 09:54:26 +00002288 } else {
2289 method_idx = instruction.VRegB_3rc();
2290 }
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002291 RangeInstructionOperands operands(instruction.VRegC(), instruction.VRegA_3rc());
2292 if (!BuildInvoke(instruction, dex_pc, method_idx, operands)) {
David Brazdildee58d62016-04-07 09:54:26 +00002293 return false;
2294 }
2295 break;
2296 }
2297
Orion Hodsonac141392017-01-13 11:53:47 +00002298 case Instruction::INVOKE_POLYMORPHIC: {
2299 uint16_t method_idx = instruction.VRegB_45cc();
Orion Hodson06d10a72018-05-14 08:53:38 +01002300 dex::ProtoIndex proto_idx(instruction.VRegH_45cc());
Orion Hodsonac141392017-01-13 11:53:47 +00002301 uint32_t args[5];
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002302 uint32_t number_of_vreg_arguments = instruction.GetVarArgs(args);
2303 VarArgsInstructionOperands operands(args, number_of_vreg_arguments);
Orion Hodson4c8e12e2018-05-18 08:33:20 +01002304 return BuildInvokePolymorphic(dex_pc, method_idx, proto_idx, operands);
Orion Hodsonac141392017-01-13 11:53:47 +00002305 }
2306
2307 case Instruction::INVOKE_POLYMORPHIC_RANGE: {
2308 uint16_t method_idx = instruction.VRegB_4rcc();
Orion Hodson06d10a72018-05-14 08:53:38 +01002309 dex::ProtoIndex proto_idx(instruction.VRegH_4rcc());
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002310 RangeInstructionOperands operands(instruction.VRegC_4rcc(), instruction.VRegA_4rcc());
Orion Hodson4c8e12e2018-05-18 08:33:20 +01002311 return BuildInvokePolymorphic(dex_pc, method_idx, proto_idx, operands);
2312 }
2313
2314 case Instruction::INVOKE_CUSTOM: {
2315 uint16_t call_site_idx = instruction.VRegB_35c();
2316 uint32_t args[5];
2317 uint32_t number_of_vreg_arguments = instruction.GetVarArgs(args);
2318 VarArgsInstructionOperands operands(args, number_of_vreg_arguments);
2319 return BuildInvokeCustom(dex_pc, call_site_idx, operands);
2320 }
2321
2322 case Instruction::INVOKE_CUSTOM_RANGE: {
2323 uint16_t call_site_idx = instruction.VRegB_3rc();
2324 RangeInstructionOperands operands(instruction.VRegC_3rc(), instruction.VRegA_3rc());
2325 return BuildInvokeCustom(dex_pc, call_site_idx, operands);
Orion Hodsonac141392017-01-13 11:53:47 +00002326 }
2327
David Brazdildee58d62016-04-07 09:54:26 +00002328 case Instruction::NEG_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002329 Unop_12x<HNeg>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002330 break;
2331 }
2332
2333 case Instruction::NEG_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002334 Unop_12x<HNeg>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002335 break;
2336 }
2337
2338 case Instruction::NEG_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002339 Unop_12x<HNeg>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002340 break;
2341 }
2342
2343 case Instruction::NEG_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002344 Unop_12x<HNeg>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002345 break;
2346 }
2347
2348 case Instruction::NOT_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002349 Unop_12x<HNot>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002350 break;
2351 }
2352
2353 case Instruction::NOT_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002354 Unop_12x<HNot>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002355 break;
2356 }
2357
2358 case Instruction::INT_TO_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002359 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002360 break;
2361 }
2362
2363 case Instruction::INT_TO_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002364 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002365 break;
2366 }
2367
2368 case Instruction::INT_TO_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002369 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002370 break;
2371 }
2372
2373 case Instruction::LONG_TO_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002374 Conversion_12x(instruction, DataType::Type::kInt64, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002375 break;
2376 }
2377
2378 case Instruction::LONG_TO_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002379 Conversion_12x(instruction, DataType::Type::kInt64, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002380 break;
2381 }
2382
2383 case Instruction::LONG_TO_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002384 Conversion_12x(instruction, DataType::Type::kInt64, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002385 break;
2386 }
2387
2388 case Instruction::FLOAT_TO_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002389 Conversion_12x(instruction, DataType::Type::kFloat32, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002390 break;
2391 }
2392
2393 case Instruction::FLOAT_TO_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002394 Conversion_12x(instruction, DataType::Type::kFloat32, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002395 break;
2396 }
2397
2398 case Instruction::FLOAT_TO_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002399 Conversion_12x(instruction, DataType::Type::kFloat32, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002400 break;
2401 }
2402
2403 case Instruction::DOUBLE_TO_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002404 Conversion_12x(instruction, DataType::Type::kFloat64, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002405 break;
2406 }
2407
2408 case Instruction::DOUBLE_TO_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002409 Conversion_12x(instruction, DataType::Type::kFloat64, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002410 break;
2411 }
2412
2413 case Instruction::DOUBLE_TO_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002414 Conversion_12x(instruction, DataType::Type::kFloat64, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002415 break;
2416 }
2417
2418 case Instruction::INT_TO_BYTE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002419 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kInt8, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002420 break;
2421 }
2422
2423 case Instruction::INT_TO_SHORT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002424 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kInt16, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002425 break;
2426 }
2427
2428 case Instruction::INT_TO_CHAR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002429 Conversion_12x(instruction, DataType::Type::kInt32, DataType::Type::kUint16, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002430 break;
2431 }
2432
2433 case Instruction::ADD_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002434 Binop_23x<HAdd>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002435 break;
2436 }
2437
2438 case Instruction::ADD_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002439 Binop_23x<HAdd>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002440 break;
2441 }
2442
2443 case Instruction::ADD_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002444 Binop_23x<HAdd>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002445 break;
2446 }
2447
2448 case Instruction::ADD_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002449 Binop_23x<HAdd>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002450 break;
2451 }
2452
2453 case Instruction::SUB_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002454 Binop_23x<HSub>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002455 break;
2456 }
2457
2458 case Instruction::SUB_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002459 Binop_23x<HSub>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002460 break;
2461 }
2462
2463 case Instruction::SUB_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002464 Binop_23x<HSub>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002465 break;
2466 }
2467
2468 case Instruction::SUB_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002469 Binop_23x<HSub>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002470 break;
2471 }
2472
2473 case Instruction::ADD_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002474 Binop_12x<HAdd>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002475 break;
2476 }
2477
2478 case Instruction::MUL_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002479 Binop_23x<HMul>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002480 break;
2481 }
2482
2483 case Instruction::MUL_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002484 Binop_23x<HMul>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002485 break;
2486 }
2487
2488 case Instruction::MUL_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002489 Binop_23x<HMul>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002490 break;
2491 }
2492
2493 case Instruction::MUL_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002494 Binop_23x<HMul>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002495 break;
2496 }
2497
2498 case Instruction::DIV_INT: {
2499 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002500 dex_pc, DataType::Type::kInt32, false, true);
David Brazdildee58d62016-04-07 09:54:26 +00002501 break;
2502 }
2503
2504 case Instruction::DIV_LONG: {
2505 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002506 dex_pc, DataType::Type::kInt64, false, true);
David Brazdildee58d62016-04-07 09:54:26 +00002507 break;
2508 }
2509
2510 case Instruction::DIV_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002511 Binop_23x<HDiv>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002512 break;
2513 }
2514
2515 case Instruction::DIV_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002516 Binop_23x<HDiv>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002517 break;
2518 }
2519
2520 case Instruction::REM_INT: {
2521 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002522 dex_pc, DataType::Type::kInt32, false, false);
David Brazdildee58d62016-04-07 09:54:26 +00002523 break;
2524 }
2525
2526 case Instruction::REM_LONG: {
2527 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002528 dex_pc, DataType::Type::kInt64, false, false);
David Brazdildee58d62016-04-07 09:54:26 +00002529 break;
2530 }
2531
2532 case Instruction::REM_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002533 Binop_23x<HRem>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002534 break;
2535 }
2536
2537 case Instruction::REM_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002538 Binop_23x<HRem>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002539 break;
2540 }
2541
2542 case Instruction::AND_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002543 Binop_23x<HAnd>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002544 break;
2545 }
2546
2547 case Instruction::AND_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002548 Binop_23x<HAnd>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002549 break;
2550 }
2551
2552 case Instruction::SHL_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002553 Binop_23x_shift<HShl>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002554 break;
2555 }
2556
2557 case Instruction::SHL_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002558 Binop_23x_shift<HShl>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002559 break;
2560 }
2561
2562 case Instruction::SHR_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002563 Binop_23x_shift<HShr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002564 break;
2565 }
2566
2567 case Instruction::SHR_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002568 Binop_23x_shift<HShr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002569 break;
2570 }
2571
2572 case Instruction::USHR_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002573 Binop_23x_shift<HUShr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002574 break;
2575 }
2576
2577 case Instruction::USHR_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002578 Binop_23x_shift<HUShr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002579 break;
2580 }
2581
2582 case Instruction::OR_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002583 Binop_23x<HOr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002584 break;
2585 }
2586
2587 case Instruction::OR_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002588 Binop_23x<HOr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002589 break;
2590 }
2591
2592 case Instruction::XOR_INT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002593 Binop_23x<HXor>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002594 break;
2595 }
2596
2597 case Instruction::XOR_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002598 Binop_23x<HXor>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002599 break;
2600 }
2601
2602 case Instruction::ADD_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002603 Binop_12x<HAdd>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002604 break;
2605 }
2606
2607 case Instruction::ADD_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002608 Binop_12x<HAdd>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002609 break;
2610 }
2611
2612 case Instruction::ADD_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002613 Binop_12x<HAdd>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002614 break;
2615 }
2616
2617 case Instruction::SUB_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002618 Binop_12x<HSub>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002619 break;
2620 }
2621
2622 case Instruction::SUB_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002623 Binop_12x<HSub>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002624 break;
2625 }
2626
2627 case Instruction::SUB_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002628 Binop_12x<HSub>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002629 break;
2630 }
2631
2632 case Instruction::SUB_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002633 Binop_12x<HSub>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002634 break;
2635 }
2636
2637 case Instruction::MUL_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002638 Binop_12x<HMul>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002639 break;
2640 }
2641
2642 case Instruction::MUL_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002643 Binop_12x<HMul>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002644 break;
2645 }
2646
2647 case Instruction::MUL_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002648 Binop_12x<HMul>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002649 break;
2650 }
2651
2652 case Instruction::MUL_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002653 Binop_12x<HMul>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002654 break;
2655 }
2656
2657 case Instruction::DIV_INT_2ADDR: {
2658 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002659 dex_pc, DataType::Type::kInt32, false, true);
David Brazdildee58d62016-04-07 09:54:26 +00002660 break;
2661 }
2662
2663 case Instruction::DIV_LONG_2ADDR: {
2664 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002665 dex_pc, DataType::Type::kInt64, false, true);
David Brazdildee58d62016-04-07 09:54:26 +00002666 break;
2667 }
2668
2669 case Instruction::REM_INT_2ADDR: {
2670 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002671 dex_pc, DataType::Type::kInt32, false, false);
David Brazdildee58d62016-04-07 09:54:26 +00002672 break;
2673 }
2674
2675 case Instruction::REM_LONG_2ADDR: {
2676 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002677 dex_pc, DataType::Type::kInt64, false, false);
David Brazdildee58d62016-04-07 09:54:26 +00002678 break;
2679 }
2680
2681 case Instruction::REM_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002682 Binop_12x<HRem>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002683 break;
2684 }
2685
2686 case Instruction::REM_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002687 Binop_12x<HRem>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002688 break;
2689 }
2690
2691 case Instruction::SHL_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002692 Binop_12x_shift<HShl>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002693 break;
2694 }
2695
2696 case Instruction::SHL_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002697 Binop_12x_shift<HShl>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002698 break;
2699 }
2700
2701 case Instruction::SHR_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002702 Binop_12x_shift<HShr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002703 break;
2704 }
2705
2706 case Instruction::SHR_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002707 Binop_12x_shift<HShr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002708 break;
2709 }
2710
2711 case Instruction::USHR_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002712 Binop_12x_shift<HUShr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002713 break;
2714 }
2715
2716 case Instruction::USHR_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002717 Binop_12x_shift<HUShr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002718 break;
2719 }
2720
2721 case Instruction::DIV_FLOAT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002722 Binop_12x<HDiv>(instruction, DataType::Type::kFloat32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002723 break;
2724 }
2725
2726 case Instruction::DIV_DOUBLE_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002727 Binop_12x<HDiv>(instruction, DataType::Type::kFloat64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002728 break;
2729 }
2730
2731 case Instruction::AND_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002732 Binop_12x<HAnd>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002733 break;
2734 }
2735
2736 case Instruction::AND_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002737 Binop_12x<HAnd>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002738 break;
2739 }
2740
2741 case Instruction::OR_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002742 Binop_12x<HOr>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002743 break;
2744 }
2745
2746 case Instruction::OR_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002747 Binop_12x<HOr>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002748 break;
2749 }
2750
2751 case Instruction::XOR_INT_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002752 Binop_12x<HXor>(instruction, DataType::Type::kInt32, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002753 break;
2754 }
2755
2756 case Instruction::XOR_LONG_2ADDR: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002757 Binop_12x<HXor>(instruction, DataType::Type::kInt64, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002758 break;
2759 }
2760
2761 case Instruction::ADD_INT_LIT16: {
2762 Binop_22s<HAdd>(instruction, false, dex_pc);
2763 break;
2764 }
2765
2766 case Instruction::AND_INT_LIT16: {
2767 Binop_22s<HAnd>(instruction, false, dex_pc);
2768 break;
2769 }
2770
2771 case Instruction::OR_INT_LIT16: {
2772 Binop_22s<HOr>(instruction, false, dex_pc);
2773 break;
2774 }
2775
2776 case Instruction::XOR_INT_LIT16: {
2777 Binop_22s<HXor>(instruction, false, dex_pc);
2778 break;
2779 }
2780
2781 case Instruction::RSUB_INT: {
2782 Binop_22s<HSub>(instruction, true, dex_pc);
2783 break;
2784 }
2785
2786 case Instruction::MUL_INT_LIT16: {
2787 Binop_22s<HMul>(instruction, false, dex_pc);
2788 break;
2789 }
2790
2791 case Instruction::ADD_INT_LIT8: {
2792 Binop_22b<HAdd>(instruction, false, dex_pc);
2793 break;
2794 }
2795
2796 case Instruction::AND_INT_LIT8: {
2797 Binop_22b<HAnd>(instruction, false, dex_pc);
2798 break;
2799 }
2800
2801 case Instruction::OR_INT_LIT8: {
2802 Binop_22b<HOr>(instruction, false, dex_pc);
2803 break;
2804 }
2805
2806 case Instruction::XOR_INT_LIT8: {
2807 Binop_22b<HXor>(instruction, false, dex_pc);
2808 break;
2809 }
2810
2811 case Instruction::RSUB_INT_LIT8: {
2812 Binop_22b<HSub>(instruction, true, dex_pc);
2813 break;
2814 }
2815
2816 case Instruction::MUL_INT_LIT8: {
2817 Binop_22b<HMul>(instruction, false, dex_pc);
2818 break;
2819 }
2820
2821 case Instruction::DIV_INT_LIT16:
2822 case Instruction::DIV_INT_LIT8: {
2823 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002824 dex_pc, DataType::Type::kInt32, true, true);
David Brazdildee58d62016-04-07 09:54:26 +00002825 break;
2826 }
2827
2828 case Instruction::REM_INT_LIT16:
2829 case Instruction::REM_INT_LIT8: {
2830 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002831 dex_pc, DataType::Type::kInt32, true, false);
David Brazdildee58d62016-04-07 09:54:26 +00002832 break;
2833 }
2834
2835 case Instruction::SHL_INT_LIT8: {
2836 Binop_22b<HShl>(instruction, false, dex_pc);
2837 break;
2838 }
2839
2840 case Instruction::SHR_INT_LIT8: {
2841 Binop_22b<HShr>(instruction, false, dex_pc);
2842 break;
2843 }
2844
2845 case Instruction::USHR_INT_LIT8: {
2846 Binop_22b<HUShr>(instruction, false, dex_pc);
2847 break;
2848 }
2849
2850 case Instruction::NEW_INSTANCE: {
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002851 HNewInstance* new_instance =
2852 BuildNewInstance(dex::TypeIndex(instruction.VRegB_21c()), dex_pc);
2853 DCHECK(new_instance != nullptr);
2854
David Brazdildee58d62016-04-07 09:54:26 +00002855 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002856 BuildConstructorFenceForAllocation(new_instance);
David Brazdildee58d62016-04-07 09:54:26 +00002857 break;
2858 }
2859
2860 case Instruction::NEW_ARRAY: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08002861 dex::TypeIndex type_index(instruction.VRegC_22c());
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002862 HInstruction* length = LoadLocal(instruction.VRegB_22c(), DataType::Type::kInt32);
Vladimir Markob5461632018-10-15 14:24:21 +01002863 HNewArray* new_array = BuildNewArray(dex_pc, type_index, length);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002864
David Brazdildee58d62016-04-07 09:54:26 +00002865 UpdateLocal(instruction.VRegA_22c(), current_block_->GetLastInstruction());
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002866 BuildConstructorFenceForAllocation(new_array);
David Brazdildee58d62016-04-07 09:54:26 +00002867 break;
2868 }
2869
2870 case Instruction::FILLED_NEW_ARRAY: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08002871 dex::TypeIndex type_index(instruction.VRegB_35c());
David Brazdildee58d62016-04-07 09:54:26 +00002872 uint32_t args[5];
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002873 uint32_t number_of_vreg_arguments = instruction.GetVarArgs(args);
2874 VarArgsInstructionOperands operands(args, number_of_vreg_arguments);
2875 HNewArray* new_array = BuildFilledNewArray(dex_pc, type_index, operands);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002876 BuildConstructorFenceForAllocation(new_array);
David Brazdildee58d62016-04-07 09:54:26 +00002877 break;
2878 }
2879
2880 case Instruction::FILLED_NEW_ARRAY_RANGE: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08002881 dex::TypeIndex type_index(instruction.VRegB_3rc());
Treehugger Robot2c5827a2018-05-17 22:26:08 +00002882 RangeInstructionOperands operands(instruction.VRegC_3rc(), instruction.VRegA_3rc());
2883 HNewArray* new_array = BuildFilledNewArray(dex_pc, type_index, operands);
Igor Murashkin79d8fa72017-04-18 09:37:23 -07002884 BuildConstructorFenceForAllocation(new_array);
David Brazdildee58d62016-04-07 09:54:26 +00002885 break;
2886 }
2887
2888 case Instruction::FILL_ARRAY_DATA: {
2889 BuildFillArrayData(instruction, dex_pc);
2890 break;
2891 }
2892
2893 case Instruction::MOVE_RESULT:
2894 case Instruction::MOVE_RESULT_WIDE:
2895 case Instruction::MOVE_RESULT_OBJECT: {
2896 DCHECK(latest_result_ != nullptr);
2897 UpdateLocal(instruction.VRegA(), latest_result_);
2898 latest_result_ = nullptr;
2899 break;
2900 }
2901
2902 case Instruction::CMP_LONG: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002903 Binop_23x_cmp(instruction, DataType::Type::kInt64, ComparisonBias::kNoBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002904 break;
2905 }
2906
2907 case Instruction::CMPG_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002908 Binop_23x_cmp(instruction, DataType::Type::kFloat32, ComparisonBias::kGtBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002909 break;
2910 }
2911
2912 case Instruction::CMPG_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002913 Binop_23x_cmp(instruction, DataType::Type::kFloat64, ComparisonBias::kGtBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002914 break;
2915 }
2916
2917 case Instruction::CMPL_FLOAT: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002918 Binop_23x_cmp(instruction, DataType::Type::kFloat32, ComparisonBias::kLtBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002919 break;
2920 }
2921
2922 case Instruction::CMPL_DOUBLE: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01002923 Binop_23x_cmp(instruction, DataType::Type::kFloat64, ComparisonBias::kLtBias, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002924 break;
2925 }
2926
2927 case Instruction::NOP:
2928 break;
2929
2930 case Instruction::IGET:
2931 case Instruction::IGET_QUICK:
2932 case Instruction::IGET_WIDE:
2933 case Instruction::IGET_WIDE_QUICK:
2934 case Instruction::IGET_OBJECT:
2935 case Instruction::IGET_OBJECT_QUICK:
2936 case Instruction::IGET_BOOLEAN:
2937 case Instruction::IGET_BOOLEAN_QUICK:
2938 case Instruction::IGET_BYTE:
2939 case Instruction::IGET_BYTE_QUICK:
2940 case Instruction::IGET_CHAR:
2941 case Instruction::IGET_CHAR_QUICK:
2942 case Instruction::IGET_SHORT:
2943 case Instruction::IGET_SHORT_QUICK: {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00002944 if (!BuildInstanceFieldAccess(instruction, dex_pc, /* is_put */ false, quicken_index)) {
David Brazdildee58d62016-04-07 09:54:26 +00002945 return false;
2946 }
2947 break;
2948 }
2949
2950 case Instruction::IPUT:
2951 case Instruction::IPUT_QUICK:
2952 case Instruction::IPUT_WIDE:
2953 case Instruction::IPUT_WIDE_QUICK:
2954 case Instruction::IPUT_OBJECT:
2955 case Instruction::IPUT_OBJECT_QUICK:
2956 case Instruction::IPUT_BOOLEAN:
2957 case Instruction::IPUT_BOOLEAN_QUICK:
2958 case Instruction::IPUT_BYTE:
2959 case Instruction::IPUT_BYTE_QUICK:
2960 case Instruction::IPUT_CHAR:
2961 case Instruction::IPUT_CHAR_QUICK:
2962 case Instruction::IPUT_SHORT:
2963 case Instruction::IPUT_SHORT_QUICK: {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00002964 if (!BuildInstanceFieldAccess(instruction, dex_pc, /* is_put */ true, quicken_index)) {
David Brazdildee58d62016-04-07 09:54:26 +00002965 return false;
2966 }
2967 break;
2968 }
2969
2970 case Instruction::SGET:
2971 case Instruction::SGET_WIDE:
2972 case Instruction::SGET_OBJECT:
2973 case Instruction::SGET_BOOLEAN:
2974 case Instruction::SGET_BYTE:
2975 case Instruction::SGET_CHAR:
2976 case Instruction::SGET_SHORT: {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00002977 BuildStaticFieldAccess(instruction, dex_pc, /* is_put */ false);
David Brazdildee58d62016-04-07 09:54:26 +00002978 break;
2979 }
2980
2981 case Instruction::SPUT:
2982 case Instruction::SPUT_WIDE:
2983 case Instruction::SPUT_OBJECT:
2984 case Instruction::SPUT_BOOLEAN:
2985 case Instruction::SPUT_BYTE:
2986 case Instruction::SPUT_CHAR:
2987 case Instruction::SPUT_SHORT: {
Nicolas Geoffraydbb9aef2017-11-23 10:44:11 +00002988 BuildStaticFieldAccess(instruction, dex_pc, /* is_put */ true);
David Brazdildee58d62016-04-07 09:54:26 +00002989 break;
2990 }
2991
2992#define ARRAY_XX(kind, anticipated_type) \
2993 case Instruction::AGET##kind: { \
2994 BuildArrayAccess(instruction, dex_pc, false, anticipated_type); \
2995 break; \
2996 } \
2997 case Instruction::APUT##kind: { \
2998 BuildArrayAccess(instruction, dex_pc, true, anticipated_type); \
2999 break; \
3000 }
3001
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003002 ARRAY_XX(, DataType::Type::kInt32);
3003 ARRAY_XX(_WIDE, DataType::Type::kInt64);
3004 ARRAY_XX(_OBJECT, DataType::Type::kReference);
3005 ARRAY_XX(_BOOLEAN, DataType::Type::kBool);
3006 ARRAY_XX(_BYTE, DataType::Type::kInt8);
3007 ARRAY_XX(_CHAR, DataType::Type::kUint16);
3008 ARRAY_XX(_SHORT, DataType::Type::kInt16);
David Brazdildee58d62016-04-07 09:54:26 +00003009
3010 case Instruction::ARRAY_LENGTH: {
David Brazdilc120bbe2016-04-22 16:57:00 +01003011 HInstruction* object = LoadNullCheckedLocal(instruction.VRegB_12x(), dex_pc);
Vladimir Markoca6fff82017-10-03 14:49:14 +01003012 AppendInstruction(new (allocator_) HArrayLength(object, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00003013 UpdateLocal(instruction.VRegA_12x(), current_block_->GetLastInstruction());
3014 break;
3015 }
3016
3017 case Instruction::CONST_STRING: {
Andreas Gampe8a0128a2016-11-28 07:38:35 -08003018 dex::StringIndex string_index(instruction.VRegB_21c());
Vladimir Marko28e012a2017-12-07 11:22:59 +00003019 BuildLoadString(string_index, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003020 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
3021 break;
3022 }
3023
3024 case Instruction::CONST_STRING_JUMBO: {
Andreas Gampe8a0128a2016-11-28 07:38:35 -08003025 dex::StringIndex string_index(instruction.VRegB_31c());
Vladimir Marko28e012a2017-12-07 11:22:59 +00003026 BuildLoadString(string_index, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003027 UpdateLocal(instruction.VRegA_31c(), current_block_->GetLastInstruction());
3028 break;
3029 }
3030
3031 case Instruction::CONST_CLASS: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08003032 dex::TypeIndex type_index(instruction.VRegB_21c());
Nicolas Geoffray83c8e272017-01-31 14:36:37 +00003033 BuildLoadClass(type_index, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00003034 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
3035 break;
3036 }
3037
Orion Hodsondbaa5c72018-05-10 08:22:46 +01003038 case Instruction::CONST_METHOD_HANDLE: {
3039 uint16_t method_handle_idx = instruction.VRegB_21c();
3040 BuildLoadMethodHandle(method_handle_idx, dex_pc);
3041 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
3042 break;
3043 }
3044
Orion Hodson18259d72018-04-12 11:18:23 +01003045 case Instruction::CONST_METHOD_TYPE: {
Orion Hodson06d10a72018-05-14 08:53:38 +01003046 dex::ProtoIndex proto_idx(instruction.VRegB_21c());
Orion Hodson18259d72018-04-12 11:18:23 +01003047 BuildLoadMethodType(proto_idx, dex_pc);
3048 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
3049 break;
3050 }
3051
David Brazdildee58d62016-04-07 09:54:26 +00003052 case Instruction::MOVE_EXCEPTION: {
Vladimir Markoca6fff82017-10-03 14:49:14 +01003053 AppendInstruction(new (allocator_) HLoadException(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00003054 UpdateLocal(instruction.VRegA_11x(), current_block_->GetLastInstruction());
Vladimir Markoca6fff82017-10-03 14:49:14 +01003055 AppendInstruction(new (allocator_) HClearException(dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00003056 break;
3057 }
3058
3059 case Instruction::THROW: {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003060 HInstruction* exception = LoadLocal(instruction.VRegA_11x(), DataType::Type::kReference);
Vladimir Markoca6fff82017-10-03 14:49:14 +01003061 AppendInstruction(new (allocator_) HThrow(exception, dex_pc));
David Brazdildee58d62016-04-07 09:54:26 +00003062 // We finished building this block. Set the current block to null to avoid
3063 // adding dead instructions to it.
3064 current_block_ = nullptr;
3065 break;
3066 }
3067
3068 case Instruction::INSTANCE_OF: {
3069 uint8_t destination = instruction.VRegA_22c();
3070 uint8_t reference = instruction.VRegB_22c();
Andreas Gampea5b09a62016-11-17 15:21:22 -08003071 dex::TypeIndex type_index(instruction.VRegC_22c());
David Brazdildee58d62016-04-07 09:54:26 +00003072 BuildTypeCheck(instruction, destination, reference, type_index, dex_pc);
3073 break;
3074 }
3075
3076 case Instruction::CHECK_CAST: {
3077 uint8_t reference = instruction.VRegA_21c();
Andreas Gampea5b09a62016-11-17 15:21:22 -08003078 dex::TypeIndex type_index(instruction.VRegB_21c());
David Brazdildee58d62016-04-07 09:54:26 +00003079 BuildTypeCheck(instruction, -1, reference, type_index, dex_pc);
3080 break;
3081 }
3082
3083 case Instruction::MONITOR_ENTER: {
Vladimir Markoca6fff82017-10-03 14:49:14 +01003084 AppendInstruction(new (allocator_) HMonitorOperation(
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003085 LoadLocal(instruction.VRegA_11x(), DataType::Type::kReference),
David Brazdildee58d62016-04-07 09:54:26 +00003086 HMonitorOperation::OperationKind::kEnter,
3087 dex_pc));
3088 break;
3089 }
3090
3091 case Instruction::MONITOR_EXIT: {
Vladimir Markoca6fff82017-10-03 14:49:14 +01003092 AppendInstruction(new (allocator_) HMonitorOperation(
Vladimir Marko0ebe0d82017-09-21 22:50:39 +01003093 LoadLocal(instruction.VRegA_11x(), DataType::Type::kReference),
David Brazdildee58d62016-04-07 09:54:26 +00003094 HMonitorOperation::OperationKind::kExit,
3095 dex_pc));
3096 break;
3097 }
3098
3099 case Instruction::SPARSE_SWITCH:
3100 case Instruction::PACKED_SWITCH: {
3101 BuildSwitch(instruction, dex_pc);
3102 break;
3103 }
3104
Orion Hodson4c8e12e2018-05-18 08:33:20 +01003105 case Instruction::UNUSED_3E:
3106 case Instruction::UNUSED_3F:
3107 case Instruction::UNUSED_40:
3108 case Instruction::UNUSED_41:
3109 case Instruction::UNUSED_42:
3110 case Instruction::UNUSED_43:
3111 case Instruction::UNUSED_79:
3112 case Instruction::UNUSED_7A:
3113 case Instruction::UNUSED_F3:
3114 case Instruction::UNUSED_F4:
3115 case Instruction::UNUSED_F5:
3116 case Instruction::UNUSED_F6:
3117 case Instruction::UNUSED_F7:
3118 case Instruction::UNUSED_F8:
3119 case Instruction::UNUSED_F9: {
David Brazdildee58d62016-04-07 09:54:26 +00003120 VLOG(compiler) << "Did not compile "
David Sehr709b0702016-10-13 09:12:37 -07003121 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
David Brazdildee58d62016-04-07 09:54:26 +00003122 << " because of unhandled instruction "
3123 << instruction.Name();
Igor Murashkin1e065a52017-08-09 13:20:34 -07003124 MaybeRecordStat(compilation_stats_,
3125 MethodCompilationStat::kNotCompiledUnhandledInstruction);
David Brazdildee58d62016-04-07 09:54:26 +00003126 return false;
Orion Hodson4c8e12e2018-05-18 08:33:20 +01003127 }
David Brazdildee58d62016-04-07 09:54:26 +00003128 }
3129 return true;
3130} // NOLINT(readability/fn_size)
3131
Vladimir Marko8d6768d2017-03-14 10:13:21 +00003132ObjPtr<mirror::Class> HInstructionBuilder::LookupResolvedType(
3133 dex::TypeIndex type_index,
3134 const DexCompilationUnit& compilation_unit) const {
Vladimir Marko666ee3d2017-12-11 18:37:36 +00003135 return compilation_unit.GetClassLinker()->LookupResolvedType(
Vladimir Marko8d6768d2017-03-14 10:13:21 +00003136 type_index, compilation_unit.GetDexCache().Get(), compilation_unit.GetClassLoader().Get());
3137}
3138
3139ObjPtr<mirror::Class> HInstructionBuilder::LookupReferrerClass() const {
3140 // TODO: Cache the result in a Handle<mirror::Class>.
3141 const DexFile::MethodId& method_id =
3142 dex_compilation_unit_->GetDexFile()->GetMethodId(dex_compilation_unit_->GetDexMethodIndex());
3143 return LookupResolvedType(method_id.class_idx_, *dex_compilation_unit_);
3144}
3145
David Brazdildee58d62016-04-07 09:54:26 +00003146} // namespace art