/external/llvm/include/llvm/CodeGen/ |
H A D | MachinePostDominators.h | 30 DominatorTreeBase<MachineBasicBlock> *DT; member in struct:llvm::MachinePostDominatorTree 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 [all...] |
H A D | MachineDominators.h | 43 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(); 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 198 getEntryNode(MachineDominatorTree *DT) argument [all...] |
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | CodeExtractor.h | 48 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 D | Mem2Reg.cpp | 66 DominatorTree &DT = getAnalysis<DominatorTree>(); local 81 PromoteMemToReg(Allocas, DT, DL);
|
H A D | SimplifyInstructions.cpp | 48 const DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>(); local 66 if (Value *V = SimplifyInstruction(I, TD, TLI, DT)) {
|
H A D | LCSSA.cpp | 55 DominatorTree *DT; member in struct:__anon22641::LCSSA 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 105 BlockDominatesAnExit(BasicBlock *BB, const SmallVectorImpl<BasicBlock*> &ExitBlocks, DominatorTree *DT) argument [all...] |
/external/clang/include/clang/Lex/ |
H A D | DirectoryLookup.h | 68 DirectoryLookup(const DirectoryEntry *dir, SrcMgr::CharacteristicKind DT, argument 70 : DirCharacteristic(DT), 78 DirectoryLookup(const HeaderMap *map, SrcMgr::CharacteristicKind DT, argument 80 : DirCharacteristic(DT), LookupType(LT_HeaderMap),
|
/external/clang/lib/AST/ |
H A D | Mangle.cpp | 78 CXXDtorType DT, const BlockDecl *BD, 82 mangleCXXDtor(DD, DT, Out); 77 mangleDtorBlock(const CXXDestructorDecl *DD, CXXDtorType DT, const BlockDecl *BD, raw_ostream &ResStream) argument
|
/external/llvm/include/llvm/Analysis/ |
H A D | PostDominators.h | 26 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 93 getEntryNode(PostDominatorTree *DT) argument [all...] |
H A D | DominanceFrontier.h | 172 DominatorTree &DT = getAnalysis<DominatorTree>(); local 173 Roots = DT.getRoots(); 175 calculate(DT, DT[Roots[0]]); 184 const DomSetType &calculate(const DominatorTree &DT,
|
H A D | DominatorInternals.h | 34 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 D | IVUsers.h | 123 DominatorTree *DT; member in class:llvm::IVUsers
|
/external/llvm/lib/Analysis/ |
H A D | DomPrinter.cpp | 57 static std::string getGraphName(DominatorTree *DT) { argument 73 static std::string getGraphName(PostDominatorTree *DT) { argument
|
H A D | DominanceFrontier.cpp | 41 DominanceFrontier::calculate(const DominatorTree &DT, argument 70 if (DT[*SI]->getIDom() != currentNode) 102 if (!DT.properlyDominates(parentNode, DT[*CDFI]))
|
H A D | PHITransAddr.cpp | 147 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 D | RegionPrinter.cpp | 64 static std::string getGraphName(RegionInfo *DT) { argument
|
H A D | 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; member in class:__anon22040::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/lib/Transforms/Scalar/ |
H A D | LoopDeletion.cpp | 205 DominatorTree &DT = getAnalysis<DominatorTree>(); local 211 ChildNodes.insert(ChildNodes.begin(), DT[*LI]->begin(), DT[*LI]->end()); 214 DT.changeImmediateDominator(*DI, DT[preheader]); 218 DT.eraseNode(*LI);
|
H A D | LoopInstSimplify.cpp | 68 DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>(); local 112 Value *V = SimplifyInstruction(I, TD, TLI, DT);
|
H A D | Sink.cpp | 34 DominatorTree *DT; member in class:__anon22631::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/unittests/Analysis/ |
H A D | CFGTest.cpp | 96 DominatorTree *DT = &getAnalysis<DominatorTree>(); local 98 EXPECT_EQ(isPotentiallyReachable(A, B, DT, 0), ExpectedResult); 100 EXPECT_EQ(isPotentiallyReachable(A, B, DT, LI), ExpectedResult);
|
/external/llvm/lib/Transforms/IPO/ |
H A D | PartialInlining.cpp | 121 DominatorTree DT; local 122 DT.runOnFunction(*duplicateFunction); 126 = CodeExtractor(toExtract, &DT).extractCodeRegion();
|
/external/llvm/unittests/IR/ |
H A D | DominatorTreeTest.cpp | 28 DominatorTree *DT = &getAnalysis<DominatorTree>(); local 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 [all...] |
/external/clang/include/clang/Analysis/Analyses/ |
H A D | Dominators.h | 35 llvm::DominatorTreeBase<CFGBlock>* DT; member in class:clang::DominatorTree 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 197 getEntryNode(::clang::DominatorTree *DT) argument [all...] |
/external/clang/lib/Lex/ |
H A D | PPExpressions.cpp | 82 static bool EvaluateDefined(PPValue &Result, Token &PeekTok, DefinedTracker &DT, argument 157 DT.State = DefinedTracker::DefinedMacro; 158 DT.TheMacro = II; 165 /// expression in DT. See above for information on what DT means. 170 static bool EvaluateValue(PPValue &Result, Token &PeekTok, DefinedTracker &DT, argument 172 DT.State = DefinedTracker::Unknown; 187 return(EvaluateDefined(Result, PeekTok, DT, ValueLive, PP)); 331 if (EvaluateValue(Result, PeekTok, DT, ValueLive, PP)) return true; 336 // Just use DT unmodifie 497 DefinedTracker DT; local 694 DefinedTracker DT; local 757 DefinedTracker DT; local [all...] |