/freebsd-10.1-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | LICM.cpp | 104 DominatorTree *DT; // Dominator Tree for the current Loop. member in struct:__anon2759::LICM 211 DT = &getAnalysis<DominatorTree>(); 269 SinkRegion(DT->getNode(L->getHeader())); 271 HoistRegion(DT->getNode(L->getHeader())); 494 if (!DT->dominates(I.getParent(), ExitBlocks[0])) { 545 if (!DT->dominates(InstOrigBB, ExitBlock)) 648 if (!DT->dominates(Inst.getParent(), ExitBlocks[i]))
|
H A D | EarlyCSE.cpp | 267 DominatorTree *DT; member in class:__anon2750::EarlyCSE 435 if (Value *V = SimplifyInstruction(Inst, TD, TLI, DT)) { 559 DT = &getAnalysis<DominatorTree>(); 575 CurrentGeneration, DT->getRootNode(), 576 DT->getRootNode()->begin(), 577 DT->getRootNode()->end()));
|
H A D | LoopUnswitch.cpp | 139 DominatorTree *DT; member in class:__anon2777::LoopUnswitch 154 currentLoop(0), DT(0), loopHeader(0), 387 DT = getAnalysisIfAvailable<DominatorTree>(); 392 assert(currentLoop->isLCSSAForm(*DT)); 399 if (DT) 400 DT->runOnFunction(*F); 1041 if (Latch && DT->dominates(SISucc, Latch)) 1073 if (DT) 1074 DT->addNewBlock(Abort, NewSISucc);
|
H A D | CodeGenPrepare.cpp | 81 DominatorTree *DT; member in class:__anon2737::CodeGenPrepare 150 DT = getAnalysisIfAvailable<DominatorTree>(); 223 if (ModifiedDT && DT) 224 DT->DT->recalculate(F); 434 if (DT && !ModifiedDT) { 435 BasicBlock *BBIDom = DT->getNode(BB)->getIDom()->getBlock(); 436 BasicBlock *DestBBIDom = DT->getNode(DestBB)->getIDom()->getBlock(); 437 BasicBlock *NewIDom = DT->findNearestCommonDominator(BBIDom, DestBBIDom); 438 DT [all...] |
H A D | GVN.cpp | 110 DominatorTree *DT; member in class:__anon2752::ValueTable 132 void setDomTree(DominatorTree* D) { DT = D; } 349 if (NonLocalDepCall && DT->properlyDominates(I->getBB(), C->getParent())){ 589 DominatorTree *DT; member in class:__anon2753::GVN 629 DominatorTree &getDominatorTree() const { return *DT; } 1617 *DT, NewInsts); 2007 if (DT->dominates(Vals.BB, BB)) { 2014 if (DT->dominates(Next->BB, BB)) { 2035 if (DT->dominates(Root, U)) { 2047 DominatorTree *DT) { 2046 isOnlyReachableViaThisEdge(const BasicBlockEdge &E, DominatorTree *DT) argument [all...] |
H A D | LoopIdiomRecognize.cpp | 135 DominatorTree *DT; member in class:__anon2762::LoopIdiomRecognize 143 TD = 0; DT = 0; SE = 0; TLI = 0; TTI = 0; 188 return DT ? DT : (DT=&getAnalysis<DominatorTree>()); 670 // set DT 735 if (!DT->dominates(BB, ExitBlocks[i]))
|
H A D | LoopStrengthReduce.cpp | 830 ScalarEvolution &SE, DominatorTree &DT, 841 ScalarEvolution &SE, DominatorTree &DT); 845 ScalarEvolution &SE, DominatorTree &DT, 855 ScalarEvolution &SE, DominatorTree &DT) { 876 RateRegister(AR->getOperand(1), Regs, L, SE, DT); 903 ScalarEvolution &SE, DominatorTree &DT, 910 RateRegister(Reg, Regs, L, SE, DT); 922 ScalarEvolution &SE, DominatorTree &DT, 931 RatePrimaryRegister(ScaledReg, Regs, L, SE, DT, LoserRegs); 942 RatePrimaryRegister(BaseReg, Regs, L, SE, DT, LoserReg 852 RateRegister(const SCEV *Reg, SmallPtrSet<const SCEV *, 16> &Regs, const Loop *L, ScalarEvolution &SE, DominatorTree &DT) argument 900 RatePrimaryRegister(const SCEV *Reg, SmallPtrSet<const SCEV *, 16> &Regs, const Loop *L, ScalarEvolution &SE, DominatorTree &DT, SmallPtrSet<const SCEV *, 16> *LoserRegs) argument 916 RateFormula(const TargetTransformInfo &TTI, const Formula &F, SmallPtrSet<const SCEV *, 16> &Regs, const DenseSet<const SCEV *> &VisitedRegs, const Loop *L, const SmallVectorImpl<int64_t> &Offsets, ScalarEvolution &SE, DominatorTree &DT, const LSRUse &LU, SmallPtrSet<const SCEV *, 16> *LoserRegs) argument 1600 DominatorTree &DT; member in class:__anon2773::LSRInstance [all...] |
/freebsd-10.1-release/contrib/llvm/lib/CodeGen/ |
H A D | MachineSink.cpp | 49 MachineDominatorTree *DT; // Machine dominator tree member in class:__anon2272::MachineSinking 214 if (!DT->dominates(MBB, UseBlock)) 228 DT = &getAnalysis<MachineDominatorTree>(); 257 if (!DT->isReachableFromEntry(&MBB)) return false; 399 if (!DT->dominates(ToBB, *PI)) 649 if (!TryBreak && !DT->dominates(ParentBlock, SuccToSinkTo)) {
|
H A D | GCStrategy.cpp | 274 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>()) 275 DT->DT->recalculate(F);
|
H A D | MachineCSE.cpp | 44 MachineDominatorTree *DT; member in class:__anon2257::MachineCSE 659 DT = &getAnalysis<MachineDominatorTree>(); 660 return PerformCSE(DT->getRootNode());
|
H A D | PeepholeOptimizer.cpp | 105 MachineDominatorTree *DT; // Machine dominator tree member in class:__anon2280::PeepholeOptimizer 248 } else if (Aggressive && DT->dominates(MBB, UseMBB)) { 573 DT = Aggressive ? &getAnalysis<MachineDominatorTree>() : 0;
|
/freebsd-10.1-release/contrib/llvm/include/llvm/Analysis/ |
H A D | RegionInfo.h | 209 DominatorTree *DT; member in class:llvm::Region 244 /// @param DT The dominator tree of the current function. 248 DominatorTree *DT, Region *Parent = 0); 585 DominatorTree *DT; member in class:llvm::RegionInfo
|
H A D | IVUsers.h | 123 DominatorTree *DT; member in class:llvm::IVUsers
|
H A D | AliasAnalysis.h | 482 DominatorTree *DT); 486 uint64_t Size, DominatorTree *DT) { 487 return callCapturesBefore(I, Location(P, Size), DT); 485 callCapturesBefore(const Instruction *I, const Value *P, uint64_t Size, DominatorTree *DT) argument
|
/freebsd-10.1-release/contrib/llvm/include/llvm/Support/ |
H A D | CommandLine.h | 372 template<class DT> 373 void setValue(const DT& /*V*/) {} 424 template<class DT> 425 OptionValue<DataType> &operator=(const DT& V) { 673 template <class DT> 674 void addLiteralOption(const char *Name, const DT &V, const char *HelpStr) { 956 template<class ParserClass, class DT> 957 void printOptionDiff(const Option &O, const generic_parser_base &P, const DT &V, 958 const OptionValue<DT> &Default, size_t GlobalWidth) { 959 OptionValue<DT> O [all...] |
/freebsd-10.1-release/contrib/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCContract.cpp | 54 DominatorTree *DT; member in class:__anon2728::ObjCARCContract 326 DT = &getAnalysis<DominatorTree>(); 461 if (DT->isReachableFromEntry(U) && DT->dominates(Inst, U)) {
|
/freebsd-10.1-release/contrib/llvm/lib/Analysis/ |
H A D | ScalarEvolutionExpander.cpp | 80 assert(SE.DT->dominates(Ret, BIP)); 522 SE.DT->dominates(cast<Instruction>(V), Builder.GetInsertPoint())); 617 DominatorTree &DT) { 622 if (DT.dominates(A->getHeader(), B->getHeader())) return B; 623 if (DT.dominates(B->getHeader(), A->getHeader())) return A; 651 L = PickMostRelevantLoop(L, getRelevantLoop(*I), *SE.DT); 662 *SE.DT); 672 DominatorTree &DT; member in class:__anon2204::LoopCompare 674 explicit LoopCompare(DominatorTree &dt) : DT(dt) {} 685 return PickMostRelevantLoop(LHS.first, RHS.first, DT) ! 616 PickMostRelevantLoop(const Loop *A, const Loop *B, DominatorTree &DT) argument 1580 replaceCongruentIVs(Loop *L, const DominatorTree *DT, SmallVectorImpl<WeakVH> &DeadInsts, const TargetTransformInfo *TTI) argument [all...] |
H A D | RegionPrinter.cpp | 64 static std::string getGraphName(RegionInfo *DT) { argument
|
/freebsd-10.1-release/contrib/llvm/lib/IR/ |
H A D | DebugInfo.cpp | 1014 void DebugInfoFinder::processType(DIType DT) { argument 1015 if (!addType(DT)) 1017 processScope(DT.getContext().resolve(TypeIdentifierMap)); 1018 if (DT.isCompositeType()) { 1019 DICompositeType DCT(DT); 1029 } else if (DT.isDerivedType()) { 1030 DIDerivedType DDT(DT); 1131 bool DebugInfoFinder::addType(DIType DT) { argument 1132 if (!DT) 1135 if (!NodesSeen.insert(DT)) [all...] |
H A D | Dominators.cpp | 72 DT->recalculate(F); 93 DT->print(OS);
|
/freebsd-10.1-release/contrib/llvm/lib/Transforms/IPO/ |
H A D | LoopExtractor.cpp | 90 DominatorTree &DT = getAnalysis<DominatorTree>(); 135 CodeExtractor Extractor(DT, *L);
|
/freebsd-10.1-release/contrib/llvm/tools/clang/lib/AST/ |
H A D | Mangle.cpp | 204 CXXDtorType DT, const BlockDecl *BD, 208 mangleCXXDtor(DD, DT, Out); 203 mangleDtorBlock(const CXXDestructorDecl *DD, CXXDtorType DT, const BlockDecl *BD, raw_ostream &ResStream) argument
|
/freebsd-10.1-release/contrib/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DwarfCompileUnit.h | 367 void constructMemberDIE(DIE &Buffer, DIDerivedType DT); 380 DIE *getOrCreateStaticMemberDIE(DIDerivedType DT);
|
/freebsd-10.1-release/contrib/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 349 F(Func), SE(Se), DL(Dl), TTI(Tti), AA(Aa), LI(Li), DT(Dt), 539 DominatorTree *DT; member in class:__anon2843::BoUpSLP 1662 const DominatorTree *DT; member in class:__anon2843::DTCmp 1665 DTCmp(const DominatorTree *DT) : DT(DT) {} argument 1667 return DT->properlyDominates(A, B); 1709 std::stable_sort(CSEWorkList.begin(), CSEWorkList.end(), DTCmp(DT)); 1718 assert((I == CSEWorkList.begin() || !DT->dominates(*I, *llvm::prior(I))) && 1733 DT 1767 DominatorTree *DT; member in struct:__anon2843::SLPVectorizer [all...] |
H A D | LoopVectorize.cpp | 156 DominatorTree *DT, DataLayout *DL, 159 : OrigLoop(OrigLoop), SE(SE), LI(LI), DT(DT), DL(DL), TLI(TLI), 304 DominatorTree *DT; member in class:__anon2839::InnerLoopVectorizer 353 DominatorTree *DT, DataLayout *DL, 355 InnerLoopVectorizer(OrigLoop, SE, LI, DT, DL, TLI, 1, UnrollFactor) { } 410 DominatorTree *DT, TargetLibraryInfo *TLI) 411 : TheLoop(L), SE(SE), DL(DL), DT(DT), TLI(TLI), 636 DominatorTree *DT; member in class:__anon2839::LoopVectorizationLegality 155 InnerLoopVectorizer(Loop *OrigLoop, ScalarEvolution *SE, LoopInfo *LI, DominatorTree *DT, DataLayout *DL, const TargetLibraryInfo *TLI, unsigned VecWidth, unsigned UnrollFactor) argument 352 InnerLoopUnroller(Loop *OrigLoop, ScalarEvolution *SE, LoopInfo *LI, DominatorTree *DT, DataLayout *DL, const TargetLibraryInfo *TLI, unsigned UnrollFactor) argument 409 LoopVectorizationLegality(Loop *L, ScalarEvolution *SE, DataLayout *DL, DominatorTree *DT, TargetLibraryInfo *TLI) argument 900 DominatorTree *DT; member in struct:__anon2839::LoopVectorize [all...] |