Home
last modified time | relevance | path

Searched refs:NumberOfBackEdges (Results 1 – 6 of 6) sorted by relevance

/art/compiler/optimizing/
Dlinear_order.cc103 number_of_forward_predecessors -= block->GetLoopInformation()->NumberOfBackEdges(); in LinearizeGraphInternal()
Dfind_loops_test.cc315 ASSERT_EQ(1u, info->NumberOfBackEdges()); in TEST_F()
Dgraph_checker.cc713 if (loop_information->NumberOfBackEdges() == 0) { in HandleLoop()
Dsuperblock_cloner.cc358 (info->GetHeader() != block || info->NumberOfBackEdges() == 0)) { in RecalculateBackEdgesInfo()
Dnodes.cc297 successor->GetPredecessors().size() - successor->NumberOfBackEdges()) { in ComputeDominanceInformation()
520 size_t number_of_incomings = header->GetPredecessors().size() - info->NumberOfBackEdges(); in SimplifyLoop()
Dnodes.h902 size_t NumberOfBackEdges() const { in NumberOfBackEdges() function
1142 int NumberOfBackEdges() const { in NumberOfBackEdges() function
1143 return IsLoopHeader() ? loop_information_->NumberOfBackEdges() : 0; in NumberOfBackEdges()