Home
last modified time | relevance | path

Searched refs:exit_block_ (Results 1 – 5 of 5) sorted by relevance

/art/compiler/optimizing/
Dloop_optimization_test.cc45 exit_block_ = new (&allocator_) HBasicBlock(graph_); in BuildGraph()
48 graph_->AddBlock(exit_block_); in BuildGraph()
50 graph_->SetExitBlock(exit_block_); in BuildGraph()
57 exit_block_->AddInstruction(new (&allocator_) HExit()); in BuildGraph()
59 return_block_->AddSuccessor(exit_block_); in BuildGraph()
112 HBasicBlock* exit_block_; member in art::LoopOptimizationTest
Dnodes_vector_test.cc40 exit_block_ = new (&allocator_) HBasicBlock(graph_); in BuildGraph()
42 graph_->AddBlock(exit_block_); in BuildGraph()
44 graph_->SetExitBlock(exit_block_); in BuildGraph()
58 HBasicBlock* exit_block_; member in art::NodesVectorTest
Dinduction_var_range_test.cc64 exit_block_ = new (&allocator_) HBasicBlock(graph_); in BuildGraph()
66 graph_->AddBlock(exit_block_); in BuildGraph()
68 graph_->SetExitBlock(exit_block_); in BuildGraph()
100 return_block->AddSuccessor(exit_block_); in BuildLoop()
118 exit_block_->AddInstruction(new (&allocator_) HExit()); in BuildLoop()
309 HBasicBlock* exit_block_; member in art::InductionVarRangeTest
738 HInstruction* exit = exit_block_->GetLastInstruction(); in TEST_F()
790 HInstruction* exit = exit_block_->GetLastInstruction(); in TEST_F()
Dnodes.cc417 if (successor == exit_block_) { in SimplifyCFG()
2205 exit_block_->ReplaceWith(to); in InlineInto()
2233 if (current != exit_block_ && current != entry_block_ && current != first) { in InlineInto()
Dnodes.h321 exit_block_(nullptr), in arena_()
362 HBasicBlock* GetExitBlock() const { return exit_block_; } in GetExitBlock()
363 bool HasExitBlock() const { return exit_block_ != nullptr; } in HasExitBlock()
366 void SetExitBlock(HBasicBlock* block) { exit_block_ = block; } in SetExitBlock()
644 HBasicBlock* exit_block_; variable