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

/art/compiler/optimizing/
H A Dgraph_checker_test.cc105 graph->GetExitBlock()->RemovePredecessor(graph->GetEntryBlock());
121 HBasicBlock* exit_block = graph->GetExitBlock();
H A Dblock_builder.cc192 block->AddSuccessor(graph_->GetExitBlock());
221 graph_->AddBlock(graph_->GetExitBlock());
H A Dcode_sinking.cc29 HBasicBlock* exit = graph_->GetExitBlock();
H A Ddead_code_elimination.cc234 HBasicBlock* exit = graph_->GetExitBlock();
H A Dgraph_visualizer.cc752 GetGraph()->HasExitBlock() ? GetGraph()->GetExitBlock()->GetBlockId() : -1,
H A Dinliner.cc1844 HBasicBlock* exit_block = callee_graph->GetExitBlock();
1862 } else if (graph_->GetExitBlock() == nullptr) {
H A Dbounds_check_elimination.cc1337 HBasicBlock* exit = GetGraph()->GetExitBlock();
H A Dregister_allocator_graph_color.cc83 if (block->Dominates(block->GetGraph()->GetExitBlock())) {
H A Dinstruction_builder.cc468 DCHECK_EQ(current_block_->GetSingleSuccessor(), graph_->GetExitBlock());
469 current_block_ = graph_->GetExitBlock();
H A Dnodes.h367 HBasicBlock* GetExitBlock() const { return exit_block_; } function in class:art::HGraph
988 return graph_->GetExitBlock() == this;
H A Dnodes.cc2510 predecessor->ReplaceSuccessor(to, outer_graph->GetExitBlock());

Completed in 140 milliseconds