| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/ |
| CodeMoverUtils.h | 21 class DominatorTree;
29 const DominatorTree &DT,
36 const DominatorTree &DT,
41 DominatorTree &DT,
48 DominatorTree &DT,
55 DominatorTree &DT,
62 DominatorTree &DT, const PostDominatorTree &PDT,
|
| PromoteMemToReg.h | 21 class DominatorTree;
39 void PromoteMemToReg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT,
|
| AssumeBundleBuilder.h | 27 class DominatorTree;
40 /// The DominatorTree can optionally be provided to enable cross-block
43 DominatorTree *DT = nullptr);
50 DominatorTree *DT = nullptr);
72 DominatorTree *DT);
|
| LoopRotationUtils.h | 19 class DominatorTree;
34 AssumptionCache *AC, DominatorTree *DT, ScalarEvolution *SE,
|
| SimplifyIndVar.h | 25 class DominatorTree;
37 const DominatorTree *DT = nullptr;
45 const DominatorTree *getDomTree() const { return DT; }
51 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT,
58 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
79 DominatorTree *DT, SmallVectorImpl<WeakTrackingVH> &DeadInsts,
|
| LoopSimplify.h | 46 class DominatorTree;
62 /// update \c DominatorTree, \c LoopInfo, \c ScalarEvolution and \c MemorySSA
64 bool simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, ScalarEvolution *SE,
|
| SSAUpdaterBulk.h | 28 class DominatorTree;
52 Value *computeValueAt(BasicBlock *BB, RewriteInfo &R, DominatorTree *DT);
84 void RewriteAllUses(DominatorTree *DT,
|
| UnrollLoop.h | 28 class DominatorTree;
83 ScalarEvolution *SE, DominatorTree *DT,
92 LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT, AssumptionCache *AC,
99 DominatorTree *DT, AssumptionCache *AC,
104 bool isSafeToUnrollAndJam(Loop *L, ScalarEvolution &SE, DominatorTree &DT,
108 DominatorTree &DT, LoopInfo *LI, ScalarEvolution &SE,
118 ScalarEvolution *SE, DominatorTree *DT,
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Scalar/ |
| RewriteStatepointsForGC.h | 23 class DominatorTree;
32 bool runOnFunction(Function &F, DominatorTree &, TargetTransformInfo &,
|
| AlignmentFromAssumptions.h | 25 class DominatorTree;
35 DominatorTree *DT_);
38 DominatorTree *DT = nullptr;
|
| Float2Int.h | 31 bool runImpl(Function &F, const DominatorTree &DT);
34 void findRoots(Function &F, const DominatorTree &DT);
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| DomPrinter.cpp | 52 struct DOTGraphTraits<DominatorTree*> : public DOTGraphTraits<DomTreeNode*> {
57 static std::string getGraphName(DominatorTree *DT) {
61 std::string getNodeLabel(DomTreeNode *Node, DominatorTree *G) {
83 void DominatorTree::viewGraph(const Twine &Name, const Twine &Title) {
91 void DominatorTree::viewGraph() {
101 static DominatorTree *getGraph(DominatorTreeWrapperPass *DTWP) {
107 DominatorTreeWrapperPass, false, DominatorTree *,
111 : DOTGraphTraitsViewer<DominatorTreeWrapperPass, false, DominatorTree *,
119 DominatorTreeWrapperPass, true, DominatorTree *,
123 : DOTGraphTraitsViewer<DominatorTreeWrapperPass, true, DominatorTree *,
[all...] |
| DomTreeUpdater.cpp | 26 const DominatorTree::UpdateType Update) const {
41 if (Kind == DominatorTree::Insert && !HasEdge)
45 if (Kind == DominatorTree::Delete && HasEdge)
52 const DominatorTree::UpdateType Update) const {
67 DT->applyUpdates(ArrayRef<DominatorTree::UpdateType>(I, E));
89 PDT->applyUpdates(ArrayRef<DominatorTree::UpdateType>(I, E));
230 void DomTreeUpdater::applyUpdates(ArrayRef<DominatorTree::UpdateType> Updates) {
250 ArrayRef<DominatorTree::UpdateType> Updates) {
255 SmallVector<DominatorTree::UpdateType, 8> DeduplicatedUpdates;
303 DominatorTree &DomTreeUpdater::getDomTree()
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| PHITransAddr.h | 21 class DominatorTree;
82 const DominatorTree *DT, bool MustDominate);
92 const DominatorTree &DT,
104 const DominatorTree *DT);
112 BasicBlock *PredBB, const DominatorTree &DT,
|
| TypeMetadataUtils.h | 25 class DominatorTree;
49 DominatorTree &DT);
57 const CallInst *CI, DominatorTree &DT);
|
| DomTreeUpdater.h | 33 DomTreeUpdater(DominatorTree &DT_, UpdateStrategy Strategy_)
35 DomTreeUpdater(DominatorTree *DT_, UpdateStrategy Strategy_)
41 DomTreeUpdater(DominatorTree &DT_, PostDominatorTree &PDT_,
44 DomTreeUpdater(DominatorTree *DT_, PostDominatorTree *PDT_,
56 /// Returns true if it holds a DominatorTree.
79 /// Returns true if there are DominatorTree updates queued.
90 /// These methods provide APIs for submitting updates to the DominatorTree and
93 /// Note: There are two strategies to update the DominatorTree and the
101 /// DominatorTree. The incremental updater can reschedule the updates or
123 void applyUpdates(ArrayRef<DominatorTree::UpdateType> Updates)
[all...] |
| Loads.h | 23 class DominatorTree;
38 const DominatorTree *DT = nullptr,
49 const DominatorTree *DT = nullptr,
59 const DominatorTree *DT = nullptr,
73 const DominatorTree *DT = nullptr,
85 DominatorTree &DT);
98 const DominatorTree *DT = nullptr,
|
| CFG.h | 24 class DominatorTree;
72 const DominatorTree *DT = nullptr, const LoopInfo *LI = nullptr);
83 const DominatorTree *DT = nullptr, const LoopInfo *LI = nullptr);
94 const DominatorTree *DT = nullptr,
109 const DominatorTree *DT = nullptr, const LoopInfo *LI = nullptr);
|
| CaptureTracking.h | 24 class DominatorTree;
47 /// DominatorTree is provided, only captures which happen before the given
60 const Instruction *I, const DominatorTree *DT, bool IncludeI = false,
|
| SyncDependenceAnalysis.h | 29 class DominatorTree;
63 SyncDependenceAnalysis(const DominatorTree &DT, const PostDominatorTree &PDT,
82 const DominatorTree &DT;
|
| MemorySSAUpdater.h | 48 class DominatorTree;
117 DominatorTree &DT);
120 ArrayRef<std::unique_ptr<ValueToValueMapTy>> VMaps, DominatorTree &DT);
125 void applyUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT,
128 void applyInsertUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT);
292 DominatorTree &DT);
293 void applyInsertUpdates(ArrayRef<CFGUpdate>, DominatorTree &DT,
|
| ValueTracking.h | 34 class DominatorTree;
62 const DominatorTree *DT = nullptr,
78 const DominatorTree *DT = nullptr,
86 const DominatorTree *DT = nullptr,
95 const DominatorTree *DT = nullptr,
110 const DominatorTree *DT = nullptr,
122 const DominatorTree *DT = nullptr,
136 const DominatorTree *DT = nullptr,
150 const DominatorTree *DT = nullptr,
158 const DominatorTree *DT = nullptr
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/AggressiveInstCombine/ |
| AggressiveInstCombineInternal.h | 43 class DominatorTree;
54 const DominatorTree &DT;
79 const DominatorTree &DT)
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| Dominators.h | 9 // This file defines the DominatorTree class, which provides fast and efficient
151 class DominatorTree : public DominatorTreeBase<BasicBlock, false> {
155 DominatorTree() = default;
156 explicit DominatorTree(Function &F) { recalculate(F); }
157 explicit DominatorTree(DominatorTree &DT, DomTreeBuilder::BBUpdates U) {
209 // DominatorTree GraphTraits specializations so the DominatorTree can be
238 template <> struct GraphTraits<DominatorTree*>
240 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode();
[all...] |
| /src/external/apache2/llvm/dist/llvm/examples/IRTransforms/ |
| SimplifyCFG.cpp | 16 // additional functionality (e.g. preserving analysis like the DominatorTree) or
62 // DominatorTree.
102 static bool removeDeadBlocks_v2(Function &F, DominatorTree &DT) {
105 SmallVector<DominatorTree::UpdateType, 8> DTUpdates;
122 DTUpdates.push_back({DominatorTree::Delete, &BB, Succ});
173 static bool eliminateCondBranches_v2(Function &F, DominatorTree &DT) {
177 SmallVector<DominatorTree::UpdateType, 8> DTUpdates;
203 // Delete the edge between BB and RemovedSucc in the DominatorTree, iff
207 DTUpdates.push_back({DominatorTree::Delete, &BB, RemovedSucc});
219 static bool eliminateCondBranches_v3(Function &F, DominatorTree &DT)
[all...] |
