| /arkcompiler/runtime_core/compiler/optimizer/analysis/ |
| H A D | dominators_tree.cpp | 21 DominatorsTree::DominatorsTree(Graph *graph) : Analysis(graph) {} in DominatorsTree() function in panda::compiler::DominatorsTree
23 bool DominatorsTree::RunImpl() in RunImpl()
49 void DominatorsTree::AdjustImmediateDominators(BasicBlock *block) in AdjustImmediateDominators()
64 void DominatorsTree::ComputeImmediateDominators(BasicBlock *block) in ComputeImmediateDominators()
96 void DominatorsTree::Compress(BasicBlock *block) in Compress()
113 void DominatorsTree::DfsNumbering(BasicBlock *block) in DfsNumbering()
137 BasicBlock *DominatorsTree::Eval(BasicBlock *block) in Eval()
150 void DominatorsTree::Init(size_t blocks_count) in Init()
187 void DominatorsTree
[all...] |
| H A D | dominators_tree.h | 29 class DominatorsTree : public Analysis { class
33 explicit DominatorsTree(Graph *graph);
35 NO_MOVE_SEMANTIC(DominatorsTree);
36 NO_COPY_SEMANTIC(DominatorsTree);
37 ~DominatorsTree() override = default;
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/analysis/ |
| H A D | dominators_tree.cpp | 22 DominatorsTree::DominatorsTree(Graph *graph) : Analysis(graph) {} in DominatorsTree() function in ark::compiler::DominatorsTree
24 bool DominatorsTree::RunImpl() in RunImpl()
50 void DominatorsTree::AdjustImmediateDominators(BasicBlock *block) in AdjustImmediateDominators()
65 void DominatorsTree::ComputeImmediateDominators(BasicBlock *block) in ComputeImmediateDominators()
97 void DominatorsTree::Compress(BasicBlock *block) in Compress()
114 void DominatorsTree::DfsNumbering(BasicBlock *block) in DfsNumbering()
138 BasicBlock *DominatorsTree::Eval(BasicBlock *block) in Eval()
151 void DominatorsTree::Init(size_t blocksCount) in Init()
181 void DominatorsTree
[all...] |
| H A D | dominators_tree.h | 27 class DominatorsTree : public Analysis { class
31 explicit DominatorsTree(Graph *graph);
33 NO_MOVE_SEMANTIC(DominatorsTree);
34 NO_COPY_SEMANTIC(DominatorsTree);
35 ~DominatorsTree() override = default;
|
| /arkcompiler/runtime_core/compiler/tests/ |
| H A D | dom_tree_test.cpp | 62 GetGraph()->RunPass<DominatorsTree>(); in TEST_F()
64 EXPECT_TRUE(GetGraph()->IsAnalysisValid<DominatorsTree>()); in TEST_F()
144 GetGraph()->RunPass<DominatorsTree>(); in TEST_F()
145 EXPECT_TRUE(GetGraph()->IsAnalysisValid<DominatorsTree>()); in TEST_F()
167 EXPECT_FALSE(GetGraph()->IsAnalysisValid<DominatorsTree>()); in TEST_F()
171 GetGraph()->RunPass<DominatorsTree>(); in TEST_F()
299 GetGraph()->GetAnalysis<DominatorsTree>().SetValid(false); in TEST_F()
300 GetGraph()->RunPass<DominatorsTree>(); in TEST_F()
301 EXPECT_TRUE(GetGraph()->IsAnalysisValid<DominatorsTree>()); in TEST_F()
|
| H A D | dominators_tree_new_test.cpp | 60 DominatorsTree dominators_tree(graph); in HWTEST_F()
95 DominatorsTree dominators_tree(graph); in HWTEST_F()
124 EXPECT_TRUE(graph->RunPass<DominatorsTree>()); in HWTEST_F()
|
| /arkcompiler/runtime_core/static_core/compiler/tests/ |
| H A D | dom_tree_test.cpp | 63 GetGraph()->RunPass<DominatorsTree>(); in TEST_F()
65 EXPECT_TRUE(GetGraph()->IsAnalysisValid<DominatorsTree>()); in TEST_F()
149 GetGraph()->RunPass<DominatorsTree>(); in TEST_F()
150 EXPECT_TRUE(GetGraph()->IsAnalysisValid<DominatorsTree>()); in TEST_F()
165 EXPECT_FALSE(GetGraph()->IsAnalysisValid<DominatorsTree>()); in TEST_F()
169 GetGraph()->RunPass<DominatorsTree>(); in TEST_F()
302 GetGraph()->GetAnalysis<DominatorsTree>().SetValid(false); in TEST_F()
303 GetGraph()->RunPass<DominatorsTree>(); in TEST_F()
304 EXPECT_TRUE(GetGraph()->IsAnalysisValid<DominatorsTree>()); in TEST_F()
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/ |
| H A D | if_merging.cpp | 30 GetGraph()->RunPass<DominatorsTree>(); in RunImpl()
322 GetGraph()->GetAnalysis<DominatorsTree>().SetValid(true); in SplitBlock()
335 auto &domTree = GetGraph()->GetAnalysis<DominatorsTree>(); in FixDominatorsTree()
370 GetGraph()->GetAnalysis<DominatorsTree>().SetDomPair(pred, bb); in TryUpdateDominator()
380 GetGraph()->GetAnalysis<DominatorsTree>().SetValid(true); in CheckDomTreeValid()
384 GetGraph()->InvalidateAnalysis<DominatorsTree>(); in CheckDomTreeValid()
385 GetGraph()->RunPass<DominatorsTree>(); in CheckDomTreeValid()
|
| H A D | loop_peeling.cpp | 149 ASSERT(GetGraph()->IsAnalysisValid<DominatorsTree>()); in MoveLoopExitToBackEdge()
165 auto &domTree = GetGraph()->GetAnalysis<DominatorsTree>(); in MoveLoopExitToBackEdge()
|
| H A D | licm.cpp | 255 ASSERT(GetGraph()->IsAnalysisValid<DominatorsTree>()); in VisitLoop()
260 auto &domTree = GetGraph()->GetAnalysis<DominatorsTree>(); in VisitLoop()
|
| H A D | redundant_loop_elimination.cpp | 112 GetGraph()->InvalidateAnalysis<DominatorsTree>(); in InvalidateAnalyses()
|
| H A D | phi_type_resolving.cpp | 40 GetGraph()->RunPass<DominatorsTree>(); in RunImpl()
|
| /arkcompiler/runtime_core/compiler/optimizer/ |
| H A D | pass_manager.h | 32 class DominatorsTree;
73 PassTypeList<LivenessAnalyzer, LoopAnalyzer, DominatorsTree, Rpo, LinearOrder>;
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/ |
| H A D | pass_manager.h | 35 class DominatorsTree;
81 PassTypeList<LivenessAnalyzer, LoopAnalyzer, AliasAnalysis, DominatorsTree, Rpo, LinearOrder, BoundsAnalysis,
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/regalloc/ |
| H A D | cleanup_empty_blocks.cpp | 56 graph->RunPass<DominatorsTree>(); in CleanupEmptyBlocks()
|
| H A D | reg_alloc.cpp | 84 graph->InvalidateAnalysis<DominatorsTree>(); in RemoveThrowEdges()
|
| H A D | split_resolver.cpp | 136 auto &domTree = graph_->GetAnalysis<DominatorsTree>(); in ConnectSplitFromPredBlock()
|
| /arkcompiler/runtime_core/compiler/optimizer/ir/ |
| H A D | graph.cpp | 104 graph->InvalidateAnalysis<DominatorsTree>(); in InvalidateBlocksOrderAnalyzes()
257 graph->GetAnalysis<DominatorsTree>().SetValid(true); in FinishBlockRemoval()
280 ASSERT(IsAnalysisValid<DominatorsTree>() || !fix_dom_tree); in DisconnectBlock()
347 ASSERT(IsAnalysisValid<DominatorsTree>()); in RemoveEmptyBlock()
362 ASSERT(IsAnalysisValid<DominatorsTree>()); in RemoveEmptyBlockWithPhis()
|
| H A D | basicblock.cpp | 609 ASSERT(GetGraph()->IsAnalysisValid<DominatorsTree>()); in IsDominate()
624 ASSERT(GetGraph()->IsAnalysisValid<DominatorsTree>()); in CreateImmediateDominator()
626 GetGraph()->GetAnalysis<DominatorsTree>().SetValid(true); in CreateImmediateDominator()
639 ASSERT(GetGraph()->IsAnalysisValid<DominatorsTree>()); in GetDominator()
645 ASSERT(GetGraph()->IsAnalysisValid<DominatorsTree>()); in GetDominatedBlocks()
|
| H A D | graph_checker.cpp | 82 if (GetGraph()->IsAnalysisValid<DominatorsTree>()) { in Check()
85 GetGraph()->RunPass<DominatorsTree>(); in Check()
441 ASSERT(GetGraph()->GetAnalysis<DominatorsTree>().IsValid()); in CheckDomTree()
447 GetGraph()->InvalidateAnalysis<DominatorsTree>(); in CheckDomTree()
448 GetGraph()->RunPass<DominatorsTree>(); in CheckDomTree()
|
| H A D | graph_cloner.cpp | 59 ASSERT(!new_graph->IsAnalysisValid<DominatorsTree>()); in CloneAnalyses()
60 if (GetGraph()->IsAnalysisValid<DominatorsTree>()) { in CloneAnalyses()
61 new_graph->GetAnalysis<DominatorsTree>().SetValid(true); in CloneAnalyses()
589 ASSERT(GetGraph()->IsAnalysisValid<DominatorsTree>()); in CloneLoopHeader()
611 auto &dom_tree = GetGraph()->GetAnalysis<DominatorsTree>(); in CloneLoopHeader()
735 GetGraph()->RunPass<DominatorsTree>(); in CloneLoop()
|
| /arkcompiler/runtime_core/compiler/optimizer/optimizations/ |
| H A D | branch_elimination.cpp | 35 GetGraph()->RunPass<DominatorsTree>(); in RunImpl()
159 // NOTE (a.popov) DominatorsTree could be restored inplace in EliminateBranch()
160 GetGraph()->RunPass<DominatorsTree>(); in EliminateBranch()
|
| H A D | vn.cpp | 154 GetGraph()->RunPass<DominatorsTree>(); in RunImpl()
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/ir/ |
| H A D | graph.cpp | 152 graph->InvalidateAnalysis<DominatorsTree>(); in InvalidateBlocksOrderAnalyzes()
316 graph->GetAnalysis<DominatorsTree>().SetValid(true); in FinishBlockRemoval()
337 ASSERT(IsAnalysisValid<DominatorsTree>() || !fixDomTree); in DisconnectBlock()
402 ASSERT(IsAnalysisValid<DominatorsTree>()); in RemoveEmptyBlock()
415 ASSERT(IsAnalysisValid<DominatorsTree>()); in RemoveEmptyBlockWithPhis()
|
| H A D | graph_cloner.cpp | 58 ASSERT(!newGraph->IsAnalysisValid<DominatorsTree>()); in CloneAnalyses()
59 if (GetGraph()->IsAnalysisValid<DominatorsTree>()) { in CloneAnalyses()
60 newGraph->GetAnalysis<DominatorsTree>().SetValid(true); in CloneAnalyses()
623 ASSERT(GetGraph()->IsAnalysisValid<DominatorsTree>()); in CloneLoopHeader()
646 auto &domTree = GetGraph()->GetAnalysis<DominatorsTree>(); in CloneLoopHeader()
771 GetGraph()->RunPass<DominatorsTree>(); in CloneLoop()
|