Home
last modified time | relevance | path

Searched refs:GetSingleSuccessor (Results 1 – 10 of 10) sorted by relevance

/art/compiler/optimizing/
Dselect_generator.cc51 return block1->GetSingleSuccessor() == block2->GetSingleSuccessor(); in BlocksMergeTogether()
93 HBasicBlock* merge_block = true_block->GetSingleSuccessor(); in Run()
137 DCHECK_EQ(block->GetSingleSuccessor(), false_block); in Run()
140 DCHECK_EQ(block->GetSingleSuccessor(), merge_block); in Run()
Dsuspend_check_test.cc35 HBasicBlock* first_block = graph->GetEntryBlock()->GetSingleSuccessor(); in TestCode()
36 HBasicBlock* loop_header = first_block->GetSingleSuccessor(); in TestCode()
Dgraph_test.cc167 ASSERT_EQ(if_block->GetPredecessors()[0], entry_block->GetSingleSuccessor()); in TEST()
202 ASSERT_EQ(if_block->GetPredecessors()[0], entry_block->GetSingleSuccessor()); in TEST()
Ddead_code_elimination.cc143 HBasicBlock* successor = block->GetSingleSuccessor(); in RemoveDeadBlocks()
Dgvn.cc435 DCHECK_EQ(dominator->GetSingleSuccessor(), block); in VisitBasicBlock()
Dgraph_checker.cc515 HBasicBlock* successor = ret->GetBlock()->GetSingleSuccessor(); in VisitReturn()
525 HBasicBlock* successor = ret->GetBlock()->GetSingleSuccessor(); in VisitReturnVoid()
Dnodes.cc343 if (number_of_incomings != 1 || (GetEntryBlock()->GetSingleSuccessor() == header)) { in SimplifyLoop()
431 DCHECK_EQ(normal_successors[j]->GetSingleSuccessor(), successor); in SimplifyCFG()
1848 DCHECK_EQ(GetSingleSuccessor(), other); in MergeWith()
Dbounds_check_elimination.cc1638 HBasicBlock* new_preheader = true_block->GetSingleSuccessor(); in InsertPhiNodes()
Dinstruction_builder.cc593 return block->GetSingleSuccessor()->GetDexPc() == next_dex_pc; in IsFallthroughInstruction()
Dnodes.h983 HBasicBlock* GetSingleSuccessor() const { in GetSingleSuccessor() function
2466 return GetBlock()->GetSingleSuccessor(); in GetSuccessor()