Searched refs:DT (Results 1 - 25 of 85) sorted by relevance

1234

/external/llvm/unittests/VMCore/
H A DDominatorTreeTest.cpp19 DominatorTree *DT = &getAnalysis<DominatorTree>(); local
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
[all...]
/external/llvm/lib/Analysis/
H A DPostDominators.cpp35 DT->recalculate(F);
40 delete DT;
44 DT->print(OS);
H A DPHITransAddr.cpp145 const DominatorTree *DT) {
189 Value *PHIIn = PHITranslateSubExpr(Cast->getOperand(0), CurBB, PredBB, DT);
208 (!DT || DT->dominates(CastI->getParent(), PredBB)))
219 Value *GEPOp = PHITranslateSubExpr(GEP->getOperand(i), CurBB, PredBB, DT);
230 if (Value *V = SimplifyGEPInst(GEPOps, TD, TLI, DT)) {
245 (!DT || DT->dominates(GEPI->getParent(), PredBB))) {
267 Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT);
286 if (Value *Res = SimplifyAddInst(LHS, RHS, isNSW, isNUW, TD, TLI, DT)) {
143 PHITranslateSubExpr(Value *V, BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree *DT) argument
320 PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree *DT) argument
344 PHITranslateWithInsertion(BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl<Instruction*> &NewInsts) argument
368 InsertPHITranslatedSubExpr(Value *InVal, BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl<Instruction*> &NewInsts) argument
[all...]
H A DScalarEvolutionNormalization.cpp30 const Loop *L, DominatorTree *DT) {
40 if (DT->dominates(LatchBlock, User->getParent()))
55 !DT->dominates(LatchBlock, PN->getIncomingBlock(i)))
71 DominatorTree &DT; member in class:__anon7316::PostIncTransform
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);
29 IVUseShouldUsePostIncValue(Instruction *User, Value *Operand, const Loop *L, DominatorTree *DT) argument
214 TransformForPostIncUse(TransformKind Kind, const SCEV *S, Instruction *User, Value *OperandValToReplace, PostIncLoopSet &Loops, ScalarEvolution &SE, DominatorTree &DT) argument
/external/llvm/include/llvm/Analysis/
H A DDominatorInternals.h34 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, argument
40 InfoRec &VInfo = DT.Info[DT.Roots[i]];
47 InfoRec &SuccVInfo = DT.Info[*SI];
50 N = DTDFSPass(DT, *SI, N);
64 DT.Info[BB];
71 DT.Vertex.push_back(BB); // Vertex[n] = V;
96 DT.Info[Succ];
108 Eval(DominatorTreeBase<typename GraphT::NodeType>& DT, argument
111 DT
151 Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT, FuncT& F) argument
[all...]
H A DPostDominators.h26 DominatorTreeBase<BasicBlock>* DT; member in struct:llvm::PostDominatorTree
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
88 getEntryNode(PostDominatorTree *DT) argument
[all...]
H A DInstructionSimplify.h37 const DominatorTree *DT = 0);
44 const DominatorTree *DT = 0);
50 const DominatorTree *DT = 0);
56 const DominatorTree *DT = 0);
62 const DominatorTree *DT = 0);
68 const DominatorTree *DT = 0);
74 const DominatorTree *DT = 0);
80 const DominatorTree *DT = 0);
86 const DominatorTree *DT = 0);
93 const DominatorTree *DT
[all...]
H A DPHITransAddr.h74 /// dominator tree DT is non-null, the translated value must dominate
77 const DominatorTree *DT);
87 const DominatorTree &DT,
98 const DominatorTree *DT);
106 BasicBlock *PredBB, const DominatorTree &DT,
H A DScalarEvolutionNormalization.h74 DominatorTree &DT);
H A DDominators.h183 void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType>& DT,
239 void Split(DominatorTreeBase<typename GraphT::NodeType>& DT, argument
260 if (ND != NewBB && !DT.dominates(NewBBSucc, ND) &&
261 DT.isReachableFromEntry(ND)) {
272 if (DT.isReachableFromEntry(PredBlocks[i])) {
284 if (DT.isReachableFromEntry(PredBlocks[i]))
285 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i]);
289 DomTreeNodeBase<NodeT> *NewBBNode = DT.addNewBlock(NewBB, NewBBIDom);
294 DomTreeNodeBase<NodeT> *NewBBSuccNode = DT.getNode(NewBBSucc);
295 DT
715 DominatorTreeBase<BasicBlock>* DT; member in class:llvm::DominatorTree
888 getEntryNode(DominatorTree *DT) argument
[all...]
H A DDominanceFrontier.h172 DominatorTree &DT = getAnalysis<DominatorTree>(); local
173 Roots = DT.getRoots();
175 calculate(DT, DT[Roots[0]]);
184 const DomSetType &calculate(const DominatorTree &DT,
/external/llvm/include/llvm/CodeGen/
H A DMachineDominators.h43 DominatorTreeBase<MachineBasicBlock>* DT; member in class:llvm::MachineDominatorTree
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
196 getEntryNode(MachineDominatorTree *DT) argument
[all...]
/external/clang/include/clang/Analysis/Analyses/
H A DDominators.h36 llvm::DominatorTreeBase<CFGBlock>* DT; member in class:clang::DominatorTree
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
198 getEntryNode(::clang::DominatorTree *DT) argument
[all...]
/external/llvm/lib/CodeGen/
H A DMachineDominators.cpp38 DT->recalculate(F);
46 DT = new DominatorTreeBase<MachineBasicBlock>(false);
50 delete DT;
54 DT->releaseMemory();
58 DT->print(OS);
H A DStackProtector.cpp49 DominatorTree* DT; member in class:__anon7423::StackProtector
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);
/external/llvm/include/llvm/Transforms/Utils/
H A DFunctionUtils.h29 Function* ExtractCodeRegion(DominatorTree& DT,
35 Function* ExtractLoop(DominatorTree& DT, Loop *L,
H A DPromoteMemToReg.h41 DominatorTree &DT, AliasSetTracker *AST = 0);
/external/clang/include/clang/Lex/
H A DDirectoryLookup.h67 DirectoryLookup(const DirectoryEntry *dir, SrcMgr::CharacteristicKind DT, argument
69 : DirCharacteristic(DT), UserSupplied(isUser),
77 DirectoryLookup(const HeaderMap *map, SrcMgr::CharacteristicKind DT, argument
79 : DirCharacteristic(DT), UserSupplied(isUser), LookupType(LT_HeaderMap),
/external/llvm/lib/Transforms/Utils/
H A DLCSSA.cpp55 DominatorTree *DT; member in struct:__anon7832::LCSSA
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
103 BlockDominatesAnExit(BasicBlock *BB, const SmallVectorImpl<BasicBlock*> &ExitBlocks, DominatorTree *DT) argument
[all...]
H A DMem2Reg.cpp64 DominatorTree &DT = getAnalysis<DominatorTree>(); local
78 PromoteMemToReg(Allocas, DT);
H A DBreakCriticalEdges.cpp240 DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>();
245 if (DT == 0 && LI == 0 && PI == 0)
273 if (DT) {
274 DomTreeNode *TINode = DT->getNode(TIBB);
280 DomTreeNode *NewBBNode = DT->addNewBlock(NewBB, TIBB);
283 // If NewBBDominatesDestBB hasn't been computed yet, do so with DT.
285 DestBBNode = DT->getNode(DestBB);
287 if (DomTreeNode *OPNode = DT->getNode(OtherPreds.back()))
288 NewBBDominatesDestBB = DT->dominates(DestBBNode, OPNode);
297 if (!DestBBNode) DestBBNode = DT
[all...]
/external/clang/test/SemaTemplate/
H A Ddefault-arguments.cpp130 typename DT>
131 container<DT> initializer(const DT& d) {
132 return container<DT>();
/external/llvm/lib/Transforms/Scalar/
H A DSink.cpp33 DominatorTree *DT; member in class:__anon7825::Sinking
90 if (!DT->dominates(BB, UseBlock))
97 DT = &getAnalysis<DominatorTree>();
125 if (!DT->isReachableFromEntry(&BB)) return false;
251 if (!DT->dominates(ParentBlock, SuccToSinkTo)) {
H A DLoopRotation.cpp247 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>())
248 DT->eraseNode(Latch);
410 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>()) {
413 DT->changeImmediateDominator(Exit, OrigPreheader);
414 DT->changeImmediateDominator(NewHeader, OrigPreheader);
417 DT->changeImmediateDominator(OrigHeader, OrigLatch);
438 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>()) {
440 DT->changeImmediateDominator(NewHeader, OrigPreheader);
441 DT->changeImmediateDominator(OrigHeader, OrigLatch);
/external/clang/lib/Lex/
H A DPPExpressions.cpp81 static bool EvaluateDefined(PPValue &Result, Token &PeekTok, DefinedTracker &DT, argument
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, argument
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 unmodifie
479 DefinedTracker DT; local
676 DefinedTracker DT; local
738 DefinedTracker DT; local
[all...]

Completed in 1107 milliseconds

1234