Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dgraph_checker_test.cc105 graph->GetExitBlock()->RemovePredecessor(graph->GetEntryBlock()); in TEST_F()
121 HBasicBlock* exit_block = graph->GetExitBlock(); in TEST_F()
Dblock_builder.cc192 block->AddSuccessor(graph_->GetExitBlock()); in ConnectBasicBlocks()
221 graph_->AddBlock(graph_->GetExitBlock()); in ConnectBasicBlocks()
Dcode_sinking.cc29 HBasicBlock* exit = graph_->GetExitBlock(); in Run()
Ddead_code_elimination.cc234 HBasicBlock* exit = graph_->GetExitBlock(); in SimplifyAlwaysThrows()
Dgraph_visualizer.cc795 GetGraph()->HasExitBlock() ? GetGraph()->GetExitBlock()->GetBlockId() : -1, in DumpDisassemblyBlockForSlowPaths()
Dinliner.cc1903 HBasicBlock* exit_block = callee_graph->GetExitBlock(); in TryBuildAndInlineHelper()
1921 } else if (graph_->GetExitBlock() == nullptr) { in TryBuildAndInlineHelper()
Dinstruction_builder.cc462 DCHECK_EQ(current_block_->GetSingleSuccessor(), graph_->GetExitBlock()); in BuildIntrinsic()
463 current_block_ = graph_->GetExitBlock(); in BuildIntrinsic()
Dbounds_check_elimination.cc1339 HBasicBlock* exit = GetGraph()->GetExitBlock(); in AddComparesWithDeoptimization()
Dregister_allocator_graph_color.cc83 if (block->Dominates(block->GetGraph()->GetExitBlock())) { in CostForMoveAt()
Dnodes.cc2556 predecessor->ReplaceSuccessor(to, outer_graph->GetExitBlock()); in InlineInto()
Dnodes.h373 HBasicBlock* GetExitBlock() const { return exit_block_; } in GetExitBlock() function
1012 return graph_->GetExitBlock() == this; in IsExitBlock()