| /src/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | CodeMoverUtils.h | 24 class DominatorTree; variable
32 const DominatorTree &DT,
39 const DominatorTree &DT,
44 DominatorTree &DT,
52 DominatorTree &DT,
59 DominatorTree &DT,
66 DominatorTree &DT, const PostDominatorTree &PDT,
75 const DominatorTree *DT,
80 const DominatorTree *DT, const PostDominatorTree *PDT);
|
| H A D | SimplifyIndVar.h | 26 class DominatorTree; variable
38 const DominatorTree *DT = nullptr;
46 const DominatorTree *getDomTree() const { return DT; } in getDomTree()
56 DominatorTree *DT, LoopInfo *LI,
64 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
85 DominatorTree *DT, SmallVectorImpl<WeakTrackingVH> &DeadInsts,
|
| H A D | LoopUtils.h | 55 BasicBlock *InsertPreheaderForLoop(Loop *L, DominatorTree *DT, LoopInfo *LI,
63 bool formDedicatedExitBlocks(Loop *L, DominatorTree *DT, LoopInfo *LI,
85 SmallVectorImpl<Instruction *> &Worklist, const DominatorTree &DT,
102 bool formLCSSA(Loop &L, const DominatorTree &DT, const LoopInfo *LI,
114 bool formLCSSARecursively(Loop &L, const DominatorTree &DT, const LoopInfo *LI,
153 bool sinkRegion(DomTreeNode *, AAResults *, LoopInfo *, DominatorTree *,
162 DominatorTree *, TargetLibraryInfo *,
177 bool hoistRegion(DomTreeNode *, AAResults *, LoopInfo *, DominatorTree *,
199 void deleteDeadLoop(Loop *L, DominatorTree *DT, ScalarEvolution *SE,
205 void breakLoopBackedge(Loop *L, DominatorTree &DT, ScalarEvolution &SE,
[all …]
|
| H A D | UnrollLoop.h | 30 class DominatorTree; variable
81 ScalarEvolution *SE, DominatorTree *DT,
91 LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT, AssumptionCache *AC,
98 DominatorTree *DT, AssumptionCache *AC,
103 bool isSafeToUnrollAndJam(Loop *L, ScalarEvolution &SE, DominatorTree &DT,
107 ScalarEvolution *SE, DominatorTree *DT,
153 DominatorTree &DT, LoopInfo *LI, AssumptionCache *AC,
|
| H A D | AssumeBundleBuilder.h | 28 class DominatorTree; variable
47 DominatorTree *DT = nullptr);
54 DominatorTree *DT = nullptr);
74 DominatorTree *DT);
|
| /src/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DomPrinter.cpp | 28 void DominatorTree::viewGraph(const Twine &Name, const Twine &Title) { in viewGraph()
36 void DominatorTree::viewGraph() { in viewGraph()
46 static DominatorTree *getGraph(DominatorTreeWrapperPass *DTWP) { in getGraph()
53 DominatorTreeWrapperPass, false, DominatorTree *,
58 DominatorTreeWrapperPass, false, DominatorTree *, in DomViewerWrapperPass()
66 DominatorTreeWrapperPass, true, DominatorTree *,
71 DominatorTreeWrapperPass, true, DominatorTree *, in DomOnlyViewerWrapperPass()
135 DominatorTreeWrapperPass, false, DominatorTree *,
140 DominatorTreeWrapperPass, false, DominatorTree *, in DomPrinterWrapperPass()
148 DominatorTreeWrapperPass, true, DominatorTree *,
[all …]
|
| /src/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | Dominators.h | 162 class DominatorTree : public DominatorTreeBase<BasicBlock, false> {
166 DominatorTree() = default;
167 explicit DominatorTree(Function &F) { recalculate(F); }
168 explicit DominatorTree(DominatorTree &DT, DomTreeBuilder::BBUpdates U) {
265 template <> struct GraphTraits<DominatorTree*>
267 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }
269 static nodes_iterator nodes_begin(DominatorTree *N) {
273 static nodes_iterator nodes_end(DominatorTree *N) {
285 using Result = DominatorTree;
288 DominatorTree run(Function &F, FunctionAnalysisManager &);
[all …]
|
| /src/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | Loads.h | 24 class DominatorTree; variable
38 const DominatorTree *DT = nullptr,
49 const DominatorTree *DT = nullptr,
60 const DominatorTree *DT = nullptr,
75 const DominatorTree *DT = nullptr,
86 ScalarEvolution &SE, DominatorTree &DT,
92 DominatorTree *DT, AssumptionCache *AC);
106 const DominatorTree *DT = nullptr,
|
| H A D | DomTreeUpdater.h | 31 : public GenericDomTreeUpdater<DomTreeUpdater, DominatorTree,
33 friend GenericDomTreeUpdater<DomTreeUpdater, DominatorTree,
38 GenericDomTreeUpdater<DomTreeUpdater, DominatorTree, PostDominatorTree>;
119 extern template class GenericDomTreeUpdater<DomTreeUpdater, DominatorTree,
123 GenericDomTreeUpdater<DomTreeUpdater, DominatorTree,
|
| H A D | PHITransAddr.h | 21 class DominatorTree; variable
79 const DominatorTree *DT, bool MustDominate);
89 const DominatorTree &DT,
101 const DominatorTree *DT);
109 BasicBlock *PredBB, const DominatorTree &DT,
|
| H A D | MemorySSAUpdater.h | 45 class DominatorTree; variable
115 DominatorTree &DT);
118 ArrayRef<std::unique_ptr<ValueToValueMapTy>> VMaps, DominatorTree &DT);
123 void applyUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT,
126 void applyInsertUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT);
287 DominatorTree &DT);
288 void applyInsertUpdates(ArrayRef<CFGUpdate>, DominatorTree &DT,
|
| H A D | CFG.h | 24 class DominatorTree; variable
72 const DominatorTree *DT = nullptr, const LoopInfo *LI = nullptr);
83 const DominatorTree *DT = nullptr, const LoopInfo *LI = nullptr);
97 const DominatorTree *DT = nullptr, const LoopInfo *LI = nullptr);
109 const DominatorTree *DT = nullptr, const LoopInfo *LI = nullptr);
|
| H A D | ValueTracking.h | 36 class DominatorTree; variable
61 const DominatorTree *DT = nullptr,
68 const DominatorTree *DT = nullptr,
76 const DominatorTree *DT = nullptr,
123 const DominatorTree *DT = nullptr,
171 const DominatorTree *DT = nullptr,
196 const DominatorTree *DT = nullptr,
206 const DominatorTree *DT = nullptr);
521 const Instruction *CxtI = nullptr, const DominatorTree *DT = nullptr,
828 const DominatorTree *DT = nullptr,
[all …]
|
| H A D | BasicAliasAnalysis.h | 27 class DominatorTree; variable
48 DominatorTree *DT_;
50 DominatorTree *getDT(const AAQueryInfo &AAQI) const { in getDT()
57 DominatorTree *DT = nullptr)
108 AssumptionCache *AC, DominatorTree *DT);
120 DominatorTree *DT, const AAQueryInfo &AAQI);
|
| /src/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopFuse.cpp | 181 DominatorTree &DT;
186 FusionCandidate(Loop *L, DominatorTree &DT, const PostDominatorTree *PDT, in FusionCandidate()
398 const DominatorTree *DT = &(LHS.DT); in operator ()()
571 DominatorTree &DT;
580 LoopFuser(LoopInfo &LI, DominatorTree &DT, DependenceInfo &DI, in LoopFuser()
823 SmallVector<DominatorTree::UpdateType, 8> TreeUpdates; in peelFusionCandidate()
829 DominatorTree::UpdateType(DominatorTree::Delete, Pred, BB)); in peelFusionCandidate()
1613 SmallVector<DominatorTree::UpdateType, 8> TreeUpdates; in performFusion()
1635 TreeUpdates.emplace_back(DominatorTree::UpdateType( in performFusion()
1636 DominatorTree::Delete, FC0.ExitingBlock, FC1.Preheader)); in performFusion()
[all …]
|
| H A D | SimplifyCFGPass.cpp | 88 std::vector<DominatorTree::UpdateType> *Updates) { in performBlockTailMerging()
153 Updates->push_back({DominatorTree::Insert, BB, CanonicalBB}); in performBlockTailMerging()
214 std::vector<DominatorTree::UpdateType> Updates; in tailMergeBlocksWithSimilarFunctionTerminators()
271 DominatorTree *DT, in simplifyFunctionCFGImpl()
300 DominatorTree *DT, in simplifyFunctionCFG()
303 (DT && DT->verify(DominatorTree::VerificationLevel::Full))) && in simplifyFunctionCFG()
309 (DT && DT->verify(DominatorTree::VerificationLevel::Full))) && in simplifyFunctionCFG()
369 DominatorTree *DT = nullptr; in run()
401 DominatorTree *DT = nullptr; in runOnFunction()
|
| /src/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUUnifyDivergentExitNodes.cpp | 71 bool run(Function &F, DominatorTree *DT, const PostDominatorTree &PDT,
161 std::vector<DominatorTree::UpdateType> Updates; in unifyReturnBlockSet()
172 Updates.emplace_back(DominatorTree::Insert, BB, NewRetBlock); in unifyReturnBlockSet()
188 bool AMDGPUUnifyDivergentExitNodesImpl::run(Function &F, DominatorTree *DT, in run()
207 std::vector<DominatorTree::UpdateType> Updates; in run()
242 Updates.emplace_back(DominatorTree::Insert, BB, DummyReturnBB); in run()
253 Updates.emplace_back(DominatorTree::Insert, BB, TransitionBB); in run()
255 Updates.emplace_back(DominatorTree::Insert, TransitionBB, Successor); in run()
256 Updates.emplace_back(DominatorTree::Delete, BB, Successor); in run()
263 Updates.emplace_back(DominatorTree::Insert, BB, DummyReturnBB); in run()
[all …]
|
| /src/contrib/llvm-project/llvm/lib/IR/ |
| H A D | Dominators.cpp | 113 bool DominatorTree::invalidate(Function &F, const PreservedAnalyses &PA, in invalidate()
122 bool DominatorTree::dominates(const BasicBlock *BB, const Use &U) const { in dominates()
135 bool DominatorTree::dominates(const Value *DefV, in dominates()
174 bool DominatorTree::dominates(const Instruction *Def, in dominates()
200 bool DominatorTree::dominates(const BasicBlockEdge &BBE, in dominates()
250 bool DominatorTree::dominates(const BasicBlockEdge &BBE, const Use &U) const { in dominates()
268 bool DominatorTree::dominates(const Value *DefV, const Use &U) const { in dominates()
321 bool DominatorTree::isReachableFromEntry(const Use &U) const { in isReachableFromEntry()
337 bool DominatorTree::dominates(const BasicBlockEdge &BBE1, in dominates()
344 Instruction *DominatorTree::findNearestCommonDominator(Instruction *I1, in findNearestCommonDominator()
[all …]
|
| /src/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | CallBrPrepare.cpp | 57 static bool SplitCriticalEdges(ArrayRef<CallBrInst *> CBRs, DominatorTree &DT);
59 DominatorTree &DT);
60 static void UpdateSSA(DominatorTree &DT, CallBrInst *CBR, CallInst *Intrinsic,
118 bool SplitCriticalEdges(ArrayRef<CallBrInst *> CBRs, DominatorTree &DT) { in SplitCriticalEdges()
140 bool InsertIntrinsicCalls(ArrayRef<CallBrInst *> CBRs, DominatorTree &DT) { in InsertIntrinsicCalls()
173 static void PrintDebugDomInfo(const DominatorTree &DT, const Use &U, in PrintDebugDomInfo()
185 void UpdateSSA(DominatorTree &DT, CallBrInst *CBR, CallInst *Intrinsic, in UpdateSSA()
236 DominatorTree *DT; in runOnFunction()
237 std::optional<DominatorTree> LazilyComputedDomTree; in runOnFunction()
|
| H A D | IndirectBrExpandPass.cpp | 178 SmallVector<DominatorTree::UpdateType, 8> Updates; in runImpl()
184 Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB}); in runImpl()
216 SmallVector<DominatorTree::UpdateType, 8> Updates; in runImpl()
227 Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB}); in runImpl()
249 Updates.push_back({DominatorTree::Insert, IBr->getParent(), SwitchBB}); in runImpl()
251 Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB}); in runImpl()
272 Updates.push_back({DominatorTree::Insert, SwitchBB, BB}); in runImpl()
|
| /src/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | LoopExtractor.cpp | 61 function_ref<DominatorTree &(Function &)> LookupDomTree, in LoopExtractor()
73 function_ref<DominatorTree &(Function &)> LookupDomTree;
80 DominatorTree &DT);
81 bool extractLoop(Loop *L, LoopInfo &LI, DominatorTree &DT);
117 auto LookupDomTree = [this](Function &F) -> DominatorTree & { in runOnModule()
176 DominatorTree &DT = LookupDomTree(F); in runOnFunction()
221 LoopInfo &LI, DominatorTree &DT) { in extractLoops()
239 bool LoopExtractor::extractLoop(Loop *L, LoopInfo &LI, DominatorTree &DT) { in extractLoop()
263 auto LookupDomTree = [&FAM](Function &F) -> DominatorTree & { in run()
|
| /src/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopIdiomVectorize.cpp | 91 DominatorTree *DT;
104 LoopIdiomVectorize(LoopIdiomVectorizeStyle S, unsigned VF, DominatorTree *DT, in LoopIdiomVectorize()
402 DTU.applyUpdates({{DominatorTree::Insert, VectorLoopPreheaderBlock, in createMaskedFindMismatch()
434 {{DominatorTree::Insert, VectorLoopStartBlock, VectorLoopMismatchBlock}, in createMaskedFindMismatch()
435 {DominatorTree::Insert, VectorLoopStartBlock, VectorLoopIncBlock}}); in createMaskedFindMismatch()
457 {{DominatorTree::Insert, VectorLoopIncBlock, VectorLoopStartBlock}, in createMaskedFindMismatch()
458 {DominatorTree::Insert, VectorLoopIncBlock, EndBlock}}); in createMaskedFindMismatch()
495 DTU.applyUpdates({{DominatorTree::Insert, VectorLoopPreheaderBlock, in createPredicatedFindMismatch()
547 {{DominatorTree::Insert, VectorLoopStartBlock, VectorLoopMismatchBlock}, in createPredicatedFindMismatch()
548 {DominatorTree::Insert, VectorLoopStartBlock, VectorLoopIncBlock}}); in createPredicatedFindMismatch()
[all …]
|
| /src/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | MatrixUtils.cpp | 52 {DominatorTree::Delete, Preheader, Tmp}, in CreateLoop()
53 {DominatorTree::Insert, Header, Body}, in CreateLoop()
54 {DominatorTree::Insert, Body, Latch}, in CreateLoop()
55 {DominatorTree::Insert, Latch, Header}, in CreateLoop()
56 {DominatorTree::Insert, Latch, Exit}, in CreateLoop()
57 {DominatorTree::Insert, Preheader, Header}, in CreateLoop()
|
| H A D | BasicBlockUtils.cpp | 64 SmallVectorImpl<DominatorTree::UpdateType> *Updates, in detachDeadBlocks()
73 Updates->push_back({DominatorTree::Delete, BB, Succ}); in detachDeadBlocks()
112 SmallVector<DominatorTree::UpdateType, 4> Updates; in DeleteDeadBlocks()
184 DominatorTree *DT) { in MergeBlockIntoPredecessor()
249 std::vector<DominatorTree::UpdateType> Updates; in MergeBlockIntoPredecessor()
267 Updates.push_back({DominatorTree::Insert, PredBB, SuccOfBB}); in MergeBlockIntoPredecessor()
271 Updates.push_back({DominatorTree::Delete, BB, SuccOfBB}); in MergeBlockIntoPredecessor()
272 Updates.push_back({DominatorTree::Delete, PredBB, BB}); in MergeBlockIntoPredecessor()
761 BasicBlock *llvm::SplitEdge(BasicBlock *BB, BasicBlock *Succ, DominatorTree *DT, in SplitEdge()
914 SmallVector<DominatorTree::UpdateType, 3> Updates; in ehAwareSplitEdge()
[all …]
|
| H A D | CodeMoverUtils.cpp | 64 const DominatorTree &DT,
95 static bool domTreeLevelBefore(DominatorTree *DT, const Instruction *InstA, in domTreeLevelBefore()
110 const DominatorTree &DT, in collectControlConditions()
232 const DominatorTree &DT, in isControlFlowEquivalent()
238 const DominatorTree &DT, in isControlFlowEquivalent()
313 DominatorTree &DT, const PostDominatorTree *PDT, in isSafeToMoveBefore()
413 DominatorTree &DT, const PostDominatorTree *PDT, in isSafeToMoveBefore()
425 DominatorTree &DT, in moveInstructionsToTheBeginning()
438 DominatorTree &DT, in moveInstructionsToTheEnd()
451 const DominatorTree *DT, in nonStrictlyPostDominate()
[all …]
|