/art/compiler/dex/quick/x86/ |
H A D | quick_assemble_x86_test.cc | 76 cu_.reset(new CompilationUnit(pool_.get(), isa_, compiler_driver_.get(), nullptr)); 78 cu_->arena.Alloc(sizeof(DexFile::CodeItem), kArenaAllocMisc)); 80 cu_->mir_graph.reset(new MIRGraph(cu_.get(), &cu_->arena)); 81 cu_->mir_graph->current_code_item_ = code_item; 82 cu_->cg.reset(QuickCompiler::GetCodeGenerator(cu_.get(), nullptr)); 96 X86Mir2Lir* m2l = static_cast<X86Mir2Lir*>(cu_->cg.get()); 102 cu_ 123 std::unique_ptr<CompilationUnit> cu_; member in class:art::QuickAssembleX86TestBase [all...] |
/art/compiler/driver/ |
H A D | dex_compilation_unit.h | 45 return cu_; 113 CompilationUnit* const cu_; member in class:art::DexCompilationUnit
|
/art/compiler/dex/ |
H A D | mir_graph_test.cc | 61 cu_.mir_graph->block_id_map_.clear(); 62 cu_.mir_graph->block_list_.clear(); 69 BasicBlock* bb = cu_.mir_graph->CreateNewBB(def->type); 81 static_cast<SuccessorBlockInfo*>(cu_.arena.Alloc(sizeof(SuccessorBlockInfo), 91 cu_.arena.Alloc(sizeof(BasicBlockDataFlow), kArenaAllocDFInfo)); 94 ASSERT_EQ(count, cu_.mir_graph->block_list_.size()); 95 cu_.mir_graph->entry_block_ = cu_.mir_graph->block_list_[1]; 96 ASSERT_EQ(kEntryBlock, cu_.mir_graph->entry_block_->block_type); 97 cu_ 158 CompilationUnit cu_; member in class:art::TopologicalSortOrderTest [all...] |
H A D | global_value_numbering.h | 58 return cu_; 212 CompilationUnit* const cu_; member in class:art::GlobalValueNumbering
|
H A D | local_value_numbering_test.cc | 95 cu_.mir_graph->ifield_lowering_infos_.clear(); 96 cu_.mir_graph->ifield_lowering_infos_.reserve(count); 105 cu_.mir_graph->ifield_lowering_infos_.push_back(field_info); 115 cu_.mir_graph->sfield_lowering_infos_.clear(); 116 cu_.mir_graph->sfield_lowering_infos_.reserve(count); 128 cu_.mir_graph->sfield_lowering_infos_.push_back(field_info); 139 mirs_ = cu_.arena.AllocArray<MIR>(count, kArenaAllocMIR); 148 ASSERT_LT(def->field_info, cu_.mir_graph->ifield_lowering_infos_.size()); 150 ASSERT_EQ(cu_.mir_graph->ifield_lowering_infos_[def->field_info].MemAccessType(), 153 ASSERT_LT(def->field_info, cu_ 232 CompilationUnit cu_; member in class:art::LocalValueNumberingTest [all...] |
H A D | mir_optimization_test.cc | 100 cu_.mir_graph->block_id_map_.clear(); 101 cu_.mir_graph->block_list_.clear(); 108 BasicBlock* bb = cu_.mir_graph->CreateNewBB(def->type); 120 static_cast<SuccessorBlockInfo*>(cu_.arena.Alloc(sizeof(SuccessorBlockInfo), 130 cu_.arena.Alloc(sizeof(BasicBlockDataFlow), kArenaAllocDFInfo)); 133 ASSERT_EQ(count, cu_.mir_graph->block_list_.size()); 134 cu_.mir_graph->entry_block_ = cu_.mir_graph->block_list_[1]; 135 ASSERT_EQ(kEntryBlock, cu_.mir_graph->entry_block_->block_type); 136 cu_ 339 CompilationUnit cu_; member in class:art::MirOptimizationTest [all...] |
H A D | global_value_numbering_test.cc | 141 cu_.mir_graph->ifield_lowering_infos_.clear(); 142 cu_.mir_graph->ifield_lowering_infos_.reserve(count); 151 cu_.mir_graph->ifield_lowering_infos_.push_back(field_info); 161 cu_.mir_graph->sfield_lowering_infos_.clear(); 162 cu_.mir_graph->sfield_lowering_infos_.reserve(count); 174 cu_.mir_graph->sfield_lowering_infos_.push_back(field_info); 184 cu_.mir_graph->block_id_map_.clear(); 185 cu_.mir_graph->block_list_.clear(); 192 BasicBlock* bb = cu_.mir_graph->CreateNewBB(def->type); 204 static_cast<SuccessorBlockInfo*>(cu_ 392 CompilationUnit cu_; member in class:art::GlobalValueNumberingTest [all...] |
H A D | gvn_dead_code_elimination_test.cc | 144 cu_.mir_graph->ifield_lowering_infos_.clear(); 145 cu_.mir_graph->ifield_lowering_infos_.reserve(count); 156 cu_.mir_graph->ifield_lowering_infos_.push_back(field_info); 166 cu_.mir_graph->sfield_lowering_infos_.clear(); 167 cu_.mir_graph->sfield_lowering_infos_.reserve(count); 181 cu_.mir_graph->sfield_lowering_infos_.push_back(field_info); 191 cu_.mir_graph->block_id_map_.clear(); 192 cu_.mir_graph->block_list_.clear(); 199 BasicBlock* bb = cu_.mir_graph->CreateNewBB(def->type); 211 static_cast<SuccessorBlockInfo*>(cu_ 502 CompilationUnit cu_; member in class:art::GvnDeadCodeEliminationTest [all...] |
H A D | type_inference.h | 428 CompilationUnit* const cu_; member in class:art::TypeInference
|
H A D | type_inference_test.cc | 249 cu_.dex_file = dex_file_.get(); 250 cu_.method_idx = dex_file_builder_.GetMethodIdx(kClassName, test_method_signature, kMethodName); 251 cu_.access_flags = is_static ? kAccStatic : 0u; 252 cu_.mir_graph->m_units_.push_back(new (cu_.mir_graph->arena_) DexCompilationUnit( 253 &cu_, cu_.class_loader, cu_.class_linker, *cu_.dex_file, nullptr /* code_item not used */, 255 cu_ 611 CompilationUnit cu_; member in class:art::TypeInferenceTest [all...] |
H A D | mir_graph.h | 1362 CompilationUnit* const cu_; member in class:art::MIRGraph
|
/art/compiler/dex/quick/ |
H A D | mir_to_lir.h | 500 : m2l_(m2l), cu_(m2l->cu_), 519 CompilationUnit* const cu_; member in class:art::Mir2Lir::LIRSlowPath 1511 return cu_; 1784 CompilationUnit* const cu_; member in class:art::Mir2Lir 1847 // The layout of the cu_->dex_file's dex cache arrays for PC-relative addressing.
|