Home
last modified time | relevance | path

Searched refs:GetRootLoop (Results 1 – 8 of 8) sorted by relevance

/arkcompiler/runtime_core/compiler/optimizer/analysis/
Dloop_analyzer.cpp30 for (auto loop : GetGraph()->GetRootLoop()->GetInnerLoops()) { in RunImpl()
33 SearchInfiniteLoops(GetGraph()->GetRootLoop()); in RunImpl()
59 ASSERT(GetGraph()->GetRootLoop() == nullptr); in CreateRootLoop()
259 auto root_loop = GetGraph()->GetRootLoop(); in PopulateLoops()
/arkcompiler/runtime_core/compiler/optimizer/ir/
Dgraph_checker.cpp411 ASSERT(GetGraph()->GetRootLoop() != nullptr); in CheckLoops()
412 ASSERT(GetGraph()->GetRootLoop()->IsRoot()); in CheckLoops()
413 ASSERT(GetGraph()->GetRootLoop()->GetHeader() == nullptr); in CheckLoops()
414 ASSERT(GetGraph()->GetRootLoop()->GetPreHeader() == nullptr); in CheckLoops()
415 auto root_loop = GetGraph()->GetRootLoop(); in CheckLoops()
471 [[maybe_unused]] auto root_loop = GetGraph()->GetRootLoop(); in CheckLoopAnalysis()
480 ASSERT_PRINT(*root_loop == *GetGraph()->GetRootLoop(), "Root loop is incorrect\n"); in CheckLoopAnalysis()
502 const auto &loops = GetGraph()->GetRootLoop()->GetInnerLoops(); in HasOuterInfiniteLoop()
Dgraph.h616 Loop *GetRootLoop() in GetRootLoop() function
620 const Loop *GetRootLoop() const in GetRootLoop() function
Dgraph_cloner.cpp80 CopyLoop(GetGraph()->GetRootLoop(), new_graph->GetRootLoop()); in CloneAnalyses()
Dgraph.cpp409 return !GetRootLoop()->GetInnerLoops().empty(); in HasLoop()
/arkcompiler/runtime_core/compiler/tests/
Ddom_tree_test.cpp165 GetGraph()->GetRootLoop()->AppendBlock(G); in TEST_F()
Dloop_analyzer_test.cpp172 auto root_loop = GetGraph()->GetRootLoop(); in TEST_F()
Dcompiler_graph_test.cpp604 EXPECT_NE(graph->GetRootLoop(), nullptr); in __anon65fffef31002()