builder.cc revision 012a072d06474404ff488d181eb3d4a504c5cbe7 
1/*
2 * Copyright (C) 2014 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 *      http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17#include "builder.h"
18
19#include "art_field-inl.h"
20#include "base/logging.h"
21#include "class_linker.h"
22#include "dex/verified_method.h"
23#include "dex_file-inl.h"
24#include "dex_instruction-inl.h"
25#include "dex/verified_method.h"
26#include "driver/compiler_driver-inl.h"
27#include "driver/compiler_options.h"
28#include "mirror/class_loader.h"
29#include "mirror/dex_cache.h"
30#include "nodes.h"
31#include "primitive.h"
32#include "scoped_thread_state_change.h"
33#include "thread.h"
34
35namespace art {
36
37/**
38 * Helper class to add HTemporary instructions. This class is used when
39 * converting a DEX instruction to multiple HInstruction, and where those
40 * instructions do not die at the following instruction, but instead spans
41 * multiple instructions.
42 */
43class Temporaries : public ValueObject {
44 public:
45  explicit Temporaries(HGraph* graph) : graph_(graph), index_(0) {}
46
47  void Add(HInstruction* instruction) {
48    HInstruction* temp = new (graph_->GetArena()) HTemporary(index_);
49    instruction->GetBlock()->AddInstruction(temp);
50
51    DCHECK(temp->GetPrevious() == instruction);
52
53    size_t offset;
54    if (instruction->GetType() == Primitive::kPrimLong
55        || instruction->GetType() == Primitive::kPrimDouble) {
56      offset = 2;
57    } else {
58      offset = 1;
59    }
60    index_ += offset;
61
62    graph_->UpdateTemporariesVRegSlots(index_);
63  }
64
65 private:
66  HGraph* const graph_;
67
68  // Current index in the temporary stack, updated by `Add`.
69  size_t index_;
70};
71
72class SwitchTable : public ValueObject {
73 public:
74  SwitchTable(const Instruction& instruction, uint32_t dex_pc, bool sparse)
75      : instruction_(instruction), dex_pc_(dex_pc), sparse_(sparse) {
76    int32_t table_offset = instruction.VRegB_31t();
77    const uint16_t* table = reinterpret_cast<const uint16_t*>(&instruction) + table_offset;
78    if (sparse) {
79      CHECK_EQ(table[0], static_cast<uint16_t>(Instruction::kSparseSwitchSignature));
80    } else {
81      CHECK_EQ(table[0], static_cast<uint16_t>(Instruction::kPackedSwitchSignature));
82    }
83    num_entries_ = table[1];
84    values_ = reinterpret_cast<const int32_t*>(&table[2]);
85  }
86
87  uint16_t GetNumEntries() const {
88    return num_entries_;
89  }
90
91  void CheckIndex(size_t index) const {
92    if (sparse_) {
93      // In a sparse table, we have num_entries_ keys and num_entries_ values, in that order.
94      DCHECK_LT(index, 2 * static_cast<size_t>(num_entries_));
95    } else {
96      // In a packed table, we have the starting key and num_entries_ values.
97      DCHECK_LT(index, 1 + static_cast<size_t>(num_entries_));
98    }
99  }
100
101  int32_t GetEntryAt(size_t index) const {
102    CheckIndex(index);
103    return values_[index];
104  }
105
106  uint32_t GetDexPcForIndex(size_t index) const {
107    CheckIndex(index);
108    return dex_pc_ +
109        (reinterpret_cast<const int16_t*>(values_ + index) -
110         reinterpret_cast<const int16_t*>(&instruction_));
111  }
112
113  // Index of the first value in the table.
114  size_t GetFirstValueIndex() const {
115    if (sparse_) {
116      // In a sparse table, we have num_entries_ keys and num_entries_ values, in that order.
117      return num_entries_;
118    } else {
119      // In a packed table, we have the starting key and num_entries_ values.
120      return 1;
121    }
122  }
123
124 private:
125  const Instruction& instruction_;
126  const uint32_t dex_pc_;
127
128  // Whether this is a sparse-switch table (or a packed-switch one).
129  const bool sparse_;
130
131  // This can't be const as it needs to be computed off of the given instruction, and complicated
132  // expressions in the initializer list seemed very ugly.
133  uint16_t num_entries_;
134
135  const int32_t* values_;
136
137  DISALLOW_COPY_AND_ASSIGN(SwitchTable);
138};
139
140void HGraphBuilder::InitializeLocals(uint16_t count) {
141  graph_->SetNumberOfVRegs(count);
142  locals_.SetSize(count);
143  for (int i = 0; i < count; i++) {
144    HLocal* local = new (arena_) HLocal(i);
145    entry_block_->AddInstruction(local);
146    locals_.Put(i, local);
147  }
148}
149
150void HGraphBuilder::InitializeParameters(uint16_t number_of_parameters) {
151  // dex_compilation_unit_ is null only when unit testing.
152  if (dex_compilation_unit_ == nullptr) {
153    return;
154  }
155
156  graph_->SetNumberOfInVRegs(number_of_parameters);
157  const char* shorty = dex_compilation_unit_->GetShorty();
158  int locals_index = locals_.Size() - number_of_parameters;
159  int parameter_index = 0;
160
161  if (!dex_compilation_unit_->IsStatic()) {
162    // Add the implicit 'this' argument, not expressed in the signature.
163    HParameterValue* parameter =
164        new (arena_) HParameterValue(parameter_index++, Primitive::kPrimNot, true);
165    entry_block_->AddInstruction(parameter);
166    HLocal* local = GetLocalAt(locals_index++);
167    entry_block_->AddInstruction(new (arena_) HStoreLocal(local, parameter));
168    number_of_parameters--;
169  }
170
171  uint32_t pos = 1;
172  for (int i = 0; i < number_of_parameters; i++) {
173    HParameterValue* parameter =
174        new (arena_) HParameterValue(parameter_index++, Primitive::GetType(shorty[pos++]));
175    entry_block_->AddInstruction(parameter);
176    HLocal* local = GetLocalAt(locals_index++);
177    // Store the parameter value in the local that the dex code will use
178    // to reference that parameter.
179    entry_block_->AddInstruction(new (arena_) HStoreLocal(local, parameter));
180    bool is_wide = (parameter->GetType() == Primitive::kPrimLong)
181        || (parameter->GetType() == Primitive::kPrimDouble);
182    if (is_wide) {
183      i++;
184      locals_index++;
185      parameter_index++;
186    }
187  }
188}
189
190template<typename T>
191void HGraphBuilder::If_22t(const Instruction& instruction, uint32_t dex_pc) {
192  int32_t target_offset = instruction.GetTargetOffset();
193  HBasicBlock* branch_target = FindBlockStartingAt(dex_pc + target_offset);
194  HBasicBlock* fallthrough_target = FindBlockStartingAt(dex_pc + instruction.SizeInCodeUnits());
195  DCHECK(branch_target != nullptr);
196  DCHECK(fallthrough_target != nullptr);
197  PotentiallyAddSuspendCheck(branch_target, dex_pc);
198  HInstruction* first = LoadLocal(instruction.VRegA(), Primitive::kPrimInt);
199  HInstruction* second = LoadLocal(instruction.VRegB(), Primitive::kPrimInt);
200  T* comparison = new (arena_) T(first, second);
201  current_block_->AddInstruction(comparison);
202  HInstruction* ifinst = new (arena_) HIf(comparison);
203  current_block_->AddInstruction(ifinst);
204  current_block_->AddSuccessor(branch_target);
205  current_block_->AddSuccessor(fallthrough_target);
206  current_block_ = nullptr;
207}
208
209template<typename T>
210void HGraphBuilder::If_21t(const Instruction& instruction, uint32_t dex_pc) {
211  int32_t target_offset = instruction.GetTargetOffset();
212  HBasicBlock* branch_target = FindBlockStartingAt(dex_pc + target_offset);
213  HBasicBlock* fallthrough_target = FindBlockStartingAt(dex_pc + instruction.SizeInCodeUnits());
214  DCHECK(branch_target != nullptr);
215  DCHECK(fallthrough_target != nullptr);
216  PotentiallyAddSuspendCheck(branch_target, dex_pc);
217  HInstruction* value = LoadLocal(instruction.VRegA(), Primitive::kPrimInt);
218  T* comparison = new (arena_) T(value, graph_->GetIntConstant(0));
219  current_block_->AddInstruction(comparison);
220  HInstruction* ifinst = new (arena_) HIf(comparison);
221  current_block_->AddInstruction(ifinst);
222  current_block_->AddSuccessor(branch_target);
223  current_block_->AddSuccessor(fallthrough_target);
224  current_block_ = nullptr;
225}
226
227void HGraphBuilder::MaybeRecordStat(MethodCompilationStat compilation_stat) {
228  if (compilation_stats_ != nullptr) {
229    compilation_stats_->RecordStat(compilation_stat);
230  }
231}
232
233bool HGraphBuilder::SkipCompilation(const DexFile::CodeItem& code_item,
234                                    size_t number_of_branches) {
235  const CompilerOptions& compiler_options = compiler_driver_->GetCompilerOptions();
236  CompilerOptions::CompilerFilter compiler_filter = compiler_options.GetCompilerFilter();
237  if (compiler_filter == CompilerOptions::kEverything) {
238    return false;
239  }
240
241  if (compiler_options.IsHugeMethod(code_item.insns_size_in_code_units_)) {
242    VLOG(compiler) << "Skip compilation of huge method "
243                   << PrettyMethod(dex_compilation_unit_->GetDexMethodIndex(), *dex_file_)
244                   << ": " << code_item.insns_size_in_code_units_ << " code units";
245    MaybeRecordStat(MethodCompilationStat::kNotCompiledHugeMethod);
246    return true;
247  }
248
249  // If it's large and contains no branches, it's likely to be machine generated initialization.
250  if (compiler_options.IsLargeMethod(code_item.insns_size_in_code_units_)
251      && (number_of_branches == 0)) {
252    VLOG(compiler) << "Skip compilation of large method with no branch "
253                   << PrettyMethod(dex_compilation_unit_->GetDexMethodIndex(), *dex_file_)
254                   << ": " << code_item.insns_size_in_code_units_ << " code units";
255    MaybeRecordStat(MethodCompilationStat::kNotCompiledLargeMethodNoBranches);
256    return true;
257  }
258
259  return false;
260}
261
262bool HGraphBuilder::BuildGraph(const DexFile::CodeItem& code_item) {
263  DCHECK(graph_->GetBlocks().IsEmpty());
264
265  const uint16_t* code_ptr = code_item.insns_;
266  const uint16_t* code_end = code_item.insns_ + code_item.insns_size_in_code_units_;
267  code_start_ = code_ptr;
268
269  // Setup the graph with the entry block and exit block.
270  entry_block_ = new (arena_) HBasicBlock(graph_, 0);
271  graph_->AddBlock(entry_block_);
272  exit_block_ = new (arena_) HBasicBlock(graph_, kNoDexPc);
273  graph_->SetEntryBlock(entry_block_);
274  graph_->SetExitBlock(exit_block_);
275
276  InitializeLocals(code_item.registers_size_);
277  graph_->SetMaximumNumberOfOutVRegs(code_item.outs_size_);
278
279  // Compute the number of dex instructions, blocks, and branches. We will
280  // check these values against limits given to the compiler.
281  size_t number_of_branches = 0;
282
283  // To avoid splitting blocks, we compute ahead of time the instructions that
284  // start a new block, and create these blocks.
285  if (!ComputeBranchTargets(code_ptr, code_end, &number_of_branches)) {
286    MaybeRecordStat(MethodCompilationStat::kNotCompiledBranchOutsideMethodCode);
287    return false;
288  }
289
290  // Note that the compiler driver is null when unit testing.
291  if ((compiler_driver_ != nullptr) && SkipCompilation(code_item, number_of_branches)) {
292    return false;
293  }
294
295  // Also create blocks for catch handlers.
296  if (code_item.tries_size_ != 0) {
297    const uint8_t* handlers_ptr = DexFile::GetCatchHandlerData(code_item, 0);
298    uint32_t handlers_size = DecodeUnsignedLeb128(&handlers_ptr);
299    for (uint32_t idx = 0; idx < handlers_size; ++idx) {
300      CatchHandlerIterator iterator(handlers_ptr);
301      for (; iterator.HasNext(); iterator.Next()) {
302        uint32_t address = iterator.GetHandlerAddress();
303        HBasicBlock* block = FindBlockStartingAt(address);
304        if (block == nullptr) {
305          block = new (arena_) HBasicBlock(graph_, address);
306          branch_targets_.Put(address, block);
307        }
308        block->SetIsCatchBlock();
309      }
310      handlers_ptr = iterator.EndDataPointer();
311    }
312  }
313
314  InitializeParameters(code_item.ins_size_);
315
316  size_t dex_pc = 0;
317  while (code_ptr < code_end) {
318    // Update the current block if dex_pc starts a new block.
319    MaybeUpdateCurrentBlock(dex_pc);
320    const Instruction& instruction = *Instruction::At(code_ptr);
321    if (!AnalyzeDexInstruction(instruction, dex_pc)) {
322      return false;
323    }
324    dex_pc += instruction.SizeInCodeUnits();
325    code_ptr += instruction.SizeInCodeUnits();
326  }
327
328  // Add the exit block at the end to give it the highest id.
329  graph_->AddBlock(exit_block_);
330  exit_block_->AddInstruction(new (arena_) HExit());
331  // Add the suspend check to the entry block.
332  entry_block_->AddInstruction(new (arena_) HSuspendCheck(0));
333  entry_block_->AddInstruction(new (arena_) HGoto());
334
335  return true;
336}
337
338void HGraphBuilder::MaybeUpdateCurrentBlock(size_t index) {
339  HBasicBlock* block = FindBlockStartingAt(index);
340  if (block == nullptr) {
341    return;
342  }
343
344  if (current_block_ != nullptr) {
345    // Branching instructions clear current_block, so we know
346    // the last instruction of the current block is not a branching
347    // instruction. We add an unconditional goto to the found block.
348    current_block_->AddInstruction(new (arena_) HGoto());
349    current_block_->AddSuccessor(block);
350  }
351  graph_->AddBlock(block);
352  current_block_ = block;
353}
354
355bool HGraphBuilder::ComputeBranchTargets(const uint16_t* code_ptr,
356                                         const uint16_t* code_end,
357                                         size_t* number_of_branches) {
358  branch_targets_.SetSize(code_end - code_ptr);
359
360  // Create the first block for the dex instructions, single successor of the entry block.
361  HBasicBlock* block = new (arena_) HBasicBlock(graph_, 0);
362  branch_targets_.Put(0, block);
363  entry_block_->AddSuccessor(block);
364
365  // Iterate over all instructions and find branching instructions. Create blocks for
366  // the locations these instructions branch to.
367  uint32_t dex_pc = 0;
368  while (code_ptr < code_end) {
369    const Instruction& instruction = *Instruction::At(code_ptr);
370    if (instruction.IsBranch()) {
371      (*number_of_branches)++;
372      int32_t target = instruction.GetTargetOffset() + dex_pc;
373      // Create a block for the target instruction.
374      if (FindBlockStartingAt(target) == nullptr) {
375        block = new (arena_) HBasicBlock(graph_, target);
376        branch_targets_.Put(target, block);
377      }
378      dex_pc += instruction.SizeInCodeUnits();
379      code_ptr += instruction.SizeInCodeUnits();
380
381      if (code_ptr >= code_end) {
382        if (instruction.CanFlowThrough()) {
383          // In the normal case we should never hit this but someone can artificially forge a dex
384          // file to fall-through out the method code. In this case we bail out compilation.
385          return false;
386        }
387      } else if (FindBlockStartingAt(dex_pc) == nullptr) {
388        block = new (arena_) HBasicBlock(graph_, dex_pc);
389        branch_targets_.Put(dex_pc, block);
390      }
391    } else if (instruction.IsSwitch()) {
392      SwitchTable table(instruction, dex_pc, instruction.Opcode() == Instruction::SPARSE_SWITCH);
393
394      uint16_t num_entries = table.GetNumEntries();
395
396      // In a packed-switch, the entry at index 0 is the starting key. In a sparse-switch, the
397      // entry at index 0 is the first key, and values are after *all* keys.
398      size_t offset = table.GetFirstValueIndex();
399
400      // Use a larger loop counter type to avoid overflow issues.
401      for (size_t i = 0; i < num_entries; ++i) {
402        // The target of the case.
403        uint32_t target = dex_pc + table.GetEntryAt(i + offset);
404        if (FindBlockStartingAt(target) == nullptr) {
405          block = new (arena_) HBasicBlock(graph_, target);
406          branch_targets_.Put(target, block);
407        }
408
409        // The next case gets its own block.
410        if (i < num_entries) {
411          block = new (arena_) HBasicBlock(graph_, target);
412          branch_targets_.Put(table.GetDexPcForIndex(i), block);
413        }
414      }
415
416      // Fall-through. Add a block if there is more code afterwards.
417      dex_pc += instruction.SizeInCodeUnits();
418      code_ptr += instruction.SizeInCodeUnits();
419      if (code_ptr >= code_end) {
420        // In the normal case we should never hit this but someone can artificially forge a dex
421        // file to fall-through out the method code. In this case we bail out compilation.
422        // (A switch can fall-through so we don't need to check CanFlowThrough().)
423        return false;
424      } else if (FindBlockStartingAt(dex_pc) == nullptr) {
425        block = new (arena_) HBasicBlock(graph_, dex_pc);
426        branch_targets_.Put(dex_pc, block);
427      }
428    } else {
429      code_ptr += instruction.SizeInCodeUnits();
430      dex_pc += instruction.SizeInCodeUnits();
431    }
432  }
433  return true;
434}
435
436HBasicBlock* HGraphBuilder::FindBlockStartingAt(int32_t index) const {
437  DCHECK_GE(index, 0);
438  return branch_targets_.Get(index);
439}
440
441template<typename T>
442void HGraphBuilder::Unop_12x(const Instruction& instruction, Primitive::Type type) {
443  HInstruction* first = LoadLocal(instruction.VRegB(), type);
444  current_block_->AddInstruction(new (arena_) T(type, first));
445  UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
446}
447
448void HGraphBuilder::Conversion_12x(const Instruction& instruction,
449                                   Primitive::Type input_type,
450                                   Primitive::Type result_type,
451                                   uint32_t dex_pc) {
452  HInstruction* first = LoadLocal(instruction.VRegB(), input_type);
453  current_block_->AddInstruction(new (arena_) HTypeConversion(result_type, first, dex_pc));
454  UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
455}
456
457template<typename T>
458void HGraphBuilder::Binop_23x(const Instruction& instruction, Primitive::Type type) {
459  HInstruction* first = LoadLocal(instruction.VRegB(), type);
460  HInstruction* second = LoadLocal(instruction.VRegC(), type);
461  current_block_->AddInstruction(new (arena_) T(type, first, second));
462  UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
463}
464
465template<typename T>
466void HGraphBuilder::Binop_23x(const Instruction& instruction,
467                              Primitive::Type type,
468                              uint32_t dex_pc) {
469  HInstruction* first = LoadLocal(instruction.VRegB(), type);
470  HInstruction* second = LoadLocal(instruction.VRegC(), type);
471  current_block_->AddInstruction(new (arena_) T(type, first, second, dex_pc));
472  UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
473}
474
475template<typename T>
476void HGraphBuilder::Binop_23x_shift(const Instruction& instruction,
477                                    Primitive::Type type) {
478  HInstruction* first = LoadLocal(instruction.VRegB(), type);
479  HInstruction* second = LoadLocal(instruction.VRegC(), Primitive::kPrimInt);
480  current_block_->AddInstruction(new (arena_) T(type, first, second));
481  UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
482}
483
484void HGraphBuilder::Binop_23x_cmp(const Instruction& instruction,
485                                  Primitive::Type type,
486                                  HCompare::Bias bias) {
487  HInstruction* first = LoadLocal(instruction.VRegB(), type);
488  HInstruction* second = LoadLocal(instruction.VRegC(), type);
489  current_block_->AddInstruction(new (arena_) HCompare(type, first, second, bias));
490  UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
491}
492
493template<typename T>
494void HGraphBuilder::Binop_12x(const Instruction& instruction, Primitive::Type type) {
495  HInstruction* first = LoadLocal(instruction.VRegA(), type);
496  HInstruction* second = LoadLocal(instruction.VRegB(), type);
497  current_block_->AddInstruction(new (arena_) T(type, first, second));
498  UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
499}
500
501template<typename T>
502void HGraphBuilder::Binop_12x_shift(const Instruction& instruction, Primitive::Type type) {
503  HInstruction* first = LoadLocal(instruction.VRegA(), type);
504  HInstruction* second = LoadLocal(instruction.VRegB(), Primitive::kPrimInt);
505  current_block_->AddInstruction(new (arena_) T(type, first, second));
506  UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
507}
508
509template<typename T>
510void HGraphBuilder::Binop_12x(const Instruction& instruction,
511                              Primitive::Type type,
512                              uint32_t dex_pc) {
513  HInstruction* first = LoadLocal(instruction.VRegA(), type);
514  HInstruction* second = LoadLocal(instruction.VRegB(), type);
515  current_block_->AddInstruction(new (arena_) T(type, first, second, dex_pc));
516  UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
517}
518
519template<typename T>
520void HGraphBuilder::Binop_22s(const Instruction& instruction, bool reverse) {
521  HInstruction* first = LoadLocal(instruction.VRegB(), Primitive::kPrimInt);
522  HInstruction* second = graph_->GetIntConstant(instruction.VRegC_22s());
523  if (reverse) {
524    std::swap(first, second);
525  }
526  current_block_->AddInstruction(new (arena_) T(Primitive::kPrimInt, first, second));
527  UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
528}
529
530template<typename T>
531void HGraphBuilder::Binop_22b(const Instruction& instruction, bool reverse) {
532  HInstruction* first = LoadLocal(instruction.VRegB(), Primitive::kPrimInt);
533  HInstruction* second = graph_->GetIntConstant(instruction.VRegC_22b());
534  if (reverse) {
535    std::swap(first, second);
536  }
537  current_block_->AddInstruction(new (arena_) T(Primitive::kPrimInt, first, second));
538  UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
539}
540
541static bool RequiresConstructorBarrier(const DexCompilationUnit* cu, const CompilerDriver& driver) {
542  Thread* self = Thread::Current();
543  return cu->IsConstructor()
544      && driver.RequiresConstructorBarrier(self, cu->GetDexFile(), cu->GetClassDefIndex());
545}
546
547void HGraphBuilder::BuildReturn(const Instruction& instruction, Primitive::Type type) {
548  if (type == Primitive::kPrimVoid) {
549    if (graph_->ShouldGenerateConstructorBarrier()) {
550      // The compilation unit is null during testing.
551      if (dex_compilation_unit_ != nullptr) {
552        DCHECK(RequiresConstructorBarrier(dex_compilation_unit_, *compiler_driver_))
553          << "Inconsistent use of ShouldGenerateConstructorBarrier. Should not generate a barrier.";
554      }
555      current_block_->AddInstruction(new (arena_) HMemoryBarrier(kStoreStore));
556    }
557    current_block_->AddInstruction(new (arena_) HReturnVoid());
558  } else {
559    HInstruction* value = LoadLocal(instruction.VRegA(), type);
560    current_block_->AddInstruction(new (arena_) HReturn(value));
561  }
562  current_block_->AddSuccessor(exit_block_);
563  current_block_ = nullptr;
564}
565
566bool HGraphBuilder::BuildInvoke(const Instruction& instruction,
567                                uint32_t dex_pc,
568                                uint32_t method_idx,
569                                uint32_t number_of_vreg_arguments,
570                                bool is_range,
571                                uint32_t* args,
572                                uint32_t register_index) {
573  Instruction::Code opcode = instruction.Opcode();
574  InvokeType invoke_type;
575  switch (opcode) {
576    case Instruction::INVOKE_STATIC:
577    case Instruction::INVOKE_STATIC_RANGE:
578      invoke_type = kStatic;
579      break;
580    case Instruction::INVOKE_DIRECT:
581    case Instruction::INVOKE_DIRECT_RANGE:
582      invoke_type = kDirect;
583      break;
584    case Instruction::INVOKE_VIRTUAL:
585    case Instruction::INVOKE_VIRTUAL_RANGE:
586      invoke_type = kVirtual;
587      break;
588    case Instruction::INVOKE_INTERFACE:
589    case Instruction::INVOKE_INTERFACE_RANGE:
590      invoke_type = kInterface;
591      break;
592    case Instruction::INVOKE_SUPER_RANGE:
593    case Instruction::INVOKE_SUPER:
594      invoke_type = kSuper;
595      break;
596    default:
597      LOG(FATAL) << "Unexpected invoke op: " << opcode;
598      return false;
599  }
600
601  const DexFile::MethodId& method_id = dex_file_->GetMethodId(method_idx);
602  const DexFile::ProtoId& proto_id = dex_file_->GetProtoId(method_id.proto_idx_);
603  const char* descriptor = dex_file_->StringDataByIdx(proto_id.shorty_idx_);
604  Primitive::Type return_type = Primitive::GetType(descriptor[0]);
605  bool is_instance_call = invoke_type != kStatic;
606  size_t number_of_arguments = strlen(descriptor) - (is_instance_call ? 0 : 1);
607
608  MethodReference target_method(dex_file_, method_idx);
609  uintptr_t direct_code;
610  uintptr_t direct_method;
611  int table_index;
612  InvokeType optimized_invoke_type = invoke_type;
613
614  if (!compiler_driver_->ComputeInvokeInfo(dex_compilation_unit_, dex_pc, true, true,
615                                           &optimized_invoke_type, &target_method, &table_index,
616                                           &direct_code, &direct_method)) {
617    VLOG(compiler) << "Did not compile " << PrettyMethod(method_idx, *dex_file_)
618                   << " because a method call could not be resolved";
619    MaybeRecordStat(MethodCompilationStat::kNotCompiledUnresolvedMethod);
620    return false;
621  }
622  DCHECK(optimized_invoke_type != kSuper);
623
624  // By default, consider that the called method implicitly requires
625  // an initialization check of its declaring method.
626  HInvokeStaticOrDirect::ClinitCheckRequirement clinit_check_requirement =
627      HInvokeStaticOrDirect::ClinitCheckRequirement::kImplicit;
628  // Potential class initialization check, in the case of a static method call.
629  HClinitCheck* clinit_check = nullptr;
630  // Replace calls to String.<init> with StringFactory.
631  int32_t string_init_offset = 0;
632  bool is_string_init = compiler_driver_->IsStringInit(method_idx, dex_file_, &string_init_offset);
633  if (is_string_init) {
634    return_type = Primitive::kPrimNot;
635    is_instance_call = false;
636    number_of_arguments--;
637    invoke_type = kStatic;
638    optimized_invoke_type = kStatic;
639  }
640
641  HInvoke* invoke = nullptr;
642
643  if (optimized_invoke_type == kVirtual) {
644    invoke = new (arena_) HInvokeVirtual(
645        arena_, number_of_arguments, return_type, dex_pc, method_idx, table_index);
646  } else if (optimized_invoke_type == kInterface) {
647    invoke = new (arena_) HInvokeInterface(
648        arena_, number_of_arguments, return_type, dex_pc, method_idx, table_index);
649  } else {
650    DCHECK(optimized_invoke_type == kDirect || optimized_invoke_type == kStatic);
651    // Sharpening to kDirect only works if we compile PIC.
652    DCHECK((optimized_invoke_type == invoke_type) || (optimized_invoke_type != kDirect)
653           || compiler_driver_->GetCompilerOptions().GetCompilePic());
654    bool is_recursive =
655        (target_method.dex_method_index == outer_compilation_unit_->GetDexMethodIndex())
656        && (target_method.dex_file == outer_compilation_unit_->GetDexFile());
657
658    if (optimized_invoke_type == kStatic) {
659      ScopedObjectAccess soa(Thread::Current());
660      StackHandleScope<4> hs(soa.Self());
661      Handle<mirror::DexCache> dex_cache(hs.NewHandle(
662          dex_compilation_unit_->GetClassLinker()->FindDexCache(
663              *dex_compilation_unit_->GetDexFile())));
664      Handle<mirror::ClassLoader> class_loader(hs.NewHandle(
665          soa.Decode<mirror::ClassLoader*>(dex_compilation_unit_->GetClassLoader())));
666      ArtMethod* resolved_method = compiler_driver_->ResolveMethod(
667          soa, dex_cache, class_loader, dex_compilation_unit_, method_idx, optimized_invoke_type);
668
669      if (resolved_method == nullptr) {
670        MaybeRecordStat(MethodCompilationStat::kNotCompiledUnresolvedMethod);
671        return false;
672      }
673
674      const DexFile& outer_dex_file = *outer_compilation_unit_->GetDexFile();
675      Handle<mirror::DexCache> outer_dex_cache(hs.NewHandle(
676          outer_compilation_unit_->GetClassLinker()->FindDexCache(outer_dex_file)));
677      Handle<mirror::Class> referrer_class(hs.NewHandle(GetOutermostCompilingClass()));
678
679      // The index at which the method's class is stored in the DexCache's type array.
680      uint32_t storage_index = DexFile::kDexNoIndex;
681      bool is_referrer_class = (resolved_method->GetDeclaringClass() == referrer_class.Get());
682      if (is_referrer_class) {
683        storage_index = referrer_class->GetDexTypeIndex();
684      } else if (outer_dex_cache.Get() == dex_cache.Get()) {
685        // Get `storage_index` from IsClassOfStaticMethodAvailableToReferrer.
686        compiler_driver_->IsClassOfStaticMethodAvailableToReferrer(outer_dex_cache.Get(),
687                                                                   referrer_class.Get(),
688                                                                   resolved_method,
689                                                                   method_idx,
690                                                                   &storage_index);
691      }
692
693      if (referrer_class.Get()->IsSubClass(resolved_method->GetDeclaringClass())) {
694        // If the referrer class is the declaring class or a subclass
695        // of the declaring class, no class initialization is needed
696        // before the static method call.
697        clinit_check_requirement = HInvokeStaticOrDirect::ClinitCheckRequirement::kNone;
698      } else if (storage_index != DexFile::kDexNoIndex) {
699        // If the method's class type index is available, check
700        // whether we should add an explicit class initialization
701        // check for its declaring class before the static method call.
702
703        // TODO: find out why this check is needed.
704        bool is_in_dex_cache = compiler_driver_->CanAssumeTypeIsPresentInDexCache(
705            *outer_compilation_unit_->GetDexFile(), storage_index);
706        bool is_initialized =
707            resolved_method->GetDeclaringClass()->IsInitialized() && is_in_dex_cache;
708
709        if (is_initialized) {
710          clinit_check_requirement = HInvokeStaticOrDirect::ClinitCheckRequirement::kNone;
711        } else {
712          clinit_check_requirement = HInvokeStaticOrDirect::ClinitCheckRequirement::kExplicit;
713          HLoadClass* load_class = new (arena_) HLoadClass(
714              graph_->GetCurrentMethod(),
715              storage_index,
716              *dex_compilation_unit_->GetDexFile(),
717              is_referrer_class,
718              dex_pc);
719          current_block_->AddInstruction(load_class);
720          clinit_check = new (arena_) HClinitCheck(load_class, dex_pc);
721          current_block_->AddInstruction(clinit_check);
722        }
723      }
724    }
725
726    invoke = new (arena_) HInvokeStaticOrDirect(
727        arena_, number_of_arguments, return_type, dex_pc, target_method.dex_method_index,
728        is_recursive, string_init_offset, invoke_type, optimized_invoke_type,
729        clinit_check_requirement);
730  }
731
732  size_t start_index = 0;
733  Temporaries temps(graph_);
734  if (is_instance_call) {
735    HInstruction* arg = LoadLocal(is_range ? register_index : args[0], Primitive::kPrimNot);
736    HNullCheck* null_check = new (arena_) HNullCheck(arg, dex_pc);
737    current_block_->AddInstruction(null_check);
738    temps.Add(null_check);
739    invoke->SetArgumentAt(0, null_check);
740    start_index = 1;
741  }
742
743  uint32_t descriptor_index = 1;
744  uint32_t argument_index = start_index;
745  if (is_string_init) {
746    start_index = 1;
747  }
748  for (size_t i = start_index; i < number_of_vreg_arguments; i++, argument_index++) {
749    Primitive::Type type = Primitive::GetType(descriptor[descriptor_index++]);
750    bool is_wide = (type == Primitive::kPrimLong) || (type == Primitive::kPrimDouble);
751    if (!is_range && is_wide && args[i] + 1 != args[i + 1]) {
752      LOG(WARNING) << "Non sequential register pair in " << dex_compilation_unit_->GetSymbol()
753                   << " at " << dex_pc;
754      // We do not implement non sequential register pair.
755      MaybeRecordStat(MethodCompilationStat::kNotCompiledNonSequentialRegPair);
756      return false;
757    }
758    HInstruction* arg = LoadLocal(is_range ? register_index + i : args[i], type);
759    invoke->SetArgumentAt(argument_index, arg);
760    if (is_wide) {
761      i++;
762    }
763  }
764  DCHECK_EQ(argument_index, number_of_arguments);
765
766  if (clinit_check_requirement == HInvokeStaticOrDirect::ClinitCheckRequirement::kExplicit) {
767    // Add the class initialization check as last input of `invoke`.
768    DCHECK(clinit_check != nullptr);
769    invoke->SetArgumentAt(argument_index, clinit_check);
770  }
771
772  current_block_->AddInstruction(invoke);
773  latest_result_ = invoke;
774
775  // Add move-result for StringFactory method.
776  if (is_string_init) {
777    uint32_t orig_this_reg = is_range ? register_index : args[0];
778    const VerifiedMethod* verified_method =
779        compiler_driver_->GetVerifiedMethod(dex_file_, dex_compilation_unit_->GetDexMethodIndex());
780    if (verified_method == nullptr) {
781      LOG(WARNING) << "No verified method for method calling String.<init>: "
782                   << PrettyMethod(dex_compilation_unit_->GetDexMethodIndex(), *dex_file_);
783      return false;
784    }
785    const SafeMap<uint32_t, std::set<uint32_t>>& string_init_map =
786        verified_method->GetStringInitPcRegMap();
787    auto map_it = string_init_map.find(dex_pc);
788    if (map_it != string_init_map.end()) {
789      std::set<uint32_t> reg_set = map_it->second;
790      for (auto set_it = reg_set.begin(); set_it != reg_set.end(); ++set_it) {
791        UpdateLocal(*set_it, invoke);
792      }
793    }
794    UpdateLocal(orig_this_reg, invoke);
795  }
796  return true;
797}
798
799bool HGraphBuilder::BuildInstanceFieldAccess(const Instruction& instruction,
800                                             uint32_t dex_pc,
801                                             bool is_put) {
802  uint32_t source_or_dest_reg = instruction.VRegA_22c();
803  uint32_t obj_reg = instruction.VRegB_22c();
804  uint16_t field_index = instruction.VRegC_22c();
805
806  ScopedObjectAccess soa(Thread::Current());
807  ArtField* resolved_field =
808      compiler_driver_->ComputeInstanceFieldInfo(field_index, dex_compilation_unit_, is_put, soa);
809
810  if (resolved_field == nullptr) {
811    MaybeRecordStat(MethodCompilationStat::kNotCompiledUnresolvedField);
812    return false;
813  }
814
815  Primitive::Type field_type = resolved_field->GetTypeAsPrimitiveType();
816
817  HInstruction* object = LoadLocal(obj_reg, Primitive::kPrimNot);
818  current_block_->AddInstruction(new (arena_) HNullCheck(object, dex_pc));
819  if (is_put) {
820    Temporaries temps(graph_);
821    HInstruction* null_check = current_block_->GetLastInstruction();
822    // We need one temporary for the null check.
823    temps.Add(null_check);
824    HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
825    current_block_->AddInstruction(new (arena_) HInstanceFieldSet(
826        null_check,
827        value,
828        field_type,
829        resolved_field->GetOffset(),
830        resolved_field->IsVolatile(),
831        field_index,
832        *dex_file_));
833  } else {
834    current_block_->AddInstruction(new (arena_) HInstanceFieldGet(
835        current_block_->GetLastInstruction(),
836        field_type,
837        resolved_field->GetOffset(),
838        resolved_field->IsVolatile(),
839        field_index,
840        *dex_file_));
841
842    UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
843  }
844  return true;
845}
846
847mirror::Class* HGraphBuilder::GetOutermostCompilingClass() const {
848  ScopedObjectAccess soa(Thread::Current());
849  StackHandleScope<2> hs(soa.Self());
850  const DexFile& outer_dex_file = *outer_compilation_unit_->GetDexFile();
851  Handle<mirror::ClassLoader> class_loader(hs.NewHandle(
852      soa.Decode<mirror::ClassLoader*>(dex_compilation_unit_->GetClassLoader())));
853  Handle<mirror::DexCache> outer_dex_cache(hs.NewHandle(
854      outer_compilation_unit_->GetClassLinker()->FindDexCache(outer_dex_file)));
855
856  return compiler_driver_->ResolveCompilingMethodsClass(
857      soa, outer_dex_cache, class_loader, outer_compilation_unit_);
858}
859
860bool HGraphBuilder::IsOutermostCompilingClass(uint16_t type_index) const {
861  ScopedObjectAccess soa(Thread::Current());
862  StackHandleScope<4> hs(soa.Self());
863  Handle<mirror::DexCache> dex_cache(hs.NewHandle(
864      dex_compilation_unit_->GetClassLinker()->FindDexCache(*dex_compilation_unit_->GetDexFile())));
865  Handle<mirror::ClassLoader> class_loader(hs.NewHandle(
866      soa.Decode<mirror::ClassLoader*>(dex_compilation_unit_->GetClassLoader())));
867  Handle<mirror::Class> cls(hs.NewHandle(compiler_driver_->ResolveClass(
868      soa, dex_cache, class_loader, type_index, dex_compilation_unit_)));
869  Handle<mirror::Class> compiling_class(hs.NewHandle(GetOutermostCompilingClass()));
870
871  return compiling_class.Get() == cls.Get();
872}
873
874bool HGraphBuilder::BuildStaticFieldAccess(const Instruction& instruction,
875                                           uint32_t dex_pc,
876                                           bool is_put) {
877  uint32_t source_or_dest_reg = instruction.VRegA_21c();
878  uint16_t field_index = instruction.VRegB_21c();
879
880  ScopedObjectAccess soa(Thread::Current());
881  StackHandleScope<4> hs(soa.Self());
882  Handle<mirror::DexCache> dex_cache(hs.NewHandle(
883      dex_compilation_unit_->GetClassLinker()->FindDexCache(*dex_compilation_unit_->GetDexFile())));
884  Handle<mirror::ClassLoader> class_loader(hs.NewHandle(
885      soa.Decode<mirror::ClassLoader*>(dex_compilation_unit_->GetClassLoader())));
886  ArtField* resolved_field = compiler_driver_->ResolveField(
887      soa, dex_cache, class_loader, dex_compilation_unit_, field_index, true);
888
889  if (resolved_field == nullptr) {
890    MaybeRecordStat(MethodCompilationStat::kNotCompiledUnresolvedField);
891    return false;
892  }
893
894  const DexFile& outer_dex_file = *outer_compilation_unit_->GetDexFile();
895  Handle<mirror::DexCache> outer_dex_cache(hs.NewHandle(
896      outer_compilation_unit_->GetClassLinker()->FindDexCache(outer_dex_file)));
897  Handle<mirror::Class> referrer_class(hs.NewHandle(GetOutermostCompilingClass()));
898
899  // The index at which the field's class is stored in the DexCache's type array.
900  uint32_t storage_index;
901  bool is_referrer_class = (referrer_class.Get() == resolved_field->GetDeclaringClass());
902  if (is_referrer_class) {
903    storage_index = referrer_class->GetDexTypeIndex();
904  } else if (outer_dex_cache.Get() != dex_cache.Get()) {
905    // The compiler driver cannot currently understand multiple dex caches involved. Just bailout.
906    return false;
907  } else {
908    std::pair<bool, bool> pair = compiler_driver_->IsFastStaticField(
909        outer_dex_cache.Get(),
910        referrer_class.Get(),
911        resolved_field,
912        field_index,
913        &storage_index);
914    bool can_easily_access = is_put ? pair.second : pair.first;
915    if (!can_easily_access) {
916      return false;
917    }
918  }
919
920  // TODO: find out why this check is needed.
921  bool is_in_dex_cache = compiler_driver_->CanAssumeTypeIsPresentInDexCache(
922      *outer_compilation_unit_->GetDexFile(), storage_index);
923  bool is_initialized = resolved_field->GetDeclaringClass()->IsInitialized() && is_in_dex_cache;
924
925  HLoadClass* constant = new (arena_) HLoadClass(graph_->GetCurrentMethod(),
926                                                 storage_index,
927                                                 *dex_compilation_unit_->GetDexFile(),
928                                                 is_referrer_class,
929                                                 dex_pc);
930  current_block_->AddInstruction(constant);
931
932  HInstruction* cls = constant;
933  if (!is_initialized && !is_referrer_class) {
934    cls = new (arena_) HClinitCheck(constant, dex_pc);
935    current_block_->AddInstruction(cls);
936  }
937
938  Primitive::Type field_type = resolved_field->GetTypeAsPrimitiveType();
939  if (is_put) {
940    // We need to keep the class alive before loading the value.
941    Temporaries temps(graph_);
942    temps.Add(cls);
943    HInstruction* value = LoadLocal(source_or_dest_reg, field_type);
944    DCHECK_EQ(value->GetType(), field_type);
945    current_block_->AddInstruction(new (arena_) HStaticFieldSet(cls,
946                                                                value,
947                                                                field_type,
948                                                                resolved_field->GetOffset(),
949                                                                resolved_field->IsVolatile(),
950                                                                field_index,
951                                                                *dex_file_));
952  } else {
953    current_block_->AddInstruction(new (arena_) HStaticFieldGet(cls,
954                                                                field_type,
955                                                                resolved_field->GetOffset(),
956                                                                resolved_field->IsVolatile(),
957                                                                field_index,
958                                                                *dex_file_));
959    UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
960  }
961  return true;
962}
963
964void HGraphBuilder::BuildCheckedDivRem(uint16_t out_vreg,
965                                       uint16_t first_vreg,
966                                       int64_t second_vreg_or_constant,
967                                       uint32_t dex_pc,
968                                       Primitive::Type type,
969                                       bool second_is_constant,
970                                       bool isDiv) {
971  DCHECK(type == Primitive::kPrimInt || type == Primitive::kPrimLong);
972
973  HInstruction* first = LoadLocal(first_vreg, type);
974  HInstruction* second = nullptr;
975  if (second_is_constant) {
976    if (type == Primitive::kPrimInt) {
977      second = graph_->GetIntConstant(second_vreg_or_constant);
978    } else {
979      second = graph_->GetLongConstant(second_vreg_or_constant);
980    }
981  } else {
982    second = LoadLocal(second_vreg_or_constant, type);
983  }
984
985  if (!second_is_constant
986      || (type == Primitive::kPrimInt && second->AsIntConstant()->GetValue() == 0)
987      || (type == Primitive::kPrimLong && second->AsLongConstant()->GetValue() == 0)) {
988    second = new (arena_) HDivZeroCheck(second, dex_pc);
989    Temporaries temps(graph_);
990    current_block_->AddInstruction(second);
991    temps.Add(current_block_->GetLastInstruction());
992  }
993
994  if (isDiv) {
995    current_block_->AddInstruction(new (arena_) HDiv(type, first, second, dex_pc));
996  } else {
997    current_block_->AddInstruction(new (arena_) HRem(type, first, second, dex_pc));
998  }
999  UpdateLocal(out_vreg, current_block_->GetLastInstruction());
1000}
1001
1002void HGraphBuilder::BuildArrayAccess(const Instruction& instruction,
1003                                     uint32_t dex_pc,
1004                                     bool is_put,
1005                                     Primitive::Type anticipated_type) {
1006  uint8_t source_or_dest_reg = instruction.VRegA_23x();
1007  uint8_t array_reg = instruction.VRegB_23x();
1008  uint8_t index_reg = instruction.VRegC_23x();
1009
1010  // We need one temporary for the null check, one for the index, and one for the length.
1011  Temporaries temps(graph_);
1012
1013  HInstruction* object = LoadLocal(array_reg, Primitive::kPrimNot);
1014  object = new (arena_) HNullCheck(object, dex_pc);
1015  current_block_->AddInstruction(object);
1016  temps.Add(object);
1017
1018  HInstruction* length = new (arena_) HArrayLength(object);
1019  current_block_->AddInstruction(length);
1020  temps.Add(length);
1021  HInstruction* index = LoadLocal(index_reg, Primitive::kPrimInt);
1022  index = new (arena_) HBoundsCheck(index, length, dex_pc);
1023  current_block_->AddInstruction(index);
1024  temps.Add(index);
1025  if (is_put) {
1026    HInstruction* value = LoadLocal(source_or_dest_reg, anticipated_type);
1027    // TODO: Insert a type check node if the type is Object.
1028    current_block_->AddInstruction(new (arena_) HArraySet(
1029        object, index, value, anticipated_type, dex_pc));
1030  } else {
1031    current_block_->AddInstruction(new (arena_) HArrayGet(object, index, anticipated_type));
1032    UpdateLocal(source_or_dest_reg, current_block_->GetLastInstruction());
1033  }
1034  graph_->SetHasBoundsChecks(true);
1035}
1036
1037void HGraphBuilder::BuildFilledNewArray(uint32_t dex_pc,
1038                                        uint32_t type_index,
1039                                        uint32_t number_of_vreg_arguments,
1040                                        bool is_range,
1041                                        uint32_t* args,
1042                                        uint32_t register_index) {
1043  HInstruction* length = graph_->GetIntConstant(number_of_vreg_arguments);
1044  QuickEntrypointEnum entrypoint = NeedsAccessCheck(type_index)
1045      ? kQuickAllocArrayWithAccessCheck
1046      : kQuickAllocArray;
1047  HInstruction* object = new (arena_) HNewArray(length,
1048                                                dex_pc,
1049                                                type_index,
1050                                                *dex_compilation_unit_->GetDexFile(),
1051                                                entrypoint);
1052  current_block_->AddInstruction(object);
1053
1054  const char* descriptor = dex_file_->StringByTypeIdx(type_index);
1055  DCHECK_EQ(descriptor[0], '[') << descriptor;
1056  char primitive = descriptor[1];
1057  DCHECK(primitive == 'I'
1058      || primitive == 'L'
1059      || primitive == '[') << descriptor;
1060  bool is_reference_array = (primitive == 'L') || (primitive == '[');
1061  Primitive::Type type = is_reference_array ? Primitive::kPrimNot : Primitive::kPrimInt;
1062
1063  Temporaries temps(graph_);
1064  temps.Add(object);
1065  for (size_t i = 0; i < number_of_vreg_arguments; ++i) {
1066    HInstruction* value = LoadLocal(is_range ? register_index + i : args[i], type);
1067    HInstruction* index = graph_->GetIntConstant(i);
1068    current_block_->AddInstruction(
1069        new (arena_) HArraySet(object, index, value, type, dex_pc));
1070  }
1071  latest_result_ = object;
1072}
1073
1074template <typename T>
1075void HGraphBuilder::BuildFillArrayData(HInstruction* object,
1076                                       const T* data,
1077                                       uint32_t element_count,
1078                                       Primitive::Type anticipated_type,
1079                                       uint32_t dex_pc) {
1080  for (uint32_t i = 0; i < element_count; ++i) {
1081    HInstruction* index = graph_->GetIntConstant(i);
1082    HInstruction* value = graph_->GetIntConstant(data[i]);
1083    current_block_->AddInstruction(new (arena_) HArraySet(
1084      object, index, value, anticipated_type, dex_pc));
1085  }
1086}
1087
1088void HGraphBuilder::BuildFillArrayData(const Instruction& instruction, uint32_t dex_pc) {
1089  Temporaries temps(graph_);
1090  HInstruction* array = LoadLocal(instruction.VRegA_31t(), Primitive::kPrimNot);
1091  HNullCheck* null_check = new (arena_) HNullCheck(array, dex_pc);
1092  current_block_->AddInstruction(null_check);
1093  temps.Add(null_check);
1094
1095  HInstruction* length = new (arena_) HArrayLength(null_check);
1096  current_block_->AddInstruction(length);
1097
1098  int32_t payload_offset = instruction.VRegB_31t() + dex_pc;
1099  const Instruction::ArrayDataPayload* payload =
1100      reinterpret_cast<const Instruction::ArrayDataPayload*>(code_start_ + payload_offset);
1101  const uint8_t* data = payload->data;
1102  uint32_t element_count = payload->element_count;
1103
1104  // Implementation of this DEX instruction seems to be that the bounds check is
1105  // done before doing any stores.
1106  HInstruction* last_index = graph_->GetIntConstant(payload->element_count - 1);
1107  current_block_->AddInstruction(new (arena_) HBoundsCheck(last_index, length, dex_pc));
1108
1109  switch (payload->element_width) {
1110    case 1:
1111      BuildFillArrayData(null_check,
1112                         reinterpret_cast<const int8_t*>(data),
1113                         element_count,
1114                         Primitive::kPrimByte,
1115                         dex_pc);
1116      break;
1117    case 2:
1118      BuildFillArrayData(null_check,
1119                         reinterpret_cast<const int16_t*>(data),
1120                         element_count,
1121                         Primitive::kPrimShort,
1122                         dex_pc);
1123      break;
1124    case 4:
1125      BuildFillArrayData(null_check,
1126                         reinterpret_cast<const int32_t*>(data),
1127                         element_count,
1128                         Primitive::kPrimInt,
1129                         dex_pc);
1130      break;
1131    case 8:
1132      BuildFillWideArrayData(null_check,
1133                             reinterpret_cast<const int64_t*>(data),
1134                             element_count,
1135                             dex_pc);
1136      break;
1137    default:
1138      LOG(FATAL) << "Unknown element width for " << payload->element_width;
1139  }
1140  graph_->SetHasBoundsChecks(true);
1141}
1142
1143void HGraphBuilder::BuildFillWideArrayData(HInstruction* object,
1144                                           const int64_t* data,
1145                                           uint32_t element_count,
1146                                           uint32_t dex_pc) {
1147  for (uint32_t i = 0; i < element_count; ++i) {
1148    HInstruction* index = graph_->GetIntConstant(i);
1149    HInstruction* value = graph_->GetLongConstant(data[i]);
1150    current_block_->AddInstruction(new (arena_) HArraySet(
1151      object, index, value, Primitive::kPrimLong, dex_pc));
1152  }
1153}
1154
1155bool HGraphBuilder::BuildTypeCheck(const Instruction& instruction,
1156                                   uint8_t destination,
1157                                   uint8_t reference,
1158                                   uint16_t type_index,
1159                                   uint32_t dex_pc) {
1160  bool type_known_final;
1161  bool type_known_abstract;
1162  // `CanAccessTypeWithoutChecks` will tell whether the method being
1163  // built is trying to access its own class, so that the generated
1164  // code can optimize for this case. However, the optimization does not
1165  // work for inlining, so we use `IsOutermostCompilingClass` instead.
1166  bool dont_use_is_referrers_class;
1167  bool can_access = compiler_driver_->CanAccessTypeWithoutChecks(
1168      dex_compilation_unit_->GetDexMethodIndex(), *dex_file_, type_index,
1169      &type_known_final, &type_known_abstract, &dont_use_is_referrers_class);
1170  if (!can_access) {
1171    MaybeRecordStat(MethodCompilationStat::kNotCompiledCantAccesType);
1172    return false;
1173  }
1174  HInstruction* object = LoadLocal(reference, Primitive::kPrimNot);
1175  HLoadClass* cls = new (arena_) HLoadClass(
1176      graph_->GetCurrentMethod(),
1177      type_index,
1178      *dex_compilation_unit_->GetDexFile(),
1179      IsOutermostCompilingClass(type_index),
1180      dex_pc);
1181  current_block_->AddInstruction(cls);
1182  // The class needs a temporary before being used by the type check.
1183  Temporaries temps(graph_);
1184  temps.Add(cls);
1185  if (instruction.Opcode() == Instruction::INSTANCE_OF) {
1186    current_block_->AddInstruction(
1187        new (arena_) HInstanceOf(object, cls, type_known_final, dex_pc));
1188    UpdateLocal(destination, current_block_->GetLastInstruction());
1189  } else {
1190    DCHECK_EQ(instruction.Opcode(), Instruction::CHECK_CAST);
1191    current_block_->AddInstruction(
1192        new (arena_) HCheckCast(object, cls, type_known_final, dex_pc));
1193  }
1194  return true;
1195}
1196
1197bool HGraphBuilder::NeedsAccessCheck(uint32_t type_index) const {
1198  return !compiler_driver_->CanAccessInstantiableTypeWithoutChecks(
1199      dex_compilation_unit_->GetDexMethodIndex(), *dex_file_, type_index);
1200}
1201
1202void HGraphBuilder::BuildPackedSwitch(const Instruction& instruction, uint32_t dex_pc) {
1203  SwitchTable table(instruction, dex_pc, false);
1204
1205  // Value to test against.
1206  HInstruction* value = LoadLocal(instruction.VRegA(), Primitive::kPrimInt);
1207
1208  uint16_t num_entries = table.GetNumEntries();
1209  // There should be at least one entry here.
1210  DCHECK_GT(num_entries, 0U);
1211
1212  // Chained cmp-and-branch, starting from starting_key.
1213  int32_t starting_key = table.GetEntryAt(0);
1214
1215  for (size_t i = 1; i <= num_entries; i++) {
1216    BuildSwitchCaseHelper(instruction, i, i == num_entries, table, value, starting_key + i - 1,
1217                          table.GetEntryAt(i), dex_pc);
1218  }
1219}
1220
1221void HGraphBuilder::BuildSparseSwitch(const Instruction& instruction, uint32_t dex_pc) {
1222  SwitchTable table(instruction, dex_pc, true);
1223
1224  // Value to test against.
1225  HInstruction* value = LoadLocal(instruction.VRegA(), Primitive::kPrimInt);
1226
1227  uint16_t num_entries = table.GetNumEntries();
1228
1229  for (size_t i = 0; i < num_entries; i++) {
1230    BuildSwitchCaseHelper(instruction, i, i == static_cast<size_t>(num_entries) - 1, table, value,
1231                          table.GetEntryAt(i), table.GetEntryAt(i + num_entries), dex_pc);
1232  }
1233}
1234
1235void HGraphBuilder::BuildSwitchCaseHelper(const Instruction& instruction, size_t index,
1236                                          bool is_last_case, const SwitchTable& table,
1237                                          HInstruction* value, int32_t case_value_int,
1238                                          int32_t target_offset, uint32_t dex_pc) {
1239  HBasicBlock* case_target = FindBlockStartingAt(dex_pc + target_offset);
1240  DCHECK(case_target != nullptr);
1241  PotentiallyAddSuspendCheck(case_target, dex_pc);
1242
1243  // The current case's value.
1244  HInstruction* this_case_value = graph_->GetIntConstant(case_value_int);
1245
1246  // Compare value and this_case_value.
1247  HEqual* comparison = new (arena_) HEqual(value, this_case_value);
1248  current_block_->AddInstruction(comparison);
1249  HInstruction* ifinst = new (arena_) HIf(comparison);
1250  current_block_->AddInstruction(ifinst);
1251
1252  // Case hit: use the target offset to determine where to go.
1253  current_block_->AddSuccessor(case_target);
1254
1255  // Case miss: go to the next case (or default fall-through).
1256  // When there is a next case, we use the block stored with the table offset representing this
1257  // case (that is where we registered them in ComputeBranchTargets).
1258  // When there is no next case, we use the following instruction.
1259  // TODO: Find a good way to peel the last iteration to avoid conditional, but still have re-use.
1260  if (!is_last_case) {
1261    HBasicBlock* next_case_target = FindBlockStartingAt(table.GetDexPcForIndex(index));
1262    DCHECK(next_case_target != nullptr);
1263    current_block_->AddSuccessor(next_case_target);
1264
1265    // Need to manually add the block, as there is no dex-pc transition for the cases.
1266    graph_->AddBlock(next_case_target);
1267
1268    current_block_ = next_case_target;
1269  } else {
1270    HBasicBlock* default_target = FindBlockStartingAt(dex_pc + instruction.SizeInCodeUnits());
1271    DCHECK(default_target != nullptr);
1272    current_block_->AddSuccessor(default_target);
1273    current_block_ = nullptr;
1274  }
1275}
1276
1277void HGraphBuilder::PotentiallyAddSuspendCheck(HBasicBlock* target, uint32_t dex_pc) {
1278  int32_t target_offset = target->GetDexPc() - dex_pc;
1279  if (target_offset <= 0) {
1280    // DX generates back edges to the first encountered return. We can save
1281    // time of later passes by not adding redundant suspend checks.
1282    HInstruction* last_in_target = target->GetLastInstruction();
1283    if (last_in_target != nullptr &&
1284        (last_in_target->IsReturn() || last_in_target->IsReturnVoid())) {
1285      return;
1286    }
1287
1288    // Add a suspend check to backward branches which may potentially loop. We
1289    // can remove them after we recognize loops in the graph.
1290    current_block_->AddInstruction(new (arena_) HSuspendCheck(dex_pc));
1291  }
1292}
1293
1294bool HGraphBuilder::AnalyzeDexInstruction(const Instruction& instruction, uint32_t dex_pc) {
1295  if (current_block_ == nullptr) {
1296    return true;  // Dead code
1297  }
1298
1299  switch (instruction.Opcode()) {
1300    case Instruction::CONST_4: {
1301      int32_t register_index = instruction.VRegA();
1302      HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_11n());
1303      UpdateLocal(register_index, constant);
1304      break;
1305    }
1306
1307    case Instruction::CONST_16: {
1308      int32_t register_index = instruction.VRegA();
1309      HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_21s());
1310      UpdateLocal(register_index, constant);
1311      break;
1312    }
1313
1314    case Instruction::CONST: {
1315      int32_t register_index = instruction.VRegA();
1316      HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_31i());
1317      UpdateLocal(register_index, constant);
1318      break;
1319    }
1320
1321    case Instruction::CONST_HIGH16: {
1322      int32_t register_index = instruction.VRegA();
1323      HIntConstant* constant = graph_->GetIntConstant(instruction.VRegB_21h() << 16);
1324      UpdateLocal(register_index, constant);
1325      break;
1326    }
1327
1328    case Instruction::CONST_WIDE_16: {
1329      int32_t register_index = instruction.VRegA();
1330      // Get 16 bits of constant value, sign extended to 64 bits.
1331      int64_t value = instruction.VRegB_21s();
1332      value <<= 48;
1333      value >>= 48;
1334      HLongConstant* constant = graph_->GetLongConstant(value);
1335      UpdateLocal(register_index, constant);
1336      break;
1337    }
1338
1339    case Instruction::CONST_WIDE_32: {
1340      int32_t register_index = instruction.VRegA();
1341      // Get 32 bits of constant value, sign extended to 64 bits.
1342      int64_t value = instruction.VRegB_31i();
1343      value <<= 32;
1344      value >>= 32;
1345      HLongConstant* constant = graph_->GetLongConstant(value);
1346      UpdateLocal(register_index, constant);
1347      break;
1348    }
1349
1350    case Instruction::CONST_WIDE: {
1351      int32_t register_index = instruction.VRegA();
1352      HLongConstant* constant = graph_->GetLongConstant(instruction.VRegB_51l());
1353      UpdateLocal(register_index, constant);
1354      break;
1355    }
1356
1357    case Instruction::CONST_WIDE_HIGH16: {
1358      int32_t register_index = instruction.VRegA();
1359      int64_t value = static_cast<int64_t>(instruction.VRegB_21h()) << 48;
1360      HLongConstant* constant = graph_->GetLongConstant(value);
1361      UpdateLocal(register_index, constant);
1362      break;
1363    }
1364
1365    // Note that the SSA building will refine the types.
1366    case Instruction::MOVE:
1367    case Instruction::MOVE_FROM16:
1368    case Instruction::MOVE_16: {
1369      HInstruction* value = LoadLocal(instruction.VRegB(), Primitive::kPrimInt);
1370      UpdateLocal(instruction.VRegA(), value);
1371      break;
1372    }
1373
1374    // Note that the SSA building will refine the types.
1375    case Instruction::MOVE_WIDE:
1376    case Instruction::MOVE_WIDE_FROM16:
1377    case Instruction::MOVE_WIDE_16: {
1378      HInstruction* value = LoadLocal(instruction.VRegB(), Primitive::kPrimLong);
1379      UpdateLocal(instruction.VRegA(), value);
1380      break;
1381    }
1382
1383    case Instruction::MOVE_OBJECT:
1384    case Instruction::MOVE_OBJECT_16:
1385    case Instruction::MOVE_OBJECT_FROM16: {
1386      HInstruction* value = LoadLocal(instruction.VRegB(), Primitive::kPrimNot);
1387      UpdateLocal(instruction.VRegA(), value);
1388      break;
1389    }
1390
1391    case Instruction::RETURN_VOID: {
1392      BuildReturn(instruction, Primitive::kPrimVoid);
1393      break;
1394    }
1395
1396#define IF_XX(comparison, cond) \
1397    case Instruction::IF_##cond: If_22t<comparison>(instruction, dex_pc); break; \
1398    case Instruction::IF_##cond##Z: If_21t<comparison>(instruction, dex_pc); break
1399
1400    IF_XX(HEqual, EQ);
1401    IF_XX(HNotEqual, NE);
1402    IF_XX(HLessThan, LT);
1403    IF_XX(HLessThanOrEqual, LE);
1404    IF_XX(HGreaterThan, GT);
1405    IF_XX(HGreaterThanOrEqual, GE);
1406
1407    case Instruction::GOTO:
1408    case Instruction::GOTO_16:
1409    case Instruction::GOTO_32: {
1410      int32_t offset = instruction.GetTargetOffset();
1411      HBasicBlock* target = FindBlockStartingAt(offset + dex_pc);
1412      DCHECK(target != nullptr);
1413      PotentiallyAddSuspendCheck(target, dex_pc);
1414      current_block_->AddInstruction(new (arena_) HGoto());
1415      current_block_->AddSuccessor(target);
1416      current_block_ = nullptr;
1417      break;
1418    }
1419
1420    case Instruction::RETURN: {
1421      DCHECK_NE(return_type_, Primitive::kPrimNot);
1422      DCHECK_NE(return_type_, Primitive::kPrimLong);
1423      DCHECK_NE(return_type_, Primitive::kPrimDouble);
1424      BuildReturn(instruction, return_type_);
1425      break;
1426    }
1427
1428    case Instruction::RETURN_OBJECT: {
1429      DCHECK(return_type_ == Primitive::kPrimNot);
1430      BuildReturn(instruction, return_type_);
1431      break;
1432    }
1433
1434    case Instruction::RETURN_WIDE: {
1435      DCHECK(return_type_ == Primitive::kPrimDouble || return_type_ == Primitive::kPrimLong);
1436      BuildReturn(instruction, return_type_);
1437      break;
1438    }
1439
1440    case Instruction::INVOKE_DIRECT:
1441    case Instruction::INVOKE_INTERFACE:
1442    case Instruction::INVOKE_STATIC:
1443    case Instruction::INVOKE_SUPER:
1444    case Instruction::INVOKE_VIRTUAL: {
1445      uint32_t method_idx = instruction.VRegB_35c();
1446      uint32_t number_of_vreg_arguments = instruction.VRegA_35c();
1447      uint32_t args[5];
1448      instruction.GetVarArgs(args);
1449      if (!BuildInvoke(instruction, dex_pc, method_idx,
1450                       number_of_vreg_arguments, false, args, -1)) {
1451        return false;
1452      }
1453      break;
1454    }
1455
1456    case Instruction::INVOKE_DIRECT_RANGE:
1457    case Instruction::INVOKE_INTERFACE_RANGE:
1458    case Instruction::INVOKE_STATIC_RANGE:
1459    case Instruction::INVOKE_SUPER_RANGE:
1460    case Instruction::INVOKE_VIRTUAL_RANGE: {
1461      uint32_t method_idx = instruction.VRegB_3rc();
1462      uint32_t number_of_vreg_arguments = instruction.VRegA_3rc();
1463      uint32_t register_index = instruction.VRegC();
1464      if (!BuildInvoke(instruction, dex_pc, method_idx,
1465                       number_of_vreg_arguments, true, nullptr, register_index)) {
1466        return false;
1467      }
1468      break;
1469    }
1470
1471    case Instruction::NEG_INT: {
1472      Unop_12x<HNeg>(instruction, Primitive::kPrimInt);
1473      break;
1474    }
1475
1476    case Instruction::NEG_LONG: {
1477      Unop_12x<HNeg>(instruction, Primitive::kPrimLong);
1478      break;
1479    }
1480
1481    case Instruction::NEG_FLOAT: {
1482      Unop_12x<HNeg>(instruction, Primitive::kPrimFloat);
1483      break;
1484    }
1485
1486    case Instruction::NEG_DOUBLE: {
1487      Unop_12x<HNeg>(instruction, Primitive::kPrimDouble);
1488      break;
1489    }
1490
1491    case Instruction::NOT_INT: {
1492      Unop_12x<HNot>(instruction, Primitive::kPrimInt);
1493      break;
1494    }
1495
1496    case Instruction::NOT_LONG: {
1497      Unop_12x<HNot>(instruction, Primitive::kPrimLong);
1498      break;
1499    }
1500
1501    case Instruction::INT_TO_LONG: {
1502      Conversion_12x(instruction, Primitive::kPrimInt, Primitive::kPrimLong, dex_pc);
1503      break;
1504    }
1505
1506    case Instruction::INT_TO_FLOAT: {
1507      Conversion_12x(instruction, Primitive::kPrimInt, Primitive::kPrimFloat, dex_pc);
1508      break;
1509    }
1510
1511    case Instruction::INT_TO_DOUBLE: {
1512      Conversion_12x(instruction, Primitive::kPrimInt, Primitive::kPrimDouble, dex_pc);
1513      break;
1514    }
1515
1516    case Instruction::LONG_TO_INT: {
1517      Conversion_12x(instruction, Primitive::kPrimLong, Primitive::kPrimInt, dex_pc);
1518      break;
1519    }
1520
1521    case Instruction::LONG_TO_FLOAT: {
1522      Conversion_12x(instruction, Primitive::kPrimLong, Primitive::kPrimFloat, dex_pc);
1523      break;
1524    }
1525
1526    case Instruction::LONG_TO_DOUBLE: {
1527      Conversion_12x(instruction, Primitive::kPrimLong, Primitive::kPrimDouble, dex_pc);
1528      break;
1529    }
1530
1531    case Instruction::FLOAT_TO_INT: {
1532      Conversion_12x(instruction, Primitive::kPrimFloat, Primitive::kPrimInt, dex_pc);
1533      break;
1534    }
1535
1536    case Instruction::FLOAT_TO_LONG: {
1537      Conversion_12x(instruction, Primitive::kPrimFloat, Primitive::kPrimLong, dex_pc);
1538      break;
1539    }
1540
1541    case Instruction::FLOAT_TO_DOUBLE: {
1542      Conversion_12x(instruction, Primitive::kPrimFloat, Primitive::kPrimDouble, dex_pc);
1543      break;
1544    }
1545
1546    case Instruction::DOUBLE_TO_INT: {
1547      Conversion_12x(instruction, Primitive::kPrimDouble, Primitive::kPrimInt, dex_pc);
1548      break;
1549    }
1550
1551    case Instruction::DOUBLE_TO_LONG: {
1552      Conversion_12x(instruction, Primitive::kPrimDouble, Primitive::kPrimLong, dex_pc);
1553      break;
1554    }
1555
1556    case Instruction::DOUBLE_TO_FLOAT: {
1557      Conversion_12x(instruction, Primitive::kPrimDouble, Primitive::kPrimFloat, dex_pc);
1558      break;
1559    }
1560
1561    case Instruction::INT_TO_BYTE: {
1562      Conversion_12x(instruction, Primitive::kPrimInt, Primitive::kPrimByte, dex_pc);
1563      break;
1564    }
1565
1566    case Instruction::INT_TO_SHORT: {
1567      Conversion_12x(instruction, Primitive::kPrimInt, Primitive::kPrimShort, dex_pc);
1568      break;
1569    }
1570
1571    case Instruction::INT_TO_CHAR: {
1572      Conversion_12x(instruction, Primitive::kPrimInt, Primitive::kPrimChar, dex_pc);
1573      break;
1574    }
1575
1576    case Instruction::ADD_INT: {
1577      Binop_23x<HAdd>(instruction, Primitive::kPrimInt);
1578      break;
1579    }
1580
1581    case Instruction::ADD_LONG: {
1582      Binop_23x<HAdd>(instruction, Primitive::kPrimLong);
1583      break;
1584    }
1585
1586    case Instruction::ADD_DOUBLE: {
1587      Binop_23x<HAdd>(instruction, Primitive::kPrimDouble);
1588      break;
1589    }
1590
1591    case Instruction::ADD_FLOAT: {
1592      Binop_23x<HAdd>(instruction, Primitive::kPrimFloat);
1593      break;
1594    }
1595
1596    case Instruction::SUB_INT: {
1597      Binop_23x<HSub>(instruction, Primitive::kPrimInt);
1598      break;
1599    }
1600
1601    case Instruction::SUB_LONG: {
1602      Binop_23x<HSub>(instruction, Primitive::kPrimLong);
1603      break;
1604    }
1605
1606    case Instruction::SUB_FLOAT: {
1607      Binop_23x<HSub>(instruction, Primitive::kPrimFloat);
1608      break;
1609    }
1610
1611    case Instruction::SUB_DOUBLE: {
1612      Binop_23x<HSub>(instruction, Primitive::kPrimDouble);
1613      break;
1614    }
1615
1616    case Instruction::ADD_INT_2ADDR: {
1617      Binop_12x<HAdd>(instruction, Primitive::kPrimInt);
1618      break;
1619    }
1620
1621    case Instruction::MUL_INT: {
1622      Binop_23x<HMul>(instruction, Primitive::kPrimInt);
1623      break;
1624    }
1625
1626    case Instruction::MUL_LONG: {
1627      Binop_23x<HMul>(instruction, Primitive::kPrimLong);
1628      break;
1629    }
1630
1631    case Instruction::MUL_FLOAT: {
1632      Binop_23x<HMul>(instruction, Primitive::kPrimFloat);
1633      break;
1634    }
1635
1636    case Instruction::MUL_DOUBLE: {
1637      Binop_23x<HMul>(instruction, Primitive::kPrimDouble);
1638      break;
1639    }
1640
1641    case Instruction::DIV_INT: {
1642      BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
1643                         dex_pc, Primitive::kPrimInt, false, true);
1644      break;
1645    }
1646
1647    case Instruction::DIV_LONG: {
1648      BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
1649                         dex_pc, Primitive::kPrimLong, false, true);
1650      break;
1651    }
1652
1653    case Instruction::DIV_FLOAT: {
1654      Binop_23x<HDiv>(instruction, Primitive::kPrimFloat, dex_pc);
1655      break;
1656    }
1657
1658    case Instruction::DIV_DOUBLE: {
1659      Binop_23x<HDiv>(instruction, Primitive::kPrimDouble, dex_pc);
1660      break;
1661    }
1662
1663    case Instruction::REM_INT: {
1664      BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
1665                         dex_pc, Primitive::kPrimInt, false, false);
1666      break;
1667    }
1668
1669    case Instruction::REM_LONG: {
1670      BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
1671                         dex_pc, Primitive::kPrimLong, false, false);
1672      break;
1673    }
1674
1675    case Instruction::REM_FLOAT: {
1676      Binop_23x<HRem>(instruction, Primitive::kPrimFloat, dex_pc);
1677      break;
1678    }
1679
1680    case Instruction::REM_DOUBLE: {
1681      Binop_23x<HRem>(instruction, Primitive::kPrimDouble, dex_pc);
1682      break;
1683    }
1684
1685    case Instruction::AND_INT: {
1686      Binop_23x<HAnd>(instruction, Primitive::kPrimInt);
1687      break;
1688    }
1689
1690    case Instruction::AND_LONG: {
1691      Binop_23x<HAnd>(instruction, Primitive::kPrimLong);
1692      break;
1693    }
1694
1695    case Instruction::SHL_INT: {
1696      Binop_23x_shift<HShl>(instruction, Primitive::kPrimInt);
1697      break;
1698    }
1699
1700    case Instruction::SHL_LONG: {
1701      Binop_23x_shift<HShl>(instruction, Primitive::kPrimLong);
1702      break;
1703    }
1704
1705    case Instruction::SHR_INT: {
1706      Binop_23x_shift<HShr>(instruction, Primitive::kPrimInt);
1707      break;
1708    }
1709
1710    case Instruction::SHR_LONG: {
1711      Binop_23x_shift<HShr>(instruction, Primitive::kPrimLong);
1712      break;
1713    }
1714
1715    case Instruction::USHR_INT: {
1716      Binop_23x_shift<HUShr>(instruction, Primitive::kPrimInt);
1717      break;
1718    }
1719
1720    case Instruction::USHR_LONG: {
1721      Binop_23x_shift<HUShr>(instruction, Primitive::kPrimLong);
1722      break;
1723    }
1724
1725    case Instruction::OR_INT: {
1726      Binop_23x<HOr>(instruction, Primitive::kPrimInt);
1727      break;
1728    }
1729
1730    case Instruction::OR_LONG: {
1731      Binop_23x<HOr>(instruction, Primitive::kPrimLong);
1732      break;
1733    }
1734
1735    case Instruction::XOR_INT: {
1736      Binop_23x<HXor>(instruction, Primitive::kPrimInt);
1737      break;
1738    }
1739
1740    case Instruction::XOR_LONG: {
1741      Binop_23x<HXor>(instruction, Primitive::kPrimLong);
1742      break;
1743    }
1744
1745    case Instruction::ADD_LONG_2ADDR: {
1746      Binop_12x<HAdd>(instruction, Primitive::kPrimLong);
1747      break;
1748    }
1749
1750    case Instruction::ADD_DOUBLE_2ADDR: {
1751      Binop_12x<HAdd>(instruction, Primitive::kPrimDouble);
1752      break;
1753    }
1754
1755    case Instruction::ADD_FLOAT_2ADDR: {
1756      Binop_12x<HAdd>(instruction, Primitive::kPrimFloat);
1757      break;
1758    }
1759
1760    case Instruction::SUB_INT_2ADDR: {
1761      Binop_12x<HSub>(instruction, Primitive::kPrimInt);
1762      break;
1763    }
1764
1765    case Instruction::SUB_LONG_2ADDR: {
1766      Binop_12x<HSub>(instruction, Primitive::kPrimLong);
1767      break;
1768    }
1769
1770    case Instruction::SUB_FLOAT_2ADDR: {
1771      Binop_12x<HSub>(instruction, Primitive::kPrimFloat);
1772      break;
1773    }
1774
1775    case Instruction::SUB_DOUBLE_2ADDR: {
1776      Binop_12x<HSub>(instruction, Primitive::kPrimDouble);
1777      break;
1778    }
1779
1780    case Instruction::MUL_INT_2ADDR: {
1781      Binop_12x<HMul>(instruction, Primitive::kPrimInt);
1782      break;
1783    }
1784
1785    case Instruction::MUL_LONG_2ADDR: {
1786      Binop_12x<HMul>(instruction, Primitive::kPrimLong);
1787      break;
1788    }
1789
1790    case Instruction::MUL_FLOAT_2ADDR: {
1791      Binop_12x<HMul>(instruction, Primitive::kPrimFloat);
1792      break;
1793    }
1794
1795    case Instruction::MUL_DOUBLE_2ADDR: {
1796      Binop_12x<HMul>(instruction, Primitive::kPrimDouble);
1797      break;
1798    }
1799
1800    case Instruction::DIV_INT_2ADDR: {
1801      BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
1802                         dex_pc, Primitive::kPrimInt, false, true);
1803      break;
1804    }
1805
1806    case Instruction::DIV_LONG_2ADDR: {
1807      BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
1808                         dex_pc, Primitive::kPrimLong, false, true);
1809      break;
1810    }
1811
1812    case Instruction::REM_INT_2ADDR: {
1813      BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
1814                         dex_pc, Primitive::kPrimInt, false, false);
1815      break;
1816    }
1817
1818    case Instruction::REM_LONG_2ADDR: {
1819      BuildCheckedDivRem(instruction.VRegA(), instruction.VRegA(), instruction.VRegB(),
1820                         dex_pc, Primitive::kPrimLong, false, false);
1821      break;
1822    }
1823
1824    case Instruction::REM_FLOAT_2ADDR: {
1825      Binop_12x<HRem>(instruction, Primitive::kPrimFloat, dex_pc);
1826      break;
1827    }
1828
1829    case Instruction::REM_DOUBLE_2ADDR: {
1830      Binop_12x<HRem>(instruction, Primitive::kPrimDouble, dex_pc);
1831      break;
1832    }
1833
1834    case Instruction::SHL_INT_2ADDR: {
1835      Binop_12x_shift<HShl>(instruction, Primitive::kPrimInt);
1836      break;
1837    }
1838
1839    case Instruction::SHL_LONG_2ADDR: {
1840      Binop_12x_shift<HShl>(instruction, Primitive::kPrimLong);
1841      break;
1842    }
1843
1844    case Instruction::SHR_INT_2ADDR: {
1845      Binop_12x_shift<HShr>(instruction, Primitive::kPrimInt);
1846      break;
1847    }
1848
1849    case Instruction::SHR_LONG_2ADDR: {
1850      Binop_12x_shift<HShr>(instruction, Primitive::kPrimLong);
1851      break;
1852    }
1853
1854    case Instruction::USHR_INT_2ADDR: {
1855      Binop_12x_shift<HUShr>(instruction, Primitive::kPrimInt);
1856      break;
1857    }
1858
1859    case Instruction::USHR_LONG_2ADDR: {
1860      Binop_12x_shift<HUShr>(instruction, Primitive::kPrimLong);
1861      break;
1862    }
1863
1864    case Instruction::DIV_FLOAT_2ADDR: {
1865      Binop_12x<HDiv>(instruction, Primitive::kPrimFloat, dex_pc);
1866      break;
1867    }
1868
1869    case Instruction::DIV_DOUBLE_2ADDR: {
1870      Binop_12x<HDiv>(instruction, Primitive::kPrimDouble, dex_pc);
1871      break;
1872    }
1873
1874    case Instruction::AND_INT_2ADDR: {
1875      Binop_12x<HAnd>(instruction, Primitive::kPrimInt);
1876      break;
1877    }
1878
1879    case Instruction::AND_LONG_2ADDR: {
1880      Binop_12x<HAnd>(instruction, Primitive::kPrimLong);
1881      break;
1882    }
1883
1884    case Instruction::OR_INT_2ADDR: {
1885      Binop_12x<HOr>(instruction, Primitive::kPrimInt);
1886      break;
1887    }
1888
1889    case Instruction::OR_LONG_2ADDR: {
1890      Binop_12x<HOr>(instruction, Primitive::kPrimLong);
1891      break;
1892    }
1893
1894    case Instruction::XOR_INT_2ADDR: {
1895      Binop_12x<HXor>(instruction, Primitive::kPrimInt);
1896      break;
1897    }
1898
1899    case Instruction::XOR_LONG_2ADDR: {
1900      Binop_12x<HXor>(instruction, Primitive::kPrimLong);
1901      break;
1902    }
1903
1904    case Instruction::ADD_INT_LIT16: {
1905      Binop_22s<HAdd>(instruction, false);
1906      break;
1907    }
1908
1909    case Instruction::AND_INT_LIT16: {
1910      Binop_22s<HAnd>(instruction, false);
1911      break;
1912    }
1913
1914    case Instruction::OR_INT_LIT16: {
1915      Binop_22s<HOr>(instruction, false);
1916      break;
1917    }
1918
1919    case Instruction::XOR_INT_LIT16: {
1920      Binop_22s<HXor>(instruction, false);
1921      break;
1922    }
1923
1924    case Instruction::RSUB_INT: {
1925      Binop_22s<HSub>(instruction, true);
1926      break;
1927    }
1928
1929    case Instruction::MUL_INT_LIT16: {
1930      Binop_22s<HMul>(instruction, false);
1931      break;
1932    }
1933
1934    case Instruction::ADD_INT_LIT8: {
1935      Binop_22b<HAdd>(instruction, false);
1936      break;
1937    }
1938
1939    case Instruction::AND_INT_LIT8: {
1940      Binop_22b<HAnd>(instruction, false);
1941      break;
1942    }
1943
1944    case Instruction::OR_INT_LIT8: {
1945      Binop_22b<HOr>(instruction, false);
1946      break;
1947    }
1948
1949    case Instruction::XOR_INT_LIT8: {
1950      Binop_22b<HXor>(instruction, false);
1951      break;
1952    }
1953
1954    case Instruction::RSUB_INT_LIT8: {
1955      Binop_22b<HSub>(instruction, true);
1956      break;
1957    }
1958
1959    case Instruction::MUL_INT_LIT8: {
1960      Binop_22b<HMul>(instruction, false);
1961      break;
1962    }
1963
1964    case Instruction::DIV_INT_LIT16:
1965    case Instruction::DIV_INT_LIT8: {
1966      BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
1967                         dex_pc, Primitive::kPrimInt, true, true);
1968      break;
1969    }
1970
1971    case Instruction::REM_INT_LIT16:
1972    case Instruction::REM_INT_LIT8: {
1973      BuildCheckedDivRem(instruction.VRegA(), instruction.VRegB(), instruction.VRegC(),
1974                         dex_pc, Primitive::kPrimInt, true, false);
1975      break;
1976    }
1977
1978    case Instruction::SHL_INT_LIT8: {
1979      Binop_22b<HShl>(instruction, false);
1980      break;
1981    }
1982
1983    case Instruction::SHR_INT_LIT8: {
1984      Binop_22b<HShr>(instruction, false);
1985      break;
1986    }
1987
1988    case Instruction::USHR_INT_LIT8: {
1989      Binop_22b<HUShr>(instruction, false);
1990      break;
1991    }
1992
1993    case Instruction::NEW_INSTANCE: {
1994      uint16_t type_index = instruction.VRegB_21c();
1995      if (compiler_driver_->IsStringTypeIndex(type_index, dex_file_)) {
1996        // Turn new-instance of string into a const 0.
1997        int32_t register_index = instruction.VRegA();
1998        HNullConstant* constant = graph_->GetNullConstant();
1999        UpdateLocal(register_index, constant);
2000      } else {
2001        QuickEntrypointEnum entrypoint = NeedsAccessCheck(type_index)
2002            ? kQuickAllocObjectWithAccessCheck
2003            : kQuickAllocObject;
2004
2005        current_block_->AddInstruction(new (arena_) HNewInstance(
2006            dex_pc, type_index, *dex_compilation_unit_->GetDexFile(), entrypoint));
2007        UpdateLocal(instruction.VRegA(), current_block_->GetLastInstruction());
2008      }
2009      break;
2010    }
2011
2012    case Instruction::NEW_ARRAY: {
2013      uint16_t type_index = instruction.VRegC_22c();
2014      HInstruction* length = LoadLocal(instruction.VRegB_22c(), Primitive::kPrimInt);
2015      QuickEntrypointEnum entrypoint = NeedsAccessCheck(type_index)
2016          ? kQuickAllocArrayWithAccessCheck
2017          : kQuickAllocArray;
2018      current_block_->AddInstruction(new (arena_) HNewArray(
2019          length, dex_pc, type_index, *dex_compilation_unit_->GetDexFile(), entrypoint));
2020      UpdateLocal(instruction.VRegA_22c(), current_block_->GetLastInstruction());
2021      break;
2022    }
2023
2024    case Instruction::FILLED_NEW_ARRAY: {
2025      uint32_t number_of_vreg_arguments = instruction.VRegA_35c();
2026      uint32_t type_index = instruction.VRegB_35c();
2027      uint32_t args[5];
2028      instruction.GetVarArgs(args);
2029      BuildFilledNewArray(dex_pc, type_index, number_of_vreg_arguments, false, args, 0);
2030      break;
2031    }
2032
2033    case Instruction::FILLED_NEW_ARRAY_RANGE: {
2034      uint32_t number_of_vreg_arguments = instruction.VRegA_3rc();
2035      uint32_t type_index = instruction.VRegB_3rc();
2036      uint32_t register_index = instruction.VRegC_3rc();
2037      BuildFilledNewArray(
2038          dex_pc, type_index, number_of_vreg_arguments, true, nullptr, register_index);
2039      break;
2040    }
2041
2042    case Instruction::FILL_ARRAY_DATA: {
2043      BuildFillArrayData(instruction, dex_pc);
2044      break;
2045    }
2046
2047    case Instruction::MOVE_RESULT:
2048    case Instruction::MOVE_RESULT_WIDE:
2049    case Instruction::MOVE_RESULT_OBJECT:
2050      UpdateLocal(instruction.VRegA(), latest_result_);
2051      latest_result_ = nullptr;
2052      break;
2053
2054    case Instruction::CMP_LONG: {
2055      Binop_23x_cmp(instruction, Primitive::kPrimLong, HCompare::kNoBias);
2056      break;
2057    }
2058
2059    case Instruction::CMPG_FLOAT: {
2060      Binop_23x_cmp(instruction, Primitive::kPrimFloat, HCompare::kGtBias);
2061      break;
2062    }
2063
2064    case Instruction::CMPG_DOUBLE: {
2065      Binop_23x_cmp(instruction, Primitive::kPrimDouble, HCompare::kGtBias);
2066      break;
2067    }
2068
2069    case Instruction::CMPL_FLOAT: {
2070      Binop_23x_cmp(instruction, Primitive::kPrimFloat, HCompare::kLtBias);
2071      break;
2072    }
2073
2074    case Instruction::CMPL_DOUBLE: {
2075      Binop_23x_cmp(instruction, Primitive::kPrimDouble, HCompare::kLtBias);
2076      break;
2077    }
2078
2079    case Instruction::NOP:
2080      break;
2081
2082    case Instruction::IGET:
2083    case Instruction::IGET_WIDE:
2084    case Instruction::IGET_OBJECT:
2085    case Instruction::IGET_BOOLEAN:
2086    case Instruction::IGET_BYTE:
2087    case Instruction::IGET_CHAR:
2088    case Instruction::IGET_SHORT: {
2089      if (!BuildInstanceFieldAccess(instruction, dex_pc, false)) {
2090        return false;
2091      }
2092      break;
2093    }
2094
2095    case Instruction::IPUT:
2096    case Instruction::IPUT_WIDE:
2097    case Instruction::IPUT_OBJECT:
2098    case Instruction::IPUT_BOOLEAN:
2099    case Instruction::IPUT_BYTE:
2100    case Instruction::IPUT_CHAR:
2101    case Instruction::IPUT_SHORT: {
2102      if (!BuildInstanceFieldAccess(instruction, dex_pc, true)) {
2103        return false;
2104      }
2105      break;
2106    }
2107
2108    case Instruction::SGET:
2109    case Instruction::SGET_WIDE:
2110    case Instruction::SGET_OBJECT:
2111    case Instruction::SGET_BOOLEAN:
2112    case Instruction::SGET_BYTE:
2113    case Instruction::SGET_CHAR:
2114    case Instruction::SGET_SHORT: {
2115      if (!BuildStaticFieldAccess(instruction, dex_pc, false)) {
2116        return false;
2117      }
2118      break;
2119    }
2120
2121    case Instruction::SPUT:
2122    case Instruction::SPUT_WIDE:
2123    case Instruction::SPUT_OBJECT:
2124    case Instruction::SPUT_BOOLEAN:
2125    case Instruction::SPUT_BYTE:
2126    case Instruction::SPUT_CHAR:
2127    case Instruction::SPUT_SHORT: {
2128      if (!BuildStaticFieldAccess(instruction, dex_pc, true)) {
2129        return false;
2130      }
2131      break;
2132    }
2133
2134#define ARRAY_XX(kind, anticipated_type)                                          \
2135    case Instruction::AGET##kind: {                                               \
2136      BuildArrayAccess(instruction, dex_pc, false, anticipated_type);         \
2137      break;                                                                      \
2138    }                                                                             \
2139    case Instruction::APUT##kind: {                                               \
2140      BuildArrayAccess(instruction, dex_pc, true, anticipated_type);          \
2141      break;                                                                      \
2142    }
2143
2144    ARRAY_XX(, Primitive::kPrimInt);
2145    ARRAY_XX(_WIDE, Primitive::kPrimLong);
2146    ARRAY_XX(_OBJECT, Primitive::kPrimNot);
2147    ARRAY_XX(_BOOLEAN, Primitive::kPrimBoolean);
2148    ARRAY_XX(_BYTE, Primitive::kPrimByte);
2149    ARRAY_XX(_CHAR, Primitive::kPrimChar);
2150    ARRAY_XX(_SHORT, Primitive::kPrimShort);
2151
2152    case Instruction::ARRAY_LENGTH: {
2153      HInstruction* object = LoadLocal(instruction.VRegB_12x(), Primitive::kPrimNot);
2154      // No need for a temporary for the null check, it is the only input of the following
2155      // instruction.
2156      object = new (arena_) HNullCheck(object, dex_pc);
2157      current_block_->AddInstruction(object);
2158      current_block_->AddInstruction(new (arena_) HArrayLength(object));
2159      UpdateLocal(instruction.VRegA_12x(), current_block_->GetLastInstruction());
2160      break;
2161    }
2162
2163    case Instruction::CONST_STRING: {
2164      current_block_->AddInstruction(
2165          new (arena_) HLoadString(graph_->GetCurrentMethod(), instruction.VRegB_21c(), dex_pc));
2166      UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
2167      break;
2168    }
2169
2170    case Instruction::CONST_STRING_JUMBO: {
2171      current_block_->AddInstruction(
2172          new (arena_) HLoadString(graph_->GetCurrentMethod(), instruction.VRegB_31c(), dex_pc));
2173      UpdateLocal(instruction.VRegA_31c(), current_block_->GetLastInstruction());
2174      break;
2175    }
2176
2177    case Instruction::CONST_CLASS: {
2178      uint16_t type_index = instruction.VRegB_21c();
2179      bool type_known_final;
2180      bool type_known_abstract;
2181      bool dont_use_is_referrers_class;
2182      // `CanAccessTypeWithoutChecks` will tell whether the method being
2183      // built is trying to access its own class, so that the generated
2184      // code can optimize for this case. However, the optimization does not
2185      // work for inlining, so we use `IsOutermostCompilingClass` instead.
2186      bool can_access = compiler_driver_->CanAccessTypeWithoutChecks(
2187          dex_compilation_unit_->GetDexMethodIndex(), *dex_file_, type_index,
2188          &type_known_final, &type_known_abstract, &dont_use_is_referrers_class);
2189      if (!can_access) {
2190        MaybeRecordStat(MethodCompilationStat::kNotCompiledCantAccesType);
2191        return false;
2192      }
2193      current_block_->AddInstruction(new (arena_) HLoadClass(
2194          graph_->GetCurrentMethod(),
2195          type_index,
2196          *dex_compilation_unit_->GetDexFile(),
2197          IsOutermostCompilingClass(type_index),
2198          dex_pc));
2199      UpdateLocal(instruction.VRegA_21c(), current_block_->GetLastInstruction());
2200      break;
2201    }
2202
2203    case Instruction::MOVE_EXCEPTION: {
2204      current_block_->AddInstruction(new (arena_) HLoadException());
2205      UpdateLocal(instruction.VRegA_11x(), current_block_->GetLastInstruction());
2206      break;
2207    }
2208
2209    case Instruction::THROW: {
2210      HInstruction* exception = LoadLocal(instruction.VRegA_11x(), Primitive::kPrimNot);
2211      current_block_->AddInstruction(new (arena_) HThrow(exception, dex_pc));
2212      // A throw instruction must branch to the exit block.
2213      current_block_->AddSuccessor(exit_block_);
2214      // We finished building this block. Set the current block to null to avoid
2215      // adding dead instructions to it.
2216      current_block_ = nullptr;
2217      break;
2218    }
2219
2220    case Instruction::INSTANCE_OF: {
2221      uint8_t destination = instruction.VRegA_22c();
2222      uint8_t reference = instruction.VRegB_22c();
2223      uint16_t type_index = instruction.VRegC_22c();
2224      if (!BuildTypeCheck(instruction, destination, reference, type_index, dex_pc)) {
2225        return false;
2226      }
2227      break;
2228    }
2229
2230    case Instruction::CHECK_CAST: {
2231      uint8_t reference = instruction.VRegA_21c();
2232      uint16_t type_index = instruction.VRegB_21c();
2233      if (!BuildTypeCheck(instruction, -1, reference, type_index, dex_pc)) {
2234        return false;
2235      }
2236      break;
2237    }
2238
2239    case Instruction::MONITOR_ENTER: {
2240      current_block_->AddInstruction(new (arena_) HMonitorOperation(
2241          LoadLocal(instruction.VRegA_11x(), Primitive::kPrimNot),
2242          HMonitorOperation::kEnter,
2243          dex_pc));
2244      break;
2245    }
2246
2247    case Instruction::MONITOR_EXIT: {
2248      current_block_->AddInstruction(new (arena_) HMonitorOperation(
2249          LoadLocal(instruction.VRegA_11x(), Primitive::kPrimNot),
2250          HMonitorOperation::kExit,
2251          dex_pc));
2252      break;
2253    }
2254
2255    case Instruction::PACKED_SWITCH: {
2256      BuildPackedSwitch(instruction, dex_pc);
2257      break;
2258    }
2259
2260    case Instruction::SPARSE_SWITCH: {
2261      BuildSparseSwitch(instruction, dex_pc);
2262      break;
2263    }
2264
2265    default:
2266      VLOG(compiler) << "Did not compile "
2267                     << PrettyMethod(dex_compilation_unit_->GetDexMethodIndex(), *dex_file_)
2268                     << " because of unhandled instruction "
2269                     << instruction.Name();
2270      MaybeRecordStat(MethodCompilationStat::kNotCompiledUnhandledInstruction);
2271      return false;
2272  }
2273  return true;
2274}  // NOLINT(readability/fn_size)
2275
2276HLocal* HGraphBuilder::GetLocalAt(int register_index) const {
2277  return locals_.Get(register_index);
2278}
2279
2280void HGraphBuilder::UpdateLocal(int register_index, HInstruction* instruction) const {
2281  HLocal* local = GetLocalAt(register_index);
2282  current_block_->AddInstruction(new (arena_) HStoreLocal(local, instruction));
2283}
2284
2285HInstruction* HGraphBuilder::LoadLocal(int register_index, Primitive::Type type) const {
2286  HLocal* local = GetLocalAt(register_index);
2287  current_block_->AddInstruction(new (arena_) HLoadLocal(local, type));
2288  return current_block_->GetLastInstruction();
2289}
2290
2291}  // namespace art
2292