Searched defs:DT (Results 1 - 25 of 65) sorted by relevance

123

/external/llvm/include/llvm/Transforms/Utils/
H A DCodeExtractor.h48 DominatorTree *const DT; member in class:llvm::CodeExtractor
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/
H A DMem2Reg.cpp64 DominatorTree &DT = getAnalysis<DominatorTree>(); local
78 PromoteMemToReg(Allocas, DT);
H A DSimplifyInstructions.cpp48 const DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>(); local
66 if (Value *V = SimplifyInstruction(I, TD, TLI, DT)) {
H A DLCSSA.cpp55 DominatorTree *DT; member in struct:__anon9156::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...]
/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/clang/lib/AST/
H A DMangle.cpp97 CXXDtorType DT, const BlockDecl *BD,
102 mangleCXXDtor(DD, DT, Out);
96 mangleDtorBlock(const CXXDestructorDecl *DD, CXXDtorType DT, const BlockDecl *BD, raw_ostream &ResStream) argument
/external/llvm/include/llvm/Analysis/
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 DDominanceFrontier.h172 DominatorTree &DT = getAnalysis<DominatorTree>(); local
173 Roots = DT.getRoots();
175 calculate(DT, DT[Roots[0]]);
184 const DomSetType &calculate(const DominatorTree &DT,
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 DIVUsers.h124 DominatorTree *DT; member in class:llvm::IVUsers
H A DRegionInfo.h213 DominatorTree *DT; member in class:llvm::Region
248 /// @param DT The dominator tree of the current function.
252 DominatorTree *DT, Region *Parent = 0);
573 DominatorTree *DT; member in class:llvm::RegionInfo
/external/llvm/lib/Analysis/
H A DDomPrinter.cpp57 static std::string getGraphName(DominatorTree *DT) { argument
73 static std::string getGraphName(PostDominatorTree *DT) { argument
H A DDominanceFrontier.cpp41 DominanceFrontier::calculate(const DominatorTree &DT, argument
70 if (DT[*SI]->getIDom() != currentNode)
102 if (!DT.properlyDominates(parentNode, DT[*CDFI]))
H A DPHITransAddr.cpp147 const DominatorTree *DT) {
191 Value *PHIIn = PHITranslateSubExpr(Cast->getOperand(0), CurBB, PredBB, DT);
210 (!DT || DT->dominates(CastI->getParent(), PredBB)))
221 Value *GEPOp = PHITranslateSubExpr(GEP->getOperand(i), CurBB, PredBB, DT);
232 if (Value *V = SimplifyGEPInst(GEPOps, TD, TLI, DT)) {
247 (!DT || DT->dominates(GEPI->getParent(), PredBB))) {
269 Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT);
288 if (Value *Res = SimplifyAddInst(LHS, RHS, isNSW, isNUW, TD, TLI, DT)) {
145 PHITranslateSubExpr(Value *V, BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree *DT) argument
322 PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree *DT) argument
346 PHITranslateWithInsertion(BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl<Instruction*> &NewInsts) argument
370 InsertPHITranslatedSubExpr(Value *InVal, BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl<Instruction*> &NewInsts) argument
[all...]
H A DRegionPrinter.cpp64 static std::string getGraphName(RegionInfo *DT) { argument
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:__anon8628::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
H A DIVUsers.cpp85 static bool isSimplifiedLoopNest(BasicBlock *BB, const DominatorTree *DT, argument
89 for (DomTreeNode *Rung = DT->getNode(BB);
165 if (!isSimplifiedLoopNest(UseBB, DT, LI, SimpleLoopNests))
198 *SE, *DT);
236 DT = &getAnalysis<DominatorTree>();
299 *SE, *DT);
/external/llvm/lib/Transforms/Scalar/
H A DLoopDeletion.cpp203 DominatorTree& DT = getAnalysis<DominatorTree>(); local
209 ChildNodes.insert(ChildNodes.begin(), DT[*LI]->begin(), DT[*LI]->end());
212 DT.changeImmediateDominator(*DI, DT[preheader]);
216 DT.eraseNode(*LI);
H A DLoopInstSimplify.cpp67 DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>(); local
111 Value *V = SimplifyInstruction(I, TD, TLI, DT);
H A DSink.cpp34 DominatorTree *DT; member in class:__anon9149::Sinking
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/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/llvm/lib/CodeGen/
H A DStackProtector.cpp44 DominatorTree *DT; member in class:__anon8737::StackProtector
95 DT = getAnalysisIfAvailable<DominatorTree>();
243 if (DT && DT->isReachableFromEntry(BB)) {
244 DT->addNewBlock(NewBB, BB);
245 FailBBDom = FailBBDom ? DT->findNearestCommonDominator(FailBBDom, BB) :BB;
266 if (DT && FailBBDom)
267 DT->addNewBlock(FailBB, FailBBDom);
/external/llvm/lib/Transforms/IPO/
H A DPartialInlining.cpp121 DominatorTree DT; local
122 DT.runOnFunction(*duplicateFunction);
126 = CodeExtractor(toExtract, &DT).extractCodeRegion();
/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/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...]

Completed in 2171 milliseconds

123