Home
last modified time | relevance | path

Searched refs:code_item_accessor_ (Results 1 – 11 of 11) sorted by relevance

/art/compiler/optimizing/
Dbuilder.cc50 code_item_accessor_(accessor), in HGraphBuilder()
66 code_item_accessor_(accessor), in HGraphBuilder()
86 const uint32_t code_units = code_item_accessor_.InsnsSizeInCodeUnits(); in SkipCompilation()
108 DCHECK(code_item_accessor_.HasCodeItem()); in BuildGraph()
111 graph_->SetNumberOfVRegs(code_item_accessor_.RegistersSize()); in BuildGraph()
112 graph_->SetNumberOfInVRegs(code_item_accessor_.InsSize()); in BuildGraph()
113 graph_->SetMaximumNumberOfOutVRegs(code_item_accessor_.OutsSize()); in BuildGraph()
114 graph_->SetHasTryCatch(code_item_accessor_.TriesSize() != 0); in BuildGraph()
118 HBasicBlockBuilder block_builder(graph_, dex_file_, code_item_accessor_, &local_allocator); in BuildGraph()
128 code_item_accessor_, in BuildGraph()
[all …]
Dblock_builder.cc34 code_item_accessor_(accessor), in HBasicBlockBuilder()
36 branch_targets_(code_item_accessor_.HasCodeItem() in HBasicBlockBuilder()
37 ? code_item_accessor_.InsnsSizeInCodeUnits() in HBasicBlockBuilder()
66 if (code_item_accessor_.TriesSize() != 0) { in CreateBranchTargets()
71 for (const dex::TryItem& try_item : code_item_accessor_.TryItems()) { in CreateBranchTargets()
75 if (dex_pc_end < code_item_accessor_.InsnsSizeInCodeUnits()) { in CreateBranchTargets()
78 } else if (dex_pc_end == code_item_accessor_.InsnsSizeInCodeUnits()) { in CreateBranchTargets()
89 const uint8_t* handlers_ptr = code_item_accessor_.GetCatchHandlerData(); in CreateBranchTargets()
102 for (const DexInstructionPcPair& pair : code_item_accessor_) { in CreateBranchTargets()
133 if (next == code_item_accessor_.end()) { in CreateBranchTargets()
[all …]
Dblock_builder.h73 CodeItemDataAccessor code_item_accessor_; // null code item for intrinsic graph. variable
Dbuilder.h62 const CodeItemDebugInfoAccessor code_item_accessor_; // null for intrinsic graph. variable
Dinstruction_builder.h300 const CodeItemDebugInfoAccessor code_item_accessor_; // null for intrinsic graph. variable
/art/runtime/
Ddex_to_dex_decompiler.cc38 : code_item_accessor_(dex_file, &code_item), in DexDecompiler()
80 const CodeItemInstructionAccessor code_item_accessor_; member in art::optimizer::DexDecompiler
94 for (const DexInstructionPcPair& pair : code_item_accessor_) { in Decompile()
/art/compiler/driver/
Ddex_compilation_unit.h118 return code_item_accessor_; in GetCodeItemAccessor()
175 const CodeItemDataAccessor code_item_accessor_; variable
Ddex_compilation_unit.cc49 code_item_accessor_(dex_file, code_item), in DexCompilationUnit()
/art/tools/veridex/
Dflow_analysis.cc34 code_item_accessor_(method.GetInstructionsAndData()), in VeriFlowAnalysis()
35 dex_registers_(code_item_accessor_.InsnsSizeInCodeUnits()), in VeriFlowAnalysis()
36 instruction_infos_(code_item_accessor_.InsnsSizeInCodeUnits()) {} in VeriFlowAnalysis()
41 new std::vector<RegisterValue>(code_item_accessor_.RegistersSize())); in SetAsBranchTarget()
66 if (code_item_accessor_.TriesSize() != 0) { in FindBranches()
76 const uint8_t* handlers_ptr = code_item_accessor_.GetCatchHandlerData(); in FindBranches()
88 for (const DexInstructionPcPair& pair : code_item_accessor_) { in FindBranches()
203 const uint16_t* insns = code_item_accessor_.Insns() + dex_pc; in AnalyzeCode()
667 uint32_t number_of_registers = code_item_accessor_.RegistersSize(); in Run()
668 uint32_t number_of_parameters = code_item_accessor_.InsSize(); in Run()
Dflow_analysis.h157 CodeItemDataAccessor code_item_accessor_; variable
/art/runtime/verifier/
Dmethod_verifier.h168 return code_item_accessor_; in CodeItem()
298 const CodeItemDataAccessor code_item_accessor_; variable