| /external/llvm/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 48 DominatorTree *const DT;
69 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = 0,
76 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false);
82 CodeExtractor(DominatorTree &DT, const RegionNode &RN,
|
| /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;
83 assert(L->isLCSSAForm(*DT) && "LCSSA form not preserved!");
107 DominatorTree *DT) {
108 DomTreeNode *DomNode = DT->getNode(BB);
110 if (DT->dominates(DomNode, DT->getNode(ExitBlocks[i])))
121 DT = &getAnalysis<DominatorTree>();
148 if (!BlockDominatesAnExit(BB, ExitBlocks, DT))
170 assert(L->isLCSSAForm(*DT));
218 DomTreeNode *DomNode = DT->getNode(DomBB)
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachinePostDominators.h | 30 DominatorTreeBase<MachineBasicBlock> *DT;
42 return DT->getRoots();
46 return DT->getRootNode();
50 return DT->getNode(BB);
54 return DT->getNode(BB);
59 return DT->dominates(A, B);
63 return DT->dominates(A, B);
68 return DT->properlyDominates(A, B);
73 return DT->properlyDominates(A, B);
78 return DT->findNearestCommonDominator(A, B)
[all...] |
| MachineDominators.h | 43 DominatorTreeBase<MachineBasicBlock>* DT;
49 DominatorTreeBase<MachineBasicBlock>& getBase() { return *DT; }
58 return DT->getRoots();
62 return DT->getRoot();
66 return DT->getRootNode();
73 return DT->dominates(A, B);
78 return DT->dominates(A, B);
85 if (BBA != BBB) return DT->dominates(BBA, BBB);
92 //if(!DT.IsPostDominators) {
103 return DT->properlyDominates(A, B)
[all...] |
| /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 | 123 DominatorTree *DT;
|
| RegionInfo.h | 209 DominatorTree *DT;
244 /// @param DT The dominator tree of the current function.
248 DominatorTree *DT, Region *Parent = 0);
567 DominatorTree *DT;
|
| /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);
|
| LoopInstSimplify.cpp | 68 DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>();
112 Value *V = SimplifyInstruction(I, TD, TLI, DT);
|
| Sink.cpp | 34 DominatorTree *DT;
92 if (!DT->dominates(BB, UseBlock))
99 DT = &getAnalysis<DominatorTree>();
126 if (!DT->isReachableFromEntry(&BB)) return false;
202 if (!DT->dominates(Inst->getParent(), SuccToSinkTo))
240 DomTreeNode *DTN = DT->getNode(Inst->getParent());
|
| /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...] |
| AliasAnalysis.cpp | 387 CapturesBefore(const Instruction *I, DominatorTree *DT)
388 : BeforeHere(I), DT(DT), Captured(false) {}
397 if (BeforeHere != I && !DT->isReachableFromEntry(BB))
402 if (BeforeHere != I && DT->dominates(BeforeHere, I) &&
412 if (BeforeHere != I && !DT->isReachableFromEntry(BB))
414 if (BeforeHere != I && DT->dominates(BeforeHere, I) &&
422 DominatorTree *DT;
435 DominatorTree *DT) {
436 if (!DT || !TD) return AliasAnalysis::ModRef
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| PartialInlining.cpp | 121 DominatorTree DT;
122 DT.runOnFunction(*duplicateFunction);
126 = CodeExtractor(toExtract, &DT).extractCodeRegion();
|
| /external/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 35 llvm::DominatorTreeBase<CFGBlock>* DT;
38 DT = new llvm::DominatorTreeBase<CFGBlock>(false);
42 delete DT;
45 llvm::DominatorTreeBase<CFGBlock>& getBase() { return *DT; }
50 return DT->getRoot();
56 return DT->getRootNode();
70 if (DT->compare(Other.getBase()))
81 DT->recalculate(*cfg);
91 if(DT->getNode(*I)->getIDom())
94 << DT->getNode(*I)->getIDom()->getBlock()->getBlockID(
[all...] |
| /external/llvm/lib/CodeGen/ |
| StackProtector.cpp | 49 DominatorTree *DT;
110 DT = getAnalysisIfAvailable<DominatorTree>();
330 if (DT && DT->isReachableFromEntry(BB)) {
331 DT->addNewBlock(NewBB, BB);
332 FailBBDom = FailBBDom ? DT->findNearestCommonDominator(FailBBDom, BB) :BB;
353 if (DT && FailBBDom)
354 DT->addNewBlock(FailBB, FailBBDom);
|
| MachineSink.cpp | 49 MachineDominatorTree *DT; // Machine dominator tree
214 if (!DT->dominates(MBB, UseBlock))
228 DT = &getAnalysis<MachineDominatorTree>();
257 if (!DT->isReachableFromEntry(&MBB)) return false;
382 if (!DT->dominates(ToBB, *PI))
633 if (!TryBreak && !DT->dominates(ParentBlock, SuccToSinkTo)) {
|
| PeepholeOptimizer.cpp | 95 MachineDominatorTree *DT; // Machine dominator tree
238 } else if (Aggressive && DT->dominates(MBB, UseMBB)) {
491 DT = Aggressive ? &getAnalysis<MachineDominatorTree>() : 0;
|
| /external/llvm/unittests/IR/ |
| DominatorTreeTest.cpp | 28 DominatorTree *DT = &getAnalysis<DominatorTree>();
56 EXPECT_TRUE(DT->isReachableFromEntry(BB0));
57 EXPECT_TRUE(DT->isReachableFromEntry(BB1));
58 EXPECT_TRUE(DT->isReachableFromEntry(BB2));
59 EXPECT_FALSE(DT->isReachableFromEntry(BB3));
60 EXPECT_TRUE(DT->isReachableFromEntry(BB4));
63 EXPECT_TRUE(DT->dominates(BB0, BB0));
64 EXPECT_TRUE(DT->dominates(BB0, BB1));
65 EXPECT_TRUE(DT->dominates(BB0, BB2));
66 EXPECT_TRUE(DT->dominates(BB0, BB3))
[all...] |
| /external/clang/lib/Lex/ |
| PPExpressions.cpp | 82 static bool EvaluateDefined(PPValue &Result, Token &PeekTok, DefinedTracker &DT,
152 DT.State = DefinedTracker::DefinedMacro;
153 DT.TheMacro = II;
160 /// expression in DT. See above for information on what DT means.
165 static bool EvaluateValue(PPValue &Result, Token &PeekTok, DefinedTracker &DT,
167 DT.State = DefinedTracker::Unknown;
182 return(EvaluateDefined(Result, PeekTok, DT, ValueLive, PP));
326 if (EvaluateValue(Result, PeekTok, DT, ValueLive, PP)) return true;
331 // Just use DT unmodified as our result
[all...] |
| /external/llvm/lib/Target/R600/ |
| SIAnnotateControlFlow.cpp | 62 DominatorTree *DT;
166 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();
217 BasicBlock *IDom = DT->getNode(Parent)->getIDom()->getBlock();
290 DT = &getAnalysis<DominatorTree>();
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCContract.cpp | 53 DominatorTree *DT;
357 DT = &getAnalysis<DominatorTree>();
482 if (DT->isReachableFromEntry(U) && DT->dominates(Inst, U)) {
|
| /external/mksh/src/ |
| tree.c | 894 #define DT(x) case x: shf_puts(#x, shf); break;
899 DT(IOREAD)
900 DT(IOWRITE)
901 DT(IORDWR)
902 DT(IOHERE)
903 DT(IOCAT)
904 DT(IODUP)
936 #undef DT
|
