Home
last modified time | relevance | path

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

/aosp12/art/compiler/optimizing/
H A Dgraph_checker_test.cc105 graph->GetExitBlock()->RemovePredecessor(graph->GetEntryBlock()); in TEST_F()
121 HBasicBlock* exit_block = graph->GetExitBlock(); in TEST_F()
H A Dexecution_subgraph.cc173 if (cur_block == graph_->GetExitBlock()) { in Prune()
226 blk != graph_->GetExitBlock() && in Prune()
H A Dblock_builder.cc192 block->AddSuccessor(graph_->GetExitBlock()); in ConnectBasicBlocks()
221 graph_->AddBlock(graph_->GetExitBlock()); in ConnectBasicBlocks()
H A Dcode_sinking.cc29 HBasicBlock* exit = graph_->GetExitBlock(); in Run()
H A Ddead_code_elimination.cc234 HBasicBlock* exit = graph_->GetExitBlock(); in SimplifyAlwaysThrows()
H A Dinliner.cc1764 HBasicBlock* exit_block = callee_graph->GetExitBlock(); in CanInlineBody()
1782 } else if (graph_->GetExitBlock() == nullptr) { in CanInlineBody()
H A Dexecution_subgraph_test.cc58 if (cur == graph->GetExitBlock()) { in CalculateValidity()
H A Dgraph_visualizer.cc851 GetGraph()->HasExitBlock() ? GetGraph()->GetExitBlock()->GetBlockId() : -1, in DumpDisassemblyBlockForSlowPaths()
H A Dinstruction_builder.cc506 DCHECK_EQ(current_block_->GetSingleSuccessor(), graph_->GetExitBlock()); in BuildIntrinsic()
507 current_block_ = graph_->GetExitBlock(); in BuildIntrinsic()
H A Dbounds_check_elimination.cc1440 HBasicBlock* exit = GetGraph()->GetExitBlock(); in AddComparesWithDeoptimization()
H A Dregister_allocator_graph_color.cc83 if (block->Dominates(block->GetGraph()->GetExitBlock())) { in CostForMoveAt()
H A Dnodes.cc2831 predecessor->ReplaceSuccessor(to, outer_graph->GetExitBlock()); in InlineInto()
H A Dnodes.h449 HBasicBlock* GetExitBlock() const { return exit_block_; } in GetExitBlock() function
1125 return graph_->GetExitBlock() == this; in IsExitBlock()