Home
last modified time | relevance | path

Searched refs:GetSuccessors (Results 1 – 15 of 15) sorted by relevance

/art/compiler/optimizing/
Ddead_code_elimination.cc44 for (size_t i = 0, e = block->GetSuccessors().Size(); i < e; ++i) { in MarkReachableBlocks()
45 MarkReachableBlocks(block->GetSuccessors().Get(i), visited); in MarkReachableBlocks()
101 if (block->IsEntryBlock() || block->GetSuccessors().Size() != 1u) { in RemoveDeadBlocks()
105 HBasicBlock* successor = block->GetSuccessors().Get(0); in RemoveDeadBlocks()
Dboolean_simplifier.cc45 HBasicBlock* succ1 = block1->GetSuccessors().Get(0); in BlocksDoMergeTogether()
46 HBasicBlock* succ2 = block2->GetSuccessors().Get(0); in BlocksDoMergeTogether()
111 HBasicBlock* merge_block = true_block->GetSuccessors().Get(0); in TryRemovingBooleanSelection()
Dnodes.cc70 for (size_t j = 0; j < block->GetSuccessors().Size(); ++j) { in RemoveDeadBlocks()
71 block->GetSuccessors().Get(j)->RemovePredecessor(block); in RemoveDeadBlocks()
88 for (size_t i = 0; i < block->GetSuccessors().Size(); i++) { in VisitBlockForBackEdges()
89 HBasicBlock* successor = block->GetSuccessors().Get(i); in VisitBlockForBackEdges()
140 for (size_t i = 0; i < entry_block_->GetSuccessors().Size(); i++) { in ComputeDominanceInformation()
141 VisitBlockForDominatorTree(entry_block_->GetSuccessors().Get(i), entry_block_, &visits); in ComputeDominanceInformation()
179 for (size_t i = 0; i < block->GetSuccessors().Size(); i++) { in VisitBlockForDominatorTree()
180 VisitBlockForDominatorTree(block->GetSuccessors().Get(i), block, visits); in VisitBlockForDominatorTree()
265 if (block->GetSuccessors().Size() > 1) { in SimplifyCFG()
266 for (size_t j = 0; j < block->GetSuccessors().Size(); ++j) { in SimplifyCFG()
[all …]
Dgraph_test.cc102 ASSERT_EQ(false_block->GetSuccessors().Get(0), return_block); in TEST()
137 ASSERT_EQ(true_block->GetSuccessors().Get(0), return_block); in TEST()
244 ASSERT_EQ(if_instr->IfTrueSuccessor()->GetSuccessors().Size(), 1u); in TEST()
245 ASSERT_EQ(if_instr->IfTrueSuccessor()->GetSuccessors().Get(0), in TEST()
282 ASSERT_EQ(if_instr->IfFalseSuccessor()->GetSuccessors().Size(), 1u); in TEST()
283 ASSERT_EQ(if_instr->IfFalseSuccessor()->GetSuccessors().Get(0), in TEST()
Dpretty_printer.h83 const GrowableArray<HBasicBlock*>& successors = block->GetSuccessors(); in VisitBasicBlock()
134 PrintInt(current_block_->GetSuccessors().Get(0)->GetBlockId()); in VisitGoto()
Dssa_liveness_analysis.cc92 for (size_t i = 0, e = current->GetSuccessors().Size(); i < e; ++i) { in LinearizeGraph()
93 HBasicBlock* successor = current->GetSuccessors().Get(i); in LinearizeGraph()
188 for (size_t i = 0, e = block->GetSuccessors().Size(); i < e; ++i) { in ComputeLiveRanges()
189 HBasicBlock* successor = block->GetSuccessors().Get(i); in ComputeLiveRanges()
299 for (size_t i = 0, e = block.GetSuccessors().Size(); i < e; ++i) { in UpdateLiveOut()
300 HBasicBlock* successor = block.GetSuccessors().Get(i); in UpdateLiveOut()
Dsuspend_check_test.cc39 HBasicBlock* first_block = graph->GetEntryBlock()->GetSuccessors().Get(0); in TestCode()
Dgraph_checker.cc41 const GrowableArray<HBasicBlock*>& p_successors = p->GetSuccessors(); in VisitBasicBlock()
58 const GrowableArray<HBasicBlock*>& successors = block->GetSuccessors(); in VisitBasicBlock()
286 if (block->GetSuccessors().Size() > 1) { in VisitBasicBlock()
287 for (size_t j = 0; j < block->GetSuccessors().Size(); ++j) { in VisitBasicBlock()
288 HBasicBlock* successor = block->GetSuccessors().Get(j); in VisitBasicBlock()
Dgvn.cc352 if (dominator->GetSuccessors().Size() == 1) { in VisitBasicBlock()
353 DCHECK_EQ(dominator->GetSuccessors().Get(0), block); in VisitBasicBlock()
Dgraph_visualizer.cc121 for (size_t i = 0, e = block->GetSuccessors().Size(); i < e; ++i) { in PrintSuccessors()
122 HBasicBlock* successor = block->GetSuccessors().Get(i); in PrintSuccessors()
Dbounds_check_elimination.cc278 const GrowableArray<HBasicBlock*>& successors = block->GetSuccessors(); in EarlyExit()
800 HBasicBlock* dummy_block = if_block->GetSuccessors().Get(0); // True successor. in TransformLoopForDeoptimizationIfNeeded()
801 HBasicBlock* deopt_block = if_block->GetSuccessors().Get(1); // False successor. in TransformLoopForDeoptimizationIfNeeded()
848 DCHECK(deopt_block->GetSuccessors().Get(0) == pre_header); in AddDeoptimizationConstant()
855 DCHECK_EQ(deopt_block, header->GetDominator()->GetDominator()->GetSuccessors().Get(1)); in AddDeoptimizationConstant()
929 DCHECK(deopt_block->GetSuccessors().Get(0) == pre_header); in AddDeoptimizationArrayLength()
Dcodegen_test.cc564 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors().Get(0); in TEST()
670 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors().Get(0); in TEST()
736 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors().Get(0); in TEST()
Dregister_allocator.cc1421 DCHECK_EQ(block->GetSuccessors().Size(), 1u); in InsertParallelMoveAtExitOf()
1645 if (from->GetSuccessors().Size() == 1) { in ConnectSplitSiblings()
1763 DCHECK_EQ(predecessor->GetSuccessors().Size(), 1u); in Resolve()
Dnodes.h507 const GrowableArray<HBasicBlock*>& GetSuccessors() const { in GetSuccessors() function
1775 return GetBlock()->GetSuccessors().Get(0); in GetSuccessor()
1796 return GetBlock()->GetSuccessors().Get(0); in IfTrueSuccessor()
1800 return GetBlock()->GetSuccessors().Get(1); in IfFalseSuccessor()
Dcode_generator.cc157 block = block->GetSuccessors().Get(0); in FirstNonEmptyBlock()