| /external/llvm/lib/Transforms/Utils/ |
| Mem2Reg.cpp | 64 DominatorTree &DT = getAnalysis<DominatorTree>();
78 PromoteMemToReg(Allocas, DT);
|
| SimplifyInstructions.cpp | 48 const DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>();
66 if (Value *V = SimplifyInstruction(I, TD, TLI, DT)) {
|
| LCSSA.cpp | 55 DominatorTree *DT;
81 assert(L->isLCSSAForm(*DT) && "LCSSA form not preserved!");
105 DominatorTree *DT) {
106 DomTreeNode *DomNode = DT->getNode(BB);
108 if (DT->dominates(DomNode, DT->getNode(ExitBlocks[i])))
119 DT = &getAnalysis<DominatorTree>();
144 if (!BlockDominatesAnExit(BB, ExitBlocks, DT))
160 assert(L->isLCSSAForm(*DT));
208 DomTreeNode *DomNode = DT->getNode(DomBB)
[all...] |
| BasicBlockUtils.cpp | 169 if (DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>()) {
170 if (DomTreeNode *DTN = DT->getNode(BB)) {
171 DomTreeNode *PredDTN = DT->getNode(PredBB);
175 DT->changeImmediateDominator(*DI, PredDTN);
177 DT->eraseNode(BB);
299 if (DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>()) {
301 if (DomTreeNode *OldNode = DT->getNode(Old)) {
307 DomTreeNode *NewNode = DT->addNewBlock(New,Old);
310 DT->changeImmediateDominator(*I, NewNode);
355 DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>()
[all...] |
| SimplifyIndVar.cpp | 47 DominatorTree *DT;
|
| /external/llvm/include/llvm/Analysis/ |
| 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...] |
| DominanceFrontier.h | 172 DominatorTree &DT = getAnalysis<DominatorTree>();
173 Roots = DT.getRoots();
175 calculate(DT, DT[Roots[0]]);
184 const DomSetType &calculate(const DominatorTree &DT,
|
| IVUsers.h | 124 DominatorTree *DT;
|
| RegionInfo.h | 213 DominatorTree *DT;
248 /// @param DT The dominator tree of the current function.
252 DominatorTree *DT, Region *Parent = 0);
534 DominatorTree *DT;
|
| MemoryDependenceAnalysis.h | 327 DominatorTree *DT;
|
| ScalarEvolution.h | 236 /// DT - The dominator tree.
238 DominatorTree *DT;
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 203 DominatorTree& DT = getAnalysis<DominatorTree>();
209 ChildNodes.insert(ChildNodes.begin(), DT[*LI]->begin(), DT[*LI]->end());
212 DT.changeImmediateDominator(*DI, DT[preheader]);
216 DT.eraseNode(*LI);
|
| Sink.cpp | 33 DominatorTree *DT;
90 if (!DT->dominates(BB, UseBlock))
97 DT = &getAnalysis<DominatorTree>();
125 if (!DT->isReachableFromEntry(&BB)) return false;
251 if (!DT->dominates(ParentBlock, SuccToSinkTo)) {
|
| LoopInstSimplify.cpp | 67 DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>();
111 Value *V = SimplifyInstruction(I, TD, TLI, DT);
|
| LoopIdiomRecognize.cpp | 69 DominatorTree *DT;
198 DT = &getAnalysis<DominatorTree>();
231 if (!DT->dominates(BB, ExitBlocks[i]))
|
| /external/llvm/lib/Analysis/ |
| 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) {}
122 if (IVUseShouldUsePostIncValue(User, OperandValToReplace, L, &DT)) {
220 DominatorTree &DT) {
221 PostIncTransform Transform(Kind, Loops, SE, DT);
[all...] |
| Lint.cpp | 105 DominatorTree *DT;
179 DT = &getAnalysis<DominatorTree>();
620 if (Value *W = SimplifyInstruction(Inst, TD, TLI, DT))
|
| /external/llvm/lib/Transforms/IPO/ |
| PartialInlining.cpp | 121 DominatorTree DT;
122 DT.runOnFunction(*duplicateFunction);
125 Function* extractedFunction = ExtractCodeRegion(DT, toExtract);
|
| /external/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 36 llvm::DominatorTreeBase<CFGBlock>* DT;
39 DT = new llvm::DominatorTreeBase<CFGBlock>(false);
43 delete DT;
46 llvm::DominatorTreeBase<CFGBlock>& getBase() { return *DT; }
51 return DT->getRoot();
57 return DT->getRootNode();
71 if (DT->compare(Other.getBase()))
82 DT->recalculate(*cfg);
92 if(DT->getNode(*I)->getIDom())
95 << DT->getNode(*I)->getIDom()->getBlock()->getBlockID(
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineDominators.h | 43 DominatorTreeBase<MachineBasicBlock>* DT;
49 DominatorTreeBase<MachineBasicBlock>& getBase() { return *DT; }
58 return DT->getRoots();
62 return DT->getRoot();
66 return DT->getRootNode();
72 return DT->dominates(A, B);
76 return DT->dominates(A, B);
83 if (BBA != BBB) return DT->dominates(BBA, BBB);
90 //if(!DT.IsPostDominators) {
101 return DT->properlyDominates(A, B)
[all...] |
| /external/llvm/lib/CodeGen/ |
| StackProtector.cpp | 49 DominatorTree* DT;
95 DT = getAnalysisIfAvailable<DominatorTree>();
215 if (DT && DT->isReachableFromEntry(BB)) {
216 DT->addNewBlock(NewBB, BB);
217 FailBBDom = FailBBDom ? DT->findNearestCommonDominator(FailBBDom, BB) :BB;
238 if (DT && FailBBDom)
239 DT->addNewBlock(FailBB, FailBBDom);
|
| MachineSink.cpp | 49 MachineDominatorTree *DT; // Machine dominator tree
205 if (!DT->dominates(MBB, UseBlock))
219 DT = &getAnalysis<MachineDominatorTree>();
249 if (!DT->isReachableFromEntry(&MBB)) return false;
374 if (!DT->dominates(ToBB, *PI))
622 if (!TryBreak && !DT->dominates(ParentBlock, SuccToSinkTo)) {
|
| PeepholeOptimizer.cpp | 78 MachineDominatorTree *DT; // Machine dominator tree
201 } else if (Aggressive && DT->dominates(MBB, UseMBB)) {
403 DT = Aggressive ? &getAnalysis<MachineDominatorTree>() : 0;
|
| /external/llvm/unittests/VMCore/ |
| DominatorTreeTest.cpp | 19 DominatorTree *DT = &getAnalysis<DominatorTree>();
47 EXPECT_TRUE(DT->isReachableFromEntry(BB0));
48 EXPECT_TRUE(DT->isReachableFromEntry(BB1));
49 EXPECT_TRUE(DT->isReachableFromEntry(BB2));
50 EXPECT_FALSE(DT->isReachableFromEntry(BB3));
51 EXPECT_TRUE(DT->isReachableFromEntry(BB4));
54 EXPECT_TRUE(DT->dominates(BB0, BB0));
55 EXPECT_TRUE(DT->dominates(BB0, BB1));
56 EXPECT_TRUE(DT->dominates(BB0, BB2));
57 EXPECT_TRUE(DT->dominates(BB0, BB3))
[all...] |
| /external/clang/lib/Lex/ |
| PPExpressions.cpp | 81 static bool EvaluateDefined(PPValue &Result, Token &PeekTok, DefinedTracker &DT,
145 DT.State = DefinedTracker::DefinedMacro;
146 DT.TheMacro = II;
153 /// expression in DT. See above for information on what DT means.
158 static bool EvaluateValue(PPValue &Result, Token &PeekTok, DefinedTracker &DT,
160 DT.State = DefinedTracker::Unknown;
175 return(EvaluateDefined(Result, PeekTok, DT, ValueLive, PP));
313 if (EvaluateValue(Result, PeekTok, DT, ValueLive, PP)) return true;
318 // Just use DT unmodified as our result
[all...] |
