blob: 8ed0e7fa06dc4fc09a36c24bee7b5edf01c0f006 [file] [log] [blame]
Orion Hodsonac141392017-01-13 11:53:47 +00001
David Brazdildee58d62016-04-07 09:54:26 +00002/*
3 * Copyright (C) 2016 The Android Open Source Project
4 *
5 * Licensed under the Apache License, Version 2.0 (the "License");
6 * you may not use this file except in compliance with the License.
7 * You may obtain a copy of the License at
8 *
9 * http://www.apache.org/licenses/LICENSE-2.0
10 *
11 * Unless required by applicable law or agreed to in writing, software
12 * distributed under the License is distributed on an "AS IS" BASIS,
13 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14 * See the License for the specific language governing permissions and
15 * limitations under the License.
16 */
17
18#include "instruction_builder.h"
19
Matthew Gharrity465ecc82016-07-19 21:32:52 +000020#include "art_method-inl.h"
David Brazdildee58d62016-04-07 09:54:26 +000021#include "bytecode_utils.h"
22#include "class_linker.h"
Andreas Gampe26de38b2016-07-27 17:53:11 -070023#include "dex_instruction-inl.h"
David Brazdildee58d62016-04-07 09:54:26 +000024#include "driver/compiler_options.h"
Andreas Gampe75a7db62016-09-26 12:04:26 -070025#include "imtable-inl.h"
Mathieu Chartier0795f232016-09-27 18:43:30 -070026#include "scoped_thread_state_change-inl.h"
David Brazdildee58d62016-04-07 09:54:26 +000027
28namespace art {
29
30void HInstructionBuilder::MaybeRecordStat(MethodCompilationStat compilation_stat) {
31 if (compilation_stats_ != nullptr) {
32 compilation_stats_->RecordStat(compilation_stat);
33 }
34}
35
36HBasicBlock* HInstructionBuilder::FindBlockStartingAt(uint32_t dex_pc) const {
37 return block_builder_->GetBlockAt(dex_pc);
38}
39
40ArenaVector<HInstruction*>* HInstructionBuilder::GetLocalsFor(HBasicBlock* block) {
41 ArenaVector<HInstruction*>* locals = &locals_for_[block->GetBlockId()];
42 const size_t vregs = graph_->GetNumberOfVRegs();
43 if (locals->size() != vregs) {
44 locals->resize(vregs, nullptr);
45
46 if (block->IsCatchBlock()) {
47 // We record incoming inputs of catch phis at throwing instructions and
48 // must therefore eagerly create the phis. Phis for undefined vregs will
49 // be deleted when the first throwing instruction with the vreg undefined
50 // is encountered. Unused phis will be removed by dead phi analysis.
51 for (size_t i = 0; i < vregs; ++i) {
52 // No point in creating the catch phi if it is already undefined at
53 // the first throwing instruction.
54 HInstruction* current_local_value = (*current_locals_)[i];
55 if (current_local_value != nullptr) {
56 HPhi* phi = new (arena_) HPhi(
57 arena_,
58 i,
59 0,
60 current_local_value->GetType());
61 block->AddPhi(phi);
62 (*locals)[i] = phi;
63 }
64 }
65 }
66 }
67 return locals;
68}
69
70HInstruction* HInstructionBuilder::ValueOfLocalAt(HBasicBlock* block, size_t local) {
71 ArenaVector<HInstruction*>* locals = GetLocalsFor(block);
72 return (*locals)[local];
73}
74
75void HInstructionBuilder::InitializeBlockLocals() {
76 current_locals_ = GetLocalsFor(current_block_);
77
78 if (current_block_->IsCatchBlock()) {
79 // Catch phis were already created and inputs collected from throwing sites.
80 if (kIsDebugBuild) {
81 // Make sure there was at least one throwing instruction which initialized
82 // locals (guaranteed by HGraphBuilder) and that all try blocks have been
83 // visited already (from HTryBoundary scoping and reverse post order).
84 bool catch_block_visited = false;
Vladimir Marko2c45bc92016-10-25 16:54:12 +010085 for (HBasicBlock* current : graph_->GetReversePostOrder()) {
David Brazdildee58d62016-04-07 09:54:26 +000086 if (current == current_block_) {
87 catch_block_visited = true;
88 } else if (current->IsTryBlock()) {
89 const HTryBoundary& try_entry = current->GetTryCatchInformation()->GetTryEntry();
90 if (try_entry.HasExceptionHandler(*current_block_)) {
91 DCHECK(!catch_block_visited) << "Catch block visited before its try block.";
92 }
93 }
94 }
95 DCHECK_EQ(current_locals_->size(), graph_->GetNumberOfVRegs())
96 << "No instructions throwing into a live catch block.";
97 }
98 } else if (current_block_->IsLoopHeader()) {
99 // If the block is a loop header, we know we only have visited the pre header
100 // because we are visiting in reverse post order. We create phis for all initialized
101 // locals from the pre header. Their inputs will be populated at the end of
102 // the analysis.
103 for (size_t local = 0; local < current_locals_->size(); ++local) {
104 HInstruction* incoming =
105 ValueOfLocalAt(current_block_->GetLoopInformation()->GetPreHeader(), local);
106 if (incoming != nullptr) {
107 HPhi* phi = new (arena_) HPhi(
108 arena_,
109 local,
110 0,
111 incoming->GetType());
112 current_block_->AddPhi(phi);
113 (*current_locals_)[local] = phi;
114 }
115 }
116
117 // Save the loop header so that the last phase of the analysis knows which
118 // blocks need to be updated.
119 loop_headers_.push_back(current_block_);
120 } else if (current_block_->GetPredecessors().size() > 0) {
121 // All predecessors have already been visited because we are visiting in reverse post order.
122 // We merge the values of all locals, creating phis if those values differ.
123 for (size_t local = 0; local < current_locals_->size(); ++local) {
124 bool one_predecessor_has_no_value = false;
125 bool is_different = false;
126 HInstruction* value = ValueOfLocalAt(current_block_->GetPredecessors()[0], local);
127
128 for (HBasicBlock* predecessor : current_block_->GetPredecessors()) {
129 HInstruction* current = ValueOfLocalAt(predecessor, local);
130 if (current == nullptr) {
131 one_predecessor_has_no_value = true;
132 break;
133 } else if (current != value) {
134 is_different = true;
135 }
136 }
137
138 if (one_predecessor_has_no_value) {
139 // If one predecessor has no value for this local, we trust the verifier has
140 // successfully checked that there is a store dominating any read after this block.
141 continue;
142 }
143
144 if (is_different) {
145 HInstruction* first_input = ValueOfLocalAt(current_block_->GetPredecessors()[0], local);
146 HPhi* phi = new (arena_) HPhi(
147 arena_,
148 local,
149 current_block_->GetPredecessors().size(),
150 first_input->GetType());
151 for (size_t i = 0; i < current_block_->GetPredecessors().size(); i++) {
152 HInstruction* pred_value = ValueOfLocalAt(current_block_->GetPredecessors()[i], local);
153 phi->SetRawInputAt(i, pred_value);
154 }
155 current_block_->AddPhi(phi);
156 value = phi;
157 }
158 (*current_locals_)[local] = value;
159 }
160 }
161}
162
163void HInstructionBuilder::PropagateLocalsToCatchBlocks() {
164 const HTryBoundary& try_entry = current_block_->GetTryCatchInformation()->GetTryEntry();
165 for (HBasicBlock* catch_block : try_entry.GetExceptionHandlers()) {
166 ArenaVector<HInstruction*>* handler_locals = GetLocalsFor(catch_block);
167 DCHECK_EQ(handler_locals->size(), current_locals_->size());
168 for (size_t vreg = 0, e = current_locals_->size(); vreg < e; ++vreg) {
169 HInstruction* handler_value = (*handler_locals)[vreg];
170 if (handler_value == nullptr) {
171 // Vreg was undefined at a previously encountered throwing instruction
172 // and the catch phi was deleted. Do not record the local value.
173 continue;
174 }
175 DCHECK(handler_value->IsPhi());
176
177 HInstruction* local_value = (*current_locals_)[vreg];
178 if (local_value == nullptr) {
179 // This is the first instruction throwing into `catch_block` where
180 // `vreg` is undefined. Delete the catch phi.
181 catch_block->RemovePhi(handler_value->AsPhi());
182 (*handler_locals)[vreg] = nullptr;
183 } else {
184 // Vreg has been defined at all instructions throwing into `catch_block`
185 // encountered so far. Record the local value in the catch phi.
186 handler_value->AsPhi()->AddInput(local_value);
187 }
188 }
189 }
190}
191
192void HInstructionBuilder::AppendInstruction(HInstruction* instruction) {
193 current_block_->AddInstruction(instruction);
194 InitializeInstruction(instruction);
195}
196
197void HInstructionBuilder::InsertInstructionAtTop(HInstruction* instruction) {
198 if (current_block_->GetInstructions().IsEmpty()) {
199 current_block_->AddInstruction(instruction);
200 } else {
201 current_block_->InsertInstructionBefore(instruction, current_block_->GetFirstInstruction());
202 }
203 InitializeInstruction(instruction);
204}
205
206void HInstructionBuilder::InitializeInstruction(HInstruction* instruction) {
207 if (instruction->NeedsEnvironment()) {
208 HEnvironment* environment = new (arena_) HEnvironment(
209 arena_,
210 current_locals_->size(),
Nicolas Geoffray5d37c152017-01-12 13:25:19 +0000211 graph_->GetArtMethod(),
David Brazdildee58d62016-04-07 09:54:26 +0000212 instruction->GetDexPc(),
David Brazdildee58d62016-04-07 09:54:26 +0000213 instruction);
214 environment->CopyFrom(*current_locals_);
215 instruction->SetRawEnvironment(environment);
216 }
217}
218
David Brazdilc120bbe2016-04-22 16:57:00 +0100219HInstruction* HInstructionBuilder::LoadNullCheckedLocal(uint32_t register_index, uint32_t dex_pc) {
220 HInstruction* ref = LoadLocal(register_index, Primitive::kPrimNot);
221 if (!ref->CanBeNull()) {
222 return ref;
223 }
224
225 HNullCheck* null_check = new (arena_) HNullCheck(ref, dex_pc);
226 AppendInstruction(null_check);
227 return null_check;
228}
229
David Brazdildee58d62016-04-07 09:54:26 +0000230void HInstructionBuilder::SetLoopHeaderPhiInputs() {
231 for (size_t i = loop_headers_.size(); i > 0; --i) {
232 HBasicBlock* block = loop_headers_[i - 1];
233 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) {
234 HPhi* phi = it.Current()->AsPhi();
235 size_t vreg = phi->GetRegNumber();
236 for (HBasicBlock* predecessor : block->GetPredecessors()) {
237 HInstruction* value = ValueOfLocalAt(predecessor, vreg);
238 if (value == nullptr) {
239 // Vreg is undefined at this predecessor. Mark it dead and leave with
240 // fewer inputs than predecessors. SsaChecker will fail if not removed.
241 phi->SetDead();
242 break;
243 } else {
244 phi->AddInput(value);
245 }
246 }
247 }
248 }
249}
250
251static bool IsBlockPopulated(HBasicBlock* block) {
252 if (block->IsLoopHeader()) {
253 // Suspend checks were inserted into loop headers during building of dominator tree.
254 DCHECK(block->GetFirstInstruction()->IsSuspendCheck());
255 return block->GetFirstInstruction() != block->GetLastInstruction();
256 } else {
257 return !block->GetInstructions().IsEmpty();
258 }
259}
260
261bool HInstructionBuilder::Build() {
262 locals_for_.resize(graph_->GetBlocks().size(),
263 ArenaVector<HInstruction*>(arena_->Adapter(kArenaAllocGraphBuilder)));
264
265 // Find locations where we want to generate extra stackmaps for native debugging.
266 // This allows us to generate the info only at interesting points (for example,
267 // at start of java statement) rather than before every dex instruction.
268 const bool native_debuggable = compiler_driver_ != nullptr &&
269 compiler_driver_->GetCompilerOptions().GetNativeDebuggable();
270 ArenaBitVector* native_debug_info_locations = nullptr;
271 if (native_debuggable) {
272 const uint32_t num_instructions = code_item_.insns_size_in_code_units_;
273 native_debug_info_locations = new (arena_) ArenaBitVector (arena_, num_instructions, false);
274 FindNativeDebugInfoLocations(native_debug_info_locations);
275 }
276
Vladimir Marko2c45bc92016-10-25 16:54:12 +0100277 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
278 current_block_ = block;
David Brazdildee58d62016-04-07 09:54:26 +0000279 uint32_t block_dex_pc = current_block_->GetDexPc();
280
281 InitializeBlockLocals();
282
283 if (current_block_->IsEntryBlock()) {
284 InitializeParameters();
285 AppendInstruction(new (arena_) HSuspendCheck(0u));
286 AppendInstruction(new (arena_) HGoto(0u));
287 continue;
288 } else if (current_block_->IsExitBlock()) {
289 AppendInstruction(new (arena_) HExit());
290 continue;
291 } else if (current_block_->IsLoopHeader()) {
292 HSuspendCheck* suspend_check = new (arena_) HSuspendCheck(current_block_->GetDexPc());
293 current_block_->GetLoopInformation()->SetSuspendCheck(suspend_check);
294 // This is slightly odd because the loop header might not be empty (TryBoundary).
295 // But we're still creating the environment with locals from the top of the block.
296 InsertInstructionAtTop(suspend_check);
297 }
298
299 if (block_dex_pc == kNoDexPc || current_block_ != block_builder_->GetBlockAt(block_dex_pc)) {
300 // Synthetic block that does not need to be populated.
301 DCHECK(IsBlockPopulated(current_block_));
302 continue;
303 }
304
305 DCHECK(!IsBlockPopulated(current_block_));
306
307 for (CodeItemIterator it(code_item_, block_dex_pc); !it.Done(); it.Advance()) {
308 if (current_block_ == nullptr) {
309 // The previous instruction ended this block.
310 break;
311 }
312
313 uint32_t dex_pc = it.CurrentDexPc();
314 if (dex_pc != block_dex_pc && FindBlockStartingAt(dex_pc) != nullptr) {
315 // This dex_pc starts a new basic block.
316 break;
317 }
318
319 if (current_block_->IsTryBlock() && IsThrowingDexInstruction(it.CurrentInstruction())) {
320 PropagateLocalsToCatchBlocks();
321 }
322
323 if (native_debuggable && native_debug_info_locations->IsBitSet(dex_pc)) {
324 AppendInstruction(new (arena_) HNativeDebugInfo(dex_pc));
325 }
326
327 if (!ProcessDexInstruction(it.CurrentInstruction(), dex_pc)) {
328 return false;
329 }
330 }
331
332 if (current_block_ != nullptr) {
333 // Branching instructions clear current_block, so we know the last
334 // instruction of the current block is not a branching instruction.
335 // We add an unconditional Goto to the next block.
336 DCHECK_EQ(current_block_->GetSuccessors().size(), 1u);
337 AppendInstruction(new (arena_) HGoto());
338 }
339 }
340
341 SetLoopHeaderPhiInputs();
342
343 return true;
344}
345
346void HInstructionBuilder::FindNativeDebugInfoLocations(ArenaBitVector* locations) {
347 // The callback gets called when the line number changes.
348 // In other words, it marks the start of new java statement.
349 struct Callback {
350 static bool Position(void* ctx, const DexFile::PositionInfo& entry) {
351 static_cast<ArenaBitVector*>(ctx)->SetBit(entry.address_);
352 return false;
353 }
354 };
355 dex_file_->DecodeDebugPositionInfo(&code_item_, Callback::Position, locations);
356 // Instruction-specific tweaks.
357 const Instruction* const begin = Instruction::At(code_item_.insns_);
358 const Instruction* const end = begin->RelativeAt(code_item_.insns_size_in_code_units_);
359 for (const Instruction* inst = begin; inst < end; inst = inst->Next()) {
360 switch (inst->Opcode()) {
361 case Instruction::MOVE_EXCEPTION: {
362 // Stop in native debugger after the exception has been moved.
363 // The compiler also expects the move at the start of basic block so
364 // we do not want to interfere by inserting native-debug-info before it.
365 locations->ClearBit(inst->GetDexPc(code_item_.insns_));
366 const Instruction* next = inst->Next();
367 if (next < end) {
368 locations->SetBit(next->GetDexPc(code_item_.insns_));
369 }
370 break;
371 }
372 default:
373 break;
374 }
375 }
376}
377
378HInstruction* HInstructionBuilder::LoadLocal(uint32_t reg_number, Primitive::Type type) const {
379 HInstruction* value = (*current_locals_)[reg_number];
380 DCHECK(value != nullptr);
381
382 // If the operation requests a specific type, we make sure its input is of that type.
383 if (type != value->GetType()) {
384 if (Primitive::IsFloatingPointType(type)) {
Aart Bik31883642016-06-06 15:02:44 -0700385 value = ssa_builder_->GetFloatOrDoubleEquivalent(value, type);
David Brazdildee58d62016-04-07 09:54:26 +0000386 } else if (type == Primitive::kPrimNot) {
Aart Bik31883642016-06-06 15:02:44 -0700387 value = ssa_builder_->GetReferenceTypeEquivalent(value);
David Brazdildee58d62016-04-07 09:54:26 +0000388 }
Aart Bik31883642016-06-06 15:02:44 -0700389 DCHECK(value != nullptr);
David Brazdildee58d62016-04-07 09:54:26 +0000390 }
391
392 return value;
393}
394
395void HInstructionBuilder::UpdateLocal(uint32_t reg_number, HInstruction* stored_value) {
396 Primitive::Type stored_type = stored_value->GetType();
397 DCHECK_NE(stored_type, Primitive::kPrimVoid);
398
399 // Storing into vreg `reg_number` may implicitly invalidate the surrounding
400 // registers. Consider the following cases:
401 // (1) Storing a wide value must overwrite previous values in both `reg_number`
402 // and `reg_number+1`. We store `nullptr` in `reg_number+1`.
403 // (2) If vreg `reg_number-1` holds a wide value, writing into `reg_number`
404 // must invalidate it. We store `nullptr` in `reg_number-1`.
405 // Consequently, storing a wide value into the high vreg of another wide value
406 // will invalidate both `reg_number-1` and `reg_number+1`.
407
408 if (reg_number != 0) {
409 HInstruction* local_low = (*current_locals_)[reg_number - 1];
410 if (local_low != nullptr && Primitive::Is64BitType(local_low->GetType())) {
411 // The vreg we are storing into was previously the high vreg of a pair.
412 // We need to invalidate its low vreg.
413 DCHECK((*current_locals_)[reg_number] == nullptr);
414 (*current_locals_)[reg_number - 1] = nullptr;
415 }
416 }
417
418 (*current_locals_)[reg_number] = stored_value;
419 if (Primitive::Is64BitType(stored_type)) {
420 // We are storing a pair. Invalidate the instruction in the high vreg.
421 (*current_locals_)[reg_number + 1] = nullptr;
422 }
423}
424
425void HInstructionBuilder::InitializeParameters() {
426 DCHECK(current_block_->IsEntryBlock());
427
428 // dex_compilation_unit_ is null only when unit testing.
429 if (dex_compilation_unit_ == nullptr) {
430 return;
431 }
432
433 const char* shorty = dex_compilation_unit_->GetShorty();
434 uint16_t number_of_parameters = graph_->GetNumberOfInVRegs();
435 uint16_t locals_index = graph_->GetNumberOfLocalVRegs();
436 uint16_t parameter_index = 0;
437
438 const DexFile::MethodId& referrer_method_id =
439 dex_file_->GetMethodId(dex_compilation_unit_->GetDexMethodIndex());
440 if (!dex_compilation_unit_->IsStatic()) {
441 // Add the implicit 'this' argument, not expressed in the signature.
442 HParameterValue* parameter = new (arena_) HParameterValue(*dex_file_,
443 referrer_method_id.class_idx_,
444 parameter_index++,
445 Primitive::kPrimNot,
446 true);
447 AppendInstruction(parameter);
448 UpdateLocal(locals_index++, parameter);
449 number_of_parameters--;
450 }
451
452 const DexFile::ProtoId& proto = dex_file_->GetMethodPrototype(referrer_method_id);
453 const DexFile::TypeList* arg_types = dex_file_->GetProtoParameters(proto);
454 for (int i = 0, shorty_pos = 1; i < number_of_parameters; i++) {
455 HParameterValue* parameter = new (arena_) HParameterValue(
456 *dex_file_,
457 arg_types->GetTypeItem(shorty_pos - 1).type_idx_,
458 parameter_index++,
459 Primitive::GetType(shorty[shorty_pos]),
460 false);
461 ++shorty_pos;
462 AppendInstruction(parameter);
463 // Store the parameter value in the local that the dex code will use
464 // to reference that parameter.
465 UpdateLocal(locals_index++, parameter);
466 if (Primitive::Is64BitType(parameter->GetType())) {
467 i++;
468 locals_index++;
469 parameter_index++;
470 }
471 }
472}
473
474template<typename T>
475void HInstructionBuilder::If_22t(const Instruction& instruction, uint32_t dex_pc) {
476 HInstruction* first = LoadLocal(instruction.VRegA(), Primitive::kPrimInt);
477 HInstruction* second = LoadLocal(instruction.VRegB(), Primitive::kPrimInt);
478 T* comparison = new (arena_) T(first, second, dex_pc);
479 AppendInstruction(comparison);
480 AppendInstruction(new (arena_) HIf(comparison, dex_pc));
481 current_block_ = nullptr;
482}
483
484template<typename T>
485void HInstructionBuilder::If_21t(const Instruction& instruction, uint32_t dex_pc) {
486 HInstruction* value = LoadLocal(instruction.VRegA(), Primitive::kPrimInt);
487 T* comparison = new (arena_) T(value, graph_->GetIntConstant(0, dex_pc), dex_pc);
488 AppendInstruction(comparison);
489 AppendInstruction(new (arena_) HIf(comparison, dex_pc));
490 current_block_ = nullptr;
491}
492
493template<typename T>
494void HInstructionBuilder::Unop_12x(const Instruction& instruction,
495 Primitive::Type type,
496 uint32_t dex_pc) {
497 HInstruction* first = LoadLocal(instruction.VRegB(), type);
498 AppendInstruction(new (arena_) T(type, first, dex_pc));
499 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
500}
501
502void HInstructionBuilder::Conversion_12x(const Instruction& instruction,
503 Primitive::Type input_type,
504 Primitive::Type result_type,
505 uint32_t dex_pc) {
506 HInstruction* first = LoadLocal(instruction.VRegB(), input_type);
507 AppendInstruction(new (arena_) HTypeConversion(result_type, first, dex_pc));
508 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
509}
510
511template<typename T>
512void HInstructionBuilder::Binop_23x(const Instruction& instruction,
513 Primitive::Type type,
514 uint32_t dex_pc) {
515 HInstruction* first = LoadLocal(instruction.VRegB(), type);
516 HInstruction* second = LoadLocal(instruction.VRegC(), type);
517 AppendInstruction(new (arena_) T(type, first, second, dex_pc));
518 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
519}
520
521template<typename T>
522void HInstructionBuilder::Binop_23x_shift(const Instruction& instruction,
523 Primitive::Type type,
524 uint32_t dex_pc) {
525 HInstruction* first = LoadLocal(instruction.VRegB(), type);
526 HInstruction* second = LoadLocal(instruction.VRegC(), Primitive::kPrimInt);
527 AppendInstruction(new (arena_) T(type, first, second, dex_pc));
528 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
529}
530
531void HInstructionBuilder::Binop_23x_cmp(const Instruction& instruction,
532 Primitive::Type type,
533 ComparisonBias bias,
534 uint32_t dex_pc) {
535 HInstruction* first = LoadLocal(instruction.VRegB(), type);
536 HInstruction* second = LoadLocal(instruction.VRegC(), type);
537 AppendInstruction(new (arena_) HCompare(type, first, second, bias, dex_pc));
538 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
539}
540
541template<typename T>
542void HInstructionBuilder::Binop_12x_shift(const Instruction& instruction,
543 Primitive::Type type,
544 uint32_t dex_pc) {
545 HInstruction* first = LoadLocal(instruction.VRegA(), type);
546 HInstruction* second = LoadLocal(instruction.VRegB(), Primitive::kPrimInt);
547 AppendInstruction(new (arena_) T(type, first, second, dex_pc));
548 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
549}
550
551template<typename T>
552void HInstructionBuilder::Binop_12x(const Instruction& instruction,
553 Primitive::Type type,
554 uint32_t dex_pc) {
555 HInstruction* first = LoadLocal(instruction.VRegA(), type);
556 HInstruction* second = LoadLocal(instruction.VRegB(), type);
557 AppendInstruction(new (arena_) T(type, first, second, dex_pc));
558 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
559}
560
561template<typename T>
562void HInstructionBuilder::Binop_22s(const Instruction& instruction, bool reverse, uint32_t dex_pc) {
563 HInstruction* first = LoadLocal(instruction.VRegB(), Primitive::kPrimInt);
564 HInstruction* second = graph_->GetIntConstant(instruction.VRegC_22s(), dex_pc);
565 if (reverse) {
566 std::swap(first, second);
567 }
568 AppendInstruction(new (arena_) T(Primitive::kPrimInt, first, second, dex_pc));
569 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
570}
571
572template<typename T>
573void HInstructionBuilder::Binop_22b(const Instruction& instruction, bool reverse, uint32_t dex_pc) {
574 HInstruction* first = LoadLocal(instruction.VRegB(), Primitive::kPrimInt);
575 HInstruction* second = graph_->GetIntConstant(instruction.VRegC_22b(), dex_pc);
576 if (reverse) {
577 std::swap(first, second);
578 }
579 AppendInstruction(new (arena_) T(Primitive::kPrimInt, first, second, dex_pc));
580 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
581}
582
Mathieu Chartierc4ae9162016-04-07 13:19:19 -0700583static bool RequiresConstructorBarrier(const DexCompilationUnit* cu, CompilerDriver* driver) {
David Brazdildee58d62016-04-07 09:54:26 +0000584 Thread* self = Thread::Current();
585 return cu->IsConstructor()
Mathieu Chartierc4ae9162016-04-07 13:19:19 -0700586 && driver->RequiresConstructorBarrier(self, cu->GetDexFile(), cu->GetClassDefIndex());
David Brazdildee58d62016-04-07 09:54:26 +0000587}
588
589// Returns true if `block` has only one successor which starts at the next
590// dex_pc after `instruction` at `dex_pc`.
591static bool IsFallthroughInstruction(const Instruction& instruction,
592 uint32_t dex_pc,
593 HBasicBlock* block) {
594 uint32_t next_dex_pc = dex_pc + instruction.SizeInCodeUnits();
595 return block->GetSingleSuccessor()->GetDexPc() == next_dex_pc;
596}
597
598void HInstructionBuilder::BuildSwitch(const Instruction& instruction, uint32_t dex_pc) {
599 HInstruction* value = LoadLocal(instruction.VRegA(), Primitive::kPrimInt);
600 DexSwitchTable table(instruction, dex_pc);
601
602 if (table.GetNumEntries() == 0) {
603 // Empty Switch. Code falls through to the next block.
604 DCHECK(IsFallthroughInstruction(instruction, dex_pc, current_block_));
605 AppendInstruction(new (arena_) HGoto(dex_pc));
606 } else if (table.ShouldBuildDecisionTree()) {
607 for (DexSwitchTableIterator it(table); !it.Done(); it.Advance()) {
608 HInstruction* case_value = graph_->GetIntConstant(it.CurrentKey(), dex_pc);
609 HEqual* comparison = new (arena_) HEqual(value, case_value, dex_pc);
610 AppendInstruction(comparison);
611 AppendInstruction(new (arena_) HIf(comparison, dex_pc));
612
613 if (!it.IsLast()) {
614 current_block_ = FindBlockStartingAt(it.GetDexPcForCurrentIndex());
615 }
616 }
617 } else {
618 AppendInstruction(
619 new (arena_) HPackedSwitch(table.GetEntryAt(0), table.GetNumEntries(), value, dex_pc));
620 }
621
622 current_block_ = nullptr;
623}
624
625void HInstructionBuilder::BuildReturn(const Instruction& instruction,
626 Primitive::Type type,
627 uint32_t dex_pc) {
628 if (type == Primitive::kPrimVoid) {
629 if (graph_->ShouldGenerateConstructorBarrier()) {
630 // The compilation unit is null during testing.
631 if (dex_compilation_unit_ != nullptr) {
Mathieu Chartierc4ae9162016-04-07 13:19:19 -0700632 DCHECK(RequiresConstructorBarrier(dex_compilation_unit_, compiler_driver_))
David Brazdildee58d62016-04-07 09:54:26 +0000633 << "Inconsistent use of ShouldGenerateConstructorBarrier. Should not generate a barrier.";
634 }
635 AppendInstruction(new (arena_) HMemoryBarrier(kStoreStore, dex_pc));
636 }
637 AppendInstruction(new (arena_) HReturnVoid(dex_pc));
638 } else {
639 HInstruction* value = LoadLocal(instruction.VRegA(), type);
640 AppendInstruction(new (arena_) HReturn(value, dex_pc));
641 }
642 current_block_ = nullptr;
643}
644
645static InvokeType GetInvokeTypeFromOpCode(Instruction::Code opcode) {
646 switch (opcode) {
647 case Instruction::INVOKE_STATIC:
648 case Instruction::INVOKE_STATIC_RANGE:
649 return kStatic;
650 case Instruction::INVOKE_DIRECT:
651 case Instruction::INVOKE_DIRECT_RANGE:
652 return kDirect;
653 case Instruction::INVOKE_VIRTUAL:
654 case Instruction::INVOKE_VIRTUAL_QUICK:
655 case Instruction::INVOKE_VIRTUAL_RANGE:
656 case Instruction::INVOKE_VIRTUAL_RANGE_QUICK:
657 return kVirtual;
658 case Instruction::INVOKE_INTERFACE:
659 case Instruction::INVOKE_INTERFACE_RANGE:
660 return kInterface;
661 case Instruction::INVOKE_SUPER_RANGE:
662 case Instruction::INVOKE_SUPER:
663 return kSuper;
664 default:
665 LOG(FATAL) << "Unexpected invoke opcode: " << opcode;
666 UNREACHABLE();
667 }
668}
669
670ArtMethod* HInstructionBuilder::ResolveMethod(uint16_t method_idx, InvokeType invoke_type) {
671 ScopedObjectAccess soa(Thread::Current());
672 StackHandleScope<3> hs(soa.Self());
673
674 ClassLinker* class_linker = dex_compilation_unit_->GetClassLinker();
675 Handle<mirror::ClassLoader> class_loader(hs.NewHandle(
Mathieu Chartier0795f232016-09-27 18:43:30 -0700676 soa.Decode<mirror::ClassLoader>(dex_compilation_unit_->GetClassLoader())));
David Brazdildee58d62016-04-07 09:54:26 +0000677 Handle<mirror::Class> compiling_class(hs.NewHandle(GetCompilingClass()));
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100678 // We fetch the referenced class eagerly (that is, the class pointed by in the MethodId
679 // at method_idx), as `CanAccessResolvedMethod` expects it be be in the dex cache.
680 Handle<mirror::Class> methods_class(hs.NewHandle(class_linker->ResolveReferencedClassOfMethod(
681 method_idx, dex_compilation_unit_->GetDexCache(), class_loader)));
682
683 if (UNLIKELY(methods_class.Get() == nullptr)) {
684 // Clean up any exception left by type resolution.
685 soa.Self()->ClearException();
686 return nullptr;
687 }
David Brazdildee58d62016-04-07 09:54:26 +0000688
689 ArtMethod* resolved_method = class_linker->ResolveMethod<ClassLinker::kForceICCECheck>(
690 *dex_compilation_unit_->GetDexFile(),
691 method_idx,
692 dex_compilation_unit_->GetDexCache(),
693 class_loader,
694 /* referrer */ nullptr,
695 invoke_type);
696
697 if (UNLIKELY(resolved_method == nullptr)) {
698 // Clean up any exception left by type resolution.
699 soa.Self()->ClearException();
700 return nullptr;
701 }
702
703 // Check access. The class linker has a fast path for looking into the dex cache
704 // and does not check the access if it hits it.
705 if (compiling_class.Get() == nullptr) {
706 if (!resolved_method->IsPublic()) {
707 return nullptr;
708 }
709 } else if (!compiling_class->CanAccessResolvedMethod(resolved_method->GetDeclaringClass(),
710 resolved_method,
711 dex_compilation_unit_->GetDexCache().Get(),
712 method_idx)) {
713 return nullptr;
714 }
715
716 // We have to special case the invoke-super case, as ClassLinker::ResolveMethod does not.
717 // We need to look at the referrer's super class vtable. We need to do this to know if we need to
718 // make this an invoke-unresolved to handle cross-dex invokes or abstract super methods, both of
719 // which require runtime handling.
720 if (invoke_type == kSuper) {
721 if (compiling_class.Get() == nullptr) {
722 // We could not determine the method's class we need to wait until runtime.
723 DCHECK(Runtime::Current()->IsAotCompiler());
724 return nullptr;
725 }
Aart Bikf663e342016-04-04 17:28:59 -0700726 if (!methods_class->IsAssignableFrom(compiling_class.Get())) {
727 // We cannot statically determine the target method. The runtime will throw a
728 // NoSuchMethodError on this one.
729 return nullptr;
730 }
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100731 ArtMethod* actual_method;
732 if (methods_class->IsInterface()) {
733 actual_method = methods_class->FindVirtualMethodForInterfaceSuper(
734 resolved_method, class_linker->GetImagePointerSize());
David Brazdildee58d62016-04-07 09:54:26 +0000735 } else {
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100736 uint16_t vtable_index = resolved_method->GetMethodIndex();
737 actual_method = compiling_class->GetSuperClass()->GetVTableEntry(
738 vtable_index, class_linker->GetImagePointerSize());
David Brazdildee58d62016-04-07 09:54:26 +0000739 }
Nicolas Geoffray393fdb82016-04-25 14:58:06 +0100740 if (actual_method != resolved_method &&
741 !IsSameDexFile(*actual_method->GetDexFile(), *dex_compilation_unit_->GetDexFile())) {
742 // The back-end code generator relies on this check in order to ensure that it will not
743 // attempt to read the dex_cache with a dex_method_index that is not from the correct
744 // dex_file. If we didn't do this check then the dex_method_index will not be updated in the
745 // builder, which means that the code-generator (and compiler driver during sharpening and
746 // inliner, maybe) might invoke an incorrect method.
747 // TODO: The actual method could still be referenced in the current dex file, so we
748 // could try locating it.
749 // TODO: Remove the dex_file restriction.
750 return nullptr;
751 }
752 if (!actual_method->IsInvokable()) {
753 // Fail if the actual method cannot be invoked. Otherwise, the runtime resolution stub
754 // could resolve the callee to the wrong method.
755 return nullptr;
756 }
757 resolved_method = actual_method;
David Brazdildee58d62016-04-07 09:54:26 +0000758 }
759
760 // Check for incompatible class changes. The class linker has a fast path for
761 // looking into the dex cache and does not check incompatible class changes if it hits it.
762 if (resolved_method->CheckIncompatibleClassChange(invoke_type)) {
763 return nullptr;
764 }
765
766 return resolved_method;
767}
768
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100769static bool IsStringConstructor(ArtMethod* method) {
770 ScopedObjectAccess soa(Thread::Current());
771 return method->GetDeclaringClass()->IsStringClass() && method->IsConstructor();
772}
773
David Brazdildee58d62016-04-07 09:54:26 +0000774bool HInstructionBuilder::BuildInvoke(const Instruction& instruction,
775 uint32_t dex_pc,
776 uint32_t method_idx,
777 uint32_t number_of_vreg_arguments,
778 bool is_range,
779 uint32_t* args,
780 uint32_t register_index) {
781 InvokeType invoke_type = GetInvokeTypeFromOpCode(instruction.Opcode());
782 const char* descriptor = dex_file_->GetMethodShorty(method_idx);
783 Primitive::Type return_type = Primitive::GetType(descriptor[0]);
784
785 // Remove the return type from the 'proto'.
786 size_t number_of_arguments = strlen(descriptor) - 1;
787 if (invoke_type != kStatic) { // instance call
788 // One extra argument for 'this'.
789 number_of_arguments++;
790 }
791
David Brazdildee58d62016-04-07 09:54:26 +0000792 ArtMethod* resolved_method = ResolveMethod(method_idx, invoke_type);
793
794 if (UNLIKELY(resolved_method == nullptr)) {
795 MaybeRecordStat(MethodCompilationStat::kUnresolvedMethod);
796 HInvoke* invoke = new (arena_) HInvokeUnresolved(arena_,
797 number_of_arguments,
798 return_type,
799 dex_pc,
800 method_idx,
801 invoke_type);
802 return HandleInvoke(invoke,
803 number_of_vreg_arguments,
804 args,
805 register_index,
806 is_range,
807 descriptor,
Aart Bik296fbb42016-06-07 13:49:12 -0700808 nullptr, /* clinit_check */
809 true /* is_unresolved */);
David Brazdildee58d62016-04-07 09:54:26 +0000810 }
811
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100812 // Replace calls to String.<init> with StringFactory.
813 if (IsStringConstructor(resolved_method)) {
814 uint32_t string_init_entry_point = WellKnownClasses::StringInitToEntryPoint(resolved_method);
815 HInvokeStaticOrDirect::DispatchInfo dispatch_info = {
816 HInvokeStaticOrDirect::MethodLoadKind::kStringInit,
817 HInvokeStaticOrDirect::CodePtrLocation::kCallArtMethod,
Nicolas Geoffrayc1a42cf2016-12-18 15:52:36 +0000818 dchecked_integral_cast<uint64_t>(string_init_entry_point)
Nicolas Geoffrayda079bb2016-09-26 17:56:07 +0100819 };
820 MethodReference target_method(dex_file_, method_idx);
821 HInvoke* invoke = new (arena_) HInvokeStaticOrDirect(
822 arena_,
823 number_of_arguments - 1,
824 Primitive::kPrimNot /*return_type */,
825 dex_pc,
826 method_idx,
827 nullptr,
828 dispatch_info,
829 invoke_type,
830 target_method,
831 HInvokeStaticOrDirect::ClinitCheckRequirement::kImplicit);
832 return HandleStringInit(invoke,
833 number_of_vreg_arguments,
834 args,
835 register_index,
836 is_range,
837 descriptor);
838 }
839
David Brazdildee58d62016-04-07 09:54:26 +0000840 // Potential class initialization check, in the case of a static method call.
841 HClinitCheck* clinit_check = nullptr;
842 HInvoke* invoke = nullptr;
843 if (invoke_type == kDirect || invoke_type == kStatic || invoke_type == kSuper) {
844 // By default, consider that the called method implicitly requires
845 // an initialization check of its declaring method.
846 HInvokeStaticOrDirect::ClinitCheckRequirement clinit_check_requirement
847 = HInvokeStaticOrDirect::ClinitCheckRequirement::kImplicit;
848 ScopedObjectAccess soa(Thread::Current());
849 if (invoke_type == kStatic) {
850 clinit_check = ProcessClinitCheckForInvoke(
851 dex_pc, resolved_method, method_idx, &clinit_check_requirement);
852 } else if (invoke_type == kSuper) {
853 if (IsSameDexFile(*resolved_method->GetDexFile(), *dex_compilation_unit_->GetDexFile())) {
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +0100854 // Update the method index to the one resolved. Note that this may be a no-op if
David Brazdildee58d62016-04-07 09:54:26 +0000855 // we resolved to the method referenced by the instruction.
856 method_idx = resolved_method->GetDexMethodIndex();
David Brazdildee58d62016-04-07 09:54:26 +0000857 }
858 }
859
860 HInvokeStaticOrDirect::DispatchInfo dispatch_info = {
861 HInvokeStaticOrDirect::MethodLoadKind::kDexCacheViaMethod,
862 HInvokeStaticOrDirect::CodePtrLocation::kCallArtMethod,
Nicolas Geoffrayc1a42cf2016-12-18 15:52:36 +0000863 0u
David Brazdildee58d62016-04-07 09:54:26 +0000864 };
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +0100865 MethodReference target_method(resolved_method->GetDexFile(),
866 resolved_method->GetDexMethodIndex());
David Brazdildee58d62016-04-07 09:54:26 +0000867 invoke = new (arena_) HInvokeStaticOrDirect(arena_,
868 number_of_arguments,
869 return_type,
870 dex_pc,
871 method_idx,
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +0100872 resolved_method,
David Brazdildee58d62016-04-07 09:54:26 +0000873 dispatch_info,
874 invoke_type,
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +0100875 target_method,
David Brazdildee58d62016-04-07 09:54:26 +0000876 clinit_check_requirement);
877 } else if (invoke_type == kVirtual) {
878 ScopedObjectAccess soa(Thread::Current()); // Needed for the method index
879 invoke = new (arena_) HInvokeVirtual(arena_,
880 number_of_arguments,
881 return_type,
882 dex_pc,
883 method_idx,
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +0100884 resolved_method,
David Brazdildee58d62016-04-07 09:54:26 +0000885 resolved_method->GetMethodIndex());
886 } else {
887 DCHECK_EQ(invoke_type, kInterface);
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +0100888 ScopedObjectAccess soa(Thread::Current()); // Needed for the IMT index.
David Brazdildee58d62016-04-07 09:54:26 +0000889 invoke = new (arena_) HInvokeInterface(arena_,
890 number_of_arguments,
891 return_type,
892 dex_pc,
893 method_idx,
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +0100894 resolved_method,
Andreas Gampe75a7db62016-09-26 12:04:26 -0700895 ImTable::GetImtIndex(resolved_method));
David Brazdildee58d62016-04-07 09:54:26 +0000896 }
897
898 return HandleInvoke(invoke,
899 number_of_vreg_arguments,
900 args,
901 register_index,
902 is_range,
903 descriptor,
Aart Bik296fbb42016-06-07 13:49:12 -0700904 clinit_check,
905 false /* is_unresolved */);
David Brazdildee58d62016-04-07 09:54:26 +0000906}
907
Orion Hodsonac141392017-01-13 11:53:47 +0000908bool HInstructionBuilder::BuildInvokePolymorphic(const Instruction& instruction ATTRIBUTE_UNUSED,
909 uint32_t dex_pc,
910 uint32_t method_idx,
911 uint32_t proto_idx,
912 uint32_t number_of_vreg_arguments,
913 bool is_range,
914 uint32_t* args,
915 uint32_t register_index) {
916 const char* descriptor = dex_file_->GetShorty(proto_idx);
917 DCHECK_EQ(1 + ArtMethod::NumArgRegisters(descriptor), number_of_vreg_arguments);
918 Primitive::Type return_type = Primitive::GetType(descriptor[0]);
919 size_t number_of_arguments = strlen(descriptor);
920 HInvoke* invoke = new (arena_) HInvokePolymorphic(arena_,
921 number_of_arguments,
922 return_type,
923 dex_pc,
924 method_idx);
925 return HandleInvoke(invoke,
926 number_of_vreg_arguments,
927 args,
928 register_index,
929 is_range,
930 descriptor,
931 nullptr /* clinit_check */,
932 false /* is_unresolved */);
933}
934
Andreas Gampea5b09a62016-11-17 15:21:22 -0800935bool HInstructionBuilder::BuildNewInstance(dex::TypeIndex type_index, uint32_t dex_pc) {
Vladimir Marko3cd50df2016-04-13 19:29:26 +0100936 ScopedObjectAccess soa(Thread::Current());
Vladimir Marko3cd50df2016-04-13 19:29:26 +0100937 Handle<mirror::DexCache> dex_cache = dex_compilation_unit_->GetDexCache();
Vladimir Marko3cd50df2016-04-13 19:29:26 +0100938 Handle<mirror::DexCache> outer_dex_cache = outer_compilation_unit_->GetDexCache();
939
David Brazdildee58d62016-04-07 09:54:26 +0000940 if (outer_dex_cache.Get() != dex_cache.Get()) {
941 // We currently do not support inlining allocations across dex files.
942 return false;
943 }
944
Nicolas Geoffray5247c082017-01-13 14:17:29 +0000945 HLoadClass* load_class = BuildLoadClass(type_index, dex_pc, /* check_access */ true);
David Brazdildee58d62016-04-07 09:54:26 +0000946
David Brazdildee58d62016-04-07 09:54:26 +0000947 HInstruction* cls = load_class;
Nicolas Geoffray5247c082017-01-13 14:17:29 +0000948 Handle<mirror::Class> klass = load_class->GetClass();
949
950 if (!IsInitialized(klass)) {
David Brazdildee58d62016-04-07 09:54:26 +0000951 cls = new (arena_) HClinitCheck(load_class, dex_pc);
952 AppendInstruction(cls);
953 }
954
Nicolas Geoffray5247c082017-01-13 14:17:29 +0000955 // Only the access check entrypoint handles the finalizable class case. If we
956 // need access checks, then we haven't resolved the method and the class may
957 // again be finalizable.
958 QuickEntrypointEnum entrypoint = kQuickAllocObjectInitialized;
959 if (load_class->NeedsAccessCheck() || klass->IsFinalizable() || !klass->IsInstantiable()) {
960 entrypoint = kQuickAllocObjectWithChecks;
961 }
962
963 // Consider classes we haven't resolved as potentially finalizable.
964 bool finalizable = (klass.Get() == nullptr) || klass->IsFinalizable();
965
David Brazdildee58d62016-04-07 09:54:26 +0000966 AppendInstruction(new (arena_) HNewInstance(
967 cls,
David Brazdildee58d62016-04-07 09:54:26 +0000968 dex_pc,
969 type_index,
970 *dex_compilation_unit_->GetDexFile(),
David Brazdildee58d62016-04-07 09:54:26 +0000971 finalizable,
972 entrypoint));
973 return true;
974}
975
976static bool IsSubClass(mirror::Class* to_test, mirror::Class* super_class)
Andreas Gampebdf7f1c2016-08-30 16:38:47 -0700977 REQUIRES_SHARED(Locks::mutator_lock_) {
David Brazdildee58d62016-04-07 09:54:26 +0000978 return to_test != nullptr && !to_test->IsInterface() && to_test->IsSubClass(super_class);
979}
980
981bool HInstructionBuilder::IsInitialized(Handle<mirror::Class> cls) const {
982 if (cls.Get() == nullptr) {
983 return false;
984 }
985
986 // `CanAssumeClassIsLoaded` will return true if we're JITting, or will
987 // check whether the class is in an image for the AOT compilation.
988 if (cls->IsInitialized() &&
989 compiler_driver_->CanAssumeClassIsLoaded(cls.Get())) {
990 return true;
991 }
992
993 if (IsSubClass(GetOutermostCompilingClass(), cls.Get())) {
994 return true;
995 }
996
997 // TODO: We should walk over the inlined methods, but we don't pass
998 // that information to the builder.
999 if (IsSubClass(GetCompilingClass(), cls.Get())) {
1000 return true;
1001 }
1002
1003 return false;
1004}
1005
1006HClinitCheck* HInstructionBuilder::ProcessClinitCheckForInvoke(
1007 uint32_t dex_pc,
1008 ArtMethod* resolved_method,
1009 uint32_t method_idx,
1010 HInvokeStaticOrDirect::ClinitCheckRequirement* clinit_check_requirement) {
David Brazdildee58d62016-04-07 09:54:26 +00001011 Thread* self = Thread::Current();
Vladimir Marko3cd50df2016-04-13 19:29:26 +01001012 StackHandleScope<2> hs(self);
1013 Handle<mirror::DexCache> dex_cache = dex_compilation_unit_->GetDexCache();
1014 Handle<mirror::DexCache> outer_dex_cache = outer_compilation_unit_->GetDexCache();
David Brazdildee58d62016-04-07 09:54:26 +00001015 Handle<mirror::Class> outer_class(hs.NewHandle(GetOutermostCompilingClass()));
1016 Handle<mirror::Class> resolved_method_class(hs.NewHandle(resolved_method->GetDeclaringClass()));
1017
1018 // The index at which the method's class is stored in the DexCache's type array.
Andreas Gampea5b09a62016-11-17 15:21:22 -08001019 dex::TypeIndex storage_index;
David Brazdildee58d62016-04-07 09:54:26 +00001020 bool is_outer_class = (resolved_method->GetDeclaringClass() == outer_class.Get());
1021 if (is_outer_class) {
1022 storage_index = outer_class->GetDexTypeIndex();
1023 } else if (outer_dex_cache.Get() == dex_cache.Get()) {
1024 // Get `storage_index` from IsClassOfStaticMethodAvailableToReferrer.
1025 compiler_driver_->IsClassOfStaticMethodAvailableToReferrer(outer_dex_cache.Get(),
1026 GetCompilingClass(),
1027 resolved_method,
1028 method_idx,
1029 &storage_index);
1030 }
1031
1032 HClinitCheck* clinit_check = nullptr;
1033
1034 if (IsInitialized(resolved_method_class)) {
1035 *clinit_check_requirement = HInvokeStaticOrDirect::ClinitCheckRequirement::kNone;
Andreas Gampea5b09a62016-11-17 15:21:22 -08001036 } else if (storage_index.IsValid()) {
David Brazdildee58d62016-04-07 09:54:26 +00001037 *clinit_check_requirement = HInvokeStaticOrDirect::ClinitCheckRequirement::kExplicit;
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001038 HLoadClass* cls = BuildLoadClass(
1039 storage_index, dex_pc, /* check_access */ false, /* outer */ true);
1040 clinit_check = new (arena_) HClinitCheck(cls, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001041 AppendInstruction(clinit_check);
1042 }
1043 return clinit_check;
1044}
1045
1046bool HInstructionBuilder::SetupInvokeArguments(HInvoke* invoke,
1047 uint32_t number_of_vreg_arguments,
1048 uint32_t* args,
1049 uint32_t register_index,
1050 bool is_range,
1051 const char* descriptor,
1052 size_t start_index,
1053 size_t* argument_index) {
1054 uint32_t descriptor_index = 1; // Skip the return type.
1055
1056 for (size_t i = start_index;
1057 // Make sure we don't go over the expected arguments or over the number of
1058 // dex registers given. If the instruction was seen as dead by the verifier,
1059 // it hasn't been properly checked.
1060 (i < number_of_vreg_arguments) && (*argument_index < invoke->GetNumberOfArguments());
1061 i++, (*argument_index)++) {
1062 Primitive::Type type = Primitive::GetType(descriptor[descriptor_index++]);
1063 bool is_wide = (type == Primitive::kPrimLong) || (type == Primitive::kPrimDouble);
1064 if (!is_range
1065 && is_wide
1066 && ((i + 1 == number_of_vreg_arguments) || (args[i] + 1 != args[i + 1]))) {
1067 // Longs and doubles should be in pairs, that is, sequential registers. The verifier should
1068 // reject any class where this is violated. However, the verifier only does these checks
1069 // on non trivially dead instructions, so we just bailout the compilation.
1070 VLOG(compiler) << "Did not compile "
David Sehr709b0702016-10-13 09:12:37 -07001071 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
David Brazdildee58d62016-04-07 09:54:26 +00001072 << " because of non-sequential dex register pair in wide argument";
1073 MaybeRecordStat(MethodCompilationStat::kNotCompiledMalformedOpcode);
1074 return false;
1075 }
1076 HInstruction* arg = LoadLocal(is_range ? register_index + i : args[i], type);
1077 invoke->SetArgumentAt(*argument_index, arg);
1078 if (is_wide) {
1079 i++;
1080 }
1081 }
1082
1083 if (*argument_index != invoke->GetNumberOfArguments()) {
1084 VLOG(compiler) << "Did not compile "
David Sehr709b0702016-10-13 09:12:37 -07001085 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
David Brazdildee58d62016-04-07 09:54:26 +00001086 << " because of wrong number of arguments in invoke instruction";
1087 MaybeRecordStat(MethodCompilationStat::kNotCompiledMalformedOpcode);
1088 return false;
1089 }
1090
1091 if (invoke->IsInvokeStaticOrDirect() &&
1092 HInvokeStaticOrDirect::NeedsCurrentMethodInput(
1093 invoke->AsInvokeStaticOrDirect()->GetMethodLoadKind())) {
1094 invoke->SetArgumentAt(*argument_index, graph_->GetCurrentMethod());
1095 (*argument_index)++;
1096 }
1097
1098 return true;
1099}
1100
1101bool HInstructionBuilder::HandleInvoke(HInvoke* invoke,
1102 uint32_t number_of_vreg_arguments,
1103 uint32_t* args,
1104 uint32_t register_index,
1105 bool is_range,
1106 const char* descriptor,
Aart Bik296fbb42016-06-07 13:49:12 -07001107 HClinitCheck* clinit_check,
1108 bool is_unresolved) {
David Brazdildee58d62016-04-07 09:54:26 +00001109 DCHECK(!invoke->IsInvokeStaticOrDirect() || !invoke->AsInvokeStaticOrDirect()->IsStringInit());
1110
1111 size_t start_index = 0;
1112 size_t argument_index = 0;
Nicolas Geoffray5e4e11e2016-09-22 13:17:41 +01001113 if (invoke->GetInvokeType() != InvokeType::kStatic) { // Instance call.
Aart Bik296fbb42016-06-07 13:49:12 -07001114 uint32_t obj_reg = is_range ? register_index : args[0];
1115 HInstruction* arg = is_unresolved
1116 ? LoadLocal(obj_reg, Primitive::kPrimNot)
1117 : LoadNullCheckedLocal(obj_reg, invoke->GetDexPc());
David Brazdilc120bbe2016-04-22 16:57:00 +01001118 invoke->SetArgumentAt(0, arg);
David Brazdildee58d62016-04-07 09:54:26 +00001119 start_index = 1;
1120 argument_index = 1;
1121 }
1122
1123 if (!SetupInvokeArguments(invoke,
1124 number_of_vreg_arguments,
1125 args,
1126 register_index,
1127 is_range,
1128 descriptor,
1129 start_index,
1130 &argument_index)) {
1131 return false;
1132 }
1133
1134 if (clinit_check != nullptr) {
1135 // Add the class initialization check as last input of `invoke`.
1136 DCHECK(invoke->IsInvokeStaticOrDirect());
1137 DCHECK(invoke->AsInvokeStaticOrDirect()->GetClinitCheckRequirement()
1138 == HInvokeStaticOrDirect::ClinitCheckRequirement::kExplicit);
1139 invoke->SetArgumentAt(argument_index, clinit_check);
1140 argument_index++;
1141 }
1142
1143 AppendInstruction(invoke);
1144 latest_result_ = invoke;
1145
1146 return true;
1147}
1148
1149bool HInstructionBuilder::HandleStringInit(HInvoke* invoke,
1150 uint32_t number_of_vreg_arguments,
1151 uint32_t* args,
1152 uint32_t register_index,
1153 bool is_range,
1154 const char* descriptor) {
1155 DCHECK(invoke->IsInvokeStaticOrDirect());
1156 DCHECK(invoke->AsInvokeStaticOrDirect()->IsStringInit());
1157
1158 size_t start_index = 1;
1159 size_t argument_index = 0;
1160 if (!SetupInvokeArguments(invoke,
1161 number_of_vreg_arguments,
1162 args,
1163 register_index,
1164 is_range,
1165 descriptor,
1166 start_index,
1167 &argument_index)) {
1168 return false;
1169 }
1170
1171 AppendInstruction(invoke);
1172
1173 // This is a StringFactory call, not an actual String constructor. Its result
1174 // replaces the empty String pre-allocated by NewInstance.
1175 uint32_t orig_this_reg = is_range ? register_index : args[0];
1176 HInstruction* arg_this = LoadLocal(orig_this_reg, Primitive::kPrimNot);
1177
1178 // Replacing the NewInstance might render it redundant. Keep a list of these
1179 // to be visited once it is clear whether it is has remaining uses.
1180 if (arg_this->IsNewInstance()) {
1181 ssa_builder_->AddUninitializedString(arg_this->AsNewInstance());
1182 } else {
1183 DCHECK(arg_this->IsPhi());
1184 // NewInstance is not the direct input of the StringFactory call. It might
1185 // be redundant but optimizing this case is not worth the effort.
1186 }
1187
1188 // Walk over all vregs and replace any occurrence of `arg_this` with `invoke`.
1189 for (size_t vreg = 0, e = current_locals_->size(); vreg < e; ++vreg) {
1190 if ((*current_locals_)[vreg] == arg_this) {
1191 (*current_locals_)[vreg] = invoke;
1192 }
1193 }
1194
1195 return true;
1196}
1197
1198static Primitive::Type GetFieldAccessType(const DexFile& dex_file, uint16_t field_index) {
1199 const DexFile::FieldId& field_id = dex_file.GetFieldId(field_index);
1200 const char* type = dex_file.GetFieldTypeDescriptor(field_id);
1201 return Primitive::GetType(type[0]);
1202}
1203
1204bool HInstructionBuilder::BuildInstanceFieldAccess(const Instruction& instruction,
1205 uint32_t dex_pc,
1206 bool is_put) {
1207 uint32_t source_or_dest_reg = instruction.VRegA_22c();
1208 uint32_t obj_reg = instruction.VRegB_22c();
1209 uint16_t field_index;
1210 if (instruction.IsQuickened()) {
1211 if (!CanDecodeQuickenedInfo()) {
1212 return false;
1213 }
1214 field_index = LookupQuickenedInfo(dex_pc);
1215 } else {
1216 field_index = instruction.VRegC_22c();
1217 }
1218
1219 ScopedObjectAccess soa(Thread::Current());
1220 ArtField* resolved_field =
1221 compiler_driver_->ComputeInstanceFieldInfo(field_index, dex_compilation_unit_, is_put, soa);
1222
1223
Aart Bik14154132016-06-02 17:53:58 -07001224 // Generate an explicit null check on the reference, unless the field access
1225 // is unresolved. In that case, we rely on the runtime to perform various
1226 // checks first, followed by a null check.
1227 HInstruction* object = (resolved_field == nullptr)
1228 ? LoadLocal(obj_reg, Primitive::kPrimNot)
1229 : LoadNullCheckedLocal(obj_reg, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001230
1231 Primitive::Type field_type = (resolved_field == nullptr)
1232 ? GetFieldAccessType(*dex_file_, field_index)
1233 : resolved_field->GetTypeAsPrimitiveType();
1234 if (is_put) {
1235 HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
1236 HInstruction* field_set = nullptr;
1237 if (resolved_field == nullptr) {
1238 MaybeRecordStat(MethodCompilationStat::kUnresolvedField);
David Brazdilc120bbe2016-04-22 16:57:00 +01001239 field_set = new (arena_) HUnresolvedInstanceFieldSet(object,
David Brazdildee58d62016-04-07 09:54:26 +00001240 value,
1241 field_type,
1242 field_index,
1243 dex_pc);
1244 } else {
1245 uint16_t class_def_index = resolved_field->GetDeclaringClass()->GetDexClassDefIndex();
David Brazdilc120bbe2016-04-22 16:57:00 +01001246 field_set = new (arena_) HInstanceFieldSet(object,
David Brazdildee58d62016-04-07 09:54:26 +00001247 value,
Nicolas Geoffrayc52b26d2016-12-19 09:18:07 +00001248 resolved_field,
David Brazdildee58d62016-04-07 09:54:26 +00001249 field_type,
1250 resolved_field->GetOffset(),
1251 resolved_field->IsVolatile(),
1252 field_index,
1253 class_def_index,
1254 *dex_file_,
David Brazdildee58d62016-04-07 09:54:26 +00001255 dex_pc);
1256 }
1257 AppendInstruction(field_set);
1258 } else {
1259 HInstruction* field_get = nullptr;
1260 if (resolved_field == nullptr) {
1261 MaybeRecordStat(MethodCompilationStat::kUnresolvedField);
David Brazdilc120bbe2016-04-22 16:57:00 +01001262 field_get = new (arena_) HUnresolvedInstanceFieldGet(object,
David Brazdildee58d62016-04-07 09:54:26 +00001263 field_type,
1264 field_index,
1265 dex_pc);
1266 } else {
1267 uint16_t class_def_index = resolved_field->GetDeclaringClass()->GetDexClassDefIndex();
David Brazdilc120bbe2016-04-22 16:57:00 +01001268 field_get = new (arena_) HInstanceFieldGet(object,
Nicolas Geoffrayc52b26d2016-12-19 09:18:07 +00001269 resolved_field,
David Brazdildee58d62016-04-07 09:54:26 +00001270 field_type,
1271 resolved_field->GetOffset(),
1272 resolved_field->IsVolatile(),
1273 field_index,
1274 class_def_index,
1275 *dex_file_,
David Brazdildee58d62016-04-07 09:54:26 +00001276 dex_pc);
1277 }
1278 AppendInstruction(field_get);
1279 UpdateLocal(source_or_dest_reg, field_get);
1280 }
1281
1282 return true;
1283}
1284
1285static mirror::Class* GetClassFrom(CompilerDriver* driver,
1286 const DexCompilationUnit& compilation_unit) {
1287 ScopedObjectAccess soa(Thread::Current());
Vladimir Marko3cd50df2016-04-13 19:29:26 +01001288 StackHandleScope<1> hs(soa.Self());
David Brazdildee58d62016-04-07 09:54:26 +00001289 Handle<mirror::ClassLoader> class_loader(hs.NewHandle(
Mathieu Chartier0795f232016-09-27 18:43:30 -07001290 soa.Decode<mirror::ClassLoader>(compilation_unit.GetClassLoader())));
Vladimir Marko3cd50df2016-04-13 19:29:26 +01001291 Handle<mirror::DexCache> dex_cache = compilation_unit.GetDexCache();
David Brazdildee58d62016-04-07 09:54:26 +00001292
1293 return driver->ResolveCompilingMethodsClass(soa, dex_cache, class_loader, &compilation_unit);
1294}
1295
1296mirror::Class* HInstructionBuilder::GetOutermostCompilingClass() const {
1297 return GetClassFrom(compiler_driver_, *outer_compilation_unit_);
1298}
1299
1300mirror::Class* HInstructionBuilder::GetCompilingClass() const {
1301 return GetClassFrom(compiler_driver_, *dex_compilation_unit_);
1302}
1303
Andreas Gampea5b09a62016-11-17 15:21:22 -08001304bool HInstructionBuilder::IsOutermostCompilingClass(dex::TypeIndex type_index) const {
David Brazdildee58d62016-04-07 09:54:26 +00001305 ScopedObjectAccess soa(Thread::Current());
Vladimir Marko3cd50df2016-04-13 19:29:26 +01001306 StackHandleScope<3> hs(soa.Self());
1307 Handle<mirror::DexCache> dex_cache = dex_compilation_unit_->GetDexCache();
David Brazdildee58d62016-04-07 09:54:26 +00001308 Handle<mirror::ClassLoader> class_loader(hs.NewHandle(
Mathieu Chartier0795f232016-09-27 18:43:30 -07001309 soa.Decode<mirror::ClassLoader>(dex_compilation_unit_->GetClassLoader())));
David Brazdildee58d62016-04-07 09:54:26 +00001310 Handle<mirror::Class> cls(hs.NewHandle(compiler_driver_->ResolveClass(
1311 soa, dex_cache, class_loader, type_index, dex_compilation_unit_)));
1312 Handle<mirror::Class> outer_class(hs.NewHandle(GetOutermostCompilingClass()));
1313
1314 // GetOutermostCompilingClass returns null when the class is unresolved
1315 // (e.g. if it derives from an unresolved class). This is bogus knowing that
1316 // we are compiling it.
1317 // When this happens we cannot establish a direct relation between the current
1318 // class and the outer class, so we return false.
1319 // (Note that this is only used for optimizing invokes and field accesses)
1320 return (cls.Get() != nullptr) && (outer_class.Get() == cls.Get());
1321}
1322
1323void HInstructionBuilder::BuildUnresolvedStaticFieldAccess(const Instruction& instruction,
Nicolas Geoffrayc52b26d2016-12-19 09:18:07 +00001324 uint32_t dex_pc,
1325 bool is_put,
1326 Primitive::Type field_type) {
David Brazdildee58d62016-04-07 09:54:26 +00001327 uint32_t source_or_dest_reg = instruction.VRegA_21c();
1328 uint16_t field_index = instruction.VRegB_21c();
1329
1330 if (is_put) {
1331 HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
1332 AppendInstruction(
1333 new (arena_) HUnresolvedStaticFieldSet(value, field_type, field_index, dex_pc));
1334 } else {
1335 AppendInstruction(new (arena_) HUnresolvedStaticFieldGet(field_type, field_index, dex_pc));
1336 UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
1337 }
1338}
1339
1340bool HInstructionBuilder::BuildStaticFieldAccess(const Instruction& instruction,
1341 uint32_t dex_pc,
1342 bool is_put) {
1343 uint32_t source_or_dest_reg = instruction.VRegA_21c();
1344 uint16_t field_index = instruction.VRegB_21c();
1345
1346 ScopedObjectAccess soa(Thread::Current());
Vladimir Marko3cd50df2016-04-13 19:29:26 +01001347 StackHandleScope<3> hs(soa.Self());
1348 Handle<mirror::DexCache> dex_cache = dex_compilation_unit_->GetDexCache();
David Brazdildee58d62016-04-07 09:54:26 +00001349 Handle<mirror::ClassLoader> class_loader(hs.NewHandle(
Mathieu Chartier0795f232016-09-27 18:43:30 -07001350 soa.Decode<mirror::ClassLoader>(dex_compilation_unit_->GetClassLoader())));
David Brazdildee58d62016-04-07 09:54:26 +00001351 ArtField* resolved_field = compiler_driver_->ResolveField(
1352 soa, dex_cache, class_loader, dex_compilation_unit_, field_index, true);
1353
1354 if (resolved_field == nullptr) {
1355 MaybeRecordStat(MethodCompilationStat::kUnresolvedField);
1356 Primitive::Type field_type = GetFieldAccessType(*dex_file_, field_index);
1357 BuildUnresolvedStaticFieldAccess(instruction, dex_pc, is_put, field_type);
1358 return true;
1359 }
1360
1361 Primitive::Type field_type = resolved_field->GetTypeAsPrimitiveType();
Vladimir Marko3cd50df2016-04-13 19:29:26 +01001362 Handle<mirror::DexCache> outer_dex_cache = outer_compilation_unit_->GetDexCache();
David Brazdildee58d62016-04-07 09:54:26 +00001363 Handle<mirror::Class> outer_class(hs.NewHandle(GetOutermostCompilingClass()));
1364
1365 // The index at which the field's class is stored in the DexCache's type array.
Andreas Gampea5b09a62016-11-17 15:21:22 -08001366 dex::TypeIndex storage_index;
David Brazdildee58d62016-04-07 09:54:26 +00001367 bool is_outer_class = (outer_class.Get() == resolved_field->GetDeclaringClass());
1368 if (is_outer_class) {
1369 storage_index = outer_class->GetDexTypeIndex();
1370 } else if (outer_dex_cache.Get() != dex_cache.Get()) {
1371 // The compiler driver cannot currently understand multiple dex caches involved. Just bailout.
1372 return false;
1373 } else {
1374 // TODO: This is rather expensive. Perf it and cache the results if needed.
1375 std::pair<bool, bool> pair = compiler_driver_->IsFastStaticField(
1376 outer_dex_cache.Get(),
1377 GetCompilingClass(),
1378 resolved_field,
1379 field_index,
1380 &storage_index);
1381 bool can_easily_access = is_put ? pair.second : pair.first;
1382 if (!can_easily_access) {
1383 MaybeRecordStat(MethodCompilationStat::kUnresolvedFieldNotAFastAccess);
1384 BuildUnresolvedStaticFieldAccess(instruction, dex_pc, is_put, field_type);
1385 return true;
1386 }
1387 }
1388
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001389 HLoadClass* constant = BuildLoadClass(
1390 storage_index, dex_pc, /* check_access */ false, /* outer */ true);
David Brazdildee58d62016-04-07 09:54:26 +00001391
1392 HInstruction* cls = constant;
David Brazdildee58d62016-04-07 09:54:26 +00001393 Handle<mirror::Class> klass(hs.NewHandle(resolved_field->GetDeclaringClass()));
1394 if (!IsInitialized(klass)) {
1395 cls = new (arena_) HClinitCheck(constant, dex_pc);
1396 AppendInstruction(cls);
1397 }
1398
1399 uint16_t class_def_index = klass->GetDexClassDefIndex();
1400 if (is_put) {
1401 // We need to keep the class alive before loading the value.
1402 HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
1403 DCHECK_EQ(HPhi::ToPhiType(value->GetType()), HPhi::ToPhiType(field_type));
1404 AppendInstruction(new (arena_) HStaticFieldSet(cls,
1405 value,
Nicolas Geoffrayc52b26d2016-12-19 09:18:07 +00001406 resolved_field,
David Brazdildee58d62016-04-07 09:54:26 +00001407 field_type,
1408 resolved_field->GetOffset(),
1409 resolved_field->IsVolatile(),
1410 field_index,
1411 class_def_index,
1412 *dex_file_,
David Brazdildee58d62016-04-07 09:54:26 +00001413 dex_pc));
1414 } else {
1415 AppendInstruction(new (arena_) HStaticFieldGet(cls,
Nicolas Geoffrayc52b26d2016-12-19 09:18:07 +00001416 resolved_field,
David Brazdildee58d62016-04-07 09:54:26 +00001417 field_type,
1418 resolved_field->GetOffset(),
1419 resolved_field->IsVolatile(),
1420 field_index,
1421 class_def_index,
1422 *dex_file_,
David Brazdildee58d62016-04-07 09:54:26 +00001423 dex_pc));
1424 UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
1425 }
1426 return true;
1427}
1428
1429void HInstructionBuilder::BuildCheckedDivRem(uint16_t out_vreg,
1430 uint16_t first_vreg,
1431 int64_t second_vreg_or_constant,
1432 uint32_t dex_pc,
1433 Primitive::Type type,
1434 bool second_is_constant,
1435 bool isDiv) {
1436 DCHECK(type == Primitive::kPrimInt || type == Primitive::kPrimLong);
1437
1438 HInstruction* first = LoadLocal(first_vreg, type);
1439 HInstruction* second = nullptr;
1440 if (second_is_constant) {
1441 if (type == Primitive::kPrimInt) {
1442 second = graph_->GetIntConstant(second_vreg_or_constant, dex_pc);
1443 } else {
1444 second = graph_->GetLongConstant(second_vreg_or_constant, dex_pc);
1445 }
1446 } else {
1447 second = LoadLocal(second_vreg_or_constant, type);
1448 }
1449
1450 if (!second_is_constant
1451 || (type == Primitive::kPrimInt && second->AsIntConstant()->GetValue() == 0)
1452 || (type == Primitive::kPrimLong && second->AsLongConstant()->GetValue() == 0)) {
1453 second = new (arena_) HDivZeroCheck(second, dex_pc);
1454 AppendInstruction(second);
1455 }
1456
1457 if (isDiv) {
1458 AppendInstruction(new (arena_) HDiv(type, first, second, dex_pc));
1459 } else {
1460 AppendInstruction(new (arena_) HRem(type, first, second, dex_pc));
1461 }
1462 UpdateLocal(out_vreg, current_block_->GetLastInstruction());
1463}
1464
1465void HInstructionBuilder::BuildArrayAccess(const Instruction& instruction,
1466 uint32_t dex_pc,
1467 bool is_put,
1468 Primitive::Type anticipated_type) {
1469 uint8_t source_or_dest_reg = instruction.VRegA_23x();
1470 uint8_t array_reg = instruction.VRegB_23x();
1471 uint8_t index_reg = instruction.VRegC_23x();
1472
David Brazdilc120bbe2016-04-22 16:57:00 +01001473 HInstruction* object = LoadNullCheckedLocal(array_reg, dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001474 HInstruction* length = new (arena_) HArrayLength(object, dex_pc);
1475 AppendInstruction(length);
1476 HInstruction* index = LoadLocal(index_reg, Primitive::kPrimInt);
1477 index = new (arena_) HBoundsCheck(index, length, dex_pc);
1478 AppendInstruction(index);
1479 if (is_put) {
1480 HInstruction* value = LoadLocal(source_or_dest_reg, anticipated_type);
1481 // TODO: Insert a type check node if the type is Object.
1482 HArraySet* aset = new (arena_) HArraySet(object, index, value, anticipated_type, dex_pc);
1483 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
1484 AppendInstruction(aset);
1485 } else {
1486 HArrayGet* aget = new (arena_) HArrayGet(object, index, anticipated_type, dex_pc);
1487 ssa_builder_->MaybeAddAmbiguousArrayGet(aget);
1488 AppendInstruction(aget);
1489 UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
1490 }
1491 graph_->SetHasBoundsChecks(true);
1492}
1493
1494void HInstructionBuilder::BuildFilledNewArray(uint32_t dex_pc,
Andreas Gampea5b09a62016-11-17 15:21:22 -08001495 dex::TypeIndex type_index,
David Brazdildee58d62016-04-07 09:54:26 +00001496 uint32_t number_of_vreg_arguments,
1497 bool is_range,
1498 uint32_t* args,
1499 uint32_t register_index) {
1500 HInstruction* length = graph_->GetIntConstant(number_of_vreg_arguments, dex_pc);
Hiroshi Yamauchifee25502017-01-19 02:11:15 +00001501 bool finalizable;
1502 QuickEntrypointEnum entrypoint = NeedsAccessCheck(type_index, &finalizable)
1503 ? kQuickAllocArrayWithAccessCheck
1504 : kQuickAllocArray;
1505 HInstruction* object = new (arena_) HNewArray(length,
1506 graph_->GetCurrentMethod(),
1507 dex_pc,
1508 type_index,
1509 *dex_compilation_unit_->GetDexFile(),
1510 entrypoint);
David Brazdildee58d62016-04-07 09:54:26 +00001511 AppendInstruction(object);
1512
1513 const char* descriptor = dex_file_->StringByTypeIdx(type_index);
1514 DCHECK_EQ(descriptor[0], '[') << descriptor;
1515 char primitive = descriptor[1];
1516 DCHECK(primitive == 'I'
1517 || primitive == 'L'
1518 || primitive == '[') << descriptor;
1519 bool is_reference_array = (primitive == 'L') || (primitive == '[');
1520 Primitive::Type type = is_reference_array ? Primitive::kPrimNot : Primitive::kPrimInt;
1521
1522 for (size_t i = 0; i < number_of_vreg_arguments; ++i) {
1523 HInstruction* value = LoadLocal(is_range ? register_index + i : args[i], type);
1524 HInstruction* index = graph_->GetIntConstant(i, dex_pc);
1525 HArraySet* aset = new (arena_) HArraySet(object, index, value, type, dex_pc);
1526 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
1527 AppendInstruction(aset);
1528 }
1529 latest_result_ = object;
1530}
1531
1532template <typename T>
1533void HInstructionBuilder::BuildFillArrayData(HInstruction* object,
1534 const T* data,
1535 uint32_t element_count,
1536 Primitive::Type anticipated_type,
1537 uint32_t dex_pc) {
1538 for (uint32_t i = 0; i < element_count; ++i) {
1539 HInstruction* index = graph_->GetIntConstant(i, dex_pc);
1540 HInstruction* value = graph_->GetIntConstant(data[i], dex_pc);
1541 HArraySet* aset = new (arena_) HArraySet(object, index, value, anticipated_type, dex_pc);
1542 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
1543 AppendInstruction(aset);
1544 }
1545}
1546
1547void HInstructionBuilder::BuildFillArrayData(const Instruction& instruction, uint32_t dex_pc) {
David Brazdilc120bbe2016-04-22 16:57:00 +01001548 HInstruction* array = LoadNullCheckedLocal(instruction.VRegA_31t(), dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00001549
1550 int32_t payload_offset = instruction.VRegB_31t() + dex_pc;
1551 const Instruction::ArrayDataPayload* payload =
1552 reinterpret_cast<const Instruction::ArrayDataPayload*>(code_item_.insns_ + payload_offset);
1553 const uint8_t* data = payload->data;
1554 uint32_t element_count = payload->element_count;
1555
Vladimir Markoc69fba22016-09-06 16:49:15 +01001556 if (element_count == 0u) {
1557 // For empty payload we emit only the null check above.
1558 return;
1559 }
1560
1561 HInstruction* length = new (arena_) HArrayLength(array, dex_pc);
1562 AppendInstruction(length);
1563
David Brazdildee58d62016-04-07 09:54:26 +00001564 // Implementation of this DEX instruction seems to be that the bounds check is
1565 // done before doing any stores.
1566 HInstruction* last_index = graph_->GetIntConstant(payload->element_count - 1, dex_pc);
1567 AppendInstruction(new (arena_) HBoundsCheck(last_index, length, dex_pc));
1568
1569 switch (payload->element_width) {
1570 case 1:
David Brazdilc120bbe2016-04-22 16:57:00 +01001571 BuildFillArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00001572 reinterpret_cast<const int8_t*>(data),
1573 element_count,
1574 Primitive::kPrimByte,
1575 dex_pc);
1576 break;
1577 case 2:
David Brazdilc120bbe2016-04-22 16:57:00 +01001578 BuildFillArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00001579 reinterpret_cast<const int16_t*>(data),
1580 element_count,
1581 Primitive::kPrimShort,
1582 dex_pc);
1583 break;
1584 case 4:
David Brazdilc120bbe2016-04-22 16:57:00 +01001585 BuildFillArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00001586 reinterpret_cast<const int32_t*>(data),
1587 element_count,
1588 Primitive::kPrimInt,
1589 dex_pc);
1590 break;
1591 case 8:
David Brazdilc120bbe2016-04-22 16:57:00 +01001592 BuildFillWideArrayData(array,
David Brazdildee58d62016-04-07 09:54:26 +00001593 reinterpret_cast<const int64_t*>(data),
1594 element_count,
1595 dex_pc);
1596 break;
1597 default:
1598 LOG(FATAL) << "Unknown element width for " << payload->element_width;
1599 }
1600 graph_->SetHasBoundsChecks(true);
1601}
1602
1603void HInstructionBuilder::BuildFillWideArrayData(HInstruction* object,
1604 const int64_t* data,
1605 uint32_t element_count,
1606 uint32_t dex_pc) {
1607 for (uint32_t i = 0; i < element_count; ++i) {
1608 HInstruction* index = graph_->GetIntConstant(i, dex_pc);
1609 HInstruction* value = graph_->GetLongConstant(data[i], dex_pc);
1610 HArraySet* aset = new (arena_) HArraySet(object, index, value, Primitive::kPrimLong, dex_pc);
1611 ssa_builder_->MaybeAddAmbiguousArraySet(aset);
1612 AppendInstruction(aset);
1613 }
1614}
1615
1616static TypeCheckKind ComputeTypeCheckKind(Handle<mirror::Class> cls)
Andreas Gampebdf7f1c2016-08-30 16:38:47 -07001617 REQUIRES_SHARED(Locks::mutator_lock_) {
David Brazdildee58d62016-04-07 09:54:26 +00001618 if (cls.Get() == nullptr) {
1619 return TypeCheckKind::kUnresolvedCheck;
1620 } else if (cls->IsInterface()) {
1621 return TypeCheckKind::kInterfaceCheck;
1622 } else if (cls->IsArrayClass()) {
1623 if (cls->GetComponentType()->IsObjectClass()) {
1624 return TypeCheckKind::kArrayObjectCheck;
1625 } else if (cls->CannotBeAssignedFromOtherTypes()) {
1626 return TypeCheckKind::kExactCheck;
1627 } else {
1628 return TypeCheckKind::kArrayCheck;
1629 }
1630 } else if (cls->IsFinal()) {
1631 return TypeCheckKind::kExactCheck;
1632 } else if (cls->IsAbstract()) {
1633 return TypeCheckKind::kAbstractClassCheck;
1634 } else {
1635 return TypeCheckKind::kClassHierarchyCheck;
1636 }
1637}
1638
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001639HLoadClass* HInstructionBuilder::BuildLoadClass(dex::TypeIndex type_index,
1640 uint32_t dex_pc,
1641 bool check_access,
1642 bool outer) {
1643 ScopedObjectAccess soa(Thread::Current());
1644 const DexCompilationUnit* compilation_unit =
1645 outer ? outer_compilation_unit_ : dex_compilation_unit_;
1646 const DexFile& dex_file = *compilation_unit->GetDexFile();
1647 Handle<mirror::DexCache> dex_cache = compilation_unit->GetDexCache();
1648 bool is_accessible = false;
1649 Handle<mirror::Class> klass = handles_->NewHandle(dex_cache->GetResolvedType(type_index));
1650 if (!check_access) {
1651 is_accessible = true;
1652 } else if (klass.Get() != nullptr) {
1653 if (klass->IsPublic()) {
1654 is_accessible = true;
1655 } else {
1656 mirror::Class* compiling_class = GetCompilingClass();
1657 if (compiling_class != nullptr && compiling_class->CanAccess(klass.Get())) {
1658 is_accessible = true;
1659 }
1660 }
1661 }
1662
1663 HLoadClass* load_class = new (arena_) HLoadClass(
1664 graph_->GetCurrentMethod(),
1665 type_index,
1666 dex_file,
1667 klass,
1668 klass.Get() != nullptr && (klass.Get() == GetOutermostCompilingClass()),
1669 dex_pc,
1670 !is_accessible);
1671
1672 AppendInstruction(load_class);
1673 return load_class;
1674}
1675
David Brazdildee58d62016-04-07 09:54:26 +00001676void HInstructionBuilder::BuildTypeCheck(const Instruction& instruction,
1677 uint8_t destination,
1678 uint8_t reference,
Andreas Gampea5b09a62016-11-17 15:21:22 -08001679 dex::TypeIndex type_index,
David Brazdildee58d62016-04-07 09:54:26 +00001680 uint32_t dex_pc) {
David Brazdildee58d62016-04-07 09:54:26 +00001681 HInstruction* object = LoadLocal(reference, Primitive::kPrimNot);
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001682 HLoadClass* cls = BuildLoadClass(type_index, dex_pc, /* check_access */ true);
David Brazdildee58d62016-04-07 09:54:26 +00001683
Nicolas Geoffray5247c082017-01-13 14:17:29 +00001684 ScopedObjectAccess soa(Thread::Current());
1685 TypeCheckKind check_kind = ComputeTypeCheckKind(cls->GetClass());
David Brazdildee58d62016-04-07 09:54:26 +00001686 if (instruction.Opcode() == Instruction::INSTANCE_OF) {
1687 AppendInstruction(new (arena_) HInstanceOf(object, cls, check_kind, dex_pc));
1688 UpdateLocal(destination, current_block_->GetLastInstruction());
1689 } else {
1690 DCHECK_EQ(instruction.Opcode(), Instruction::CHECK_CAST);
1691 // We emit a CheckCast followed by a BoundType. CheckCast is a statement
1692 // which may throw. If it succeeds BoundType sets the new type of `object`
1693 // for all subsequent uses.
1694 AppendInstruction(new (arena_) HCheckCast(object, cls, check_kind, dex_pc));
1695 AppendInstruction(new (arena_) HBoundType(object, dex_pc));
1696 UpdateLocal(reference, current_block_->GetLastInstruction());
1697 }
1698}
1699
Andreas Gampea5b09a62016-11-17 15:21:22 -08001700bool HInstructionBuilder::NeedsAccessCheck(dex::TypeIndex type_index,
Vladimir Marko3cd50df2016-04-13 19:29:26 +01001701 Handle<mirror::DexCache> dex_cache,
1702 bool* finalizable) const {
David Brazdildee58d62016-04-07 09:54:26 +00001703 return !compiler_driver_->CanAccessInstantiableTypeWithoutChecks(
Vladimir Marko3cd50df2016-04-13 19:29:26 +01001704 dex_compilation_unit_->GetDexMethodIndex(), dex_cache, type_index, finalizable);
1705}
1706
Andreas Gampea5b09a62016-11-17 15:21:22 -08001707bool HInstructionBuilder::NeedsAccessCheck(dex::TypeIndex type_index, bool* finalizable) const {
Vladimir Marko3cd50df2016-04-13 19:29:26 +01001708 ScopedObjectAccess soa(Thread::Current());
1709 Handle<mirror::DexCache> dex_cache = dex_compilation_unit_->GetDexCache();
1710 return NeedsAccessCheck(type_index, dex_cache, finalizable);
David Brazdildee58d62016-04-07 09:54:26 +00001711}
1712
1713bool HInstructionBuilder::CanDecodeQuickenedInfo() const {
1714 return interpreter_metadata_ != nullptr;
1715}
1716
1717uint16_t HInstructionBuilder::LookupQuickenedInfo(uint32_t dex_pc) {
1718 DCHECK(interpreter_metadata_ != nullptr);
1719
1720 // First check if the info has already been decoded from `interpreter_metadata_`.
1721 auto it = skipped_interpreter_metadata_.find(dex_pc);
1722 if (it != skipped_interpreter_metadata_.end()) {
1723 // Remove the entry from the map and return the parsed info.
1724 uint16_t value_in_map = it->second;
1725 skipped_interpreter_metadata_.erase(it);
1726 return value_in_map;
1727 }
1728
1729 // Otherwise start parsing `interpreter_metadata_` until the slot for `dex_pc`
1730 // is found. Store skipped values in the `skipped_interpreter_metadata_` map.
1731 while (true) {
1732 uint32_t dex_pc_in_map = DecodeUnsignedLeb128(&interpreter_metadata_);
1733 uint16_t value_in_map = DecodeUnsignedLeb128(&interpreter_metadata_);
1734 DCHECK_LE(dex_pc_in_map, dex_pc);
1735
1736 if (dex_pc_in_map == dex_pc) {
1737 return value_in_map;
1738 } else {
Nicolas Geoffray01b70e82016-11-17 10:58:36 +00001739 // Overwrite and not Put, as quickened CHECK-CAST has two entries with
1740 // the same dex_pc. This is OK, because the compiler does not care about those
1741 // entries.
1742 skipped_interpreter_metadata_.Overwrite(dex_pc_in_map, value_in_map);
David Brazdildee58d62016-04-07 09:54:26 +00001743 }
1744 }
1745}
1746
1747bool HInstructionBuilder::ProcessDexInstruction(const Instruction& instruction, uint32_t dex_pc) {
1748 switch (instruction.Opcode()) {
1749 case Instruction::CONST_4: {
1750 int32_t register_index = instruction.VRegA();
1751 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_11n(), dex_pc);
1752 UpdateLocal(register_index, constant);
1753 break;
1754 }
1755
1756 case Instruction::CONST_16: {
1757 int32_t register_index = instruction.VRegA();
1758 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_21s(), dex_pc);
1759 UpdateLocal(register_index, constant);
1760 break;
1761 }
1762
1763 case Instruction::CONST: {
1764 int32_t register_index = instruction.VRegA();
1765 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_31i(), dex_pc);
1766 UpdateLocal(register_index, constant);
1767 break;
1768 }
1769
1770 case Instruction::CONST_HIGH16: {
1771 int32_t register_index = instruction.VRegA();
1772 HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_21h() << 16, dex_pc);
1773 UpdateLocal(register_index, constant);
1774 break;
1775 }
1776
1777 case Instruction::CONST_WIDE_16: {
1778 int32_t register_index = instruction.VRegA();
1779 // Get 16 bits of constant value, sign extended to 64 bits.
1780 int64_t value = instruction.VRegB_21s();
1781 value <<= 48;
1782 value >>= 48;
1783 HLongConstant* constant = graph_->GetLongConstant(value, dex_pc);
1784 UpdateLocal(register_index, constant);
1785 break;
1786 }
1787
1788 case Instruction::CONST_WIDE_32: {
1789 int32_t register_index = instruction.VRegA();
1790 // Get 32 bits of constant value, sign extended to 64 bits.
1791 int64_t value = instruction.VRegB_31i();
1792 value <<= 32;
1793 value >>= 32;
1794 HLongConstant* constant = graph_->GetLongConstant(value, dex_pc);
1795 UpdateLocal(register_index, constant);
1796 break;
1797 }
1798
1799 case Instruction::CONST_WIDE: {
1800 int32_t register_index = instruction.VRegA();
1801 HLongConstant* constant = graph_->GetLongConstant(instruction.VRegB_51l(), dex_pc);
1802 UpdateLocal(register_index, constant);
1803 break;
1804 }
1805
1806 case Instruction::CONST_WIDE_HIGH16: {
1807 int32_t register_index = instruction.VRegA();
1808 int64_t value = static_cast<int64_t>(instruction.VRegB_21h()) << 48;
1809 HLongConstant* constant = graph_->GetLongConstant(value, dex_pc);
1810 UpdateLocal(register_index, constant);
1811 break;
1812 }
1813
1814 // Note that the SSA building will refine the types.
1815 case Instruction::MOVE:
1816 case Instruction::MOVE_FROM16:
1817 case Instruction::MOVE_16: {
1818 HInstruction* value = LoadLocal(instruction.VRegB(), Primitive::kPrimInt);
1819 UpdateLocal(instruction.VRegA(), value);
1820 break;
1821 }
1822
1823 // Note that the SSA building will refine the types.
1824 case Instruction::MOVE_WIDE:
1825 case Instruction::MOVE_WIDE_FROM16:
1826 case Instruction::MOVE_WIDE_16: {
1827 HInstruction* value = LoadLocal(instruction.VRegB(), Primitive::kPrimLong);
1828 UpdateLocal(instruction.VRegA(), value);
1829 break;
1830 }
1831
1832 case Instruction::MOVE_OBJECT:
1833 case Instruction::MOVE_OBJECT_16:
1834 case Instruction::MOVE_OBJECT_FROM16: {
Nicolas Geoffray50a9ed02016-09-23 15:40:41 +01001835 // The verifier has no notion of a null type, so a move-object of constant 0
1836 // will lead to the same constant 0 in the destination register. To mimic
1837 // this behavior, we just pretend we haven't seen a type change (int to reference)
1838 // for the 0 constant and phis. We rely on our type propagation to eventually get the
1839 // types correct.
1840 uint32_t reg_number = instruction.VRegB();
1841 HInstruction* value = (*current_locals_)[reg_number];
1842 if (value->IsIntConstant()) {
1843 DCHECK_EQ(value->AsIntConstant()->GetValue(), 0);
1844 } else if (value->IsPhi()) {
1845 DCHECK(value->GetType() == Primitive::kPrimInt || value->GetType() == Primitive::kPrimNot);
1846 } else {
1847 value = LoadLocal(reg_number, Primitive::kPrimNot);
1848 }
David Brazdildee58d62016-04-07 09:54:26 +00001849 UpdateLocal(instruction.VRegA(), value);
1850 break;
1851 }
1852
1853 case Instruction::RETURN_VOID_NO_BARRIER:
1854 case Instruction::RETURN_VOID: {
1855 BuildReturn(instruction, Primitive::kPrimVoid, dex_pc);
1856 break;
1857 }
1858
1859#define IF_XX(comparison, cond) \
1860 case Instruction::IF_##cond: If_22t<comparison>(instruction, dex_pc); break; \
1861 case Instruction::IF_##cond##Z: If_21t<comparison>(instruction, dex_pc); break
1862
1863 IF_XX(HEqual, EQ);
1864 IF_XX(HNotEqual, NE);
1865 IF_XX(HLessThan, LT);
1866 IF_XX(HLessThanOrEqual, LE);
1867 IF_XX(HGreaterThan, GT);
1868 IF_XX(HGreaterThanOrEqual, GE);
1869
1870 case Instruction::GOTO:
1871 case Instruction::GOTO_16:
1872 case Instruction::GOTO_32: {
1873 AppendInstruction(new (arena_) HGoto(dex_pc));
1874 current_block_ = nullptr;
1875 break;
1876 }
1877
1878 case Instruction::RETURN: {
1879 BuildReturn(instruction, return_type_, dex_pc);
1880 break;
1881 }
1882
1883 case Instruction::RETURN_OBJECT: {
1884 BuildReturn(instruction, return_type_, dex_pc);
1885 break;
1886 }
1887
1888 case Instruction::RETURN_WIDE: {
1889 BuildReturn(instruction, return_type_, dex_pc);
1890 break;
1891 }
1892
1893 case Instruction::INVOKE_DIRECT:
1894 case Instruction::INVOKE_INTERFACE:
1895 case Instruction::INVOKE_STATIC:
1896 case Instruction::INVOKE_SUPER:
1897 case Instruction::INVOKE_VIRTUAL:
1898 case Instruction::INVOKE_VIRTUAL_QUICK: {
1899 uint16_t method_idx;
1900 if (instruction.Opcode() == Instruction::INVOKE_VIRTUAL_QUICK) {
1901 if (!CanDecodeQuickenedInfo()) {
1902 return false;
1903 }
1904 method_idx = LookupQuickenedInfo(dex_pc);
1905 } else {
1906 method_idx = instruction.VRegB_35c();
1907 }
1908 uint32_t number_of_vreg_arguments = instruction.VRegA_35c();
1909 uint32_t args[5];
1910 instruction.GetVarArgs(args);
1911 if (!BuildInvoke(instruction, dex_pc, method_idx,
1912 number_of_vreg_arguments, false, args, -1)) {
1913 return false;
1914 }
1915 break;
1916 }
1917
1918 case Instruction::INVOKE_DIRECT_RANGE:
1919 case Instruction::INVOKE_INTERFACE_RANGE:
1920 case Instruction::INVOKE_STATIC_RANGE:
1921 case Instruction::INVOKE_SUPER_RANGE:
1922 case Instruction::INVOKE_VIRTUAL_RANGE:
1923 case Instruction::INVOKE_VIRTUAL_RANGE_QUICK: {
1924 uint16_t method_idx;
1925 if (instruction.Opcode() == Instruction::INVOKE_VIRTUAL_RANGE_QUICK) {
1926 if (!CanDecodeQuickenedInfo()) {
1927 return false;
1928 }
1929 method_idx = LookupQuickenedInfo(dex_pc);
1930 } else {
1931 method_idx = instruction.VRegB_3rc();
1932 }
1933 uint32_t number_of_vreg_arguments = instruction.VRegA_3rc();
1934 uint32_t register_index = instruction.VRegC();
1935 if (!BuildInvoke(instruction, dex_pc, method_idx,
1936 number_of_vreg_arguments, true, nullptr, register_index)) {
1937 return false;
1938 }
1939 break;
1940 }
1941
Orion Hodsonac141392017-01-13 11:53:47 +00001942 case Instruction::INVOKE_POLYMORPHIC: {
1943 uint16_t method_idx = instruction.VRegB_45cc();
1944 uint16_t proto_idx = instruction.VRegH_45cc();
1945 uint32_t number_of_vreg_arguments = instruction.VRegA_45cc();
1946 uint32_t args[5];
1947 instruction.GetVarArgs(args);
1948 return BuildInvokePolymorphic(instruction,
1949 dex_pc,
1950 method_idx,
1951 proto_idx,
1952 number_of_vreg_arguments,
1953 false,
1954 args,
1955 -1);
1956 }
1957
1958 case Instruction::INVOKE_POLYMORPHIC_RANGE: {
1959 uint16_t method_idx = instruction.VRegB_4rcc();
1960 uint16_t proto_idx = instruction.VRegH_4rcc();
1961 uint32_t number_of_vreg_arguments = instruction.VRegA_4rcc();
1962 uint32_t register_index = instruction.VRegC_4rcc();
1963 return BuildInvokePolymorphic(instruction,
1964 dex_pc,
1965 method_idx,
1966 proto_idx,
1967 number_of_vreg_arguments,
1968 true,
1969 nullptr,
1970 register_index);
1971 }
1972
David Brazdildee58d62016-04-07 09:54:26 +00001973 case Instruction::NEG_INT: {
1974 Unop_12x<HNeg>(instruction, Primitive::kPrimInt, dex_pc);
1975 break;
1976 }
1977
1978 case Instruction::NEG_LONG: {
1979 Unop_12x<HNeg>(instruction, Primitive::kPrimLong, dex_pc);
1980 break;
1981 }
1982
1983 case Instruction::NEG_FLOAT: {
1984 Unop_12x<HNeg>(instruction, Primitive::kPrimFloat, dex_pc);
1985 break;
1986 }
1987
1988 case Instruction::NEG_DOUBLE: {
1989 Unop_12x<HNeg>(instruction, Primitive::kPrimDouble, dex_pc);
1990 break;
1991 }
1992
1993 case Instruction::NOT_INT: {
1994 Unop_12x<HNot>(instruction, Primitive::kPrimInt, dex_pc);
1995 break;
1996 }
1997
1998 case Instruction::NOT_LONG: {
1999 Unop_12x<HNot>(instruction, Primitive::kPrimLong, dex_pc);
2000 break;
2001 }
2002
2003 case Instruction::INT_TO_LONG: {
2004 Conversion_12x(instruction, Primitive::kPrimInt, Primitive::kPrimLong, dex_pc);
2005 break;
2006 }
2007
2008 case Instruction::INT_TO_FLOAT: {
2009 Conversion_12x(instruction, Primitive::kPrimInt, Primitive::kPrimFloat, dex_pc);
2010 break;
2011 }
2012
2013 case Instruction::INT_TO_DOUBLE: {
2014 Conversion_12x(instruction, Primitive::kPrimInt, Primitive::kPrimDouble, dex_pc);
2015 break;
2016 }
2017
2018 case Instruction::LONG_TO_INT: {
2019 Conversion_12x(instruction, Primitive::kPrimLong, Primitive::kPrimInt, dex_pc);
2020 break;
2021 }
2022
2023 case Instruction::LONG_TO_FLOAT: {
2024 Conversion_12x(instruction, Primitive::kPrimLong, Primitive::kPrimFloat, dex_pc);
2025 break;
2026 }
2027
2028 case Instruction::LONG_TO_DOUBLE: {
2029 Conversion_12x(instruction, Primitive::kPrimLong, Primitive::kPrimDouble, dex_pc);
2030 break;
2031 }
2032
2033 case Instruction::FLOAT_TO_INT: {
2034 Conversion_12x(instruction, Primitive::kPrimFloat, Primitive::kPrimInt, dex_pc);
2035 break;
2036 }
2037
2038 case Instruction::FLOAT_TO_LONG: {
2039 Conversion_12x(instruction, Primitive::kPrimFloat, Primitive::kPrimLong, dex_pc);
2040 break;
2041 }
2042
2043 case Instruction::FLOAT_TO_DOUBLE: {
2044 Conversion_12x(instruction, Primitive::kPrimFloat, Primitive::kPrimDouble, dex_pc);
2045 break;
2046 }
2047
2048 case Instruction::DOUBLE_TO_INT: {
2049 Conversion_12x(instruction, Primitive::kPrimDouble, Primitive::kPrimInt, dex_pc);
2050 break;
2051 }
2052
2053 case Instruction::DOUBLE_TO_LONG: {
2054 Conversion_12x(instruction, Primitive::kPrimDouble, Primitive::kPrimLong, dex_pc);
2055 break;
2056 }
2057
2058 case Instruction::DOUBLE_TO_FLOAT: {
2059 Conversion_12x(instruction, Primitive::kPrimDouble, Primitive::kPrimFloat, dex_pc);
2060 break;
2061 }
2062
2063 case Instruction::INT_TO_BYTE: {
2064 Conversion_12x(instruction, Primitive::kPrimInt, Primitive::kPrimByte, dex_pc);
2065 break;
2066 }
2067
2068 case Instruction::INT_TO_SHORT: {
2069 Conversion_12x(instruction, Primitive::kPrimInt, Primitive::kPrimShort, dex_pc);
2070 break;
2071 }
2072
2073 case Instruction::INT_TO_CHAR: {
2074 Conversion_12x(instruction, Primitive::kPrimInt, Primitive::kPrimChar, dex_pc);
2075 break;
2076 }
2077
2078 case Instruction::ADD_INT: {
2079 Binop_23x<HAdd>(instruction, Primitive::kPrimInt, dex_pc);
2080 break;
2081 }
2082
2083 case Instruction::ADD_LONG: {
2084 Binop_23x<HAdd>(instruction, Primitive::kPrimLong, dex_pc);
2085 break;
2086 }
2087
2088 case Instruction::ADD_DOUBLE: {
2089 Binop_23x<HAdd>(instruction, Primitive::kPrimDouble, dex_pc);
2090 break;
2091 }
2092
2093 case Instruction::ADD_FLOAT: {
2094 Binop_23x<HAdd>(instruction, Primitive::kPrimFloat, dex_pc);
2095 break;
2096 }
2097
2098 case Instruction::SUB_INT: {
2099 Binop_23x<HSub>(instruction, Primitive::kPrimInt, dex_pc);
2100 break;
2101 }
2102
2103 case Instruction::SUB_LONG: {
2104 Binop_23x<HSub>(instruction, Primitive::kPrimLong, dex_pc);
2105 break;
2106 }
2107
2108 case Instruction::SUB_FLOAT: {
2109 Binop_23x<HSub>(instruction, Primitive::kPrimFloat, dex_pc);
2110 break;
2111 }
2112
2113 case Instruction::SUB_DOUBLE: {
2114 Binop_23x<HSub>(instruction, Primitive::kPrimDouble, dex_pc);
2115 break;
2116 }
2117
2118 case Instruction::ADD_INT_2ADDR: {
2119 Binop_12x<HAdd>(instruction, Primitive::kPrimInt, dex_pc);
2120 break;
2121 }
2122
2123 case Instruction::MUL_INT: {
2124 Binop_23x<HMul>(instruction, Primitive::kPrimInt, dex_pc);
2125 break;
2126 }
2127
2128 case Instruction::MUL_LONG: {
2129 Binop_23x<HMul>(instruction, Primitive::kPrimLong, dex_pc);
2130 break;
2131 }
2132
2133 case Instruction::MUL_FLOAT: {
2134 Binop_23x<HMul>(instruction, Primitive::kPrimFloat, dex_pc);
2135 break;
2136 }
2137
2138 case Instruction::MUL_DOUBLE: {
2139 Binop_23x<HMul>(instruction, Primitive::kPrimDouble, dex_pc);
2140 break;
2141 }
2142
2143 case Instruction::DIV_INT: {
2144 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
2145 dex_pc, Primitive::kPrimInt, false, true);
2146 break;
2147 }
2148
2149 case Instruction::DIV_LONG: {
2150 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
2151 dex_pc, Primitive::kPrimLong, false, true);
2152 break;
2153 }
2154
2155 case Instruction::DIV_FLOAT: {
2156 Binop_23x<HDiv>(instruction, Primitive::kPrimFloat, dex_pc);
2157 break;
2158 }
2159
2160 case Instruction::DIV_DOUBLE: {
2161 Binop_23x<HDiv>(instruction, Primitive::kPrimDouble, dex_pc);
2162 break;
2163 }
2164
2165 case Instruction::REM_INT: {
2166 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
2167 dex_pc, Primitive::kPrimInt, false, false);
2168 break;
2169 }
2170
2171 case Instruction::REM_LONG: {
2172 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
2173 dex_pc, Primitive::kPrimLong, false, false);
2174 break;
2175 }
2176
2177 case Instruction::REM_FLOAT: {
2178 Binop_23x<HRem>(instruction, Primitive::kPrimFloat, dex_pc);
2179 break;
2180 }
2181
2182 case Instruction::REM_DOUBLE: {
2183 Binop_23x<HRem>(instruction, Primitive::kPrimDouble, dex_pc);
2184 break;
2185 }
2186
2187 case Instruction::AND_INT: {
2188 Binop_23x<HAnd>(instruction, Primitive::kPrimInt, dex_pc);
2189 break;
2190 }
2191
2192 case Instruction::AND_LONG: {
2193 Binop_23x<HAnd>(instruction, Primitive::kPrimLong, dex_pc);
2194 break;
2195 }
2196
2197 case Instruction::SHL_INT: {
2198 Binop_23x_shift<HShl>(instruction, Primitive::kPrimInt, dex_pc);
2199 break;
2200 }
2201
2202 case Instruction::SHL_LONG: {
2203 Binop_23x_shift<HShl>(instruction, Primitive::kPrimLong, dex_pc);
2204 break;
2205 }
2206
2207 case Instruction::SHR_INT: {
2208 Binop_23x_shift<HShr>(instruction, Primitive::kPrimInt, dex_pc);
2209 break;
2210 }
2211
2212 case Instruction::SHR_LONG: {
2213 Binop_23x_shift<HShr>(instruction, Primitive::kPrimLong, dex_pc);
2214 break;
2215 }
2216
2217 case Instruction::USHR_INT: {
2218 Binop_23x_shift<HUShr>(instruction, Primitive::kPrimInt, dex_pc);
2219 break;
2220 }
2221
2222 case Instruction::USHR_LONG: {
2223 Binop_23x_shift<HUShr>(instruction, Primitive::kPrimLong, dex_pc);
2224 break;
2225 }
2226
2227 case Instruction::OR_INT: {
2228 Binop_23x<HOr>(instruction, Primitive::kPrimInt, dex_pc);
2229 break;
2230 }
2231
2232 case Instruction::OR_LONG: {
2233 Binop_23x<HOr>(instruction, Primitive::kPrimLong, dex_pc);
2234 break;
2235 }
2236
2237 case Instruction::XOR_INT: {
2238 Binop_23x<HXor>(instruction, Primitive::kPrimInt, dex_pc);
2239 break;
2240 }
2241
2242 case Instruction::XOR_LONG: {
2243 Binop_23x<HXor>(instruction, Primitive::kPrimLong, dex_pc);
2244 break;
2245 }
2246
2247 case Instruction::ADD_LONG_2ADDR: {
2248 Binop_12x<HAdd>(instruction, Primitive::kPrimLong, dex_pc);
2249 break;
2250 }
2251
2252 case Instruction::ADD_DOUBLE_2ADDR: {
2253 Binop_12x<HAdd>(instruction, Primitive::kPrimDouble, dex_pc);
2254 break;
2255 }
2256
2257 case Instruction::ADD_FLOAT_2ADDR: {
2258 Binop_12x<HAdd>(instruction, Primitive::kPrimFloat, dex_pc);
2259 break;
2260 }
2261
2262 case Instruction::SUB_INT_2ADDR: {
2263 Binop_12x<HSub>(instruction, Primitive::kPrimInt, dex_pc);
2264 break;
2265 }
2266
2267 case Instruction::SUB_LONG_2ADDR: {
2268 Binop_12x<HSub>(instruction, Primitive::kPrimLong, dex_pc);
2269 break;
2270 }
2271
2272 case Instruction::SUB_FLOAT_2ADDR: {
2273 Binop_12x<HSub>(instruction, Primitive::kPrimFloat, dex_pc);
2274 break;
2275 }
2276
2277 case Instruction::SUB_DOUBLE_2ADDR: {
2278 Binop_12x<HSub>(instruction, Primitive::kPrimDouble, dex_pc);
2279 break;
2280 }
2281
2282 case Instruction::MUL_INT_2ADDR: {
2283 Binop_12x<HMul>(instruction, Primitive::kPrimInt, dex_pc);
2284 break;
2285 }
2286
2287 case Instruction::MUL_LONG_2ADDR: {
2288 Binop_12x<HMul>(instruction, Primitive::kPrimLong, dex_pc);
2289 break;
2290 }
2291
2292 case Instruction::MUL_FLOAT_2ADDR: {
2293 Binop_12x<HMul>(instruction, Primitive::kPrimFloat, dex_pc);
2294 break;
2295 }
2296
2297 case Instruction::MUL_DOUBLE_2ADDR: {
2298 Binop_12x<HMul>(instruction, Primitive::kPrimDouble, dex_pc);
2299 break;
2300 }
2301
2302 case Instruction::DIV_INT_2ADDR: {
2303 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
2304 dex_pc, Primitive::kPrimInt, false, true);
2305 break;
2306 }
2307
2308 case Instruction::DIV_LONG_2ADDR: {
2309 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
2310 dex_pc, Primitive::kPrimLong, false, true);
2311 break;
2312 }
2313
2314 case Instruction::REM_INT_2ADDR: {
2315 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
2316 dex_pc, Primitive::kPrimInt, false, false);
2317 break;
2318 }
2319
2320 case Instruction::REM_LONG_2ADDR: {
2321 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
2322 dex_pc, Primitive::kPrimLong, false, false);
2323 break;
2324 }
2325
2326 case Instruction::REM_FLOAT_2ADDR: {
2327 Binop_12x<HRem>(instruction, Primitive::kPrimFloat, dex_pc);
2328 break;
2329 }
2330
2331 case Instruction::REM_DOUBLE_2ADDR: {
2332 Binop_12x<HRem>(instruction, Primitive::kPrimDouble, dex_pc);
2333 break;
2334 }
2335
2336 case Instruction::SHL_INT_2ADDR: {
2337 Binop_12x_shift<HShl>(instruction, Primitive::kPrimInt, dex_pc);
2338 break;
2339 }
2340
2341 case Instruction::SHL_LONG_2ADDR: {
2342 Binop_12x_shift<HShl>(instruction, Primitive::kPrimLong, dex_pc);
2343 break;
2344 }
2345
2346 case Instruction::SHR_INT_2ADDR: {
2347 Binop_12x_shift<HShr>(instruction, Primitive::kPrimInt, dex_pc);
2348 break;
2349 }
2350
2351 case Instruction::SHR_LONG_2ADDR: {
2352 Binop_12x_shift<HShr>(instruction, Primitive::kPrimLong, dex_pc);
2353 break;
2354 }
2355
2356 case Instruction::USHR_INT_2ADDR: {
2357 Binop_12x_shift<HUShr>(instruction, Primitive::kPrimInt, dex_pc);
2358 break;
2359 }
2360
2361 case Instruction::USHR_LONG_2ADDR: {
2362 Binop_12x_shift<HUShr>(instruction, Primitive::kPrimLong, dex_pc);
2363 break;
2364 }
2365
2366 case Instruction::DIV_FLOAT_2ADDR: {
2367 Binop_12x<HDiv>(instruction, Primitive::kPrimFloat, dex_pc);
2368 break;
2369 }
2370
2371 case Instruction::DIV_DOUBLE_2ADDR: {
2372 Binop_12x<HDiv>(instruction, Primitive::kPrimDouble, dex_pc);
2373 break;
2374 }
2375
2376 case Instruction::AND_INT_2ADDR: {
2377 Binop_12x<HAnd>(instruction, Primitive::kPrimInt, dex_pc);
2378 break;
2379 }
2380
2381 case Instruction::AND_LONG_2ADDR: {
2382 Binop_12x<HAnd>(instruction, Primitive::kPrimLong, dex_pc);
2383 break;
2384 }
2385
2386 case Instruction::OR_INT_2ADDR: {
2387 Binop_12x<HOr>(instruction, Primitive::kPrimInt, dex_pc);
2388 break;
2389 }
2390
2391 case Instruction::OR_LONG_2ADDR: {
2392 Binop_12x<HOr>(instruction, Primitive::kPrimLong, dex_pc);
2393 break;
2394 }
2395
2396 case Instruction::XOR_INT_2ADDR: {
2397 Binop_12x<HXor>(instruction, Primitive::kPrimInt, dex_pc);
2398 break;
2399 }
2400
2401 case Instruction::XOR_LONG_2ADDR: {
2402 Binop_12x<HXor>(instruction, Primitive::kPrimLong, dex_pc);
2403 break;
2404 }
2405
2406 case Instruction::ADD_INT_LIT16: {
2407 Binop_22s<HAdd>(instruction, false, dex_pc);
2408 break;
2409 }
2410
2411 case Instruction::AND_INT_LIT16: {
2412 Binop_22s<HAnd>(instruction, false, dex_pc);
2413 break;
2414 }
2415
2416 case Instruction::OR_INT_LIT16: {
2417 Binop_22s<HOr>(instruction, false, dex_pc);
2418 break;
2419 }
2420
2421 case Instruction::XOR_INT_LIT16: {
2422 Binop_22s<HXor>(instruction, false, dex_pc);
2423 break;
2424 }
2425
2426 case Instruction::RSUB_INT: {
2427 Binop_22s<HSub>(instruction, true, dex_pc);
2428 break;
2429 }
2430
2431 case Instruction::MUL_INT_LIT16: {
2432 Binop_22s<HMul>(instruction, false, dex_pc);
2433 break;
2434 }
2435
2436 case Instruction::ADD_INT_LIT8: {
2437 Binop_22b<HAdd>(instruction, false, dex_pc);
2438 break;
2439 }
2440
2441 case Instruction::AND_INT_LIT8: {
2442 Binop_22b<HAnd>(instruction, false, dex_pc);
2443 break;
2444 }
2445
2446 case Instruction::OR_INT_LIT8: {
2447 Binop_22b<HOr>(instruction, false, dex_pc);
2448 break;
2449 }
2450
2451 case Instruction::XOR_INT_LIT8: {
2452 Binop_22b<HXor>(instruction, false, dex_pc);
2453 break;
2454 }
2455
2456 case Instruction::RSUB_INT_LIT8: {
2457 Binop_22b<HSub>(instruction, true, dex_pc);
2458 break;
2459 }
2460
2461 case Instruction::MUL_INT_LIT8: {
2462 Binop_22b<HMul>(instruction, false, dex_pc);
2463 break;
2464 }
2465
2466 case Instruction::DIV_INT_LIT16:
2467 case Instruction::DIV_INT_LIT8: {
2468 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
2469 dex_pc, Primitive::kPrimInt, true, true);
2470 break;
2471 }
2472
2473 case Instruction::REM_INT_LIT16:
2474 case Instruction::REM_INT_LIT8: {
2475 BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
2476 dex_pc, Primitive::kPrimInt, true, false);
2477 break;
2478 }
2479
2480 case Instruction::SHL_INT_LIT8: {
2481 Binop_22b<HShl>(instruction, false, dex_pc);
2482 break;
2483 }
2484
2485 case Instruction::SHR_INT_LIT8: {
2486 Binop_22b<HShr>(instruction, false, dex_pc);
2487 break;
2488 }
2489
2490 case Instruction::USHR_INT_LIT8: {
2491 Binop_22b<HUShr>(instruction, false, dex_pc);
2492 break;
2493 }
2494
2495 case Instruction::NEW_INSTANCE: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08002496 if (!BuildNewInstance(dex::TypeIndex(instruction.VRegB_21c()), dex_pc)) {
David Brazdildee58d62016-04-07 09:54:26 +00002497 return false;
2498 }
2499 UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
2500 break;
2501 }
2502
2503 case Instruction::NEW_ARRAY: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08002504 dex::TypeIndex type_index(instruction.VRegC_22c());
David Brazdildee58d62016-04-07 09:54:26 +00002505 HInstruction* length = LoadLocal(instruction.VRegB_22c(), Primitive::kPrimInt);
Hiroshi Yamauchifee25502017-01-19 02:11:15 +00002506 bool finalizable;
2507 QuickEntrypointEnum entrypoint = NeedsAccessCheck(type_index, &finalizable)
2508 ? kQuickAllocArrayWithAccessCheck
2509 : kQuickAllocArray;
2510 AppendInstruction(new (arena_) HNewArray(length,
2511 graph_->GetCurrentMethod(),
2512 dex_pc,
2513 type_index,
2514 *dex_compilation_unit_->GetDexFile(),
2515 entrypoint));
David Brazdildee58d62016-04-07 09:54:26 +00002516 UpdateLocal(instruction.VRegA_22c(), current_block_->GetLastInstruction());
2517 break;
2518 }
2519
2520 case Instruction::FILLED_NEW_ARRAY: {
2521 uint32_t number_of_vreg_arguments = instruction.VRegA_35c();
Andreas Gampea5b09a62016-11-17 15:21:22 -08002522 dex::TypeIndex type_index(instruction.VRegB_35c());
David Brazdildee58d62016-04-07 09:54:26 +00002523 uint32_t args[5];
2524 instruction.GetVarArgs(args);
2525 BuildFilledNewArray(dex_pc, type_index, number_of_vreg_arguments, false, args, 0);
2526 break;
2527 }
2528
2529 case Instruction::FILLED_NEW_ARRAY_RANGE: {
2530 uint32_t number_of_vreg_arguments = instruction.VRegA_3rc();
Andreas Gampea5b09a62016-11-17 15:21:22 -08002531 dex::TypeIndex type_index(instruction.VRegB_3rc());
David Brazdildee58d62016-04-07 09:54:26 +00002532 uint32_t register_index = instruction.VRegC_3rc();
2533 BuildFilledNewArray(
2534 dex_pc, type_index, number_of_vreg_arguments, true, nullptr, register_index);
2535 break;
2536 }
2537
2538 case Instruction::FILL_ARRAY_DATA: {
2539 BuildFillArrayData(instruction, dex_pc);
2540 break;
2541 }
2542
2543 case Instruction::MOVE_RESULT:
2544 case Instruction::MOVE_RESULT_WIDE:
2545 case Instruction::MOVE_RESULT_OBJECT: {
2546 DCHECK(latest_result_ != nullptr);
2547 UpdateLocal(instruction.VRegA(), latest_result_);
2548 latest_result_ = nullptr;
2549 break;
2550 }
2551
2552 case Instruction::CMP_LONG: {
2553 Binop_23x_cmp(instruction, Primitive::kPrimLong, ComparisonBias::kNoBias, dex_pc);
2554 break;
2555 }
2556
2557 case Instruction::CMPG_FLOAT: {
2558 Binop_23x_cmp(instruction, Primitive::kPrimFloat, ComparisonBias::kGtBias, dex_pc);
2559 break;
2560 }
2561
2562 case Instruction::CMPG_DOUBLE: {
2563 Binop_23x_cmp(instruction, Primitive::kPrimDouble, ComparisonBias::kGtBias, dex_pc);
2564 break;
2565 }
2566
2567 case Instruction::CMPL_FLOAT: {
2568 Binop_23x_cmp(instruction, Primitive::kPrimFloat, ComparisonBias::kLtBias, dex_pc);
2569 break;
2570 }
2571
2572 case Instruction::CMPL_DOUBLE: {
2573 Binop_23x_cmp(instruction, Primitive::kPrimDouble, ComparisonBias::kLtBias, dex_pc);
2574 break;
2575 }
2576
2577 case Instruction::NOP:
2578 break;
2579
2580 case Instruction::IGET:
2581 case Instruction::IGET_QUICK:
2582 case Instruction::IGET_WIDE:
2583 case Instruction::IGET_WIDE_QUICK:
2584 case Instruction::IGET_OBJECT:
2585 case Instruction::IGET_OBJECT_QUICK:
2586 case Instruction::IGET_BOOLEAN:
2587 case Instruction::IGET_BOOLEAN_QUICK:
2588 case Instruction::IGET_BYTE:
2589 case Instruction::IGET_BYTE_QUICK:
2590 case Instruction::IGET_CHAR:
2591 case Instruction::IGET_CHAR_QUICK:
2592 case Instruction::IGET_SHORT:
2593 case Instruction::IGET_SHORT_QUICK: {
2594 if (!BuildInstanceFieldAccess(instruction, dex_pc, false)) {
2595 return false;
2596 }
2597 break;
2598 }
2599
2600 case Instruction::IPUT:
2601 case Instruction::IPUT_QUICK:
2602 case Instruction::IPUT_WIDE:
2603 case Instruction::IPUT_WIDE_QUICK:
2604 case Instruction::IPUT_OBJECT:
2605 case Instruction::IPUT_OBJECT_QUICK:
2606 case Instruction::IPUT_BOOLEAN:
2607 case Instruction::IPUT_BOOLEAN_QUICK:
2608 case Instruction::IPUT_BYTE:
2609 case Instruction::IPUT_BYTE_QUICK:
2610 case Instruction::IPUT_CHAR:
2611 case Instruction::IPUT_CHAR_QUICK:
2612 case Instruction::IPUT_SHORT:
2613 case Instruction::IPUT_SHORT_QUICK: {
2614 if (!BuildInstanceFieldAccess(instruction, dex_pc, true)) {
2615 return false;
2616 }
2617 break;
2618 }
2619
2620 case Instruction::SGET:
2621 case Instruction::SGET_WIDE:
2622 case Instruction::SGET_OBJECT:
2623 case Instruction::SGET_BOOLEAN:
2624 case Instruction::SGET_BYTE:
2625 case Instruction::SGET_CHAR:
2626 case Instruction::SGET_SHORT: {
2627 if (!BuildStaticFieldAccess(instruction, dex_pc, false)) {
2628 return false;
2629 }
2630 break;
2631 }
2632
2633 case Instruction::SPUT:
2634 case Instruction::SPUT_WIDE:
2635 case Instruction::SPUT_OBJECT:
2636 case Instruction::SPUT_BOOLEAN:
2637 case Instruction::SPUT_BYTE:
2638 case Instruction::SPUT_CHAR:
2639 case Instruction::SPUT_SHORT: {
2640 if (!BuildStaticFieldAccess(instruction, dex_pc, true)) {
2641 return false;
2642 }
2643 break;
2644 }
2645
2646#define ARRAY_XX(kind, anticipated_type) \
2647 case Instruction::AGET##kind: { \
2648 BuildArrayAccess(instruction, dex_pc, false, anticipated_type); \
2649 break; \
2650 } \
2651 case Instruction::APUT##kind: { \
2652 BuildArrayAccess(instruction, dex_pc, true, anticipated_type); \
2653 break; \
2654 }
2655
2656 ARRAY_XX(, Primitive::kPrimInt);
2657 ARRAY_XX(_WIDE, Primitive::kPrimLong);
2658 ARRAY_XX(_OBJECT, Primitive::kPrimNot);
2659 ARRAY_XX(_BOOLEAN, Primitive::kPrimBoolean);
2660 ARRAY_XX(_BYTE, Primitive::kPrimByte);
2661 ARRAY_XX(_CHAR, Primitive::kPrimChar);
2662 ARRAY_XX(_SHORT, Primitive::kPrimShort);
2663
2664 case Instruction::ARRAY_LENGTH: {
David Brazdilc120bbe2016-04-22 16:57:00 +01002665 HInstruction* object = LoadNullCheckedLocal(instruction.VRegB_12x(), dex_pc);
David Brazdildee58d62016-04-07 09:54:26 +00002666 AppendInstruction(new (arena_) HArrayLength(object, dex_pc));
2667 UpdateLocal(instruction.VRegA_12x(), current_block_->GetLastInstruction());
2668 break;
2669 }
2670
2671 case Instruction::CONST_STRING: {
Andreas Gampe8a0128a2016-11-28 07:38:35 -08002672 dex::StringIndex string_index(instruction.VRegB_21c());
David Brazdildee58d62016-04-07 09:54:26 +00002673 AppendInstruction(
2674 new (arena_) HLoadString(graph_->GetCurrentMethod(), string_index, *dex_file_, dex_pc));
2675 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
2676 break;
2677 }
2678
2679 case Instruction::CONST_STRING_JUMBO: {
Andreas Gampe8a0128a2016-11-28 07:38:35 -08002680 dex::StringIndex string_index(instruction.VRegB_31c());
David Brazdildee58d62016-04-07 09:54:26 +00002681 AppendInstruction(
2682 new (arena_) HLoadString(graph_->GetCurrentMethod(), string_index, *dex_file_, dex_pc));
2683 UpdateLocal(instruction.VRegA_31c(), current_block_->GetLastInstruction());
2684 break;
2685 }
2686
2687 case Instruction::CONST_CLASS: {
Andreas Gampea5b09a62016-11-17 15:21:22 -08002688 dex::TypeIndex type_index(instruction.VRegB_21c());
Nicolas Geoffray5247c082017-01-13 14:17:29 +00002689 BuildLoadClass(type_index, dex_pc, /* check_access */ true);
David Brazdildee58d62016-04-07 09:54:26 +00002690 UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
2691 break;
2692 }
2693
2694 case Instruction::MOVE_EXCEPTION: {
2695 AppendInstruction(new (arena_) HLoadException(dex_pc));
2696 UpdateLocal(instruction.VRegA_11x(), current_block_->GetLastInstruction());
2697 AppendInstruction(new (arena_) HClearException(dex_pc));
2698 break;
2699 }
2700
2701 case Instruction::THROW: {
2702 HInstruction* exception = LoadLocal(instruction.VRegA_11x(), Primitive::kPrimNot);
2703 AppendInstruction(new (arena_) HThrow(exception, dex_pc));
2704 // We finished building this block. Set the current block to null to avoid
2705 // adding dead instructions to it.
2706 current_block_ = nullptr;
2707 break;
2708 }
2709
2710 case Instruction::INSTANCE_OF: {
2711 uint8_t destination = instruction.VRegA_22c();
2712 uint8_t reference = instruction.VRegB_22c();
Andreas Gampea5b09a62016-11-17 15:21:22 -08002713 dex::TypeIndex type_index(instruction.VRegC_22c());
David Brazdildee58d62016-04-07 09:54:26 +00002714 BuildTypeCheck(instruction, destination, reference, type_index, dex_pc);
2715 break;
2716 }
2717
2718 case Instruction::CHECK_CAST: {
2719 uint8_t reference = instruction.VRegA_21c();
Andreas Gampea5b09a62016-11-17 15:21:22 -08002720 dex::TypeIndex type_index(instruction.VRegB_21c());
David Brazdildee58d62016-04-07 09:54:26 +00002721 BuildTypeCheck(instruction, -1, reference, type_index, dex_pc);
2722 break;
2723 }
2724
2725 case Instruction::MONITOR_ENTER: {
2726 AppendInstruction(new (arena_) HMonitorOperation(
2727 LoadLocal(instruction.VRegA_11x(), Primitive::kPrimNot),
2728 HMonitorOperation::OperationKind::kEnter,
2729 dex_pc));
2730 break;
2731 }
2732
2733 case Instruction::MONITOR_EXIT: {
2734 AppendInstruction(new (arena_) HMonitorOperation(
2735 LoadLocal(instruction.VRegA_11x(), Primitive::kPrimNot),
2736 HMonitorOperation::OperationKind::kExit,
2737 dex_pc));
2738 break;
2739 }
2740
2741 case Instruction::SPARSE_SWITCH:
2742 case Instruction::PACKED_SWITCH: {
2743 BuildSwitch(instruction, dex_pc);
2744 break;
2745 }
2746
2747 default:
2748 VLOG(compiler) << "Did not compile "
David Sehr709b0702016-10-13 09:12:37 -07002749 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
David Brazdildee58d62016-04-07 09:54:26 +00002750 << " because of unhandled instruction "
2751 << instruction.Name();
2752 MaybeRecordStat(MethodCompilationStat::kNotCompiledUnhandledInstruction);
2753 return false;
2754 }
2755 return true;
2756} // NOLINT(readability/fn_size)
2757
2758} // namespace art