| /external/llvm/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 48 DominatorTree *const DT;
69 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
76 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false);
82 CodeExtractor(DominatorTree &DT, const RegionNode &RN,
|
| SimplifyIndVar.h | 36 const DominatorTree *DT;
42 IVVisitor(): DT(nullptr), ShouldSplitOverflowIntrinsics(false) {}
45 const DominatorTree *getDomTree() const { return DT; }
52 assert(DT && "Splitting overflow intrinsics requires a DomTree.");
60 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT,
66 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
|
| BasicBlockUtils.h | 54 bool MergeBlockIntoPredecessor(BasicBlock *BB, DominatorTree *DT = nullptr,
83 DominatorTree *DT;
89 CriticalEdgeSplittingOptions(DominatorTree *DT = nullptr,
91 : DT(DT), LI(LI), MergeIdenticalEdges(false),
183 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
191 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
210 DominatorTree *DT = nullptr,
230 DominatorTree *DT = nullptr,
262 /// Updates DT if given
[all...] |
| LoopVersioning.h | 43 DominatorTree *DT, ScalarEvolution *SE,
109 DominatorTree *DT;
|
| /external/llvm/lib/Transforms/Utils/ |
| Mem2Reg.cpp | 71 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
87 PromoteMemToReg(Allocas, DT, nullptr, &AC);
|
| SimplifyInstructions.cpp | 53 const DominatorTree *DT = DTWP ? &DTWP->getDomTree() : nullptr;
75 if (Value *V = SimplifyInstruction(I, DL, TLI, DT, AC)) {
|
| /external/llvm/include/llvm/Analysis/ |
| DemandedBits.h | 61 DominatorTree *DT;
|
| IteratedDominanceFrontier.h | 50 IDFCalculator(DominatorTreeBase<BasicBlock> &DT) : DT(DT), useLiveIn(false) {}
88 DominatorTreeBase<BasicBlock> &DT;
|
| LazyValueInfo.h | 33 DominatorTree *DT;
|
| PostDominators.h | 26 DominatorTreeBase<BasicBlock>* DT;
30 DT = new DominatorTreeBase<BasicBlock>(true);
42 return DT->getRoots();
46 return DT->getRootNode();
50 return DT->getNode(BB);
54 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
66 return DT->properlyDominates(A, B);
70 return DT->properlyDominates(A, B)
[all...] |
| BasicAliasAnalysis.h | 44 DominatorTree *DT;
49 AssumptionCache &AC, DominatorTree *DT = nullptr,
51 : AAResultBase(TLI), DL(DL), AC(AC), DT(DT), LI(LI) {}
54 : AAResultBase(Arg), DL(Arg.DL), AC(Arg.AC), DT(Arg.DT), LI(Arg.LI) {}
56 : AAResultBase(std::move(Arg)), DL(Arg.DL), AC(Arg.AC), DT(Arg.DT),
138 DominatorTree *DT, bool &NSW, bool &NUW);
144 AssumptionCache *AC, DominatorTree *DT);
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachinePostDominators.h | 29 DominatorTreeBase<MachineBasicBlock> *DT;
41 return DT->getRoots();
45 return DT->getRootNode();
49 return DT->getNode(BB);
53 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
67 return DT->properlyDominates(A, B);
72 return DT->properlyDominates(A, B);
77 return DT->findNearestCommonDominator(A, B)
[all...] |
| StackProtector.h | 61 DominatorTree *DT;
|
| /external/llvm/include/llvm/Transforms/Scalar/ |
| SROA.h | 56 DominatorTree *DT;
102 SROA() : C(nullptr), DT(nullptr), AC(nullptr) {}
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64CleanupLocalDynamicTLSPass.cpp | 48 MachineDominatorTree *DT = &getAnalysis<MachineDominatorTree>();
49 return VisitNode(DT->getRootNode(), 0);
|
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyOptimizeReturned.cpp | 40 DominatorTree *DT;
44 OptimizeReturned() : FunctionPass(ID), DT(nullptr) {}
66 if (DT->dominates(Inst, U))
73 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
|
| /external/llvm/lib/Target/SystemZ/ |
| SystemZLDCleanup.cpp | 76 MachineDominatorTree *DT = &getAnalysis<MachineDominatorTree>();
77 return VisitNode(DT->getRootNode(), 0);
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 211 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
217 ChildNodes.insert(ChildNodes.begin(), DT[*LI]->begin(), DT[*LI]->end());
220 DT.changeImmediateDominator(*DI, DT[preheader]);
224 DT.eraseNode(*LI);
|
| Sink.cpp | 36 DominatorTree *DT;
93 if (!DT->dominates(BB, UseBlock))
100 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
127 if (!DT->isReachableFromEntry(&BB)) return false;
215 if (!DT->dominates(Inst->getParent(), SuccToSinkTo))
260 DomTreeNode *DTN = DT->getNode(Inst->getParent());
|
| /external/llvm/lib/Analysis/ |
| CaptureTracking.cpp | 62 CapturesBefore(bool ReturnCaptures, const Instruction *I, DominatorTree *DT,
64 : OrderedBB(IC), BeforeHere(I), DT(DT),
73 if (BeforeHere != I && !DT->isReachableFromEntry(BB))
104 return !isPotentiallyReachableFromMany(Worklist, BB, DT);
110 if (BeforeHere != I && DT->dominates(BeforeHere, I) &&
111 !isPotentiallyReachable(I, BeforeHere, DT))
142 DominatorTree *DT;
186 DominatorTree *DT, bool IncludeI,
192 if (!DT)
[all...] |
| RegionInfo.cpp | 69 DominatorTree *DT, Region *Parent) :
70 RegionBase<RegionTraits<Function>>(Entry, Exit, RI, DT, Parent) {
99 DT = DT_;
104 this, DT, nullptr);
130 auto DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
134 RI.recalculate(F, DT, PDT, DF);
|
| ScalarEvolutionNormalization.cpp | 30 const Loop *L, DominatorTree *DT) {
40 if (DT->dominates(LatchBlock, User->getParent()))
55 !DT->dominates(LatchBlock, PN->getIncomingBlock(i)))
71 DominatorTree &DT;
77 ScalarEvolution &se, DominatorTree &dt):
78 Kind(kind), Loops(loops), SE(se), DT(dt) {}
133 IVUseShouldUsePostIncValue(User, OperandValToReplace, L, &DT)) {
251 DominatorTree &DT) {
252 PostIncTransform Transform(Kind, Loops, SE, DT);
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineRegionInfo.cpp | 26 MachineDominatorTree *DT, MachineRegion *Parent) :
27 RegionBase<RegionTraits<MachineFunction>>(Entry, Exit, RI, DT, Parent) {
58 DT = DT_;
64 TopLevelRegion = new MachineRegion(Entry, nullptr, this, DT, nullptr);
84 auto DT = &getAnalysis<MachineDominatorTree>();
88 RI.recalculate(F, DT, PDT, DF);
|
| /external/llvm/lib/IR/ |
| Dominators.cpp | 69 DominatorTreeBase<GraphTraits<BasicBlock *>::NodeType> &DT, Function &F);
71 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *>>::NodeType> &DT,
306 DominatorTree DT;
307 DT.recalculate(F);
308 return DT;
344 DT.recalculate(F);
350 DT.verifyDomTree();
354 DT.print(OS);
|
| /external/llvm/lib/Transforms/IPO/ |
| PartialInlining.cpp | 122 DominatorTree DT;
123 DT.recalculate(*duplicateFunction);
127 = CodeExtractor(toExtract, &DT).extractCodeRegion();
|
