/art/compiler/optimizing/ |
H A D | licm_test.cc | 32 graph_ = CreateGraph(&allocator_); 40 entry_ = new (&allocator_) HBasicBlock(graph_); 41 loop_preheader_ = new (&allocator_) HBasicBlock(graph_); 42 loop_header_ = new (&allocator_) HBasicBlock(graph_); 43 loop_body_ = new (&allocator_) HBasicBlock(graph_); 44 return_ = new (&allocator_) HBasicBlock(graph_); 45 exit_ = new (&allocator_) HBasicBlock(graph_); 47 graph_->AddBlock(entry_); 48 graph_->AddBlock(loop_preheader_); 49 graph_ 88 HGraph* graph_; member in class:art::LICMTest [all...] |
H A D | builder.cc | 74 DCHECK(graph_->GetBlocks().empty()); 76 graph_->SetNumberOfVRegs(code_item_.registers_size_); 77 graph_->SetNumberOfInVRegs(code_item_.ins_size_); 78 graph_->SetMaximumNumberOfOutVRegs(code_item_.outs_size_); 79 graph_->SetHasTryCatch(code_item_.tries_size_ != 0); 94 GraphAnalysisResult result = graph_->BuildDominatorTree();
|
H A D | dead_code_elimination.cc | 92 if (graph_->HasIrreducibleLoops()) { 99 ArenaAllocator* allocator = graph_->GetArena(); 100 ArenaBitVector live_blocks(allocator, graph_->GetBlocks().size(), false, kArenaAllocDCE); 102 MarkReachableBlocks(graph_, &live_blocks); 109 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) { 126 graph_->ClearLoopInformation(); 127 graph_->ClearDominanceInformation(); 128 graph_->BuildDominatorTree(); 130 graph_->ClearDominanceInformation(); 131 graph_ [all...] |
H A D | bounds_check_elimination_test.cc | 37 graph_ = CreateGraph(&allocator_); 38 graph_->SetHasBoundsChecks(true); 44 graph_->BuildDominatorTree(); 46 InstructionSimplifier(graph_).Run(); 48 SideEffectsAnalysis side_effects(graph_); 51 GVNOptimization(graph_, side_effects).Run(); 53 HInductionVarAnalysis induction(graph_); 56 BoundsCheckElimination(graph_, side_effects, &induction).Run(); 61 HGraph* graph_; member in class:art::BoundsCheckEliminationTest 69 HBasicBlock* entry = new (&allocator_) HBasicBlock(graph_); [all...] |
H A D | optimization.h | 34 : graph_(graph), 49 HGraph* const graph_; member in class:art::HOptimization
|
H A D | block_builder.cc | 31 block = new (arena_) HBasicBlock(graph_, semantic_dex_pc); 121 HBasicBlock* block = graph_->GetEntryBlock(); 122 graph_->AddBlock(block); 138 graph_->AddBlock(block); 158 block->AddSuccessor(graph_->GetExitBlock()); 170 graph_->AddBlock(block); 187 graph_->AddBlock(graph_->GetExitBlock()); 214 DCHECK(!graph_->GetEntryBlock()->GetSuccessors().empty()) 251 for (HBasicBlock* block : graph_ [all...] |
H A D | side_effects_analysis.h | 30 graph_(graph), 49 HGraph* graph_; member in class:art::SideEffectsAnalysis
|
H A D | side_effects_analysis.cc | 24 block_effects_.resize(graph_->GetBlocks().size()); 25 loop_effects_.resize(graph_->GetBlocks().size()); 29 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { 41 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
|
H A D | induction_var_analysis_test.cc | 33 graph_ = CreateGraph(&allocator_); 41 loop_preheader_[d] = new (&allocator_) HBasicBlock(graph_); 42 graph_->AddBlock(loop_preheader_[d]); 43 loop_header_[d] = new (&allocator_) HBasicBlock(graph_); 44 graph_->AddBlock(loop_header_[d]); 49 loop_body_[d] = new (&allocator_) HBasicBlock(graph_); 50 graph_->AddBlock(loop_body_[d]); 65 graph_->SetNumberOfVRegs(n + 3); 68 entry_ = new (&allocator_) HBasicBlock(graph_); 69 graph_ 177 HGraph* graph_; member in class:art::InductionVarAnalysisTest [all...] |
H A D | constant_folding_test.cc | 38 graph_ = CreateGraph(&allocator_); 47 graph_ = CreateCFG(&allocator_, data, return_type); 58 ASSERT_NE(graph_, nullptr); 60 StringPrettyPrinter printer_before(graph_); 67 x86::CodeGeneratorX86 codegenX86(graph_, *features_x86.get(), CompilerOptions()); 68 HConstantFolding(graph_).Run(); 69 GraphChecker graph_checker_cf(graph_); 73 StringPrettyPrinter printer_after_cf(graph_); 78 check_after_cf(graph_); 80 HDeadCodeElimination(graph_) 93 HGraph* graph_; member in class:art::ConstantFoldingTest [all...] |
H A D | inliner.cc | 66 if (graph_->IsDebuggable()) { 71 const ArenaVector<HBasicBlock*>& blocks = graph_->GetReversePostOrder(); 303 ArtMethod* caller = graph_->GetArtMethod(); 350 HInstanceFieldGet* result = new (graph_->GetArena()) HInstanceFieldGet( 413 ReferenceTypePropagation rtp_fixup(graph_, 437 HLoadClass* load_class = new (graph_->GetArena()) HLoadClass(graph_->GetCurrentMethod(), 445 HNotEqual* compare = new (graph_->GetArena()) HNotEqual(load_class, receiver_class); 455 HDeoptimize* deoptimize = new (graph_->GetArena()) HDeoptimize( 542 ReferenceTypePropagation rtp_fixup(graph_, [all...] |
H A D | builder.h | 47 : graph_(graph), 73 : graph_(graph), 103 HGraph* const graph_; member in class:art::HGraphBuilder
|
H A D | ssa_builder.h | 53 : graph_(graph), 60 graph_->InitializeInexactObjectRTI(handles); 117 HGraph* graph_; member in class:art::SsaBuilder
|
H A D | block_builder.h | 33 graph_(graph), 42 // Creates basic blocks in `graph_` at branch target dex_pc positions of the 72 HGraph* const graph_; member in class:art::HBasicBlockBuilder
|
H A D | ssa_phi_elimination.cc | 34 ArenaSet<HPhi*> initially_live(graph_->GetArena()->Adapter(kArenaAllocSsaPhiElimination)); 37 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { 45 bool keep_alive = (graph_->IsDebuggable() && phi->HasEnvironmentUses()); 87 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) { 124 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { 131 ArenaBitVector visited_phis_in_cycle(graph_->GetArena(), 132 graph_->GetCurrentInstructionId(), 135 ArenaVector<HPhi*> cycle_worklist(graph_->GetArena()->Adapter(kArenaAllocSsaPhiElimination));
|
H A D | reference_type_propagation_test.cc | 33 graph_ = CreateGraph(&allocator_); 39 graph_->InitializeInexactObjectRTI(handles); 40 propagation_ = new (&allocator_) ReferenceTypePropagation(graph_, 71 HGraph* graph_; member in class:art::ReferenceTypePropagationTest 86 EXPECT_TRUE(graph_->GetInexactObjectRti().IsEqual(ObjectType(false)));
|
H A D | ssa_builder.cc | 28 for (HReversePostOrderIterator itb(*graph_); !itb.Done(); itb.Advance()) { 53 equality_instr->ReplaceInput(graph_->GetNullConstant(), int_operand == right ? 1 : 0); 60 for (HReversePostOrderIterator itb(*graph_); !itb.Done(); itb.Advance()) { 82 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { 236 ArenaVector<HPhi*> worklist(graph_->GetArena()->Adapter(kArenaAllocGraphBuilder)); 238 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { 322 ArenaVector<HPhi*> worklist(graph_->GetArena()->Adapter(kArenaAllocGraphBuilder)); 437 if (graph_->IsDebuggable()) { 451 new_instance->ReplaceWith(graph_->GetNullConstant()); 482 DCHECK(!graph_ [all...] |
H A D | instruction_simplifier_arm.h | 52 InstructionSimplifierArmVisitor visitor(graph_, stats_);
|
H A D | licm.cc | 86 visited = new (graph_->GetArena()) ArenaBitVector(graph_->GetArena(), 87 graph_->GetBlocks().size(), 93 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
|
H A D | ssa_liveness_analysis.cc | 72 ArenaVector<uint32_t> forward_predecessors(graph_->GetBlocks().size(), 73 graph_->GetArena()->Adapter(kArenaAllocSsaLiveness)); 74 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { 87 graph_->linear_order_.reserve(graph_->GetReversePostOrder().size()); 88 ArenaVector<HBasicBlock*> worklist(graph_->GetArena()->Adapter(kArenaAllocSsaLiveness)); 89 worklist.push_back(graph_->GetEntryBlock()); 93 graph_->linear_order_.push_back(current); 117 for (HLinearOrderIterator it(*graph_); !it.Done(); it.Advance()) { 129 LiveInterval::MakeInterval(graph_ [all...] |
H A D | dex_cache_array_fixups_arm.cc | 101 if (graph_->HasIrreducibleLoops()) { 106 DexCacheArrayFixupsVisitor visitor(graph_);
|
H A D | induction_var_range_test.cc | 36 graph_(CreateGraph(&allocator_)), 37 iva_(new (&allocator_) HInductionVarAnalysis(graph_)), 57 graph_->SetNumberOfVRegs(1); 58 entry_block_ = new (&allocator_) HBasicBlock(graph_); 59 exit_block_ = new (&allocator_) HBasicBlock(graph_); 60 graph_->AddBlock(entry_block_); 61 graph_->AddBlock(exit_block_); 62 graph_->SetEntryBlock(entry_block_); 63 graph_->SetExitBlock(exit_block_); 65 x_ = new (&allocator_) HParameterValue(graph_ 243 HGraph* graph_; member in class:art::InductionVarRangeTest [all...] |
H A D | sharpening.cc | 38 for (HBasicBlock* block : graph_->GetReversePostOrder()) { 64 MethodReference target_method(&graph_->GetDexFile(), invoke->GetDexMethodIndex()); 110 DCHECK_EQ(target_method.dex_file, &graph_->GetDexFile()); 115 &graph_->GetDexFile()); 141 if (graph_->IsDebuggable()) {
|
H A D | instruction_builder.cc | 38 const size_t vregs = graph_->GetNumberOfVRegs(); 81 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { 92 DCHECK_EQ(current_locals_->size(), graph_->GetNumberOfVRegs()) 208 graph_->GetDexFile(), 209 graph_->GetMethodIdx(), 211 graph_->GetInvokeType(), 261 locals_for_.resize(graph_->GetBlocks().size(), 276 for (HReversePostOrderIterator block_it(*graph_); !block_it.Done(); block_it.Advance()) { 432 uint16_t number_of_parameters = graph_->GetNumberOfInVRegs(); 433 uint16_t locals_index = graph_ [all...] |
H A D | optimizing_cfi_test.cc | 47 graph_(nullptr), 55 graph_ = CreateGraph(&allocator_); 57 code_gen_ = CodeGenerator::Create(graph_, isa, *isa_features_, opts_); 143 HGraph* graph_; member in class:art::OptimizingCFITest
|