Home
last modified time | relevance | path

Searched refs:GetNormalSuccessors (Results 1 – 7 of 7) sorted by relevance

/art/compiler/optimizing/
Dregister_allocation_resolver.cc190 DCHECK_EQ(predecessor->GetNormalSuccessors().size(), 1u); in Resolve()
484 if (from->GetNormalSuccessors().size() == 1) { in ConnectSplitSiblings()
634 DCHECK_EQ(block->GetNormalSuccessors().size(), 1u); in InsertParallelMoveAtExitOf()
Dcode_sinking.cc356 ends_with_try_boundary_entry ? block->GetNormalSuccessors() : in SinkCodeToUncommonBranch()
Dgraph_checker.cc198 for (HBasicBlock* successor : block->GetNormalSuccessors()) { in VisitBasicBlock()
230 for (HBasicBlock* successor : block->GetNormalSuccessors()) { in VisitBasicBlock()
Dgraph_visualizer.cc292 for (HBasicBlock* successor : block->GetNormalSuccessors()) { in PrintSuccessors()
Dnodes.cc748 ArrayRef<HBasicBlock* const> normal_successors = block->GetNormalSuccessors(); in SimplifyCFG()
760 normal_successors = block->GetNormalSuccessors(); in SimplifyCFG()
2287 ArrayRef<HBasicBlock* const> HBasicBlock::GetNormalSuccessors() const { in GetNormalSuccessors() function in art::HBasicBlock
Dload_store_elimination_test.cc1287 if (loop_entry->GetNormalSuccessors()[1] != loop_body) { in TEST_F()
1416 if (loop_entry->GetNormalSuccessors()[1] != loop_body) { in TEST_F()
Dnodes.h1114 ArrayRef<HBasicBlock* const> GetNormalSuccessors() const;