Home
last modified time | relevance | path

Searched refs:IsIrreducible (Results 1 - 25 of 34) sorted by relevance

12

/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/regalloc/
H A Dcleanup_empty_blocks.cpp45 bool badLoop = bb->GetLoop()->IsIrreducible(); in TryRemoveEmptyBlock()
/arkcompiler/runtime_core/compiler/optimizer/ir/
H A Dbasicblock.cpp202 ASSERT(GetLoop()->IsIrreducible() == irr_loop); in RemoveEmptyBlock()
236 ASSERT(!loop->IsIrreducible()); in RemoveFixLoopInfo()
288 if (loop->IsIrreducible()) { in JoinSuccessorBlock()
328 if (loop->IsIrreducible()) { in SelectsFixLoopInfo()
744 if (IsLoopHeader() && loop->IsIrreducible()) { in InvalidateLoopIfIrreducible()
H A Dgraph_checker.cpp358 ASSERT(loop->IsIrreducible() || loop->IsRoot() || loop->GetHeader() != nullptr); in MarkBlocksInLoop()
359 ASSERT(loop->IsIrreducible() || loop->IsRoot() || loop->IsTryCatchLoop() || loop->GetPreHeader() != nullptr); in MarkBlocksInLoop()
394 ASSERT_DO(loop->IsTryCatchLoop() || loop->IsIrreducible(), in CheckLoopHasSafePoint()
422 if (!loop->IsIrreducible()) { in CheckLoops()
477 if (loop->IsIrreducible()) { in CheckLoopAnalysis()
478 ASSERT(expected_loop->IsIrreducible()); in CheckLoopAnalysis()
H A Dgraph_cloner.cpp94 if (!loop->IsRoot() && !loop->IsIrreducible() && !loop->IsTryCatchLoop()) { in CopyLoop()
108 cloned_loop->SetIsIrreducible(loop->IsIrreducible()); in CopyLoop()
/arkcompiler/runtime_core/compiler/tests/
H A Dloop_analyzer_test.cpp184 EXPECT_EQ(loop1->IsIrreducible(), false); in TEST_F()
192 EXPECT_EQ(loop2->IsIrreducible(), false); in TEST_F()
200 EXPECT_EQ(loop3->IsIrreducible(), false); in TEST_F()
H A Dcompiler_basicblock_test.cpp338 EXPECT_TRUE(loop.IsIrreducible()); in HWTEST_F()
354 EXPECT_TRUE(loop2.IsIrreducible()); in HWTEST_F()
H A Dloop_analyzer_new_test.cpp156 EXPECT_TRUE(loop.IsIrreducible()); in HWTEST_F()
/arkcompiler/runtime_core/compiler/optimizer/analysis/
H A Dloop_analyzer.cpp211 } else if (!loop->IsIrreducible()) { in FindAndInsertPreHeaders()
241 if (loop->IsIrreducible()) { in PopulateLoops()
409 if (loop->IsIrreducible()) { in IsLoopSingleBackEdgeExitPoint()
H A Dloop_analyzer.h140 bool IsIrreducible() const in IsIrreducible() function in panda::compiler::final
/arkcompiler/runtime_core/static_core/compiler/optimizer/analysis/
H A Dloop_analyzer.cpp210 } else if (!loop->IsIrreducible()) { in FindAndInsertPreHeaders()
274 if (loop->IsIrreducible()) { in PopulateLoops()
456 if (loop->IsIrreducible()) { in IsLoopSingleBackEdgeExitPoint()
H A Dloop_analyzer.h134 bool IsIrreducible() const in IsIrreducible() function in ark::compiler::final
H A Dcountable_loop_parser.cpp36 if (loop_.IsIrreducible() || loop_.IsOsrLoop() || loop_.IsTryCatchLoop() || loop_.GetBackEdges().size() != 1 || in Parse()
/arkcompiler/runtime_core/compiler/optimizer/ir_builder/
H A Dinst_builder.cpp78 } else if (current_bb_->IsLoopHeader() && !current_bb_->GetLoop()->IsIrreducible()) { in UpdateDefs()
93 ASSERT(current_bb_->GetLoop()->IsIrreducible()); in UpdateDefs()
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/
H A Dloop_transform.h52 if (loop->IsIrreducible()) { in IsSupportedLoopType()
H A Dlse.cpp369 ASSERT(!loop->IsIrreducible()); in LoopDoElimination()
673 if (loop->IsIrreducible()) { in CanEliminateInstruction()
716 if (loop->IsIrreducible() || loop->IsOsrLoop() || loop->IsTryCatchLoop()) { in MergeHeapValuesForLoop()
818 if (block->GetLoop()->IsIrreducible() || block->IsCatch() || in ProcessHeapValues()
1063 ASSERT(!loop->IsIrreducible()); in ApplyHoistToCandidate()
1077 if (loop->IsIrreducible() || loop->IsOsrLoop()) { in TryToHoistLoadFromLoop()
H A Dcode_sink.cpp199 if (candLoop->IsIrreducible()) { in IsAcceptableTarget()
H A Dlicm.cpp81 if (loop.IsIrreducible()) { in IsLoopVisited()
H A Dlicm_conditions.cpp45 if (loop->IsRoot() || loop->IsIrreducible()) { in MarkHoistableInst()
/arkcompiler/runtime_core/static_core/compiler/optimizer/ir/
H A Dbasicblock.cpp629 ASSERT(GetLoop()->IsIrreducible() == irrLoop);
663 ASSERT(!loop->IsIrreducible());
720 if (loop->IsIrreducible() || GetGraph()->IsThrowApplied()) {
958 if (loop->IsIrreducible()) {
1452 if (loop->IsIrreducible()) {
H A Dloop_unswitcher.cpp36 ASSERT(!loop->IsIrreducible()); in UnswitchLoop()
H A Dgraph_checker.cpp619 CHECKER_IF_NOT_PRINT(loop->IsIrreducible() || loop->IsRoot() || loop->GetHeader() != nullptr); in CheckUserOfInt32()
620 CHECKER_IF_NOT_PRINT(loop->IsIrreducible() || loop->IsRoot() || loop->IsTryCatchLoop() || in CheckUserOfInt32()
667 CHECKER_DO_IF_NOT_AND_PRINT(loop->IsTryCatchLoop() || loop->IsIrreducible() || it != loop->GetBlocks().end(), in CheckUserOfInt32()
696 CHECKER_IF_NOT_PRINT(loop->IsTryCatchLoop() || loop->IsIrreducible() || in CheckUserOfInt32()
711 if (!loop->IsIrreducible()) { in CheckUserOfInt32()
762 CHECKER_DO_IF_NOT_AND_PRINT(loop->IsIrreducible() || block->GetFalseSuccessor()->GetLoop() == loop || in CheckUserOfInt32()
777 if (loop->IsIrreducible()) { in CheckUserOfInt32()
778 CHECKER_IF_NOT_PRINT(expectedLoop->IsIrreducible()); in CheckUserOfInt32()
H A Dgraph_cloner.cpp93 if (!loop->IsRoot() && !loop->IsIrreducible() && !loop->IsTryCatchLoop()) { in CopyLoop()
107 clonedLoop->SetIsIrreducible(loop->IsIrreducible()); in CopyLoop()
/arkcompiler/runtime_core/static_core/compiler/tests/
H A Dloop_analyzer_test.cpp217 EXPECT_EQ(loop1->IsIrreducible(), false); in TEST_F()
225 EXPECT_EQ(loop2->IsIrreducible(), false); in TEST_F()
233 EXPECT_EQ(loop3->IsIrreducible(), false); in TEST_F()
/arkcompiler/runtime_core/static_core/compiler/optimizer/ir_builder/
H A Dinst_builder.cpp332 ASSERT(currentBb_->GetLoop()->IsIrreducible()); in UpdateDefsForPreds()
349 } else if (currentBb_->IsLoopHeader() && !currentBb_->GetLoop()->IsIrreducible()) { in UpdateDefs()
/arkcompiler/runtime_core/static_core/plugins/ets/compiler/optimizer/optimizations/interop_js/
H A Dinterop_intrinsic_optimization.cpp239 if (forbidden || loop->IsIrreducible()) { in FindForbiddenLoops()
276 return block->GetLoop()->IsIrreducible() || (block->IsLoopHeader() && forbiddenLoops_.count(block->GetLoop()) > 0); in IsForbiddenLoopEntry()

Completed in 27 milliseconds

12