Searched refs:DT (Results 51 - 75 of 117) sorted by relevance

12345

/freebsd-10.3-release/contrib/llvm/lib/Transforms/Scalar/
H A DEarlyCSE.cpp267 DominatorTree *DT; member in class:__anon2766::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 DLoopUnswitch.cpp139 DominatorTree *DT; member in class:__anon2793::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 DCodeGenPrepare.cpp81 DominatorTree *DT; member in class:__anon2753::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 DGVN.cpp110 DominatorTree *DT; member in class:__anon2768::ValueTable
132 void setDomTree(DominatorTree* D) { DT = D; }
349 if (NonLocalDepCall && DT->properlyDominates(I->getBB(), C->getParent())){
589 DominatorTree *DT; member in class:__anon2769::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 DLoopIdiomRecognize.cpp135 DominatorTree *DT; member in class:__anon2778::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 DLoopStrengthReduce.cpp830 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:__anon2789::LSRInstance
[all...]
/freebsd-10.3-release/contrib/llvm/include/llvm/Analysis/
H A DRegionInfo.h209 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 DIVUsers.h123 DominatorTree *DT; member in class:llvm::IVUsers
H A DAliasAnalysis.h482 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.3-release/contrib/llvm/include/llvm/Support/
H A DCommandLine.h372 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.3-release/contrib/llvm/lib/Transforms/ObjCARC/
H A DObjCARCContract.cpp54 DominatorTree *DT; member in class:__anon2744::ObjCARCContract
326 DT = &getAnalysis<DominatorTree>();
461 if (DT->isReachableFromEntry(U) && DT->dominates(Inst, U)) {
/freebsd-10.3-release/contrib/llvm/lib/Analysis/
H A DScalarEvolutionExpander.cpp80 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:__anon2220::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 DRegionPrinter.cpp64 static std::string getGraphName(RegionInfo *DT) { argument
H A DMemoryDependenceAnalysis.cpp91 DT = getAnalysisIfAvailable<DominatorTree>();
519 MR = AA->callCapturesBefore(Inst, MemLoc, DT);
1006 if (!DT) {
1010 } else if (DT->isReachableFromEntry(I->getBB())) {
1058 if (!DT) {
1063 } else if (DT->isReachableFromEntry(BB)) {
/freebsd-10.3-release/contrib/llvm/lib/IR/
H A DDebugInfo.cpp1014 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 DDominators.cpp72 DT->recalculate(F);
93 DT->print(OS);
/freebsd-10.3-release/contrib/llvm/tools/clang/lib/AST/
H A DMangle.cpp204 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.3-release/contrib/llvm/lib/Transforms/IPO/
H A DLoopExtractor.cpp90 DominatorTree &DT = getAnalysis<DominatorTree>();
135 CodeExtractor Extractor(DT, *L);
/freebsd-10.3-release/contrib/llvm/lib/CodeGen/
H A DGCStrategy.cpp274 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>())
275 DT->DT->recalculate(F);
H A DMachineCSE.cpp44 MachineDominatorTree *DT; member in class:__anon2273::MachineCSE
659 DT = &getAnalysis<MachineDominatorTree>();
660 return PerformCSE(DT->getRootNode());
H A DPeepholeOptimizer.cpp105 MachineDominatorTree *DT; // Machine dominator tree member in class:__anon2296::PeepholeOptimizer
248 } else if (Aggressive && DT->dominates(MBB, UseMBB)) {
573 DT = Aggressive ? &getAnalysis<MachineDominatorTree>() : 0;
/freebsd-10.3-release/contrib/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfCompileUnit.h367 void constructMemberDIE(DIE &Buffer, DIDerivedType DT);
380 DIE *getOrCreateStaticMemberDIE(DIDerivedType DT);
/freebsd-10.3-release/contrib/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp349 F(Func), SE(Se), DL(Dl), TTI(Tti), AA(Aa), LI(Li), DT(Dt),
539 DominatorTree *DT; member in class:__anon2859::BoUpSLP
1662 const DominatorTree *DT; member in class:__anon2859::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:__anon2859::SLPVectorizer
[all...]
H A DLoopVectorize.cpp156 DominatorTree *DT, DataLayout *DL,
159 : OrigLoop(OrigLoop), SE(SE), LI(LI), DT(DT), DL(DL), TLI(TLI),
304 DominatorTree *DT; member in class:__anon2855::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:__anon2855::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:__anon2855::LoopVectorize
[all...]
/freebsd-10.3-release/contrib/llvm/lib/Target/PowerPC/
H A DPPCCTRLoops.cpp113 DominatorTree *DT; member in struct:__anon2560::PPCCTRLoops
173 DT = &getAnalysis<DominatorTree>();
458 if (!DT->dominates(*I, *PI)) {

Completed in 326 milliseconds

12345